{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03898227,0.00050437887,0.9516515,0.00040338765,0.000071915085,0.000039388666,0.0001518494,0.00012930353,0.0080659455],"genre_scores_gemma":[0.83379334,0.0023744246,0.15543504,0.0005742495,0.00063506304,0.0002558295,0.0007575912,0.00016878845,0.0060057305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887687,0.00026110574,0.00005120158,0.00026279927,0.000416587,0.0001313294],"domain_scores_gemma":[0.99679106,0.0014833151,0.0005047645,0.0005054071,0.00057845487,0.00013701864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013907871,0.0007534659,0.0005727854,0.0011790043,0.0005092628,0.00092732615,0.0005657759,0.0006733602,0.0028426137],"category_scores_gemma":[0.006222908,0.0003111268,0.0005827159,0.00087027374,0.0018550563,0.0022359702,0.0011233964,0.001635015,0.00053354556],"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.00011896138,0.00005558443,0.0011236928,0.00012087474,0.00003228265,0.00031349412,0.00020664337,0.057147823,0.016775658,0.8804475,0.0028782575,0.04077915],"study_design_scores_gemma":[0.00002911295,0.00022187446,0.0009508822,0.000029485354,0.000016186268,0.00082788215,0.000091205104,0.6130959,0.0059752855,0.37249354,0.006215906,0.000052660867],"about_ca_topic_score_codex":0.00052419974,"about_ca_topic_score_gemma":0.0003214194,"teacher_disagreement_score":0.0028426137,"about_ca_system_score_codex":0.00041019966,"about_ca_system_score_gemma":0.0005892509,"threshold_uncertainty_score":0.009509444},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40418473,0.00096923596,0.58717245,0.0006173578,0.0003909041,0.00004995272,0.00044955712,0.0006134906,0.0055523613],"genre_scores_gemma":[0.9330842,0.00024436347,0.06276061,0.00012544097,0.00008538185,0.00002508879,0.00022594366,0.00002570718,0.0034232582],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994659,0.0000623133,0.00002810661,0.0000949764,0.00026999114,0.000078738354],"domain_scores_gemma":[0.9989053,0.0006370249,0.0001413571,0.000096438554,0.00017905992,0.000040776667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044815667,0.00044767244,0.00055873976,0.00084261585,0.00030691826,0.0007002361,0.00039854538,0.0010779928,0.0020088074],"category_scores_gemma":[0.0032708738,0.00020901239,0.00024240241,0.00055433536,0.00027859403,0.00077950605,0.00071750203,0.0005615898,0.00054243434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002819817,0.00021761571,0.006610192,0.00043749885,0.00014427469,0.0013756307,0.00031565427,0.019836595,0.5176844,0.020474046,0.0016708433,0.4284133],"study_design_scores_gemma":[0.00009663573,0.0006783972,0.018417643,0.0001185027,0.00013013139,0.0032562488,0.00016363527,0.5415184,0.4123313,0.015901953,0.007307584,0.00007963865],"about_ca_topic_score_codex":0.00047734467,"about_ca_topic_score_gemma":0.0006379067,"teacher_disagreement_score":0.0020088074,"about_ca_system_score_codex":0.00031052937,"about_ca_system_score_gemma":0.00045229818,"threshold_uncertainty_score":0.006720066},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020992944,0.0006614854,0.9715514,0.0001817468,0.00005217104,0.00008466895,0.00008797875,0.00014152686,0.00624598],"genre_scores_gemma":[0.73863155,0.0012651132,0.25487888,0.00012500088,0.00014683529,0.00038396986,0.00016682185,0.00008104763,0.0043207454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897194,0.00038576263,0.00004265772,0.00014113242,0.0003407062,0.000117816344],"domain_scores_gemma":[0.997875,0.0012032916,0.0001729301,0.0001452963,0.0005312073,0.00007218891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012484405,0.0016143257,0.000649255,0.0006936031,0.00046945037,0.00120198,0.00049287576,0.0004972014,0.0055232057],"category_scores_gemma":[0.0055861305,0.00045668994,0.00043960544,0.000606007,0.00044587822,0.0008545267,0.000874699,0.0006943432,0.0010111097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007113344,0.00016483452,0.0018891162,0.00055766973,0.00016984674,0.00019493286,0.00036786587,0.48633614,0.053090047,0.10647268,0.0043643094,0.34568128],"study_design_scores_gemma":[0.00012386193,0.00091756706,0.0010706473,0.00014459286,0.00016541127,0.0005012568,0.000149226,0.93614835,0.01006087,0.04212358,0.008538582,0.000056179895],"about_ca_topic_score_codex":0.00097505597,"about_ca_topic_score_gemma":0.0014455905,"teacher_disagreement_score":0.0055232057,"about_ca_system_score_codex":0.0006966053,"about_ca_system_score_gemma":0.0012332316,"threshold_uncertainty_score":0.018476963},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053021885,0.0014086138,0.9256471,0.0011243549,0.0002798212,0.00014141011,0.00012476197,0.00019726071,0.018054793],"genre_scores_gemma":[0.72141176,0.0018981865,0.26542208,0.00069245877,0.0008661373,0.00023977163,0.00018860822,0.00010638198,0.009174611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979498,0.00075029745,0.00014055813,0.00038099525,0.00052635785,0.00025199016],"domain_scores_gemma":[0.99615896,0.0018295345,0.00038086576,0.0009892497,0.00039525898,0.00024619242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022365905,0.00062860514,0.0008004458,0.0013090245,0.0012484405,0.0013461174,0.0011043851,0.0011184308,0.0024626157],"category_scores_gemma":[0.007865245,0.00032455652,0.000890354,0.0022361395,0.004942737,0.004116944,0.0060844244,0.0024707303,0.00058047747],"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.000043586188,0.000017108294,0.00024253641,0.000039743925,0.000005411587,0.00007930291,0.00015812683,0.007043819,0.0018030662,0.97484654,0.00056720845,0.015153605],"study_design_scores_gemma":[0.000029171433,0.00020688988,0.00026306097,0.000047186906,0.000015731106,0.0004232537,0.00009335037,0.091072954,0.003946338,0.89281714,0.01102177,0.00006307125],"about_ca_topic_score_codex":0.000638942,"about_ca_topic_score_gemma":0.00037869133,"teacher_disagreement_score":0.0024626157,"about_ca_system_score_codex":0.0009759408,"about_ca_system_score_gemma":0.00081856863,"threshold_uncertainty_score":0.011828363},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008164554,0.000115025774,0.9887194,0.000121133,0.000041955253,0.0000387478,0.00016381203,0.00052003976,0.0021152382],"genre_scores_gemma":[0.24893269,0.000508799,0.74219745,0.00030326474,0.00012266535,0.00035695542,0.0012433729,0.0005542581,0.0057805832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992768,0.00022303757,0.000045975903,0.00013230692,0.000247404,0.000074492375],"domain_scores_gemma":[0.99912673,0.00033967206,0.000092787166,0.00019993576,0.00018670343,0.000054085023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006046745,0.0005597595,0.0004981889,0.0011718783,0.00040083856,0.0010661193,0.00092528004,0.0008741632,0.0035190198],"category_scores_gemma":[0.0029444783,0.00030839248,0.0006913511,0.0015915388,0.0011973942,0.0020415597,0.0011801049,0.0011492464,0.0013951841],"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.00013708,0.000083872714,0.0005498653,0.000148595,0.000023597111,0.00046355347,0.000439609,0.16100845,0.02156121,0.6274144,0.005388534,0.18278123],"study_design_scores_gemma":[0.000021995258,0.000058600737,0.00014830605,0.000025419471,0.000010528027,0.00022689882,0.00009543595,0.6818277,0.0059148567,0.30163437,0.010004025,0.000031860938],"about_ca_topic_score_codex":0.002244922,"about_ca_topic_score_gemma":0.0020458729,"teacher_disagreement_score":0.0035190198,"about_ca_system_score_codex":0.0005179173,"about_ca_system_score_gemma":0.0009276541,"threshold_uncertainty_score":0.011772335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044493925,0.00028681883,0.9530703,0.00008138811,0.00007476667,0.000028537565,0.00003154016,0.00032807043,0.0016046229],"genre_scores_gemma":[0.5071796,0.0002780269,0.48894837,0.000083440296,0.000097347955,0.00006364326,0.00009137114,0.000047032034,0.0032111227],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998869,0.000030128682,0.000004875436,0.000016752449,0.000045373843,0.000015941316],"domain_scores_gemma":[0.9996315,0.00019050561,0.000043626827,0.00005650444,0.00006210061,0.000015707214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021452397,0.00034630363,0.0002365782,0.00015376811,0.00016586157,0.0002922021,0.00033718257,0.0003791938,0.001498934],"category_scores_gemma":[0.0008493711,0.00014267028,0.0001673686,0.00020630323,0.00024336205,0.0005151213,0.00036404113,0.0004208008,0.00036080394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008973886,0.00016557914,0.00091707904,0.00024326933,0.00005415265,0.0010572803,0.00023886206,0.092943475,0.5052158,0.029431887,0.0020450968,0.36679003],"study_design_scores_gemma":[0.000058750702,0.0007330603,0.0008387675,0.000026889493,0.000027305883,0.0009018189,0.000039840917,0.85531694,0.12847687,0.006494078,0.0070576225,0.000028111259],"about_ca_topic_score_codex":0.00022353123,"about_ca_topic_score_gemma":0.0005162809,"teacher_disagreement_score":0.001498934,"about_ca_system_score_codex":0.00014510252,"about_ca_system_score_gemma":0.00023062741,"threshold_uncertainty_score":0.0050144196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007229546,0.0028058805,0.9778186,0.00046591216,0.00059904123,0.00003720211,0.00014052266,0.0006241995,0.010279153],"genre_scores_gemma":[0.44161546,0.005378195,0.5149764,0.0014342688,0.00096271135,0.00019564581,0.0008455829,0.0004382298,0.034153514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763143,0.0005508132,0.00006822844,0.00025466783,0.0011730667,0.00032175408],"domain_scores_gemma":[0.9963491,0.0016854045,0.0002555796,0.00068364455,0.00088551,0.00014078214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016554198,0.0014321295,0.00086543616,0.000914209,0.0012088605,0.0014655447,0.0016338945,0.0013982628,0.008774281],"category_scores_gemma":[0.0069155814,0.000560336,0.0005071331,0.00087896147,0.0013324922,0.0023773545,0.0016144379,0.0022044417,0.0028557642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002664861,0.00020721594,0.0011827764,0.0012263077,0.00034060323,0.001035973,0.00053791254,0.060257606,0.10841891,0.18198673,0.04473272,0.59740835],"study_design_scores_gemma":[0.0003277947,0.00059944787,0.0012266563,0.000302492,0.0002727726,0.0037405752,0.0002186505,0.6568168,0.14422031,0.1114034,0.08066629,0.00020477572],"about_ca_topic_score_codex":0.001626463,"about_ca_topic_score_gemma":0.0042771725,"teacher_disagreement_score":0.008774281,"about_ca_system_score_codex":0.00067566766,"about_ca_system_score_gemma":0.0012970065,"threshold_uncertainty_score":0.029352903},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029903641,0.00054965366,0.95984864,0.0006085751,0.00006135617,0.00007367293,0.0001613932,0.00036513442,0.008427983],"genre_scores_gemma":[0.80317676,0.0009554122,0.18910904,0.00020913554,0.00015074908,0.0003152169,0.00025876763,0.00015956235,0.0056652995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664354,0.0009539154,0.00017479263,0.0005712763,0.0011774757,0.00047905213],"domain_scores_gemma":[0.98496115,0.010662208,0.0012042982,0.0017033514,0.0010869235,0.00038197002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034126493,0.0009844487,0.0011908294,0.0012129529,0.0011612047,0.0019536605,0.0021981995,0.0012341599,0.0033720552],"category_scores_gemma":[0.01189298,0.0006084559,0.0011405586,0.0014621023,0.0038250175,0.0065836934,0.0034170568,0.0035601438,0.00084471767],"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.0003524795,0.00011470736,0.00041177185,0.0003346389,0.000070339884,0.00026520176,0.00048617166,0.3411435,0.022870984,0.59974945,0.0028866788,0.031314183],"study_design_scores_gemma":[0.000043360218,0.00010919705,0.000121904806,0.00004699374,0.000027448614,0.0001415185,0.000049605325,0.82191104,0.01327455,0.16153216,0.0026647572,0.00007756771],"about_ca_topic_score_codex":0.0009979036,"about_ca_topic_score_gemma":0.00066427886,"teacher_disagreement_score":0.0034126493,"about_ca_system_score_codex":0.0023614136,"about_ca_system_score_gemma":0.0025983157,"threshold_uncertainty_score":0.018048048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021019515,0.0012637413,0.9552836,0.0004461429,0.00014415946,0.00009580615,0.00021727795,0.0003912542,0.021138545],"genre_scores_gemma":[0.8090193,0.002107061,0.18086995,0.00048701605,0.00034036982,0.00045497678,0.00047548016,0.00039260293,0.005853327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99641836,0.00087673304,0.00014398537,0.00043204075,0.0015074183,0.0006214372],"domain_scores_gemma":[0.9826403,0.012438907,0.0009656438,0.0019897155,0.0016396011,0.00032575795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034252796,0.0017034027,0.001425818,0.0023589355,0.0011675523,0.0024057764,0.0021776306,0.0014375835,0.006173583],"category_scores_gemma":[0.025361571,0.00052584667,0.0014974339,0.0028929284,0.00444438,0.0058644293,0.003008499,0.004132928,0.0011311931],"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.00022423784,0.000105560735,0.0007465092,0.00035360423,0.000058226055,0.00029873356,0.00031447544,0.2800331,0.011225962,0.67204744,0.0039387126,0.030653408],"study_design_scores_gemma":[0.000014411775,0.00006249214,0.0003121066,0.000069916365,0.000022676148,0.00023248624,0.0000568106,0.7303036,0.0105091715,0.25572246,0.0026183368,0.00007553124],"about_ca_topic_score_codex":0.001940855,"about_ca_topic_score_gemma":0.0010452225,"teacher_disagreement_score":0.006173583,"about_ca_system_score_codex":0.0021342188,"about_ca_system_score_gemma":0.0016315893,"threshold_uncertainty_score":0.020652711},"labels":[],"label_agreement":null}]}