{"meta":{"query_hash":"8d997db9e089","filters":{"venue":"Foundations of Computational Mathematics"},"cohort_total":32,"direct_labels_cover":0,"predictions_cover":32,"exported":32,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/8d997db9e089","api":"https://metacan.xera.ac/api/v1/cohort?venue=Foundations+of+Computational+Mathematics"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07041629827848618,"score_gpt":0.29777216346836655,"score_spread":0.22735586518988038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1202875439","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012119939,0.0063468246,0.9672752,0.0020146193,0.0004355117,0.000015675578,0.0001850802,0.00012087836,0.011486309],"genre_scores_gemma":[0.6866731,0.0158166,0.27679586,0.0014753212,0.0028903133,0.00020086548,0.0006312131,0.00012949595,0.015387259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987754,0.00063563924,0.00005418121,0.00016756769,0.00030228644,0.00006491696],"domain_scores_gemma":[0.9960646,0.0029051611,0.0002510576,0.00037823166,0.00030838588,0.00009256801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016322986,0.0012664198,0.0013769265,0.0011676691,0.00042084296,0.0017568886,0.0011172141,0.0016885165,0.0023198558],"category_scores_gemma":[0.0083018225,0.00045117212,0.0007076508,0.0018569309,0.0036016328,0.003008183,0.0017442004,0.0033278943,0.0003890666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003528003,0.00001493691,0.00011678269,0.00010628369,0.000018799317,0.00006772652,0.000076496995,0.037451528,0.0009726819,0.94458234,0.0015391444,0.015018028],"study_design_scores_gemma":[0.000009102768,0.000014829217,0.000095191026,0.000020425286,0.000006136094,0.00004998374,0.000018269724,0.13742876,0.0001961135,0.86003196,0.0021150485,0.000014114288],"about_ca_topic_score_codex":0.0018770716,"about_ca_topic_score_gemma":0.0016109446,"teacher_disagreement_score":0.0023198558,"about_ca_system_score_codex":0.0008950475,"about_ca_system_score_gemma":0.0006845901,"threshold_uncertainty_score":0.008632541},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020101261640877468,"score_gpt":0.2506759855069396,"score_spread":0.23057472386606212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978778998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010933653,0.004678291,0.95461446,0.0076868935,0.0016264473,0.00002941747,0.00016431988,0.0004784004,0.019788068],"genre_scores_gemma":[0.6370932,0.007219279,0.31507742,0.0066342507,0.012326335,0.00030197168,0.00044666842,0.0022572665,0.01864357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99065644,0.004394919,0.0004941396,0.0015648678,0.0022258468,0.00066377816],"domain_scores_gemma":[0.91733325,0.068562545,0.0015119304,0.008350104,0.002928809,0.001313293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0148126045,0.0017483549,0.0032241773,0.0018768832,0.0022426685,0.004186548,0.00417451,0.0033276316,0.0040204767],"category_scores_gemma":[0.07299543,0.0010949293,0.0032962896,0.0021640046,0.009700149,0.01013897,0.0060476195,0.013616717,0.0007320909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008493338,0.00002857327,0.00044107108,0.00010934374,0.00008191623,0.00009943477,0.00013277969,0.013660599,0.0010479254,0.9665726,0.004559479,0.013181356],"study_design_scores_gemma":[0.000016897126,0.000036441277,0.0003740617,0.000044735945,0.00004541544,0.00007167611,0.000019769348,0.14678808,0.0009760784,0.8474307,0.0041523413,0.000043701144],"about_ca_topic_score_codex":0.003129864,"about_ca_topic_score_gemma":0.0026192602,"teacher_disagreement_score":0.0148126045,"about_ca_system_score_codex":0.0028114761,"about_ca_system_score_gemma":0.0021361276,"threshold_uncertainty_score":0.07833749},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013996964117994877,"score_gpt":0.2684758140656216,"score_spread":0.2544788499476267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007215420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39083335,0.0050784745,0.46310255,0.0054001464,0.00081688166,0.00010981835,0.00045839036,0.0005263173,0.13367419],"genre_scores_gemma":[0.9678275,0.0013536619,0.022233063,0.0002518679,0.0007007482,0.00008239514,0.00016896555,0.000090410205,0.007291244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946123,0.0001838192,0.000024886904,0.000075941214,0.000182202,0.00007197008],"domain_scores_gemma":[0.99893266,0.00049720024,0.0001466743,0.00015371788,0.00014513977,0.0001245572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091237464,0.00054954673,0.00073233305,0.0016579743,0.0009362659,0.002048859,0.00082174956,0.0005717144,0.0032586374],"category_scores_gemma":[0.0030211434,0.00027883556,0.0007926475,0.00078992994,0.0033141437,0.0029208532,0.0015244342,0.0017744335,0.00031997322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029230291,0.0000068201784,0.000039664636,0.00000767318,0.0000022906302,0.00000812095,0.000035249806,0.0015554775,0.00015820994,0.99620146,0.00031731906,0.0016648677],"study_design_scores_gemma":[0.0000027871663,0.0000026567948,0.000043904587,0.0000017604609,8.4191987e-7,0.0000063686166,0.000008319252,0.008693083,0.000056316352,0.99073946,0.00044196658,0.0000025469913],"about_ca_topic_score_codex":0.00116831,"about_ca_topic_score_gemma":0.00066978374,"teacher_disagreement_score":0.0032586374,"about_ca_system_score_codex":0.0011190248,"about_ca_system_score_gemma":0.00082420564,"threshold_uncertainty_score":0.010901272},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01812313942802826,"score_gpt":0.3075835547097815,"score_spread":0.28946041528175326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007755560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065546194,0.0008313542,0.9881577,0.0012870833,0.00023154067,0.00013559581,0.00025133384,0.0005655702,0.001985111],"genre_scores_gemma":[0.20761253,0.0021382584,0.7736665,0.0016781441,0.00185914,0.0018134769,0.0015428377,0.0017750327,0.007914191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97366196,0.013717999,0.0014025845,0.0031758563,0.006586351,0.0014552725],"domain_scores_gemma":[0.5714717,0.37576574,0.0059754215,0.030392744,0.012511925,0.0038825579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.046722177,0.004561781,0.0061413916,0.0035904793,0.0018007716,0.005862706,0.009751324,0.0063392846,0.012148342],"category_scores_gemma":[0.3129743,0.00333275,0.0031356288,0.0038786524,0.007859194,0.018605834,0.01359313,0.015447097,0.0028432044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036721379,0.0006638161,0.0067387857,0.0013790886,0.00064373424,0.0007715011,0.001093133,0.26970613,0.01517201,0.5272244,0.01115592,0.1617793],"study_design_scores_gemma":[0.00025847377,0.00022003285,0.00068305084,0.00013956998,0.00013311283,0.00020181318,0.000067530775,0.7621347,0.0039996738,0.2298439,0.0022417766,0.00007635298],"about_ca_topic_score_codex":0.0017348859,"about_ca_topic_score_gemma":0.0022815014,"teacher_disagreement_score":0.046722177,"about_ca_system_score_codex":0.0030576116,"about_ca_system_score_gemma":0.0054940404,"threshold_uncertainty_score":0.24709344},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08016735234894054,"score_gpt":0.430702327804027,"score_spread":0.3505349754550865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021428356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016759476,0.0002804288,0.9916967,0.00020099568,0.00012111751,0.000038958475,0.00002903083,0.00006985899,0.005886898],"genre_scores_gemma":[0.15595464,0.0019950524,0.8241858,0.00040695557,0.0005704257,0.00039248142,0.0003037643,0.00054864236,0.015642237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902666,0.00047125795,0.000052737254,0.00012780912,0.00026699918,0.000054517895],"domain_scores_gemma":[0.9987619,0.0005152098,0.00008342181,0.00025808453,0.00029482387,0.00008654912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025417893,0.0015152416,0.0017305162,0.001300278,0.00080528826,0.0016189811,0.0017608233,0.0010484947,0.00526614],"category_scores_gemma":[0.0061017713,0.0007634083,0.001451791,0.001570141,0.0017549386,0.0020407166,0.0033992152,0.0052575893,0.0015274814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085822554,0.00015502916,0.00036731866,0.00029238733,0.00007955954,0.00012510923,0.00019302542,0.1854661,0.002530218,0.6541227,0.00842423,0.14815849],"study_design_scores_gemma":[0.000023248484,0.00003723255,0.00008346478,0.000034541175,0.000016504016,0.00006558897,0.000021394479,0.7887757,0.0007152761,0.20027766,0.009938589,0.000010796917],"about_ca_topic_score_codex":0.0016548786,"about_ca_topic_score_gemma":0.0018193638,"teacher_disagreement_score":0.00526614,"about_ca_system_score_codex":0.00066704553,"about_ca_system_score_gemma":0.0013097766,"threshold_uncertainty_score":0.017616987},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Metric (unit); Combinatorics; Discrete mathematics","score_opus":0.0791133789379064,"score_gpt":0.36519202390537714,"score_spread":0.2860786449674707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024090003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16883372,0.003384566,0.7327786,0.008721501,0.0004521629,0.00009984955,0.0010239163,0.00036413028,0.084341526],"genre_scores_gemma":[0.90295297,0.0023010809,0.07320912,0.00081482774,0.0012659366,0.00018826134,0.00094697665,0.0002796901,0.018041095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968002,0.0008467678,0.00016992821,0.0006809443,0.0011873739,0.00031482594],"domain_scores_gemma":[0.9859773,0.010196244,0.0006833234,0.0013639946,0.0011302752,0.00064885913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038044453,0.001014586,0.0022372026,0.0032388037,0.0018136678,0.0053878324,0.00319922,0.0020361063,0.009222463],"category_scores_gemma":[0.020811815,0.0007067517,0.0018642809,0.0025877443,0.0056597767,0.020398479,0.0059234696,0.005624798,0.0008179285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003439813,0.000010128909,0.00024283871,0.000051916104,0.00000949324,0.000022290455,0.00009055995,0.0023426055,0.00026989734,0.99196386,0.0011630176,0.0037988843],"study_design_scores_gemma":[0.0000066559332,0.000010358698,0.00019832903,0.000008647517,0.0000068097793,0.000029750561,0.000026426449,0.017483108,0.00029870318,0.9806192,0.0013002079,0.000011757012],"about_ca_topic_score_codex":0.00218834,"about_ca_topic_score_gemma":0.00095959,"teacher_disagreement_score":0.009222463,"about_ca_system_score_codex":0.0039938292,"about_ca_system_score_gemma":0.0011433009,"threshold_uncertainty_score":0.030852258},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.030685789338617115,"score_gpt":0.3093386203011708,"score_spread":0.2786528309625537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030265403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59227645,0.0012134117,0.35193795,0.002044834,0.0007599292,0.00010072587,0.00042252682,0.0002563092,0.050987836],"genre_scores_gemma":[0.95425093,0.00055734225,0.03089038,0.00026800678,0.00054675963,0.000066151486,0.00048019527,0.00007723839,0.01286305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994418,0.00012540996,0.00005206937,0.00012217395,0.00017674442,0.000081875536],"domain_scores_gemma":[0.9987029,0.0004157509,0.00021787744,0.00022493237,0.00023936848,0.00019917531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010165655,0.0003845015,0.000656305,0.00196348,0.0010284656,0.0022238174,0.0008853273,0.0007031109,0.0040227915],"category_scores_gemma":[0.0019585805,0.00022157689,0.0006325844,0.0009735711,0.0022646722,0.0048825503,0.0013879508,0.0014394152,0.00046643638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021338032,0.000020228199,0.00026263317,0.000015913041,0.0000034303087,0.00003333483,0.000089380126,0.00057949766,0.00087398995,0.99261427,0.0007017039,0.004784338],"study_design_scores_gemma":[0.000011160052,0.000013841043,0.00023106804,0.000004791783,0.0000033865474,0.000041152383,0.000042108037,0.010376162,0.00037346876,0.98751277,0.0013812607,0.000008727388],"about_ca_topic_score_codex":0.00043033305,"about_ca_topic_score_gemma":0.00032350956,"teacher_disagreement_score":0.0040227915,"about_ca_system_score_codex":0.00078754104,"about_ca_system_score_gemma":0.00054264563,"threshold_uncertainty_score":0.013457537},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.028255404868273416,"score_gpt":0.30404995268903384,"score_spread":0.2757945478207604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035079758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5575716,0.0011161857,0.33704117,0.001886313,0.0005110797,0.000103274855,0.00063233904,0.0013237776,0.09981433],"genre_scores_gemma":[0.93669087,0.0004876495,0.04717131,0.0002592316,0.0002500349,0.00018564472,0.0005281747,0.0003325809,0.014094547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977362,0.0003834413,0.0001632156,0.00043745583,0.0008361234,0.0004435666],"domain_scores_gemma":[0.99086666,0.0051342472,0.00076047645,0.0013336102,0.0009236354,0.0009814416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017276568,0.0012028166,0.0023186633,0.003643052,0.0035055035,0.010456552,0.0019748379,0.0021394235,0.0058315145],"category_scores_gemma":[0.013185307,0.0015345446,0.0017602753,0.0024890336,0.01144442,0.012735424,0.0062167686,0.0054688337,0.0010352575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033423996,0.000010578407,0.0000970129,0.000023953322,0.000005273381,0.00004550725,0.0002262969,0.00064524513,0.0003746133,0.99672747,0.00031943308,0.0014912084],"study_design_scores_gemma":[0.000014190388,0.0000072519238,0.000085559004,0.000011588652,0.0000068614277,0.00007779686,0.00011104124,0.0030240049,0.0005681347,0.9948986,0.0011812741,0.000013613565],"about_ca_topic_score_codex":0.0006619614,"about_ca_topic_score_gemma":0.000709211,"teacher_disagreement_score":0.010456552,"about_ca_system_score_codex":0.0021718203,"about_ca_system_score_gemma":0.0013107805,"threshold_uncertainty_score":0.019508362},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08038187535544433,"score_gpt":0.3586697441686887,"score_spread":0.27828786881324435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065513810","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40152526,0.0029564784,0.2208936,0.050528325,0.004919855,0.000070853435,0.0010799126,0.0008530364,0.3171727],"genre_scores_gemma":[0.95869863,0.0009977585,0.015685735,0.002469827,0.002416891,0.00006700572,0.00057637994,0.00013043682,0.018957432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768174,0.0005493977,0.0001308145,0.0005504933,0.00056634576,0.0005211603],"domain_scores_gemma":[0.99082786,0.0051429407,0.00061263074,0.0013453728,0.0011645702,0.00090661575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032734494,0.00093767676,0.0014491673,0.0020718242,0.0032196501,0.005139487,0.001655572,0.0027042944,0.009750385],"category_scores_gemma":[0.015400818,0.00064244977,0.0013836003,0.0027593186,0.009268885,0.012064033,0.005869725,0.0061856224,0.001249341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033422173,0.000013819003,0.0002181995,0.000020058249,0.0000031815002,0.000027621656,0.0001157594,0.00027086775,0.00010538857,0.9943756,0.0022652154,0.002550764],"study_design_scores_gemma":[0.000013090937,0.0000063070966,0.00013283659,0.000010605276,0.00000413781,0.000044302116,0.000047507026,0.0011271583,0.00010571202,0.9962704,0.002231147,0.0000067512888],"about_ca_topic_score_codex":0.0014270724,"about_ca_topic_score_gemma":0.0007953327,"teacher_disagreement_score":0.009750385,"about_ca_system_score_codex":0.0018294016,"about_ca_system_score_gemma":0.0011643065,"threshold_uncertainty_score":0.032618344},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Curvature; Path (computing); Linear programming; Linear-fractional programming; Linear system; Numerical analysis","score_opus":0.0413287192296841,"score_gpt":0.35281150476278966,"score_spread":0.31148278553310554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098609180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3447755,0.004944579,0.48615605,0.019054798,0.00086169754,0.00013098476,0.0007826647,0.00064333837,0.14265026],"genre_scores_gemma":[0.91683537,0.002500457,0.05197705,0.0010862268,0.00073390367,0.00013425984,0.00034911942,0.00037314254,0.026010407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847215,0.00068732793,0.000055099747,0.00022698725,0.00039176625,0.00016672087],"domain_scores_gemma":[0.9883868,0.0073670307,0.00095146586,0.00062195316,0.0013926241,0.0012801894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026460472,0.0009583827,0.0011974125,0.0028884548,0.0018706457,0.0031962332,0.0013033113,0.0018847155,0.009143954],"category_scores_gemma":[0.019205617,0.00069207227,0.0009278785,0.0017848441,0.006199312,0.008597028,0.0045559276,0.0063195843,0.0011445131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034547837,0.000010259547,0.00019848852,0.000024324598,0.000005379421,0.000030388355,0.00015270326,0.0021803535,0.00025034818,0.9932708,0.0009391975,0.0029031567],"study_design_scores_gemma":[0.0000084995445,0.00001715034,0.0002367276,0.000013209071,0.000004687631,0.00003286996,0.000042202486,0.010292382,0.00011563453,0.9874556,0.0017699332,0.000011085199],"about_ca_topic_score_codex":0.0020578122,"about_ca_topic_score_gemma":0.0011808472,"teacher_disagreement_score":0.009143954,"about_ca_system_score_codex":0.0027194887,"about_ca_system_score_gemma":0.001538177,"threshold_uncertainty_score":0.03058958},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011912643596671489,"score_gpt":0.21050952260356548,"score_spread":0.198596879006894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107479212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01003304,0.0016191757,0.9673978,0.0012599574,0.00023131582,0.000036305788,0.000270049,0.000093029455,0.019059308],"genre_scores_gemma":[0.48278657,0.007904038,0.45746914,0.0011249658,0.0019242814,0.00043943056,0.0015573031,0.00043434955,0.046360016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856526,0.0006471717,0.000056109162,0.00020941792,0.00044721394,0.00007486892],"domain_scores_gemma":[0.996983,0.0018964309,0.00031364892,0.00020571322,0.0004308808,0.00017036701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019915258,0.0016471392,0.0015029566,0.0013867075,0.00065190974,0.0030174658,0.0018866217,0.0014135917,0.0045853546],"category_scores_gemma":[0.008842263,0.00087001256,0.00085513643,0.0021039485,0.0035253947,0.0042580427,0.0026565178,0.0046481467,0.0006759334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026345191,0.000026840475,0.000107453176,0.000077566605,0.000015378082,0.000044946893,0.00004776302,0.050740883,0.0004217018,0.9345289,0.0030352022,0.010927123],"study_design_scores_gemma":[0.000011768118,0.000015674828,0.00006452381,0.000017178121,0.0000046486834,0.000034890338,0.000027279206,0.24450675,0.00016853331,0.7524709,0.0026637174,0.000014051966],"about_ca_topic_score_codex":0.0033231322,"about_ca_topic_score_gemma":0.0027895176,"teacher_disagreement_score":0.0045853546,"about_ca_system_score_codex":0.0009887961,"about_ca_system_score_gemma":0.0013472242,"threshold_uncertainty_score":0.015339553},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018690733444441898,"score_gpt":0.27394048689772804,"score_spread":0.25524975345328615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118254039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031366833,0.00025688842,0.9497798,0.0004175256,0.00015954551,0.00018865544,0.00035123032,0.0040271734,0.013452421],"genre_scores_gemma":[0.19059525,0.00021240157,0.7946874,0.00023219326,0.000050577404,0.00023724751,0.001331462,0.0008093752,0.011844132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992275,0.00013150262,0.000053086074,0.00023671442,0.00024513953,0.00010596443],"domain_scores_gemma":[0.9986066,0.0004039908,0.000052445703,0.00055616215,0.00028017987,0.00010047114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007164273,0.00081981526,0.0011228438,0.0012925153,0.001089758,0.0018361834,0.0025417844,0.001750561,0.016196731],"category_scores_gemma":[0.0043652784,0.0006248587,0.0010967938,0.0015897033,0.00086808065,0.0035213984,0.0047785277,0.0022531128,0.005166148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005701787,0.0003204623,0.001293141,0.00043142127,0.000117941876,0.00021291134,0.00039377145,0.04746759,0.010104491,0.26013696,0.031987913,0.64696324],"study_design_scores_gemma":[0.00021016317,0.0003039458,0.00066918635,0.00009215289,0.00008984861,0.00041281272,0.00025988155,0.50425607,0.013932294,0.4476135,0.032079313,0.00008084419],"about_ca_topic_score_codex":0.0016670623,"about_ca_topic_score_gemma":0.002453958,"teacher_disagreement_score":0.016196731,"about_ca_system_score_codex":0.0006346781,"about_ca_system_score_gemma":0.0015898062,"threshold_uncertainty_score":0.054183424},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03189418823480892,"score_gpt":0.2781377065146248,"score_spread":0.24624351827981592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127771846","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011099752,0.00006049509,0.99778193,0.00008516844,0.000051811843,0.00002131901,0.000022832994,0.00012492498,0.0007415776],"genre_scores_gemma":[0.04502371,0.00017500218,0.9488373,0.00017904275,0.00012009694,0.00016657422,0.00022934338,0.00014203716,0.005126751],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882835,0.00026310422,0.000054775126,0.00016195334,0.00062383374,0.000068021334],"domain_scores_gemma":[0.9979182,0.0009593256,0.00009293532,0.00028236414,0.00063306576,0.00011414561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001735963,0.0010203725,0.0011680523,0.00066794123,0.0005198714,0.0011651664,0.0018769366,0.0018495243,0.0052048946],"category_scores_gemma":[0.0078086443,0.00054515735,0.0006397113,0.0009280589,0.0010820698,0.0015895095,0.0025220588,0.0032478648,0.0029556719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045370858,0.000277019,0.00039453068,0.00035947788,0.00008738062,0.00019471321,0.00024592073,0.38979334,0.026040575,0.12559628,0.014570943,0.44198605],"study_design_scores_gemma":[0.000030772444,0.0000654906,0.000041048104,0.000011735304,0.000005690972,0.000054846303,0.000012448045,0.981832,0.0018287534,0.013732462,0.0023725021,0.000012250569],"about_ca_topic_score_codex":0.0017445997,"about_ca_topic_score_gemma":0.0026247855,"teacher_disagreement_score":0.0052048946,"about_ca_system_score_codex":0.00055808167,"about_ca_system_score_gemma":0.0016721141,"threshold_uncertainty_score":0.017412066},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.031083607720059372,"score_gpt":0.2848674620295977,"score_spread":0.2537838543095383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130417105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23534065,0.002755791,0.64397156,0.006388979,0.00074720767,0.00009084528,0.00028234805,0.00056865276,0.10985394],"genre_scores_gemma":[0.960607,0.0007767814,0.020553527,0.00036330693,0.0007494371,0.00014139611,0.0001121139,0.00019505128,0.016501341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982077,0.0006159842,0.00007327165,0.0004248131,0.00043690816,0.00024128499],"domain_scores_gemma":[0.99077237,0.0056742425,0.000832379,0.00089049165,0.0011075201,0.000722909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020321887,0.00097073504,0.0016899671,0.0018710358,0.0017736371,0.0038220445,0.0014642975,0.0016315294,0.010887041],"category_scores_gemma":[0.018090596,0.0007376373,0.0007629443,0.0013302857,0.003992462,0.0062950356,0.0038604122,0.0029034382,0.0014402638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007875857,0.000026521851,0.00021912312,0.000036629175,0.000013004616,0.00001901239,0.00008121408,0.010847221,0.0009321414,0.97851884,0.0016994071,0.0075281966],"study_design_scores_gemma":[0.000009753236,0.000010891692,0.00010824245,0.000006387745,0.000004074588,0.000019058993,0.000025292975,0.02646263,0.0004084283,0.9723913,0.0005445869,0.000009383362],"about_ca_topic_score_codex":0.00037362712,"about_ca_topic_score_gemma":0.00032751902,"teacher_disagreement_score":0.010887041,"about_ca_system_score_codex":0.0014634772,"about_ca_system_score_gemma":0.00095346273,"threshold_uncertainty_score":0.036420763},"labels":[],"label_agreement":null},{"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02125774372070195,"score_gpt":0.3107374088664436,"score_spread":0.28947966514574164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169501582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006212193,0.0001157215,0.9877856,0.00050516834,0.00014592912,0.00003550954,0.000099773395,0.000406248,0.00469401],"genre_scores_gemma":[0.11230112,0.00032209023,0.87324774,0.00039171337,0.00040224474,0.00016858746,0.0005095141,0.0006488945,0.012008032],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933606,0.00016401059,0.000040902043,0.0001303596,0.00026816374,0.00006055882],"domain_scores_gemma":[0.9973182,0.001958411,0.0001503612,0.00025670283,0.00025415656,0.00006205802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008517039,0.00090102,0.0010198117,0.0004995286,0.0005172088,0.0011483255,0.0011144174,0.0012431578,0.0155861415],"category_scores_gemma":[0.008214851,0.00067999685,0.00064033986,0.00093093765,0.0010825199,0.0032090964,0.001903783,0.003131385,0.0018429416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002527655,0.00024127678,0.0017215284,0.00085823465,0.00011652015,0.00060829485,0.00042673646,0.24285664,0.0076467404,0.30624667,0.047664523,0.39136007],"study_design_scores_gemma":[0.00006711276,0.000043261636,0.00013265814,0.000029169456,0.00001869195,0.0001478347,0.000076514014,0.79518914,0.002570315,0.19310273,0.008603903,0.000018609438],"about_ca_topic_score_codex":0.0015944337,"about_ca_topic_score_gemma":0.0027653214,"teacher_disagreement_score":0.0155861415,"about_ca_system_score_codex":0.00022368002,"about_ca_system_score_gemma":0.0007233281,"threshold_uncertainty_score":0.052140832},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.023790216799411543,"score_gpt":0.27623150737083024,"score_spread":0.2524412905714187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209293733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024817789,0.00007025342,0.9730535,0.000045525394,0.000013627928,0.000028978851,0.000018578967,0.00015985558,0.0017918998],"genre_scores_gemma":[0.540928,0.00016125286,0.45391023,0.00006252449,0.000019385445,0.00011515927,0.00012275136,0.00031826604,0.0043623955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996166,0.00010033258,0.00001801027,0.000045728033,0.00018521145,0.000034099678],"domain_scores_gemma":[0.99950564,0.00021960294,0.00005416945,0.000104330946,0.00008546916,0.000030743173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007251301,0.0005117194,0.00085460936,0.0008323388,0.00035095715,0.0009926661,0.0013686117,0.0011053139,0.001637475],"category_scores_gemma":[0.0025551186,0.00045218717,0.0006993765,0.0006015796,0.0007494643,0.0011059168,0.0016069738,0.0008023255,0.0005434733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006716736,0.000051987878,0.00046985116,0.00008435472,0.000030292204,0.000105469946,0.00013097987,0.8480329,0.027144948,0.056743745,0.00054797117,0.06659035],"study_design_scores_gemma":[0.0000016840628,0.000008212035,0.000031662858,0.000002354572,0.0000015662708,0.0000129289965,0.000005554533,0.9938267,0.0013959288,0.0044193156,0.0002905928,0.0000034492991],"about_ca_topic_score_codex":0.0010759025,"about_ca_topic_score_gemma":0.0009873332,"teacher_disagreement_score":0.001637475,"about_ca_system_score_codex":0.00051304046,"about_ca_system_score_gemma":0.0005920006,"threshold_uncertainty_score":0.005477965},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.14504855921771406,"score_gpt":0.370322374475493,"score_spread":0.22527381525777893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2328172603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08192108,0.0014860358,0.89248896,0.0028620893,0.00019896889,0.00009873892,0.00036304365,0.0003785741,0.020202508],"genre_scores_gemma":[0.7947925,0.00124947,0.19291703,0.00083014375,0.0009262743,0.00046916946,0.0008054417,0.00045940813,0.0075505697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98954517,0.0041456656,0.0005255341,0.00159898,0.0033895634,0.0007951073],"domain_scores_gemma":[0.94128686,0.044320144,0.0037867043,0.006162627,0.0029948268,0.0014489164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013394166,0.0013292719,0.0034882394,0.004450488,0.002444454,0.00690545,0.0048754984,0.0028929573,0.005137805],"category_scores_gemma":[0.057700325,0.0013498032,0.0033188076,0.0053445515,0.006879847,0.019836878,0.0059683006,0.009982939,0.00051138975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008318902,0.0000386963,0.00026242837,0.00006676971,0.000024155188,0.000024521401,0.00015807562,0.009096394,0.00025416663,0.9782471,0.0013471385,0.010397359],"study_design_scores_gemma":[0.000017657418,0.000027285821,0.00022645229,0.00001891404,0.000016261658,0.00003413712,0.000033526627,0.06305967,0.00045793268,0.93526405,0.00082383875,0.000020157464],"about_ca_topic_score_codex":0.0008290827,"about_ca_topic_score_gemma":0.0005919972,"teacher_disagreement_score":0.013394166,"about_ca_system_score_codex":0.0039147753,"about_ca_system_score_gemma":0.002387658,"threshold_uncertainty_score":0.07083595},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04174861051428388,"score_gpt":0.327029181318095,"score_spread":0.28528057080381114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2596142527","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03130289,0.0007304759,0.95820343,0.00066757435,0.00011351285,0.000050329727,0.00008779192,0.00013270022,0.008711188],"genre_scores_gemma":[0.6487577,0.0014910825,0.32288685,0.0005134393,0.00029590933,0.00026366126,0.0004138597,0.00075656,0.024620967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842584,0.00073289766,0.000073832605,0.00019313775,0.0004340733,0.00014031828],"domain_scores_gemma":[0.9827188,0.012547449,0.0006819065,0.0011529382,0.0022456148,0.0006531629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00575592,0.0014021845,0.001112795,0.0016791646,0.00071171444,0.0021800937,0.0018707598,0.0014613215,0.0053498186],"category_scores_gemma":[0.02590855,0.0007249546,0.0010350888,0.00078594,0.0040176404,0.0040194574,0.005332395,0.0042291046,0.0006938329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004895024,0.00013583893,0.0022339108,0.00062120904,0.00007195427,0.00021570304,0.0005961838,0.36149433,0.00749877,0.57894254,0.0029337977,0.04476627],"study_design_scores_gemma":[0.00000974799,0.000024974734,0.00018331676,0.000039426122,0.000008339568,0.00006605096,0.000048084905,0.92414606,0.0014824118,0.07307242,0.00090792135,0.000011207975],"about_ca_topic_score_codex":0.002446435,"about_ca_topic_score_gemma":0.002284524,"teacher_disagreement_score":0.00575592,"about_ca_system_score_codex":0.0014494495,"about_ca_system_score_gemma":0.0013232556,"threshold_uncertainty_score":0.030440569},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.020965238897328025,"score_gpt":0.27060778671346625,"score_spread":0.24964254781613823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765260291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76262504,0.0006108093,0.16546033,0.00074426,0.00012516108,0.00002893808,0.00011645743,0.00010354728,0.07018528],"genre_scores_gemma":[0.98902065,0.00012612386,0.007852732,0.00007353576,0.000045114833,0.000014364241,0.000048233658,0.000016847398,0.0028024197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995552,0.00008531817,0.000021601929,0.000120890116,0.00013007085,0.000086951324],"domain_scores_gemma":[0.9990532,0.0002284248,0.00020193573,0.00016891811,0.00015614134,0.00019136346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051234657,0.00024345162,0.0003080742,0.001367878,0.0008043334,0.0022822905,0.00041495546,0.00047312788,0.0032432354],"category_scores_gemma":[0.0019139105,0.00014887779,0.00031661193,0.0006846814,0.0027371827,0.0033009315,0.0014223922,0.00091804314,0.00022542171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004748301,0.000007941585,0.00040187105,0.0000066586185,0.000002572206,0.0000412454,0.00014681464,0.00091358024,0.00062245823,0.9958669,0.00014985673,0.0018353695],"study_design_scores_gemma":[0.0000034075094,0.000008368866,0.00070210156,0.000010229019,0.0000031132308,0.000094547264,0.00016862623,0.014412017,0.00069228554,0.9815118,0.0023826838,0.00001079727],"about_ca_topic_score_codex":0.0012432194,"about_ca_topic_score_gemma":0.0011359709,"teacher_disagreement_score":0.0032432354,"about_ca_system_score_codex":0.0010345855,"about_ca_system_score_gemma":0.00035295676,"threshold_uncertainty_score":0.010849714},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1354589906913145,"score_gpt":0.35569037307619966,"score_spread":0.22023138238488515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773477893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41583982,0.002124522,0.45602077,0.010785073,0.00059115613,0.00011625267,0.00070601347,0.00035741334,0.113459066],"genre_scores_gemma":[0.95482236,0.00087013526,0.025484957,0.00046110645,0.00069731445,0.00016352374,0.0006079653,0.00013287796,0.01675969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989176,0.00028431174,0.000052659936,0.0001977964,0.00039836005,0.00014936352],"domain_scores_gemma":[0.9929442,0.0054579773,0.00041936093,0.00037843728,0.0003963412,0.0004037153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011072963,0.0007310633,0.0012643099,0.001711586,0.0018241588,0.0039456896,0.0016699361,0.0019403951,0.011983039],"category_scores_gemma":[0.008612087,0.00038999514,0.001273198,0.001133684,0.0032399816,0.00835751,0.0036848844,0.003924184,0.00070309517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003495602,0.0000338912,0.0003329611,0.000060190145,0.000013103159,0.000057666657,0.00015803687,0.005855132,0.000407501,0.9869486,0.0015679311,0.0045300606],"study_design_scores_gemma":[0.000005689223,0.0000052508185,0.000098317134,0.0000046877694,0.000002589326,0.000017362994,0.000035902172,0.018870182,0.00008948327,0.98046,0.0004045554,0.0000058807673],"about_ca_topic_score_codex":0.0013552642,"about_ca_topic_score_gemma":0.0009419238,"teacher_disagreement_score":0.011983039,"about_ca_system_score_codex":0.001663023,"about_ca_system_score_gemma":0.0009751948,"threshold_uncertainty_score":0.040087223},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03937534221953173,"score_gpt":0.3033043018610115,"score_spread":0.2639289596414798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W289966560","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40150985,0.0010281412,0.5711507,0.0017724056,0.00017731487,0.00006413601,0.00021373166,0.0005538433,0.02352982],"genre_scores_gemma":[0.92040753,0.00040605746,0.07325081,0.00012983575,0.00013263576,0.00007667501,0.00018449756,0.00019410225,0.0052178777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956506,0.00018165285,0.000028514505,0.000052859155,0.00012358396,0.00004832778],"domain_scores_gemma":[0.99822575,0.0010170831,0.00015886803,0.0002028822,0.00017337041,0.00022208487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017170829,0.0011123699,0.0013307268,0.0023879872,0.0012701893,0.0028871982,0.0018657481,0.0015046871,0.003363093],"category_scores_gemma":[0.0072169113,0.00071631605,0.0009175993,0.000981263,0.0038416716,0.0059930705,0.003143831,0.0023437466,0.00039256702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038927912,0.000024606332,0.00028386898,0.000059185408,0.0000150160795,0.000048843172,0.00012453856,0.021718588,0.00052726385,0.9730891,0.00046677588,0.003603265],"study_design_scores_gemma":[0.000011161151,0.000010899807,0.00013156814,0.00001640863,0.000004666231,0.000014062417,0.00003381093,0.14843465,0.00018436118,0.85073596,0.000411016,0.000011499718],"about_ca_topic_score_codex":0.0011846286,"about_ca_topic_score_gemma":0.0016713263,"teacher_disagreement_score":0.003363093,"about_ca_system_score_codex":0.0016875337,"about_ca_system_score_gemma":0.00096409227,"threshold_uncertainty_score":0.0122439265},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06804037972609624,"score_gpt":0.33940491016307245,"score_spread":0.2713645304369762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019932518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34704137,0.004566482,0.5826017,0.0023010315,0.0003599717,0.000051719213,0.00027587396,0.00028771724,0.06251411],"genre_scores_gemma":[0.96038866,0.0011995998,0.03020715,0.00024205327,0.00070156826,0.00005514405,0.000112990274,0.000105575054,0.006987215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939406,0.00022077402,0.000020651683,0.000061416395,0.00022940431,0.000073631665],"domain_scores_gemma":[0.9978625,0.0012650376,0.00022302265,0.00014783019,0.00028830738,0.00021328186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014965173,0.0005003118,0.0006003784,0.002078179,0.000677241,0.0014777185,0.0008198204,0.00057977805,0.0035815514],"category_scores_gemma":[0.0053765266,0.00020094017,0.0005131422,0.0010007585,0.0020819511,0.0025667595,0.0009320852,0.0011104706,0.0003291624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006916554,0.0000066808866,0.00008543668,0.000021373087,0.000004076881,0.000041529533,0.000061008835,0.002966185,0.00056091504,0.9937596,0.00040918603,0.0020771087],"study_design_scores_gemma":[0.0000027824328,0.000010755533,0.00034783265,0.000011360432,0.0000039338665,0.0000676566,0.000022141607,0.05365182,0.0003217213,0.9444327,0.0011141297,0.000013192842],"about_ca_topic_score_codex":0.0010536802,"about_ca_topic_score_gemma":0.00090385793,"teacher_disagreement_score":0.0035815514,"about_ca_system_score_codex":0.0010889724,"about_ca_system_score_gemma":0.00051834964,"threshold_uncertainty_score":0.011981487},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.032035140737037074,"score_gpt":0.2679588309108773,"score_spread":0.23592369017384024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033781806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17237258,0.0020143788,0.80586624,0.0041265143,0.00019833296,0.00015894123,0.0006277579,0.001148766,0.013486506],"genre_scores_gemma":[0.9683782,0.0015378355,0.022744702,0.0006886,0.00065796974,0.00033791302,0.00044524492,0.0005081713,0.004701286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936433,0.0018675646,0.00039350108,0.0018361139,0.0010561103,0.0012034307],"domain_scores_gemma":[0.8846212,0.08765104,0.009662263,0.008194526,0.0046557207,0.0052153114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012357231,0.0025691385,0.00612124,0.0037787238,0.0026711875,0.005905473,0.005601698,0.0035683247,0.00793564],"category_scores_gemma":[0.079541735,0.0023628497,0.004787073,0.0027048911,0.009923915,0.01828285,0.006283417,0.009973447,0.00051989395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015678987,0.00017183433,0.0033493307,0.00031920502,0.00028190113,0.00063176954,0.00055463566,0.07180015,0.0016217311,0.91297454,0.0023158311,0.005822274],"study_design_scores_gemma":[0.000030092338,0.000049059527,0.0006708134,0.000042511452,0.00008950595,0.00020035185,0.00008192562,0.38715428,0.0005784601,0.6106921,0.0003556417,0.000055241337],"about_ca_topic_score_codex":0.0031036348,"about_ca_topic_score_gemma":0.0026462234,"teacher_disagreement_score":0.012357231,"about_ca_system_score_codex":0.003465791,"about_ca_system_score_gemma":0.0033811263,"threshold_uncertainty_score":0.06535208},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04256090498939697,"score_gpt":0.3015033345632102,"score_spread":0.25894242957381325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047952687","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008299752,0.00032925495,0.98996526,0.00031563503,0.00003534127,0.000023071208,0.000044641223,0.00025388753,0.00073330326],"genre_scores_gemma":[0.49880102,0.00085028604,0.4921257,0.0005165195,0.0003850072,0.00019253124,0.0005945386,0.0002877516,0.006246648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957093,0.0023596773,0.0001613942,0.00078105816,0.0006789178,0.00030953795],"domain_scores_gemma":[0.9929121,0.0054965247,0.00044171626,0.0004273374,0.0005704886,0.0001517343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056532007,0.0017357549,0.0022954773,0.0011849417,0.0004691679,0.0017917337,0.0017796381,0.002103494,0.0022753323],"category_scores_gemma":[0.018084545,0.0013098189,0.0016503951,0.0012712738,0.001725285,0.0028781209,0.002143695,0.0018345201,0.00088776933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047202676,0.00012350212,0.001047444,0.00032563653,0.00030283065,0.000120062265,0.00011797114,0.8144875,0.0047008903,0.028433442,0.002636445,0.14723226],"study_design_scores_gemma":[0.000015246797,0.000032449138,0.00012231704,0.00001368488,0.00002283119,0.000019241106,0.000010907292,0.99193394,0.00073370873,0.006689809,0.00039306303,0.00001268708],"about_ca_topic_score_codex":0.004641987,"about_ca_topic_score_gemma":0.0045033814,"teacher_disagreement_score":0.0056532007,"about_ca_system_score_codex":0.0009311781,"about_ca_system_score_gemma":0.0016428087,"threshold_uncertainty_score":0.029897332},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.09728548284479145,"score_gpt":0.3765147759111037,"score_spread":0.2792292930663123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310446950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041330844,0.00058266456,0.9522858,0.0009522152,0.00005626362,0.00003770436,0.00015667958,0.00018136295,0.0044164206],"genre_scores_gemma":[0.8230791,0.0016220529,0.16266844,0.0004741597,0.00025925337,0.0002301809,0.00074619165,0.00019697787,0.010723718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884194,0.00059210433,0.00006279929,0.00019324037,0.00019172064,0.000118340606],"domain_scores_gemma":[0.98114336,0.015690261,0.0008306775,0.001017255,0.0008164334,0.0005021156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030804265,0.00069796055,0.0015096522,0.0012400298,0.00083038287,0.0025713975,0.0022145987,0.0025022787,0.005535551],"category_scores_gemma":[0.028024388,0.00073327165,0.0010257957,0.0016485647,0.0032480145,0.0065897442,0.0030476032,0.0032478957,0.00050707074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077397584,0.00004707658,0.00055803533,0.00009177991,0.0000193318,0.000040828665,0.00019776271,0.19386055,0.00036107193,0.78315544,0.0011918943,0.020398892],"study_design_scores_gemma":[0.000006404649,0.000012037566,0.000050924416,0.00001259169,0.0000030797494,0.000008849473,0.000014338011,0.5782195,0.00007749807,0.42131177,0.0002768903,0.000006087579],"about_ca_topic_score_codex":0.0064596147,"about_ca_topic_score_gemma":0.004213605,"teacher_disagreement_score":0.0064596147,"about_ca_system_score_codex":0.001850595,"about_ca_system_score_gemma":0.0015584129,"threshold_uncertainty_score":0.01851821},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09171501157887414,"score_gpt":0.370556728720871,"score_spread":0.27884171714199685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317797605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28696334,0.0010634047,0.67598677,0.0022289804,0.00016356217,0.00007614999,0.00048488314,0.0003677013,0.032665182],"genre_scores_gemma":[0.8770966,0.001344506,0.0964581,0.00036245727,0.0002211287,0.00015857631,0.0006474089,0.00038353205,0.023327777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918336,0.00015951469,0.00003952428,0.00021679331,0.00020175299,0.00019898759],"domain_scores_gemma":[0.9937836,0.0038743867,0.0007985715,0.0005083648,0.0004679289,0.0005670946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011948227,0.0012307111,0.0023053577,0.0018532817,0.001337245,0.0035170557,0.0021024644,0.0025214998,0.009524546],"category_scores_gemma":[0.011733824,0.0010984617,0.0010785476,0.0017979292,0.002818848,0.008174437,0.0042735958,0.00462916,0.00083368266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015243678,0.00006446355,0.0005149243,0.0001259659,0.000022837437,0.00005897168,0.00014132331,0.040440936,0.0020697177,0.9375172,0.0017934238,0.017097725],"study_design_scores_gemma":[0.000032701988,0.000061337814,0.0004793761,0.00003783352,0.000019395513,0.00008458002,0.00014925707,0.15495007,0.0013533526,0.83962333,0.0031896445,0.000019080178],"about_ca_topic_score_codex":0.0011468164,"about_ca_topic_score_gemma":0.0017666992,"teacher_disagreement_score":0.009524546,"about_ca_system_score_codex":0.0016422286,"about_ca_system_score_gemma":0.0006974988,"threshold_uncertainty_score":0.031862795},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08952213081817073,"score_gpt":0.3830744277024426,"score_spread":0.29355229688427187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387708094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18785205,0.00043788977,0.7846138,0.0011310235,0.00012785761,0.000077647535,0.00033407367,0.0006765086,0.024749137],"genre_scores_gemma":[0.82951427,0.00042331472,0.16095646,0.00023949188,0.0001825421,0.00013559958,0.0008306449,0.00042897052,0.0072887507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992524,0.00016598414,0.0000373043,0.00021020035,0.00023744587,0.000096759344],"domain_scores_gemma":[0.9957152,0.002336619,0.00028193864,0.0008410938,0.0004032192,0.00042196768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019194146,0.0009748232,0.0014054774,0.0030998427,0.0017545694,0.004206274,0.0028834792,0.0015902558,0.009098217],"category_scores_gemma":[0.008997598,0.00070601626,0.001592995,0.002113725,0.0046794787,0.011167738,0.0061828177,0.0037395554,0.001039769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048949187,0.00003360326,0.0009356427,0.000059537444,0.0000155116,0.000032433112,0.00027972087,0.016967697,0.0007019157,0.9704955,0.0010368148,0.009392811],"study_design_scores_gemma":[0.000008358515,0.000013974454,0.00016701937,0.000023996434,0.000012207477,0.0000146802,0.00009653626,0.08340627,0.00063266244,0.91399944,0.0016123686,0.000012560163],"about_ca_topic_score_codex":0.001376195,"about_ca_topic_score_gemma":0.0022751864,"teacher_disagreement_score":0.009098217,"about_ca_system_score_codex":0.001802238,"about_ca_system_score_gemma":0.0011356425,"threshold_uncertainty_score":0.030436516},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03505159384007851,"score_gpt":0.3077297506518258,"score_spread":0.2726781568117473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389477517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1540176,0.0010037993,0.8083563,0.008549064,0.00046750013,0.00030921743,0.0019970357,0.0015071413,0.023792313],"genre_scores_gemma":[0.7211984,0.00075466227,0.26174465,0.00080780423,0.0005734959,0.00043439472,0.00214746,0.00048575772,0.011853339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971263,0.0009265947,0.00014304137,0.00042235313,0.0010598638,0.00032201377],"domain_scores_gemma":[0.9799382,0.017046139,0.0005625089,0.001048647,0.000978875,0.00042557108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022562582,0.001053508,0.0012136353,0.00072510005,0.0007460802,0.0033992378,0.0015372525,0.0011876593,0.011930132],"category_scores_gemma":[0.01575858,0.00063482113,0.0008756162,0.001301892,0.0013925974,0.00486006,0.0025472303,0.0028755164,0.0015905056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018032449,0.00047499998,0.003455086,0.0006289296,0.00016988849,0.00063017115,0.00034291903,0.6392474,0.01117124,0.1000731,0.025585743,0.21641727],"study_design_scores_gemma":[0.00008931882,0.00007921952,0.00048449117,0.000016119799,0.000019956215,0.00012927614,0.00011277472,0.9515569,0.0015070029,0.045257054,0.0007315385,0.000016377287],"about_ca_topic_score_codex":0.004565184,"about_ca_topic_score_gemma":0.008810288,"teacher_disagreement_score":0.011930132,"about_ca_system_score_codex":0.0015996454,"about_ca_system_score_gemma":0.0034616648,"threshold_uncertainty_score":0.039910316},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Monte Carlo method; Statistical physics; Langevin dynamics; Sobolev space; Mathematical analysis; Physics; Statistics","score_opus":0.07182423705751878,"score_gpt":0.3920132083558933,"score_spread":0.32018897129837454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401057266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06447115,0.0020854142,0.90793335,0.00302428,0.00033509027,0.000068326604,0.00016044361,0.0002756518,0.021646302],"genre_scores_gemma":[0.88203335,0.002616777,0.08750465,0.0012082604,0.0012396296,0.00034616317,0.00040656878,0.00066440797,0.023980197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838173,0.00088440994,0.000057083555,0.00013833502,0.0003695215,0.00016890104],"domain_scores_gemma":[0.9808445,0.014857402,0.0010125797,0.00071614346,0.0014508034,0.001118598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057689073,0.0011307418,0.0017990215,0.0029252893,0.0014752152,0.0025534604,0.0026882195,0.0021287673,0.00706093],"category_scores_gemma":[0.026632741,0.0010711934,0.0015147474,0.0012974741,0.0053476775,0.00476492,0.0037262307,0.0036958333,0.0004155221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013636834,0.00001712574,0.00020446115,0.000029714485,0.000015953707,0.000018581979,0.00004216768,0.038299326,0.0001623903,0.9595048,0.00045245208,0.0012393872],"study_design_scores_gemma":[0.0000063949537,0.000008185249,0.000118342716,0.000017077395,0.0000060323855,0.000011467856,0.000012849968,0.4028381,0.00009493013,0.5963657,0.0005076785,0.000013276571],"about_ca_topic_score_codex":0.0048301276,"about_ca_topic_score_gemma":0.0036155735,"teacher_disagreement_score":0.00706093,"about_ca_system_score_codex":0.0036954489,"about_ca_system_score_gemma":0.0027907398,"threshold_uncertainty_score":0.030509293},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02219312052247101,"score_gpt":0.2865821892287377,"score_spread":0.26438906870626666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401337191","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08588912,0.000055466848,0.91192126,0.00006473207,0.000027238997,0.000022068174,0.000026725065,0.00032782668,0.0016655654],"genre_scores_gemma":[0.54032385,0.00007958743,0.45752218,0.000033784683,0.000024977395,0.000039568873,0.000079851015,0.00010291642,0.0017932989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953306,0.00015459394,0.000016367592,0.00005865559,0.00018446322,0.00005290567],"domain_scores_gemma":[0.9989932,0.00041334238,0.000109721266,0.00021755953,0.00018247758,0.00008380319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007424088,0.00043780432,0.00040774336,0.0006001567,0.00038109533,0.0007508358,0.00071549596,0.00042343183,0.0020484028],"category_scores_gemma":[0.0040312177,0.0002280248,0.00035030715,0.000556599,0.001023883,0.0016195232,0.0010216073,0.00088012347,0.000551086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030220696,0.00011284868,0.0016103701,0.00008358941,0.000031795265,0.00024716064,0.00027866912,0.36459497,0.033771455,0.4408459,0.0018085515,0.15631254],"study_design_scores_gemma":[0.0000095819405,0.00002798794,0.00011319043,0.0000051991083,0.0000019697789,0.00003848867,0.000021142168,0.9572448,0.0036141095,0.03794515,0.0009691187,0.000009189289],"about_ca_topic_score_codex":0.0013135112,"about_ca_topic_score_gemma":0.0017690471,"teacher_disagreement_score":0.0020484028,"about_ca_system_score_codex":0.00055081845,"about_ca_system_score_gemma":0.00051966164,"threshold_uncertainty_score":0.006852567},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03329306612632124,"score_gpt":0.3558228624035679,"score_spread":0.32252979627724665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407689519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049198004,0.00021815476,0.9927913,0.00012289955,0.000042477408,0.000048452974,0.000017799524,0.00027611348,0.0015630441],"genre_scores_gemma":[0.32504848,0.0004173092,0.6673307,0.00032610944,0.00008946542,0.000354682,0.000109543114,0.0004900995,0.0058336537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868387,0.00055199536,0.00009775776,0.00014223698,0.00041715446,0.0001070173],"domain_scores_gemma":[0.99510926,0.002822018,0.00047772797,0.00089911284,0.0005152207,0.00017669093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035737439,0.001212988,0.0011853222,0.0009322975,0.00078712724,0.0014962443,0.0019926168,0.002181839,0.0030510793],"category_scores_gemma":[0.013379499,0.0005404936,0.0013091062,0.0005491412,0.0021946619,0.0014803656,0.0028450736,0.0031297542,0.00089230185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044701743,0.00011937437,0.0006313733,0.00025707632,0.000068894886,0.00021884206,0.00039516098,0.6612674,0.01695854,0.23275273,0.0033103607,0.08357329],"study_design_scores_gemma":[0.000016761556,0.000051724935,0.00004231901,0.000030519197,0.000008600335,0.000025940117,0.000008783771,0.98427886,0.0026906577,0.011667739,0.0011641901,0.000013903731],"about_ca_topic_score_codex":0.0019057973,"about_ca_topic_score_gemma":0.0018642135,"teacher_disagreement_score":0.0035737439,"about_ca_system_score_codex":0.0013174696,"about_ca_system_score_gemma":0.0012034711,"threshold_uncertainty_score":0.018899977},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.03518016164055663,"score_gpt":0.310050986311757,"score_spread":0.27487082467120033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416875646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011746744,0.0006464382,0.99644095,0.00024835195,0.00007689565,0.000011598729,0.000043378186,0.00008917534,0.0012685515],"genre_scores_gemma":[0.23711231,0.0035660595,0.7472402,0.00052069465,0.00085441774,0.0003841601,0.0005578718,0.0003949878,0.00936934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754626,0.0011575285,0.00011006586,0.000359771,0.00071778736,0.00010856281],"domain_scores_gemma":[0.9917337,0.0066878935,0.00023548177,0.0006082577,0.0006160894,0.00011861461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021473945,0.0015545409,0.0020989787,0.00096772553,0.0005241687,0.0017376746,0.0017581744,0.0021389276,0.003980203],"category_scores_gemma":[0.020323418,0.0010134474,0.0007870747,0.001689647,0.0021930167,0.0026736902,0.0023605824,0.003985765,0.0010673607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002116932,0.00009504234,0.00038800007,0.00044425664,0.000079726444,0.00008114314,0.0001312882,0.38639602,0.0029225326,0.48648277,0.008752101,0.11401545],"study_design_scores_gemma":[0.000016016942,0.000015667485,0.000058349833,0.000021677495,0.000009044603,0.000023303823,0.000011312667,0.8092194,0.0004564689,0.18821786,0.0019418624,0.000009015994],"about_ca_topic_score_codex":0.003301683,"about_ca_topic_score_gemma":0.0025300293,"teacher_disagreement_score":0.003980203,"about_ca_system_score_codex":0.0011989076,"about_ca_system_score_gemma":0.0011929002,"threshold_uncertainty_score":0.013315082},"labels":[],"label_agreement":null}]}