{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42266926,0.000089479916,0.57569295,0.00004915763,0.00009844411,0.000102624006,0.000008628421,0.00024057891,0.0010488409],"genre_scores_gemma":[0.5367766,0.0000021126853,0.46312463,0.000018728073,0.00002211295,0.0000011438389,0.000035691453,0.000012856469,0.0000061107276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992948,0.000016224665,0.00029526133,0.000084244995,0.00021699801,0.00009242985],"domain_scores_gemma":[0.9991731,0.00029601314,0.000070033384,0.00012003492,0.00028088235,0.000059960068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011254474,0.000107303276,0.00017830865,0.00012437276,0.00005518911,0.00003972167,0.00005961961,0.000039261413,0.000007740046],"category_scores_gemma":[0.00007372007,0.000113292954,0.000028594312,0.00012332128,0.000068019515,0.000095194686,0.000038546492,0.000063830485,0.0000074584004],"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.0000035414678,0.000029338997,0.00003515622,0.000036683286,0.00004730486,9.429583e-7,0.00042086645,0.97066426,0.0012808722,0.025712078,0.0007336772,0.0010352454],"study_design_scores_gemma":[0.00024545545,0.000013369558,0.00016012408,0.00006773299,0.00001679421,0.000024767282,0.00004530666,0.80116445,0.0010582841,0.19670826,0.00038938195,0.0001060498],"about_ca_topic_score_codex":0.00000753939,"about_ca_topic_score_gemma":0.000001677829,"teacher_disagreement_score":0.17099619,"about_ca_system_score_codex":0.000021749944,"about_ca_system_score_gemma":0.000036618116,"threshold_uncertainty_score":0.46199524},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012893799,0.000007651164,0.982491,0.0029792287,0.00041550558,0.0004111372,0.0000114203085,0.00004762776,0.0007426365],"genre_scores_gemma":[0.89483964,2.293332e-7,0.10479759,0.00021259052,0.00008131767,0.000015605578,0.000006400768,0.0000051829365,0.00004143175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988605,0.000051245133,0.00046695166,0.00015754644,0.00033894414,0.00012483439],"domain_scores_gemma":[0.9969566,0.0019546181,0.0004720547,0.00032823812,0.0002665177,0.000021995224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039086316,0.00011059782,0.0001615507,0.00008857323,0.0003338444,0.00008211965,0.00056090305,0.00003188693,0.0000031070274],"category_scores_gemma":[0.00026005306,0.00007413679,0.00013229977,0.00037468417,0.000052090658,0.00020057459,0.000062334286,0.00007780544,0.0000070216006],"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.000008738959,0.000082469065,0.000003378538,0.00005052016,0.000017294642,5.236768e-8,0.00071653555,0.17563973,0.00018314592,0.8172238,0.0002586842,0.0058156536],"study_design_scores_gemma":[0.00022316209,0.000080780854,0.0014085845,0.00014301384,0.000016090533,0.000003245604,0.000037788654,0.7769306,0.000330861,0.22061218,0.000146218,0.00006753233],"about_ca_topic_score_codex":0.0000031346472,"about_ca_topic_score_gemma":8.946893e-7,"teacher_disagreement_score":0.88194585,"about_ca_system_score_codex":0.000055831573,"about_ca_system_score_gemma":0.00016454987,"threshold_uncertainty_score":0.30232105},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88374656,0.00004339995,0.110746466,0.00006921464,0.00005141347,0.00009588141,0.000017483024,0.000019764622,0.0052098185],"genre_scores_gemma":[0.9449235,0.0000034281588,0.05489956,0.0000026932712,0.000024360617,0.000011083217,0.00006144479,0.000008250955,0.00006568918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991687,0.0000138054365,0.0004221348,0.00010317108,0.00021877709,0.00007340404],"domain_scores_gemma":[0.99921834,0.00015620768,0.0002481136,0.00013913121,0.00020314642,0.000035050565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009363386,0.00007579027,0.00016966475,0.000056977937,0.000055092227,0.000034626228,0.00008128942,0.00005358051,0.00018371858],"category_scores_gemma":[0.000109810884,0.00007618765,0.000037045713,0.00009763209,0.000101269696,0.0001111955,0.000031990552,0.00006451254,0.000009611643],"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.000010761509,0.0007153552,0.00062669785,0.0029753617,0.00023444743,5.572034e-7,0.0010653929,0.018868867,0.12506375,0.8489399,0.00014608912,0.0013528432],"study_design_scores_gemma":[0.00048773916,0.000031150987,0.0017332344,0.0003793013,0.000078680794,0.00006520481,0.00067724905,0.5668249,0.01781691,0.41167757,0.000020537826,0.00020750448],"about_ca_topic_score_codex":0.000041578933,"about_ca_topic_score_gemma":2.3064976e-7,"teacher_disagreement_score":0.54795605,"about_ca_system_score_codex":0.000022535878,"about_ca_system_score_gemma":0.000039266866,"threshold_uncertainty_score":0.3106842},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002398886,0.0000036438246,0.9955588,0.0005431486,0.00016765992,0.00059674296,0.00004152388,0.00027479298,0.00041482903],"genre_scores_gemma":[0.22747351,3.7561156e-7,0.7722277,0.00007305151,0.000029185934,0.00010299376,0.000028635719,0.00001783797,0.00004669142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859077,0.000026458923,0.000570579,0.00027796684,0.0003369539,0.00019726895],"domain_scores_gemma":[0.99213713,0.0064492333,0.00038960093,0.00045285467,0.000500246,0.00007093728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038843733,0.0001742041,0.00025899685,0.00019975622,0.00021508979,0.00015201324,0.00060707564,0.000061046354,0.000019708797],"category_scores_gemma":[0.0026251907,0.00017682707,0.00011406902,0.00038063715,0.000076972254,0.00025897965,0.00007451947,0.00006527811,0.000011225076],"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.00000378448,0.00018051604,0.0000072065423,0.000066060835,0.000020244765,2.8443104e-8,0.00026390806,0.07546687,0.00007711651,0.9219153,0.00030691508,0.0016920296],"study_design_scores_gemma":[0.00023073325,0.00015151853,0.00009603035,0.000022349694,0.000009044073,0.0000029897542,0.000008300345,0.5406338,0.00020231557,0.45837197,0.00017504067,0.00009593689],"about_ca_topic_score_codex":0.0000050419667,"about_ca_topic_score_gemma":8.71406e-7,"teacher_disagreement_score":0.4651669,"about_ca_system_score_codex":0.000059042643,"about_ca_system_score_gemma":0.00011113534,"threshold_uncertainty_score":0.7210799},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010887475,0.000021494674,0.986303,0.00031158046,0.00007947024,0.0011593972,0.000023839375,0.00005815875,0.0011556209],"genre_scores_gemma":[0.050202925,0.000027215145,0.9491859,0.000038065544,0.000020615395,0.000109407,0.00016140277,0.000049391707,0.00020509736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972228,0.00015731309,0.0014810397,0.00026921617,0.0006098835,0.00025974607],"domain_scores_gemma":[0.9963158,0.0012463613,0.00066124776,0.00034322118,0.0013355714,0.00009779234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001071055,0.00021246121,0.0005210856,0.0007459983,0.00008026481,0.000042727206,0.00026756083,0.00009820248,0.0005095163],"category_scores_gemma":[0.0019542133,0.00022420594,0.00008958062,0.0013744783,0.0001349087,0.0004123819,0.00014524469,0.00013325356,0.000012562681],"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.000015334335,0.000339465,0.000113980175,0.0002849323,0.00003908078,6.377704e-7,0.0020906006,0.88690513,0.00020930506,0.108504936,0.000055008717,0.0014415805],"study_design_scores_gemma":[0.0006006573,0.0000998401,0.000091663416,0.00016912812,0.000018842578,0.000016432077,0.00028433625,0.70135933,0.0004433556,0.29666165,0.00009857276,0.00015618546],"about_ca_topic_score_codex":0.000009499914,"about_ca_topic_score_gemma":0.000016703301,"teacher_disagreement_score":0.18815671,"about_ca_system_score_codex":0.00020562527,"about_ca_system_score_gemma":0.00023382704,"threshold_uncertainty_score":0.9142853},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33399877,0.000035271984,0.66039735,0.00015527623,0.00005138694,0.00035805744,0.00006380359,0.000024840689,0.00491522],"genre_scores_gemma":[0.8092808,0.0000018137855,0.19054903,0.00003184298,0.000018364119,0.000009598245,0.000077431396,0.000012887668,0.000018244667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982235,0.00008663096,0.00087925757,0.0001282092,0.0005187437,0.00016369254],"domain_scores_gemma":[0.99364734,0.005220644,0.00047001475,0.00028732815,0.00034460917,0.000030096453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002027268,0.00014192815,0.00033077315,0.0002633436,0.00011415377,0.000023214965,0.00033947726,0.000057661706,0.00014264678],"category_scores_gemma":[0.0011203202,0.00010834181,0.00008912145,0.00073141087,0.0005431412,0.00012975783,0.00003527394,0.00012959649,0.000014244088],"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.000011633993,0.00053573394,0.00046592945,0.00020697278,0.000030763185,0.0000016541106,0.0027648918,0.0011517126,0.00004239545,0.9944493,0.00014269624,0.00019628217],"study_design_scores_gemma":[0.0003593042,0.000040356357,0.0065781916,0.00009784835,0.00004196485,0.000014400033,0.0017232705,0.009751069,0.0004430619,0.9808059,0.000041050847,0.00010362473],"about_ca_topic_score_codex":0.0000073061533,"about_ca_topic_score_gemma":0.000023968383,"teacher_disagreement_score":0.475282,"about_ca_system_score_codex":0.000047715817,"about_ca_system_score_gemma":0.00007091528,"threshold_uncertainty_score":0.4418051},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48884073,0.0000025101833,0.5068002,0.000049101105,0.000059524038,0.00011018337,0.000086355,0.000011344198,0.004040085],"genre_scores_gemma":[0.8451749,9.148329e-8,0.1540731,0.0000049697187,0.00017069766,0.0000059471636,0.00047587187,0.000013015964,0.00008140791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991057,0.000034588647,0.00042814703,0.000115386574,0.0002067048,0.00010950448],"domain_scores_gemma":[0.9991277,0.00021960896,0.0002428355,0.00014244927,0.00023732387,0.000030103358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000077372424,0.00011145632,0.0001738872,0.0001009632,0.000179888,0.000063585576,0.00011785747,0.000025884086,0.00026879206],"category_scores_gemma":[0.000009616879,0.00010804606,0.00008307509,0.00020646404,0.00008364026,0.00013680923,0.000036656482,0.00007531522,0.000021061976],"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.0000019998276,0.00047597932,0.001805112,0.000022097965,0.000055709912,1.3687068e-7,0.00023506283,0.018815603,0.00076125615,0.97750413,0.0000770709,0.00024583918],"study_design_scores_gemma":[0.00029236072,0.00001435907,0.0052585327,0.00003052641,0.000045893918,0.000001307362,0.0005263908,0.5955712,0.0003873454,0.3976883,0.00006110295,0.00012263318],"about_ca_topic_score_codex":0.000108899134,"about_ca_topic_score_gemma":0.00000225758,"teacher_disagreement_score":0.5798158,"about_ca_system_score_codex":0.000029966135,"about_ca_system_score_gemma":0.00012750363,"threshold_uncertainty_score":0.44059905},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31564066,0.000013839325,0.6716652,0.000368737,0.00007126729,0.000524134,0.000101646394,0.00013323297,0.011481303],"genre_scores_gemma":[0.5411043,6.5874804e-7,0.45807675,0.000025504127,0.00003419117,0.000029107614,0.00009833672,0.000037710077,0.00059344305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978608,0.000042936732,0.00096307154,0.00025101542,0.0006215975,0.00026059174],"domain_scores_gemma":[0.99662185,0.0015338103,0.0007946302,0.00038480383,0.00058974203,0.00007514377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003307472,0.00027413882,0.0005949915,0.0001858552,0.00017545492,0.00010346922,0.00028717524,0.00008681153,0.00042237533],"category_scores_gemma":[0.00026930025,0.00022574038,0.00013650085,0.0003673836,0.00018731749,0.00019363822,0.00008721793,0.00014245872,0.000081596205],"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.000015836087,0.0010157799,0.0004103369,0.00085265463,0.00012651327,0.000006085129,0.00031342954,0.012284673,0.00004392717,0.98078185,0.0039449753,0.00020393918],"study_design_scores_gemma":[0.0005498472,0.00005939792,0.00095343473,0.00029024424,0.00007311237,0.000039160426,0.00014417367,0.2017557,0.000049768343,0.7956024,0.00025315452,0.00022963893],"about_ca_topic_score_codex":0.000014507688,"about_ca_topic_score_gemma":0.00002579103,"teacher_disagreement_score":0.22546364,"about_ca_system_score_codex":0.00006155825,"about_ca_system_score_gemma":0.00009659741,"threshold_uncertainty_score":0.9205426},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56157833,0.00006057632,0.39240608,0.0010908986,0.0007716033,0.00091507635,0.000272284,0.00021015269,0.042694986],"genre_scores_gemma":[0.75526917,0.0000020201473,0.2431963,0.000121476114,0.00038823116,0.000043300992,0.000094380055,0.000038978975,0.00084616913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977537,0.00008841493,0.0009504022,0.00018401301,0.00068089954,0.00034260438],"domain_scores_gemma":[0.9946287,0.004109537,0.00047389852,0.00036688423,0.00024689455,0.00017404735],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00077695213,0.00026522353,0.00047571125,0.00026824945,0.00019951684,0.000043431333,0.00021819373,0.00012647403,0.003624459],"category_scores_gemma":[0.0011382935,0.00022972948,0.0002326212,0.000315044,0.00015962582,0.00023825251,0.000058148402,0.00017624667,0.000545271],"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.000015995483,0.0011750257,0.00018159334,0.00018707984,0.000105473984,2.7081924e-7,0.0006198596,0.00086744217,0.00008372812,0.9881794,0.00817619,0.00040793314],"study_design_scores_gemma":[0.0005177319,0.000113523936,0.0011486543,0.00012327364,0.00009861853,0.000050588376,0.00015168096,0.0019870012,0.00029122486,0.9919442,0.0032898681,0.00028366616],"about_ca_topic_score_codex":0.0000017074378,"about_ca_topic_score_gemma":0.0000012354234,"teacher_disagreement_score":0.19369079,"about_ca_system_score_codex":0.00007066651,"about_ca_system_score_gemma":0.0001337936,"threshold_uncertainty_score":0.9972864},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04621891,0.000030948097,0.950067,0.0013339925,0.000072156785,0.0009040421,0.0000694632,0.000031514413,0.0012720143],"genre_scores_gemma":[0.39211327,0.0000036555512,0.6075161,0.000032550754,0.00003803676,0.000020013344,0.000015323105,0.000021325453,0.0002397491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981405,0.00013685637,0.0006723648,0.00011416367,0.00077166565,0.0001644063],"domain_scores_gemma":[0.9940728,0.0041262214,0.0006443026,0.0004213341,0.00070358656,0.00003177029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006145526,0.0001276627,0.0002330503,0.00009074109,0.00016242717,0.000013391304,0.00044886806,0.00005594585,0.0001822122],"category_scores_gemma":[0.002680972,0.000077442004,0.00014157691,0.0004953502,0.00033305417,0.00009892792,0.00009528303,0.00018975421,0.0000063122375],"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.000010305274,0.0004842442,0.000022437862,0.00015144289,0.00006211004,5.899807e-8,0.0013861174,0.12100336,0.000026745705,0.8745398,0.00023877848,0.002074631],"study_design_scores_gemma":[0.00025641482,0.00004490355,0.00019705492,0.00018196821,0.000036003705,0.0000030371227,0.00035208653,0.17747675,0.00094271824,0.82013243,0.00029990482,0.00007674796],"about_ca_topic_score_codex":7.9058066e-7,"about_ca_topic_score_gemma":0.0000016456481,"teacher_disagreement_score":0.34589437,"about_ca_system_score_codex":0.000044470304,"about_ca_system_score_gemma":0.0001715638,"threshold_uncertainty_score":0.32095677},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22811705,0.00001178452,0.7686942,0.000056395213,0.000020449343,0.00018290282,0.000006980088,0.00017047983,0.0027397606],"genre_scores_gemma":[0.63293844,0.000005113183,0.3669798,0.000006424919,0.000008313173,0.0000062673857,0.000036939033,0.000007826175,0.0000108865515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995443,0.000007669395,0.00018803556,0.00006507115,0.00012296693,0.00007191016],"domain_scores_gemma":[0.99942803,0.00014277232,0.000063127874,0.00008660428,0.0002505583,0.000028909993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000024578521,0.000083274834,0.000117911084,0.000091353606,0.000053489923,0.00004091904,0.00005218987,0.000029943778,0.00012258776],"category_scores_gemma":[0.00002386826,0.000078047124,0.000012617473,0.00013345234,0.00012736193,0.00016765713,0.000015905673,0.00004478286,0.000007440958],"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.0000016724031,0.000040538678,0.00013568389,0.00003810522,0.000041920404,4.908037e-7,0.00014424554,0.9869604,0.00024465306,0.01088406,0.0004068625,0.0011013541],"study_design_scores_gemma":[0.00021309656,0.00003463976,0.0031431087,0.00006846575,0.000020893782,0.000027110591,0.000061557075,0.977426,0.0006214405,0.018245785,0.000029090346,0.00010881672],"about_ca_topic_score_codex":0.000006593781,"about_ca_topic_score_gemma":0.0000013955008,"teacher_disagreement_score":0.4048214,"about_ca_system_score_codex":0.000011159101,"about_ca_system_score_gemma":0.00001915933,"threshold_uncertainty_score":0.31826693},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00806873,0.000020995576,0.98951924,0.00074295676,0.0004066769,0.0004742352,0.000038637663,0.00014554174,0.0005829777],"genre_scores_gemma":[0.064651355,0.0000011585264,0.9345382,0.00019564845,0.00015155187,0.00006498809,0.00015287993,0.000020303287,0.00022394891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811375,0.00006797009,0.0007080867,0.0003485748,0.0004866507,0.00027496144],"domain_scores_gemma":[0.9975847,0.001014742,0.0004153531,0.00038739064,0.00048545454,0.000112351714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004861031,0.0002159987,0.00033277294,0.0002387221,0.00025038832,0.00018296373,0.00067741395,0.00006789687,0.000022450788],"category_scores_gemma":[0.00013174441,0.0002145084,0.00016943994,0.0003978977,0.00008373747,0.00045683363,0.0001639083,0.00008444193,0.00006405766],"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.0000021919143,0.00022973777,0.000004026666,0.000072747454,0.000053741136,3.485834e-7,0.00036334875,0.013115555,0.00007287522,0.7146649,0.0013570724,0.2700635],"study_design_scores_gemma":[0.0004815488,0.00009499455,0.00047467387,0.000027772947,0.000014668839,0.000012383951,0.000013770483,0.6507913,0.00005340651,0.34608737,0.0017921501,0.00015598854],"about_ca_topic_score_codex":0.000011320098,"about_ca_topic_score_gemma":0.0000046756736,"teacher_disagreement_score":0.6376757,"about_ca_system_score_codex":0.000056346536,"about_ca_system_score_gemma":0.0002084804,"threshold_uncertainty_score":0.8747399},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013703543,0.000022961141,0.984691,0.00004951626,0.00018712778,0.00038707867,0.000038202157,0.00024028416,0.00068025786],"genre_scores_gemma":[0.3335081,0.0000012354378,0.66622436,0.000012768465,0.000040836763,0.000032643016,0.00014824167,0.000017668432,0.0000141431465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919486,0.000010964407,0.0003691104,0.00008658612,0.0002367428,0.00010173927],"domain_scores_gemma":[0.99902713,0.00018831744,0.00009021745,0.00014189511,0.0004972671,0.000055143057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011793935,0.00011095405,0.00017780915,0.00009941759,0.000042333097,0.000035378824,0.00010906002,0.00004987119,0.000015832577],"category_scores_gemma":[0.00008946069,0.000113496186,0.000057355403,0.00012615506,0.000045781213,0.00011280378,0.000015453914,0.000045551194,0.000011267054],"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.000008961659,0.00021965898,0.0000076191263,0.00027388104,0.00019152364,7.2861644e-7,0.0016861677,0.7869744,0.00088229857,0.17936942,0.007495526,0.022889813],"study_design_scores_gemma":[0.00023577701,0.000027040032,0.00002160076,0.000033912784,0.000018165054,0.000004209692,0.000069342816,0.6884335,0.0020211304,0.30883402,0.00021876552,0.00008250071],"about_ca_topic_score_codex":0.0000012489475,"about_ca_topic_score_gemma":9.68965e-7,"teacher_disagreement_score":0.31980455,"about_ca_system_score_codex":0.000046318215,"about_ca_system_score_gemma":0.00006556821,"threshold_uncertainty_score":0.46282402},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2920172,0.000014129462,0.70663816,0.00020950133,0.000043570104,0.00010980749,0.000005622962,0.000048307873,0.0009137112],"genre_scores_gemma":[0.5116799,0.0000029934295,0.48824528,0.000016547781,0.000013727917,0.000004882092,0.000005843066,0.00000298427,0.000027829341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911696,0.00004272128,0.00031959746,0.00017262844,0.0002386364,0.000109481996],"domain_scores_gemma":[0.99876195,0.00058349187,0.00013860503,0.00025793025,0.00020261103,0.000055390636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003884665,0.00009148068,0.00014572518,0.00007740314,0.00014729805,0.00007221001,0.00029570147,0.000029787756,0.00006985653],"category_scores_gemma":[0.0001301629,0.00008865244,0.00004217991,0.00025248592,0.00010970826,0.00034127277,0.00013767039,0.000058906764,0.000021406948],"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.000003332408,0.00027915568,0.00029509224,0.00005955716,0.000021355381,0.0000012657327,0.001291943,0.023094585,0.000078083125,0.9707465,0.000022618331,0.004106469],"study_design_scores_gemma":[0.00016902115,0.000027986323,0.0013402221,0.000010911412,0.0000052400164,0.000028563429,0.000063738415,0.62476534,0.00022893582,0.37311697,0.00016243303,0.00008063144],"about_ca_topic_score_codex":0.0000037644056,"about_ca_topic_score_gemma":9.426057e-7,"teacher_disagreement_score":0.60167074,"about_ca_system_score_codex":0.000017069662,"about_ca_system_score_gemma":0.000060865543,"threshold_uncertainty_score":0.36151415},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01805215,0.000029346258,0.9687632,0.0010731036,0.00007771171,0.00077097013,0.000058367492,0.00018167864,0.010993499],"genre_scores_gemma":[0.67215866,7.9675976e-7,0.3265965,0.000058347985,0.00007995996,0.00021804713,0.00027321847,0.00003555533,0.0005789308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817663,0.000057849895,0.0007797528,0.00025931987,0.0004682327,0.00025818273],"domain_scores_gemma":[0.99644184,0.0014435321,0.00068825734,0.00043475928,0.0008925771,0.000099041325],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017631376,0.00025754064,0.00032088088,0.00022675833,0.00042190752,0.00019099661,0.00036294345,0.00004709686,0.003474999],"category_scores_gemma":[0.00027017965,0.00026663707,0.00014870554,0.0003016674,0.0001663493,0.00075140834,0.00009190376,0.00018070888,0.0012391395],"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.0000015413985,0.000649481,0.00037673616,0.00007013394,0.00015070433,4.103733e-7,0.0016379051,0.026283974,0.00041447784,0.96558195,0.0008123212,0.0040203515],"study_design_scores_gemma":[0.00023628944,0.00003098518,0.00028537327,0.00014055276,0.00005638035,0.000001844673,0.00075042393,0.22140326,0.0003125064,0.776341,0.00023020436,0.00021115606],"about_ca_topic_score_codex":0.00019980244,"about_ca_topic_score_gemma":0.0000065813238,"teacher_disagreement_score":0.6541065,"about_ca_system_score_codex":0.00006557492,"about_ca_system_score_gemma":0.00022985124,"threshold_uncertainty_score":0.9999786},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46912947,0.000013270652,0.52840054,0.000094543895,0.000058112662,0.00005517455,0.000049271403,0.00006543972,0.002134192],"genre_scores_gemma":[0.92423236,0.000004034174,0.07562195,0.000009493826,0.000017838325,0.000004285054,0.000055067172,0.000018707522,0.00003625734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999147,0.00000968162,0.0003790684,0.00009233756,0.00028123715,0.00009070671],"domain_scores_gemma":[0.99894565,0.00033492636,0.00020349774,0.0003174575,0.00017225674,0.000026201646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015654432,0.00011401651,0.00023531118,0.00013655884,0.00018343203,0.000071991926,0.0002744731,0.000039519233,0.000075056654],"category_scores_gemma":[0.00006744306,0.000111574554,0.00009972948,0.000067824796,0.000057633304,0.00012651512,0.000026464133,0.00006590161,0.00001709154],"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.0000013101318,0.000055281937,0.000075380194,0.0001906337,0.000049983584,1.9964747e-7,0.00025727684,0.9926135,0.00018924383,0.0061306017,0.00005216689,0.00038440656],"study_design_scores_gemma":[0.00013002084,0.000014069871,0.0006677286,0.00014424219,0.00003443748,4.6419785e-7,0.00009865384,0.9458015,0.00052068685,0.052487038,0.000007030432,0.00009412315],"about_ca_topic_score_codex":0.000017896391,"about_ca_topic_score_gemma":0.0000060213906,"teacher_disagreement_score":0.4551029,"about_ca_system_score_codex":0.000019291345,"about_ca_system_score_gemma":0.00003601197,"threshold_uncertainty_score":0.45498785},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042614795,0.00008147588,0.9558643,0.00012450534,0.000022344499,0.001046055,0.00010861775,0.00002855258,0.00010937104],"genre_scores_gemma":[0.2906004,0.00003388287,0.7091034,0.0000042890656,0.000014158847,0.000053117124,0.00013179488,0.000017886337,0.000041069547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984878,0.00006318689,0.0007744665,0.00016139436,0.0003993222,0.00011385147],"domain_scores_gemma":[0.99656653,0.0011284235,0.0007096919,0.00014481142,0.001408815,0.00004170021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005089195,0.0001236122,0.0003285173,0.0002103697,0.00011643332,0.00002016689,0.00008414988,0.0000646983,0.000042740026],"category_scores_gemma":[0.001268783,0.00012475268,0.00004947285,0.00026580459,0.00032879176,0.00020769532,0.00003647429,0.000055785673,5.394188e-7],"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.000023957884,0.0007730398,0.00021199025,0.003104448,0.00016662071,1.1380874e-7,0.005870465,0.10331634,0.00046420228,0.8738462,0.00008934877,0.012133286],"study_design_scores_gemma":[0.00050810433,0.000098485405,0.00008565702,0.00009101812,0.00003680418,0.0000048550714,0.00012268341,0.53274524,0.00031349843,0.4658689,0.00005566839,0.00006911197],"about_ca_topic_score_codex":0.000005092183,"about_ca_topic_score_gemma":0.00000852129,"teacher_disagreement_score":0.4294289,"about_ca_system_score_codex":0.000030983007,"about_ca_system_score_gemma":0.00003795401,"threshold_uncertainty_score":0.50872666},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27942458,0.000066440756,0.71947336,0.00005788815,0.00025918838,0.00041775807,0.00008655274,0.00003630767,0.00017790336],"genre_scores_gemma":[0.5487137,0.000011223648,0.45113474,0.0000024903895,0.000027002427,0.000046703208,0.00003423538,0.000019232768,0.000010703153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998625,0.000025128995,0.00077090506,0.00015973035,0.00025048913,0.00016876038],"domain_scores_gemma":[0.9975742,0.001458271,0.00040742185,0.00026657918,0.00024007508,0.000053469186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000204948,0.00017183789,0.00038952252,0.0001832508,0.00021526986,0.00005827967,0.0002739471,0.00006658252,0.000026465199],"category_scores_gemma":[0.0005656022,0.00019081784,0.000076750504,0.00011213887,0.00040036795,0.00030511507,0.00006794022,0.000092299575,0.000005092516],"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.000013623405,0.00032071248,0.0010838173,0.0018986498,0.00013364237,7.177785e-7,0.0008989686,0.8575277,0.0018442365,0.1336415,0.00011279144,0.0025236655],"study_design_scores_gemma":[0.0006161957,0.00006166069,0.010647436,0.00017351644,0.0000351147,0.000008027429,0.000096905955,0.5736579,0.00049105234,0.41398472,0.000068590125,0.00015891567],"about_ca_topic_score_codex":0.0000048107872,"about_ca_topic_score_gemma":0.000007935859,"teacher_disagreement_score":0.2838698,"about_ca_system_score_codex":0.000049822538,"about_ca_system_score_gemma":0.00007836242,"threshold_uncertainty_score":0.77813256},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045916565,0.000024424677,0.94845897,0.0049874224,0.000057813984,0.000087731336,0.0000360265,0.000051775103,0.00037929],"genre_scores_gemma":[0.7593709,0.000005697502,0.24038434,0.00012288294,0.000029288056,0.0000036082995,0.000074051655,0.000003184732,0.000006013189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908787,0.000029342506,0.00033058165,0.00020480395,0.00025151728,0.00009586871],"domain_scores_gemma":[0.9987286,0.0007235031,0.00014913635,0.00012664203,0.0001587248,0.00011341595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010719525,0.00009405376,0.00021062203,0.00013649392,0.00016033252,0.00014871024,0.00026057285,0.000046541027,0.000019360165],"category_scores_gemma":[0.00020295083,0.00008687179,0.000040616622,0.0005939145,0.00016196157,0.0002855423,0.00026588936,0.00009600049,0.000009672471],"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.0000020669927,0.00010400958,0.0005847578,0.000034543726,0.000036226407,0.0000013213537,0.00029161584,0.0026127396,0.0000061362675,0.9934076,0.00007342469,0.0028455234],"study_design_scores_gemma":[0.0002235766,0.00004843906,0.001458267,0.000009601849,0.000017292485,0.000007453131,0.000050727507,0.6165186,0.0000032193218,0.3814878,0.00011019753,0.00006483299],"about_ca_topic_score_codex":0.0000042686474,"about_ca_topic_score_gemma":0.0000020517914,"teacher_disagreement_score":0.71345437,"about_ca_system_score_codex":0.0000130683275,"about_ca_system_score_gemma":0.00004534703,"threshold_uncertainty_score":0.35425287},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021593774,0.000011062912,0.9732411,0.0011679013,0.00010461836,0.0011295944,0.00015905056,0.00004477111,0.0025481347],"genre_scores_gemma":[0.44004783,7.556198e-7,0.559594,0.000016422864,0.00004400529,0.000099312456,0.00007269448,0.000016669506,0.00010829988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981444,0.0000720033,0.0009420282,0.00016728969,0.00053145393,0.00014283424],"domain_scores_gemma":[0.9865274,0.011142492,0.00062565366,0.000443157,0.0012260904,0.000035218367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011770161,0.00014473735,0.0003267732,0.00011510203,0.00025370574,0.000025262621,0.00033686103,0.00005317188,0.00009718155],"category_scores_gemma":[0.0032604737,0.00011279537,0.0001883557,0.00031219938,0.0005033232,0.000109081324,0.00005834588,0.000079352445,0.000012823661],"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.000017588118,0.00044089163,0.000036458026,0.0005283607,0.00008985219,8.904866e-9,0.0006082727,0.023386879,0.000055316566,0.97354466,0.0006311509,0.00066056044],"study_design_scores_gemma":[0.00041357693,0.000088702895,0.00047555644,0.000045214205,0.00007599563,0.0000029244325,0.00013536916,0.23113163,0.00018337597,0.766814,0.00055293355,0.00008074757],"about_ca_topic_score_codex":0.000011452265,"about_ca_topic_score_gemma":0.000019031593,"teacher_disagreement_score":0.41845408,"about_ca_system_score_codex":0.00004391995,"about_ca_system_score_gemma":0.00015768028,"threshold_uncertainty_score":0.45996618},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43063876,0.000007704071,0.5684342,0.000030070403,0.000069677924,0.00020386865,0.000026028869,0.00001012929,0.0005795559],"genre_scores_gemma":[0.8864204,1.6794014e-7,0.11326323,0.000006267707,0.000024594663,0.000017166776,0.0002284194,0.000011996634,0.000027757209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986075,0.0000587413,0.00077573495,0.00013187063,0.0003100676,0.000116086834],"domain_scores_gemma":[0.99845946,0.0004289705,0.00047201503,0.00012473368,0.00045541773,0.000059417966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002809739,0.00012133002,0.00029632496,0.00017942932,0.000038700753,0.000022183998,0.00009721735,0.000039438943,0.000029881538],"category_scores_gemma":[0.000060368853,0.00011823587,0.00007511545,0.0002900227,0.00007297905,0.00015899168,0.000036220084,0.000071281676,0.000028087328],"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.000020899377,0.001876919,0.021776346,0.00014396755,0.00010883221,6.843495e-7,0.0033699789,0.5992535,0.00028844483,0.36946183,0.00010197266,0.0035966164],"study_design_scores_gemma":[0.00081615173,0.000048341535,0.0065090572,0.00007843708,0.000018564248,9.091971e-7,0.00033771718,0.71221155,0.00003803873,0.27982575,0.00001934902,0.0000961463],"about_ca_topic_score_codex":0.00023133484,"about_ca_topic_score_gemma":0.000020170288,"teacher_disagreement_score":0.45578164,"about_ca_system_score_codex":0.00003471193,"about_ca_system_score_gemma":0.00009246459,"threshold_uncertainty_score":0.48215187},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3862113,0.00032423163,0.6078332,0.0010321322,0.00029679318,0.0014208923,0.0007654899,0.00012364138,0.001992281],"genre_scores_gemma":[0.25432542,0.000045510442,0.7427604,0.00002600391,0.000118440534,0.00034611337,0.0019353096,0.000063570675,0.00037920394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961332,0.00029853257,0.0018923292,0.00062052475,0.00078044494,0.00027494738],"domain_scores_gemma":[0.9905052,0.0060269604,0.0011019079,0.0015333293,0.00073836,0.000094212875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010952987,0.00041323336,0.00090190035,0.00035585623,0.00017211643,0.00017579555,0.0007703988,0.00038062446,0.0007152853],"category_scores_gemma":[0.0021843195,0.0004298691,0.00034875885,0.00053720584,0.00019722525,0.00023480042,0.00074626657,0.00064856594,0.000041405638],"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.000031159925,0.0025907988,0.00026426042,0.0013786734,0.00024487285,0.000006788242,0.0048571485,0.1734216,0.000039781906,0.8142159,0.0021199097,0.0008290979],"study_design_scores_gemma":[0.00088657765,0.000014214068,0.0010934017,0.00077108445,0.00020394604,0.0000068370755,0.00057099375,0.09307813,0.000039197002,0.9028853,0.0001141168,0.00033620544],"about_ca_topic_score_codex":0.00019495546,"about_ca_topic_score_gemma":0.00021578683,"teacher_disagreement_score":0.1349272,"about_ca_system_score_codex":0.00021524134,"about_ca_system_score_gemma":0.0006873947,"threshold_uncertainty_score":0.9998153},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034403603,0.000010584429,0.9948694,0.00037576412,0.000025136222,0.0005027202,0.00022779025,0.00012902344,0.00041918844],"genre_scores_gemma":[0.33271918,5.408518e-7,0.6667744,0.000056306366,0.000004745238,0.00007986654,0.00008611097,0.0000071415784,0.00027169473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886614,0.000046673536,0.00037507515,0.0002445673,0.00033120182,0.00013631734],"domain_scores_gemma":[0.99854845,0.0004857036,0.0002809779,0.00026505813,0.00037433876,0.000045477576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000534532,0.00009974584,0.00020998802,0.00034466982,0.00053735834,0.00008065807,0.00029520429,0.000020902327,0.00008802448],"category_scores_gemma":[0.000095164156,0.00009439337,0.000087674576,0.00088224217,0.000034459517,0.0004100869,0.0003105822,0.000059883143,0.0000013631687],"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.0000029685052,0.00021103867,0.000025109952,0.00004867744,0.00014606012,0.0000020625155,0.0026422672,0.5964078,0.0000031328948,0.39990386,0.00035649497,0.00025054163],"study_design_scores_gemma":[0.00022313943,0.00005166528,0.000008019825,0.000005460804,0.000080888814,0.000046110345,0.00012174241,0.76273084,0.000009417437,0.23653974,0.00010401141,0.00007899945],"about_ca_topic_score_codex":0.00000987823,"about_ca_topic_score_gemma":8.338113e-7,"teacher_disagreement_score":0.32927883,"about_ca_system_score_codex":0.000068015994,"about_ca_system_score_gemma":0.0001151787,"threshold_uncertainty_score":0.413298},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34555143,0.000102893224,0.65364146,0.0000254165,0.0001034061,0.0002958111,0.00006464626,0.00009997874,0.00011494044],"genre_scores_gemma":[0.4505169,0.00002657001,0.54897213,0.000002813841,0.000025646374,0.00002188146,0.0004038546,0.00002431773,0.000005868512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893063,0.000016154307,0.0005755661,0.00015843581,0.00021840827,0.000100787765],"domain_scores_gemma":[0.99864876,0.00027469578,0.00024424517,0.00021350042,0.000586629,0.000032141346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000115648916,0.00018728359,0.00042437617,0.00017861837,0.0000505358,0.000035322624,0.00013341397,0.00013461514,0.000008038729],"category_scores_gemma":[0.00006424194,0.00021664947,0.000123491,0.00009347029,0.000077979545,0.00009693393,0.00010460462,0.00013277389,3.717586e-7],"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.0000038173735,0.000093695286,0.0000034241796,0.00068841496,0.00012464495,3.2442162e-7,0.00049310643,0.9555742,0.00022955574,0.0425461,0.00009591387,0.00014680832],"study_design_scores_gemma":[0.00022605802,0.000025237918,0.000027909133,0.000271578,0.000086190754,0.000004512131,0.0000420878,0.77415526,0.0038287402,0.22119327,0.0000068528093,0.00013230823],"about_ca_topic_score_codex":0.0000067863093,"about_ca_topic_score_gemma":0.00000126567,"teacher_disagreement_score":0.18141894,"about_ca_system_score_codex":0.000032292617,"about_ca_system_score_gemma":0.00009714578,"threshold_uncertainty_score":0.8834709},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60331583,0.000010566096,0.39303616,0.00053993304,0.00009210822,0.00040680612,0.00002458563,0.00005968034,0.0025143137],"genre_scores_gemma":[0.7637469,0.000012176125,0.2353121,0.000018221403,0.000034199395,0.000039258957,0.000087370245,0.000023425338,0.0007263177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987448,0.00014595175,0.00051845354,0.00013019718,0.00036506588,0.00009551728],"domain_scores_gemma":[0.99367166,0.00553509,0.00033905738,0.00020782175,0.00021851694,0.000027861708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012416176,0.00010210135,0.0002509639,0.00017899017,0.00013965774,0.0000122222555,0.00011439035,0.00004259373,0.000029307796],"category_scores_gemma":[0.0018479241,0.00007929066,0.000092816976,0.0004328594,0.00011235337,0.00005675681,0.000027328244,0.00011576747,8.110923e-7],"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.00001662611,0.00009517561,0.00007003276,0.00030871507,0.000075668766,0.000001153631,0.0038892168,0.023256462,0.00013472523,0.9706757,0.0007049203,0.000771598],"study_design_scores_gemma":[0.00034562277,0.00006771036,0.0003012416,0.00009701731,0.000052081345,0.000004332703,0.0015386671,0.15580621,0.0002647476,0.841273,0.00016976803,0.00007959862],"about_ca_topic_score_codex":0.000005569395,"about_ca_topic_score_gemma":0.0000015531309,"teacher_disagreement_score":0.16043109,"about_ca_system_score_codex":0.0000117552145,"about_ca_system_score_gemma":0.00003864224,"threshold_uncertainty_score":0.3233379},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75697297,0.000014903272,0.22659719,0.0012704382,0.0003668011,0.00052739505,0.00026611754,0.00038393654,0.013600273],"genre_scores_gemma":[0.6627213,0.0000042691436,0.33546352,0.000053345793,0.00013006122,0.000044605455,0.00018333235,0.000039823823,0.0013597636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980757,0.000052695144,0.00077159493,0.00021291147,0.00061686506,0.00027021248],"domain_scores_gemma":[0.99531996,0.0035627312,0.0004034741,0.00027167884,0.00037219116,0.00006996866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069441204,0.00020663919,0.00039575156,0.00054561655,0.00022510423,0.00007863241,0.00026693824,0.00007981595,0.00020182658],"category_scores_gemma":[0.0013906547,0.0001935097,0.000136063,0.0009770383,0.00013965969,0.00017398965,0.00009087648,0.00013452975,0.00032042636],"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.000024373052,0.00036958812,0.000016537684,0.0004588905,0.000115949384,0.00000324868,0.002736445,0.015458246,0.000043337754,0.9742513,0.0062673795,0.0002547169],"study_design_scores_gemma":[0.00069994066,0.00012622261,0.00042262423,0.00013237154,0.000036874953,0.000009647715,0.0015940899,0.032064103,0.00020436819,0.9630909,0.0013844775,0.00023436478],"about_ca_topic_score_codex":0.000011030849,"about_ca_topic_score_gemma":0.0000022633983,"teacher_disagreement_score":0.10886634,"about_ca_system_score_codex":0.0000545677,"about_ca_system_score_gemma":0.00017005231,"threshold_uncertainty_score":0.78910965},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2721492,0.000020702304,0.7241814,0.00163795,0.00020290999,0.00046506067,0.00044672072,0.00012740734,0.00076864957],"genre_scores_gemma":[0.6223517,6.605044e-7,0.37695366,0.00002723405,0.00004018951,0.000013569912,0.0005193086,0.000026408572,0.00006722787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971661,0.000106535845,0.0014995821,0.00033733074,0.00053844514,0.00035199957],"domain_scores_gemma":[0.97445554,0.023286583,0.00096185645,0.0001927858,0.0010247302,0.000078537705],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.001304623,0.0002334516,0.0006273605,0.0006388114,0.00033085173,0.000032739583,0.00029449884,0.00015985264,0.00005378601],"category_scores_gemma":[0.010266488,0.00024191402,0.00018501133,0.0010745116,0.00038782365,0.00023091144,0.0001504167,0.00018823192,0.000028467195],"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.000033573997,0.00045569765,0.00008278593,0.00085379626,0.00022052982,0.0000023931182,0.0060841786,0.03231918,0.000031787535,0.95465124,0.0047785053,0.00048635353],"study_design_scores_gemma":[0.0010460253,0.00015638216,0.00026458022,0.00013179997,0.000091754606,0.00003209448,0.0018548354,0.20060064,0.0001447923,0.7954382,0.00006229176,0.0001766197],"about_ca_topic_score_codex":0.000008559009,"about_ca_topic_score_gemma":0.0000016681289,"teacher_disagreement_score":0.35020253,"about_ca_system_score_codex":0.00005490164,"about_ca_system_score_gemma":0.00016865361,"threshold_uncertainty_score":0.9980705},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8103482,0.00017303554,0.18757908,0.00006891151,0.000059973852,0.00022493061,0.00018008675,0.00019749737,0.0011682701],"genre_scores_gemma":[0.78942025,0.00002927296,0.21031974,0.000005310832,0.000011750059,0.0000050678327,0.00018435466,0.000018432791,0.0000058149362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987193,0.000029950541,0.0006272584,0.00011979581,0.0003785506,0.00012516593],"domain_scores_gemma":[0.9976419,0.0014842486,0.00027736934,0.000120288736,0.00043597593,0.00004017097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018275711,0.00014309556,0.0003473928,0.00066614896,0.00007034922,0.000024035686,0.00013154959,0.000052113515,0.000017557477],"category_scores_gemma":[0.00010793924,0.00015772038,0.00008157658,0.0009426538,0.00024569905,0.00012419395,0.0000741621,0.00007784004,0.000010515465],"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.000010989248,0.00013606966,0.00048561158,0.0004680916,0.00019184458,0.0000020860477,0.000829945,0.6891827,0.0009298827,0.30668813,0.0002930012,0.0007816655],"study_design_scores_gemma":[0.00019103142,0.000046971487,0.008343282,0.00023250094,0.000042097763,0.000021208501,0.00010906889,0.58187836,0.0015783483,0.40744185,0.000009635445,0.0001056191],"about_ca_topic_score_codex":0.00002148662,"about_ca_topic_score_gemma":0.0000015197614,"teacher_disagreement_score":0.107304305,"about_ca_system_score_codex":0.000025445548,"about_ca_system_score_gemma":0.000059022797,"threshold_uncertainty_score":0.64316505},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3425715,0.00022772978,0.6497273,0.00041950823,0.0002122785,0.00034837585,0.0006726777,0.00010277492,0.005717894],"genre_scores_gemma":[0.5052271,0.000006116673,0.49403605,0.00003303222,0.0000503983,0.000021691927,0.000103285936,0.00002550979,0.0004967992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981989,0.00008216739,0.00082755537,0.000245233,0.0005023801,0.0001437663],"domain_scores_gemma":[0.9955632,0.0032989301,0.00022748427,0.00040481554,0.000423082,0.000082478466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000583593,0.00017558837,0.00060398725,0.000733947,0.000049416332,0.000054478416,0.00025186516,0.00007248392,0.00016739426],"category_scores_gemma":[0.0007324368,0.00016333465,0.0003385922,0.0013360963,0.00006461131,0.00010053262,0.00009242457,0.00009530959,0.0000026615312],"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.00002909951,0.00078682014,0.0004930455,0.0018013397,0.006289883,0.000010916957,0.014286203,0.14661586,0.0009065968,0.811999,0.008560341,0.008220858],"study_design_scores_gemma":[0.00024161366,0.00008292525,0.0010123731,0.00041809474,0.0025330845,0.0000030764281,0.0008980127,0.65172946,0.00029516546,0.34005743,0.0024136351,0.0003151254],"about_ca_topic_score_codex":0.00009345923,"about_ca_topic_score_gemma":0.000120859695,"teacher_disagreement_score":0.5051136,"about_ca_system_score_codex":0.000060451148,"about_ca_system_score_gemma":0.00011913803,"threshold_uncertainty_score":0.6660594},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018139752,0.00025949962,0.9792422,0.0008417608,0.00029589894,0.00029753233,0.00020739314,0.000114387134,0.00060156087],"genre_scores_gemma":[0.73333865,0.0000051759253,0.26622662,0.000017161236,0.00007849224,0.000020598765,0.00015456775,0.000013619488,0.00014510143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980258,0.00008374563,0.00084002374,0.00029878813,0.0005972503,0.00015440429],"domain_scores_gemma":[0.99711543,0.0016890577,0.0002779494,0.00029247382,0.0005343847,0.00009068029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048517674,0.00018928063,0.0002912617,0.00047067567,0.00022507255,0.0001591719,0.00036575497,0.000084822546,0.00012319782],"category_scores_gemma":[0.00020127407,0.00018371273,0.00012838401,0.00071267283,0.00020535043,0.0006359878,0.00012833938,0.00012890995,0.000030417832],"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.0000069453286,0.00023213247,0.000036527348,0.00023078134,0.00012978104,0.0000011011755,0.00089163386,0.0537846,0.0022703183,0.93969136,0.0005401388,0.002184687],"study_design_scores_gemma":[0.00031206603,0.00006327631,0.0006140198,0.000118384065,0.00005016527,0.00005135937,0.00003181293,0.76126575,0.0007837609,0.23590459,0.0005995215,0.00020527543],"about_ca_topic_score_codex":0.0000052862492,"about_ca_topic_score_gemma":0.0000021218173,"teacher_disagreement_score":0.71519893,"about_ca_system_score_codex":0.000035377554,"about_ca_system_score_gemma":0.0005522037,"threshold_uncertainty_score":0.7491588},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019101457,0.0000266275,0.9945019,0.0019550344,0.00014710762,0.0009617329,0.000025723644,0.0001796713,0.00029207536],"genre_scores_gemma":[0.006418218,0.0000019161796,0.9929704,0.00014280157,0.000011898034,0.00033046925,0.000028631293,0.00001287181,0.000082798775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987002,0.000038031856,0.0005272899,0.00032489505,0.00022963189,0.00017992617],"domain_scores_gemma":[0.99601114,0.0024750934,0.00019599895,0.0005331274,0.00072209636,0.00006256172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005660764,0.00016122512,0.0002699542,0.00044816575,0.00021038677,0.00017650801,0.00067721534,0.00005518494,0.000007750254],"category_scores_gemma":[0.0023438123,0.0001677377,0.000059722945,0.00086217356,0.00008727503,0.0002883646,0.00037277784,0.000056721452,0.0000019696804],"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.000008036979,0.00014909834,0.000019869629,0.00024395123,0.000049932863,1.5917445e-7,0.0008116388,0.0678088,0.00003300878,0.9273365,0.0013955745,0.0021434363],"study_design_scores_gemma":[0.00022700662,0.00005856652,0.00005536716,0.00007837107,0.000012921722,0.000003124161,0.000027192651,0.57922876,0.00019244502,0.4197801,0.00024534584,0.0000907811],"about_ca_topic_score_codex":0.000002508543,"about_ca_topic_score_gemma":0.0000017350451,"teacher_disagreement_score":0.51141995,"about_ca_system_score_codex":0.00004184854,"about_ca_system_score_gemma":0.00014311915,"threshold_uncertainty_score":0.6840145},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03448578,0.000044274268,0.96230155,0.00007265158,0.00010623277,0.0002684406,0.000016559647,0.0002474148,0.0024570965],"genre_scores_gemma":[0.47407112,0.0000017041918,0.52576995,0.000009241128,0.000015278007,0.00002916659,0.00006142184,0.0000084725725,0.000033632885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994509,0.000005256081,0.0002878946,0.000073476855,0.00010111006,0.000081335],"domain_scores_gemma":[0.9992136,0.00036691802,0.000057631543,0.00011579543,0.0002334299,0.000012659626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000079788486,0.000083334686,0.00013386522,0.00016002909,0.00007627762,0.000035786554,0.00009718043,0.000037038375,0.000010520452],"category_scores_gemma":[0.000077934244,0.00009174067,0.000056382618,0.00015857989,0.000033125118,0.000087815475,0.000016128293,0.000039757135,0.000004413054],"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.0000023672967,0.000038219598,0.0000048732677,0.00015610928,0.00004312897,2.7589099e-8,0.00013652844,0.8097514,0.00048220457,0.18588904,0.0011104794,0.0023856163],"study_design_scores_gemma":[0.00011827598,0.000011153943,0.00009697715,0.00010808,0.000021415757,0.0000010003338,0.00006805947,0.7449395,0.0026729645,0.25107813,0.00081966055,0.00006480829],"about_ca_topic_score_codex":8.19945e-7,"about_ca_topic_score_gemma":5.366029e-7,"teacher_disagreement_score":0.43958533,"about_ca_system_score_codex":0.000028256794,"about_ca_system_score_gemma":0.00003280187,"threshold_uncertainty_score":0.3741076},"labels":[],"label_agreement":null}]}