{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":9,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":9,"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":"46041a96d33c","filters":{"venue":"International Symposium on Information Theory and its Applications"}},"results":[{"id":"W3139172876","doi":"","title":"A Capacity-achieving One-way Key Agreement with Improved Finite Blocklength Analysis","year":2020,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Key (lock); Pre-shared key; Computer science; Alice and Bob; Key-agreement protocol; Shared secret; Alice (programming language); Public-key cryptography; Cryptography; Key distribution; Computer security; Cryptographic protocol; Key generation; Protocol (science); Channel (broadcasting); Key exchange; Theoretical computer science; Computer network; Encryption","authors":[{"name":"Setareh Sharifian","is_ca":true},{"name":"Alireza Poostindouz","is_ca":true},{"name":"Reihaneh Safavi–Naini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01031670758620045,"gpt":0.214881811462932,"spread":0.2045651038767316,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002487859,0.0001661451,0.0001637753,0.0001939264,0.0001504546,0.0001458615,0.0003773572,0.00006751334,0.0001181461],"category_scores_gemma":[0.00003953684,0.0001626328,0.00005925612,0.000442537,0.00004162815,0.000729194,0.00006730091,0.0002221024,0.00008743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006648953,"about_ca_system_score_gemma":0.000008737711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004216263,"about_ca_topic_score_gemma":0.000004509699,"domain_scores_codex":[0.9990453,0.00004604859,0.0004013575,0.0001402234,0.0002408361,0.0001262551],"domain_scores_gemma":[0.9990631,0.0002140864,0.0001401944,0.0002777053,0.0001932265,0.0001117383],"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.0001494065,0.0001079683,0.0001760954,0.0001148253,0.001268181,1.71334e-7,0.007073169,0.0417029,0.007726246,0.9301334,0.0001349411,0.01141269],"study_design_scores_gemma":[0.001256324,0.0002801323,0.001789277,0.0001016089,0.000474565,0.000006036006,0.0008073999,0.7137589,0.03929138,0.002838919,0.238369,0.001026489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05484461,0.00008857209,0.8867161,0.006783534,0.00005117455,0.001177165,0.0003655325,0.001039627,0.04893368],"genre_scores_gemma":[0.9958252,0.0002903895,0.001949917,0.001059645,0.00005295688,0.0005195105,0.000264027,0.00001318471,0.00002519379],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9409806,"threshold_uncertainty_score":0.6631972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2585233219","doi":"","title":"Embedded pilot and multi-size OFDM processing for jointly time and frequency selective channels","year":2016,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Pilot signal; Orthogonal frequency-division multiplexing; Computer science; Frequency domain; Impulse response; Time domain; Channel (broadcasting); SIGNAL (programming language); Frequency divider; Electronic engineering; Time–frequency analysis; Signal processing; MIMO; Impulse (physics); Telecommunications; Engineering; Mathematics; Radar","authors":[{"name":"Christian Schlegel","is_ca":true},{"name":"Marcel Jar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01093807024059796,"gpt":0.2615183208337508,"spread":0.2505802505931528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002209039,0.0001333253,0.0001044536,0.0000950604,0.0001702155,0.00007647216,0.0001403761,0.00005534257,0.00001605967],"category_scores_gemma":[0.0001001937,0.0001114682,0.00001578716,0.0000725239,0.00006494949,0.001129431,0.00004044485,0.00007198194,0.00001876728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005927994,"about_ca_system_score_gemma":0.000009650079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.521719e-7,"about_ca_topic_score_gemma":5.641871e-7,"domain_scores_codex":[0.999379,0.00002146794,0.0002813701,0.0001211229,0.00008784734,0.0001092291],"domain_scores_gemma":[0.9990643,0.0004278,0.0001077995,0.0001262182,0.0002171263,0.00005679075],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001513298,0.00008560946,0.00002862196,0.0001405895,0.00009347505,5.948149e-8,0.001891299,0.000463504,0.162655,0.6686743,0.0002173314,0.1655988],"study_design_scores_gemma":[0.006633329,0.0007958782,0.001807681,0.0008480849,0.00009898349,0.00009141903,0.0006100792,0.2268751,0.4084943,0.3020175,0.04971902,0.002008572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01649486,0.0002751823,0.9734715,0.001319623,0.00006542723,0.0014955,0.000290014,0.0006143424,0.005973574],"genre_scores_gemma":[0.9898252,0.0005555981,0.007828224,0.0002070698,0.00004501316,0.001207542,0.00004426049,0.00001835878,0.0002687585],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9733303,"threshold_uncertainty_score":0.4545541,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2547365694","doi":"","title":"Matched-filter detection of the presence of MPSK signals","year":2014,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":3,"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":"Matched filter; Computer science; Filter (signal processing); Filtering theory; Artificial intelligence; Computer vision","authors":[{"name":"Seyed Ali Saberali","is_ca":true},{"name":"Norman C. Beaulieu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.003803111894123524,"gpt":0.204127451302217,"spread":0.2003243394080935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003077271,0.00007068738,0.00008382837,0.00006493085,0.00005546277,0.00002105874,0.0001736834,0.00004757031,0.0000308505],"category_scores_gemma":[0.00004951171,0.00005451845,0.00004480007,0.0001080177,0.00003183163,0.0002894204,0.00001875315,0.00006804534,0.00004031009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001810418,"about_ca_system_score_gemma":0.000003805935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003447897,"about_ca_topic_score_gemma":0.000001270076,"domain_scores_codex":[0.9993429,0.00004715386,0.0003300829,0.00005274491,0.0001705999,0.00005647685],"domain_scores_gemma":[0.9993929,0.0001799865,0.0001374817,0.0001446868,0.0001217169,0.00002321786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008971766,0.00003835254,0.00005545987,0.0001534464,0.00009741759,8.177817e-9,0.001063577,0.04683045,0.416294,0.5058291,0.0001065961,0.02944192],"study_design_scores_gemma":[0.0005973543,0.00006635165,0.00129447,0.00008484388,0.00002388164,0.000008939403,0.0003131329,0.2029287,0.684347,0.008027742,0.1021263,0.0001813462],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4651259,0.0001172542,0.3996906,0.0009079642,0.001660454,0.001742343,0.0001994642,0.0003022234,0.1302538],"genre_scores_gemma":[0.9995336,0.00002368897,0.00001023902,0.00008783196,0.00005103526,0.0001534416,0.00000544947,0.000004816283,0.0001298925],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5344077,"threshold_uncertainty_score":0.2223198,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2594741606","doi":"","title":"Dirty interference cancelation for multiple access channels.","year":2014,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Interference (communication); Computer science; Adjacent-channel interference; Computer network; Telecommunications; Channel (broadcasting)","authors":[{"name":"Ruchen Duan","is_ca":false},{"name":"Yingbin Liang","is_ca":false},{"name":"Ashish Khisti","is_ca":true},{"name":"Shlomo Shamai","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01123115713256123,"gpt":0.2696267618955675,"spread":0.2583956047630063,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002817183,0.0001267564,0.00009478627,0.0001233319,0.0001540933,0.0001315084,0.0004170003,0.00006706507,0.00002598315],"category_scores_gemma":[0.0001075783,0.0001292174,0.00003228987,0.0001008933,0.00003083374,0.001368332,0.00005941597,0.0001076592,0.00003921385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007561158,"about_ca_system_score_gemma":0.000005771916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000019114,"about_ca_topic_score_gemma":0.00000205004,"domain_scores_codex":[0.99933,0.00002711158,0.0003176679,0.0001066055,0.0001085002,0.0001100715],"domain_scores_gemma":[0.9989212,0.0004879363,0.0001110728,0.0002242156,0.0002054493,0.00005017066],"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.0000505945,0.00002028374,0.00003535111,0.00004807644,0.00002346063,4.995174e-9,0.0003116609,0.02751857,0.001487426,0.9089719,0.0003427613,0.06118988],"study_design_scores_gemma":[0.0005995189,0.00005750927,0.0002845315,0.00006726765,0.00001133671,0.000002739727,0.00007209216,0.4731071,0.04788587,0.0640901,0.413477,0.0003449538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002906218,0.00002995763,0.9797831,0.0004880092,0.0002226628,0.0006977589,0.0001041785,0.0004432106,0.01532494],"genre_scores_gemma":[0.9956332,0.0002823794,0.001118348,0.0003615209,0.0001008834,0.002058856,0.0003321144,0.000014542,0.00009814141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.992727,"threshold_uncertainty_score":0.5269333,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1556416173","doi":"","title":"On statistical restricted isometry property of a new class of deterministic partial Fourier compressed sensing matrices","year":2012,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"","keywords":"Restricted isometry property; Compressed sensing; Block matrix; DFT matrix; Matrix (chemical analysis); Concatenation (mathematics); Algorithm; Isometry (Riemannian geometry); Sparse matrix; Mutual coherence; Discrete Fourier transform (general); Mathematics; Fourier transform; Single-entry matrix; Computer science; Coherence (philosophical gambling strategy); Fourier analysis; Combinatorics; Symmetric matrix; Mathematical analysis; Matrix function; Square matrix; Fractional Fourier transform; Physics; Gaussian","authors":[{"name":"Nam Yul Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01233338157427552,"gpt":0.254788107406447,"spread":0.2424547258321715,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001195626,0.0001026983,0.0001236734,0.0001510773,0.00004563422,0.0000250669,0.0001098749,0.00005981366,0.00003073915],"category_scores_gemma":[0.00007837595,0.00008217376,0.00002650943,0.0001234239,0.0000401558,0.0003067106,0.00002477158,0.0000925741,0.0000182665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000242279,"about_ca_system_score_gemma":0.00001295266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005593895,"about_ca_topic_score_gemma":1.401506e-7,"domain_scores_codex":[0.9992362,0.00003208004,0.000363998,0.00006261256,0.0001984911,0.0001065676],"domain_scores_gemma":[0.9991702,0.0003747862,0.0001414174,0.0001285137,0.0001177347,0.00006735107],"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.0003229368,0.0001305946,0.00005843366,0.00009049894,0.0001201944,2.979549e-7,0.0008815933,0.007012633,0.0197876,0.9290972,0.002302775,0.04019522],"study_design_scores_gemma":[0.001547087,0.0004219978,0.002613082,0.0004609895,0.0001635259,0.00004186398,0.0003205687,0.4593631,0.417734,0.02585815,0.09074554,0.0007300509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.167237,0.00009496269,0.8010579,0.0001920826,0.0003503241,0.0007536834,0.0002943861,0.0002948596,0.0297248],"genre_scores_gemma":[0.9981041,0.00005262563,0.001554469,0.00008424367,0.00007890142,0.00001785721,0.00006160676,0.000008590188,0.00003759197],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9032391,"threshold_uncertainty_score":0.3350949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2549675421","doi":"","title":"Design factors for dual-hop AF systems with partial relay selection","year":2014,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"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":"Relay; Computer science; Dual (grammatical number); Selection (genetic algorithm); Hop (telecommunications); Computer network; Artificial intelligence; Physics","authors":[{"name":"Samy S. Soliman","is_ca":true},{"name":"Norman C. Beaulieu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01882366071901197,"gpt":0.2566302119809246,"spread":0.2378065512619126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007828301,0.0001297023,0.0000996665,0.0001130852,0.0004515068,0.0003484166,0.0003735882,0.00005415043,0.00001149584],"category_scores_gemma":[0.00008057924,0.0001055436,0.00002736673,0.0002006253,0.00002821923,0.001239596,0.000063375,0.0001002445,0.00004263805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005725753,"about_ca_system_score_gemma":0.00002752152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.684187e-7,"about_ca_topic_score_gemma":6.684833e-7,"domain_scores_codex":[0.9990413,0.0001652461,0.0002985089,0.0001718884,0.0001950981,0.0001279892],"domain_scores_gemma":[0.9982907,0.0008170602,0.0002039576,0.0002354459,0.0003846336,0.00006824981],"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.00005321982,0.00002759036,0.000017177,0.000007394211,0.00002525429,1.026876e-8,0.0007153687,0.02050352,0.0003920696,0.9725866,0.0002060781,0.005465698],"study_design_scores_gemma":[0.0006694619,0.000249798,0.0001222468,0.00003806822,0.00001306927,0.00001265611,0.0001214574,0.7128193,0.004456812,0.002197916,0.279045,0.000254131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001860465,0.00002431033,0.9924499,0.001169569,0.0001742486,0.0007689535,0.00001006297,0.0001469958,0.003395488],"genre_scores_gemma":[0.9943978,0.0001167587,0.003488695,0.0004834227,0.0001141192,0.000971879,0.00008147216,0.000007616389,0.0003383067],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9925373,"threshold_uncertainty_score":0.4303942,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2584903853","doi":"","title":"Bipartite grammar-based representations of large sparse binary matrices: Framework and transforms","year":2016,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Algorithms and Data Compression","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":"University of Waterloo","funders":"","keywords":"Terminal and nonterminal symbols; Bipartite graph; Logical matrix; Binary number; Matrix (chemical analysis); Combinatorics; Mathematics; Algorithm; Context (archaeology); Discrete mathematics; Graph; Computer science; Rule-based machine translation; Arithmetic; Artificial intelligence","authors":[{"name":"En‐hui Yang","is_ca":true},{"name":"Jingyun Bian","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00808969763943832,"gpt":0.2682132733975769,"spread":0.2601235757581386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003795639,0.0001065224,0.0000957091,0.0001685339,0.0001785565,0.00009866996,0.0003859351,0.00006500023,0.00005216406],"category_scores_gemma":[0.00005829718,0.00007333567,0.00003622989,0.0002065658,0.00005424862,0.001870417,0.0000997443,0.00006930687,0.00004901595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001898377,"about_ca_system_score_gemma":0.00002444899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003220956,"about_ca_topic_score_gemma":4.266128e-7,"domain_scores_codex":[0.9990474,0.00004394981,0.000363847,0.0001782311,0.000245204,0.0001213545],"domain_scores_gemma":[0.9987346,0.0005210071,0.0002006884,0.000294069,0.0001694798,0.00008014199],"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.00004159931,0.00006803805,0.00009122295,0.00001674232,0.00001444622,1.520417e-7,0.0003157905,0.00008629632,0.000945025,0.976916,0.0001088068,0.02139591],"study_design_scores_gemma":[0.003761602,0.0004667366,0.007433245,0.0006743971,0.0000573689,0.00003392374,0.000431318,0.08416171,0.0342331,0.4737934,0.3940496,0.0009036446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007155814,0.00006230234,0.9867757,0.003392635,0.0001132252,0.0003232541,0.000299122,0.0000739158,0.001804039],"genre_scores_gemma":[0.9890398,0.000519647,0.009189979,0.0007114154,0.00005772037,0.000256941,0.0001020447,0.000006170794,0.0001162316],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9818841,"threshold_uncertainty_score":0.2990542,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2583896214","doi":"","title":"On a variant of multilinear modular hashing with applications to authentication and secrecy codes","year":2016,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Cryptography and Data Security","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":"University of Victoria","funders":"","keywords":"Universal hashing; Multilinear map; Computer science; Theoretical computer science; Secrecy; Hash function; Universality (dynamical systems); Authentication (law); Modular design; Cryptography; Scheme (mathematics); Message authentication code; Binary code; Algorithm; Binary number; Double hashing; Mathematics; Computer security; Arithmetic; Hash table; Programming language","authors":[{"name":"Khodakhast Bibak","is_ca":true},{"name":"Bruce M. Kapron","is_ca":true},{"name":"Venkatesh Srinivasan","is_ca":true},{"name":"László Tóth","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006411805616823589,"gpt":0.2404554890895196,"spread":0.234043683472696,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004021119,0.0001172722,0.00009805696,0.0002075259,0.0001715499,0.000120062,0.0003938159,0.00004563873,0.00001459736],"category_scores_gemma":[0.00005625316,0.00008291967,0.00002471163,0.0002392624,0.00006050788,0.001112755,0.00009777094,0.00006066275,0.00004834097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002404525,"about_ca_system_score_gemma":0.00001956859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003917402,"about_ca_topic_score_gemma":0.000001476215,"domain_scores_codex":[0.999081,0.00004207948,0.0002995239,0.0002264126,0.0002465378,0.0001044629],"domain_scores_gemma":[0.9987022,0.0004325856,0.0001744093,0.0003508028,0.0002400316,0.00009994247],"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.00007333166,0.00007685623,0.00002370592,0.00001321162,0.00002445298,6.840521e-8,0.0007007861,0.0001067102,0.003190923,0.9770858,0.00001541882,0.01868874],"study_design_scores_gemma":[0.003144944,0.0008551686,0.005089808,0.0004516956,0.00006990406,0.00007304538,0.0003920967,0.02928484,0.03749933,0.8006179,0.1215297,0.0009914741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01750069,0.00001195566,0.9777915,0.002405871,0.00003094444,0.0006594918,0.0002410863,0.00006773417,0.00129076],"genre_scores_gemma":[0.9897091,0.00006589533,0.009011864,0.0005253729,0.00002986374,0.0005743572,0.00005683804,0.000004762207,0.0000219332],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9722084,"threshold_uncertainty_score":0.3381366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3139202565","doi":"","title":"A Simple Capacity Outer Bound for Two-Way Channels and Capacity Approximation Results","year":2020,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Channel capacity; Upper and lower bounds; Symmetry (geometry); Simple (philosophy); Coding (social sciences); Channel (broadcasting); Computation; Mathematics; Channel code; Capacity planning; Computer science; Decoding methods; Algorithm; Statistics; Mathematical analysis; Telecommunications; Geometry","authors":[{"name":"Jian-Jia Weng","is_ca":true},{"name":"Fady Alajaji","is_ca":true},{"name":"Tamás Linder","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02092861560926353,"gpt":0.253743228671858,"spread":0.2328146130625945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004194323,0.0001603109,0.0001340998,0.00009244762,0.0002003171,0.0002007211,0.0002518099,0.00008684552,0.00001359259],"category_scores_gemma":[0.0001195436,0.000168511,0.00003932587,0.0001138773,0.00006083677,0.001087171,0.00005858874,0.0001619446,0.00003226646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005768961,"about_ca_system_score_gemma":0.000006489878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004518198,"about_ca_topic_score_gemma":0.000001704164,"domain_scores_codex":[0.9990515,0.00004194992,0.0004559703,0.000154618,0.0001663496,0.0001296393],"domain_scores_gemma":[0.9990417,0.0002974456,0.0001393568,0.0002006263,0.0002152682,0.0001055576],"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.0001277145,0.00003053389,0.000006540949,0.0001219031,0.00005661372,3.339986e-8,0.004872677,0.002774467,0.004836758,0.9800095,0.0009973558,0.006165916],"study_design_scores_gemma":[0.002103259,0.0001443375,0.0001627695,0.00005622815,0.00003724699,0.00001423709,0.0004404864,0.4363006,0.07015425,0.07232762,0.4176285,0.0006304558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1464929,0.00007349408,0.8171884,0.00777851,0.000211488,0.00285112,0.002008499,0.001188836,0.02220678],"genre_scores_gemma":[0.9958154,0.0001118271,0.001340498,0.001075338,0.0001350278,0.0009729848,0.0005170245,0.0000152722,0.00001661148],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9076819,"threshold_uncertainty_score":0.6871678,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}