{"meta":{"query_hash":"1d8b3397ce71","filters":{"venue":"Известия Российской академии наук Серия математическая"},"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/1d8b3397ce71","api":"https://metacan.xera.ac/api/v1/cohort?venue=%D0%98%D0%B7%D0%B2%D0%B5%D1%81%D1%82%D0%B8%D1%8F+%D0%A0%D0%BE%D1%81%D1%81%D0%B8%D0%B9%D1%81%D0%BA%D0%BE%D0%B9+%D0%B0%D0%BA%D0%B0%D0%B4%D0%B5%D0%BC%D0%B8%D0%B8+%D0%BD%D0%B0%D1%83%D0%BA+%D0%A1%D0%B5%D1%80%D0%B8%D1%8F+%D0%BC%D0%B0%D1%82%D0%B5%D0%BC%D0%B0%D1%82%D0%B8%D1%87%D0%B5%D1%81%D0%BA%D0%B0%D1%8F"},"results":[{"id":"W2647257074","doi":"10.4213/im8307","title":"Многогранники Ньютона и неприводимые компоненты полных пересечений","year":2016,"lang":"ru","type":"article","venue":"Известия Российской академии наук Серия математическая","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"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":"Agence Nationale de la Recherche","keywords":"Polytope; Combinatorics; Mathematics","score_opus":0.0149388218901068,"score_gpt":0.22966190842640088,"score_spread":0.21472308653629407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2647257074","genre_codex":"other","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.043765992,0.010009359,0.31138316,0.010493546,0.0017197618,0.00021961008,0.0008429931,0.00067478564,0.6208908],"genre_scores_gemma":[0.6446781,0.009957639,0.21529515,0.00093343604,0.0012333394,0.00048591083,0.00050317176,0.0006859333,0.1262273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691147,0.0007555748,0.00014907718,0.00051908154,0.0014027237,0.0002622544],"domain_scores_gemma":[0.99735236,0.0007914246,0.00031551387,0.00056652736,0.0008104477,0.0001636652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017796922,0.00049902557,0.00041979132,0.0020024413,0.0023351102,0.006427347,0.00077891164,0.0012266716,0.02587344],"category_scores_gemma":[0.005837738,0.00057367404,0.00072461204,0.0018760873,0.0054463707,0.004649921,0.0025986887,0.0026226828,0.007455324],"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.000041827243,0.000026170677,0.0005238605,0.00015597038,0.000018294626,0.00011048233,0.000962095,0.00067373295,0.0034057403,0.9395797,0.0048984247,0.049603686],"study_design_scores_gemma":[0.00003319918,0.00005198996,0.0018156994,0.000150099,0.000040805164,0.0004819167,0.000969724,0.0024546634,0.0062409015,0.70026565,0.28742772,0.00006771224],"about_ca_topic_score_codex":0.0024876867,"about_ca_topic_score_gemma":0.0031011484,"teacher_disagreement_score":0.02587344,"about_ca_system_score_codex":0.0023700835,"about_ca_system_score_gemma":0.0032288393,"threshold_uncertainty_score":0.0865553},"labels":[],"label_agreement":null},{"id":"W3165058153","doi":"10.4213/im9033","title":"Аппроксимации по мере: задача Дирихле, универсальность и гипотеза Римана","year":2021,"lang":"ru","type":"article","venue":"Известия Российской академии наук Серия математическая","topic":"Military Technology and Strategies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad; Federación Española de Enfermedades Raras","keywords":"Political science","score_opus":0.008443114796787717,"score_gpt":0.2001351576485896,"score_spread":0.19169204285180189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165058153","genre_codex":"other","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.035933454,0.013491305,0.02253758,0.022548033,0.0006877055,0.00012314352,0.00010573068,0.00009314794,0.9044799],"genre_scores_gemma":[0.8133392,0.0068411515,0.016748924,0.0021554055,0.00037234408,0.00020230681,0.0000762079,0.00013165282,0.16013277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967866,0.0012075786,0.00012773043,0.0004138892,0.0010774424,0.0003867737],"domain_scores_gemma":[0.9979831,0.00063835917,0.0002609851,0.00024924352,0.00059735414,0.00027093574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026820926,0.00048096586,0.00027363637,0.0015507184,0.0053607505,0.010398343,0.00074342405,0.0023458058,0.009377468],"category_scores_gemma":[0.004678051,0.00041796474,0.00028746185,0.0014799316,0.016656078,0.0064181606,0.0038635286,0.0028446473,0.0026144476],"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.000011980681,0.000011422488,0.0004261994,0.00005474539,0.0000049859577,0.00012624572,0.008384085,0.00007582805,0.00030309535,0.97054785,0.0038817425,0.01617173],"study_design_scores_gemma":[0.000018211756,0.00005562793,0.0020876308,0.0003894131,0.000023932807,0.00056083774,0.014780469,0.00022574996,0.001356001,0.42148367,0.5589762,0.00004232991],"about_ca_topic_score_codex":0.006795427,"about_ca_topic_score_gemma":0.0112518,"teacher_disagreement_score":0.010398343,"about_ca_system_score_codex":0.006042597,"about_ca_system_score_gemma":0.0074204663,"threshold_uncertainty_score":0.043842316},"labels":[],"label_agreement":null},{"id":"W4232626058","doi":"10.4213/im8739","title":"Asymptotic bounds for spherical codes","year":2019,"lang":"en","type":"article","venue":"Известия Российской академии наук Серия математическая","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Hamming code; Mathematics; Cardinality (data modeling); Code (set theory); Hamming distance; Alphabet; Discrete mathematics; Linear code; Unit square; Computability; Set (abstract data type); Combinatorics; Constant-weight code; Block code; Algorithm; Computer science; Decoding methods","score_opus":0.008963900251776027,"score_gpt":0.22889879917547643,"score_spread":0.21993489892370038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232626058","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.04039225,0.022304645,0.72360766,0.004715102,0.0011021892,0.00008660457,0.0010803628,0.0013201532,0.205391],"genre_scores_gemma":[0.8238017,0.021946883,0.11208108,0.0027897737,0.003116676,0.0006825033,0.002792465,0.0010463049,0.031742636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99631125,0.0008947127,0.00014501384,0.0004514433,0.001577715,0.000619799],"domain_scores_gemma":[0.97687715,0.015777947,0.00089970225,0.0022056994,0.003531813,0.0007076848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034821315,0.0016362196,0.001432336,0.0037547806,0.0014576911,0.0038916033,0.0022728809,0.0016182007,0.010832378],"category_scores_gemma":[0.037461918,0.00052537146,0.001296684,0.0034687715,0.0031952246,0.0058362386,0.0044976026,0.0044894777,0.0037103873],"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.00011892405,0.000027310483,0.0007033828,0.00027518082,0.000037090897,0.00010643074,0.00025191158,0.023707666,0.0017740962,0.9349692,0.009461133,0.028567668],"study_design_scores_gemma":[0.000013925628,0.000063765445,0.00089288555,0.00026252915,0.000052756743,0.0003490874,0.00014481225,0.1098458,0.0019694353,0.87121147,0.0151409,0.00005271218],"about_ca_topic_score_codex":0.003069408,"about_ca_topic_score_gemma":0.0026811885,"teacher_disagreement_score":0.010832378,"about_ca_system_score_codex":0.004137273,"about_ca_system_score_gemma":0.0019463383,"threshold_uncertainty_score":0.036237895},"labels":[],"label_agreement":null}]}