{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06110478,0.0018637689,0.9152585,0.0020948583,0.00030171324,0.00013817484,0.000874839,0.0009923062,0.017371086],"genre_scores_gemma":[0.6725182,0.0026166523,0.30958855,0.0008139797,0.00086907676,0.0006750772,0.0017567591,0.00088177156,0.010280041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579227,0.0010097156,0.00026367386,0.00041188733,0.0020120493,0.00051041495],"domain_scores_gemma":[0.9536567,0.035013877,0.0016047101,0.004982544,0.0039303834,0.0008118977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039623813,0.0015215563,0.0013533146,0.003471217,0.0010464082,0.003590126,0.002911723,0.001840249,0.011984163],"category_scores_gemma":[0.05273023,0.0008458646,0.00087748875,0.0027355407,0.0023489392,0.010398196,0.00506026,0.0032756515,0.0018254442],"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.0014207724,0.0001606561,0.0037913704,0.0006799861,0.000104265324,0.00025366142,0.0005741187,0.19957004,0.015762908,0.61943895,0.016202668,0.14204054],"study_design_scores_gemma":[0.000038680744,0.00010649786,0.00058247725,0.00015360692,0.00003717284,0.00018175876,0.0001311521,0.6051884,0.0062788483,0.38358176,0.003664083,0.0000554556],"about_ca_topic_score_codex":0.0011015555,"about_ca_topic_score_gemma":0.0014934245,"teacher_disagreement_score":0.011984163,"about_ca_system_score_codex":0.0019967754,"about_ca_system_score_gemma":0.0013265307,"threshold_uncertainty_score":0.040091038},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037736025,0.00026834256,0.9579792,0.0002536815,0.000050555176,0.000050814557,0.00005041089,0.00030927302,0.0033017749],"genre_scores_gemma":[0.6622577,0.00035595146,0.33264023,0.00015707008,0.00009039555,0.00022463917,0.00027513487,0.00032282583,0.0036760294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986407,0.00055435393,0.0000727808,0.000113345595,0.0004589387,0.00015990801],"domain_scores_gemma":[0.9923267,0.005726669,0.00028098238,0.00073587865,0.000608936,0.00032080992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035020437,0.0006525012,0.0016794301,0.0012633132,0.0010179582,0.0018873699,0.0018801615,0.0017033125,0.0033703088],"category_scores_gemma":[0.014978382,0.00087174226,0.0009411622,0.0011464091,0.0014647061,0.0021660083,0.0020659026,0.001892677,0.0004943464],"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.0001468016,0.00008883628,0.0010139864,0.00006285165,0.00005386692,0.00007249817,0.00007520048,0.8343758,0.0016264293,0.1469596,0.0006643597,0.014859723],"study_design_scores_gemma":[0.0000081844555,0.0000037885034,0.000035729965,0.0000029979994,0.0000030438898,0.0000070007563,0.000002410992,0.982765,0.00018289649,0.016848076,0.00013808293,0.0000027715885],"about_ca_topic_score_codex":0.005947668,"about_ca_topic_score_gemma":0.0060796137,"teacher_disagreement_score":0.005947668,"about_ca_system_score_codex":0.0017092053,"about_ca_system_score_gemma":0.0021180816,"threshold_uncertainty_score":0.018520772},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26006174,0.0045990334,0.70418286,0.014439629,0.0014601173,0.00009293403,0.00038037,0.0009030041,0.013880344],"genre_scores_gemma":[0.89589244,0.0018144822,0.09762634,0.0009939091,0.000449973,0.00008494499,0.00023066561,0.000706395,0.0022008903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953311,0.0031679808,0.00015368,0.0003484458,0.0007463672,0.00025248088],"domain_scores_gemma":[0.8306412,0.1483737,0.005415956,0.007424171,0.00695737,0.0011877053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016830098,0.00076092075,0.001112671,0.0011709817,0.0009678773,0.0028358044,0.0023190284,0.005026582,0.0045871725],"category_scores_gemma":[0.20800771,0.0008579183,0.00078634004,0.0011082788,0.002780958,0.007565768,0.0016920536,0.0037450893,0.0006412581],"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.00043041786,0.00019763311,0.016571252,0.0004497201,0.00028864635,0.00012897237,0.0004483793,0.5985477,0.0026213576,0.32712716,0.0057538464,0.047434933],"study_design_scores_gemma":[0.000044415865,0.00003856011,0.0016263406,0.000067518646,0.000032572723,0.000036799367,0.000050152536,0.91494507,0.0013601141,0.080810525,0.00094980566,0.000038128794],"about_ca_topic_score_codex":0.004978895,"about_ca_topic_score_gemma":0.003445061,"teacher_disagreement_score":0.016830098,"about_ca_system_score_codex":0.0012978103,"about_ca_system_score_gemma":0.001603699,"threshold_uncertainty_score":0.08900714},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01172289,0.0002504018,0.98534226,0.00006378298,0.00005552077,0.0008339557,0.0001352839,0.00018313687,0.0014126279],"genre_scores_gemma":[0.117293805,0.00053416245,0.8721045,0.00026014808,0.00008445457,0.0066377055,0.00040600405,0.00022414897,0.002455038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.88046014,0.10668192,0.0019503378,0.004861889,0.004576256,0.0014694695],"domain_scores_gemma":[0.6718651,0.29999578,0.008929324,0.014644501,0.0036790455,0.000886229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.07819735,0.004654087,0.0047890386,0.0020014313,0.00070658675,0.0021690147,0.0033419477,0.0024992279,0.009152391],"category_scores_gemma":[0.17741238,0.0026256596,0.0029637644,0.0017551432,0.0035735166,0.0032317918,0.0033131076,0.0036365965,0.0015072462],"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.022938017,0.001819021,0.0025069057,0.005598255,0.0028085762,0.00024865867,0.0013117313,0.31320462,0.024775334,0.31180313,0.0032885156,0.30969724],"study_design_scores_gemma":[0.004986808,0.007976315,0.00304235,0.0008716295,0.0013484778,0.00010919529,0.00016807775,0.5497004,0.0147653995,0.40542847,0.011345712,0.00025718322],"about_ca_topic_score_codex":0.0011361771,"about_ca_topic_score_gemma":0.0011645178,"teacher_disagreement_score":0.07819735,"about_ca_system_score_codex":0.0019886256,"about_ca_system_score_gemma":0.0033832542,"threshold_uncertainty_score":0.41355205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33985788,0.022799987,0.3197819,0.092516,0.0023183185,0.0003398084,0.0023686776,0.0004506872,0.21956679],"genre_scores_gemma":[0.9308529,0.0074735023,0.03665642,0.0018107663,0.003546727,0.00033865316,0.0012126901,0.00023142678,0.017876899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99132115,0.0029464297,0.00044109725,0.0008964174,0.0033763526,0.0010184541],"domain_scores_gemma":[0.90393656,0.08378069,0.003224745,0.00454902,0.002776245,0.0017327083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008008231,0.0013871493,0.003087698,0.0033085963,0.0033765484,0.010199234,0.0037123903,0.0035488296,0.010144858],"category_scores_gemma":[0.05480824,0.001355312,0.0019976916,0.0045881,0.008420973,0.0321498,0.006897189,0.010767342,0.00095811195],"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.00027707533,0.00012543467,0.00093840796,0.00016697396,0.000043090135,0.0001025211,0.0003255449,0.01705505,0.0002440608,0.9618513,0.006955036,0.011915521],"study_design_scores_gemma":[0.000039898303,0.000015503505,0.0002679311,0.000027988477,0.000014187266,0.00006538527,0.0000660285,0.036969475,0.00013488195,0.96051866,0.0018589734,0.000021170235],"about_ca_topic_score_codex":0.0028622837,"about_ca_topic_score_gemma":0.0018085876,"teacher_disagreement_score":0.010199234,"about_ca_system_score_codex":0.0073323827,"about_ca_system_score_gemma":0.0039973212,"threshold_uncertainty_score":0.053200424},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13448384,0.00067129673,0.8311749,0.00081348664,0.000121531106,0.00005342574,0.00025468657,0.0003384495,0.032088466],"genre_scores_gemma":[0.89897805,0.0008811496,0.08485763,0.00024123373,0.0002291635,0.00013250817,0.00035168743,0.00027486507,0.014053679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908066,0.00030565387,0.000055091597,0.00020136684,0.00023176562,0.00012542264],"domain_scores_gemma":[0.9951208,0.0032160513,0.00046298356,0.00065836246,0.00029869753,0.0002430314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014645667,0.0008695807,0.0011579699,0.0018606758,0.0010271785,0.0025864916,0.0012020183,0.0013780259,0.008754165],"category_scores_gemma":[0.01024585,0.00058891065,0.0014458665,0.001582751,0.0021891752,0.006305679,0.0025324468,0.0026411405,0.0006749922],"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.00007855074,0.000016994223,0.00022372264,0.00004790212,0.000020431435,0.000056267123,0.00008029459,0.03485494,0.0010892636,0.9527821,0.0006765191,0.010073009],"study_design_scores_gemma":[0.000010074453,0.000028378941,0.0001225064,0.000014330406,0.0000088762545,0.000049570514,0.00001630883,0.10336902,0.0005062895,0.89477044,0.0010929492,0.000011285716],"about_ca_topic_score_codex":0.0013346068,"about_ca_topic_score_gemma":0.0010538222,"teacher_disagreement_score":0.008754165,"about_ca_system_score_codex":0.0015090031,"about_ca_system_score_gemma":0.0006448181,"threshold_uncertainty_score":0.02928561},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013086696,0.00019557607,0.95615536,0.0002427178,0.0007692656,0.00016777749,0.0018944271,0.025735158,0.013531122],"genre_scores_gemma":[0.022471715,0.00029281894,0.87900007,0.00032884488,0.00022399472,0.00038165084,0.0063968706,0.024336828,0.06656717],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708503,0.00035543292,0.00032606837,0.0008982908,0.0009919013,0.0003433047],"domain_scores_gemma":[0.9965965,0.0007280023,0.00012082979,0.00114344,0.0012637561,0.00014751879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019038372,0.0029745887,0.0015167422,0.0035117103,0.0020338306,0.004504553,0.004574622,0.0024429765,0.12022117],"category_scores_gemma":[0.00837433,0.0015865512,0.004420753,0.0023807928,0.0013996649,0.0047874707,0.0041120965,0.0038840042,0.08290278],"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.0003775478,0.00021051441,0.0011187857,0.0010020618,0.00021114977,0.00050314225,0.00101163,0.005558898,0.017888539,0.102518566,0.21736312,0.65223604],"study_design_scores_gemma":[0.00016525641,0.00006900426,0.0007238715,0.00024327515,0.00010401044,0.0008245936,0.00038772146,0.054207206,0.033102702,0.08902186,0.82098615,0.00016444488],"about_ca_topic_score_codex":0.00785364,"about_ca_topic_score_gemma":0.012648896,"teacher_disagreement_score":0.12022117,"about_ca_system_score_codex":0.0012817956,"about_ca_system_score_gemma":0.0026799212,"threshold_uncertainty_score":0.4021799},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34010908,0.00036010408,0.63572073,0.0004632912,0.0002658468,0.000114841314,0.00016062187,0.0003529005,0.02245269],"genre_scores_gemma":[0.52578586,0.00035558277,0.46001044,0.00027692658,0.00010978473,0.00023450691,0.000319048,0.000392496,0.012515352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988059,0.00026421796,0.000089100504,0.00020065326,0.00047179856,0.00016842547],"domain_scores_gemma":[0.99618125,0.0012800681,0.00034351944,0.00078384334,0.0007142684,0.0006970038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018643129,0.0005628357,0.0012918414,0.0016861479,0.0016874423,0.002678502,0.002528474,0.0018787982,0.0033461668],"category_scores_gemma":[0.0067854505,0.0012385348,0.0013907944,0.001347884,0.0027996153,0.0031647978,0.0029020952,0.0029843934,0.0009353394],"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.000050022347,0.00004719055,0.00038629674,0.000047332116,0.000010966341,0.00007776585,0.00012684973,0.0036640556,0.0041429936,0.9837749,0.00054066116,0.007131036],"study_design_scores_gemma":[0.000053196793,0.000050311897,0.00018027317,0.000025501447,0.000016200667,0.0001764345,0.0000895568,0.06371333,0.0041745026,0.9288488,0.0026342361,0.000037723217],"about_ca_topic_score_codex":0.0006081527,"about_ca_topic_score_gemma":0.000911504,"teacher_disagreement_score":0.0033461668,"about_ca_system_score_codex":0.0008870964,"about_ca_system_score_gemma":0.0010289307,"threshold_uncertainty_score":0.01119405},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66296744,0.0012754581,0.30761796,0.0005415274,0.00025202727,0.00013025469,0.0004133568,0.0008012386,0.02600071],"genre_scores_gemma":[0.818869,0.0007268522,0.17511474,0.00015092317,0.00006727216,0.000096249496,0.0007831333,0.00024783317,0.0039440524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923396,0.00018888125,0.00010844997,0.00016248069,0.00019996143,0.00010634637],"domain_scores_gemma":[0.9952495,0.0027716102,0.00035451443,0.001037686,0.00036740318,0.00021921759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015913919,0.00064915384,0.0014454962,0.0024916336,0.0011608353,0.0020238208,0.0015516904,0.0011739441,0.0072143152],"category_scores_gemma":[0.012701606,0.0009866275,0.0015461626,0.0018139766,0.0012787161,0.0051343716,0.0027345796,0.0022054454,0.0008893264],"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.00046512482,0.00028260658,0.012538528,0.0006598688,0.00018721152,0.0014837338,0.0012807813,0.04372336,0.007076257,0.6302007,0.0048384173,0.29726335],"study_design_scores_gemma":[0.00006834605,0.00012259203,0.000987108,0.00017987014,0.00011205251,0.0004458066,0.0008472765,0.15959343,0.0031410775,0.82902163,0.0054238103,0.00005702293],"about_ca_topic_score_codex":0.00028157516,"about_ca_topic_score_gemma":0.00057443156,"teacher_disagreement_score":0.0072143152,"about_ca_system_score_codex":0.00027258386,"about_ca_system_score_gemma":0.0004146421,"threshold_uncertainty_score":0.024134278},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1991712,0.0022466728,0.7836766,0.0025176494,0.00038177666,0.00008329393,0.000059394857,0.00018727289,0.011676071],"genre_scores_gemma":[0.93516314,0.0011159959,0.05822206,0.00023779523,0.00033259293,0.00014190371,0.000063176194,0.0001559367,0.0045673996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981285,0.0009235577,0.0001298888,0.00018939863,0.0004976588,0.00013105293],"domain_scores_gemma":[0.9749467,0.020834459,0.0012234191,0.0014837788,0.0010579897,0.0004536537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040503945,0.0007436345,0.0009182308,0.0010582464,0.0007737804,0.0023314618,0.0009863789,0.0014667503,0.001724171],"category_scores_gemma":[0.03587418,0.0005462478,0.0010554101,0.00069741305,0.004263355,0.004089528,0.004035047,0.0028909994,0.00020800167],"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.00029698372,0.00008539056,0.0038387352,0.0002123905,0.00009209564,0.0002646841,0.00043389434,0.46837005,0.0039688624,0.49491304,0.00094654446,0.026577445],"study_design_scores_gemma":[0.00001807908,0.00003529747,0.0005065969,0.000020376561,0.000015003085,0.000047692894,0.000033107495,0.83439845,0.000756125,0.16352236,0.00062711124,0.00001980498],"about_ca_topic_score_codex":0.0013849061,"about_ca_topic_score_gemma":0.0010868959,"teacher_disagreement_score":0.0040503945,"about_ca_system_score_codex":0.0007471862,"about_ca_system_score_gemma":0.0008485383,"threshold_uncertainty_score":0.021420777},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022215553,0.000196839,0.9640355,0.00057381176,0.00018772678,0.00022350668,0.00037085137,0.0044486127,0.007747572],"genre_scores_gemma":[0.2393091,0.00017690787,0.7451678,0.00035471155,0.0001411268,0.00039307593,0.0011578264,0.00042475038,0.012874692],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785787,0.00021830453,0.0001510746,0.0006973198,0.0007453597,0.00033006634],"domain_scores_gemma":[0.9971449,0.001106386,0.00016595455,0.0009657227,0.00045536665,0.00016165234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007942534,0.001590131,0.001205384,0.00078356947,0.0016015315,0.0020822168,0.0023839115,0.001972993,0.013687618],"category_scores_gemma":[0.004005717,0.00091151183,0.0016584584,0.0013279275,0.0012529327,0.0032209512,0.0036641,0.0026319092,0.004535016],"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.001154052,0.00063731225,0.0021530222,0.00061043375,0.00022655344,0.00037485058,0.00036870156,0.042687044,0.045869507,0.120892614,0.025480427,0.7595455],"study_design_scores_gemma":[0.0009803532,0.00061961496,0.0015182734,0.000095932104,0.0002733236,0.0010610726,0.0002707322,0.6283372,0.056776494,0.2844313,0.025440406,0.00019525985],"about_ca_topic_score_codex":0.0030064846,"about_ca_topic_score_gemma":0.0076300576,"teacher_disagreement_score":0.013687618,"about_ca_system_score_codex":0.0014457302,"about_ca_system_score_gemma":0.0040754974,"threshold_uncertainty_score":0.0457896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13382865,0.0011367004,0.816463,0.0018126229,0.0015741246,0.00016797043,0.00044053714,0.0010391735,0.04353723],"genre_scores_gemma":[0.737608,0.0008278648,0.22960648,0.0008090179,0.0010962004,0.0002616686,0.0007348615,0.00047263052,0.028583251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898595,0.00025580425,0.00008020112,0.00022173044,0.00029502984,0.0001613474],"domain_scores_gemma":[0.99864453,0.00042480728,0.00012831764,0.00040599718,0.00026041295,0.00013602289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001035033,0.0006645506,0.00086370046,0.0011458511,0.0015511431,0.0028687608,0.0011760656,0.00087194203,0.012404096],"category_scores_gemma":[0.0043519624,0.0004156146,0.00063852384,0.001289803,0.0019500091,0.0053969235,0.0021229095,0.002337748,0.0030896433],"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.00012884128,0.000020054638,0.0001372144,0.000053335145,0.000006380244,0.000050752533,0.00009141478,0.0034822528,0.0024729527,0.9654296,0.0035823442,0.024544844],"study_design_scores_gemma":[0.000021069125,0.000031726202,0.00005855823,0.000013171852,0.0000051793377,0.00006436794,0.000021105063,0.023120735,0.0017130352,0.9693112,0.0056179618,0.000021874392],"about_ca_topic_score_codex":0.0007288286,"about_ca_topic_score_gemma":0.00087073486,"teacher_disagreement_score":0.012404096,"about_ca_system_score_codex":0.0011963311,"about_ca_system_score_gemma":0.001129309,"threshold_uncertainty_score":0.0414958},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060118604,0.00042654708,0.925973,0.0013912568,0.00013545925,0.000036029178,0.00017003527,0.00015578246,0.01159332],"genre_scores_gemma":[0.9119664,0.0005880557,0.06947239,0.0002657449,0.0002326754,0.00011614739,0.00037109508,0.00022831172,0.016759243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991456,0.00027916767,0.000028215214,0.00021332793,0.0002535149,0.000080173566],"domain_scores_gemma":[0.99086034,0.006479355,0.0006411311,0.0005463599,0.001203999,0.00026877996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028266637,0.0007178597,0.0007171862,0.0009545183,0.00063182245,0.0018208997,0.0010169849,0.0011907314,0.003942211],"category_scores_gemma":[0.022387808,0.00051995297,0.00037605074,0.00040946284,0.0025575515,0.0025434655,0.002427406,0.0017508009,0.00074535],"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.00054941914,0.000055689445,0.0036531123,0.00017810216,0.00009437961,0.00023108281,0.00022645081,0.44252753,0.014179616,0.4929053,0.003590376,0.041808996],"study_design_scores_gemma":[0.000010969587,0.000026630118,0.00060665066,0.000019222834,0.000006417185,0.0000671042,0.000029172446,0.94466925,0.0016049336,0.052272025,0.00066940155,0.000018277095],"about_ca_topic_score_codex":0.0018671908,"about_ca_topic_score_gemma":0.0013798099,"teacher_disagreement_score":0.003942211,"about_ca_system_score_codex":0.0009391579,"about_ca_system_score_gemma":0.0011896176,"threshold_uncertainty_score":0.014948964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013281872,0.000103569364,0.9816943,0.00034444095,0.000060541013,0.00008188823,0.00008304241,0.0006986939,0.0036516772],"genre_scores_gemma":[0.28468913,0.00012915219,0.709563,0.00031492204,0.000120379285,0.00034553854,0.00033338423,0.00027229666,0.0042322003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982089,0.0006602726,0.00009960406,0.0002962741,0.0004988579,0.00023616548],"domain_scores_gemma":[0.99357986,0.004501892,0.00027328773,0.00082765816,0.0005087683,0.00030864772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002418224,0.0009214792,0.0015331731,0.0010253433,0.0011812606,0.0018772503,0.0021956176,0.0017416758,0.008674017],"category_scores_gemma":[0.013675308,0.0008912159,0.0011830289,0.0012383538,0.0018335495,0.002178899,0.0032400677,0.0027420355,0.0014495234],"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.0005911393,0.00021104103,0.0013010511,0.0001553592,0.00009690279,0.00008718794,0.0001392797,0.7175457,0.0024609875,0.14397027,0.0040557026,0.12938535],"study_design_scores_gemma":[0.00005421519,0.000024870216,0.00005360135,0.000009007765,0.000009507684,0.0000137061525,0.000011055443,0.9514121,0.00043580396,0.047494285,0.0004729971,0.000008748095],"about_ca_topic_score_codex":0.005493168,"about_ca_topic_score_gemma":0.011646445,"teacher_disagreement_score":0.008674017,"about_ca_system_score_codex":0.0017085903,"about_ca_system_score_gemma":0.004223484,"threshold_uncertainty_score":0.029017508},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0179985,0.00028548023,0.9539448,0.00020240298,0.00009491097,0.00016584354,0.00045263668,0.001046191,0.025809348],"genre_scores_gemma":[0.16571598,0.00071864406,0.7837426,0.000583077,0.00010685113,0.00070057955,0.003080797,0.0012228442,0.044128537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998041,0.00051831006,0.00015600426,0.00039100336,0.0006421628,0.00025161862],"domain_scores_gemma":[0.99764854,0.001006524,0.00022364545,0.00055376644,0.000435088,0.0001325499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019434709,0.0014601996,0.0014899408,0.0011595521,0.0010760952,0.0020703468,0.0015231292,0.000942102,0.021040834],"category_scores_gemma":[0.005226855,0.001065296,0.0030082015,0.0009520397,0.0014625319,0.0025597431,0.0032728922,0.003077101,0.010575118],"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.0005445528,0.00020463462,0.0010305933,0.0006822768,0.00008813051,0.000307785,0.0006522265,0.04584398,0.021489937,0.7339387,0.018675312,0.17654186],"study_design_scores_gemma":[0.00017557858,0.0005089379,0.0005054717,0.0001882961,0.00011042492,0.00042941252,0.0001457128,0.124673866,0.01601229,0.7966257,0.060531713,0.00009267618],"about_ca_topic_score_codex":0.0021095152,"about_ca_topic_score_gemma":0.0035253176,"teacher_disagreement_score":0.021040834,"about_ca_system_score_codex":0.0017148905,"about_ca_system_score_gemma":0.0016218557,"threshold_uncertainty_score":0.070388556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8675678,0.0013539594,0.10348109,0.0053265877,0.00019825043,0.00007901214,0.0026407463,0.00063414796,0.018718336],"genre_scores_gemma":[0.98809683,0.00047411997,0.0045605325,0.00027358253,0.00031622226,0.000050688388,0.0006274097,0.0001370364,0.005463631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972216,0.0010239689,0.00011509845,0.0005814339,0.00063850323,0.0004194997],"domain_scores_gemma":[0.96344346,0.023458226,0.0046712267,0.0028951964,0.001872332,0.0036595955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00240933,0.0010003839,0.00188486,0.0041689947,0.0015817599,0.0064209257,0.0023982534,0.0026029067,0.0073557007],"category_scores_gemma":[0.030289203,0.0013512482,0.00068432913,0.0022624505,0.0040420513,0.008292453,0.0023518307,0.002323628,0.0008020194],"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.00055319606,0.000105783714,0.004873909,0.00032774566,0.00008756999,0.00030610934,0.0006856458,0.029961593,0.002578471,0.94134736,0.007338383,0.01183411],"study_design_scores_gemma":[0.00006753919,0.000053421685,0.0011837225,0.00004786794,0.00004455511,0.00029254178,0.0002012235,0.08961895,0.0006943506,0.90621006,0.0015299601,0.000055784352],"about_ca_topic_score_codex":0.0013820194,"about_ca_topic_score_gemma":0.0018762964,"teacher_disagreement_score":0.0073557007,"about_ca_system_score_codex":0.0018365191,"about_ca_system_score_gemma":0.0009833182,"threshold_uncertainty_score":0.024607241},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034352485,0.00705292,0.9072472,0.007095061,0.0015083554,0.00012214654,0.0013354918,0.0012930137,0.03999336],"genre_scores_gemma":[0.70845705,0.010463218,0.2421371,0.003818261,0.0066953995,0.000714787,0.0021185207,0.0012093079,0.02438635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99371755,0.0014981014,0.00027587888,0.0014072288,0.0022690054,0.00083216705],"domain_scores_gemma":[0.93639034,0.049797148,0.0017069357,0.0054685716,0.004066993,0.00256992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005507284,0.0041167345,0.0029173114,0.0043811966,0.0018341095,0.005195329,0.0036146047,0.004498147,0.010349601],"category_scores_gemma":[0.057694413,0.0014495358,0.0017863757,0.0027720265,0.0055005653,0.009202728,0.006550917,0.0083212145,0.003073252],"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.0006962241,0.00025419125,0.002124266,0.0011013444,0.00022851973,0.0006822326,0.0004266173,0.101490505,0.022084843,0.79299074,0.017803,0.060117513],"study_design_scores_gemma":[0.000046393994,0.00016719804,0.0010333603,0.0002868609,0.00010132626,0.0006425287,0.00009113682,0.3680997,0.0067829234,0.6138381,0.0087840725,0.00012634633],"about_ca_topic_score_codex":0.00096266094,"about_ca_topic_score_gemma":0.0011693375,"teacher_disagreement_score":0.010349601,"about_ca_system_score_codex":0.0019275058,"about_ca_system_score_gemma":0.001910055,"threshold_uncertainty_score":0.034622848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12669417,0.0030422057,0.775226,0.002363636,0.0013071493,0.00056282745,0.0023145017,0.03525517,0.05323438],"genre_scores_gemma":[0.5330157,0.0005270634,0.4256598,0.00074765494,0.00039128037,0.0005426658,0.0023810468,0.0034357968,0.03329903],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943158,0.0010159356,0.00034560557,0.00084944285,0.0022492008,0.0012239036],"domain_scores_gemma":[0.9908041,0.0029607273,0.00031697346,0.0038267917,0.0015975293,0.00049397035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023801473,0.002780646,0.0027265316,0.0027007845,0.0025360484,0.0050630914,0.004552326,0.002265696,0.046187207],"category_scores_gemma":[0.008944504,0.0010978684,0.0023548845,0.005453031,0.0023891416,0.008769678,0.008057634,0.0031638998,0.010242355],"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.0052142018,0.0004961375,0.0028920118,0.00095467386,0.00040119357,0.0005043602,0.00046990873,0.040206477,0.022663023,0.11484583,0.07921617,0.73213595],"study_design_scores_gemma":[0.0009958844,0.0005779071,0.0019051695,0.00021280735,0.00047460178,0.00063057814,0.00044230366,0.5119076,0.040625196,0.4034542,0.038558774,0.00021494615],"about_ca_topic_score_codex":0.004835374,"about_ca_topic_score_gemma":0.010432845,"teacher_disagreement_score":0.046187207,"about_ca_system_score_codex":0.0035249372,"about_ca_system_score_gemma":0.004103562,"threshold_uncertainty_score":0.15451157},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04068487,0.00022701203,0.9421075,0.00049785717,0.00017092677,0.00006307415,0.00009679723,0.000596617,0.01555536],"genre_scores_gemma":[0.59241456,0.00047426362,0.3829621,0.00026375873,0.00023917909,0.00016515999,0.00031394255,0.0005090922,0.022657854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974376,0.00006946565,0.000009690534,0.000035229168,0.000107770626,0.000034190445],"domain_scores_gemma":[0.99932075,0.00039195025,0.00003200753,0.00010881331,0.0000987697,0.000047749967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036871547,0.00062841043,0.0006907531,0.000723958,0.00065061834,0.0008057837,0.001017643,0.00081285444,0.010877238],"category_scores_gemma":[0.0029564437,0.00031009535,0.0005711886,0.0007550842,0.0010190046,0.0017445459,0.002049677,0.0024546399,0.0015341552],"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.00019058862,0.00022212169,0.0007024458,0.00034232484,0.00007092611,0.00019681387,0.00040099057,0.13242765,0.013701366,0.5758477,0.012170881,0.2637262],"study_design_scores_gemma":[0.000041188774,0.00007517902,0.00014071018,0.000020445417,0.000015240559,0.00007270816,0.000109220244,0.5738568,0.003358897,0.41663474,0.0056578754,0.000016956183],"about_ca_topic_score_codex":0.0012686538,"about_ca_topic_score_gemma":0.0029040885,"teacher_disagreement_score":0.010877238,"about_ca_system_score_codex":0.00041468005,"about_ca_system_score_gemma":0.00053365086,"threshold_uncertainty_score":0.03638804},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8240403,0.0010135538,0.12476003,0.00079299894,0.0002589405,0.00005886482,0.0009418623,0.00045998715,0.047673497],"genre_scores_gemma":[0.9649146,0.00034929442,0.025498444,0.00011406493,0.00020201638,0.00011269809,0.00050725054,0.00013286807,0.00816878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991009,0.00023145956,0.00004895685,0.00015759608,0.00029635793,0.00016477179],"domain_scores_gemma":[0.9965438,0.0017623177,0.00050666294,0.00023597895,0.00050180184,0.00044941626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009470612,0.0007013317,0.0011344434,0.0023355326,0.0009219715,0.0027446852,0.0021121264,0.0012952017,0.009720155],"category_scores_gemma":[0.0056946483,0.0005768627,0.00039180845,0.0012051245,0.0024059159,0.0031738624,0.001941233,0.00092607026,0.0008507477],"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.0009857003,0.00013362998,0.003243713,0.00025486285,0.000074877105,0.00045592603,0.00043001978,0.04992623,0.012002912,0.9048605,0.0038774265,0.02375416],"study_design_scores_gemma":[0.00012723405,0.00014268166,0.0042724893,0.00008042601,0.000046617548,0.0007259156,0.00046355985,0.3396089,0.00607804,0.6434113,0.004958964,0.00008389535],"about_ca_topic_score_codex":0.00080305064,"about_ca_topic_score_gemma":0.0004429192,"teacher_disagreement_score":0.009720155,"about_ca_system_score_codex":0.0005598785,"about_ca_system_score_gemma":0.00041607386,"threshold_uncertainty_score":0.032517135},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42125216,0.0029152879,0.48273835,0.008859026,0.00048573423,0.000066779125,0.0011213564,0.0003402325,0.08222104],"genre_scores_gemma":[0.944323,0.0011296752,0.045268245,0.0007631793,0.00048806393,0.000092492905,0.0006545323,0.0001976391,0.007083151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955108,0.0016452767,0.0003059988,0.0007871672,0.0010713706,0.0006794308],"domain_scores_gemma":[0.95509565,0.03495098,0.0021120044,0.004032044,0.0016837999,0.0021255142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063296324,0.0007840145,0.0022411132,0.0030681854,0.003086816,0.0064756577,0.002764305,0.002074092,0.007958377],"category_scores_gemma":[0.031730298,0.0011949701,0.0023096553,0.0027298946,0.008977242,0.01530384,0.0067796716,0.008440206,0.00045135152],"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.00006524101,0.000020953648,0.00065390323,0.000036335925,0.000013159762,0.000031225427,0.00022162944,0.004815535,0.00025077528,0.9902096,0.0007489381,0.0029327003],"study_design_scores_gemma":[0.000009181312,0.0000112098105,0.00031141765,0.00003666572,0.000009233021,0.00003900437,0.0000920915,0.018953,0.00021226959,0.97939897,0.0009131983,0.000013826212],"about_ca_topic_score_codex":0.0022336491,"about_ca_topic_score_gemma":0.0018943524,"teacher_disagreement_score":0.007958377,"about_ca_system_score_codex":0.003867164,"about_ca_system_score_gemma":0.0011713437,"threshold_uncertainty_score":0.033474684},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024306644,0.00036805964,0.9735361,0.0003449635,0.000045070115,0.000014242636,0.0000717102,0.00009496208,0.0012182762],"genre_scores_gemma":[0.66919786,0.0018678042,0.32080472,0.00028476605,0.0002238149,0.0001430938,0.00064708974,0.0001993094,0.006631525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992229,0.00035595967,0.000040881812,0.00012567553,0.00018522415,0.00006941475],"domain_scores_gemma":[0.9941367,0.004115517,0.00041910348,0.00070772466,0.000432238,0.00018879307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003409409,0.0010175926,0.0011326725,0.0008473526,0.00027799013,0.0013878761,0.001071027,0.0014690645,0.0015323026],"category_scores_gemma":[0.018232875,0.0005920048,0.000657377,0.00068252627,0.0021433095,0.0021244597,0.0023002361,0.00228557,0.00043924773],"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.00045532503,0.00011054095,0.0019242655,0.00040140928,0.00008670024,0.00018743491,0.00018031594,0.57833964,0.009173011,0.324722,0.004405288,0.08001413],"study_design_scores_gemma":[0.000010080181,0.000026637055,0.00020074948,0.000023812472,0.0000069659027,0.00003633774,0.000015932736,0.9637681,0.0015884528,0.033772808,0.00053835585,0.000011711316],"about_ca_topic_score_codex":0.0014081381,"about_ca_topic_score_gemma":0.001173213,"teacher_disagreement_score":0.003409409,"about_ca_system_score_codex":0.0008082846,"about_ca_system_score_gemma":0.001134155,"threshold_uncertainty_score":0.018030941},"labels":[],"label_agreement":null}]}