{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":6,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":6,"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"},"query_hash":"e3e36c19aa47","filters":{"venue":"Problems of Information Transmission"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01678292662789305,"gpt":0.2190077551098749,"spread":0.2022248284819819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002149213,0.00009964166,0.0001501249,0.0001723941,0.00005864041,0.00002826315,0.0001490407,0.00007379857,0.00003247548],"category_scores_gemma":[0.000006038608,0.00009298184,0.0000317165,0.0001371922,0.00003502797,0.001083738,0.00001463769,0.0001118162,0.000008724955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002000263,"about_ca_system_score_gemma":0.000004805305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002243823,"about_ca_topic_score_gemma":0.000005057804,"domain_scores_codex":[0.9992751,0.00001718597,0.000419507,0.00004142837,0.0001417516,0.0001050682],"domain_scores_gemma":[0.9996142,0.00003172601,0.00008069494,0.0001492362,0.00006853038,0.00005554452],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007418008,0.0001017842,0.0001827421,0.003809819,0.00006446019,7.882026e-8,0.03099269,0.07241642,0.03140118,0.003951647,0.003527804,0.8534772],"study_design_scores_gemma":[0.001743702,0.00004565026,0.001616889,0.0003669632,0.00001642154,0.000007821055,0.0001284968,0.7522436,0.05301269,0.001381659,0.1891121,0.0003239417],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09674445,0.002302579,0.8665913,0.001491089,0.00004620991,0.00115663,0.00004081365,0.0015833,0.03004364],"genre_scores_gemma":[0.9700763,0.002327112,0.02748227,0.00004051543,0.000008627369,0.00002271543,0.00003214627,0.000007696395,0.000002564045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8733319,"threshold_uncertainty_score":0.3791689,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008448828198365146,"gpt":0.2358814292636694,"spread":0.2274326010653043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001272724,0.00007899366,0.0001965744,0.0003782228,0.00001989364,0.000005670409,0.0001894839,0.00005114994,0.000008768563],"category_scores_gemma":[0.00001512269,0.00006289893,0.00006456977,0.0009048216,0.00004190989,0.0006579843,0.00001704131,0.0001072617,1.485722e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001185276,"about_ca_system_score_gemma":0.00002170009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005453894,"about_ca_topic_score_gemma":0.0001410187,"domain_scores_codex":[0.9990993,0.00002132721,0.0006540683,0.00004015231,0.0001222061,0.0000629212],"domain_scores_gemma":[0.9993567,0.00003926129,0.0002557086,0.0001848513,0.000149762,0.00001368846],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008999889,0.00001348901,0.001652027,0.0002311137,0.0000380194,6.783394e-9,0.010754,0.9448414,0.007643933,0.00333344,4.957558e-7,0.03148305],"study_design_scores_gemma":[0.0002612582,0.00002531319,0.00433749,0.0007596668,0.00002770228,1.353393e-7,0.0002303339,0.7220743,0.2705545,0.001639826,0.00001677467,0.00007277009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1109227,0.00008990011,0.8874936,0.00005567263,0.00001330487,0.0002341955,0.00002077428,0.00003167293,0.001138201],"genre_scores_gemma":[0.9860387,0.0002996656,0.01359141,0.000004078171,5.696875e-7,0.00001462575,0.00004514357,0.000003898287,0.000001868367],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.875116,"threshold_uncertainty_score":0.2564944,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008146864414246495,"gpt":0.2206538971931487,"spread":0.2125070327789021,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005835633,0.0002260175,0.0003055234,0.0002034009,0.0001874149,0.0001203189,0.0007338509,0.0001287747,0.00002572458],"category_scores_gemma":[0.00008146495,0.0001524169,0.00008072246,0.0006055944,0.0001364999,0.002058868,0.00005470604,0.0002654746,0.00001043048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005271223,"about_ca_system_score_gemma":0.0001105709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002598132,"about_ca_topic_score_gemma":0.00004736684,"domain_scores_codex":[0.9979362,0.0001098495,0.0008369528,0.000224688,0.0006791953,0.0002131434],"domain_scores_gemma":[0.9976746,0.0004407174,0.0009019061,0.0004721565,0.0004380286,0.00007261211],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002011212,0.001602138,0.04563449,0.00673477,0.0004004947,0.000005982752,0.1067952,0.02263333,0.05562047,0.1229497,0.005175645,0.6304365],"study_design_scores_gemma":[0.002186547,0.0008003729,0.02387849,0.004068994,0.00009729722,0.00002570916,0.001417832,0.3271165,0.6136903,0.0238981,0.001848938,0.0009710036],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3715866,0.0001413267,0.6255681,0.0009335137,0.00004428647,0.0004969353,0.00002032265,0.0002469079,0.0009619889],"genre_scores_gemma":[0.8980454,0.0001143938,0.1016652,0.00009386019,0.00001103594,0.00002194541,0.00003251054,0.000007697828,0.000007927779],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6294656,"threshold_uncertainty_score":0.6215379,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008448828198365146,"gpt":0.2358814292636694,"spread":0.2274326010653043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001272724,0.00007899366,0.0001965744,0.0003782228,0.00001989364,0.000005670409,0.0001894839,0.00005114994,0.000008768563],"category_scores_gemma":[0.00001512269,0.00006289893,0.00006456977,0.0009048216,0.00004190989,0.0006579843,0.00001704131,0.0001072617,1.485722e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001185276,"about_ca_system_score_gemma":0.00002170009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005453894,"about_ca_topic_score_gemma":0.0001410187,"domain_scores_codex":[0.9990993,0.00002132721,0.0006540683,0.00004015231,0.0001222061,0.0000629212],"domain_scores_gemma":[0.9993567,0.00003926129,0.0002557086,0.0001848513,0.000149762,0.00001368846],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008999889,0.00001348901,0.001652027,0.0002311137,0.0000380194,6.783394e-9,0.010754,0.9448414,0.007643933,0.00333344,4.957558e-7,0.03148305],"study_design_scores_gemma":[0.0002612582,0.00002531319,0.00433749,0.0007596668,0.00002770228,1.353393e-7,0.0002303339,0.7220743,0.2705545,0.001639826,0.00001677467,0.00007277009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1109227,0.00008990011,0.8874936,0.00005567263,0.00001330487,0.0002341955,0.00002077428,0.00003167293,0.001138201],"genre_scores_gemma":[0.9860387,0.0002996656,0.01359141,0.000004078171,5.696875e-7,0.00001462575,0.00004514357,0.000003898287,0.000001868367],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.875116,"threshold_uncertainty_score":0.2564944,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02382126162757196,"gpt":0.2503806317137777,"spread":0.2265593700862057,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007039665,0.0001381558,0.00013791,0.0001506465,0.00008970166,0.00004806765,0.0002986604,0.0001102645,0.0000117141],"category_scores_gemma":[0.00007553718,0.0001018126,0.00006808216,0.000168138,0.00003862367,0.0006644284,0.0000170822,0.0001536025,0.000019971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003778168,"about_ca_system_score_gemma":0.00002297347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007829866,"about_ca_topic_score_gemma":0.000001195285,"domain_scores_codex":[0.9990214,0.00003979305,0.0004841514,0.0000568349,0.0002553256,0.0001425048],"domain_scores_gemma":[0.9990533,0.0002066891,0.0001336378,0.0003164757,0.0002184151,0.0000714911],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001604633,0.00008043958,0.00001675004,0.0008053837,0.00005861181,2.338452e-8,0.04486887,0.6665415,0.002866969,0.04891541,0.01895775,0.2167279],"study_design_scores_gemma":[0.0007636843,0.0001815069,0.00002058002,0.0003201025,0.00001308388,0.000001706852,0.0005640576,0.7151969,0.06708964,0.02518843,0.190427,0.0002332704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01216701,0.0001482197,0.9785051,0.000679914,0.00004444473,0.0008648282,0.00001042519,0.0004925893,0.007087479],"genre_scores_gemma":[0.9959618,0.0001172016,0.003405617,0.0001612752,0.00001263446,0.0001930061,0.00009827643,0.00002044806,0.00002970789],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9837948,"threshold_uncertainty_score":0.4151797,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01236542016145787,"gpt":0.2593872413142347,"spread":0.2470218211527769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006835781,0.0001288082,0.0002903477,0.001136921,0.0000476879,0.00008708353,0.000553606,0.00008582322,0.00002351872],"category_scores_gemma":[0.00003370332,0.0001061868,0.0002120597,0.002222657,0.00003659847,0.001965577,0.00004827822,0.0001374215,0.000009236247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002723285,"about_ca_system_score_gemma":0.00007644852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001359132,"about_ca_topic_score_gemma":0.000005234846,"domain_scores_codex":[0.9984568,0.00004470526,0.0007792755,0.0001519001,0.0004136726,0.000153649],"domain_scores_gemma":[0.9990395,0.0001286698,0.0002335904,0.0003579794,0.0001805877,0.00005961492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002722351,0.0001840446,0.001557108,0.003229266,0.0005554007,0.000001364419,0.02969318,0.0114786,0.0211709,0.1266569,0.0009632794,0.8044828],"study_design_scores_gemma":[0.00009227545,0.0001592365,0.0008543127,0.0005077,0.0001094811,0.00000248888,0.00004906463,0.9279329,0.06072985,0.004125237,0.005295152,0.0001422555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01110469,0.0004267151,0.9857125,0.0003985011,0.0001047528,0.0001969128,0.000007728278,0.0005331524,0.001515065],"genre_scores_gemma":[0.9489643,0.0001622713,0.05077578,0.00002926421,0.000004043884,0.00001374658,0.00002340389,0.000005263796,0.0000219455],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9378596,"threshold_uncertainty_score":0.4330171,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}