{"meta":{"query_hash":"2e4b0880dc68","filters":{"venue":"Memoirs of the European Mathematical Society"},"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/2e4b0880dc68","api":"https://metacan.xera.ac/api/v1/cohort?venue=Memoirs+of+the+European+Mathematical+Society"},"results":[{"id":"W3162415025","doi":"10.4171/mems/4","title":"The Limiting Absorption Principle for Massless Dirac Operators, Properties of Spectral Shift Functions, and an Application to the Witten Index of Non-Fredholm Operators","year":2023,"lang":"en","type":"book","venue":"Memoirs of the European Mathematical Society","topic":"Spectral Theory in Mathematical Physics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Limiting; Massless particle; Dirac (video compression format); Index (typography); Mathematical physics; Fredholm determinant; Absorption (acoustics); Pure mathematics; Mathematics; Mathematical analysis; Physics; Quantum mechanics; Computer science; Optics; Engineering","score_opus":0.031730748226313825,"score_gpt":0.28622884785674724,"score_spread":0.2544980996304334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162415025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7188415,0.00048156272,0.16852996,0.004889134,0.0011145191,0.024642337,0.00084363116,0.0006954479,0.07996191],"genre_scores_gemma":[0.91720724,0.00009064285,0.014939826,0.00018036818,0.0015859726,0.0006072463,0.000042567037,0.00081902184,0.064527124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962321,0.000422228,0.0015155863,0.0005140106,0.0008664488,0.00044965793],"domain_scores_gemma":[0.9951185,0.0016403696,0.0010460461,0.0017414439,0.00032540713,0.00012825447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004618312,0.0005264953,0.0009447757,0.000041511685,0.0005537989,0.00010270311,0.0016273576,0.00020007906,0.000008718376],"category_scores_gemma":[0.001280461,0.00027114863,0.0006640344,0.00030810808,0.00091291795,0.00012414639,0.0007734365,0.00058911706,0.000026667434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020077678,0.00088591065,0.00006433039,0.010866839,0.0012939473,7.2593014e-7,0.022357766,0.0005456958,0.0139220385,0.9332804,0.013868611,0.0027129718],"study_design_scores_gemma":[0.0006834509,0.00030942596,0.00037104607,0.002342289,0.00067487126,0.0000055382425,0.004133037,0.009300613,0.00805803,0.9722225,0.0012122822,0.00068692374],"about_ca_topic_score_codex":0.0000036335412,"about_ca_topic_score_gemma":0.000011091438,"teacher_disagreement_score":0.19836572,"about_ca_system_score_codex":0.00014612576,"about_ca_system_score_gemma":0.00014397087,"threshold_uncertainty_score":0.9999741},"labels":[],"label_agreement":null},{"id":"W4396700653","doi":"10.4171/mems/13","title":"On Efficient Algorithms for Computing Near-Best Polynomial Approximations to High-Dimensional, Hilbert-Valued Functions from Limited Samples","year":2024,"lang":"en","type":"book","venue":"Memoirs of the European Mathematical Society","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Algorithm; Polynomial; Mathematics; Approximations of π; Computer science; Discrete mathematics; Applied mathematics; Mathematical analysis","score_opus":0.03900926662789469,"score_gpt":0.27792535818383807,"score_spread":0.23891609155594337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396700653","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.00040253464,0.00009652105,0.9796495,0.002704183,0.0017889861,0.0012167124,0.00050757336,0.00024603034,0.013387967],"genre_scores_gemma":[0.00025271787,0.0000015561404,0.9510857,0.00094286696,0.00082574255,0.000026514099,0.00006470198,0.00013636632,0.046663847],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634224,0.0003879788,0.0009242713,0.0009882174,0.00086089416,0.0004964094],"domain_scores_gemma":[0.99504846,0.0027749478,0.00038723284,0.0013301763,0.00019997546,0.00025918527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013902737,0.00054264686,0.0008122077,0.00006218768,0.0006255418,0.00034418033,0.0017632387,0.00017460482,0.000038598842],"category_scores_gemma":[0.00061840244,0.00036645,0.001172373,0.00044275148,0.00028471576,0.000049064987,0.0016114232,0.00067216164,0.0005169198],"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.000040707793,0.0017421212,3.2266283e-7,0.0010061328,0.0013372776,0.000010380687,0.0056027924,0.02534041,0.00061986723,0.17450984,0.6855687,0.10422148],"study_design_scores_gemma":[0.0006149972,0.00030017356,0.000020630174,0.0016966815,0.00036305978,0.0000068654376,0.00006512122,0.8704303,0.00017777283,0.10135563,0.02420976,0.000759033],"about_ca_topic_score_codex":0.000015934385,"about_ca_topic_score_gemma":3.1166206e-7,"teacher_disagreement_score":0.84508985,"about_ca_system_score_codex":0.0002364702,"about_ca_system_score_gemma":0.00019535379,"threshold_uncertainty_score":0.99987876},"labels":[],"label_agreement":null},{"id":"W4414878096","doi":"10.4171/mems/23","title":"Functional Graphs of Generalized Cyclotomic Mappings of Finite Fields","year":2025,"lang":"en","type":"book","venue":"Memoirs of the European Mathematical Society","topic":"Synthesis of β-Lactam Compounds","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Finite field; Field (mathematics); Class (philosophy); Algebra over a field; Graph theory","score_opus":0.017031291353099894,"score_gpt":0.21232572635072688,"score_spread":0.195294434997627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414878096","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012922514,0.00029164887,0.0008817067,0.00032380095,0.00021126447,0.00022274454,0.00017754694,0.0000762695,0.9848925],"genre_scores_gemma":[0.05925808,0.00017857396,0.0081781475,0.00023701071,0.00036098456,0.000013485968,0.00007375456,0.00018879795,0.93151116],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971163,0.00014259573,0.0012821713,0.00039396292,0.00079391565,0.00027104534],"domain_scores_gemma":[0.9957511,0.0014570203,0.0011736752,0.0013399397,0.00020876083,0.00006952458],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00084303657,0.00044333912,0.0010970929,0.000054325734,0.00008473174,0.000015267658,0.0013893112,0.0003651607,0.0017479275],"category_scores_gemma":[0.0005538315,0.00033851096,0.0021090494,0.00013170986,0.0006776632,0.000035441128,0.00077636656,0.0006181788,0.00002832505],"study_design_candidate":"not_applicable","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.00017621012,0.0010152832,0.00013049656,0.026153008,0.004636521,0.000006738843,0.0025714233,0.00028618198,0.07626947,0.050063197,0.8369717,0.0017197799],"study_design_scores_gemma":[0.0048205997,0.00011062363,0.0005686821,0.018336186,0.003655555,0.000036221412,0.00061467104,0.0026842917,0.21010539,0.6713546,0.08527462,0.0024385431],"about_ca_topic_score_codex":0.0000044030826,"about_ca_topic_score_gemma":3.8014545e-7,"teacher_disagreement_score":0.75169706,"about_ca_system_score_codex":0.000103024504,"about_ca_system_score_gemma":0.00022547004,"threshold_uncertainty_score":0.9999067},"labels":[],"label_agreement":null}]}