{"meta":{"query_hash":"e3e36c19aa47","filters":{"venue":"Problems of Information Transmission"},"cohort_total":6,"direct_labels_cover":0,"predictions_cover":6,"exported":6,"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/e3e36c19aa47","api":"https://metacan.xera.ac/api/v1/cohort?venue=Problems+of+Information+Transmission"},"results":[{"id":"W1194438082","doi":"10.1134/s0032946015020106","title":"On the source-channel separation theorem for infinite source alphabets","year":2015,"lang":"en","type":"article","venue":"Problems of Information Transmission","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"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 Victoria","funders":"","keywords":"Mathematics; Alphabet; Channel (broadcasting); Mutual fund separation theorem; Separation (statistics); Countable set; Finite set; Discrete mathematics; Computer science; Mathematical analysis; Telecommunications; Statistics","score_opus":0.02382126162757196,"score_gpt":0.25038063171377767,"score_spread":0.22655937008620572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1194438082","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.0036694387,0.00051295484,0.98857075,0.0003288175,0.00008061156,0.000014058911,0.00007718675,0.000096071555,0.0066501815],"genre_scores_gemma":[0.5312618,0.0046835663,0.44282603,0.0012205684,0.0013646708,0.00034607446,0.00073812815,0.00037734894,0.01718184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771273,0.0006380663,0.00012092579,0.00036556288,0.00093824835,0.00022434193],"domain_scores_gemma":[0.9826015,0.014953289,0.0005948581,0.0006655506,0.0010151493,0.00016965964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032509614,0.0008845916,0.0011555199,0.001417124,0.0010667137,0.001615226,0.0011477892,0.0012467407,0.0036222052],"category_scores_gemma":[0.011845952,0.00045735427,0.0009173336,0.0014880961,0.0026831427,0.0035366572,0.0027639251,0.0037570053,0.0012915739],"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.00012650006,0.00003877451,0.0002734907,0.00017001096,0.00004186287,0.00033625352,0.00022117219,0.057903368,0.0044924472,0.8951195,0.003041904,0.03823474],"study_design_scores_gemma":[0.000033826655,0.000058565172,0.00020117969,0.000067661735,0.000025119456,0.00047194233,0.000052464948,0.2938889,0.0045727785,0.69419324,0.0063894335,0.000044939374],"about_ca_topic_score_codex":0.0008494719,"about_ca_topic_score_gemma":0.00044520336,"teacher_disagreement_score":0.0036222052,"about_ca_system_score_codex":0.0009567706,"about_ca_system_score_gemma":0.0013621905,"threshold_uncertainty_score":0.0171929},"labels":[],"label_agreement":null},{"id":"W2016965008","doi":"10.1007/s11122-005-0006-6","title":"Complex random matrices and Rician channel capacity","year":2005,"lang":"en","type":"article","venue":"Problems of Information Transmission","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Wishart distribution; Ergodic theory; Rician fading; Random matrix; Eigenvalues and eigenvectors; Upper and lower bounds; Channel capacity; Invariant (physics); MIMO; Channel (broadcasting); Applied mathematics; Pure mathematics; Discrete mathematics; Mathematical analysis; Statistics; Computer science; Telecommunications","score_opus":0.016782926627893047,"score_gpt":0.21900775510987494,"score_spread":0.2022248284819819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016965008","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.065543555,0.01152299,0.81545836,0.00927573,0.0005680177,0.00008389663,0.0007259579,0.00031520447,0.09650628],"genre_scores_gemma":[0.88208145,0.014045231,0.053138446,0.0010436486,0.0018769528,0.00031618684,0.0006208629,0.00022843429,0.04664873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885166,0.00053728896,0.000038577156,0.00015053137,0.00030054135,0.00012144822],"domain_scores_gemma":[0.98837775,0.00935604,0.0008667404,0.00055308157,0.0006846827,0.0001617834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020892853,0.0013147427,0.0011413264,0.0016013881,0.0008546033,0.0025896477,0.0012027101,0.002475426,0.0069968607],"category_scores_gemma":[0.013318643,0.0009453204,0.000529147,0.002850667,0.0040064305,0.004262015,0.0014933428,0.0023553127,0.0009397375],"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.000022732513,0.000012917489,0.00009817351,0.00006881595,0.000012105683,0.00006641941,0.000108518834,0.051130604,0.00035294314,0.9412111,0.0027573723,0.004158225],"study_design_scores_gemma":[0.000016838796,0.000011537518,0.0001960055,0.000037918955,0.000012630861,0.00010751478,0.00006326498,0.14851826,0.00033609298,0.8466067,0.0040609604,0.000032410735],"about_ca_topic_score_codex":0.0023939118,"about_ca_topic_score_gemma":0.0013399816,"teacher_disagreement_score":0.0069968607,"about_ca_system_score_codex":0.0017103016,"about_ca_system_score_gemma":0.0011309303,"threshold_uncertainty_score":0.023406863},"labels":[],"label_agreement":null},{"id":"W2075239581","doi":"10.1007/s11122-005-0008-4","title":"On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices","year":2005,"lang":"en","type":"article","venue":"Problems of Information Transmission","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Low-density parity-check code; Permutation matrix; Combinatorics; Parity (physics); Permutation (music); Minimum distance; Parity-check matrix; Discrete mathematics; Decoding methods; Algorithm; Physics","score_opus":0.008146864414246495,"score_gpt":0.22065389719314865,"score_spread":0.21250703277890215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075239581","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.40804556,0.003790121,0.5362896,0.0050002434,0.00036937124,0.00013975699,0.000722869,0.0003970155,0.045245554],"genre_scores_gemma":[0.8720394,0.0022471896,0.113799974,0.0005615382,0.00040033355,0.0003399418,0.0007560456,0.000273073,0.009582476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774206,0.0011105862,0.000099745834,0.000259587,0.00061124173,0.00017681763],"domain_scores_gemma":[0.9749312,0.021536773,0.0012049054,0.000905308,0.0009277283,0.00049427245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028563018,0.0014049916,0.0014261996,0.0016785741,0.0015324785,0.0019639463,0.0028058887,0.0026650236,0.0033670878],"category_scores_gemma":[0.028629651,0.00079250213,0.00067349087,0.001486764,0.0034339451,0.0041723102,0.0032556031,0.0032321294,0.0006845767],"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.0006672505,0.00012783078,0.0008364776,0.00046356555,0.000065870336,0.00017364124,0.00044242424,0.14008394,0.004764858,0.82225335,0.0038487182,0.026272183],"study_design_scores_gemma":[0.0001080222,0.00010459001,0.00037103944,0.00008402033,0.00002252601,0.00016079612,0.00008721232,0.23429415,0.0022633313,0.7611846,0.0012729964,0.00004666341],"about_ca_topic_score_codex":0.0007541605,"about_ca_topic_score_gemma":0.0006356509,"teacher_disagreement_score":0.0033670878,"about_ca_system_score_codex":0.0017836594,"about_ca_system_score_gemma":0.0014756655,"threshold_uncertainty_score":0.015105724},"labels":[],"label_agreement":null},{"id":"W2092870400","doi":"10.1007/s11122-005-0001-y","title":"Analysis of the dynamics of iterative interference cancellation in iterative decoding","year":2004,"lang":"en","type":"article","venue":"Problems of Information Transmission","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Single antenna interference cancellation; Mathematics; Iterative method; Algorithm; Interference (communication); Minimum mean square error; Scheme (mathematics); Statistics; Computer science; Telecommunications; Channel (broadcasting); Mathematical analysis","score_opus":0.008448828198365146,"score_gpt":0.23588142926366942,"score_spread":0.22743260106530427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092870400","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.084573075,0.0019632122,0.83623177,0.003346115,0.00025110395,0.000065394335,0.0001762627,0.00021467797,0.07317838],"genre_scores_gemma":[0.9213726,0.0017972429,0.041073333,0.00037485774,0.0002875912,0.00013198164,0.00019872039,0.00020934461,0.034554444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999432,0.00022668816,0.000013350064,0.000043087057,0.00020342456,0.00008139889],"domain_scores_gemma":[0.99562305,0.003193889,0.00036524804,0.00012061154,0.0005250781,0.00017220827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013095445,0.00079724827,0.00072575716,0.0008889315,0.00078602013,0.001496461,0.0012435847,0.0013941501,0.0058383914],"category_scores_gemma":[0.011279498,0.00049302686,0.00047239242,0.00077815756,0.0023255476,0.0024931557,0.0014272396,0.0018229038,0.00054797967],"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.00006761782,0.00002993677,0.00036546178,0.00008290225,0.000020289137,0.00012278279,0.00022376266,0.27332008,0.0020685566,0.7149826,0.002528389,0.0061875405],"study_design_scores_gemma":[0.000010024012,0.00001605978,0.00020419587,0.000017459028,0.0000049462433,0.00006320543,0.000044848566,0.815723,0.00044549422,0.1824478,0.0010065924,0.00001636279],"about_ca_topic_score_codex":0.0023258873,"about_ca_topic_score_gemma":0.0017217023,"teacher_disagreement_score":0.0058383914,"about_ca_system_score_codex":0.0013816218,"about_ca_system_score_gemma":0.0012565971,"threshold_uncertainty_score":0.01953137},"labels":[],"label_agreement":null},{"id":"W4246795051","doi":"10.1007/s11122-004-0001-3","title":"Analysis of the dynamics of iterative interference cancellation in iterative decoding","year":2004,"lang":"en","type":"article","venue":"Problems of Information Transmission","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Decoding methods; Interference (communication); Single antenna interference cancellation; Iterative method; Dynamics (music); Algorithm; Applied mathematics; Mathematical optimization; Computer science; Telecommunications; Channel (broadcasting); Acoustics; Physics","score_opus":0.008448828198365146,"score_gpt":0.23588142926366942,"score_spread":0.22743260106530427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246795051","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.084573075,0.0019632122,0.83623177,0.003346115,0.00025110395,0.000065394335,0.0001762627,0.00021467797,0.07317838],"genre_scores_gemma":[0.9213726,0.0017972429,0.041073333,0.00037485774,0.0002875912,0.00013198164,0.00019872039,0.00020934461,0.034554444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999432,0.00022668816,0.000013350064,0.000043087057,0.00020342456,0.00008139889],"domain_scores_gemma":[0.99562305,0.003193889,0.00036524804,0.00012061154,0.0005250781,0.00017220827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013095445,0.00079724827,0.00072575716,0.0008889315,0.00078602013,0.001496461,0.0012435847,0.0013941501,0.0058383914],"category_scores_gemma":[0.011279498,0.00049302686,0.00047239242,0.00077815756,0.0023255476,0.0024931557,0.0014272396,0.0018229038,0.00054797967],"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.00006761782,0.00002993677,0.00036546178,0.00008290225,0.000020289137,0.00012278279,0.00022376266,0.27332008,0.0020685566,0.7149826,0.002528389,0.0061875405],"study_design_scores_gemma":[0.000010024012,0.00001605978,0.00020419587,0.000017459028,0.0000049462433,0.00006320543,0.000044848566,0.815723,0.00044549422,0.1824478,0.0010065924,0.00001636279],"about_ca_topic_score_codex":0.0023258873,"about_ca_topic_score_gemma":0.0017217023,"teacher_disagreement_score":0.0058383914,"about_ca_system_score_codex":0.0013816218,"about_ca_system_score_gemma":0.0012565971,"threshold_uncertainty_score":0.01953137},"labels":[],"label_agreement":null},{"id":"W4403393381","doi":"10.1134/s0032946024020017","title":"Girth Analysis of Quantum Quasi-Cyclic LDPC Codes","year":2024,"lang":"en","type":"article","venue":"Problems of Information Transmission","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Girth (graph theory); Low-density parity-check code; Combinatorics; Quantum; Discrete mathematics; Algorithm; Decoding methods","score_opus":0.012365420161457868,"score_gpt":0.25938724131423474,"score_spread":0.24702182115277688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403393381","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5700425,0.0014851354,0.3981035,0.0011418759,0.000101932514,0.00006386949,0.00043005942,0.0003742205,0.028256908],"genre_scores_gemma":[0.97625536,0.00056317117,0.020378541,0.00012646928,0.00006490436,0.000055714427,0.00018153054,0.00007737898,0.0022969344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993753,0.00017858298,0.000020052683,0.000066462104,0.00026860432,0.00009098155],"domain_scores_gemma":[0.99693906,0.0019372279,0.00022048996,0.00036929877,0.00042852687,0.00010545711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005350477,0.00038929126,0.00032510993,0.0014794025,0.0005523712,0.0007522925,0.00069656444,0.00067312067,0.0016669887],"category_scores_gemma":[0.005070271,0.00027491612,0.00040741113,0.0008487874,0.0016952455,0.00095925404,0.00097369734,0.0013036733,0.0003001736],"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.00020829302,0.00004068,0.0025167814,0.00017004725,0.000048591937,0.00030925925,0.0005548839,0.2601423,0.026436357,0.6843355,0.002170403,0.023066912],"study_design_scores_gemma":[0.000014129496,0.000054613076,0.0012630763,0.000040206723,0.000013793081,0.00017772382,0.00005342352,0.6284549,0.0077044964,0.3602082,0.0019710073,0.000044367906],"about_ca_topic_score_codex":0.0009449562,"about_ca_topic_score_gemma":0.00057567714,"teacher_disagreement_score":0.0016669887,"about_ca_system_score_codex":0.001136196,"about_ca_system_score_gemma":0.0007130865,"threshold_uncertainty_score":0.00824374},"labels":[],"label_agreement":null}]}