{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":32,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":32,"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":"8d997db9e089","filters":{"venue":"Foundations of Computational Mathematics"}},"results":[{"id":"W2169501582","doi":"10.1007/s10208-013-9162-z","title":"Solving Quadratic Equations via PhaseLift When There Are About as Many Equations as Unknowns","year":2013,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Advanced X-ray Imaging Techniques","field":"Physics and Astronomy","cited_by":301,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Air Force Office of Scientific Research; University of British Columbia","keywords":"Mathematics; Quadratic equation; Order (exchange); Combinatorics; Applied mathematics; Quadratic programming; Positive-definite matrix; Pure mathematics; Mathematical optimization; Geometry; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02125774372070195,"gpt":0.3107374088664436,"spread":0.2894796651457416,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001763138,0.0002575406,0.0003208809,0.0002267583,0.0004219075,0.0001909966,0.0003629435,0.00004709686,0.003474999],"category_scores_gemma":[0.0002701796,0.0002666371,0.0001487055,0.0003016674,0.0001663493,0.0007514083,0.00009190376,0.0001807089,0.001239139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006557492,"about_ca_system_score_gemma":0.0002298512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001998024,"about_ca_topic_score_gemma":0.000006581324,"domain_scores_codex":[0.9981766,0.00005784989,0.0007797528,0.0002593199,0.0004682327,0.0002581827],"domain_scores_gemma":[0.9964418,0.001443532,0.0006882573,0.0004347593,0.0008925771,0.00009904132],"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.000001541399,0.000649481,0.0003767362,0.00007013394,0.0001507043,4.103733e-7,0.001637905,0.02628397,0.0004144778,0.965582,0.0008123212,0.004020351],"study_design_scores_gemma":[0.0002362894,0.00003098518,0.0002853733,0.0001405528,0.00005638035,0.000001844673,0.0007504239,0.2214033,0.0003125064,0.776341,0.0002302044,0.0002111561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01805215,0.00002934626,0.9687632,0.001073104,0.00007771171,0.0007709701,0.00005836749,0.0001816786,0.0109935],"genre_scores_gemma":[0.6721587,7.967598e-7,0.3265965,0.00005834799,0.00007995996,0.0002180471,0.0002732185,0.00003555533,0.0005789308],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6541065,"threshold_uncertainty_score":0.9999786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1202875439","doi":"10.1007/s10208-015-9276-6","title":"Generalized Sampling and Infinite-Dimensional Compressed Sensing","year":2015,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":181,"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":"Engineering and Physical Sciences Research Council","keywords":"Sampling theory; Compressed sensing; Mathematics; Discretization; Sampling (signal processing); Nyquist–Shannon sampling theorem; Hilbert space; Key (lock); Restricted isometry property; Applied mathematics; Nyquist rate; Separable space; Property (philosophy); Calculus (dental); Algorithm; Mathematical optimization; Computer science; Mathematical analysis; Sample size determination","retraction":null,"screen_n_in":null,"score":{"opus":0.07041629827848618,"gpt":0.2977721634683665,"spread":0.2273558651898804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001125447,0.0001073033,0.0001783086,0.0001243728,0.00005518911,0.00003972167,0.00005961961,0.00003926141,0.000007740046],"category_scores_gemma":[0.00007372007,0.000113293,0.00002859431,0.0001233213,0.00006801952,0.00009519469,0.00003854649,0.00006383048,0.0000074584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002174994,"about_ca_system_score_gemma":0.00003661812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000753939,"about_ca_topic_score_gemma":0.000001677829,"domain_scores_codex":[0.9992948,0.00001622467,0.0002952613,0.000084245,0.000216998,0.00009242985],"domain_scores_gemma":[0.9991731,0.0002960131,0.00007003338,0.0001200349,0.0002808823,0.00005996007],"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.000003541468,0.000029339,0.00003515622,0.00003668329,0.00004730486,9.429583e-7,0.0004208664,0.9706643,0.001280872,0.02571208,0.0007336772,0.001035245],"study_design_scores_gemma":[0.0002454554,0.00001336956,0.0001601241,0.00006773299,0.00001679421,0.00002476728,0.00004530666,0.8011644,0.001058284,0.1967083,0.000389382,0.0001060498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4226693,0.00008947992,0.575693,0.00004915763,0.00009844411,0.000102624,0.000008628421,0.0002405789,0.001048841],"genre_scores_gemma":[0.5367766,0.000002112685,0.4631246,0.00001872807,0.00002211295,0.000001143839,0.00003569145,0.00001285647,0.000006110728],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.1709962,"threshold_uncertainty_score":0.4619952,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007755560","doi":"10.1007/s10208-014-9220-1","title":"Improved Bounds on Sample Size for Implicit Matrix Trace Estimators","year":2014,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Ciência sem Fronteiras; Natural Sciences and Engineering Research Council of Canada","keywords":"TRACE (psycholinguistics); Estimator; Upper and lower bounds; Gaussian; Matrix (chemical analysis); Unit vector; Monte Carlo method; Probabilistic logic; Multivariate random variable","retraction":null,"screen_n_in":null,"score":{"opus":0.01812313942802826,"gpt":0.3075835547097815,"spread":0.2894604152817533,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003884373,0.0001742041,0.0002589968,0.0001997562,0.0002150898,0.0001520132,0.0006070756,0.00006104635,0.0000197088],"category_scores_gemma":[0.002625191,0.0001768271,0.000114069,0.0003806372,0.00007697225,0.0002589796,0.00007451947,0.00006527811,0.00001122508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005904264,"about_ca_system_score_gemma":0.0001111353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005041967,"about_ca_topic_score_gemma":8.71406e-7,"domain_scores_codex":[0.9985908,0.00002645892,0.000570579,0.0002779668,0.0003369539,0.0001972689],"domain_scores_gemma":[0.9921371,0.006449233,0.0003896009,0.0004528547,0.000500246,0.00007093728],"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.00000378448,0.000180516,0.000007206542,0.00006606083,0.00002024476,2.84431e-8,0.0002639081,0.07546687,0.00007711651,0.9219153,0.0003069151,0.00169203],"study_design_scores_gemma":[0.0002307332,0.0001515185,0.00009603035,0.00002234969,0.000009044073,0.000002989754,0.000008300345,0.5406338,0.0002023156,0.458372,0.0001750407,0.00009593689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002398886,0.000003643825,0.9955588,0.0005431486,0.0001676599,0.000596743,0.00004152388,0.000274793,0.000414829],"genre_scores_gemma":[0.2274735,3.756116e-7,0.7722277,0.00007305151,0.00002918593,0.0001029938,0.00002863572,0.00001783797,0.00004669142],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4651669,"threshold_uncertainty_score":0.7210799,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107479212","doi":"10.1007/s10208-013-9161-0","title":"Restricted Normal Cones and Sparsity Optimization with Affine Constraints","year":2013,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":52,"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, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Affine transformation; Convergence (economics); Heuristics; Underdetermined system; Regular polygon; Conic optimization; Mathematical optimization; Optimization problem; Convex optimization; Constraint (computer-aided design); Cone (formal languages); Applied mathematics; Algorithm; Convex analysis; Pure mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01191264359667149,"gpt":0.2105095226035655,"spread":0.198596879006894,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002457852,0.00008327483,0.0001179111,0.00009135361,0.00005348992,0.00004091904,0.00005218987,0.00002994378,0.0001225878],"category_scores_gemma":[0.00002386826,0.00007804712,0.00001261747,0.0001334523,0.0001273619,0.0001676571,0.00001590567,0.00004478286,0.000007440958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000111591,"about_ca_system_score_gemma":0.00001915933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006593781,"about_ca_topic_score_gemma":0.000001395501,"domain_scores_codex":[0.9995443,0.000007669395,0.0001880356,0.00006507115,0.0001229669,0.00007191016],"domain_scores_gemma":[0.999428,0.0001427723,0.00006312787,0.00008660428,0.0002505583,0.00002890999],"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.000001672403,0.00004053868,0.0001356839,0.00003810522,0.0000419204,4.908037e-7,0.0001442455,0.9869604,0.0002446531,0.01088406,0.0004068625,0.001101354],"study_design_scores_gemma":[0.0002130966,0.00003463976,0.003143109,0.00006846575,0.00002089378,0.00002711059,0.00006155708,0.977426,0.0006214405,0.01824578,0.00002909035,0.0001088167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.228117,0.00001178452,0.7686942,0.00005639521,0.00002044934,0.0001829028,0.000006980088,0.0001704798,0.002739761],"genre_scores_gemma":[0.6329384,0.000005113183,0.3669798,0.000006424919,0.000008313173,0.000006267386,0.00003693903,0.000007826175,0.00001088655],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4048214,"threshold_uncertainty_score":0.3182669,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065513810","doi":"10.1007/s10208-012-9128-6","title":"A Conjecture on Exceptional Orthogonal Polynomials","year":2012,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University; McGill University","funders":"","keywords":"Orthogonal polynomials; Conjecture; Codimension; Eigenfunction; Polynomial; Classical orthogonal polynomials; Discrete orthogonal polynomials; Orthogonal basis","retraction":null,"screen_n_in":null,"score":{"opus":0.08038187535544433,"gpt":0.3586697441686887,"spread":0.2782878688132444,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007769521,0.0002652235,0.0004757112,0.0002682495,0.0001995168,0.00004343133,0.0002181937,0.000126474,0.003624459],"category_scores_gemma":[0.001138294,0.0002297295,0.0002326212,0.000315044,0.0001596258,0.0002382525,0.0000581484,0.0001762467,0.000545271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007066651,"about_ca_system_score_gemma":0.0001337936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001707438,"about_ca_topic_score_gemma":0.000001235423,"domain_scores_codex":[0.9977537,0.00008841493,0.0009504022,0.000184013,0.0006808995,0.0003426044],"domain_scores_gemma":[0.9946287,0.004109537,0.0004738985,0.0003668842,0.0002468945,0.0001740474],"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.00001599548,0.001175026,0.0001815933,0.0001870798,0.000105474,2.708192e-7,0.0006198596,0.0008674422,0.00008372812,0.9881794,0.00817619,0.0004079331],"study_design_scores_gemma":[0.0005177319,0.0001135239,0.001148654,0.0001232736,0.00009861853,0.00005058838,0.000151681,0.001987001,0.0002912249,0.9919442,0.003289868,0.0002836662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5615783,0.00006057632,0.3924061,0.001090899,0.0007716033,0.0009150764,0.000272284,0.0002101527,0.04269499],"genre_scores_gemma":[0.7552692,0.000002020147,0.2431963,0.0001214761,0.0003882312,0.00004330099,0.00009438006,0.00003897897,0.0008461691],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1936908,"threshold_uncertainty_score":0.9972864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021428356","doi":"10.1007/s002080010009","title":"Generalization of Primal—Dual Interior-Point Methods to Convex Optimization Problems in Conic Form","year":2001,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":50,"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":"Interior point method; Conic optimization; Mathematics; Mathematical optimization; Linear programming; Second-order cone programming; Convex optimization; Regular polygon; Convex analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.08016735234894054,"gpt":0.430702327804027,"spread":0.3505349754550865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001071055,0.0002124612,0.0005210856,0.0007459983,0.00008026481,0.00004272721,0.0002675608,0.00009820248,0.0005095163],"category_scores_gemma":[0.001954213,0.0002242059,0.00008958062,0.001374478,0.0001349087,0.0004123819,0.0001452447,0.0001332536,0.00001256268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002056253,"about_ca_system_score_gemma":0.000233827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009499914,"about_ca_topic_score_gemma":0.0000167033,"domain_scores_codex":[0.9972228,0.0001573131,0.00148104,0.0002692162,0.0006098835,0.0002597461],"domain_scores_gemma":[0.9963158,0.001246361,0.0006612478,0.0003432212,0.001335571,0.00009779234],"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.00001533434,0.000339465,0.0001139802,0.0002849323,0.00003908078,6.377704e-7,0.002090601,0.8869051,0.0002093051,0.1085049,0.00005500872,0.00144158],"study_design_scores_gemma":[0.0006006573,0.0000998401,0.00009166342,0.0001691281,0.00001884258,0.00001643208,0.0002843362,0.7013593,0.0004433556,0.2966616,0.00009857276,0.0001561855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01088747,0.00002149467,0.986303,0.0003115805,0.00007947024,0.001159397,0.00002383937,0.00005815875,0.001155621],"genre_scores_gemma":[0.05020292,0.00002721514,0.9491859,0.00003806554,0.00002061539,0.000109407,0.0001614028,0.00004939171,0.0002050974],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1881567,"threshold_uncertainty_score":0.9142853,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130417105","doi":"10.1007/pl00021726","title":"Optimal Stability and Eigenvalue Multiplicity","year":2001,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Multiplicity (mathematics); Eigenvalues and eigenvectors; Stability (learning theory); Numerical analysis; Applied mathematics; Mathematical analysis; Physics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03108360772005937,"gpt":0.2848674620295977,"spread":0.2537838543095383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003884665,0.00009148068,0.0001457252,0.00007740314,0.0001472981,0.00007221001,0.0002957015,0.00002978776,0.00006985653],"category_scores_gemma":[0.0001301629,0.00008865244,0.00004217991,0.0002524859,0.0001097083,0.0003412728,0.0001376704,0.00005890676,0.00002140695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001706966,"about_ca_system_score_gemma":0.00006086554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003764406,"about_ca_topic_score_gemma":9.426057e-7,"domain_scores_codex":[0.999117,0.00004272128,0.0003195975,0.0001726284,0.0002386364,0.000109482],"domain_scores_gemma":[0.998762,0.0005834919,0.000138605,0.0002579303,0.000202611,0.00005539064],"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.000003332408,0.0002791557,0.0002950922,0.00005955716,0.00002135538,0.000001265733,0.001291943,0.02309459,0.00007808313,0.9707465,0.00002261833,0.004106469],"study_design_scores_gemma":[0.0001690212,0.00002798632,0.001340222,0.00001091141,0.000005240016,0.00002856343,0.00006373841,0.6247653,0.0002289358,0.373117,0.000162433,0.00008063144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2920172,0.00001412946,0.7066382,0.0002095013,0.0000435701,0.0001098075,0.000005622962,0.00004830787,0.0009137112],"genre_scores_gemma":[0.5116799,0.000002993429,0.4882453,0.00001654778,0.00001372792,0.000004882092,0.000005843066,0.00000298427,0.00002782934],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6016707,"threshold_uncertainty_score":0.3615142,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118254039","doi":"10.1007/s10208-014-9212-1","title":"A Baby Step–Giant Step Roadmap Algorithm for General Algebraic Sets","year":2014,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Bounded function; Combinatorics; Degree (music); Mathematics; Algebraic number; Domain (mathematical analysis); Polynomial; Field (mathematics); Discrete mathematics; Physics; Mathematical analysis; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0186907334444419,"gpt":0.273940486897728,"spread":0.2552497534532862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004861031,0.0002159987,0.0003327729,0.0002387221,0.0002503883,0.0001829637,0.0006774139,0.00006789687,0.00002245079],"category_scores_gemma":[0.0001317444,0.0002145084,0.0001694399,0.0003978977,0.00008373747,0.0004568336,0.0001639083,0.00008444193,0.00006405766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005634654,"about_ca_system_score_gemma":0.0002084804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000113201,"about_ca_topic_score_gemma":0.000004675674,"domain_scores_codex":[0.9981138,0.00006797009,0.0007080867,0.0003485748,0.0004866507,0.0002749614],"domain_scores_gemma":[0.9975847,0.001014742,0.0004153531,0.0003873906,0.0004854545,0.0001123517],"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.000002191914,0.0002297378,0.000004026666,0.00007274745,0.00005374114,3.485834e-7,0.0003633488,0.01311556,0.00007287522,0.7146649,0.001357072,0.2700635],"study_design_scores_gemma":[0.0004815488,0.00009499455,0.0004746739,0.00002777295,0.00001466884,0.00001238395,0.00001377048,0.6507913,0.00005340651,0.3460874,0.00179215,0.0001559885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00806873,0.00002099558,0.9895192,0.0007429568,0.0004066769,0.0004742352,0.00003863766,0.0001455417,0.0005829777],"genre_scores_gemma":[0.06465136,0.000001158526,0.9345382,0.0001956484,0.0001515519,0.00006498809,0.0001528799,0.00002030329,0.0002239489],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6376757,"threshold_uncertainty_score":0.8747399,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024090003","doi":"10.1007/s10208-007-9018-5","title":"Complexity of Bezout’s Theorem VII: Distance Estimates in the Condition Metric","year":2007,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Metric (unit); Combinatorics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0791133789379064,"gpt":0.3651920239053771,"spread":0.2860786449674707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002027268,0.0001419281,0.0003307732,0.0002633436,0.0001141538,0.00002321497,0.0003394773,0.00005766171,0.0001426468],"category_scores_gemma":[0.00112032,0.0001083418,0.00008912145,0.0007314109,0.0005431412,0.0001297578,0.00003527394,0.0001295965,0.00001424409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004771582,"about_ca_system_score_gemma":0.00007091528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007306153,"about_ca_topic_score_gemma":0.00002396838,"domain_scores_codex":[0.9982235,0.00008663096,0.0008792576,0.0001282092,0.0005187437,0.0001636925],"domain_scores_gemma":[0.9936473,0.005220644,0.0004700148,0.0002873281,0.0003446092,0.00003009645],"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.00001163399,0.0005357339,0.0004659295,0.0002069728,0.00003076319,0.000001654111,0.002764892,0.001151713,0.00004239545,0.9944493,0.0001426962,0.0001962822],"study_design_scores_gemma":[0.0003593042,0.00004035636,0.006578192,0.00009784835,0.00004196485,0.00001440003,0.001723271,0.009751069,0.0004430619,0.9808059,0.00004105085,0.0001036247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3339988,0.00003527198,0.6603974,0.0001552762,0.00005138694,0.0003580574,0.00006380359,0.00002484069,0.00491522],"genre_scores_gemma":[0.8092808,0.000001813786,0.190549,0.00003184298,0.00001836412,0.000009598245,0.0000774314,0.00001288767,0.00001824467],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.475282,"threshold_uncertainty_score":0.4418051,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4310446950","doi":"10.1007/s10208-023-09630-x","title":"On the Representation and Learning of Monotone Triangular Transport Maps","year":2023,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Air Force Office of Scientific Research; Multidisciplinary University Research Initiative; Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA); U.S. Department of Energy","keywords":"Maxima and minima; Mathematics; Inference; Parametric statistics; Monotone polygon; Density estimation; Representation (politics); Algorithm; Measure (data warehouse); Applied mathematics; Computer science; Artificial intelligence; Geometry; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.09728548284479145,"gpt":0.3765147759111037,"spread":0.2792292930663123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001241618,0.0001021014,0.0002509639,0.0001789902,0.0001396577,0.00001222226,0.0001143904,0.00004259373,0.0000293078],"category_scores_gemma":[0.001847924,0.00007929066,0.00009281698,0.0004328594,0.0001123534,0.00005675681,0.00002732824,0.0001157675,8.110923e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001175521,"about_ca_system_score_gemma":0.00003864224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005569395,"about_ca_topic_score_gemma":0.000001553131,"domain_scores_codex":[0.9987448,0.0001459518,0.0005184535,0.0001301972,0.0003650659,0.00009551728],"domain_scores_gemma":[0.9936717,0.00553509,0.0003390574,0.0002078218,0.0002185169,0.00002786171],"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.00001662611,0.00009517561,0.00007003276,0.0003087151,0.00007566877,0.000001153631,0.003889217,0.02325646,0.0001347252,0.9706757,0.0007049203,0.000771598],"study_design_scores_gemma":[0.0003456228,0.00006771036,0.0003012416,0.00009701731,0.00005208134,0.000004332703,0.001538667,0.1558062,0.0002647476,0.841273,0.000169768,0.00007959862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6033158,0.0000105661,0.3930362,0.000539933,0.00009210822,0.0004068061,0.00002458563,0.00005968034,0.002514314],"genre_scores_gemma":[0.7637469,0.00001217612,0.2353121,0.0000182214,0.00003419939,0.00003925896,0.00008737024,0.00002342534,0.0007263177],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1604311,"threshold_uncertainty_score":0.3233379,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007215420","doi":"10.1007/s10208-013-9165-9","title":"Scaling Invariants and Symmetry Reduction of Dynamical Systems","year":2013,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Molecular spectroscopy and chirality","field":"Chemistry","cited_by":30,"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; Scaling; Reduction (mathematics); Symmetry (geometry); Matrix (chemical analysis); Dynamical systems theory; Class (philosophy); Pure mathematics; Linear algebra; Algebra over a field; Geometry; Computer science; Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01399696411799488,"gpt":0.2684758140656216,"spread":0.2544788499476267,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009363386,0.00007579027,0.0001696648,0.00005697794,0.00005509223,0.00003462623,0.00008128942,0.00005358051,0.0001837186],"category_scores_gemma":[0.0001098109,0.00007618765,0.00003704571,0.00009763209,0.0001012697,0.0001111955,0.00003199055,0.00006451254,0.000009611643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002253588,"about_ca_system_score_gemma":0.00003926687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004157893,"about_ca_topic_score_gemma":2.306498e-7,"domain_scores_codex":[0.9991687,0.00001380544,0.0004221348,0.0001031711,0.0002187771,0.00007340404],"domain_scores_gemma":[0.9992183,0.0001562077,0.0002481136,0.0001391312,0.0002031464,0.00003505057],"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.00001076151,0.0007153552,0.0006266978,0.002975362,0.0002344474,5.572034e-7,0.001065393,0.01886887,0.1250637,0.8489399,0.0001460891,0.001352843],"study_design_scores_gemma":[0.0004877392,0.00003115099,0.001733234,0.0003793013,0.00007868079,0.00006520481,0.000677249,0.5668249,0.01781691,0.4116776,0.00002053783,0.0002075045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8837466,0.00004339995,0.1107465,0.00006921464,0.00005141347,0.00009588141,0.00001748302,0.00001976462,0.005209818],"genre_scores_gemma":[0.9449235,0.000003428159,0.05489956,0.000002693271,0.00002436062,0.00001108322,0.00006144479,0.000008250955,0.00006568918],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.547956,"threshold_uncertainty_score":0.3106842,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035079758","doi":"10.1007/s10208-005-0210-1","title":"Filled Julia Sets with Empty Interior Are Computable","year":2006,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Julia set; Polynomial; Set (abstract data type); Computable number; Computable analysis; Pure mathematics; Combinatorics; Mathematical analysis; Computable function; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02825540486827342,"gpt":0.3040499526890338,"spread":0.2757945478207604,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003307472,0.0002741388,0.0005949915,0.0001858552,0.0001754549,0.0001034692,0.0002871752,0.00008681153,0.0004223753],"category_scores_gemma":[0.0002693002,0.0002257404,0.0001365009,0.0003673836,0.0001873175,0.0001936382,0.00008721793,0.0001424587,0.0000815962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006155825,"about_ca_system_score_gemma":0.00009659741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001450769,"about_ca_topic_score_gemma":0.00002579103,"domain_scores_codex":[0.9978608,0.00004293673,0.0009630715,0.0002510154,0.0006215975,0.0002605917],"domain_scores_gemma":[0.9966218,0.00153381,0.0007946302,0.0003848038,0.000589742,0.00007514377],"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.00001583609,0.00101578,0.0004103369,0.0008526546,0.0001265133,0.000006085129,0.0003134295,0.01228467,0.00004392717,0.9807819,0.003944975,0.0002039392],"study_design_scores_gemma":[0.0005498472,0.00005939792,0.0009534347,0.0002902442,0.00007311237,0.00003916043,0.0001441737,0.2017557,0.00004976834,0.7956024,0.0002531545,0.0002296389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3156407,0.00001383933,0.6716652,0.000368737,0.00007126729,0.000524134,0.0001016464,0.000133233,0.0114813],"genre_scores_gemma":[0.5411043,6.58748e-7,0.4580767,0.00002550413,0.00003419117,0.00002910761,0.00009833672,0.00003771008,0.0005934431],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2254636,"threshold_uncertainty_score":0.9205426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127771846","doi":"10.1007/s10208-015-9256-x","title":"A Quadratically Convergent Algorithm for Structured Low-Rank Approximation","year":2015,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Rank (graph theory); Quadratic growth; Low-rank approximation; Matrix (chemical analysis); Applied mathematics; Algorithm; Combinatorics; Hankel matrix; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03189418823480892,"gpt":0.2781377065146248,"spread":0.2462435182798159,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001179394,0.0001109541,0.0001778092,0.00009941759,0.0000423331,0.00003537882,0.00010906,0.00004987119,0.00001583258],"category_scores_gemma":[0.00008946069,0.0001134962,0.0000573554,0.0001261551,0.00004578121,0.0001128038,0.00001545391,0.00004555119,0.00001126705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004631822,"about_ca_system_score_gemma":0.00006556821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001248947,"about_ca_topic_score_gemma":9.68965e-7,"domain_scores_codex":[0.9991949,0.00001096441,0.0003691104,0.00008658612,0.0002367428,0.0001017393],"domain_scores_gemma":[0.9990271,0.0001883174,0.00009021745,0.0001418951,0.0004972671,0.00005514306],"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.000008961659,0.000219659,0.000007619126,0.000273881,0.0001915236,7.286164e-7,0.001686168,0.7869744,0.0008822986,0.1793694,0.007495526,0.02288981],"study_design_scores_gemma":[0.000235777,0.00002704003,0.00002160076,0.00003391278,0.00001816505,0.000004209692,0.00006934282,0.6884335,0.00202113,0.308834,0.0002187655,0.00008250071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01370354,0.00002296114,0.984691,0.00004951626,0.0001871278,0.0003870787,0.00003820216,0.0002402842,0.0006802579],"genre_scores_gemma":[0.3335081,0.000001235438,0.6662244,0.00001276847,0.00004083676,0.00003264302,0.0001482417,0.00001766843,0.00001414315],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3198045,"threshold_uncertainty_score":0.462824,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W289966560","doi":"10.1007/s10208-015-9259-7","title":"Computation of Smooth Manifolds Via Rigorous Multi-parameter Continuation in Infinite Dimensions","year":2015,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Quantum chaos and dynamical systems","field":"Physics and Astronomy","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Mathematics; Simplex; Manifold (fluid mechanics); Computation; Smoothness; Continuation; Triangulation; Numerical analysis; Constructive; Polynomial; Applied mathematics; Mathematical analysis; Algorithm; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03937534221953173,"gpt":0.3033043018610115,"spread":0.2639289596414798,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002809739,0.00012133,0.000296325,0.0001794293,0.00003870075,0.000022184,0.00009721735,0.00003943894,0.00002988154],"category_scores_gemma":[0.00006036885,0.0001182359,0.00007511545,0.0002900227,0.00007297905,0.0001589917,0.00003622008,0.00007128168,0.00002808733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003471193,"about_ca_system_score_gemma":0.00009246459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002313348,"about_ca_topic_score_gemma":0.00002017029,"domain_scores_codex":[0.9986075,0.0000587413,0.000775735,0.0001318706,0.0003100676,0.0001160868],"domain_scores_gemma":[0.9984595,0.0004289705,0.000472015,0.0001247337,0.0004554177,0.00005941797],"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.00002089938,0.001876919,0.02177635,0.0001439676,0.0001088322,6.843495e-7,0.003369979,0.5992535,0.0002884448,0.3694618,0.0001019727,0.003596616],"study_design_scores_gemma":[0.0008161517,0.00004834154,0.006509057,0.00007843708,0.00001856425,9.091971e-7,0.0003377172,0.7122115,0.00003803873,0.2798257,0.00001934902,0.0000961463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4306388,0.000007704071,0.5684342,0.0000300704,0.00006967792,0.0002038687,0.00002602887,0.00001012929,0.0005795559],"genre_scores_gemma":[0.8864204,1.679401e-7,0.1132632,0.000006267707,0.00002459466,0.00001716678,0.0002284194,0.00001199663,0.00002775721],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4557816,"threshold_uncertainty_score":0.4821519,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030265403","doi":"10.1007/s10208-005-0186-x","title":"Symmetry Classification Using Noncommutative Invariant Differential Operators","year":2006,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","cited_by":20,"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; University of Canberra; Government of the United Kingdom","keywords":"Mathematics; Invariant (physics); Symmetry group; Lie algebra; Lie group; Differential algebra; Differential operator; Pure mathematics; Differential equation; Algebra over a field; Mathematical analysis; Mathematical physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03068578933861712,"gpt":0.3093386203011708,"spread":0.2786528309625537,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007737242,0.0001114563,0.0001738872,0.0001009632,0.000179888,0.00006358558,0.0001178575,0.00002588409,0.0002687921],"category_scores_gemma":[0.000009616879,0.0001080461,0.00008307509,0.000206464,0.00008364026,0.0001368092,0.00003665648,0.00007531522,0.00002106198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002996614,"about_ca_system_score_gemma":0.0001275036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001088991,"about_ca_topic_score_gemma":0.00000225758,"domain_scores_codex":[0.9991057,0.00003458865,0.000428147,0.0001153866,0.0002067048,0.0001095045],"domain_scores_gemma":[0.9991277,0.000219609,0.0002428355,0.0001424493,0.0002373239,0.00003010336],"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.000001999828,0.0004759793,0.001805112,0.00002209797,0.00005570991,1.368707e-7,0.0002350628,0.0188156,0.0007612561,0.9775041,0.0000770709,0.0002458392],"study_design_scores_gemma":[0.0002923607,0.00001435907,0.005258533,0.00003052641,0.00004589392,0.000001307362,0.0005263908,0.5955712,0.0003873454,0.3976883,0.00006110295,0.0001226332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4888407,0.000002510183,0.5068002,0.00004910111,0.00005952404,0.0001101834,0.000086355,0.0000113442,0.004040085],"genre_scores_gemma":[0.8451749,9.148329e-8,0.1540731,0.000004969719,0.0001706977,0.000005947164,0.0004758719,0.00001301596,0.00008140791],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5798158,"threshold_uncertainty_score":0.4405991,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098609180","doi":"10.1007/s10208-003-0116-8","title":"On the Curvature of the Central Path of Linear Programming Theory","year":2005,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Curvature; Path (computing); Linear programming; Linear-fractional programming; Linear system; Numerical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0413287192296841,"gpt":0.3528115047627897,"spread":0.3114827855331055,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006145526,0.0001276627,0.0002330503,0.00009074109,0.0001624272,0.0000133913,0.0004488681,0.00005594585,0.0001822122],"category_scores_gemma":[0.002680972,0.000077442,0.0001415769,0.0004953502,0.0003330542,0.00009892792,0.00009528303,0.0001897542,0.000006312237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000444703,"about_ca_system_score_gemma":0.0001715638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.905807e-7,"about_ca_topic_score_gemma":0.000001645648,"domain_scores_codex":[0.9981405,0.0001368564,0.0006723648,0.0001141637,0.0007716657,0.0001644063],"domain_scores_gemma":[0.9940728,0.004126221,0.0006443026,0.0004213341,0.0007035866,0.00003177029],"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.00001030527,0.0004842442,0.00002243786,0.0001514429,0.00006211004,5.899807e-8,0.001386117,0.1210034,0.00002674571,0.8745398,0.0002387785,0.002074631],"study_design_scores_gemma":[0.0002564148,0.00004490355,0.0001970549,0.0001819682,0.0000360037,0.000003037123,0.0003520865,0.1774767,0.0009427182,0.8201324,0.0002999048,0.00007674796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04621891,0.0000309481,0.950067,0.001333992,0.00007215678,0.0009040421,0.0000694632,0.00003151441,0.001272014],"genre_scores_gemma":[0.3921133,0.000003655551,0.6075161,0.00003255075,0.00003803676,0.00002001334,0.0000153231,0.00002132545,0.0002397491],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3458944,"threshold_uncertainty_score":0.3209568,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3033781806","doi":"10.1007/s10208-022-09554-y","title":"Halting Time is Predictable for Large Models: A Universality Property and Average-Case Analysis","year":2022,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Google (Canada)","funders":"","keywords":"Universality (dynamical systems); Mathematics; Case analysis; Property (philosophy); Probability distribution; Applied mathematics; Algorithm; Mathematical optimization; Statistics; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03203514073703707,"gpt":0.2679588309108773,"spread":0.2359236901738402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000534532,0.00009974584,0.000209988,0.0003446698,0.0005373583,0.00008065807,0.0002952043,0.00002090233,0.00008802448],"category_scores_gemma":[0.00009516416,0.00009439337,0.00008767458,0.0008822422,0.00003445952,0.0004100869,0.0003105822,0.00005988314,0.000001363169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006801599,"about_ca_system_score_gemma":0.0001151787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000987823,"about_ca_topic_score_gemma":8.338113e-7,"domain_scores_codex":[0.9988661,0.00004667354,0.0003750751,0.0002445673,0.0003312018,0.0001363173],"domain_scores_gemma":[0.9985484,0.0004857036,0.0002809779,0.0002650581,0.0003743388,0.00004547758],"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.000002968505,0.0002110387,0.00002510995,0.00004867744,0.0001460601,0.000002062515,0.002642267,0.5964078,0.000003132895,0.3999039,0.000356495,0.0002505416],"study_design_scores_gemma":[0.0002231394,0.00005166528,0.000008019825,0.000005460804,0.00008088881,0.00004611034,0.0001217424,0.7627308,0.000009417437,0.2365397,0.0001040114,0.00007899945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00344036,0.00001058443,0.9948694,0.0003757641,0.00002513622,0.0005027202,0.0002277903,0.0001290234,0.0004191884],"genre_scores_gemma":[0.3327192,5.408518e-7,0.6667744,0.00005630637,0.000004745238,0.00007986654,0.00008611097,0.000007141578,0.0002716947],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3292788,"threshold_uncertainty_score":0.413298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2328172603","doi":"10.1142/9789812778031_0006","title":"RECONCILIATION OF VARIOUS COMPLEXITY AND CONDITION MEASURES FOR LINEAR PROGRAMMING PROBLEMS AND A GENERALIZATION OF TARDOS' THEOREM","year":2002,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":13,"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":"Generalization; Linear programming; Algebra over a field; Computer science; Theoretical computer science; Mathematics; Discrete mathematics; Calculus (dental); Mathematical economics; Mathematical optimization; Algorithm; Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.1450485592177141,"gpt":0.370322374475493,"spread":0.2252738152577789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005089195,0.0001236122,0.0003285173,0.0002103697,0.0001164333,0.00002016689,0.00008414988,0.0000646983,0.00004274003],"category_scores_gemma":[0.001268783,0.0001247527,0.00004947285,0.0002658046,0.0003287918,0.0002076953,0.00003647429,0.00005578567,5.394188e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003098301,"about_ca_system_score_gemma":0.00003795401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005092183,"about_ca_topic_score_gemma":0.00000852129,"domain_scores_codex":[0.9984878,0.00006318689,0.0007744665,0.0001613944,0.0003993222,0.0001138515],"domain_scores_gemma":[0.9965665,0.001128423,0.0007096919,0.0001448114,0.001408815,0.00004170021],"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.00002395788,0.0007730398,0.0002119902,0.003104448,0.0001666207,1.138087e-7,0.005870465,0.1033163,0.0004642023,0.8738462,0.00008934877,0.01213329],"study_design_scores_gemma":[0.0005081043,0.00009848541,0.00008565702,0.00009101812,0.00003680418,0.000004855071,0.0001226834,0.5327452,0.0003134984,0.4658689,0.00005566839,0.00006911197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0426148,0.00008147588,0.9558643,0.0001245053,0.0000223445,0.001046055,0.0001086178,0.00002855258,0.000109371],"genre_scores_gemma":[0.2906004,0.00003388287,0.7091034,0.000004289066,0.00001415885,0.00005311712,0.0001317949,0.00001788634,0.00004106955],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4294289,"threshold_uncertainty_score":0.5087267,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2765260291","doi":"10.1007/s10208-020-09444-1","title":"Linking Combinatorial and Classical Dynamics: Conley Index and Morse Decompositions","year":2020,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Hausdorff Research Institute for Mathematics; Natural Sciences and Engineering Research Council of Canada; Uniwersytet Jagielloński w Krakowie; Simons Foundation; National Science Foundation","keywords":"Morse code; Discrete Morse theory; Simplicial complex; Invariant (physics); Morse theory; Dynamical systems theory; Simplicial approximation theorem; Abstract simplicial complex","retraction":null,"screen_n_in":null,"score":{"opus":0.02096523889732803,"gpt":0.2706077867134662,"spread":0.2496425478161382,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001071953,0.00009405376,0.000210622,0.0001364939,0.0001603325,0.0001487102,0.0002605729,0.00004654103,0.00001936016],"category_scores_gemma":[0.0002029508,0.00008687179,0.00004061662,0.0005939145,0.0001619616,0.0002855423,0.0002658894,0.00009600049,0.000009672471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001306833,"about_ca_system_score_gemma":0.00004534703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004268647,"about_ca_topic_score_gemma":0.000002051791,"domain_scores_codex":[0.9990879,0.00002934251,0.0003305816,0.0002048039,0.0002515173,0.00009586871],"domain_scores_gemma":[0.9987286,0.0007235031,0.0001491364,0.000126642,0.0001587248,0.0001134159],"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.000002066993,0.0001040096,0.0005847578,0.00003454373,0.00003622641,0.000001321354,0.0002916158,0.00261274,0.000006136268,0.9934076,0.00007342469,0.002845523],"study_design_scores_gemma":[0.0002235766,0.00004843906,0.001458267,0.000009601849,0.00001729248,0.000007453131,0.00005072751,0.6165186,0.000003219322,0.3814878,0.0001101975,0.00006483299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04591656,0.00002442468,0.948459,0.004987422,0.00005781398,0.00008773134,0.0000360265,0.0000517751,0.00037929],"genre_scores_gemma":[0.7593709,0.000005697502,0.2403843,0.0001228829,0.00002928806,0.000003608299,0.00007405166,0.000003184732,0.000006013189],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7134544,"threshold_uncertainty_score":0.3542529,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2596142527","doi":"10.1007/s10208-017-9349-9","title":"Exponential Convergence of hp-FEM for Elliptic Problems in Polyhedra: Mixed Boundary Conditions and Anisotropic Polynomial Degrees","year":2017,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Mathematics; Quadrilateral; Mathematical analysis; Polyhedron; Sobolev space; Boundary value problem; Finite element method; Neumann boundary condition; Polynomial; Degree of a polynomial; Boundary (topology); Dirichlet boundary condition; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.04174861051428388,"gpt":0.327029181318095,"spread":0.2852805708038111,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000204948,0.0001718379,0.0003895225,0.0001832508,0.0002152699,0.00005827967,0.0002739471,0.00006658252,0.0000264652],"category_scores_gemma":[0.0005656022,0.0001908178,0.0000767505,0.0001121389,0.0004003679,0.0003051151,0.00006794022,0.00009229958,0.000005092516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004982254,"about_ca_system_score_gemma":0.00007836242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004810787,"about_ca_topic_score_gemma":0.000007935859,"domain_scores_codex":[0.998625,0.00002512899,0.0007709051,0.0001597303,0.0002504891,0.0001687604],"domain_scores_gemma":[0.9975742,0.001458271,0.0004074218,0.0002665792,0.0002400751,0.00005346919],"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.0000136234,0.0003207125,0.001083817,0.00189865,0.0001336424,7.177785e-7,0.0008989686,0.8575277,0.001844237,0.1336415,0.0001127914,0.002523666],"study_design_scores_gemma":[0.0006161957,0.00006166069,0.01064744,0.0001735164,0.0000351147,0.000008027429,0.00009690595,0.5736579,0.0004910523,0.4139847,0.00006859013,0.0001589157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2794246,0.00006644076,0.7194734,0.00005788815,0.0002591884,0.0004177581,0.00008655274,0.00003630767,0.0001779034],"genre_scores_gemma":[0.5487137,0.00001122365,0.4511347,0.00000249039,0.00002700243,0.00004670321,0.00003423538,0.00001923277,0.00001070315],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2838698,"threshold_uncertainty_score":0.7781326,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2209293733","doi":"10.1007/s10208-017-9357-9","title":"Shape-Aware Matching of Implicit Surfaces Based on Thin Shell Energies","year":2017,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"3D Shape Modeling and Analysis","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Rheinische Friedrich-Wilhelms-Universität Bonn; Austrian Science Fund; Hausdorff Center for Mathematics; Universität Wien; McGill University","keywords":"Discretization; Energy functional; Finite element method; Nonlinear system; Bending; Conjugate gradient method; Deformation (meteorology); Calculus of variations; Energy minimization","retraction":null,"screen_n_in":null,"score":{"opus":0.02379021679941154,"gpt":0.2762315073708302,"spread":0.2524412905714187,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001565443,0.0001140165,0.0002353112,0.0001365588,0.000183432,0.00007199193,0.0002744731,0.00003951923,0.00007505665],"category_scores_gemma":[0.00006744306,0.0001115746,0.00009972948,0.0000678248,0.0000576333,0.0001265151,0.00002646413,0.00006590161,0.00001709154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001929134,"about_ca_system_score_gemma":0.00003601197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001789639,"about_ca_topic_score_gemma":0.000006021391,"domain_scores_codex":[0.999147,0.00000968162,0.0003790684,0.00009233756,0.0002812372,0.00009070671],"domain_scores_gemma":[0.9989457,0.0003349264,0.0002034977,0.0003174575,0.0001722567,0.00002620165],"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.000001310132,0.00005528194,0.00007538019,0.0001906337,0.00004998358,1.996475e-7,0.0002572768,0.9926135,0.0001892438,0.006130602,0.00005216689,0.0003844066],"study_design_scores_gemma":[0.0001300208,0.00001406987,0.0006677286,0.0001442422,0.00003443748,4.641979e-7,0.00009865384,0.9458015,0.0005206869,0.05248704,0.000007030432,0.00009412315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4691295,0.00001327065,0.5284005,0.0000945439,0.00005811266,0.00005517455,0.0000492714,0.00006543972,0.002134192],"genre_scores_gemma":[0.9242324,0.000004034174,0.07562195,0.000009493826,0.00001783833,0.000004285054,0.00005506717,0.00001870752,0.00003625734],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4551029,"threshold_uncertainty_score":0.4549879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978778998","doi":"10.1007/s10208-009-9054-4","title":"A Note on the Finite Variance of the Averaging Function for Polynomial System Solving","year":2009,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","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":"University of Toronto","funders":"","keywords":"Mathematics; Polynomial; Homotopy analysis method; Function (biology); Variance (accounting); Homotopy; Applied mathematics; Variance function; Matrix polynomial; Mathematical analysis; Pure mathematics; Statistics; Regression analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02010126164087747,"gpt":0.2506759855069396,"spread":0.2305747238660621,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003908632,0.0001105978,0.0001615507,0.00008857323,0.0003338444,0.00008211965,0.000560903,0.00003188693,0.000003107027],"category_scores_gemma":[0.0002600531,0.00007413679,0.0001322998,0.0003746842,0.00005209066,0.0002005746,0.00006233429,0.00007780544,0.000007021601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005583157,"about_ca_system_score_gemma":0.0001645499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003134647,"about_ca_topic_score_gemma":8.946893e-7,"domain_scores_codex":[0.9988605,0.00005124513,0.0004669517,0.0001575464,0.0003389441,0.0001248344],"domain_scores_gemma":[0.9969566,0.001954618,0.0004720547,0.0003282381,0.0002665177,0.00002199522],"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.000008738959,0.00008246907,0.000003378538,0.00005052016,0.00001729464,5.236768e-8,0.0007165355,0.1756397,0.0001831459,0.8172238,0.0002586842,0.005815654],"study_design_scores_gemma":[0.0002231621,0.00008078085,0.001408585,0.0001430138,0.00001609053,0.000003245604,0.00003778865,0.7769306,0.000330861,0.2206122,0.000146218,0.00006753233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0128938,0.000007651164,0.982491,0.002979229,0.0004155056,0.0004111372,0.00001142031,0.00004762776,0.0007426365],"genre_scores_gemma":[0.8948396,2.293332e-7,0.1047976,0.0002125905,0.00008131767,0.00001560558,0.000006400768,0.000005182937,0.00004143175],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8819458,"threshold_uncertainty_score":0.302321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3047952687","doi":"10.1007/s10208-021-09531-x","title":"Optimal Combination of Linear and Spectral Estimators for Generalized Linear Models","year":2021,"lang":"en","type":"preprint","venue":"Foundations of Computational Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Institute of Science and Technology Austria; Alan Turing Institute; National Science Foundation","keywords":"Combinatorics; Distribution (mathematics); Physics; Order (exchange); Eigenvalues and eigenvectors; Matrix (chemical analysis); Mathematics; Mathematical analysis; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.04256090498939697,"gpt":0.3015033345632102,"spread":0.2589424295738132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001156489,0.0001872836,0.0004243762,0.0001786184,0.0000505358,0.00003532262,0.000133414,0.0001346151,0.000008038729],"category_scores_gemma":[0.00006424194,0.0002166495,0.000123491,0.00009347029,0.00007797954,0.00009693393,0.0001046046,0.0001327739,3.717586e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003229262,"about_ca_system_score_gemma":0.00009714578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006786309,"about_ca_topic_score_gemma":0.00000126567,"domain_scores_codex":[0.9989306,0.00001615431,0.0005755661,0.0001584358,0.0002184083,0.0001007878],"domain_scores_gemma":[0.9986488,0.0002746958,0.0002442452,0.0002135004,0.000586629,0.00003214135],"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.000003817373,0.00009369529,0.00000342418,0.000688415,0.000124645,3.244216e-7,0.0004931064,0.9555742,0.0002295557,0.0425461,0.00009591387,0.0001468083],"study_design_scores_gemma":[0.000226058,0.00002523792,0.00002790913,0.000271578,0.00008619075,0.000004512131,0.0000420878,0.7741553,0.00382874,0.2211933,0.000006852809,0.0001323082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3455514,0.0001028932,0.6536415,0.0000254165,0.0001034061,0.0002958111,0.00006464626,0.00009997874,0.0001149404],"genre_scores_gemma":[0.4505169,0.00002657001,0.5489721,0.000002813841,0.00002564637,0.00002188146,0.0004038546,0.00002431773,0.000005868512],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1814189,"threshold_uncertainty_score":0.8834709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4317797605","doi":"10.1007/s10208-023-09606-x","title":"Optimal Polynomial Meshes Exist on any Multivariate Convex Domain","year":2023,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":7,"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":"","keywords":"Mathematics; Polygon mesh; Regular polygon; Conjecture; Polynomial; Convex body; Combinatorics; Multivariate statistics; Domain (mathematical analysis); Pure mathematics; Convex optimization; Geometry; Mathematical analysis; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.09171501157887414,"gpt":0.370556728720871,"spread":0.2788417171419968,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000694412,0.0002066392,0.0003957516,0.0005456166,0.0002251042,0.00007863241,0.0002669382,0.00007981595,0.0002018266],"category_scores_gemma":[0.001390655,0.0001935097,0.000136063,0.0009770383,0.0001396597,0.0001739897,0.00009087648,0.0001345297,0.0003204264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000545677,"about_ca_system_score_gemma":0.0001700523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001103085,"about_ca_topic_score_gemma":0.000002263398,"domain_scores_codex":[0.9980757,0.00005269514,0.0007715949,0.0002129115,0.0006168651,0.0002702125],"domain_scores_gemma":[0.99532,0.003562731,0.0004034741,0.0002716788,0.0003721912,0.00006996866],"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.00002437305,0.0003695881,0.00001653768,0.0004588905,0.0001159494,0.00000324868,0.002736445,0.01545825,0.00004333775,0.9742513,0.00626738,0.0002547169],"study_design_scores_gemma":[0.0006999407,0.0001262226,0.0004226242,0.0001323715,0.00003687495,0.000009647715,0.00159409,0.0320641,0.0002043682,0.9630909,0.001384477,0.0002343648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.756973,0.00001490327,0.2265972,0.001270438,0.0003668011,0.0005273951,0.0002661175,0.0003839365,0.01360027],"genre_scores_gemma":[0.6627213,0.000004269144,0.3354635,0.00005334579,0.0001300612,0.00004460545,0.0001833323,0.00003982382,0.001359764],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1088663,"threshold_uncertainty_score":0.7891096,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401057266","doi":"10.1007/s10208-024-09667-6","title":"Analysis of Langevin Monte Carlo from Poincaré to Log-Sobolev","year":2024,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"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":"Mathematics; Monte Carlo method; Statistical physics; Langevin dynamics; Sobolev space; Mathematical analysis; Physics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.07182423705751878,"gpt":0.3920132083558933,"spread":0.3201889712983745,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000583593,0.0001755884,0.0006039873,0.000733947,0.00004941633,0.00005447842,0.0002518652,0.00007248392,0.0001673943],"category_scores_gemma":[0.0007324368,0.0001633347,0.0003385922,0.001336096,0.00006461131,0.0001005326,0.00009242457,0.00009530959,0.000002661531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006045115,"about_ca_system_score_gemma":0.000119138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009345923,"about_ca_topic_score_gemma":0.0001208597,"domain_scores_codex":[0.9981989,0.00008216739,0.0008275554,0.000245233,0.0005023801,0.0001437663],"domain_scores_gemma":[0.9955632,0.00329893,0.0002274843,0.0004048155,0.000423082,0.00008247847],"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.00002909951,0.0007868201,0.0004930455,0.00180134,0.006289883,0.00001091696,0.0142862,0.1466159,0.0009065968,0.811999,0.008560341,0.008220858],"study_design_scores_gemma":[0.0002416137,0.00008292525,0.001012373,0.0004180947,0.002533084,0.000003076428,0.0008980127,0.6517295,0.0002951655,0.3400574,0.002413635,0.0003151254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3425715,0.0002277298,0.6497273,0.0004195082,0.0002122785,0.0003483758,0.0006726777,0.0001027749,0.005717894],"genre_scores_gemma":[0.5052271,0.000006116673,0.494036,0.00003303222,0.0000503983,0.00002169193,0.0001032859,0.00002550979,0.0004967992],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5051136,"threshold_uncertainty_score":0.6660594,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401337191","doi":"10.1007/s10208-024-09671-w","title":"Polynomial and Rational Measure Modifications of Orthogonal Polynomials via Infinite-Dimensional Banded Matrix Factorizations","year":2024,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg; University of British Columbia","funders":"Division of Mathematical Sciences; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Leverhulme Trust","keywords":"Mathematics; Orthogonal polynomials; Measure (data warehouse); Polynomial; Polynomial matrix; Matrix (chemical analysis); Matrix polynomial; Pure mathematics; Combinatorics; Algebra over a field; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02219312052247101,"gpt":0.2865821892287377,"spread":0.2643890687062667,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004851767,0.0001892806,0.0002912617,0.0004706757,0.0002250726,0.0001591719,0.000365755,0.00008482255,0.0001231978],"category_scores_gemma":[0.0002012741,0.0001837127,0.000128384,0.0007126728,0.0002053504,0.0006359878,0.0001283394,0.0001289099,0.00003041783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003537755,"about_ca_system_score_gemma":0.0005522037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005286249,"about_ca_topic_score_gemma":0.000002121817,"domain_scores_codex":[0.9980258,0.00008374563,0.0008400237,0.0002987881,0.0005972503,0.0001544043],"domain_scores_gemma":[0.9971154,0.001689058,0.0002779494,0.0002924738,0.0005343847,0.00009068029],"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.000006945329,0.0002321325,0.00003652735,0.0002307813,0.000129781,0.000001101175,0.0008916339,0.0537846,0.002270318,0.9396914,0.0005401388,0.002184687],"study_design_scores_gemma":[0.000312066,0.00006327631,0.0006140198,0.0001183841,0.00005016527,0.00005135937,0.00003181293,0.7612658,0.0007837609,0.2359046,0.0005995215,0.0002052754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01813975,0.0002594996,0.9792422,0.0008417608,0.0002958989,0.0002975323,0.0002073931,0.0001143871,0.0006015609],"genre_scores_gemma":[0.7333387,0.000005175925,0.2662266,0.00001716124,0.00007849224,0.00002059877,0.0001545678,0.00001361949,0.0001451014],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7151989,"threshold_uncertainty_score":0.7491588,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3019932518","doi":"10.1007/s10208-021-09512-0","title":"Cumulant–Cumulant Relations in Free Probability Theory from Magnus’ Expansion","year":2021,"lang":"en","type":"preprint","venue":"Foundations of Computational Mathematics","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Norges Forskningsråd; Trond Mohn stiftelse; Agence Nationale de la Recherche; Norges Teknisk-Naturvitenskapelige Universitet","keywords":"Cumulant; Mathematics; Edgeworth series; Free probability; Monotone polygon; Commutative property; Pure mathematics; Applied mathematics; Statistics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.06804037972609624,"gpt":0.3394049101630724,"spread":0.2713645304369762,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001095299,0.0004132334,0.0009019003,0.0003558562,0.0001721164,0.0001757955,0.0007703988,0.0003806245,0.0007152853],"category_scores_gemma":[0.00218432,0.0004298691,0.0003487589,0.0005372058,0.0001972253,0.0002348004,0.0007462666,0.0006485659,0.00004140564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002152413,"about_ca_system_score_gemma":0.0006873947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001949555,"about_ca_topic_score_gemma":0.0002157868,"domain_scores_codex":[0.9961332,0.0002985326,0.001892329,0.0006205247,0.0007804449,0.0002749474],"domain_scores_gemma":[0.9905052,0.00602696,0.001101908,0.001533329,0.00073836,0.00009421288],"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.00003115993,0.002590799,0.0002642604,0.001378673,0.0002448728,0.000006788242,0.004857149,0.1734216,0.00003978191,0.8142159,0.00211991,0.0008290979],"study_design_scores_gemma":[0.0008865776,0.00001421407,0.001093402,0.0007710845,0.000203946,0.000006837075,0.0005709938,0.09307813,0.000039197,0.9028853,0.0001141168,0.0003362054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3862113,0.0003242316,0.6078332,0.001032132,0.0002967932,0.001420892,0.0007654899,0.0001236414,0.001992281],"genre_scores_gemma":[0.2543254,0.00004551044,0.7427604,0.00002600391,0.0001184405,0.0003461134,0.00193531,0.00006357067,0.0003792039],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1349272,"threshold_uncertainty_score":0.9998153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389477517","doi":"10.1007/s10208-023-09637-4","title":"Computational Complexity of Decomposing a Symmetric Matrix as a Sum of Positive Semidefinite and Diagonal Matrices","year":2023,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"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; Rank (graph theory); Matrix (chemical analysis); Positive-definite matrix; Diagonal; Combinatorics; Diagonal matrix; Semidefinite programming; Symmetric matrix; Polynomial matrix; Bounded function; Matrix polynomial; Matrix decomposition; Computational complexity theory; Polynomial; Discrete mathematics; Mathematical optimization; Algorithm; Mathematical analysis; Eigenvalues and eigenvectors","retraction":null,"screen_n_in":null,"score":{"opus":0.03505159384007851,"gpt":0.3077297506518258,"spread":0.2726781568117473,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001827571,0.0001430956,0.0003473928,0.000666149,0.00007034922,0.00002403569,0.0001315496,0.00005211352,0.00001755748],"category_scores_gemma":[0.0001079392,0.0001577204,0.00008157658,0.0009426538,0.000245699,0.0001241939,0.0000741621,0.00007784004,0.00001051546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002544555,"about_ca_system_score_gemma":0.0000590228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002148662,"about_ca_topic_score_gemma":0.000001519761,"domain_scores_codex":[0.9987193,0.00002995054,0.0006272584,0.0001197958,0.0003785506,0.0001251659],"domain_scores_gemma":[0.9976419,0.001484249,0.0002773693,0.0001202887,0.0004359759,0.00004017097],"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.00001098925,0.0001360697,0.0004856116,0.0004680916,0.0001918446,0.000002086048,0.000829945,0.6891827,0.0009298827,0.3066881,0.0002930012,0.0007816655],"study_design_scores_gemma":[0.0001910314,0.00004697149,0.008343282,0.0002325009,0.00004209776,0.0000212085,0.0001090689,0.5818784,0.001578348,0.4074419,0.000009635445,0.0001056191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8103482,0.0001730355,0.1875791,0.00006891151,0.00005997385,0.0002249306,0.0001800867,0.0001974974,0.00116827],"genre_scores_gemma":[0.7894202,0.00002927296,0.2103197,0.000005310832,0.00001175006,0.000005067833,0.0001843547,0.00001843279,0.000005814936],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1073043,"threshold_uncertainty_score":0.6431651,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4416875646","doi":"10.1007/s10208-025-09738-2","title":"Optimal sampling for least-squares approximation","year":2025,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Pointwise; Christoffel symbols; Sampling (signal processing); Function approximation; Generalization; Function (biology); Dimension (graph theory); Space (punctuation)","retraction":null,"screen_n_in":null,"score":{"opus":0.03518016164055663,"gpt":0.310050986311757,"spread":0.2748708246712003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007978849,0.00008333469,0.0001338652,0.0001600291,0.00007627762,0.00003578655,0.00009718043,0.00003703838,0.00001052045],"category_scores_gemma":[0.00007793424,0.00009174067,0.00005638262,0.0001585799,0.00003312512,0.00008781548,0.00001612829,0.00003975713,0.000004413054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002825679,"about_ca_system_score_gemma":0.00003280187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.19945e-7,"about_ca_topic_score_gemma":5.366029e-7,"domain_scores_codex":[0.9994509,0.000005256081,0.0002878946,0.00007347685,0.0001011101,0.000081335],"domain_scores_gemma":[0.9992136,0.000366918,0.00005763154,0.0001157954,0.0002334299,0.00001265963],"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.000002367297,0.0000382196,0.000004873268,0.0001561093,0.00004312897,2.75891e-8,0.0001365284,0.8097514,0.0004822046,0.185889,0.001110479,0.002385616],"study_design_scores_gemma":[0.000118276,0.00001115394,0.00009697715,0.00010808,0.00002141576,0.000001000334,0.00006805947,0.7449395,0.002672964,0.2510781,0.0008196605,0.00006480829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03448578,0.00004427427,0.9623016,0.00007265158,0.0001062328,0.0002684406,0.00001655965,0.0002474148,0.002457096],"genre_scores_gemma":[0.4740711,0.000001704192,0.5257699,0.000009241128,0.00001527801,0.00002916659,0.00006142184,0.000008472573,0.00003363288],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4395853,"threshold_uncertainty_score":0.3741076,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4407689519","doi":"10.1007/s10208-024-09673-8","title":"Restarts Subject to Approximate Sharpness: A Parameter-Free and Optimal Scheme For First-Order Methods","year":2025,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Scheme (mathematics); Subject (documents); Order (exchange); Applied mathematics; Numerical analysis; Mathematical optimization; Calculus (dental); Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03329306612632124,"gpt":0.3558228624035679,"spread":0.3225297962772466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005660764,0.0001612251,0.0002699542,0.0004481658,0.0002103868,0.000176508,0.0006772153,0.00005518494,0.000007750254],"category_scores_gemma":[0.002343812,0.0001677377,0.00005972294,0.0008621736,0.00008727503,0.0002883646,0.0003727778,0.00005672145,0.00000196968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004184854,"about_ca_system_score_gemma":0.0001431191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002508543,"about_ca_topic_score_gemma":0.000001735045,"domain_scores_codex":[0.9987002,0.00003803186,0.0005272899,0.0003248951,0.0002296319,0.0001799262],"domain_scores_gemma":[0.9960111,0.002475093,0.0001959989,0.0005331274,0.0007220964,0.00006256172],"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.000008036979,0.0001490983,0.00001986963,0.0002439512,0.00004993286,1.591744e-7,0.0008116388,0.0678088,0.00003300878,0.9273365,0.001395575,0.002143436],"study_design_scores_gemma":[0.0002270066,0.00005856652,0.00005536716,0.00007837107,0.00001292172,0.000003124161,0.00002719265,0.5792288,0.000192445,0.4197801,0.0002453458,0.0000907811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001910146,0.0000266275,0.9945019,0.001955034,0.0001471076,0.0009617329,0.00002572364,0.0001796713,0.0002920754],"genre_scores_gemma":[0.006418218,0.00000191618,0.9929704,0.0001428016,0.00001189803,0.0003304693,0.00002863129,0.00001287181,0.00008279878],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.51142,"threshold_uncertainty_score":0.6840145,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4387708094","doi":"10.1007/s10208-023-09623-w","title":"Toward Computational Morse–Floer Homology: Forcing Results for Connecting Orbits by Computing Relative Indices of Critical Points","year":2023,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Forcing (mathematics); Computability; Partial differential equation; Floer homology; Morse code; Morse theory; Applied mathematics; Mathematical analysis; Pure mathematics; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.08952213081817073,"gpt":0.3830744277024426,"spread":0.2935522968842719,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.001304623,0.0002334516,0.0006273605,0.0006388114,0.0003308517,0.00003273958,0.0002944988,0.0001598526,0.00005378601],"category_scores_gemma":[0.01026649,0.000241914,0.0001850113,0.001074512,0.0003878236,0.0002309114,0.0001504167,0.0001882319,0.0000284672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005490164,"about_ca_system_score_gemma":0.0001686536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008559009,"about_ca_topic_score_gemma":0.000001668129,"domain_scores_codex":[0.9971661,0.0001065358,0.001499582,0.0003373307,0.0005384451,0.0003519996],"domain_scores_gemma":[0.9744555,0.02328658,0.0009618565,0.0001927858,0.00102473,0.00007853771],"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.000033574,0.0004556976,0.00008278593,0.0008537963,0.0002205298,0.000002393118,0.006084179,0.03231918,0.00003178753,0.9546512,0.004778505,0.0004863535],"study_design_scores_gemma":[0.001046025,0.0001563822,0.0002645802,0.0001318,0.00009175461,0.00003209448,0.001854835,0.2006006,0.0001447923,0.7954382,0.00006229176,0.0001766197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2721492,0.0000207023,0.7241814,0.00163795,0.00020291,0.0004650607,0.0004467207,0.0001274073,0.0007686496],"genre_scores_gemma":[0.6223517,6.605044e-7,0.3769537,0.00002723405,0.00004018951,0.00001356991,0.0005193086,0.00002640857,0.00006722787],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3502025,"threshold_uncertainty_score":0.9980705,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2773477893","doi":"","title":"Complexity of Homotopy for the Eigenvalue Problem I","year":2014,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Functional Equations Stability Results","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Homotopy analysis method; Eigenvalues and eigenvectors; Homotopy; Numerical analysis; Homotopy perturbation method; Applied mathematics; Algebra over a field; Calculus (dental); Mathematical analysis; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1354589906913145,"gpt":0.3556903730761997,"spread":0.2202313823848852,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001177016,0.0001447374,0.0003267732,0.000115102,0.0002537057,0.00002526262,0.000336861,0.00005317188,0.00009718155],"category_scores_gemma":[0.003260474,0.0001127954,0.0001883557,0.0003121994,0.0005033232,0.0001090813,0.00005834588,0.00007935245,0.00001282366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004391995,"about_ca_system_score_gemma":0.0001576803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001145227,"about_ca_topic_score_gemma":0.00001903159,"domain_scores_codex":[0.9981444,0.0000720033,0.0009420282,0.0001672897,0.0005314539,0.0001428342],"domain_scores_gemma":[0.9865274,0.01114249,0.0006256537,0.000443157,0.00122609,0.00003521837],"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.00001758812,0.0004408916,0.00003645803,0.0005283607,0.00008985219,8.904866e-9,0.0006082727,0.02338688,0.00005531657,0.9735447,0.0006311509,0.0006605604],"study_design_scores_gemma":[0.0004135769,0.00008870289,0.0004755564,0.0000452142,0.00007599563,0.000002924432,0.0001353692,0.2311316,0.000183376,0.766814,0.0005529335,0.00008074757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02159377,0.00001106291,0.9732411,0.001167901,0.0001046184,0.001129594,0.0001590506,0.00004477111,0.002548135],"genre_scores_gemma":[0.4400478,7.556198e-7,0.559594,0.00001642286,0.00004400529,0.00009931246,0.00007269448,0.00001666951,0.0001082999],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4184541,"threshold_uncertainty_score":0.4599662,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}