{"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":"1d8b3397ce71","filters":{"venue":"Известия Российской академии наук Серия математическая"}},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Agence Nationale de la Recherche","keywords":"Polytope; Combinatorics; Mathematics","authors":[{"name":"Askold Khovanskiĭ","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0149388218901068,"gpt":0.2296619084264009,"spread":0.2147230865362941,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001779692,0.0004990256,0.0004197913,0.002002441,0.00233511,0.006427347,0.0007789116,0.001226672,0.02587344],"category_scores_gemma":[0.005837738,0.000573674,0.000724612,0.001876087,0.005446371,0.004649921,0.002598689,0.002622683,0.007455324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002370083,"about_ca_system_score_gemma":0.003228839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002487687,"about_ca_topic_score_gemma":0.003101148,"domain_scores_codex":[0.9969115,0.0007555748,0.0001490772,0.0005190815,0.001402724,0.0002622544],"domain_scores_gemma":[0.9973524,0.0007914246,0.0003155139,0.0005665274,0.0008104477,0.0001636652],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004182724,0.00002617068,0.0005238605,0.0001559704,0.00001829463,0.0001104823,0.000962095,0.000673733,0.00340574,0.9395797,0.004898425,0.04960369],"study_design_scores_gemma":[0.00003319918,0.00005198996,0.001815699,0.000150099,0.00004080516,0.0004819167,0.000969724,0.002454663,0.006240902,0.7002656,0.2874277,0.00006771224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04376599,0.01000936,0.3113832,0.01049355,0.001719762,0.0002196101,0.0008429931,0.0006747856,0.6208908],"genre_scores_gemma":[0.6446781,0.009957639,0.2152952,0.000933436,0.001233339,0.0004859108,0.0005031718,0.0006859333,0.1262273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02587344,"threshold_uncertainty_score":0.0865553,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Javier Falcó","is_ca":false},{"name":"P. M. Gauthier","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008443114796787717,"gpt":0.2001351576485896,"spread":0.1916920428518019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002682093,0.0004809659,0.0002736364,0.001550718,0.00536075,0.01039834,0.0007434241,0.002345806,0.009377468],"category_scores_gemma":[0.004678051,0.0004179647,0.0002874619,0.001479932,0.01665608,0.006418161,0.003863529,0.002844647,0.002614448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006042597,"about_ca_system_score_gemma":0.007420466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006795427,"about_ca_topic_score_gemma":0.0112518,"domain_scores_codex":[0.9967866,0.001207579,0.0001277304,0.0004138892,0.001077442,0.0003867737],"domain_scores_gemma":[0.9979831,0.0006383592,0.0002609851,0.0002492435,0.0005973541,0.0002709357],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001198068,0.00001142249,0.0004261994,0.00005474539,0.000004985958,0.0001262457,0.008384085,0.00007582805,0.0003030954,0.9705479,0.003881742,0.01617173],"study_design_scores_gemma":[0.00001821176,0.00005562793,0.002087631,0.0003894131,0.00002393281,0.0005608377,0.01478047,0.00022575,0.001356001,0.4214837,0.5589762,0.00004232991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.03593345,0.0134913,0.02253758,0.02254803,0.0006877055,0.0001231435,0.0001057307,0.00009314794,0.9044799],"genre_scores_gemma":[0.8133392,0.006841152,0.01674892,0.002155405,0.0003723441,0.0002023068,0.0000762079,0.0001316528,0.1601328],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01039834,"threshold_uncertainty_score":0.04384232,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Yuri I. Manin","is_ca":false},{"name":"Matilde Marcolli","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008963900251776027,"gpt":0.2288987991754764,"spread":0.2199348989237004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003482132,0.00163622,0.001432336,0.003754781,0.001457691,0.003891603,0.002272881,0.001618201,0.01083238],"category_scores_gemma":[0.03746192,0.0005253715,0.001296684,0.003468771,0.003195225,0.005836239,0.004497603,0.004489478,0.003710387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004137273,"about_ca_system_score_gemma":0.001946338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003069408,"about_ca_topic_score_gemma":0.002681189,"domain_scores_codex":[0.9963112,0.0008947127,0.0001450138,0.0004514433,0.001577715,0.000619799],"domain_scores_gemma":[0.9768772,0.01577795,0.0008997023,0.002205699,0.003531813,0.0007076848],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001189241,0.00002731048,0.0007033828,0.0002751808,0.0000370909,0.0001064307,0.0002519116,0.02370767,0.001774096,0.9349692,0.009461133,0.02856767],"study_design_scores_gemma":[0.00001392563,0.00006376544,0.0008928856,0.0002625292,0.00005275674,0.0003490874,0.0001448122,0.1098458,0.001969435,0.8712115,0.0151409,0.00005271218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04039225,0.02230464,0.7236077,0.004715102,0.001102189,0.00008660457,0.001080363,0.001320153,0.205391],"genre_scores_gemma":[0.8238017,0.02194688,0.1120811,0.002789774,0.003116676,0.0006825033,0.002792465,0.001046305,0.03174264],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01083238,"threshold_uncertainty_score":0.0362379,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}