{"meta":{"query_hash":"748703eaa402","filters":{"venue":"Mathematical Statistics and Learning"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/748703eaa402","api":"https://metacan.xera.ac/api/v1/cohort?venue=Mathematical+Statistics+and+Learning"},"results":[{"id":"W2897972648","doi":"10.4171/msl/12","title":"The algorithmic hardness threshold for continuous random energy models","year":2020,"lang":"en","type":"preprint","venue":"Mathematical Statistics and Learning","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Agence Nationale de la Recherche","keywords":"Parameterized complexity; Energy (signal processing); Combinatorics; Function (biology); Mathematics; Random graph; Discrete mathematics; Hypercube; Graph","score_opus":0.029585909753493303,"score_gpt":0.26395217251459757,"score_spread":0.23436626276110428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897972648","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021525897,0.00073158287,0.9972164,0.00063520204,0.00034400093,0.0003506186,0.0001317057,0.000112371585,0.00045661844],"genre_scores_gemma":[0.020682009,0.00053941127,0.9765508,0.0002077614,0.00033767722,0.00030552753,0.00015989365,0.000054960456,0.0011619246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981636,0.00011870013,0.00044761156,0.0005681627,0.0003505622,0.00035138923],"domain_scores_gemma":[0.9973592,0.001645298,0.0002467855,0.00043904947,0.00013558648,0.00017407762],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006274314,0.00028270672,0.00052140217,0.000027906122,0.0007054716,0.0010989871,0.0008326463,0.00014636401,0.000007062209],"category_scores_gemma":[0.00040389592,0.00018708421,0.00008586551,0.000056306213,0.00009873241,0.00009907815,0.0017123412,0.0006675862,0.0000047221356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021106234,0.000022988803,7.3803744e-7,0.0001933135,0.00004582643,0.00001216509,0.00045432392,0.0016926065,0.0000054568136,0.8496285,0.0032397301,0.14468326],"study_design_scores_gemma":[0.00029972213,0.000039034738,0.0000019585902,0.00007171684,0.000018631785,0.000004142389,0.000026685831,0.54651546,0.0000042693373,0.44331732,0.009559129,0.00014190772],"about_ca_topic_score_codex":0.00002142626,"about_ca_topic_score_gemma":0.0000013938395,"teacher_disagreement_score":0.5448229,"about_ca_system_score_codex":0.000020330152,"about_ca_system_score_gemma":0.00006785501,"threshold_uncertainty_score":0.99993795},"labels":[],"label_agreement":null},{"id":"W3008672633","doi":"10.4171/msl/38","title":"Optimal anytime regret with two experts","year":2023,"lang":"en","type":"article","venue":"Mathematical Statistics and Learning","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Regret; Minimax; Time horizon; Constant (computer programming); Mathematical optimization; Computer science; Horizon; Mathematics; Machine learning","score_opus":0.09688300321347229,"score_gpt":0.43732907788875097,"score_spread":0.34044607467527865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008672633","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07777894,0.000027500166,0.91983855,0.00027886248,0.000025543999,0.00013471636,0.000020696098,0.00010194657,0.0017932225],"genre_scores_gemma":[0.47848192,0.000024092775,0.4882969,0.00006205225,0.00013502924,0.00004490003,0.00002256206,0.00006290474,0.03286966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973917,0.00017672246,0.0003347673,0.0003809112,0.0013128225,0.00040309428],"domain_scores_gemma":[0.9946053,0.0046906997,0.00008998544,0.00023214187,0.00018021399,0.0002016293],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018837369,0.00013354814,0.0002816176,0.00016572395,0.00035523195,0.0003260845,0.00022672392,0.000036288307,0.0011855006],"category_scores_gemma":[0.0065831537,0.00008253749,0.000021317783,0.0006355649,0.0002300216,0.000084280146,0.0001868737,0.00030431908,0.0008940107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027730622,0.00022104828,0.0035534932,0.0001577559,0.00012171393,0.0019456537,0.013689358,0.11746039,0.00038942372,0.1261144,0.03354051,0.70252895],"study_design_scores_gemma":[0.00057942374,0.00028469166,0.0011268395,0.00004126255,0.0000074931863,0.00005544981,0.0026697798,0.8703772,0.00003934944,0.112337515,0.012257084,0.0002239238],"about_ca_topic_score_codex":0.0000045061756,"about_ca_topic_score_gemma":0.0000021764238,"teacher_disagreement_score":0.7529168,"about_ca_system_score_codex":0.00001633088,"about_ca_system_score_gemma":0.000029427252,"threshold_uncertainty_score":0.9998839},"labels":[],"label_agreement":null},{"id":"W4392659422","doi":"10.4171/msl/44","title":"Optimal and instance-dependent guarantees for Markovian linear stochastic approximation","year":2024,"lang":"en","type":"article","venue":"Mathematical Statistics and Learning","topic":"Statistical and numerical algorithms","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Office of Naval Research; Multidisciplinary University Research Initiative; National Science Foundation","keywords":"Markov process; Mathematical optimization; Stochastic approximation; Computer science; Mathematics; Applied mathematics; Linear approximation; Nonlinear system; Physics; Statistics; Key (lock)","score_opus":0.027870749574827946,"score_gpt":0.31113888521033894,"score_spread":0.283268135635511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392659422","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010882995,0.0002711186,0.98757166,0.00018994312,0.00007757152,0.00039838988,0.0001688851,0.0001515054,0.00028790723],"genre_scores_gemma":[0.15793352,0.00003202965,0.8404831,0.00003195994,0.00013593891,0.000093758965,0.000029488774,0.000058638965,0.0012015498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985613,0.00006584215,0.00041392626,0.00036545895,0.0002672041,0.00032622035],"domain_scores_gemma":[0.9951037,0.004512452,0.00006190882,0.00009216394,0.000070180264,0.00015959352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053502276,0.0002249299,0.00037024642,0.000066198154,0.00024317877,0.00021596297,0.000065499815,0.00008634956,0.00016550424],"category_scores_gemma":[0.0025398638,0.00017491858,0.00003960214,0.00009908341,0.00015615777,0.00008227058,0.000065800574,0.00035690237,0.000022020138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044205855,0.00007219688,0.0000044763033,0.0019198257,0.00006189118,0.000023138931,0.0009135164,0.00010739011,0.00004393908,0.91021204,0.00034390145,0.0862535],"study_design_scores_gemma":[0.00023888853,0.00018146227,0.000019780717,0.00017329809,0.00008253119,0.000036313264,0.00018671049,0.57139003,0.000008863533,0.42667186,0.00083528843,0.00017495708],"about_ca_topic_score_codex":0.0000042719066,"about_ca_topic_score_gemma":0.0000011650633,"teacher_disagreement_score":0.5712827,"about_ca_system_score_codex":0.000024329293,"about_ca_system_score_gemma":0.000018852928,"threshold_uncertainty_score":0.71329725},"labels":[],"label_agreement":null}]}