{"meta":{"query_hash":"9442ea1359f2","filters":{"venue":"Journal of Complexity"},"cohort_total":22,"direct_labels_cover":1,"predictions_cover":22,"exported":22,"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/9442ea1359f2","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Complexity"},"results":[{"id":"W1965823846","doi":"10.1016/j.jco.2011.05.001","title":"Bit-size estimates for triangular sets in positive dimension","year":2011,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Dimension (graph theory); Interpolation (computer graphics); Algebraic number; Context (archaeology); Degree (music); Discrete mathematics; Combinatorics; Mathematical analysis; Computer science","score_opus":0.04874806266807665,"score_gpt":0.2938994452722956,"score_spread":0.24515138260421895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965823846","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.6623614,0.00048299553,0.33592626,0.00009202888,0.00011452812,0.00019597873,0.000011291101,0.00010026661,0.0007152382],"genre_scores_gemma":[0.67229086,0.000013442748,0.32762942,0.000026181286,0.000022150845,0.000002400085,9.633317e-7,0.000011524671,0.0000030599178],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992963,0.000020139636,0.00036802585,0.000063142856,0.000109431574,0.000142945],"domain_scores_gemma":[0.9994704,0.0001628762,0.00011918236,0.00008611074,0.00010054799,0.000060874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020201966,0.000100062556,0.0003286374,0.00011060441,0.000021700285,0.000006424041,0.000117978605,0.000040126273,0.00004201784],"category_scores_gemma":[0.00014574229,0.00008287529,0.00013121811,0.00015622615,0.000038703532,0.00016267247,0.000017004786,0.00014623681,0.0000018364965],"study_design_candidate":"bench_or_experimental","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.008849894,0.0052165263,0.065881334,0.0013856862,0.004479321,0.0018115279,0.014845228,0.02479334,0.53880584,0.08125203,0.016664691,0.23601459],"study_design_scores_gemma":[0.001753024,0.00070306205,0.10566734,0.00023409392,0.0001459614,0.00009734697,0.00008612645,0.054788813,0.24902773,0.58654314,0.0005303042,0.00042303128],"about_ca_topic_score_codex":0.000011623346,"about_ca_topic_score_gemma":0.000007384282,"teacher_disagreement_score":0.50529116,"about_ca_system_score_codex":0.000074710086,"about_ca_system_score_gemma":0.0000071710506,"threshold_uncertainty_score":0.33795562},"labels":[],"label_agreement":null},{"id":"W1979768500","doi":"10.1016/j.jco.2013.12.005","title":"Efficient Monte Carlo simulation for integral functionals of Brownian motion","year":2013,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"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":"Brownian bridge; Monte Carlo method; Mathematics; Monte Carlo integration; Fractional Brownian motion; Brownian motion; Quasi-Monte Carlo method; Variance reduction; Applied mathematics; Statistical physics; Importance sampling; Mathematical optimization; Geometric Brownian motion; Rejection sampling; Diffusion process; Monte Carlo molecular modeling; Mathematical analysis; Computer science; Markov chain Monte Carlo; Physics; Statistics","score_opus":0.17771253951215948,"score_gpt":0.36820730495544696,"score_spread":0.19049476544328747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979768500","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.5809817,0.000008042366,0.41762376,0.0003498876,0.00011009172,0.00035755284,0.000006260667,0.000009702074,0.0005530478],"genre_scores_gemma":[0.8455065,4.2183373e-7,0.15419695,0.000036035162,0.00009973444,0.000010322287,0.0000016411808,0.000008483906,0.0001399003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853545,0.000064213775,0.00086781,0.00007122011,0.00035789423,0.000103378596],"domain_scores_gemma":[0.99725354,0.00053947634,0.0007833484,0.00011829805,0.0012391402,0.000066170505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006224132,0.000099714685,0.0003084704,0.00012154086,0.000050897328,0.000028724842,0.00010297987,0.000057263875,0.00061367464],"category_scores_gemma":[0.0012365079,0.00007010523,0.00022510708,0.00009846056,0.00005566711,0.00013689455,0.00001244451,0.00011538597,0.00000912213],"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.0002482891,0.0009909977,0.00012220426,0.00051029917,0.0001138059,2.7604952e-7,0.0012868337,0.008488132,0.0010425162,0.97582364,0.00420323,0.0071697566],"study_design_scores_gemma":[0.0005808172,0.00013861379,0.0011063141,0.000065847074,0.000026204832,0.000005947323,0.00016656733,0.5146558,0.00060616,0.4824666,0.00013011633,0.00005099315],"about_ca_topic_score_codex":0.000009272446,"about_ca_topic_score_gemma":0.000004274969,"teacher_disagreement_score":0.5061677,"about_ca_system_score_codex":0.00006280472,"about_ca_system_score_gemma":0.000027672046,"threshold_uncertainty_score":0.67193073},"labels":[],"label_agreement":null},{"id":"W2000687805","doi":"10.1016/j.jco.2011.10.011","title":"How do path generation methods affect the accuracy of quasi-Monte Carlo methods for problems in finance?","year":2011,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"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 Natural Science Foundation of China","keywords":"Quasi-Monte Carlo method; Monte Carlo method; Brownian bridge; Computer science; Quadratic equation; Dimension (graph theory); Mathematical optimization; Applied mathematics; Effective dimension; Mathematics; Function (biology); Monte Carlo molecular modeling; Brownian motion; Statistics; Mathematical analysis","score_opus":0.40505559940639285,"score_gpt":0.4674796336828049,"score_spread":0.06242403427641202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000687805","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.08613913,0.00017304481,0.91179216,0.0005378265,0.00014936425,0.0006696884,0.0000046823625,0.00000764657,0.0005264355],"genre_scores_gemma":[0.114460535,0.000025327388,0.88526887,0.00003387129,0.00008609954,0.000036528374,7.9766056e-7,0.000012699398,0.00007524883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774885,0.0009139119,0.00086218864,0.000109679015,0.00021465925,0.00015071251],"domain_scores_gemma":[0.9962319,0.001730761,0.0012575791,0.0002601981,0.00048069138,0.000038829327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00590547,0.00014557486,0.00052986573,0.00010687657,0.0000651312,0.00005497713,0.0002792617,0.00007933344,0.000051371833],"category_scores_gemma":[0.0047272122,0.00008361855,0.0002467614,0.00018660938,0.000087091816,0.00032486435,0.000029441295,0.00023779308,3.7042764e-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.00007532243,0.00057124946,0.000053643576,0.00041717707,0.00005989182,5.22962e-7,0.006596451,0.000004934548,0.0038589148,0.9409144,0.0009040176,0.046543483],"study_design_scores_gemma":[0.0005397511,0.00039260832,0.00039155316,0.00015179138,0.000054980417,0.00002337667,0.0003749633,0.06447594,0.017968317,0.91441584,0.0011106641,0.00010024132],"about_ca_topic_score_codex":0.000011845462,"about_ca_topic_score_gemma":0.000036557547,"teacher_disagreement_score":0.06447101,"about_ca_system_score_codex":0.000053076976,"about_ca_system_score_gemma":0.00006342963,"threshold_uncertainty_score":0.5659256},"labels":[],"label_agreement":null},{"id":"W2016263267","doi":"10.1016/j.jco.2013.04.002","title":"On blocked resolution IV designs containing clear two-factor interactions","year":2013,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"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 Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Mathematics; Resolution (logic); Block (permutation group theory); Homogeneous; Blocking (statistics); Factor (programming language); Algorithm; Combinatorics; Statistics; Computer science; Artificial intelligence","score_opus":0.45002715596824155,"score_gpt":0.49923935731208213,"score_spread":0.04921220134384058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016263267","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.90867347,0.000049374477,0.08038651,0.0010227232,0.0010141603,0.00020880338,0.0000050571566,0.000023050763,0.0086168535],"genre_scores_gemma":[0.82602507,0.0000017159497,0.17304718,0.00034882323,0.00019416721,0.0000028795666,3.4295365e-7,0.000012067726,0.00036774413],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958549,0.0011620782,0.001137314,0.00023516406,0.0013369697,0.00027357694],"domain_scores_gemma":[0.99466866,0.0028718417,0.0009842763,0.0003737553,0.00083282526,0.00026865507],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002791121,0.00016785479,0.0004543505,0.00041746852,0.0002426944,0.00037853295,0.0006923597,0.00005089399,0.005215305],"category_scores_gemma":[0.0035436628,0.000120661796,0.00027401897,0.00041785632,0.0001876186,0.00096500595,0.0001003827,0.00051710894,0.0007399796],"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.0076175104,0.0023370595,0.006014566,0.000012247241,0.00045639236,0.00015831571,0.0072538983,0.003935545,0.5436669,0.17305997,0.10486978,0.15061781],"study_design_scores_gemma":[0.004111462,0.0061289365,0.10994546,0.00019916416,0.00004980656,0.0005558069,0.0042690635,0.0687497,0.031127937,0.75902164,0.015136848,0.0007041672],"about_ca_topic_score_codex":0.000078158875,"about_ca_topic_score_gemma":0.000010517155,"teacher_disagreement_score":0.5859617,"about_ca_system_score_codex":0.00022907797,"about_ca_system_score_gemma":0.00009082887,"threshold_uncertainty_score":0.99569404},"labels":[],"label_agreement":null},{"id":"W2020427895","doi":"10.1016/j.jco.2004.01.002","title":"On the complexity of the discrete logarithm and Diffie–Hellman problems","year":2004,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Discrete logarithm; Logarithm; Mathematics; Function (biology); Cryptography; Computational complexity theory; Discrete mathematics; Decision problem; Security parameter; Theoretical computer science; Computer science; Algorithm; Public-key cryptography; Encryption","score_opus":0.05587024331900451,"score_gpt":0.2560173765409879,"score_spread":0.20014713322198338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020427895","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.78852516,0.00031955485,0.18811491,0.020936161,0.00045633188,0.00030130125,0.00005102657,0.000022414562,0.0012731475],"genre_scores_gemma":[0.985998,0.00003031842,0.0134534715,0.0004543272,0.000056397268,8.914648e-7,6.2809397e-7,0.00000408907,0.0000019109818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985258,0.00017637409,0.00043213513,0.0001592937,0.00051322364,0.0001931934],"domain_scores_gemma":[0.9984467,0.00017721826,0.0005173563,0.0006275059,0.00013862236,0.00009261172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073685875,0.0001394447,0.00026468816,0.00006957798,0.00029673698,0.000107165906,0.001428496,0.000041081857,0.000016256194],"category_scores_gemma":[0.0000861357,0.000069261885,0.00020534717,0.00035167034,0.001145789,0.00030206345,0.0004311622,0.00045075922,0.0000015501112],"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.000020206531,0.00014039646,0.00057866605,0.000017155182,0.000028846986,0.0000031078007,0.00064362644,0.000044922315,0.0001362639,0.9977133,0.00030441684,0.0003690451],"study_design_scores_gemma":[0.00054033834,0.00022258882,0.089991644,0.000094988216,0.000012018813,0.00009220235,0.00004288659,0.0005638499,0.00071124313,0.90668184,0.0009601164,0.00008627495],"about_ca_topic_score_codex":0.000076830736,"about_ca_topic_score_gemma":0.00014281625,"teacher_disagreement_score":0.19747281,"about_ca_system_score_codex":0.000026724303,"about_ca_system_score_gemma":0.00007000665,"threshold_uncertainty_score":0.42217073},"labels":[],"label_agreement":null},{"id":"W2033053263","doi":"10.1016/j.jco.2014.08.001","title":"Tractability using periodized generalized Faure sequences","year":2014,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Actua; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Space (punctuation); Dimension (graph theory); Order (exchange); Applied mathematics; Pure mathematics; Computer science","score_opus":0.23296706573928175,"score_gpt":0.3934327223143539,"score_spread":0.16046565657507214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033053263","genre_codex":"empirical","genre_gemma":"methods","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.8313553,0.000010279518,0.1651148,0.0005860572,0.0001114306,0.00009536544,0.0000019681424,0.00001909992,0.0027057303],"genre_scores_gemma":[0.48073065,0.0000015260438,0.51896363,0.000098295444,0.00015397472,8.5545037e-7,7.1727254e-7,0.0000071647446,0.00004316494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983478,0.00028562767,0.0007588404,0.000086234904,0.00039424346,0.00012725215],"domain_scores_gemma":[0.9984524,0.0003006323,0.0006166481,0.00017309387,0.0003595382,0.00009763276],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015503105,0.00011675635,0.0004295206,0.000063256244,0.00010010663,0.00006878882,0.00018362125,0.000062190506,0.001051352],"category_scores_gemma":[0.0016019549,0.00007853149,0.00019659699,0.00010032375,0.00012303043,0.00024076317,0.000017081482,0.00020641681,0.0000060291304],"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.00006148336,0.00021668707,0.00012701114,0.00013174523,0.000028610935,0.0000012052801,0.00069225865,0.0000032235246,0.0038018897,0.99361545,0.0004290674,0.0008913932],"study_design_scores_gemma":[0.0005520584,0.000077346594,0.00032003722,0.00005185146,0.000035212997,0.00009161261,0.00012215476,0.039329115,0.0023405242,0.9558193,0.0011688467,0.00009194881],"about_ca_topic_score_codex":0.000007233956,"about_ca_topic_score_gemma":0.000009937399,"teacher_disagreement_score":0.35384884,"about_ca_system_score_codex":0.000064793756,"about_ca_system_score_gemma":0.000056524517,"threshold_uncertainty_score":0.99986184},"labels":[],"label_agreement":null},{"id":"W2038559025","doi":"10.1016/j.jco.2014.02.006","title":"A variant of Atanassov’s method for<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si8.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-sequences and<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si9.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mstyle mathvariant=\"bold\"><mml:mi>e</mml:mi></mml:mstyle><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-sequences","year":2014,"lang":"lv","type":"article","venue":"Journal of Complexity","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Actua; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Sequence (biology); Class (philosophy); Star (game theory); Argument (complex analysis); Discrete mathematics; Algorithm; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.03161119002668558,"score_gpt":0.2762239273602845,"score_spread":0.24461273733359892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038559025","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.82888734,0.0042797476,0.016678564,0.0031683387,0.008665512,0.0005712649,0.003397289,0.0014160998,0.13293585],"genre_scores_gemma":[0.9372402,0.0045702597,0.03376088,0.004780769,0.007873715,0.004210149,0.00354873,0.003388189,0.00062709575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.95826364,0.003085209,0.011113272,0.0070825797,0.011373213,0.009082073],"domain_scores_gemma":[0.9624431,0.009605772,0.01385062,0.0067448257,0.0019208927,0.0054347934],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.013686578,0.0049656527,0.00281178,0.0028834294,0.0073316297,0.007313482,0.009696309,0.009632624,0.06949697],"category_scores_gemma":[0.011779483,0.00808933,0.009228971,0.004908449,0.007890548,0.0072600916,0.007028177,0.008635663,0.0050312057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006714655,0.0025493614,0.00003197455,0.0065412144,0.0073343394,0.0029101465,0.0053939954,0.0029994212,0.008175965,0.8241947,0.12906924,0.004084979],"study_design_scores_gemma":[0.00865902,0.008331598,0.00013596381,0.0072894692,0.008827897,0.01141989,0.0072802976,0.30042163,0.5985592,0.031753216,0.0100276135,0.007294227],"about_ca_topic_score_codex":0.006522063,"about_ca_topic_score_gemma":0.004329847,"teacher_disagreement_score":0.7924415,"about_ca_system_score_codex":0.00021425023,"about_ca_system_score_gemma":0.0065872595,"threshold_uncertainty_score":0.9990445},"labels":[],"label_agreement":null},{"id":"W2047549016","doi":"10.1016/j.jco.2011.02.001","title":"Existence and construction of shifted lattice rules with an arbitrary number of points and bounded weighted star discrepancy for general decreasing weights","year":2011,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Fonds Wetenschappelijk Onderzoek; Canada Research Chairs","keywords":"Mathematics; Bounded function; Lattice (music); Star (game theory); Combinatorics; Dimension (graph theory); Rank (graph theory); Discrete mathematics; Mathematical analysis","score_opus":0.11411068893092083,"score_gpt":0.3319629606959482,"score_spread":0.2178522717650274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047549016","genre_codex":"empirical","genre_gemma":"methods","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.983466,0.000019437717,0.0149241835,0.00005042622,0.000017054692,0.00018012882,0.000016579605,0.000007963607,0.0013181936],"genre_scores_gemma":[0.009646091,0.0000085501415,0.990283,0.0000113809465,0.000026448672,0.0000016967913,0.0000034791437,0.000009139814,0.0000102113545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894285,0.000086320935,0.0005869241,0.00009101909,0.00020433866,0.00008853104],"domain_scores_gemma":[0.99853545,0.00017216991,0.0007207605,0.00011035273,0.00037034284,0.00009093453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036225482,0.00010679702,0.00036592904,0.00006143519,0.000058420737,0.000019118543,0.000067803194,0.000046921872,0.0000928057],"category_scores_gemma":[0.00012991365,0.00007069856,0.000049450373,0.000058359783,0.0003038774,0.00037319525,0.000013297259,0.000090871385,1.5250264e-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.0004803577,0.00020815326,0.0011239988,0.000296239,0.00005492716,9.209713e-7,0.0010450461,3.6310507e-11,0.000017535374,0.9964335,0.0000011664753,0.00033818043],"study_design_scores_gemma":[0.00080919213,0.00032319775,0.0069573806,0.0002471697,0.00009552678,0.00025502298,0.00035577634,0.0032347054,0.004593532,0.98303974,0.000008139179,0.00008061248],"about_ca_topic_score_codex":0.00001964264,"about_ca_topic_score_gemma":0.000020479369,"teacher_disagreement_score":0.97535884,"about_ca_system_score_codex":0.000012707578,"about_ca_system_score_gemma":0.000043168166,"threshold_uncertainty_score":0.28830034},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"agree"},{"id":"W2059965246","doi":"10.1016/j.jco.2007.01.005","title":"Searching for extensible Korobov rules","year":2007,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Extensibility; Mathematics; Computer science; Programming language","score_opus":0.27784667807600805,"score_gpt":0.4389007483948378,"score_spread":0.16105407031882973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059965246","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.26482427,0.00001590745,0.720599,0.0005735369,0.00009739388,0.00015166837,0.0000022014676,0.000016380016,0.013719636],"genre_scores_gemma":[0.09288371,0.0000021508326,0.9063832,0.00012717527,0.0002434092,0.0000012076895,0.0000015060909,0.000011005714,0.000346612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887544,0.000030492052,0.00058973907,0.000056419827,0.00029065544,0.00015725165],"domain_scores_gemma":[0.9982235,0.00079093577,0.0003516055,0.000105808176,0.0004363807,0.00009176116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023118965,0.000076520344,0.00024054294,0.000105288986,0.00008390644,0.000039060957,0.00013358389,0.000038202044,0.00022098911],"category_scores_gemma":[0.0013753144,0.000054112144,0.00015238299,0.000064941894,0.00005018997,0.00015711198,0.000016316835,0.00015930088,0.00000793654],"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.00006120698,0.00012074207,0.000013067715,0.00008979816,0.000017436747,0.0000019164395,0.0002597945,2.508439e-7,0.0003833969,0.9927323,0.002411253,0.0039088423],"study_design_scores_gemma":[0.00036687902,0.00011269784,0.00034488193,0.000071966766,0.000016442824,0.000071679606,0.00018647774,0.002437592,0.0038153483,0.9880528,0.0044626496,0.000060608505],"about_ca_topic_score_codex":0.0000016333897,"about_ca_topic_score_gemma":0.000009779774,"teacher_disagreement_score":0.18578422,"about_ca_system_score_codex":0.000041802847,"about_ca_system_score_gemma":0.00004285355,"threshold_uncertainty_score":0.24196759},"labels":[],"label_agreement":null},{"id":"W2060306687","doi":"10.1016/j.jco.2007.11.004","title":"Adaptivity and computational complexity in the numerical solution of ODEs","year":2008,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Equidistant; Ode; Grid; Mathematics; Variable (mathematics); Mathematical optimization; Constant (computer programming); Function (biology); Applied mathematics; Algorithm; Computer science; Geometry; Mathematical analysis","score_opus":0.3844642780201271,"score_gpt":0.4089244228139247,"score_spread":0.0244601447937976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060306687","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.5638104,0.000031201587,0.43536386,0.0005369483,0.000044644188,0.0000789895,0.0000078999765,0.0000044023463,0.0001216496],"genre_scores_gemma":[0.65748376,0.000004925844,0.34243152,0.000031790147,0.000039460836,8.62281e-7,0.0000010795005,0.000004342392,0.0000022712009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997924,0.0006774469,0.0006570552,0.00008753257,0.0005153753,0.00013862613],"domain_scores_gemma":[0.99740386,0.0016297278,0.0005668091,0.00012746506,0.00021233015,0.000059823717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011004544,0.00010499322,0.00042625598,0.000104532104,0.00013002202,0.000010179098,0.00020922578,0.000041863415,0.000042550335],"category_scores_gemma":[0.0008157557,0.00007259593,0.0001267261,0.0002446652,0.0005464674,0.00014014899,0.000051192193,0.0003131321,9.330873e-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.00035297193,0.0022145817,0.028040225,0.00012183514,0.00012070024,0.000030369978,0.003663587,0.00016395233,0.00053694035,0.95795935,0.00056321634,0.006232276],"study_design_scores_gemma":[0.00039563313,0.0001300866,0.29555243,0.000021212369,0.000019746112,0.00018790163,0.00007059232,0.0068721888,0.00004833666,0.69661766,0.000031639764,0.000052561583],"about_ca_topic_score_codex":0.00007770789,"about_ca_topic_score_gemma":0.000032211174,"teacher_disagreement_score":0.2675122,"about_ca_system_score_codex":0.000044517394,"about_ca_system_score_gemma":0.000067985085,"threshold_uncertainty_score":0.2960376},"labels":[],"label_agreement":null},{"id":"W2107482418","doi":"10.1016/j.jco.2014.09.004","title":"A deterministic algorithm for inverting a polynomial matrix","year":2014,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Exponent; Matrix multiplication; Inverse; Univariate; Matrix (chemical analysis); Polynomial matrix; Invariant (physics); Combinatorics; Upper and lower bounds; Field (mathematics); Polynomial; Discrete mathematics; Algorithm; Matrix polynomial; Pure mathematics; Mathematical analysis; Statistics; Geometry","score_opus":0.03252501886350941,"score_gpt":0.2923396275986458,"score_spread":0.2598146087351364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107482418","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.051106498,0.0000297324,0.9469866,0.0007933901,0.00078681484,0.00007743492,0.0000021804813,0.000027602402,0.00018971629],"genre_scores_gemma":[0.47122315,6.596701e-7,0.5277023,0.000278149,0.00076062593,0.0000015562136,5.1173186e-7,0.0000054500774,0.000027649341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888194,0.00007814205,0.0004856537,0.0001299629,0.00021431949,0.00020998926],"domain_scores_gemma":[0.99875957,0.00030905582,0.0004716895,0.0001559398,0.00017326696,0.0001304908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006551783,0.000102696715,0.00025806142,0.00012149235,0.00012856489,0.00013206447,0.0006041975,0.0000338496,0.000004495345],"category_scores_gemma":[0.00018362404,0.00008783982,0.00017218673,0.00013267201,0.00004746042,0.00031840993,0.00010955521,0.000120191406,0.0000067305396],"study_design_candidate":"design_other","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.000026351048,0.0000635662,0.00005457995,0.00001757563,0.000023095705,0.0000062221284,0.00024455358,0.00003997945,0.0003756215,0.030793939,0.0016530438,0.96670145],"study_design_scores_gemma":[0.0009803602,0.000417869,0.002042851,0.000029039253,0.000012827021,0.00017977844,0.0000060687566,0.84233576,0.0004995154,0.1453803,0.007987075,0.00012855367],"about_ca_topic_score_codex":0.000007600839,"about_ca_topic_score_gemma":0.000003074833,"teacher_disagreement_score":0.96657294,"about_ca_system_score_codex":0.000044474367,"about_ca_system_score_gemma":0.00011172028,"threshold_uncertainty_score":0.3582004},"labels":[],"label_agreement":null},{"id":"W2146380740","doi":"10.1016/j.jco.2005.04.002","title":"The shifted number system for fast linear algebra on integer matrices","year":2005,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Mathematics; Integer matrix; Matrix multiplication; Dimension (graph theory); Unimodular matrix; Discrete mathematics; Matrix (chemical analysis); Multiplication (music); Polynomial; Computation; Integer points in convex polyhedra; Algebra over a field; Combinatorics; Integer programming; Algorithm; Pure mathematics; Symmetric matrix; Branch and price; Eigenvalues and eigenvectors; Computer science; Nonnegative matrix","score_opus":0.02981440093235344,"score_gpt":0.2839099586143147,"score_spread":0.25409555768196124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146380740","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.28749198,0.00016744042,0.69772077,0.011220631,0.0014588796,0.00021116155,0.000005529434,0.00007853303,0.0016450491],"genre_scores_gemma":[0.9444093,0.000005957521,0.05401525,0.00029446627,0.0011469669,0.0000029322407,5.876032e-7,0.0000070293445,0.00011749993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877375,0.000084108106,0.0004840432,0.00012518145,0.00032439464,0.00020851857],"domain_scores_gemma":[0.99855304,0.0004465822,0.00045691303,0.00021055946,0.0002353388,0.000097569464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067940296,0.000113918904,0.0002020679,0.00006158184,0.00027140012,0.00019843358,0.0008393648,0.000035113655,0.0000074899463],"category_scores_gemma":[0.000056754896,0.00006916034,0.00017853758,0.00019087689,0.00005126463,0.00036267986,0.00008809284,0.00018837796,0.00006153219],"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.00020288238,0.0001451562,0.00012467436,0.00003629034,0.0000844903,0.000008735936,0.0005474394,0.0005324288,0.000069410155,0.82369137,0.007628533,0.16692856],"study_design_scores_gemma":[0.0029533918,0.00086848956,0.011456958,0.0003458916,0.000053409985,0.0006289849,0.00024889535,0.6435671,0.0041616308,0.13951388,0.19565418,0.0005471875],"about_ca_topic_score_codex":0.000006049601,"about_ca_topic_score_gemma":0.000010018184,"teacher_disagreement_score":0.6841775,"about_ca_system_score_codex":0.00010506986,"about_ca_system_score_gemma":0.00008206564,"threshold_uncertainty_score":0.2820277},"labels":[],"label_agreement":null},{"id":"W2188896417","doi":"10.1016/j.jco.2015.07.002","title":"Stability of the elastic net estimator","year":2015,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Elastic net regularization; Mathematics; Lasso (programming language); Restricted isometry property; Estimator; Applied mathematics; Stability (learning theory); Regularization (linguistics); Compressed sensing; Term (time); Mathematical optimization; Algorithm; Regression; Computer science; Statistics; Artificial intelligence; Machine learning","score_opus":0.09754639743873322,"score_gpt":0.26980664294640816,"score_spread":0.17226024550767494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188896417","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.97932255,0.00018915866,0.01763694,0.00009036008,0.0004478417,0.000046499874,0.0000032283956,0.000044658307,0.0022187496],"genre_scores_gemma":[0.9889484,0.0000027007127,0.010958349,0.0000140175625,0.00006711866,1.7780513e-7,1.08962716e-7,0.0000068771556,0.0000022622914],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993669,0.000043020005,0.00027007028,0.000032263655,0.00020652151,0.00008126318],"domain_scores_gemma":[0.99936765,0.000048739268,0.00012633235,0.00018822559,0.00020684511,0.00006220303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002287356,0.000064080385,0.0001804388,0.000026103955,0.000018056384,0.000009365244,0.00021217165,0.000026531505,0.000016401324],"category_scores_gemma":[0.0001260579,0.00004201648,0.0000802025,0.000082685256,0.00009189248,0.00006408566,0.000037680922,0.0001643954,0.0000013284692],"study_design_candidate":"bench_or_experimental","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.0012326061,0.0017685967,0.2330528,0.00074146414,0.0015596285,0.00017222243,0.005893431,0.12644845,0.19637726,0.11005473,0.30309415,0.01960466],"study_design_scores_gemma":[0.0014339699,0.0004917246,0.19515827,0.00048629582,0.00015254428,0.00044562528,0.00024992923,0.14616475,0.36311233,0.27627736,0.0155932475,0.0004339342],"about_ca_topic_score_codex":0.000008547196,"about_ca_topic_score_gemma":0.000005315828,"teacher_disagreement_score":0.2875009,"about_ca_system_score_codex":0.000043362554,"about_ca_system_score_gemma":0.00004489846,"threshold_uncertainty_score":0.17133823},"labels":[],"label_agreement":null},{"id":"W2215141910","doi":"10.1016/j.jco.2015.11.009","title":"A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers","year":2015,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"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","keywords":"Mathematics; Bivariate analysis; Monte Carlo method; Algorithm; Polynomial; Degree (music); Modular design; Discrete mathematics; Computer science; Statistics","score_opus":0.05792931936759485,"score_gpt":0.2832520914927291,"score_spread":0.22532277212513427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2215141910","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.13424294,0.00037297187,0.8607022,0.001388765,0.0029679684,0.00019745064,0.000008965524,0.000031051626,0.00008765613],"genre_scores_gemma":[0.8558863,0.0000033832835,0.14214823,0.00026438935,0.0015817352,0.000006351767,6.769518e-7,0.000012632921,0.000096337695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998405,0.00011175159,0.00057097635,0.00017250142,0.00044093325,0.00029884942],"domain_scores_gemma":[0.99833673,0.00026591838,0.0005926081,0.00024525338,0.00034537053,0.0002141124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013457325,0.00015837901,0.0003304094,0.00012137693,0.00017844891,0.0004103971,0.0010237737,0.000050547995,0.0000022087054],"category_scores_gemma":[0.00011653638,0.00010508891,0.00021962437,0.00020277244,0.000087492444,0.0006800877,0.00021189783,0.000250457,0.00000458041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009888578,0.0008632544,0.0006491263,0.00013482959,0.0013062048,0.0002236978,0.023287594,0.08221752,0.0008379294,0.17262292,0.19373955,0.5231285],"study_design_scores_gemma":[0.0013191642,0.00034504308,0.0013450319,0.000043885077,0.00002370329,0.00022443154,0.00015807003,0.9823604,0.000073848925,0.0063522346,0.0075965393,0.00015759739],"about_ca_topic_score_codex":0.0002791438,"about_ca_topic_score_gemma":0.000008978288,"teacher_disagreement_score":0.9001429,"about_ca_system_score_codex":0.00016251343,"about_ca_system_score_gemma":0.00043149656,"threshold_uncertainty_score":0.42854014},"labels":[],"label_agreement":null},{"id":"W2508257146","doi":"10.1016/j.jco.2014.10.004","title":"On construction of blocked general minimum lower-order confounding <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si18.gif\" display=\"inline\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>−</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:msup><mml:mo>:</mml:mo><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msup></mml:math> designs with <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si19.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>N</mml:mi><mml:mo>/</mml:mo><mml:mn>4</mml:mn><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>≤</mml:mo><mml:mi>n</mml:mi><mml:mo>≤</mml:mo><mml:mn>5</mml:mn><mml:mi>N</mml:mi><mml:mo>/</mml:mo><mml:mn>16</mml:mn></mml:math>","year":2014,"lang":"lv","type":"article","venue":"Journal of Complexity","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Order (exchange); Algorithm; Combinatorics; Statistics","score_opus":0.034737542100621216,"score_gpt":0.285277251390713,"score_spread":0.25053970929009184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508257146","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.5910146,0.006268,0.007464156,0.0027037403,0.016478686,0.0004893424,0.005066238,0.0018353895,0.36867982],"genre_scores_gemma":[0.9281347,0.0062759556,0.023365298,0.0065775244,0.012656401,0.006697295,0.008478846,0.006559316,0.001254676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9348077,0.0055319997,0.014288248,0.01172028,0.018739723,0.014912011],"domain_scores_gemma":[0.9449865,0.013227199,0.018289097,0.011707518,0.0025538555,0.00923582],"candidate_categories":["metaresearch","metaepi_narrow","metaepi_broad","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.016307684,0.007322169,0.0033233145,0.005589905,0.011693506,0.012092945,0.016786221,0.015166331,0.4688826],"category_scores_gemma":[0.014685944,0.013764804,0.013935131,0.009734044,0.015134277,0.010843817,0.013169177,0.013402169,0.009781474],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.014069808,0.0026061723,0.00006314305,0.0038701089,0.009952321,0.0071696267,0.0046856604,0.008162143,0.010565727,0.51288617,0.4202269,0.005742216],"study_design_scores_gemma":[0.013213623,0.012433648,0.00018323056,0.0067073954,0.010616304,0.017451085,0.009049667,0.071615666,0.8229293,0.0037217396,0.02080331,0.011274993],"about_ca_topic_score_codex":0.010077901,"about_ca_topic_score_gemma":0.007042088,"teacher_disagreement_score":0.8123636,"about_ca_system_score_codex":0.0003001196,"about_ca_system_score_gemma":0.012091218,"threshold_uncertainty_score":0.9965141},"labels":[],"label_agreement":null},{"id":"W2784290514","doi":"10.1016/j.jco.2018.05.004","title":"The rank of random regular digraphs of constant degree","year":2018,"lang":"en","type":"preprint","venue":"Journal of Complexity","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Adjacency matrix; Mathematics; Rank (graph theory); Degree (music); Eigenvalues and eigenvectors; Infinity; Constant (computer programming); Graph; Integer (computer science); Regular graph; Simple (philosophy); Adjacency list; Random graph; Discrete mathematics; Simple graph; Directed graph; Line graph; Graph power; Computer science; Physics","score_opus":0.1607622231782364,"score_gpt":0.35309317971431053,"score_spread":0.19233095653607413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784290514","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.96966064,0.0011831553,0.019750658,0.00072161993,0.00047193147,0.0006343455,0.00015386233,0.000015146756,0.0074086124],"genre_scores_gemma":[0.9755253,0.00026952088,0.023957677,0.000013142302,0.00015001238,0.0000070225638,0.0000025130948,0.000018400775,0.000056416047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741894,0.00037129765,0.001448966,0.00012291581,0.0004794581,0.0001584145],"domain_scores_gemma":[0.99325097,0.0016035187,0.003268961,0.00081787945,0.0009816784,0.00007702101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030122574,0.0001937681,0.00090413104,0.00013053183,0.0001514109,0.000023767523,0.00091154675,0.00014479348,0.00007781929],"category_scores_gemma":[0.00062634936,0.00012108646,0.0007496961,0.0001498238,0.0014279257,0.000035602963,0.0002404472,0.0005538997,0.0000012133623],"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.000698518,0.00022391601,0.00017115005,0.00027461367,0.0004886913,0.000002056948,0.0003369849,0.0000032584305,0.0006008195,0.9935704,0.003130763,0.0004988138],"study_design_scores_gemma":[0.0012659106,0.000089585956,0.0007713221,0.00044149987,0.0002830042,0.000041319112,0.0001435455,0.00004144922,0.004539915,0.99061203,0.0016659793,0.00010441797],"about_ca_topic_score_codex":0.0000072999937,"about_ca_topic_score_gemma":0.000018768984,"teacher_disagreement_score":0.007352196,"about_ca_system_score_codex":0.000019620586,"about_ca_system_score_gemma":0.00018117028,"threshold_uncertainty_score":0.5261252},"labels":[],"label_agreement":null},{"id":"W2802142240","doi":"10.1016/j.jco.2018.06.002","title":"An upper bound on the smallest singular value of a square random matrix","year":2018,"lang":"en","type":"preprint","venue":"Journal of Complexity","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Science Foundation","keywords":"Upper and lower bounds; Combinatorics; Square (algebra); Mathematics; Singular value; Order (exchange); Random matrix; Zero (linguistics); Moment (physics); Unit (ring theory); Matrix (chemical analysis); Second moment of area; Unit square; Value (mathematics); Square matrix; Mathematical analysis; Statistics; Symmetric matrix; Physics; Geometry; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.1036367221087673,"score_gpt":0.3792191234928621,"score_spread":0.2755824013840948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802142240","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.9767638,0.00026428344,0.01855645,0.001742827,0.0003133133,0.0006437705,0.00006809675,0.000017400858,0.0016300665],"genre_scores_gemma":[0.9561118,0.00006430994,0.04265295,0.00008342789,0.0009673435,0.0000131136085,0.0000072008256,0.000038968763,0.000060910566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749666,0.00035437095,0.0011164107,0.0001944649,0.00064347294,0.00019460954],"domain_scores_gemma":[0.99520737,0.0009862527,0.002127756,0.00094203034,0.00062344933,0.00011315466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001988875,0.00026654857,0.0008810778,0.0001420611,0.00020918573,0.00014569562,0.000981605,0.00018567112,0.00038668723],"category_scores_gemma":[0.0003541906,0.00016280521,0.00061288266,0.000122015685,0.0002762848,0.000049491027,0.00017961876,0.00075754535,0.0000115453895],"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.002182505,0.0018356217,0.0007024899,0.0009770856,0.001023282,0.000017708424,0.0023462127,0.00035674733,0.0008003846,0.9745136,0.014943849,0.00030050386],"study_design_scores_gemma":[0.0021933962,0.0002684267,0.0019054011,0.0004986047,0.00034773958,0.000057293353,0.00018612978,0.0026300994,0.00035726963,0.9890764,0.002281911,0.00019732992],"about_ca_topic_score_codex":0.00004693066,"about_ca_topic_score_gemma":0.000012574541,"teacher_disagreement_score":0.0240965,"about_ca_system_score_codex":0.00007134519,"about_ca_system_score_gemma":0.0002113012,"threshold_uncertainty_score":0.6639004},"labels":[],"label_agreement":null},{"id":"W3046897419","doi":"10.1016/j.jco.2021.101574","title":"Fast amortized multi-point evaluation","year":2021,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Direction Générale de l’Armement","keywords":"Mathematics; Amortized analysis; Point (geometry); Combinatorics; Geometry; Computer science; Data structure; Programming language","score_opus":0.09116819641684006,"score_gpt":0.325743134216808,"score_spread":0.23457493779996796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046897419","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.2049814,0.00020760282,0.7912651,0.0021965443,0.00077948015,0.000053312146,8.255125e-7,0.00001974644,0.0004960275],"genre_scores_gemma":[0.8190744,0.000006037529,0.18037489,0.00028705018,0.00019428853,8.9632323e-7,0.0000016913151,0.0000033946428,0.00005738453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986335,0.00021950633,0.00043761835,0.00011186948,0.00046214805,0.00013535873],"domain_scores_gemma":[0.9985018,0.00007007628,0.00037454744,0.00020637613,0.0007447473,0.00010249954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008767974,0.0000808637,0.00020143032,0.00007868863,0.000081663595,0.00012521888,0.00036543395,0.00002605143,0.000094438125],"category_scores_gemma":[0.00020362157,0.00006994491,0.00014035191,0.000265562,0.000034368175,0.00049885415,0.00013507684,0.00015173157,0.000019362267],"study_design_candidate":"design_other","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.000079300065,0.0010367269,0.0011916449,0.00003717733,0.000192861,0.00022851843,0.003436738,0.0024794217,0.0170766,0.12418752,0.004252611,0.8458009],"study_design_scores_gemma":[0.0035573887,0.00016607674,0.12152344,0.00007183198,0.00004446588,0.00073934754,0.00012752066,0.62797457,0.013558795,0.23010777,0.0018727276,0.00025604657],"about_ca_topic_score_codex":0.00000660976,"about_ca_topic_score_gemma":0.000017214566,"teacher_disagreement_score":0.8455448,"about_ca_system_score_codex":0.00008395632,"about_ca_system_score_gemma":0.00036810577,"threshold_uncertainty_score":0.28522706},"labels":[],"label_agreement":null},{"id":"W3082224601","doi":"10.1016/j.jco.2021.101557","title":"Homotopy techniques for solving sparse column support determinantal polynomial systems","year":2021,"lang":"en","type":"preprint","venue":"Journal of Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; European Commission","keywords":"Combinatorics; Mathematics; Polynomial; Algebraic number; Invariant (physics); Mathematical analysis; Mathematical physics","score_opus":0.05357499197331212,"score_gpt":0.2973128765286256,"score_spread":0.24373788455531348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082224601","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.28742993,0.00039026685,0.7048401,0.00050277845,0.0058084773,0.0006415331,0.000044595978,0.00010873489,0.00023355651],"genre_scores_gemma":[0.7944109,0.000033826287,0.2033204,0.00012984047,0.0019238638,0.000029410761,0.000019994932,0.000025155678,0.00010661781],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971629,0.00013783868,0.0012829879,0.00045310194,0.0005431976,0.0004200187],"domain_scores_gemma":[0.9965609,0.0002176815,0.0017359834,0.0005619694,0.000693631,0.00022987356],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001125436,0.00034642647,0.0009866637,0.00029050873,0.0002047225,0.0010529988,0.0017230657,0.0002575361,0.000013385182],"category_scores_gemma":[0.0001137113,0.00033892225,0.00065219833,0.00015446768,0.00010905035,0.00056267984,0.0013349965,0.00072015857,0.000002370148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001667347,0.0049825534,0.004739898,0.008572236,0.0029905324,0.005298648,0.013678691,0.0030039542,0.029317342,0.06986955,0.17686364,0.6790156],"study_design_scores_gemma":[0.0063749603,0.005502937,0.022695515,0.0066034505,0.00072287366,0.013376635,0.0007008806,0.6950616,0.06597428,0.102610335,0.07510431,0.0052721747],"about_ca_topic_score_codex":0.00012411222,"about_ca_topic_score_gemma":0.00003591172,"teacher_disagreement_score":0.69205767,"about_ca_system_score_codex":0.00028403325,"about_ca_system_score_gemma":0.0014346199,"threshold_uncertainty_score":0.999984},"labels":[],"label_agreement":null},{"id":"W4311761036","doi":"10.1016/j.jco.2022.101724","title":"The area of empty axis-parallel boxes amidst 2-dimensional lattice points","year":2022,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Mathematics; Lattice (music); Infimum and supremum; Conjecture; Square lattice; Combinatorics; Quadratic equation; Discrete mathematics; Geometry; Condensed matter physics; Physics; Ising model","score_opus":0.1286115804029658,"score_gpt":0.3366526722535477,"score_spread":0.20804109185058192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311761036","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.9630901,0.0001323974,0.01615012,0.006813909,0.00037596622,0.00029698448,0.00002586775,0.00002946953,0.013085176],"genre_scores_gemma":[0.6709846,0.000014008783,0.32645148,0.00056862546,0.00016660472,0.000015622216,0.000007572861,0.000029855952,0.0017616211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979007,0.00023814708,0.0008426281,0.00007483181,0.00080962275,0.00013402407],"domain_scores_gemma":[0.99753857,0.00096443726,0.0008528754,0.00021759223,0.0003591323,0.00006739984],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017143768,0.0001039174,0.0003143764,0.00006378029,0.00032334312,0.00002892667,0.0003316991,0.000025074683,0.0014495394],"category_scores_gemma":[0.0008728426,0.00006367375,0.00019634177,0.00014119454,0.00014315583,0.000113167654,0.00011426316,0.00035490253,0.0000068760496],"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.00013914073,0.00035561656,0.00005740545,0.000043652293,0.000057018842,0.0000030614115,0.0004073355,0.000010358564,0.00012347018,0.9832864,0.015259951,0.00025662355],"study_design_scores_gemma":[0.00045541453,0.00019546623,0.0009085548,0.000032649717,0.00003244922,0.00014291963,0.0005325309,0.007639565,0.00033524906,0.9845415,0.0051116026,0.00007210898],"about_ca_topic_score_codex":0.0000047243952,"about_ca_topic_score_gemma":0.000011004991,"teacher_disagreement_score":0.31030133,"about_ca_system_score_codex":0.000081926,"about_ca_system_score_gemma":0.00008178453,"threshold_uncertainty_score":0.99946326},"labels":[],"label_agreement":null},{"id":"W4313478762","doi":"10.1016/j.jco.2022.101726","title":"On the cardinality of lower sets and universal discretization","year":2023,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"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":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Cardinality (data modeling); Linear subspace; Combinatorics; Discretization; Trigonometric polynomial; Discrete mathematics; Norm (philosophy); Trigonometry; Set (abstract data type); Upper and lower bounds; Pure mathematics; Mathematical analysis","score_opus":0.1493214577826029,"score_gpt":0.3490802865863111,"score_spread":0.19975882880370818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313478762","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.99123025,0.0000074313316,0.0029087234,0.001685998,0.00013153229,0.00006981838,0.000014684202,0.000008417797,0.0039431644],"genre_scores_gemma":[0.99834293,0.0000101029145,0.0013975878,0.000030390782,0.000047071662,3.3013282e-7,6.029143e-7,0.0000049398427,0.00016601573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993094,0.000108365835,0.00027389746,0.000040112893,0.00020038696,0.00006783043],"domain_scores_gemma":[0.9983913,0.0011040961,0.00023547743,0.0001278751,0.00010307451,0.00003818433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008685199,0.00005368332,0.00019778949,0.000050964787,0.0000628463,0.00001258395,0.000081746985,0.000025103047,0.00024877515],"category_scores_gemma":[0.0006358423,0.000030422176,0.00008320885,0.0001389803,0.00009653827,0.000043775548,0.000031181233,0.0000990835,0.0000055906453],"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.00007261889,0.00005554168,0.00019489625,0.000056320554,0.000045060595,0.000003844939,0.000237507,0.000005466689,0.00010098245,0.984807,0.014282754,0.0001380105],"study_design_scores_gemma":[0.00018466463,0.00015384091,0.0044336915,0.00007117749,0.0000423661,0.000017173461,0.0002033292,0.0006017694,0.00019394518,0.99311626,0.0009417141,0.00004006166],"about_ca_topic_score_codex":0.000004867863,"about_ca_topic_score_gemma":0.0000028580127,"teacher_disagreement_score":0.013341039,"about_ca_system_score_codex":0.0000146247185,"about_ca_system_score_gemma":0.000020526122,"threshold_uncertainty_score":0.27239135},"labels":[],"label_agreement":null},{"id":"W4407776334","doi":"10.1016/j.jco.2025.101933","title":"Optimal approximation of infinite-dimensional holomorphic functions II: Recovery from i.i.d. pointwise samples","year":2025,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Numerical methods in inverse problems","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pointwise; Mathematics; Holomorphic function; Applied mathematics; Pure mathematics; Mathematical analysis","score_opus":0.15116606869829816,"score_gpt":0.3555206536288033,"score_spread":0.20435458493050515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407776334","genre_codex":"empirical","genre_gemma":"methods","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.66332173,0.00012815358,0.3332487,0.0007599508,0.00079476286,0.000149231,0.00009322659,0.000025799802,0.0014784095],"genre_scores_gemma":[0.11328226,0.000011708447,0.8862302,0.00015655808,0.00011979893,0.0000036309707,0.000010017438,0.000014212135,0.0001716604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976898,0.00035475474,0.0011624943,0.00015908165,0.00045559584,0.00017829581],"domain_scores_gemma":[0.9954775,0.0024661415,0.0011072403,0.00031559926,0.00054600206,0.00008754125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012348002,0.00016933244,0.0006281067,0.000295626,0.00015033483,0.00002322543,0.00028423016,0.00011333577,0.00063805573],"category_scores_gemma":[0.002966474,0.00014627886,0.000294962,0.00039078525,0.000260107,0.0002345933,0.00019104507,0.0004614347,0.000007678456],"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.0051817033,0.0067474204,0.009964224,0.0011774674,0.0044177566,0.000058371414,0.002270006,0.0078863185,0.06373032,0.7638854,0.09766601,0.03701505],"study_design_scores_gemma":[0.0009109907,0.00028714663,0.0032038235,0.0002876185,0.00019997457,0.00002622494,0.00013423388,0.0022382438,0.0033848747,0.98716784,0.0020264103,0.00013264145],"about_ca_topic_score_codex":0.000055130804,"about_ca_topic_score_gemma":0.0000075820312,"teacher_disagreement_score":0.55298144,"about_ca_system_score_codex":0.00010852042,"about_ca_system_score_gemma":0.00018785859,"threshold_uncertainty_score":0.6986263},"labels":[],"label_agreement":null}]}