{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":22,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":22,"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":"9442ea1359f2","filters":{"venue":"Journal of Complexity"}},"results":[{"id":"W2146380740","doi":"10.1016/j.jco.2005.04.002","title":"The shifted number system for fast linear algebra on integer matrices","year":2005,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Mathematics; Integer matrix; Matrix multiplication; Dimension (graph theory); Unimodular matrix; Discrete mathematics; Matrix (chemical analysis); Multiplication (music); Polynomial; Computation; Integer points in convex polyhedra; Algebra over a field; Combinatorics; Integer programming; Algorithm; Pure mathematics; Symmetric matrix; Branch and price; Eigenvalues and eigenvectors; Computer science; Nonnegative matrix","authors":[{"name":"Arne Storjohann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02981440093235344,"gpt":0.2839099586143147,"spread":0.2540955576819612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001035033,0.0006645506,0.0008637005,0.001145851,0.001551143,0.002868761,0.001176066,0.000871942,0.0124041],"category_scores_gemma":[0.004351962,0.0004156146,0.0006385238,0.001289803,0.001950009,0.005396924,0.00212291,0.002337748,0.003089643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001196331,"about_ca_system_score_gemma":0.001129309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007288286,"about_ca_topic_score_gemma":0.0008707349,"domain_scores_codex":[0.9989859,0.0002558042,0.00008020112,0.0002217304,0.0002950298,0.0001613474],"domain_scores_gemma":[0.9986445,0.0004248073,0.0001283176,0.0004059972,0.000260413,0.0001360229],"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.0001288413,0.00002005464,0.0001372144,0.00005333514,0.000006380244,0.00005075253,0.00009141478,0.003482253,0.002472953,0.9654296,0.003582344,0.02454484],"study_design_scores_gemma":[0.00002106913,0.0000317262,0.00005855823,0.00001317185,0.000005179338,0.00006436794,0.00002110506,0.02312073,0.001713035,0.9693112,0.005617962,0.00002187439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1338287,0.0011367,0.816463,0.001812623,0.001574125,0.0001679704,0.0004405371,0.001039173,0.04353723],"genre_scores_gemma":[0.737608,0.0008278648,0.2296065,0.0008090179,0.0010962,0.0002616686,0.0007348615,0.0004726305,0.02858325],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0124041,"threshold_uncertainty_score":0.0414958,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060306687","doi":"10.1016/j.jco.2007.11.004","title":"Adaptivity and computational complexity in the numerical solution of ODEs","year":2008,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Numerical methods for differential equations","field":"Mathematics","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":"","keywords":"Equidistant; Ode; Grid; Mathematics; Variable (mathematics); Mathematical optimization; Constant (computer programming); Function (biology); Applied mathematics; Algorithm; Computer science; Geometry; Mathematical analysis","authors":[{"name":"Silvana Ilie","is_ca":false},{"name":"Gustaf Söderlind","is_ca":false},{"name":"Robert M. Corless","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3844642780201271,"gpt":0.4089244228139247,"spread":0.0244601447937976,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004050395,0.0007436345,0.0009182308,0.001058246,0.0007737804,0.002331462,0.0009863789,0.00146675,0.001724171],"category_scores_gemma":[0.03587418,0.0005462478,0.00105541,0.0006974131,0.004263355,0.004089528,0.004035047,0.002890999,0.0002080017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007471862,"about_ca_system_score_gemma":0.0008485383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001384906,"about_ca_topic_score_gemma":0.001086896,"domain_scores_codex":[0.9981285,0.0009235577,0.0001298888,0.0001893986,0.0004976588,0.0001310529],"domain_scores_gemma":[0.9749467,0.02083446,0.001223419,0.001483779,0.00105799,0.0004536537],"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.0002969837,0.00008539056,0.003838735,0.0002123905,0.00009209564,0.0002646841,0.0004338943,0.4683701,0.003968862,0.494913,0.0009465445,0.02657744],"study_design_scores_gemma":[0.00001807908,0.00003529747,0.0005065969,0.00002037656,0.00001500308,0.00004769289,0.0000331075,0.8343984,0.000756125,0.1635224,0.0006271112,0.00001980498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1991712,0.002246673,0.7836766,0.002517649,0.0003817767,0.00008329393,0.00005939486,0.0001872729,0.01167607],"genre_scores_gemma":[0.9351631,0.001115996,0.05822206,0.0002377952,0.0003325929,0.0001419037,0.00006317619,0.0001559367,0.0045674],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004050395,"threshold_uncertainty_score":0.02142078,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020427895","doi":"10.1016/j.jco.2004.01.002","title":"On the complexity of the discrete logarithm and Diffie–Hellman problems","year":2004,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":27,"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":"Discrete logarithm; Logarithm; Mathematics; Function (biology); Cryptography; Computational complexity theory; Discrete mathematics; Decision problem; Security parameter; Theoretical computer science; Computer science; Algorithm; Public-key cryptography; Encryption","authors":[{"name":"Ian F. Blake","is_ca":true},{"name":"Theo Garefalakis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05587024331900451,"gpt":0.2560173765409879,"spread":0.2001471332219834,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008008231,0.001387149,0.003087698,0.003308596,0.003376548,0.01019923,0.00371239,0.00354883,0.01014486],"category_scores_gemma":[0.05480824,0.001355312,0.001997692,0.0045881,0.008420973,0.0321498,0.006897189,0.01076734,0.000958112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007332383,"about_ca_system_score_gemma":0.003997321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002862284,"about_ca_topic_score_gemma":0.001808588,"domain_scores_codex":[0.9913211,0.00294643,0.0004410972,0.0008964174,0.003376353,0.001018454],"domain_scores_gemma":[0.9039366,0.08378069,0.003224745,0.00454902,0.002776245,0.001732708],"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.0002770753,0.0001254347,0.000938408,0.000166974,0.00004309013,0.0001025211,0.0003255449,0.01705505,0.0002440608,0.9618513,0.006955036,0.01191552],"study_design_scores_gemma":[0.0000398983,0.0000155035,0.0002679311,0.00002798848,0.00001418727,0.00006538527,0.0000660285,0.03696948,0.0001348819,0.9605187,0.001858973,0.00002117024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3398579,0.02279999,0.3197819,0.092516,0.002318318,0.0003398084,0.002368678,0.0004506872,0.2195668],"genre_scores_gemma":[0.9308529,0.007473502,0.03665642,0.001810766,0.003546727,0.0003386532,0.00121269,0.0002314268,0.0178769],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01019923,"threshold_uncertainty_score":0.05320042,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2188896417","doi":"10.1016/j.jco.2015.07.002","title":"Stability of the elastic net estimator","year":2015,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Elastic net regularization; Mathematics; Lasso (programming language); Restricted isometry property; Estimator; Applied mathematics; Stability (learning theory); Regularization (linguistics); Compressed sensing; Term (time); Mathematical optimization; Algorithm; Regression; Computer science; Statistics; Artificial intelligence; Machine learning","authors":[{"name":"Yi Shen","is_ca":true},{"name":"Bin Han","is_ca":true},{"name":"Elena Braverman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09754639743873322,"gpt":0.2698066429464082,"spread":0.1722602455076749,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002826664,0.0007178597,0.0007171862,0.0009545183,0.0006318224,0.0018209,0.001016985,0.001190731,0.003942211],"category_scores_gemma":[0.02238781,0.000519953,0.0003760507,0.0004094628,0.002557551,0.002543465,0.002427406,0.001750801,0.00074535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009391579,"about_ca_system_score_gemma":0.001189618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001867191,"about_ca_topic_score_gemma":0.00137981,"domain_scores_codex":[0.9991456,0.0002791677,0.00002821521,0.0002133279,0.0002535149,0.00008017357],"domain_scores_gemma":[0.9908603,0.006479355,0.0006411311,0.0005463599,0.001203999,0.00026878],"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.0005494191,0.00005568944,0.003653112,0.0001781022,0.00009437961,0.0002310828,0.0002264508,0.4425275,0.01417962,0.4929053,0.003590376,0.041809],"study_design_scores_gemma":[0.00001096959,0.00002663012,0.0006066507,0.00001922283,0.000006417185,0.0000671042,0.00002917245,0.9446692,0.001604934,0.05227203,0.0006694015,0.00001827709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0601186,0.0004265471,0.925973,0.001391257,0.0001354593,0.00003602918,0.0001700353,0.0001557825,0.01159332],"genre_scores_gemma":[0.9119664,0.0005880557,0.06947239,0.0002657449,0.0002326754,0.0001161474,0.0003710951,0.0002283117,0.01675924],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003942211,"threshold_uncertainty_score":0.01494896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2215141910","doi":"10.1016/j.jco.2015.11.009","title":"A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers","year":2015,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"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; Bivariate analysis; Monte Carlo method; Algorithm; Polynomial; Degree (music); Modular design; Discrete mathematics; Computer science; Statistics","authors":[{"name":"Esmaeil Mehrabi","is_ca":true},{"name":"Éric Schost","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05792931936759485,"gpt":0.2832520914927291,"spread":0.2253227721251343,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002418224,0.0009214792,0.001533173,0.001025343,0.001181261,0.00187725,0.002195618,0.001741676,0.008674017],"category_scores_gemma":[0.01367531,0.0008912159,0.001183029,0.001238354,0.001833549,0.002178899,0.003240068,0.002742036,0.001449523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00170859,"about_ca_system_score_gemma":0.004223484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005493168,"about_ca_topic_score_gemma":0.01164644,"domain_scores_codex":[0.9982089,0.0006602726,0.00009960406,0.0002962741,0.0004988579,0.0002361655],"domain_scores_gemma":[0.9935799,0.004501892,0.0002732877,0.0008276582,0.0005087683,0.0003086477],"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.0005911393,0.000211041,0.001301051,0.0001553592,0.00009690279,0.00008718794,0.0001392797,0.7175457,0.002460988,0.1439703,0.004055703,0.1293854],"study_design_scores_gemma":[0.00005421519,0.00002487022,0.00005360135,0.000009007765,0.000009507684,0.00001370615,0.00001105544,0.9514121,0.000435804,0.04749428,0.0004729971,0.000008748095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01328187,0.0001035694,0.9816943,0.000344441,0.00006054101,0.00008188823,0.00008304241,0.0006986939,0.003651677],"genre_scores_gemma":[0.2846891,0.0001291522,0.709563,0.000314922,0.0001203793,0.0003455385,0.0003333842,0.0002722967,0.0042322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008674017,"threshold_uncertainty_score":0.02901751,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107482418","doi":"10.1016/j.jco.2014.09.004","title":"A deterministic algorithm for inverting a polynomial matrix","year":2014,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Exponent; Matrix multiplication; Inverse; Univariate; Matrix (chemical analysis); Polynomial matrix; Invariant (physics); Combinatorics; Upper and lower bounds; Field (mathematics); Polynomial; Discrete mathematics; Algorithm; Matrix polynomial; Pure mathematics; Mathematical analysis; Statistics; Geometry","authors":[{"name":"Wei Zhou","is_ca":true},{"name":"George Labahn","is_ca":true},{"name":"Arne Storjohann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03252501886350941,"gpt":0.2923396275986458,"spread":0.2598146087351364,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007942534,0.001590131,0.001205384,0.0007835695,0.001601532,0.002082217,0.002383912,0.001972993,0.01368762],"category_scores_gemma":[0.004005717,0.0009115118,0.001658458,0.001327927,0.001252933,0.003220951,0.0036641,0.002631909,0.004535016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00144573,"about_ca_system_score_gemma":0.004075497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003006485,"about_ca_topic_score_gemma":0.007630058,"domain_scores_codex":[0.9978579,0.0002183045,0.0001510746,0.0006973198,0.0007453597,0.0003300663],"domain_scores_gemma":[0.9971449,0.001106386,0.0001659546,0.0009657227,0.0004553667,0.0001616523],"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.001154052,0.0006373122,0.002153022,0.0006104338,0.0002265534,0.0003748506,0.0003687016,0.04268704,0.04586951,0.1208926,0.02548043,0.7595455],"study_design_scores_gemma":[0.0009803532,0.000619615,0.001518273,0.0000959321,0.0002733236,0.001061073,0.0002707322,0.6283372,0.05677649,0.2844313,0.02544041,0.0001952599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02221555,0.000196839,0.9640355,0.0005738118,0.0001877268,0.0002235067,0.0003708514,0.004448613,0.007747572],"genre_scores_gemma":[0.2393091,0.0001769079,0.7451678,0.0003547115,0.0001411268,0.0003930759,0.001157826,0.0004247504,0.01287469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01368762,"threshold_uncertainty_score":0.0457896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965823846","doi":"10.1016/j.jco.2011.05.001","title":"Bit-size estimates for triangular sets in positive dimension","year":2011,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Dimension (graph theory); Interpolation (computer graphics); Algebraic number; Context (archaeology); Degree (music); Discrete mathematics; Combinatorics; Mathematical analysis; Computer science","authors":[{"name":"Xavier Dahan","is_ca":false},{"name":"Abdulilah Kadri","is_ca":true},{"name":"Éric Schost","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04874806266807665,"gpt":0.2938994452722956,"spread":0.245151382604219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003962381,0.001521556,0.001353315,0.003471217,0.001046408,0.003590126,0.002911723,0.001840249,0.01198416],"category_scores_gemma":[0.05273023,0.0008458646,0.0008774888,0.002735541,0.002348939,0.0103982,0.00506026,0.003275651,0.001825444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001996775,"about_ca_system_score_gemma":0.001326531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001101556,"about_ca_topic_score_gemma":0.001493425,"domain_scores_codex":[0.9957923,0.001009716,0.0002636739,0.0004118873,0.002012049,0.0005104149],"domain_scores_gemma":[0.9536567,0.03501388,0.00160471,0.004982544,0.003930383,0.0008118977],"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.001420772,0.0001606561,0.00379137,0.0006799861,0.0001042653,0.0002536614,0.0005741187,0.19957,0.01576291,0.6194389,0.01620267,0.1420405],"study_design_scores_gemma":[0.00003868074,0.0001064979,0.0005824773,0.0001536069,0.00003717284,0.0001817588,0.0001311521,0.6051884,0.006278848,0.3835818,0.003664083,0.0000554556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06110478,0.001863769,0.9152585,0.002094858,0.0003017132,0.0001381748,0.000874839,0.0009923062,0.01737109],"genre_scores_gemma":[0.6725182,0.002616652,0.3095886,0.0008139797,0.0008690768,0.0006750772,0.001756759,0.0008817716,0.01028004],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01198416,"threshold_uncertainty_score":0.04009104,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038559025","doi":"10.1016/j.jco.2014.02.006","title":"A variant of Atanassov’s method for<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si8.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-sequences and<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si9.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mstyle mathvariant=\"bold\"><mml:mi>e</mml:mi></mml:mstyle><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-sequences","year":2014,"lang":"lv","type":"article","venue":"Journal of Complexity","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Actua; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Sequence (biology); Class (philosophy); Star (game theory); Argument (complex analysis); Discrete mathematics; Algorithm; Computer science; Artificial intelligence; Mathematical analysis","authors":[{"name":"Henri Faure","is_ca":false},{"name":"Christiane Lemieux","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03161119002668558,"gpt":0.2762239273602845,"spread":0.2446127373335989,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001903837,0.002974589,0.001516742,0.00351171,0.002033831,0.004504553,0.004574622,0.002442976,0.1202212],"category_scores_gemma":[0.00837433,0.001586551,0.004420753,0.002380793,0.001399665,0.004787471,0.004112097,0.003884004,0.08290278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001281796,"about_ca_system_score_gemma":0.002679921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00785364,"about_ca_topic_score_gemma":0.0126489,"domain_scores_codex":[0.997085,0.0003554329,0.0003260684,0.0008982908,0.0009919013,0.0003433047],"domain_scores_gemma":[0.9965965,0.0007280023,0.0001208298,0.00114344,0.001263756,0.0001475188],"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.0003775478,0.0002105144,0.001118786,0.001002062,0.0002111498,0.0005031422,0.00101163,0.005558898,0.01788854,0.1025186,0.2173631,0.652236],"study_design_scores_gemma":[0.0001652564,0.00006900426,0.0007238715,0.0002432751,0.0001040104,0.0008245936,0.0003877215,0.05420721,0.0331027,0.08902186,0.8209862,0.0001644449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00130867,0.0001955761,0.9561554,0.0002427178,0.0007692656,0.0001677775,0.001894427,0.02573516,0.01353112],"genre_scores_gemma":[0.02247171,0.0002928189,0.8790001,0.0003288449,0.0002239947,0.0003816508,0.006396871,0.02433683,0.06656717],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1202212,"threshold_uncertainty_score":0.4021799,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059965246","doi":"10.1016/j.jco.2007.01.005","title":"Searching for extensible Korobov rules","year":2007,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Extensibility; Mathematics; Computer science; Programming language","authors":[{"name":"Hardeep S. Gill","is_ca":true},{"name":"Christiane Lemieux","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.277846678076008,"gpt":0.4389007483948378,"spread":0.1610540703188297,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001591392,0.0006491538,0.001445496,0.002491634,0.001160835,0.002023821,0.00155169,0.001173944,0.007214315],"category_scores_gemma":[0.01270161,0.0009866275,0.001546163,0.001813977,0.001278716,0.005134372,0.00273458,0.002205445,0.0008893264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002725839,"about_ca_system_score_gemma":0.0004146421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002815752,"about_ca_topic_score_gemma":0.0005744316,"domain_scores_codex":[0.999234,0.0001888813,0.00010845,0.0001624807,0.0001999614,0.0001063464],"domain_scores_gemma":[0.9952495,0.00277161,0.0003545144,0.001037686,0.0003674032,0.0002192176],"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.0004651248,0.0002826066,0.01253853,0.0006598688,0.0001872115,0.001483734,0.001280781,0.04372336,0.007076257,0.6302007,0.004838417,0.2972634],"study_design_scores_gemma":[0.00006834605,0.000122592,0.000987108,0.0001798701,0.0001120525,0.0004458066,0.0008472765,0.1595934,0.003141077,0.8290216,0.00542381,0.00005702293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6629674,0.001275458,0.307618,0.0005415274,0.0002520273,0.0001302547,0.0004133568,0.0008012386,0.02600071],"genre_scores_gemma":[0.818869,0.0007268522,0.1751147,0.0001509232,0.00006727216,0.0000962495,0.0007831333,0.0002478332,0.003944052],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007214315,"threshold_uncertainty_score":0.02413428,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047549016","doi":"10.1016/j.jco.2011.02.001","title":"Existence and construction of shifted lattice rules with an arbitrary number of points and bounded weighted star discrepancy for general decreasing weights","year":2011,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Fonds Wetenschappelijk Onderzoek; Canada Research Chairs","keywords":"Mathematics; Bounded function; Lattice (music); Star (game theory); Combinatorics; Dimension (graph theory); Rank (graph theory); Discrete mathematics; Mathematical analysis","authors":[{"name":"Vasile Sinescu","is_ca":true},{"name":"Pierre L’Ecuyer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1141106889309208,"gpt":0.3319629606959482,"spread":0.2178522717650274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001864313,0.0005628357,0.001291841,0.001686148,0.001687442,0.002678502,0.002528474,0.001878798,0.003346167],"category_scores_gemma":[0.006785451,0.001238535,0.001390794,0.001347884,0.002799615,0.003164798,0.002902095,0.002984393,0.0009353394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008870964,"about_ca_system_score_gemma":0.001028931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006081527,"about_ca_topic_score_gemma":0.000911504,"domain_scores_codex":[0.9988059,0.000264218,0.0000891005,0.0002006533,0.0004717986,0.0001684255],"domain_scores_gemma":[0.9961812,0.001280068,0.0003435194,0.0007838433,0.0007142684,0.0006970038],"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.00005002235,0.00004719055,0.0003862967,0.00004733212,0.00001096634,0.00007776585,0.0001268497,0.003664056,0.004142994,0.9837749,0.0005406612,0.007131036],"study_design_scores_gemma":[0.00005319679,0.0000503119,0.0001802732,0.00002550145,0.00001620067,0.0001764345,0.0000895568,0.06371333,0.004174503,0.9288488,0.002634236,0.00003772322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3401091,0.0003601041,0.6357207,0.0004632912,0.0002658468,0.0001148413,0.0001606219,0.0003529005,0.02245269],"genre_scores_gemma":[0.5257859,0.0003555828,0.4600104,0.0002769266,0.0001097847,0.0002345069,0.000319048,0.000392496,0.01251535],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003346167,"threshold_uncertainty_score":0.01119405,"prediction_status":"machine_predicted_unvalidated"},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"agree"},{"id":"W2000687805","doi":"10.1016/j.jco.2011.10.011","title":"How do path generation methods affect the accuracy of quasi-Monte Carlo methods for problems in finance?","year":2011,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":11,"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 Natural Science Foundation of China","keywords":"Quasi-Monte Carlo method; Monte Carlo method; Brownian bridge; Computer science; Quadratic equation; Dimension (graph theory); Mathematical optimization; Applied mathematics; Effective dimension; Mathematics; Function (biology); Monte Carlo molecular modeling; Brownian motion; Statistics; Mathematical analysis","authors":[{"name":"Xiaoqun Wang","is_ca":false},{"name":"Ken Seng Tan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.4050555994063929,"gpt":0.4674796336828049,"spread":0.06242403427641202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0168301,0.0007609208,0.001112671,0.001170982,0.0009678773,0.002835804,0.002319028,0.005026582,0.004587173],"category_scores_gemma":[0.2080077,0.0008579183,0.00078634,0.001108279,0.002780958,0.007565768,0.001692054,0.003745089,0.0006412581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00129781,"about_ca_system_score_gemma":0.001603699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004978895,"about_ca_topic_score_gemma":0.003445061,"domain_scores_codex":[0.9953311,0.003167981,0.00015368,0.0003484458,0.0007463672,0.0002524809],"domain_scores_gemma":[0.8306412,0.1483737,0.005415956,0.007424171,0.00695737,0.001187705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004304179,0.0001976331,0.01657125,0.0004497201,0.0002886463,0.0001289724,0.0004483793,0.5985477,0.002621358,0.3271272,0.005753846,0.04743493],"study_design_scores_gemma":[0.00004441586,0.00003856011,0.001626341,0.00006751865,0.00003257272,0.00003679937,0.00005015254,0.9149451,0.001360114,0.08081052,0.0009498057,0.00003812879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2600617,0.004599033,0.7041829,0.01443963,0.001460117,0.00009293403,0.00038037,0.0009030041,0.01388034],"genre_scores_gemma":[0.8958924,0.001814482,0.09762634,0.0009939091,0.000449973,0.00008494499,0.0002306656,0.000706395,0.00220089],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0168301,"threshold_uncertainty_score":0.08900714,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016263267","doi":"10.1016/j.jco.2013.04.002","title":"On blocked resolution IV designs containing clear two-factor interactions","year":2013,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":9,"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 Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Mathematics; Resolution (logic); Block (permutation group theory); Homogeneous; Blocking (statistics); Factor (programming language); Algorithm; Combinatorics; Statistics; Computer science; Artificial intelligence","authors":[{"name":"Shengli Zhao","is_ca":false},{"name":"Pengfei Li","is_ca":true},{"name":"Min‐Qian Liu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.4500271559682416,"gpt":0.4992393573120821,"spread":0.04921220134384058,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.07819735,0.004654087,0.004789039,0.002001431,0.0007065868,0.002169015,0.003341948,0.002499228,0.009152391],"category_scores_gemma":[0.1774124,0.00262566,0.002963764,0.001755143,0.003573517,0.003231792,0.003313108,0.003636596,0.001507246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001988626,"about_ca_system_score_gemma":0.003383254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001136177,"about_ca_topic_score_gemma":0.001164518,"domain_scores_codex":[0.8804601,0.1066819,0.001950338,0.004861889,0.004576256,0.00146947],"domain_scores_gemma":[0.6718651,0.2999958,0.008929324,0.0146445,0.003679045,0.000886229],"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.02293802,0.001819021,0.002506906,0.005598255,0.002808576,0.0002486587,0.001311731,0.3132046,0.02477533,0.3118031,0.003288516,0.3096972],"study_design_scores_gemma":[0.004986808,0.007976315,0.00304235,0.0008716295,0.001348478,0.0001091953,0.0001680777,0.5497004,0.0147654,0.4054285,0.01134571,0.0002571832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01172289,0.0002504018,0.9853423,0.00006378298,0.00005552077,0.0008339557,0.0001352839,0.0001831369,0.001412628],"genre_scores_gemma":[0.1172938,0.0005341624,0.8721045,0.0002601481,0.00008445457,0.006637705,0.0004060041,0.000224149,0.002455038],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.07819735,"threshold_uncertainty_score":0.413552,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3046897419","doi":"10.1016/j.jco.2021.101574","title":"Fast amortized multi-point evaluation","year":2021,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Direction Générale de l’Armement","keywords":"Mathematics; Amortized analysis; Point (geometry); Combinatorics; Geometry; Computer science; Data structure; Programming language","authors":[{"name":"Joris van der Hoeven","is_ca":true},{"name":"Grégoire Lecerf","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09116819641684006,"gpt":0.325743134216808,"spread":0.234574937799968,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002380147,0.002780646,0.002726532,0.002700784,0.002536048,0.005063091,0.004552326,0.002265696,0.04618721],"category_scores_gemma":[0.008944504,0.001097868,0.002354885,0.005453031,0.002389142,0.008769678,0.008057634,0.0031639,0.01024236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003524937,"about_ca_system_score_gemma":0.004103562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004835374,"about_ca_topic_score_gemma":0.01043284,"domain_scores_codex":[0.9943158,0.001015936,0.0003456056,0.0008494428,0.002249201,0.001223904],"domain_scores_gemma":[0.9908041,0.002960727,0.0003169735,0.003826792,0.001597529,0.0004939704],"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.005214202,0.0004961375,0.002892012,0.0009546739,0.0004011936,0.0005043602,0.0004699087,0.04020648,0.02266302,0.1148458,0.07921617,0.732136],"study_design_scores_gemma":[0.0009958844,0.0005779071,0.001905169,0.0002128074,0.0004746018,0.0006305781,0.0004423037,0.5119076,0.0406252,0.4034542,0.03855877,0.0002149462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1266942,0.003042206,0.775226,0.002363636,0.001307149,0.0005628275,0.002314502,0.03525517,0.05323438],"genre_scores_gemma":[0.5330157,0.0005270634,0.4256598,0.0007476549,0.0003912804,0.0005426658,0.002381047,0.003435797,0.03329903],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04618721,"threshold_uncertainty_score":0.1545116,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2508257146","doi":"10.1016/j.jco.2014.10.004","title":"On construction of blocked general minimum lower-order confounding <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si18.gif\" display=\"inline\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>−</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:msup><mml:mo>:</mml:mo><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msup></mml:math> designs with <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si19.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>N</mml:mi><mml:mo>/</mml:mo><mml:mn>4</mml:mn><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>≤</mml:mo><mml:mi>n</mml:mi><mml:mo>≤</mml:mo><mml:mn>5</mml:mn><mml:mi>N</mml:mi><mml:mo>/</mml:mo><mml:mn>16</mml:mn></mml:math>","year":2014,"lang":"lv","type":"article","venue":"Journal of Complexity","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Order (exchange); Algorithm; Combinatorics; Statistics","authors":[{"name":"Bing Guo","is_ca":false},{"name":"Qi Zhou","is_ca":false},{"name":"Runchu Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03473754210062122,"gpt":0.285277251390713,"spread":0.2505397092900918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001943471,0.0014602,0.001489941,0.001159552,0.001076095,0.002070347,0.001523129,0.000942102,0.02104083],"category_scores_gemma":[0.005226855,0.001065296,0.003008201,0.0009520397,0.001462532,0.002559743,0.003272892,0.003077101,0.01057512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00171489,"about_ca_system_score_gemma":0.001621856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002109515,"about_ca_topic_score_gemma":0.003525318,"domain_scores_codex":[0.998041,0.0005183101,0.0001560043,0.0003910034,0.0006421628,0.0002516186],"domain_scores_gemma":[0.9976485,0.001006524,0.0002236454,0.0005537664,0.000435088,0.0001325499],"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.0005445528,0.0002046346,0.001030593,0.0006822768,0.00008813051,0.000307785,0.0006522265,0.04584398,0.02148994,0.7339387,0.01867531,0.1765419],"study_design_scores_gemma":[0.0001755786,0.0005089379,0.0005054717,0.0001882961,0.0001104249,0.0004294125,0.0001457128,0.1246739,0.01601229,0.7966257,0.06053171,0.00009267618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0179985,0.0002854802,0.9539448,0.000202403,0.00009491097,0.0001658435,0.0004526367,0.001046191,0.02580935],"genre_scores_gemma":[0.165716,0.0007186441,0.7837426,0.000583077,0.0001068511,0.0007005795,0.003080797,0.001222844,0.04412854],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02104083,"threshold_uncertainty_score":0.07038856,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979768500","doi":"10.1016/j.jco.2013.12.005","title":"Efficient Monte Carlo simulation for integral functionals of Brownian motion","year":2013,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":3,"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":"Brownian bridge; Monte Carlo method; Mathematics; Monte Carlo integration; Fractional Brownian motion; Brownian motion; Quasi-Monte Carlo method; Variance reduction; Applied mathematics; Statistical physics; Importance sampling; Mathematical optimization; Geometric Brownian motion; Rejection sampling; Diffusion process; Monte Carlo molecular modeling; Mathematical analysis; Computer science; Markov chain Monte Carlo; Physics; Statistics","authors":[{"name":"Adam W. Kolkiewicz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1777125395121595,"gpt":0.368207304955447,"spread":0.1904947654432875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003502044,0.0006525012,0.00167943,0.001263313,0.001017958,0.00188737,0.001880161,0.001703313,0.003370309],"category_scores_gemma":[0.01497838,0.0008717423,0.0009411622,0.001146409,0.001464706,0.002166008,0.002065903,0.001892677,0.0004943464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001709205,"about_ca_system_score_gemma":0.002118082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005947668,"about_ca_topic_score_gemma":0.006079614,"domain_scores_codex":[0.9986407,0.0005543539,0.0000727808,0.0001133456,0.0004589387,0.000159908],"domain_scores_gemma":[0.9923267,0.005726669,0.0002809824,0.0007358787,0.000608936,0.0003208099],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001468016,0.00008883628,0.001013986,0.00006285165,0.00005386692,0.00007249817,0.00007520048,0.8343758,0.001626429,0.1469596,0.0006643597,0.01485972],"study_design_scores_gemma":[0.000008184456,0.000003788503,0.00003572997,0.000002997999,0.00000304389,0.000007000756,0.000002410992,0.982765,0.0001828965,0.01684808,0.0001380829,0.000002771588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03773602,0.0002683426,0.9579792,0.0002536815,0.00005055518,0.00005081456,0.00005041089,0.000309273,0.003301775],"genre_scores_gemma":[0.6622577,0.0003559515,0.3326402,0.0001570701,0.00009039555,0.0002246392,0.0002751349,0.0003228258,0.003676029],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005947668,"threshold_uncertainty_score":0.01852077,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2802142240","doi":"10.1016/j.jco.2018.06.002","title":"An upper bound on the smallest singular value of a square random matrix","year":2018,"lang":"en","type":"preprint","venue":"Journal of Complexity","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":2,"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":"National Science Foundation","keywords":"Upper and lower bounds; Combinatorics; Square (algebra); Mathematics; Singular value; Order (exchange); Random matrix; Zero (linguistics); Moment (physics); Unit (ring theory); Matrix (chemical analysis); Second moment of area; Unit square; Value (mathematics); Square matrix; Mathematical analysis; Statistics; Symmetric matrix; Physics; Geometry; Eigenvalues and eigenvectors; Quantum mechanics","authors":[{"name":"Kateryna Tatarko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1036367221087673,"gpt":0.3792191234928621,"spread":0.2755824013840948,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005507284,0.004116734,0.002917311,0.004381197,0.00183411,0.005195329,0.003614605,0.004498147,0.0103496],"category_scores_gemma":[0.05769441,0.001449536,0.001786376,0.002772026,0.005500565,0.009202728,0.006550917,0.008321214,0.003073252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001927506,"about_ca_system_score_gemma":0.001910055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009626609,"about_ca_topic_score_gemma":0.001169338,"domain_scores_codex":[0.9937176,0.001498101,0.0002758789,0.001407229,0.002269005,0.000832167],"domain_scores_gemma":[0.9363903,0.04979715,0.001706936,0.005468572,0.004066993,0.00256992],"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.0006962241,0.0002541913,0.002124266,0.001101344,0.0002285197,0.0006822326,0.0004266173,0.1014905,0.02208484,0.7929907,0.017803,0.06011751],"study_design_scores_gemma":[0.00004639399,0.000167198,0.00103336,0.0002868609,0.0001013263,0.0006425287,0.00009113682,0.3680997,0.006782923,0.6138381,0.008784072,0.0001263463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03435249,0.00705292,0.9072472,0.007095061,0.001508355,0.0001221465,0.001335492,0.001293014,0.03999336],"genre_scores_gemma":[0.7084571,0.01046322,0.2421371,0.003818261,0.0066954,0.000714787,0.002118521,0.001209308,0.02438635],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0103496,"threshold_uncertainty_score":0.03462285,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2784290514","doi":"10.1016/j.jco.2018.05.004","title":"The rank of random regular digraphs of constant degree","year":2018,"lang":"en","type":"preprint","venue":"Journal of Complexity","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"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":"Agence Nationale de la Recherche","keywords":"Combinatorics; Adjacency matrix; Mathematics; Rank (graph theory); Degree (music); Eigenvalues and eigenvectors; Infinity; Constant (computer programming); Graph; Integer (computer science); Regular graph; Simple (philosophy); Adjacency list; Random graph; Discrete mathematics; Simple graph; Directed graph; Line graph; Graph power; Computer science; Physics","authors":[{"name":"Alexander E. Litvak","is_ca":true},{"name":"Anna Lytova","is_ca":false},{"name":"Konstantin Tikhomirov","is_ca":false},{"name":"Nicole Tomczak-Jaegermann","is_ca":true},{"name":"Pierre Youssef","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1607622231782364,"gpt":0.3530931797143105,"spread":0.1923309565360741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00240933,0.001000384,0.00188486,0.004168995,0.00158176,0.006420926,0.002398253,0.002602907,0.007355701],"category_scores_gemma":[0.0302892,0.001351248,0.0006843291,0.002262451,0.004042051,0.008292453,0.002351831,0.002323628,0.0008020194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001836519,"about_ca_system_score_gemma":0.0009833182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001382019,"about_ca_topic_score_gemma":0.001876296,"domain_scores_codex":[0.9972216,0.001023969,0.0001150985,0.0005814339,0.0006385032,0.0004194997],"domain_scores_gemma":[0.9634435,0.02345823,0.004671227,0.002895196,0.001872332,0.003659596],"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.0005531961,0.0001057837,0.004873909,0.0003277457,0.00008756999,0.0003061093,0.0006856458,0.02996159,0.002578471,0.9413474,0.007338383,0.01183411],"study_design_scores_gemma":[0.00006753919,0.00005342169,0.001183723,0.00004786794,0.00004455511,0.0002925418,0.0002012235,0.08961895,0.0006943506,0.9062101,0.00152996,0.00005578435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8675678,0.001353959,0.1034811,0.005326588,0.0001982504,0.00007901214,0.002640746,0.000634148,0.01871834],"genre_scores_gemma":[0.9880968,0.00047412,0.004560533,0.0002735825,0.0003162223,0.00005068839,0.0006274097,0.0001370364,0.005463631],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007355701,"threshold_uncertainty_score":0.02460724,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4407776334","doi":"10.1016/j.jco.2025.101933","title":"Optimal approximation of infinite-dimensional holomorphic functions II: Recovery from i.i.d. pointwise samples","year":2025,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Numerical methods in inverse problems","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pointwise; Mathematics; Holomorphic function; Applied mathematics; Pure mathematics; Mathematical analysis","authors":[{"name":"Ben Adcock","is_ca":true},{"name":"Nick Dexter","is_ca":false},{"name":"Sebastián Moraga","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1511660686982982,"gpt":0.3555206536288033,"spread":0.2043545849305052,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003409409,0.001017593,0.001132673,0.0008473526,0.0002779901,0.001387876,0.001071027,0.001469065,0.001532303],"category_scores_gemma":[0.01823287,0.0005920048,0.000657377,0.0006825263,0.002143309,0.00212446,0.002300236,0.00228557,0.0004392477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008082846,"about_ca_system_score_gemma":0.001134155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001408138,"about_ca_topic_score_gemma":0.001173213,"domain_scores_codex":[0.9992229,0.0003559597,0.00004088181,0.0001256755,0.0001852242,0.00006941475],"domain_scores_gemma":[0.9941367,0.004115517,0.0004191035,0.0007077247,0.000432238,0.0001887931],"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.000455325,0.0001105409,0.001924266,0.0004014093,0.00008670024,0.0001874349,0.0001803159,0.5783396,0.009173011,0.324722,0.004405288,0.08001413],"study_design_scores_gemma":[0.00001008018,0.00002663706,0.0002007495,0.00002381247,0.000006965903,0.00003633774,0.00001593274,0.9637681,0.001588453,0.03377281,0.0005383558,0.00001171132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02430664,0.0003680596,0.9735361,0.0003449635,0.00004507012,0.00001424264,0.0000717102,0.00009496208,0.001218276],"genre_scores_gemma":[0.6691979,0.001867804,0.3208047,0.0002847661,0.0002238149,0.0001430938,0.0006470897,0.0001993094,0.006631525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003409409,"threshold_uncertainty_score":0.01803094,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4311761036","doi":"10.1016/j.jco.2022.101724","title":"The area of empty axis-parallel boxes amidst 2-dimensional lattice points","year":2022,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":2,"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; Austrian Science Fund","keywords":"Mathematics; Lattice (music); Infimum and supremum; Conjecture; Square lattice; Combinatorics; Quadratic equation; Discrete mathematics; Geometry; Condensed matter physics; Physics; Ising model","authors":[{"name":"Thomas Lachmann","is_ca":false},{"name":"Jaspar Wiart","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1286115804029658,"gpt":0.3366526722535477,"spread":0.2080410918505819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009470612,0.0007013317,0.001134443,0.002335533,0.0009219715,0.002744685,0.002112126,0.001295202,0.009720155],"category_scores_gemma":[0.005694648,0.0005768627,0.0003918085,0.001205125,0.002405916,0.003173862,0.001941233,0.0009260703,0.0008507477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005598785,"about_ca_system_score_gemma":0.0004160739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008030506,"about_ca_topic_score_gemma":0.0004429192,"domain_scores_codex":[0.9991009,0.0002314596,0.00004895685,0.0001575961,0.0002963579,0.0001647718],"domain_scores_gemma":[0.9965438,0.001762318,0.0005066629,0.000235979,0.0005018018,0.0004494163],"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.0009857003,0.00013363,0.003243713,0.0002548629,0.00007487711,0.000455926,0.0004300198,0.04992623,0.01200291,0.9048605,0.003877426,0.02375416],"study_design_scores_gemma":[0.000127234,0.0001426817,0.004272489,0.00008042601,0.00004661755,0.0007259156,0.0004635598,0.3396089,0.00607804,0.6434113,0.004958964,0.00008389535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8240403,0.001013554,0.12476,0.0007929989,0.0002589405,0.00005886482,0.0009418623,0.0004599871,0.0476735],"genre_scores_gemma":[0.9649146,0.0003492944,0.02549844,0.0001140649,0.0002020164,0.0001126981,0.0005072505,0.0001328681,0.00816878],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009720155,"threshold_uncertainty_score":0.03251714,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4313478762","doi":"10.1016/j.jco.2022.101726","title":"On the cardinality of lower sets and universal discretization","year":2023,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba; University of Alberta","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Cardinality (data modeling); Linear subspace; Combinatorics; Discretization; Trigonometric polynomial; Discrete mathematics; Norm (philosophy); Trigonometry; Set (abstract data type); Upper and lower bounds; Pure mathematics; Mathematical analysis","authors":[{"name":"Feng Dai","is_ca":true},{"name":"Andriy Prymak","is_ca":true},{"name":"Alexei Shadrin","is_ca":false},{"name":"Vladimir Temlyakov","is_ca":false},{"name":"Sergey Tikhonov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1493214577826029,"gpt":0.3490802865863111,"spread":0.1997588288037082,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006329632,0.0007840145,0.002241113,0.003068185,0.003086816,0.006475658,0.002764305,0.002074092,0.007958377],"category_scores_gemma":[0.0317303,0.00119497,0.002309655,0.002729895,0.008977242,0.01530384,0.006779672,0.008440206,0.0004513515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003867164,"about_ca_system_score_gemma":0.001171344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002233649,"about_ca_topic_score_gemma":0.001894352,"domain_scores_codex":[0.9955108,0.001645277,0.0003059988,0.0007871672,0.001071371,0.0006794308],"domain_scores_gemma":[0.9550956,0.03495098,0.002112004,0.004032044,0.0016838,0.002125514],"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.00006524101,0.00002095365,0.0006539032,0.00003633592,0.00001315976,0.00003122543,0.0002216294,0.004815535,0.0002507753,0.9902096,0.0007489381,0.0029327],"study_design_scores_gemma":[0.000009181312,0.00001120981,0.0003114177,0.00003666572,0.000009233021,0.00003900437,0.0000920915,0.018953,0.0002122696,0.979399,0.0009131983,0.00001382621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4212522,0.002915288,0.4827383,0.008859026,0.0004857342,0.00006677912,0.001121356,0.0003402325,0.08222104],"genre_scores_gemma":[0.944323,0.001129675,0.04526825,0.0007631793,0.0004880639,0.0000924929,0.0006545323,0.0001976391,0.007083151],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007958377,"threshold_uncertainty_score":0.03347468,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033053263","doi":"10.1016/j.jco.2014.08.001","title":"Tractability using periodized generalized Faure sequences","year":2014,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Actua; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Space (punctuation); Dimension (graph theory); Order (exchange); Applied mathematics; Pure mathematics; Computer science","authors":[{"name":"Christiane Lemieux","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2329670657392817,"gpt":0.3934327223143539,"spread":0.1604656565750721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001464567,0.0008695807,0.00115797,0.001860676,0.001027178,0.002586492,0.001202018,0.001378026,0.008754165],"category_scores_gemma":[0.01024585,0.0005889107,0.001445867,0.001582751,0.002189175,0.006305679,0.002532447,0.00264114,0.0006749922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001509003,"about_ca_system_score_gemma":0.0006448181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001334607,"about_ca_topic_score_gemma":0.001053822,"domain_scores_codex":[0.9990807,0.0003056539,0.0000550916,0.0002013668,0.0002317656,0.0001254226],"domain_scores_gemma":[0.9951208,0.003216051,0.0004629836,0.0006583625,0.0002986975,0.0002430314],"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.00007855074,0.00001699422,0.0002237226,0.00004790212,0.00002043143,0.00005626712,0.00008029459,0.03485494,0.001089264,0.9527821,0.0006765191,0.01007301],"study_design_scores_gemma":[0.00001007445,0.00002837894,0.0001225064,0.00001433041,0.000008876254,0.00004957051,0.00001630883,0.103369,0.0005062895,0.8947704,0.001092949,0.00001128572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1344838,0.0006712967,0.8311749,0.0008134866,0.0001215311,0.00005342574,0.0002546866,0.0003384495,0.03208847],"genre_scores_gemma":[0.8989781,0.0008811496,0.08485763,0.0002412337,0.0002291635,0.0001325082,0.0003516874,0.0002748651,0.01405368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008754165,"threshold_uncertainty_score":0.02928561,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3082224601","doi":"10.1016/j.jco.2021.101557","title":"Homotopy techniques for solving sparse column support determinantal polynomial systems","year":2021,"lang":"en","type":"preprint","venue":"Journal of Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; European Commission","keywords":"Combinatorics; Mathematics; Polynomial; Algebraic number; Invariant (physics); Mathematical analysis; Mathematical physics","authors":[{"name":"George Labahn","is_ca":false},{"name":"Mohab Safey El Din","is_ca":false},{"name":"Éric Schost","is_ca":false},{"name":"Thi Xuan Vu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05357499197331212,"gpt":0.2973128765286256,"spread":0.2437378845553135,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003687155,0.0006284104,0.0006907531,0.000723958,0.0006506183,0.0008057837,0.001017643,0.0008128544,0.01087724],"category_scores_gemma":[0.002956444,0.0003100953,0.0005711886,0.0007550842,0.001019005,0.001744546,0.002049677,0.00245464,0.001534155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00041468,"about_ca_system_score_gemma":0.0005336509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001268654,"about_ca_topic_score_gemma":0.002904088,"domain_scores_codex":[0.9997438,0.00006946565,0.000009690534,0.00003522917,0.0001077706,0.00003419045],"domain_scores_gemma":[0.9993207,0.0003919502,0.00003200753,0.0001088133,0.0000987697,0.00004774997],"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.0001905886,0.0002221217,0.0007024458,0.0003423248,0.00007092611,0.0001968139,0.0004009906,0.1324276,0.01370137,0.5758477,0.01217088,0.2637262],"study_design_scores_gemma":[0.00004118877,0.00007517902,0.0001407102,0.00002044542,0.00001524056,0.00007270816,0.0001092202,0.5738568,0.003358897,0.4166347,0.005657875,0.00001695618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04068487,0.000227012,0.9421075,0.0004978572,0.0001709268,0.00006307415,0.00009679723,0.000596617,0.01555536],"genre_scores_gemma":[0.5924146,0.0004742636,0.3829621,0.0002637587,0.0002391791,0.00016516,0.0003139426,0.0005090922,0.02265785],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01087724,"threshold_uncertainty_score":0.03638804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}