{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29005164,0.0014212516,0.6555339,0.010747633,0.00022101363,0.00033272343,0.0014649448,0.0021193295,0.038107578],"genre_scores_gemma":[0.9037132,0.0005527505,0.08374644,0.0016079014,0.00036105866,0.000511939,0.0012513588,0.0005005194,0.007754795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960089,0.0013336175,0.00019323679,0.0008649971,0.00089263887,0.0007066532],"domain_scores_gemma":[0.97233325,0.021789009,0.0011407472,0.0032319434,0.00064539624,0.0008595901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002755212,0.0013587311,0.002025053,0.001176413,0.001601164,0.0042642197,0.0039185905,0.003484724,0.008096843],"category_scores_gemma":[0.021054765,0.00090373564,0.0025588826,0.0011481461,0.004590919,0.0098930085,0.004943607,0.0067190705,0.0009790251],"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.00051672844,0.00042417034,0.0026127791,0.0007160893,0.00017741144,0.00034267988,0.00063739816,0.20626976,0.0047880625,0.74906844,0.012471507,0.021974934],"study_design_scores_gemma":[0.0000777726,0.000043705473,0.0002589513,0.000026254223,0.000023500672,0.00009194465,0.0000696549,0.3315813,0.0009268222,0.66532725,0.0015461141,0.00002671509],"about_ca_topic_score_codex":0.001142382,"about_ca_topic_score_gemma":0.0012782607,"teacher_disagreement_score":0.008096843,"about_ca_system_score_codex":0.0026311409,"about_ca_system_score_gemma":0.0020730894,"threshold_uncertainty_score":0.027086616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075221196,0.0012329658,0.90816337,0.0029253673,0.00025422743,0.00010145844,0.00022533465,0.00038920972,0.011486895],"genre_scores_gemma":[0.8869003,0.00058081077,0.099682264,0.0006004538,0.00034349714,0.00016703254,0.0001957156,0.000085852094,0.011444048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972156,0.0010847178,0.00008754189,0.0006957982,0.0004185042,0.000497837],"domain_scores_gemma":[0.9911924,0.006419622,0.00076907297,0.0006411142,0.00044917464,0.000528686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004373169,0.001579,0.0022267078,0.00046098477,0.0006960247,0.0015397524,0.0024166235,0.0029170243,0.0034693796],"category_scores_gemma":[0.018136935,0.00056407356,0.00095258106,0.0006163915,0.0018960562,0.0027920324,0.0018561073,0.0029542532,0.00059890136],"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.00072183326,0.00018336743,0.0008832463,0.00016497099,0.00010395831,0.00018817902,0.00015211207,0.8524062,0.0013567891,0.1153092,0.0035768456,0.024953302],"study_design_scores_gemma":[0.00006201493,0.00007803536,0.00017341605,0.000016963126,0.000016425849,0.000030352025,0.000015915575,0.93801814,0.0005461026,0.06047417,0.00055289123,0.000015548048],"about_ca_topic_score_codex":0.0027595283,"about_ca_topic_score_gemma":0.0015680208,"teacher_disagreement_score":0.004373169,"about_ca_system_score_codex":0.0017878168,"about_ca_system_score_gemma":0.0017446829,"threshold_uncertainty_score":0.023127794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032871995,0.00063914084,0.96098024,0.0012375142,0.000062106505,0.00009537772,0.00016070827,0.0005377365,0.0034151515],"genre_scores_gemma":[0.7182568,0.000957492,0.2736944,0.0008541332,0.00027819147,0.0005709278,0.00072980864,0.0006523179,0.0040059458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927885,0.0033502725,0.00041224013,0.0011358351,0.0015563805,0.00075681147],"domain_scores_gemma":[0.93471175,0.05193178,0.0038379626,0.005133125,0.002652334,0.0017331138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015274513,0.002256506,0.0030693803,0.0014987863,0.0015373197,0.0037017723,0.005018673,0.0040666466,0.0034081275],"category_scores_gemma":[0.08783979,0.0015001469,0.0020269416,0.0014991431,0.004272391,0.0063806437,0.005713999,0.006942842,0.00071360223],"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.00032498705,0.00014723917,0.0022951677,0.00023668873,0.000143752,0.00007071103,0.0001796201,0.77233255,0.0013775098,0.20386106,0.0014869148,0.01754381],"study_design_scores_gemma":[0.0000151465165,0.00003285709,0.000107282925,0.000028236604,0.0000088358465,0.000013864065,0.0000113662,0.9612105,0.00042887026,0.037975114,0.00015905836,0.000008916738],"about_ca_topic_score_codex":0.0041435705,"about_ca_topic_score_gemma":0.0041779387,"teacher_disagreement_score":0.015274513,"about_ca_system_score_codex":0.0048571546,"about_ca_system_score_gemma":0.0051887063,"threshold_uncertainty_score":0.08078027},"labels":[],"label_agreement":null}]}