{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"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","author_layer_release":"2026-06-26"},"query_hash":"748703eaa402","filters":{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Louigi Addario‐Berry","is_ca":true},{"name":"Pascal Maillard","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0295859097534933,"gpt":0.2639521725145976,"spread":0.2343662627611043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002755212,0.001358731,0.002025053,0.001176413,0.001601164,0.00426422,0.00391859,0.003484724,0.008096843],"category_scores_gemma":[0.02105477,0.0009037356,0.002558883,0.001148146,0.004590919,0.009893009,0.004943607,0.00671907,0.0009790251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002631141,"about_ca_system_score_gemma":0.002073089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001142382,"about_ca_topic_score_gemma":0.001278261,"domain_scores_codex":[0.9960089,0.001333617,0.0001932368,0.0008649971,0.0008926389,0.0007066532],"domain_scores_gemma":[0.9723333,0.02178901,0.001140747,0.003231943,0.0006453962,0.0008595901],"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.0005167284,0.0004241703,0.002612779,0.0007160893,0.0001774114,0.0003426799,0.0006373982,0.2062698,0.004788063,0.7490684,0.01247151,0.02197493],"study_design_scores_gemma":[0.0000777726,0.00004370547,0.0002589513,0.00002625422,0.00002350067,0.00009194465,0.0000696549,0.3315813,0.0009268222,0.6653273,0.001546114,0.00002671509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2900516,0.001421252,0.6555339,0.01074763,0.0002210136,0.0003327234,0.001464945,0.00211933,0.03810758],"genre_scores_gemma":[0.9037132,0.0005527505,0.08374644,0.001607901,0.0003610587,0.000511939,0.001251359,0.0005005194,0.007754795],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008096843,"threshold_uncertainty_score":0.02708662,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Wenlong Mou","is_ca":true},{"name":"Ashwin Pananjady","is_ca":false},{"name":"Martin J. Wainwright","is_ca":false},{"name":"Peter L. Bartlett","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02787074957482795,"gpt":0.3111388852103389,"spread":0.283268135635511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01527451,0.002256506,0.00306938,0.001498786,0.00153732,0.003701772,0.005018673,0.004066647,0.003408127],"category_scores_gemma":[0.08783979,0.001500147,0.002026942,0.001499143,0.004272391,0.006380644,0.005713999,0.006942842,0.0007136022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004857155,"about_ca_system_score_gemma":0.005188706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004143571,"about_ca_topic_score_gemma":0.004177939,"domain_scores_codex":[0.9927885,0.003350273,0.0004122401,0.001135835,0.001556381,0.0007568115],"domain_scores_gemma":[0.9347118,0.05193178,0.003837963,0.005133125,0.002652334,0.001733114],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000324987,0.0001472392,0.002295168,0.0002366887,0.000143752,0.00007071103,0.0001796201,0.7723325,0.00137751,0.2038611,0.001486915,0.01754381],"study_design_scores_gemma":[0.00001514652,0.00003285709,0.0001072829,0.0000282366,0.000008835847,0.00001386407,0.0000113662,0.9612105,0.0004288703,0.03797511,0.0001590584,0.000008916738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.032872,0.0006391408,0.9609802,0.001237514,0.0000621065,0.00009537772,0.0001607083,0.0005377365,0.003415151],"genre_scores_gemma":[0.7182568,0.000957492,0.2736944,0.0008541332,0.0002781915,0.0005709278,0.0007298086,0.0006523179,0.004005946],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01527451,"threshold_uncertainty_score":0.08078027,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Nicholas J. A. Harvey","is_ca":true},{"name":"Christopher Liaw","is_ca":true},{"name":"Edwin Perkins","is_ca":true},{"name":"Sikander Randhawa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09688300321347229,"gpt":0.437329077888751,"spread":0.3404460746752787,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004373169,0.001579,0.002226708,0.0004609848,0.0006960247,0.001539752,0.002416624,0.002917024,0.00346938],"category_scores_gemma":[0.01813694,0.0005640736,0.0009525811,0.0006163915,0.001896056,0.002792032,0.001856107,0.002954253,0.0005989014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001787817,"about_ca_system_score_gemma":0.001744683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002759528,"about_ca_topic_score_gemma":0.001568021,"domain_scores_codex":[0.9972156,0.001084718,0.00008754189,0.0006957982,0.0004185042,0.000497837],"domain_scores_gemma":[0.9911924,0.006419622,0.000769073,0.0006411142,0.0004491746,0.000528686],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007218333,0.0001833674,0.0008832463,0.000164971,0.0001039583,0.000188179,0.0001521121,0.8524062,0.001356789,0.1153092,0.003576846,0.0249533],"study_design_scores_gemma":[0.00006201493,0.00007803536,0.000173416,0.00001696313,0.00001642585,0.00003035202,0.00001591558,0.9380181,0.0005461026,0.06047417,0.0005528912,0.00001554805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0752212,0.001232966,0.9081634,0.002925367,0.0002542274,0.0001014584,0.0002253346,0.0003892097,0.0114869],"genre_scores_gemma":[0.8869003,0.0005808108,0.09968226,0.0006004538,0.0003434971,0.0001670325,0.0001957156,0.00008585209,0.01144405],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004373169,"threshold_uncertainty_score":0.02312779,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}