{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000679403,0.0001139189,0.0002020679,0.00006158184,0.0002714001,0.0001984336,0.0008393648,0.00003511366,0.000007489946],"category_scores_gemma":[0.0000567549,0.00006916034,0.0001785376,0.0001908769,0.00005126463,0.0003626799,0.00008809284,0.000188378,0.00006153219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001050699,"about_ca_system_score_gemma":0.00008206564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006049601,"about_ca_topic_score_gemma":0.00001001818,"domain_scores_codex":[0.9987738,0.00008410811,0.0004840432,0.0001251815,0.0003243946,0.0002085186],"domain_scores_gemma":[0.998553,0.0004465822,0.000456913,0.0002105595,0.0002353388,0.00009756946],"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.0002028824,0.0001451562,0.0001246744,0.00003629034,0.0000844903,0.000008735936,0.0005474394,0.0005324288,0.00006941015,0.8236914,0.007628533,0.1669286],"study_design_scores_gemma":[0.002953392,0.0008684896,0.01145696,0.0003458916,0.00005340999,0.0006289849,0.0002488953,0.6435671,0.004161631,0.1395139,0.1956542,0.0005471875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.287492,0.0001674404,0.6977208,0.01122063,0.00145888,0.0002111615,0.000005529434,0.00007853303,0.001645049],"genre_scores_gemma":[0.9444093,0.000005957521,0.05401525,0.0002944663,0.001146967,0.000002932241,5.876032e-7,0.000007029344,0.0001174999],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6841775,"threshold_uncertainty_score":0.2820277,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001100454,0.0001049932,0.000426256,0.0001045321,0.000130022,0.0000101791,0.0002092258,0.00004186342,0.00004255033],"category_scores_gemma":[0.0008157557,0.00007259593,0.0001267261,0.0002446652,0.0005464674,0.000140149,0.00005119219,0.0003131321,9.330873e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004451739,"about_ca_system_score_gemma":0.00006798509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007770789,"about_ca_topic_score_gemma":0.00003221117,"domain_scores_codex":[0.997924,0.0006774469,0.0006570552,0.00008753257,0.0005153753,0.0001386261],"domain_scores_gemma":[0.9974039,0.001629728,0.0005668091,0.0001274651,0.0002123302,0.00005982372],"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.0003529719,0.002214582,0.02804022,0.0001218351,0.0001207002,0.00003036998,0.003663587,0.0001639523,0.0005369404,0.9579594,0.0005632163,0.006232276],"study_design_scores_gemma":[0.0003956331,0.0001300866,0.2955524,0.00002121237,0.00001974611,0.0001879016,0.00007059232,0.006872189,0.00004833666,0.6966177,0.00003163976,0.00005256158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5638104,0.00003120159,0.4353639,0.0005369483,0.00004464419,0.0000789895,0.000007899976,0.000004402346,0.0001216496],"genre_scores_gemma":[0.6574838,0.000004925844,0.3424315,0.00003179015,0.00003946084,8.62281e-7,0.000001079501,0.000004342392,0.000002271201],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2675122,"threshold_uncertainty_score":0.2960376,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007368588,0.0001394447,0.0002646882,0.00006957798,0.000296737,0.0001071659,0.001428496,0.00004108186,0.00001625619],"category_scores_gemma":[0.0000861357,0.00006926189,0.0002053472,0.0003516703,0.001145789,0.0003020634,0.0004311622,0.0004507592,0.000001550111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000267243,"about_ca_system_score_gemma":0.00007000665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007683074,"about_ca_topic_score_gemma":0.0001428163,"domain_scores_codex":[0.9985258,0.0001763741,0.0004321351,0.0001592937,0.0005132236,0.0001931934],"domain_scores_gemma":[0.9984467,0.0001772183,0.0005173563,0.0006275059,0.0001386224,0.00009261172],"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.00002020653,0.0001403965,0.000578666,0.00001715518,0.00002884699,0.000003107801,0.0006436264,0.00004492232,0.0001362639,0.9977133,0.0003044168,0.0003690451],"study_design_scores_gemma":[0.0005403383,0.0002225888,0.08999164,0.00009498822,0.00001201881,0.00009220235,0.00004288659,0.0005638499,0.0007112431,0.9066818,0.0009601164,0.00008627495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7885252,0.0003195548,0.1881149,0.02093616,0.0004563319,0.0003013012,0.00005102657,0.00002241456,0.001273148],"genre_scores_gemma":[0.985998,0.00003031842,0.01345347,0.0004543272,0.00005639727,8.914648e-7,6.28094e-7,0.00000408907,0.000001910982],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1974728,"threshold_uncertainty_score":0.4221707,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002287356,0.00006408038,0.0001804388,0.00002610395,0.00001805638,0.000009365244,0.0002121717,0.0000265315,0.00001640132],"category_scores_gemma":[0.0001260579,0.00004201648,0.0000802025,0.00008268526,0.00009189248,0.00006408566,0.00003768092,0.0001643954,0.000001328469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004336255,"about_ca_system_score_gemma":0.00004489846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008547196,"about_ca_topic_score_gemma":0.000005315828,"domain_scores_codex":[0.9993669,0.00004302001,0.0002700703,0.00003226366,0.0002065215,0.00008126318],"domain_scores_gemma":[0.9993677,0.00004873927,0.0001263324,0.0001882256,0.0002068451,0.00006220303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001232606,0.001768597,0.2330528,0.0007414641,0.001559629,0.0001722224,0.005893431,0.1264485,0.1963773,0.1100547,0.3030941,0.01960466],"study_design_scores_gemma":[0.00143397,0.0004917246,0.1951583,0.0004862958,0.0001525443,0.0004456253,0.0002499292,0.1461647,0.3631123,0.2762774,0.01559325,0.0004339342],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9793226,0.0001891587,0.01763694,0.00009036008,0.0004478417,0.00004649987,0.000003228396,0.00004465831,0.00221875],"genre_scores_gemma":[0.9889484,0.000002700713,0.01095835,0.00001401756,0.00006711866,1.778051e-7,1.089627e-7,0.000006877156,0.000002262291],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2875009,"threshold_uncertainty_score":0.1713382,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001345732,0.000158379,0.0003304094,0.0001213769,0.0001784489,0.0004103971,0.001023774,0.00005054799,0.000002208705],"category_scores_gemma":[0.0001165364,0.0001050889,0.0002196244,0.0002027724,0.00008749244,0.0006800877,0.0002118978,0.000250457,0.00000458041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001625134,"about_ca_system_score_gemma":0.0004314966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002791438,"about_ca_topic_score_gemma":0.000008978288,"domain_scores_codex":[0.998405,0.0001117516,0.0005709763,0.0001725014,0.0004409332,0.0002988494],"domain_scores_gemma":[0.9983367,0.0002659184,0.0005926081,0.0002452534,0.0003453705,0.0002141124],"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.0009888578,0.0008632544,0.0006491263,0.0001348296,0.001306205,0.0002236978,0.02328759,0.08221752,0.0008379294,0.1726229,0.1937395,0.5231285],"study_design_scores_gemma":[0.001319164,0.0003450431,0.001345032,0.00004388508,0.00002370329,0.0002244315,0.00015807,0.9823604,0.00007384893,0.006352235,0.007596539,0.0001575974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1342429,0.0003729719,0.8607022,0.001388765,0.002967968,0.0001974506,0.000008965524,0.00003105163,0.00008765613],"genre_scores_gemma":[0.8558863,0.000003383283,0.1421482,0.0002643894,0.001581735,0.000006351767,6.769518e-7,0.00001263292,0.0000963377],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9001429,"threshold_uncertainty_score":0.4285401,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006551783,0.0001026967,0.0002580614,0.0001214923,0.0001285649,0.0001320645,0.0006041975,0.0000338496,0.000004495345],"category_scores_gemma":[0.000183624,0.00008783982,0.0001721867,0.000132672,0.00004746042,0.0003184099,0.0001095552,0.0001201914,0.00000673054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004447437,"about_ca_system_score_gemma":0.0001117203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007600839,"about_ca_topic_score_gemma":0.000003074833,"domain_scores_codex":[0.9988819,0.00007814205,0.0004856537,0.0001299629,0.0002143195,0.0002099893],"domain_scores_gemma":[0.9987596,0.0003090558,0.0004716895,0.0001559398,0.000173267,0.0001304908],"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.00002635105,0.0000635662,0.00005457995,0.00001757563,0.0000230957,0.000006222128,0.0002445536,0.00003997945,0.0003756215,0.03079394,0.001653044,0.9667014],"study_design_scores_gemma":[0.0009803602,0.000417869,0.002042851,0.00002903925,0.00001282702,0.0001797784,0.000006068757,0.8423358,0.0004995154,0.1453803,0.007987075,0.0001285537],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0511065,0.0000297324,0.9469866,0.0007933901,0.0007868148,0.00007743492,0.000002180481,0.0000276024,0.0001897163],"genre_scores_gemma":[0.4712231,6.596701e-7,0.5277023,0.000278149,0.0007606259,0.000001556214,5.117319e-7,0.000005450077,0.00002764934],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9665729,"threshold_uncertainty_score":0.3582004,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002020197,0.0001000626,0.0003286374,0.0001106044,0.00002170029,0.000006424041,0.0001179786,0.00004012627,0.00004201784],"category_scores_gemma":[0.0001457423,0.00008287529,0.0001312181,0.0001562261,0.00003870353,0.0001626725,0.00001700479,0.0001462368,0.000001836496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007471009,"about_ca_system_score_gemma":0.000007171051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001162335,"about_ca_topic_score_gemma":0.000007384282,"domain_scores_codex":[0.9992963,0.00002013964,0.0003680259,0.00006314286,0.0001094316,0.000142945],"domain_scores_gemma":[0.9994704,0.0001628762,0.0001191824,0.00008611074,0.000100548,0.000060874],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.008849894,0.005216526,0.06588133,0.001385686,0.004479321,0.001811528,0.01484523,0.02479334,0.5388058,0.08125203,0.01666469,0.2360146],"study_design_scores_gemma":[0.001753024,0.000703062,0.1056673,0.0002340939,0.0001459614,0.00009734697,0.00008612645,0.05478881,0.2490277,0.5865431,0.0005303042,0.0004230313],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6623614,0.0004829955,0.3359263,0.00009202888,0.0001145281,0.0001959787,0.0000112911,0.0001002666,0.0007152382],"genre_scores_gemma":[0.6722909,0.00001344275,0.3276294,0.00002618129,0.00002215085,0.000002400085,9.633317e-7,0.00001152467,0.000003059918],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5052912,"threshold_uncertainty_score":0.3379556,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.01368658,0.004965653,0.00281178,0.002883429,0.00733163,0.007313482,0.009696309,0.009632624,0.06949697],"category_scores_gemma":[0.01177948,0.00808933,0.009228971,0.004908449,0.007890548,0.007260092,0.007028177,0.008635663,0.005031206],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002142502,"about_ca_system_score_gemma":0.006587259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006522063,"about_ca_topic_score_gemma":0.004329847,"domain_scores_codex":[0.9582636,0.003085209,0.01111327,0.00708258,0.01137321,0.009082073],"domain_scores_gemma":[0.9624431,0.009605772,0.01385062,0.006744826,0.001920893,0.005434793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.006714655,0.002549361,0.00003197455,0.006541214,0.007334339,0.002910146,0.005393995,0.002999421,0.008175965,0.8241947,0.1290692,0.004084979],"study_design_scores_gemma":[0.00865902,0.008331598,0.0001359638,0.007289469,0.008827897,0.01141989,0.007280298,0.3004216,0.5985592,0.03175322,0.01002761,0.007294227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8288873,0.004279748,0.01667856,0.003168339,0.008665512,0.0005712649,0.003397289,0.0014161,0.1329359],"genre_scores_gemma":[0.9372402,0.00457026,0.03376088,0.004780769,0.007873715,0.004210149,0.00354873,0.003388189,0.0006270958],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7924415,"threshold_uncertainty_score":0.9990445,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002311897,0.00007652034,0.0002405429,0.000105289,0.00008390644,0.00003906096,0.0001335839,0.00003820204,0.0002209891],"category_scores_gemma":[0.001375314,0.00005411214,0.000152383,0.00006494189,0.00005018997,0.000157112,0.00001631684,0.0001593009,0.00000793654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004180285,"about_ca_system_score_gemma":0.00004285355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000163339,"about_ca_topic_score_gemma":0.000009779774,"domain_scores_codex":[0.9988754,0.00003049205,0.0005897391,0.00005641983,0.0002906554,0.0001572516],"domain_scores_gemma":[0.9982235,0.0007909358,0.0003516055,0.0001058082,0.0004363807,0.00009176116],"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.00006120698,0.0001207421,0.00001306772,0.00008979816,0.00001743675,0.000001916439,0.0002597945,2.508439e-7,0.0003833969,0.9927323,0.002411253,0.003908842],"study_design_scores_gemma":[0.000366879,0.0001126978,0.0003448819,0.00007196677,0.00001644282,0.00007167961,0.0001864777,0.002437592,0.003815348,0.9880528,0.00446265,0.00006060851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2648243,0.00001590745,0.720599,0.0005735369,0.00009739388,0.0001516684,0.000002201468,0.00001638002,0.01371964],"genre_scores_gemma":[0.09288371,0.000002150833,0.9063832,0.0001271753,0.0002434092,0.000001207689,0.000001506091,0.00001100571,0.000346612],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1857842,"threshold_uncertainty_score":0.2419676,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003622548,0.000106797,0.000365929,0.00006143519,0.00005842074,0.00001911854,0.00006780319,0.00004692187,0.0000928057],"category_scores_gemma":[0.0001299136,0.00007069856,0.00004945037,0.00005835978,0.0003038774,0.0003731952,0.00001329726,0.00009087138,1.525026e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001270758,"about_ca_system_score_gemma":0.00004316817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001964264,"about_ca_topic_score_gemma":0.00002047937,"domain_scores_codex":[0.9989429,0.00008632094,0.0005869241,0.00009101909,0.0002043387,0.00008853104],"domain_scores_gemma":[0.9985355,0.0001721699,0.0007207605,0.0001103527,0.0003703428,0.00009093453],"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.0004803577,0.0002081533,0.001123999,0.000296239,0.00005492716,9.209713e-7,0.001045046,3.631051e-11,0.00001753537,0.9964335,0.000001166475,0.0003381804],"study_design_scores_gemma":[0.0008091921,0.0003231977,0.006957381,0.0002471697,0.00009552678,0.000255023,0.0003557763,0.003234705,0.004593532,0.9830397,0.000008139179,0.00008061248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.983466,0.00001943772,0.01492418,0.00005042622,0.00001705469,0.0001801288,0.0000165796,0.000007963607,0.001318194],"genre_scores_gemma":[0.009646091,0.000008550142,0.990283,0.00001138095,0.00002644867,0.000001696791,0.000003479144,0.000009139814,0.00001021135],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9753588,"threshold_uncertainty_score":0.2883003,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00590547,0.0001455749,0.0005298657,0.0001068766,0.0000651312,0.00005497713,0.0002792617,0.00007933344,0.00005137183],"category_scores_gemma":[0.004727212,0.00008361855,0.0002467614,0.0001866094,0.00008709182,0.0003248643,0.00002944129,0.0002377931,3.704276e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005307698,"about_ca_system_score_gemma":0.00006342963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001184546,"about_ca_topic_score_gemma":0.00003655755,"domain_scores_codex":[0.9977489,0.0009139119,0.0008621886,0.000109679,0.0002146592,0.0001507125],"domain_scores_gemma":[0.9962319,0.001730761,0.001257579,0.0002601981,0.0004806914,0.00003882933],"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.00007532243,0.0005712495,0.00005364358,0.0004171771,0.00005989182,5.22962e-7,0.006596451,0.000004934548,0.003858915,0.9409144,0.0009040176,0.04654348],"study_design_scores_gemma":[0.0005397511,0.0003926083,0.0003915532,0.0001517914,0.00005498042,0.00002337667,0.0003749633,0.06447594,0.01796832,0.9144158,0.001110664,0.0001002413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08613913,0.0001730448,0.9117922,0.0005378265,0.0001493642,0.0006696884,0.000004682362,0.00000764657,0.0005264355],"genre_scores_gemma":[0.1144605,0.00002532739,0.8852689,0.00003387129,0.00008609954,0.00003652837,7.976606e-7,0.0000126994,0.00007524883],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06447101,"threshold_uncertainty_score":0.5659256,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002791121,0.0001678548,0.0004543505,0.0004174685,0.0002426944,0.0003785329,0.0006923597,0.00005089399,0.005215305],"category_scores_gemma":[0.003543663,0.0001206618,0.000274019,0.0004178563,0.0001876186,0.000965006,0.0001003827,0.0005171089,0.0007399796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000229078,"about_ca_system_score_gemma":0.00009082887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007815888,"about_ca_topic_score_gemma":0.00001051715,"domain_scores_codex":[0.9958549,0.001162078,0.001137314,0.0002351641,0.00133697,0.0002735769],"domain_scores_gemma":[0.9946687,0.002871842,0.0009842763,0.0003737553,0.0008328253,0.0002686551],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00761751,0.002337059,0.006014566,0.00001224724,0.0004563924,0.0001583157,0.007253898,0.003935545,0.5436669,0.17306,0.1048698,0.1506178],"study_design_scores_gemma":[0.004111462,0.006128937,0.1099455,0.0001991642,0.00004980656,0.0005558069,0.004269063,0.0687497,0.03112794,0.7590216,0.01513685,0.0007041672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9086735,0.00004937448,0.08038651,0.001022723,0.00101416,0.0002088034,0.000005057157,0.00002305076,0.008616854],"genre_scores_gemma":[0.8260251,0.00000171595,0.1730472,0.0003488232,0.0001941672,0.000002879567,3.429537e-7,0.00001206773,0.0003677441],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5859617,"threshold_uncertainty_score":0.995694,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008767974,0.0000808637,0.0002014303,0.00007868863,0.00008166359,0.0001252189,0.000365434,0.00002605143,0.00009443812],"category_scores_gemma":[0.0002036216,0.00006994491,0.0001403519,0.000265562,0.00003436817,0.0004988541,0.0001350768,0.0001517316,0.00001936227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008395632,"about_ca_system_score_gemma":0.0003681058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000660976,"about_ca_topic_score_gemma":0.00001721457,"domain_scores_codex":[0.9986335,0.0002195063,0.0004376183,0.0001118695,0.000462148,0.0001353587],"domain_scores_gemma":[0.9985018,0.00007007628,0.0003745474,0.0002063761,0.0007447473,0.0001024995],"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.00007930007,0.001036727,0.001191645,0.00003717733,0.000192861,0.0002285184,0.003436738,0.002479422,0.0170766,0.1241875,0.004252611,0.8458009],"study_design_scores_gemma":[0.003557389,0.0001660767,0.1215234,0.00007183198,0.00004446588,0.0007393475,0.0001275207,0.6279746,0.01355879,0.2301078,0.001872728,0.0002560466],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2049814,0.0002076028,0.7912651,0.002196544,0.0007794801,0.00005331215,8.255125e-7,0.00001974644,0.0004960275],"genre_scores_gemma":[0.8190744,0.000006037529,0.1803749,0.0002870502,0.0001942885,8.963232e-7,0.000001691315,0.000003394643,0.00005738453],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8455448,"threshold_uncertainty_score":0.2852271,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","metaepi_broad","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.01630768,0.007322169,0.003323314,0.005589905,0.01169351,0.01209295,0.01678622,0.01516633,0.4688826],"category_scores_gemma":[0.01468594,0.0137648,0.01393513,0.009734044,0.01513428,0.01084382,0.01316918,0.01340217,0.009781474],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003001196,"about_ca_system_score_gemma":0.01209122,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0100779,"about_ca_topic_score_gemma":0.007042088,"domain_scores_codex":[0.9348077,0.005532,0.01428825,0.01172028,0.01873972,0.01491201],"domain_scores_gemma":[0.9449865,0.0132272,0.0182891,0.01170752,0.002553856,0.00923582],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.01406981,0.002606172,0.00006314305,0.003870109,0.009952321,0.007169627,0.00468566,0.008162143,0.01056573,0.5128862,0.4202269,0.005742216],"study_design_scores_gemma":[0.01321362,0.01243365,0.0001832306,0.006707395,0.0106163,0.01745109,0.009049667,0.07161567,0.8229293,0.00372174,0.02080331,0.01127499],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5910146,0.006268,0.007464156,0.00270374,0.01647869,0.0004893424,0.005066238,0.00183539,0.3686798],"genre_scores_gemma":[0.9281347,0.006275956,0.0233653,0.006577524,0.0126564,0.006697295,0.008478846,0.006559316,0.001254676],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8123636,"threshold_uncertainty_score":0.9965141,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006224132,0.00009971469,0.0003084704,0.0001215409,0.00005089733,0.00002872484,0.0001029799,0.00005726387,0.0006136746],"category_scores_gemma":[0.001236508,0.00007010523,0.0002251071,0.00009846056,0.00005566711,0.0001368946,0.00001244451,0.000115386,0.00000912213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006280472,"about_ca_system_score_gemma":0.00002767205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009272446,"about_ca_topic_score_gemma":0.000004274969,"domain_scores_codex":[0.9985355,0.00006421377,0.00086781,0.00007122011,0.0003578942,0.0001033786],"domain_scores_gemma":[0.9972535,0.0005394763,0.0007833484,0.000118298,0.00123914,0.00006617051],"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.0002482891,0.0009909977,0.0001222043,0.0005102992,0.0001138059,2.760495e-7,0.001286834,0.008488132,0.001042516,0.9758236,0.00420323,0.007169757],"study_design_scores_gemma":[0.0005808172,0.0001386138,0.001106314,0.00006584707,0.00002620483,0.000005947323,0.0001665673,0.5146558,0.00060616,0.4824666,0.0001301163,0.00005099315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5809817,0.000008042366,0.4176238,0.0003498876,0.0001100917,0.0003575528,0.000006260667,0.000009702074,0.0005530478],"genre_scores_gemma":[0.8455065,4.218337e-7,0.1541969,0.00003603516,0.00009973444,0.00001032229,0.000001641181,0.000008483906,0.0001399003],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5061677,"threshold_uncertainty_score":0.6719307,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001988875,0.0002665486,0.0008810778,0.0001420611,0.0002091857,0.0001456956,0.000981605,0.0001856711,0.0003866872],"category_scores_gemma":[0.0003541906,0.0001628052,0.0006128827,0.0001220157,0.0002762848,0.00004949103,0.0001796188,0.0007575453,0.00001154539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007134519,"about_ca_system_score_gemma":0.0002113012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004693066,"about_ca_topic_score_gemma":0.00001257454,"domain_scores_codex":[0.9974967,0.0003543709,0.001116411,0.0001944649,0.0006434729,0.0001946095],"domain_scores_gemma":[0.9952074,0.0009862527,0.002127756,0.0009420303,0.0006234493,0.0001131547],"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.002182505,0.001835622,0.0007024899,0.0009770856,0.001023282,0.00001770842,0.002346213,0.0003567473,0.0008003846,0.9745136,0.01494385,0.0003005039],"study_design_scores_gemma":[0.002193396,0.0002684267,0.001905401,0.0004986047,0.0003477396,0.00005729335,0.0001861298,0.002630099,0.0003572696,0.9890764,0.002281911,0.0001973299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9767638,0.0002642834,0.01855645,0.001742827,0.0003133133,0.0006437705,0.00006809675,0.00001740086,0.001630067],"genre_scores_gemma":[0.9561118,0.00006430994,0.04265295,0.00008342789,0.0009673435,0.00001311361,0.000007200826,0.00003896876,0.00006091057],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0240965,"threshold_uncertainty_score":0.6639004,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003012257,0.0001937681,0.000904131,0.0001305318,0.0001514109,0.00002376752,0.0009115468,0.0001447935,0.00007781929],"category_scores_gemma":[0.0006263494,0.0001210865,0.0007496961,0.0001498238,0.001427926,0.00003560296,0.0002404472,0.0005538997,0.000001213362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001962059,"about_ca_system_score_gemma":0.0001811703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007299994,"about_ca_topic_score_gemma":0.00001876898,"domain_scores_codex":[0.9974189,0.0003712976,0.001448966,0.0001229158,0.0004794581,0.0001584145],"domain_scores_gemma":[0.993251,0.001603519,0.003268961,0.0008178795,0.0009816784,0.00007702101],"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.000698518,0.000223916,0.0001711501,0.0002746137,0.0004886913,0.000002056948,0.0003369849,0.000003258431,0.0006008195,0.9935704,0.003130763,0.0004988138],"study_design_scores_gemma":[0.001265911,0.00008958596,0.0007713221,0.0004414999,0.0002830042,0.00004131911,0.0001435455,0.00004144922,0.004539915,0.990612,0.001665979,0.000104418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9696606,0.001183155,0.01975066,0.0007216199,0.0004719315,0.0006343455,0.0001538623,0.00001514676,0.007408612],"genre_scores_gemma":[0.9755253,0.0002695209,0.02395768,0.0000131423,0.0001500124,0.000007022564,0.000002513095,0.00001840077,0.00005641605],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007352196,"threshold_uncertainty_score":0.5261252,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012348,0.0001693324,0.0006281067,0.000295626,0.0001503348,0.00002322543,0.0002842302,0.0001133358,0.0006380557],"category_scores_gemma":[0.002966474,0.0001462789,0.000294962,0.0003907853,0.000260107,0.0002345933,0.0001910451,0.0004614347,0.000007678456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001085204,"about_ca_system_score_gemma":0.0001878586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000551308,"about_ca_topic_score_gemma":0.000007582031,"domain_scores_codex":[0.9976898,0.0003547547,0.001162494,0.0001590817,0.0004555958,0.0001782958],"domain_scores_gemma":[0.9954775,0.002466141,0.00110724,0.0003155993,0.0005460021,0.00008754125],"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.005181703,0.00674742,0.009964224,0.001177467,0.004417757,0.00005837141,0.002270006,0.007886318,0.06373032,0.7638854,0.09766601,0.03701505],"study_design_scores_gemma":[0.0009109907,0.0002871466,0.003203823,0.0002876185,0.0001999746,0.00002622494,0.0001342339,0.002238244,0.003384875,0.9871678,0.00202641,0.0001326414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.6633217,0.0001281536,0.3332487,0.0007599508,0.0007947629,0.000149231,0.00009322659,0.0000257998,0.00147841],"genre_scores_gemma":[0.1132823,0.00001170845,0.8862302,0.0001565581,0.0001197989,0.000003630971,0.00001001744,0.00001421214,0.0001716604],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5529814,"threshold_uncertainty_score":0.6986263,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001714377,0.0001039174,0.0003143764,0.00006378029,0.0003233431,0.00002892667,0.0003316991,0.00002507468,0.001449539],"category_scores_gemma":[0.0008728426,0.00006367375,0.0001963418,0.0001411945,0.0001431558,0.0001131677,0.0001142632,0.0003549025,0.00000687605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000081926,"about_ca_system_score_gemma":0.00008178453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004724395,"about_ca_topic_score_gemma":0.00001100499,"domain_scores_codex":[0.9979007,0.0002381471,0.0008426281,0.00007483181,0.0008096228,0.0001340241],"domain_scores_gemma":[0.9975386,0.0009644373,0.0008528754,0.0002175922,0.0003591323,0.00006739984],"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.0001391407,0.0003556166,0.00005740545,0.00004365229,0.00005701884,0.000003061411,0.0004073355,0.00001035856,0.0001234702,0.9832864,0.01525995,0.0002566235],"study_design_scores_gemma":[0.0004554145,0.0001954662,0.0009085548,0.00003264972,0.00003244922,0.0001429196,0.0005325309,0.007639565,0.0003352491,0.9845415,0.005111603,0.00007210898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9630901,0.0001323974,0.01615012,0.006813909,0.0003759662,0.0002969845,0.00002586775,0.00002946953,0.01308518],"genre_scores_gemma":[0.6709846,0.00001400878,0.3264515,0.0005686255,0.0001666047,0.00001562222,0.000007572861,0.00002985595,0.001761621],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3103013,"threshold_uncertainty_score":0.9994633,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008685199,0.00005368332,0.0001977895,0.00005096479,0.0000628463,0.00001258395,0.00008174698,0.00002510305,0.0002487751],"category_scores_gemma":[0.0006358423,0.00003042218,0.00008320885,0.0001389803,0.00009653827,0.00004377555,0.00003118123,0.0000990835,0.000005590645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001462472,"about_ca_system_score_gemma":0.00002052612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004867863,"about_ca_topic_score_gemma":0.000002858013,"domain_scores_codex":[0.9993094,0.0001083658,0.0002738975,0.00004011289,0.000200387,0.00006783043],"domain_scores_gemma":[0.9983913,0.001104096,0.0002354774,0.0001278751,0.0001030745,0.00003818433],"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.00007261889,0.00005554168,0.0001948962,0.00005632055,0.00004506059,0.000003844939,0.000237507,0.000005466689,0.0001009824,0.984807,0.01428275,0.0001380105],"study_design_scores_gemma":[0.0001846646,0.0001538409,0.004433692,0.00007117749,0.0000423661,0.00001717346,0.0002033292,0.0006017694,0.0001939452,0.9931163,0.0009417141,0.00004006166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9912302,0.000007431332,0.002908723,0.001685998,0.0001315323,0.00006981838,0.0000146842,0.000008417797,0.003943164],"genre_scores_gemma":[0.9983429,0.00001010291,0.001397588,0.00003039078,0.00004707166,3.301328e-7,6.029143e-7,0.000004939843,0.0001660157],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01334104,"threshold_uncertainty_score":0.2723913,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001550311,0.0001167564,0.0004295206,0.00006325624,0.0001001066,0.00006878882,0.0001836212,0.00006219051,0.001051352],"category_scores_gemma":[0.001601955,0.00007853149,0.000196597,0.0001003237,0.0001230304,0.0002407632,0.00001708148,0.0002064168,0.00000602913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006479376,"about_ca_system_score_gemma":0.00005652452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007233956,"about_ca_topic_score_gemma":0.000009937399,"domain_scores_codex":[0.9983478,0.0002856277,0.0007588404,0.0000862349,0.0003942435,0.0001272521],"domain_scores_gemma":[0.9984524,0.0003006323,0.0006166481,0.0001730939,0.0003595382,0.00009763276],"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.00006148336,0.0002166871,0.0001270111,0.0001317452,0.00002861094,0.00000120528,0.0006922586,0.000003223525,0.00380189,0.9936154,0.0004290674,0.0008913932],"study_design_scores_gemma":[0.0005520584,0.00007734659,0.0003200372,0.00005185146,0.000035213,0.00009161261,0.0001221548,0.03932912,0.002340524,0.9558193,0.001168847,0.00009194881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.8313553,0.00001027952,0.1651148,0.0005860572,0.0001114306,0.00009536544,0.000001968142,0.00001909992,0.00270573],"genre_scores_gemma":[0.4807307,0.000001526044,0.5189636,0.00009829544,0.0001539747,8.554504e-7,7.172725e-7,0.000007164745,0.00004316494],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3538488,"threshold_uncertainty_score":0.9998618,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001125436,0.0003464265,0.0009866637,0.0002905087,0.0002047225,0.001052999,0.001723066,0.0002575361,0.00001338518],"category_scores_gemma":[0.0001137113,0.0003389223,0.0006521983,0.0001544677,0.0001090504,0.0005626798,0.001334997,0.0007201586,0.000002370148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002840332,"about_ca_system_score_gemma":0.00143462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001241122,"about_ca_topic_score_gemma":0.00003591172,"domain_scores_codex":[0.9971629,0.0001378387,0.001282988,0.0004531019,0.0005431976,0.0004200187],"domain_scores_gemma":[0.9965609,0.0002176815,0.001735983,0.0005619694,0.000693631,0.0002298736],"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.001667347,0.004982553,0.004739898,0.008572236,0.002990532,0.005298648,0.01367869,0.003003954,0.02931734,0.06986955,0.1768636,0.6790156],"study_design_scores_gemma":[0.00637496,0.005502937,0.02269552,0.006603451,0.0007228737,0.01337663,0.0007008806,0.6950616,0.06597428,0.1026103,0.07510431,0.005272175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2874299,0.0003902669,0.7048401,0.0005027785,0.005808477,0.0006415331,0.00004459598,0.0001087349,0.0002335565],"genre_scores_gemma":[0.7944109,0.00003382629,0.2033204,0.0001298405,0.001923864,0.00002941076,0.00001999493,0.00002515568,0.0001066178],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6920577,"threshold_uncertainty_score":0.999984,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}