{"meta":{"query_hash":"46041a96d33c","filters":{"venue":"International Symposium on Information Theory and its Applications"},"cohort_total":9,"direct_labels_cover":0,"predictions_cover":9,"exported":9,"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/46041a96d33c","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Symposium+on+Information+Theory+and+its+Applications"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012333381574275515,"score_gpt":0.254788107406447,"score_spread":0.24245472583217145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556416173","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.167237,0.00009496269,0.8010579,0.00019208256,0.00035032412,0.0007536834,0.00029438615,0.00029485958,0.029724801],"genre_scores_gemma":[0.9981041,0.00005262563,0.0015544688,0.00008424367,0.00007890142,0.000017857206,0.000061606755,0.000008590188,0.000037591966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992362,0.000032080035,0.00036399803,0.00006261256,0.00019849112,0.00010656757],"domain_scores_gemma":[0.9991702,0.00037478624,0.00014141745,0.00012851373,0.00011773468,0.00006735107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001195626,0.00010269834,0.00012367342,0.00015107726,0.000045634217,0.000025066904,0.000109874905,0.000059813658,0.000030739153],"category_scores_gemma":[0.000078375946,0.00008217376,0.00002650943,0.00012342389,0.000040155803,0.0003067106,0.000024771582,0.000092574104,0.000018266495],"study_design_candidate":"theoretical_or_conceptual","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.00032293683,0.00013059462,0.000058433663,0.00009049894,0.00012019441,2.9795487e-7,0.00088159327,0.0070126327,0.019787598,0.92909724,0.0023027747,0.040195215],"study_design_scores_gemma":[0.0015470868,0.00042199777,0.0026130818,0.0004609895,0.00016352585,0.000041863976,0.00032056865,0.45936313,0.41773403,0.025858145,0.09074554,0.0007300509],"about_ca_topic_score_codex":0.0000055938954,"about_ca_topic_score_gemma":1.4015058e-7,"teacher_disagreement_score":0.9032391,"about_ca_system_score_codex":0.0000242279,"about_ca_system_score_gemma":0.000012952655,"threshold_uncertainty_score":0.3350949},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Matched filter; Computer science; Filter (signal processing); Filtering theory; Artificial intelligence; Computer vision","score_opus":0.0038031118941235236,"score_gpt":0.20412745130221704,"score_spread":0.20032433940809352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547365694","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46512592,0.00011725418,0.39969057,0.0009079642,0.0016604542,0.001742343,0.00019946424,0.00030222337,0.13025382],"genre_scores_gemma":[0.9995336,0.000023688974,0.0000102390195,0.000087831955,0.000051035262,0.00015344164,0.0000054494703,0.0000048162833,0.00012989253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993429,0.00004715386,0.00033008293,0.000052744912,0.0001705999,0.00005647685],"domain_scores_gemma":[0.9993929,0.00017998653,0.00013748171,0.00014468678,0.0001217169,0.00002321786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030772708,0.000070687376,0.00008382837,0.00006493085,0.000055462773,0.000021058742,0.00017368337,0.000047570305,0.0000308505],"category_scores_gemma":[0.000049511706,0.00005451845,0.00004480007,0.00010801771,0.000031831634,0.00028942042,0.000018753153,0.00006804534,0.000040310086],"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.00008971766,0.00003835254,0.00005545987,0.0001534464,0.00009741759,8.177817e-9,0.0010635775,0.04683045,0.41629398,0.5058291,0.000106596075,0.029441921],"study_design_scores_gemma":[0.0005973543,0.000066351655,0.0012944697,0.00008484388,0.000023881637,0.000008939403,0.0003131329,0.20292868,0.684347,0.008027742,0.10212629,0.00018134621],"about_ca_topic_score_codex":0.0000034478971,"about_ca_topic_score_gemma":0.000001270076,"teacher_disagreement_score":0.5344077,"about_ca_system_score_codex":0.000018104176,"about_ca_system_score_gemma":0.0000038059347,"threshold_uncertainty_score":0.22231978},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01882366071901197,"score_gpt":0.2566302119809246,"score_spread":0.23780655126191264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549675421","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.0018604654,0.000024310333,0.9924499,0.0011695689,0.00017424856,0.00076895347,0.000010062974,0.0001469958,0.003395488],"genre_scores_gemma":[0.99439776,0.000116758674,0.0034886948,0.00048342271,0.00011411924,0.000971879,0.000081472164,0.000007616389,0.00033830674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904126,0.00016524609,0.00029850888,0.00017188842,0.00019509814,0.00012798923],"domain_scores_gemma":[0.99829066,0.00081706024,0.00020395762,0.00023544593,0.00038463357,0.00006824981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078283006,0.00012970227,0.000099666504,0.00011308525,0.0004515068,0.0003484166,0.00037358818,0.000054150427,0.000011495837],"category_scores_gemma":[0.000080579244,0.000105543586,0.000027366732,0.00020062528,0.000028219229,0.0012395956,0.000063375,0.00010024453,0.000042638047],"study_design_candidate":"theoretical_or_conceptual","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.00005321982,0.000027590362,0.000017176995,0.000007394211,0.000025254289,1.02687645e-8,0.00071536866,0.020503523,0.0003920696,0.97258663,0.00020607811,0.005465698],"study_design_scores_gemma":[0.0006694619,0.00024979803,0.00012224678,0.00003806822,0.000013069266,0.0000126561135,0.00012145742,0.71281934,0.0044568116,0.0021979157,0.27904502,0.000254131],"about_ca_topic_score_codex":9.684187e-7,"about_ca_topic_score_gemma":6.684833e-7,"teacher_disagreement_score":0.99253726,"about_ca_system_score_codex":0.00005725753,"about_ca_system_score_gemma":0.000027521522,"threshold_uncertainty_score":0.43039423},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006411805616823589,"score_gpt":0.24045548908951958,"score_spread":0.234043683472696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583896214","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.017500686,0.000011955662,0.9777915,0.0024058712,0.00003094444,0.00065949175,0.00024108625,0.000067734174,0.0012907599],"genre_scores_gemma":[0.98970914,0.00006589533,0.009011864,0.0005253729,0.000029863744,0.00057435717,0.000056838042,0.0000047622066,0.000021933198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908096,0.00004207948,0.00029952388,0.00022641258,0.00024653782,0.000104462866],"domain_scores_gemma":[0.9987022,0.00043258563,0.00017440926,0.00035080285,0.00024003162,0.00009994247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040211188,0.0001172722,0.00009805696,0.00020752593,0.00017154985,0.00012006195,0.00039381586,0.00004563873,0.000014597362],"category_scores_gemma":[0.000056253164,0.000082919665,0.000024711635,0.0002392624,0.00006050788,0.001112755,0.00009777094,0.000060662747,0.000048340975],"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.000073331656,0.00007685623,0.000023705923,0.000013211622,0.000024452982,6.840521e-8,0.00070078607,0.000106710155,0.0031909228,0.97708577,0.000015418822,0.01868874],"study_design_scores_gemma":[0.0031449439,0.00085516856,0.0050898083,0.00045169558,0.00006990406,0.000073045376,0.00039209667,0.02928484,0.037499335,0.80061793,0.12152973,0.0009914741],"about_ca_topic_score_codex":0.0000039174015,"about_ca_topic_score_gemma":0.0000014762147,"teacher_disagreement_score":0.97220844,"about_ca_system_score_codex":0.000024045246,"about_ca_system_score_gemma":0.000019568592,"threshold_uncertainty_score":0.33813658},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00808969763943832,"score_gpt":0.26821327339757695,"score_spread":0.2601235757581386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584903853","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.0071558137,0.000062302344,0.9867757,0.0033926351,0.00011322524,0.0003232541,0.00029912198,0.0000739158,0.0018040388],"genre_scores_gemma":[0.98903984,0.000519647,0.009189979,0.00071141537,0.000057720372,0.000256941,0.00010204468,0.0000061707938,0.000116231575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990474,0.000043949814,0.000363847,0.00017823112,0.00024520402,0.00012135451],"domain_scores_gemma":[0.9987346,0.00052100705,0.0002006884,0.000294069,0.00016947978,0.00008014199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003795639,0.000106522355,0.0000957091,0.00016853385,0.0001785565,0.00009866996,0.00038593507,0.00006500023,0.000052164065],"category_scores_gemma":[0.000058297177,0.00007333567,0.00003622989,0.00020656579,0.000054248623,0.0018704166,0.0000997443,0.00006930687,0.000049015955],"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.000041599313,0.00006803805,0.00009122295,0.000016742319,0.000014446223,1.5204175e-7,0.00031579047,0.00008629632,0.000945025,0.97691596,0.00010880683,0.021395909],"study_design_scores_gemma":[0.0037616023,0.0004667366,0.007433245,0.0006743971,0.000057368903,0.00003392374,0.00043131798,0.08416171,0.0342331,0.47379336,0.3940496,0.0009036446],"about_ca_topic_score_codex":0.0000032209562,"about_ca_topic_score_gemma":4.2661281e-7,"teacher_disagreement_score":0.98188406,"about_ca_system_score_codex":0.000018983768,"about_ca_system_score_gemma":0.000024448991,"threshold_uncertainty_score":0.29905418},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010938070240597958,"score_gpt":0.26151832083375076,"score_spread":0.2505802505931528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585233219","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.01649486,0.00027518233,0.97347146,0.0013196229,0.00006542723,0.0014954996,0.000290014,0.0006143424,0.005973574],"genre_scores_gemma":[0.9898252,0.0005555981,0.0078282235,0.00020706977,0.000045013163,0.0012075425,0.00004426049,0.00001835878,0.00026875854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999379,0.00002146794,0.0002813701,0.00012112288,0.000087847344,0.00010922908],"domain_scores_gemma":[0.99906427,0.0004278,0.000107799475,0.00012621819,0.00021712626,0.000056790752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002209039,0.00013332532,0.00010445365,0.0000950604,0.00017021548,0.000076472155,0.00014037608,0.000055342567,0.000016059674],"category_scores_gemma":[0.00010019373,0.00011146818,0.000015787162,0.0000725239,0.00006494949,0.0011294314,0.000040444855,0.000071981936,0.000018767285],"study_design_candidate":"theoretical_or_conceptual","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.00015132985,0.00008560946,0.00002862196,0.00014058952,0.00009347505,5.948149e-8,0.0018912992,0.00046350402,0.16265503,0.66867435,0.0002173314,0.16559884],"study_design_scores_gemma":[0.006633329,0.00079587824,0.0018076813,0.0008480849,0.00009898349,0.00009141903,0.0006100792,0.22687511,0.40849432,0.30201754,0.049719017,0.0020085725],"about_ca_topic_score_codex":7.521719e-7,"about_ca_topic_score_gemma":5.6418713e-7,"teacher_disagreement_score":0.9733303,"about_ca_system_score_codex":0.000059279944,"about_ca_system_score_gemma":0.000009650079,"threshold_uncertainty_score":0.45455405},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Interference (communication); Computer science; Adjacent-channel interference; Computer network; Telecommunications; Channel (broadcasting)","score_opus":0.011231157132561228,"score_gpt":0.2696267618955675,"score_spread":0.25839560476300627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594741606","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.0029062177,0.000029957631,0.97978306,0.00048800925,0.00022266283,0.0006977589,0.0001041785,0.00044321056,0.015324935],"genre_scores_gemma":[0.9956332,0.0002823794,0.0011183479,0.00036152094,0.00010088344,0.0020588564,0.00033211437,0.000014541996,0.000098141405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933004,0.000027111577,0.00031766787,0.00010660546,0.000108500164,0.00011007151],"domain_scores_gemma":[0.99892116,0.00048793625,0.000111072826,0.00022421565,0.00020544932,0.000050170664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028171827,0.0001267564,0.00009478627,0.00012333188,0.0001540933,0.00013150844,0.0004170003,0.00006706507,0.000025983147],"category_scores_gemma":[0.00010757829,0.00012921741,0.00003228987,0.00010089332,0.000030833737,0.0013683322,0.000059415972,0.00010765915,0.000039213854],"study_design_candidate":"theoretical_or_conceptual","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.000050594503,0.00002028374,0.00003535111,0.000048076436,0.00002346063,4.9951736e-9,0.0003116609,0.02751857,0.001487426,0.9089719,0.0003427613,0.061189882],"study_design_scores_gemma":[0.0005995189,0.000057509274,0.00028453147,0.000067267654,0.000011336705,0.0000027397273,0.00007209216,0.47310707,0.04788587,0.064090095,0.413477,0.00034495382],"about_ca_topic_score_codex":0.0000019114004,"about_ca_topic_score_gemma":0.0000020500397,"teacher_disagreement_score":0.992727,"about_ca_system_score_codex":0.00007561158,"about_ca_system_score_gemma":0.0000057719158,"threshold_uncertainty_score":0.5269333},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010316707586200447,"score_gpt":0.21488181146293203,"score_spread":0.20456510387673157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139172876","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.05484461,0.000088572095,0.8867161,0.006783534,0.000051174553,0.0011771653,0.00036553253,0.0010396271,0.048933677],"genre_scores_gemma":[0.9958252,0.00029038952,0.0019499171,0.0010596452,0.000052956875,0.0005195105,0.00026402695,0.000013184713,0.000025193793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904525,0.000046048594,0.00040135754,0.00014022336,0.00024083612,0.00012625511],"domain_scores_gemma":[0.9990631,0.00021408644,0.00014019443,0.00027770526,0.0001932265,0.000111738314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024878595,0.00016614514,0.00016377533,0.00019392642,0.00015045461,0.00014586154,0.0003773572,0.00006751334,0.000118146054],"category_scores_gemma":[0.000039536837,0.00016263279,0.000059256123,0.000442537,0.00004162815,0.00072919397,0.000067300905,0.00022210243,0.00008743],"study_design_candidate":"theoretical_or_conceptual","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.00014940654,0.000107968306,0.00017609539,0.00011482532,0.0012681815,1.7133398e-7,0.0070731686,0.0417029,0.0077262456,0.9301334,0.00013494106,0.011412692],"study_design_scores_gemma":[0.001256324,0.00028013228,0.0017892772,0.000101608945,0.000474565,0.000006036006,0.00080739986,0.7137589,0.03929138,0.002838919,0.23836899,0.0010264894],"about_ca_topic_score_codex":0.0000042162633,"about_ca_topic_score_gemma":0.0000045096995,"teacher_disagreement_score":0.94098055,"about_ca_system_score_codex":0.000066489534,"about_ca_system_score_gemma":0.000008737711,"threshold_uncertainty_score":0.6631972},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020928615609263533,"score_gpt":0.253743228671858,"score_spread":0.23281461306259446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139202565","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.14649285,0.000073494084,0.81718844,0.00777851,0.000211488,0.0028511204,0.0020084986,0.0011888364,0.022206781],"genre_scores_gemma":[0.9958154,0.00011182709,0.0013404983,0.0010753383,0.00013502777,0.00097298477,0.00051702454,0.000015272195,0.000016611484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905145,0.00004194992,0.00045597026,0.00015461798,0.00016634962,0.00012963932],"domain_scores_gemma":[0.99904174,0.00029744563,0.00013935677,0.00020062625,0.00021526821,0.00010555759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004194323,0.00016031085,0.00013409977,0.00009244762,0.00020031711,0.00020072112,0.00025180992,0.00008684552,0.000013592588],"category_scores_gemma":[0.000119543634,0.00016851097,0.00003932587,0.0001138773,0.000060836766,0.0010871709,0.00005858874,0.00016194464,0.000032266464],"study_design_candidate":"theoretical_or_conceptual","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.00012771453,0.000030533894,0.000006540949,0.000121903075,0.00005661372,3.3399857e-8,0.004872677,0.0027744665,0.0048367577,0.9800095,0.0009973558,0.0061659156],"study_design_scores_gemma":[0.0021032593,0.00014433754,0.0001627695,0.00005622815,0.00003724699,0.000014237095,0.00044048636,0.43630064,0.07015425,0.07232762,0.4176285,0.0006304558],"about_ca_topic_score_codex":0.0000045181982,"about_ca_topic_score_gemma":0.0000017041637,"teacher_disagreement_score":0.9076819,"about_ca_system_score_codex":0.000057689613,"about_ca_system_score_gemma":0.000006489878,"threshold_uncertainty_score":0.6871678},"labels":[],"label_agreement":null}]}