{"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066959694,0.046949584,0.16127549,0.00803602,0.0020672253,0.000064432454,0.00024545396,0.00044295282,0.7139591],"genre_scores_gemma":[0.5392612,0.032235935,0.06714693,0.0019587693,0.004197944,0.00018565559,0.0004112269,0.00041107202,0.35419133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986565,0.000021899645,0.000008101091,0.000028318984,0.00006386202,0.000012160669],"domain_scores_gemma":[0.99971193,0.00015362873,0.000026194944,0.00002999959,0.000049760358,0.000028373366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053819845,0.0005580117,0.00042156628,0.001683704,0.000826453,0.0019184931,0.0005047914,0.00057302724,0.004069575],"category_scores_gemma":[0.0013823741,0.0003451563,0.00047255025,0.0015065387,0.0023556654,0.0048108823,0.0008242787,0.0018271933,0.0009977692],"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.000008550177,0.000008075952,0.000035608857,0.000039927178,0.000002556825,0.000035602166,0.00015981871,0.00031515778,0.0011822229,0.9778389,0.0067106923,0.01366293],"study_design_scores_gemma":[0.0000033417678,0.00001028905,0.00015234573,0.000014901454,0.000002486735,0.00014362542,0.00005316914,0.0015970196,0.000516455,0.9721939,0.025305575,0.000006846479],"about_ca_topic_score_codex":0.0005112189,"about_ca_topic_score_gemma":0.0005974333,"teacher_disagreement_score":0.004069575,"about_ca_system_score_codex":0.00096910587,"about_ca_system_score_gemma":0.00057877426,"threshold_uncertainty_score":0.0136140585},"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":"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.002632326,0.0023608487,0.98960614,0.0004562416,0.00033157907,0.00005490648,0.00016774933,0.0009420377,0.0034483075],"genre_scores_gemma":[0.04685449,0.0031216773,0.92986566,0.00064939936,0.0006324701,0.00043542802,0.0012415462,0.0009978312,0.016201613],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973598,0.00080575387,0.00018171108,0.0003927234,0.001042437,0.00021758072],"domain_scores_gemma":[0.99145776,0.006559794,0.00022403202,0.0009747167,0.0006208991,0.00016279725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039435164,0.0031979291,0.002780982,0.00183796,0.001075134,0.0028383336,0.0028488787,0.0019436466,0.00899901],"category_scores_gemma":[0.023882836,0.0011539254,0.0017374866,0.004710587,0.002928774,0.006833754,0.004622126,0.0058594025,0.0057474966],"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.00084036606,0.00023710827,0.0006745901,0.0006853441,0.00025837458,0.00018540352,0.00043779213,0.21427076,0.0063979346,0.19019894,0.0659665,0.519847],"study_design_scores_gemma":[0.00012174791,0.000091246824,0.00038963306,0.00008991754,0.000050086088,0.00017916088,0.00008847759,0.7347051,0.0035120193,0.2442883,0.016437996,0.000046322588],"about_ca_topic_score_codex":0.0032992188,"about_ca_topic_score_gemma":0.0042695883,"teacher_disagreement_score":0.00899901,"about_ca_system_score_codex":0.0016589169,"about_ca_system_score_gemma":0.0021774822,"threshold_uncertainty_score":0.030104697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26760238,0.008702666,0.15682796,0.0046363687,0.0016879536,0.00008606736,0.0008860529,0.00047197018,0.55909854],"genre_scores_gemma":[0.8472845,0.0046378477,0.022264862,0.0009909325,0.000938639,0.0001331103,0.0005793976,0.00026980927,0.12290094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998721,0.000033806893,0.0000053844856,0.00002413555,0.00004203534,0.00002245698],"domain_scores_gemma":[0.9997888,0.00010709587,0.000019232957,0.000028882798,0.000033664615,0.000022357925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020414824,0.00040774295,0.00036956146,0.0014784075,0.0006734202,0.0012832731,0.00037340188,0.0005434904,0.007983696],"category_scores_gemma":[0.00064432085,0.0002165612,0.00039789148,0.0011169183,0.0013416288,0.0019049114,0.0005194504,0.000985564,0.0006001888],"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.00000622466,0.0000033394808,0.000016544049,0.000020386122,0.0000018379558,0.00001538533,0.000052160405,0.0005361098,0.00047685092,0.99217844,0.0012868458,0.0054058437],"study_design_scores_gemma":[0.0000031154814,0.000005257859,0.00008901692,0.0000074098916,0.0000016108706,0.00004508276,0.000023450875,0.0014883584,0.00020263449,0.99187535,0.006254706,0.0000041117337],"about_ca_topic_score_codex":0.0006708263,"about_ca_topic_score_gemma":0.00051524484,"teacher_disagreement_score":0.007983696,"about_ca_system_score_codex":0.000945615,"about_ca_system_score_gemma":0.00032327895,"threshold_uncertainty_score":0.026708066},"labels":[],"label_agreement":null}]}