{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":264,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":264,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"4ef4462a38c4","filters":{"topic":"Mathematical Approximation and Integration"}},"results":[{"id":"W87152119","doi":"10.1007/978-0-387-78165-5","title":"Monte Carlo and Quasi-Monte Carlo Sampling","year":2009,"lang":"en","type":"book","venue":"Springer series in statistics","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":516,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Monte Carlo method; Statistical physics; Monte Carlo method in statistical physics; Sampling (signal processing); Hybrid Monte Carlo; Dynamic Monte Carlo method; Markov chain Monte Carlo; Computer science; Statistics; Mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.05815438994521518,"gpt":0.327191639896787,"spread":0.2690372499515719,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004404371,0.000534776,0.0009007599,0.0002083592,0.0001079173,0.0001697445,0.0002390851,0.0004104445,0.000184729],"category_scores_gemma":[0.00122134,0.0005093942,0.0000816407,0.00009277386,0.0001891816,0.0001959278,0.0001201236,0.0006948255,0.0000285026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002751667,"about_ca_system_score_gemma":0.0001690487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002577893,"about_ca_topic_score_gemma":0.0007271284,"domain_scores_codex":[0.9975241,0.00006643197,0.001034128,0.0004859893,0.0004973312,0.0003920041],"domain_scores_gemma":[0.9980166,0.0006569476,0.0004320436,0.000539663,0.0002180381,0.0001367052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003389262,0.00009118718,0.00001771431,0.001306633,0.00004664906,0.00002939101,0.001903149,0.000007708162,0.000003072611,0.9658138,0.02479795,0.005948909],"study_design_scores_gemma":[0.0003827264,0.0002200236,0.00009549072,0.001008644,0.0001279803,0.00002575469,0.0002714584,0.005018004,0.00001825201,0.9170419,0.07505836,0.0007313967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.005164696,0.002369247,0.3609755,0.0007514916,0.001427931,0.004235736,0.002019905,0.0009082179,0.6221473],"genre_scores_gemma":[0.0007289686,0.0005119,0.6014744,0.0001538623,0.0002524954,0.00006145161,0.00004337837,0.0001390829,0.3966344],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.2404989,"threshold_uncertainty_score":0.9997358,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2228579993","doi":"10.1007/0-306-48102-2_20","title":"Recent Advances in Randomized Quasi-Monte Carlo Methods","year":2002,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":252,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; Université de Montréal","funders":"","keywords":"Estimator; Variance reduction; Control variates; Monte Carlo method; Quasi-Monte Carlo method; Variance (accounting); Computer science; Algorithm; Measure (data warehouse); Monte Carlo integration; Applied mathematics; Mathematical optimization; Statistical physics; Hybrid Monte Carlo; Mathematics; Statistics; Data mining; Markov chain Monte Carlo; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.1366273816614844,"gpt":0.4950813131293181,"spread":0.3584539314678338,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaresearch","sts"],"category_scores_codex":[0.04513879,0.0008469156,0.001206402,0.01521447,0.001944158,0.003663659,0.006971391,0.0002959097,0.007183188],"category_scores_gemma":[0.00914727,0.0007864659,0.0002649465,0.005732681,0.009702898,0.009534308,0.003781735,0.002342257,0.0004016646],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006291642,"about_ca_system_score_gemma":0.0005613794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002721313,"about_ca_topic_score_gemma":0.006870982,"domain_scores_codex":[0.9795966,0.001316705,0.003280119,0.002783127,0.01108064,0.001942796],"domain_scores_gemma":[0.9923349,0.001187333,0.000233338,0.001756237,0.004097115,0.0003911001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009867296,0.0007108308,0.00001799003,0.0001701302,0.00009361126,0.0001221664,0.001426587,0.01081461,0.00004882624,0.9666256,0.0009031605,0.01807977],"study_design_scores_gemma":[0.008657244,0.0001971233,0.0001153142,0.001760031,0.00002810644,0.00003129551,0.004652613,0.251258,0.0001907706,0.4530924,0.2789283,0.001088871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0007169694,0.0006382565,0.0070589,0.01657514,0.002145814,0.007371407,0.00008095931,0.0001408122,0.9652718],"genre_scores_gemma":[0.01411872,0.08627778,0.2007984,0.0002441697,0.0003467468,0.005698173,0.0001798468,0.0001573025,0.6921788],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.5135332,"threshold_uncertainty_score":0.9999594,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027195108","doi":"10.1007/978-3-642-04107-5","title":"Monte Carlo and Quasi-Monte Carlo Methods 2008","year":2009,"lang":"en","type":"book","venue":"","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":242,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Monte Carlo method; Statistical physics; Monte Carlo method in statistical physics; Monte Carlo molecular modeling; Dynamic Monte Carlo method; Hybrid Monte Carlo; Markov chain Monte Carlo; Physics; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.06875645267708223,"gpt":0.381260746134556,"spread":0.3125042934574737,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000958907,0.0005819175,0.001061095,0.0002009516,0.0001106395,0.0001421387,0.0002571445,0.000647857,0.001011502],"category_scores_gemma":[0.000834219,0.0004363891,0.0002679868,0.00008662345,0.0001035267,0.0001761811,0.00007743807,0.0005824908,0.0001105138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001668214,"about_ca_system_score_gemma":0.000152709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003176783,"about_ca_topic_score_gemma":0.0001081121,"domain_scores_codex":[0.9974996,0.0001975725,0.0009544916,0.0005265357,0.0004881119,0.0003336678],"domain_scores_gemma":[0.9976168,0.0008339019,0.000406049,0.0006683493,0.0002580335,0.0002169111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008885967,0.0001032135,2.908736e-7,0.0004333551,0.00007123615,0.000004202618,0.0005474385,3.977359e-7,0.000005752058,0.5169015,0.4674228,0.01450094],"study_design_scores_gemma":[0.0003930044,0.0002113079,0.000003099974,0.0004238099,0.0002492705,0.00004088836,0.0001412279,0.02530227,0.0001102092,0.7178825,0.2545549,0.0006876006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00006630225,0.0006630613,0.07154072,0.0005357797,0.0001190346,0.0009626255,0.00001999402,0.0004659717,0.9256265],"genre_scores_gemma":[0.00002746208,0.0001118563,0.3475534,0.0003532063,0.0001440172,0.00003481154,0.000007744624,0.00005858982,0.651709],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.2760127,"threshold_uncertainty_score":0.9999017,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965440168","doi":"10.1287/mnsc.46.9.1214.12231","title":"Variance Reduction via Lattice Rules","year":2000,"lang":"en","type":"article","venue":"Management Science","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":168,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Variance reduction; Linear subspace; Lattice (music); Lattice reduction; Variance (accounting); Computer science; Latin hypercube sampling; Hypercube; Mathematical optimization; Mathematics; Monte Carlo method; Statistics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03334509766890069,"gpt":0.3040247811363723,"spread":0.2706796834674716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007182445,0.00008288061,0.00008234754,0.00008698753,0.0002136243,0.0001090931,0.0002826045,0.00001844163,0.003007399],"category_scores_gemma":[0.00005752906,0.00006742908,0.00002519359,0.0004635268,0.0001647377,0.000452208,0.00003451395,0.00005250277,0.001051567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004881545,"about_ca_system_score_gemma":0.000006462812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002985882,"about_ca_topic_score_gemma":2.875695e-7,"domain_scores_codex":[0.9988955,0.0000192343,0.0002038446,0.0002538209,0.0004375475,0.0001900787],"domain_scores_gemma":[0.9995196,0.00002494893,0.00005093119,0.0003122745,0.00003890532,0.00005333454],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003063099,0.00007532771,0.000001262685,0.00005047641,0.000003197085,6.949085e-7,0.0001790463,0.000002526897,0.0001901133,0.9429758,0.0009119464,0.05560658],"study_design_scores_gemma":[0.0001263964,0.00001861633,0.000196191,0.00003941245,0.00001640466,0.000007240577,0.0001155462,0.02777415,0.001586301,0.9584567,0.01153991,0.000123108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.09303626,0.000005983079,0.2051281,0.0009760701,0.0001488623,0.0004430242,8.708204e-7,0.0002137385,0.7000471],"genre_scores_gemma":[0.2039385,0.00002845605,0.7272676,0.0003249544,0.0000900138,0.00007826658,0.000003135713,0.00001593413,0.06825316],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6317939,"threshold_uncertainty_score":0.9997262,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995973437","doi":"10.1016/j.jfa.2004.10.005","title":"Approximation of smooth functions on compact two-point homogeneous spaces","year":2004,"lang":"en","type":"article","venue":"Journal of Functional Analysis","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":139,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Sobolev space; Homogeneous; Business process reengineering; Mathematical analysis; Type (biology); Pure mathematics; Space (punctuation); Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.04773960739143661,"gpt":0.3033342001922898,"spread":0.2555945928008532,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007583923,0.0001736689,0.0005776873,0.0008190959,0.0001050835,0.00004820821,0.0001233012,0.00006699221,0.001058577],"category_scores_gemma":[0.0006238146,0.0001215938,0.0007168639,0.001037094,0.00006467928,0.0002465865,0.00001029229,0.0002237357,0.00003545084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001714743,"about_ca_system_score_gemma":0.00009573237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000200598,"about_ca_topic_score_gemma":0.00002416718,"domain_scores_codex":[0.9977417,0.0000803314,0.001058949,0.0001415204,0.00084419,0.000133339],"domain_scores_gemma":[0.9974107,0.0003846982,0.0011301,0.0002185797,0.0007447973,0.0001111786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005662865,0.003254246,0.0006573742,0.0001947819,0.004428459,0.00001016988,0.0007954168,0.1470818,0.006785057,0.8293563,0.005263482,0.001606589],"study_design_scores_gemma":[0.00343862,0.001438014,0.004799955,0.0002615842,0.005411801,0.0001662951,0.001861982,0.03023609,0.01780024,0.9331965,0.0008916474,0.000497308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3471239,0.00003681066,0.6453685,0.001550898,0.0001689656,0.0001301563,0.0000185605,0.00002473955,0.005577535],"genre_scores_gemma":[0.9804838,0.000009439409,0.01868802,0.00009664933,0.0001894033,0.000003394082,0.00002483454,0.00001343166,0.0004910468],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6333599,"threshold_uncertainty_score":0.9998546,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985018928","doi":"10.1137/s1064827599356638","title":"Extensible Lattice Sequences for Quasi-Monte Carlo Quadrature","year":2000,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":126,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Monte Carlo method; Mathematics; Lattice (music); Pseudorandom number generator; Quasi-Monte Carlo method; Quadrature (astronomy); Monte Carlo integration; Statistical physics; Hybrid Monte Carlo; Applied mathematics; Algorithm; Statistics; Physics; Markov chain Monte Carlo","retraction":null,"screen_n_in":null,"score":{"opus":0.07684025678555359,"gpt":0.3604038760933648,"spread":0.2835636193078112,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002617184,0.0001805888,0.0002860953,0.000155271,0.0008384897,0.0009029711,0.0002970549,0.00008334594,0.0008174364],"category_scores_gemma":[0.000872724,0.0001302758,0.0001973808,0.0003899268,0.00009595911,0.0002564105,0.00001787899,0.0003686668,0.0001403004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007059547,"about_ca_system_score_gemma":0.00008491107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001388606,"about_ca_topic_score_gemma":0.000006370719,"domain_scores_codex":[0.9979641,0.0001168655,0.0006463791,0.0003178753,0.0005972348,0.0003575568],"domain_scores_gemma":[0.9981098,0.0007473488,0.0002904811,0.0002769441,0.0004182161,0.0001572739],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001669364,0.001066185,0.00002998393,0.0004964653,0.0001092007,0.00002986043,0.01013352,0.001083364,0.001668277,0.7334483,0.1033346,0.1484333],"study_design_scores_gemma":[0.0008448373,0.00035168,0.00003840216,0.0008208789,0.00005825187,0.0002748412,0.001387389,0.4235121,0.001491514,0.5168232,0.05396789,0.0004290618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8965301,0.0001224569,0.0782723,0.002170366,0.001731793,0.0006573166,0.00001248887,0.0001729397,0.02033022],"genre_scores_gemma":[0.757581,0.000006464778,0.214057,0.0004985149,0.0007341717,0.000006760587,0.000005776128,0.00004187913,0.02706842],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4224287,"threshold_uncertainty_score":0.8950356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071880083","doi":"10.1007/s10623-009-9290-2","title":"Unitary designs and codes","year":2009,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":107,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Unitary state; Unitary group; Mathematics; Unitary matrix; Product (mathematics); Code (set theory); TRACE (psycholinguistics); Group (periodic table); Special unitary group; Upper and lower bounds; Combinatorics; Inner product space; Circular ensemble; Unit (ring theory); Pure mathematics; Discrete mathematics; Geometry; Computer science; Mathematical analysis; Physics; Quantum mechanics; Mathematical physics","retraction":null,"screen_n_in":null,"score":{"opus":0.07906106529969248,"gpt":0.3132571014224813,"spread":0.2341960361227888,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003552624,0.0002011676,0.0002776796,0.000171522,0.0001830296,0.0001176931,0.00008381315,0.00009861053,0.0001127929],"category_scores_gemma":[0.0001095034,0.0001555086,0.00007316993,0.0002595562,0.0001242819,0.0001660133,0.00001513072,0.0001225301,0.000004714202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005766366,"about_ca_system_score_gemma":0.00001035217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005035186,"about_ca_topic_score_gemma":0.000005797826,"domain_scores_codex":[0.9989908,0.00008839185,0.0002934983,0.0002344401,0.0001800224,0.0002128057],"domain_scores_gemma":[0.9992063,0.0003112498,0.00008064727,0.0001850662,0.00007589575,0.0001408355],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002164836,0.0001279171,0.0001543759,0.00006858892,0.00002565401,0.000002444128,0.000569651,1.607682e-7,0.002180277,0.9842747,0.002464661,0.0101099],"study_design_scores_gemma":[0.0003340846,0.0003063105,0.0009697792,0.00007134994,0.0000565359,0.00002287933,0.0004734496,0.002163076,0.00185333,0.99259,0.0009216117,0.0002375884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3001154,0.0005732606,0.6813678,0.0009543611,0.00003472896,0.0005806802,0.00001680478,0.0002718373,0.01608518],"genre_scores_gemma":[0.7456157,0.000276055,0.2532174,0.0007030789,0.00004123919,0.00002344738,0.0000131853,0.00001722339,0.00009260513],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4455003,"threshold_uncertainty_score":0.6341458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045737730","doi":"10.1137/s0036142901356551","title":"Direct and Inverse Approximation Theorems for the p-Version of the Finite Element Method in the Framework of Weighted Besov Spaces. Part I: Approximability of Functions in the Weighted Besov Spaces","year":2002,"lang":"en","type":"article","venue":"SIAM Journal on Numerical Analysis","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":105,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Sobolev space; Besov space; Convergence (economics); Inverse; Type (biology); Element (criminal law); Pure mathematics; Applied mathematics; Mathematical analysis; Interpolation space; Functional analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03509244357523303,"gpt":0.3021937741358766,"spread":0.2671013305606436,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004499673,0.0002162864,0.0006404466,0.0002625161,0.0002306875,0.00006239544,0.000476578,0.0001226977,0.0004484281],"category_scores_gemma":[0.002159376,0.00008549571,0.0005274059,0.002381688,0.0002397397,0.0001253307,0.00004600624,0.0005118098,0.000001738339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005542628,"about_ca_system_score_gemma":0.00001939718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003658613,"about_ca_topic_score_gemma":0.00004764236,"domain_scores_codex":[0.9961419,0.00145345,0.001126812,0.0002257948,0.0008426447,0.0002093993],"domain_scores_gemma":[0.9909211,0.007200356,0.001028545,0.0005771741,0.0002296252,0.00004314109],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009488635,0.009847102,0.01021019,0.00114795,0.003110994,0.000002487591,0.05895706,0.00493283,0.0005106925,0.880618,0.006662552,0.02305123],"study_design_scores_gemma":[0.0007522135,0.0003063538,0.001273789,0.0001997096,0.001337525,0.000004788043,0.01098049,0.6987058,0.001373258,0.2836676,0.001236393,0.0001620876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1772755,0.0002518708,0.8042319,0.01357736,0.00009362813,0.001902757,0.00006709587,0.00001549409,0.00258433],"genre_scores_gemma":[0.9600606,0.0001272318,0.03929026,0.0002617281,0.00005321112,0.0000982487,0.000008468234,0.00001302182,0.00008726254],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7827851,"threshold_uncertainty_score":0.4909973,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093294140","doi":"10.1007/s00222-002-0266-3","title":"Entropy and the combinatorial dimension","year":2003,"lang":"en","type":"article","venue":"Inventiones mathematicae","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":98,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Australian Research Council; University of Alberta; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Dimension (graph theory); Packing dimension; Regular polygon; Combinatorics; Bounded function; Entropy (arrow of time); Convex body; Minkowski–Bouligand dimension; Dimension function; Exponential function; Discrete mathematics; Pure mathematics; Mathematical analysis; Convex optimization; Hausdorff dimension; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.0356841231031761,"gpt":0.2905560870717847,"spread":0.2548719639686086,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00144306,0.0001771932,0.0003326311,0.00005470986,0.0002319615,0.0001015118,0.000117452,0.00007732921,0.0007520391],"category_scores_gemma":[0.002821749,0.0001009325,0.0001295809,0.0001557948,0.0002663847,0.0001418437,0.00003710281,0.0001408898,0.0001423874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002150921,"about_ca_system_score_gemma":0.00001627428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001590264,"about_ca_topic_score_gemma":0.000001117666,"domain_scores_codex":[0.9984127,0.0003025194,0.0005456112,0.0001906765,0.0003599735,0.0001885116],"domain_scores_gemma":[0.9982536,0.001002597,0.0002123521,0.0003518588,0.0001041048,0.00007550709],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001939284,0.000164506,0.000008346023,0.000152364,0.00002633335,5.111193e-7,0.000672247,4.750103e-8,0.00009328241,0.9972795,0.001484302,0.00009911868],"study_design_scores_gemma":[0.00190086,0.00002415155,0.000007264221,0.00008206852,0.00006502747,0.00003511231,0.0003505632,0.002150319,0.001350711,0.9920996,0.001809914,0.000124393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5882967,0.0003644654,0.1990679,0.006405073,0.001581,0.004212054,0.00000684558,0.0007016498,0.1993644],"genre_scores_gemma":[0.9214158,0.00003108867,0.07473533,0.0002973512,0.00009381757,0.0002566072,0.000005274303,0.00004941279,0.003115293],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3331192,"threshold_uncertainty_score":0.8234301,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103255584","doi":"10.1145/1596519.1596520","title":"Generalized Halton sequences in 2008","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Sobol sequence; Computer science; Sequence (biology); Algorithm; Theoretical computer science; Mathematics; Statistics; Monte Carlo method","retraction":null,"screen_n_in":null,"score":{"opus":0.08529437444045551,"gpt":0.3364752737771421,"spread":0.2511808993366866,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001771106,0.0001151715,0.0001536183,0.000139465,0.00009572275,0.00005131702,0.00007669494,0.000073993,0.00003170479],"category_scores_gemma":[0.00002708239,0.00009914488,0.00004242737,0.0001339407,0.000009999421,0.0001855739,0.000001643387,0.0001256707,0.000005524724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002686268,"about_ca_system_score_gemma":0.000009702368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001157482,"about_ca_topic_score_gemma":0.00001041911,"domain_scores_codex":[0.9991803,0.00005128901,0.0003139361,0.0001907315,0.0001506194,0.0001131511],"domain_scores_gemma":[0.9995103,0.000155959,0.00004342739,0.000196533,0.00005373274,0.00004000519],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002133718,0.0001286195,0.000001694502,0.00001488478,0.000004362042,4.442799e-7,0.0005464971,0.9097703,0.00002101613,0.028689,0.000008605251,0.0607933],"study_design_scores_gemma":[0.0002565297,0.00005677919,0.000008520872,0.00004044477,0.000005665589,0.000001308338,0.00001361679,0.6390109,0.0000592643,0.3604687,0.000008679493,0.00006957883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1950593,0.00001062962,0.8040047,0.0005082356,0.0000553851,0.0001472077,9.236285e-7,0.00007830891,0.0001352163],"genre_scores_gemma":[0.8022192,0.00001330722,0.1974468,0.000218595,0.00002904241,0.000006778734,0.000003746233,0.00000559517,0.00005693309],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6071599,"threshold_uncertainty_score":0.4043011,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987302087","doi":"10.1007/s11222-006-9009-4","title":"Acceleration of the Multiple-Try Metropolis algorithm using antithetic and stratified sampling","year":2007,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Stratified sampling; Metropolis–Hastings algorithm; Rejection sampling; Acceleration; Algorithm; Sampling (signal processing); Monte Carlo method; Mathematics; Gaussian; Set (abstract data type); Computer science; Extension (predicate logic); Markov chain Monte Carlo; Mathematical optimization; Statistics; Hybrid Monte Carlo","retraction":null,"screen_n_in":null,"score":{"opus":0.08714820365819681,"gpt":0.3653813848639381,"spread":0.2782331812057413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000484622,0.00009092969,0.000153885,0.00004093512,0.0001853998,0.00005766984,0.00004969709,0.00004067577,0.00001053107],"category_scores_gemma":[0.0004430893,0.00006422849,0.00001867897,0.000098073,0.00007941796,0.00004248353,0.00004864795,0.00009401132,1.922398e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001465836,"about_ca_system_score_gemma":0.00001507267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003176606,"about_ca_topic_score_gemma":0.00002155315,"domain_scores_codex":[0.9991954,0.00003269935,0.000374898,0.0001154181,0.0001595649,0.0001220307],"domain_scores_gemma":[0.9988821,0.0006720899,0.0002031411,0.00009986652,0.0001068469,0.00003597495],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004764076,0.0000530305,0.0005548321,0.000249984,0.00002007663,4.819107e-7,0.001140155,0.00001318208,0.003802479,0.9139354,0.00002754607,0.08019804],"study_design_scores_gemma":[0.0002154256,0.00002345726,0.001756224,0.00009832107,0.00003124203,0.00001004702,0.0007687298,0.7709197,0.003870622,0.2222019,0.00001212277,0.00009215762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3191681,0.00001437669,0.6804137,0.00001141353,0.00004599562,0.000115003,0.00001607012,0.00001002604,0.0002053851],"genre_scores_gemma":[0.5051946,0.000001935159,0.4947469,0.0000139334,0.00002328212,2.219461e-7,0.000002330032,0.000005713116,0.0000110764],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7709066,"threshold_uncertainty_score":0.2619162,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166649678","doi":"10.1287/opre.1080.0556","title":"A Randomized Quasi-Monte Carlo Simulation Method for Markov Chains","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Markov chain Monte Carlo; Monte Carlo method; Variance reduction; Markov chain; Mathematics; Mathematical optimization; State space; Hybrid Monte Carlo; Computer science; Applied mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.3229740488047983,"gpt":0.5255334680860169,"spread":0.2025594192812186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.005649259,0.0001533853,0.000464503,0.0003034745,0.000873829,0.0001502074,0.0001940034,0.0001286967,0.0005612461],"category_scores_gemma":[0.01316225,0.0001157008,0.0002024062,0.0004471224,0.0001706195,0.0002700655,0.00004388525,0.0002708258,0.00007943979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001086914,"about_ca_system_score_gemma":0.0001636818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009444244,"about_ca_topic_score_gemma":0.0001333854,"domain_scores_codex":[0.9969384,0.001088037,0.0006326928,0.0003046029,0.0006920742,0.0003441974],"domain_scores_gemma":[0.9926333,0.005480734,0.00004477683,0.0004061597,0.001318834,0.0001161827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002723104,0.0004747588,0.000001906593,0.0001333615,0.0000632408,0.000001409855,0.004104348,0.003624369,0.000278849,0.9818197,0.004876668,0.001898324],"study_design_scores_gemma":[0.01807117,0.00008027744,0.000001865022,0.00002863249,0.00001747127,0.000006297279,0.0002820091,0.9393299,0.000443116,0.03998999,0.001624301,0.0001249497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02816365,0.00002619962,0.958893,0.001855006,0.00005406316,0.003473481,0.00002151885,0.00009674428,0.007416345],"genre_scores_gemma":[0.319917,0.00002438731,0.6446622,0.00008886029,0.0001652141,0.002128703,0.0000290539,0.00004012093,0.03294444],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9418297,"threshold_uncertainty_score":0.9951503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W22055536","doi":"10.1007/978-0-387-78165-5_5","title":"Quasi–Monte Carlo Constructions","year":2008,"lang":"en","type":"book-chapter","venue":"Springer series in statistics","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":70,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Monte Carlo method; Mathematics; Sampling (signal processing); Set (abstract data type); Algorithm; Lattice (music); Sample (material); Monte Carlo integration; Generator (circuit theory); Computer science; Statistical physics; Hybrid Monte Carlo; Statistics; Markov chain Monte Carlo; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.05816643740738035,"gpt":0.3015020376998033,"spread":0.243335600292423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001533378,0.0004094212,0.0006453751,0.0002018866,0.0001160225,0.00005074775,0.000194928,0.0003393025,0.001987815],"category_scores_gemma":[0.0005946664,0.0003990298,0.0001004369,0.00004999141,0.00038276,0.0001328566,0.00008230753,0.0005843021,0.0001941198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000167546,"about_ca_system_score_gemma":0.0001222807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001348488,"about_ca_topic_score_gemma":0.0003070741,"domain_scores_codex":[0.9980382,0.00002568675,0.0009093595,0.000343562,0.0004255396,0.000257608],"domain_scores_gemma":[0.9984124,0.0003803969,0.0003705574,0.0005089716,0.0002321666,0.00009548404],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001311037,0.00005556797,0.000005868732,0.0002913959,0.00003897146,0.00003808571,0.000658031,7.812849e-7,0.000001163162,0.9747705,0.02262243,0.001504047],"study_design_scores_gemma":[0.0001995289,0.00009382355,0.000008069273,0.0002950747,0.00005571798,0.00008900733,0.0001097685,0.0004724697,0.00002357016,0.8135266,0.1846979,0.0004284322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0001535777,0.0001578555,0.08092961,0.0001574193,0.0007687023,0.0007401537,0.0009116356,0.0002298448,0.9159512],"genre_scores_gemma":[0.0003953688,0.0007573104,0.4945389,0.00006111611,0.0001699277,0.00004789905,0.00005743683,0.0001227671,0.5038493],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.4136093,"threshold_uncertainty_score":0.9998462,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117227986","doi":"10.5555/1162708.1162815","title":"Simulation in java with SSJ","year":2005,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":65,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Java; Random variate; Flexibility (engineering); Set (abstract data type); Process (computing); Monte Carlo method; Programming language; Theoretical computer science; Random variable; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.09683017936895347,"gpt":0.360937770605684,"spread":0.2641075912367306,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002292292,0.0001615079,0.0002027399,0.000105947,0.00004074201,0.000078079,0.0001167877,0.00008181755,0.001607966],"category_scores_gemma":[0.000446837,0.0001247213,0.00003737857,0.0001922763,0.00003661086,0.0004801031,0.00002025199,0.0001447477,0.000172845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008390426,"about_ca_system_score_gemma":0.00003382629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003750627,"about_ca_topic_score_gemma":0.0001555959,"domain_scores_codex":[0.9987977,0.00006189824,0.000458212,0.0002335422,0.0002761385,0.000172539],"domain_scores_gemma":[0.9986951,0.0006241862,0.0001433349,0.0002437864,0.0002378672,0.0000557461],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001515207,0.0004295617,0.001887221,0.0001106211,0.00002179651,0.000002092888,0.004565275,0.3653025,0.0001366875,0.6028361,0.0001598401,0.0243968],"study_design_scores_gemma":[0.0005768614,0.00004979693,0.0007684206,0.0001223804,0.000007973124,7.868877e-7,0.0001164343,0.9417467,0.0002678047,0.05489239,0.001289688,0.0001608275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2195928,0.000002912683,0.7632477,0.0006889296,0.00002893481,0.0003700735,0.000002106587,0.0001141163,0.01595244],"genre_scores_gemma":[0.9629653,3.630925e-7,0.03566026,0.0001806026,0.00006766761,0.00002205646,0.000009248011,0.00001683208,0.001077737],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7433724,"threshold_uncertainty_score":0.9993047,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101835956","doi":"10.1109/wsc.2003.1261439","title":"Efficient simulation of gamma and variance-gamma processes","year":2004,"lang":"en","type":"article","venue":"","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":59,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Monte Carlo method; Rejection sampling; Brownian bridge; Monte Carlo integration; Hybrid Monte Carlo; Importance sampling; Variance (accounting); Quasi-Monte Carlo method; Computer science; Gamma process; Stochastic process; Sampling (signal processing); Statistical physics; Algorithm; Variance reduction; Slice sampling; Monte Carlo molecular modeling; Variance-gamma distribution; Dynamic Monte Carlo method; Mathematics; Markov chain Monte Carlo; Brownian motion; Statistics; Physics; Accounting","retraction":null,"screen_n_in":null,"score":{"opus":0.04674380501509681,"gpt":0.3205645852291364,"spread":0.2738207802140397,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001718484,0.00007745087,0.000138456,0.00004291077,0.00003109692,0.00001722559,0.00004154706,0.00004988926,0.0002044761],"category_scores_gemma":[0.0009587283,0.00005502198,0.00002029084,0.0001439797,0.00003654103,0.00004837136,0.00001369847,0.00004160323,0.00001289123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001605795,"about_ca_system_score_gemma":0.00003263169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003943258,"about_ca_topic_score_gemma":0.00000631643,"domain_scores_codex":[0.9993471,0.000012217,0.0002819389,0.0001074687,0.0001724913,0.00007881295],"domain_scores_gemma":[0.999336,0.0002453482,0.0001027556,0.0001091018,0.0001719009,0.00003491632],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001046579,0.0002241163,0.000008377206,0.0006958338,0.000007292271,2.120933e-7,0.001288257,0.005934064,0.0003960613,0.9906507,0.00002581245,0.0007588706],"study_design_scores_gemma":[0.0005436798,0.00006855232,0.00006075825,0.0001339426,0.00001812361,0.000003011391,0.0002806268,0.1924846,0.01580437,0.7903956,0.0001013215,0.0001055109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3117833,0.00001228724,0.6732554,0.0002124846,0.00001556041,0.0002432061,0.000001513374,0.00005797949,0.01441822],"genre_scores_gemma":[0.9142322,0.000002032317,0.08533197,0.00003227142,0.00001486897,0.00000991472,0.000001582769,0.000007050141,0.0003681424],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6024488,"threshold_uncertainty_score":0.2243731,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1823185101","doi":"10.1007/978-3-642-56046-0_22","title":"Quasi-Regression and the Relative Importance of the ANOVA Components of a Function","year":2002,"lang":"en","type":"book-chapter","venue":"","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Monte Carlo method; Variance (accounting); Mathematics; Quasi-Monte Carlo method; Monte Carlo integration; Applied mathematics; Function (biology); Analysis of variance; Regression analysis; Statistics; Regression; Econometrics; Hybrid Monte Carlo; Markov chain Monte Carlo","retraction":null,"screen_n_in":null,"score":{"opus":0.06896326735752921,"gpt":0.276700553866035,"spread":0.2077372865085058,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003600347,0.0001915357,0.0004511805,0.00004288287,0.00006075183,0.000008015614,0.0001323872,0.0001833957,0.001356698],"category_scores_gemma":[0.0002791308,0.0000774642,0.0001779116,0.00003578421,0.0003436106,0.00006627906,0.00006526896,0.0002425023,0.000009398239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001837627,"about_ca_system_score_gemma":0.000009419168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004983446,"about_ca_topic_score_gemma":0.000009521583,"domain_scores_codex":[0.9986678,0.00005275496,0.0006763091,0.0001470646,0.0003902913,0.00006576748],"domain_scores_gemma":[0.9978649,0.000573346,0.0009769098,0.0003958786,0.0001686311,0.00002030751],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004717569,0.00006080427,0.000009623905,0.000223133,0.0000577898,6.010573e-8,0.0003853788,2.392024e-8,0.00002940926,0.9970136,0.00183362,0.0003394216],"study_design_scores_gemma":[0.0005504666,0.00005808091,0.00003723018,0.0007184045,0.000130161,0.000003094125,0.0000419703,0.002461084,0.0001668923,0.9940152,0.001729781,0.00008767971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001598188,0.0001727364,0.0153948,0.000681734,0.0001016151,0.001005651,0.00001616754,0.00002629955,0.9810028],"genre_scores_gemma":[0.07921497,0.0001541929,0.009616063,0.0001972477,0.00005696199,0.00002749385,0.00001994108,0.00005886108,0.9106542],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.07761678,"threshold_uncertainty_score":0.9995562,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149736324","doi":"10.1016/s0165-1889(99)00087-1","title":"Applications of randomized low discrepancy sequences to the valuation of complex securities","year":2000,"lang":"en","type":"article","venue":"Journal of Economic Dynamics and Control","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Monte Carlo method; Benchmark (surveying); Valuation (finance); Quasi-Monte Carlo method; Computer science; Statistical hypothesis testing; Algorithm; Unit cube; Mathematical optimization; Mathematics; Applied mathematics; Hybrid Monte Carlo; Econometrics; Statistics; Economics; Finance; Discrete mathematics; Markov chain Monte Carlo","retraction":null,"screen_n_in":null,"score":{"opus":0.0203554062319892,"gpt":0.2865801979334718,"spread":0.2662247917014826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00115748,0.00006899925,0.0005066978,0.00005836542,0.00003601652,0.00002425487,0.0001173508,0.00002728847,0.0002912931],"category_scores_gemma":[0.0001390843,0.00004125757,0.0001483303,0.00003331705,0.0000898342,0.00008943726,0.000005756424,0.00005541599,0.000002707693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002951805,"about_ca_system_score_gemma":0.00003842009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001249039,"about_ca_topic_score_gemma":0.00004600586,"domain_scores_codex":[0.998788,0.0000909843,0.0009102177,0.00005385248,0.00009956866,0.00005736671],"domain_scores_gemma":[0.9984732,0.0006189575,0.00063569,0.0001065464,0.0001311272,0.00003453243],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008066185,0.00006018132,0.00001309947,0.00007426718,0.0001033574,4.60493e-8,0.0006420483,0.0001802981,0.00004925407,0.9851969,0.00008200618,0.01279192],"study_design_scores_gemma":[0.006905932,0.00005408857,0.00003676639,0.00005987542,0.00009802692,0.000007257908,0.0003465367,0.4110462,0.00004123208,0.5812299,0.0001317789,0.00004246452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4381917,0.0001648071,0.5496776,0.003870411,0.00005805151,0.001287678,0.00008496464,0.000006229339,0.006658626],"genre_scores_gemma":[0.9925996,0.00009796912,0.006861495,0.00006957351,0.00006195704,0.00003461435,0.000002746005,0.000005049914,0.0002670174],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.554408,"threshold_uncertainty_score":0.3189454,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963647060","doi":"10.1016/j.jat.2007.04.015","title":"Sharp Jackson inequalities","year":2007,"lang":"en","type":"article","venue":"Journal of Approximation Theory","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Trigonometry; Unit sphere; Exponential function; Algebraic number; Smoothness; Trigonometric polynomial; Combinatorics; Pure mathematics; Inequality; Exponential type; Type (biology); Algebra over a field; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05918308603531314,"gpt":0.3450816928969012,"spread":0.2858986068615881,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007191198,0.0001488333,0.0003267924,0.0002868641,0.00007266249,0.00005889527,0.0002115695,0.0001061055,0.000863014],"category_scores_gemma":[0.002489589,0.0001070663,0.000175391,0.0001908057,0.00006632737,0.0004997789,0.00002198217,0.0002582256,0.00004255076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008506265,"about_ca_system_score_gemma":0.00004357075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.716621e-7,"about_ca_topic_score_gemma":0.000001241773,"domain_scores_codex":[0.9977569,0.0001680442,0.001229847,0.00009416039,0.0005564234,0.0001946197],"domain_scores_gemma":[0.9970163,0.001236684,0.000979342,0.0001899187,0.0004664582,0.0001112799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001243219,0.0001721281,0.00001206756,0.0001455476,0.00003307524,0.000003168365,0.002455364,8.360309e-7,0.0008631822,0.9854056,0.002333199,0.008451569],"study_design_scores_gemma":[0.000449697,0.0001174191,0.00006930922,0.0001200326,0.00003557512,0.00007673717,0.003113787,0.0004810738,0.0177433,0.9758872,0.001783737,0.0001221145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1374042,0.00005841695,0.8224554,0.0003528661,0.00022842,0.0001898639,0.000002225168,0.00005096964,0.03925761],"genre_scores_gemma":[0.6925324,0.00001557333,0.3035964,0.0004428747,0.0006110761,0.000006598563,0.000006628351,0.00004648367,0.002741949],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5551282,"threshold_uncertainty_score":0.9449398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124189866","doi":"10.1287/mnsc.1120.1568","title":"Pricing and Hedging with Discontinuous Functions: Quasi–Monte Carlo Methods and Dimension Reduction","year":2012,"lang":"en","type":"article","venue":"Management Science","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Actua; University of Waterloo","funders":"","keywords":"Classification of discontinuities; Discontinuity (linguistics); Dimension (graph theory); Variance reduction; Computer science; Quasi-Monte Carlo method; Mathematical optimization; Monte Carlo method; Applied mathematics; Effective dimension; Mathematics; Hybrid Monte Carlo; Mathematical analysis; Markov chain Monte Carlo; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03982419464268903,"gpt":0.3517830067338021,"spread":0.311958812091113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001617813,0.00009667175,0.0001128797,0.0001373311,0.0003005163,0.0001170903,0.00005943963,0.00001365107,0.00001542033],"category_scores_gemma":[0.0001531305,0.0000649529,0.00001083545,0.0003264296,0.0001915448,0.0007392643,0.00008944112,0.00005806752,0.000003547025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003810712,"about_ca_system_score_gemma":0.000003918631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006722952,"about_ca_topic_score_gemma":0.000001515997,"domain_scores_codex":[0.9991171,0.00004432966,0.0001657583,0.0002191988,0.0002480048,0.0002055858],"domain_scores_gemma":[0.9995547,0.00007416995,0.00008656326,0.0001730457,0.00002979377,0.00008172263],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002384746,0.0002707537,0.0009319958,0.0005115728,0.00003193778,0.000001106366,0.006620551,0.000005973007,0.0043021,0.8202226,0.0002981092,0.1667795],"study_design_scores_gemma":[0.003993224,0.001393018,0.0320933,0.002707478,0.001350373,0.0006870353,0.1436166,0.3838505,0.03102566,0.380439,0.01569244,0.003151378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5238817,0.00006634754,0.4637729,0.0002158079,0.0001172037,0.0003946352,1.978733e-7,0.0000740147,0.01147722],"genre_scores_gemma":[0.6244065,0.00001780408,0.3742819,0.00002911356,0.00002164086,0.00002634507,2.762522e-7,0.000006406688,0.001209981],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4397836,"threshold_uncertainty_score":0.2648703,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2398934262","doi":"10.1145/2754929","title":"Algorithm 958","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Lattice (music); Algorithm; Mathematics; Normalization (sociology); Computer science; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.05285829829686607,"gpt":0.3135045556838899,"spread":0.2606462573870238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003898797,0.0003143676,0.0004136932,0.0001393541,0.000204748,0.00005596672,0.0004517032,0.0001960396,0.01058651],"category_scores_gemma":[0.002436394,0.0001823375,0.0002636085,0.0002559294,0.0001401409,0.0002703005,0.00001312882,0.0002210795,0.002785113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001080127,"about_ca_system_score_gemma":0.00003174564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.993623e-7,"about_ca_topic_score_gemma":0.000001772898,"domain_scores_codex":[0.9978885,0.0000875187,0.0006520189,0.0003885477,0.0005903571,0.0003930647],"domain_scores_gemma":[0.9957731,0.002720554,0.0001237547,0.0010049,0.0001473741,0.0002303315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001699609,0.0007153206,0.000001669893,0.0001464177,0.00005454344,0.000003610536,0.0001950028,3.778077e-7,0.0001220114,0.09974608,0.0004362975,0.8985617],"study_design_scores_gemma":[0.0005641115,0.0001247394,0.00000664918,0.0003013442,0.00005349839,0.00002822138,0.00006064025,0.000150619,0.005476923,0.9912893,0.00166165,0.0002822675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001383301,0.000004902961,0.9935606,0.002524548,0.0001053062,0.0004567867,0.00005289282,0.0007197993,0.001191856],"genre_scores_gemma":[0.002854967,0.00001043623,0.9884828,0.0002794018,0.00005792566,0.0002041382,0.000002759611,0.00006321483,0.008044301],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8982794,"threshold_uncertainty_score":0.9979913,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043718124","doi":"10.1007/s00454-007-1345-4","title":"Multiple Coverings of the Plane with Triangles","year":2007,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Mathematics; Combinatorics; Plane (geometry); Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02555882728740597,"gpt":0.2870210564526353,"spread":0.2614622291652293,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003978934,0.000110068,0.0001750357,0.00009262493,0.00007308346,0.00001971213,0.0001507571,0.00004567962,0.0001777642],"category_scores_gemma":[0.0005299468,0.00006317157,0.00007577024,0.0003908778,0.00009222493,0.00008423307,0.00003415366,0.0001027682,0.0000116601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002541145,"about_ca_system_score_gemma":0.00002981012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008407892,"about_ca_topic_score_gemma":0.00001520617,"domain_scores_codex":[0.9988735,0.00002544885,0.0003666769,0.0001259092,0.0004752549,0.0001331758],"domain_scores_gemma":[0.9983851,0.001046958,0.0002218066,0.0001568052,0.0001445467,0.00004483034],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001711502,0.0002098567,0.00519975,0.0002354297,0.00007655837,0.000001711278,0.0008033389,0.0007444844,0.0003208365,0.9897895,0.0008649018,0.001582407],"study_design_scores_gemma":[0.002852509,0.0002670406,0.08150619,0.0003635007,0.00008722222,0.00005186474,0.001428082,0.046062,0.01382172,0.8513553,0.001726819,0.0004778272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5936434,0.000008849732,0.4000057,0.0001652938,0.00004361773,0.0002368402,0.00002427977,0.00003437201,0.00583763],"genre_scores_gemma":[0.9256011,3.098879e-7,0.07388123,0.00009653668,0.00003114174,0.000005226322,0.00003008317,0.00001232952,0.0003420428],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3319576,"threshold_uncertainty_score":0.2576062,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100184918","doi":"10.1145/2133390.2133393","title":"Evolutionary optimization of low-discrepancy sequences","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Curse of dimensionality; Sequence (biology); Latin hypercube sampling; Hypercube; Computer science; Algorithm; Pseudorandom number generator; Generator (circuit theory); Evolutionary algorithm; Mathematics; Theoretical computer science; Mathematical optimization; Combinatorics; Artificial intelligence; Power (physics); Monte Carlo method; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.06769827072555362,"gpt":0.3173805783833438,"spread":0.2496823076577902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001908633,0.0001117834,0.0001483336,0.0001098437,0.0001220229,0.00001809046,0.00007047926,0.00007556874,0.00007433751],"category_scores_gemma":[0.0000482127,0.00009671077,0.0000571456,0.0001247555,0.00002408638,0.0003811663,0.000004670637,0.0000875112,0.00000395269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002363993,"about_ca_system_score_gemma":0.00001143717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005413474,"about_ca_topic_score_gemma":5.432233e-7,"domain_scores_codex":[0.9991468,0.00005404722,0.0003515274,0.0001331998,0.0001934177,0.0001209884],"domain_scores_gemma":[0.9992489,0.0002618914,0.00009187176,0.0002158304,0.0001253886,0.00005611001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001557196,0.0001889774,0.00001136823,0.00008015379,0.0000143536,2.663925e-8,0.0006033031,0.967678,0.000008198359,0.02471825,0.000004169882,0.006677669],"study_design_scores_gemma":[0.0001751886,0.00004583685,0.00001218531,0.00008877282,0.00002346863,0.000001953901,0.00005557533,0.9067748,0.000109461,0.09261891,0.000003513123,0.00009040743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06198303,0.0000291661,0.9373639,0.00008928573,0.0001035669,0.0001679308,0.000004160296,0.00008075832,0.0001782518],"genre_scores_gemma":[0.6265638,0.000008870088,0.3733176,0.00002374668,0.00004146916,0.000008426357,0.00000713135,0.000007440134,0.00002143046],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5645808,"threshold_uncertainty_score":0.3943751,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046767550","doi":"10.1016/s0378-4754(00)00254-8","title":"On selection criteria for lattice rules and other quasi-Monte Carlo point sets","year":2001,"lang":"en","type":"article","venue":"Mathematics and Computers in Simulation","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monte Carlo method; Lattice (music); Linear subspace; Quasi-Monte Carlo method; Computation; Statistical physics; Mathematics; Mathematical optimization; Computer science; Hybrid Monte Carlo; Applied mathematics; Algorithm; Markov chain Monte Carlo; Pure mathematics; Statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0637150112716669,"gpt":0.3560813593507082,"spread":0.2923663480790413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005139418,0.0001890555,0.0002894577,0.0001450008,0.0001011431,0.0001232021,0.00005863736,0.0001017524,0.00003808727],"category_scores_gemma":[0.0003284078,0.0001602361,0.00004474517,0.0001096089,0.00003217087,0.0001458692,0.00002481995,0.00008936726,0.00000457041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004283154,"about_ca_system_score_gemma":0.000006788009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006530559,"about_ca_topic_score_gemma":0.00001697049,"domain_scores_codex":[0.9989085,0.0000453233,0.0004652886,0.0002390237,0.0001702339,0.0001716911],"domain_scores_gemma":[0.9982134,0.001345226,0.0001618265,0.0001428151,0.00008079686,0.00005598123],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007820336,0.0005089106,0.0001203504,0.0006408258,0.0000266859,0.000001289619,0.004445347,0.0005940564,0.00004962317,0.9853386,0.0002990703,0.007897044],"study_design_scores_gemma":[0.0004142454,0.0001042185,0.00005285205,0.0001458686,0.0000132341,0.000008811356,0.0001219585,0.5530866,0.00001640968,0.4457831,0.0001519735,0.0001007222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5431724,0.00001051104,0.4551569,0.0001795147,0.00005191261,0.0005386714,0.00000548699,0.00005680155,0.0008278976],"genre_scores_gemma":[0.6163589,0.000005905278,0.3831401,0.0002645464,0.00004760162,0.00005248907,0.000004341007,0.00003071367,0.00009548286],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5524925,"threshold_uncertainty_score":0.653424,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1814198588","doi":"10.1007/s00365-016-9327-5","title":"Universal Lower Bounds for Potential Energy of Spherical Codes","year":2016,"lang":"en","type":"article","venue":"Constructive Approximation","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Cardinality (data modeling); Dimension (graph theory); Monotone polygon; Function (biology); Product (mathematics); Combinatorics; Code (set theory); Point (geometry); Energy (signal processing); Upper and lower bounds; Discrete mathematics; Applied mathematics; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02345914762465379,"gpt":0.2725111423501854,"spread":0.2490519947255316,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002183837,0.0001513698,0.0002880511,0.00007403713,0.00007041403,0.00002091127,0.0001153348,0.0001146036,0.0004206445],"category_scores_gemma":[0.0004757417,0.0001018666,0.0001377448,0.000129989,0.0002896124,0.0003083682,0.00002784064,0.0000385276,0.000006246311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008308945,"about_ca_system_score_gemma":0.000057906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004118323,"about_ca_topic_score_gemma":0.000002306794,"domain_scores_codex":[0.9988692,0.00006505178,0.0004395767,0.0002195498,0.0002385508,0.0001680635],"domain_scores_gemma":[0.998571,0.0004426289,0.0003105242,0.0002039635,0.0004150573,0.00005684339],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001147487,0.0001136227,0.0000191913,0.00007939147,0.00003812742,2.408499e-7,0.0001068446,2.610606e-7,0.0205314,0.9662192,0.0007662291,0.01201074],"study_design_scores_gemma":[0.001063715,0.0001403823,0.00002793934,0.00008258356,0.00004845949,0.00000960203,0.0003036277,0.006361256,0.06314585,0.9280869,0.0005727683,0.0001569524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05605816,0.000006164582,0.9369544,0.0002538988,0.0001426045,0.0003281385,0.00004700088,0.00006756496,0.006142023],"genre_scores_gemma":[0.7168115,0.000003863627,0.2823511,0.00002308736,0.00007271038,0.00006350588,0.00001514076,0.00001983144,0.0006393392],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6607533,"threshold_uncertainty_score":0.4605762,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168027844","doi":"10.5555/1162708.1163035","title":"A study of variance reduction techniques for American option pricing","year":2005,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Control variates; Monte Carlo methods for option pricing; Variance reduction; Monte Carlo method; Estimator; Importance sampling; Valuation of options; Variance (accounting); Asian option; Binomial options pricing model; Computer science; Exotic option; Finite difference methods for option pricing; Econometrics; Reduction (mathematics); Mathematical optimization; Mathematics; Markov chain Monte Carlo; Economics; Rational pricing; Statistics; Hybrid Monte Carlo; Accounting; Capital asset pricing model","retraction":null,"screen_n_in":null,"score":{"opus":0.1084438889718153,"gpt":0.395464174855597,"spread":0.2870202858837817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002928189,0.0001110419,0.0002205677,0.0001005203,0.00005115626,0.0000336274,0.00009654894,0.00003671102,0.00007252525],"category_scores_gemma":[0.0003486554,0.00009682358,0.0000474519,0.0001480559,0.00003655275,0.000268128,0.00001686679,0.00006585279,0.000004961805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004874739,"about_ca_system_score_gemma":0.0000173414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007240414,"about_ca_topic_score_gemma":0.00001171671,"domain_scores_codex":[0.9989753,0.00005688511,0.0004956433,0.0001931978,0.0001798122,0.00009916338],"domain_scores_gemma":[0.9987829,0.0002107118,0.0003601558,0.0002137318,0.000404865,0.00002762789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000220715,0.002124033,0.0001201682,0.0002461102,0.00007036526,1.531452e-7,0.01997826,0.002235391,0.006761264,0.7633477,0.0002585044,0.2046373],"study_design_scores_gemma":[0.0006696281,0.0007897838,0.0002346582,0.0001596147,0.00005424378,0.000002372647,0.003256155,0.8857515,0.02069002,0.08730402,0.0008692309,0.0002188074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2576932,7.31666e-7,0.7398732,0.0001846149,0.00003034002,0.0008602882,0.000002111774,0.00009760743,0.0012579],"genre_scores_gemma":[0.8379218,5.298901e-7,0.1615631,0.00001975994,0.00008232913,0.0001047203,0.000004749877,0.00001076151,0.0002922581],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8835161,"threshold_uncertainty_score":0.3948351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2752127906","doi":"10.1287/moor.2017.0861","title":"Negative Dependence, Scrambled Nets, and Variance Bounds","year":2017,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Monte Carlo method; Estimator; Importance sampling; Quasi-Monte Carlo method; Applied mathematics; Sampling (signal processing); Monte Carlo integration; Joint probability distribution; Generalization; Hybrid Monte Carlo; Statistics; Markov chain Monte Carlo; Computer science; Filter (signal processing); Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.2484975107877077,"gpt":0.4824369159611381,"spread":0.2339394051734304,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.00289006,0.0001751652,0.0003921104,0.0002145792,0.001330942,0.0008845301,0.0006281138,0.0001446243,0.0005004304],"category_scores_gemma":[0.01241185,0.0001397811,0.000062046,0.0001798419,0.0006455952,0.0006454031,0.0002864237,0.0004112543,0.00006704831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004558081,"about_ca_system_score_gemma":0.0001362899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000100267,"about_ca_topic_score_gemma":0.0001962602,"domain_scores_codex":[0.9977043,0.0001710379,0.0006452283,0.0002885046,0.0008660175,0.0003249167],"domain_scores_gemma":[0.9964706,0.001110993,0.0001600661,0.001106112,0.001019201,0.0001330172],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007840403,0.0003116185,0.00002697953,0.0003270705,0.00003186595,0.000001560248,0.002331443,0.000004624193,0.001894285,0.9933051,0.00105794,0.0006996947],"study_design_scores_gemma":[0.0004642778,0.0001056418,0.000170176,0.0002706577,0.00001940501,0.00001346025,0.001324099,0.1100492,0.009320087,0.8778764,0.0002194066,0.0001672329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6594409,0.00007514345,0.1582105,0.004592649,0.0001314876,0.00250909,0.0000490602,0.0001192625,0.1748719],"genre_scores_gemma":[0.6257904,0.00003874119,0.3680446,0.00001821424,0.0000416211,0.0001440392,0.000004050415,0.00002764609,0.005890805],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2098341,"threshold_uncertainty_score":0.9999692,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2550265542","doi":"10.1007/s00365-017-9412-4","title":"The Stolarsky Principle and Energy Optimization on the Sphere","year":2018,"lang":"en","type":"article","venue":"Constructive Approximation","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Geodesic; Mathematics; Euclidean geometry; Point (geometry); Pairwise comparison; Finite set; Discrete geometry; Set (abstract data type); Energy (signal processing); Euclidean distance; Combinatorics; Mathematical analysis; Pure mathematics; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03215655093242278,"gpt":0.2896524401664572,"spread":0.2574958892340344,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005606267,0.0001600124,0.0001362592,0.00003528476,0.0007304783,0.0001782053,0.0001596419,0.00007948998,0.000256605],"category_scores_gemma":[0.001237863,0.00008362091,0.00004093179,0.0001974999,0.0005378154,0.0001971392,0.0000506403,0.0001249089,0.0000246394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005203883,"about_ca_system_score_gemma":0.00003267961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003047146,"about_ca_topic_score_gemma":0.00001480596,"domain_scores_codex":[0.9988167,0.0001812442,0.0003277025,0.0002179996,0.0002870328,0.000169302],"domain_scores_gemma":[0.9981478,0.0009149911,0.0002397216,0.0003440868,0.0003085509,0.00004477761],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002318841,0.00002599316,0.00001214207,0.00001308747,0.00001816366,7.407389e-8,0.0003600716,0.000004008341,0.00007626238,0.9850623,0.0006249381,0.01377974],"study_design_scores_gemma":[0.0002485345,0.0001003829,0.00006218545,0.0000501561,0.00002174932,0.00001458445,0.00103347,0.2323181,0.005184641,0.7566723,0.004151489,0.0001424399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09098142,0.00002955293,0.8292493,0.002261678,0.0002189199,0.0006043225,0.000006888721,0.000143956,0.07650395],"genre_scores_gemma":[0.8334695,0.00004441777,0.162559,0.0006990792,0.0003961925,0.0003575342,0.00002245018,0.00005784611,0.002393923],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7424881,"threshold_uncertainty_score":0.5618322,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140984273","doi":"","title":"Planar Case of the Maximum Box and Related Problems","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Cardinality (data modeling); Planar; Combinatorics; Mathematics; Extension (predicate logic); Planar graph; Approximation algorithm; Discrete mathematics; Computer science; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.04753680883092413,"gpt":0.273286509639956,"spread":0.2257497008090319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000255106,0.0001065898,0.0001456105,0.0001716443,0.00012774,0.00003500158,0.00008409158,0.00007785467,0.0007820737],"category_scores_gemma":[0.000488613,0.00007759854,0.00003873172,0.0003115021,0.00009534866,0.00005012262,0.000006181774,0.0001465311,0.00002098789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005513278,"about_ca_system_score_gemma":0.0002974702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007160645,"about_ca_topic_score_gemma":0.003328571,"domain_scores_codex":[0.9991684,0.00007736228,0.0002936022,0.0001484965,0.000168313,0.000143812],"domain_scores_gemma":[0.9991264,0.0002757985,0.0001199067,0.0001457992,0.0001742844,0.0001578203],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[7.933141e-7,0.00002467698,0.00007680035,0.00005804756,0.00001444018,0.000009431068,0.0002656563,0.00005226379,0.000006892083,0.9979678,0.0006866445,0.0008365195],"study_design_scores_gemma":[0.0002020897,0.00003246834,0.0002491316,0.00007697751,0.00001086656,0.0003578364,0.0002928941,0.01028482,0.00006353323,0.9878517,0.0004809649,0.00009670768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7343409,0.00005366727,0.02583701,0.003820556,0.0002821276,0.001133727,0.0001600902,0.00006178091,0.2343102],"genre_scores_gemma":[0.9889485,0.000001068854,0.01014354,0.0002055141,0.000005056209,0.000009716137,0.000009042546,0.000009191936,0.0006683264],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2546076,"threshold_uncertainty_score":0.8563159,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966562959","doi":"10.1007/bf02868475","title":"Mean square discrepancy bounds for the number of lattice points in large convex bodies","year":2002,"lang":"en","type":"article","venue":"Journal d Analyse Mathématique","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Square lattice; Convex body; Mathematics; Regular polygon; Combinatorics; Lattice (music); Square (algebra); Mean square; Geometry; Mathematical analysis; Physics; Convex hull; Statistical physics","retraction":null,"screen_n_in":null,"score":{"opus":0.05321851139907263,"gpt":0.3478303496642507,"spread":0.2946118382651781,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001666057,0.0001980625,0.0005090846,0.0001354204,0.0001860047,0.0001293711,0.0002669317,0.000109321,0.002515953],"category_scores_gemma":[0.001672874,0.0001172823,0.0003177848,0.0002343174,0.00005823995,0.000299043,0.00003706478,0.0003522007,0.00004892728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007103355,"about_ca_system_score_gemma":0.00002471562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009688768,"about_ca_topic_score_gemma":0.0001469804,"domain_scores_codex":[0.9979125,0.0001767582,0.001093193,0.0001482479,0.0003887226,0.0002806296],"domain_scores_gemma":[0.9974811,0.001188872,0.0006126681,0.0003140001,0.0003214958,0.00008185163],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002509811,0.0006025934,0.00194233,0.000580699,0.000169777,0.000005195972,0.01261608,0.000003010144,0.00004858818,0.9772099,0.006349628,0.00044708],"study_design_scores_gemma":[0.0009600346,0.00005159284,0.0008979393,0.0003778867,0.0001732594,0.0001088321,0.003886085,0.149984,0.0003753509,0.8413171,0.001662405,0.0002054714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5734085,0.0004815824,0.3798895,0.01216702,0.0002939135,0.001613329,0.00008319206,0.0001156748,0.03194719],"genre_scores_gemma":[0.9064349,0.0002065789,0.0896851,0.0004019783,0.0001607641,0.00009412407,0.000006447792,0.00004823103,0.002961904],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3330263,"threshold_uncertainty_score":0.9983959,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018442047","doi":"10.1007/s00605-008-0039-1","title":"L p discrepancy of generalized two-dimensional Hammersley point sets","year":2008,"lang":"de","type":"article","venue":"Monatshefte für Mathematik","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Paul University","funders":"","keywords":"Combinatorics; Point (geometry); Mathematics; Set (abstract data type); Order (exchange); Permutation (music); Computer science; Physics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.04787990544494705,"gpt":0.320210691786666,"spread":0.2723307863417189,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001333437,0.001021212,0.001992079,0.0004345853,0.0004358696,0.00008082305,0.0007192283,0.0004479279,0.008796213],"category_scores_gemma":[0.001527196,0.0008465329,0.0009293971,0.0006606005,0.0005854474,0.0005179003,0.0003455435,0.0006544673,0.002141965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002020557,"about_ca_system_score_gemma":0.0002813482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008422293,"about_ca_topic_score_gemma":0.00001202567,"domain_scores_codex":[0.9926978,0.0004289172,0.003119598,0.0009290628,0.001912183,0.0009124244],"domain_scores_gemma":[0.9944691,0.00102653,0.001752642,0.001561135,0.0007283969,0.0004621696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002347587,0.003664622,0.00006868022,0.00319693,0.0008171533,0.0001012902,0.01110007,0.000086295,0.003562313,0.9169439,0.05890042,0.001323532],"study_design_scores_gemma":[0.004209568,0.0003570366,0.0001089606,0.001562175,0.0006317316,0.0002969468,0.0005359903,0.1242133,0.02498237,0.8385395,0.003140104,0.00142236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.8828546,0.005028665,0.04173965,0.004458718,0.002108654,0.004756828,0.0006246797,0.0007759695,0.05765228],"genre_scores_gemma":[0.388631,0.00058106,0.5860325,0.001001163,0.0008126432,0.0004180124,0.000541341,0.0005133238,0.02146889],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5442929,"threshold_uncertainty_score":0.9993985,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019774049","doi":"10.1214/11-ejs615","title":"Estimation and detection of functions from anisotropic Sobolev classes","year":2011,"lang":"en","type":"article","venue":"Electronic Journal of Statistics","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Russian Foundation for Basic Research","keywords":"Mathematics; Minimax; Sobolev space; Estimator; Applied mathematics; Minimax estimator; White noise; Function (biology); Asymptotically optimal algorithm; Gaussian; Gaussian noise; Connection (principal bundle); Mathematical optimization; Mathematical analysis; Statistics; Algorithm; Minimum-variance unbiased estimator","retraction":null,"screen_n_in":null,"score":{"opus":0.03514849318215581,"gpt":0.2746813717635521,"spread":0.2395328785813963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002460435,0.00009081438,0.0002193946,0.00009290571,0.00004573646,0.00001361003,0.00006309223,0.00005401264,0.0001924547],"category_scores_gemma":[0.0006286211,0.00007328262,0.00003751878,0.00008708108,0.00005250564,0.0001628092,0.000009374603,0.0002088433,0.000004724169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006583741,"about_ca_system_score_gemma":0.0000949335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002004299,"about_ca_topic_score_gemma":0.00006783156,"domain_scores_codex":[0.9989783,0.00005339377,0.0005535749,0.00006924013,0.0002055184,0.0001399944],"domain_scores_gemma":[0.9987571,0.0003018633,0.000557441,0.00008976962,0.0002481481,0.00004564938],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007165267,0.0001983835,0.00008436343,0.00008716043,0.0001008665,0.000001221032,0.001008436,0.000001944095,0.004688617,0.9551269,0.0003322819,0.03829814],"study_design_scores_gemma":[0.0003659327,0.000549179,0.0007860721,0.0000474841,0.0001411382,0.00003009839,0.0003807049,0.01274886,0.01309761,0.9716938,0.00008778165,0.00007129112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1823145,0.00009282234,0.8170015,0.00001896889,0.0000635515,0.00006868054,0.00001904867,0.000009312889,0.0004116194],"genre_scores_gemma":[0.8199224,0.00008944584,0.1798624,0.000008323468,0.00003202122,0.000001821252,0.000004114554,0.000009668669,0.00006973824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6376079,"threshold_uncertainty_score":0.2988378,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W203308056","doi":"10.1007/978-3-642-56046-0_21","title":"Construction of Equidistributed Generators Based on Linear Recurrences Modulo 2","year":2002,"lang":"en","type":"book-chapter","venue":"","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Equidistributed sequence; Modulo; Mathematics; Point (geometry); Simple (philosophy); Algorithm; Software; Discrete mathematics; Computer science; Geometry; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.09525843643708354,"gpt":0.2982920499256407,"spread":0.2030336134885571,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001976687,0.0003020733,0.0004969963,0.0001699821,0.00004530963,0.00001887059,0.0001335,0.000356529,0.0130552],"category_scores_gemma":[0.0003164448,0.0002280658,0.0001942133,0.00005074047,0.0001254056,0.00004963407,0.00001635346,0.000247862,0.0001563752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005751445,"about_ca_system_score_gemma":0.00004194474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001262885,"about_ca_topic_score_gemma":0.000001648902,"domain_scores_codex":[0.9983364,0.00002577838,0.0007519962,0.0002679664,0.0004930501,0.0001247585],"domain_scores_gemma":[0.9985008,0.0002596783,0.0005040673,0.0003742829,0.0002910662,0.00007013821],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009703089,0.00006526637,4.426276e-7,0.0002302196,0.00002311842,4.981068e-7,0.00001732129,0.000003929381,0.00001149097,0.98858,0.008578533,0.002479409],"study_design_scores_gemma":[0.0002490373,0.0001906006,1.316678e-7,0.0004215034,0.00005818354,0.000002617359,0.00001335089,0.1045459,0.004184342,0.8788686,0.01117761,0.0002880682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.0001320226,0.00001349957,0.09985991,0.0001936372,0.0001955941,0.0004235661,0.0001661576,0.0001307408,0.8988849],"genre_scores_gemma":[0.00398577,0.0001329555,0.6288684,0.000272902,0.0004648396,0.0000553914,0.0007347852,0.0001474219,0.3653376],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.5335473,"threshold_uncertainty_score":0.987847,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036400190","doi":"10.1117/12.615759","title":"Mutually unbiased bases, spherical designs, and frames","year":2005,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Army Research Office; Mitacs; National Science Foundation","keywords":"Mutually unbiased bases; Dimension (graph theory); Orthonormal basis; Mathematics; Combinatorics; Observable; Discrete mathematics; Prime power; Upper and lower bounds; Prime (order theory); Physics; Pure mathematics; Hilbert space; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.0267971855973071,"gpt":0.2630379645977112,"spread":0.2362407790004041,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007515951,0.0003149216,0.0004639383,0.00006903434,0.00008421033,0.0001359809,0.0005375639,0.0002113681,0.00008434744],"category_scores_gemma":[0.002142043,0.0002401173,0.0004179839,0.000234055,0.0002325253,0.000540703,0.0001110078,0.0003049726,0.000003420349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001186963,"about_ca_system_score_gemma":0.00003022667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003637449,"about_ca_topic_score_gemma":2.281206e-7,"domain_scores_codex":[0.9978026,2.757863e-8,0.0008371428,0.0003410802,0.0006935862,0.0003255704],"domain_scores_gemma":[0.9977785,0.0004784995,0.0003853553,0.0000638502,0.001142093,0.0001517418],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000055311,0.0002583037,0.00004875287,0.0005672362,0.000181031,3.765791e-8,0.0003152017,0.000005780742,0.09987199,0.8859046,0.01189136,0.0009003713],"study_design_scores_gemma":[0.004631728,0.001153845,0.0004883516,0.001401295,0.0006551516,0.00007249946,0.005630744,0.3812624,0.3480675,0.226871,0.02826232,0.001503146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.9887619,0.00006635088,0.001552163,0.004343838,0.00006935532,0.0006063891,0.00002332674,0.0001202617,0.004456401],"genre_scores_gemma":[0.1426873,0.00006144365,0.8557676,0.0003126263,0.0004031444,0.0001565234,0.000007104788,0.00006659836,0.0005376795],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8542154,"threshold_uncertainty_score":0.9791701,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146339353","doi":"10.5555/1516744.1516782","title":"Approximate zero-variance simulation","year":2008,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Estimator; Variance reduction; Convergence (economics); Context (archaeology); Variance (accounting); Rate of convergence; Control variates; Monte Carlo method; Central limit theorem; Applied mathematics; Computer science; Exponential function; Zero (linguistics); Mean squared error; Mathematical optimization; Range (aeronautics); Square root; Limit (mathematics); Mathematics; Statistics; Markov chain Monte Carlo; Hybrid Monte Carlo","retraction":null,"screen_n_in":null,"score":{"opus":0.1488611999253764,"gpt":0.3535760245337826,"spread":0.2047148246084062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002595584,0.0002411318,0.0003027881,0.0001122021,0.0001997759,0.00007675827,0.0002090423,0.0001329023,0.001746527],"category_scores_gemma":[0.0009050168,0.0002099726,0.0001056889,0.0002159809,0.0000971976,0.0005435005,0.00004814216,0.0001817765,0.0003026819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000570688,"about_ca_system_score_gemma":0.00004918693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003107497,"about_ca_topic_score_gemma":0.000002755898,"domain_scores_codex":[0.9982393,0.0000993764,0.0006391252,0.0003525234,0.0004202259,0.0002493865],"domain_scores_gemma":[0.9980921,0.0006467146,0.0002615297,0.0004299507,0.0004659821,0.0001037376],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000110534,0.0004149378,0.0004674892,0.0002135799,0.00005136753,0.000007877849,0.005402662,0.04559788,0.0005975462,0.9403093,0.001557684,0.005269071],"study_design_scores_gemma":[0.000359897,0.00003479515,0.0002555305,0.00006190238,0.00001149013,0.000005678797,0.00003779734,0.7632847,0.000530665,0.2337809,0.001439268,0.000197389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06616561,0.000005299923,0.9132953,0.0002252277,0.0001437012,0.0004385241,0.000006886806,0.0003035907,0.01941591],"genre_scores_gemma":[0.9537438,0.000002727244,0.04216107,0.0002028824,0.00008354984,0.00003436406,0.00002487079,0.00002772562,0.003719068],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8875781,"threshold_uncertainty_score":0.999166,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1502829000","doi":"10.1002/jcd.21379","title":"Complex Spherical Designs and Codes","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Projective test; Mathematics; Contrast (vision); Association scheme; Unit sphere; Scheme (mathematics); Combinatorics; Algebra over a field; Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1175981721119456,"gpt":0.3310637144322862,"spread":0.2134655423203406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006316723,0.0001449198,0.0004188355,0.00006724465,0.00007768822,0.0001364811,0.0001631198,0.00009602671,0.001245571],"category_scores_gemma":[0.0008206076,0.0001023145,0.0001018547,0.0001221478,0.00008204369,0.0003365436,0.00002561839,0.0002169679,0.00004263518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004579081,"about_ca_system_score_gemma":0.00005182446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004781865,"about_ca_topic_score_gemma":3.7127e-7,"domain_scores_codex":[0.9984704,0.0001821644,0.0006910761,0.00009100135,0.0004004515,0.0001649637],"domain_scores_gemma":[0.9980438,0.0007841927,0.0004155567,0.0001247837,0.0004486561,0.0001830121],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000354284,0.0002976757,0.00005061108,0.0000625215,0.00004306458,0.00000364263,0.0003287103,3.784376e-7,0.01083728,0.9552234,0.03196338,0.001153905],"study_design_scores_gemma":[0.0009584583,0.0004800167,0.0002969429,0.00005748504,0.000044562,0.00007062328,0.0001902319,0.001444638,0.003978254,0.9910302,0.001318267,0.0001302892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3203919,0.00007837659,0.6588998,0.001906703,0.001385746,0.0008678136,0.000002494072,0.00008194132,0.01638515],"genre_scores_gemma":[0.8181345,0.00001473614,0.1811546,0.0001253153,0.0003226728,0.00001033751,8.419258e-7,0.00002210958,0.0002148917],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4977426,"threshold_uncertainty_score":0.9996674,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032501875","doi":"10.1016/j.jat.2011.05.001","title":"Polynomial approximation in Sobolev spaces on the unit sphere and the unit ball","year":2011,"lang":"en","type":"article","venue":"Journal of Approximation Theory","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Unit sphere; Sobolev space; Continuation; Ball (mathematics); Mathematical analysis; Polynomial; Approximation theory; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07894267884593487,"gpt":0.285970843939676,"spread":0.2070281650937411,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006122364,0.0002433406,0.0004297241,0.0002079538,0.0001781805,0.0001369712,0.0004024598,0.0001365794,0.0007461545],"category_scores_gemma":[0.002328116,0.0001192682,0.0001517667,0.0003297345,0.000347439,0.0004485353,0.00005126004,0.0005693073,0.00003136262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004658534,"about_ca_system_score_gemma":0.00006826584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000749368,"about_ca_topic_score_gemma":0.00001438572,"domain_scores_codex":[0.9970255,0.001019407,0.001060149,0.0001567153,0.0005258002,0.0002123509],"domain_scores_gemma":[0.9960864,0.002157904,0.001075164,0.0003434603,0.0002608639,0.00007624178],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007335241,0.0002355606,0.0000372172,0.0000919911,0.00004764055,0.000001580567,0.01132241,0.000004698936,0.00008111929,0.9832127,0.0011479,0.003083627],"study_design_scores_gemma":[0.00209317,0.0001574395,0.0003785858,0.0002507007,0.00007428728,0.00005174022,0.01188723,0.009010543,0.002600886,0.9728653,0.0004632466,0.0001668097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8179345,0.0001605643,0.07993465,0.005383601,0.000287008,0.001663139,0.000006035171,0.00006405656,0.09456646],"genre_scores_gemma":[0.9754071,0.00005465249,0.0227389,0.0006408631,0.0001870723,0.00004663197,0.000003332462,0.00004067353,0.00088078],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1574726,"threshold_uncertainty_score":0.8169868,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W334971109","doi":"10.1007/978-3-642-27440-4_6","title":"On Figures of Merit for Randomly-Shifted Lattice Rules","year":2012,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Variance reduction; Estimator; Monte Carlo method; Mathematics; Parameterized complexity; Variance (accounting); Hypercube; Lattice (music); Ideal (ethics); Figure of merit; Function (biology); Applied mathematics; Mathematical optimization; Algorithm; Statistics; Computer science; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05326871236428959,"gpt":0.3125638287497554,"spread":0.2592951163854658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001399132,0.0007733194,0.001603544,0.0004700875,0.00009181224,0.0000907366,0.0004726277,0.0005802806,0.0009205302],"category_scores_gemma":[0.004716995,0.0006788165,0.0002719941,0.00007047413,0.0002058265,0.0001547452,0.0001011987,0.0006359002,0.0001152585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001620255,"about_ca_system_score_gemma":0.00007211362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002030943,"about_ca_topic_score_gemma":0.000006117,"domain_scores_codex":[0.9959888,0.00001199147,0.002060552,0.0004866114,0.0009182323,0.0005337559],"domain_scores_gemma":[0.9937105,0.003256843,0.001696187,0.0004091499,0.0007689436,0.0001583891],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001106959,0.0004032525,0.000001226692,0.01168327,0.0001325626,0.000001506315,0.001996244,1.506003e-7,0.00006473849,0.9779678,0.006497505,0.00114104],"study_design_scores_gemma":[0.001247236,0.0001745748,0.000002366067,0.002835866,0.0003754217,0.000005211744,0.0001235053,0.002486714,0.001072492,0.9828638,0.008183736,0.0006290732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.001964049,0.0004399903,0.2338248,0.0002019358,0.0004418266,0.006272289,0.001805065,0.000324468,0.7547256],"genre_scores_gemma":[0.0002568525,0.0001818249,0.9041395,0.00005664464,0.0002029323,0.0002749759,0.00009973813,0.0002847426,0.0945028],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6703147,"threshold_uncertainty_score":0.9999928,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1580383384","doi":"10.1007/3-540-31186-6_19","title":"Randomized Quasi-Monte Carlo Simulation of Markov Chains with an Ordered State Space","year":2006,"lang":"en","type":"book-chapter","venue":"","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Markov chain Monte Carlo; Statistical physics; Markov chain; Monte Carlo method; State space; Computer science; Markov chain mixing time; Markov model; Mathematics; Markov property; Physics; Statistics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.03601317939422394,"gpt":0.292351442886083,"spread":0.2563382634918591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007584297,0.0004807792,0.001430263,0.0002124187,0.00005228711,0.00005165581,0.0001532353,0.0002811357,0.001510792],"category_scores_gemma":[0.0002914141,0.0003142505,0.0002565779,0.00005051535,0.0001691944,0.0001787322,0.00002559574,0.0002433331,0.000023012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006488716,"about_ca_system_score_gemma":0.00007368763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008930971,"about_ca_topic_score_gemma":0.0004911643,"domain_scores_codex":[0.9975789,0.0001119948,0.001112099,0.0003590864,0.0006409938,0.0001968776],"domain_scores_gemma":[0.9968277,0.0009848503,0.0009761972,0.0005673622,0.0005490204,0.00009486194],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.007803129,0.0001934874,2.983847e-7,0.0005482659,0.0001636237,0.000002156267,0.0004824459,0.0007401891,0.000003720789,0.9884079,0.0009849963,0.0006697915],"study_design_scores_gemma":[0.03121874,0.0002465356,3.508924e-7,0.0003935415,0.0002583339,0.000002638584,0.00005190375,0.5008387,0.00007469198,0.4650261,0.001445033,0.0004433949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001055737,0.0000193804,0.3971612,0.0001181252,0.00003307768,0.001867345,0.00004272833,0.0001651622,0.5995372],"genre_scores_gemma":[0.02688937,0.00001727761,0.07859768,0.00004837709,0.00006414882,0.00005168246,0.00009427327,0.0001325243,0.8941047],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.5233818,"threshold_uncertainty_score":0.999931,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2586771770","doi":"10.1090/tran/7711","title":"Geodesic distance Riesz energy on the sphere","year":2018,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Geodesic; Mathematics; Euclidean geometry; Range (aeronautics); Energy (signal processing); Distribution (mathematics); Type (biology); Algorithm; Mathematical analysis; Geometry; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03016634837987927,"gpt":0.2863370676826594,"spread":0.2561707193027801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000474644,0.0002185146,0.000384712,0.00001391184,0.0004250715,0.00004631434,0.0005496043,0.00005584383,0.002048729],"category_scores_gemma":[0.0003412087,0.0001081825,0.0005331063,0.0005753436,0.001769847,0.00009520286,0.00002059011,0.0002467787,0.00007608075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006684152,"about_ca_system_score_gemma":0.00004060208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000228787,"about_ca_topic_score_gemma":0.00001856519,"domain_scores_codex":[0.9983143,0.0001623377,0.0005141213,0.0002139545,0.000533877,0.0002613779],"domain_scores_gemma":[0.9970708,0.001478693,0.0003752629,0.0008504086,0.0001557935,0.00006905293],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002112588,0.0003459965,0.000002062046,0.00008410965,0.00008630563,4.590941e-8,0.001234293,0.000002392656,0.0003681949,0.9894282,0.006062388,0.002364852],"study_design_scores_gemma":[0.0001442928,0.0001711782,0.00002965996,0.00013402,0.00009307737,0.000004696888,0.002332103,0.01568078,0.01407019,0.965113,0.002057471,0.0001695028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04150151,0.000004894232,0.9334382,0.004658023,0.00006422556,0.0003082243,0.00001587298,0.0001009599,0.01990807],"genre_scores_gemma":[0.9385787,0.00001115743,0.05675981,0.001231094,0.00007777555,0.00009156934,7.250759e-7,0.00003720884,0.003211958],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8970772,"threshold_uncertainty_score":0.9988635,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3016414259","doi":"10.1007/s11854-020-0084-9","title":"Nikolskii constants for polynomials on the unit sphere","year":2020,"lang":"fr","type":"article","venue":"Journal d Analyse Mathématique","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Unit (ring theory); Unit sphere; Space (punctuation); Unit circle; Mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.1572714244997877,"gpt":0.3485859453529255,"spread":0.1913145208531378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00202206,0.0004855563,0.0008707061,0.0001018717,0.0005433356,0.0007129419,0.0005825994,0.0003367483,0.01048249],"category_scores_gemma":[0.00633065,0.0003064967,0.0007019746,0.0005110265,0.0001830809,0.000348897,0.00006279422,0.00107797,0.0009381988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001564667,"about_ca_system_score_gemma":0.0003603339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007980503,"about_ca_topic_score_gemma":0.00001881336,"domain_scores_codex":[0.9962031,0.000676322,0.001649043,0.0003181554,0.0006228265,0.0005305614],"domain_scores_gemma":[0.9945728,0.002755158,0.001168038,0.0004118278,0.0005836011,0.000508562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001012306,0.0002992629,0.0000140474,0.0006968084,0.0003707441,0.00001682581,0.003193763,0.00003887613,0.0005835145,0.8018416,0.1896094,0.003233914],"study_design_scores_gemma":[0.001446917,0.0007891214,0.00002585944,0.001644936,0.0007575544,0.0002343582,0.007744024,0.1604041,0.006658014,0.7050437,0.1145893,0.0006621148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06696451,0.001059795,0.45109,0.4070723,0.0009951093,0.002744558,0.0003251337,0.0001582424,0.06959038],"genre_scores_gemma":[0.5010124,0.001965115,0.3359812,0.07787987,0.009515714,0.0005064233,0.00009152357,0.0006483444,0.0723994],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4340479,"threshold_uncertainty_score":0.9999387,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2965285632","doi":"10.4213/rm9892","title":"Дискретизация интегральной нормы и близкие задачи","year":2019,"lang":"ru","type":"article","venue":"Успехи математических наук","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación; Ministry of Education and Science of the Russian Federation; Generalitat de Catalunya","keywords":"Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.03143559427039468,"gpt":0.2975989205710692,"spread":0.2661633263006745,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001458408,0.001206145,0.001654589,0.0004617892,0.000335918,0.000593023,0.00115477,0.0009480443,0.05180324],"category_scores_gemma":[0.001259275,0.001074081,0.0007840265,0.0009617808,0.0002595525,0.0008847298,0.0004070508,0.001315747,0.07040177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004135755,"about_ca_system_score_gemma":0.0003582919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004942721,"about_ca_topic_score_gemma":0.00005515166,"domain_scores_codex":[0.9928131,0.0004043716,0.002231499,0.00138448,0.001730346,0.001436202],"domain_scores_gemma":[0.994359,0.001013589,0.0009829018,0.002391017,0.0006167593,0.0006367366],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001377598,0.001768681,0.000504949,0.003034254,0.0003462735,0.00002125891,0.003642558,0.00001366685,0.003148914,0.9091895,0.06732693,0.01086524],"study_design_scores_gemma":[0.005455995,0.001271406,0.001084133,0.002823258,0.0007312201,0.0001583158,0.004747425,0.06955518,0.01511557,0.651586,0.2437606,0.003710932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2898353,0.001011736,0.01972086,0.005755398,0.004185181,0.004940938,0.000231185,0.001158814,0.6731606],"genre_scores_gemma":[0.6996447,0.0002964917,0.0387056,0.00285847,0.001502292,0.0002785388,0.0003732577,0.0005269747,0.2558137],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4173469,"threshold_uncertainty_score":0.999171,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2943500070","doi":"10.1016/j.ijsu.2019.04.018","title":"History of the MGB and OAGB operations","year":2019,"lang":"en","type":"editorial","venue":"International Journal of Surgery","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Obesity Network","funders":"","keywords":"Medicine; Ancient history; General surgery; History","retraction":null,"screen_n_in":null,"score":{"opus":0.06451685313828293,"gpt":0.3178037332068642,"spread":0.2532868800685813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.001086051,0.0001572513,0.0005027467,0.0002532978,0.00001793159,0.00004099413,0.0004267256,0.0002521333,0.0004124269],"category_scores_gemma":[0.008800843,0.00009938772,0.000351685,0.00005087227,0.0001020863,0.0002235323,0.00007891995,0.000529788,0.000008449804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003815261,"about_ca_system_score_gemma":0.001064746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001068366,"about_ca_topic_score_gemma":0.000006209535,"domain_scores_codex":[0.9972044,0.0001121307,0.001146654,0.0001072691,0.001345898,0.00008361421],"domain_scores_gemma":[0.9932993,0.003486786,0.001146157,0.0001960435,0.001827685,0.00004401585],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002726655,0.00009686105,0.00002900864,0.0001361434,0.0001573531,0.000002493058,0.0002847239,0.000001877525,0.00008058917,0.01483333,0.9838807,0.0004696418],"study_design_scores_gemma":[0.0002879968,0.00002490962,0.00004586632,0.001233793,0.0001058292,0.00003909125,0.00007224481,0.0004176295,0.0001942054,0.02718241,0.9702368,0.0001592472],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.004495585,0.0004486726,0.001739015,0.0009878972,0.9882161,0.0001562627,0.00007092499,0.000009228681,0.003876329],"genre_scores_gemma":[0.01357968,0.001627442,0.01347763,0.0004540555,0.9132378,0.0000237824,0.0001113313,0.0001552005,0.05733316],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.07497836,"threshold_uncertainty_score":0.9995484,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3140774811","doi":"10.1109/iccad.2008.4681574","title":"On efficient Monte Carlo-based Statistical Static Timing Analysis of digital circuits","year":2008,"lang":"en","type":"article","venue":"","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Blackberry (Canada); University of Waterloo","funders":"","keywords":"Monte Carlo method; Computer science; Algorithm; Static timing analysis; Latin hypercube sampling; Quantile; Probabilistic logic; Statistical model; Mathematics; Statistics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.09022420960933382,"gpt":0.3260932463981079,"spread":0.2358690367887741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001624117,0.0001363732,0.000391892,0.0002101953,0.0000565527,0.00002493844,0.00008952097,0.00004553172,0.001188324],"category_scores_gemma":[0.00130067,0.00009931604,0.00014267,0.0004919032,0.0000807666,0.00004837844,0.00001130493,0.00007986464,0.00004630033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004651143,"about_ca_system_score_gemma":0.00003928193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000750074,"about_ca_topic_score_gemma":0.000004656089,"domain_scores_codex":[0.9985897,0.00003734763,0.000529215,0.0001839925,0.0005017082,0.0001580351],"domain_scores_gemma":[0.9979542,0.001415252,0.0001435528,0.000259491,0.0001403879,0.0000870975],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002122587,0.00108551,0.0001468089,0.0001674452,0.0002929229,0.000007725615,0.001034575,0.006706019,0.00004948364,0.9876715,0.001851525,0.0009652795],"study_design_scores_gemma":[0.0002766699,0.0001054082,0.0002605172,0.00002758612,0.0002486868,0.000001222981,0.0001291455,0.9727889,0.0006630623,0.02536533,0.00001035615,0.0001230587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4278045,9.667016e-7,0.5590002,0.00005443253,0.00001260544,0.0001566837,0.00006125499,0.00005244842,0.01285694],"genre_scores_gemma":[0.9704691,2.579852e-7,0.02882328,0.00007770514,0.000004546052,0.00001290051,0.00002713275,0.00001236444,0.000572774],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9660829,"threshold_uncertainty_score":0.9997247,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2199283642","doi":"10.1007/s11222-016-9688-4","title":"Quasi-random numbers for copula models","year":2016,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Copula (linguistics); Importance sampling; Random number generation; Monte Carlo method; Computer science; Multivariate t-distribution; Mathematics; Multivariate statistics; Econometrics; Multivariate normal distribution; Algorithm; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.0599004494514206,"gpt":0.3336830163889332,"spread":0.2737825669375126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002850698,0.00009097205,0.0001708119,0.00002229686,0.0001062153,0.00003982133,0.00004839768,0.00003396717,0.00004212404],"category_scores_gemma":[0.0005252851,0.0000570646,0.00002700477,0.00002886728,0.0000362895,0.00005192932,0.00002101036,0.00003082089,0.000005164609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001422566,"about_ca_system_score_gemma":0.0000119319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003750125,"about_ca_topic_score_gemma":0.000005330311,"domain_scores_codex":[0.9993198,0.0000231559,0.0002717241,0.0001353983,0.0001079145,0.0001419954],"domain_scores_gemma":[0.9982869,0.001365864,0.0001004486,0.00009081163,0.0001023559,0.00005359236],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000117775,0.0000425193,0.000005484048,0.000103534,0.000009460828,2.349664e-7,0.0002920968,0.000001113785,0.00004142301,0.9625362,0.003743001,0.03321316],"study_design_scores_gemma":[0.0005701293,0.00004559808,0.000002548558,0.00006494264,0.00001144857,0.000002052391,0.00006392392,0.2894284,0.00007280624,0.7093744,0.0002917133,0.00007200553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007110331,0.000008349464,0.9898248,0.0002015637,0.00006502456,0.0002522557,0.00007755267,0.00004751909,0.002412635],"genre_scores_gemma":[0.3322491,0.000005869285,0.6669737,0.00006791442,0.00005132357,0.00001100985,0.000007395729,0.00001454113,0.0006191382],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3251388,"threshold_uncertainty_score":0.2327027,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143994506","doi":"10.1109/wsc.2002.1166425","title":"Enhanced quasi-Monte Carlo methods with dimension reduction","year":2003,"lang":"en","type":"article","venue":"","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Monte Carlo method; Quasi-Monte Carlo method; Dimension (graph theory); Computer science; Effective dimension; Mathematical optimization; Derivative (finance); Monte Carlo molecular modeling; Hybrid Monte Carlo; Monte Carlo method in statistical physics; Dynamic Monte Carlo method; Monte Carlo integration; Monte Carlo methods for option pricing; Path integral Monte Carlo; Mathematics; Quantum Monte Carlo; Markov chain Monte Carlo; Finance; Mathematical analysis; Hausdorff dimension; Economics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.05371507380693861,"gpt":0.3719568513955732,"spread":0.3182417775886345,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006206739,0.0001397257,0.0002084756,0.00005554595,0.00007777375,0.00003205969,0.00005036347,0.00007029156,0.0009686582],"category_scores_gemma":[0.0005467029,0.00008694273,0.00004915188,0.0001848006,0.00003421614,0.000164366,0.000007128712,0.0001045106,0.00005254691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004177631,"about_ca_system_score_gemma":0.00002375941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005104353,"about_ca_topic_score_gemma":0.000008548634,"domain_scores_codex":[0.9989417,0.000204766,0.0002939138,0.0002013502,0.0002073162,0.0001509525],"domain_scores_gemma":[0.9992403,0.0001666134,0.0001082032,0.0002696488,0.0001485173,0.00006671103],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000161771,0.0001820896,8.475461e-7,0.00005089599,0.00001660122,2.39554e-7,0.0006619519,0.000002098307,0.01569544,0.9779689,0.000978429,0.004426379],"study_design_scores_gemma":[0.0004490619,0.0002332347,0.000004269171,0.00006636912,0.00004478524,0.0000351251,0.001163657,0.004982915,0.5237197,0.4674243,0.001643666,0.0002329274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06529199,0.00001132529,0.8290668,0.0001517302,0.0000834024,0.0003068711,2.74327e-7,0.0001570005,0.1049306],"genre_scores_gemma":[0.2716221,0.000002658273,0.7199326,0.00004534188,0.00001595641,0.0000386005,9.68401e-7,0.00001680628,0.008325028],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5105445,"threshold_uncertainty_score":0.9999446,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2475685041","doi":"10.1007/978-3-642-59657-5_22","title":"A Comparison of Monte Carlo, Lattice Rules and Other Low-Discrepancy Point Sets","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Monte Carlo method; Variance reduction; Quasi-Monte Carlo method; Control variates; Hybrid Monte Carlo; Estimator; Curse of dimensionality; Statistical physics; Monte Carlo integration; Lattice (music); Monte Carlo molecular modeling; Monte Carlo method in statistical physics; Computer science; Mathematics; Econometrics; Markov chain Monte Carlo; Statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0750372470596037,"gpt":0.3458256693937722,"spread":0.2707884223341685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001751022,0.000323833,0.000772326,0.00008844728,0.00006502627,0.00005992403,0.0001580187,0.0002917879,0.007895455],"category_scores_gemma":[0.000107878,0.0002397925,0.0001524432,0.00001090523,0.0001307679,0.00009051026,0.00006006715,0.0002336495,0.0001433209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002392236,"about_ca_system_score_gemma":0.00001984928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004635259,"about_ca_topic_score_gemma":0.00009824488,"domain_scores_codex":[0.9983929,0.00001933494,0.0008468522,0.0002704642,0.0003312389,0.0001391756],"domain_scores_gemma":[0.9985817,0.0002245719,0.0005024371,0.0005122926,0.0000966587,0.00008235697],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001825532,0.00009134841,0.000008618413,0.0006193052,0.00006668317,7.672143e-7,0.0007618756,8.22433e-8,0.000003815746,0.9937752,0.002519568,0.002134505],"study_design_scores_gemma":[0.0002621375,0.00006537617,0.000009073757,0.0008154141,0.0001286497,0.000005865471,0.0001194871,0.006562016,0.0002338663,0.9807325,0.01077668,0.0002889103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.005103888,0.0001385735,0.001233247,0.0001875388,0.00003036465,0.0005182661,0.00008116914,0.0000853012,0.9926217],"genre_scores_gemma":[0.01169493,0.00009716138,0.1908311,0.0003723195,0.0001055734,0.00003750004,0.00002384363,0.0001972742,0.7966403],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1959813,"threshold_uncertainty_score":0.9930115,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990576050","doi":"10.1145/1186785.1186786","title":"Inverting the symmetrical beta distribution","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Beta distribution; Inversion (geology); BETA (programming language); Inverse; Inverse-gamma distribution; Inverse transform sampling; Algorithm; Mathematics; Applied mathematics; Distribution (mathematics); Gamma distribution; Computer science; Mathematical optimization; Mathematical analysis; Probability distribution; Distribution fitting; Geometry; Inverse-chi-squared distribution; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04376148357159772,"gpt":0.2937572659650554,"spread":0.2499957823934577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006366875,0.0002952936,0.0003615201,0.00008741842,0.0005270379,0.000137695,0.0004980005,0.0001863835,0.001368139],"category_scores_gemma":[0.002391257,0.0001820445,0.000286756,0.0006488157,0.0001632792,0.0001856672,0.00001731145,0.0004897367,0.0005823625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001329046,"about_ca_system_score_gemma":0.00002790728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001013677,"about_ca_topic_score_gemma":0.000009844649,"domain_scores_codex":[0.9976425,0.0001396641,0.0008055919,0.0003268396,0.0006949606,0.0003905104],"domain_scores_gemma":[0.9953447,0.003350572,0.0001723575,0.0008701538,0.0001516929,0.0001105535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002549948,0.001222141,0.00002290641,0.0002853881,0.00005116708,0.000002842887,0.0001900654,0.00003461006,0.00003381394,0.936879,0.003053939,0.0581986],"study_design_scores_gemma":[0.0002885835,0.00006427165,0.00008065245,0.0001033995,0.00009477618,0.00002257238,0.0001059608,0.001921019,0.002279049,0.9932742,0.001541188,0.0002243156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008902868,0.00001341677,0.9851673,0.003290604,0.00007894971,0.0005643665,0.00004898903,0.0004841424,0.001449423],"genre_scores_gemma":[0.2132626,0.000006174523,0.7823805,0.0005515888,0.0002049603,0.0004082328,0.00009369693,0.0000943147,0.002997942],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2043597,"threshold_uncertainty_score":0.9995447,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1758794879","doi":"10.1007/978-3-642-56046-0_12","title":"Pricing American Derivatives using Simulation: A Biased Low Approach","year":2002,"lang":"en","type":"book-chapter","venue":"","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Control variates; Variance reduction; Estimator; Computer science; Valuation (finance); Monte Carlo method; Quasi-Monte Carlo method; Variance (accounting); Exploit; Importance sampling; Mathematical optimization; Rate of convergence; Algorithm; Applied mathematics; Mathematics; Markov chain Monte Carlo; Hybrid Monte Carlo; Statistics; Finance; Key (lock); Economics; Accounting","retraction":null,"screen_n_in":null,"score":{"opus":0.1714898502424862,"gpt":0.3404372164880551,"spread":0.1689473662455689,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002028789,0.0004600213,0.0007115225,0.0002301486,0.0001255807,0.00009589875,0.0001715952,0.0002161552,0.005470128],"category_scores_gemma":[0.0004612351,0.0003660867,0.0002224721,0.0001045018,0.0001690662,0.00015213,0.00004976289,0.0003265647,0.0001102168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001415502,"about_ca_system_score_gemma":0.00003295171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005180309,"about_ca_topic_score_gemma":0.000001334659,"domain_scores_codex":[0.9980354,0.00003537893,0.00076194,0.0004200376,0.000518706,0.0002285211],"domain_scores_gemma":[0.9978237,0.0007877792,0.00066393,0.0004584589,0.0001609804,0.0001051115],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006325782,0.0001091048,5.354373e-7,0.0004186044,0.00007540087,0.000001408966,0.0005811157,0.000247067,0.00001640772,0.9945025,0.000535268,0.003506265],"study_design_scores_gemma":[0.0001666979,0.00004068558,5.338803e-7,0.0002806042,0.00007621112,0.000005683959,0.0001025514,0.7043515,0.00008734754,0.289487,0.004961756,0.0004394002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.0001250744,0.000007074968,0.4480359,0.0000245632,0.00002093538,0.0004304179,0.000004132062,0.0001614409,0.5511904],"genre_scores_gemma":[0.005044019,0.00001526625,0.562201,0.000223926,0.0002081859,0.00001909517,0.00003730733,0.0001427979,0.4321083],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7050155,"threshold_uncertainty_score":0.9998791,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4252429658","doi":"10.1109/wsc.1998.745037","title":"Efficiency improvement by lattice rules for pricing Asian options","year":2002,"lang":"en","type":"article","venue":"1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274)","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Monte Carlo method; Variance reduction; Quasi-Monte Carlo method; Pseudorandom number generator; Lattice (music); Monte Carlo integration; Hybrid Monte Carlo; Computer science; Random number generation; Mathematical optimization; Lattice reduction; Control variates; Algorithm; Mathematics; Statistical physics; Markov chain Monte Carlo; Statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.06412860772496791,"gpt":0.3120363863926768,"spread":0.2479077786677089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005732217,0.000474507,0.0005074418,0.000234362,0.0003860053,0.0004953568,0.0004193021,0.0002489327,0.001890215],"category_scores_gemma":[0.001353495,0.0004134074,0.0002197311,0.000285884,0.0001036309,0.000811761,0.00008648266,0.0001997411,0.0007138135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002118088,"about_ca_system_score_gemma":0.0000343257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006772886,"about_ca_topic_score_gemma":0.000003936775,"domain_scores_codex":[0.9969955,0.00002283478,0.001138208,0.0006736972,0.0006016691,0.0005680661],"domain_scores_gemma":[0.9974262,0.0004211875,0.0005768791,0.0002851989,0.00108013,0.0002104607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001156837,0.002148031,0.0001046881,0.002018763,0.000198784,6.340215e-7,0.01586673,0.00005647783,0.03314369,0.8810372,0.03364837,0.03166093],"study_design_scores_gemma":[0.0009546645,0.0003706815,0.00001697507,0.0002669979,0.00009518411,0.000002615021,0.001186144,0.9057475,0.002344935,0.07955828,0.008978078,0.000477952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2615928,0.00001462727,0.6703973,0.002613551,0.0005114351,0.003496388,0.00008904398,0.0007455539,0.06053932],"genre_scores_gemma":[0.8010438,0.00001830934,0.187479,0.0004547835,0.0003474747,0.00047513,0.0001093827,0.0000918175,0.009980278],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.905691,"threshold_uncertainty_score":0.9998318,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4226224449","doi":"10.1287/ijoc.2021.1135","title":"Monte Carlo and Quasi–Monte Carlo Density Estimation via Conditioning","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Estimator; Mathematics; Monte Carlo method; Kernel density estimation; Mean squared error; Statistics; Probability density function; Random variable; Rate of convergence; Density estimation; Applied mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03055530153571773,"gpt":0.2990503213297093,"spread":0.2684950197939916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001235086,0.0001794983,0.0002881368,0.0001801325,0.001099642,0.0002404458,0.0001440091,0.00005032792,0.0001638828],"category_scores_gemma":[0.0005691104,0.0001474424,0.0001002194,0.0001683316,0.00003615296,0.0004018878,0.000116577,0.0006872118,0.00001440691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002161559,"about_ca_system_score_gemma":0.00004454336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000153739,"about_ca_topic_score_gemma":0.00000501309,"domain_scores_codex":[0.9982152,0.00008812235,0.0007339593,0.0001447207,0.0005786418,0.0002393851],"domain_scores_gemma":[0.9985402,0.0004215797,0.0005885108,0.0001491681,0.0001711209,0.0001294663],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003471368,0.001111081,0.002006605,0.0007889453,0.0004321061,0.0001588638,0.03817416,0.09627833,0.0003415665,0.5773082,0.01226722,0.2707857],"study_design_scores_gemma":[0.0005657637,0.0002793014,0.00034438,0.0001226639,0.00002694853,0.0007597848,0.001166078,0.9277773,0.0001447521,0.06818414,0.0004266594,0.000202207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8152942,0.00001637999,0.1823068,0.000347222,0.0002517308,0.0002131752,0.000003584435,0.00008896423,0.001477914],"genre_scores_gemma":[0.9625055,0.000002251636,0.03671802,0.0004680348,0.0001057319,0.000006620289,0.000002886355,0.00001819061,0.0001727593],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.831499,"threshold_uncertainty_score":0.8457671,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}