{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Emmanuel J. Candès","is_ca":false},{"name":"Xiaodong Li","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008517039,0.00090102,0.001019812,0.0004995286,0.0005172088,0.001148326,0.001114417,0.001243158,0.01558614],"category_scores_gemma":[0.008214851,0.0006799969,0.0006403399,0.0009309376,0.00108252,0.003209096,0.001903783,0.003131385,0.001842942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00022368,"about_ca_system_score_gemma":0.0007233281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001594434,"about_ca_topic_score_gemma":0.002765321,"domain_scores_codex":[0.9993361,0.0001640106,0.00004090204,0.0001303596,0.0002681637,0.00006055882],"domain_scores_gemma":[0.9973182,0.001958411,0.0001503612,0.0002567028,0.0002541566,0.00006205802],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002527655,0.0002412768,0.001721528,0.0008582346,0.0001165201,0.0006082949,0.0004267365,0.2428566,0.00764674,0.3062467,0.04766452,0.3913601],"study_design_scores_gemma":[0.00006711276,0.00004326164,0.0001326581,0.00002916946,0.00001869195,0.0001478347,0.00007651401,0.7951891,0.002570315,0.1931027,0.008603903,0.00001860944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006212193,0.0001157215,0.9877856,0.0005051683,0.0001459291,0.00003550954,0.0000997734,0.000406248,0.00469401],"genre_scores_gemma":[0.1123011,0.0003220902,0.8732477,0.0003917134,0.0004022447,0.0001685875,0.0005095141,0.0006488945,0.01200803],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01558614,"threshold_uncertainty_score":0.05214083,"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","authors":[{"name":"Ben Adcock","is_ca":true},{"name":"Anders C. Hansen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001632299,0.00126642,0.001376927,0.001167669,0.000420843,0.001756889,0.001117214,0.001688516,0.002319856],"category_scores_gemma":[0.008301822,0.0004511721,0.0007076508,0.001856931,0.003601633,0.003008183,0.0017442,0.003327894,0.0003890666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008950475,"about_ca_system_score_gemma":0.0006845901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001877072,"about_ca_topic_score_gemma":0.001610945,"domain_scores_codex":[0.9987754,0.0006356392,0.00005418121,0.0001675677,0.0003022864,0.00006491696],"domain_scores_gemma":[0.9960646,0.002905161,0.0002510576,0.0003782317,0.0003083859,0.00009256801],"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.00003528003,0.00001493691,0.0001167827,0.0001062837,0.00001879932,0.00006772652,0.000076497,0.03745153,0.0009726819,0.9445823,0.001539144,0.01501803],"study_design_scores_gemma":[0.000009102768,0.00001482922,0.00009519103,0.00002042529,0.000006136094,0.00004998374,0.00001826972,0.1374288,0.0001961135,0.860032,0.002115048,0.00001411429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01211994,0.006346825,0.9672752,0.002014619,0.0004355117,0.00001567558,0.0001850802,0.0001208784,0.01148631],"genre_scores_gemma":[0.6866731,0.0158166,0.2767959,0.001475321,0.002890313,0.0002008655,0.0006312131,0.000129496,0.01538726],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002319856,"threshold_uncertainty_score":0.008632541,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04672218,0.004561781,0.006141392,0.003590479,0.001800772,0.005862706,0.009751324,0.006339285,0.01214834],"category_scores_gemma":[0.3129743,0.00333275,0.003135629,0.003878652,0.007859194,0.01860583,0.01359313,0.0154471,0.002843204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003057612,"about_ca_system_score_gemma":0.00549404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001734886,"about_ca_topic_score_gemma":0.002281501,"domain_scores_codex":[0.973662,0.013718,0.001402584,0.003175856,0.006586351,0.001455273],"domain_scores_gemma":[0.5714717,0.3757657,0.005975422,0.03039274,0.01251192,0.003882558],"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.003672138,0.0006638161,0.006738786,0.001379089,0.0006437342,0.0007715011,0.001093133,0.2697061,0.01517201,0.5272244,0.01115592,0.1617793],"study_design_scores_gemma":[0.0002584738,0.0002200328,0.0006830508,0.00013957,0.0001331128,0.0002018132,0.00006753077,0.7621347,0.003999674,0.2298439,0.002241777,0.00007635298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006554619,0.0008313542,0.9881577,0.001287083,0.0002315407,0.0001355958,0.0002513338,0.0005655702,0.001985111],"genre_scores_gemma":[0.2076125,0.002138258,0.7736665,0.001678144,0.00185914,0.001813477,0.001542838,0.001775033,0.007914191],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04672218,"threshold_uncertainty_score":0.2470934,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"D. Lüke","is_ca":false},{"name":"Hung M. Phan","is_ca":true},{"name":"Xianfu Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001991526,0.001647139,0.001502957,0.001386708,0.0006519097,0.003017466,0.001886622,0.001413592,0.004585355],"category_scores_gemma":[0.008842263,0.0008700126,0.0008551364,0.002103949,0.003525395,0.004258043,0.002656518,0.004648147,0.0006759334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009887961,"about_ca_system_score_gemma":0.001347224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003323132,"about_ca_topic_score_gemma":0.002789518,"domain_scores_codex":[0.9985653,0.0006471717,0.00005610916,0.0002094179,0.0004472139,0.00007486892],"domain_scores_gemma":[0.996983,0.001896431,0.0003136489,0.0002057132,0.0004308808,0.000170367],"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.00002634519,0.00002684047,0.0001074532,0.0000775666,0.00001537808,0.00004494689,0.00004776302,0.05074088,0.0004217018,0.9345289,0.003035202,0.01092712],"study_design_scores_gemma":[0.00001176812,0.00001567483,0.00006452381,0.00001717812,0.000004648683,0.00003489034,0.00002727921,0.2445067,0.0001685333,0.7524709,0.002663717,0.00001405197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01003304,0.001619176,0.9673978,0.001259957,0.0002313158,0.00003630579,0.000270049,0.00009302946,0.01905931],"genre_scores_gemma":[0.4827866,0.007904038,0.4574691,0.001124966,0.001924281,0.0004394306,0.001557303,0.0004343496,0.04636002],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004585355,"threshold_uncertainty_score":0.01533955,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003273449,0.0009376768,0.001449167,0.002071824,0.00321965,0.005139487,0.001655572,0.002704294,0.009750385],"category_scores_gemma":[0.01540082,0.0006424498,0.0013836,0.002759319,0.009268885,0.01206403,0.005869725,0.006185622,0.001249341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001829402,"about_ca_system_score_gemma":0.001164307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001427072,"about_ca_topic_score_gemma":0.0007953327,"domain_scores_codex":[0.9976817,0.0005493977,0.0001308145,0.0005504933,0.0005663458,0.0005211603],"domain_scores_gemma":[0.9908279,0.005142941,0.0006126307,0.001345373,0.00116457,0.0009066158],"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.00003342217,0.000013819,0.0002181995,0.00002005825,0.0000031815,0.00002762166,0.0001157594,0.0002708677,0.0001053886,0.9943756,0.002265215,0.002550764],"study_design_scores_gemma":[0.00001309094,0.000006307097,0.0001328366,0.00001060528,0.00000413781,0.00004430212,0.00004750703,0.001127158,0.000105712,0.9962704,0.002231147,0.000006751289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4015253,0.002956478,0.2208936,0.05052833,0.004919855,0.00007085344,0.001079913,0.0008530364,0.3171727],"genre_scores_gemma":[0.9586986,0.0009977585,0.01568574,0.002469827,0.002416891,0.00006700572,0.0005763799,0.0001304368,0.01895743],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009750385,"threshold_uncertainty_score":0.03261834,"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","authors":[{"name":"Levent Tunçel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002541789,0.001515242,0.001730516,0.001300278,0.0008052883,0.001618981,0.001760823,0.001048495,0.00526614],"category_scores_gemma":[0.006101771,0.0007634083,0.001451791,0.001570141,0.001754939,0.002040717,0.003399215,0.005257589,0.001527481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006670455,"about_ca_system_score_gemma":0.001309777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001654879,"about_ca_topic_score_gemma":0.001819364,"domain_scores_codex":[0.9990267,0.000471258,0.00005273725,0.0001278091,0.0002669992,0.0000545179],"domain_scores_gemma":[0.9987619,0.0005152098,0.00008342181,0.0002580845,0.0002948239,0.00008654912],"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.00008582255,0.0001550292,0.0003673187,0.0002923873,0.00007955954,0.0001251092,0.0001930254,0.1854661,0.002530218,0.6541227,0.00842423,0.1481585],"study_design_scores_gemma":[0.00002324848,0.00003723255,0.00008346478,0.00003454118,0.00001650402,0.00006558897,0.00002139448,0.7887757,0.0007152761,0.2002777,0.009938589,0.00001079692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001675948,0.0002804288,0.9916967,0.0002009957,0.0001211175,0.00003895847,0.00002903083,0.00006985899,0.005886898],"genre_scores_gemma":[0.1559546,0.001995052,0.8241858,0.0004069556,0.0005704257,0.0003924814,0.0003037643,0.0005486424,0.01564224],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00526614,"threshold_uncertainty_score":0.01761699,"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","authors":[{"name":"James V. Burke","is_ca":false},{"name":"Adrian S. Lewis","is_ca":true},{"name":"Michael L. Overton","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002032189,0.000970735,0.001689967,0.001871036,0.001773637,0.003822044,0.001464298,0.001631529,0.01088704],"category_scores_gemma":[0.0180906,0.0007376373,0.0007629443,0.001330286,0.003992462,0.006295036,0.003860412,0.002903438,0.001440264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001463477,"about_ca_system_score_gemma":0.0009534627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003736271,"about_ca_topic_score_gemma":0.000327519,"domain_scores_codex":[0.9982077,0.0006159842,0.00007327165,0.0004248131,0.0004369082,0.000241285],"domain_scores_gemma":[0.9907724,0.005674243,0.000832379,0.0008904916,0.00110752,0.000722909],"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.00007875857,0.00002652185,0.0002191231,0.00003662918,0.00001300462,0.00001901239,0.00008121408,0.01084722,0.0009321414,0.9785188,0.001699407,0.007528197],"study_design_scores_gemma":[0.000009753236,0.00001089169,0.0001082424,0.000006387745,0.000004074588,0.00001905899,0.00002529297,0.02646263,0.0004084283,0.9723913,0.0005445869,0.000009383362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2353407,0.002755791,0.6439716,0.006388979,0.0007472077,0.00009084528,0.000282348,0.0005686528,0.1098539],"genre_scores_gemma":[0.960607,0.0007767814,0.02055353,0.0003633069,0.0007494371,0.0001413961,0.0001121139,0.0001950513,0.01650134],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01088704,"threshold_uncertainty_score":0.03642076,"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","authors":[{"name":"Saugata Basu","is_ca":false},{"name":"Marie-Françoise Roy","is_ca":false},{"name":"Mohab Safey El Din","is_ca":false},{"name":"Éric Schost","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007164273,0.0008198153,0.001122844,0.001292515,0.001089758,0.001836183,0.002541784,0.001750561,0.01619673],"category_scores_gemma":[0.004365278,0.0006248587,0.001096794,0.001589703,0.0008680806,0.003521398,0.004778528,0.002253113,0.005166148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006346781,"about_ca_system_score_gemma":0.001589806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001667062,"about_ca_topic_score_gemma":0.002453958,"domain_scores_codex":[0.9992275,0.0001315026,0.00005308607,0.0002367144,0.0002451395,0.0001059644],"domain_scores_gemma":[0.9986066,0.0004039908,0.0000524457,0.0005561622,0.0002801799,0.0001004711],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005701787,0.0003204623,0.001293141,0.0004314213,0.0001179419,0.0002129113,0.0003937715,0.04746759,0.01010449,0.260137,0.03198791,0.6469632],"study_design_scores_gemma":[0.0002101632,0.0003039458,0.0006691864,0.00009215289,0.00008984861,0.0004128127,0.0002598815,0.5042561,0.01393229,0.4476135,0.03207931,0.00008084419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03136683,0.0002568884,0.9497798,0.0004175256,0.0001595455,0.0001886554,0.0003512303,0.004027173,0.01345242],"genre_scores_gemma":[0.1905953,0.0002124016,0.7946874,0.0002321933,0.0000505774,0.0002372475,0.001331462,0.0008093752,0.01184413],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01619673,"threshold_uncertainty_score":0.05418342,"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","authors":[{"name":"Carlos Beltrán","is_ca":true},{"name":"Michael Shub","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003804445,0.001014586,0.002237203,0.003238804,0.001813668,0.005387832,0.00319922,0.002036106,0.009222463],"category_scores_gemma":[0.02081181,0.0007067517,0.001864281,0.002587744,0.005659777,0.02039848,0.00592347,0.005624798,0.0008179285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003993829,"about_ca_system_score_gemma":0.001143301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00218834,"about_ca_topic_score_gemma":0.00095959,"domain_scores_codex":[0.9968002,0.0008467678,0.0001699282,0.0006809443,0.001187374,0.0003148259],"domain_scores_gemma":[0.9859773,0.01019624,0.0006833234,0.001363995,0.001130275,0.0006488591],"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.00003439813,0.00001012891,0.0002428387,0.0000519161,0.00000949324,0.00002229045,0.00009055995,0.002342605,0.0002698973,0.9919639,0.001163018,0.003798884],"study_design_scores_gemma":[0.000006655933,0.0000103587,0.000198329,0.000008647517,0.000006809779,0.00002975056,0.00002642645,0.01748311,0.0002987032,0.9806192,0.001300208,0.00001175701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1688337,0.003384566,0.7327786,0.008721501,0.0004521629,0.00009984955,0.001023916,0.0003641303,0.08434153],"genre_scores_gemma":[0.902953,0.002301081,0.07320912,0.0008148277,0.001265937,0.0001882613,0.0009469767,0.0002796901,0.01804109],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009222463,"threshold_uncertainty_score":0.03085226,"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","authors":[{"name":"Ricardo Baptista","is_ca":false},{"name":"Youssef Marzouk","is_ca":false},{"name":"Olivier Zahm","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003080426,0.0006979606,0.001509652,0.00124003,0.0008303829,0.002571397,0.002214599,0.002502279,0.005535551],"category_scores_gemma":[0.02802439,0.0007332716,0.001025796,0.001648565,0.003248014,0.006589744,0.003047603,0.003247896,0.0005070707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001850595,"about_ca_system_score_gemma":0.001558413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006459615,"about_ca_topic_score_gemma":0.004213605,"domain_scores_codex":[0.9988419,0.0005921043,0.00006279929,0.0001932404,0.0001917206,0.0001183406],"domain_scores_gemma":[0.9811434,0.01569026,0.0008306775,0.001017255,0.0008164334,0.0005021156],"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.00007739758,0.00004707658,0.0005580353,0.00009177991,0.0000193318,0.00004082867,0.0001977627,0.1938605,0.0003610719,0.7831554,0.001191894,0.02039889],"study_design_scores_gemma":[0.000006404649,0.00001203757,0.00005092442,0.00001259169,0.000003079749,0.000008849473,0.00001433801,0.5782195,0.00007749807,0.4213118,0.0002768903,0.000006087579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04133084,0.0005826646,0.9522858,0.0009522152,0.00005626362,0.00003770436,0.0001566796,0.0001813629,0.004416421],"genre_scores_gemma":[0.8230791,0.001622053,0.1626684,0.0004741597,0.0002592534,0.0002301809,0.0007461917,0.0001969779,0.01072372],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006459615,"threshold_uncertainty_score":0.01851821,"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","authors":[{"name":"Évelyne Hubert","is_ca":false},{"name":"George Labahn","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009123746,0.0005495467,0.0007323331,0.001657974,0.0009362659,0.002048859,0.0008217496,0.0005717144,0.003258637],"category_scores_gemma":[0.003021143,0.0002788356,0.0007926475,0.0007899299,0.003314144,0.002920853,0.001524434,0.001774434,0.0003199732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001119025,"about_ca_system_score_gemma":0.0008242056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00116831,"about_ca_topic_score_gemma":0.0006697837,"domain_scores_codex":[0.9994612,0.0001838192,0.0000248869,0.00007594121,0.000182202,0.00007197008],"domain_scores_gemma":[0.9989327,0.0004972002,0.0001466743,0.0001537179,0.0001451398,0.0001245572],"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.000002923029,0.000006820178,0.00003966464,0.00000767318,0.00000229063,0.00000812095,0.00003524981,0.001555478,0.0001582099,0.9962015,0.0003173191,0.001664868],"study_design_scores_gemma":[0.000002787166,0.000002656795,0.00004390459,0.000001760461,8.419199e-7,0.000006368617,0.000008319252,0.008693083,0.00005631635,0.9907395,0.0004419666,0.000002546991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3908333,0.005078475,0.4631025,0.005400146,0.0008168817,0.0001098183,0.0004583904,0.0005263173,0.1336742],"genre_scores_gemma":[0.9678275,0.001353662,0.02223306,0.0002518679,0.0007007482,0.00008239514,0.0001689655,0.00009041021,0.007291244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003258637,"threshold_uncertainty_score":0.01090127,"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","authors":[{"name":"Ilia Binder","is_ca":true},{"name":"Mark Braverman","is_ca":true},{"name":"Michael Yampolsky","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001727657,0.001202817,0.002318663,0.003643052,0.003505504,0.01045655,0.001974838,0.002139424,0.005831514],"category_scores_gemma":[0.01318531,0.001534545,0.001760275,0.002489034,0.01144442,0.01273542,0.006216769,0.005468834,0.001035257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00217182,"about_ca_system_score_gemma":0.001310781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006619614,"about_ca_topic_score_gemma":0.000709211,"domain_scores_codex":[0.9977362,0.0003834413,0.0001632156,0.0004374558,0.0008361234,0.0004435666],"domain_scores_gemma":[0.9908667,0.005134247,0.0007604765,0.00133361,0.0009236354,0.0009814416],"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.000033424,0.00001057841,0.0000970129,0.00002395332,0.000005273381,0.00004550725,0.0002262969,0.0006452451,0.0003746133,0.9967275,0.0003194331,0.001491208],"study_design_scores_gemma":[0.00001419039,0.000007251924,0.000085559,0.00001158865,0.000006861428,0.00007779686,0.0001110412,0.003024005,0.0005681347,0.9948986,0.001181274,0.00001361356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5575716,0.001116186,0.3370412,0.001886313,0.0005110797,0.0001032749,0.000632339,0.001323778,0.09981433],"genre_scores_gemma":[0.9366909,0.0004876495,0.04717131,0.0002592316,0.0002500349,0.0001856447,0.0005281747,0.0003325809,0.01409455],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01045655,"threshold_uncertainty_score":0.01950836,"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","authors":[{"name":"Éric Schost","is_ca":true},{"name":"Pierre-Jean Spaenlehauer","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001735963,0.001020372,0.001168052,0.0006679412,0.0005198714,0.001165166,0.001876937,0.001849524,0.005204895],"category_scores_gemma":[0.007808644,0.0005451574,0.0006397113,0.0009280589,0.00108207,0.00158951,0.002522059,0.003247865,0.002955672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005580817,"about_ca_system_score_gemma":0.001672114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0017446,"about_ca_topic_score_gemma":0.002624786,"domain_scores_codex":[0.9988284,0.0002631042,0.00005477513,0.0001619533,0.0006238337,0.00006802133],"domain_scores_gemma":[0.9979182,0.0009593256,0.00009293532,0.0002823641,0.0006330658,0.0001141456],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004537086,0.000277019,0.0003945307,0.0003594779,0.00008738062,0.0001947132,0.0002459207,0.3897933,0.02604057,0.1255963,0.01457094,0.4419861],"study_design_scores_gemma":[0.00003077244,0.0000654906,0.0000410481,0.0000117353,0.000005690972,0.0000548463,0.00001244804,0.981832,0.001828753,0.01373246,0.002372502,0.00001225057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001109975,0.00006049509,0.9977819,0.00008516844,0.00005181184,0.00002131901,0.00002283299,0.000124925,0.0007415776],"genre_scores_gemma":[0.04502371,0.0001750022,0.9488373,0.0001790427,0.0001200969,0.0001665742,0.0002293434,0.0001420372,0.005126751],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005204895,"threshold_uncertainty_score":0.01741207,"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","authors":[{"name":"Marcio Gameiro","is_ca":false},{"name":"Jean‐Philippe Lessard","is_ca":true},{"name":"Alessandro Pugliese","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001717083,0.00111237,0.001330727,0.002387987,0.001270189,0.002887198,0.001865748,0.001504687,0.003363093],"category_scores_gemma":[0.007216911,0.000716316,0.0009175993,0.000981263,0.003841672,0.005993071,0.003143831,0.002343747,0.000392567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001687534,"about_ca_system_score_gemma":0.0009640923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001184629,"about_ca_topic_score_gemma":0.001671326,"domain_scores_codex":[0.9995651,0.0001816529,0.00002851451,0.00005285916,0.000123584,0.00004832778],"domain_scores_gemma":[0.9982257,0.001017083,0.000158868,0.0002028822,0.0001733704,0.0002220849],"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.00003892791,0.00002460633,0.000283869,0.00005918541,0.00001501608,0.00004884317,0.0001245386,0.02171859,0.0005272639,0.9730891,0.0004667759,0.003603265],"study_design_scores_gemma":[0.00001116115,0.00001089981,0.0001315681,0.00001640863,0.000004666231,0.00001406242,0.00003381093,0.1484347,0.0001843612,0.850736,0.000411016,0.00001149972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4015099,0.001028141,0.5711507,0.001772406,0.0001773149,0.00006413601,0.0002137317,0.0005538433,0.02352982],"genre_scores_gemma":[0.9204075,0.0004060575,0.07325081,0.0001298358,0.0001326358,0.00007667501,0.0001844976,0.0001941022,0.005217878],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003363093,"threshold_uncertainty_score":0.01224393,"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","authors":[{"name":"I. G. Lisle","is_ca":false},{"name":"G. J. Reid","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016565,0.0003845015,0.000656305,0.00196348,0.001028466,0.002223817,0.0008853273,0.0007031109,0.004022792],"category_scores_gemma":[0.00195858,0.0002215769,0.0006325844,0.0009735711,0.002264672,0.00488255,0.001387951,0.001439415,0.0004664364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000787541,"about_ca_system_score_gemma":0.0005426456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000430333,"about_ca_topic_score_gemma":0.0003235096,"domain_scores_codex":[0.9994418,0.00012541,0.00005206937,0.000122174,0.0001767444,0.00008187554],"domain_scores_gemma":[0.9987029,0.0004157509,0.0002178774,0.0002249324,0.0002393685,0.0001991753],"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.00002133803,0.0000202282,0.0002626332,0.00001591304,0.000003430309,0.00003333483,0.00008938013,0.0005794977,0.0008739899,0.9926143,0.0007017039,0.004784338],"study_design_scores_gemma":[0.00001116005,0.00001384104,0.000231068,0.000004791783,0.000003386547,0.00004115238,0.00004210804,0.01037616,0.0003734688,0.9875128,0.001381261,0.000008727388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5922765,0.001213412,0.3519379,0.002044834,0.0007599292,0.0001007259,0.0004225268,0.0002563092,0.05098784],"genre_scores_gemma":[0.9542509,0.0005573423,0.03089038,0.0002680068,0.0005467596,0.00006615149,0.0004801953,0.00007723839,0.01286305],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004022792,"threshold_uncertainty_score":0.01345754,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002646047,0.0009583827,0.001197412,0.002888455,0.001870646,0.003196233,0.001303311,0.001884716,0.009143954],"category_scores_gemma":[0.01920562,0.0006920723,0.0009278785,0.001784844,0.006199312,0.008597028,0.004555928,0.006319584,0.001144513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002719489,"about_ca_system_score_gemma":0.001538177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002057812,"about_ca_topic_score_gemma":0.001180847,"domain_scores_codex":[0.9984722,0.0006873279,0.00005509975,0.0002269872,0.0003917663,0.0001667209],"domain_scores_gemma":[0.9883868,0.007367031,0.0009514659,0.0006219532,0.001392624,0.001280189],"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.00003454784,0.00001025955,0.0001984885,0.0000243246,0.000005379421,0.00003038836,0.0001527033,0.002180354,0.0002503482,0.9932708,0.0009391975,0.002903157],"study_design_scores_gemma":[0.000008499544,0.00001715034,0.0002367276,0.00001320907,0.000004687631,0.00003286996,0.00004220249,0.01029238,0.0001156345,0.9874556,0.001769933,0.0000110852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3447755,0.004944579,0.486156,0.0190548,0.0008616975,0.0001309848,0.0007826647,0.0006433384,0.1426503],"genre_scores_gemma":[0.9168354,0.002500457,0.05197705,0.001086227,0.0007339037,0.0001342598,0.0003491194,0.0003731425,0.02601041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009143954,"threshold_uncertainty_score":0.03058958,"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","authors":[{"name":"Courtney Paquette","is_ca":true},{"name":"Bart van Merriënboer","is_ca":true},{"name":"Elliot Paquette","is_ca":true},{"name":"Fabián Pedregosa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01235723,0.002569139,0.00612124,0.003778724,0.002671188,0.005905473,0.005601698,0.003568325,0.00793564],"category_scores_gemma":[0.07954174,0.00236285,0.004787073,0.002704891,0.009923915,0.01828285,0.006283417,0.009973447,0.0005198939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003465791,"about_ca_system_score_gemma":0.003381126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003103635,"about_ca_topic_score_gemma":0.002646223,"domain_scores_codex":[0.9936433,0.001867565,0.0003935011,0.001836114,0.00105611,0.001203431],"domain_scores_gemma":[0.8846212,0.08765104,0.009662263,0.008194526,0.004655721,0.005215311],"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.0001567899,0.0001718343,0.003349331,0.000319205,0.0002819011,0.0006317695,0.0005546357,0.07180015,0.001621731,0.9129745,0.002315831,0.005822274],"study_design_scores_gemma":[0.00003009234,0.00004905953,0.0006708134,0.00004251145,0.00008950595,0.0002003518,0.00008192562,0.3871543,0.0005784601,0.6106921,0.0003556417,0.00005524134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1723726,0.002014379,0.8058662,0.004126514,0.000198333,0.0001589412,0.0006277579,0.001148766,0.01348651],"genre_scores_gemma":[0.9683782,0.001537835,0.0227447,0.0006886,0.0006579697,0.000337913,0.0004452449,0.0005081713,0.004701286],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01235723,"threshold_uncertainty_score":0.06535208,"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","authors":[{"name":"JACKIE C. K. HO","is_ca":true},{"name":"Levent Tunçel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01339417,0.001329272,0.003488239,0.004450488,0.002444454,0.00690545,0.004875498,0.002892957,0.005137805],"category_scores_gemma":[0.05770032,0.001349803,0.003318808,0.005344552,0.006879847,0.01983688,0.005968301,0.009982939,0.0005113897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003914775,"about_ca_system_score_gemma":0.002387658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008290827,"about_ca_topic_score_gemma":0.0005919972,"domain_scores_codex":[0.9895452,0.004145666,0.0005255341,0.00159898,0.003389563,0.0007951073],"domain_scores_gemma":[0.9412869,0.04432014,0.003786704,0.006162627,0.002994827,0.001448916],"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.00008318902,0.0000386963,0.0002624284,0.00006676971,0.00002415519,0.0000245214,0.0001580756,0.009096394,0.0002541666,0.9782471,0.001347139,0.01039736],"study_design_scores_gemma":[0.00001765742,0.00002728582,0.0002264523,0.00001891404,0.00001626166,0.00003413712,0.00003352663,0.06305967,0.0004579327,0.9352641,0.0008238388,0.00002015746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08192108,0.001486036,0.892489,0.002862089,0.0001989689,0.00009873892,0.0003630437,0.0003785741,0.02020251],"genre_scores_gemma":[0.7947925,0.00124947,0.192917,0.0008301437,0.0009262743,0.0004691695,0.0008054417,0.0004594081,0.00755057],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01339417,"threshold_uncertainty_score":0.07083595,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005123466,0.0002434516,0.0003080742,0.001367878,0.0008043334,0.00228229,0.0004149555,0.0004731279,0.003243235],"category_scores_gemma":[0.00191391,0.0001488778,0.0003166119,0.0006846814,0.002737183,0.003300932,0.001422392,0.0009180431,0.0002254217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001034586,"about_ca_system_score_gemma":0.0003529568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001243219,"about_ca_topic_score_gemma":0.001135971,"domain_scores_codex":[0.9995552,0.00008531817,0.00002160193,0.0001208901,0.0001300709,0.00008695132],"domain_scores_gemma":[0.9990532,0.0002284248,0.0002019357,0.0001689181,0.0001561413,0.0001913635],"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.000004748301,0.000007941585,0.000401871,0.000006658619,0.000002572206,0.0000412454,0.0001468146,0.0009135802,0.0006224582,0.9958669,0.0001498567,0.00183537],"study_design_scores_gemma":[0.000003407509,0.000008368866,0.0007021016,0.00001022902,0.000003113231,0.00009454726,0.0001686262,0.01441202,0.0006922855,0.9815118,0.002382684,0.00001079727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.762625,0.0006108093,0.1654603,0.00074426,0.0001251611,0.00002893808,0.0001164574,0.0001035473,0.07018528],"genre_scores_gemma":[0.9890206,0.0001261239,0.007852732,0.00007353576,0.00004511483,0.00001436424,0.00004823366,0.0000168474,0.00280242],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003243235,"threshold_uncertainty_score":0.01084971,"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","authors":[{"name":"Dominik Schötzau","is_ca":true},{"name":"Christoph Schwab","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00575592,0.001402184,0.001112795,0.001679165,0.0007117144,0.002180094,0.00187076,0.001461321,0.005349819],"category_scores_gemma":[0.02590855,0.0007249546,0.001035089,0.00078594,0.00401764,0.004019457,0.005332395,0.004229105,0.0006938329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001449449,"about_ca_system_score_gemma":0.001323256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002446435,"about_ca_topic_score_gemma":0.002284524,"domain_scores_codex":[0.9984258,0.0007328977,0.00007383261,0.0001931377,0.0004340733,0.0001403183],"domain_scores_gemma":[0.9827188,0.01254745,0.0006819065,0.001152938,0.002245615,0.0006531629],"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.0004895024,0.0001358389,0.002233911,0.000621209,0.00007195427,0.000215703,0.0005961838,0.3614943,0.00749877,0.5789425,0.002933798,0.04476627],"study_design_scores_gemma":[0.00000974799,0.00002497473,0.0001833168,0.00003942612,0.000008339568,0.00006605096,0.0000480849,0.9241461,0.001482412,0.07307242,0.0009079213,0.00001120798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03130289,0.0007304759,0.9582034,0.0006675743,0.0001135128,0.00005032973,0.00008779192,0.0001327002,0.008711188],"genre_scores_gemma":[0.6487577,0.001491082,0.3228869,0.0005134393,0.0002959093,0.0002636613,0.0004138597,0.00075656,0.02462097],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00575592,"threshold_uncertainty_score":0.03044057,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007251301,0.0005117194,0.0008546094,0.0008323388,0.0003509572,0.0009926661,0.001368612,0.001105314,0.001637475],"category_scores_gemma":[0.002555119,0.0004521872,0.0006993765,0.0006015796,0.0007494643,0.001105917,0.001606974,0.0008023255,0.0005434733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005130405,"about_ca_system_score_gemma":0.0005920006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001075902,"about_ca_topic_score_gemma":0.0009873332,"domain_scores_codex":[0.9996166,0.0001003326,0.00001801027,0.00004572803,0.0001852115,0.00003409968],"domain_scores_gemma":[0.9995056,0.0002196029,0.00005416945,0.0001043309,0.00008546916,0.00003074317],"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.00006716736,0.00005198788,0.0004698512,0.00008435472,0.0000302922,0.0001054699,0.0001309799,0.8480329,0.02714495,0.05674374,0.0005479712,0.06659035],"study_design_scores_gemma":[0.000001684063,0.000008212035,0.00003166286,0.000002354572,0.000001566271,0.000012929,0.000005554533,0.9938267,0.001395929,0.004419316,0.0002905928,0.000003449299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02481779,0.00007025342,0.9730535,0.00004552539,0.00001362793,0.00002897885,0.00001857897,0.0001598556,0.0017919],"genre_scores_gemma":[0.540928,0.0001612529,0.4539102,0.00006252449,0.00001938544,0.0001151593,0.0001227514,0.000318266,0.004362395],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001637475,"threshold_uncertainty_score":0.005477965,"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","authors":[{"name":"Carlos Beltrán","is_ca":false},{"name":"Michael Shub","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0148126,0.001748355,0.003224177,0.001876883,0.002242669,0.004186548,0.00417451,0.003327632,0.004020477],"category_scores_gemma":[0.07299543,0.001094929,0.00329629,0.002164005,0.009700149,0.01013897,0.00604762,0.01361672,0.0007320909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002811476,"about_ca_system_score_gemma":0.002136128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003129864,"about_ca_topic_score_gemma":0.00261926,"domain_scores_codex":[0.9906564,0.004394919,0.0004941396,0.001564868,0.002225847,0.0006637782],"domain_scores_gemma":[0.9173332,0.06856254,0.00151193,0.008350104,0.002928809,0.001313293],"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.00008493338,0.00002857327,0.0004410711,0.0001093437,0.00008191623,0.00009943477,0.0001327797,0.0136606,0.001047925,0.9665726,0.004559479,0.01318136],"study_design_scores_gemma":[0.00001689713,0.00003644128,0.0003740617,0.00004473595,0.00004541544,0.00007167611,0.00001976935,0.1467881,0.0009760784,0.8474307,0.004152341,0.00004370114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01093365,0.004678291,0.9546145,0.007686893,0.001626447,0.00002941747,0.0001643199,0.0004784004,0.01978807],"genre_scores_gemma":[0.6370932,0.007219279,0.3150774,0.006634251,0.01232633,0.0003019717,0.0004466684,0.002257267,0.01864357],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0148126,"threshold_uncertainty_score":0.07833749,"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","authors":[{"name":"Marco Mondelli","is_ca":false},{"name":"Christos Thrampoulidis","is_ca":true},{"name":"Ramji Venkataramanan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005653201,0.001735755,0.002295477,0.001184942,0.0004691679,0.001791734,0.001779638,0.002103494,0.002275332],"category_scores_gemma":[0.01808454,0.001309819,0.001650395,0.001271274,0.001725285,0.002878121,0.002143695,0.00183452,0.0008877693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009311781,"about_ca_system_score_gemma":0.001642809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004641987,"about_ca_topic_score_gemma":0.004503381,"domain_scores_codex":[0.9957093,0.002359677,0.0001613942,0.0007810582,0.0006789178,0.000309538],"domain_scores_gemma":[0.9929121,0.005496525,0.0004417163,0.0004273374,0.0005704886,0.0001517343],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004720268,0.0001235021,0.001047444,0.0003256365,0.0003028307,0.0001200623,0.0001179711,0.8144875,0.00470089,0.02843344,0.002636445,0.1472323],"study_design_scores_gemma":[0.0000152468,0.00003244914,0.000122317,0.00001368488,0.00002283119,0.00001924111,0.00001090729,0.9919339,0.0007337087,0.006689809,0.000393063,0.00001268708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008299752,0.000329255,0.9899653,0.000315635,0.00003534127,0.00002307121,0.00004464122,0.0002538875,0.0007333033],"genre_scores_gemma":[0.498801,0.000850286,0.4921257,0.0005165195,0.0003850072,0.0001925312,0.0005945386,0.0002877516,0.006246648],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005653201,"threshold_uncertainty_score":0.02989733,"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","authors":[{"name":"Feng Dai","is_ca":true},{"name":"Andriy Prymak","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001194823,0.001230711,0.002305358,0.001853282,0.001337245,0.003517056,0.002102464,0.0025215,0.009524546],"category_scores_gemma":[0.01173382,0.001098462,0.001078548,0.001797929,0.002818848,0.008174437,0.004273596,0.00462916,0.0008336827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001642229,"about_ca_system_score_gemma":0.0006974988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001146816,"about_ca_topic_score_gemma":0.001766699,"domain_scores_codex":[0.9991834,0.0001595147,0.00003952428,0.0002167933,0.000201753,0.0001989876],"domain_scores_gemma":[0.9937836,0.003874387,0.0007985715,0.0005083648,0.0004679289,0.0005670946],"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.0001524368,0.00006446355,0.0005149243,0.0001259659,0.00002283744,0.00005897168,0.0001413233,0.04044094,0.002069718,0.9375172,0.001793424,0.01709772],"study_design_scores_gemma":[0.00003270199,0.00006133781,0.0004793761,0.00003783352,0.00001939551,0.00008458002,0.0001492571,0.1549501,0.001353353,0.8396233,0.003189645,0.00001908018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2869633,0.001063405,0.6759868,0.00222898,0.0001635622,0.00007614999,0.0004848831,0.0003677013,0.03266518],"genre_scores_gemma":[0.8770966,0.001344506,0.0964581,0.0003624573,0.0002211287,0.0001585763,0.0006474089,0.0003835321,0.02332778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009524546,"threshold_uncertainty_score":0.0318628,"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","authors":[{"name":"Sinho Chewi","is_ca":false},{"name":"Murat A. Erdogdu","is_ca":true},{"name":"Mufan Li","is_ca":true},{"name":"Ruoqi Shen","is_ca":false},{"name":"Matthew S. Zhang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005768907,0.001130742,0.001799021,0.002925289,0.001475215,0.00255346,0.00268822,0.002128767,0.00706093],"category_scores_gemma":[0.02663274,0.001071193,0.001514747,0.001297474,0.005347678,0.00476492,0.003726231,0.003695833,0.0004155221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003695449,"about_ca_system_score_gemma":0.00279074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004830128,"about_ca_topic_score_gemma":0.003615574,"domain_scores_codex":[0.9983817,0.0008844099,0.00005708355,0.000138335,0.0003695215,0.000168901],"domain_scores_gemma":[0.9808445,0.0148574,0.00101258,0.0007161435,0.001450803,0.001118598],"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.00001363683,0.00001712574,0.0002044611,0.00002971449,0.00001595371,0.00001858198,0.00004216768,0.03829933,0.0001623903,0.9595048,0.0004524521,0.001239387],"study_design_scores_gemma":[0.000006394954,0.000008185249,0.0001183427,0.00001707739,0.000006032385,0.00001146786,0.00001284997,0.4028381,0.00009493013,0.5963657,0.0005076785,0.00001327657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06447115,0.002085414,0.9079334,0.00302428,0.0003350903,0.0000683266,0.0001604436,0.0002756518,0.0216463],"genre_scores_gemma":[0.8820333,0.002616777,0.08750465,0.00120826,0.00123963,0.0003461632,0.0004065688,0.000664408,0.0239802],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00706093,"threshold_uncertainty_score":0.03050929,"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","authors":[{"name":"Timon S. Gutleb","is_ca":true},{"name":"Sheehan Olver","is_ca":false},{"name":"Richard Mikaël Slevinsky","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007424088,0.0004378043,0.0004077434,0.0006001567,0.0003810953,0.0007508358,0.000715496,0.0004234318,0.002048403],"category_scores_gemma":[0.004031218,0.0002280248,0.0003503071,0.000556599,0.001023883,0.001619523,0.001021607,0.0008801235,0.000551086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005508185,"about_ca_system_score_gemma":0.0005196616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001313511,"about_ca_topic_score_gemma":0.001769047,"domain_scores_codex":[0.9995331,0.0001545939,0.00001636759,0.00005865559,0.0001844632,0.00005290567],"domain_scores_gemma":[0.9989932,0.0004133424,0.0001097213,0.0002175595,0.0001824776,0.00008380319],"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.000302207,0.0001128487,0.00161037,0.00008358941,0.00003179527,0.0002471606,0.0002786691,0.364595,0.03377146,0.4408459,0.001808551,0.1563125],"study_design_scores_gemma":[0.000009581941,0.00002798794,0.0001131904,0.000005199108,0.000001969779,0.00003848867,0.00002114217,0.9572448,0.003614109,0.03794515,0.0009691187,0.000009189289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08588912,0.00005546685,0.9119213,0.00006473207,0.000027239,0.00002206817,0.00002672507,0.0003278267,0.001665565],"genre_scores_gemma":[0.5403239,0.00007958743,0.4575222,0.00003378468,0.00002497739,0.00003956887,0.00007985102,0.0001029164,0.001793299],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002048403,"threshold_uncertainty_score":0.006852567,"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","authors":[{"name":"Adrián Celestino","is_ca":false},{"name":"Kurusch Ebrahimi‐Fard","is_ca":false},{"name":"Frédéric Patras","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001496517,0.0005003118,0.0006003784,0.002078179,0.000677241,0.001477718,0.0008198204,0.000579778,0.003581551],"category_scores_gemma":[0.005376527,0.0002009402,0.0005131422,0.001000758,0.002081951,0.002566759,0.0009320852,0.001110471,0.0003291624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001088972,"about_ca_system_score_gemma":0.0005183496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00105368,"about_ca_topic_score_gemma":0.0009038579,"domain_scores_codex":[0.9993941,0.000220774,0.00002065168,0.00006141639,0.0002294043,0.00007363167],"domain_scores_gemma":[0.9978625,0.001265038,0.0002230227,0.0001478302,0.0002883074,0.0002132819],"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.000006916554,0.000006680887,0.00008543668,0.00002137309,0.000004076881,0.00004152953,0.00006100884,0.002966185,0.000560915,0.9937596,0.000409186,0.002077109],"study_design_scores_gemma":[0.000002782433,0.00001075553,0.0003478327,0.00001136043,0.000003933867,0.0000676566,0.00002214161,0.05365182,0.0003217213,0.9444327,0.00111413,0.00001319284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3470414,0.004566482,0.5826017,0.002301031,0.0003599717,0.00005171921,0.000275874,0.0002877172,0.06251411],"genre_scores_gemma":[0.9603887,0.0011996,0.03020715,0.0002420533,0.0007015683,0.00005514405,0.0001129903,0.0001055751,0.006987215],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003581551,"threshold_uncertainty_score":0.01198149,"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","authors":[{"name":"Levent Tunçel","is_ca":true},{"name":"Stephen A. Vavasis","is_ca":true},{"name":"Jingye Xu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002256258,0.001053508,0.001213635,0.0007251,0.0007460802,0.003399238,0.001537252,0.001187659,0.01193013],"category_scores_gemma":[0.01575858,0.0006348211,0.0008756162,0.001301892,0.001392597,0.00486006,0.00254723,0.002875516,0.001590506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001599645,"about_ca_system_score_gemma":0.003461665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004565184,"about_ca_topic_score_gemma":0.008810288,"domain_scores_codex":[0.9971263,0.0009265947,0.0001430414,0.0004223531,0.001059864,0.0003220138],"domain_scores_gemma":[0.9799382,0.01704614,0.0005625089,0.001048647,0.000978875,0.0004255711],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001803245,0.000475,0.003455086,0.0006289296,0.0001698885,0.0006301712,0.000342919,0.6392474,0.01117124,0.1000731,0.02558574,0.2164173],"study_design_scores_gemma":[0.00008931882,0.00007921952,0.0004844912,0.0000161198,0.00001995621,0.0001292761,0.0001127747,0.9515569,0.001507003,0.04525705,0.0007315385,0.00001637729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1540176,0.001003799,0.8083563,0.008549064,0.0004675001,0.0003092174,0.001997036,0.001507141,0.02379231],"genre_scores_gemma":[0.7211984,0.0007546623,0.2617446,0.0008078042,0.0005734959,0.0004343947,0.00214746,0.0004857577,0.01185334],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01193013,"threshold_uncertainty_score":0.03991032,"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)","authors":[{"name":"Ben Adcock","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002147394,0.001554541,0.002098979,0.0009677255,0.0005241687,0.001737675,0.001758174,0.002138928,0.003980203],"category_scores_gemma":[0.02032342,0.001013447,0.0007870747,0.001689647,0.002193017,0.00267369,0.002360582,0.003985765,0.001067361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001198908,"about_ca_system_score_gemma":0.0011929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003301683,"about_ca_topic_score_gemma":0.002530029,"domain_scores_codex":[0.9975463,0.001157528,0.0001100659,0.000359771,0.0007177874,0.0001085628],"domain_scores_gemma":[0.9917337,0.006687894,0.0002354818,0.0006082577,0.0006160894,0.0001186146],"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.0002116932,0.00009504234,0.0003880001,0.0004442566,0.00007972644,0.00008114314,0.0001312882,0.386396,0.002922533,0.4864828,0.008752101,0.1140155],"study_design_scores_gemma":[0.00001601694,0.00001566749,0.00005834983,0.0000216775,0.000009044603,0.00002330382,0.00001131267,0.8092194,0.0004564689,0.1882179,0.001941862,0.000009015994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001174674,0.0006464382,0.9964409,0.0002483519,0.00007689565,0.00001159873,0.00004337819,0.00008917534,0.001268551],"genre_scores_gemma":[0.2371123,0.00356606,0.7472402,0.0005206947,0.0008544177,0.0003841601,0.0005578718,0.0003949878,0.00936934],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003980203,"threshold_uncertainty_score":0.01331508,"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","authors":[{"name":"Ben Adcock","is_ca":true},{"name":"Matthew J. Colbrook","is_ca":false},{"name":"Maksym Neyra-Nesterenko","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003573744,0.001212988,0.001185322,0.0009322975,0.0007871272,0.001496244,0.001992617,0.002181839,0.003051079],"category_scores_gemma":[0.0133795,0.0005404936,0.001309106,0.0005491412,0.002194662,0.001480366,0.002845074,0.003129754,0.0008923018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00131747,"about_ca_system_score_gemma":0.001203471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001905797,"about_ca_topic_score_gemma":0.001864213,"domain_scores_codex":[0.9986839,0.0005519954,0.00009775776,0.000142237,0.0004171545,0.0001070173],"domain_scores_gemma":[0.9951093,0.002822018,0.000477728,0.0008991128,0.0005152207,0.0001766909],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004470174,0.0001193744,0.0006313733,0.0002570763,0.00006889489,0.0002188421,0.000395161,0.6612674,0.01695854,0.2327527,0.003310361,0.08357329],"study_design_scores_gemma":[0.00001676156,0.00005172494,0.00004231901,0.0000305192,0.000008600335,0.00002594012,0.000008783771,0.9842789,0.002690658,0.01166774,0.00116419,0.00001390373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0049198,0.0002181548,0.9927913,0.0001228996,0.00004247741,0.00004845297,0.00001779952,0.0002761135,0.001563044],"genre_scores_gemma":[0.3250485,0.0004173092,0.6673307,0.0003261094,0.00008946542,0.000354682,0.0001095431,0.0004900995,0.005833654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003573744,"threshold_uncertainty_score":0.01889998,"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","authors":[{"name":"Jan Bouwe van den Berg","is_ca":false},{"name":"Marcio Gameiro","is_ca":false},{"name":"Jean‐Philippe Lessard","is_ca":true},{"name":"Rob Van der Vorst","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001919415,0.0009748232,0.001405477,0.003099843,0.001754569,0.004206274,0.002883479,0.001590256,0.009098217],"category_scores_gemma":[0.008997598,0.0007060163,0.001592995,0.002113725,0.004679479,0.01116774,0.006182818,0.003739555,0.001039769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001802238,"about_ca_system_score_gemma":0.001135643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001376195,"about_ca_topic_score_gemma":0.002275186,"domain_scores_codex":[0.9992524,0.0001659841,0.0000373043,0.0002102003,0.0002374459,0.00009675934],"domain_scores_gemma":[0.9957152,0.002336619,0.0002819386,0.0008410938,0.0004032192,0.0004219677],"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.00004894919,0.00003360326,0.0009356427,0.00005953744,0.0000155116,0.00003243311,0.0002797209,0.0169677,0.0007019157,0.9704955,0.001036815,0.009392811],"study_design_scores_gemma":[0.000008358515,0.00001397445,0.0001670194,0.00002399643,0.00001220748,0.0000146802,0.00009653626,0.08340627,0.0006326624,0.9139994,0.001612369,0.00001256016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1878521,0.0004378898,0.7846138,0.001131024,0.0001278576,0.00007764754,0.0003340737,0.0006765086,0.02474914],"genre_scores_gemma":[0.8295143,0.0004233147,0.1609565,0.0002394919,0.0001825421,0.0001355996,0.0008306449,0.0004289705,0.007288751],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009098217,"threshold_uncertainty_score":0.03043652,"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","authors":[{"name":"Juan Cucker Farkas","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001107296,0.0007310633,0.00126431,0.001711586,0.001824159,0.00394569,0.001669936,0.001940395,0.01198304],"category_scores_gemma":[0.008612087,0.0003899951,0.001273198,0.001133684,0.003239982,0.00835751,0.003684884,0.003924184,0.0007030952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001663023,"about_ca_system_score_gemma":0.0009751948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001355264,"about_ca_topic_score_gemma":0.0009419238,"domain_scores_codex":[0.9989176,0.0002843117,0.00005265994,0.0001977964,0.00039836,0.0001493635],"domain_scores_gemma":[0.9929442,0.005457977,0.0004193609,0.0003784373,0.0003963412,0.0004037153],"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.00003495602,0.0000338912,0.0003329611,0.00006019014,0.00001310316,0.00005766666,0.0001580369,0.005855132,0.000407501,0.9869486,0.001567931,0.004530061],"study_design_scores_gemma":[0.000005689223,0.000005250819,0.00009831713,0.000004687769,0.000002589326,0.00001736299,0.00003590217,0.01887018,0.00008948327,0.98046,0.0004045554,0.000005880767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4158398,0.002124522,0.4560208,0.01078507,0.0005911561,0.0001162527,0.0007060135,0.0003574133,0.1134591],"genre_scores_gemma":[0.9548224,0.0008701353,0.02548496,0.0004611065,0.0006973144,0.0001635237,0.0006079653,0.000132878,0.01675969],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01198304,"threshold_uncertainty_score":0.04008722,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}