{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0121670095,0.0001482197,0.9785051,0.00067991397,0.00004444473,0.0008648282,0.000010425195,0.00049258926,0.007087479],"genre_scores_gemma":[0.99596184,0.000117201576,0.0034056173,0.00016127518,0.000012634465,0.00019300614,0.00009827643,0.000020448057,0.00002970789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990214,0.00003979305,0.00048415142,0.000056834902,0.00025532558,0.00014250484],"domain_scores_gemma":[0.9990533,0.00020668912,0.00013363782,0.0003164757,0.00021841508,0.0000714911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070396654,0.00013815584,0.00013791003,0.00015064648,0.00008970166,0.000048067654,0.00029866036,0.00011026453,0.000011714103],"category_scores_gemma":[0.00007553718,0.0001018126,0.00006808216,0.00016813797,0.000038623668,0.0006644284,0.0000170822,0.0001536025,0.000019971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0001604633,0.00008043958,0.00001675004,0.0008053837,0.00005861181,2.3384517e-8,0.044868868,0.66654146,0.0028669687,0.048915412,0.01895775,0.21672788],"study_design_scores_gemma":[0.0007636843,0.00018150687,0.00002058002,0.0003201025,0.000013083875,0.000001706852,0.00056405755,0.7151969,0.06708964,0.025188427,0.19042704,0.0002332704],"about_ca_topic_score_codex":0.000007829866,"about_ca_topic_score_gemma":0.0000011952847,"teacher_disagreement_score":0.9837948,"about_ca_system_score_codex":0.00003778168,"about_ca_system_score_gemma":0.000022973472,"threshold_uncertainty_score":0.41517973},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09674445,0.0023025789,0.8665913,0.0014910885,0.000046209905,0.0011566298,0.000040813655,0.0015832996,0.030043636],"genre_scores_gemma":[0.9700763,0.0023271125,0.027482275,0.000040515428,0.0000086273685,0.00002271543,0.00003214627,0.000007696395,0.000002564045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992751,0.000017185974,0.00041950698,0.00004142837,0.00014175165,0.000105068175],"domain_scores_gemma":[0.99961424,0.00003172601,0.00008069494,0.00014923616,0.00006853038,0.00005554452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021492128,0.000099641664,0.00015012492,0.00017239414,0.000058640406,0.00002826315,0.0001490407,0.00007379857,0.000032475476],"category_scores_gemma":[0.0000060386083,0.00009298184,0.000031716503,0.00013719224,0.000035027966,0.0010837377,0.000014637686,0.00011181621,0.0000087249555],"study_design_candidate":"design_other","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.00007418008,0.000101784186,0.00018274208,0.0038098192,0.00006446019,7.8820264e-8,0.030992689,0.072416425,0.031401183,0.003951647,0.003527804,0.8534772],"study_design_scores_gemma":[0.0017437018,0.00004565026,0.0016168888,0.00036696324,0.000016421538,0.000007821055,0.00012849682,0.75224364,0.053012688,0.0013816587,0.1891121,0.0003239417],"about_ca_topic_score_codex":0.00002243823,"about_ca_topic_score_gemma":0.0000050578037,"teacher_disagreement_score":0.8733319,"about_ca_system_score_codex":0.000020002628,"about_ca_system_score_gemma":0.000004805305,"threshold_uncertainty_score":0.37916893},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3715866,0.00014132666,0.6255681,0.00093351374,0.00004428647,0.0004969353,0.000020322648,0.0002469079,0.00096198893],"genre_scores_gemma":[0.8980454,0.000114393806,0.101665184,0.00009386019,0.000011035943,0.000021945412,0.00003251054,0.000007697828,0.000007927779],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979362,0.00010984951,0.00083695276,0.00022468796,0.00067919533,0.00021314344],"domain_scores_gemma":[0.9976746,0.0004407174,0.00090190605,0.00047215648,0.0004380286,0.00007261211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058356335,0.00022601751,0.00030552343,0.00020340091,0.00018741492,0.00012031886,0.00073385093,0.00012877469,0.000025724583],"category_scores_gemma":[0.000081464954,0.00015241686,0.00008072246,0.00060559437,0.00013649986,0.0020588678,0.000054706037,0.0002654746,0.000010430475],"study_design_candidate":"bench_or_experimental","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.0020112118,0.0016021376,0.045634493,0.00673477,0.00040049473,0.0000059827516,0.10679523,0.02263333,0.055620473,0.12294967,0.005175645,0.63043654],"study_design_scores_gemma":[0.0021865475,0.0008003729,0.023878487,0.004068994,0.00009729722,0.000025709158,0.001417832,0.32711646,0.61369026,0.023898104,0.0018489383,0.0009710036],"about_ca_topic_score_codex":0.0002598132,"about_ca_topic_score_gemma":0.000047366837,"teacher_disagreement_score":0.6294656,"about_ca_system_score_codex":0.000052712232,"about_ca_system_score_gemma":0.00011057094,"threshold_uncertainty_score":0.6215379},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110922724,0.00008990011,0.88749355,0.000055672634,0.0000133048725,0.0002341955,0.000020774276,0.00003167293,0.0011382013],"genre_scores_gemma":[0.98603874,0.00029966555,0.013591409,0.000004078171,5.696875e-7,0.0000146257535,0.000045143574,0.0000038982866,0.0000018683675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990993,0.000021327207,0.00065406825,0.000040152314,0.00012220607,0.0000629212],"domain_scores_gemma":[0.99935675,0.000039261286,0.0002557086,0.00018485135,0.00014976197,0.000013688457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012727239,0.00007899366,0.00019657437,0.0003782228,0.000019893641,0.0000056704093,0.00018948391,0.000051149942,0.000008768563],"category_scores_gemma":[0.000015122689,0.00006289893,0.00006456977,0.0009048216,0.000041909887,0.00065798435,0.000017041311,0.0001072617,1.4857221e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.000008999889,0.000013489013,0.0016520268,0.00023111366,0.000038019396,6.7833943e-9,0.010753999,0.94484144,0.007643933,0.0033334403,4.9575584e-7,0.03148305],"study_design_scores_gemma":[0.00026125822,0.00002531319,0.0043374896,0.0007596668,0.000027702281,1.3533932e-7,0.00023033391,0.7220743,0.27055448,0.0016398259,0.000016774668,0.00007277009],"about_ca_topic_score_codex":0.000054538938,"about_ca_topic_score_gemma":0.0001410187,"teacher_disagreement_score":0.875116,"about_ca_system_score_codex":0.0001185276,"about_ca_system_score_gemma":0.000021700085,"threshold_uncertainty_score":0.2564944},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110922724,0.00008990011,0.88749355,0.000055672634,0.0000133048725,0.0002341955,0.000020774276,0.00003167293,0.0011382013],"genre_scores_gemma":[0.98603874,0.00029966555,0.013591409,0.000004078171,5.696875e-7,0.0000146257535,0.000045143574,0.0000038982866,0.0000018683675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990993,0.000021327207,0.00065406825,0.000040152314,0.00012220607,0.0000629212],"domain_scores_gemma":[0.99935675,0.000039261286,0.0002557086,0.00018485135,0.00014976197,0.000013688457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012727239,0.00007899366,0.00019657437,0.0003782228,0.000019893641,0.0000056704093,0.00018948391,0.000051149942,0.000008768563],"category_scores_gemma":[0.000015122689,0.00006289893,0.00006456977,0.0009048216,0.000041909887,0.00065798435,0.000017041311,0.0001072617,1.4857221e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.000008999889,0.000013489013,0.0016520268,0.00023111366,0.000038019396,6.7833943e-9,0.010753999,0.94484144,0.007643933,0.0033334403,4.9575584e-7,0.03148305],"study_design_scores_gemma":[0.00026125822,0.00002531319,0.0043374896,0.0007596668,0.000027702281,1.3533932e-7,0.00023033391,0.7220743,0.27055448,0.0016398259,0.000016774668,0.00007277009],"about_ca_topic_score_codex":0.000054538938,"about_ca_topic_score_gemma":0.0001410187,"teacher_disagreement_score":0.875116,"about_ca_system_score_codex":0.0001185276,"about_ca_system_score_gemma":0.000021700085,"threshold_uncertainty_score":0.2564944},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011104689,0.00042671507,0.98571247,0.00039850108,0.00010475279,0.00019691279,0.0000077282775,0.00053315243,0.0015150645],"genre_scores_gemma":[0.9489643,0.00016227135,0.050775778,0.000029264214,0.000004043884,0.000013746581,0.000023403885,0.0000052637956,0.000021945498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984568,0.00004470526,0.0007792755,0.00015190012,0.00041367262,0.00015364903],"domain_scores_gemma":[0.99903953,0.00012866975,0.00023359038,0.0003579794,0.00018058768,0.00005961492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068357814,0.00012880817,0.00029034767,0.001136921,0.000047687896,0.00008708353,0.000553606,0.00008582322,0.000023518722],"category_scores_gemma":[0.00003370332,0.000106186766,0.0002120597,0.0022226572,0.000036598467,0.0019655765,0.00004827822,0.0001374215,0.000009236247],"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.000027223507,0.00018404462,0.0015571078,0.0032292656,0.0005554007,0.0000013644188,0.029693175,0.011478604,0.021170901,0.12665689,0.0009632794,0.80448276],"study_design_scores_gemma":[0.00009227545,0.00015923652,0.0008543127,0.00050769997,0.00010948108,0.0000024888802,0.000049064627,0.9279329,0.06072985,0.004125237,0.005295152,0.0001422555],"about_ca_topic_score_codex":0.00013591319,"about_ca_topic_score_gemma":0.0000052348455,"teacher_disagreement_score":0.9378596,"about_ca_system_score_codex":0.000027232854,"about_ca_system_score_gemma":0.000076448516,"threshold_uncertainty_score":0.43301708},"labels":[],"label_agreement":null}]}