{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":118,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":118,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"86f574330bbb","filters":{"venue":"Journal of Symbolic Computation"}},"results":[{"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Komei Fukuda","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01052282682822787,"gpt":0.2417820425937021,"spread":0.2312592157654742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003873502,0.0005295219,0.0006035431,0.001257717,0.0009690279,0.001849103,0.001061497,0.0005451618,0.007639201],"category_scores_gemma":[0.002047438,0.0004582727,0.0006264687,0.001091628,0.002093369,0.002804249,0.003676814,0.002392243,0.0007759975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000731441,"about_ca_system_score_gemma":0.0005855726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001594998,"about_ca_topic_score_gemma":0.001918517,"domain_scores_codex":[0.9996737,0.00008199886,0.00001693972,0.00006019143,0.0001236532,0.00004350248],"domain_scores_gemma":[0.9996219,0.0001254194,0.00004609743,0.00007141576,0.00007328832,0.00006186976],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002430131,0.000007910395,0.0001231694,0.00003719592,0.000004718236,0.00004214367,0.00009272373,0.007360604,0.001168229,0.976588,0.00118683,0.01336417],"study_design_scores_gemma":[0.00001218151,0.0000227779,0.0002342455,0.0000205384,0.000008690567,0.0001148476,0.0001037524,0.03751817,0.001223739,0.9446403,0.01608276,0.00001799998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1056553,0.0009788373,0.8045323,0.001148086,0.0004338323,0.00007307932,0.0002469616,0.000333713,0.08659793],"genre_scores_gemma":[0.7541411,0.001910875,0.2074114,0.0004937787,0.0003666848,0.0001173151,0.0004707303,0.0005551676,0.03453297],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007639201,"threshold_uncertainty_score":0.02555567,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994728957","doi":"10.1016/s0747-7171(02)00139-6","title":"On lattice reduction for polynomial matrices","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Eidgenössische Technische Hochschule Zürich","keywords":"Mathematics; Computation; Lattice reduction; Hermite polynomials; Lattice (music); Matrix polynomial; Polynomial; Reduction (mathematics); Canonical form; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm; Mathematical analysis; Geometry","authors":[{"name":"Thom Mulders","is_ca":false},{"name":"Arne Storjohann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01561379415303387,"gpt":0.2677597174106794,"spread":0.2521459232576456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001337986,0.001235544,0.001935111,0.002252127,0.00275705,0.003558917,0.001517362,0.001227193,0.01658939],"category_scores_gemma":[0.00467186,0.0007265637,0.001912956,0.002619604,0.004831592,0.006891341,0.003871492,0.005296752,0.00307139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002035979,"about_ca_system_score_gemma":0.001188953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004028267,"about_ca_topic_score_gemma":0.005358107,"domain_scores_codex":[0.9986076,0.0003836101,0.00005520633,0.000180731,0.0004631415,0.0003096202],"domain_scores_gemma":[0.998157,0.001091409,0.00007355891,0.0002818258,0.0002443217,0.0001519933],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001001692,0.00007873259,0.000153341,0.00006818541,0.00001237492,0.0000602491,0.0002706416,0.003027144,0.0006822172,0.9704736,0.006403846,0.01866946],"study_design_scores_gemma":[0.00001951632,0.00001162824,0.00003410758,0.00001070955,0.00000560133,0.00002232944,0.00004447785,0.005136622,0.0003398203,0.9909639,0.003401189,0.00001003404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.158486,0.004650442,0.5040455,0.01035099,0.002885547,0.0002442375,0.0006868389,0.002155394,0.3164951],"genre_scores_gemma":[0.7691908,0.003278958,0.1400008,0.002252834,0.002200924,0.000283674,0.001347318,0.001396753,0.08004785],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01658939,"threshold_uncertainty_score":0.05549699,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","authors":[{"name":"Erich Kaltofen","is_ca":false},{"name":"Wen-shin Lee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03869791639401308,"gpt":0.3381397188642772,"spread":0.2994418024702641,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01107273,0.001006718,0.002356837,0.00199672,0.002257273,0.003333941,0.002620341,0.002145664,0.008055851],"category_scores_gemma":[0.06206388,0.001208012,0.00144757,0.002361052,0.004121991,0.007805069,0.005965589,0.007449205,0.001719137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001851666,"about_ca_system_score_gemma":0.00240907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001888277,"about_ca_topic_score_gemma":0.003415962,"domain_scores_codex":[0.9926893,0.003209676,0.0003169319,0.0006007285,0.002253602,0.0009296925],"domain_scores_gemma":[0.9338139,0.05293714,0.001366537,0.00620017,0.004560005,0.001122317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003045425,0.0004628089,0.005084739,0.000441936,0.00008663573,0.0002946143,0.001458098,0.09488606,0.00703161,0.642604,0.01164925,0.2329548],"study_design_scores_gemma":[0.0001427484,0.0001732622,0.0002850423,0.00006114896,0.0000448288,0.00008168616,0.0001143941,0.4944142,0.007412942,0.4938906,0.003354341,0.00002472322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05474351,0.0005804217,0.9287015,0.000928527,0.0002002804,0.0001278736,0.0001027978,0.001277149,0.01333784],"genre_scores_gemma":[0.5665001,0.0004937786,0.4116864,0.0006368161,0.0003515193,0.0003311226,0.0005793584,0.001386024,0.0180349],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01107273,"threshold_uncertainty_score":0.05855888,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Joachim von zur Gathen","is_ca":false},{"name":"Daniel Panario","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03254854062645635,"gpt":0.284985279481469,"spread":0.2524367388550126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002463404,0.001091823,0.001766276,0.003426414,0.0008313424,0.002810115,0.001550883,0.00118974,0.004365355],"category_scores_gemma":[0.005589718,0.0009484528,0.001073494,0.00676102,0.002132029,0.01137678,0.002089713,0.002158538,0.001793831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001090704,"about_ca_system_score_gemma":0.00130814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007888096,"about_ca_topic_score_gemma":0.0007378345,"domain_scores_codex":[0.9985341,0.0002719901,0.0001297279,0.000346711,0.0005225082,0.0001948765],"domain_scores_gemma":[0.9965917,0.0020784,0.000201099,0.000697277,0.0003277153,0.0001038111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001528277,0.0001408386,0.001874347,0.002052854,0.00004684358,0.00008436051,0.0003050102,0.00573962,0.001888597,0.2032107,0.008174085,0.7763301],"study_design_scores_gemma":[0.0001145309,0.0004394403,0.001869493,0.001665639,0.00008726791,0.002875074,0.0004020697,0.03027548,0.00825587,0.6770169,0.2768967,0.000101449],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.04060199,0.602387,0.3161567,0.003132272,0.0006356542,0.0001455729,0.0003634045,0.0008870501,0.03569032],"genre_scores_gemma":[0.2085782,0.6179414,0.1609351,0.0009254709,0.002958576,0.0001003159,0.001068146,0.0002837406,0.007209074],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.004365355,"threshold_uncertainty_score":0.01460356,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Shuhong Gao","is_ca":false},{"name":"Joachim von zur Gathen","is_ca":false},{"name":"Daniel Panario","is_ca":true},{"name":"Victor Shoup","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01953647114672561,"gpt":0.2727223051112659,"spread":0.2531858339645403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002713753,0.001391443,0.001464451,0.001957739,0.001725692,0.005716676,0.002421941,0.001900983,0.01274302],"category_scores_gemma":[0.01462632,0.001003711,0.001430533,0.003182033,0.002703309,0.01409723,0.004248234,0.004528051,0.003847548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002237665,"about_ca_system_score_gemma":0.002327973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0011114,"about_ca_topic_score_gemma":0.001587768,"domain_scores_codex":[0.9969487,0.00075591,0.0003893797,0.0005779119,0.0008590021,0.000469152],"domain_scores_gemma":[0.9875231,0.007711784,0.0004229738,0.003042658,0.00103439,0.0002649972],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001001727,0.0002543817,0.001585775,0.0004721462,0.0000977207,0.0001319824,0.0005888465,0.03045342,0.003535858,0.5754663,0.01608353,0.3703284],"study_design_scores_gemma":[0.0002019587,0.00006761234,0.0001758666,0.00009739222,0.0000497839,0.0001542406,0.0001272978,0.08162166,0.005555657,0.9024653,0.009448396,0.0000348819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04139198,0.001704735,0.9355712,0.00186659,0.0003654719,0.0001851261,0.0005267707,0.003491284,0.01489691],"genre_scores_gemma":[0.460257,0.001334755,0.5210101,0.0005770779,0.0004071412,0.0002882289,0.001316837,0.0008080069,0.01400072],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01274302,"threshold_uncertainty_score":0.04262966,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053029682","doi":"10.1016/j.jsc.2011.12.023","title":"Algorithms for computing triangular decomposition of polynomial systems","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Decomposition; Mathematics; Key (lock); Polynomial; Algorithm; Algebra over a field; Theoretical computer science; Computer science; Pure mathematics","authors":[{"name":"Changbo Chen","is_ca":true},{"name":"Marc Moreno Maza","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03919643090636567,"gpt":0.2941856011297759,"spread":0.2549891702234102,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001176164,0.001140555,0.001052651,0.001471108,0.001144313,0.002547206,0.001828408,0.0008817944,0.0208222],"category_scores_gemma":[0.007007956,0.0005945601,0.001361794,0.00225197,0.0009409442,0.003416521,0.002514325,0.002296417,0.004583503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001618657,"about_ca_system_score_gemma":0.001981349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004809504,"about_ca_topic_score_gemma":0.013462,"domain_scores_codex":[0.9990194,0.0001864594,0.00008897221,0.0001911586,0.0002979379,0.0002160293],"domain_scores_gemma":[0.9965436,0.001694864,0.0001484658,0.0007130929,0.0007151264,0.0001848307],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007883709,0.0003347055,0.001744995,0.0005125328,0.0001030859,0.0001437496,0.0004697075,0.1004987,0.008123822,0.2030679,0.02359539,0.6606171],"study_design_scores_gemma":[0.000178185,0.0001157784,0.0002821086,0.00005874293,0.00005930119,0.00008681238,0.0002479489,0.6724374,0.006651343,0.3117379,0.008111553,0.00003285954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02378737,0.00022505,0.9619853,0.0002041063,0.0001129711,0.0001655709,0.0003703405,0.002704181,0.0104451],"genre_scores_gemma":[0.2375579,0.0002801594,0.7521344,0.0001483832,0.00007726673,0.0002521841,0.00218866,0.0005793977,0.006781696],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0208222,"threshold_uncertainty_score":0.06965721,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127412655","doi":"10.1006/jsco.2000.0370","title":"Challenges of Symbolic Computation: My Favorite Open Problems","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Simon Fraser University","keywords":"Symbolic computation; Symbolic-numeric computation; The Symbolic; Computation; Computer science; Mathematics; Theoretical computer science; Algebra over a field; Programming language; Pure mathematics","authors":[{"name":"Erich Kaltofen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03688501806389176,"gpt":0.2866758961192889,"spread":0.2497908780553971,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006080948,0.0008099678,0.001420733,0.001225157,0.003803255,0.008712415,0.002191752,0.005683269,0.01476334],"category_scores_gemma":[0.02217272,0.0004801597,0.0008091053,0.001338761,0.01225724,0.02403476,0.004768551,0.01215737,0.003827157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002242217,"about_ca_system_score_gemma":0.0031373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001252008,"about_ca_topic_score_gemma":0.001232909,"domain_scores_codex":[0.9978144,0.0008622612,0.00008005728,0.0003388292,0.0006665764,0.000237781],"domain_scores_gemma":[0.9856286,0.00988713,0.0003594979,0.001109441,0.001911098,0.001104277],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005866885,0.00008410958,0.0002119257,0.000187747,0.0000162238,0.00004674916,0.0003516739,0.001036028,0.0001209451,0.8261471,0.12886,0.04287875],"study_design_scores_gemma":[0.00001439584,0.000008686443,0.00004831417,0.00007908088,0.000002298037,0.00003397926,0.0003164023,0.001024168,0.0000473047,0.9465539,0.05186052,0.00001089283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.005600624,0.06671026,0.03888152,0.816498,0.01179844,0.00002355356,0.0002675065,0.0001859109,0.06003413],"genre_scores_gemma":[0.413702,0.1548572,0.0814596,0.1070903,0.153523,0.0004211323,0.001113029,0.0006645457,0.08716927],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01476334,"threshold_uncertainty_score":0.04938835,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995653528","doi":"10.1016/s0747-7171(03)00097-x","title":"High-order lifting and integrality certification","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Invertible matrix; Univariate; Dimension (graph theory); Matrix (chemical analysis); Polynomial matrix; Field (mathematics); Matrix multiplication; Ring (chemistry); Correctness; Polynomial; Order (exchange); Multiplication (music); Algebra over a field; Discrete mathematics; Combinatorics; Pure mathematics; Matrix polynomial; Algorithm; Mathematical analysis","authors":[{"name":"Arne Storjohann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01770843685776512,"gpt":0.2537189566302896,"spread":0.2360105197725245,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001734642,0.0004894471,0.0009069143,0.001446225,0.002328065,0.003414404,0.001152868,0.001163959,0.009672829],"category_scores_gemma":[0.009932507,0.0006376025,0.001132976,0.001311412,0.004584922,0.007463978,0.004746639,0.004575293,0.001340441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001330301,"about_ca_system_score_gemma":0.001638931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001622141,"about_ca_topic_score_gemma":0.002009099,"domain_scores_codex":[0.9982764,0.000214109,0.00008974993,0.0003273943,0.000584485,0.0005079639],"domain_scores_gemma":[0.9941453,0.002283452,0.0002541763,0.001965866,0.0009917422,0.0003594853],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001300273,0.00006413092,0.0008254084,0.0000523631,0.000008975972,0.0001776056,0.000346254,0.003109735,0.002519344,0.9553367,0.001995248,0.03543426],"study_design_scores_gemma":[0.00002087044,0.00002224774,0.0002645732,0.0000213931,0.00001737062,0.0001391442,0.00008804868,0.01347394,0.004120712,0.9769534,0.004858519,0.00001976807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1817153,0.0005168807,0.7399249,0.001964356,0.0005295733,0.000127941,0.0002046471,0.001901571,0.07311486],"genre_scores_gemma":[0.9123042,0.0003013891,0.07461641,0.0002551602,0.0002258465,0.00003961876,0.0002229749,0.0002822729,0.01175213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009672829,"threshold_uncertainty_score":0.03235883,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Karin Gatermann","is_ca":true},{"name":"M. Eiswirth","is_ca":false},{"name":"Anke Sensse","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007298646032066711,"gpt":0.2755874443450062,"spread":0.2682887983129395,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009801572,0.0007038427,0.0008460734,0.002989139,0.0008836528,0.001270249,0.0007935797,0.0006399735,0.002490008],"category_scores_gemma":[0.003370581,0.0003700019,0.0008104448,0.0008936973,0.002314348,0.002171271,0.001162742,0.001460118,0.0002793978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001144395,"about_ca_system_score_gemma":0.0006597995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002269516,"about_ca_topic_score_gemma":0.002352647,"domain_scores_codex":[0.99978,0.00009427131,0.00001064473,0.00001868147,0.00004968393,0.00004674193],"domain_scores_gemma":[0.9987405,0.0008402576,0.0001141509,0.0000611682,0.0001105551,0.0001333376],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004072193,0.00004339848,0.0004226062,0.00004527613,0.00002598371,0.00008257953,0.0001947744,0.06838456,0.0007159027,0.9248717,0.000806528,0.004365852],"study_design_scores_gemma":[0.000009951024,0.00001544884,0.0001232987,0.00001053896,0.00001212423,0.00001749763,0.00007644897,0.3427018,0.0002381186,0.656148,0.0006362946,0.00001047877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3764192,0.001979611,0.5749167,0.00155581,0.0003867639,0.0001437491,0.0001713213,0.0003926067,0.04403429],"genre_scores_gemma":[0.9664089,0.0006707566,0.02611603,0.00009266523,0.0002016235,0.00007076886,0.00008366099,0.00007807058,0.006277513],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002989139,"threshold_uncertainty_score":0.008329928,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","authors":[{"name":"Mark Giesbrecht","is_ca":true},{"name":"George Labahn","is_ca":true},{"name":"Wen-shin Lee","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03533795481161242,"gpt":0.3080761204314586,"spread":0.2727381656198462,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006295788,0.0003862627,0.0005752249,0.0007481099,0.0004533694,0.0008657166,0.0005765337,0.0004559005,0.004700074],"category_scores_gemma":[0.004941972,0.0002176453,0.0003319033,0.001491156,0.0007727204,0.001228397,0.001151976,0.001147205,0.0007466399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004747092,"about_ca_system_score_gemma":0.0007631872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001684421,"about_ca_topic_score_gemma":0.003022009,"domain_scores_codex":[0.9996079,0.0001281863,0.00001398946,0.00003081383,0.0001817845,0.00003743863],"domain_scores_gemma":[0.9991086,0.0003505932,0.00008759146,0.0002297168,0.0001847753,0.00003875326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003194375,0.00008359745,0.001087744,0.0001472435,0.00003876902,0.0001594476,0.0001910336,0.3013948,0.01114013,0.4534547,0.004342564,0.2276405],"study_design_scores_gemma":[0.00001269633,0.00002091759,0.0001292875,0.00001295327,0.000005121131,0.00004140178,0.00002192897,0.940142,0.00287312,0.05347977,0.003252178,0.000008629954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04199856,0.000203711,0.9469651,0.0003285935,0.0001627683,0.00002253714,0.00008276622,0.0004035849,0.009832407],"genre_scores_gemma":[0.6993988,0.0004272646,0.2904477,0.0001120044,0.0001598357,0.00004923301,0.0002549667,0.0002752775,0.008875026],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004700074,"threshold_uncertainty_score":0.01572329,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Pierrick Gaudry","is_ca":false},{"name":"Éric Schost","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01778078805688415,"gpt":0.2393396749367503,"spread":0.2215588868798661,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001165275,0.001167235,0.001246022,0.005858652,0.002455081,0.004166416,0.001229473,0.001545662,0.007772913],"category_scores_gemma":[0.005973327,0.00052684,0.0007494825,0.003978583,0.003885719,0.00572118,0.002400195,0.002172561,0.001138239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001741994,"about_ca_system_score_gemma":0.000677052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007535298,"about_ca_topic_score_gemma":0.0009413317,"domain_scores_codex":[0.9989962,0.0002233374,0.00005666651,0.0001428337,0.0003743437,0.0002066376],"domain_scores_gemma":[0.9976352,0.001088808,0.0002982513,0.0004429156,0.0003229638,0.0002117027],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001862896,0.00004087338,0.002768056,0.0001139922,0.00001974535,0.000326136,0.000578841,0.004766689,0.002433659,0.9519575,0.005603972,0.03120422],"study_design_scores_gemma":[0.00001404442,0.00002662418,0.0008895466,0.0000412365,0.00002893698,0.0003407092,0.00009231425,0.01223498,0.002234659,0.9786112,0.005461985,0.00002382483],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.6828666,0.002914603,0.1540996,0.003985941,0.0008538221,0.00009406578,0.0003913594,0.001591866,0.1532021],"genre_scores_gemma":[0.9637616,0.0008423715,0.01536575,0.0001759312,0.0004657471,0.00004740135,0.0001772874,0.0002187821,0.01894514],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.007772913,"threshold_uncertainty_score":0.026003,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021258994","doi":"10.1016/j.jsc.2005.10.002","title":"Fraction-free row reduction of matrices of Ore polynomials","year":2005,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Lethbridge","funders":"","keywords":"Mathematics; Skew; Computation; Reduction (mathematics); Fraction (chemistry); Rank (graph theory); Matrix (chemical analysis); Skew-symmetric matrix; Combinatorics; Discrete mathematics; Pure mathematics; Symmetric matrix; Square matrix; Algorithm; Geometry","authors":[{"name":"Bernhard Beckermann","is_ca":false},{"name":"Howard Cheng","is_ca":true},{"name":"George Labahn","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01198716090260493,"gpt":0.2584773294114341,"spread":0.2464901685088292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003038244,0.0007557113,0.0005956502,0.0006588619,0.000779541,0.001557016,0.0006159677,0.0004322006,0.01040303],"category_scores_gemma":[0.001652048,0.0002642605,0.0007072584,0.0005445023,0.00110376,0.001777169,0.001400642,0.001231467,0.002516743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004566227,"about_ca_system_score_gemma":0.0005687794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008760093,"about_ca_topic_score_gemma":0.001494579,"domain_scores_codex":[0.9995446,0.00006854997,0.00001994028,0.00007990492,0.0001490411,0.0001380092],"domain_scores_gemma":[0.9994013,0.0002363987,0.0000529363,0.0001572662,0.00009361155,0.00005842005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004695614,0.0002039664,0.0006397672,0.0002191897,0.00004716778,0.0004091778,0.0006967002,0.01290393,0.02766992,0.8357323,0.01467861,0.1063297],"study_design_scores_gemma":[0.0000719979,0.0001296005,0.0004502586,0.00002949456,0.00003383826,0.0002932941,0.0001775407,0.02867698,0.02746095,0.928885,0.01374977,0.00004120581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4471043,0.0008307414,0.4497268,0.001129549,0.0006991569,0.0001536103,0.0007480634,0.001985481,0.09762235],"genre_scores_gemma":[0.8846654,0.0004126335,0.06781177,0.0004163534,0.0003242727,0.00006872449,0.0008190009,0.0006198661,0.04486197],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01040303,"threshold_uncertainty_score":0.0348016,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Erich Kaltofen","is_ca":false},{"name":"John P. May","is_ca":true},{"name":"Zhengfeng Yang","is_ca":false},{"name":"Lihong Zhi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02778806671875694,"gpt":0.3559300464458081,"spread":0.3281419797270511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007088789,0.000797678,0.001111371,0.0009529014,0.0004618002,0.001111585,0.0005749517,0.0005786992,0.003927341],"category_scores_gemma":[0.003474547,0.000336131,0.0006721801,0.001158572,0.0006313075,0.001463656,0.0007907411,0.001175506,0.001252333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003958883,"about_ca_system_score_gemma":0.00094893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003233185,"about_ca_topic_score_gemma":0.004210585,"domain_scores_codex":[0.9994961,0.00012962,0.00002212872,0.00004204928,0.0002552448,0.00005478008],"domain_scores_gemma":[0.9991819,0.0003250298,0.00007105079,0.0001531948,0.0002174253,0.00005135799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004101601,0.0001834938,0.001065834,0.0003072704,0.0001327092,0.0002852579,0.0002163233,0.4889563,0.02139729,0.166067,0.005707168,0.3152711],"study_design_scores_gemma":[0.00001289334,0.00002528155,0.00008048707,0.000009826394,0.000008147058,0.00003216044,0.00002167206,0.975009,0.001693464,0.02173086,0.001368988,0.00000721583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01496545,0.0002229911,0.9828405,0.0001050019,0.00007462622,0.00001668675,0.00004475082,0.0002392283,0.00149063],"genre_scores_gemma":[0.3433236,0.0008032183,0.6496348,0.00007793959,0.0001526958,0.00007104159,0.0003189923,0.0001822277,0.005435506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003927341,"threshold_uncertainty_score":0.01313829,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150928761","doi":"10.1016/j.jsc.2011.12.014","title":"Triangular decomposition of semi-algebraic systems","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Decomposition; Mathematics; Algebraic number; Polynomial; Exponential function; Algebra over a field; Triangular matrix; Discrete mathematics; Algorithm; Pure mathematics; Mathematical analysis","authors":[{"name":"Changbo Chen","is_ca":true},{"name":"James H. Davenport","is_ca":false},{"name":"John P. May","is_ca":false},{"name":"Marc Moreno Maza","is_ca":true},{"name":"Bican Xia","is_ca":false},{"name":"Rong Xiao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02228769174550693,"gpt":0.2552590522068215,"spread":0.2329713604613146,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004666418,0.0003613718,0.0006089674,0.0009418807,0.0007743724,0.002042187,0.0006443509,0.0004381671,0.0190213],"category_scores_gemma":[0.001283826,0.0002231732,0.0005811781,0.0006489241,0.001347064,0.001531309,0.0008944998,0.001185874,0.001728052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008937343,"about_ca_system_score_gemma":0.0007656198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002272793,"about_ca_topic_score_gemma":0.003165529,"domain_scores_codex":[0.9995936,0.00006568372,0.00002860826,0.00006339118,0.0001446231,0.0001041262],"domain_scores_gemma":[0.9991964,0.0001874948,0.00007864276,0.0001122168,0.0003070596,0.000118317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005078852,0.00002885823,0.0001595533,0.00003191124,0.000008176863,0.00005099552,0.0002174515,0.005029409,0.001715395,0.9822308,0.001718554,0.008758005],"study_design_scores_gemma":[0.00001624839,0.00002489781,0.0001218841,0.00001087224,0.000006921216,0.00004430315,0.0001252035,0.06511495,0.0007685219,0.930144,0.003611812,0.00001024968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2575053,0.0004173087,0.6217909,0.0006208066,0.000318963,0.0001429526,0.0007536481,0.000475219,0.117975],"genre_scores_gemma":[0.9155173,0.0003118993,0.05270156,0.0001681862,0.0001546817,0.00009668534,0.0008181356,0.0001562019,0.03007533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0190213,"threshold_uncertainty_score":0.06363261,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141336296","doi":"10.1016/j.jsc.2006.02.001","title":"Normal forms for general polynomial matrices","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Matrix polynomial; Polynomial matrix; Matrix (chemical analysis); Computation; Hermite polynomials; Polynomial; Algebra over a field; Pure mathematics; Discrete mathematics; Mathematical analysis; Algorithm","authors":[{"name":"Bernhard Beckermann","is_ca":false},{"name":"George Labahn","is_ca":true},{"name":"Gilles Villard","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00823453275827883,"gpt":0.2427618850814545,"spread":0.2345273523231757,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001192641,0.00135716,0.0009155366,0.002506182,0.001627372,0.00449518,0.001163205,0.001208731,0.01857729],"category_scores_gemma":[0.004815165,0.0006349988,0.0007921325,0.001865026,0.003263997,0.007449318,0.001925121,0.002857446,0.003480646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001571376,"about_ca_system_score_gemma":0.00104553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001334639,"about_ca_topic_score_gemma":0.001792573,"domain_scores_codex":[0.9988434,0.0002468676,0.00007488842,0.0002353097,0.0004153465,0.0001842036],"domain_scores_gemma":[0.9982962,0.0005025465,0.0001642552,0.0002349212,0.000565563,0.0002366528],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002786959,0.00002430586,0.0000841073,0.00001487946,0.0000031518,0.00004511261,0.0001819275,0.000413263,0.0005081046,0.990844,0.001628303,0.006224982],"study_design_scores_gemma":[0.00001080642,0.00001106457,0.00003661612,0.000004078453,0.000002008718,0.00006758181,0.00004901798,0.003010344,0.0002722729,0.9941723,0.002354189,0.000009816235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2674478,0.0009777058,0.4945799,0.003421016,0.001697055,0.0003473098,0.001062206,0.001264472,0.2292026],"genre_scores_gemma":[0.8407971,0.00107429,0.05646992,0.00058535,0.0009503457,0.000242636,0.0009443094,0.0006117334,0.09832419],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01857729,"threshold_uncertainty_score":0.0621472,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Changbo Chen","is_ca":false},{"name":"Marc Moreno Maza","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0341643223409559,"gpt":0.3701513871499987,"spread":0.3359870648090428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007376648,0.0004797342,0.000996988,0.001391875,0.0009279887,0.001717488,0.00080551,0.0003920494,0.005368328],"category_scores_gemma":[0.002240684,0.0003881506,0.001454935,0.001036867,0.001635134,0.002258209,0.001880375,0.001343357,0.0009058689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006407941,"about_ca_system_score_gemma":0.001082152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002139821,"about_ca_topic_score_gemma":0.003481128,"domain_scores_codex":[0.9992893,0.0001315777,0.00004999308,0.0001329715,0.0002496407,0.0001464184],"domain_scores_gemma":[0.999195,0.0003418348,0.00006391347,0.0001513844,0.0001873535,0.00006041392],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001792733,0.00006611803,0.0004625034,0.000126036,0.00004368123,0.0002021487,0.0002334395,0.02030436,0.009521156,0.9119844,0.002115024,0.05476188],"study_design_scores_gemma":[0.00004016226,0.00005966744,0.0002065891,0.00003900769,0.00005026333,0.0001286742,0.00006718894,0.1516401,0.005491151,0.8357248,0.006513057,0.00003928282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05631387,0.0002028649,0.930665,0.0002155309,0.00009423314,0.00007693637,0.0001886367,0.000716798,0.01152616],"genre_scores_gemma":[0.5624487,0.0003232732,0.4258581,0.0001884201,0.0001141717,0.0001009329,0.0005555999,0.0003996131,0.01001109],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005368328,"threshold_uncertainty_score":0.01795882,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"David H. Bailey","is_ca":false},{"name":"Jonathan M. Borwein","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02511251533703866,"gpt":0.3043765023234904,"spread":0.2792639869864517,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01147058,0.0009790647,0.002500325,0.001508386,0.001033314,0.006411951,0.00415234,0.00386345,0.007072995],"category_scores_gemma":[0.02402678,0.0007670822,0.0006584445,0.003052338,0.004830943,0.01098974,0.003724395,0.005978284,0.003555818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00130003,"about_ca_system_score_gemma":0.002484882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001044907,"about_ca_topic_score_gemma":0.001104843,"domain_scores_codex":[0.9960949,0.0008997262,0.0001856014,0.000377649,0.002247153,0.0001950288],"domain_scores_gemma":[0.9778021,0.01294603,0.000537548,0.002379193,0.005515348,0.0008198153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005829232,0.0002653367,0.00216106,0.003009402,0.000133768,0.0001149556,0.0005749392,0.02235631,0.003404546,0.3746912,0.03888911,0.5538164],"study_design_scores_gemma":[0.000211821,0.0002488646,0.001271882,0.001222128,0.00009034826,0.0003300406,0.0007543749,0.1711278,0.00413753,0.6555912,0.1648704,0.0001435697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.03440129,0.5006759,0.3404361,0.06986557,0.005024377,0.00007901775,0.0003184751,0.002061132,0.04713817],"genre_scores_gemma":[0.3955154,0.3004449,0.2687475,0.005216229,0.01182184,0.000215939,0.0006679209,0.0008231589,0.01654717],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.01147058,"threshold_uncertainty_score":0.06066298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985924702","doi":"10.1016/j.jsc.2013.03.004","title":"On the complexity of the generalized MinRank problem","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Institut Universitaire de France; Agence Nationale de la Recherche","keywords":"Mathematics; Rank (graph theory); Bounded function; Computational complexity theory; Polynomial; Matrix (chemical analysis); Ideal (ethics); Variety (cybernetics); Discrete mathematics; Representation (politics); Algebraic number; Algebra over a field; Combinatorics; Algorithm; Pure mathematics","authors":[{"name":"Jean‐Charles Faugère","is_ca":false},{"name":"Mohab Safey El Din","is_ca":false},{"name":"Pierre-Jean Spaenlehauer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03037903373116636,"gpt":0.2429758271014958,"spread":0.2125967933703294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002337298,0.001103578,0.002369239,0.001481755,0.002057161,0.006614951,0.002888037,0.002449201,0.01912795],"category_scores_gemma":[0.02073916,0.0006432137,0.001457207,0.002832532,0.003648761,0.01576743,0.003770524,0.004612048,0.001654078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002717564,"about_ca_system_score_gemma":0.002566688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00343304,"about_ca_topic_score_gemma":0.004648471,"domain_scores_codex":[0.9965101,0.001107938,0.0001598518,0.0006026232,0.0009772892,0.0006421088],"domain_scores_gemma":[0.9765595,0.01899292,0.001150517,0.001762426,0.0008745615,0.0006601691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008911971,0.0002579833,0.002447698,0.0005157755,0.0001115767,0.0003143153,0.0005644181,0.08145178,0.001711702,0.847187,0.01955597,0.04499066],"study_design_scores_gemma":[0.00006657338,0.00002353135,0.0002957388,0.00001941095,0.00001944934,0.00007742395,0.00008826877,0.0740661,0.0003116418,0.9237812,0.001231349,0.00001920593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.559119,0.004000023,0.2867317,0.02366892,0.0007127692,0.0002550562,0.002998765,0.001171866,0.1213417],"genre_scores_gemma":[0.9379395,0.001431597,0.04186559,0.0009403544,0.0009447157,0.0001916892,0.00184373,0.0003732865,0.01446957],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01912795,"threshold_uncertainty_score":0.0639894,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mathias Soeken","is_ca":false},{"name":"Laura Tague","is_ca":false},{"name":"Gerhard W. Dueck","is_ca":true},{"name":"Rolf Drechsler","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02452229376098022,"gpt":0.2777579480126667,"spread":0.2532356542516865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005416981,0.0004309223,0.0006561549,0.0004277656,0.000647485,0.001097503,0.0007382636,0.0006509799,0.00471245],"category_scores_gemma":[0.001554146,0.000307624,0.0005265611,0.0003779304,0.0008993196,0.001239802,0.0008473772,0.0009529287,0.0006586812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007264657,"about_ca_system_score_gemma":0.0007972677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000384634,"about_ca_topic_score_gemma":0.001051102,"domain_scores_codex":[0.9996268,0.0001235615,0.00002239809,0.0000618706,0.0001084496,0.00005694202],"domain_scores_gemma":[0.9991322,0.0005676223,0.00004475082,0.0001462125,0.00006629112,0.00004286121],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003542358,0.0001508153,0.0002742752,0.0002962233,0.00006804486,0.0001481476,0.0001459404,0.07456204,0.04436295,0.8091016,0.001878397,0.06865726],"study_design_scores_gemma":[0.0001358672,0.0001491403,0.0001623415,0.00006641182,0.00005503901,0.00009498277,0.00003398901,0.4135492,0.06053196,0.5148497,0.01032315,0.00004814737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1883265,0.001117087,0.7607819,0.0008170761,0.000343585,0.0001578513,0.0002973353,0.001238788,0.04691988],"genre_scores_gemma":[0.8984658,0.0002214049,0.09713533,0.0001000531,0.00003907999,0.00009057308,0.0001110801,0.0001012773,0.003735443],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00471245,"threshold_uncertainty_score":0.01576477,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113737071","doi":"10.1016/j.jsc.2010.08.014","title":"Sparse polynomial division using a heap","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Heap (data structure); Mathematics; Maple; Multiplication (music); Polynomial; Division (mathematics); Discrete mathematics; Algebra over a field; Arithmetic; Combinatorics; Algorithm; Pure mathematics","authors":[{"name":"Michael Monagan","is_ca":true},{"name":"Roman Pearce","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01838944544608744,"gpt":0.2752023028350068,"spread":0.2568128573889193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005263752,0.0004859899,0.001098693,0.001267184,0.001402942,0.001945495,0.001458687,0.0006452411,0.01105825],"category_scores_gemma":[0.002015362,0.0004777541,0.0006589517,0.002826072,0.000904327,0.00488132,0.003554892,0.0008638654,0.001956117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009408959,"about_ca_system_score_gemma":0.001438759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001520729,"about_ca_topic_score_gemma":0.004194491,"domain_scores_codex":[0.999437,0.00008981152,0.00004840267,0.0001190731,0.0001678183,0.0001378581],"domain_scores_gemma":[0.998745,0.0003855889,0.00006683956,0.0005850823,0.0001415789,0.00007601905],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002015796,0.0003453683,0.002062778,0.0004354421,0.0001047746,0.0002317981,0.0005195174,0.01792379,0.0387537,0.3392244,0.01836745,0.5800151],"study_design_scores_gemma":[0.0006638627,0.0005353247,0.001228012,0.0001620966,0.0003365476,0.0005173991,0.0003486525,0.2235718,0.09883837,0.5995222,0.07413945,0.000136341],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1272104,0.0008545148,0.8349231,0.0005095376,0.0003439067,0.0001303526,0.0004567252,0.008161889,0.02740951],"genre_scores_gemma":[0.5702125,0.0004237712,0.4106682,0.0002307887,0.0002029746,0.000119547,0.0005325429,0.000700158,0.01690947],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01105825,"threshold_uncertainty_score":0.0369935,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091909596","doi":"10.1016/j.jsc.2010.08.016","title":"The modpn library: Bringing fast polynomial arithmetic into Maple","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Maple; Arithmetic; Polynomial; Algebra over a field; Pure mathematics; Botany","authors":[{"name":"Xin Li","is_ca":true},{"name":"Marc Moreno Maza","is_ca":true},{"name":"Raqeeb Rasheed","is_ca":true},{"name":"Éric Schost","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004614438534023594,"gpt":0.2208467436048269,"spread":0.2162323050708033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001121969,0.001946562,0.001566036,0.002128192,0.001024227,0.003095455,0.003849577,0.001134227,0.06752293],"category_scores_gemma":[0.006732198,0.001493505,0.001654748,0.002266447,0.0009781249,0.006158385,0.004295003,0.002826884,0.03409825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001064202,"about_ca_system_score_gemma":0.001387825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001693679,"about_ca_topic_score_gemma":0.002514313,"domain_scores_codex":[0.9984702,0.0002125129,0.00009694074,0.0003228632,0.0006711225,0.0002263983],"domain_scores_gemma":[0.9978741,0.0007113846,0.00008925711,0.0007731158,0.0004252503,0.0001268486],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001308677,0.0002541591,0.001619427,0.0008820151,0.0001969552,0.0003853711,0.0004232643,0.008211272,0.01367634,0.07902095,0.2466661,0.6473555],"study_design_scores_gemma":[0.0008117726,0.0003570451,0.000947965,0.000353462,0.0002171811,0.0005750856,0.0001559411,0.18593,0.09250274,0.2825384,0.4353053,0.0003049984],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.005527844,0.0007218986,0.6893837,0.0003179047,0.0004263558,0.0001204451,0.002280902,0.2755933,0.02562756],"genre_scores_gemma":[0.1674761,0.00130098,0.6802059,0.001404374,0.0007045476,0.0006497261,0.01162255,0.09437667,0.04225907],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.06752293,"threshold_uncertainty_score":0.2258867,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067539682","doi":"10.1016/j.jsc.2011.09.006","title":"Triangular <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>x</mml:mi></mml:math>-basis decompositions and derandomization of linear algebra algorithms over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mstyle mathvariant=\"sans-serif\"><mml:mi>K</mml:mi></mml:mstyle><mml:mrow><mml:mo>[</mml:mo><mml:mi>x</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math>","year":2011,"lang":"lv","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Invertible matrix; Degree (music); Basis (linear algebra); Factorization; Polynomial; Prime (order theory); Discrete mathematics; Algorithm; Finite field; Linearization; Linear system; Combinatorics; Pure mathematics; Mathematical analysis; Geometry; Nonlinear system","authors":[{"name":"Somit Gupta","is_ca":true},{"name":"Soumojit Sarkar","is_ca":true},{"name":"Arne Storjohann","is_ca":true},{"name":"Johnny Valeriote","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01625062571401865,"gpt":0.2422754805109378,"spread":0.2260248547969192,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001145742,0.0008152789,0.0006778135,0.001388783,0.0009643363,0.00384652,0.001293365,0.0008797542,0.2680255],"category_scores_gemma":[0.006349172,0.0005801194,0.0008926556,0.002287124,0.0007948535,0.004494634,0.001841123,0.002113044,0.1591586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001927168,"about_ca_system_score_gemma":0.001307003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005489967,"about_ca_topic_score_gemma":0.007815441,"domain_scores_codex":[0.9990246,0.0002251104,0.00007421818,0.0001879814,0.0003522181,0.0001358611],"domain_scores_gemma":[0.9975312,0.0007306676,0.0001398004,0.0007857062,0.0006607985,0.0001517145],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003106856,0.00006260463,0.0005873592,0.0003241432,0.00002493941,0.0001007552,0.0002224487,0.004471065,0.004778276,0.2790124,0.595779,0.1143264],"study_design_scores_gemma":[0.000111705,0.00005030983,0.001024636,0.0001340415,0.000028392,0.0002324833,0.0001560658,0.03523295,0.01811817,0.2447497,0.7000881,0.00007353882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008106232,0.0006121082,0.4821756,0.004614054,0.0008499483,0.000224768,0.02255725,0.04954214,0.4313179],"genre_scores_gemma":[0.1835691,0.001940509,0.211585,0.002324036,0.0007350284,0.0005235776,0.0679273,0.0544176,0.4769778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2680255,"threshold_uncertainty_score":0.8966346,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Claude-Pierre Jeannerod","is_ca":false},{"name":"Clément Pernet","is_ca":false},{"name":"Arne Storjohann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006337541460843982,"gpt":0.2679057101270298,"spread":0.2615681686661858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002360086,0.001204995,0.001374117,0.001827062,0.001623271,0.002641014,0.001614111,0.001196939,0.005425065],"category_scores_gemma":[0.01114666,0.0005474315,0.000937311,0.002137304,0.003520935,0.003921356,0.00277418,0.002603366,0.001398956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001022372,"about_ca_system_score_gemma":0.002210745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001932345,"about_ca_topic_score_gemma":0.002332172,"domain_scores_codex":[0.9982644,0.000652873,0.00005155676,0.0001937577,0.0005377823,0.000299676],"domain_scores_gemma":[0.9966835,0.00134246,0.000307971,0.00077815,0.0006417375,0.000246218],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001091206,0.00003517738,0.000274162,0.00005209024,0.0000172471,0.00008723257,0.0001102424,0.01131238,0.0007228514,0.9680274,0.005361391,0.0138907],"study_design_scores_gemma":[0.00001449036,0.00002183366,0.0001534539,0.00002209697,0.00001021395,0.0001210431,0.00004588929,0.1257183,0.001045522,0.8708159,0.002000139,0.00003117359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07353813,0.0009410093,0.896601,0.001874387,0.0003453299,0.00008736021,0.0005272224,0.0004876048,0.025598],"genre_scores_gemma":[0.8089651,0.001440654,0.1612571,0.001128601,0.0007480322,0.000176137,0.0007555595,0.0004110963,0.02511775],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005425065,"threshold_uncertainty_score":0.01814866,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162009465","doi":"10.1016/s0747-7171(03)00090-7","title":"Factoring systems of linear PDEs with finite-dimensional solution spaces","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Dimension (graph theory); Finite set; Partial differential equation; Rational function; Space (punctuation); Linear system; Function (biology); Finite difference; Mathematical analysis; Applied mathematics; Pure mathematics","authors":[{"name":"Ziming Li","is_ca":true},{"name":"Fritz Schwarz","is_ca":false},{"name":"S. P. Tsarëv","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01902480920046189,"gpt":0.2428876335570685,"spread":0.2238628243566066,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001026068,0.0008773165,0.001023986,0.001099953,0.0009730689,0.002756714,0.001065322,0.001106779,0.009943636],"category_scores_gemma":[0.004461022,0.0005414235,0.001115396,0.0006987473,0.002751546,0.003422932,0.003191658,0.001497174,0.001099803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001252622,"about_ca_system_score_gemma":0.0007738309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002267973,"about_ca_topic_score_gemma":0.002606544,"domain_scores_codex":[0.999154,0.0002198443,0.00007042957,0.0001664585,0.0002418825,0.0001474209],"domain_scores_gemma":[0.9984533,0.0006227743,0.0002063284,0.0002371852,0.0003226306,0.0001578437],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001348455,0.00008925026,0.0007633911,0.0001291145,0.00005113314,0.0001831466,0.0004776674,0.06708095,0.004932277,0.8827487,0.001767205,0.04164241],"study_design_scores_gemma":[0.00004581912,0.00006999933,0.0001803413,0.00002621518,0.00002134142,0.00008030747,0.0001466033,0.2660859,0.002452412,0.7251205,0.005740596,0.00002986741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1436068,0.0006209029,0.8349547,0.0004824263,0.0002375207,0.00009221881,0.0001583725,0.0007453727,0.0191018],"genre_scores_gemma":[0.8266672,0.0005929821,0.1547637,0.0001490992,0.0001966944,0.0001176334,0.0003718973,0.0003113598,0.01682945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009943636,"threshold_uncertainty_score":0.03326476,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1968315351","doi":"10.1006/jsco.2001.0456","title":"Commutative Algebra in the Mizar System","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Generalization; Mathematics; Algebra over a field; Formal power series; Power series; Commutative property; Algebraic number; Basis (linear algebra); Discrete mathematics; Pure mathematics; Geometry","authors":[{"name":"Piotr Rudnicki","is_ca":true},{"name":"Christoph Schwarzweller","is_ca":false},{"name":"Andrzej Trybulec","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01556430286456721,"gpt":0.2565066795700707,"spread":0.2409423767055035,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001751883,0.0003216162,0.001046073,0.001096673,0.003047228,0.00420849,0.0007292812,0.0007643204,0.009446145],"category_scores_gemma":[0.002928481,0.0004910661,0.0007410379,0.0012306,0.003636484,0.006116328,0.002214459,0.002117543,0.002723409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001315672,"about_ca_system_score_gemma":0.0009641998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007538537,"about_ca_topic_score_gemma":0.0009359086,"domain_scores_codex":[0.9982474,0.0006429603,0.0001092021,0.0002965906,0.0004655259,0.0002383593],"domain_scores_gemma":[0.9982188,0.0007834088,0.000171151,0.0002460248,0.0004122223,0.0001684132],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002607403,0.0000087733,0.00009132944,0.00001947725,0.000006616146,0.00004153597,0.0001294498,0.0002528031,0.0003787395,0.9953241,0.00108019,0.002640956],"study_design_scores_gemma":[0.00001552308,0.00001315241,0.0001211206,0.000004890698,0.00001025262,0.0001158522,0.00005028452,0.002198719,0.0006636605,0.9901767,0.006617834,0.00001213],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2209763,0.005242806,0.5436987,0.007367509,0.00110453,0.0001084074,0.0008088799,0.001211462,0.2194815],"genre_scores_gemma":[0.8959053,0.001352899,0.07151998,0.001174171,0.001008691,0.0001038794,0.0003814438,0.0002572429,0.0282964],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009446145,"threshold_uncertainty_score":0.03160048,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Wei Zhou","is_ca":true},{"name":"George Labahn","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04028607635485304,"gpt":0.2782715342282155,"spread":0.2379854578733624,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001333644,0.001242848,0.001566197,0.001948831,0.001517329,0.003536185,0.002068243,0.001397499,0.01216368],"category_scores_gemma":[0.007990655,0.0008329275,0.001221256,0.003185476,0.001844166,0.005355988,0.00352198,0.004134789,0.004153505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001906033,"about_ca_system_score_gemma":0.002072537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001749614,"about_ca_topic_score_gemma":0.003493557,"domain_scores_codex":[0.9982219,0.0004463287,0.000110158,0.0002149579,0.0007202539,0.0002863237],"domain_scores_gemma":[0.9967518,0.001511534,0.0001004426,0.001125929,0.0003907691,0.0001196113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003562194,0.0001876151,0.0004324483,0.000173953,0.00004902196,0.0000514081,0.0002417056,0.02542833,0.003006611,0.6816602,0.01458367,0.2738288],"study_design_scores_gemma":[0.00009584886,0.00003651238,0.00008740431,0.00002731528,0.00002209535,0.00004119791,0.00004550444,0.1076819,0.002185124,0.8833323,0.006424969,0.0000198703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02341248,0.0008682473,0.9499494,0.0008825781,0.0003082447,0.0001542358,0.000339711,0.002285255,0.02179983],"genre_scores_gemma":[0.3154993,0.0009934308,0.6635072,0.0004015872,0.0003054906,0.0004659493,0.001142803,0.0009294068,0.01675498],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01216368,"threshold_uncertainty_score":0.04069155,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"P.P Boyle","is_ca":true},{"name":"Weidong Tian","is_ca":true},{"name":"Fred Guan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04762609303254539,"gpt":0.2392678023261504,"spread":0.191641709293605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001161854,0.0006259549,0.00143315,0.001233945,0.0005398554,0.002403687,0.000623407,0.001803727,0.002989911],"category_scores_gemma":[0.00507094,0.000471188,0.0007086333,0.00137516,0.002407791,0.003236886,0.001084029,0.002621143,0.0007311312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001301544,"about_ca_system_score_gemma":0.001388047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003230953,"about_ca_topic_score_gemma":0.00179255,"domain_scores_codex":[0.9995378,0.0002022849,0.00003175081,0.00005167179,0.000146416,0.00003009892],"domain_scores_gemma":[0.9987032,0.0007679807,0.0001142416,0.0001339173,0.0002189931,0.0000616613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005334569,0.00000561373,0.00008550692,0.00003063425,0.000007441382,0.00001930094,0.00003859175,0.01312594,0.000204261,0.9815113,0.001343293,0.003622847],"study_design_scores_gemma":[0.000006950863,0.000004541131,0.00008901009,0.00001145071,0.000004441828,0.00001823884,0.00001210435,0.1124185,0.00008410429,0.8843027,0.003039111,0.000008883374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05306092,0.02443266,0.8531305,0.01361249,0.002044969,0.00005420479,0.0004028048,0.0003085085,0.05295306],"genre_scores_gemma":[0.8355392,0.0161387,0.115845,0.001067447,0.002799873,0.0001673675,0.0004457009,0.0002375086,0.02775917],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003230953,"threshold_uncertainty_score":0.01000226,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Thom Mulders","is_ca":false},{"name":"Arne Storjohann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01910865744391746,"gpt":0.247866008538078,"spread":0.2287573510941605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00195087,0.000902635,0.001210855,0.0009189112,0.00165003,0.003154098,0.002267591,0.001260105,0.03671534],"category_scores_gemma":[0.01200068,0.0009389346,0.0009533442,0.001274091,0.002001133,0.004938438,0.004670608,0.003271821,0.0057486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001902864,"about_ca_system_score_gemma":0.005773882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00359149,"about_ca_topic_score_gemma":0.01053304,"domain_scores_codex":[0.9952753,0.0009459329,0.0002346664,0.0009586521,0.001781381,0.00080413],"domain_scores_gemma":[0.9888537,0.003927821,0.0003556946,0.004352641,0.002198102,0.0003121071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001681417,0.0007952223,0.003296539,0.0006890981,0.0001406568,0.0003059631,0.0005868401,0.04350911,0.0169393,0.4064263,0.08921956,0.4364099],"study_design_scores_gemma":[0.0006823171,0.0003127119,0.001111839,0.0001206991,0.0001455348,0.0003850187,0.0004377915,0.2635745,0.05543362,0.6401888,0.03752997,0.0000773108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1255517,0.0005648565,0.7335333,0.004546602,0.0007016909,0.0005762432,0.00233853,0.02338969,0.1087974],"genre_scores_gemma":[0.7568533,0.0001888076,0.2036121,0.0009128447,0.0002628182,0.0001871544,0.003698298,0.001436665,0.03284806],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03671534,"threshold_uncertainty_score":0.1228251,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","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","authors":[{"name":"Martin Helmer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03570938565556282,"gpt":0.2803582581094652,"spread":0.2446488724539024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001757146,0.001567457,0.001137227,0.003242241,0.001120509,0.003765719,0.002727938,0.001544851,0.009973273],"category_scores_gemma":[0.01024606,0.0006830631,0.001031201,0.002302253,0.001466616,0.005877897,0.002927095,0.002490696,0.001859974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002079081,"about_ca_system_score_gemma":0.002260375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002140548,"about_ca_topic_score_gemma":0.005737997,"domain_scores_codex":[0.9991174,0.0001845429,0.0000697187,0.0002173812,0.0002614518,0.0001495488],"domain_scores_gemma":[0.9955561,0.002538302,0.0003316792,0.000730927,0.0005262589,0.0003167529],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001054464,0.000532256,0.01187267,0.0004601295,0.0002638137,0.0002044837,0.0006794216,0.1437444,0.01030908,0.2894717,0.01685018,0.5245575],"study_design_scores_gemma":[0.0002304247,0.0001259725,0.001716816,0.0000474753,0.00007626021,0.0001172566,0.0002346859,0.5521736,0.006001091,0.4344047,0.00482158,0.00005007438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1662809,0.0008098705,0.81607,0.0008050808,0.0001911645,0.0001781803,0.0006104251,0.004202054,0.01085227],"genre_scores_gemma":[0.5304751,0.0003859863,0.4594825,0.0001500265,0.0001800684,0.0002378224,0.002161636,0.0006472605,0.006279806],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009973273,"threshold_uncertainty_score":0.03336388,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Xin Li","is_ca":true},{"name":"Marc Moreno Maza","is_ca":true},{"name":"Éric Schost","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01841519542273096,"gpt":0.2825801867988816,"spread":0.2641649913761507,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002696649,0.001236543,0.001468153,0.001821752,0.001730053,0.006220977,0.004154067,0.002010125,0.03602001],"category_scores_gemma":[0.01902125,0.001087867,0.001083366,0.00376095,0.002500822,0.01160342,0.003455158,0.003960404,0.009432795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002506888,"about_ca_system_score_gemma":0.002715253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00220519,"about_ca_topic_score_gemma":0.003486957,"domain_scores_codex":[0.9958981,0.001031255,0.000218749,0.0006870702,0.001788711,0.0003760502],"domain_scores_gemma":[0.9872057,0.005844118,0.0003351932,0.004471042,0.001810643,0.0003331921],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005941585,0.0001343225,0.0009220841,0.0005971545,0.00005352809,0.00009672334,0.0003698775,0.01721261,0.004135496,0.4773577,0.02373042,0.474796],"study_design_scores_gemma":[0.000141301,0.0001562526,0.0002038915,0.0003078442,0.00004665439,0.0002957981,0.0002319056,0.1444948,0.008596056,0.7996121,0.04584536,0.00006818239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0119146,0.003469758,0.9449517,0.001349729,0.0003539902,0.0001327946,0.0002412296,0.005190034,0.03239626],"genre_scores_gemma":[0.2732733,0.003119888,0.7097268,0.0007137705,0.0005953649,0.0002926047,0.0006585377,0.001410107,0.01020961],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03602001,"threshold_uncertainty_score":0.120499,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ştefan O. Tohaˇneanu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01318206969507329,"gpt":0.2990532433500757,"spread":0.2858711736550024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001591155,0.0009508477,0.001151154,0.002317892,0.001190755,0.001381409,0.002397502,0.001260501,0.008430359],"category_scores_gemma":[0.00810059,0.0004779595,0.001053483,0.002536941,0.00220266,0.003353884,0.002698904,0.002948252,0.00236922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001290423,"about_ca_system_score_gemma":0.001601114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003045896,"about_ca_topic_score_gemma":0.004375765,"domain_scores_codex":[0.9991591,0.0003190446,0.0000437482,0.0001253222,0.0002828325,0.0000699989],"domain_scores_gemma":[0.99861,0.0008377069,0.00005326183,0.0002089669,0.0002355728,0.00005446643],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002783185,0.00007550132,0.0005173493,0.0002806204,0.00007188368,0.00007955333,0.0002506844,0.07958584,0.005880755,0.5959657,0.007325286,0.3096884],"study_design_scores_gemma":[0.00006990168,0.00007370848,0.0002386816,0.00005126231,0.00003000462,0.00009579398,0.00005728778,0.418993,0.004065031,0.5634351,0.01283458,0.0000557527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009035482,0.0006137834,0.9805283,0.0003979597,0.0001915551,0.00005293377,0.00007266728,0.000336528,0.008770661],"genre_scores_gemma":[0.1319425,0.0008461079,0.8534581,0.0003201011,0.0001778569,0.0002363671,0.0002384346,0.000478608,0.01230194],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008430359,"threshold_uncertainty_score":0.02820235,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Andrew Arnold","is_ca":true},{"name":"Mark Giesbrecht","is_ca":true},{"name":"Daniel S. Roche","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.046147414931284,"gpt":0.2875589054670081,"spread":0.2414114905357241,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007204737,0.0008214528,0.001135089,0.0009769073,0.0004810056,0.001004047,0.001231703,0.0005681961,0.01485367],"category_scores_gemma":[0.004538091,0.0003989751,0.0007430101,0.001747951,0.000539256,0.00230057,0.001635906,0.001652889,0.002291649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007794292,"about_ca_system_score_gemma":0.001122375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002663618,"about_ca_topic_score_gemma":0.007452622,"domain_scores_codex":[0.9991986,0.0001708831,0.00003313289,0.0001215957,0.0003282976,0.0001475346],"domain_scores_gemma":[0.9981104,0.0009011488,0.0001386617,0.0004814058,0.0002814576,0.00008685562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00130994,0.0004228754,0.001752221,0.0003908704,0.00008790693,0.0002129239,0.0003028894,0.194159,0.02162362,0.1149093,0.01319213,0.6516362],"study_design_scores_gemma":[0.0001058442,0.0001715812,0.0003703822,0.00002582068,0.00002577069,0.00008114146,0.00007349182,0.9349139,0.0128462,0.0452188,0.006143372,0.0000236285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08423921,0.0002068814,0.8994327,0.0001941454,0.0000794122,0.0000928474,0.0002749186,0.004856139,0.01062371],"genre_scores_gemma":[0.5979602,0.000185805,0.3893079,0.0001232513,0.00009190288,0.0001211971,0.0008772332,0.001023772,0.01030875],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01485367,"threshold_uncertainty_score":0.04969054,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Sebastian Pauli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01535870478672349,"gpt":0.266425918010283,"spread":0.2510672132235596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009500436,0.0009261033,0.001069989,0.001476709,0.001373695,0.002232818,0.0005718382,0.0006469567,0.009590221],"category_scores_gemma":[0.003984571,0.0004922574,0.0007654469,0.001903193,0.003068088,0.005118914,0.002491372,0.002186532,0.001866894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001180992,"about_ca_system_score_gemma":0.000761922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001060231,"about_ca_topic_score_gemma":0.001412032,"domain_scores_codex":[0.999315,0.0001373823,0.00002966987,0.0001176446,0.0001882643,0.0002120628],"domain_scores_gemma":[0.9981396,0.0008259843,0.0001799419,0.0004772363,0.0002125353,0.0001647692],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002990083,0.00007294291,0.0005863674,0.0001090047,0.00002474729,0.000165435,0.0005654792,0.005180953,0.00415006,0.9351526,0.003463485,0.05022996],"study_design_scores_gemma":[0.00004815834,0.00007908574,0.0001988018,0.00003855618,0.00002707145,0.0001705973,0.0001268622,0.009774014,0.003766995,0.9780748,0.00766853,0.00002654202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.571907,0.002137682,0.3412348,0.002715317,0.0006983603,0.0001258457,0.0004037431,0.001545856,0.0792315],"genre_scores_gemma":[0.9482533,0.001131243,0.02717228,0.0002293334,0.0003939699,0.00003528034,0.0001900682,0.0003037041,0.02229076],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009590221,"threshold_uncertainty_score":0.03208244,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; 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","authors":[{"name":"Adrien Poteaux","is_ca":false},{"name":"Éric Schost","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03761755709077252,"gpt":0.2682194969239669,"spread":0.2306019398331944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003287916,0.001021751,0.002219532,0.001476259,0.003062271,0.008925815,0.004190213,0.002364407,0.02001813],"category_scores_gemma":[0.03770545,0.0008768996,0.002191471,0.003980455,0.004797115,0.02402366,0.005965099,0.004912829,0.001783171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005350504,"about_ca_system_score_gemma":0.004914111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006946403,"about_ca_topic_score_gemma":0.01123672,"domain_scores_codex":[0.9928895,0.001657926,0.0005111529,0.001126004,0.002559618,0.001255807],"domain_scores_gemma":[0.9392737,0.0496728,0.001747053,0.006412153,0.001893938,0.001000302],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002871283,0.0004931856,0.007297136,0.0008722878,0.0002082379,0.0004611767,0.001515855,0.152301,0.005250041,0.7029656,0.02271586,0.1030485],"study_design_scores_gemma":[0.0001114384,0.00005715279,0.0005682008,0.00004660842,0.00006243584,0.00009617792,0.000243621,0.1933473,0.00186849,0.8016877,0.001870879,0.00003994579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6391321,0.002679792,0.252518,0.01677293,0.000583472,0.0004031723,0.003643966,0.002180946,0.08208562],"genre_scores_gemma":[0.9318899,0.0008671319,0.05496813,0.0006251795,0.0004634812,0.0002290118,0.002023565,0.0003978924,0.008535739],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02001813,"threshold_uncertainty_score":0.06696731,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"François Boulier","is_ca":false},{"name":"François Lemaire","is_ca":false},{"name":"Marc Moreno Maza","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01833505952676392,"gpt":0.2645680777233865,"spread":0.2462330181966225,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008511275,0.0004932203,0.0009520702,0.002591008,0.001055432,0.00343878,0.001222095,0.0004568131,0.006008788],"category_scores_gemma":[0.00508077,0.0005616854,0.0008778032,0.002727879,0.002944198,0.007323094,0.002778724,0.001742677,0.0008937287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001778334,"about_ca_system_score_gemma":0.0009011261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002105211,"about_ca_topic_score_gemma":0.003221806,"domain_scores_codex":[0.9989828,0.0001172755,0.00007223785,0.0002379693,0.0003787144,0.0002109355],"domain_scores_gemma":[0.9973627,0.001154138,0.0001858513,0.0007115037,0.0003733493,0.0002125001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000525464,0.0001583767,0.008671269,0.0001683662,0.00004745793,0.0002825695,0.001000581,0.01693381,0.008544877,0.795216,0.004028942,0.1644222],"study_design_scores_gemma":[0.00004045386,0.00005387615,0.0008602937,0.00001896411,0.00003692718,0.0001265356,0.0002057395,0.03365973,0.006362515,0.9532739,0.005328853,0.00003232721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4863541,0.0004564078,0.4854783,0.0006376748,0.0002108041,0.00008571687,0.0004789537,0.001709285,0.02458872],"genre_scores_gemma":[0.8982233,0.0002183553,0.09543778,0.0001075196,0.00008286775,0.00002661099,0.0005135089,0.0002872407,0.005102859],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006008788,"threshold_uncertainty_score":0.02010137,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Murat Cenk","is_ca":false},{"name":"M.A. Hasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02303596275619531,"gpt":0.2515946496593419,"spread":0.2285586869031466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001487921,0.0006241769,0.0008674304,0.00154556,0.00131016,0.003035944,0.001664108,0.001049583,0.01159514],"category_scores_gemma":[0.01449736,0.0003924118,0.0006213585,0.002112018,0.002250066,0.006677953,0.001945849,0.002216673,0.0009788176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001828059,"about_ca_system_score_gemma":0.001588482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002189033,"about_ca_topic_score_gemma":0.003681334,"domain_scores_codex":[0.998349,0.0004290965,0.00008236821,0.0001617142,0.0006892043,0.0002887333],"domain_scores_gemma":[0.9890732,0.008558628,0.0004870784,0.0009316961,0.0007184836,0.000230825],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004158215,0.0001371045,0.001596981,0.0001707853,0.00003655373,0.0001761752,0.0003022164,0.07795824,0.00308945,0.8770576,0.00605741,0.03300178],"study_design_scores_gemma":[0.00003172288,0.0000474172,0.0004589489,0.00002884233,0.00001759042,0.00008565904,0.00009843991,0.2151016,0.001503444,0.781028,0.001573029,0.00002533536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7424313,0.001999643,0.1539905,0.005200614,0.0003664989,0.0001003908,0.0008046746,0.0004847706,0.09462165],"genre_scores_gemma":[0.9735221,0.0006074627,0.01777222,0.0001963306,0.0001984345,0.00007136996,0.0003330834,0.0001145856,0.007184464],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01159514,"threshold_uncertainty_score":0.03878957,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"R. James Shank","is_ca":false},{"name":"David L. Wehlau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06246193144298696,"gpt":0.3037447393709523,"spread":0.2412828079279654,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001218864,0.00105591,0.001201871,0.002775749,0.001441983,0.004619788,0.0017964,0.0006968457,0.008554952],"category_scores_gemma":[0.004149076,0.0005408894,0.0009737427,0.00280302,0.002919419,0.009066422,0.003076658,0.001661591,0.001193642],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001234096,"about_ca_system_score_gemma":0.0007221503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007913498,"about_ca_topic_score_gemma":0.001689029,"domain_scores_codex":[0.9991428,0.0001296935,0.00006887804,0.0002036652,0.0002333459,0.0002217198],"domain_scores_gemma":[0.9977078,0.001113937,0.0003039842,0.0003640755,0.0002549675,0.0002551212],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001199828,0.0004560866,0.01241753,0.0003042767,0.0001448262,0.0006663365,0.001742471,0.0181525,0.0131617,0.7845942,0.008024867,0.1591354],"study_design_scores_gemma":[0.00006143036,0.0001097555,0.001076235,0.00002558109,0.00006212136,0.0001312177,0.0003196211,0.02463003,0.006442868,0.9646528,0.002463159,0.00002528388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8379184,0.0004458683,0.1330397,0.000741096,0.0002405421,0.0000690402,0.0004106855,0.001027209,0.02610742],"genre_scores_gemma":[0.9707498,0.0001777508,0.02410243,0.0000744712,0.0001474938,0.00001930046,0.0005537121,0.0001853906,0.003989635],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008554952,"threshold_uncertainty_score":0.02861923,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Michael W. Fleming","is_ca":true},{"name":"Ryan Gunther","is_ca":true},{"name":"Robert Rosebrugh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02543372123129081,"gpt":0.2721982775063541,"spread":0.2467645562750633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001628962,0.000809808,0.001987917,0.008598645,0.003298106,0.01120326,0.003094345,0.001607738,0.02260569],"category_scores_gemma":[0.007143587,0.001349613,0.001723489,0.01222874,0.00214458,0.01712697,0.004850333,0.002535608,0.008744339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001831737,"about_ca_system_score_gemma":0.002449308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004044572,"about_ca_topic_score_gemma":0.003316244,"domain_scores_codex":[0.9971039,0.0004212559,0.0005852082,0.001012309,0.0006845929,0.0001928496],"domain_scores_gemma":[0.9955457,0.0007550357,0.0002254345,0.001800684,0.001342566,0.0003303729],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000106458,0.00006099623,0.001664662,0.0002952987,0.00006748069,0.0001544086,0.0007517774,0.0008677283,0.0009668528,0.8547323,0.03186804,0.1084639],"study_design_scores_gemma":[0.00003094661,0.00003265597,0.0006027552,0.0001524965,0.00007198926,0.0004785297,0.0004531417,0.002196542,0.0008467808,0.6879781,0.3071072,0.00004898915],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"dataset","genre_scores_codex":[0.05298647,0.02479587,0.691327,0.00709684,0.002380519,0.0005025471,0.06619242,0.01046247,0.1442559],"genre_scores_gemma":[0.4350421,0.01561716,0.4082699,0.002363628,0.001278768,0.0007718555,0.08102837,0.001835662,0.05379251],"genre_candidate":"dataset","genre_consensus":null,"teacher_disagreement_score":0.02260569,"threshold_uncertainty_score":0.07562357,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Greg Reid","is_ca":true},{"name":"Lihong Zhi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02541430265687869,"gpt":0.2776046259435531,"spread":0.2521903232866744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004964293,0.0006499586,0.0009896165,0.0006866424,0.001002609,0.001500883,0.001106196,0.0006375141,0.00915355],"category_scores_gemma":[0.003256409,0.000380457,0.0008838982,0.0007224806,0.002008619,0.001460532,0.002267839,0.00191331,0.0012423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006897851,"about_ca_system_score_gemma":0.001037008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001779129,"about_ca_topic_score_gemma":0.003919302,"domain_scores_codex":[0.9993933,0.0001853706,0.00002950174,0.00007799666,0.0002338275,0.0000798581],"domain_scores_gemma":[0.9993778,0.0003617899,0.00003061975,0.0001184785,0.00009087183,0.0000203611],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009030596,0.0001340208,0.0004686551,0.0002199712,0.00003630343,0.0001470773,0.0004071911,0.1782022,0.002934065,0.6903454,0.00436516,0.1226496],"study_design_scores_gemma":[0.00005257171,0.00004490329,0.00008286038,0.00002408695,0.00001977385,0.00004211657,0.0001314819,0.4951004,0.00258058,0.4963833,0.005525628,0.00001227578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04025646,0.0001361797,0.9305732,0.0004293522,0.0001449181,0.0001161426,0.00007436601,0.0006401315,0.02762932],"genre_scores_gemma":[0.6144892,0.0002064929,0.3728006,0.0001915726,0.0001356939,0.0001733139,0.000209233,0.0004251827,0.01136881],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00915355,"threshold_uncertainty_score":0.03062165,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","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","authors":[{"name":"Mark Giesbrecht","is_ca":true},{"name":"Arne Storjohann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01025179214575504,"gpt":0.2123527566134181,"spread":0.2021009644676631,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006887623,0.0007616252,0.0006911067,0.00145566,0.0007744664,0.003003779,0.000772115,0.0005794145,0.01072871],"category_scores_gemma":[0.005580992,0.000403485,0.0004734335,0.001351685,0.001642717,0.003769896,0.001363173,0.001024705,0.001732131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007903223,"about_ca_system_score_gemma":0.000622544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001267333,"about_ca_topic_score_gemma":0.003644146,"domain_scores_codex":[0.9994534,0.00011885,0.00004188587,0.00009987367,0.0001757605,0.0001101842],"domain_scores_gemma":[0.9984534,0.0009112451,0.0001111904,0.0002065937,0.000241477,0.00007606321],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004546432,0.0001619822,0.002874462,0.0002478892,0.00003941002,0.0003220562,0.0008959399,0.05114209,0.009929363,0.7520686,0.007304475,0.1745591],"study_design_scores_gemma":[0.00006212494,0.00008153065,0.000349599,0.00004657884,0.00002017796,0.00009406134,0.0003843713,0.1151394,0.007179175,0.87142,0.005196697,0.00002636782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5202897,0.0004553293,0.4182988,0.0009532787,0.0003157521,0.0001215074,0.0004438008,0.001139846,0.05798199],"genre_scores_gemma":[0.8831152,0.0002966045,0.107027,0.0001287732,0.00008344692,0.00003576447,0.0004230596,0.0002270456,0.008663141],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01072871,"threshold_uncertainty_score":0.03589112,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","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","authors":[{"name":"Pei Yu","is_ca":true},{"name":"Yuan Yuan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05768186154231249,"gpt":0.3778721621319647,"spread":0.3201903005896522,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009749199,0.0006606083,0.0008681774,0.001531618,0.0007076528,0.001280316,0.0009697038,0.001048884,0.00248926],"category_scores_gemma":[0.003452634,0.0004570793,0.0006499763,0.001890709,0.0008863271,0.002076512,0.001881046,0.001309286,0.0009945021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000297769,"about_ca_system_score_gemma":0.0007963338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001129766,"about_ca_topic_score_gemma":0.001267974,"domain_scores_codex":[0.99961,0.00008497555,0.00002826305,0.00006463697,0.0001731543,0.00003906562],"domain_scores_gemma":[0.9994013,0.0002328882,0.00005391097,0.0001119205,0.0001420656,0.00005789598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005931745,0.0001769808,0.00113522,0.0001999093,0.0001034016,0.0001563255,0.0002871578,0.08475237,0.07306211,0.1661428,0.003274784,0.6701158],"study_design_scores_gemma":[0.00004105567,0.0000944479,0.0002219963,0.00001157476,0.00002046613,0.0001037597,0.00003875266,0.9280673,0.0103985,0.05881174,0.002164221,0.00002612262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01683941,0.0001031122,0.981319,0.00007815358,0.00003102634,0.00002581822,0.00003027578,0.0003045612,0.001268664],"genre_scores_gemma":[0.1564599,0.0002860531,0.8397036,0.00005793625,0.00005177439,0.00007836008,0.0001431927,0.0001341492,0.003085212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00248926,"threshold_uncertainty_score":0.008327425,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"С. А. Абрамов","is_ca":false},{"name":"Jacques Carette","is_ca":true},{"name":"K. O. Geddes","is_ca":true},{"name":"H. Q. Le","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01468669866679896,"gpt":0.2572742615947869,"spread":0.242587562927988,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001293817,0.0006180524,0.001190944,0.001391616,0.002402317,0.003183272,0.001185079,0.001100747,0.007103114],"category_scores_gemma":[0.006464249,0.0003523916,0.0007496761,0.001788188,0.003506185,0.00605478,0.002589391,0.002015349,0.001332929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009691183,"about_ca_system_score_gemma":0.0009208074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009004013,"about_ca_topic_score_gemma":0.001541895,"domain_scores_codex":[0.9988409,0.0003704764,0.00008179104,0.0001634917,0.0003397465,0.0002036893],"domain_scores_gemma":[0.9983519,0.000712653,0.000150886,0.0003912545,0.0002564477,0.0001367511],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000499503,0.00001855395,0.0001119621,0.00004194248,0.000008075188,0.0002702488,0.0002002623,0.002468582,0.0007295507,0.9839595,0.001652191,0.01048921],"study_design_scores_gemma":[0.00000920043,0.00001586503,0.00004747921,0.00001452114,0.000007855695,0.0001312825,0.00004129024,0.01450389,0.0009192156,0.9807562,0.003538023,0.00001509193],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1917619,0.002698932,0.6733122,0.002720972,0.001503192,0.00008000585,0.0001472999,0.001195182,0.1265803],"genre_scores_gemma":[0.8982726,0.000961523,0.08147813,0.0005577939,0.0007792096,0.00006471958,0.0001075128,0.0004954365,0.01728305],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007103114,"threshold_uncertainty_score":0.02376229,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Wayne Eberly","is_ca":true},{"name":"Mark Giesbrecht","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02079291340912201,"gpt":0.342340366931968,"spread":0.321547453522846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008860704,0.0006152546,0.0008355611,0.001212514,0.0007596351,0.002477902,0.0008008254,0.000413791,0.008225067],"category_scores_gemma":[0.001614796,0.0003791273,0.0006442248,0.0009369177,0.0009694374,0.003909364,0.001981849,0.001415412,0.00195879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000768962,"about_ca_system_score_gemma":0.0008482093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005456047,"about_ca_topic_score_gemma":0.00129317,"domain_scores_codex":[0.999405,0.000125336,0.00004886109,0.00006647149,0.0001891007,0.0001652611],"domain_scores_gemma":[0.9991518,0.0002085837,0.00005732952,0.0002085973,0.0002403643,0.000133376],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002405231,0.0002108514,0.0004316656,0.000126586,0.00002450723,0.00008351389,0.0003676303,0.008088071,0.01033914,0.9022312,0.004289275,0.07356721],"study_design_scores_gemma":[0.0000347233,0.00004044602,0.0001028836,0.00002751506,0.00001375768,0.00004622712,0.0001042018,0.03626142,0.004055401,0.9536346,0.005667726,0.00001098424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2496434,0.0009550672,0.7135042,0.0005858949,0.0003134757,0.000154473,0.0004412296,0.0007830083,0.03361936],"genre_scores_gemma":[0.7349148,0.0006745561,0.2368299,0.0002342123,0.0001847591,0.000129249,0.001180777,0.0004668905,0.02538475],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008225067,"threshold_uncertainty_score":0.02751553,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Madjid Állili","is_ca":true},{"name":"Tomasz Kaczyński","is_ca":true},{"name":"Claudia Landi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02001049779912141,"gpt":0.2652907886841481,"spread":0.2452802908850267,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001047593,0.0007284762,0.0009299186,0.003598294,0.002611879,0.004435653,0.001736941,0.00143975,0.008072435],"category_scores_gemma":[0.00430344,0.0005628019,0.0009758631,0.002146736,0.003538224,0.007858193,0.006993949,0.003245266,0.0008905279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001629959,"about_ca_system_score_gemma":0.0005418334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001513682,"about_ca_topic_score_gemma":0.001215853,"domain_scores_codex":[0.9988901,0.0002672329,0.0000745759,0.0002150907,0.0003903207,0.0001627639],"domain_scores_gemma":[0.9982926,0.0006191208,0.0001910709,0.0003423055,0.0002628595,0.0002919488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008150578,0.00001019509,0.0001117917,0.00001419235,0.000004093547,0.00003826825,0.0002182753,0.0006392324,0.0002199908,0.9954811,0.0003941614,0.002860534],"study_design_scores_gemma":[0.00000459539,0.000007214644,0.00006934469,0.000006436426,0.000005793062,0.00005196645,0.0001311737,0.004405178,0.0002298632,0.9928691,0.002213863,0.000005415478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4320956,0.001781224,0.4680382,0.003950097,0.0006011896,0.0001553018,0.00035362,0.0005411209,0.09248362],"genre_scores_gemma":[0.9250963,0.0008755148,0.04525232,0.0004468776,0.0003316946,0.0000941013,0.0003282136,0.0002577027,0.02731731],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008072435,"threshold_uncertainty_score":0.02700502,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Massimo Caboara","is_ca":false},{"name":"Sara Faridi","is_ca":true},{"name":"Peter Selinger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0236624495714388,"gpt":0.3210769085585581,"spread":0.2974144589871193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007921627,0.0003959874,0.0007640575,0.001734756,0.001869896,0.00412607,0.001137918,0.00120922,0.007077504],"category_scores_gemma":[0.006188889,0.0004594215,0.0008365693,0.00253792,0.003064916,0.006437636,0.002220907,0.00144605,0.0005858967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001836783,"about_ca_system_score_gemma":0.001019568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005205621,"about_ca_topic_score_gemma":0.006185384,"domain_scores_codex":[0.9991919,0.0002187257,0.00005228283,0.0001284212,0.0002838682,0.0001247621],"domain_scores_gemma":[0.9976547,0.001493743,0.0001265242,0.0002221082,0.0003178929,0.000184962],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002205806,0.000009313791,0.0002753427,0.00003386278,0.000008030054,0.00005194409,0.0003491859,0.003472108,0.0003832637,0.988817,0.0004608876,0.006116922],"study_design_scores_gemma":[0.000003280336,0.000002732956,0.00006077144,0.000007144047,0.000003924692,0.00001647435,0.00005357744,0.008544261,0.0002467702,0.9894254,0.001629629,0.000006022159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5463292,0.004260939,0.3562258,0.002459118,0.0002968165,0.0001099992,0.0005481495,0.0005763645,0.08919365],"genre_scores_gemma":[0.9543601,0.0008783147,0.03559802,0.0001260358,0.00007721658,0.00004570953,0.0002951833,0.0001019235,0.008517441],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007077504,"threshold_uncertainty_score":0.02367663,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Clément Gosselin","is_ca":true},{"name":"Brian Moore","is_ca":false},{"name":"Josef Schicho","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01028872064767116,"gpt":0.2546143466665517,"spread":0.2443256260188806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003518719,0.0005136129,0.0008538638,0.00126902,0.001140141,0.001527856,0.001595793,0.0007119814,0.01399835],"category_scores_gemma":[0.001276915,0.0003995957,0.0004713572,0.0007799515,0.001081651,0.002280069,0.002217298,0.000640155,0.001183695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008441882,"about_ca_system_score_gemma":0.0005552666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001303264,"about_ca_topic_score_gemma":0.001543316,"domain_scores_codex":[0.9997305,0.00003371435,0.00001213495,0.00005616092,0.00007925407,0.00008814701],"domain_scores_gemma":[0.9996637,0.00007035631,0.00005521177,0.0001052597,0.00005812974,0.00004729652],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005238277,0.0001100516,0.0008636273,0.0001415087,0.00005568691,0.0002360747,0.0003291736,0.242512,0.03527233,0.589494,0.003370364,0.1270913],"study_design_scores_gemma":[0.0001474059,0.0002410009,0.000623157,0.0000432831,0.00006522497,0.0001686362,0.0004136625,0.6391689,0.0129802,0.3301364,0.01594391,0.00006821797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4305402,0.0005183953,0.5083956,0.0003762136,0.000240152,0.0001329726,0.0001691958,0.001689708,0.05793759],"genre_scores_gemma":[0.9674692,0.0001524702,0.02455859,0.00003671034,0.00002106341,0.00005534142,0.00008851677,0.0001265176,0.007491591],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01399835,"threshold_uncertainty_score":0.04682916,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Murray Bremner","is_ca":true},{"name":"Irvin Roy Hentzel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07562860651438333,"gpt":0.3546564342942524,"spread":0.279027827779869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005308953,0.0007241119,0.001136011,0.003020988,0.004259996,0.006302307,0.001747443,0.002465155,0.008689177],"category_scores_gemma":[0.008241147,0.0007607985,0.001717335,0.002161005,0.005442684,0.01493594,0.00395989,0.004233133,0.001982013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001876865,"about_ca_system_score_gemma":0.00183916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001553927,"about_ca_topic_score_gemma":0.001587257,"domain_scores_codex":[0.9975281,0.0006751179,0.0002879764,0.0002886333,0.00092547,0.0002945673],"domain_scores_gemma":[0.9957004,0.0014505,0.0003515813,0.0006772436,0.001275003,0.0005452889],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003228435,0.000005053612,0.00003508032,0.00000466651,0.000001328979,0.00001685014,0.0000829853,0.00007291704,0.00006428434,0.9987854,0.0002871043,0.0006411343],"study_design_scores_gemma":[0.000003535971,0.000002394694,0.00002486648,0.000003636072,0.000001723742,0.00003486385,0.00002891244,0.001048054,0.00006517588,0.9976758,0.001105092,0.00000595002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1864865,0.002061841,0.5777446,0.005069305,0.002484907,0.0001432447,0.0006534499,0.0003661619,0.22499],"genre_scores_gemma":[0.8405435,0.001728073,0.1083087,0.001336439,0.001762917,0.0002297995,0.000648125,0.0003056061,0.04513684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008689177,"threshold_uncertainty_score":0.02906817,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Moulay A. Barkatou","is_ca":false},{"name":"Carole El Bacha","is_ca":false},{"name":"George Labahn","is_ca":true},{"name":"Eckhard Pflügel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07027741118408987,"gpt":0.3445580831731101,"spread":0.2742806719890202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004937871,0.0007738567,0.001049534,0.0005412811,0.0006829154,0.001062232,0.0006300603,0.0005022242,0.007591274],"category_scores_gemma":[0.002018839,0.0003266633,0.0009946963,0.0006221585,0.001020916,0.001023537,0.001613368,0.001401741,0.001517998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003090797,"about_ca_system_score_gemma":0.000686194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002963529,"about_ca_topic_score_gemma":0.004857155,"domain_scores_codex":[0.9993998,0.0001709462,0.00003274779,0.00006408087,0.0002457828,0.00008660192],"domain_scores_gemma":[0.9991084,0.0004870256,0.00003190952,0.0001721615,0.0001671128,0.00003333803],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003778093,0.0003269145,0.0008572686,0.000496594,0.0001395617,0.0004197018,0.0006930429,0.3487938,0.03239087,0.2277319,0.01266184,0.3751108],"study_design_scores_gemma":[0.00002596952,0.00008423832,0.0001652838,0.00001561285,0.00002663226,0.00006353568,0.00007606104,0.8934354,0.008023629,0.09263997,0.005421699,0.00002195502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03317242,0.0003903866,0.9474969,0.0003210299,0.0002847375,0.00009086959,0.0001301237,0.0008213077,0.01729231],"genre_scores_gemma":[0.5589603,0.0005964762,0.4153836,0.0003173161,0.0002423073,0.0001860997,0.0004941387,0.0005258161,0.02329398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007591274,"threshold_uncertainty_score":0.02539533,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Wayne Eberly","is_ca":true},{"name":"Mark Giesbrecht","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009798005884001877,"gpt":0.2656074410536992,"spread":0.2558094351696973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005986411,0.0006394497,0.0008622713,0.001058238,0.0008422201,0.002040972,0.0006772962,0.0003529934,0.01083284],"category_scores_gemma":[0.001167015,0.0003896484,0.0007840437,0.000839982,0.0008972671,0.002851651,0.002064761,0.00169067,0.002484189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008657888,"about_ca_system_score_gemma":0.000754762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007275867,"about_ca_topic_score_gemma":0.001638181,"domain_scores_codex":[0.9995236,0.00009692185,0.00002721139,0.00006016225,0.0001541353,0.0001379566],"domain_scores_gemma":[0.9995294,0.0001126041,0.00003013515,0.0001207196,0.0001295747,0.00007762443],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002465563,0.0001273548,0.0002368996,0.000102323,0.00002249699,0.00006063203,0.0003181779,0.005356102,0.008792101,0.9132345,0.005686019,0.06581687],"study_design_scores_gemma":[0.00003784322,0.00003419424,0.0001075531,0.00001901875,0.0000174947,0.00004079749,0.00009221243,0.03072834,0.004259489,0.9574022,0.00724945,0.00001130418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2380803,0.0008997265,0.6987769,0.0007885567,0.0002234745,0.0001549822,0.0005211157,0.0009810415,0.05957383],"genre_scores_gemma":[0.7787637,0.0006115229,0.1823664,0.0002222699,0.0001530308,0.0001109314,0.00121915,0.0005081461,0.03604496],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01083284,"threshold_uncertainty_score":0.0362395,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mark van Hoeij","is_ca":false},{"name":"Jürgen Klüners","is_ca":false},{"name":"Andrew Novocin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01679441896971712,"gpt":0.2626005843204643,"spread":0.2458061653507472,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009437168,0.001043292,0.0009619893,0.002345805,0.002187627,0.002611499,0.001027654,0.001102123,0.01853259],"category_scores_gemma":[0.002417521,0.0004962433,0.0009944803,0.001488917,0.002797077,0.004292418,0.002726144,0.003642974,0.004431553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001230973,"about_ca_system_score_gemma":0.0008066992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003303731,"about_ca_topic_score_gemma":0.0003508949,"domain_scores_codex":[0.9993112,0.0001854047,0.00003071513,0.00009745463,0.0002283326,0.0001468769],"domain_scores_gemma":[0.9990309,0.000305134,0.00007829422,0.0002384677,0.000192911,0.0001542533],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002365294,0.00002127358,0.00006427146,0.00001240366,0.000002729788,0.00002384023,0.000103848,0.0002121629,0.0004641645,0.9918154,0.001594298,0.005661895],"study_design_scores_gemma":[0.00001510861,0.00001598296,0.00004371193,0.000009337762,0.000005028864,0.00006784377,0.00003681823,0.001690803,0.0009795924,0.9913723,0.005756663,0.000006823332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2627835,0.001133761,0.2383562,0.005730923,0.002082929,0.0002568086,0.0005816605,0.001089132,0.487985],"genre_scores_gemma":[0.7960808,0.0009428846,0.04665824,0.001129549,0.001148759,0.0002055428,0.0006970905,0.0007556021,0.1523815],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01853259,"threshold_uncertainty_score":0.06199771,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}