{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Tharmalingam Ratnarajah","is_ca":true},{"name":"Rémi Vaillancourt","is_ca":true},{"name":"Mayer Alvo","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002089285,0.001314743,0.001141326,0.001601388,0.0008546033,0.002589648,0.00120271,0.002475426,0.006996861],"category_scores_gemma":[0.01331864,0.0009453204,0.000529147,0.002850667,0.004006431,0.004262015,0.001493343,0.002355313,0.0009397375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001710302,"about_ca_system_score_gemma":0.00113093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002393912,"about_ca_topic_score_gemma":0.001339982,"domain_scores_codex":[0.9988517,0.000537289,0.00003857716,0.0001505314,0.0003005413,0.0001214482],"domain_scores_gemma":[0.9883777,0.00935604,0.0008667404,0.0005530816,0.0006846827,0.0001617834],"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.00002273251,0.00001291749,0.00009817351,0.00006881595,0.00001210568,0.00006641941,0.0001085188,0.0511306,0.0003529431,0.9412111,0.002757372,0.004158225],"study_design_scores_gemma":[0.0000168388,0.00001153752,0.0001960055,0.00003791896,0.00001263086,0.0001075148,0.00006326498,0.1485183,0.000336093,0.8466067,0.00406096,0.00003241074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06554355,0.01152299,0.8154584,0.00927573,0.0005680177,0.00008389663,0.0007259579,0.0003152045,0.09650628],"genre_scores_gemma":[0.8820814,0.01404523,0.05313845,0.001043649,0.001876953,0.0003161868,0.0006208629,0.0002284343,0.04664873],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006996861,"threshold_uncertainty_score":0.02340686,"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","authors":[{"name":"M. V. Burnashev","is_ca":false},{"name":"Christian Schlegel","is_ca":true},{"name":"Witold A. Krzymień","is_ca":true},{"name":"Zhifeng Shi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001309545,0.0007972483,0.0007257572,0.0008889315,0.0007860201,0.001496461,0.001243585,0.00139415,0.005838391],"category_scores_gemma":[0.0112795,0.0004930269,0.0004723924,0.0007781576,0.002325548,0.002493156,0.00142724,0.001822904,0.0005479797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001381622,"about_ca_system_score_gemma":0.001256597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002325887,"about_ca_topic_score_gemma":0.001721702,"domain_scores_codex":[0.999432,0.0002266882,0.00001335006,0.00004308706,0.0002034246,0.00008139889],"domain_scores_gemma":[0.9956231,0.003193889,0.000365248,0.0001206115,0.0005250781,0.0001722083],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006761782,0.00002993677,0.0003654618,0.00008290225,0.00002028914,0.0001227828,0.0002237627,0.2733201,0.002068557,0.7149826,0.002528389,0.00618754],"study_design_scores_gemma":[0.00001002401,0.00001605978,0.0002041959,0.00001745903,0.000004946243,0.00006320543,0.00004484857,0.815723,0.0004454942,0.1824478,0.001006592,0.00001636279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08457308,0.001963212,0.8362318,0.003346115,0.0002511039,0.00006539434,0.0001762627,0.000214678,0.07317838],"genre_scores_gemma":[0.9213726,0.001797243,0.04107333,0.0003748577,0.0002875912,0.0001319816,0.0001987204,0.0002093446,0.03455444],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005838391,"threshold_uncertainty_score":0.01953137,"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","authors":[{"name":"A. Sridharan","is_ca":false},{"name":"Michael Lentmaier","is_ca":false},{"name":"Dmitri Truhachev","is_ca":true},{"name":"Daniel J. Costello","is_ca":false},{"name":"Kamil Sh. Zigangirov","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002856302,0.001404992,0.0014262,0.001678574,0.001532478,0.001963946,0.002805889,0.002665024,0.003367088],"category_scores_gemma":[0.02862965,0.0007925021,0.0006734909,0.001486764,0.003433945,0.00417231,0.003255603,0.003232129,0.0006845767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001783659,"about_ca_system_score_gemma":0.001475665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007541605,"about_ca_topic_score_gemma":0.0006356509,"domain_scores_codex":[0.9977421,0.001110586,0.00009974583,0.000259587,0.0006112417,0.0001768176],"domain_scores_gemma":[0.9749312,0.02153677,0.001204905,0.000905308,0.0009277283,0.0004942724],"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.0006672505,0.0001278308,0.0008364776,0.0004635655,0.00006587034,0.0001736412,0.0004424242,0.1400839,0.004764858,0.8222533,0.003848718,0.02627218],"study_design_scores_gemma":[0.0001080222,0.00010459,0.0003710394,0.00008402033,0.00002252601,0.0001607961,0.00008721232,0.2342941,0.002263331,0.7611846,0.001272996,0.00004666341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4080456,0.003790121,0.5362896,0.005000243,0.0003693712,0.000139757,0.000722869,0.0003970155,0.04524555],"genre_scores_gemma":[0.8720394,0.00224719,0.1138,0.0005615382,0.0004003335,0.0003399418,0.0007560456,0.000273073,0.009582476],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003367088,"threshold_uncertainty_score":0.01510572,"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","authors":[{"name":"M. V. Burnashev","is_ca":false},{"name":"Christian Schlegel","is_ca":true},{"name":"Witold A. Krzymień","is_ca":true},{"name":"Zhifeng Shi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001309545,0.0007972483,0.0007257572,0.0008889315,0.0007860201,0.001496461,0.001243585,0.00139415,0.005838391],"category_scores_gemma":[0.0112795,0.0004930269,0.0004723924,0.0007781576,0.002325548,0.002493156,0.00142724,0.001822904,0.0005479797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001381622,"about_ca_system_score_gemma":0.001256597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002325887,"about_ca_topic_score_gemma":0.001721702,"domain_scores_codex":[0.999432,0.0002266882,0.00001335006,0.00004308706,0.0002034246,0.00008139889],"domain_scores_gemma":[0.9956231,0.003193889,0.000365248,0.0001206115,0.0005250781,0.0001722083],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006761782,0.00002993677,0.0003654618,0.00008290225,0.00002028914,0.0001227828,0.0002237627,0.2733201,0.002068557,0.7149826,0.002528389,0.00618754],"study_design_scores_gemma":[0.00001002401,0.00001605978,0.0002041959,0.00001745903,0.000004946243,0.00006320543,0.00004484857,0.815723,0.0004454942,0.1824478,0.001006592,0.00001636279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08457308,0.001963212,0.8362318,0.003346115,0.0002511039,0.00006539434,0.0001762627,0.000214678,0.07317838],"genre_scores_gemma":[0.9213726,0.001797243,0.04107333,0.0003748577,0.0002875912,0.0001319816,0.0001987204,0.0002093446,0.03455444],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005838391,"threshold_uncertainty_score":0.01953137,"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","authors":[{"name":"Adel Aghajan","is_ca":false},{"name":"Sayed Jalal Zahabi","is_ca":false},{"name":"Mohammadali Khosravifard","is_ca":false},{"name":"T. Aaron Gulliver","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003250961,0.0008845916,0.00115552,0.001417124,0.001066714,0.001615226,0.001147789,0.001246741,0.003622205],"category_scores_gemma":[0.01184595,0.0004573543,0.0009173336,0.001488096,0.002683143,0.003536657,0.002763925,0.003757005,0.001291574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009567706,"about_ca_system_score_gemma":0.00136219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008494719,"about_ca_topic_score_gemma":0.0004452034,"domain_scores_codex":[0.9977127,0.0006380663,0.0001209258,0.0003655629,0.0009382484,0.0002243419],"domain_scores_gemma":[0.9826015,0.01495329,0.0005948581,0.0006655506,0.001015149,0.0001696596],"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.0001265001,0.00003877451,0.0002734907,0.000170011,0.00004186287,0.0003362535,0.0002211722,0.05790337,0.004492447,0.8951195,0.003041904,0.03823474],"study_design_scores_gemma":[0.00003382665,0.00005856517,0.0002011797,0.00006766173,0.00002511946,0.0004719423,0.00005246495,0.2938889,0.004572778,0.6941932,0.006389434,0.00004493937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003669439,0.0005129548,0.9885707,0.0003288175,0.00008061156,0.00001405891,0.00007718675,0.00009607156,0.006650181],"genre_scores_gemma":[0.5312618,0.004683566,0.442826,0.001220568,0.001364671,0.0003460745,0.0007381281,0.0003773489,0.01718184],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003622205,"threshold_uncertainty_score":0.0171929,"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","authors":[{"name":"Farzane Amirzade","is_ca":true},{"name":"Daniel Panario","is_ca":true},{"name":"Mohammad‐Reza Sadeghi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005350477,0.0003892913,0.0003251099,0.001479403,0.0005523712,0.0007522925,0.0006965644,0.0006731207,0.001666989],"category_scores_gemma":[0.005070271,0.0002749161,0.0004074111,0.0008487874,0.001695246,0.000959254,0.0009736973,0.001303673,0.0003001736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001136196,"about_ca_system_score_gemma":0.0007130865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009449562,"about_ca_topic_score_gemma":0.0005756771,"domain_scores_codex":[0.9993753,0.000178583,0.00002005268,0.0000664621,0.0002686043,0.00009098155],"domain_scores_gemma":[0.9969391,0.001937228,0.00022049,0.0003692988,0.0004285269,0.0001054571],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000208293,0.00004068,0.002516781,0.0001700472,0.00004859194,0.0003092593,0.0005548839,0.2601423,0.02643636,0.6843355,0.002170403,0.02306691],"study_design_scores_gemma":[0.0000141295,0.00005461308,0.001263076,0.00004020672,0.00001379308,0.0001777238,0.00005342352,0.6284549,0.007704496,0.3602082,0.001971007,0.00004436791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5700425,0.001485135,0.3981035,0.001141876,0.0001019325,0.00006386949,0.0004300594,0.0003742205,0.02825691],"genre_scores_gemma":[0.9762554,0.0005631712,0.02037854,0.0001264693,0.00006490436,0.00005571443,0.0001815305,0.00007737898,0.002296934],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001666989,"threshold_uncertainty_score":0.00824374,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}