{"meta":{"query_hash":"fea12930f71b","filters":{"topic":"Wireless Communication Security Techniques"},"cohort_total":711,"direct_labels_cover":0,"predictions_cover":711,"exported":711,"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/fea12930f71b","api":"https://metacan.xera.ac/api/v1/cohort?topic=Wireless+Communication+Security+Techniques"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02382126162757196,"score_gpt":0.25038063171377767,"score_spread":0.22655937008620572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1194438082","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.0036694387,0.00051295484,0.98857075,0.0003288175,0.00008061156,0.000014058911,0.00007718675,0.000096071555,0.0066501815],"genre_scores_gemma":[0.5312618,0.0046835663,0.44282603,0.0012205684,0.0013646708,0.00034607446,0.00073812815,0.00037734894,0.01718184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771273,0.0006380663,0.00012092579,0.00036556288,0.00093824835,0.00022434193],"domain_scores_gemma":[0.9826015,0.014953289,0.0005948581,0.0006655506,0.0010151493,0.00016965964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032509614,0.0008845916,0.0011555199,0.001417124,0.0010667137,0.001615226,0.0011477892,0.0012467407,0.0036222052],"category_scores_gemma":[0.011845952,0.00045735427,0.0009173336,0.0014880961,0.0026831427,0.0035366572,0.0027639251,0.0037570053,0.0012915739],"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.00012650006,0.00003877451,0.0002734907,0.00017001096,0.00004186287,0.00033625352,0.00022117219,0.057903368,0.0044924472,0.8951195,0.003041904,0.03823474],"study_design_scores_gemma":[0.000033826655,0.000058565172,0.00020117969,0.000067661735,0.000025119456,0.00047194233,0.000052464948,0.2938889,0.0045727785,0.69419324,0.0063894335,0.000044939374],"about_ca_topic_score_codex":0.0008494719,"about_ca_topic_score_gemma":0.00044520336,"teacher_disagreement_score":0.0036222052,"about_ca_system_score_codex":0.0009567706,"about_ca_system_score_gemma":0.0013621905,"threshold_uncertainty_score":0.0171929},"labels":[],"label_agreement":null},{"id":"W120140206","doi":"10.1007/978-1-4939-0413-6_4","title":"Cooperative Networking for Secure Communications","year":2013,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"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 Waterloo","funders":"","keywords":"Eavesdropping; Secrecy; Cognitive radio; Computer science; Computer network; Computer security; Transmission (telecommunications); Secure transmission; Secure communication; Information transmission; Telecommunications; Wireless; Encryption","score_opus":0.03146100857912078,"score_gpt":0.26267618100296836,"score_spread":0.2312151724238476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W120140206","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031213695,0.08510894,0.32591853,0.0022109838,0.0054024006,0.000094291274,0.000082366714,0.0008378005,0.57722336],"genre_scores_gemma":[0.06108161,0.06658372,0.06771778,0.0010636752,0.0034015195,0.00023184605,0.0002200272,0.00037298579,0.79932684],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969566,0.000060559698,0.000009094985,0.000048357833,0.00016206493,0.000024341438],"domain_scores_gemma":[0.99983716,0.00006574122,0.000010815739,0.000042547526,0.00003475815,0.000008815628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028265212,0.0012244455,0.00052291667,0.0008233854,0.00046756773,0.0014566774,0.0009160357,0.0013418525,0.021984298],"category_scores_gemma":[0.00048013928,0.0003282821,0.0002700437,0.0010630586,0.0009315689,0.0028466133,0.0013586197,0.0018753713,0.0103093805],"study_design_candidate":"not_applicable","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.000023668827,0.000050942108,0.000052708165,0.0004374566,0.000015401423,0.00010374286,0.00022033387,0.0038407384,0.008320564,0.41864818,0.08208188,0.48620436],"study_design_scores_gemma":[0.0000066172215,0.00006593357,0.000121805184,0.0002799472,0.000013884486,0.00051334867,0.000073261865,0.012463695,0.0035532538,0.17157109,0.81131333,0.000023916455],"about_ca_topic_score_codex":0.00020252357,"about_ca_topic_score_gemma":0.0003936476,"teacher_disagreement_score":0.021984298,"about_ca_system_score_codex":0.0005355516,"about_ca_system_score_gemma":0.00032811068,"threshold_uncertainty_score":0.07354486},"labels":[],"label_agreement":null},{"id":"W1235372244","doi":"10.1007/978-3-319-04268-8_14","title":"Detection of Algebraic Manipulation in the Presence of Leakage","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":18,"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 Calgary","funders":"","keywords":"Randomness; Computer science; Upper and lower bounds; Algorithm; Adversary; Theoretical computer science; Information leakage; Entropy (arrow of time); Algebraic number; Mathematics; Computer security","score_opus":0.0168992483949532,"score_gpt":0.23570340119628003,"score_spread":0.2188041528013268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1235372244","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.21898814,0.0015637177,0.7559635,0.0016636429,0.00027951115,0.00017104286,0.00049923,0.0023228652,0.018548254],"genre_scores_gemma":[0.92809296,0.00044111864,0.06781428,0.00021288691,0.00017171961,0.00006305703,0.00028246135,0.000094529096,0.002826965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99441046,0.0011884349,0.00032525422,0.0010796327,0.002348073,0.00064807036],"domain_scores_gemma":[0.98191607,0.009735074,0.0026250193,0.0039031014,0.0014426527,0.00037807308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018127917,0.00077067834,0.0014881415,0.0011746264,0.0008124758,0.002956459,0.0013178518,0.0020697776,0.002308246],"category_scores_gemma":[0.020309275,0.00062191125,0.0006134441,0.0011212864,0.0023791885,0.005574422,0.0052130884,0.002215895,0.0010744511],"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.0028278772,0.00043122258,0.019299846,0.0012189883,0.00037343055,0.0026617802,0.0014779342,0.03601913,0.17479298,0.36919075,0.009493869,0.3822121],"study_design_scores_gemma":[0.00012174695,0.00089259516,0.0038745306,0.00024399773,0.0001407696,0.006069841,0.0004379616,0.4237503,0.21657285,0.33715618,0.010554725,0.00018447886],"about_ca_topic_score_codex":0.0001105574,"about_ca_topic_score_gemma":0.0001271355,"teacher_disagreement_score":0.002956459,"about_ca_system_score_codex":0.0004765291,"about_ca_system_score_gemma":0.0007347745,"threshold_uncertainty_score":0.0095870495},"labels":[],"label_agreement":null},{"id":"W133506345","doi":"10.1007/978-3-642-27901-0_11","title":"Secret Key Establishment over Noisy Channels","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"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 Calgary","funders":"","keywords":"Randomness; Key (lock); Computer science; Channel (broadcasting); Computer security; Key generation; Pre-shared key; Theoretical computer science; Computer network; Cryptography; Public-key cryptography; Key distribution; Mathematics; Statistics; Encryption","score_opus":0.015507405460218494,"score_gpt":0.23847914000878737,"score_spread":0.22297173454856886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133506345","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.024196126,0.0052696993,0.93267596,0.0005722569,0.0003416066,0.00011670149,0.00017728335,0.00076087326,0.035889473],"genre_scores_gemma":[0.70801926,0.012873044,0.17695776,0.0003366375,0.0005826548,0.00032107672,0.00052872224,0.00039764083,0.09998319],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991186,0.00013045582,0.000056883007,0.000118205964,0.00046490028,0.00011094822],"domain_scores_gemma":[0.9989041,0.00056817126,0.00012249616,0.0002686754,0.00010822399,0.000028312992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006396534,0.0006575026,0.0008479357,0.00060142076,0.0006106997,0.0012836783,0.0007101521,0.0008167708,0.0039899885],"category_scores_gemma":[0.0018120611,0.00052655337,0.00031566614,0.0011401452,0.001153664,0.0035977024,0.0025683932,0.001798227,0.0018960582],"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.00049299723,0.00012776245,0.00032960475,0.0017231788,0.00009261568,0.0008360377,0.00075454975,0.046734504,0.11872204,0.38100195,0.010685508,0.4384993],"study_design_scores_gemma":[0.00013624033,0.0004633278,0.00083276886,0.00051054306,0.00017842565,0.0031393573,0.00027444455,0.24177073,0.23559189,0.3985736,0.118344605,0.00018411179],"about_ca_topic_score_codex":0.00010409644,"about_ca_topic_score_gemma":0.00014289274,"teacher_disagreement_score":0.0039899885,"about_ca_system_score_codex":0.00046365446,"about_ca_system_score_gemma":0.0004566579,"threshold_uncertainty_score":0.013347864},"labels":[],"label_agreement":null},{"id":"W1484103301","doi":"10.1007/978-3-642-20728-0_8","title":"Common Randomness and Secret Key Capacities of Two-Way Channels","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"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 Calgary","funders":"","keywords":"Randomness; Upper and lower bounds; Computer science; Channel (broadcasting); Key (lock); Channel capacity; Binary number; Theoretical computer science; Coding (social sciences); Information theory; Cryptography; Key generation; Binary erasure channel; Binary symmetric channel; Channel code; Adversary; Information-theoretic security; Algorithm; Discrete mathematics; Mathematics; Computer network; Decoding methods; Computer security; Arithmetic; Statistics","score_opus":0.02068454533193444,"score_gpt":0.23451758106103648,"score_spread":0.21383303572910203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484103301","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.18208374,0.006896448,0.625646,0.0044104694,0.00032020098,0.00021129246,0.0013541436,0.00041343973,0.17866428],"genre_scores_gemma":[0.95484364,0.003275428,0.02491793,0.00025858288,0.00039815015,0.0004831275,0.00042801522,0.00020351468,0.015191565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956713,0.0014781995,0.00018492872,0.0004869376,0.0014537965,0.000724949],"domain_scores_gemma":[0.9715954,0.023575297,0.00092970044,0.002309203,0.001087954,0.0005025007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00342639,0.0013396459,0.0014140111,0.0023802526,0.0013177269,0.005186196,0.0023510351,0.0024203612,0.008661152],"category_scores_gemma":[0.019385345,0.0010881439,0.0011640681,0.0031582278,0.0064475774,0.009445891,0.0035211458,0.0052703335,0.0010030488],"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.00006453319,0.000011922536,0.000054190816,0.000059630478,0.000010995818,0.000036135236,0.00012518834,0.0117083145,0.0005826123,0.98291093,0.0009350996,0.0035005142],"study_design_scores_gemma":[0.000017482702,0.000009545849,0.00006186487,0.000028005137,0.0000071147065,0.000056480723,0.000027199274,0.021782905,0.00052770006,0.976447,0.0010165187,0.000018252302],"about_ca_topic_score_codex":0.0008878109,"about_ca_topic_score_gemma":0.00043455654,"teacher_disagreement_score":0.008661152,"about_ca_system_score_codex":0.0030315467,"about_ca_system_score_gemma":0.0017566995,"threshold_uncertainty_score":0.028974414},"labels":[],"label_agreement":null},{"id":"W1489319061","doi":"10.1007/3-540-39200-9_35","title":"New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":111,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Computer science; Secrecy; Upper and lower bounds; Shared secret; Key (lock); Theoretical computer science; Context (archaeology); Fraction (chemistry); Information theory; Mutual information; Adversary; Pre-shared key; Key distribution; Public-key cryptography; Algorithm; Cryptography; Mathematics; Computer security; Encryption; Statistics; Artificial intelligence","score_opus":0.023777761368714196,"score_gpt":0.25714382903355515,"score_spread":0.23336606766484094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489319061","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.0064123026,0.010912517,0.9113547,0.0071632126,0.001399821,0.000069912974,0.00023621046,0.00039201413,0.06205931],"genre_scores_gemma":[0.6494655,0.023091594,0.27828777,0.0033975285,0.0074474504,0.0008907868,0.0006032834,0.0015622842,0.0352538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98991406,0.0036960759,0.00047364552,0.0015643463,0.0033455745,0.0010061804],"domain_scores_gemma":[0.9318614,0.05546353,0.0017473256,0.0072221304,0.0027032413,0.0010023956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010851703,0.0024633668,0.0038110546,0.0024031573,0.003667965,0.011755636,0.005404988,0.004763193,0.010724579],"category_scores_gemma":[0.051496275,0.0018154891,0.0017534179,0.0048050005,0.015093582,0.039800126,0.0107911425,0.020238025,0.0035575952],"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.00007979968,0.00002167436,0.00004755441,0.000095634765,0.000011561554,0.000023692719,0.00012019185,0.006932555,0.00032671783,0.97808444,0.0032172601,0.011038926],"study_design_scores_gemma":[0.000010619322,0.00001325203,0.000020287549,0.000046556037,0.0000084887515,0.000023803683,0.000022849115,0.022159195,0.00037403245,0.97380066,0.0035053273,0.000014956089],"about_ca_topic_score_codex":0.00095929246,"about_ca_topic_score_gemma":0.00063305243,"teacher_disagreement_score":0.011755636,"about_ca_system_score_codex":0.0048004515,"about_ca_system_score_gemma":0.002338156,"threshold_uncertainty_score":0.057389915},"labels":[],"label_agreement":null},{"id":"W1497831848","doi":"10.48550/arxiv.1207.2094","title":"The Capacity of More Capable Cognitive Interference Channels","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Interference (communication); Cognition; Computer science; Channel (broadcasting); Telecommunications; Psychology; Neuroscience","score_opus":0.09219998874790677,"score_gpt":0.20168928785755175,"score_spread":0.10948929910964497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497831848","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.29880086,0.0054261414,0.5804138,0.0022392538,0.00025484763,0.00011509509,0.0013175204,0.0005177574,0.11091466],"genre_scores_gemma":[0.98187906,0.0015219122,0.012516783,0.00037514535,0.0001970704,0.00010432309,0.0002170211,0.000050180275,0.0031385233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871886,0.0002754825,0.000042489,0.00019230731,0.000356063,0.00041473264],"domain_scores_gemma":[0.9936498,0.004104015,0.0006481634,0.00070916396,0.00062342064,0.00026542036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014873707,0.0009908698,0.0007927737,0.0012462182,0.0007135495,0.002753601,0.0015023764,0.00089963234,0.004667619],"category_scores_gemma":[0.006605335,0.00032532416,0.0006694219,0.0012945684,0.002364731,0.0022701414,0.0021057082,0.0018103144,0.0005400636],"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.00028853686,0.000067222856,0.0005968104,0.00034401513,0.000071659575,0.0004356789,0.00043400913,0.13950521,0.011415294,0.82456475,0.004127761,0.018149013],"study_design_scores_gemma":[0.00006113839,0.00009070454,0.0008454903,0.00016081403,0.00006163312,0.00075192715,0.00020248513,0.3863255,0.006990185,0.59454983,0.009866911,0.00009334243],"about_ca_topic_score_codex":0.0018585551,"about_ca_topic_score_gemma":0.0006852448,"teacher_disagreement_score":0.004667619,"about_ca_system_score_codex":0.0014823434,"about_ca_system_score_gemma":0.00088863145,"threshold_uncertainty_score":0.015614688},"labels":[],"label_agreement":null},{"id":"W1500163133","doi":"10.1007/978-3-642-20465-4_16","title":"Secret Keys from Channel Noise","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":20,"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 Calgary","funders":"","keywords":"Computer science; Alice and Bob; Initialization; Randomness; Channel (broadcasting); Key (lock); Upper and lower bounds; Protocol (science); Verifiable secret sharing; Binary number; Simple (philosophy); Binary symmetric channel; Adversary; Theoretical computer science; Computer network; Computer security; Alice (programming language); Channel capacity; Mathematics; Arithmetic; Set (abstract data type)","score_opus":0.02080767559792113,"score_gpt":0.22384836468297692,"score_spread":0.2030406890850558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500163133","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.01921934,0.0062472024,0.85279363,0.0020129832,0.0010918317,0.00011818859,0.00029617143,0.0010530378,0.11716766],"genre_scores_gemma":[0.6403404,0.013559496,0.11187206,0.0010657762,0.0013208046,0.0003148317,0.0006712923,0.00080804835,0.23004733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905235,0.00015906025,0.00004019219,0.00012898473,0.0005084359,0.000111085166],"domain_scores_gemma":[0.99874973,0.0006276649,0.00008608478,0.0003754532,0.00012544342,0.000035521763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060769153,0.0010064878,0.00084635644,0.0006645315,0.00065167865,0.0020606853,0.00069428363,0.0012497421,0.008145732],"category_scores_gemma":[0.002808605,0.00057918706,0.0004983216,0.0007983361,0.0021377117,0.004425173,0.0031148337,0.0028441765,0.004361264],"study_design_candidate":"not_applicable","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.00023645279,0.00003411806,0.00012737254,0.0005300604,0.00005243966,0.00039102676,0.0004478411,0.017839747,0.028924866,0.80543524,0.010797274,0.13518354],"study_design_scores_gemma":[0.00004702432,0.00012420643,0.00021033193,0.0002706149,0.00007267976,0.0018382439,0.00012930104,0.04496212,0.05644057,0.79245603,0.103364654,0.00008424506],"about_ca_topic_score_codex":0.00008194394,"about_ca_topic_score_gemma":0.00008605406,"teacher_disagreement_score":0.008145732,"about_ca_system_score_codex":0.00059750216,"about_ca_system_score_gemma":0.0005125793,"threshold_uncertainty_score":0.02725017},"labels":[],"label_agreement":null},{"id":"W1501140009","doi":"10.1109/tsp.2015.2457398","title":"Worst-Case Jamming on MIMO Gaussian Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Jamming; MIMO; Transceiver; Channel (broadcasting); Closed-form expression; Computer science; Gaussian; Interference (communication); Mathematical optimization; Algorithm; Mathematics; Telecommunications; Wireless","score_opus":0.0442335340115109,"score_gpt":0.27367462954889576,"score_spread":0.22944109553738487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501140009","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.20048265,0.0015283248,0.78638315,0.00036259132,0.00007097038,0.000045993496,0.0001463707,0.00024217936,0.010737747],"genre_scores_gemma":[0.9896443,0.00068698224,0.008365334,0.000058344638,0.000059689406,0.000021028321,0.00004216924,0.000024089575,0.0010981541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746025,0.00098504,0.00006686241,0.00025227448,0.00056792464,0.0006676916],"domain_scores_gemma":[0.98762137,0.009709447,0.0011689427,0.0004267331,0.00086499995,0.00020844112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023667351,0.0013987236,0.0011470503,0.0007202661,0.0008677966,0.001551689,0.00070839433,0.0012405224,0.00084300374],"category_scores_gemma":[0.00965183,0.0004914555,0.0004355446,0.0011536248,0.0017636956,0.0016147732,0.0011982077,0.0008530258,0.00023790868],"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.0001000816,0.0000142085655,0.00080085587,0.00007307177,0.00003225847,0.00030143588,0.0000717517,0.982203,0.0024668674,0.008821853,0.000276414,0.0048381444],"study_design_scores_gemma":[0.0000068474296,0.00006813007,0.00068066275,0.000013539511,0.000024618079,0.00022911138,0.00008072981,0.9895698,0.0015239798,0.007517021,0.00026199076,0.000023550605],"about_ca_topic_score_codex":0.0024385382,"about_ca_topic_score_gemma":0.0025044575,"teacher_disagreement_score":0.0024385382,"about_ca_system_score_codex":0.0011888638,"about_ca_system_score_gemma":0.0007017349,"threshold_uncertainty_score":0.012516677},"labels":[],"label_agreement":null},{"id":"W1505562276","doi":"10.1109/jsac.2015.2432513","title":"Physical-Layer Security for MISO Visible Light Communication Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":259,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; McMaster University","keywords":"Computer science; Transmitter; Visible light communication; Beamforming; Physical layer; Channel (broadcasting); Secure transmission; Secrecy; Computer network; Transmission (telecommunications); Telecommunications; Topology (electrical circuits); Wireless; Computer security; Electrical engineering; Physics; Light-emitting diode; Optics; Engineering","score_opus":0.05083687756006165,"score_gpt":0.32233816584297315,"score_spread":0.2715012882829115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505562276","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.05047627,0.0012802036,0.93996197,0.0005830378,0.00006361531,0.000040272404,0.000104705825,0.00011009963,0.0073799416],"genre_scores_gemma":[0.9626767,0.001597702,0.03389015,0.00012218619,0.00008371515,0.00005261296,0.000045262783,0.0000231209,0.0015084723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99807715,0.0006851967,0.00007820097,0.00021007047,0.00061955134,0.00032981695],"domain_scores_gemma":[0.99603736,0.002450513,0.0006047107,0.00047892198,0.0003561389,0.00007239272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018923366,0.001130814,0.0007425326,0.0005797197,0.0007042509,0.0019780349,0.0005996733,0.00087900006,0.0013789613],"category_scores_gemma":[0.005098904,0.0003474475,0.00047314318,0.00068251166,0.0019387557,0.0027681566,0.001968273,0.0010842821,0.00037865376],"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.00027682178,0.0000666305,0.0014932575,0.00034537478,0.000075466036,0.00043236167,0.00028085787,0.635022,0.03346738,0.29269245,0.0014971211,0.03435026],"study_design_scores_gemma":[0.000009419979,0.000077991615,0.00023510722,0.00003865109,0.000017550266,0.00015130074,0.0000642281,0.94722795,0.008292409,0.042582843,0.00127656,0.000026031108],"about_ca_topic_score_codex":0.0008197305,"about_ca_topic_score_gemma":0.00075679226,"teacher_disagreement_score":0.0019780349,"about_ca_system_score_codex":0.0012365408,"about_ca_system_score_gemma":0.0010282035,"threshold_uncertainty_score":0.010007799},"labels":[],"label_agreement":null},{"id":"W1506824078","doi":"10.1109/tit.2015.2450721","title":"Output Constrained Lossy Source Coding With Limited Common Randomness","year":2015,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Randomness; Encoder; Computer science; Channel (broadcasting); Algorithm; Mathematical optimization; Mathematics; Telecommunications; Statistics","score_opus":0.017203309730539042,"score_gpt":0.2336437275389816,"score_spread":0.21644041780844256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506824078","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.03448241,0.00038618298,0.96093917,0.0003958602,0.000020029032,0.00003516368,0.00016361312,0.00011943544,0.0034581337],"genre_scores_gemma":[0.89784724,0.0006304472,0.09680197,0.00018541582,0.00007427657,0.00016410097,0.0002656757,0.000082553255,0.003948446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832207,0.0006272122,0.00007532582,0.00024459156,0.0005951172,0.0001356078],"domain_scores_gemma":[0.9961331,0.0028731874,0.00036036677,0.00036601655,0.00020176895,0.00006556541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018300017,0.0008743673,0.0011559178,0.00046803177,0.0002508505,0.0012507096,0.001438301,0.0008836068,0.001044801],"category_scores_gemma":[0.0071912273,0.00034618084,0.00045385948,0.00093124463,0.0015541051,0.00227329,0.0020450612,0.0016081799,0.00027606206],"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.00019675006,0.000038278242,0.00024655124,0.00016058778,0.00003807109,0.0002620835,0.00014164999,0.68936676,0.007054511,0.28214276,0.00075161044,0.019600304],"study_design_scores_gemma":[0.000040511204,0.000052833395,0.00012933774,0.000027127759,0.0000132091545,0.00008353651,0.000017058253,0.8658685,0.004368825,0.12859593,0.00078450196,0.000018613084],"about_ca_topic_score_codex":0.0008342893,"about_ca_topic_score_gemma":0.0004569148,"teacher_disagreement_score":0.0018300017,"about_ca_system_score_codex":0.0011682871,"about_ca_system_score_gemma":0.0007740134,"threshold_uncertainty_score":0.009678066},"labels":[],"label_agreement":null},{"id":"W1511874843","doi":"10.1109/cwit.2015.7255140","title":"Non-binary distributed arithmetic coding","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":9,"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 Ottawa","funders":"","keywords":"Binary number; Computer science; Arithmetic coding; Coding (social sciences); Context-adaptive binary arithmetic coding; Binary code; Encoding (memory); Distributed source coding; Arithmetic; Variable-length code; Theoretical computer science; Algorithm; Decoding methods; Mathematics; Artificial intelligence; Data compression; Statistics","score_opus":0.028349570104148264,"score_gpt":0.25585205540527617,"score_spread":0.2275024853011279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511874843","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.04363436,0.0010615359,0.93476844,0.00047530202,0.00023277086,0.00012969929,0.00015592766,0.00042195333,0.01912014],"genre_scores_gemma":[0.7301264,0.0009078031,0.25929135,0.00019563841,0.000075281525,0.00016786266,0.00025077778,0.000038104463,0.008946769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951375,0.000103561244,0.000023966211,0.000047501275,0.00026540743,0.000045941477],"domain_scores_gemma":[0.9990056,0.00042903694,0.00009670538,0.00016176736,0.00027720234,0.000029633855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005017761,0.0003325174,0.00041320067,0.00048071676,0.00037779022,0.00074598315,0.0007972597,0.0005406157,0.0027043573],"category_scores_gemma":[0.002097031,0.00011217194,0.00024380865,0.0005919856,0.0005792301,0.0008475311,0.0005983719,0.0006540636,0.0004647727],"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.00039760885,0.00011345292,0.00057272165,0.00034964425,0.000036264842,0.00024214278,0.00011037051,0.2438978,0.044233546,0.5279686,0.003310945,0.17876688],"study_design_scores_gemma":[0.000081600454,0.00013767037,0.0002543198,0.000033840788,0.000016968137,0.00022305611,0.00001749408,0.89516544,0.019471709,0.076317385,0.00825166,0.000028816745],"about_ca_topic_score_codex":0.0008898294,"about_ca_topic_score_gemma":0.001047215,"teacher_disagreement_score":0.0027043573,"about_ca_system_score_codex":0.0005914397,"about_ca_system_score_gemma":0.00093121134,"threshold_uncertainty_score":0.009046972},"labels":[],"label_agreement":null},{"id":"W1513972321","doi":"10.1109/pimrc.2014.7136146","title":"Full-duplex relay with jamming protocol for improving physical-layer security","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University","funders":"","keywords":"Jamming; Relay; Secrecy; Computer science; Physical layer; Computer network; Interference (communication); Protocol (science); Power (physics); Telecommunications; Wireless; Computer security; Physics","score_opus":0.024545804776615554,"score_gpt":0.3027752970567611,"score_spread":0.27822949228014554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513972321","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.029403282,0.0006125295,0.9667976,0.00008629853,0.00002830998,0.000038242844,0.000018335213,0.00016019939,0.0028552762],"genre_scores_gemma":[0.79717135,0.0010644672,0.19889316,0.00009787659,0.000046344787,0.00009558166,0.00004434324,0.000030094898,0.0025567065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995709,0.00016988956,0.000020656364,0.00006357986,0.00013760808,0.00003741426],"domain_scores_gemma":[0.999474,0.00026749092,0.00006274543,0.00009657365,0.00008327344,0.000015875472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006267656,0.00043579275,0.0003973237,0.00035746137,0.0002525065,0.00047562507,0.0007929077,0.00040653744,0.0008089399],"category_scores_gemma":[0.0012135134,0.00016773782,0.00032067348,0.0003733227,0.0005292509,0.0010402724,0.0006573785,0.0005595296,0.00020096278],"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.0004413663,0.00017576333,0.0010680755,0.0006307309,0.00017852124,0.00060608255,0.00054658396,0.31781682,0.25316733,0.19889957,0.0028692342,0.22359991],"study_design_scores_gemma":[0.000036548543,0.00030047056,0.00028115694,0.000019415596,0.000055338114,0.0006588667,0.00004020968,0.94534653,0.037070848,0.01083535,0.0053260215,0.000029243349],"about_ca_topic_score_codex":0.00029786615,"about_ca_topic_score_gemma":0.00034374426,"teacher_disagreement_score":0.0008089399,"about_ca_system_score_codex":0.000258523,"about_ca_system_score_gemma":0.0003882026,"threshold_uncertainty_score":0.0033147335},"labels":[],"label_agreement":null},{"id":"W1514757060","doi":"10.1109/cwit.2015.7255183","title":"Gaussian multiple-access relay channels with non-causal side information at the transmitters","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Toronto Metropolitan University","funders":"","keywords":"Relay; Gaussian; Relay channel; Channel (broadcasting); Computer science; Encoder; Topology (electrical circuits); Interference (communication); Channel state information; Computer network; Algorithm; Telecommunications; Power (physics); Mathematics; Wireless; Physics; Combinatorics","score_opus":0.02272727564958008,"score_gpt":0.24488266774859918,"score_spread":0.2221553920990191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514757060","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.06652204,0.0012990497,0.9224334,0.00036433464,0.000062347244,0.000049012815,0.00018932768,0.00030487668,0.008775618],"genre_scores_gemma":[0.96018136,0.0009957508,0.03587343,0.00009474348,0.000053630527,0.00005193282,0.000071666,0.000022257607,0.0026551948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981956,0.0006427466,0.000055389704,0.00026844567,0.0005274358,0.00031054352],"domain_scores_gemma":[0.9920495,0.005238428,0.0010537459,0.0007675126,0.0007773414,0.00011355671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022277567,0.0010832079,0.0011692935,0.00053264824,0.0004425373,0.0013731982,0.001356128,0.0010636871,0.0014428193],"category_scores_gemma":[0.008288078,0.00037838367,0.0006321953,0.0010707511,0.0022234947,0.0022159077,0.00097184,0.0013690451,0.0002783365],"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.00019115755,0.00006357918,0.0008665825,0.00014895375,0.000047564732,0.00045664972,0.00014286459,0.7508862,0.0052551012,0.23218195,0.0006822709,0.009077092],"study_design_scores_gemma":[0.000014225879,0.00005449505,0.00023341055,0.000010937035,0.000024111292,0.00015404104,0.000027909608,0.97313935,0.0023153198,0.023522962,0.00048062694,0.00002256719],"about_ca_topic_score_codex":0.0031929608,"about_ca_topic_score_gemma":0.002351419,"teacher_disagreement_score":0.0031929608,"about_ca_system_score_codex":0.0015308282,"about_ca_system_score_gemma":0.0010368243,"threshold_uncertainty_score":0.011781633},"labels":[],"label_agreement":null},{"id":"W1519751311","doi":"10.48550/arxiv.1412.5227","title":"BER-Based Physical Layer Security with Finite Codelength: Combining Strong Converse and Error Amplification","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Fading; Converse; Computer science; Physical layer; Bit error rate; Erasure; Transmission (telecommunications); Algorithm; Binary number; Computer network; Topology (electrical circuits); Decoding methods; Telecommunications; Mathematics; Arithmetic; Wireless; Combinatorics","score_opus":0.06614664088249678,"score_gpt":0.20569347306076344,"score_spread":0.13954683217826666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519751311","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.018002022,0.00054748694,0.97150046,0.00043438774,0.000084021995,0.000043474494,0.000043298936,0.0002029842,0.0091418885],"genre_scores_gemma":[0.8108796,0.0012673151,0.1793716,0.0003812613,0.0002233523,0.00017784895,0.00007994187,0.000108975975,0.0075100446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997707,0.0007778089,0.000103613,0.00029727395,0.00087156286,0.00024270198],"domain_scores_gemma":[0.9952429,0.0026400294,0.0005563716,0.000833836,0.0005791776,0.00014765316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021912355,0.0017498845,0.0009796536,0.001123414,0.00080987235,0.0019800314,0.0015223896,0.0014137983,0.002037249],"category_scores_gemma":[0.007018907,0.0006468111,0.00075678935,0.00089767465,0.0033980703,0.0038660695,0.0042536356,0.0026892757,0.0007649164],"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.0002714125,0.00013199034,0.00066394487,0.00029771158,0.0000941213,0.0005414159,0.00043253784,0.29103917,0.054154757,0.5944695,0.001775038,0.056128457],"study_design_scores_gemma":[0.00002195033,0.00018147768,0.00014174597,0.000064302716,0.000033437616,0.0005157,0.000051514235,0.85852534,0.017447613,0.12055526,0.0023863562,0.00007533466],"about_ca_topic_score_codex":0.00040670313,"about_ca_topic_score_gemma":0.0005323381,"teacher_disagreement_score":0.0021912355,"about_ca_system_score_codex":0.0011989098,"about_ca_system_score_gemma":0.0011196273,"threshold_uncertainty_score":0.011588454},"labels":[],"label_agreement":null},{"id":"W1525181000","doi":"10.1007/978-3-642-37119-6_6","title":"Message Transmission and Key Establishment: Conditions for Equality of Weak and Strong Capacities","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"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 Calgary","funders":"","keywords":"Secrecy; Randomness; Communication source; Counterexample; Computer science; Key (lock); Transmission (telecommunications); Information-theoretic security; Information transmission; Key generation; Theoretical computer science; Adversary; Mutual information; Information leakage; Discrete mathematics; Computer security; Computer network; Topology (electrical circuits); Cryptography; Mathematics; Telecommunications; Combinatorics; Statistics","score_opus":0.021311259768493195,"score_gpt":0.2568934007367805,"score_spread":0.23558214096828733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525181000","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.056058705,0.0015969388,0.84586096,0.0040349723,0.00067409646,0.0003076692,0.0008494566,0.0004544429,0.09016275],"genre_scores_gemma":[0.887995,0.0023080052,0.085735284,0.0009888355,0.0014552395,0.0009177477,0.0005774202,0.00048255618,0.019539997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9869963,0.0035355906,0.0010486388,0.002513538,0.0029092696,0.002996586],"domain_scores_gemma":[0.8709482,0.101144806,0.005377379,0.008256594,0.010530485,0.0037424995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012646187,0.0015429623,0.0023519068,0.002788417,0.0031574606,0.008509384,0.0038610229,0.003387553,0.0148332855],"category_scores_gemma":[0.09268401,0.0015572284,0.0014828036,0.0027797364,0.011075498,0.023209024,0.0104711605,0.009069412,0.002746491],"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.00039820123,0.000053550088,0.00018827515,0.00014944228,0.000020322841,0.00011306193,0.00033044687,0.003308925,0.0019973107,0.9833997,0.001804338,0.008236467],"study_design_scores_gemma":[0.00008738538,0.00010498784,0.00028931702,0.000100185156,0.000045127756,0.00031989676,0.00018873694,0.030559504,0.0047119395,0.9600109,0.0035154098,0.000066616056],"about_ca_topic_score_codex":0.000964293,"about_ca_topic_score_gemma":0.0005262496,"teacher_disagreement_score":0.0148332855,"about_ca_system_score_codex":0.00257484,"about_ca_system_score_gemma":0.003388799,"threshold_uncertainty_score":0.066880226},"labels":[],"label_agreement":null},{"id":"W1526667938","doi":"10.1109/icc.2015.7249503","title":"Secrecy capacity enhancement in two-hop DF relaying systems in the presence of eavesdropper","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Secrecy; Relay; Computer science; Transmitter; Computer network; Hop (telecommunications); Channel capacity; Jamming; Channel (broadcasting); Computer security; Power (physics)","score_opus":0.05351239601617697,"score_gpt":0.28929388067464573,"score_spread":0.23578148465846877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526667938","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.19037263,0.0016544212,0.7965997,0.00042960022,0.000109300265,0.00003784275,0.000060745595,0.0002592614,0.010476537],"genre_scores_gemma":[0.9824158,0.00046483963,0.016262736,0.000035735564,0.00003365489,0.000013080461,0.000016563883,0.000008438159,0.000749205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992136,0.00027391047,0.000040613224,0.000094174604,0.00023483903,0.00014283371],"domain_scores_gemma":[0.99804235,0.001105699,0.00018432009,0.00029715642,0.00031978704,0.00005072758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009816987,0.000751126,0.00063393696,0.0005073853,0.0005008116,0.0007379108,0.00053656293,0.0006851886,0.0006543654],"category_scores_gemma":[0.0025012195,0.00021778808,0.00035541557,0.0005341679,0.0009935735,0.0012171459,0.0010645412,0.00061513553,0.00023705188],"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.0005714976,0.0001371708,0.0025199433,0.000532147,0.00017866098,0.0016158032,0.00082804385,0.54128885,0.22115642,0.13120699,0.0012554862,0.098708965],"study_design_scores_gemma":[0.000025923917,0.00028066567,0.0006719467,0.000031804968,0.000066158274,0.00067342515,0.00009406081,0.92644334,0.054269705,0.015292116,0.0020867845,0.00006407249],"about_ca_topic_score_codex":0.0005795971,"about_ca_topic_score_gemma":0.0005351112,"teacher_disagreement_score":0.0009816987,"about_ca_system_score_codex":0.00046161178,"about_ca_system_score_gemma":0.00055322377,"threshold_uncertainty_score":0.005191803},"labels":[],"label_agreement":null},{"id":"W1534275621","doi":"10.48550/arxiv.1301.0297","title":"Wyner-Ziv Coding in the Real Field Based on BCH-DFT Codes","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"McGill University","funders":"","keywords":"BCH code; Computer science; Coding (social sciences); Mathematics; Algorithm; Decoding methods; Statistics","score_opus":0.06437185637205559,"score_gpt":0.19659438582947425,"score_spread":0.13222252945741866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534275621","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.0242083,0.0009427545,0.96033865,0.00036108124,0.000087590706,0.000060495397,0.0001469614,0.0001475345,0.013706583],"genre_scores_gemma":[0.602652,0.0018930254,0.38388216,0.00025170075,0.0001394062,0.00023156447,0.0002966337,0.000061775114,0.010591759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999432,0.00018069624,0.00003154506,0.00006126728,0.00024126895,0.000053148164],"domain_scores_gemma":[0.9993376,0.0003407352,0.00007992481,0.0001211582,0.00010342052,0.000017151126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056347874,0.0005067291,0.00045670278,0.00068007846,0.00032077194,0.00075155374,0.00062132976,0.0006279459,0.0019988576],"category_scores_gemma":[0.0020602334,0.0001618906,0.00028833526,0.0008070913,0.0010760676,0.00111261,0.00078721053,0.0008917617,0.0006015334],"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.00007163743,0.00002382338,0.0001824526,0.00010780318,0.000011840805,0.00019417421,0.00013319307,0.10468075,0.010663411,0.8303197,0.0014145928,0.052196555],"study_design_scores_gemma":[0.00003588691,0.000095434945,0.00022095237,0.00008887289,0.000012204679,0.00039177126,0.00003319427,0.6745882,0.013698431,0.30145922,0.009328992,0.00004679754],"about_ca_topic_score_codex":0.0012750772,"about_ca_topic_score_gemma":0.0011422933,"teacher_disagreement_score":0.0019988576,"about_ca_system_score_codex":0.0008065458,"about_ca_system_score_gemma":0.0007621602,"threshold_uncertainty_score":0.0066868663},"labels":[],"label_agreement":null},{"id":"W1538574033","doi":"10.1109/cwit.2015.7255148","title":"Enhancing secrecy of the Gaussian wiretap channel using rate compatible LDPC codes with error amplification","year":2015,"lang":"en","type":"article","venue":"","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":"Université Laval","funders":"","keywords":"Decoding methods; Low-density parity-check code; Computer science; Secrecy; Channel (broadcasting); Computer network; Network packet; Bit error rate; Algorithm; Computer security","score_opus":0.05875133522326673,"score_gpt":0.27419604875690895,"score_spread":0.21544471353364222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538574033","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.06643188,0.00038496876,0.92880446,0.0001658608,0.000031507087,0.000037657617,0.000034729994,0.0002600567,0.0038488046],"genre_scores_gemma":[0.90596676,0.0007268439,0.09089799,0.00006218208,0.000043527034,0.00004139858,0.000045835288,0.000030345385,0.0021851554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918145,0.00027154374,0.000031363907,0.00006943465,0.00034983514,0.00009637621],"domain_scores_gemma":[0.99806875,0.0010008346,0.00029044825,0.00026104585,0.0003309052,0.000048079957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078408926,0.00070818,0.00041668332,0.0005924143,0.00040278904,0.0005977192,0.00059758424,0.0004909961,0.0006544059],"category_scores_gemma":[0.0027577903,0.00023387256,0.00032902847,0.0006370543,0.0011443534,0.0012216519,0.0011534353,0.0007744078,0.00023533408],"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.0005068771,0.00011169112,0.0014178938,0.0003099674,0.00008170624,0.0009952169,0.0005352369,0.54376376,0.16878437,0.18241176,0.0010983171,0.09998325],"study_design_scores_gemma":[0.000022279382,0.00013430371,0.00015754162,0.000022367434,0.000027716087,0.00026750803,0.000025089501,0.9492423,0.039574094,0.008993572,0.0014992587,0.000033842975],"about_ca_topic_score_codex":0.001082507,"about_ca_topic_score_gemma":0.0008946301,"teacher_disagreement_score":0.001082507,"about_ca_system_score_codex":0.00048735397,"about_ca_system_score_gemma":0.00071809645,"threshold_uncertainty_score":0.004146695},"labels":[],"label_agreement":null},{"id":"W1539832159","doi":"10.1109/icc.1999.767980","title":"Joint source-channel decoding of entropy coded Markov sources over binary symmetric channels","year":2003,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Decoding methods; Soft-decision decoder; Binary number; Computer science; Algorithm; Markov process; Entropy (arrow of time); Channel (broadcasting); Binary symmetric channel; Markov chain; Joint (building); Maximum a posteriori estimation; Synchronization (alternating current); Mathematics; Channel code; Maximum likelihood; Telecommunications; Statistics; Arithmetic; Engineering","score_opus":0.01957378478137776,"score_gpt":0.2320205774156867,"score_spread":0.21244679263430896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539832159","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.020985397,0.00016758058,0.9777315,0.00007670204,0.000014888496,0.00001544846,0.000049580965,0.00015022988,0.00080868497],"genre_scores_gemma":[0.6848462,0.0003906434,0.31137574,0.00006303312,0.00006534118,0.0000706033,0.0002342332,0.000093724906,0.002860521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886477,0.00042567548,0.00006658671,0.00011853261,0.00042566165,0.000098832206],"domain_scores_gemma":[0.997881,0.0014733145,0.00020912799,0.0001772184,0.00021973412,0.00003954967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015379302,0.0005939079,0.0008073893,0.00042698192,0.00028856736,0.00058913324,0.00052159774,0.000724233,0.00091147795],"category_scores_gemma":[0.004395434,0.00037218202,0.00035930052,0.0003964011,0.00069249154,0.0014923477,0.0012201843,0.00066548947,0.00028833363],"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.00084487617,0.00006201989,0.0014410262,0.00025724826,0.00010614983,0.00022462878,0.0002654595,0.692253,0.036135327,0.118472844,0.000876818,0.1490607],"study_design_scores_gemma":[0.000025932235,0.00005866736,0.0001803974,0.000017684602,0.000015576541,0.00008022457,0.000011250498,0.9597113,0.019949144,0.019257793,0.00067544915,0.000016539387],"about_ca_topic_score_codex":0.00073896215,"about_ca_topic_score_gemma":0.0010933117,"teacher_disagreement_score":0.0015379302,"about_ca_system_score_codex":0.00046351532,"about_ca_system_score_gemma":0.0010889771,"threshold_uncertainty_score":0.008133471},"labels":[],"label_agreement":null},{"id":"W1550331781","doi":"10.1109/iccw.2015.7247224","title":"Tomlinson-Harashima precoding design in MIMO wiretap channels based on the MMSE criterion","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Precoding; Karush–Kuhn–Tucker conditions; MIMO; Computer science; Transmitter power output; Artificial noise; Transceiver; Control theory (sociology); Mean squared error; Channel (broadcasting); Minimum mean square error; Mathematical optimization; Mathematics; Telecommunications; Wireless; Transmitter; Artificial intelligence; Statistics","score_opus":0.08993168659770792,"score_gpt":0.2755848167198475,"score_spread":0.1856531301221396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550331781","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.017591115,0.00025162924,0.97994506,0.00009981487,0.000021180713,0.000022541419,0.000027452568,0.000062775296,0.0019784342],"genre_scores_gemma":[0.750234,0.0009122286,0.24348272,0.00013169399,0.00006425015,0.00012796959,0.00010796549,0.000034110755,0.0049050776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964046,0.00013863642,0.00001480565,0.000057533307,0.00011207575,0.00003659953],"domain_scores_gemma":[0.999426,0.00029713934,0.00008110007,0.000050314997,0.00012975324,0.000015654266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004927595,0.0006503431,0.00051235483,0.00022468848,0.00023093678,0.0005076484,0.00049951574,0.0004996505,0.0011263625],"category_scores_gemma":[0.0019970702,0.00026874483,0.00025924845,0.0004877174,0.0007525922,0.0007230259,0.0005455124,0.00056100264,0.00031034884],"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.00025553672,0.00004990098,0.0009271274,0.00031635625,0.000089953166,0.00023560686,0.00023307146,0.78707975,0.03361314,0.05967469,0.0017809363,0.115743846],"study_design_scores_gemma":[0.000015179628,0.00013292543,0.0001327786,0.000014594597,0.0000148103545,0.0000912011,0.00002627035,0.98650396,0.0062505957,0.0059840586,0.00082172867,0.000011943112],"about_ca_topic_score_codex":0.0012586178,"about_ca_topic_score_gemma":0.0015707571,"teacher_disagreement_score":0.0012586178,"about_ca_system_score_codex":0.00040427526,"about_ca_system_score_gemma":0.0007957212,"threshold_uncertainty_score":0.0037680268},"labels":[],"label_agreement":null},{"id":"W1560541233","doi":"10.1109/tit.2015.2449852","title":"New Nonasymptotic Channel Coding Theorems for Structured Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Low-density parity-check code; Mathematics; Equipartition theorem; Coding (social sciences); Discrete mathematics; Block code; Combinatorics; Decoding methods; Algorithm; Statistics; Physics","score_opus":0.018765215967356065,"score_gpt":0.24020544214712714,"score_spread":0.22144022617977108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560541233","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.011213014,0.0005541691,0.9747362,0.00047904122,0.00011802948,0.00006202557,0.00016481764,0.00015797163,0.0125147905],"genre_scores_gemma":[0.65061015,0.0031581693,0.33389133,0.0013854427,0.00072142034,0.00079163985,0.00068416435,0.00027723733,0.00848043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755317,0.00067625416,0.00011464684,0.00025628187,0.0011800461,0.00021967808],"domain_scores_gemma":[0.98326945,0.011882761,0.0011625728,0.0015170502,0.001843223,0.00032497916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048568756,0.0015418828,0.0007562826,0.0024167039,0.0008966659,0.002563609,0.0017781494,0.001420627,0.003779027],"category_scores_gemma":[0.021505969,0.00060851773,0.0011180755,0.0010263289,0.00388587,0.0046539125,0.0027050069,0.004110575,0.0010385925],"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.000035417834,0.00002522908,0.00018630481,0.00010240342,0.000018729968,0.00009343093,0.000112946465,0.039797872,0.0026675244,0.9439985,0.0015700443,0.01139166],"study_design_scores_gemma":[0.000021229103,0.000073146766,0.0001512751,0.0000692125,0.000014324466,0.00025968518,0.00003854718,0.3113366,0.005355535,0.6800211,0.0026076545,0.000051616666],"about_ca_topic_score_codex":0.00043505456,"about_ca_topic_score_gemma":0.00046989857,"teacher_disagreement_score":0.0048568756,"about_ca_system_score_codex":0.0021172643,"about_ca_system_score_gemma":0.0017826231,"threshold_uncertainty_score":0.025685906},"labels":[],"label_agreement":null},{"id":"W1560695905","doi":"10.1007/s00220-015-2561-z","title":"Almost One Bit Violation for the Additivity of the Minimum Output Entropy","year":2016,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Queen's University","funders":"German Academic Exchange Service London; Japan Society for the Promotion of Science; Agence Nationale de la Recherche; Ontario Ministry of Research, Innovation and Science; Queen's University; Centre National de la Recherche Scientifique; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum relative entropy; Additive function; Quantum; Entropy (arrow of time); Entropy rate; Eigenvalues and eigenvectors; Generalized relative entropy; Dimension (graph theory); Joint quantum entropy","score_opus":0.06100029080580582,"score_gpt":0.29302719172424385,"score_spread":0.23202690091843803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560695905","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.30040655,0.0019495068,0.471369,0.012775844,0.0017960673,0.00011419683,0.0010549196,0.0006677246,0.20986612],"genre_scores_gemma":[0.97006285,0.0005004608,0.01916059,0.0020011675,0.00073481153,0.00013006474,0.00022007102,0.00023092229,0.006959149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965668,0.0010710525,0.00022123841,0.00049696874,0.0012043603,0.00043960512],"domain_scores_gemma":[0.9896584,0.006752971,0.0006089492,0.0017143463,0.00070322695,0.00056206883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043447204,0.0009114945,0.0018418825,0.0016938129,0.0022064426,0.0039827465,0.0021755542,0.0032718657,0.009355041],"category_scores_gemma":[0.017223025,0.0008084656,0.0013627814,0.0008324046,0.007902759,0.007269843,0.005365993,0.006157026,0.0011866721],"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.00006126985,0.000015121881,0.00013942235,0.000060441398,0.000012869661,0.000095625015,0.000060610808,0.0011502481,0.0016130415,0.99409086,0.0008075243,0.0018930017],"study_design_scores_gemma":[0.000014726116,0.000014975261,0.00013638116,0.000021962429,0.0000058171836,0.00016883004,0.000015822941,0.010079842,0.00073127507,0.98838824,0.00040291806,0.00001922944],"about_ca_topic_score_codex":0.00026968168,"about_ca_topic_score_gemma":0.00021228839,"teacher_disagreement_score":0.009355041,"about_ca_system_score_codex":0.00097301754,"about_ca_system_score_gemma":0.000864397,"threshold_uncertainty_score":0.031295717},"labels":[],"label_agreement":null},{"id":"W1563366560","doi":"10.1109/cwit.2015.7255149","title":"On bounds for the cognitive multiple access Z-Interference Channel","year":2015,"lang":"en","type":"article","venue":"","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Interference (communication); Cognitive radio; Channel (broadcasting); Transmitter; Cognition; Coding (social sciences); Computer network; Encoding (memory); Telecommunications; Wireless; Mathematics; Artificial intelligence; Psychology; Statistics","score_opus":0.10991626742824925,"score_gpt":0.33288419123401697,"score_spread":0.22296792380576771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563366560","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.04197457,0.033518083,0.69080377,0.008647733,0.0009397819,0.0002895084,0.0013939195,0.0011618128,0.2212708],"genre_scores_gemma":[0.83055645,0.031174002,0.10298493,0.0039094994,0.0024323706,0.0016735644,0.001451311,0.0009601495,0.024857622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99231637,0.002277526,0.00016163077,0.0007167737,0.0024765427,0.0020511786],"domain_scores_gemma":[0.9305375,0.057863563,0.002991112,0.002339211,0.004661083,0.0016075048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010014057,0.0046266406,0.002776302,0.005276376,0.0026480854,0.008509328,0.004596812,0.0029165721,0.012193398],"category_scores_gemma":[0.04306731,0.0013139002,0.002526268,0.0041710525,0.0062284423,0.010437499,0.0075420244,0.008727491,0.0030129491],"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.00045980915,0.00018418518,0.0008499557,0.00092553516,0.00018156553,0.00048620324,0.00065619696,0.23869163,0.0038136663,0.71286434,0.014957859,0.025929227],"study_design_scores_gemma":[0.00005354684,0.00016001065,0.00067600235,0.0008132474,0.00011830501,0.0003391272,0.00023933119,0.4856852,0.0019344587,0.49959442,0.010267589,0.000118671356],"about_ca_topic_score_codex":0.0074672527,"about_ca_topic_score_gemma":0.004267635,"teacher_disagreement_score":0.012193398,"about_ca_system_score_codex":0.010004844,"about_ca_system_score_gemma":0.004043672,"threshold_uncertainty_score":0.07259059},"labels":[],"label_agreement":null},{"id":"W1590807798","doi":"10.48550/arxiv.1505.01133","title":"Outer Bounds on the Admissible Source Region for Broadcast Channels with Correlated Sources","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"McMaster University","funders":"","keywords":"Lossy compression; Channel (broadcasting); Characterization (materials science); Atomic broadcast; Computer science; Mathematics; Topology (electrical circuits); Telecommunications; Broadcasting (networking); Physics; Computer network; Combinatorics; Statistics; Optics","score_opus":0.10166258857406213,"score_gpt":0.19350705717312275,"score_spread":0.09184446859906062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590807798","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.011225115,0.0013299964,0.9714163,0.00045668142,0.00010317256,0.00006754429,0.00021900011,0.00025199333,0.014930303],"genre_scores_gemma":[0.6932771,0.007557409,0.27803686,0.001169369,0.0012435861,0.0012484188,0.0014836052,0.0013806545,0.014603048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904635,0.0037064762,0.00039746254,0.0010243092,0.003213531,0.0011947171],"domain_scores_gemma":[0.89159113,0.09289918,0.0038245867,0.0052899527,0.0047329376,0.0016622422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009024594,0.0036090105,0.0025333432,0.0036193202,0.0018142868,0.0052918955,0.003405047,0.0020690695,0.008745178],"category_scores_gemma":[0.058637884,0.0012690193,0.0020318977,0.003046314,0.005432987,0.0073081898,0.008954079,0.00838676,0.0021400445],"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.0008949634,0.00014119539,0.0009486985,0.0006950467,0.00013027579,0.00043629142,0.0009791869,0.3016494,0.012672526,0.6351643,0.0048388904,0.041449193],"study_design_scores_gemma":[0.00004323689,0.00016979165,0.00043998368,0.00033564703,0.00010707991,0.00040168202,0.00023996706,0.511575,0.009884121,0.46943617,0.007264143,0.00010313441],"about_ca_topic_score_codex":0.00076684944,"about_ca_topic_score_gemma":0.00065698614,"teacher_disagreement_score":0.009024594,"about_ca_system_score_codex":0.0026134392,"about_ca_system_score_gemma":0.0016886467,"threshold_uncertainty_score":0.047727168},"labels":[],"label_agreement":null},{"id":"W1593863998","doi":"10.1109/spawc.2015.7227108","title":"Analog coding for Gaussian source and state interference estimation","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Upper and lower bounds; Computer science; Algorithm; Transmitter; Gaussian; Encoder; Parametric statistics; Decoding methods; Linear network coding; Channel (broadcasting); Mathematics; Mathematical optimization; Telecommunications; Statistics","score_opus":0.03693072357514652,"score_gpt":0.2765804727347046,"score_spread":0.23964974915955808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593863998","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.012782219,0.00033819012,0.9837382,0.00014392474,0.00002119273,0.000017565204,0.000030184783,0.000056748235,0.0028717895],"genre_scores_gemma":[0.8747434,0.0007149619,0.120768905,0.00010674857,0.00004553511,0.00007558268,0.00006019992,0.000017833949,0.0034668138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954283,0.00017671392,0.000016666067,0.000058552938,0.00015555305,0.00004976446],"domain_scores_gemma":[0.9990928,0.0006479608,0.000073780684,0.000071949034,0.00009902169,0.000014635077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007355476,0.00054614374,0.0003969472,0.00027450098,0.00023907155,0.00066646124,0.0006628339,0.0006488189,0.0014590591],"category_scores_gemma":[0.0026617835,0.00018872977,0.00030135553,0.0006257384,0.0009903422,0.001011259,0.0008870334,0.00077828026,0.00017505819],"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.00007784747,0.000022432687,0.00039552836,0.000093572104,0.000018580846,0.00014789063,0.00008757269,0.83001566,0.0037758828,0.13511296,0.000454886,0.029797217],"study_design_scores_gemma":[0.000004200628,0.00001782092,0.000045509914,0.000005871046,0.000004427723,0.000026297554,0.000006443718,0.98645717,0.0009303934,0.012191282,0.0003056783,0.0000049181417],"about_ca_topic_score_codex":0.0028469313,"about_ca_topic_score_gemma":0.0023324292,"teacher_disagreement_score":0.0028469313,"about_ca_system_score_codex":0.000853721,"about_ca_system_score_gemma":0.00078136043,"threshold_uncertainty_score":0.0061941743},"labels":[],"label_agreement":null},{"id":"W1595612723","doi":"10.1002/sec.1014","title":"Reliability enhancement for CIR-based physical layer authentication","year":2014,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Physical layer; Authentication (law); Fading; False alarm; Channel (broadcasting); Reliability (semiconductor); Wireless; Computer network; Telecommunications; Computer security; Artificial intelligence","score_opus":0.009687944089392877,"score_gpt":0.24615423807300485,"score_spread":0.23646629398361196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595612723","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.042860173,0.0011360747,0.9521968,0.00016841212,0.0001609719,0.00006409448,0.00003569335,0.00083263207,0.0025451756],"genre_scores_gemma":[0.892013,0.00051264965,0.10596623,0.00009533736,0.00012288945,0.00003801354,0.000056379227,0.000026471958,0.0011690011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838877,0.00050351734,0.00010117943,0.0001934266,0.0006280352,0.00018508665],"domain_scores_gemma":[0.9952809,0.0017759064,0.0005720071,0.0008749242,0.0013731122,0.00012318532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019725282,0.0008464621,0.0006848935,0.00077377085,0.0004825012,0.0007826843,0.00086546625,0.00086704857,0.0013307224],"category_scores_gemma":[0.0071321176,0.0003182701,0.0005262568,0.00057353434,0.00072460476,0.0013280647,0.0015142572,0.0012414557,0.00076900196],"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.0015277418,0.00018753484,0.0038250159,0.0005139994,0.000120075114,0.0006355925,0.0005547806,0.42646343,0.1781505,0.03545451,0.003250006,0.34931687],"study_design_scores_gemma":[0.000027115913,0.00039863956,0.00095282175,0.000026225936,0.000050824405,0.00041240052,0.000032967273,0.9654295,0.02722409,0.0035409257,0.0018504397,0.00005412676],"about_ca_topic_score_codex":0.00048989005,"about_ca_topic_score_gemma":0.0005101373,"teacher_disagreement_score":0.0019725282,"about_ca_system_score_codex":0.00046554333,"about_ca_system_score_gemma":0.0007901159,"threshold_uncertainty_score":0.010431826},"labels":[],"label_agreement":null},{"id":"W1598656139","doi":"10.1109/wcl.2013.120513.130680","title":"Low-Latency Source-Channel Coding for Fading Channels with Correlated Interference","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"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":"Computer science; Fading; Rayleigh fading; Encoder; Algorithm; Decoding methods; Transmitter; Minimum mean square error; Channel (broadcasting); Telecommunications; Mathematics; Estimator; Statistics","score_opus":0.022552857780099366,"score_gpt":0.24041365268906686,"score_spread":0.2178607949089675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598656139","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.048815776,0.00024408608,0.9488137,0.00014153628,0.000014321225,0.000032823624,0.000028711875,0.00009478169,0.0018142251],"genre_scores_gemma":[0.91652966,0.0003684976,0.08151242,0.000045810808,0.000025045078,0.00006828173,0.000035263114,0.000022618575,0.0013925316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907815,0.00037543126,0.000036432408,0.000057940764,0.00031478587,0.00013725011],"domain_scores_gemma":[0.9948026,0.0041802903,0.00041311266,0.0002297784,0.00030963586,0.00006453559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016669695,0.0007439623,0.00066739495,0.00034128124,0.0003694524,0.00074771297,0.0007439176,0.00066712656,0.0009111194],"category_scores_gemma":[0.0065084463,0.00027579954,0.00031045865,0.0007730471,0.0011978905,0.0010785778,0.0010701377,0.0007842219,0.00017588523],"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.00010737694,0.000027025893,0.00031192714,0.000066008564,0.0000134450165,0.00010531665,0.00007795168,0.93545246,0.0043208245,0.048281576,0.00014475101,0.011091363],"study_design_scores_gemma":[0.000006875681,0.000023894461,0.000031920245,0.000004568979,0.0000032854432,0.000019761374,0.00000707687,0.9917374,0.0017829638,0.0063037756,0.00007471077,0.0000036640026],"about_ca_topic_score_codex":0.0021502308,"about_ca_topic_score_gemma":0.0023596415,"teacher_disagreement_score":0.0021502308,"about_ca_system_score_codex":0.0011433618,"about_ca_system_score_gemma":0.001492359,"threshold_uncertainty_score":0.008815825},"labels":[],"label_agreement":null},{"id":"W161063530","doi":"10.1007/978-1-4939-0413-6_2","title":"Cooperative Cognitive Radio Networking","year":2013,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"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 Waterloo","funders":"","keywords":"Software deployment; Cognitive radio; Computer science; Cognition; Business; Knowledge management; Computer security; Telecommunications; Psychology; Neuroscience; Software engineering","score_opus":0.019843058071556886,"score_gpt":0.23729396030867803,"score_spread":0.21745090223712113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161063530","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047401856,0.071960054,0.37565857,0.0013329262,0.006445272,0.00006797375,0.00010811782,0.0012568223,0.53843004],"genre_scores_gemma":[0.081663996,0.053054225,0.057896875,0.0010587563,0.0032946994,0.00013005332,0.00035579884,0.00029634582,0.80224925],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984646,0.000018724522,0.0000044751278,0.00003300774,0.00008247603,0.000014765802],"domain_scores_gemma":[0.99987483,0.000042987096,0.0000072977177,0.000023810084,0.000038255326,0.000012858292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001857992,0.00077911693,0.0003983363,0.0006394726,0.00032126345,0.0010063761,0.00076183025,0.00071895105,0.012321167],"category_scores_gemma":[0.0003661526,0.00025080008,0.00021377603,0.0007776865,0.0004508269,0.001027175,0.000936467,0.001079737,0.008060993],"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.000039266302,0.000067651155,0.00008163276,0.00028567947,0.000020002717,0.00012965687,0.00009617295,0.006332201,0.013788345,0.084406644,0.089452915,0.8052998],"study_design_scores_gemma":[0.000008599778,0.00009289328,0.0003706549,0.00022229011,0.000028320263,0.00080373086,0.000058622605,0.029152207,0.009597837,0.09040026,0.86922485,0.00003971487],"about_ca_topic_score_codex":0.00028689948,"about_ca_topic_score_gemma":0.0006970326,"teacher_disagreement_score":0.012321167,"about_ca_system_score_codex":0.00039114026,"about_ca_system_score_gemma":0.00032844866,"threshold_uncertainty_score":0.04121846},"labels":[],"label_agreement":null},{"id":"W1615560023","doi":"10.1109/lwc.2015.2446986","title":"Binary Signaling of Correlated Sources Over Orthogonal Multiple-Access Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security 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":"Queen's University","funders":"","keywords":"Additive white Gaussian noise; Binary number; Channel (broadcasting); Upper and lower bounds; Joint (building); Algorithm; Mathematics; Gaussian; Signal-to-noise ratio (imaging); Energy (signal processing); Mathematical optimization; Computer science; Gaussian noise; Topology (electrical circuits); Statistics; Telecommunications; Combinatorics; Physics; Mathematical analysis; Engineering","score_opus":0.055449853240941815,"score_gpt":0.28771752545609625,"score_spread":0.23226767221515443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1615560023","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.22017658,0.0004097145,0.7732236,0.00034032637,0.000028537084,0.000050542083,0.00006712284,0.00011104037,0.00559268],"genre_scores_gemma":[0.9541917,0.0002114541,0.04462601,0.000049294194,0.000012256051,0.000045159213,0.000027049762,0.00001142891,0.0008256544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849296,0.0007847607,0.000066890985,0.00009884178,0.0003969751,0.00015954635],"domain_scores_gemma":[0.9975567,0.0015627552,0.00044381042,0.00014947787,0.00022781656,0.000059464084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001602687,0.00059490756,0.00061478914,0.0004926888,0.00032344603,0.0009336198,0.0005503587,0.00067602354,0.0008326128],"category_scores_gemma":[0.00544534,0.0002997049,0.0002637986,0.00082531606,0.000786852,0.0010283089,0.0012515254,0.0004304853,0.00017232195],"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.00067175645,0.00010776697,0.0017729035,0.0001820092,0.00006231824,0.00022929853,0.00021487052,0.78801095,0.025939891,0.121236436,0.00046271033,0.06110914],"study_design_scores_gemma":[0.000033735912,0.0000899614,0.00036616478,0.000020727166,0.000015861453,0.00006619827,0.000042654243,0.9651783,0.009033771,0.02487843,0.00025488855,0.00001935826],"about_ca_topic_score_codex":0.0003691977,"about_ca_topic_score_gemma":0.00059975876,"teacher_disagreement_score":0.001602687,"about_ca_system_score_codex":0.0006040196,"about_ca_system_score_gemma":0.0006743518,"threshold_uncertainty_score":0.008475959},"labels":[],"label_agreement":null},{"id":"W1620343632","doi":"10.1109/isit.2015.7282685","title":"Delay-constrained streaming of Gauss-Markov sources over erasure channels","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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 Toronto","funders":"","keywords":"Erasure; Binary erasure channel; Computer science; Algorithm; Decoding methods; Encoder; Markov process; Channel (broadcasting); Markov chain; Transmission (telecommunications); Network packet; Upper and lower bounds; Distortion (music); Burst error; Topology (electrical circuits); Mathematics; Telecommunications; Channel capacity; Bandwidth (computing); Computer network; Combinatorics","score_opus":0.021481870272691533,"score_gpt":0.24820515279120856,"score_spread":0.22672328251851703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1620343632","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.31288096,0.0013841799,0.67797285,0.0005490723,0.00007472893,0.00010316418,0.00029315276,0.00026608713,0.00647586],"genre_scores_gemma":[0.98306113,0.0005521461,0.014574468,0.00003397141,0.000036323618,0.00004137513,0.00008585816,0.000020230156,0.0015945192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993494,0.00021254324,0.000033172102,0.00008946497,0.00017086964,0.00014467191],"domain_scores_gemma":[0.9921278,0.006097835,0.00068361516,0.00033280367,0.00047758932,0.00028035758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012448357,0.0009385219,0.0008413835,0.00047543965,0.00045532652,0.00092264905,0.0008977807,0.0007658555,0.0013511608],"category_scores_gemma":[0.0067972965,0.00040168007,0.0003289331,0.0005977318,0.0014818347,0.002006056,0.0012016001,0.0010084646,0.00014057953],"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.000756902,0.00007400081,0.00079337094,0.00017414698,0.000037527763,0.0006318664,0.00018853946,0.8347302,0.009745172,0.14311667,0.0004804932,0.009271105],"study_design_scores_gemma":[0.00002187836,0.000055883804,0.0001157607,0.000010710082,0.0000067639044,0.00008138726,0.000032530246,0.9803268,0.0026170916,0.016529316,0.00018534814,0.000016643939],"about_ca_topic_score_codex":0.002495068,"about_ca_topic_score_gemma":0.0013389182,"teacher_disagreement_score":0.002495068,"about_ca_system_score_codex":0.0011982494,"about_ca_system_score_gemma":0.0008452361,"threshold_uncertainty_score":0.0086939335},"labels":[],"label_agreement":null},{"id":"W1620650588","doi":"10.48550/arxiv.1403.5598","title":"Adversarial Wiretap Channel with Public Discussion","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Secrecy; Computer science; Code word; Channel (broadcasting); Computer network; Adversarial system; Transmission (telecommunications); Adversary; Protocol (science); Exploit; Upper and lower bounds; Secure channel; Computer security; Information-theoretic security; Decoding methods; Telecommunications; Mathematics; Encryption","score_opus":0.05059045959293241,"score_gpt":0.1711587321008779,"score_spread":0.1205682725079455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1620650588","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.030199178,0.000122192,0.9525732,0.0013077216,0.00005922031,0.00021054535,0.00029373678,0.00036142443,0.0148728015],"genre_scores_gemma":[0.85085994,0.00037655394,0.12893386,0.0003277913,0.00016173066,0.00093232305,0.0002629317,0.00011327278,0.018031573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936858,0.0028138722,0.00023313996,0.0010833762,0.0014056828,0.00077807053],"domain_scores_gemma":[0.98642236,0.008173623,0.0013926121,0.0030118686,0.0006283526,0.00037110155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004063938,0.001184782,0.0012397746,0.0008784537,0.0016086939,0.0024408833,0.002996858,0.0023946215,0.0058605857],"category_scores_gemma":[0.011161226,0.000738368,0.0012160671,0.0011604367,0.0037733281,0.007521961,0.0048104054,0.004125463,0.0010245494],"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.00033553154,0.000079370184,0.00025470185,0.000094160816,0.000039407838,0.00036889946,0.00037312816,0.08027747,0.0042544743,0.9047366,0.0017813396,0.0074049234],"study_design_scores_gemma":[0.00012352492,0.00012631537,0.000120355464,0.000031572643,0.000041613694,0.00027635082,0.00008569411,0.6250842,0.0071625696,0.35972533,0.007163362,0.00005903769],"about_ca_topic_score_codex":0.0010810621,"about_ca_topic_score_gemma":0.00064785813,"teacher_disagreement_score":0.0058605857,"about_ca_system_score_codex":0.0024322916,"about_ca_system_score_gemma":0.0018699915,"threshold_uncertainty_score":0.021492422},"labels":[],"label_agreement":null},{"id":"W1626906177","doi":"10.1109/tcomm.2015.2493063","title":"Degraded Gaussian Diamond–Wiretap Channel","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"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 Toronto","funders":"Qatar National Research Fund","keywords":"Randomness; Relay; Channel (broadcasting); Gaussian; Secrecy; Upper and lower bounds; Computer science; Topology (electrical circuits); Relay channel; Channel code; Encoder; Coding (social sciences); Constraint (computer-aided design); Computer network; Decoding methods; Algorithm; Mathematics; Combinatorics; Statistics; Physics; Computer security","score_opus":0.07075431771036544,"score_gpt":0.28243073572356403,"score_spread":0.2116764180131986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1626906177","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.06973106,0.0015958342,0.89776343,0.0007025883,0.00011832011,0.000077506884,0.00091383985,0.0004435054,0.028653897],"genre_scores_gemma":[0.9583489,0.0012051463,0.036297575,0.00016751925,0.00007991663,0.00014317835,0.0003254072,0.000038774662,0.0033935187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997693,0.0005895301,0.00008787185,0.00027972396,0.000826646,0.000523215],"domain_scores_gemma":[0.982588,0.011328786,0.0012250044,0.0016989588,0.0027455902,0.00041370207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021676694,0.0010107697,0.0011437273,0.0011816758,0.00055044,0.0018404725,0.0013111158,0.0010214783,0.0037546325],"category_scores_gemma":[0.014534731,0.0004002477,0.00037905105,0.0013851877,0.0022909727,0.0027618126,0.0022372047,0.0014378766,0.0008426202],"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.00068450766,0.000063618,0.0009927291,0.00049851043,0.00007497439,0.0010378639,0.00032580085,0.59666204,0.011387152,0.35636362,0.0058068624,0.026102228],"study_design_scores_gemma":[0.000017462758,0.000062148305,0.00020848477,0.000052264142,0.000016123404,0.00029667484,0.00007361357,0.93203545,0.003988503,0.06126391,0.0019403398,0.000044988476],"about_ca_topic_score_codex":0.0025978694,"about_ca_topic_score_gemma":0.001647955,"teacher_disagreement_score":0.0037546325,"about_ca_system_score_codex":0.0015035972,"about_ca_system_score_gemma":0.0012297303,"threshold_uncertainty_score":0.012560546},"labels":[],"label_agreement":null},{"id":"W1640956619","doi":"10.1109/isit.2015.7282635","title":"Gaussian wiretap channel with shared keys between transmitter and helpers","year":2015,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"Transmitter; Computer science; Converse; Shared secret; Key generation; Key (lock); Artificial noise; Channel (broadcasting); Transmission (telecommunications); Topology (electrical circuits); Secure communication; Telecommunications; Gaussian; Computer network; Mathematics; Encryption; Computer security; Combinatorics; Physics","score_opus":0.030203350597994078,"score_gpt":0.22695896104856478,"score_spread":0.1967556104505707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1640956619","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.196041,0.0011349434,0.7858129,0.001294121,0.00010779207,0.000114109374,0.0004323292,0.0001969724,0.014865807],"genre_scores_gemma":[0.97257465,0.0009336595,0.020922694,0.00010805913,0.000084467065,0.00018278288,0.000097864635,0.000025344421,0.00507041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997973,0.0007472308,0.00005493488,0.00023744353,0.00037898016,0.0006082726],"domain_scores_gemma":[0.9870077,0.009401042,0.0016145741,0.0007613438,0.00084841513,0.00036687937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023155403,0.0017121809,0.0013322606,0.00084344327,0.0009220817,0.0015548777,0.0013926446,0.001614551,0.0025648128],"category_scores_gemma":[0.011917027,0.0006941596,0.00063862087,0.0014107232,0.0040933383,0.0034786703,0.0026521562,0.002259844,0.0005907265],"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.0006683612,0.00006939518,0.0012712299,0.00027496248,0.00007790057,0.0012493142,0.0005202729,0.3995105,0.008351309,0.5773026,0.0019720371,0.008732142],"study_design_scores_gemma":[0.000104880484,0.00025891984,0.00030806137,0.000044309483,0.000045787096,0.00034411362,0.00016594179,0.88114065,0.003268914,0.11291726,0.0013328351,0.0000684382],"about_ca_topic_score_codex":0.0029125798,"about_ca_topic_score_gemma":0.0017677653,"teacher_disagreement_score":0.0029125798,"about_ca_system_score_codex":0.0018799781,"about_ca_system_score_gemma":0.0013372266,"threshold_uncertainty_score":0.013640225},"labels":[],"label_agreement":null},{"id":"W1646216325","doi":"10.1109/isit.2015.7282893","title":"Outage analysis for two-user parallel Gaussian interference channels","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Interference (communication); Channel (broadcasting); Signal-to-noise ratio (imaging); Algorithm; Gaussian; Fading; Topology (electrical circuits); Gaussian noise; Decoding methods; Random variable; Noise (video); Signal-to-interference-plus-noise ratio; Co-channel interference; Computer science; Statistics; Mathematics; Physics; Telecommunications; Combinatorics; Artificial intelligence","score_opus":0.0517953142624088,"score_gpt":0.30176255328451024,"score_spread":0.24996723902210144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1646216325","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.21802452,0.0021225486,0.76312757,0.0008888187,0.000078761754,0.000048742342,0.000381785,0.00049756013,0.014829741],"genre_scores_gemma":[0.9847451,0.00091566815,0.011994647,0.00008850587,0.00007299114,0.000035848832,0.00015421014,0.000055011125,0.0019380416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986706,0.00039822547,0.0000370471,0.00011171849,0.0004350555,0.00034744877],"domain_scores_gemma":[0.99290293,0.0050149234,0.00061362167,0.00044174798,0.0008522097,0.00017453928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002138251,0.00093094783,0.00120785,0.0009165547,0.0006749392,0.0011256578,0.0009668478,0.0008068441,0.0023130972],"category_scores_gemma":[0.008249188,0.00039030905,0.000641779,0.0014282587,0.0017523585,0.0015158468,0.0013281438,0.0011077251,0.00034642528],"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.00006626104,0.000017619222,0.00084692653,0.000051627536,0.000021537819,0.00022467936,0.00007353879,0.97156614,0.0009640337,0.02168105,0.000710665,0.003775817],"study_design_scores_gemma":[0.0000027633541,0.00000733995,0.00018097443,0.0000035275953,0.0000047306653,0.000046031622,0.0000164041,0.9945346,0.00014190128,0.004967375,0.00008835194,0.0000059942818],"about_ca_topic_score_codex":0.008656368,"about_ca_topic_score_gemma":0.004115523,"teacher_disagreement_score":0.008656368,"about_ca_system_score_codex":0.00247097,"about_ca_system_score_gemma":0.0010017438,"threshold_uncertainty_score":0.017928243},"labels":[],"label_agreement":null},{"id":"W1647263699","doi":"10.1109/isit.2015.7282682","title":"Optimality of Walrand-Varaiya type policies and approximation results for zero delay coding of Markov sources","year":2015,"lang":"en","type":"article","venue":"","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":"Queen's University","funders":"","keywords":"Markov chain; Quantization (signal processing); Markov process; Mathematics; Coding (social sciences); Finite state; Mathematical optimization; Markov decision process; Zero (linguistics); Optimal control; Applied mathematics; Computer science; Algorithm; Statistics","score_opus":0.04641831960546004,"score_gpt":0.2883114087872172,"score_spread":0.24189308918175717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1647263699","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.03548564,0.0010739127,0.9509651,0.00074357865,0.000081460195,0.000048315287,0.00013414913,0.000093971736,0.011373829],"genre_scores_gemma":[0.9312219,0.0019928245,0.058893386,0.00018949136,0.00011696177,0.00012558042,0.00015346606,0.00007813962,0.007228254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899834,0.00035681028,0.00004615342,0.00014726633,0.00025138966,0.00019993677],"domain_scores_gemma":[0.9910403,0.007375194,0.00064905913,0.00020558537,0.00056336226,0.00016649636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023833888,0.0010919034,0.0011041032,0.0009648436,0.0006532774,0.002033933,0.0012424942,0.0012924124,0.0031156496],"category_scores_gemma":[0.012052183,0.000547461,0.00089899614,0.0011675529,0.0026901287,0.0020471653,0.0014317341,0.0025764054,0.00036510886],"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.00008604819,0.000044011023,0.0003117074,0.00009978118,0.000023827315,0.00007417973,0.0001338905,0.56101567,0.0015633238,0.4273535,0.00095109193,0.008342912],"study_design_scores_gemma":[0.000009157333,0.000025371453,0.00006841563,0.000022423648,0.000006956413,0.000019131186,0.0000221664,0.9053191,0.00063186645,0.0935564,0.00030451085,0.00001447302],"about_ca_topic_score_codex":0.005938366,"about_ca_topic_score_gemma":0.0033002915,"teacher_disagreement_score":0.005938366,"about_ca_system_score_codex":0.0032360123,"about_ca_system_score_gemma":0.0028591796,"threshold_uncertainty_score":0.023478985},"labels":[],"label_agreement":null},{"id":"W1648163154","doi":"10.1109/isit.2015.7282873","title":"Information recovery from pairwise measurements: A shannon-theoretic approach","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Pairwise comparison; Computer science; Set (abstract data type); Channel (broadcasting); Alphabet; Graph; Algorithm; Information retrieval; Combinatorics; Artificial intelligence; Theoretical computer science; Mathematics; Philosophy; Computer network","score_opus":0.0439213234993211,"score_gpt":0.2312732585330841,"score_spread":0.187351935033763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1648163154","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.0037220553,0.00076834817,0.989958,0.0008290143,0.00007022785,0.00004761507,0.00016272235,0.00008756549,0.0043544816],"genre_scores_gemma":[0.5807768,0.0058745323,0.3988925,0.0012711172,0.0016084419,0.0008958813,0.0010448205,0.00024748925,0.009388398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929763,0.0036023713,0.00031426255,0.0009175185,0.0018525062,0.00033700775],"domain_scores_gemma":[0.97490364,0.019762056,0.0011824355,0.0028058777,0.001078359,0.00026760536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008109333,0.0020017475,0.0022552588,0.0032224078,0.0011524025,0.003620206,0.0031953265,0.0026460348,0.0027234333],"category_scores_gemma":[0.03447073,0.001113977,0.0016444034,0.0035269596,0.005070962,0.00815016,0.0054818294,0.0038800766,0.000791366],"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.0001716412,0.0000675021,0.00062542787,0.00041405688,0.00020336006,0.00031591018,0.00030353415,0.24428417,0.0021429162,0.6941358,0.0036942977,0.053641334],"study_design_scores_gemma":[0.000021705326,0.00008091315,0.00024089238,0.00009898496,0.000056993616,0.00017155621,0.00006548211,0.52886117,0.0014376696,0.4665561,0.0023408188,0.000067679655],"about_ca_topic_score_codex":0.0018627066,"about_ca_topic_score_gemma":0.0012477189,"teacher_disagreement_score":0.008109333,"about_ca_system_score_codex":0.0023762363,"about_ca_system_score_gemma":0.0019919057,"threshold_uncertainty_score":0.042886734},"labels":[],"label_agreement":null},{"id":"W1656253992","doi":"10.26421/qic7.3-5","title":"Optimal fingerprinting strategies with one-sided error","year":2007,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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":"Fingerprint (computing); Computer science; Set (abstract data type); Message passing; Probability of error; Quantum; Algorithm; Theoretical computer science; Mathematics; Distributed computing; Computer security","score_opus":0.017422861342929044,"score_gpt":0.26120874756328366,"score_spread":0.24378588622035463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1656253992","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.11390717,0.00032008713,0.8802558,0.0002622815,0.000035260342,0.00009357422,0.00005996654,0.00023788218,0.0048279776],"genre_scores_gemma":[0.8236032,0.00024152618,0.1736936,0.000105327665,0.000029012108,0.00014433745,0.0000640947,0.000047987407,0.0020709082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99597895,0.001382386,0.00028543995,0.00063424837,0.0011408085,0.0005781534],"domain_scores_gemma":[0.9896208,0.006041065,0.0011649559,0.002158816,0.00068769587,0.0003266114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003617326,0.00088346034,0.0012409266,0.0011396115,0.0009936814,0.0017273839,0.0017066792,0.001832588,0.0015515863],"category_scores_gemma":[0.014163362,0.0005947024,0.0007539737,0.0011130478,0.0029502134,0.0038523523,0.0035760878,0.0014026926,0.00034906968],"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.0004990195,0.000116466574,0.0010406577,0.00014633642,0.00008896862,0.00018032435,0.00041054178,0.14357163,0.015881196,0.7612512,0.00097551424,0.075838156],"study_design_scores_gemma":[0.00007506926,0.00025891155,0.00036937985,0.000051624123,0.0000666006,0.00022736494,0.00016892934,0.6395287,0.031884618,0.3252239,0.0020458982,0.00009906534],"about_ca_topic_score_codex":0.0005707371,"about_ca_topic_score_gemma":0.00045599544,"teacher_disagreement_score":0.003617326,"about_ca_system_score_codex":0.0013814784,"about_ca_system_score_gemma":0.0013933211,"threshold_uncertainty_score":0.019130528},"labels":[],"label_agreement":null},{"id":"W1664807605","doi":"10.1109/ictc.2011.6082540","title":"Achievable rates for transmission of discrete constellations over the Gaussian MAC channel","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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":"Transmission (telecommunications); Gaussian; Channel (broadcasting); Computer science; Modulation (music); Topology (electrical circuits); Pentagon; Pulse-amplitude modulation; Computer network; Algorithm; Electronic engineering; Pulse (music); Telecommunications; Mathematics; Physics; Engineering; Geometry; Acoustics; Combinatorics","score_opus":0.03208944247210619,"score_gpt":0.2779952823782137,"score_spread":0.2459058399061075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1664807605","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.11024778,0.003795973,0.83945364,0.001077467,0.00008490263,0.0001424092,0.0005153828,0.0006053924,0.04407705],"genre_scores_gemma":[0.9142329,0.002545329,0.07985187,0.00024250378,0.000099747216,0.00028959976,0.00024059182,0.00015705285,0.0023404881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99609464,0.0018078107,0.00015253454,0.00026640043,0.00093210407,0.0007463765],"domain_scores_gemma":[0.97694427,0.018193152,0.0018112222,0.0014488333,0.001327271,0.0002752216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005402555,0.0013346093,0.0012590998,0.0013138909,0.0009304109,0.0031860706,0.0011689333,0.0010400396,0.0027043882],"category_scores_gemma":[0.025846906,0.0005413928,0.00084340386,0.001316161,0.0024561174,0.0024166876,0.0022558651,0.0016184301,0.000796407],"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.000740991,0.00010700081,0.00082671404,0.0005722271,0.00011622142,0.0004495838,0.0005562817,0.43865654,0.012898789,0.51378256,0.0021630896,0.029130073],"study_design_scores_gemma":[0.000052571257,0.00024712758,0.0004916472,0.00024555027,0.000051051866,0.00056517863,0.0002675027,0.7174465,0.014014846,0.26286483,0.0036821936,0.00007094044],"about_ca_topic_score_codex":0.0007627949,"about_ca_topic_score_gemma":0.00044313207,"teacher_disagreement_score":0.005402555,"about_ca_system_score_codex":0.001743592,"about_ca_system_score_gemma":0.0011534173,"threshold_uncertainty_score":0.028571784},"labels":[],"label_agreement":null},{"id":"W1668573605","doi":"10.1109/isit.2015.7282508","title":"A General Formula for Compound Channel Capacity","year":2015,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Ottawa","funders":"","keywords":"Converse; Lemma (botany); Channel (broadcasting); Channel capacity; Mathematics; Topology (electrical circuits); Information theory; Constructive; Transmitter; Expression (computer science); Discrete mathematics; Applied mathematics; Computer science; Combinatorics; Telecommunications; Statistics","score_opus":0.08367214012298492,"score_gpt":0.2938025597264197,"score_spread":0.21013041960343481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1668573605","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.027436554,0.0020134742,0.8969465,0.0017797287,0.00030487406,0.00011614944,0.0010368432,0.00036856707,0.0699973],"genre_scores_gemma":[0.7791147,0.004042572,0.19239512,0.0012464384,0.0008139709,0.0004979744,0.00082931056,0.00032040043,0.020739513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985526,0.00020903359,0.00009778034,0.0004071136,0.00050079933,0.00023272303],"domain_scores_gemma":[0.99742573,0.001465783,0.00015055176,0.00031900362,0.0005515627,0.00008733133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018017328,0.00089726795,0.0009824141,0.0017884849,0.00086714857,0.0024389846,0.0015272087,0.0016903734,0.010797445],"category_scores_gemma":[0.008137246,0.0004059701,0.0007729664,0.0023337845,0.0022564675,0.006237191,0.0015968673,0.0027588354,0.0012395551],"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.000013039613,0.000007823898,0.000119895754,0.00006215894,0.000007580428,0.000103335115,0.000064891385,0.006370775,0.0011935193,0.9823852,0.0026876077,0.006984127],"study_design_scores_gemma":[0.000010069919,0.00002127212,0.00013988187,0.000045791265,0.000015953825,0.0003126677,0.00003699547,0.073506206,0.0015649451,0.9165695,0.0077481,0.000028507458],"about_ca_topic_score_codex":0.0014846673,"about_ca_topic_score_gemma":0.0010771911,"teacher_disagreement_score":0.010797445,"about_ca_system_score_codex":0.0024877742,"about_ca_system_score_gemma":0.0011703946,"threshold_uncertainty_score":0.03612101},"labels":[],"label_agreement":null},{"id":"W1681985504","doi":"10.48550/arxiv.1003.0729","title":"On the Secure Degrees-of-Freedom of the Multiple-Access-Channel","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":42,"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":"MIMO; Gaussian; Topology (electrical circuits); Channel (broadcasting); Secure coding; Coding (social sciences); Computer science; Secrecy; Degrees of freedom (physics and chemistry); Channel capacity; Mathematics; Algorithm; Computer network; Statistics; Physics; Combinatorics","score_opus":0.08066998086983693,"score_gpt":0.20103729324682457,"score_spread":0.12036731237698764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1681985504","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.06657094,0.003926626,0.87568605,0.0018463223,0.00031364363,0.00007810745,0.00035743878,0.00014680342,0.05107418],"genre_scores_gemma":[0.943367,0.0045965025,0.041649275,0.0003387269,0.00036074748,0.00019571543,0.0001920713,0.000060161314,0.0092398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984805,0.00062638725,0.00003933736,0.0001875494,0.00037381766,0.00029241756],"domain_scores_gemma":[0.99739957,0.0016897748,0.0002805991,0.00023528459,0.00029738163,0.00009745566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012298439,0.0015024637,0.0011607502,0.00065836986,0.00093033694,0.0017227837,0.00077074475,0.0010257541,0.0028839936],"category_scores_gemma":[0.0032423693,0.00039257825,0.0007947902,0.0011522647,0.0033216495,0.0021906318,0.002015555,0.0025588193,0.00069067674],"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.00015072587,0.00002852999,0.00029961098,0.00022189437,0.000034354714,0.00032481304,0.0001479636,0.2064349,0.0031368812,0.77696186,0.0027812012,0.009477259],"study_design_scores_gemma":[0.000031340125,0.00010988589,0.00025259238,0.000051089162,0.000018747785,0.0002042571,0.00006197106,0.71721923,0.0013957679,0.2773551,0.0032462592,0.00005378407],"about_ca_topic_score_codex":0.0026440346,"about_ca_topic_score_gemma":0.0012547636,"teacher_disagreement_score":0.0028839936,"about_ca_system_score_codex":0.0016631869,"about_ca_system_score_gemma":0.0013287574,"threshold_uncertainty_score":0.012067378},"labels":[],"label_agreement":null},{"id":"W1795009452","doi":"10.1109/tit.2012.2212874","title":"On Optimal Causal Coding of Partially Observed Markov Sources in Single and Multiterminal Settings","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":51,"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":"Counterexample; Markov process; Bounded function; Coding (social sciences); Mathematics; Markov chain; Conjecture; Markov property; Mathematical optimization; Algorithm; Discrete mathematics; Computer science; Markov model; Applied mathematics; Statistics","score_opus":0.016446468139906904,"score_gpt":0.22752188461220624,"score_spread":0.21107541647229933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1795009452","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.069820695,0.00041646574,0.9222835,0.00095464516,0.000041909716,0.00006263704,0.00020593028,0.000095898715,0.006118356],"genre_scores_gemma":[0.9107176,0.0010021776,0.0837957,0.00015860233,0.00011157694,0.00016530359,0.00028064166,0.00007267578,0.003695673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981926,0.0008715523,0.0000762274,0.00028074728,0.00033565273,0.00024316655],"domain_scores_gemma":[0.9862302,0.011639907,0.000915117,0.0005241368,0.0004658192,0.00022478419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027245525,0.0008579109,0.00102039,0.00078613707,0.00056293147,0.0012124284,0.0011808522,0.0012478788,0.0024872452],"category_scores_gemma":[0.012894331,0.00052797515,0.0005539799,0.0011865739,0.0024000576,0.003105515,0.0020259088,0.0016813193,0.00023371051],"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.00014499866,0.000054198477,0.00035632218,0.00010789534,0.000027148606,0.00012714065,0.00013644753,0.44545764,0.0019346353,0.5360687,0.00073714036,0.01484775],"study_design_scores_gemma":[0.00003371364,0.000047136626,0.00014388155,0.000025968437,0.000012414507,0.00004261369,0.000033914675,0.7325662,0.001201571,0.2654591,0.00041180066,0.000021753425],"about_ca_topic_score_codex":0.0016809136,"about_ca_topic_score_gemma":0.0016716794,"teacher_disagreement_score":0.0027245525,"about_ca_system_score_codex":0.0021643105,"about_ca_system_score_gemma":0.0023085987,"threshold_uncertainty_score":0.015703201},"labels":[],"label_agreement":null},{"id":"W1846289915","doi":"10.48550/arxiv.0909.2777","title":"On the Symmetric Gaussian Interference Channel with Partial Unidirectional Cooperation","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":16,"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":"Interference (communication); Upper and lower bounds; Channel (broadcasting); Dimension (graph theory); Encoder; Topology (electrical circuits); Gaussian; Transmission (telecommunications); Channel capacity; Computer science; Set (abstract data type); Mathematics; Telecommunications; Combinatorics; Physics; Mathematical analysis; Statistics","score_opus":0.04206717427437144,"score_gpt":0.25166546477531027,"score_spread":0.2095982905009388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1846289915","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.158781,0.002491385,0.79510665,0.0010656833,0.000234784,0.00008970957,0.0004389448,0.00018801735,0.04160388],"genre_scores_gemma":[0.9701563,0.0030388706,0.019522205,0.00018152683,0.00020417321,0.00013159326,0.00018241015,0.000028350465,0.006554599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986753,0.00051441055,0.000029458795,0.00013508143,0.0003096315,0.00033617485],"domain_scores_gemma":[0.99796474,0.0012933522,0.00024876304,0.000134117,0.00027573557,0.0000832591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096830196,0.0012947201,0.0010073675,0.00092031667,0.0008469901,0.001550703,0.0009258192,0.000997092,0.0018467702],"category_scores_gemma":[0.0026340755,0.00042026464,0.0005397296,0.0014092253,0.0027009412,0.0013319015,0.0016693796,0.0012760424,0.000464464],"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.0002696818,0.000037806753,0.00055936846,0.00018161048,0.000045945897,0.00095065206,0.00022375336,0.53649855,0.0031164603,0.44799012,0.0026743477,0.0074516446],"study_design_scores_gemma":[0.000031428433,0.00006127237,0.00024495932,0.00003680838,0.000030828814,0.00017800584,0.000086570384,0.8874819,0.0007943948,0.10948557,0.001524364,0.000043905384],"about_ca_topic_score_codex":0.0057716346,"about_ca_topic_score_gemma":0.003388458,"teacher_disagreement_score":0.0057716346,"about_ca_system_score_codex":0.0018022775,"about_ca_system_score_gemma":0.0012496522,"threshold_uncertainty_score":0.013076544},"labels":[],"label_agreement":null},{"id":"W1867338500","doi":"10.48550/arxiv.1008.0223","title":"Secure Joint Source-Channel Coding With Side Information","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"","keywords":"Joint (building); Channel code; Coding (social sciences); Computer science; Channel (broadcasting); Side channel attack; Computer security; Telecommunications; Computer network; Cryptography; Decoding methods; Engineering; Mathematics; Statistics","score_opus":0.038678103054876484,"score_gpt":0.16100188280984143,"score_spread":0.12232377975496495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1867338500","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.020302258,0.00029543866,0.97613394,0.00017287763,0.00003084707,0.000027650976,0.00006105018,0.000090781636,0.002885131],"genre_scores_gemma":[0.8878165,0.00058142655,0.10753936,0.00009041423,0.000055049168,0.00008853643,0.00015813473,0.00003029846,0.0036401993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986084,0.0004205288,0.00006509381,0.00016002762,0.0005875514,0.0001583874],"domain_scores_gemma":[0.9974341,0.0014612661,0.00028453293,0.00040730304,0.00036007393,0.000052846255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013443354,0.0007503544,0.0009377228,0.00045992277,0.00043893818,0.0009251046,0.00083440344,0.0008606509,0.0015438711],"category_scores_gemma":[0.0030914415,0.00031722256,0.00051771465,0.0009969966,0.0012168718,0.0016527498,0.0018173757,0.0011666813,0.00038950023],"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.00031279033,0.000036070043,0.00041845153,0.00016982097,0.000046416815,0.00023636686,0.0001536647,0.6727715,0.008463005,0.2686342,0.0010496286,0.047708],"study_design_scores_gemma":[0.000018082275,0.00004845482,0.00006269641,0.000013053496,0.000013241343,0.0000981249,0.000017787528,0.96075904,0.0044557783,0.033785872,0.0007146576,0.000013326374],"about_ca_topic_score_codex":0.0010432225,"about_ca_topic_score_gemma":0.0010137574,"teacher_disagreement_score":0.0015438711,"about_ca_system_score_codex":0.0009039634,"about_ca_system_score_gemma":0.0012138723,"threshold_uncertainty_score":0.007109642},"labels":[],"label_agreement":null},{"id":"W1916447172","doi":"10.48550/arxiv.1001.3403","title":"Real Interference Alignment","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"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":"Interference alignment; Dirty paper coding; Coding (social sciences); Interference (communication); Computer science; Topology (electrical circuits); Gaussian; Multiplexing; Degenerate energy levels; Data stream mining; Algorithm; Mathematics; Channel (broadcasting); Telecommunications; Precoding; Physics; Combinatorics; MIMO","score_opus":0.05730892935754662,"score_gpt":0.19412620294198846,"score_spread":0.13681727358444185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1916447172","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.022294309,0.0005838444,0.9362364,0.00029830605,0.0002519299,0.00002787279,0.000059436716,0.0002948613,0.039952952],"genre_scores_gemma":[0.7475584,0.0011458811,0.23493324,0.0005869687,0.00029373422,0.00011388459,0.00017758479,0.0002000398,0.014990185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894255,0.00024121151,0.000048064623,0.00024781752,0.00036247866,0.00015787824],"domain_scores_gemma":[0.99905056,0.0002899374,0.00017750701,0.00025437254,0.00017105116,0.00005665954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006726371,0.0007022112,0.0005351724,0.00043209363,0.0007358477,0.0012377971,0.00083765085,0.00066285883,0.00578599],"category_scores_gemma":[0.0019273784,0.00024019381,0.0003911971,0.00063510623,0.0016644916,0.0023189753,0.0019642033,0.0014757703,0.0021731788],"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.00013144918,0.00002708319,0.0004086734,0.0001070152,0.0000216278,0.00015835142,0.00017647259,0.035894405,0.01967331,0.88936794,0.0019699007,0.052063823],"study_design_scores_gemma":[0.000043277167,0.00029822026,0.0004754579,0.00007821997,0.000030664673,0.001356943,0.00018816591,0.39975253,0.041111574,0.512521,0.044037998,0.00010594482],"about_ca_topic_score_codex":0.000310686,"about_ca_topic_score_gemma":0.00022239368,"teacher_disagreement_score":0.00578599,"about_ca_system_score_codex":0.0005290668,"about_ca_system_score_gemma":0.00052591355,"threshold_uncertainty_score":0.019356132},"labels":[],"label_agreement":null},{"id":"W1916886752","doi":"10.1007/3-540-48285-7_35","title":"Secret-Key Reconciliation by Public Discussion","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":790,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Collège Montmorency","funders":"","keywords":"Alice (programming language); Key (lock); Computer science; Channel (broadcasting); Alice and Bob; Computer security; Construct (python library); Protocol (science); Theoretical computer science; Binary number; Algorithm; Computer network; Mathematics; Arithmetic; Programming language","score_opus":0.02534850090791529,"score_gpt":0.25374691767162405,"score_spread":0.22839841676370876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1916886752","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.013851777,0.001089616,0.8808136,0.004182942,0.0011753753,0.0005132137,0.00043665245,0.002382172,0.09555459],"genre_scores_gemma":[0.6676511,0.0013198259,0.21366759,0.0013660282,0.0010377269,0.00095182826,0.0009897443,0.0016899965,0.11132622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99227035,0.0031900294,0.0003911802,0.001033234,0.0019418825,0.0011732206],"domain_scores_gemma":[0.990842,0.003570606,0.0003418862,0.00432451,0.0007519249,0.00016906914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005017261,0.0013856495,0.0015083345,0.0017447751,0.0032795833,0.005345078,0.003120434,0.0030000214,0.027727205],"category_scores_gemma":[0.016401064,0.0009360862,0.0016975397,0.0023854554,0.003353149,0.017077953,0.009804395,0.0042336476,0.011218813],"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.00045673022,0.00011126185,0.00014212134,0.00022494594,0.000061209044,0.00014762983,0.00043822397,0.0052793934,0.0027472244,0.84743714,0.021058729,0.12189546],"study_design_scores_gemma":[0.000108123095,0.000045614757,0.0000885988,0.000082629485,0.0000595953,0.0003295834,0.00012005527,0.030035097,0.015354822,0.9030906,0.050633464,0.00005181938],"about_ca_topic_score_codex":0.0001934912,"about_ca_topic_score_gemma":0.00019844969,"teacher_disagreement_score":0.027727205,"about_ca_system_score_codex":0.0020091706,"about_ca_system_score_gemma":0.0021875645,"threshold_uncertainty_score":0.09275681},"labels":[],"label_agreement":null},{"id":"W1943537601","doi":"10.1002/sec.1118","title":"Artificial frequency selective channel for covert cyclic delay diversity orthogonal frequency division multiplexing transmission","year":2014,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Physical layer; Multiplexing; Transmission (telecommunications); Computer network; Orthogonal frequency-division multiplexing; Channel (broadcasting); Covert; Encryption; Wireless; Diversity scheme; Telecommunications","score_opus":0.013867939103476347,"score_gpt":0.22908894762041263,"score_spread":0.2152210085169363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943537601","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.42086136,0.00060450204,0.56711227,0.0003536597,0.00016559077,0.00006801628,0.00010161281,0.00023939356,0.010493552],"genre_scores_gemma":[0.9781465,0.0001545171,0.020914597,0.000031528532,0.000016555958,0.00001581187,0.000017109234,0.000004198051,0.00069916697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978226,0.00006887147,0.000005399438,0.000022642735,0.000084876214,0.00003598186],"domain_scores_gemma":[0.9993482,0.0003752999,0.0001084298,0.00006893926,0.00007746675,0.000021635515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034732133,0.00023636984,0.00019725364,0.00027448373,0.0003775416,0.00031123686,0.0002432194,0.00038132534,0.000965009],"category_scores_gemma":[0.00094950385,0.00008770591,0.00016175157,0.0003094657,0.00058571517,0.00039285718,0.00049228274,0.000259695,0.0001300751],"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.0008599624,0.00013780751,0.0021721276,0.0003206375,0.000058431222,0.0009808742,0.00024609885,0.45917735,0.2724701,0.16934529,0.0025361516,0.09169518],"study_design_scores_gemma":[0.000023810813,0.0001302966,0.00038827848,0.000011936277,0.000012123032,0.00023058707,0.000014901434,0.9640963,0.028823873,0.004479583,0.0017652726,0.000022961307],"about_ca_topic_score_codex":0.00034035827,"about_ca_topic_score_gemma":0.00039897207,"teacher_disagreement_score":0.000965009,"about_ca_system_score_codex":0.00039924108,"about_ca_system_score_gemma":0.00028432865,"threshold_uncertainty_score":0.0032282472},"labels":[],"label_agreement":null},{"id":"W1948599384","doi":"10.1109/tit.2015.2503766","title":"A Model for Adversarial Wiretap Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures","keywords":"Secrecy; Computer science; Eavesdropping; Code word; Code (set theory); Channel (broadcasting); Reliability (semiconductor); Theoretical computer science; Adversarial system; Algorithm; Computer network; Artificial intelligence; Decoding methods; Power (physics); Computer security","score_opus":0.03398889484881486,"score_gpt":0.25062785606382537,"score_spread":0.21663896121501053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1948599384","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.021794276,0.00037974343,0.943897,0.002193222,0.0001755801,0.00015521645,0.0008414943,0.0005381941,0.030025207],"genre_scores_gemma":[0.8386235,0.0018289787,0.09326006,0.0011446973,0.0006280906,0.0009646928,0.0012645114,0.00037414976,0.06191124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996029,0.0013663364,0.00019270553,0.00072460395,0.001040272,0.0006471611],"domain_scores_gemma":[0.990369,0.0053550913,0.0011133896,0.0015433859,0.0010321636,0.0005868228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002406383,0.0016100914,0.0011386658,0.0013186435,0.0012850607,0.0033889797,0.0032233817,0.0038249814,0.011724604],"category_scores_gemma":[0.009867679,0.0007241854,0.0013190698,0.0015042064,0.0038259171,0.0075875316,0.0037032482,0.00528583,0.0028607436],"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.000096445016,0.000042353306,0.0002055058,0.000066842986,0.000023280207,0.00026773117,0.00021059401,0.082122244,0.0011871649,0.9074328,0.004182863,0.004162118],"study_design_scores_gemma":[0.000051480292,0.00008113598,0.00009082415,0.000033395292,0.00002267708,0.00022213446,0.000069931506,0.5264471,0.0006999764,0.46299893,0.009246247,0.000036205096],"about_ca_topic_score_codex":0.0027302345,"about_ca_topic_score_gemma":0.0014993093,"teacher_disagreement_score":0.011724604,"about_ca_system_score_codex":0.002118623,"about_ca_system_score_gemma":0.0014747482,"threshold_uncertainty_score":0.039222658},"labels":[],"label_agreement":null},{"id":"W1954438016","doi":"10.1109/isit.2015.7282460","title":"Joint source-channel coding with feedback","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; Division of Mathematical Sciences; Moscow Institute of Physics and Technology; Australian National University; Technion-Israel Institute of Technology; University of Tokyo; University of Ottawa; California Institute of Technology; Universitat Politècnica de Catalunya; Massachusetts Institute of Technology; Princeton University; American Society for Engineering Education; Russian Academy of Sciences; University of Cambridge; National Science Foundation","keywords":"Distortion (music); Coding (social sciences); Channel code; Computer science; Constraint (computer-aided design); Limit (mathematics); Channel (broadcasting); Joint (building); Transmission (telecommunications); Variable (mathematics); Control theory (sociology); Algorithm; Decoding methods; Mathematics; Topology (electrical circuits); Telecommunications; Engineering; Statistics; Artificial intelligence; Bandwidth (computing); Mathematical analysis; Combinatorics","score_opus":0.04474122020695393,"score_gpt":0.22611320281218356,"score_spread":0.18137198260522963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1954438016","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.08041845,0.0011597706,0.9110794,0.00046016648,0.00006754648,0.000039248236,0.00016787511,0.00023995066,0.0063675535],"genre_scores_gemma":[0.9638296,0.00043586345,0.03413237,0.0000700348,0.00006830365,0.000046275345,0.000055385502,0.000023322002,0.0013388939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980513,0.00058577716,0.0000990135,0.00024081067,0.0007840254,0.00023910444],"domain_scores_gemma":[0.99172884,0.006055266,0.0006629475,0.00080374966,0.0005812398,0.0001679686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025176578,0.0008733739,0.00079969177,0.000662051,0.0003786951,0.0011224262,0.0012202174,0.0008913943,0.0010575106],"category_scores_gemma":[0.0101597225,0.000330075,0.00038247762,0.00079605146,0.0019736202,0.0029047898,0.0022723004,0.0011798926,0.00019120493],"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.00024156536,0.000031023803,0.00043336375,0.00017411499,0.00003504699,0.00016802608,0.00015242529,0.4303534,0.009623176,0.53895235,0.0004882161,0.0193473],"study_design_scores_gemma":[0.000024303858,0.000081330785,0.00016050892,0.000031761327,0.000015482985,0.00013461817,0.000012408556,0.84466356,0.0045936606,0.14944905,0.0008087519,0.000024593815],"about_ca_topic_score_codex":0.0010959776,"about_ca_topic_score_gemma":0.0008708353,"teacher_disagreement_score":0.0025176578,"about_ca_system_score_codex":0.0016929826,"about_ca_system_score_gemma":0.0010856646,"threshold_uncertainty_score":0.013314784},"labels":[],"label_agreement":null},{"id":"W1960603654","doi":"10.1109/itsc.2015.288","title":"ADS-B Authentication Compliant with Mode-S Extended Squitter Using PSK Modulation","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Authentication (law); Digital signature; Encryption; Broadcasting (networking); Computer network; Keying; Message authentication code; Cryptography; Physical layer; Digital watermarking; Computer security; Modulation (music); Wireless; Telecommunications","score_opus":0.06060613315023733,"score_gpt":0.2973363353391928,"score_spread":0.23673020218895546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1960603654","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.41091377,0.00079562765,0.54263645,0.00063056056,0.00026608334,0.00044183244,0.00013939278,0.0022385244,0.0419378],"genre_scores_gemma":[0.9313356,0.00027217987,0.05595615,0.00016599128,0.00008946065,0.000077868404,0.00018448533,0.000048691913,0.0118695],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994061,0.00013131344,0.0000584059,0.000077687415,0.0002575456,0.000068905196],"domain_scores_gemma":[0.9993311,0.000096038195,0.00011976508,0.00020420556,0.00021987641,0.000029072591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048337952,0.0004033177,0.00023084895,0.00049342366,0.00047974035,0.0006039169,0.00034305267,0.0005787845,0.0025521624],"category_scores_gemma":[0.0010492307,0.00013495827,0.00025836803,0.00027808268,0.0003868747,0.0008558583,0.00065150287,0.0003451178,0.0017762791],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0013610414,0.00015134555,0.0056234216,0.00032847334,0.00004883284,0.0014044008,0.0007666112,0.0055368934,0.70950353,0.055021737,0.003950842,0.21630292],"study_design_scores_gemma":[0.0002762055,0.0029632866,0.008429386,0.00013805435,0.00015536028,0.008027594,0.00044742625,0.15736417,0.6818804,0.017207412,0.1229166,0.00019411628],"about_ca_topic_score_codex":0.00050091516,"about_ca_topic_score_gemma":0.0004560802,"teacher_disagreement_score":0.0025521624,"about_ca_system_score_codex":0.0002876225,"about_ca_system_score_gemma":0.0003802492,"threshold_uncertainty_score":0.008537769},"labels":[],"label_agreement":null},{"id":"W1963802579","doi":"10.1109/cwit.2013.6621623","title":"Security enhancement in cooperative jamming using compromised secrecy region minimization","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Jamming; Secrecy; Computer science; Minification; Wireless; Fading; Path loss; Computer network; Channel (broadcasting); Mathematical optimization; Computer security; Telecommunications; Mathematics","score_opus":0.02183116819114121,"score_gpt":0.24640948205281518,"score_spread":0.22457831386167398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963802579","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.091154136,0.00044047192,0.90512425,0.00009082377,0.000017231487,0.000022468586,0.000012915242,0.000104293555,0.0030333765],"genre_scores_gemma":[0.96492577,0.00021918448,0.034197204,0.000022627664,0.000010305238,0.00002229254,0.000010000103,0.000013678821,0.00057888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947315,0.0002162779,0.000019193503,0.0000674448,0.00015285425,0.000071104914],"domain_scores_gemma":[0.9990031,0.00048996496,0.0002194965,0.0001101415,0.00013980124,0.000037460857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075250905,0.0008146523,0.00059779757,0.00046067112,0.00033650306,0.0005248804,0.0005428693,0.0004659289,0.00047803472],"category_scores_gemma":[0.0016961528,0.00025447403,0.0004658272,0.00048683674,0.00073895295,0.0009405104,0.0010585543,0.00039746973,0.00017918713],"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.0002778195,0.00006426976,0.0013286425,0.00018785233,0.00011954247,0.00042935615,0.0003261975,0.82799774,0.0962821,0.031669226,0.0005025368,0.040814843],"study_design_scores_gemma":[0.00000926213,0.00019631983,0.00030656083,0.000008977807,0.000024996521,0.00018806754,0.000041130552,0.9834561,0.011204208,0.0040817694,0.00046663347,0.000016022783],"about_ca_topic_score_codex":0.00027980385,"about_ca_topic_score_gemma":0.00028282788,"teacher_disagreement_score":0.0008146523,"about_ca_system_score_codex":0.00033535334,"about_ca_system_score_gemma":0.00030748206,"threshold_uncertainty_score":0.003979683},"labels":[],"label_agreement":null},{"id":"W1964323598","doi":"10.1109/icecs.2013.6815551","title":"Joint secured and robust technique for OFDM systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Guelph","funders":"","keywords":"Orthogonal frequency-division multiplexing; Joint (building); Fading; Bit error rate; Transmission (telecommunications); Key (lock); Data transmission; Noise (video)","score_opus":0.023151092169835907,"score_gpt":0.21305831645600892,"score_spread":0.18990722428617302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964323598","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.019153604,0.0008472766,0.9750278,0.00016292288,0.00009504521,0.00003407921,0.000022122957,0.0003655494,0.004291642],"genre_scores_gemma":[0.6967103,0.0011122503,0.2950234,0.00011764908,0.000219541,0.00007899173,0.00006703685,0.00008552714,0.006585386],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944156,0.00010279622,0.00003851463,0.0001107406,0.00025674695,0.0000496095],"domain_scores_gemma":[0.99952924,0.0001306503,0.00010389454,0.00014647609,0.00007259283,0.000017173927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037227265,0.0004376883,0.00041665373,0.00042450707,0.00040342176,0.0005944694,0.00047082754,0.0005936731,0.0020757576],"category_scores_gemma":[0.0011778633,0.00020255001,0.00041442434,0.00034167024,0.0005210179,0.0011082011,0.0010438861,0.00089981547,0.0009680123],"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.0004507109,0.00008671842,0.00068621314,0.0003683117,0.00014946933,0.0007916359,0.00037550472,0.041050926,0.45739827,0.13910027,0.0023219064,0.35722008],"study_design_scores_gemma":[0.00007333659,0.0007633362,0.000925575,0.000093293886,0.00015451883,0.0036688668,0.00011253681,0.57772696,0.34236035,0.032625973,0.0413873,0.00010804007],"about_ca_topic_score_codex":0.00013616431,"about_ca_topic_score_gemma":0.0001468904,"teacher_disagreement_score":0.0020757576,"about_ca_system_score_codex":0.00024484668,"about_ca_system_score_gemma":0.00025573198,"threshold_uncertainty_score":0.00694412},"labels":[],"label_agreement":null},{"id":"W1964624053","doi":"10.1109/jcn.2009.6388407","title":"Build-in wiretap channel I with feedback and LDPC codes","year":2009,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":16,"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":"Low-density parity-check code; Computer science; Channel (broadcasting); Computer network; Randomness; Binary erasure channel; Information-theoretic security; Decoding methods; Theoretical computer science; Binary symmetric channel; Transmission (telecommunications); Parity bit; Computer security; Telecommunications; Algorithm; Channel capacity; Cryptography; Mathematics; Statistics","score_opus":0.00975721931005988,"score_gpt":0.23394871656403124,"score_spread":0.22419149725397136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964624053","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.049868137,0.00023695632,0.9399926,0.00036350286,0.00006316084,0.00011953403,0.0002572441,0.00084834546,0.008250441],"genre_scores_gemma":[0.86362606,0.00049303815,0.12815163,0.00015138861,0.000051489158,0.0002785464,0.00022626943,0.00007539003,0.006946339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990589,0.00026328617,0.000039051905,0.00017091025,0.0002916915,0.0001761854],"domain_scores_gemma":[0.99858415,0.0005909636,0.00022004063,0.00032380852,0.00019941351,0.00008174881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065876707,0.0007270846,0.0006137833,0.0004640051,0.0006765598,0.0008179706,0.0008160737,0.00088074384,0.0017616759],"category_scores_gemma":[0.0021004705,0.0003575926,0.00045607216,0.0006683128,0.0014220828,0.0015076918,0.0018752462,0.0013425542,0.00048645565],"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.0009528106,0.00016020577,0.0015128243,0.0004513116,0.00008626553,0.002186738,0.00083495356,0.25556764,0.09034973,0.5812987,0.006034401,0.06056439],"study_design_scores_gemma":[0.00008802956,0.00032053195,0.00021317859,0.000046854093,0.00005067044,0.00068564125,0.00007817775,0.859089,0.06778568,0.062554225,0.008987917,0.00010010364],"about_ca_topic_score_codex":0.0013646303,"about_ca_topic_score_gemma":0.00084254483,"teacher_disagreement_score":0.0017616759,"about_ca_system_score_codex":0.0006806578,"about_ca_system_score_gemma":0.0009731441,"threshold_uncertainty_score":0.0058934093},"labels":[],"label_agreement":null},{"id":"W1965602624","doi":"10.1109/tit.2004.836700","title":"Comments on \"Symmetric capacity and signal design for L-out-of-K symbol-synchronous CDMA Gaussian channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","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":"University of British Columbia","funders":"","keywords":"Code division multiple access; Maximization; Channel capacity; Gaussian; Mathematics; Algorithm; Upper and lower bounds; Equivalence (formal languages); Channel (broadcasting); Computer science; Discrete mathematics; Topology (electrical circuits); Applied mathematics; Telecommunications; Combinatorics; Mathematical optimization; Physics; Mathematical analysis","score_opus":0.025068937577472403,"score_gpt":0.2389123595092152,"score_spread":0.21384342193174277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965602624","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020646006,0.00631819,0.016757842,0.89682955,0.04208645,0.00011608579,0.001087377,0.0002777142,0.034462117],"genre_scores_gemma":[0.06387378,0.007284019,0.009659227,0.7997253,0.06717283,0.00032738346,0.0004631386,0.0003523065,0.05114206],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939653,0.0016927123,0.00054457085,0.00062472344,0.0026597262,0.00051293994],"domain_scores_gemma":[0.98303163,0.010457507,0.0008847359,0.00046706593,0.004900959,0.00025801972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061370707,0.0013679165,0.00088588387,0.0008533432,0.003060325,0.0022110245,0.0043108673,0.012177987,0.016443146],"category_scores_gemma":[0.023156395,0.00073795236,0.0011688097,0.0014393843,0.0040961034,0.0043952004,0.0016335517,0.015082435,0.0063574165],"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.00007054423,0.000015778736,0.00016085226,0.00017636604,0.000013686256,0.00031824945,0.00043131234,0.0008645577,0.00053066673,0.08866938,0.90100116,0.007747377],"study_design_scores_gemma":[0.000047812093,0.00007873565,0.0010390237,0.00033890517,0.000024328025,0.00029454,0.0003267471,0.0020286178,0.0018141706,0.08999746,0.9038908,0.00011891347],"about_ca_topic_score_codex":0.011991612,"about_ca_topic_score_gemma":0.008507534,"teacher_disagreement_score":0.016443146,"about_ca_system_score_codex":0.003566909,"about_ca_system_score_gemma":0.002546133,"threshold_uncertainty_score":0.055007756},"labels":[],"label_agreement":null},{"id":"W1966156506","doi":"10.1109/icuwb.2015.7324413","title":"A Survey on Cooperative Jamming Applied to Physical Layer Security","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Jamming; Eavesdropping; Physical layer; Computer science; Computer security; Computer network; Wireless; Data link layer; Wireless network; Transmitter; Physical security; Telecommunications; Channel (broadcasting)","score_opus":0.05375704040395283,"score_gpt":0.2991560980498104,"score_spread":0.2453990576458576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966156506","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061526904,0.85655576,0.10299527,0.0008215804,0.00096953934,0.00010468768,0.00009721229,0.00016917076,0.032134075],"genre_scores_gemma":[0.035653796,0.92585427,0.030634664,0.00050972705,0.0009927301,0.00009388239,0.0001506381,0.000048237183,0.0060620806],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889284,0.0002445233,0.0001336643,0.00015556623,0.0004978458,0.00007544978],"domain_scores_gemma":[0.9981494,0.0012078084,0.00011222868,0.000105152845,0.00038878573,0.000036732814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094585464,0.0010657894,0.001086453,0.0027723166,0.0005878942,0.0013908348,0.0009773029,0.0012711993,0.0031040583],"category_scores_gemma":[0.0023451352,0.0007061397,0.00067389087,0.004982064,0.0007208604,0.0022594796,0.0007971264,0.0013625304,0.0015499678],"study_design_candidate":"not_applicable","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.00011786439,0.00015238639,0.0013673989,0.011276309,0.00010155122,0.0003660028,0.0004113491,0.0070851697,0.0095990915,0.05029592,0.013081509,0.90614533],"study_design_scores_gemma":[0.000023123248,0.0007180758,0.0035659429,0.005949539,0.00026292773,0.0040266844,0.0005812563,0.017669322,0.0133288,0.03345451,0.92025983,0.00016008875],"about_ca_topic_score_codex":0.00073716755,"about_ca_topic_score_gemma":0.0006157168,"teacher_disagreement_score":0.0031040583,"about_ca_system_score_codex":0.0005915257,"about_ca_system_score_gemma":0.0009064867,"threshold_uncertainty_score":0.010384142},"labels":[],"label_agreement":null},{"id":"W1967802283","doi":"10.1109/ccece.2008.4564794","title":"Distributed video coding and transmission over wireless fading channel","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Codec; Computer science; Additive white Gaussian noise; Fading; Encoder; Decoding methods; Wireless; Coding (social sciences); Channel (broadcasting); Real-time computing; Computer network; Algorithm; Telecommunications; Mathematics; Statistics","score_opus":0.016514026246515982,"score_gpt":0.1970685830845539,"score_spread":0.18055455683803792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967802283","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.03043288,0.0016398351,0.96057177,0.00019962664,0.00010551244,0.00003615766,0.00007080946,0.00021440702,0.006729039],"genre_scores_gemma":[0.84653574,0.00254211,0.14172006,0.00010417432,0.00012964605,0.00007678784,0.00022094818,0.000040990242,0.00862953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995704,0.00007139452,0.000011242645,0.000059435093,0.00025492808,0.000032605996],"domain_scores_gemma":[0.99953353,0.0001591009,0.000046153356,0.00006908791,0.00018241181,0.000009704319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030022996,0.0002490235,0.00027320647,0.0003809028,0.0001641169,0.00041602823,0.00035846568,0.00042622126,0.0009042913],"category_scores_gemma":[0.0014472773,0.00010849351,0.00015164241,0.0005831011,0.00030836067,0.0004158492,0.000328284,0.00040984596,0.00024835108],"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.00036345416,0.000064289925,0.0020105727,0.00032545457,0.00006130131,0.00069265865,0.0002594859,0.36145267,0.115275376,0.15828125,0.0048817634,0.35633168],"study_design_scores_gemma":[0.000014645051,0.00006428361,0.00078540586,0.000025373733,0.000009745757,0.00038417234,0.000036848003,0.95952743,0.015630584,0.017719956,0.005786527,0.000015081847],"about_ca_topic_score_codex":0.0018560851,"about_ca_topic_score_gemma":0.0012914146,"teacher_disagreement_score":0.0018560851,"about_ca_system_score_codex":0.00047664126,"about_ca_system_score_gemma":0.0004115645,"threshold_uncertainty_score":0.0036905408},"labels":[],"label_agreement":null},{"id":"W1968110927","doi":"10.1109/itw.2013.6691223","title":"Secrecy &amp;amp; Rate Adaptation for secure HARQ protocols","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Institut National de la Recherche Scientifique","funders":"","keywords":"Secrecy; Computer science; Encoder; Hybrid automatic repeat request; Code rate; Coding (social sciences); Information leakage; Decoding methods; Confidentiality; Computer network; Uniqueness; Throughput; Theoretical computer science; Computer security; Algorithm; Mathematics; Telecommunications; Wireless; Telecommunications link; Statistics","score_opus":0.06070456167625498,"score_gpt":0.30665774725435524,"score_spread":0.24595318557810025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968110927","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.020612782,0.0008628603,0.97175545,0.00046908294,0.00007379587,0.00005940691,0.00004468972,0.00010281327,0.0060191737],"genre_scores_gemma":[0.9030159,0.0014301356,0.091190204,0.00016779944,0.0001678236,0.00017093756,0.0000605848,0.00008243706,0.0037141885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970772,0.0014611697,0.00009004697,0.00020528503,0.00094007095,0.0002262231],"domain_scores_gemma":[0.99223256,0.0054782955,0.00065801485,0.00082237576,0.0007000925,0.000108674845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004200943,0.00077398657,0.0007658048,0.00058374036,0.00087145244,0.0014853071,0.0008662992,0.0008657496,0.0022128082],"category_scores_gemma":[0.012690572,0.00038539933,0.0005047272,0.00092773663,0.0024887342,0.0022744646,0.0019468571,0.0019475792,0.00050902064],"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.00016534104,0.00004878159,0.0004976408,0.00017314099,0.000042092764,0.00039190328,0.00027906397,0.52856016,0.012825654,0.4270474,0.0013771466,0.028591726],"study_design_scores_gemma":[0.000016511132,0.00005695485,0.00012910314,0.000023741635,0.000009325108,0.0001822882,0.000038345475,0.92546725,0.0024204818,0.070445746,0.0011898621,0.00002044082],"about_ca_topic_score_codex":0.0006559914,"about_ca_topic_score_gemma":0.0003878627,"teacher_disagreement_score":0.004200943,"about_ca_system_score_codex":0.0011666751,"about_ca_system_score_gemma":0.0010749983,"threshold_uncertainty_score":0.022217035},"labels":[],"label_agreement":null},{"id":"W1968591616","doi":"10.1109/vtcspring.2013.6692528","title":"Eavesdropping-Resilient OFDM System Using CSI-Based Dynamic Subcarrier Allocation","year":2013,"lang":"en","type":"article","venue":"","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":"Western University","funders":"","keywords":"Subcarrier; Eavesdropping; Orthogonal frequency-division multiplexing; Computer science; Channel state information; Transmitter; Computer network; Channel (broadcasting); Multipath propagation; Wireless; Electronic engineering; Telecommunications; Engineering","score_opus":0.01021182074834219,"score_gpt":0.22869353688470898,"score_spread":0.2184817161363668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968591616","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.08367863,0.0006895789,0.9121409,0.00021457612,0.00013964334,0.000073981195,0.000040960538,0.0005671872,0.002454427],"genre_scores_gemma":[0.90049016,0.00036619988,0.09708709,0.00013109238,0.00010626608,0.00004623149,0.000041870524,0.000011261627,0.0017198162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951947,0.0001330878,0.000037662132,0.000106135994,0.00013790143,0.00006580688],"domain_scores_gemma":[0.9995024,0.0001322129,0.00010703477,0.00014581028,0.0000780854,0.000034480363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043184636,0.0006216772,0.00070542574,0.00032794676,0.0006960731,0.0005486089,0.0011607524,0.00067931606,0.00073499716],"category_scores_gemma":[0.0008084795,0.00021717863,0.00034664088,0.00030298033,0.00062822574,0.001137384,0.00094557717,0.00071714213,0.00036102635],"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.0013844251,0.00042933036,0.006193912,0.0006021194,0.00042127576,0.0036373867,0.00086566515,0.22191517,0.3039231,0.062097702,0.0046508242,0.393879],"study_design_scores_gemma":[0.00011290544,0.0007060455,0.0010543454,0.00003002913,0.00017595172,0.0021603114,0.000074547344,0.93387395,0.050140604,0.005823387,0.0057729245,0.00007505103],"about_ca_topic_score_codex":0.0004907865,"about_ca_topic_score_gemma":0.00057835464,"teacher_disagreement_score":0.0011607524,"about_ca_system_score_codex":0.00029344865,"about_ca_system_score_gemma":0.00035374248,"threshold_uncertainty_score":0.0024587512},"labels":[],"label_agreement":null},{"id":"W1968835711","doi":"10.1109/bsc.2010.5473007","title":"Rate-distortion function for Gauss-Markov source with side information at the decoder","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"Concordia University","funders":"","keywords":"Rate distortion; Gaussian; Distortion function; Rate–distortion theory; Markov chain; Distortion (music); Mathematics; Gauss; Parametric statistics; Distributed source coding; Markov process; Algorithm; Gaussian process; Coding (social sciences); Computer science; Variable-length code; Decoding methods; Statistics; Bandwidth (computing); Physics; Data compression; Telecommunications","score_opus":0.004943566326353383,"score_gpt":0.20020069436155094,"score_spread":0.19525712803519757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968835711","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.014791818,0.00081500836,0.9788239,0.00025623533,0.000034335837,0.00004166683,0.00018652366,0.00013759977,0.004912868],"genre_scores_gemma":[0.84346163,0.003003101,0.14409697,0.000205085,0.00008207559,0.0002803391,0.0005915871,0.00013162795,0.00814767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888724,0.0003080867,0.00007947555,0.00017269989,0.00041615812,0.00013633989],"domain_scores_gemma":[0.99754435,0.0014244295,0.00021345027,0.00027689774,0.0004978478,0.00004297624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023069081,0.0010467601,0.0009776484,0.00068764604,0.00037473024,0.0009866275,0.0010017119,0.0011384153,0.0025640214],"category_scores_gemma":[0.005970496,0.00028225328,0.00055235496,0.0011844125,0.0009636943,0.002096239,0.0010530931,0.0011138195,0.0007120771],"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.00033935858,0.00004909135,0.0008335547,0.00036224685,0.00006632292,0.00038053325,0.00022333751,0.43217045,0.025752846,0.48901978,0.0028445988,0.047957905],"study_design_scores_gemma":[0.00002095703,0.00008978422,0.00033878587,0.000036267455,0.000025749236,0.00059682206,0.000028648581,0.9085385,0.013216016,0.075504914,0.0015592854,0.00004432463],"about_ca_topic_score_codex":0.0015169097,"about_ca_topic_score_gemma":0.00090275804,"teacher_disagreement_score":0.0025640214,"about_ca_system_score_codex":0.00132516,"about_ca_system_score_gemma":0.0011716863,"threshold_uncertainty_score":0.012200236},"labels":[],"label_agreement":null},{"id":"W1971066773","doi":"10.1109/icc.2012.6364429","title":"Physical layer authentication in OFDM systems based on hypothesis testing of CFO estimates","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Western University","funders":"","keywords":"Carrier frequency offset; Computer science; Transmitter; Wireless; Physical layer; Fading; Multipath propagation; Orthogonal frequency-division multiplexing; Computer network; Authentication (law); Transmission (telecommunications); Wireless security; Electronic engineering; Channel (broadcasting); Frequency offset; Computer security; Telecommunications; Wireless network; Engineering","score_opus":0.05102343942521926,"score_gpt":0.27067688458184863,"score_spread":0.21965344515662938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971066773","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.18323858,0.00034361574,0.8143743,0.00030207864,0.00006853461,0.000104195606,0.00007274942,0.0002683684,0.0012275715],"genre_scores_gemma":[0.95995134,0.00013046074,0.039434653,0.00004980161,0.000038736962,0.000079929894,0.000043955046,0.0000075038038,0.00026356385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959508,0.0018627002,0.00024769016,0.00069904176,0.00087986095,0.00035993505],"domain_scores_gemma":[0.9542848,0.03995321,0.003031477,0.0013116578,0.0011316615,0.00028722268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006539023,0.0005573776,0.00090109254,0.0010776011,0.0006699095,0.0010685745,0.00075300573,0.0013551216,0.0010353018],"category_scores_gemma":[0.044099465,0.0002603512,0.00048211616,0.00055519305,0.0022326324,0.001574419,0.0008722641,0.0008184079,0.00020410387],"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.003452984,0.00045288715,0.059023857,0.000573351,0.00045432054,0.0017450859,0.0009534354,0.477586,0.05194756,0.06483074,0.0012868586,0.33769286],"study_design_scores_gemma":[0.00006722895,0.00055087474,0.0055977986,0.00003035108,0.0000550251,0.00033340292,0.00009197709,0.971648,0.013015508,0.0082943,0.00027355755,0.000042081196],"about_ca_topic_score_codex":0.0009260261,"about_ca_topic_score_gemma":0.0005839073,"teacher_disagreement_score":0.006539023,"about_ca_system_score_codex":0.0006628171,"about_ca_system_score_gemma":0.000954647,"threshold_uncertainty_score":0.03458202},"labels":[],"label_agreement":null},{"id":"W1973188630","doi":"10.1109/glocom.2012.6503282","title":"Secure MISO cognitive radio system with perfect and imperfect CSI","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":26,"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 British Columbia","funders":"","keywords":"Cognitive radio; Computer science; Secrecy; Context (archaeology); Interference (communication); Imperfect; Computer network; Convex optimization; Channel state information; Communications system; Channel (broadcasting); Mathematical optimization; Wireless; Telecommunications; Computer security; Regular polygon; Mathematics","score_opus":0.007255286182429953,"score_gpt":0.21075554599317686,"score_spread":0.2035002598107469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973188630","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.2514759,0.00085910416,0.730075,0.0006443838,0.00012371411,0.000111472604,0.00022854573,0.0003534004,0.016128445],"genre_scores_gemma":[0.9901973,0.000250683,0.007548401,0.00004283109,0.000017149527,0.000036907957,0.000030332076,0.0000058540845,0.0018705433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991371,0.0002255867,0.000040181956,0.00014568612,0.0002534978,0.00019800145],"domain_scores_gemma":[0.9990152,0.00051252055,0.00021930269,0.000104092054,0.0001003635,0.000048471604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093550264,0.0011636534,0.0010578295,0.00034909713,0.0004888426,0.001545027,0.00089692307,0.00093020266,0.0009778868],"category_scores_gemma":[0.0019659146,0.00032589815,0.0004759743,0.00057276787,0.0012960809,0.0009924538,0.0010668708,0.00074913225,0.00029470638],"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.00055139407,0.000089650384,0.0012109501,0.00022271303,0.000076600474,0.00091214554,0.00021863314,0.9158668,0.006886815,0.057990033,0.0008379942,0.01513629],"study_design_scores_gemma":[0.000032371652,0.000086630454,0.00022376586,0.00000950192,0.000028331673,0.00010386785,0.00004455574,0.9907059,0.0015591839,0.0068442877,0.00034692258,0.000014594943],"about_ca_topic_score_codex":0.0032970714,"about_ca_topic_score_gemma":0.00301906,"teacher_disagreement_score":0.0032970714,"about_ca_system_score_codex":0.00085143984,"about_ca_system_score_gemma":0.0010426517,"threshold_uncertainty_score":0.006555736},"labels":[],"label_agreement":null},{"id":"W1973265942","doi":"10.1109/vetecs.2012.6240106","title":"Transmission of Discrete Constellations under Strong Interference","year":2012,"lang":"en","type":"article","venue":"","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":"University of Waterloo","funders":"","keywords":"Interference (communication); Transmission (telecommunications); Co-channel interference; Zero-forcing precoding; Channel (broadcasting); Constellation; Adjacent-channel interference; Computer science; Gaussian; Topology (electrical circuits); Telecommunications; Electronic engineering; Physics; Statistical physics; Mathematics; Precoding; MIMO; Engineering; Quantum mechanics; Combinatorics","score_opus":0.028700300356241625,"score_gpt":0.2774744296408821,"score_spread":0.24877412928464046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973265942","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.345701,0.0014940118,0.60362077,0.0012341148,0.00019841777,0.00006807679,0.00027696413,0.00029317784,0.04711338],"genre_scores_gemma":[0.98698074,0.00046694567,0.01089333,0.000049639006,0.00006729781,0.000026844817,0.00006530825,0.000013868299,0.0014359928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989675,0.0004561757,0.00002876411,0.00007314158,0.0002670139,0.00020732037],"domain_scores_gemma":[0.995146,0.0035362232,0.0003681074,0.00049689575,0.00032420945,0.00012855588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013525467,0.0006513254,0.0007057119,0.0005724811,0.00059527316,0.0013377717,0.00054601073,0.00072631624,0.0022850689],"category_scores_gemma":[0.0066825217,0.0002625876,0.00036670646,0.0010006564,0.0015422044,0.001295356,0.0014921955,0.00090707716,0.00035041018],"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.0007247434,0.00006207125,0.0014117346,0.00029902483,0.00006999835,0.0014002889,0.00035766052,0.59818953,0.020578206,0.34406286,0.0016892866,0.031154646],"study_design_scores_gemma":[0.00003744551,0.00011523805,0.00041422344,0.000028881224,0.000020618605,0.0002858612,0.00009955015,0.9354272,0.004156163,0.05842728,0.0009603441,0.000027203221],"about_ca_topic_score_codex":0.00056799955,"about_ca_topic_score_gemma":0.00035434752,"teacher_disagreement_score":0.0022850689,"about_ca_system_score_codex":0.00077021396,"about_ca_system_score_gemma":0.00036823595,"threshold_uncertainty_score":0.0076442957},"labels":[],"label_agreement":null},{"id":"W1974240071","doi":"10.1109/glocomw.2014.7063485","title":"Securing visible light communications via friendly jamming","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":104,"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 British Columbia","funders":"","keywords":"Eavesdropping; Jamming; Computer science; Visible light communication; Beamforming; Secrecy; Channel (broadcasting); Wireless; Computer network; Channel state information; Transmitter; Interference (communication); Telecommunications; Computer security; Engineering; Light-emitting diode; Electrical engineering","score_opus":0.00967349987504123,"score_gpt":0.23814003765069,"score_spread":0.22846653777564876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974240071","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.03345984,0.00017644886,0.9628923,0.000094823234,0.000014764795,0.000020589032,0.000014833415,0.00013187208,0.0031944725],"genre_scores_gemma":[0.9068276,0.00069791183,0.08949778,0.000083724706,0.00004601792,0.00005630995,0.00002572296,0.000028858562,0.0027361093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936694,0.00021841878,0.00001733414,0.00006484684,0.00025655937,0.000075752934],"domain_scores_gemma":[0.99938273,0.0003302562,0.00012802854,0.00006832651,0.00007348317,0.000017099244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065861735,0.0006372662,0.00038986187,0.00033820132,0.00029655336,0.00078706123,0.00035642026,0.0006831146,0.00061104377],"category_scores_gemma":[0.0015813336,0.00029705223,0.00042112987,0.00040964244,0.00086300203,0.0010525053,0.0011654022,0.00055458903,0.0003345515],"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.00024745255,0.000080344355,0.0010607974,0.00019049791,0.000074116644,0.0004266298,0.00022684428,0.71345365,0.13879383,0.07622694,0.00075890654,0.068459965],"study_design_scores_gemma":[0.000014116754,0.00018536093,0.00027514723,0.000017003455,0.000019547464,0.00015818558,0.00004462978,0.9597481,0.02652263,0.011456112,0.0015357826,0.000023432542],"about_ca_topic_score_codex":0.00033547948,"about_ca_topic_score_gemma":0.00036121468,"teacher_disagreement_score":0.00078706123,"about_ca_system_score_codex":0.0002517776,"about_ca_system_score_gemma":0.00038843512,"threshold_uncertainty_score":0.0034831166},"labels":[],"label_agreement":null},{"id":"W1974493046","doi":"10.1109/tit.2013.2276612","title":"Memoryless Multiple Access Channel With Asymmetric Noisy State Information at the Encoders","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"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":"Encoder; Channel state information; Computer science; Decoding methods; Converse; Algorithm; Generalization; Channel (broadcasting); Mathematics; Wireless; Telecommunications","score_opus":0.008651747412178994,"score_gpt":0.20909631869095172,"score_spread":0.20044457127877272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974493046","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.064117566,0.00084353966,0.9267552,0.000961625,0.00010963502,0.00006693423,0.00040019763,0.00020421352,0.0065411762],"genre_scores_gemma":[0.9514997,0.0007034637,0.04393427,0.00016703748,0.00014209056,0.0001571234,0.0001377667,0.000024900251,0.0032335715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997408,0.0010091163,0.00015800762,0.00052584644,0.00057708606,0.00032187995],"domain_scores_gemma":[0.9897508,0.0063077467,0.0014886148,0.0013582084,0.00094579713,0.00014884367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025022703,0.001425875,0.001782423,0.00076707604,0.0009468019,0.0020902646,0.0020262694,0.0018710634,0.0017591353],"category_scores_gemma":[0.013350336,0.00065697334,0.0006021931,0.0013348853,0.002248475,0.003581444,0.0018243296,0.002066926,0.00047833647],"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.00077340635,0.00007266489,0.0010486486,0.0004592413,0.00010030997,0.0012538795,0.000498793,0.42643106,0.00775636,0.5340924,0.0019794907,0.025533807],"study_design_scores_gemma":[0.000048471502,0.000092171365,0.00020398702,0.000040965282,0.000049884067,0.00025990157,0.000066225024,0.9055446,0.0046891943,0.087783955,0.0011748532,0.000045952853],"about_ca_topic_score_codex":0.0017059264,"about_ca_topic_score_gemma":0.0011056077,"teacher_disagreement_score":0.0025022703,"about_ca_system_score_codex":0.0012427001,"about_ca_system_score_gemma":0.0015275831,"threshold_uncertainty_score":0.013233483},"labels":[],"label_agreement":null},{"id":"W1978595443","doi":"10.1109/tit.2014.2346780","title":"On Optimal Zero-Delay Coding of Vector Markov Sources","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov process; Bounded function; Markov chain; Quantization (signal processing); Vector quantization; Encoder; Markov decision process; Rate–distortion theory; Convex optimization; Markov model","score_opus":0.006195900892584226,"score_gpt":0.20909800651598354,"score_spread":0.2029021056233993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978595443","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.046771865,0.0011507139,0.9439037,0.0005976077,0.00006778005,0.000040375082,0.00012948002,0.00008049102,0.007257978],"genre_scores_gemma":[0.9346917,0.0020359089,0.0567107,0.00013966099,0.0001070134,0.000107077714,0.0002205628,0.000056617293,0.005930757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931836,0.0002398367,0.000032339132,0.00009954716,0.00017543047,0.000134548],"domain_scores_gemma":[0.99685514,0.0024672998,0.00025193204,0.00010394597,0.00025641953,0.000065166256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013248464,0.0007852812,0.0007967664,0.00056861463,0.0004051566,0.001100603,0.0007748075,0.000757263,0.0018996486],"category_scores_gemma":[0.004981476,0.00043405063,0.0004133636,0.0008859978,0.0018586541,0.001681386,0.0014692597,0.0013156502,0.00018942801],"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.00014033464,0.000024645746,0.00023190712,0.00007689675,0.00001314797,0.00009465157,0.00009633687,0.6635063,0.002419366,0.31618285,0.0007736122,0.01643996],"study_design_scores_gemma":[0.000013022505,0.000025950856,0.000045040575,0.000015196666,0.0000032086725,0.000015408048,0.00001312513,0.91719425,0.00072187843,0.08161592,0.00032650694,0.0000105185045],"about_ca_topic_score_codex":0.0052504595,"about_ca_topic_score_gemma":0.002779792,"teacher_disagreement_score":0.0052504595,"about_ca_system_score_codex":0.001865267,"about_ca_system_score_gemma":0.0017155152,"threshold_uncertainty_score":0.013533533},"labels":[],"label_agreement":null},{"id":"W1980117155","doi":"10.1109/isit.2013.6620473","title":"On Orthogonal signalling in Gaussian Multiple Access Channel with peak constraints","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Waterloo","funders":"","keywords":"Gaussian; Boundary (topology); Channel (broadcasting); Interference (communication); Mathematics; Power (physics); Computer science; Code (set theory); Hadamard transform; Algorithm; Topology (electrical circuits); Combinatorics; Mathematical optimization; Telecommunications; Mathematical analysis; Physics","score_opus":0.01911283640359498,"score_gpt":0.24077445963786473,"score_spread":0.22166162323426974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980117155","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.084271125,0.0055434373,0.8540753,0.0015830445,0.0004393099,0.000079286474,0.00018233758,0.00015499188,0.05367121],"genre_scores_gemma":[0.91399074,0.010525999,0.062227003,0.00075715303,0.0010614804,0.00013178997,0.00014382807,0.00006590401,0.011096078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990544,0.00037663302,0.000031355674,0.000096267955,0.00029768163,0.00014380057],"domain_scores_gemma":[0.99733883,0.0019571614,0.00015143398,0.0001525917,0.00034046726,0.000059391314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012730312,0.0008392472,0.0007138477,0.00077219296,0.0005763601,0.0011361596,0.0005930583,0.0010028792,0.0015847085],"category_scores_gemma":[0.003961909,0.00031227982,0.00042174052,0.0012391425,0.0022123272,0.0015448285,0.0013421605,0.0015815498,0.0004523085],"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.00029999772,0.000053702435,0.0007083624,0.0003161609,0.0000374405,0.0007244007,0.0004623986,0.19109368,0.010108841,0.7590331,0.004769605,0.032392308],"study_design_scores_gemma":[0.000026814103,0.00019686483,0.0004926526,0.00007224647,0.00002555498,0.00040408722,0.0001111421,0.7193066,0.004351041,0.26962003,0.0053238557,0.000069148904],"about_ca_topic_score_codex":0.0017050366,"about_ca_topic_score_gemma":0.0008994996,"teacher_disagreement_score":0.0017050366,"about_ca_system_score_codex":0.0009014029,"about_ca_system_score_gemma":0.000757272,"threshold_uncertainty_score":0.0067325234},"labels":[],"label_agreement":null},{"id":"W1981071932","doi":"10.1109/pimrc.2011.6139680","title":"Secure hybrid digital-analog Wyner-Ziv coding","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":10,"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 Toronto","funders":"","keywords":"Coding (social sciences); Gaussian; Computer science; Channel code; Distortion (music); Algorithm; Channel (broadcasting); Decoding methods; Theoretical computer science; Mathematics; Telecommunications; Bandwidth (computing); Physics; Statistics","score_opus":0.028377709674025853,"score_gpt":0.20545629400565377,"score_spread":0.1770785843316279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981071932","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.02082987,0.00023387432,0.9753705,0.00014001626,0.000025102216,0.00003321567,0.000062756044,0.00007171533,0.0032329322],"genre_scores_gemma":[0.86148804,0.0005010469,0.13274638,0.00010839953,0.000044262528,0.000099020945,0.00014932608,0.00002120218,0.0048423284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921644,0.00019962637,0.00005059601,0.00010302546,0.00035754414,0.00007262656],"domain_scores_gemma":[0.99929273,0.00032296343,0.00011175974,0.00014980986,0.00010210339,0.000020639038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080768636,0.0005372528,0.00062902406,0.00036801278,0.0003106203,0.0008605762,0.0007368213,0.0007157414,0.00146266],"category_scores_gemma":[0.0015838847,0.0001844939,0.00037707618,0.00060102163,0.00078565435,0.0014311513,0.0013957549,0.00070862024,0.0002814265],"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.00035600743,0.000043737055,0.0005704069,0.00021082678,0.00006250351,0.00027602143,0.00017670097,0.34969485,0.031416,0.5284741,0.0011188706,0.08759996],"study_design_scores_gemma":[0.000036932848,0.00009153101,0.0001227861,0.00002455755,0.000021741518,0.00016615906,0.000026015185,0.9331977,0.012749168,0.05173871,0.0018036354,0.00002100831],"about_ca_topic_score_codex":0.00079417735,"about_ca_topic_score_gemma":0.00083285285,"teacher_disagreement_score":0.00146266,"about_ca_system_score_codex":0.0006698243,"about_ca_system_score_gemma":0.0006683758,"threshold_uncertainty_score":0.004893124},"labels":[],"label_agreement":null},{"id":"W1981346363","doi":"10.1109/cwit.2013.6621593","title":"Low and high-delay source-channel coding with bandwidth expansion and correlated interference","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Encoder; Additive white Gaussian noise; Shannon–Hartley theorem; Computer science; Algorithm; Upper and lower bounds; Transmitter; Gaussian; Decoding methods; Parametric statistics; Gaussian noise; Topology (electrical circuits); Mathematics; Channel (broadcasting); Telecommunications; Physics; Statistics","score_opus":0.007199253338597699,"score_gpt":0.18732005357667295,"score_spread":0.18012080023807525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981346363","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.103224985,0.00033776596,0.8916747,0.0001891719,0.000021401758,0.000034789173,0.000049873033,0.00008983107,0.004377453],"genre_scores_gemma":[0.9608804,0.00020973948,0.0375053,0.000029509187,0.000014409361,0.000038360886,0.000028555716,0.000011511735,0.0012822768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896,0.0004021909,0.000036151265,0.00011172422,0.00035602727,0.00013373578],"domain_scores_gemma":[0.9957623,0.0031055324,0.00048457307,0.000254709,0.0003041539,0.0000888517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015620467,0.00087585906,0.0006920198,0.00040072604,0.0003544414,0.00092798384,0.00096663187,0.00080614473,0.00086675864],"category_scores_gemma":[0.0048155286,0.00028844964,0.00043822225,0.0007900459,0.0019692911,0.0015462163,0.001342966,0.0010112061,0.0001689605],"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.00013560748,0.000033734425,0.00041830796,0.00008572819,0.000026375295,0.00015233141,0.000085295236,0.8862793,0.0064538284,0.09944977,0.00014233719,0.006737404],"study_design_scores_gemma":[0.000011627045,0.000045323195,0.00008666866,0.0000063623274,0.000008377466,0.000049424576,0.000013813464,0.98665476,0.002769528,0.0102204,0.00012292224,0.000010809873],"about_ca_topic_score_codex":0.0014829647,"about_ca_topic_score_gemma":0.0012314538,"teacher_disagreement_score":0.0015620467,"about_ca_system_score_codex":0.0013599175,"about_ca_system_score_gemma":0.0009597679,"threshold_uncertainty_score":0.0098670125},"labels":[],"label_agreement":null},{"id":"W1983265049","doi":"10.1109/ita.2010.5454072","title":"On interactive encoding and decoding for distributed lossless coding of individual sequences","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Waterloo","funders":"","keywords":"Decoding methods; Encoder; Lossless compression; Computer science; Joint (building); Coding (social sciences); Encoding (memory); Adaptive coding; Algorithm; Theoretical computer science; Data compression; Mathematics; Artificial intelligence; Statistics","score_opus":0.019982184301040533,"score_gpt":0.2847523344730739,"score_spread":0.26477015017203337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983265049","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.010843992,0.0002683183,0.98507,0.00012112834,0.000020655198,0.000040222516,0.000020620753,0.00011131081,0.0035036397],"genre_scores_gemma":[0.6423968,0.0012455957,0.34793678,0.00025575727,0.00014249774,0.00032550827,0.00019660017,0.00012192547,0.0073784366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754035,0.0008524073,0.00011613458,0.0003022454,0.0009157685,0.00027304268],"domain_scores_gemma":[0.9944518,0.004064967,0.0003459914,0.00069632515,0.00033445895,0.000106354455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002099723,0.0012811152,0.0010590496,0.0006405468,0.0007059301,0.0013677321,0.001724326,0.0012494809,0.0017955543],"category_scores_gemma":[0.0065618805,0.00049617596,0.0006487812,0.0010235509,0.0029262588,0.0030001272,0.0025512024,0.0022924938,0.0005224703],"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.0004793991,0.00009279309,0.00036140176,0.00016609782,0.000053827116,0.0003653729,0.00047589073,0.5409679,0.016881168,0.3756742,0.0012476395,0.06323427],"study_design_scores_gemma":[0.000031516898,0.00012330589,0.00008372618,0.000026140391,0.000025552972,0.00017828927,0.00003412316,0.8901667,0.007871486,0.09957133,0.0018595256,0.000028306853],"about_ca_topic_score_codex":0.0015988665,"about_ca_topic_score_gemma":0.0019464216,"teacher_disagreement_score":0.002099723,"about_ca_system_score_codex":0.0017580807,"about_ca_system_score_gemma":0.0012082958,"threshold_uncertainty_score":0.012755871},"labels":[],"label_agreement":null},{"id":"W1983734652","doi":"10.1109/glocomw.2011.6162578","title":"A remark on secret-key generation over correlated fading channels","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"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 Toronto","funders":"","keywords":"Fading; Channel state information; Transmitter; Upper and lower bounds; Channel (broadcasting); Computer science; Key (lock); Coding (social sciences); Joint (building); Telecommunications; Channel capacity; Decoding methods; Algorithm; Channel code; Sequence (biology); Topology (electrical circuits); Mathematics; Wireless; Statistics; Computer security; Engineering; Combinatorics","score_opus":0.04986634966941468,"score_gpt":0.23611237642492383,"score_spread":0.18624602675550916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983734652","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.012336307,0.0023655347,0.9472414,0.006643527,0.00052147434,0.00009317804,0.00038307352,0.00031166224,0.030103862],"genre_scores_gemma":[0.80524844,0.010321731,0.16005756,0.0048478516,0.002542344,0.0008235105,0.00044956637,0.0005504002,0.0151586775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99102914,0.0038091769,0.00033456768,0.0012265539,0.0024591032,0.0011414002],"domain_scores_gemma":[0.95803326,0.034069102,0.0014874727,0.0039564855,0.0018699873,0.00058374775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010907151,0.0020762624,0.0023018003,0.002066283,0.0030333358,0.004245565,0.0033827575,0.0043809093,0.0076243444],"category_scores_gemma":[0.032860413,0.0008464346,0.0024737031,0.003418491,0.008750759,0.012937329,0.0064046676,0.010116315,0.0013516705],"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.000069370355,0.000021058248,0.00016710277,0.00019460554,0.000025338479,0.00021707291,0.00023549877,0.023386477,0.0008531841,0.9682067,0.0029150855,0.003708543],"study_design_scores_gemma":[0.000045460878,0.00009301495,0.00015408505,0.00013199555,0.00003743392,0.00024713154,0.00007028466,0.15126102,0.0015324702,0.8402337,0.00612433,0.00006902284],"about_ca_topic_score_codex":0.0028360768,"about_ca_topic_score_gemma":0.0011151423,"teacher_disagreement_score":0.010907151,"about_ca_system_score_codex":0.002868383,"about_ca_system_score_gemma":0.0018412495,"threshold_uncertainty_score":0.05768323},"labels":[],"label_agreement":null},{"id":"W1986161523","doi":"10.1109/tit.2007.909092","title":"Joint Source–Channel Coding Error Exponent for Discrete Communication Systems With Markovian Memory","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"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":"Exponent; Channel (broadcasting); Ergodic theory; Upper and lower bounds; Source code; Discrete mathematics; Coding (social sciences); Algorithm; Markov process; Computer science; Mathematics; Statistics; Pure mathematics; Telecommunications; Mathematical analysis","score_opus":0.015357756195373173,"score_gpt":0.23069056212629213,"score_spread":0.21533280593091897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986161523","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.31216556,0.0029088934,0.6640074,0.0022592056,0.0002325056,0.0001062853,0.0002994687,0.00033151926,0.017689204],"genre_scores_gemma":[0.97547805,0.0011575936,0.019184833,0.00016618063,0.0001210836,0.00009735271,0.000109300236,0.000083775114,0.003601831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983424,0.00048037147,0.00008379237,0.00018943074,0.0005597712,0.00034424628],"domain_scores_gemma":[0.96042025,0.03399714,0.0023322369,0.0012293394,0.0017109064,0.00031018473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004573847,0.0012972511,0.0010951223,0.0012279475,0.00068473455,0.0016873024,0.0013425888,0.0013292903,0.0024756007],"category_scores_gemma":[0.035187416,0.0005239999,0.0005151623,0.00094950746,0.0026900545,0.0037080843,0.002354609,0.0021637115,0.00030600815],"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.00030710912,0.000072549636,0.0023174617,0.0002213839,0.00007254742,0.0004787368,0.0005025951,0.70047534,0.0056635593,0.27647257,0.0012256659,0.012190516],"study_design_scores_gemma":[0.000011861923,0.00003748102,0.00037190638,0.000039599552,0.000018978106,0.00009092167,0.000054661556,0.95273393,0.0017205216,0.04460933,0.00028190608,0.000028907982],"about_ca_topic_score_codex":0.0027946199,"about_ca_topic_score_gemma":0.0019279334,"teacher_disagreement_score":0.004573847,"about_ca_system_score_codex":0.002683843,"about_ca_system_score_gemma":0.0016896381,"threshold_uncertainty_score":0.024189115},"labels":[],"label_agreement":null},{"id":"W1987043386","doi":"10.1109/cwit.2013.6621594","title":"An achievability proof for the lossy coding of Markov sources with feed-forward","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Lossy compression; Ergodic theory; Markov chain; Source code; Markov process; Computer science; Algorithm; Shannon–Fano coding; Variable-length code; Theoretical computer science; Coding (social sciences); Binary number; Mathematics; Discrete mathematics; Decoding methods; Statistics; Arithmetic","score_opus":0.010488801195776212,"score_gpt":0.23653975564518528,"score_spread":0.22605095444940906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987043386","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.0061109173,0.00085801695,0.985422,0.0009558777,0.00011502359,0.000071315706,0.00028604252,0.00019232467,0.005988457],"genre_scores_gemma":[0.6643244,0.006220985,0.3158088,0.0019409754,0.0009690861,0.000954323,0.0010129509,0.00026607077,0.008502414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709094,0.0007497039,0.00016577441,0.00031565686,0.001264968,0.0004129371],"domain_scores_gemma":[0.9854748,0.011528505,0.0006457562,0.0009792815,0.0011124952,0.00025910517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041556517,0.0032045755,0.0017920356,0.0016162866,0.0011783049,0.0022211042,0.002344506,0.002869964,0.004465723],"category_scores_gemma":[0.017062599,0.0013884129,0.0017995336,0.0019350492,0.0033069898,0.0041813464,0.0056647,0.0069914465,0.0011016567],"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.00023806524,0.00011830554,0.00030488407,0.0007921017,0.00018271817,0.0005283935,0.0006855595,0.16330624,0.013512464,0.77129287,0.007900941,0.041137498],"study_design_scores_gemma":[0.00010480165,0.00018393832,0.00020166168,0.0002145916,0.0001166276,0.0006578568,0.00008010493,0.44739133,0.01324396,0.531029,0.0066615064,0.00011470268],"about_ca_topic_score_codex":0.0011289137,"about_ca_topic_score_gemma":0.0007787417,"teacher_disagreement_score":0.004465723,"about_ca_system_score_codex":0.0022537273,"about_ca_system_score_gemma":0.0024628465,"threshold_uncertainty_score":0.021977425},"labels":[],"label_agreement":null},{"id":"W1989889906","doi":"10.1109/tcomm.2014.2360852","title":"Source-Channel Coding for Fading Channels With Correlated Interference","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security 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":"Queen's University","funders":"","keywords":"Fading; Computer science; Channel state information; Transmitter; Channel (broadcasting); Upper and lower bounds; Algorithm; Decoding methods; Topology (electrical circuits); Electronic engineering; Telecommunications; Mathematics; Wireless; Engineering","score_opus":0.03337097799345879,"score_gpt":0.25657922920778325,"score_spread":0.22320825121432447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989889906","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.01856611,0.00043161216,0.9784759,0.00013341973,0.000023447365,0.000026251615,0.000070831855,0.00008041034,0.0021920432],"genre_scores_gemma":[0.89693636,0.0008734706,0.09984023,0.000081816564,0.000041213145,0.00010651909,0.00014918708,0.000031410385,0.0019398882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990477,0.00030875512,0.00003693597,0.000080353544,0.0003951871,0.00013114397],"domain_scores_gemma":[0.99688536,0.0023023002,0.00024162717,0.00020025522,0.000325597,0.000044837758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001455934,0.0010520096,0.0008588265,0.0005170568,0.00034173083,0.0009072804,0.0009881468,0.0008415723,0.0013081223],"category_scores_gemma":[0.0052682087,0.00031052998,0.00044171754,0.0010432698,0.0011931884,0.0012442464,0.0014436906,0.0011657553,0.00028317],"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.000046497586,0.000009267821,0.00016392424,0.000063066094,0.000020247513,0.00007485221,0.000057335103,0.93498826,0.0018195818,0.0552585,0.00025960398,0.007238819],"study_design_scores_gemma":[0.0000056988297,0.000011020235,0.000036116253,0.000007279841,0.000005172179,0.000021383281,0.000006081624,0.9882742,0.00084964925,0.010587053,0.000191057,0.0000053452495],"about_ca_topic_score_codex":0.0031660993,"about_ca_topic_score_gemma":0.0023540815,"teacher_disagreement_score":0.0031660993,"about_ca_system_score_codex":0.0012568622,"about_ca_system_score_gemma":0.0013102227,"threshold_uncertainty_score":0.009119272},"labels":[],"label_agreement":null},{"id":"W1992678747","doi":"10.1109/isit.2005.1523570","title":"On the joint source-channel coding error exponent for systems with memory","year":2005,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"Queen's University","funders":"","keywords":"Mathematics; Upper and lower bounds; Ergodic theory; Exponent; Entropy (arrow of time); Markov chain; Binary symmetric channel; Markov process; Random variable; Discrete mathematics; Combinatorics; Channel code; Statistical physics; Decoding methods; Statistics; Mathematical analysis; Physics","score_opus":0.040868103186476566,"score_gpt":0.23316407735632416,"score_spread":0.1922959741698476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992678747","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.08551327,0.003404649,0.89136213,0.000854065,0.00019133289,0.000045255674,0.00016048663,0.00035866996,0.018110227],"genre_scores_gemma":[0.95299166,0.0022253979,0.041053962,0.00025194426,0.0002295539,0.00012307553,0.00013058026,0.000108191976,0.002885535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986082,0.00026288297,0.00008082085,0.00016619683,0.00061069854,0.00027121068],"domain_scores_gemma":[0.9805222,0.015287629,0.0010018087,0.0014504214,0.0015245167,0.0002132626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002796643,0.0014066182,0.0009650422,0.0014809199,0.00063987315,0.0015848405,0.0010001023,0.00089952437,0.0024644695],"category_scores_gemma":[0.025829809,0.0003941044,0.0004427951,0.0012179246,0.0022764597,0.0038482465,0.0026577623,0.0019926026,0.0006313479],"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.00024351395,0.000058388916,0.002393602,0.00031149946,0.00007248429,0.0004706306,0.0005943127,0.5021933,0.013307617,0.42529413,0.0036981762,0.051362358],"study_design_scores_gemma":[0.000007798317,0.00006249834,0.0006003429,0.00007617004,0.000027125408,0.00025536615,0.00006645304,0.86827815,0.007913237,0.12120673,0.0014657419,0.000040334457],"about_ca_topic_score_codex":0.0010691477,"about_ca_topic_score_gemma":0.0009198898,"teacher_disagreement_score":0.002796643,"about_ca_system_score_codex":0.0014560277,"about_ca_system_score_gemma":0.000782694,"threshold_uncertainty_score":0.014790297},"labels":[],"label_agreement":null},{"id":"W1993509434","doi":"10.1109/lcomm.2015.2398866","title":"Variable-Length Feedback Codes Under a Strict Delay Constraint","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Constraint (computer-aided design); Coding (social sciences); Upper and lower bounds; Channel (broadcasting); Code rate; Channel code; Variable (mathematics); Computer science; Algorithm; Code (set theory); Mathematics; Telecommunications; Applied mathematics; Statistics; Mathematical analysis","score_opus":0.05252369745064049,"score_gpt":0.27242461534703744,"score_spread":0.21990091789639693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993509434","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.3312328,0.002873509,0.6490822,0.0011536689,0.00016619131,0.00010242401,0.0003194056,0.00034463758,0.014725201],"genre_scores_gemma":[0.97735924,0.00070842874,0.018855073,0.00011249505,0.000056248893,0.00008062263,0.000068914036,0.00003404303,0.002724995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990213,0.00026142807,0.00002998584,0.00013709045,0.00027290694,0.0002772379],"domain_scores_gemma":[0.9930855,0.004620166,0.0010767074,0.00028591705,0.0007169265,0.0002147633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012484768,0.0010631426,0.00076646515,0.00062522956,0.00059520337,0.00093099085,0.00127535,0.0011491878,0.00096261513],"category_scores_gemma":[0.009962129,0.00035778337,0.00033295134,0.000896997,0.0015086994,0.0018640272,0.00088446855,0.0010252954,0.00021063448],"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.00015180756,0.000032559885,0.0008048392,0.00011949447,0.000024051442,0.00022511832,0.00013860264,0.85387456,0.0075096968,0.12805052,0.00080417166,0.008264618],"study_design_scores_gemma":[0.000024571604,0.000054202716,0.00013068569,0.000016385506,0.000007944161,0.00006556147,0.000022814398,0.97778875,0.0017086087,0.019780511,0.00038544246,0.000014470133],"about_ca_topic_score_codex":0.005496336,"about_ca_topic_score_gemma":0.0035366993,"teacher_disagreement_score":0.005496336,"about_ca_system_score_codex":0.0021249854,"about_ca_system_score_gemma":0.0016550369,"threshold_uncertainty_score":0.015417874},"labels":[],"label_agreement":null},{"id":"W1993695587","doi":"10.1109/tifs.2013.2293113","title":"Cooperative Key Agreement for Wireless Networking: Key Rates and Practical Protocol Design","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":35,"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":"Key-agreement protocol; Computer science; Relay; Computer network; Key (lock); Node (physics); Wireless; Pre-shared key; Wireless network; Fading; Protocol (science); Upper and lower bounds; Block (permutation group theory); Key exchange; Public-key cryptography; Key distribution; Computer security; Channel (broadcasting); Telecommunications; Encryption; Mathematics","score_opus":0.025863364892189145,"score_gpt":0.28155960445837236,"score_spread":0.2556962395661832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993695587","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.002323902,0.0004717904,0.9954281,0.0002453457,0.000020353287,0.000093201066,0.000009795191,0.000054994613,0.0013525243],"genre_scores_gemma":[0.40946278,0.002558494,0.583687,0.0002097256,0.00018854387,0.0014645618,0.0000995777,0.00009470415,0.002234675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9895639,0.006095188,0.00045131738,0.0008378514,0.0026123535,0.00043949098],"domain_scores_gemma":[0.9879822,0.007440591,0.0010650309,0.002185802,0.0011728152,0.0001535075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012664442,0.001537625,0.0011861828,0.0010818018,0.0010612292,0.0029772979,0.0034967512,0.0025407376,0.0015371661],"category_scores_gemma":[0.027203836,0.001045352,0.00082441693,0.0015915063,0.0041701137,0.007008237,0.0032511961,0.0033031711,0.0007110856],"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.00009997045,0.00007756404,0.0002862608,0.00036236728,0.000053446678,0.00014959417,0.00034700875,0.18093355,0.0061257877,0.7686685,0.00089372136,0.042002283],"study_design_scores_gemma":[0.00006974883,0.00014492884,0.00005698741,0.00009999112,0.0000358551,0.00022015814,0.00007908335,0.6910106,0.005789869,0.296891,0.005555646,0.000046147918],"about_ca_topic_score_codex":0.0005247504,"about_ca_topic_score_gemma":0.00036585794,"teacher_disagreement_score":0.012664442,"about_ca_system_score_codex":0.0025338987,"about_ca_system_score_gemma":0.002268444,"threshold_uncertainty_score":0.066976726},"labels":[],"label_agreement":null},{"id":"W1993813893","doi":"10.1109/isit.2012.6283632","title":"Random access in wireless X network: A deterministic view","year":2012,"lang":"en","type":"article","venue":"","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":"University of Waterloo","funders":"","keywords":"Transmitter; Computer science; Random access; Throughput; Linear network coding; Computer network; Linear programming; Transmission (telecommunications); Maximization; Wireless network; Channel (broadcasting); Wireless; Coding (social sciences); Set (abstract data type); Mathematical optimization; Algorithm; Mathematics; Telecommunications","score_opus":0.0306816235447539,"score_gpt":0.2952729326397959,"score_spread":0.264591309095042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993813893","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.06794891,0.004376622,0.8977746,0.0036470962,0.00020793195,0.000065629225,0.00025177264,0.00013764529,0.02558976],"genre_scores_gemma":[0.9411473,0.0062880744,0.040756915,0.0005033309,0.0005866654,0.00020052736,0.000099241646,0.00005228939,0.010365655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983973,0.0008329809,0.000044213026,0.00018659809,0.00032053413,0.00021846923],"domain_scores_gemma":[0.99634993,0.00249763,0.00060040265,0.00023011625,0.00021322316,0.00010866202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015067195,0.0008546965,0.0007491655,0.0006060673,0.0006303327,0.001961627,0.00096569065,0.0012549679,0.0014600779],"category_scores_gemma":[0.004484019,0.00048442336,0.0005984386,0.00080938253,0.0023058064,0.003117377,0.0011232493,0.0013221898,0.00027412386],"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.000071750044,0.000029842713,0.00077203923,0.000116669915,0.00003367318,0.0003183429,0.00011669675,0.3209178,0.0018775794,0.66944903,0.001141418,0.0051551685],"study_design_scores_gemma":[0.00001872541,0.00008303287,0.0004145444,0.00003095745,0.000019307423,0.00019876368,0.00006219474,0.859845,0.00047580226,0.13602637,0.002798071,0.000027256045],"about_ca_topic_score_codex":0.0021878101,"about_ca_topic_score_gemma":0.0014584631,"teacher_disagreement_score":0.0021878101,"about_ca_system_score_codex":0.0015217403,"about_ca_system_score_gemma":0.00091634947,"threshold_uncertainty_score":0.011041045},"labels":[],"label_agreement":null},{"id":"W1994027334","doi":"10.1109/sahcn.2013.6645022","title":"Efficient wireless security through jamming, coding and routing","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":17,"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":"Computer science; Physical layer; Computer network; Goodput; Jamming; Wireless network; Linear network coding; Distributed computing; Multipath routing; Routing protocol; Wireless; Link-state routing protocol; Routing (electronic design automation); Network packet; Telecommunications; Throughput","score_opus":0.011200135392128732,"score_gpt":0.22947834211279097,"score_spread":0.21827820672066223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994027334","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.017163515,0.00030821958,0.9794906,0.00023202553,0.000016947535,0.0000336164,0.000022908527,0.0002443518,0.0024879072],"genre_scores_gemma":[0.63440996,0.0010050519,0.36102155,0.00012569367,0.00004719252,0.00013373759,0.00008983702,0.00007347438,0.0030936338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914014,0.00035615024,0.00003270951,0.000089313355,0.00026879707,0.00011277491],"domain_scores_gemma":[0.99852693,0.00085477985,0.00018910237,0.00030232625,0.00009528427,0.000031589676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010004133,0.0008872113,0.00063783466,0.00073358614,0.0005223854,0.0009763174,0.0009775395,0.0009217743,0.0008861354],"category_scores_gemma":[0.0036690037,0.00038986118,0.00046870275,0.0010088341,0.0014509569,0.0024699043,0.0017069165,0.0010548106,0.00029558546],"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.000093324576,0.000043217442,0.00022534023,0.00007597009,0.000023956261,0.000051866864,0.00008666315,0.8604314,0.007998797,0.06765744,0.0009980319,0.062313966],"study_design_scores_gemma":[0.000017373251,0.000027154252,0.000068774374,0.000013275083,0.00001013397,0.00004612566,0.00001982968,0.9597595,0.0027466784,0.036247257,0.0010353969,0.000008579069],"about_ca_topic_score_codex":0.0011999181,"about_ca_topic_score_gemma":0.0018050926,"teacher_disagreement_score":0.0011999181,"about_ca_system_score_codex":0.00074741023,"about_ca_system_score_gemma":0.0012884124,"threshold_uncertainty_score":0.00542289},"labels":[],"label_agreement":null},{"id":"W1994418207","doi":"10.1109/isit.2013.6620564","title":"Energy efficiency of Gaussian channel with random data arrival","year":2013,"lang":"en","type":"article","venue":"","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":"University of Waterloo","funders":"","keywords":"Additive white Gaussian noise; Transmitter; Energy (signal processing); Channel (broadcasting); Gaussian; Computer science; Point (geometry); Algorithm; Telecommunications; Mathematics; Statistics; Physics","score_opus":0.016711171837646994,"score_gpt":0.22289403082921883,"score_spread":0.20618285899157182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994418207","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.394634,0.004588127,0.578862,0.00085595244,0.00014811657,0.00004078084,0.00024518822,0.0004341849,0.020191723],"genre_scores_gemma":[0.99563557,0.0006598599,0.0023446798,0.000036635272,0.00002490727,0.000010422329,0.000028247436,0.000019014215,0.0012406147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989857,0.00035113652,0.000023481578,0.00009846989,0.00024558886,0.00029562545],"domain_scores_gemma":[0.99743444,0.0018720692,0.00018320621,0.00009944926,0.0003471238,0.00006378887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010252114,0.0007550681,0.0009713961,0.00065437006,0.00047499983,0.0012902564,0.00076153403,0.00083830685,0.0011278007],"category_scores_gemma":[0.0027186417,0.00030269075,0.00041907406,0.0009892432,0.0010828107,0.0009777644,0.0008116377,0.0003702253,0.00022473242],"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.00032910678,0.000036785466,0.0013801242,0.00011535186,0.00004668207,0.00039452477,0.000071354436,0.9621783,0.0040717823,0.023347616,0.00074119325,0.007287205],"study_design_scores_gemma":[0.000007914417,0.000042376058,0.00036441628,0.0000076268134,0.000014388318,0.000068201465,0.000029606343,0.99507195,0.00067937514,0.0035488533,0.00015341495,0.000011849885],"about_ca_topic_score_codex":0.0051558823,"about_ca_topic_score_gemma":0.0027893162,"teacher_disagreement_score":0.0051558823,"about_ca_system_score_codex":0.0015201616,"about_ca_system_score_gemma":0.00096496445,"threshold_uncertainty_score":0.0110295415},"labels":[],"label_agreement":null},{"id":"W1995956904","doi":"10.1109/isit.2014.6874953","title":"The separability and ergodic sum-rate of parallel Gaussian interference channels","year":2014,"lang":"en","type":"article","venue":"","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":"University of Waterloo","funders":"","keywords":"Decoding methods; Ergodic theory; Gaussian; Mathematics; Diagonal; Coding (social sciences); Power control; Covariance matrix; Fading; Algorithm; Channel (broadcasting); Computer science; Topology (electrical circuits); Control theory (sociology); Telecommunications; Power (physics); Combinatorics; Statistics; Physics; Mathematical analysis","score_opus":0.013185756057920297,"score_gpt":0.24013145804283745,"score_spread":0.22694570198491715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995956904","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.100164525,0.0029092631,0.85000634,0.00078455405,0.00007597058,0.000095955984,0.0006443203,0.0003421284,0.04497692],"genre_scores_gemma":[0.9492464,0.0027273241,0.04222618,0.00012375286,0.00015254851,0.000267097,0.00040826396,0.0001231394,0.004725273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768054,0.0008443613,0.00008373555,0.00028153817,0.0006314904,0.00047820748],"domain_scores_gemma":[0.98909956,0.008087793,0.0011012667,0.0006494617,0.000827031,0.00023485385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025877282,0.002235076,0.0016655608,0.0016280914,0.0010943376,0.0027553076,0.0015661899,0.0010005125,0.0035177006],"category_scores_gemma":[0.013566412,0.00079160655,0.0012719211,0.001926896,0.0027123955,0.0028318996,0.0027868673,0.0023376623,0.0008030816],"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.00045898257,0.00011134333,0.0008692471,0.0005077711,0.0001653648,0.00056849007,0.0003870958,0.4760989,0.009997776,0.48116156,0.0023613716,0.027312081],"study_design_scores_gemma":[0.000021242891,0.000099099496,0.00044375673,0.000090226466,0.000077653334,0.0004777306,0.000105665844,0.7798896,0.006585691,0.20999931,0.0021515281,0.000058502497],"about_ca_topic_score_codex":0.0011953516,"about_ca_topic_score_gemma":0.0008304248,"teacher_disagreement_score":0.0035177006,"about_ca_system_score_codex":0.0020290434,"about_ca_system_score_gemma":0.0016525437,"threshold_uncertainty_score":0.014721811},"labels":[],"label_agreement":null},{"id":"W1996778281","doi":"10.1109/qbsc.2014.6841192","title":"Distortion bounds for broadcasting a Gaussian source in the presence of interference","year":2014,"lang":"en","type":"article","venue":"","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":"Distortion (music); Interference (communication); Computer science; Broadcasting (networking); Gaussian; Telecommunications; Algorithm; Physics; Bandwidth (computing); Computer network","score_opus":0.01881078049858949,"score_gpt":0.25503127443082335,"score_spread":0.23622049393223388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996778281","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.042397115,0.0052827615,0.92957425,0.000783046,0.000109200795,0.000053364758,0.00034166494,0.00027639387,0.02118227],"genre_scores_gemma":[0.9095818,0.004899327,0.079137884,0.00027699603,0.00026194938,0.00017795959,0.00047274522,0.00021457017,0.0049767033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973749,0.0006461136,0.00010558716,0.00027522276,0.0011587986,0.00043938088],"domain_scores_gemma":[0.9792042,0.016639523,0.0010422822,0.0011668765,0.0016043346,0.00034284114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037011695,0.001817976,0.0013892184,0.0016013713,0.00070971774,0.0023689237,0.0018485861,0.0011934914,0.0029562032],"category_scores_gemma":[0.018846452,0.0005556028,0.0008441548,0.0016286232,0.002543151,0.0032351944,0.0030894657,0.0018730816,0.00083750166],"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.0006486206,0.00007515299,0.001345795,0.000571712,0.00013857582,0.00034835184,0.00046137633,0.6969859,0.01632702,0.24317245,0.0023660278,0.037559014],"study_design_scores_gemma":[0.000017314387,0.00012136521,0.0005167977,0.00006442345,0.000046089164,0.0003532783,0.00009645637,0.9225314,0.0072355163,0.06701382,0.0019581001,0.000045321856],"about_ca_topic_score_codex":0.0022256593,"about_ca_topic_score_gemma":0.0009859477,"teacher_disagreement_score":0.0037810116,"about_ca_system_score_codex":0.0037810116,"about_ca_system_score_gemma":0.0009018751,"threshold_uncertainty_score":0.027433217},"labels":[],"label_agreement":null},{"id":"W1997717493","doi":"10.1109/setit.2012.6481956","title":"Progressive distributed video coding with multiple passes for side information update","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Université Laval","funders":"","keywords":"Computer science; Encoder; Decoding methods; Coding (social sciences); Architecture; Multiview Video Coding; Block (permutation group theory); Computer hardware; Real-time computing; Theoretical computer science; Algorithm; Video processing; Video tracking; Mathematics","score_opus":0.011633973676374594,"score_gpt":0.239798560433182,"score_spread":0.22816458675680742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997717493","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.01739845,0.00019780209,0.9781658,0.00007737669,0.000042446463,0.000078974546,0.000030800664,0.0005816766,0.0034266708],"genre_scores_gemma":[0.47747415,0.00043925873,0.51358795,0.0001366826,0.00009030448,0.00017427739,0.00024847887,0.00008946639,0.007759403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966586,0.000063075844,0.000013224985,0.000041066356,0.00018378565,0.000033014774],"domain_scores_gemma":[0.9993241,0.00019847866,0.00004895681,0.0002045772,0.00020181335,0.00002211215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005206001,0.00064137357,0.00038506842,0.00065309065,0.00032750278,0.0003889259,0.00092421734,0.00049511925,0.002128823],"category_scores_gemma":[0.0014994536,0.00017562397,0.000379615,0.0006005693,0.0004742416,0.0007799144,0.0005838981,0.0007631079,0.00051784376],"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.00059386226,0.00017230668,0.0010112203,0.00015214803,0.000085518244,0.00057583867,0.00023581693,0.10556868,0.28728694,0.056656335,0.0036131435,0.5440482],"study_design_scores_gemma":[0.0001376946,0.0003776405,0.0007272071,0.000031308497,0.00006343856,0.0007889789,0.000041529187,0.8376289,0.13133453,0.016775077,0.012050817,0.000042832635],"about_ca_topic_score_codex":0.0018668977,"about_ca_topic_score_gemma":0.0046354723,"teacher_disagreement_score":0.002128823,"about_ca_system_score_codex":0.00041878966,"about_ca_system_score_gemma":0.0007317359,"threshold_uncertainty_score":0.007121563},"labels":[],"label_agreement":null},{"id":"W1998505899","doi":"10.1109/qbsc.2012.6221376","title":"Transmit rate reduction of Wyner-Ziv video coding (WZVC) using multiple uncorrelated wireless receivers","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Decoding methods; Wireless; Coding (social sciences); Uncorrelated; Algorithm; Video quality; Channel (broadcasting); Parity bit; Bit error rate; Real-time computing; Computer network; Mathematics; Telecommunications; Statistics; Engineering","score_opus":0.027940669228535664,"score_gpt":0.24652894482148616,"score_spread":0.2185882755929505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998505899","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.07605496,0.00056645676,0.92006207,0.00013441817,0.00003756212,0.000039650095,0.000037462774,0.00020045695,0.0028669601],"genre_scores_gemma":[0.71260667,0.00091333536,0.283249,0.00012223164,0.000032809592,0.00006645125,0.00012710782,0.000057757636,0.0028246846],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995122,0.00010376276,0.000020986783,0.00005317762,0.00026514518,0.00004482683],"domain_scores_gemma":[0.99931455,0.0003604233,0.000113368216,0.0000900877,0.000103757666,0.000017781495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006047927,0.0006672487,0.0004032864,0.0003289497,0.00015306113,0.00047220674,0.00042588846,0.00047544896,0.0006043847],"category_scores_gemma":[0.0015740172,0.00016638555,0.00030353718,0.0004347604,0.0005056402,0.0007491609,0.00054937,0.0005687889,0.00017611598],"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.00048654826,0.00015248559,0.0028384884,0.00030635012,0.000120024626,0.0005661198,0.0002291275,0.28319722,0.40282857,0.06254763,0.0015914022,0.24513605],"study_design_scores_gemma":[0.00001967338,0.00015057235,0.0006358781,0.000026372654,0.000029501574,0.0003088819,0.000025964677,0.84338766,0.1500597,0.0035230222,0.0018086232,0.000024100535],"about_ca_topic_score_codex":0.0011940919,"about_ca_topic_score_gemma":0.0015531182,"teacher_disagreement_score":0.0011940919,"about_ca_system_score_codex":0.00034102038,"about_ca_system_score_gemma":0.0003991872,"threshold_uncertainty_score":0.0031985044},"labels":[],"label_agreement":null},{"id":"W1999140828","doi":"10.1109/isita.2010.5650104","title":"New results on Secret Key Establishment over a pair of broadcast channels","year":2010,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Secrecy; Upper and lower bounds; Key (lock); Computer science; Simple (philosophy); Coding (social sciences); Channel (broadcasting); Computer network; Protocol (science); Theoretical computer science; Mathematics; Discrete mathematics; Computer security; Statistics; Philosophy","score_opus":0.02055390996337227,"score_gpt":0.26070340921065405,"score_spread":0.24014949924728177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999140828","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.03510701,0.0036932835,0.92293584,0.0019058026,0.00038070392,0.00016372278,0.00036709095,0.00023486852,0.035211682],"genre_scores_gemma":[0.82780355,0.008166445,0.14716133,0.0010284161,0.0019154743,0.0007674245,0.00062243664,0.00026404558,0.0122708315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992461,0.0024656113,0.00040919476,0.0012685459,0.002218809,0.0011767856],"domain_scores_gemma":[0.95563793,0.033993647,0.0026981581,0.0040143845,0.0027411785,0.0009147511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076714014,0.0024541414,0.0023351258,0.0032076065,0.002119229,0.004522864,0.0032222148,0.0023742025,0.006053977],"category_scores_gemma":[0.025154391,0.001297929,0.0019260846,0.0038273677,0.007345552,0.018419145,0.0062744045,0.008245669,0.0008863815],"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.00024270156,0.00014782466,0.0003815331,0.0007587532,0.00010153534,0.00035952343,0.0005652827,0.058793414,0.0045542675,0.91052353,0.0031730826,0.020398568],"study_design_scores_gemma":[0.00007284858,0.00022015597,0.00043163393,0.00017036966,0.00012571402,0.0005496354,0.00022847952,0.38674617,0.0076475935,0.59431213,0.009344679,0.00015067036],"about_ca_topic_score_codex":0.00076234073,"about_ca_topic_score_gemma":0.00062454614,"teacher_disagreement_score":0.0076714014,"about_ca_system_score_codex":0.002952651,"about_ca_system_score_gemma":0.0020263956,"threshold_uncertainty_score":0.040570736},"labels":[],"label_agreement":null},{"id":"W1999333067","doi":"10.1109/allerton.2014.7028439","title":"Randomized source coding with limited common randomness","year":2014,"lang":"en","type":"article","venue":"","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":"Randomness; Encoder; Computer science; Coding (social sciences); Algorithm; Stochastic process; Theoretical computer science; Mathematical optimization; Mathematics; Statistics","score_opus":0.009461898255943088,"score_gpt":0.21821488769725392,"score_spread":0.20875298944131082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999333067","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.03175228,0.0007277832,0.9610044,0.00069765944,0.000053295767,0.000042672295,0.00013071875,0.00014338845,0.0054477835],"genre_scores_gemma":[0.8764125,0.0012679409,0.11677435,0.000260728,0.00019743363,0.00021394299,0.00029770553,0.00007613284,0.004499178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997154,0.0014646098,0.00009078548,0.0003513049,0.00071385293,0.0002254692],"domain_scores_gemma":[0.9915189,0.006640466,0.0007728033,0.0006335739,0.00031131826,0.00012290709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022994909,0.0008438102,0.0012290365,0.00076101173,0.0003388628,0.0013205884,0.0015707726,0.0011278146,0.0013911003],"category_scores_gemma":[0.009304692,0.00039790856,0.0006900491,0.0011769801,0.0020495513,0.0027850168,0.0018986071,0.0017231511,0.00032121965],"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.00010735196,0.00003672119,0.00019453265,0.0001040605,0.00004239211,0.00016663395,0.000073206764,0.5545175,0.0035915326,0.43033665,0.0007269449,0.010102482],"study_design_scores_gemma":[0.0000406313,0.000041914478,0.00006525179,0.000018494231,0.000012148852,0.000058366673,0.000010019894,0.8601804,0.0013975919,0.13737366,0.000784491,0.00001706354],"about_ca_topic_score_codex":0.00077646977,"about_ca_topic_score_gemma":0.0005395218,"teacher_disagreement_score":0.0022994909,"about_ca_system_score_codex":0.001239669,"about_ca_system_score_gemma":0.0010011848,"threshold_uncertainty_score":0.012161016},"labels":[],"label_agreement":null},{"id":"W2003025695","doi":"10.1109/lwc.2014.2349514","title":"On the Secrecy Rate Achievability in Dual-Hop Amplify-and-Forward Relay Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Relay; Secrecy; Computer science; Computer network; Wireless; Transmitter power output; Hop (telecommunications); Link (geometry); Signal-to-noise ratio (imaging); Dual (grammatical number); Topology (electrical circuits); Power (physics); Telecommunications; Transmitter; Computer security; Electrical engineering; Channel (broadcasting); Physics; Engineering","score_opus":0.016061845824045892,"score_gpt":0.23849041181981875,"score_spread":0.22242856599577288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003025695","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.11608384,0.0064719804,0.83634096,0.0011745251,0.00019772328,0.00010333844,0.00036790117,0.00039646402,0.03886317],"genre_scores_gemma":[0.9624593,0.006368727,0.028048346,0.00015481563,0.00024134641,0.00018880409,0.0001604889,0.00007286978,0.0023051628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681467,0.0013961616,0.00016448648,0.00028588576,0.0007958967,0.0005429023],"domain_scores_gemma":[0.982216,0.014899625,0.00082110846,0.0007104577,0.0011979071,0.00015486962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003959172,0.0021687504,0.0022703498,0.0020411888,0.0011983264,0.003053308,0.0011600245,0.0014900473,0.0020457648],"category_scores_gemma":[0.01795489,0.0010714995,0.0012563313,0.0019484801,0.003191926,0.0030856438,0.0026765969,0.0023557642,0.00081190345],"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.00061969634,0.00008442063,0.00094283035,0.00061834505,0.00020486306,0.0011267898,0.0005686531,0.6947022,0.021321503,0.25550437,0.0022292265,0.02207708],"study_design_scores_gemma":[0.00003992044,0.00019454269,0.00027970315,0.00012197122,0.00009136041,0.00046920907,0.00013649934,0.9061394,0.008298786,0.08287083,0.0012842714,0.00007343298],"about_ca_topic_score_codex":0.0016996315,"about_ca_topic_score_gemma":0.000792479,"teacher_disagreement_score":0.003959172,"about_ca_system_score_codex":0.0018103456,"about_ca_system_score_gemma":0.0012839895,"threshold_uncertainty_score":0.020938396},"labels":[],"label_agreement":null},{"id":"W2003714332","doi":"10.1109/icc.2013.6655319","title":"A two dimensional quantization algorithm for CIR-based physical layer authentication","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Quantization (signal processing); Algorithm; Physical layer; Orthogonal frequency-division multiplexing; False alarm; Spoofing attack; Wireless; Channel (broadcasting); Computer network; Telecommunications; Artificial intelligence","score_opus":0.01906621006241805,"score_gpt":0.2790688984755446,"score_spread":0.26000268841312657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003714332","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.004255171,0.00033340443,0.99361444,0.00008059182,0.00008806184,0.00008147115,0.000031261046,0.00045301457,0.0010624778],"genre_scores_gemma":[0.25887352,0.0003563671,0.7382673,0.00014613787,0.000073938325,0.00022497922,0.00015468996,0.000038363745,0.0018646978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987651,0.00030801527,0.00013620964,0.00019881726,0.0005174756,0.00007443619],"domain_scores_gemma":[0.9986141,0.00040560085,0.00014837558,0.00022816703,0.0005582128,0.0000455617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013329694,0.0005872958,0.000576828,0.00077824213,0.0005631585,0.00083877746,0.00088612735,0.000688504,0.0025034333],"category_scores_gemma":[0.0045304764,0.00023351872,0.0003580304,0.0008695965,0.0006191175,0.0011779278,0.0008804645,0.00096720067,0.0008361186],"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.0006417508,0.00014329971,0.0012815484,0.00023737107,0.000051376526,0.00014660048,0.00025814495,0.15310706,0.052265212,0.044317033,0.004277378,0.74327326],"study_design_scores_gemma":[0.00006560824,0.00022429728,0.00050369784,0.00002614521,0.000017966102,0.00019102076,0.000031621737,0.9723617,0.01686594,0.0050797216,0.0045856414,0.00004660354],"about_ca_topic_score_codex":0.0014710068,"about_ca_topic_score_gemma":0.0013809483,"teacher_disagreement_score":0.0025034333,"about_ca_system_score_codex":0.00056593766,"about_ca_system_score_gemma":0.0011493586,"threshold_uncertainty_score":0.00837481},"labels":[],"label_agreement":null},{"id":"W2004443711","doi":"10.1109/glocomw.2014.7063617","title":"Impact of estimated CSI quantization on secrecy rate loss in pilot-aided MIMO systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of British Columbia","funders":"","keywords":"Artificial noise; Channel state information; Computer science; MIMO; Secrecy; Imperfect; Transmitter; Precoding; Beamforming; Quantization (signal processing); Transmitter power output; Physical layer; Upper and lower bounds; Telecommunications; Channel (broadcasting); Control theory (sociology); Wireless; Algorithm; Computer security; Mathematics; Artificial intelligence","score_opus":0.031785187618810634,"score_gpt":0.30155664508221236,"score_spread":0.2697714574634017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004443711","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5032413,0.0022949297,0.48530993,0.0006557474,0.00011469986,0.00007895907,0.0002122304,0.00055999204,0.007532147],"genre_scores_gemma":[0.9945755,0.0002915218,0.004753096,0.00003744055,0.000011746872,0.00001399262,0.00002041389,0.000015452182,0.00028071227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996684,0.0014553238,0.00016068756,0.00027103786,0.0008663366,0.00056259736],"domain_scores_gemma":[0.9799873,0.016257485,0.0015217827,0.0009799979,0.0011003822,0.00015312167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038750945,0.0012035932,0.0010201246,0.0005854138,0.00072976685,0.0012938122,0.0006455514,0.00094338186,0.0010673292],"category_scores_gemma":[0.018100603,0.00044166934,0.00042044415,0.0007826612,0.0023320098,0.0024804755,0.0015071658,0.0010935372,0.00016816075],"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.00036070743,0.00005649192,0.0019570808,0.00012807014,0.00005791719,0.0004513031,0.00013410211,0.9723136,0.006813648,0.00878213,0.00022473215,0.008720201],"study_design_scores_gemma":[0.000015519416,0.00022725157,0.0009169547,0.000032470445,0.000045392484,0.0002624495,0.00010319578,0.986888,0.008515457,0.0028440005,0.00011247408,0.0000368347],"about_ca_topic_score_codex":0.0019109416,"about_ca_topic_score_gemma":0.0013077933,"teacher_disagreement_score":0.0038750945,"about_ca_system_score_codex":0.0011736071,"about_ca_system_score_gemma":0.00097378914,"threshold_uncertainty_score":0.020493686},"labels":[],"label_agreement":null},{"id":"W2005257110","doi":"10.1109/isit.2007.4557546","title":"M-user Gaussian Interference Channels: To Decode the Interference or To Consider it as Noise","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":10,"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":"Interference (communication); Computer science; Gaussian; Channel (broadcasting); Algorithm; Transmission (telecommunications); Noise (video); Gaussian noise; Polynomial; Decoding methods; Simple (philosophy); Iterative method; Interference alignment; Telecommunications; Topology (electrical circuits); Mathematics; MIMO; Artificial intelligence; Physics; Combinatorics","score_opus":0.04245435814667356,"score_gpt":0.32448222483884337,"score_spread":0.28202786669216984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005257110","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.018801415,0.0006597566,0.9741088,0.00054869306,0.000056161894,0.00003651967,0.00005443304,0.00005828201,0.0056759464],"genre_scores_gemma":[0.5868064,0.002496692,0.39946905,0.00046634226,0.00027379522,0.00018471135,0.00011008349,0.000058328398,0.010134589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994289,0.00023734268,0.000022289256,0.00008860723,0.000109258406,0.00011354361],"domain_scores_gemma":[0.99922454,0.00042221026,0.000104356615,0.00014056332,0.00008076684,0.000027610247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085723144,0.00094346685,0.0005950139,0.00021597165,0.00031711612,0.0008118964,0.0008226521,0.00094386295,0.0014776601],"category_scores_gemma":[0.0027718947,0.00017696267,0.00041081486,0.00060003094,0.001002097,0.0015225403,0.00091224164,0.0008413899,0.00053837267],"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.0003567545,0.00016432765,0.0015722008,0.00049679476,0.00009791186,0.00042147108,0.00043533818,0.3109721,0.01743085,0.5455233,0.004448831,0.11808021],"study_design_scores_gemma":[0.000036566602,0.00016283168,0.00022968666,0.00005395491,0.00003448934,0.00033668397,0.00009298828,0.8341159,0.012208838,0.14608552,0.0066136764,0.00002881434],"about_ca_topic_score_codex":0.00092068635,"about_ca_topic_score_gemma":0.0012254169,"teacher_disagreement_score":0.0014776601,"about_ca_system_score_codex":0.000470856,"about_ca_system_score_gemma":0.0009531157,"threshold_uncertainty_score":0.0049432516},"labels":[],"label_agreement":null},{"id":"W2005583142","doi":"10.1007/s11277-010-0074-9","title":"Denial of Service Prevention for 5G","year":2010,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Aalborg Universitet; Federation for the Humanities and Social Sciences","keywords":"Computer science; Denial-of-service attack; Quality of service; Computer network; Wireless; Bandwidth (computing); Usability; Bit error rate; Computer security; Telecommunications; Channel (broadcasting); The Internet","score_opus":0.0346135071362218,"score_gpt":0.30550456676929644,"score_spread":0.27089105963307464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005583142","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.16049357,0.0063533606,0.7939696,0.0035761215,0.0009074072,0.0002472942,0.0001460244,0.0033764336,0.030930134],"genre_scores_gemma":[0.97431684,0.00056608877,0.022538468,0.0002583378,0.00012548376,0.000035780165,0.000043137923,0.000024165065,0.0020917032],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985985,0.00041139204,0.000058060818,0.00013939707,0.00045233322,0.0003402104],"domain_scores_gemma":[0.99751353,0.0011277217,0.00028422635,0.0005179976,0.00046161513,0.0000948758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001726432,0.00054022524,0.00068896025,0.0009658138,0.0012420393,0.0010039097,0.0010644109,0.0007549396,0.0029978342],"category_scores_gemma":[0.0041604317,0.0002575581,0.00040733968,0.00049418665,0.0007219611,0.0014922312,0.0010859098,0.0010895053,0.00047619507],"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.0017372287,0.00056445505,0.006907866,0.0004232443,0.00024097429,0.0005521554,0.0004920824,0.10967188,0.029400038,0.12097956,0.01976343,0.7092671],"study_design_scores_gemma":[0.00012755793,0.00065881014,0.006121277,0.00017218178,0.00028250212,0.0017055287,0.00038452356,0.8454899,0.017176345,0.10879922,0.018994883,0.000087192086],"about_ca_topic_score_codex":0.001751803,"about_ca_topic_score_gemma":0.0025846495,"teacher_disagreement_score":0.0029978342,"about_ca_system_score_codex":0.00096670905,"about_ca_system_score_gemma":0.0012513727,"threshold_uncertainty_score":0.0100287795},"labels":[],"label_agreement":null},{"id":"W2005612588","doi":"10.1007/s00220-008-0625-z","title":"Counterexamples to Additivity of Minimum Output p-Rényi Entropy for p Close to 0","year":2008,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":44,"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 Waterloo","funders":"","keywords":"Additive function; Counterexample; Conjecture; Entropy (arrow of time); Quantum; Complex system","score_opus":0.08423763620704829,"score_gpt":0.3249570072784253,"score_spread":0.24071937107137703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005612588","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42507657,0.0019959847,0.42426938,0.01651766,0.00087502686,0.00012866655,0.00059249013,0.0012460226,0.12929817],"genre_scores_gemma":[0.9833875,0.0003996349,0.01084119,0.0010791908,0.0004923687,0.0001136937,0.000114037284,0.00016179596,0.00341059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947848,0.0018907395,0.00025349858,0.0007791369,0.0016754683,0.00061634625],"domain_scores_gemma":[0.9633822,0.031311624,0.0016033644,0.0019449025,0.000950935,0.0008070692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006685257,0.0011163965,0.0018181301,0.002342067,0.0023871334,0.00476992,0.0022539846,0.002989686,0.0068021463],"category_scores_gemma":[0.041991,0.00095639954,0.0014972399,0.0013215742,0.00877003,0.007397945,0.008587288,0.0054220734,0.000613626],"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.00014659988,0.000028859164,0.00046703318,0.00009158374,0.00003222664,0.00022819215,0.00018244372,0.0049737194,0.0013488462,0.987987,0.0014065988,0.0031070216],"study_design_scores_gemma":[0.000026827021,0.000025516092,0.00030238598,0.000024217063,0.000014938606,0.00025856993,0.0000424471,0.02301921,0.0017612074,0.9737854,0.0007162576,0.0000230469],"about_ca_topic_score_codex":0.00027038195,"about_ca_topic_score_gemma":0.00018406079,"teacher_disagreement_score":0.0068021463,"about_ca_system_score_codex":0.0014322774,"about_ca_system_score_gemma":0.0006130292,"threshold_uncertainty_score":0.03535545},"labels":[],"label_agreement":null},{"id":"W2006333615","doi":"10.1109/tit.2014.2369496","title":"The Sender-Excited Secret Key Agreement Model: Capacity, Reliability, and Secrecy Exponents","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"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 Toronto","funders":"Air Force Office of Scientific Research; Wisconsin Alumni Research Foundation","keywords":"Secrecy; Emulation; Decoding methods; Key generation; Key (lock); Information-theoretic security; Channel (broadcasting); Coding (social sciences); Communication source; Information theory","score_opus":0.012116739990175047,"score_gpt":0.21277152135165342,"score_spread":0.20065478136147838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006333615","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.11202709,0.0008255693,0.8516284,0.0026338447,0.00009660009,0.00023668614,0.0007265502,0.00028701994,0.031538263],"genre_scores_gemma":[0.95743185,0.0007014998,0.03259413,0.00018984647,0.0001354743,0.00039564254,0.00015385135,0.00009629331,0.008301399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958269,0.0021080244,0.00014772234,0.0005911757,0.0006935929,0.0006325512],"domain_scores_gemma":[0.97477925,0.01902661,0.0020919673,0.0021384566,0.0013648609,0.0005987469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049540843,0.0019149256,0.0018523169,0.0013244641,0.0013082232,0.0037256589,0.003936097,0.0027919195,0.0066126795],"category_scores_gemma":[0.022016253,0.0008891103,0.0010877226,0.0017039087,0.0048383493,0.0077475677,0.0036864849,0.004104977,0.001309683],"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.00023074647,0.00009278004,0.00032939605,0.00018161052,0.000050378538,0.00048801556,0.00069785403,0.26114255,0.0042164344,0.7263968,0.0016236939,0.0045497185],"study_design_scores_gemma":[0.000058347123,0.00005338376,0.000091761576,0.00003365713,0.000024314002,0.00013287604,0.00008961019,0.7799873,0.0014340515,0.21714571,0.00090399315,0.000045002536],"about_ca_topic_score_codex":0.0017328522,"about_ca_topic_score_gemma":0.00080274115,"teacher_disagreement_score":0.0066126795,"about_ca_system_score_codex":0.0034093119,"about_ca_system_score_gemma":0.0015773162,"threshold_uncertainty_score":0.026199996},"labels":[],"label_agreement":null},{"id":"W2006502493","doi":"10.1109/tvt.2014.2366911","title":"On the Accuracy of the High-SNR Approximation of the Differential Entropy of Signals in Additive Gaussian Noise: Real and Complex Cases","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Gaussian noise; Additive white Gaussian noise; Rayleigh fading; Taylor's theorem; Transmitter; Gaussian; Algorithm; Signal-to-noise ratio (imaging); Piecewise; Taylor series; Fading; Applied mathematics; White noise; Mathematical analysis; Computer science; Telecommunications; Channel (broadcasting); Statistics; Physics; Decoding methods","score_opus":0.011775196910045324,"score_gpt":0.2277354517383298,"score_spread":0.21596025482828446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006502493","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.13233744,0.0040892772,0.83866495,0.0020890695,0.0002672701,0.000040091414,0.00015349025,0.00037412686,0.021984262],"genre_scores_gemma":[0.9491812,0.0021436552,0.04566869,0.00022759486,0.0001763189,0.000045825826,0.0000995463,0.00016819718,0.0022890212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976209,0.0010950676,0.00009973866,0.00021222682,0.00073582353,0.00023628153],"domain_scores_gemma":[0.951315,0.042945765,0.0015284639,0.002559145,0.0013238058,0.00032785744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008195732,0.00096965174,0.00079379376,0.0016751392,0.0006581744,0.0019410648,0.0015018256,0.0012586849,0.0014814585],"category_scores_gemma":[0.060300507,0.00035562573,0.0005559299,0.0008654329,0.0054136715,0.004035026,0.0020350832,0.0023364516,0.00043105218],"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.00029003905,0.00006803015,0.0035964772,0.00028492033,0.00005218933,0.00056481786,0.00043384216,0.6421052,0.0053178756,0.32101783,0.0011336402,0.02513517],"study_design_scores_gemma":[0.000006978571,0.000028889122,0.00070089824,0.000071476374,0.000008801597,0.00015584326,0.000046413214,0.9355704,0.002168351,0.06063616,0.00058044057,0.000025259009],"about_ca_topic_score_codex":0.0025281468,"about_ca_topic_score_gemma":0.001291235,"teacher_disagreement_score":0.008195732,"about_ca_system_score_codex":0.0014139136,"about_ca_system_score_gemma":0.0007409023,"threshold_uncertainty_score":0.043343663},"labels":[],"label_agreement":null},{"id":"W2006624419","doi":"10.1109/18.923736","title":"Renyi's divergence and entropy rates for finite alphabet Markov sources","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":57,"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":"Mathematics; Rényi entropy; Combinatorics; Markov chain; Alphabet; Discrete mathematics; Entropy (arrow of time); Coding theory; Divergence (linguistics); Entropy rate; Statistics; Binary entropy function; Physics; Principle of maximum entropy; Quantum mechanics","score_opus":0.009192276345957163,"score_gpt":0.2380018457705932,"score_spread":0.22880956942463604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006624419","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.107989475,0.0025466077,0.8720079,0.000652561,0.000105107094,0.000053826945,0.00017177197,0.00022928028,0.016243545],"genre_scores_gemma":[0.8693399,0.0024398228,0.11830359,0.00022408755,0.00021019783,0.00016214367,0.0003012496,0.00024312762,0.0087759225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987049,0.0004744356,0.00008621319,0.00020473727,0.00039639615,0.00013326346],"domain_scores_gemma":[0.98486507,0.011973038,0.0011027807,0.0005896585,0.0010694619,0.00039997097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00440316,0.0007410644,0.0007627488,0.0017080877,0.0005724767,0.0014629659,0.0014467192,0.0011245431,0.0028018195],"category_scores_gemma":[0.030358713,0.00034314377,0.0007257277,0.0011529706,0.00265131,0.0051607955,0.001753368,0.0018021805,0.00046755638],"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.000055959543,0.000015265929,0.0006494997,0.0000942203,0.000019763062,0.00011633389,0.00025238836,0.09602386,0.0022202616,0.8905716,0.00030054295,0.009680272],"study_design_scores_gemma":[0.000008817995,0.000025733405,0.00055435265,0.00003766116,0.000010343453,0.00019379954,0.00005685781,0.49493194,0.0021859766,0.50070304,0.001242532,0.000048950315],"about_ca_topic_score_codex":0.0011881742,"about_ca_topic_score_gemma":0.00060174643,"teacher_disagreement_score":0.00440316,"about_ca_system_score_codex":0.0021779456,"about_ca_system_score_gemma":0.00074474013,"threshold_uncertainty_score":0.023286402},"labels":[],"label_agreement":null},{"id":"W2007194647","doi":"10.1109/icc.2013.6655005","title":"On bi-directional lossy communication of correlated Gaussian sources","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Computer science; Lossy compression; Gaussian; Algorithm; Coding (social sciences); Channel code; Variable-length code; Theoretical computer science; Decoding methods; Topology (electrical circuits); Mathematics; Statistics; Physics; Artificial intelligence","score_opus":0.007770880904561053,"score_gpt":0.2129624784956996,"score_spread":0.20519159759113856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007194647","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.18230483,0.0017547044,0.79223263,0.00081780326,0.000061402454,0.00006145073,0.00012395951,0.00011445055,0.022528768],"genre_scores_gemma":[0.96381795,0.0022289362,0.03046345,0.00016181846,0.00006651525,0.000102515325,0.00006410492,0.00003170299,0.0030629744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979894,0.0008447568,0.000053521875,0.00018871781,0.00065360003,0.00026990255],"domain_scores_gemma":[0.989136,0.008443367,0.0009783399,0.00062190596,0.0006317782,0.00018866171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026098408,0.0011227733,0.0011307008,0.000974443,0.00064246415,0.0018175651,0.0012151835,0.001158446,0.001317114],"category_scores_gemma":[0.009956614,0.00045842625,0.0004836146,0.0010520759,0.003910967,0.0035824992,0.0026682015,0.0017407476,0.00036321522],"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.00034082425,0.00007318581,0.00060246873,0.00020086158,0.00005193533,0.0005958945,0.00048256412,0.530008,0.012935198,0.44182268,0.00066272006,0.012223605],"study_design_scores_gemma":[0.00002414475,0.00010624502,0.00020510633,0.000039135037,0.00001824947,0.00029946657,0.00011261517,0.89554024,0.004955297,0.09792087,0.0007271492,0.000051546445],"about_ca_topic_score_codex":0.0009003583,"about_ca_topic_score_gemma":0.0004612518,"teacher_disagreement_score":0.0026098408,"about_ca_system_score_codex":0.001531816,"about_ca_system_score_gemma":0.0006297286,"threshold_uncertainty_score":0.01380229},"labels":[],"label_agreement":null},{"id":"W2007777576","doi":"10.1109/allerton.2012.6483476","title":"Causal coding of multiple jointly Gaussian sources","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"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":"Gaussian; Coding (social sciences); Algorithm; Computer science; Mathematics; Discrete mathematics; Statistics; Physics","score_opus":0.023383742629833865,"score_gpt":0.24702939211342,"score_spread":0.22364564948358615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007777576","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.019812332,0.00026365387,0.9764531,0.00023638243,0.0000449142,0.00003282009,0.00010362328,0.000094713294,0.0029584812],"genre_scores_gemma":[0.80921054,0.00095419376,0.18180741,0.00020411954,0.00012045637,0.00010314072,0.00029612926,0.000042677057,0.0072613806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990625,0.00025963917,0.000035447927,0.00017501978,0.00032987786,0.00013751302],"domain_scores_gemma":[0.9977702,0.0013060129,0.00029583028,0.0002622271,0.0003009343,0.00006484222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016576374,0.0008935883,0.0006030391,0.0007245568,0.00043433622,0.00094255444,0.0011926771,0.0011071744,0.0024450028],"category_scores_gemma":[0.0045634294,0.00034072401,0.0008554392,0.0012951086,0.0014387744,0.0014144502,0.0011557747,0.001117461,0.00033979074],"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.00020255019,0.00005066624,0.0010259758,0.00011582199,0.0000627318,0.0005593702,0.00012895458,0.65653664,0.006527867,0.28793594,0.00097632594,0.045877177],"study_design_scores_gemma":[0.000015019713,0.00003359878,0.00020295745,0.00001206686,0.00002291242,0.00011001371,0.000020374278,0.95399815,0.002479773,0.042209364,0.0008729787,0.000022803077],"about_ca_topic_score_codex":0.0035394835,"about_ca_topic_score_gemma":0.0028382137,"teacher_disagreement_score":0.0035394835,"about_ca_system_score_codex":0.0011730929,"about_ca_system_score_gemma":0.0010549774,"threshold_uncertainty_score":0.008766532},"labels":[],"label_agreement":null},{"id":"W2008140930","doi":"10.1109/pimrc.2011.6139697","title":"Neural network based PHY-layer key exchange for wireless communications","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"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 British Columbia","funders":"","keywords":"Computer science; Computer network; Physical layer; PHY; Key (lock); Wireless; Fading; Wireless network; Key exchange; Artificial neural network; Channel (broadcasting); Telecommunications; Computer security; Public-key cryptography; Artificial intelligence; Encryption","score_opus":0.09027512987019112,"score_gpt":0.27901591923584323,"score_spread":0.1887407893656521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008140930","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.014324349,0.0007270808,0.98264194,0.00015595267,0.000053236305,0.000034645225,0.000014850704,0.00022163187,0.0018262464],"genre_scores_gemma":[0.75444734,0.0009584899,0.23978278,0.00014579622,0.000057091678,0.00012177119,0.000052443607,0.000024563631,0.0044097323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996755,0.00013280325,0.000018712843,0.000041278236,0.00009980596,0.000031855274],"domain_scores_gemma":[0.9995183,0.00027758486,0.000055286717,0.000052227828,0.00008687823,0.000009715264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080104935,0.00032003637,0.0003371347,0.0002412275,0.0002784132,0.00051818613,0.0006610993,0.0006990743,0.0015339026],"category_scores_gemma":[0.0016702651,0.00012873848,0.00022905899,0.00033495488,0.0005103593,0.0012473024,0.0005192828,0.00081611105,0.00026981387],"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.00058039656,0.0002128219,0.0010028883,0.00042047634,0.0001374805,0.00018751151,0.00015023783,0.40002006,0.043279983,0.11528822,0.0028716442,0.4358483],"study_design_scores_gemma":[0.000014739244,0.00006580038,0.00020027609,0.000010881613,0.000014040404,0.00006359194,0.000008101364,0.98174864,0.008225882,0.008386491,0.0012495352,0.00001208679],"about_ca_topic_score_codex":0.0005867265,"about_ca_topic_score_gemma":0.0006739708,"teacher_disagreement_score":0.0015339026,"about_ca_system_score_codex":0.000447761,"about_ca_system_score_gemma":0.0004223772,"threshold_uncertainty_score":0.005131364},"labels":[],"label_agreement":null},{"id":"W2008141773","doi":"10.1109/icassp.2014.6854692","title":"Secrecy rate maximization for MIMO Gaussian wiretap channels with multiple eavesdroppers via alternating matrix POTDC","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":18,"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 Alberta","funders":"","keywords":"Covariance matrix; MIMO; Maximization; Matrix (chemical analysis); Computer science; Mathematical optimization; Convex optimization; Eigenvalues and eigenvectors; Gaussian; Transmitter; Algorithm; Topology (electrical circuits); Mathematics; Channel (broadcasting); Regular polygon; Telecommunications; Combinatorics; Physics","score_opus":0.00968340622260389,"score_gpt":0.23437149067478955,"score_spread":0.22468808445218566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008141773","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.01633382,0.0001428719,0.9810271,0.0001107009,0.000012091506,0.000018649467,0.000035292356,0.00008455593,0.0022347935],"genre_scores_gemma":[0.76672494,0.00057547976,0.22827686,0.00012680565,0.00004385292,0.000121735626,0.00014105884,0.00009148079,0.0038977698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991792,0.00038010714,0.000029622557,0.00009691488,0.00022834167,0.00008573141],"domain_scores_gemma":[0.99825126,0.0012126705,0.00015545964,0.0001102169,0.00022698939,0.00004342203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013288478,0.0010363597,0.00082482514,0.0003629539,0.00029511043,0.00096066535,0.0006293074,0.0008118562,0.0014982825],"category_scores_gemma":[0.0027760523,0.00039857122,0.0004853184,0.00090410607,0.001104674,0.001252943,0.0010908564,0.0009207688,0.0004270994],"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.00009302268,0.000030881325,0.00025251677,0.000078240075,0.00002658463,0.0001207351,0.000056138146,0.9516367,0.004892564,0.024088698,0.000604038,0.018119914],"study_design_scores_gemma":[0.000007192975,0.000021512831,0.000023599167,0.0000034717632,0.0000034173063,0.00002758004,0.0000070603846,0.9948602,0.0013637501,0.0035139658,0.0001643828,0.0000038916105],"about_ca_topic_score_codex":0.0011779357,"about_ca_topic_score_gemma":0.0010922743,"teacher_disagreement_score":0.0014982825,"about_ca_system_score_codex":0.0006108161,"about_ca_system_score_gemma":0.0009003343,"threshold_uncertainty_score":0.0070276856},"labels":[],"label_agreement":null},{"id":"W2009681258","doi":"10.1145/2490428.2490441","title":"Cross-layer coding improves quality and security in wireless video sensor networks","year":2012,"lang":"en","type":"article","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Wireless sensor network; Coding (social sciences); Computer network; Wireless; Physical layer; Real-time computing; Telecommunications","score_opus":0.03285245051059991,"score_gpt":0.3195669750335895,"score_spread":0.28671452452298957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009681258","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.12743892,0.0016721744,0.8629979,0.00034427558,0.00011078353,0.000028413437,0.000036087393,0.0004247635,0.0069465972],"genre_scores_gemma":[0.8966896,0.0013559532,0.09792786,0.0001690981,0.00008043853,0.000020573487,0.00007729658,0.000050902145,0.0036281447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996119,0.00009722704,0.000016941804,0.000043545122,0.0001698345,0.00006060252],"domain_scores_gemma":[0.9991943,0.00035012935,0.00007736947,0.00014663563,0.00020166344,0.000029888131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062817935,0.00044042003,0.00023420146,0.00043739902,0.00022189615,0.0005253016,0.0003910351,0.00045556246,0.001110056],"category_scores_gemma":[0.0019754055,0.00014278854,0.0002266119,0.0005019617,0.0005344822,0.00087739725,0.0008521407,0.0006319143,0.0001970311],"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.00040819147,0.00019522612,0.0021789498,0.00018795994,0.0000770714,0.00036611184,0.00020000944,0.26068193,0.28036633,0.087152965,0.0031824883,0.36500275],"study_design_scores_gemma":[0.0000203775,0.00018269365,0.0010306075,0.000028406961,0.00004010538,0.00029242484,0.000034918074,0.8949136,0.08894067,0.0110506695,0.0034424243,0.000023046798],"about_ca_topic_score_codex":0.0010054522,"about_ca_topic_score_gemma":0.0014420988,"teacher_disagreement_score":0.001110056,"about_ca_system_score_codex":0.0003203667,"about_ca_system_score_gemma":0.00045114697,"threshold_uncertainty_score":0.0037134886},"labels":[],"label_agreement":null},{"id":"W2010867143","doi":"10.1109/itw.2014.6970788","title":"An efficient code for Adversarial Wiretap channel","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":9,"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":"Adversarial system; Computer science; Code (set theory); Channel (broadcasting); Channel code; Theoretical computer science; Computer security; Computer network; Decoding methods; Telecommunications; Programming language; Artificial intelligence","score_opus":0.013854598793796104,"score_gpt":0.25442991916314533,"score_spread":0.24057532036934923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010867143","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.020579943,0.0002982063,0.96736825,0.00068558444,0.00011897854,0.0002099058,0.0005516372,0.0018531702,0.008334349],"genre_scores_gemma":[0.71187466,0.00055474037,0.26679575,0.00053208595,0.00015467087,0.00093369023,0.0010136624,0.0004760092,0.017664658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714667,0.0006884629,0.00011894126,0.00045476164,0.0010230263,0.00056818756],"domain_scores_gemma":[0.99303883,0.0029000188,0.0005638803,0.001996303,0.001175594,0.00032544121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001620802,0.001113392,0.0009977635,0.0010636096,0.0011085491,0.0014303058,0.0019906708,0.0019258005,0.003577249],"category_scores_gemma":[0.0086111175,0.0005518392,0.0006750482,0.0011619084,0.0020330506,0.0021132766,0.003993657,0.0026296647,0.0016332748],"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.00062662736,0.00015605333,0.0007188551,0.0002947072,0.000086497756,0.0006529738,0.0004483832,0.27287382,0.014350293,0.59839135,0.015581078,0.095819354],"study_design_scores_gemma":[0.00009687689,0.00015981395,0.00018607573,0.00007893111,0.00003995958,0.000425195,0.000034447676,0.8195009,0.010679787,0.15722694,0.011498783,0.000072272145],"about_ca_topic_score_codex":0.001908473,"about_ca_topic_score_gemma":0.0016220494,"teacher_disagreement_score":0.003577249,"about_ca_system_score_codex":0.0015393427,"about_ca_system_score_gemma":0.0032518066,"threshold_uncertainty_score":0.011967123},"labels":[],"label_agreement":null},{"id":"W2011477623","doi":"10.1109/isita.2010.5650100","title":"Secret key establishment over a pair of independent broadcast channels","year":2010,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security 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":"University of Calgary","funders":"","keywords":"Upper and lower bounds; Key (lock); Adversary; Computer science; Alice and Bob; Coding (social sciences); Computer network; Theoretical computer science; Mathematics; Discrete mathematics; Alice (programming language); Computer security; Statistics","score_opus":0.01565796148130744,"score_gpt":0.2501563336831299,"score_spread":0.23449837220182246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011477623","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.20492384,0.0005209104,0.78595495,0.0009210725,0.00007079549,0.00017869295,0.00030123958,0.00022834263,0.006900215],"genre_scores_gemma":[0.94320935,0.0002921618,0.05373409,0.000097686825,0.00008261308,0.00019582274,0.0001482753,0.000021897884,0.0022179554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99172467,0.0035446703,0.0003404555,0.0014615024,0.0017535295,0.0011751979],"domain_scores_gemma":[0.98124343,0.013149421,0.0019906014,0.0021366253,0.0007360195,0.000743854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041059866,0.0010293439,0.0020024355,0.00075787987,0.0015109759,0.0031105042,0.0020370597,0.0023641067,0.0021517775],"category_scores_gemma":[0.015246889,0.0009414815,0.00069733494,0.0015043482,0.0031172154,0.0073940773,0.006407457,0.0026381474,0.00041122804],"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.0033514926,0.00027263054,0.0020920956,0.0007477393,0.00032908248,0.0021491467,0.001229811,0.43429843,0.031832118,0.48759523,0.0024879745,0.03361424],"study_design_scores_gemma":[0.00024667702,0.00025567,0.0003410993,0.00003712284,0.00006265224,0.00054390635,0.00020199793,0.83401126,0.010937311,0.15112746,0.0021632449,0.000071531314],"about_ca_topic_score_codex":0.0006423983,"about_ca_topic_score_gemma":0.00043950367,"teacher_disagreement_score":0.0041059866,"about_ca_system_score_codex":0.0016203198,"about_ca_system_score_gemma":0.0013367407,"threshold_uncertainty_score":0.021714807},"labels":[],"label_agreement":null},{"id":"W2012009672","doi":"10.1109/isit.2010.5513787","title":"On the secure DoF of the single-antenna MAC","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":17,"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":"Coding (social sciences); Secure coding; Computer science; Scheme (mathematics); Dimension (graph theory); Topology (electrical circuits); Antenna (radio); Theoretical computer science; Mathematics; Telecommunications; Computer security; Statistics","score_opus":0.010803472584388608,"score_gpt":0.20048560916929825,"score_spread":0.18968213658490965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012009672","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.018479872,0.0027801727,0.9430182,0.0012379782,0.00014755032,0.000047481728,0.0002469738,0.00016849939,0.033873264],"genre_scores_gemma":[0.86584836,0.0075756507,0.112824775,0.00069434353,0.0008004084,0.0003698041,0.0003309107,0.00014815127,0.011407663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837935,0.0005796983,0.00007585307,0.00022222582,0.0005358631,0.00020706437],"domain_scores_gemma":[0.9959676,0.0027315207,0.00031099195,0.00052797433,0.00034485804,0.00011705207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024761057,0.001236137,0.0009850843,0.0007973208,0.00060317706,0.0019369924,0.0010898717,0.0009908029,0.0031798058],"category_scores_gemma":[0.006343633,0.000468162,0.0010548789,0.0007512372,0.0032723725,0.0027253376,0.0022831813,0.0032495924,0.0009987968],"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.00009908893,0.000015206958,0.00011239004,0.000117618285,0.00002221007,0.00013837215,0.00014412792,0.07380683,0.0045553343,0.9097858,0.0018266321,0.0093764225],"study_design_scores_gemma":[0.000040827483,0.000109748544,0.00018403066,0.00010301715,0.000024782636,0.00022266096,0.000044645305,0.43749028,0.0039729266,0.5498269,0.00792381,0.000056472374],"about_ca_topic_score_codex":0.0008395116,"about_ca_topic_score_gemma":0.00040426117,"teacher_disagreement_score":0.0031798058,"about_ca_system_score_codex":0.0016943928,"about_ca_system_score_gemma":0.0012939963,"threshold_uncertainty_score":0.013095081},"labels":[],"label_agreement":null},{"id":"W2015563778","doi":"10.1109/glocomw.2013.6825171","title":"Secure transmission in multi-cell massive MIMO systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":43,"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 British Columbia","funders":"","keywords":"MIMO; Precoding; Telecommunications link; Computer science; Base station; Transmission (telecommunications); Artificial noise; Upper and lower bounds; Antenna (radio); Computer network; Secure transmission; 3G MIMO; Transmitter power output; Topology (electrical circuits); Ergodic theory; Transmitter; Electronic engineering; Telecommunications; Mathematics; Beamforming; Engineering; Electrical engineering","score_opus":0.014555757348272528,"score_gpt":0.22644187961339585,"score_spread":0.21188612226512332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015563778","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.16770759,0.0010590324,0.8233109,0.00044994816,0.000100313606,0.000049552204,0.00014567049,0.00017435507,0.0070026848],"genre_scores_gemma":[0.98894614,0.0003916519,0.009354415,0.000064437365,0.000043271637,0.000028094251,0.000027506254,0.000007664048,0.0011368692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911696,0.0002942109,0.000035152127,0.000115007504,0.0002594999,0.00017917492],"domain_scores_gemma":[0.99808645,0.0011996281,0.00027566115,0.00015384743,0.00021927962,0.00006516516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086131546,0.00091807154,0.0008121069,0.0003358755,0.0006554533,0.0011388573,0.00046829996,0.0008938122,0.0009989205],"category_scores_gemma":[0.0022577797,0.00031979056,0.0003504999,0.0005448371,0.0009918484,0.0011244328,0.0013020259,0.0006651395,0.00027334795],"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.00017542607,0.000030355268,0.000844875,0.00011312951,0.000059894635,0.0007684836,0.00011532548,0.94254476,0.011569099,0.034767833,0.00040900102,0.008601767],"study_design_scores_gemma":[0.000014574254,0.00006820059,0.00023575014,0.000011797763,0.000021980606,0.00014024407,0.000049432787,0.9873957,0.0027415939,0.008948514,0.0003588232,0.000013227378],"about_ca_topic_score_codex":0.0014704717,"about_ca_topic_score_gemma":0.0012402826,"teacher_disagreement_score":0.0014704717,"about_ca_system_score_codex":0.0007146039,"about_ca_system_score_gemma":0.00046950497,"threshold_uncertainty_score":0.0051848292},"labels":[],"label_agreement":null},{"id":"W2016099553","doi":"10.1109/dcc.2012.34","title":"Prospicient Real-Time Coding of Markov Sources over Burst Erasure Channels: Lossless Case","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Toronto","funders":"","keywords":"Erasure; Computer science; Algorithm; Markov process; Encoder; Source code; Markov chain; Lossy compression; Lossless compression; Rate–distortion theory; Data compression; Mathematics; Statistics","score_opus":0.01512948184916092,"score_gpt":0.2481720589761879,"score_spread":0.233042577127027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016099553","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.057006665,0.0010964937,0.9355484,0.0004298362,0.00003414665,0.000034719462,0.00011258895,0.00010695122,0.0056301937],"genre_scores_gemma":[0.9357229,0.001808936,0.05859662,0.0001194257,0.00008096422,0.00012572759,0.00011185013,0.00003701361,0.0033966412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928206,0.00020912882,0.000030460684,0.000069510344,0.0002853076,0.00012354697],"domain_scores_gemma":[0.99389124,0.004635553,0.0005980381,0.00032015739,0.00043778398,0.00011716373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019027818,0.00086054805,0.0007044211,0.00090897107,0.00038364326,0.0010935753,0.0009677887,0.00083338557,0.0012080772],"category_scores_gemma":[0.0081954375,0.00037614917,0.0003606449,0.0007656698,0.0020879384,0.002248475,0.0014133307,0.0016094622,0.00021471795],"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.00010359151,0.000030926138,0.00032484718,0.00010933632,0.000016729204,0.00025217875,0.00014569525,0.5241454,0.004770466,0.45777547,0.0005962164,0.011729088],"study_design_scores_gemma":[0.000008337397,0.000034430475,0.00007616032,0.000020425603,0.000004933737,0.00008170982,0.000018506535,0.92764014,0.0016591327,0.07009624,0.00034880196,0.000011253613],"about_ca_topic_score_codex":0.0016079963,"about_ca_topic_score_gemma":0.0009747935,"teacher_disagreement_score":0.0019027818,"about_ca_system_score_codex":0.0013495494,"about_ca_system_score_gemma":0.001021802,"threshold_uncertainty_score":0.010063052},"labels":[],"label_agreement":null},{"id":"W2016512982","doi":"10.1109/icuwb.2012.6340497","title":"A compressive sensing approach for secret key agreement based on UWB channel reciprocity","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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 British Columbia","funders":"","keywords":"Secrecy; Computer science; Key (lock); Reciprocity (cultural anthropology); Coding (social sciences); Key-agreement protocol; Channel (broadcasting); Distributed source coding; Channel code; Computer security; Theoretical computer science; Computer network; Algorithm; Decoding methods; Key distribution; Encryption; Mathematics; Public-key cryptography; Statistics","score_opus":0.037599711261938444,"score_gpt":0.2588956509038568,"score_spread":0.22129593964191835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016512982","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.0025876216,0.00012836597,0.9949891,0.00013792793,0.000035374647,0.000027163245,0.000012550082,0.000035531666,0.0020462375],"genre_scores_gemma":[0.37960613,0.0010853071,0.6136696,0.00028071945,0.0003122236,0.00026525214,0.00007970799,0.00003847272,0.0046626176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988871,0.00036571964,0.000048104237,0.00013959597,0.00050366175,0.00005575859],"domain_scores_gemma":[0.9991456,0.00048150748,0.00008168736,0.00014032278,0.00011678665,0.000034014058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009804519,0.0005003423,0.0005112289,0.00049131754,0.00042405128,0.00069589034,0.00088502374,0.00089808734,0.0015437771],"category_scores_gemma":[0.0023032047,0.00024004387,0.0006451366,0.0005153465,0.0015565293,0.0014418439,0.0016484525,0.0015522274,0.00040509022],"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.00016327045,0.00009696794,0.00026012096,0.0002808998,0.00007882859,0.0005071329,0.00036378205,0.17083338,0.07083017,0.6501565,0.0024438004,0.10398513],"study_design_scores_gemma":[0.000033796423,0.00018529558,0.00009163885,0.00003125253,0.000030895204,0.00054922496,0.00005298878,0.89607203,0.016039988,0.08004601,0.0068153045,0.0000514827],"about_ca_topic_score_codex":0.00026521942,"about_ca_topic_score_gemma":0.00025964226,"teacher_disagreement_score":0.0015437771,"about_ca_system_score_codex":0.00042635435,"about_ca_system_score_gemma":0.0005476792,"threshold_uncertainty_score":0.005185187},"labels":[],"label_agreement":null},{"id":"W2016853946","doi":"10.1142/s0129167x15500020","title":"Estimates for compression norms and additivity violation in quantum information","year":2015,"lang":"en","type":"article","venue":"International Journal of Mathematics","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"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 Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Additive function; Tensor product; Entropy (arrow of time); Generalized relative entropy; Quantum; Subspace topology; Hilbert space; Norm (philosophy); Quantum relative entropy","score_opus":0.03020951274825576,"score_gpt":0.2983890131908747,"score_spread":0.2681795004426189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016853946","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.17544988,0.0020247465,0.7912273,0.0025887447,0.00023825161,0.000100068755,0.00023268348,0.00029688893,0.027841529],"genre_scores_gemma":[0.8744857,0.0020080218,0.11031106,0.00087612576,0.00095516624,0.00046197587,0.0005312368,0.0005467114,0.009824063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942602,0.0019892654,0.00025714285,0.00064397976,0.0023872084,0.00046212832],"domain_scores_gemma":[0.95461375,0.03471381,0.0018713567,0.0031466668,0.0036930346,0.0019614643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009066507,0.0013757632,0.0013638319,0.004574392,0.0014960057,0.003000599,0.0024951866,0.001449591,0.003847486],"category_scores_gemma":[0.048186284,0.00076167745,0.0014166111,0.001696039,0.007335531,0.009948223,0.007548241,0.0057506394,0.0005109174],"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.00010632592,0.000036300782,0.00079840625,0.00013647428,0.000031848835,0.00016165151,0.0003311681,0.015449438,0.0036318614,0.9691849,0.0008946895,0.009236928],"study_design_scores_gemma":[0.000012447146,0.00010105836,0.0007989203,0.00006085576,0.000015080321,0.0002358082,0.00009541888,0.1524051,0.0033464686,0.84146917,0.0014090436,0.000050603274],"about_ca_topic_score_codex":0.000435955,"about_ca_topic_score_gemma":0.00027555221,"teacher_disagreement_score":0.009066507,"about_ca_system_score_codex":0.001727633,"about_ca_system_score_gemma":0.0008508992,"threshold_uncertainty_score":0.047948837},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016782926627893047,"score_gpt":0.21900775510987494,"score_spread":0.2022248284819819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016965008","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.065543555,0.01152299,0.81545836,0.00927573,0.0005680177,0.00008389663,0.0007259579,0.00031520447,0.09650628],"genre_scores_gemma":[0.88208145,0.014045231,0.053138446,0.0010436486,0.0018769528,0.00031618684,0.0006208629,0.00022843429,0.04664873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885166,0.00053728896,0.000038577156,0.00015053137,0.00030054135,0.00012144822],"domain_scores_gemma":[0.98837775,0.00935604,0.0008667404,0.00055308157,0.0006846827,0.0001617834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020892853,0.0013147427,0.0011413264,0.0016013881,0.0008546033,0.0025896477,0.0012027101,0.002475426,0.0069968607],"category_scores_gemma":[0.013318643,0.0009453204,0.000529147,0.002850667,0.0040064305,0.004262015,0.0014933428,0.0023553127,0.0009397375],"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.000022732513,0.000012917489,0.00009817351,0.00006881595,0.000012105683,0.00006641941,0.000108518834,0.051130604,0.00035294314,0.9412111,0.0027573723,0.004158225],"study_design_scores_gemma":[0.000016838796,0.000011537518,0.0001960055,0.000037918955,0.000012630861,0.00010751478,0.00006326498,0.14851826,0.00033609298,0.8466067,0.0040609604,0.000032410735],"about_ca_topic_score_codex":0.0023939118,"about_ca_topic_score_gemma":0.0013399816,"teacher_disagreement_score":0.0069968607,"about_ca_system_score_codex":0.0017103016,"about_ca_system_score_gemma":0.0011309303,"threshold_uncertainty_score":0.023406863},"labels":[],"label_agreement":null},{"id":"W2017406705","doi":"10.1049/iet-ifs.2011.0360","title":"Channel level crossing‐based security for communications over fading channels","year":2013,"lang":"en","type":"article","venue":"IET Information Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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 British Columbia","funders":"","keywords":"Fading; Computer science; Channel (broadcasting); Key exchange; Computer network; Wireless; Algorithm; Telecommunications; Public-key cryptography; Encryption","score_opus":0.0412891896859474,"score_gpt":0.2852454945105527,"score_spread":0.24395630482460529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017406705","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.020506736,0.0007999271,0.9758361,0.00013489401,0.000051378232,0.00006186981,0.000028090995,0.0002770539,0.0023040108],"genre_scores_gemma":[0.7765878,0.0009057043,0.22000307,0.00012706452,0.00007280061,0.00010280739,0.00007793491,0.000056678367,0.00206608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981805,0.00065217656,0.00009732088,0.00025686156,0.00060584315,0.00020731652],"domain_scores_gemma":[0.99551386,0.0027357212,0.00050111517,0.0007172882,0.00042170996,0.00011016873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024107597,0.00075002125,0.0011138577,0.0012490264,0.0007601449,0.0016268432,0.0010162822,0.0009895976,0.0027547863],"category_scores_gemma":[0.007676009,0.0002843227,0.00074992405,0.0010573368,0.002268712,0.0025126655,0.001966421,0.0015092792,0.00048497692],"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.0008855613,0.00013997278,0.0010357166,0.00051593065,0.00020823108,0.00024073108,0.0004788224,0.3698254,0.044753287,0.29590905,0.002507289,0.28350008],"study_design_scores_gemma":[0.00004277027,0.0003011798,0.00038410386,0.00005994278,0.000042331725,0.000310871,0.00004800016,0.9297953,0.023315202,0.04286893,0.0027722947,0.000059074322],"about_ca_topic_score_codex":0.00036169935,"about_ca_topic_score_gemma":0.0002568406,"teacher_disagreement_score":0.0027547863,"about_ca_system_score_codex":0.0009889347,"about_ca_system_score_gemma":0.0008225533,"threshold_uncertainty_score":0.0127494335},"labels":[],"label_agreement":null},{"id":"W2017526706","doi":"10.1109/iswcs.2011.6125345","title":"Distributed joint source-channel coding of correlated binary sources in wireless sensor networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"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 Manitoba","funders":"","keywords":"Puncturing; Distributed source coding; Variable-length code; Computer science; Binary number; Encoder; Source code; Algorithm; Binary symmetric channel; Wireless sensor network; Low-density parity-check code; Coding (social sciences); Channel code; Decoding methods; Block code; Shannon–Fano coding; Theoretical computer science; Mathematics; Computer network; Telecommunications; Statistics; Arithmetic","score_opus":0.02947744578863854,"score_gpt":0.2105372316257204,"score_spread":0.18105978583708188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017526706","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.0289271,0.00032751885,0.9696521,0.00011716665,0.000022572029,0.000028412203,0.000029863262,0.00011059799,0.0007846709],"genre_scores_gemma":[0.8187102,0.0004589721,0.17902608,0.000069434136,0.000048440717,0.00012957549,0.00010196749,0.000026110856,0.0014292235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877757,0.0005491301,0.000039917824,0.00012860686,0.00042613703,0.00007865441],"domain_scores_gemma":[0.9977301,0.0014284109,0.00021870603,0.0003245715,0.00025445072,0.000043866403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012852901,0.00052825,0.0007050443,0.000485311,0.00034223634,0.00053267996,0.000726383,0.0005833552,0.00041422315],"category_scores_gemma":[0.0036256623,0.00029093146,0.00029860713,0.00089403236,0.0009623304,0.0011383194,0.0012049088,0.0007291058,0.00012028378],"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.0003113465,0.000049211976,0.0005581223,0.00016369457,0.000047756555,0.00018225746,0.00015923117,0.81626266,0.01815489,0.073629856,0.00060988084,0.0898711],"study_design_scores_gemma":[0.000024679095,0.000047189656,0.00009968285,0.000011574297,0.000012315137,0.00006677274,0.000015084362,0.9771708,0.0066082967,0.015328329,0.00060311926,0.0000120710665],"about_ca_topic_score_codex":0.0008893238,"about_ca_topic_score_gemma":0.0010284558,"teacher_disagreement_score":0.0012852901,"about_ca_system_score_codex":0.00053928193,"about_ca_system_score_gemma":0.0009738731,"threshold_uncertainty_score":0.0067973137},"labels":[],"label_agreement":null},{"id":"W2019869643","doi":"10.1049/iet-com.2012.0079","title":"Secure joint source–channel coding with interference known at the transmitter","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":10,"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 Toronto","funders":"","keywords":"Transmitter; Computer science; Coding (social sciences); Gaussian; Channel (broadcasting); Decoding methods; Algorithm; Topology (electrical circuits); Mathematics; Telecommunications; Statistics; Physics","score_opus":0.03877616781752802,"score_gpt":0.2510152643250929,"score_spread":0.2122390965075649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019869643","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.027873913,0.00027457063,0.9686161,0.00016086728,0.000029622028,0.000031868447,0.00004859849,0.00007297175,0.0028914083],"genre_scores_gemma":[0.86769336,0.0004900833,0.12860769,0.00010391367,0.0000620427,0.000093577124,0.00011239155,0.000021402488,0.0028155062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986205,0.0003579421,0.000071912626,0.00018177686,0.0006076004,0.00016020915],"domain_scores_gemma":[0.9971685,0.0016502897,0.00034149154,0.00046643696,0.00032378518,0.000049475388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014908577,0.0006573485,0.0008672948,0.00045659393,0.00043434784,0.0011370741,0.001061722,0.0009106559,0.0010839558],"category_scores_gemma":[0.0037026922,0.00025714026,0.0005613784,0.0009789015,0.0015665853,0.0016139975,0.0016372389,0.0012001427,0.00024193739],"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.0003318097,0.000054270793,0.00055484794,0.00019910908,0.000060002778,0.00026338478,0.00026007643,0.62604266,0.010855345,0.30029675,0.00076180586,0.06031991],"study_design_scores_gemma":[0.00002234946,0.00006461717,0.00010552,0.000020107333,0.000021892283,0.00012404312,0.000025124677,0.9642211,0.0068125064,0.027645761,0.00091893924,0.000018108743],"about_ca_topic_score_codex":0.0012761628,"about_ca_topic_score_gemma":0.0008868496,"teacher_disagreement_score":0.0014908577,"about_ca_system_score_codex":0.0010303814,"about_ca_system_score_gemma":0.0013205864,"threshold_uncertainty_score":0.007884502},"labels":[],"label_agreement":null},{"id":"W2020175615","doi":"10.1049/iet-com.2014.0534","title":"Physical layer security of multiple‐input–multiple‐output systems with transmit beamforming in Rayleigh fading","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Rayleigh fading; Fading; Physical layer; Beamforming; Computer science; Telecommunications; Wireless; Channel (broadcasting)","score_opus":0.047980743773450754,"score_gpt":0.274168628319796,"score_spread":0.22618788454634525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020175615","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.11261659,0.0016760612,0.8741659,0.00054017996,0.00008046021,0.0000441098,0.00008346377,0.00013986563,0.010653343],"genre_scores_gemma":[0.9842442,0.0015235695,0.012487772,0.00005173313,0.000060739032,0.00004362374,0.000026955146,0.000016786977,0.0015445787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865615,0.00059962977,0.000050547293,0.00010625164,0.0003461083,0.00024132733],"domain_scores_gemma":[0.99619836,0.0027787127,0.00044505962,0.00019903423,0.00032633287,0.00005239742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001588228,0.0011931452,0.0008212556,0.00041753103,0.0005127249,0.0017271257,0.0004357668,0.001040211,0.0010631583],"category_scores_gemma":[0.0059419284,0.0004886155,0.00055962877,0.00053698506,0.0018938989,0.0022813766,0.0014419099,0.00080019765,0.00031164332],"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.00031763248,0.00003548768,0.0013803466,0.00030017082,0.00013844388,0.0006022047,0.00022196559,0.83555883,0.016248979,0.12436056,0.0009607404,0.019874593],"study_design_scores_gemma":[0.0000118578655,0.00009492433,0.00029108184,0.000030880612,0.000035441182,0.00017356378,0.000054662207,0.98254997,0.0033320815,0.012892607,0.0005100158,0.000022835808],"about_ca_topic_score_codex":0.0010107297,"about_ca_topic_score_gemma":0.00063333876,"teacher_disagreement_score":0.0017271257,"about_ca_system_score_codex":0.0008055169,"about_ca_system_score_gemma":0.0008342035,"threshold_uncertainty_score":0.008399427},"labels":[],"label_agreement":null},{"id":"W2021630594","doi":"10.1109/tit.2015.2414434","title":"On the Capacity Region of the Broadcast, the Interference, and the Cognitive Radio Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":13,"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":"Interference (communication); Decoding methods; Computer science; Channel (broadcasting); Cognitive radio; Topology (electrical circuits); Noise (video); Channel capacity; Gaussian; Computer network; Telecommunications; Mathematics; Wireless; Physics; Artificial intelligence","score_opus":0.02625614296765145,"score_gpt":0.21775804943482716,"score_spread":0.19150190646717571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021630594","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.069861695,0.009561208,0.83781135,0.0019129766,0.00016485913,0.000065141794,0.0005129338,0.00035753546,0.079752214],"genre_scores_gemma":[0.9475246,0.006634248,0.038136996,0.0005692921,0.00061014417,0.0003168576,0.00033455182,0.00017743903,0.0056957835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977585,0.0007227658,0.000052494997,0.00026233357,0.00065067847,0.0005531753],"domain_scores_gemma":[0.9841949,0.012358909,0.00096724066,0.00071848446,0.0013871515,0.00037333329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030266333,0.0014734651,0.001069079,0.0020916795,0.0009509017,0.0027968984,0.0015733952,0.0008943123,0.0037748774],"category_scores_gemma":[0.016611123,0.00045650842,0.00076343236,0.001705819,0.0043004556,0.0033763812,0.0025534555,0.0024622725,0.0007896154],"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.00014931512,0.000040689465,0.0003587781,0.00026863933,0.00004652044,0.00026989376,0.00042469587,0.17484117,0.0035594534,0.8032281,0.0033723086,0.013440432],"study_design_scores_gemma":[0.00002176536,0.00005349238,0.00047492405,0.00021088017,0.000040423056,0.00024850765,0.00016029475,0.52544475,0.0028914672,0.4650869,0.005304053,0.00006256016],"about_ca_topic_score_codex":0.003899743,"about_ca_topic_score_gemma":0.0013206525,"teacher_disagreement_score":0.003899743,"about_ca_system_score_codex":0.0025444855,"about_ca_system_score_gemma":0.0014705132,"threshold_uncertainty_score":0.018461645},"labels":[],"label_agreement":null},{"id":"W2021959691","doi":"10.48550/arxiv.1303.0572","title":"New Non-asymptotic Random Channel Coding Theorems","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"University of Waterloo","funders":"","keywords":"Mathematics; Code word; Discrete mathematics; Combinatorics; Applied mathematics; Decoding methods; Algorithm","score_opus":0.04084625595855619,"score_gpt":0.17502298044691036,"score_spread":0.13417672448835416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021959691","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.0063577094,0.00074435846,0.97460496,0.000459516,0.00020237832,0.00005546758,0.00016693132,0.00026271777,0.01714594],"genre_scores_gemma":[0.5515403,0.004476462,0.42225215,0.0017933035,0.001122697,0.0010297365,0.0008860365,0.0005854423,0.016313868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99337244,0.0022018172,0.00032110148,0.00089803507,0.0027128232,0.0004936735],"domain_scores_gemma":[0.9758143,0.016550472,0.0015607398,0.0031339761,0.002549584,0.00039084972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00786122,0.0021286418,0.0013827902,0.003060901,0.00094786147,0.0028550497,0.0030056473,0.0018856676,0.004206624],"category_scores_gemma":[0.0345646,0.0007434765,0.0016851432,0.0018158209,0.0047584483,0.005366194,0.003889938,0.006475348,0.001565136],"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.000037644902,0.000028193414,0.00025063276,0.00013125836,0.000030914747,0.00009733831,0.00011122301,0.031551704,0.0019614028,0.94944674,0.0020512955,0.014301681],"study_design_scores_gemma":[0.000021599106,0.000071374154,0.0003081165,0.00010189379,0.00003441762,0.00044610677,0.000038039467,0.3165189,0.0053165965,0.67098826,0.006078409,0.00007630452],"about_ca_topic_score_codex":0.0005114955,"about_ca_topic_score_gemma":0.00048259666,"teacher_disagreement_score":0.00786122,"about_ca_system_score_codex":0.00247303,"about_ca_system_score_gemma":0.0017195728,"threshold_uncertainty_score":0.041574657},"labels":[],"label_agreement":null},{"id":"W2022804642","doi":"10.1109/iccchina.2013.6671205","title":"Towards secure communications in cooperative cognitive radio networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"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":"Cognitive radio; Secrecy; Computer science; Relay; Computer network; Transmitter power output; Jamming; Bandwidth (computing); Transmission (telecommunications); Transmitter; Telecommunications; Power (physics); Computer security; Wireless","score_opus":0.020028209970835965,"score_gpt":0.26884876140369957,"score_spread":0.2488205514328636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022804642","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.0077700615,0.0016288611,0.9841717,0.00073688023,0.00009857251,0.000028894412,0.0000109314215,0.000067907866,0.005486206],"genre_scores_gemma":[0.78863114,0.0057486407,0.19915129,0.00071204145,0.0004464983,0.00027018404,0.000050845447,0.00003483908,0.004954577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765426,0.0010600585,0.00005683388,0.00017277118,0.00085919094,0.00019696816],"domain_scores_gemma":[0.9979692,0.0012068012,0.00020732722,0.00022421948,0.00031923162,0.00007316317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00240525,0.001014513,0.0007976981,0.00077013683,0.0007790189,0.0017441581,0.00144105,0.002056603,0.0009491013],"category_scores_gemma":[0.0056418283,0.0005045547,0.0006036027,0.0008846195,0.002484912,0.00225439,0.0030490854,0.002144257,0.0004245668],"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.000080416365,0.000045860736,0.00037624332,0.00020524347,0.000053546988,0.00036554656,0.00042329615,0.34229115,0.004967393,0.6122215,0.0021406554,0.036829166],"study_design_scores_gemma":[0.000029398178,0.00007137415,0.00006850303,0.00003466057,0.000013331704,0.000118168406,0.00007897173,0.75072753,0.00096687034,0.24308567,0.004785515,0.000019989167],"about_ca_topic_score_codex":0.0012383419,"about_ca_topic_score_gemma":0.00092741015,"teacher_disagreement_score":0.00240525,"about_ca_system_score_codex":0.00086289627,"about_ca_system_score_gemma":0.0010403721,"threshold_uncertainty_score":0.012720346},"labels":[],"label_agreement":null},{"id":"W2023079682","doi":"10.1117/12.840314","title":"Dynamic algorithm for correlation noise estimation in distributed video coding","year":2009,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Algorithm; Encoder; Coding (social sciences); Motion estimation; Pixel; Noise (video); Variance (accounting); Decoding methods; Artificial intelligence; Mathematics; Statistics; Image (mathematics)","score_opus":0.008402697376755202,"score_gpt":0.23925688619364255,"score_spread":0.23085418881688735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023079682","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.0014497618,0.00007182575,0.99794596,0.000030259485,0.000013783115,0.000016651298,0.000006871826,0.00011667646,0.0003481456],"genre_scores_gemma":[0.12792176,0.00026772954,0.8683622,0.00008206822,0.000050596842,0.00025334323,0.00013118917,0.000083559265,0.0028475686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907196,0.00018694048,0.000046352277,0.00015944899,0.00047735922,0.00005799613],"domain_scores_gemma":[0.9991398,0.00035166912,0.0000850179,0.0001340657,0.0002646993,0.00002470484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095501874,0.00061468454,0.00057009264,0.00087102246,0.00050042145,0.0008903493,0.0011659364,0.0006670001,0.0016351824],"category_scores_gemma":[0.0036118652,0.00037257126,0.00037005235,0.0010128601,0.0006308056,0.0011333671,0.0013618149,0.0011345661,0.00073445006],"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.00026883904,0.00008526287,0.0008997339,0.000081617894,0.000053836196,0.00010311182,0.00013106517,0.27494746,0.025922706,0.06854032,0.002658645,0.6263074],"study_design_scores_gemma":[0.000020140817,0.00003382919,0.00013997988,0.000011334601,0.0000071818126,0.000066412336,0.0000080624095,0.98423094,0.0066270516,0.0067856475,0.0020558282,0.0000136041945],"about_ca_topic_score_codex":0.0029439658,"about_ca_topic_score_gemma":0.003388329,"teacher_disagreement_score":0.0029439658,"about_ca_system_score_codex":0.0009845805,"about_ca_system_score_gemma":0.0014836271,"threshold_uncertainty_score":0.0071436763},"labels":[],"label_agreement":null},{"id":"W2024304958","doi":"10.1109/jsac.2013.131130","title":"Cooperative Spectrum Access Towards Secure Information Transfer for CRNs","year":2013,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":143,"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":"Computer science; Relay; Computer network; Secrecy; Transmission (telecommunications); Secure transmission; Beamforming; Jamming; Cognitive radio; Computer security; Power (physics); Telecommunications; Wireless","score_opus":0.030423715984027086,"score_gpt":0.29916438916850957,"score_spread":0.26874067318448247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024304958","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.019380515,0.00086846703,0.97100925,0.00022496298,0.000047505066,0.000049673523,0.000013874954,0.00010753196,0.008298256],"genre_scores_gemma":[0.9427439,0.0009909011,0.05332111,0.00014112594,0.00006938282,0.00016081393,0.00001759594,0.000016750819,0.0025384629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884963,0.00042698305,0.000039652066,0.00019587282,0.00033758077,0.00015027962],"domain_scores_gemma":[0.9992866,0.000328324,0.00011359946,0.00009356591,0.00014290684,0.000034951492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009884791,0.000751788,0.0006731036,0.00042958462,0.0005395328,0.0010645732,0.0009788587,0.000916422,0.0011393582],"category_scores_gemma":[0.0021443835,0.00029801272,0.00051275786,0.000657512,0.0014720501,0.0012182118,0.0022042298,0.0008824394,0.00025186257],"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.00017493262,0.000091958835,0.00042462413,0.0002580363,0.000067494,0.00045737528,0.0004927039,0.53784037,0.026702354,0.36882192,0.0020733415,0.06259482],"study_design_scores_gemma":[0.00001649662,0.0000743177,0.000060878585,0.000012972843,0.000012747697,0.000074694435,0.00004066736,0.95851785,0.0015303439,0.037687797,0.0019588242,0.000012404926],"about_ca_topic_score_codex":0.0011082196,"about_ca_topic_score_gemma":0.0006534253,"teacher_disagreement_score":0.0011393582,"about_ca_system_score_codex":0.000740747,"about_ca_system_score_gemma":0.00074014615,"threshold_uncertainty_score":0.005374551},"labels":[],"label_agreement":null},{"id":"W2024747068","doi":"10.1109/isit.2008.4594960","title":"Capacity of the discrete-time non-coherent memoryless Gaussian channels at low SNR","year":2008,"lang":"en","type":"article","venue":"","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":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Coherence (philosophical gambling strategy); Coherence time; Transmitter; Channel (broadcasting); Channel capacity; Topology (electrical circuits); Gaussian; Signal-to-noise ratio (imaging); Computer science; Mathematics; Algorithm; Telecommunications; Physics; Statistics; Combinatorics","score_opus":0.01663088005052649,"score_gpt":0.2159666508385651,"score_spread":0.1993357707880386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024747068","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.24000634,0.0017220787,0.7237442,0.0011170036,0.0000701448,0.00005579087,0.0003902168,0.00025769926,0.032636516],"genre_scores_gemma":[0.98073626,0.0009629789,0.0144504635,0.000101668884,0.00006035638,0.00007998765,0.00009843473,0.000035891473,0.0034740712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941015,0.00017611931,0.000018244154,0.000067983885,0.00017522235,0.00015224829],"domain_scores_gemma":[0.9972792,0.0019222103,0.00020944864,0.00020143764,0.00031436566,0.00007331501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009899235,0.00054488104,0.0006583579,0.00060504006,0.00030598565,0.0014922156,0.0007650353,0.0005287704,0.0023195115],"category_scores_gemma":[0.004725343,0.00020805838,0.0002523313,0.0006523781,0.0019070712,0.0014969242,0.001146344,0.00077603705,0.00036137158],"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.00016734704,0.000042322492,0.00036973014,0.00021405504,0.00002663723,0.00021923437,0.00019173876,0.5413476,0.012307875,0.43207645,0.0011426599,0.011894325],"study_design_scores_gemma":[0.000014881963,0.000027138369,0.00027437523,0.000035200734,0.000009803824,0.000077010525,0.00003435247,0.8804572,0.0046242597,0.113804415,0.00061832176,0.000023005581],"about_ca_topic_score_codex":0.0010762705,"about_ca_topic_score_gemma":0.00062612374,"teacher_disagreement_score":0.0023195115,"about_ca_system_score_codex":0.0010325271,"about_ca_system_score_gemma":0.0008477301,"threshold_uncertainty_score":0.007759571},"labels":[],"label_agreement":null},{"id":"W2025952794","doi":"10.1109/spawc.2013.6612135","title":"Secure key agreement over reciprocal fading channels in the low SNR regime","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Toronto","funders":"","keywords":"Fading; Upper and lower bounds; Computer science; Channel (broadcasting); Coherence time; Reciprocal; Key (lock); Transmission (telecommunications); Coherence (philosophical gambling strategy); Block (permutation group theory); Scaling; Channel capacity; Topology (electrical circuits); Theoretical computer science; Algorithm; Telecommunications; Mathematics; Combinatorics; Statistics; Computer security","score_opus":0.013557148156793476,"score_gpt":0.2340301712744029,"score_spread":0.2204730231176094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025952794","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.26008058,0.0026117319,0.6903675,0.0015486208,0.00011147135,0.00009055567,0.00033969362,0.00056722935,0.044282638],"genre_scores_gemma":[0.9865481,0.0010403476,0.010560189,0.00011554633,0.00007163715,0.00007897488,0.00005829883,0.000049120168,0.0014777291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997538,0.00083984,0.000074362535,0.00029399284,0.00057335175,0.00068061106],"domain_scores_gemma":[0.97464436,0.020994173,0.0016783881,0.0014400812,0.00081815966,0.00042473865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026829334,0.0014808726,0.0011947522,0.0011978614,0.00086250255,0.0025634032,0.0010843922,0.0011094998,0.003459397],"category_scores_gemma":[0.022410048,0.0005261879,0.0004921392,0.0012570603,0.0055457265,0.004916572,0.0027592382,0.002204687,0.00071489],"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.00031634152,0.000070656955,0.00057861983,0.00028065234,0.000058013953,0.0004446572,0.00040949037,0.42045578,0.011107544,0.5551523,0.0016094946,0.009516343],"study_design_scores_gemma":[0.0000345527,0.00009025537,0.00033402626,0.000053280128,0.000024614232,0.00022422898,0.000117438685,0.7979136,0.0046049757,0.19569914,0.0008519563,0.00005187425],"about_ca_topic_score_codex":0.0011265449,"about_ca_topic_score_gemma":0.0005313911,"teacher_disagreement_score":0.003459397,"about_ca_system_score_codex":0.0015894149,"about_ca_system_score_gemma":0.00081178854,"threshold_uncertainty_score":0.014188886},"labels":[],"label_agreement":null},{"id":"W2026964900","doi":"10.1109/3pgcic.2012.62","title":"Secret Key Generation within Peer-to-Peer Network Overlays","year":2012,"lang":"en","type":"article","venue":"","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":"University of Victoria","funders":"","keywords":"Computer science; Peer-to-peer; Computer network; Key (lock); Overlay network; Key generation; Reciprocity (cultural anthropology); Wireless; Distributed computing; Network topology; Adversary; Wireless network; Computer security; Telecommunications; Encryption; World Wide Web; The Internet","score_opus":0.029136156039335916,"score_gpt":0.25997528337799536,"score_spread":0.23083912733865944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026964900","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.0457588,0.00036586268,0.9510424,0.00015486928,0.00003417381,0.0000870413,0.000037725942,0.00029960752,0.0022195647],"genre_scores_gemma":[0.9017501,0.0004520245,0.09605718,0.00003101427,0.000040240237,0.00008592544,0.000049839553,0.000031870342,0.0015018025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834776,0.0005826971,0.00009779413,0.00028311275,0.00052717025,0.000161328],"domain_scores_gemma":[0.99732333,0.0014405259,0.0002803343,0.0006003522,0.00026990433,0.00008561226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016885069,0.00036226198,0.0007972976,0.0005355411,0.00084847887,0.0009497702,0.0011618459,0.0007348806,0.00092926546],"category_scores_gemma":[0.005104175,0.00025429818,0.00034528956,0.00063378585,0.0012291032,0.0031385752,0.0026402336,0.00077109225,0.00036712742],"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.00039121695,0.0001078094,0.0011785618,0.00037819005,0.00008671581,0.0012513924,0.0009027872,0.50285435,0.06268068,0.27502424,0.0021431125,0.1530009],"study_design_scores_gemma":[0.000036843478,0.00011593199,0.0002020789,0.000019873783,0.00002371527,0.00037884412,0.00016024786,0.8682335,0.020234084,0.104731604,0.005833108,0.000030271607],"about_ca_topic_score_codex":0.0002872435,"about_ca_topic_score_gemma":0.00022159674,"teacher_disagreement_score":0.0016885069,"about_ca_system_score_codex":0.00051337556,"about_ca_system_score_gemma":0.00061133044,"threshold_uncertainty_score":0.008929789},"labels":[],"label_agreement":null},{"id":"W2027074016","doi":"10.1109/wcnc.2013.6554818","title":"Cooperative networking towards secure communications for CRNs","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":17,"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":"Relay; Secrecy; Computer science; Computer network; Beamforming; Jamming; Transmission (telecommunications); Cognitive radio; Scheme (mathematics); Secure transmission; Power (physics); Telecommunications; Wireless; Computer security","score_opus":0.03149038562475051,"score_gpt":0.2745111581986087,"score_spread":0.2430207725738582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027074016","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.017629435,0.0029988964,0.96676785,0.00078876235,0.00013177714,0.00004904721,0.000017050099,0.000071434835,0.011545706],"genre_scores_gemma":[0.8638581,0.0050157276,0.12500246,0.00037234853,0.00022492236,0.00018519085,0.000029417983,0.000030915988,0.0052809906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908745,0.0004569143,0.000021526605,0.00010189946,0.00024153932,0.00009063748],"domain_scores_gemma":[0.99925226,0.00044043956,0.000094405485,0.000064532745,0.000119635995,0.000028720771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010907203,0.0007887249,0.0006001622,0.0004020695,0.0005087929,0.0011142768,0.00092941726,0.0010917411,0.0010829375],"category_scores_gemma":[0.0023630126,0.0003299696,0.000511016,0.0005579484,0.0012358044,0.0015270981,0.0015591905,0.001105217,0.00023210653],"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.00006442215,0.000045883913,0.00040424365,0.00026313192,0.000050374972,0.00030946633,0.00026405827,0.6023659,0.006491189,0.35867074,0.0017704254,0.029300118],"study_design_scores_gemma":[0.000016187207,0.000069212016,0.000080465026,0.00002386353,0.0000148449235,0.000089889094,0.000066694236,0.92086965,0.0008387319,0.073824555,0.0040945844,0.000011258324],"about_ca_topic_score_codex":0.0012888298,"about_ca_topic_score_gemma":0.0010528789,"teacher_disagreement_score":0.0012888298,"about_ca_system_score_codex":0.00084652373,"about_ca_system_score_gemma":0.00066964084,"threshold_uncertainty_score":0.0061419606},"labels":[],"label_agreement":null},{"id":"W2027121408","doi":"10.1109/tit.2013.2245397","title":"Vector Gaussian Two-Terminal Source Coding","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Gaussian; Upper and lower bounds; Mathematics; Terminal (telecommunication); Coding (social sciences); Algorithm; Discrete mathematics; Combinatorics; Computer science; Mathematical analysis; Telecommunications; Statistics; Physics","score_opus":0.007738102270047929,"score_gpt":0.22013845442741542,"score_spread":0.2124003521573675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027121408","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.011354933,0.0006052615,0.97486556,0.00043782694,0.00008450671,0.00003629995,0.00013978757,0.00010067744,0.012375202],"genre_scores_gemma":[0.7714173,0.0024649063,0.20828275,0.0005650304,0.0003936357,0.00038294867,0.00072391646,0.00016744873,0.015601964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831414,0.00049843534,0.000072012495,0.00022677434,0.0006067731,0.00028183253],"domain_scores_gemma":[0.9925014,0.0052701794,0.00047486692,0.0005150089,0.0010384825,0.00020001293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002695343,0.0015684046,0.0014901934,0.0011968326,0.00060409936,0.002644241,0.0019341836,0.0015409323,0.006459825],"category_scores_gemma":[0.0127858,0.0004200161,0.0006326869,0.0015413294,0.0018481305,0.0028375715,0.0037409144,0.0025910076,0.0015446013],"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.00022029583,0.0000526494,0.00043178332,0.00032645417,0.00003979089,0.00028021165,0.00014266228,0.20394686,0.0069257114,0.74186355,0.0040132552,0.04175682],"study_design_scores_gemma":[0.000030466437,0.00007902385,0.0001414988,0.00008420553,0.000020353229,0.00025998225,0.00004672721,0.80983394,0.005876768,0.18095592,0.002632269,0.00003888954],"about_ca_topic_score_codex":0.00066533574,"about_ca_topic_score_gemma":0.0005713688,"teacher_disagreement_score":0.006459825,"about_ca_system_score_codex":0.0010451892,"about_ca_system_score_gemma":0.0011474179,"threshold_uncertainty_score":0.02161032},"labels":[],"label_agreement":null},{"id":"W2027174613","doi":"10.1109/isit.2013.6620229","title":"Codes for limited view adversarial channels","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":14,"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":"Code word; Adversarial system; Computer science; Probabilistic logic; Channel (broadcasting); Code (set theory); Theoretical computer science; Artificial intelligence; Algorithm; Decoding methods; Programming language; Computer network","score_opus":0.02057256719458495,"score_gpt":0.24751296796361846,"score_spread":0.22694040076903352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027174613","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.026820883,0.00081120414,0.9604663,0.0013569961,0.00015891717,0.00015294157,0.00030318467,0.0004531686,0.009476347],"genre_scores_gemma":[0.8890515,0.0013706281,0.09372884,0.00080197206,0.00033326723,0.0005451023,0.00054779206,0.00022134997,0.01339959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99481106,0.0016944208,0.00020861787,0.00073813833,0.0016256585,0.0009221944],"domain_scores_gemma":[0.97404873,0.016693933,0.0024829248,0.0033491433,0.002459539,0.0009656743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00390658,0.0014548365,0.00136679,0.0013476921,0.0011178416,0.0029498418,0.0017669146,0.0022734033,0.0042666113],"category_scores_gemma":[0.026039636,0.0005519986,0.0007121273,0.0013482486,0.004094166,0.0051330323,0.0056038103,0.0040594493,0.001132302],"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.00040427622,0.00005279652,0.00056460185,0.00019813835,0.000041037776,0.00023075948,0.00025017813,0.3264094,0.0033884337,0.6383484,0.004865256,0.025246743],"study_design_scores_gemma":[0.000043243195,0.00011433685,0.00014780393,0.00007755877,0.000018900708,0.00016370081,0.000055664375,0.7596689,0.0027938324,0.23356262,0.0033061062,0.00004737199],"about_ca_topic_score_codex":0.0015700443,"about_ca_topic_score_gemma":0.0012718195,"teacher_disagreement_score":0.0042666113,"about_ca_system_score_codex":0.002928161,"about_ca_system_score_gemma":0.0025628668,"threshold_uncertainty_score":0.02124542},"labels":[],"label_agreement":null},{"id":"W2030280887","doi":"10.1109/aina.2014.60","title":"Channel Estimation for Secret Key Generation","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"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":"Key (lock); Computer science; Key generation; Channel (broadcasting); Quantization (signal processing); Algorithm; Wireless; Mutual information; Kalman filter; Upper and lower bounds; Vector quantization; Additive white Gaussian noise; Theoretical computer science; Decoding methods; Telecommunications; Mathematics; Cryptography; Artificial intelligence; Computer security","score_opus":0.022949773705493958,"score_gpt":0.2471325750335955,"score_spread":0.22418280132810156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030280887","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.0018004966,0.00067433325,0.99413633,0.0001927253,0.00009488167,0.000018262821,0.000034405213,0.00021143553,0.0028371462],"genre_scores_gemma":[0.5201925,0.005074695,0.46323356,0.0003432,0.00053641543,0.00016784987,0.00035744923,0.00020045578,0.009893912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985946,0.00042007206,0.00005416789,0.00022416729,0.0005859306,0.00012110079],"domain_scores_gemma":[0.99859923,0.00071133795,0.000110232184,0.00038212223,0.00017362824,0.000023405346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092488463,0.00059244165,0.0006208301,0.0005581388,0.0006131825,0.0010686585,0.0005608086,0.00092289347,0.0045101843],"category_scores_gemma":[0.004264266,0.00031777166,0.00046406282,0.00072964065,0.0010568092,0.0020959019,0.001254184,0.0016706247,0.0021161898],"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.00023955853,0.00005506773,0.00046770752,0.0003510651,0.0000827877,0.00015288744,0.00013552661,0.2035749,0.04141449,0.48356014,0.0073460722,0.2626198],"study_design_scores_gemma":[0.000025912315,0.00008825874,0.0002997841,0.00008670814,0.000036530688,0.0003872907,0.000049956485,0.8167943,0.038475424,0.11260821,0.031086033,0.00006166591],"about_ca_topic_score_codex":0.0006890105,"about_ca_topic_score_gemma":0.00066608243,"teacher_disagreement_score":0.0045101843,"about_ca_system_score_codex":0.0007233311,"about_ca_system_score_gemma":0.00086854893,"threshold_uncertainty_score":0.015088081},"labels":[],"label_agreement":null},{"id":"W2030367715","doi":"10.1109/icecs.2014.7050087","title":"Side information generation using optical flow and block matching in Wyner-Ziv video coding","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"Concordia University","funders":"","keywords":"Computer science; Motion interpolation; Residual frame; Optical flow; Algorithm; Coding (social sciences); Codec; Motion estimation; Reference frame; Motion compensation; Image warping; Decoding methods; Block-matching algorithm; Computer vision; Mathematics; Frame (networking); Video processing; Video tracking; Telecommunications","score_opus":0.016574558461108464,"score_gpt":0.23538381858216645,"score_spread":0.21880926012105797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030367715","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.008566415,0.00017009367,0.990194,0.000035987152,0.000023115084,0.000030051591,0.000016472033,0.00008082104,0.00088293443],"genre_scores_gemma":[0.16786611,0.000453167,0.82884693,0.00006404373,0.00003731988,0.00009097755,0.00010628241,0.000043189055,0.0024919673],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999635,0.00008131881,0.000019915624,0.000038305574,0.00020035326,0.000025120906],"domain_scores_gemma":[0.99966776,0.00011438576,0.00005310425,0.000065401684,0.00008642413,0.000012896298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060305983,0.0004744023,0.0003902534,0.000660495,0.00026367136,0.00044952965,0.0006035978,0.00053544587,0.0009981338],"category_scores_gemma":[0.0012070115,0.0001944355,0.00035642908,0.0006063744,0.00043814746,0.0012056637,0.00051853445,0.00066234695,0.0002781243],"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.0003364633,0.000084110616,0.00093789183,0.0002188849,0.00004910182,0.0002399928,0.00020793588,0.1637933,0.17290808,0.15786718,0.0017285391,0.5016286],"study_design_scores_gemma":[0.000017624923,0.00009342168,0.00021477655,0.000021811997,0.000012952807,0.00018647195,0.0000123192085,0.92999375,0.05641451,0.009610826,0.0033976173,0.000023819404],"about_ca_topic_score_codex":0.0012967866,"about_ca_topic_score_gemma":0.0015640619,"teacher_disagreement_score":0.0012967866,"about_ca_system_score_codex":0.00050278055,"about_ca_system_score_gemma":0.0005920082,"threshold_uncertainty_score":0.0036479235},"labels":[],"label_agreement":null},{"id":"W2032013577","doi":"10.1109/icc.2014.6883837","title":"Physical-layer security for indoor visible light communications","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":129,"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 British Columbia","funders":"","keywords":"Visible light communication; Transmitter; Computer science; Physical layer; Precoding; Channel state information; Artificial noise; Channel (broadcasting); Transmission (telecommunications); Computer network; Secure transmission; Secrecy; Additive white Gaussian noise; Electronic engineering; Wireless; Telecommunications; Computer security; MIMO; Electrical engineering; Engineering","score_opus":0.02036847488631251,"score_gpt":0.2850855773704327,"score_spread":0.2647171024841202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032013577","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.060275182,0.0018794724,0.9215308,0.000549794,0.000060826096,0.000033354372,0.00006157773,0.00016109942,0.015447922],"genre_scores_gemma":[0.9614165,0.0012519511,0.03567318,0.00007197394,0.00004190886,0.000031941407,0.000026077574,0.00002173318,0.0014646817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990854,0.0003596585,0.000027802154,0.000083048064,0.00032028556,0.00012381632],"domain_scores_gemma":[0.99885106,0.00064996805,0.0001944606,0.00017652813,0.000105684856,0.000022252756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001027991,0.000672557,0.00048161368,0.0003048027,0.00053094205,0.0013825236,0.00048600792,0.00082223595,0.0012349237],"category_scores_gemma":[0.0022788837,0.00024609367,0.00050001236,0.00042863056,0.0014930491,0.001554865,0.0012207202,0.00088685297,0.0003050914],"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.0001550714,0.00006380063,0.0010156566,0.00028506765,0.00006209156,0.0002686066,0.0001703118,0.65205467,0.034100633,0.27582163,0.0011358609,0.034866683],"study_design_scores_gemma":[0.0000169024,0.0001249364,0.00030856626,0.00004946608,0.00002189629,0.00019804652,0.00006276093,0.94415843,0.010074383,0.042570382,0.0023885223,0.000025586885],"about_ca_topic_score_codex":0.00062954734,"about_ca_topic_score_gemma":0.00052442035,"teacher_disagreement_score":0.0013825236,"about_ca_system_score_codex":0.00071537896,"about_ca_system_score_gemma":0.00081300706,"threshold_uncertainty_score":0.0054365993},"labels":[],"label_agreement":null},{"id":"W2032278718","doi":"10.1109/tsp.2011.2172433","title":"Joint Secure Beamforming Design at the Source and the Relay for an Amplify-and-Forward MIMO Untrusted Relay System","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":246,"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":"Relay; Beamforming; Computer science; MIMO; Relay channel; Computer network; Secrecy; Artificial noise; Signal-to-noise ratio (imaging); Telecommunications; Computer security; Transmitter; Channel (broadcasting); Power (physics)","score_opus":0.04682904883414673,"score_gpt":0.23638887290567748,"score_spread":0.18955982407153074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032278718","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.02866435,0.00037189637,0.9673579,0.00023664704,0.000032211585,0.000055860073,0.000041840536,0.00008572537,0.0031535402],"genre_scores_gemma":[0.9333217,0.0007550523,0.06298275,0.00005983856,0.000041540494,0.00012811077,0.000038343638,0.000013468898,0.0026590936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990994,0.00037904552,0.000050988325,0.00011066236,0.0002636122,0.00009641452],"domain_scores_gemma":[0.99880683,0.0005084993,0.00026116587,0.000089459725,0.00028060324,0.000053508633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016862047,0.0010804979,0.00091153575,0.00035134947,0.00047361045,0.0012148254,0.00072323566,0.0011033576,0.0018684169],"category_scores_gemma":[0.0020859176,0.0005031809,0.00053280464,0.0005537735,0.0012278588,0.0011243584,0.0008949434,0.00064040365,0.00058518315],"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.00018245957,0.000029805939,0.00045304568,0.00014552023,0.00006151967,0.00034496692,0.00016073218,0.9240106,0.015550264,0.044902172,0.000449448,0.013709437],"study_design_scores_gemma":[0.00002679763,0.00008686805,0.00008227161,0.000007863679,0.000020964928,0.00004814336,0.000024205392,0.9935737,0.0017073855,0.004186505,0.00022282696,0.000012358355],"about_ca_topic_score_codex":0.0016473652,"about_ca_topic_score_gemma":0.0017261411,"teacher_disagreement_score":0.0018684169,"about_ca_system_score_codex":0.0007577004,"about_ca_system_score_gemma":0.001072603,"threshold_uncertainty_score":0.00891757},"labels":[],"label_agreement":null},{"id":"W2033336691","doi":"10.1007/s00220-012-1451-x","title":"Entanglement can Increase Asymptotic Rates of Zero-Error Classical Communication over Classical Channels","year":2012,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":32,"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 Waterloo","funders":"","keywords":"Quantum entanglement; Communication source; Limit (mathematics); Channel (broadcasting); Decoding methods; Zero (linguistics); Quantum channel; Amplitude damping channel","score_opus":0.05755825214140101,"score_gpt":0.33312630322653997,"score_spread":0.27556805108513893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033336691","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47025642,0.0015990835,0.4550948,0.0044951322,0.00048107194,0.000094242285,0.0002403059,0.0014496986,0.06628927],"genre_scores_gemma":[0.9790582,0.00046755528,0.015795998,0.00031952778,0.00024080405,0.00007028243,0.000054890643,0.00022227512,0.0037705107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720997,0.0011886825,0.00009268144,0.00035794394,0.00058972166,0.00056099443],"domain_scores_gemma":[0.94791406,0.041983888,0.0019560975,0.0049236184,0.0016546051,0.0015676651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005369379,0.0011106177,0.0009907712,0.0018260647,0.001605982,0.002382151,0.0020544052,0.0024169383,0.0069553894],"category_scores_gemma":[0.05104846,0.0009361098,0.0008761169,0.0010275405,0.005884652,0.0090751825,0.0060120784,0.0043524127,0.0006522649],"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.00031211873,0.0001279109,0.00077401375,0.00010718333,0.000033620017,0.00010838898,0.00025870718,0.034261398,0.0048639756,0.9496327,0.0011322367,0.008387786],"study_design_scores_gemma":[0.000045024353,0.00008193576,0.0005288359,0.00007051929,0.00003429652,0.00014700567,0.00008278095,0.21122558,0.004874965,0.78202456,0.0008253702,0.000059033227],"about_ca_topic_score_codex":0.00040594704,"about_ca_topic_score_gemma":0.00042410058,"teacher_disagreement_score":0.0069553894,"about_ca_system_score_codex":0.0013627711,"about_ca_system_score_gemma":0.0012604017,"threshold_uncertainty_score":0.028396308},"labels":[],"label_agreement":null},{"id":"W2034185511","doi":"10.1109/icc.2013.6654851","title":"Intercept probability analysis of cooperative wireless networks with best relay selection in the presence of eavesdropping attack","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Eavesdropping; Relay; Rayleigh fading; Computer network; Computer science; Relay channel; Wireless; Selection (genetic algorithm); Physical layer; Transmission (telecommunications); Fading; Wireless network; Channel (broadcasting); Telecommunications; Artificial intelligence","score_opus":0.03107081758075867,"score_gpt":0.27874379812764893,"score_spread":0.24767298054689027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034185511","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.17887145,0.002115313,0.81145734,0.00053721736,0.000037819704,0.00009168902,0.00012797414,0.000304771,0.0064563914],"genre_scores_gemma":[0.98892516,0.0010252304,0.008662076,0.000055764227,0.00003120081,0.00006418239,0.000049650735,0.000025534717,0.0011610637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833125,0.000721397,0.00006583931,0.00018525982,0.00043754687,0.00025874175],"domain_scores_gemma":[0.9848274,0.011742337,0.0016320836,0.00051798916,0.0010925757,0.00018768736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003294296,0.0013135481,0.0014008338,0.0014488443,0.00052272005,0.0014832632,0.0013764198,0.0011289283,0.0012156884],"category_scores_gemma":[0.014300138,0.00076213846,0.00075640256,0.001265508,0.0023893462,0.0019296877,0.001562728,0.001213741,0.00027812854],"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.00016196149,0.0000322506,0.0024218755,0.0001359348,0.000099715566,0.00060428,0.00029595534,0.9487147,0.0045115515,0.034681823,0.00062730635,0.0077127074],"study_design_scores_gemma":[0.000008172587,0.000048878504,0.0005641107,0.000016983711,0.000042737534,0.0001941815,0.00005522331,0.99086905,0.00091775553,0.007065022,0.00019987831,0.000018036339],"about_ca_topic_score_codex":0.0023989982,"about_ca_topic_score_gemma":0.0011500288,"teacher_disagreement_score":0.003294296,"about_ca_system_score_codex":0.0018536266,"about_ca_system_score_gemma":0.0008000187,"threshold_uncertainty_score":0.01742208},"labels":[],"label_agreement":null},{"id":"W2035512140","doi":"10.1109/ita.2009.5044978","title":"Gaussian Z-interference channel with a relay link: Type II channel and sum capacity bound","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"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 Toronto","funders":"LG Electronics","keywords":"Interference (communication); Relay channel; Relay; Channel (broadcasting); Co-channel interference; Topology (electrical circuits); Upper and lower bounds; Channel capacity; Zero-forcing precoding; Adjacent-channel interference; Signal-to-noise ratio (imaging); Noise (video); Telecommunications; Computer science; Physics; Mathematics; MIMO; Precoding; Combinatorics; Mathematical analysis; Power (physics)","score_opus":0.022374191908771438,"score_gpt":0.2314587614005191,"score_spread":0.20908456949174767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035512140","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.093527436,0.0034017453,0.8534479,0.0015113404,0.00020771094,0.00009273236,0.0004363924,0.00044431715,0.04693037],"genre_scores_gemma":[0.96629214,0.0029095334,0.024912812,0.00049243,0.00028462775,0.00016284303,0.00012992653,0.00006523341,0.0047504376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882954,0.00031367052,0.000031117535,0.0001360965,0.0003123487,0.00037724126],"domain_scores_gemma":[0.99344856,0.0045883344,0.00077480706,0.00037477442,0.000631889,0.00018159531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015073027,0.0011553459,0.0011166554,0.0009629756,0.00079283596,0.0024169923,0.0010636917,0.0011259886,0.0026819103],"category_scores_gemma":[0.007270627,0.0003593068,0.00052674615,0.0016263027,0.0032296313,0.0024185183,0.0016286357,0.0015570254,0.0006471962],"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.00036663705,0.00006300712,0.0011485037,0.00032983223,0.00007340262,0.00079741457,0.0002820613,0.3315645,0.0066406867,0.63731486,0.006749542,0.014669651],"study_design_scores_gemma":[0.000044769124,0.000100342026,0.00046431902,0.000060368126,0.00005906696,0.0007302214,0.0001456337,0.8401228,0.003286938,0.15133826,0.0035776247,0.000069580296],"about_ca_topic_score_codex":0.0024022073,"about_ca_topic_score_gemma":0.0009832511,"teacher_disagreement_score":0.0026819103,"about_ca_system_score_codex":0.0015630955,"about_ca_system_score_gemma":0.0010270625,"threshold_uncertainty_score":0.011341155},"labels":[],"label_agreement":null},{"id":"W2035643157","doi":"10.1007/s11235-011-9540-2","title":"Framework for MIMO cross-layer secure communication based on STBC","year":2011,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"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 Waterloo","funders":"","keywords":"Computer science; Physical layer; Computer network; MIMO; Space–time block code; Communication source; Wireless; Channel (broadcasting); Telecommunications","score_opus":0.07330059585761008,"score_gpt":0.3183980370406202,"score_spread":0.24509744118301013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035643157","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.0019554151,0.00024982466,0.9935482,0.00009690574,0.00006487176,0.00006908515,0.00006735568,0.0004425248,0.003505786],"genre_scores_gemma":[0.28815565,0.0015354608,0.6984283,0.00021880951,0.00024528522,0.0005015643,0.00038480395,0.0001676126,0.010362563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992623,0.0001577701,0.000040545077,0.0000767262,0.00034994818,0.00011274439],"domain_scores_gemma":[0.9996731,0.00006618969,0.000024245393,0.000090310336,0.000116659685,0.00002955608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008684207,0.00070686114,0.00093962596,0.00063890213,0.0006381965,0.001641036,0.0011841434,0.00081221294,0.0038325016],"category_scores_gemma":[0.00074008305,0.00030620454,0.0006977219,0.00071628526,0.00063638925,0.0010786353,0.0011866258,0.0014346486,0.0019286522],"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.00014750149,0.000116475494,0.00023623285,0.0002073066,0.00008442378,0.00038225163,0.00019630074,0.16468915,0.027425164,0.72716534,0.005863037,0.073486716],"study_design_scores_gemma":[0.000053760923,0.00012787052,0.00012381928,0.000043937216,0.000042428128,0.0002841491,0.000036616966,0.87219095,0.0070280745,0.10205288,0.017965415,0.00005004731],"about_ca_topic_score_codex":0.0027483383,"about_ca_topic_score_gemma":0.0033505843,"teacher_disagreement_score":0.0038325016,"about_ca_system_score_codex":0.0008047834,"about_ca_system_score_gemma":0.0016134237,"threshold_uncertainty_score":0.012820959},"labels":[],"label_agreement":null},{"id":"W2035650567","doi":"10.1002/sec.35","title":"Insider attack attribution using signal strength‐based hyperbolic location estimation","year":2008,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Transmission (telecommunications); RSS; Computer security; Transmitter; Probabilistic logic; SIGNAL (programming language); Verifiable secret sharing; Computer network; Algorithm; Telecommunications; Channel (broadcasting); Set (abstract data type); Artificial intelligence","score_opus":0.0342928553258464,"score_gpt":0.25768785864328114,"score_spread":0.22339500331743473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035650567","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.14213525,0.00029877122,0.8531001,0.0002100769,0.000070649374,0.00008097473,0.00009221623,0.0011125965,0.0028992828],"genre_scores_gemma":[0.9314105,0.00017340337,0.06688838,0.000027242702,0.000057830588,0.00003866061,0.00011782307,0.000030961037,0.001255258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773705,0.0008569953,0.00014276037,0.00036549583,0.00076785474,0.00012984566],"domain_scores_gemma":[0.9901153,0.003999473,0.0026003271,0.0014760018,0.0015571446,0.00025177913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020352644,0.0007250997,0.0009387809,0.0026306228,0.00037385174,0.00134804,0.00107421,0.000765118,0.0011709817],"category_scores_gemma":[0.015475412,0.0003934137,0.00046728685,0.0009809779,0.0008792019,0.0026884137,0.0022324924,0.0007820227,0.0010333754],"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.0011345311,0.00019906514,0.031471696,0.00018392986,0.00023028141,0.00042604058,0.00048211752,0.35902244,0.02516215,0.017412037,0.001929011,0.5623466],"study_design_scores_gemma":[0.000016118895,0.00009163662,0.0027715599,0.000013766987,0.00002220607,0.00020366469,0.000051283616,0.98833114,0.0055937865,0.0023632674,0.0005118997,0.00002964402],"about_ca_topic_score_codex":0.00090847845,"about_ca_topic_score_gemma":0.00054346886,"teacher_disagreement_score":0.0026306228,"about_ca_system_score_codex":0.0006035287,"about_ca_system_score_gemma":0.00048285432,"threshold_uncertainty_score":0.010763586},"labels":[],"label_agreement":null},{"id":"W2036235015","doi":"10.1109/glocom.2014.7037452","title":"Channel-based physical layer authentication","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":66,"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":"Computer science; Support vector machine; Channel (broadcasting); Authentication (law); False alarm; Linear discriminant analysis; Pattern recognition (psychology); Artificial intelligence; Machine learning; Computer network; Computer security","score_opus":0.013274012276034445,"score_gpt":0.24251916230877033,"score_spread":0.22924515003273588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036235015","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.049444295,0.0015295772,0.9438199,0.00024808824,0.0002493851,0.000109581415,0.00007638271,0.00057192217,0.0039508026],"genre_scores_gemma":[0.9591558,0.0005850039,0.03777425,0.00006800646,0.00011137907,0.000047608515,0.000050580402,0.000015718679,0.0021916756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984579,0.00042387555,0.00009813763,0.00020608713,0.0004967078,0.0003172653],"domain_scores_gemma":[0.9974209,0.0011461241,0.00033213702,0.0005308911,0.0005105343,0.00005940838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010099044,0.0006593343,0.00081005035,0.0007475384,0.00056334236,0.0010678738,0.00073603954,0.0008272463,0.0021579661],"category_scores_gemma":[0.004087264,0.00022654471,0.00044860225,0.00068891165,0.00089645013,0.0026420928,0.0012559593,0.00068093516,0.00061688805],"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.0012575686,0.0002232056,0.0057653105,0.0005617049,0.00015636724,0.00069033296,0.00027039772,0.46357512,0.056294326,0.09112528,0.0035648835,0.37651536],"study_design_scores_gemma":[0.000015621325,0.00013243828,0.00056981016,0.00001338009,0.000033282548,0.00029253398,0.000028107552,0.9825164,0.009514518,0.0050817872,0.0017795134,0.00002256262],"about_ca_topic_score_codex":0.0008813664,"about_ca_topic_score_gemma":0.00063661183,"teacher_disagreement_score":0.0021579661,"about_ca_system_score_codex":0.0006036576,"about_ca_system_score_gemma":0.0008906819,"threshold_uncertainty_score":0.007219076},"labels":[],"label_agreement":null},{"id":"W2037957312","doi":"10.1109/chinacom.2011.6158162","title":"On the capacity of finite-state channels with noisy state information at the encoder","year":2011,"lang":"en","type":"article","venue":"","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":"McMaster University","funders":"","keywords":"Encoder; Finite state; State (computer science); Computer science; Process (computing); Finite-state machine; State information; Upper and lower bounds; Decoding methods; Algorithm; Mathematics; Mathematical analysis; Markov chain","score_opus":0.028499100538051454,"score_gpt":0.19436860527516575,"score_spread":0.1658695047371143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037957312","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.20014812,0.014705101,0.71492946,0.004099539,0.00058885204,0.000097609816,0.0011039344,0.0005452739,0.06378209],"genre_scores_gemma":[0.96414363,0.007937741,0.020224981,0.00032513074,0.00063471467,0.00023084527,0.00044152903,0.00015241551,0.0059090466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973436,0.0010892012,0.0000870701,0.00023522068,0.00063095754,0.0006140322],"domain_scores_gemma":[0.9505787,0.04413424,0.001419841,0.0014240461,0.002005935,0.0004371923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035107443,0.0018973218,0.0015452706,0.001826268,0.000969636,0.0030504426,0.001960035,0.0014907967,0.0048577376],"category_scores_gemma":[0.029719628,0.00070616935,0.00078227196,0.0024778964,0.004423447,0.005837971,0.002430878,0.0030470395,0.00087446143],"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.00038633065,0.000121698424,0.00071061414,0.00054557784,0.00010015834,0.00046107604,0.0005157,0.41794664,0.0053326804,0.55375826,0.0049607614,0.015160355],"study_design_scores_gemma":[0.000026266409,0.00005025317,0.0002776693,0.00018202512,0.000033710046,0.00012665335,0.000088754954,0.69788927,0.0018903015,0.2979669,0.0014175011,0.000050688235],"about_ca_topic_score_codex":0.0028658095,"about_ca_topic_score_gemma":0.0013798684,"teacher_disagreement_score":0.0048577376,"about_ca_system_score_codex":0.002742758,"about_ca_system_score_gemma":0.0017565448,"threshold_uncertainty_score":0.019900143},"labels":[],"label_agreement":null},{"id":"W2038336165","doi":"10.1109/dsp-spe.2013.6642595","title":"Low-delay joint source-channel coding with side information at the decoder","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Algorithm; Variable-length code; Distributed source coding; Binary number; Electronic engineering; Coding gain; Theoretical computer science; Mathematics; Arithmetic; Engineering","score_opus":0.010335699405837109,"score_gpt":0.19375887040536927,"score_spread":0.18342317099953215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038336165","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.016857639,0.00030297152,0.97980917,0.00015406183,0.000044455443,0.00003827368,0.00008116947,0.0004096867,0.0023025263],"genre_scores_gemma":[0.7319883,0.00054003316,0.26136732,0.00016812069,0.00012346996,0.00012317016,0.00025580422,0.00005379408,0.0053800005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990307,0.00023567499,0.00005192401,0.000122011246,0.0004454728,0.00011419987],"domain_scores_gemma":[0.99820924,0.0008858811,0.00017309628,0.00032710386,0.00036091916,0.000043710366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008551739,0.00092296343,0.0010118888,0.00046587028,0.00049508014,0.00084679853,0.0010734934,0.0007736834,0.0017820488],"category_scores_gemma":[0.0023550203,0.0002777316,0.0003369443,0.00088325917,0.0007852662,0.0012979698,0.0013160143,0.0010368308,0.0007430232],"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.0011171045,0.00017990354,0.0015686041,0.0004142843,0.00012328065,0.00052609196,0.00031933354,0.5186295,0.07971493,0.15320837,0.003143892,0.24105473],"study_design_scores_gemma":[0.000031751515,0.000099651224,0.00011287668,0.000018207402,0.000027809507,0.00018074698,0.000012209099,0.96555835,0.02310906,0.0092381835,0.0015895166,0.000021675069],"about_ca_topic_score_codex":0.0015581613,"about_ca_topic_score_gemma":0.00316656,"teacher_disagreement_score":0.0017820488,"about_ca_system_score_codex":0.0007517439,"about_ca_system_score_gemma":0.0016311475,"threshold_uncertainty_score":0.005961597},"labels":[],"label_agreement":null},{"id":"W2040101133","doi":"10.4108/icst.crowncom.2014.255736","title":"Device Authentication Architecture for TV White Space Systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Tekes; University of Ontario Institute of Technology","keywords":"White spaces; Computer science; Architecture; Spectrum (functional analysis); Authentication (law); Set (abstract data type); Space (punctuation); Telecommunications; Computer security; Cognitive radio; Wireless; Geography; Physics","score_opus":0.012164975261944256,"score_gpt":0.2393684790927398,"score_spread":0.22720350383079554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040101133","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.03970198,0.0008984239,0.91088223,0.0007776564,0.00032893626,0.0003883855,0.00016652312,0.006737986,0.04011779],"genre_scores_gemma":[0.8468122,0.0006896299,0.09692252,0.00039920767,0.00015191273,0.00034009886,0.00040125888,0.00020181981,0.0540814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916434,0.00014873268,0.00007378076,0.00012963815,0.00028625317,0.00019733554],"domain_scores_gemma":[0.99928516,0.00008352986,0.00005319526,0.00025604124,0.00027019525,0.00005185938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007475986,0.0005208091,0.00047587426,0.00072207797,0.0011726225,0.0027095696,0.0014555925,0.0013546816,0.011935766],"category_scores_gemma":[0.001038926,0.00034515664,0.00044825446,0.0003975419,0.00073775015,0.0030662518,0.0024060498,0.0014671456,0.0063244887],"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.0010997509,0.00032974206,0.002225394,0.0005656955,0.00013952113,0.00083507714,0.0013613976,0.03722908,0.10302185,0.6291123,0.024247628,0.19983254],"study_design_scores_gemma":[0.000120987286,0.0007795842,0.001610632,0.00023632337,0.0002256302,0.0010001815,0.0004377569,0.5645212,0.10329933,0.11532745,0.21229437,0.00014655456],"about_ca_topic_score_codex":0.0014462714,"about_ca_topic_score_gemma":0.001850256,"teacher_disagreement_score":0.011935766,"about_ca_system_score_codex":0.0008354126,"about_ca_system_score_gemma":0.0007353352,"threshold_uncertainty_score":0.03992915},"labels":[],"label_agreement":null},{"id":"W2040420188","doi":"10.1109/tit.2013.2267772","title":"On Convexity of Error Rates in Digital Communications","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; University of Ottawa","funders":"","keywords":"Convexity; Additive white Gaussian noise; Noise power; Gaussian noise; Convex optimization; Fading; Channel (broadcasting); White noise; Upper and lower bounds","score_opus":0.01727604170683221,"score_gpt":0.25403264414171706,"score_spread":0.23675660243488483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040420188","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.054547407,0.006533415,0.8773095,0.0022414045,0.0002054369,0.000082589075,0.00044292517,0.00022348634,0.05841382],"genre_scores_gemma":[0.8960351,0.010868862,0.077388175,0.00073870947,0.00082129013,0.00029207402,0.00059583544,0.0006073521,0.01265256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960025,0.0019858335,0.00016130337,0.0004502053,0.0009482667,0.0004518195],"domain_scores_gemma":[0.96258336,0.030679587,0.0017149734,0.0019181875,0.0026470963,0.00045676893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058208345,0.0019490562,0.0016615363,0.0022755188,0.001055387,0.003971951,0.0016272655,0.0010905152,0.0028536506],"category_scores_gemma":[0.029973745,0.0007948834,0.0013281779,0.0021646875,0.006067498,0.0045697237,0.0026717593,0.0036958174,0.0009620361],"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.00008767512,0.00002151688,0.0008118616,0.00016261422,0.000047397418,0.0002979321,0.0002976538,0.1967427,0.0018619596,0.784742,0.002247265,0.01267945],"study_design_scores_gemma":[0.000013870131,0.000049198654,0.00091287174,0.00011144757,0.000023704853,0.00019383858,0.000095146694,0.48745942,0.0021616495,0.5048435,0.00409173,0.000043727483],"about_ca_topic_score_codex":0.0030258335,"about_ca_topic_score_gemma":0.0013074552,"teacher_disagreement_score":0.0058208345,"about_ca_system_score_codex":0.0033122322,"about_ca_system_score_gemma":0.0011399965,"threshold_uncertainty_score":0.030783892},"labels":[],"label_agreement":null},{"id":"W2040861319","doi":"10.1109/tit.2013.2291787","title":"Optimality and Approximate Optimality of Source-Channel Separation in Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Distortion (music); Channel (broadcasting); Separation (statistics); Bounded function; Quadratic equation; Decoding methods; Measure (data warehouse); Mathematics; Upper and lower bounds; Converse; Computer science; Source separation; Topology (electrical circuits); Mathematical optimization; Algorithm; Telecommunications; Combinatorics","score_opus":0.007589482128150708,"score_gpt":0.2281653840888259,"score_spread":0.22057590196067517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040861319","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.04924965,0.0009906538,0.9398489,0.0006031978,0.000043874697,0.00004011784,0.000113625974,0.00011649339,0.0089934645],"genre_scores_gemma":[0.85647243,0.0016517761,0.13772725,0.00022894717,0.00010969145,0.00011875006,0.00025333467,0.00012469431,0.003313106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764496,0.0011074713,0.00008980897,0.00025045458,0.0006017056,0.00030563495],"domain_scores_gemma":[0.9924631,0.0060995356,0.0003959148,0.00042967766,0.00044591312,0.00016587847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031890932,0.0011609868,0.0012452091,0.00084677787,0.0006810303,0.0016214418,0.0010253472,0.0012261611,0.0017644521],"category_scores_gemma":[0.014964718,0.0006270604,0.0004929136,0.0011651337,0.00311841,0.0035325193,0.0026557469,0.0020933861,0.00040543577],"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.00019522138,0.000039276045,0.00050650747,0.00010095934,0.000031541942,0.000052424995,0.00010164606,0.81625235,0.0014747295,0.16605176,0.0009394732,0.014254139],"study_design_scores_gemma":[0.000014822859,0.000036774327,0.00014167839,0.000020694992,0.000008013662,0.000041080202,0.000027352506,0.89245003,0.001346509,0.10534053,0.00056163204,0.000010941508],"about_ca_topic_score_codex":0.0017515945,"about_ca_topic_score_gemma":0.0013308414,"teacher_disagreement_score":0.0031890932,"about_ca_system_score_codex":0.0026168025,"about_ca_system_score_gemma":0.0017129822,"threshold_uncertainty_score":0.018986344},"labels":[],"label_agreement":null},{"id":"W2041355078","doi":"10.1109/ita.2012.6181822","title":"Non-asymptotic equipartition properties for independent and identically distributed sources","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"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":"Combinatorics; Algorithm; Computer science; Mathematics","score_opus":0.022288488855908676,"score_gpt":0.240651480278684,"score_spread":0.21836299142277532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041355078","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.02935462,0.00097603846,0.95752877,0.00076206884,0.00008037234,0.00006977345,0.00071712874,0.00039299874,0.010118202],"genre_scores_gemma":[0.88070023,0.003391212,0.09729932,0.00096181285,0.0009024357,0.0008864874,0.0043304083,0.0005198232,0.011008259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9900004,0.0038075277,0.0005982748,0.0016372083,0.002966499,0.0009901678],"domain_scores_gemma":[0.8481988,0.12370717,0.008963455,0.008625357,0.008835209,0.0016700501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012194162,0.0014569771,0.0023061705,0.0032771996,0.0012051137,0.0029448967,0.0029501126,0.0018678309,0.005705272],"category_scores_gemma":[0.0851276,0.0011279844,0.0023991298,0.0029861378,0.005393986,0.0064196144,0.003418668,0.0037175755,0.0016200654],"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.0005315353,0.000090500325,0.005134564,0.00068595674,0.00028014777,0.0012091246,0.0009237452,0.23604454,0.007760453,0.71320575,0.004554232,0.029579444],"study_design_scores_gemma":[0.000033925877,0.000116137795,0.0032198154,0.000106249194,0.0000679059,0.0008200152,0.00012268058,0.6745436,0.0028682703,0.31591424,0.0020839507,0.00010324703],"about_ca_topic_score_codex":0.0026986327,"about_ca_topic_score_gemma":0.0015010929,"teacher_disagreement_score":0.012194162,"about_ca_system_score_codex":0.00242407,"about_ca_system_score_gemma":0.0019203237,"threshold_uncertainty_score":0.06448966},"labels":[],"label_agreement":null},{"id":"W2044084012","doi":"10.1109/isit.2013.6620611","title":"Extended subspace error localization for rate-adaptive distributed source coding","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Subspace topology; Coding (social sciences); Computer science; Puncturing; Distributed source coding; Algorithm; Word error rate; Source code; Variable-length code; Mathematics; Speech recognition; Artificial intelligence; Telecommunications; Decoding methods; Statistics","score_opus":0.021563571530591644,"score_gpt":0.24992598072722386,"score_spread":0.2283624091966322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044084012","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.0021588684,0.00010973575,0.99722505,0.000026130056,0.000015183713,0.000006543282,0.000006823008,0.00013075337,0.00032101938],"genre_scores_gemma":[0.37798968,0.000799411,0.6184394,0.00011387559,0.00011089385,0.00011934697,0.000119758566,0.000068508016,0.0022392129],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921584,0.00025961912,0.00003870773,0.000083802035,0.00035999442,0.000042059462],"domain_scores_gemma":[0.9988393,0.00041940552,0.00012371514,0.0002249839,0.0003579323,0.00003468196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061067,0.0005755175,0.00054516597,0.0005188616,0.00023553408,0.00049128267,0.0006153065,0.0006079699,0.0010406799],"category_scores_gemma":[0.0023819187,0.00017056691,0.0003342945,0.00062326534,0.0006389076,0.0011339254,0.0012369273,0.0008648496,0.0005549137],"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.000289715,0.00007764915,0.0005935601,0.00022692265,0.000068548274,0.00024095604,0.0001854756,0.35705015,0.110696584,0.17014645,0.002442675,0.35798123],"study_design_scores_gemma":[0.000011187441,0.000080018974,0.000060016842,0.000013745729,0.0000069680495,0.00013313831,0.000008205586,0.9692295,0.018078098,0.0103129465,0.0020446165,0.000021516265],"about_ca_topic_score_codex":0.00039053758,"about_ca_topic_score_gemma":0.00038568894,"teacher_disagreement_score":0.0010406799,"about_ca_system_score_codex":0.00034744234,"about_ca_system_score_gemma":0.0005471929,"threshold_uncertainty_score":0.003481388},"labels":[],"label_agreement":null},{"id":"W2045663703","doi":"10.1109/ita.2008.4601015","title":"Optimal causal quantization of Markov Sources with distortion constraints","year":2008,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"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":"Randomness; Encoder; Mathematics; Markov process; Quantization (signal processing); Markov chain; Asymptotically optimal algorithm; Mathematical optimization; Rate–distortion theory; Convex optimization; Algorithm; Regular polygon; Data compression; Statistics","score_opus":0.013116994961372396,"score_gpt":0.2163972265873615,"score_spread":0.2032802316259891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045663703","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.021127494,0.0007162883,0.97429895,0.00029386865,0.000029003408,0.000029436613,0.00011794514,0.000107036096,0.0032800245],"genre_scores_gemma":[0.850745,0.00120334,0.14223817,0.0001572156,0.00009580263,0.000119297794,0.00030189726,0.00008803122,0.0050511407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987348,0.0005033578,0.00007717343,0.00021440335,0.0003097568,0.0001604873],"domain_scores_gemma":[0.9954587,0.0034513527,0.00043329335,0.000194043,0.00036318408,0.00009945542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002033247,0.0008398676,0.0011825671,0.0006543111,0.00037138772,0.001197189,0.0010180552,0.00086831144,0.002369167],"category_scores_gemma":[0.0071450183,0.0005624509,0.00047080536,0.00095884525,0.0013267815,0.002099817,0.0013746598,0.0011189518,0.00024914034],"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.00012403693,0.000024846524,0.00023755286,0.00010089758,0.00002322214,0.0000716099,0.00009613714,0.7088317,0.0012915075,0.25585964,0.0009668849,0.03237206],"study_design_scores_gemma":[0.000016487375,0.000024396617,0.000053771924,0.00001060981,0.0000051670913,0.000014916098,0.000008879855,0.9405606,0.0006668179,0.058306623,0.00031928418,0.0000123700665],"about_ca_topic_score_codex":0.002891233,"about_ca_topic_score_gemma":0.0021830853,"teacher_disagreement_score":0.002891233,"about_ca_system_score_codex":0.001735897,"about_ca_system_score_gemma":0.0017521316,"threshold_uncertainty_score":0.012594879},"labels":[],"label_agreement":null},{"id":"W2046531624","doi":"10.1109/ita.2010.5454121","title":"On the MISO compound wiretap channel","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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 Toronto","funders":"","keywords":"Upper and lower bounds; Transmitter; Channel (broadcasting); Topology (electrical circuits); Transmission (telecommunications); Coding (social sciences); Pairwise comparison; Computer science; Telecommunications; Antenna (radio); Computer network; Combinatorics; Mathematics; Statistics; Mathematical analysis","score_opus":0.013732475441662432,"score_gpt":0.22338027914176722,"score_spread":0.2096478037001048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046531624","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.38926417,0.0019828877,0.5715747,0.0017405779,0.0002059077,0.0000908163,0.000512393,0.00019336284,0.034435205],"genre_scores_gemma":[0.97524184,0.0021159803,0.01571597,0.00013203263,0.00016153157,0.00013723121,0.00013774612,0.00003336548,0.0063242926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987208,0.00039015932,0.00003663256,0.00014058052,0.0003012072,0.00041050548],"domain_scores_gemma":[0.99182457,0.0058054887,0.0009726616,0.0004972709,0.00049261923,0.000407469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014881401,0.0013736796,0.0012712555,0.0009048553,0.0010529341,0.0017463879,0.000680953,0.0012935738,0.0030192437],"category_scores_gemma":[0.0068522776,0.00047066822,0.00045329932,0.0012880174,0.004132447,0.00346267,0.0022474763,0.0022581685,0.0005792368],"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.0005118647,0.00003813483,0.00071779406,0.00012943214,0.000024908888,0.00044174024,0.00024129412,0.22593196,0.0053807124,0.7561096,0.0020524675,0.008420071],"study_design_scores_gemma":[0.000051681927,0.00013608093,0.00031413458,0.000049104434,0.000021367649,0.00022916438,0.00012582405,0.71509665,0.0030758705,0.278992,0.0018331137,0.00007497693],"about_ca_topic_score_codex":0.001731191,"about_ca_topic_score_gemma":0.0011096331,"teacher_disagreement_score":0.0030192437,"about_ca_system_score_codex":0.0013865437,"about_ca_system_score_gemma":0.00094676035,"threshold_uncertainty_score":0.010100365},"labels":[],"label_agreement":null},{"id":"W2047892990","doi":"10.1049/iet-ifs.2009.0197","title":"Physical layer assisted authentication for distributed <i>ad hoc</i> wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"IET Information Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Electronic Science and Technology of China","keywords":"Computer network; Computer science; Authentication (law); Authentication protocol; Physical layer; Overhead (engineering); Message authentication code; Wireless ad hoc network; Public-key cryptography; Cryptography; Distributed computing; Wireless; Computer security; Encryption; Telecommunications","score_opus":0.010240708386570511,"score_gpt":0.2508163790439364,"score_spread":0.24057567065736588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047892990","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.017661111,0.000790317,0.9774581,0.0002787069,0.00014749226,0.00006695565,0.00002540773,0.0006569427,0.0029149228],"genre_scores_gemma":[0.87876564,0.00072502927,0.1157595,0.000103237224,0.00013954229,0.00009197656,0.00007973371,0.000037539463,0.0042977175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992731,0.00027113775,0.00005302596,0.0000656715,0.00026638331,0.000070732334],"domain_scores_gemma":[0.9990859,0.0002690905,0.00013528617,0.00025466917,0.00021567084,0.00003932301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010736729,0.00032038867,0.0003212411,0.00031974207,0.000488731,0.000760912,0.0009274159,0.00046574775,0.0011000506],"category_scores_gemma":[0.001926522,0.00016851966,0.00031592115,0.0003178401,0.00074344315,0.0018067636,0.00078429707,0.00082748604,0.00040870454],"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.0007619421,0.00020118034,0.0027113205,0.00080795574,0.00013508878,0.00070549827,0.00068074145,0.100169584,0.21170352,0.25717825,0.00993182,0.41501313],"study_design_scores_gemma":[0.00008454317,0.00070858526,0.0009479138,0.00006261666,0.00009831528,0.00072309235,0.00014549357,0.840977,0.0763674,0.041563023,0.03824967,0.00007236894],"about_ca_topic_score_codex":0.0004104954,"about_ca_topic_score_gemma":0.00045334533,"teacher_disagreement_score":0.0011000506,"about_ca_system_score_codex":0.00046644395,"about_ca_system_score_gemma":0.00067645084,"threshold_uncertainty_score":0.005678177},"labels":[],"label_agreement":null},{"id":"W2047986257","doi":"10.1109/isit.2013.6620610","title":"Real-time streaming of Gauss-Markov sources over sliding window burst-erasure channels","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"","keywords":"Erasure; Encoder; Sliding window protocol; Upper and lower bounds; Binary erasure channel; Computer science; Algorithm; Gaussian; Markov process; Erasure code; Markov chain; Decoding methods; Mathematics; Channel (broadcasting); Channel capacity; Window (computing); Telecommunications; Physics; Statistics","score_opus":0.009266078322678863,"score_gpt":0.22362932886498563,"score_spread":0.21436325054230676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047986257","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.32421097,0.0014858181,0.6702181,0.0006213148,0.00006528462,0.000064636435,0.00017142661,0.00027973033,0.0028826324],"genre_scores_gemma":[0.98502743,0.0005783235,0.013148829,0.000029621837,0.000034897992,0.000029106772,0.000067369205,0.000015041137,0.001069376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995183,0.00016116218,0.000022642198,0.00005900594,0.00013303458,0.000105822844],"domain_scores_gemma":[0.9925746,0.0058450243,0.00065294973,0.00026548686,0.00045951048,0.00020251259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013360834,0.00081437523,0.000743474,0.0004370173,0.00030917994,0.0006129178,0.00076505204,0.00057705544,0.000883875],"category_scores_gemma":[0.0068272976,0.00030675592,0.00034221157,0.00068562955,0.0010278539,0.0015116624,0.00076424977,0.0009116434,0.00011725318],"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.0002669784,0.00003887509,0.0010217116,0.00007724056,0.000031056592,0.00025924647,0.00009413287,0.9498344,0.00472177,0.03547098,0.00032936383,0.007854212],"study_design_scores_gemma":[0.0000055706505,0.00002145541,0.00008883136,0.0000031608301,0.000003052971,0.000020903202,0.000009408585,0.9960282,0.00059314707,0.0031686972,0.000053931588,0.0000035664505],"about_ca_topic_score_codex":0.003099772,"about_ca_topic_score_gemma":0.0016290147,"teacher_disagreement_score":0.003099772,"about_ca_system_score_codex":0.0008144835,"about_ca_system_score_gemma":0.00064259977,"threshold_uncertainty_score":0.007065952},"labels":[],"label_agreement":null},{"id":"W2049705545","doi":"10.1109/isccsp.2014.6877827","title":"Secrecy analysis of multi-cell massive MIMO systems with RCI precoding and artificial noise transmission","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"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 British Columbia","funders":"","keywords":"Precoding; Artificial noise; MIMO; Telecommunications link; Base station; Computer science; Zero-forcing precoding; Transmitter; Ergodic theory; Transmission (telecommunications); Topology (electrical circuits); Channel (broadcasting); Algorithm; Mathematics; Computer network; Telecommunications","score_opus":0.014925462544669381,"score_gpt":0.22611497173190515,"score_spread":0.21118950918723575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049705545","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.14734793,0.0015168629,0.83484703,0.0009493834,0.00009528251,0.00005102372,0.00016731727,0.00016054891,0.014864656],"genre_scores_gemma":[0.9865132,0.00071074505,0.00980838,0.00009321199,0.00007020474,0.000025984253,0.000057428653,0.000020670153,0.0027001228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993186,0.00025757932,0.00001805945,0.000073837764,0.00020053811,0.00013141957],"domain_scores_gemma":[0.99720913,0.0017064554,0.0004182573,0.00015051203,0.0004373732,0.000078288846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010385592,0.00095540367,0.0007392989,0.00042280243,0.0004271739,0.0009655429,0.0005335374,0.00083680934,0.0013012022],"category_scores_gemma":[0.0034195145,0.00039359977,0.00050074834,0.0005503789,0.0018110927,0.0012373899,0.00093520666,0.0009687962,0.0002719878],"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.00007834212,0.000020205352,0.00073058973,0.000102987324,0.000043713757,0.0003458074,0.00011336192,0.9366281,0.0065490236,0.051065978,0.00053826586,0.003783639],"study_design_scores_gemma":[0.000003815465,0.000022092845,0.00015284795,0.000006348344,0.0000071402287,0.000069479815,0.000022975686,0.99469465,0.00079826155,0.0040893327,0.00012477631,0.000008349907],"about_ca_topic_score_codex":0.0027198417,"about_ca_topic_score_gemma":0.001574388,"teacher_disagreement_score":0.0027198417,"about_ca_system_score_codex":0.0009715099,"about_ca_system_score_gemma":0.00081036874,"threshold_uncertainty_score":0.0070488453},"labels":[],"label_agreement":null},{"id":"W2051655994","doi":"10.1109/tit.2012.2184076","title":"Erratum to “On Delayed Sequential Coding of Correlated Sources” [Jun 11 3763-3782]","year":2012,"lang":"en","type":"erratum","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Lemma (botany); Computer science; Coding (social sciences); Algorithm; Mathematics; Statistics","score_opus":0.012723183991158746,"score_gpt":0.23563188304602561,"score_spread":0.22290869905486688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051655994","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018745298,0.0025759835,0.0023278862,0.04699819,0.9333293,0.000049196686,0.000632311,0.00032222632,0.013577379],"genre_scores_gemma":[0.01361364,0.015052352,0.009764956,0.12548353,0.3992605,0.000265015,0.004337732,0.0018759422,0.43034634],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969668,0.0005840635,0.0004614708,0.00044496986,0.0013042266,0.0002385091],"domain_scores_gemma":[0.99287647,0.0015235932,0.00043682597,0.0005293482,0.004281085,0.00035260394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024628735,0.0024428032,0.0016548566,0.0033456436,0.0038763573,0.0030331411,0.0032588681,0.0049259663,0.042098485],"category_scores_gemma":[0.019266699,0.00094789045,0.0014592739,0.0024476247,0.002088786,0.0033193189,0.0016077781,0.00719731,0.02814621],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00004377326,0.0000052928913,0.000021982616,0.00005186616,0.00000701888,0.000090182286,0.0000110606825,0.000042347026,0.00008812724,0.0014075531,0.99523664,0.0029941823],"study_design_scores_gemma":[0.000031875174,0.000046371824,0.00056015333,0.00022223458,0.000030247615,0.00023669474,0.00003704298,0.00053615845,0.00050798635,0.0035009852,0.99424356,0.000046708075],"about_ca_topic_score_codex":0.012255612,"about_ca_topic_score_gemma":0.020865507,"teacher_disagreement_score":0.042098485,"about_ca_system_score_codex":0.00382446,"about_ca_system_score_gemma":0.0026583956,"threshold_uncertainty_score":0.1408335},"labels":[],"label_agreement":null},{"id":"W2053818368","doi":"10.1109/glocom.2012.6503444","title":"Phase asynchronous cognitive interference channels: Lossless source-channel separation theorems","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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":"Lossless compression; Computer science; Cognitive radio; Channel (broadcasting); Interference (communication); Asynchronous communication; Encoder; Coding (social sciences); Cognition; Transmission (telecommunications); Constraint (computer-aided design); Topology (electrical circuits); Computer network; Telecommunications; Algorithm; Mathematics; Wireless; Data compression; Psychology","score_opus":0.02907821078201568,"score_gpt":0.3105516162855264,"score_spread":0.28147340550351074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053818368","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.034634285,0.000860208,0.9481219,0.0007600879,0.000079071724,0.00006251576,0.00023876455,0.00022705291,0.015016151],"genre_scores_gemma":[0.930926,0.001537733,0.062393643,0.0004527567,0.00025385604,0.00038152307,0.00024570455,0.00008894621,0.0037198062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819213,0.0004871533,0.00007604773,0.00023729507,0.0006879456,0.00031947016],"domain_scores_gemma":[0.97854996,0.016045751,0.0024973683,0.0007580658,0.0017532774,0.00039553334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002969379,0.0011841891,0.00094940205,0.0015864847,0.0009020568,0.002314078,0.0014178636,0.0012656117,0.0037977987],"category_scores_gemma":[0.020228038,0.0006274942,0.00072506105,0.0011186725,0.0026380483,0.0030266836,0.0021396535,0.002615374,0.00080736395],"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.0002248451,0.00009487775,0.00084398856,0.0002991309,0.00007725108,0.00059952977,0.0006069313,0.20760916,0.0071816035,0.7600645,0.004859891,0.017538356],"study_design_scores_gemma":[0.00007160831,0.00007330148,0.00034377133,0.00006369449,0.000031635755,0.00041418287,0.00014067585,0.65430343,0.0023490952,0.34006408,0.0020998644,0.000044676497],"about_ca_topic_score_codex":0.0009253364,"about_ca_topic_score_gemma":0.00069003325,"teacher_disagreement_score":0.0037977987,"about_ca_system_score_codex":0.0016108326,"about_ca_system_score_gemma":0.0015152171,"threshold_uncertainty_score":0.015703797},"labels":[],"label_agreement":null},{"id":"W2055044375","doi":"10.1109/tcomm.2013.111213.130235","title":"Physical-Layer Security with Multiuser Scheduling in Cognitive Radio Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":212,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Cognitive radio; Scheduling (production processes); Computer network; Quality of service; Rayleigh fading; Artificial noise; Fading; Physical layer; Base station; Mathematical optimization; Wireless; Telecommunications; Mathematics; Channel (broadcasting)","score_opus":0.0255506041634968,"score_gpt":0.27381222421167173,"score_spread":0.24826162004817492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055044375","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.06231764,0.0016614754,0.9318528,0.00031789552,0.00011759191,0.0000436499,0.000027341057,0.00009542693,0.0035662523],"genre_scores_gemma":[0.970258,0.00069563586,0.02812936,0.00007182911,0.00009700533,0.00004104034,0.000011843224,0.000010355714,0.00068485324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977926,0.0009703599,0.00007696222,0.00024842474,0.0005399151,0.00037176468],"domain_scores_gemma":[0.99648416,0.0020945556,0.0005188878,0.00035402994,0.00043049033,0.00011789394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026315264,0.0011023291,0.0007802184,0.0005827839,0.0009062833,0.0016586881,0.0011122985,0.001105812,0.0006030883],"category_scores_gemma":[0.0049659265,0.0004307798,0.0005952853,0.0009572898,0.002074165,0.0019459373,0.0014209652,0.0009771404,0.0001436452],"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.00015580785,0.000048171143,0.0008621198,0.00011912607,0.00006679379,0.00037642632,0.00016172786,0.90916616,0.005087681,0.07042319,0.00041325646,0.013119462],"study_design_scores_gemma":[0.0000140219,0.000055978,0.00012286824,0.000007830791,0.000015869526,0.000065362205,0.000023879502,0.98666614,0.00085267203,0.01183866,0.00032513417,0.000011592943],"about_ca_topic_score_codex":0.003700278,"about_ca_topic_score_gemma":0.0024261915,"teacher_disagreement_score":0.003700278,"about_ca_system_score_codex":0.0017128657,"about_ca_system_score_gemma":0.0018361212,"threshold_uncertainty_score":0.013917029},"labels":[],"label_agreement":null},{"id":"W2056164141","doi":"10.1007/s11277-008-9534-x","title":"Successively Structured Gaussian Two-terminal Source Coding","year":2008,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Queen's University","funders":"","keywords":"Computer science; Decoding methods; Encoder; Coding (social sciences); Distributed source coding; Algorithm; Variable-length code; Source code; Shannon–Fano coding; Rate–distortion theory; Gaussian; Context-adaptive binary arithmetic coding; Theoretical computer science; Coding tree unit; Mathematics; Data compression; Statistics","score_opus":0.03396039112253684,"score_gpt":0.2789937649306184,"score_spread":0.24503337380808154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056164141","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.0110605685,0.00017762335,0.981696,0.00023711962,0.00011442193,0.00005161415,0.00022348695,0.00030168882,0.006137498],"genre_scores_gemma":[0.49225944,0.00087553007,0.4738614,0.0007600936,0.00026012943,0.00033371954,0.0011837429,0.00024598208,0.030219965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895513,0.0003663303,0.000042575153,0.00014903446,0.00033112708,0.00015572215],"domain_scores_gemma":[0.99695766,0.0014024731,0.00016196312,0.00067270984,0.00065383,0.00015142173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001101895,0.0018724514,0.0010633037,0.0007237714,0.00055086566,0.0012722865,0.0012427001,0.0020181695,0.0051822662],"category_scores_gemma":[0.005096723,0.00074870116,0.0010217158,0.0014143492,0.0013519775,0.0017396698,0.0029561217,0.0023408527,0.002820948],"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.0018000174,0.00025128375,0.0020315382,0.00048805948,0.00019978403,0.0011383515,0.0007860211,0.34185007,0.10351122,0.3345637,0.007748892,0.205631],"study_design_scores_gemma":[0.000094852316,0.00014042054,0.0003935612,0.00005572699,0.000044490316,0.00049582834,0.000049137918,0.9155571,0.021841098,0.057986006,0.003273641,0.000068033485],"about_ca_topic_score_codex":0.0009954652,"about_ca_topic_score_gemma":0.0015882878,"teacher_disagreement_score":0.0051822662,"about_ca_system_score_codex":0.00064395467,"about_ca_system_score_gemma":0.0012966205,"threshold_uncertainty_score":0.017336428},"labels":[],"label_agreement":null},{"id":"W2056991359","doi":"10.1109/bsc.2010.5472956","title":"Lower bounds on the capacity of discrete-time Poisson channels with dark current","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Poisson distribution; Discrete time and continuous time; Upper and lower bounds; Constraint (computer-aided design); Intuition; Mathematics; Channel capacity; Power (physics); Mathematical optimization; Computer science; Applied mathematics; Topology (electrical circuits); Combinatorics; Channel (broadcasting); Mathematical analysis; Physics; Statistics; Telecommunications; Geometry","score_opus":0.013548290611258021,"score_gpt":0.23228703059835576,"score_spread":0.21873873998709775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056991359","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.031505495,0.015763644,0.89307564,0.0031274348,0.00065698544,0.00014606898,0.0010437989,0.0009892938,0.053691637],"genre_scores_gemma":[0.8366285,0.019443933,0.12179273,0.0018405552,0.0021699152,0.0010101048,0.0016703152,0.0007253716,0.014718537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932287,0.0012907311,0.00024267621,0.00073711073,0.002773267,0.0017275303],"domain_scores_gemma":[0.9618604,0.027597958,0.0015364657,0.0031392688,0.004856997,0.0010088437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007063565,0.003131702,0.0023500659,0.004970799,0.0017009111,0.0046342644,0.004996416,0.0019655565,0.009429793],"category_scores_gemma":[0.033826366,0.0011150914,0.0018409473,0.0040979884,0.004117403,0.0094570555,0.00430798,0.0074489117,0.0017648747],"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.00063299906,0.00020851135,0.0010327392,0.0011296045,0.0001982378,0.000359246,0.0005469615,0.41898024,0.011074802,0.50536764,0.012266826,0.048202213],"study_design_scores_gemma":[0.000033587152,0.00009065747,0.00053619087,0.00031965645,0.00008368189,0.00026169766,0.000113405295,0.7382487,0.0066442285,0.24569361,0.007842541,0.0001319529],"about_ca_topic_score_codex":0.0032845093,"about_ca_topic_score_gemma":0.0028431423,"teacher_disagreement_score":0.009429793,"about_ca_system_score_codex":0.0059849694,"about_ca_system_score_gemma":0.0023265667,"threshold_uncertainty_score":0.04342425},"labels":[],"label_agreement":null},{"id":"W2057017634","doi":"10.1109/bsc.2010.5473003","title":"Optimization of the end-to-end distortion of a Gaussian source in layered broadcast transmission","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Discretization; Computer science; Transmission (telecommunications); Fading; Optimization problem; Channel (broadcasting); Gaussian; Distortion (music); Algorithm; Channel state information; Mathematical optimization; Margin (machine learning); Telecommunications; Wireless; Mathematics; Bandwidth (computing)","score_opus":0.00697825253292999,"score_gpt":0.22004160829852806,"score_spread":0.21306335576559807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057017634","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.06182987,0.00039728987,0.93582165,0.00020573125,0.000020905747,0.000025729127,0.00006562949,0.00013989733,0.0014932886],"genre_scores_gemma":[0.9083215,0.0005267738,0.08847315,0.000058427966,0.000025980644,0.000060449336,0.00011807323,0.000070215865,0.0023454954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992435,0.00030739143,0.000028372599,0.000087283974,0.00024426484,0.00008918836],"domain_scores_gemma":[0.9984706,0.0010797702,0.00013194799,0.00008454777,0.00017717012,0.000055992023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017690884,0.0009250891,0.0009703786,0.0003012619,0.00024550332,0.0010651895,0.00084218796,0.0010005415,0.000950341],"category_scores_gemma":[0.004095098,0.00044618692,0.00040088268,0.00041266042,0.00094656233,0.0012933636,0.001119149,0.0008645472,0.0002553429],"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.00016707169,0.000019543437,0.00028204577,0.000052840307,0.00002731629,0.00006712208,0.000035473407,0.9793721,0.0038387186,0.006696074,0.0002008958,0.00924086],"study_design_scores_gemma":[0.000009647596,0.000035135403,0.00007597408,0.000003837241,0.000006973273,0.000026251708,0.000008080941,0.9968195,0.0015657234,0.0013798965,0.000063160674,0.0000057533753],"about_ca_topic_score_codex":0.0024430254,"about_ca_topic_score_gemma":0.001586857,"teacher_disagreement_score":0.0024430254,"about_ca_system_score_codex":0.0014182532,"about_ca_system_score_gemma":0.0011019995,"threshold_uncertainty_score":0.010290146},"labels":[],"label_agreement":null},{"id":"W2057829329","doi":"10.1109/isit.2013.6620285","title":"Hybrid digital-analog coding for interference broadcast channels","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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":"Computer science; Transmitter; Coding (social sciences); Gaussian; Bandwidth (computing); Upper and lower bounds; Algorithm; Topology (electrical circuits); Channel (broadcasting); Mathematics; Telecommunications; Combinatorics; Statistics; Physics","score_opus":0.022937030900259003,"score_gpt":0.24000491730956744,"score_spread":0.21706788640930844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057829329","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.113848485,0.00077087316,0.8715667,0.0003725515,0.00004265932,0.000047992125,0.00017870392,0.00013705809,0.01303498],"genre_scores_gemma":[0.9625889,0.0003867427,0.034060217,0.00006242246,0.00003670341,0.000049085043,0.00007784627,0.000014741812,0.0027231814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991573,0.00027621703,0.000021713144,0.00007366775,0.00032601584,0.00014512314],"domain_scores_gemma":[0.9971595,0.0021745302,0.00023205396,0.00015295003,0.00022190182,0.000059049198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012999406,0.0006003787,0.0005359049,0.00054792146,0.00044349759,0.0009926487,0.0008395631,0.00076213264,0.0016995118],"category_scores_gemma":[0.003428281,0.00021373792,0.00042736577,0.0008747606,0.0012256788,0.0008084976,0.0011688191,0.00065760076,0.00021099388],"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.00017976527,0.000040549243,0.0007190096,0.00009199216,0.000032632328,0.00021944035,0.00015900779,0.77510405,0.003914793,0.20760322,0.0004272797,0.011508268],"study_design_scores_gemma":[0.000009256554,0.000016617823,0.0000801923,0.0000056966437,0.000009708226,0.000033950797,0.000012690975,0.9850193,0.0007654302,0.013789943,0.0002519586,0.000005177453],"about_ca_topic_score_codex":0.0046369224,"about_ca_topic_score_gemma":0.0040744212,"teacher_disagreement_score":0.0046369224,"about_ca_system_score_codex":0.0017094144,"about_ca_system_score_gemma":0.00086944614,"threshold_uncertainty_score":0.012402713},"labels":[],"label_agreement":null},{"id":"W2058859540","doi":"10.1109/cscwd.2013.6581046","title":"Eavesdropping attack in collaborative wireless networks: Security protocols and intercept behavior","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"AUTO21 Network of Centres of Excellence","keywords":"Relay; Eavesdropping; Computer network; Rayleigh fading; Computer science; Relay channel; Transmission (telecommunications); Wireless; Wireless network; Fading; Telecommunications; Channel (broadcasting)","score_opus":0.015915206450668094,"score_gpt":0.28601372476941284,"score_spread":0.27009851831874476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058859540","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.083695374,0.002542756,0.9087856,0.00042076208,0.00004642215,0.00010621353,0.000033480235,0.00013709367,0.004232353],"genre_scores_gemma":[0.957077,0.0023235178,0.03912849,0.000093378876,0.00007618077,0.00014349089,0.000031072148,0.000019528452,0.0011072219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960555,0.0015003621,0.00022075114,0.00047432457,0.0013990987,0.00034993235],"domain_scores_gemma":[0.98005265,0.012538727,0.0037526838,0.0021282635,0.0013343142,0.00019330252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038378795,0.0014977376,0.0013305849,0.0011939468,0.0010553589,0.002320729,0.0016976958,0.0026269185,0.00064327073],"category_scores_gemma":[0.018964356,0.0006733779,0.00098824,0.0012232962,0.0031165709,0.0061309,0.002609682,0.0018078913,0.00022890703],"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.00030839888,0.00019230846,0.008548812,0.0006868878,0.00038537054,0.0019649118,0.0013672294,0.61075866,0.03162989,0.2798863,0.0013678647,0.062903404],"study_design_scores_gemma":[0.000026729842,0.00033437772,0.0010306245,0.000068358466,0.00015466704,0.0015322862,0.00024067504,0.92643154,0.011341331,0.057296835,0.0014641829,0.00007827044],"about_ca_topic_score_codex":0.0007258644,"about_ca_topic_score_gemma":0.0003829671,"teacher_disagreement_score":0.0038378795,"about_ca_system_score_codex":0.0010980394,"about_ca_system_score_gemma":0.000727516,"threshold_uncertainty_score":0.020296931},"labels":[],"label_agreement":null},{"id":"W2059207464","doi":"10.1109/tit.2015.2412540","title":"Broadcasting Correlated Vector Gaussians","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Bounding overwatch; Upper and lower bounds; Gaussian; Covariance; Scalar (mathematics); Distortion (music); Algorithm; Mathematics; Computer science; Constraint (computer-aided design); Fading; Bandwidth (computing); Mathematical optimization; Telecommunications; Decoding methods; Statistics; Artificial intelligence; Mathematical analysis; Physics","score_opus":0.016713693477197186,"score_gpt":0.22503294228414358,"score_spread":0.2083192488069464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059207464","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.038762238,0.00036209336,0.95658875,0.00035807182,0.000043217187,0.000031619158,0.0000958669,0.0001513792,0.0036067327],"genre_scores_gemma":[0.90542454,0.0007212696,0.08780936,0.00022840736,0.00014063639,0.000095670366,0.00019048109,0.000051322084,0.0053383834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982181,0.00062526995,0.000068524314,0.00027551115,0.00058388547,0.00022861641],"domain_scores_gemma":[0.9962805,0.0024696465,0.0003932744,0.00043063718,0.0003470783,0.00007890491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002270813,0.0005845939,0.0012278231,0.00042461554,0.00057607173,0.0013903526,0.0008687365,0.0013806722,0.0016769983],"category_scores_gemma":[0.006581499,0.00044894856,0.00043933172,0.0010488869,0.0015011702,0.0020082672,0.0021853414,0.0012749673,0.0004487162],"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.0007440052,0.000059186874,0.00094102835,0.00032065436,0.00010602807,0.0005354705,0.0003819492,0.52765554,0.017958758,0.38300842,0.0027300506,0.06555887],"study_design_scores_gemma":[0.00006286538,0.00008623537,0.0003034177,0.000021188142,0.00003482749,0.00026419273,0.0000869278,0.91281337,0.006128648,0.078437924,0.0017314545,0.000028992037],"about_ca_topic_score_codex":0.00081904145,"about_ca_topic_score_gemma":0.0007444052,"teacher_disagreement_score":0.002270813,"about_ca_system_score_codex":0.0011836985,"about_ca_system_score_gemma":0.00073701266,"threshold_uncertainty_score":0.012009382},"labels":[],"label_agreement":null},{"id":"W2060201549","doi":"10.1109/iccs.2014.7024783","title":"On secret key generation from multiple observations of wireless channels","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Key generation; Computer science; Key (lock); Physical layer; Randomness; Pre-shared key; Key distribution; Cryptography; Shared secret; Wireless; Quantization (signal processing); Channel (broadcasting); Key encapsulation; Public-key cryptography; Computer network; Computer security; Algorithm; Telecommunications; Encryption; Mathematics; Statistics","score_opus":0.039991364999266955,"score_gpt":0.23204300008637388,"score_spread":0.19205163508710693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060201549","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.037307993,0.00064706017,0.9602608,0.00011940906,0.000029352785,0.00004105889,0.000032540993,0.000094317315,0.0014675162],"genre_scores_gemma":[0.90409464,0.0016225072,0.09289417,0.00005992592,0.00006768585,0.00008219863,0.00006484643,0.000033366076,0.0010805476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979164,0.00082453457,0.00006982801,0.000263803,0.0007459574,0.00017937174],"domain_scores_gemma":[0.9952852,0.0037779175,0.0003805796,0.0003251491,0.00019118466,0.000040013343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020490335,0.0008130783,0.00077816827,0.00064322015,0.00043237687,0.00073213596,0.0005653592,0.0006007883,0.0007881165],"category_scores_gemma":[0.006235861,0.0003699497,0.0009650123,0.0009013029,0.0014949939,0.0024508226,0.0010567044,0.0010436932,0.00014263381],"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.0005835868,0.00005763004,0.001971434,0.0002899345,0.00011170543,0.00041882208,0.00027086094,0.81745565,0.022863133,0.098967426,0.00037573412,0.056634057],"study_design_scores_gemma":[0.00002148734,0.00012340219,0.00041589458,0.000016944281,0.00003379463,0.00017099788,0.00002780284,0.9761248,0.009558208,0.012899729,0.0005773525,0.00002952563],"about_ca_topic_score_codex":0.0007193691,"about_ca_topic_score_gemma":0.0004475129,"teacher_disagreement_score":0.0020490335,"about_ca_system_score_codex":0.00065569225,"about_ca_system_score_gemma":0.0006647903,"threshold_uncertainty_score":0.010836422},"labels":[],"label_agreement":null},{"id":"W2061534192","doi":"10.1109/glocom.2014.7036875","title":"Relay authentication by exploiting I/Q imbalance in amplify-and-forward system","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Relay; Computer science; Authentication (law); Wireless; Computer network; Transmission (telecommunications); Fingerprint (computing); Computer security; Telecommunications","score_opus":0.0032413686730903054,"score_gpt":0.1848245326538505,"score_spread":0.1815831639807602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061534192","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.047926325,0.00015911584,0.9504541,0.000120114266,0.000029305578,0.00005527319,0.000023999817,0.0003145294,0.0009172915],"genre_scores_gemma":[0.92278963,0.00012323476,0.07624675,0.00005448873,0.000028952245,0.00004643534,0.000023746748,0.000009805151,0.00067696505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982482,0.0006542354,0.000117567404,0.00027799464,0.0005722965,0.00012972896],"domain_scores_gemma":[0.9979309,0.001036318,0.0004365213,0.00029324213,0.00024895492,0.000054064716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018978223,0.0007012175,0.0006476364,0.00053466787,0.00050656183,0.0007847284,0.0006802616,0.0007021369,0.00084614963],"category_scores_gemma":[0.0048582377,0.00024396238,0.0003409274,0.00042447733,0.00097201724,0.0015392209,0.0009841003,0.0006609329,0.00036711662],"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.0025062764,0.00020711414,0.009193915,0.00027623004,0.00013682035,0.0007507516,0.00066589983,0.335565,0.1631241,0.069917195,0.0013844412,0.41627222],"study_design_scores_gemma":[0.000052299252,0.00040533947,0.0007805482,0.000014704615,0.000046264144,0.00044781325,0.00003845306,0.93589056,0.052033484,0.009305017,0.00094942667,0.000036101614],"about_ca_topic_score_codex":0.00045472212,"about_ca_topic_score_gemma":0.0002860727,"teacher_disagreement_score":0.0018978223,"about_ca_system_score_codex":0.00052628317,"about_ca_system_score_gemma":0.0005865177,"threshold_uncertainty_score":0.0100367665},"labels":[],"label_agreement":null},{"id":"W2061780772","doi":"10.4236/jcc.2014.28007","title":"Multilayer Authentication for Communication Systems Based on Physical-Layer Attributes","year":2014,"lang":"en","type":"article","venue":"Journal of Computer and Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Western University","funders":"","keywords":"Physical layer; Computer science; Authentication (law); Randomness; Computer network; Handshake; Mathematics; Computer security; Wireless; Telecommunications","score_opus":0.028760786579213733,"score_gpt":0.27901294223255296,"score_spread":0.25025215565333925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061780772","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.03927807,0.00095482473,0.95452857,0.00021665449,0.00015483865,0.00015431487,0.0000640482,0.0009821051,0.0036666458],"genre_scores_gemma":[0.87753326,0.0006919831,0.11824872,0.000121217076,0.00011548911,0.00010488162,0.00009456921,0.000028290922,0.0030615656],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99819046,0.00039554073,0.00023296344,0.00026815076,0.0006516682,0.00026125825],"domain_scores_gemma":[0.9974698,0.0005799614,0.0004390147,0.0009743759,0.0004520939,0.00008482919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014816328,0.0007994967,0.00074019376,0.0009902277,0.0009062022,0.0021744675,0.000624226,0.0009871931,0.0023939265],"category_scores_gemma":[0.003484272,0.00030239654,0.0007257938,0.00067538087,0.0010729985,0.003867752,0.0027401953,0.0012933046,0.0011414276],"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.0014045474,0.00021549591,0.0054451614,0.00091986224,0.00023569107,0.0012501067,0.000791353,0.13315026,0.23237316,0.2339036,0.0029350517,0.3873757],"study_design_scores_gemma":[0.000054919972,0.0011076416,0.003214851,0.00017769176,0.00023868619,0.0013500537,0.00021377845,0.82069373,0.08392299,0.06360275,0.02523466,0.0001881699],"about_ca_topic_score_codex":0.0006516907,"about_ca_topic_score_gemma":0.00045941275,"teacher_disagreement_score":0.0023939265,"about_ca_system_score_codex":0.0006709094,"about_ca_system_score_gemma":0.00052509736,"threshold_uncertainty_score":0.00800848},"labels":[],"label_agreement":null},{"id":"W2062345990","doi":"10.1109/ciss.2010.5464891","title":"On the symmetric capacity of the K-user symmetric cyclic Gaussian interference channel","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"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 Toronto","funders":"","keywords":"Interference (communication); Gaussian; Channel (broadcasting); Topology (electrical circuits); Upper and lower bounds; Channel capacity; Co-channel interference; Simple (philosophy); Computer science; Mathematics; Telecommunications; Algorithm; Combinatorics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.020707263005133925,"score_gpt":0.22740863182386914,"score_spread":0.20670136881873521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062345990","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.13046494,0.003993146,0.8063255,0.002806677,0.00019952156,0.00011929565,0.0009343383,0.0002981622,0.054858446],"genre_scores_gemma":[0.9594741,0.0038527055,0.031905647,0.00045848734,0.0002932288,0.0002898275,0.00039252607,0.00011330147,0.0032202334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972766,0.0011047549,0.00010272195,0.00031826648,0.0006633996,0.0005342918],"domain_scores_gemma":[0.9812045,0.013676761,0.0010542877,0.0017073002,0.001967519,0.00038965236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036068899,0.0013390094,0.0015737825,0.001389354,0.000995048,0.002072267,0.0018878506,0.0009888818,0.0042939656],"category_scores_gemma":[0.018101836,0.00056151405,0.0008148747,0.0017125388,0.0045156856,0.004737711,0.0033366913,0.0024400859,0.0010099111],"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.0003299047,0.000056878303,0.0004877182,0.00031335236,0.00007457222,0.00032871755,0.00043947456,0.15068695,0.009300994,0.81306076,0.0044227773,0.020497922],"study_design_scores_gemma":[0.000033927692,0.00008901692,0.0004335995,0.0001303885,0.000039216797,0.00030416402,0.00013613088,0.47324866,0.008109605,0.51427203,0.0031059913,0.000097353695],"about_ca_topic_score_codex":0.0017801878,"about_ca_topic_score_gemma":0.0007976491,"teacher_disagreement_score":0.0042939656,"about_ca_system_score_codex":0.0017964536,"about_ca_system_score_gemma":0.0019821688,"threshold_uncertainty_score":0.019075274},"labels":[],"label_agreement":null},{"id":"W2062461383","doi":"10.1109/isit.2007.4557105","title":"Robust Joint Source-Channel Coding for Delay-Limited Applications","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"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":"Channel code; Additive white Gaussian noise; Computer science; Coding (social sciences); Decoding methods; Algorithm; Gaussian; Channel (broadcasting); Joint (building); Mathematics; Topology (electrical circuits); Telecommunications; Statistics; Engineering","score_opus":0.05354148330121049,"score_gpt":0.257205235058186,"score_spread":0.2036637517569755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062461383","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.02094242,0.00050938426,0.9771378,0.00015991065,0.000017026321,0.00001908551,0.000028064695,0.0001172109,0.0010690647],"genre_scores_gemma":[0.8947211,0.00071397994,0.10250976,0.000067337256,0.000059828257,0.000065289474,0.00007243114,0.000039589042,0.0017505961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921715,0.00029513892,0.000032778767,0.00010467261,0.00026848086,0.0000817713],"domain_scores_gemma":[0.9973374,0.0018939414,0.00027683922,0.00023436321,0.00020194914,0.000055533044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015469077,0.0008056071,0.00074640266,0.00042334525,0.00032836443,0.0008233952,0.001009825,0.0008952065,0.00080574414],"category_scores_gemma":[0.004845764,0.00029891674,0.00035237224,0.0007897109,0.0010641742,0.001660012,0.0015579618,0.00095323735,0.00024470364],"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.00018572477,0.00002973039,0.00023511554,0.00012210786,0.000037159836,0.0001328982,0.000085951884,0.84461236,0.012957614,0.0959095,0.00052662886,0.04516514],"study_design_scores_gemma":[0.000013436399,0.000039008235,0.000048944883,0.000009160695,0.0000093839735,0.00004340008,0.000011422261,0.9732397,0.0042276587,0.021789385,0.0005592484,0.000009212289],"about_ca_topic_score_codex":0.0007709809,"about_ca_topic_score_gemma":0.00050025835,"teacher_disagreement_score":0.0015469077,"about_ca_system_score_codex":0.0006892758,"about_ca_system_score_gemma":0.0008097829,"threshold_uncertainty_score":0.008180916},"labels":[],"label_agreement":null},{"id":"W2062610219","doi":"10.1109/tit.2008.2009807","title":"Capacity Bounds for the Gaussian Interference Channel","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":469,"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":"Gaussian; Gaussian random field; Mathematics; Topology (electrical circuits); Range (aeronautics); Interference (communication); Gaussian noise; Upper and lower bounds; Channel (broadcasting); Channel capacity; Algorithm; Gaussian function; Combinatorics; Computer science; Physics; Telecommunications; Mathematical analysis; Engineering","score_opus":0.01790983207713149,"score_gpt":0.23509185783253725,"score_spread":0.21718202575540577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062610219","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.033090055,0.009430734,0.87395483,0.0018747787,0.00034685046,0.0000974529,0.0010249102,0.00091132015,0.07926905],"genre_scores_gemma":[0.9060059,0.010378585,0.06812173,0.00095072493,0.0010842296,0.0005150446,0.0012477692,0.00032004467,0.011375954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758506,0.0005126205,0.000086526816,0.00026168735,0.00096574466,0.00058829255],"domain_scores_gemma":[0.987653,0.007512302,0.0009079862,0.00121712,0.0023864533,0.0003231469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026274857,0.0016004546,0.0011414308,0.001985133,0.0009770385,0.0031311603,0.0016267016,0.00093396765,0.008903166],"category_scores_gemma":[0.012398642,0.00048233639,0.0008172149,0.0020524315,0.0021891242,0.0038383373,0.0030389475,0.0024802834,0.001648862],"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.00030547538,0.000077525554,0.0006115282,0.0005764106,0.00010404314,0.00028828144,0.00046497126,0.38822088,0.006935594,0.5253878,0.019822078,0.057205416],"study_design_scores_gemma":[0.000018682365,0.000064814536,0.0006168742,0.00018409683,0.000054408854,0.00036406636,0.0001433939,0.73143387,0.005556625,0.2509314,0.010533515,0.00009821082],"about_ca_topic_score_codex":0.005097008,"about_ca_topic_score_gemma":0.0027668667,"teacher_disagreement_score":0.008903166,"about_ca_system_score_codex":0.003384129,"about_ca_system_score_gemma":0.0018456297,"threshold_uncertainty_score":0.029784083},"labels":[],"label_agreement":null},{"id":"W2065494002","doi":"10.1109/isit.2014.6874876","title":"An improved outer bound on the admissible source region for broadcast channels with correlated sources","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"McMaster University","funders":"","keywords":"Lossy compression; Upper and lower bounds; Computer science; Atomic broadcast; Broadcasting (networking); Topology (electrical circuits); Mathematics; Computer network; Combinatorics; Mathematical analysis; Artificial intelligence","score_opus":0.017200261403597168,"score_gpt":0.22987020666400687,"score_spread":0.2126699452604097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065494002","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.0053930017,0.0012976858,0.98281616,0.00033395688,0.00011220064,0.000057328678,0.0002206817,0.00024709263,0.009521788],"genre_scores_gemma":[0.5482785,0.008910541,0.4143397,0.0012953638,0.0012372005,0.0010971918,0.0017642502,0.0012942856,0.021782923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99356633,0.0018250243,0.00023165744,0.00075194787,0.0026627933,0.0009621978],"domain_scores_gemma":[0.9669949,0.025246179,0.0014196378,0.0022305003,0.0033769703,0.00073188357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055422666,0.003239866,0.0027471047,0.0028903931,0.0014849544,0.004265665,0.0034635928,0.0020714388,0.007834251],"category_scores_gemma":[0.028903587,0.0012187202,0.001886075,0.0034032043,0.0035774645,0.0069001745,0.0059543815,0.007418999,0.0024522883],"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.0006994733,0.00014947697,0.0006679126,0.0008218521,0.00015417248,0.00044356915,0.0008797524,0.5093708,0.021506341,0.4027497,0.010185605,0.05237136],"study_design_scores_gemma":[0.000056838053,0.00020666409,0.00039138822,0.000235749,0.00010578084,0.00039854093,0.00017627946,0.7722718,0.0104415035,0.20307186,0.012538949,0.0001046483],"about_ca_topic_score_codex":0.0018752668,"about_ca_topic_score_gemma":0.0014556804,"teacher_disagreement_score":0.007834251,"about_ca_system_score_codex":0.002987089,"about_ca_system_score_gemma":0.0023536617,"threshold_uncertainty_score":0.029310644},"labels":[],"label_agreement":null},{"id":"W2065706027","doi":"10.1109/isit.2012.6284012","title":"On the sum-capacity of Gaussian MAC with peak constraint","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":21,"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":"Constraint (computer-aided design); Channel (broadcasting); Gaussian; Uniqueness; Code (set theory); Computer science; Channel capacity; Topology (electrical circuits); Algorithm; Mathematics; Mathematical optimization; Telecommunications; Combinatorics; Mathematical analysis; Physics; Geometry","score_opus":0.025162873293544104,"score_gpt":0.2280568128344977,"score_spread":0.20289393954095358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065706027","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.11960653,0.0037589944,0.81473607,0.0020686411,0.00017511573,0.0000706847,0.00046989825,0.0003108822,0.05880314],"genre_scores_gemma":[0.9664944,0.0030792977,0.025083372,0.00039526809,0.00041732067,0.00017088807,0.00014651961,0.00015166911,0.0040612053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779046,0.0010826542,0.000053760876,0.0001832335,0.00048387834,0.0004060126],"domain_scores_gemma":[0.98469603,0.013057591,0.00048753255,0.0005692288,0.000957848,0.00023180962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039145914,0.0013623084,0.0012305358,0.0014365141,0.0009512378,0.002386277,0.0013348757,0.0009552849,0.0042724377],"category_scores_gemma":[0.018155104,0.0006490895,0.0006163932,0.0016789897,0.004483672,0.0039171632,0.0028429695,0.002092418,0.0005818429],"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.00021656565,0.00004789235,0.0005006319,0.00020520258,0.00005528033,0.0002178651,0.0002608755,0.35234156,0.0033417852,0.630078,0.0021702764,0.010563962],"study_design_scores_gemma":[0.000018561781,0.000045863373,0.00026477152,0.000083990155,0.000025057103,0.00011246577,0.00008158924,0.72620577,0.0015255794,0.27050892,0.0010926264,0.0000348418],"about_ca_topic_score_codex":0.0024319259,"about_ca_topic_score_gemma":0.0011570768,"teacher_disagreement_score":0.0042724377,"about_ca_system_score_codex":0.0022572319,"about_ca_system_score_gemma":0.001434984,"threshold_uncertainty_score":0.0207026},"labels":[],"label_agreement":null},{"id":"W2065940652","doi":"10.1117/12.838868","title":"Inter-bit prediction based on maximum likelihood estimate for distributed video coding","year":2009,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","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":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Encoder; Decoding methods; Parity bit; Bit plane; Algorithm; Bit field; Bit error rate; Coding (social sciences); Bitstream; Bit rate; Coding gain; Computational complexity theory; Real-time computing; Mathematics; Statistics","score_opus":0.010917768140061688,"score_gpt":0.23887931835157433,"score_spread":0.22796155021151265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065940652","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.003554937,0.00030705208,0.99540555,0.00006233283,0.000019516794,0.000018101246,0.0000149082925,0.0002993057,0.00031827434],"genre_scores_gemma":[0.29575986,0.00071103376,0.69949853,0.00014310992,0.000121519886,0.00023182492,0.00032737074,0.00015906114,0.0030477156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892646,0.0003676725,0.000050007104,0.00018612365,0.00040785564,0.00006182714],"domain_scores_gemma":[0.9976344,0.0015930759,0.00017994239,0.00017245399,0.00038144735,0.0000386808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013337135,0.000867888,0.0010403295,0.0007602293,0.00038706485,0.0006859772,0.0013344436,0.0011231177,0.0017723392],"category_scores_gemma":[0.005818851,0.0004511833,0.0005654284,0.00079344097,0.00068626006,0.0013963298,0.00087012735,0.0019012676,0.0008812794],"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.0003626816,0.00010986008,0.0012066223,0.00013813814,0.00008140791,0.0001408925,0.00012018441,0.5287624,0.013032748,0.012989379,0.0019916059,0.44106415],"study_design_scores_gemma":[0.000006244699,0.000019750112,0.00013398299,0.000008772062,0.000004811018,0.000024072233,0.0000035486403,0.9951409,0.0025066556,0.0018220347,0.00032051714,0.000008800526],"about_ca_topic_score_codex":0.0027772724,"about_ca_topic_score_gemma":0.0024586467,"teacher_disagreement_score":0.0027772724,"about_ca_system_score_codex":0.00075591326,"about_ca_system_score_gemma":0.000933244,"threshold_uncertainty_score":0.007053435},"labels":[],"label_agreement":null},{"id":"W2066459959","doi":"10.1109/lcomm.2013.060513.130802","title":"Artificial-Noise Alignment for Secure Multicast using Multiple Antennas","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":42,"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 Toronto","funders":"","keywords":"Artificial noise; Computer science; Secure multicast; Transmitter; Noise (video); Channel (broadcasting); Generalization; Degrees of freedom (physics and chemistry); Theoretical computer science; Multicast; Upper and lower bounds; Topology (electrical circuits); Algorithm; Computer network; Artificial intelligence; Mathematics; Physics","score_opus":0.05689635463289886,"score_gpt":0.28558247761475164,"score_spread":0.22868612298185279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066459959","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.034192145,0.0002950738,0.96195793,0.00024504995,0.00006221264,0.000026421087,0.000020134406,0.00014774126,0.0030532521],"genre_scores_gemma":[0.8445223,0.000348541,0.15260409,0.00017923808,0.00009238641,0.000089808935,0.000043172487,0.00003130904,0.002089208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983224,0.00074555026,0.00007463253,0.00014849374,0.00055818853,0.00015075524],"domain_scores_gemma":[0.9983683,0.0007002913,0.00030753837,0.00035003247,0.00020314642,0.000070722825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013100542,0.0007175824,0.0006495069,0.00045727866,0.00075927324,0.00067000405,0.00080677256,0.001008614,0.00095683796],"category_scores_gemma":[0.00351379,0.00024898694,0.0003985581,0.0006441158,0.0011273518,0.0016792334,0.0020326714,0.00091839925,0.00039327686],"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.00092770846,0.000121595025,0.0017061072,0.00026281524,0.000090877424,0.0005035194,0.0004616065,0.24727407,0.13599415,0.4896046,0.0018483816,0.12120464],"study_design_scores_gemma":[0.000033760993,0.0002590305,0.00024254748,0.00002797214,0.0000337983,0.00031006,0.000040774365,0.9119175,0.031321514,0.05209098,0.003676017,0.00004606816],"about_ca_topic_score_codex":0.00017565711,"about_ca_topic_score_gemma":0.00018058796,"teacher_disagreement_score":0.0013100542,"about_ca_system_score_codex":0.0006673876,"about_ca_system_score_gemma":0.00038577645,"threshold_uncertainty_score":0.006928265},"labels":[],"label_agreement":null},{"id":"W2066761070","doi":"10.1109/icassp.2014.6854702","title":"On the accuracy of the high SNR approximation of the differential entropy of signals in additive Gaussian noise","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"Carleton University","funders":"","keywords":"Gaussian noise; Transmitter; Mathematics; Taylor series; Gaussian; Computation; Signal-to-noise ratio (imaging); Algorithm; Upper and lower bounds; Entropy (arrow of time); Computer science; Applied mathematics; Telecommunications; Channel (broadcasting); Mathematical analysis; Statistics; Physics","score_opus":0.008650754638183414,"score_gpt":0.21616833091199703,"score_spread":0.20751757627381362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066761070","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.106242985,0.002972583,0.8622986,0.0018155419,0.00029457617,0.000039908016,0.00016658369,0.00049732404,0.02567192],"genre_scores_gemma":[0.93034035,0.0021978412,0.062391683,0.00032519322,0.00028202048,0.00006255159,0.00016113638,0.00025699177,0.003982157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970709,0.0011649486,0.00010754165,0.00029178345,0.0010773181,0.0002874664],"domain_scores_gemma":[0.9608315,0.034009434,0.0011026197,0.0025174022,0.0012760938,0.00026286725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007896119,0.0010153301,0.0009151624,0.0015768943,0.00068089267,0.0019490765,0.0016765784,0.0011367286,0.0015033366],"category_scores_gemma":[0.0559099,0.0003830655,0.0006353729,0.0008823982,0.005502149,0.0043733562,0.002235095,0.0028934167,0.00060094375],"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.00036002873,0.0000674919,0.0032393318,0.0002721832,0.00006015243,0.00055962545,0.0004774785,0.47955608,0.00905598,0.4748052,0.001655791,0.029890584],"study_design_scores_gemma":[0.000008664278,0.000040517847,0.0007747365,0.00007962084,0.000010878328,0.00016129842,0.00004334999,0.88639855,0.0037918726,0.10782487,0.0008345367,0.000031159307],"about_ca_topic_score_codex":0.002424861,"about_ca_topic_score_gemma":0.0013286967,"teacher_disagreement_score":0.007896119,"about_ca_system_score_codex":0.0017955233,"about_ca_system_score_gemma":0.0008477588,"threshold_uncertainty_score":0.041759193},"labels":[],"label_agreement":null},{"id":"W2069080345","doi":"10.1109/glocom.2011.6134247","title":"MIMO Broadcast Channel with Arbitrarily Varying Eavesdropper Channel: Secrecy Degrees of Freedom","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"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 Toronto","funders":"","keywords":"MIMO; Transmitter; Computer science; Secrecy; Channel (broadcasting); Information-theoretic security; Channel state information; Precoding; Degrees of freedom (physics and chemistry); Topology (electrical circuits); Artificial noise; Computer network; Telecommunications; Wireless; Mathematics; Computer security; Physics; Combinatorics","score_opus":0.03488481493504921,"score_gpt":0.21617879358492356,"score_spread":0.18129397864987434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069080345","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.030797835,0.00070602674,0.9580693,0.0003786822,0.00008078838,0.0000363224,0.00028089722,0.00016868908,0.009481575],"genre_scores_gemma":[0.960594,0.0012966094,0.033645622,0.00011262097,0.00011282458,0.00007260658,0.00015161067,0.000026275602,0.003987855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986172,0.00040871277,0.00005503622,0.00018862504,0.00043748482,0.00029299135],"domain_scores_gemma":[0.9970734,0.0016973855,0.0003432236,0.00041202115,0.00038533568,0.00008850975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013380215,0.00088991417,0.0011573336,0.00041592773,0.00080111844,0.001566621,0.00078769634,0.0010175995,0.0021175446],"category_scores_gemma":[0.0030291912,0.00044272293,0.00052869983,0.001110772,0.0017001808,0.0015344934,0.0014454213,0.0014049548,0.0005412764],"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.00047097984,0.00004833569,0.00094603706,0.00036187988,0.00007343602,0.0011366332,0.00024556136,0.56290865,0.027874693,0.3826557,0.0026444308,0.020633578],"study_design_scores_gemma":[0.000040726,0.000120428485,0.00055363256,0.000037595197,0.000048152357,0.0006796327,0.00008833057,0.93237346,0.011775664,0.051327616,0.0028899517,0.0000647395],"about_ca_topic_score_codex":0.001985698,"about_ca_topic_score_gemma":0.001391342,"teacher_disagreement_score":0.0021175446,"about_ca_system_score_codex":0.0010361869,"about_ca_system_score_gemma":0.0010912425,"threshold_uncertainty_score":0.007518053},"labels":[],"label_agreement":null},{"id":"W2069459718","doi":"10.1109/isit.2013.6620736","title":"On The effect of self-interference in Gaussian two-way channels with erased outputs","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Waterloo","funders":"","keywords":"Erasure; Interference (communication); Computer science; Gaussian; Upper and lower bounds; Channel (broadcasting); Topology (electrical circuits); Binary erasure channel; Transmission (telecommunications); Algorithm; Gaussian noise; Telecommunications; Mathematics; Physics; Channel capacity; Combinatorics; Mathematical analysis","score_opus":0.0071755537532816865,"score_gpt":0.21807591866640486,"score_spread":0.21090036491312317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069459718","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.23787342,0.009349818,0.697404,0.0009900673,0.0002561172,0.00006988286,0.00035998097,0.0005575181,0.053139158],"genre_scores_gemma":[0.979349,0.0035485567,0.013701274,0.00015577135,0.00014582321,0.000063870175,0.00009654481,0.00007817512,0.002860996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771947,0.0008297372,0.00007319951,0.00018490014,0.0007287045,0.0004639359],"domain_scores_gemma":[0.98310107,0.013939388,0.0009805151,0.0007832677,0.0009463387,0.00024930146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023036771,0.0019696972,0.0012795189,0.0013497331,0.00079660735,0.0017835847,0.0012092256,0.0010741788,0.0022849753],"category_scores_gemma":[0.010343654,0.0007437203,0.0008216525,0.0010121102,0.0033402406,0.0031088856,0.0023090732,0.0017732336,0.00045504776],"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.00034811825,0.00009638092,0.0011838424,0.0005912493,0.00014443163,0.0010085267,0.00042992382,0.75533044,0.016598744,0.20976587,0.0013659726,0.013136548],"study_design_scores_gemma":[0.000013058242,0.00013413954,0.000605229,0.000102979175,0.000047400677,0.00029428455,0.00009011038,0.9461734,0.0060073934,0.045683507,0.00078150246,0.00006705164],"about_ca_topic_score_codex":0.0018870152,"about_ca_topic_score_gemma":0.0014595614,"teacher_disagreement_score":0.0023036771,"about_ca_system_score_codex":0.0016120065,"about_ca_system_score_gemma":0.000816295,"threshold_uncertainty_score":0.01218313},"labels":[],"label_agreement":null},{"id":"W2070207987","doi":"10.1109/vtcfall.2014.6966172","title":"Secret Key Generation Using Physical Channels with Imperfect CSI","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Key generation; Computer science; Secrecy; Randomness; Key (lock); Imperfect; Quantization (signal processing); Channel (broadcasting); Wireless; Computer network; Information-theoretic security; Computer security; Reliability (semiconductor); Cryptography; Telecommunications; Algorithm; Mathematics","score_opus":0.019964571945250975,"score_gpt":0.2420222333344565,"score_spread":0.22205766138920552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070207987","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.090468176,0.0005873379,0.90538836,0.00072490895,0.000043863958,0.000037280293,0.000056058467,0.00017227748,0.0025217244],"genre_scores_gemma":[0.94697213,0.00042502958,0.051526166,0.00008328141,0.000041645133,0.00002572761,0.000041270207,0.000026719079,0.00085803325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796057,0.00090023404,0.00009718406,0.00021443951,0.00059012056,0.00023748404],"domain_scores_gemma":[0.99150026,0.006284431,0.0009064423,0.0009959243,0.00022925118,0.000083644176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031510824,0.0006625689,0.00088254124,0.0005133641,0.0004893519,0.0011987768,0.0008336337,0.001007762,0.0010017052],"category_scores_gemma":[0.012712242,0.0004550289,0.0004124079,0.00072258495,0.0027176605,0.004256424,0.001965781,0.0010074765,0.0002763636],"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.0009840389,0.00009904426,0.0025114191,0.0005059185,0.00013546023,0.0006953929,0.0005159766,0.5924902,0.05875478,0.2840792,0.0007448353,0.0584838],"study_design_scores_gemma":[0.00006903218,0.0002095792,0.0005110492,0.000060354716,0.00005070511,0.0006308996,0.00013734425,0.85366225,0.03964817,0.1036602,0.001274115,0.000086153814],"about_ca_topic_score_codex":0.00024835108,"about_ca_topic_score_gemma":0.00028710772,"teacher_disagreement_score":0.0031510824,"about_ca_system_score_codex":0.00078133965,"about_ca_system_score_gemma":0.00062882266,"threshold_uncertainty_score":0.016664743},"labels":[],"label_agreement":null},{"id":"W2070558457","doi":"10.1109/cwit.2011.5872117","title":"On the capacity of the cognitive Z-interference channel","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Transmitter; Decoding methods; Interference (communication); Channel (broadcasting); Upper and lower bounds; Superposition principle; Coding (social sciences); Topology (electrical circuits); Encoding (memory); Computer science; Cognitive radio; Gaussian; Code word; Channel capacity; Telecommunications; Mathematics; Algorithm; Physics; Combinatorics; Wireless; Artificial intelligence; Statistics","score_opus":0.07092055491466762,"score_gpt":0.22586448396927214,"score_spread":0.15494392905460452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070558457","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.16540714,0.0058353483,0.7515028,0.0021211312,0.00021931976,0.00006289054,0.00044728175,0.0002931153,0.07411095],"genre_scores_gemma":[0.97101754,0.0042647333,0.019213635,0.00033517592,0.00027781154,0.00014699374,0.00018285855,0.000075308046,0.0044859154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998743,0.00037822942,0.000030157249,0.00010876895,0.00032104627,0.00041876565],"domain_scores_gemma":[0.989988,0.0080697425,0.0005273582,0.00037138799,0.0008556171,0.00018778966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017598413,0.0010295445,0.0006852689,0.0012665313,0.0006154461,0.002172299,0.0009373664,0.00075505476,0.004008469],"category_scores_gemma":[0.010694222,0.0003298919,0.00051344454,0.0012671666,0.0031665494,0.0025002146,0.0020310103,0.0017430286,0.00068410154],"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.00020223057,0.000053397984,0.00065202493,0.00023894712,0.000049943326,0.0002639189,0.00036129594,0.42896405,0.0057342444,0.5457215,0.003097279,0.01466119],"study_design_scores_gemma":[0.000021437661,0.000054572745,0.00046177683,0.00013512412,0.000026731557,0.0001590356,0.00013482175,0.7802886,0.0026510938,0.21329123,0.002729046,0.0000464038],"about_ca_topic_score_codex":0.0042037885,"about_ca_topic_score_gemma":0.0015804319,"teacher_disagreement_score":0.0042037885,"about_ca_system_score_codex":0.0019162593,"about_ca_system_score_gemma":0.0015851726,"threshold_uncertainty_score":0.013903499},"labels":[],"label_agreement":null},{"id":"W2071160621","doi":"10.1007/s00220-008-0624-0","title":"Counterexamples to the Maximal p-Norm Multiplicativity Conjecture for all p &gt; 1","year":2008,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":113,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Counterexample; Conjecture; Von Neumann entropy; Quantum; Classical capacity; Entropy (arrow of time); Quantum channel; Quantum mutual information; Joint quantum entropy","score_opus":0.09462451070217012,"score_gpt":0.32552309451919936,"score_spread":0.23089858381702924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071160621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43390298,0.0016544407,0.11975379,0.049430896,0.0021177093,0.000107808824,0.0014895711,0.0013692473,0.39017364],"genre_scores_gemma":[0.97310424,0.0004213436,0.010519917,0.0023465075,0.0013717256,0.00013281286,0.00062680704,0.00019707547,0.011279505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965391,0.0010562477,0.00017489602,0.0007881626,0.0008109631,0.00063070294],"domain_scores_gemma":[0.98948133,0.0071236324,0.000668853,0.0011114808,0.0007507333,0.00086398533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030713098,0.0010570358,0.0012522491,0.0018083069,0.005249291,0.0065689,0.0022571608,0.0041350774,0.015572612],"category_scores_gemma":[0.016613513,0.0008681022,0.0011505964,0.0020949435,0.009603287,0.0115493275,0.0068321195,0.0066218516,0.001435295],"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.00006697818,0.000014701247,0.00023345022,0.000035603578,0.000005897923,0.00008948621,0.000157002,0.00030311738,0.0002405171,0.993618,0.0039938665,0.0012414468],"study_design_scores_gemma":[0.000020307489,0.0000069877733,0.00012956948,0.000010691114,0.0000055033142,0.000108110275,0.00008557472,0.0016124924,0.00030016573,0.9957014,0.0020103918,0.000008778979],"about_ca_topic_score_codex":0.0007606398,"about_ca_topic_score_gemma":0.0005432123,"teacher_disagreement_score":0.015572612,"about_ca_system_score_codex":0.0015593991,"about_ca_system_score_gemma":0.00087970006,"threshold_uncertainty_score":0.052095532},"labels":[],"label_agreement":null},{"id":"W2071161309","doi":"10.1109/isplc.2014.6812346","title":"Physical layer security in MIMO power line communication networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":36,"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 British Columbia","funders":"","keywords":"Physical layer; Power-line communication; Secrecy; MIMO; Computer science; Computer network; Wireless; Electronic engineering; Transmission (telecommunications); Communications system; Channel (broadcasting); Power (physics); Telecommunications; Engineering; Computer security","score_opus":0.009938803045263723,"score_gpt":0.2523434800962641,"score_spread":0.24240467705100038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071161309","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.11222096,0.0013679735,0.87636155,0.0006605298,0.00008757532,0.00003680936,0.000063330444,0.00022397845,0.008977359],"genre_scores_gemma":[0.98235947,0.0005985314,0.015803581,0.000065121414,0.000045956793,0.00003320109,0.000016908252,0.000009541509,0.0010677768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886286,0.00048801044,0.000043158645,0.00013291517,0.0003362266,0.00013686859],"domain_scores_gemma":[0.9960377,0.0027494961,0.0005014793,0.000408299,0.00024850396,0.000054564614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011659813,0.0004820307,0.0005050756,0.0003392523,0.00055903645,0.0012435515,0.00036584833,0.0007777676,0.0015898492],"category_scores_gemma":[0.004043272,0.00030073273,0.0002417679,0.00037360485,0.001790235,0.0019785904,0.0011399313,0.00077134283,0.0002866966],"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.0004028785,0.000060258986,0.0010791979,0.00033334695,0.000053837754,0.00089934317,0.00036925726,0.6609439,0.051817976,0.2438656,0.001544503,0.03862987],"study_design_scores_gemma":[0.00003268081,0.00015705485,0.00031646568,0.000042703232,0.000016299868,0.00035039915,0.000087792985,0.9289748,0.008922661,0.059380442,0.0016880786,0.000030667597],"about_ca_topic_score_codex":0.0003927555,"about_ca_topic_score_gemma":0.00019338993,"teacher_disagreement_score":0.0015898492,"about_ca_system_score_codex":0.0004903752,"about_ca_system_score_gemma":0.00036931492,"threshold_uncertainty_score":0.0061663985},"labels":[],"label_agreement":null},{"id":"W2072266431","doi":"10.1109/icc.2014.6883407","title":"Bounds on secret key rates in fading channels under practical channel estimation schemes","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Victoria","funders":"","keywords":"Key (lock); Key generation; Computer science; Channel (broadcasting); Fading; Computer network; Upper and lower bounds; Pre-shared key; Wireless; Key distribution; Public-key cryptography; Computer security; Telecommunications; Mathematics; Encryption","score_opus":0.03126642646143379,"score_gpt":0.3098824490818715,"score_spread":0.2786160226204377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072266431","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.041751795,0.0038449746,0.9424445,0.00047479893,0.00011031664,0.00009823919,0.00020184227,0.00049045024,0.010582993],"genre_scores_gemma":[0.86172885,0.0062189484,0.12782201,0.00020949946,0.0002810541,0.0005122861,0.0003262602,0.00035235245,0.0025487342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9886079,0.0035440833,0.00051327463,0.0011854172,0.0040983628,0.0020509104],"domain_scores_gemma":[0.8720138,0.10744844,0.005363316,0.009343571,0.0049638953,0.0008669559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013825622,0.0025378016,0.002164458,0.0028138328,0.0015526415,0.004064422,0.0020262597,0.001861216,0.0031011011],"category_scores_gemma":[0.10528742,0.0010621914,0.0010689558,0.00214386,0.004997362,0.00998096,0.005181622,0.0045373156,0.0009487564],"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.00065314426,0.00007985596,0.0010149352,0.0004386678,0.00009510355,0.0002869896,0.0005047738,0.652095,0.01136531,0.2900801,0.0013332639,0.042052872],"study_design_scores_gemma":[0.000029381838,0.00017034404,0.00053371873,0.00029354208,0.000055147353,0.00041277902,0.00014966648,0.8759242,0.015173119,0.10467607,0.0024754144,0.00010663314],"about_ca_topic_score_codex":0.0009028814,"about_ca_topic_score_gemma":0.00065800914,"teacher_disagreement_score":0.013825622,"about_ca_system_score_codex":0.003342683,"about_ca_system_score_gemma":0.0016152598,"threshold_uncertainty_score":0.07311779},"labels":[],"label_agreement":null},{"id":"W2072267094","doi":"10.1109/milcom.2013.219","title":"Inferring Wireless Communications Links and Network Topology from Externals Using Granger Causality","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science; Robustness (evolution); Network topology; Inference; Wireless ad hoc network; Computer network; Wireless network; Wireless; Causality (physics); Granger causality; Topology (electrical circuits); Distributed computing; Data mining; Machine learning; Artificial intelligence; Telecommunications; Mathematics","score_opus":0.03929304619211728,"score_gpt":0.28989824572819983,"score_spread":0.25060519953608257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072267094","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.05046937,0.00027796126,0.9462833,0.000236096,0.000048066006,0.00004217853,0.00044862708,0.0006640897,0.0015303801],"genre_scores_gemma":[0.7792678,0.0007153612,0.21707682,0.000107742075,0.0000919232,0.00011080254,0.0011049784,0.00022173583,0.0013028639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834275,0.00079647015,0.00009949038,0.0003216131,0.0003515339,0.00008814006],"domain_scores_gemma":[0.9872749,0.009133563,0.0015754569,0.0013074314,0.00056447566,0.00014420929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029987108,0.0009698152,0.00067868544,0.0037470045,0.00072114036,0.0025217421,0.0010041398,0.0007850403,0.0014131605],"category_scores_gemma":[0.025968766,0.00054872263,0.00062935933,0.0034103827,0.0011974479,0.0032820033,0.0017719571,0.0021433309,0.00031599583],"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.00019863981,0.00008653353,0.039298613,0.0002073758,0.00037434767,0.00030642425,0.00038648274,0.78588575,0.0022552577,0.07191199,0.0012215095,0.09786714],"study_design_scores_gemma":[0.000027642056,0.00003407367,0.004700212,0.00004613026,0.000054851247,0.00012407072,0.00012105421,0.90294826,0.0019644224,0.087221965,0.002710586,0.00004674775],"about_ca_topic_score_codex":0.005258849,"about_ca_topic_score_gemma":0.0052889828,"teacher_disagreement_score":0.005258849,"about_ca_system_score_codex":0.0007918804,"about_ca_system_score_gemma":0.001161338,"threshold_uncertainty_score":0.015858889},"labels":[],"label_agreement":null},{"id":"W2075357945","doi":"10.1109/itw.2014.6970892","title":"Dirty interference cancellation for Gaussian broadcast channels","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Toronto","funders":"","keywords":"Transmitter; Channel (broadcasting); Computer science; Interference (communication); Transmission (telecommunications); Gaussian; Computer network; Channel state information; Focus (optics); Topology (electrical circuits); Telecommunications; Independent and identically distributed random variables; Mathematics; Wireless; Engineering; Random variable; Electrical engineering; Physics","score_opus":0.017653772644025015,"score_gpt":0.24799722717825115,"score_spread":0.23034345453422614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075357945","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.022108745,0.0014034206,0.95741457,0.00043768587,0.00011833453,0.000036610603,0.00013657121,0.00029146363,0.018052578],"genre_scores_gemma":[0.9246826,0.0032534779,0.05878992,0.0003197519,0.00024318822,0.00015043512,0.00022466794,0.00012298115,0.012212976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971704,0.00070612406,0.000054087952,0.00030437118,0.0012083569,0.00055667304],"domain_scores_gemma":[0.99044025,0.006513494,0.0008560732,0.0005491962,0.0014663043,0.00017467415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024630937,0.0014232119,0.0012026157,0.0013088575,0.0012310692,0.0025007627,0.0014358541,0.0013339993,0.002861998],"category_scores_gemma":[0.009554119,0.00069583795,0.00059928163,0.0015663629,0.0035365229,0.0022219305,0.00200551,0.0017815315,0.0008263041],"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.00024098513,0.00004877516,0.0005630946,0.000317614,0.00005727017,0.00041050403,0.00037907728,0.698034,0.0061407713,0.2636939,0.004031889,0.026082093],"study_design_scores_gemma":[0.000015451064,0.000050139613,0.000111068395,0.000030217543,0.000016716018,0.00015149417,0.00006449982,0.9281964,0.0019931328,0.0675156,0.0018194391,0.000035807036],"about_ca_topic_score_codex":0.0062767006,"about_ca_topic_score_gemma":0.005222179,"teacher_disagreement_score":0.0062767006,"about_ca_system_score_codex":0.003296116,"about_ca_system_score_gemma":0.0022084338,"threshold_uncertainty_score":0.023915172},"labels":[],"label_agreement":null},{"id":"W2077664724","doi":"10.1109/infocom.2014.6848161","title":"Scheduling in a secure wireless network","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"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":"Computer science; Scheduling (production processes); Wireless network; Base station; Wireless; Distributed computing; Computer network; Dynamic priority scheduling; Fair-share scheduling; Maximum throughput scheduling; Round-robin scheduling; Mathematical optimization; Quality of service","score_opus":0.007122276794472298,"score_gpt":0.21350025301028813,"score_spread":0.20637797621581583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077664724","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.074678235,0.00040564232,0.9209369,0.00048008698,0.00008009085,0.000082770355,0.00007675878,0.00012650073,0.0031330306],"genre_scores_gemma":[0.8912468,0.0008667822,0.104161575,0.00010592034,0.00012818415,0.00015077018,0.00008655312,0.000047507587,0.0032059706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988079,0.00052928884,0.000055027573,0.00022332634,0.00020925977,0.00017524205],"domain_scores_gemma":[0.9976417,0.0016085332,0.0003164565,0.00015084911,0.00016578328,0.00011665079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016983133,0.0008294003,0.0010531764,0.00042537396,0.0008240372,0.0013589057,0.000759033,0.0010549679,0.0017539422],"category_scores_gemma":[0.0034743918,0.00046106032,0.00049240596,0.0008594614,0.0013526833,0.0019365398,0.00097141374,0.00091886835,0.00029051738],"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.000117213065,0.000038628663,0.00034137873,0.000049368187,0.00001680373,0.00013044623,0.000053772037,0.94208866,0.001969289,0.047560673,0.00043688787,0.0071969694],"study_design_scores_gemma":[0.000023700399,0.000023393208,0.000049108836,0.0000028585264,0.0000051733587,0.00001533026,0.000016532533,0.98372793,0.00036462743,0.015401181,0.00036600968,0.000004159504],"about_ca_topic_score_codex":0.0039784815,"about_ca_topic_score_gemma":0.0021765118,"teacher_disagreement_score":0.0039784815,"about_ca_system_score_codex":0.0014761301,"about_ca_system_score_gemma":0.0014063477,"threshold_uncertainty_score":0.010710061},"labels":[],"label_agreement":null},{"id":"W2077980607","doi":"10.1109/dcc.2010.21","title":"Information Flows in Video Coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Coding tree unit; Computer science; Context-adaptive binary arithmetic coding; Coding (social sciences); Multiview Video Coding; Context-adaptive variable-length coding; Variable-length code; Scalable Video Coding; Tunstall coding; Shannon–Fano coding; Theoretical computer science; Markov chain; Rate–distortion theory; Algorithm; Real-time computing; Video tracking; Artificial intelligence; Data compression; Motion compensation; Video processing; Decoding methods; Mathematics; Machine learning; Statistics","score_opus":0.006595255575406383,"score_gpt":0.22148500435057614,"score_spread":0.21488974877516975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077980607","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.026465787,0.0077071264,0.931678,0.0018719657,0.00028854064,0.00010565411,0.00017682246,0.00017054562,0.03153549],"genre_scores_gemma":[0.84684145,0.013372646,0.12986666,0.00066592835,0.0011393256,0.00037564256,0.00026496383,0.00015532348,0.007318027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99755114,0.0010201068,0.00007356257,0.00022326091,0.00087854714,0.0002533434],"domain_scores_gemma":[0.9825112,0.014537774,0.00079218525,0.00075077807,0.0012522071,0.00015582489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036155975,0.0014299831,0.00090138457,0.0021246742,0.001033519,0.0023884054,0.0012315366,0.0014620174,0.0030248566],"category_scores_gemma":[0.021157894,0.000494823,0.00049415696,0.0024108686,0.0031680518,0.00500567,0.0017952295,0.0023103028,0.00061989954],"study_design_candidate":"not_applicable","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.000061043494,0.000029662286,0.00028047757,0.00011317305,0.000015487278,0.00006913144,0.00013752782,0.10387326,0.0009839601,0.8707464,0.0019962215,0.021693598],"study_design_scores_gemma":[0.000017464045,0.00006836636,0.00012235789,0.00007355746,0.00001193966,0.00009953954,0.000039251445,0.44217238,0.0013674509,0.5523256,0.0036834679,0.000018679808],"about_ca_topic_score_codex":0.0014797513,"about_ca_topic_score_gemma":0.00059484236,"teacher_disagreement_score":0.0036155975,"about_ca_system_score_codex":0.0026428516,"about_ca_system_score_gemma":0.0009925035,"threshold_uncertainty_score":0.01917535},"labels":[],"label_agreement":null},{"id":"W2078449661","doi":"10.1109/isit.2012.6283412","title":"Partial decode-forward binning for full-duplex causal cognitive interference channels","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Dirty paper coding; Communication source; Algorithm; Encoder; Code word; Channel (broadcasting); Coding (social sciences); Decodes; Theoretical computer science; Mathematics; Computer network; Precoding; Statistics; MIMO","score_opus":0.041417393197694476,"score_gpt":0.3009832578396332,"score_spread":0.2595658646419387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078449661","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.024334684,0.00041500683,0.9694705,0.000100158,0.000045930297,0.00004504261,0.000089500056,0.00029024962,0.005208925],"genre_scores_gemma":[0.8322577,0.000535508,0.16309372,0.00023543698,0.00005148332,0.00012676042,0.000185447,0.00004777439,0.0034661693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905366,0.00027905413,0.000052200863,0.00014379855,0.0003150788,0.00015619489],"domain_scores_gemma":[0.998166,0.00080000114,0.00020331593,0.00037805235,0.00036207115,0.000090564594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013007933,0.0007111907,0.00059518206,0.0005661757,0.0006807019,0.0009145126,0.0009676412,0.00051481207,0.0027290506],"category_scores_gemma":[0.0037745296,0.00022824887,0.00034232574,0.0009440217,0.0011375806,0.0012811975,0.0015682417,0.00085325586,0.00038611217],"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.0007065377,0.00010500799,0.000948617,0.00025280358,0.000086080276,0.00026904308,0.00041973003,0.29796273,0.02019994,0.42009234,0.002515831,0.25644138],"study_design_scores_gemma":[0.000063857064,0.00022689678,0.00053170114,0.000053445274,0.000056745408,0.00047165132,0.000090600755,0.809227,0.03223437,0.1501094,0.006826686,0.000107664244],"about_ca_topic_score_codex":0.002067544,"about_ca_topic_score_gemma":0.0027056334,"teacher_disagreement_score":0.0027290506,"about_ca_system_score_codex":0.00080048584,"about_ca_system_score_gemma":0.0017510877,"threshold_uncertainty_score":0.009129584},"labels":[],"label_agreement":null},{"id":"W2080257599","doi":"10.1109/glocom.2001.965721","title":"Coding for the Slepian-Wolf problem with turbo codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":187,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Turbo code; Computer science; Algorithm; Distributed source coding; Encoder; Serial concatenated convolutional codes; Concatenated error correction code; Coding (social sciences); Decoding methods; Encoding (memory); Variable-length code; Binary number; Turbo; Theoretical computer science; Block code; Mathematics; Artificial intelligence; Arithmetic; Engineering; Statistics","score_opus":0.02495451027252609,"score_gpt":0.2243430274925475,"score_spread":0.1993885172200214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080257599","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.016734,0.00038164578,0.98013544,0.00022651086,0.000040740993,0.000028675262,0.000017882849,0.000053667245,0.0023813553],"genre_scores_gemma":[0.63068014,0.0012105568,0.36234114,0.00024258079,0.00023575209,0.00021985799,0.00012441924,0.000050460316,0.004895075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999047,0.00041845188,0.00004676962,0.00006699062,0.0003372896,0.000083513536],"domain_scores_gemma":[0.9979619,0.0013633555,0.00017898055,0.00025478328,0.0001994461,0.000041736184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001560942,0.0005455979,0.0006228989,0.00050157856,0.0005693951,0.00071693066,0.0006761975,0.0013027014,0.0014787749],"category_scores_gemma":[0.006213173,0.00027133359,0.0004044653,0.00068216346,0.0015193939,0.001896752,0.0012289797,0.0010965989,0.0004376257],"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.00023657564,0.000040026363,0.00048445325,0.00023769758,0.000057817386,0.00033528463,0.00026351263,0.2592994,0.008867971,0.64474076,0.0020636315,0.083372906],"study_design_scores_gemma":[0.00006247123,0.00010114294,0.00010039979,0.000049785653,0.000016496337,0.00029369126,0.000034376695,0.7560203,0.0048154313,0.235375,0.0031019107,0.000029011728],"about_ca_topic_score_codex":0.0005030677,"about_ca_topic_score_gemma":0.0005290759,"teacher_disagreement_score":0.001560942,"about_ca_system_score_codex":0.00051153335,"about_ca_system_score_gemma":0.001126846,"threshold_uncertainty_score":0.008255124},"labels":[],"label_agreement":null},{"id":"W2081672511","doi":"10.1002/ett.1318","title":"Information rates for multi‐dimensional modulation over multiple antenna wireless channels","year":2008,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Transmitter; Beamforming; Computer science; Channel (broadcasting); Transmitter power output; Wireless; Signal-to-noise ratio (imaging); Dimension (graph theory); SIGNAL (programming language); Code rate; Antenna (radio); Channel capacity; Power (physics); Telecommunications; Computer network; Topology (electrical circuits); Mathematics; Electrical engineering; Physics; Engineering; Decoding methods","score_opus":0.037578603217770616,"score_gpt":0.26949789561720955,"score_spread":0.23191929239943893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081672511","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.22086777,0.0041135093,0.73266375,0.001268412,0.000112793,0.00016838388,0.0005069626,0.0004431339,0.039855264],"genre_scores_gemma":[0.96269286,0.0011106058,0.033674482,0.000116562274,0.000054684493,0.00025770903,0.00016484853,0.00007101416,0.0018571842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949722,0.0019703107,0.00021903847,0.00029231363,0.0015894385,0.0009566057],"domain_scores_gemma":[0.9706458,0.023225307,0.0018885104,0.0018264886,0.0020578522,0.00035608112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007949444,0.0012917017,0.001414839,0.0017317729,0.0010997541,0.002894373,0.0012652719,0.0014615149,0.003161242],"category_scores_gemma":[0.026290556,0.0005988657,0.00077856146,0.0018676069,0.0020696733,0.0027778482,0.0026602673,0.0013542094,0.00084942323],"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.00044978905,0.00006375929,0.00074231264,0.00025298173,0.00006974928,0.00017732191,0.00023307235,0.7881306,0.0069241314,0.17113553,0.0011145325,0.03070633],"study_design_scores_gemma":[0.00005743057,0.00020940544,0.00059322454,0.00014583889,0.00004113661,0.00029375454,0.00013623775,0.88673013,0.008324443,0.10193951,0.0014658525,0.00006305662],"about_ca_topic_score_codex":0.0008489895,"about_ca_topic_score_gemma":0.00065459963,"teacher_disagreement_score":0.007949444,"about_ca_system_score_codex":0.0021511384,"about_ca_system_score_gemma":0.0012474824,"threshold_uncertainty_score":0.042041183},"labels":[],"label_agreement":null},{"id":"W2081833206","doi":"10.1109/tit.2011.2177579","title":"Single-Sample Robust Joint Source–Channel Coding: Achieving Asymptotically Optimum Scaling of SDR Versus SNR","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":13,"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":"Companding; Mathematics; Decoding methods; Additive white Gaussian noise; Decibel; Gaussian; Channel (broadcasting); Algorithm; Computer science; Topology (electrical circuits); Telecommunications","score_opus":0.03534057016149927,"score_gpt":0.23131068069945662,"score_spread":0.19597011053795735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081833206","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.036653128,0.00040794475,0.9605007,0.0001512175,0.000012835492,0.000028675506,0.000037315618,0.00016073027,0.002047432],"genre_scores_gemma":[0.8434051,0.0006218146,0.15456337,0.00009642326,0.000054193213,0.00010167004,0.00006699784,0.00008740683,0.0010030044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830854,0.00063598197,0.00007908853,0.0002822075,0.00054102123,0.00015313417],"domain_scores_gemma":[0.9912072,0.0065411334,0.0008512282,0.0007479109,0.0005304122,0.00012214678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002751114,0.001028371,0.0010901236,0.0005832251,0.00034483694,0.0010749317,0.00095410243,0.0011101131,0.00097125076],"category_scores_gemma":[0.015399039,0.00035564657,0.00043918748,0.00081806927,0.0020464591,0.0022016,0.0017333686,0.001099042,0.00035131685],"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.00029782116,0.000061735256,0.0005895779,0.00025183,0.00007335677,0.00014326825,0.00018143097,0.7834165,0.03639294,0.120306306,0.0005536702,0.057731587],"study_design_scores_gemma":[0.000018812838,0.00009318019,0.0001386552,0.000022703698,0.000014538558,0.00012036846,0.000024604096,0.96374536,0.013037284,0.02232785,0.00043457857,0.000022115102],"about_ca_topic_score_codex":0.0005389631,"about_ca_topic_score_gemma":0.00038102065,"teacher_disagreement_score":0.002751114,"about_ca_system_score_codex":0.0010989571,"about_ca_system_score_gemma":0.00081135234,"threshold_uncertainty_score":0.014549434},"labels":[],"label_agreement":null},{"id":"W208299792","doi":"","title":"Quadratic Forms on Complex Random Matrices and Multi-Antenna Channel Capacity","year":2004,"lang":"en","type":"article","venue":"Defense Technical Information Center (DTIC)","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Ottawa","funders":"","keywords":"Channel capacity; Random matrix; Mathematics; Ergodic theory; MIMO; Channel (broadcasting); Information theory; Mutual information; Hypergeometric function; Measure (data warehouse); Quadratic equation; Matrix (chemical analysis); Eigenvalues and eigenvectors; Topology (electrical circuits); Computer science; Pure mathematics; Telecommunications; Statistics; Combinatorics; Physics","score_opus":0.0382555386375347,"score_gpt":0.2544759675274337,"score_spread":0.21622042888989898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W208299792","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.07044211,0.0032316847,0.8907138,0.0013680618,0.00013712037,0.000050251656,0.000251139,0.00019141265,0.033614397],"genre_scores_gemma":[0.9443492,0.0038591148,0.038351744,0.00023120572,0.00036776214,0.0001498436,0.00029017235,0.00011172406,0.012289202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880946,0.00042700826,0.000029672032,0.00012802405,0.00046746308,0.00013841236],"domain_scores_gemma":[0.992882,0.0048272307,0.000637333,0.0004364782,0.0010710921,0.0001458767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014404936,0.0008192808,0.00052587676,0.0014759409,0.000342568,0.0017240486,0.00080258935,0.0010549859,0.0040229904],"category_scores_gemma":[0.011737547,0.00041229176,0.00030877817,0.0018887294,0.0021513647,0.0034345507,0.0009782461,0.001166534,0.00079364586],"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.000026679132,0.000021162976,0.0003885039,0.00008066048,0.0000130679955,0.00013702961,0.00012390377,0.21008287,0.0016169148,0.77520454,0.0013588436,0.010945775],"study_design_scores_gemma":[0.000005899674,0.000023950142,0.00075392233,0.000031358657,0.000005309496,0.00017356526,0.000045997014,0.60335284,0.00055560906,0.393451,0.0015735263,0.000027072605],"about_ca_topic_score_codex":0.0011549322,"about_ca_topic_score_gemma":0.0008644653,"teacher_disagreement_score":0.0040229904,"about_ca_system_score_codex":0.0010624122,"about_ca_system_score_gemma":0.00057883334,"threshold_uncertainty_score":0.013458252},"labels":[],"label_agreement":null},{"id":"W2083353654","doi":"10.1109/isit.2013.6620252","title":"Time-asynchronous Gaussian multiple access channel with correlated sources","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Gaussian; Entropy (arrow of time); Offset (computer science); Encoder; Coding (social sciences); Channel code; Channel (broadcasting); Algorithm; Computer science; Variable-length code; Source code; Asymptotically optimal algorithm; Combinatorics; Mathematics; Discrete mathematics; Decoding methods; Physics; Statistics; Telecommunications; Mathematical analysis","score_opus":0.009371902492176308,"score_gpt":0.21030396202489735,"score_spread":0.20093205953272103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083353654","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.14662212,0.0009401331,0.8441856,0.0009681597,0.00013655727,0.000076426855,0.00024920126,0.00019203707,0.0066298386],"genre_scores_gemma":[0.96359324,0.0011181239,0.029987274,0.00014537947,0.00018561842,0.00013241865,0.000099011595,0.000024902327,0.004713949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984541,0.00058152253,0.00004527496,0.00024046462,0.00041103843,0.0002676615],"domain_scores_gemma":[0.9894187,0.0077993455,0.0013297604,0.00044583742,0.0007695644,0.0002367695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001813627,0.001333965,0.0012572136,0.00078620896,0.000694606,0.001345499,0.0017818883,0.0018115375,0.0012969798],"category_scores_gemma":[0.008724386,0.000570754,0.00054243667,0.0016342377,0.0024872844,0.0023989016,0.0017684915,0.0016294577,0.00034636073],"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.00041731118,0.00008183185,0.0012713873,0.00020851626,0.000079079415,0.0012116805,0.00032334306,0.72404635,0.0076606534,0.25561264,0.0008869563,0.00820015],"study_design_scores_gemma":[0.000036739788,0.00005252142,0.00013820657,0.000008146745,0.000026195714,0.000100189805,0.000030189665,0.9817762,0.0008876237,0.016648749,0.00027804956,0.000017254048],"about_ca_topic_score_codex":0.0029015227,"about_ca_topic_score_gemma":0.0017405686,"teacher_disagreement_score":0.0029015227,"about_ca_system_score_codex":0.0012948452,"about_ca_system_score_gemma":0.0011243938,"threshold_uncertainty_score":0.00959146},"labels":[],"label_agreement":null},{"id":"W2084779827","doi":"10.1109/wcl.2014.030514.140092","title":"Achieving Secure Communications over Wiretap Channels via Security Codes from Resilient Functions","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":41,"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":"Computer science; Encoding (memory); Information-theoretic security; Concrete security; Theoretical computer science; Binary number; Channel (broadcasting); Cryptography; Computer security; Computer network; Algorithm; Mathematics; Arithmetic","score_opus":0.015731213389507528,"score_gpt":0.24660599212685066,"score_spread":0.23087477873734313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084779827","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.033762224,0.00014505816,0.9611509,0.00019177521,0.000031396703,0.000057615576,0.000063944186,0.00036277008,0.0042342874],"genre_scores_gemma":[0.8253984,0.0004176945,0.17083,0.00014157071,0.000056570385,0.00021308677,0.00011923449,0.00008259242,0.002740882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987808,0.00034961416,0.000065914835,0.00016150916,0.00045915152,0.00018306238],"domain_scores_gemma":[0.9977932,0.0010570134,0.00040414452,0.00038768817,0.00028325274,0.00007472519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097041746,0.0010918296,0.0005424786,0.0010384747,0.00062612287,0.0009932843,0.00069509,0.0010739712,0.0020280704],"category_scores_gemma":[0.004197416,0.00035602818,0.0005289483,0.0010035636,0.0017377628,0.0018406108,0.0018876214,0.0016562429,0.0005970906],"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.00039386,0.00007704278,0.0005037796,0.00021018942,0.00004407594,0.00042170673,0.0003148064,0.23177963,0.062441707,0.61201096,0.001613149,0.090189174],"study_design_scores_gemma":[0.0000488941,0.00024521374,0.00019016482,0.00006333935,0.000026995502,0.0005476488,0.00005024389,0.77047515,0.05164478,0.17355014,0.0030883993,0.00006902622],"about_ca_topic_score_codex":0.0004276545,"about_ca_topic_score_gemma":0.000257179,"teacher_disagreement_score":0.0020280704,"about_ca_system_score_codex":0.0006562387,"about_ca_system_score_gemma":0.0008444271,"threshold_uncertainty_score":0.006784618},"labels":[],"label_agreement":null},{"id":"W2084948657","doi":"10.1117/12.907446","title":"Improving side information generation using dynamic motion estimation for distributed video coding","year":2012,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","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":"McMaster University","funders":"","keywords":"Computer science; Motion compensation; Motion estimation; Coding (social sciences); Reference frame; Quarter-pixel motion; Computer vision; Coding tree unit; Inter frame; Artificial intelligence; Multiview Video Coding; Block-matching algorithm; Decoding methods; Video processing; Frame (networking); Algorithm; Video tracking; Telecommunications; Mathematics","score_opus":0.014717202624816477,"score_gpt":0.2428845929762438,"score_spread":0.2281673903514273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084948657","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.010899214,0.00027828786,0.9879943,0.000046072622,0.00003138032,0.000019812642,0.000014388307,0.0002035683,0.0005129245],"genre_scores_gemma":[0.25097343,0.00060160883,0.7448888,0.000074463576,0.00007288667,0.000071098446,0.00018199292,0.00007813851,0.0030575756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995621,0.000066992565,0.00002369074,0.00006589258,0.00025760863,0.000023630675],"domain_scores_gemma":[0.9992933,0.00021152635,0.000081920385,0.00012397634,0.0002684401,0.000020840676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004093889,0.00078442565,0.0005076796,0.0006584442,0.0002293175,0.0003623924,0.00078119553,0.00049383816,0.0011260407],"category_scores_gemma":[0.0011625948,0.0002579154,0.00041040443,0.0005443684,0.00028317756,0.0009629357,0.0005581681,0.00078093586,0.00038589432],"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.0002480576,0.000112257374,0.00093487924,0.00010724603,0.000054527976,0.00017093663,0.00008819967,0.07974924,0.39903563,0.008804748,0.0013103312,0.509384],"study_design_scores_gemma":[0.000036275695,0.0002054043,0.00074757537,0.00001701231,0.00003159207,0.00036430577,0.0000130010185,0.85177326,0.14173733,0.0016859858,0.0033550207,0.00003326658],"about_ca_topic_score_codex":0.0009582621,"about_ca_topic_score_gemma":0.0019576522,"teacher_disagreement_score":0.0011260407,"about_ca_system_score_codex":0.00037235772,"about_ca_system_score_gemma":0.00047211355,"threshold_uncertainty_score":0.0037670135},"labels":[],"label_agreement":null},{"id":"W2087276028","doi":"10.1109/ita.2009.5044975","title":"On the rate distortion theory for causal video coding","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada); University of Waterloo","funders":"","keywords":"Frame (networking); Computer science; Algorithm; Artificial intelligence","score_opus":0.01809707620478208,"score_gpt":0.25367891547146637,"score_spread":0.2355818392666843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087276028","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.0046184147,0.0053510466,0.96594864,0.0017035067,0.0003204004,0.000054683675,0.00034456197,0.0001279758,0.021530874],"genre_scores_gemma":[0.5662227,0.03330517,0.35119084,0.0024020392,0.0040332223,0.00071055186,0.0019293383,0.00046434833,0.039741747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963014,0.001476898,0.00015773738,0.0004576626,0.0012760648,0.0003301813],"domain_scores_gemma":[0.99200773,0.005686302,0.00045777316,0.0006863875,0.0010351941,0.00012656115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050737793,0.0021607205,0.0013293764,0.0024631452,0.000818162,0.003104867,0.002223903,0.0022560388,0.0053891228],"category_scores_gemma":[0.014140323,0.0006520287,0.001323966,0.0028127467,0.0032691688,0.0051531363,0.0026677295,0.0047100466,0.0016058573],"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.000061777704,0.000016039672,0.00015250736,0.000112365145,0.00002380496,0.00011537359,0.00007052517,0.049810134,0.00071436854,0.92927736,0.0026146856,0.017031116],"study_design_scores_gemma":[0.000025649855,0.00006661771,0.00017082486,0.00008523988,0.000025342371,0.00021092064,0.000036331367,0.29191798,0.0010242691,0.699648,0.006745635,0.000043092503],"about_ca_topic_score_codex":0.0041977647,"about_ca_topic_score_gemma":0.0015173886,"teacher_disagreement_score":0.0053891228,"about_ca_system_score_codex":0.003538732,"about_ca_system_score_gemma":0.0022929246,"threshold_uncertainty_score":0.026833057},"labels":[],"label_agreement":null},{"id":"W2087514446","doi":"10.5923/j.ajsp.20110101.04","title":"Exploring the Distributed Video Coding in a Quality Assessment Context","year":2012,"lang":"en","type":"article","venue":"American Journal of Signal Processing","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":"University of British Columbia","funders":"","keywords":"Computer science; Motion compensation; Distributed source coding; Encoder; Coding (social sciences); Data compression; Video quality; Artificial intelligence; Decoding methods; Motion estimation; Computer vision; Reference frame; Algorithm; Variable-length code; Mathematics; Frame (networking); Statistics","score_opus":0.09945236816761303,"score_gpt":0.33297650010285124,"score_spread":0.2335241319352382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087514446","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.013155391,0.0058608837,0.9729432,0.0008116422,0.00008665195,0.00002369999,0.000019168581,0.00005134301,0.007048117],"genre_scores_gemma":[0.73240566,0.010451904,0.250408,0.00017776954,0.0004619219,0.000057739195,0.00008671194,0.000051699117,0.0058985935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992508,0.00025375717,0.00002979792,0.00012696543,0.00029689353,0.000041765346],"domain_scores_gemma":[0.9990588,0.00042521846,0.00007614969,0.00009420465,0.00030511626,0.00004058316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001055566,0.00046909967,0.0004081859,0.00074120105,0.00021773846,0.0012527836,0.0008705354,0.00073209126,0.0011746079],"category_scores_gemma":[0.0025153654,0.0001754283,0.0003561679,0.0009816085,0.0013260393,0.0018076313,0.0008744056,0.0010442571,0.00021511222],"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.00010141676,0.00009459511,0.001739721,0.00036483927,0.00006490059,0.00039712156,0.00047608186,0.13939779,0.025012357,0.4966388,0.0020965647,0.33361578],"study_design_scores_gemma":[0.00001880324,0.0001382646,0.0010063133,0.00008471037,0.000036516893,0.0003559746,0.00015942624,0.7823321,0.006787574,0.1976737,0.011376857,0.00002980394],"about_ca_topic_score_codex":0.0018266088,"about_ca_topic_score_gemma":0.0009131852,"teacher_disagreement_score":0.0018266088,"about_ca_system_score_codex":0.0008089816,"about_ca_system_score_gemma":0.00047713335,"threshold_uncertainty_score":0.005869627},"labels":[],"label_agreement":null},{"id":"W2088124680","doi":"10.1109/tit.2014.2332336","title":"Private Broadcasting Over Independent Parallel Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"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 Toronto","funders":"","keywords":"Fading; Broadcasting (networking); Gaussian; Coding (social sciences); Computer science; Channel code; Block (permutation group theory); Encoding (memory); Theoretical computer science; Topology (electrical circuits); Mathematics; Algorithm; Computer network; Decoding methods; Combinatorics; Statistics","score_opus":0.00914837261323207,"score_gpt":0.2203186316881497,"score_spread":0.21117025907491763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088124680","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.40568247,0.000657439,0.5715491,0.0010491153,0.00007379751,0.00012445975,0.0002402955,0.00018559348,0.020437723],"genre_scores_gemma":[0.9768262,0.00040829554,0.017665092,0.00006876776,0.00007482145,0.000071108654,0.00006232636,0.000026043364,0.0047973176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983203,0.000588308,0.00003956003,0.0001945366,0.00046937203,0.0003880238],"domain_scores_gemma":[0.99259573,0.0054666186,0.00081675046,0.0005008949,0.00042432547,0.00019566822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015496749,0.0007801772,0.001035586,0.00052344706,0.00095752376,0.001097481,0.0014533001,0.0011822061,0.002089655],"category_scores_gemma":[0.0066957967,0.00045348995,0.0005254922,0.001250254,0.0019264293,0.0025288428,0.001615875,0.0014231259,0.00024743285],"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.00043187692,0.0001142917,0.00068095827,0.000114763316,0.000055732777,0.0006179078,0.00031354412,0.8039617,0.0096271485,0.17304106,0.0009859953,0.010054989],"study_design_scores_gemma":[0.0000365951,0.000041611638,0.00013523495,0.0000032690846,0.00001169044,0.00007704037,0.00004378135,0.96597034,0.0011889321,0.032129668,0.00035141731,0.000010423726],"about_ca_topic_score_codex":0.002791771,"about_ca_topic_score_gemma":0.0018467017,"teacher_disagreement_score":0.002791771,"about_ca_system_score_codex":0.001726228,"about_ca_system_score_gemma":0.0009345462,"threshold_uncertainty_score":0.012524724},"labels":[],"label_agreement":null},{"id":"W2088335436","doi":"10.1109/tifs.2015.2407153","title":"Key Generation Over Wiretap Models With Non-Causal Side Information","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Key (lock); Computer science; Channel (broadcasting); Upper and lower bounds; Gaussian; Function (biology); Theoretical computer science; Topology (electrical circuits); Artificial intelligence; Combinatorics; Discrete mathematics; Algorithm; Mathematics; Telecommunications; Physics; Computer security; Mathematical analysis","score_opus":0.01903624676730526,"score_gpt":0.21596368516515427,"score_spread":0.19692743839784901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088335436","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.08489685,0.0005710649,0.9061561,0.00081389624,0.000058624566,0.00007542663,0.00031575313,0.0003686394,0.0067435713],"genre_scores_gemma":[0.96724766,0.0008117299,0.025257692,0.00012370599,0.00008585239,0.00016506053,0.00022749587,0.00010057159,0.005980294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605906,0.0015304731,0.00014275232,0.00064733124,0.0007650946,0.00085543894],"domain_scores_gemma":[0.9638426,0.029523252,0.0027344793,0.0019503167,0.0015526148,0.00039676402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004215486,0.001714982,0.0021061301,0.0010484393,0.0010021758,0.0029453698,0.0023052753,0.0025677409,0.004028183],"category_scores_gemma":[0.018617366,0.0011165083,0.0009191393,0.001959383,0.0035311147,0.009563228,0.003517808,0.0030096066,0.0007594509],"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.00042443202,0.00007585729,0.00035450552,0.00026422113,0.000070625094,0.0005231633,0.00022429434,0.72958636,0.004006278,0.25430992,0.0011784997,0.008981924],"study_design_scores_gemma":[0.000027892762,0.000044184028,0.000049630227,0.00001674633,0.00001856969,0.00006961167,0.000055173656,0.93206716,0.0016305057,0.065632954,0.00036114216,0.000026451436],"about_ca_topic_score_codex":0.002302164,"about_ca_topic_score_gemma":0.0016201732,"teacher_disagreement_score":0.004215486,"about_ca_system_score_codex":0.0026967751,"about_ca_system_score_gemma":0.0020166815,"threshold_uncertainty_score":0.022293866},"labels":[],"label_agreement":null},{"id":"W2089373874","doi":"10.1109/vtcspring.2013.6692745","title":"Secure Transmission in OFDM Systems by Using Time Domain Scrambling","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Subcarrier; Scrambling; Computer science; Time domain; Additive white Gaussian noise; Transmission (telecommunications); Frequency domain; Secure transmission; Channel (broadcasting); Electronic engineering; Algorithm; Computer network; Telecommunications; Engineering","score_opus":0.009700963338873528,"score_gpt":0.2225906079046385,"score_spread":0.21288964456576498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089373874","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.17558625,0.0015492454,0.8166774,0.00028755347,0.000097259384,0.000068669535,0.000043217737,0.00030860162,0.0053818235],"genre_scores_gemma":[0.847976,0.0014518126,0.14898683,0.000092170325,0.00010451251,0.000039463284,0.000041669333,0.00002031539,0.0012872759],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996791,0.0000984246,0.000026464613,0.00003494915,0.00012540887,0.000035729252],"domain_scores_gemma":[0.999335,0.00027243712,0.00016220247,0.00013036802,0.000085575586,0.000014360335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004119437,0.00040786035,0.0003707252,0.00038308138,0.0002753857,0.00040731387,0.00026213107,0.00036902458,0.0005115655],"category_scores_gemma":[0.0013614324,0.00017161605,0.00028059594,0.00040239468,0.00052130374,0.0007692541,0.0005146195,0.00038949098,0.00023368333],"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.0006452406,0.00011294056,0.0016113841,0.00060901017,0.0001462216,0.001534212,0.0004377394,0.1011718,0.62159663,0.074793495,0.0013930075,0.19594842],"study_design_scores_gemma":[0.00006924162,0.0007313491,0.0013018252,0.00008458141,0.00013216565,0.0023360124,0.00011130418,0.59181696,0.37946296,0.014341891,0.009536026,0.00007568038],"about_ca_topic_score_codex":0.0001992631,"about_ca_topic_score_gemma":0.0002194002,"teacher_disagreement_score":0.0005115655,"about_ca_system_score_codex":0.00015519783,"about_ca_system_score_gemma":0.00026751342,"threshold_uncertainty_score":0.0021786094},"labels":[],"label_agreement":null},{"id":"W2090480652","doi":"10.1109/isit.2007.4557544","title":"Precoding for the AWGN Channel with Discrete Interference","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Precoding; Transmitter; Additive white Gaussian noise; Channel (broadcasting); Interference (communication); Zero-forcing precoding; Channel state information; Transmission (telecommunications); Topology (electrical circuits); Computer science; Mathematics; Algorithm; Telecommunications; Combinatorics; Wireless; MIMO","score_opus":0.023045712960685645,"score_gpt":0.26326819041796035,"score_spread":0.2402224774572747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090480652","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.028795468,0.0013986678,0.95156145,0.0008889405,0.00017359646,0.000059319784,0.00032571895,0.00019324647,0.0166037],"genre_scores_gemma":[0.76656884,0.0032458578,0.21176085,0.00041381226,0.00031758603,0.00020871269,0.0005171108,0.000042287862,0.016924972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950695,0.00016113209,0.00001917273,0.000062827676,0.00018481938,0.00006504385],"domain_scores_gemma":[0.9992887,0.00038220597,0.00006565918,0.00009658133,0.00014772204,0.000019145651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005074382,0.00042224614,0.00036412306,0.00033972904,0.00028656406,0.0007746591,0.0004594563,0.0007476421,0.0020382262],"category_scores_gemma":[0.0026868402,0.00020939358,0.00027276715,0.0007460848,0.00065228227,0.000691556,0.0006772681,0.0009950375,0.000569005],"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.00015340526,0.000037137033,0.00037306984,0.00028327733,0.00004449552,0.00044039686,0.00026797506,0.50657797,0.009754757,0.38633245,0.0063216886,0.08941337],"study_design_scores_gemma":[0.000024388088,0.000041293973,0.00017917385,0.000040330287,0.000011384568,0.00014709219,0.000031095922,0.9150338,0.0016474117,0.07873642,0.004089455,0.000018188552],"about_ca_topic_score_codex":0.003862369,"about_ca_topic_score_gemma":0.004373528,"teacher_disagreement_score":0.003862369,"about_ca_system_score_codex":0.0009211948,"about_ca_system_score_gemma":0.0012668093,"threshold_uncertainty_score":0.00767982},"labels":[],"label_agreement":null},{"id":"W2091925007","doi":"10.1109/isita.2008.4895518","title":"Gaussian Z-interference channel with a relay link: Achievable rate region and asymptotic sum capacity","year":2008,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":14,"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 Toronto","funders":"","keywords":"Interference (communication); Co-channel interference; Channel (broadcasting); Relay; Zero-forcing precoding; Signal-to-noise ratio (imaging); Topology (electrical circuits); Adjacent-channel interference; Channel capacity; Single antenna interference cancellation; Computer science; Noise (video); Gaussian noise; Telecommunications; Electronic engineering; Mathematics; Physics; Algorithm; Engineering; MIMO; Precoding; Power (physics); Combinatorics","score_opus":0.02917082521230757,"score_gpt":0.2066653116894791,"score_spread":0.17749448647717153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091925007","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.13110758,0.003008477,0.82826364,0.000717425,0.000050617495,0.000099514444,0.00026829084,0.00045754254,0.036026806],"genre_scores_gemma":[0.9668707,0.0017303338,0.028940141,0.00016401644,0.000069337875,0.00013009994,0.00009249526,0.00003872758,0.0019641556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870193,0.0005460743,0.000039212053,0.0001228806,0.00031213046,0.00027781667],"domain_scores_gemma":[0.993771,0.0045706155,0.0006057816,0.0002315448,0.0006681078,0.0001527924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00228137,0.00118988,0.0010784633,0.0009624362,0.00080592546,0.0023214046,0.0010171487,0.00095114316,0.0017400658],"category_scores_gemma":[0.0075130626,0.00038710303,0.0004898195,0.0013056011,0.0031381173,0.0019744516,0.0018716039,0.0008833047,0.00057714176],"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.0004340248,0.00007637918,0.00069467485,0.00034521846,0.00009367692,0.00087188766,0.0002898691,0.49729154,0.010840965,0.47305807,0.0021680794,0.013835646],"study_design_scores_gemma":[0.000042685027,0.00011346886,0.0003040554,0.00005605103,0.000042160464,0.0005861107,0.000116956144,0.8920488,0.0039782403,0.10114602,0.0015163105,0.000049270744],"about_ca_topic_score_codex":0.0016311015,"about_ca_topic_score_gemma":0.00079214835,"teacher_disagreement_score":0.0023214046,"about_ca_system_score_codex":0.0015801393,"about_ca_system_score_gemma":0.0011715692,"threshold_uncertainty_score":0.012065172},"labels":[],"label_agreement":null},{"id":"W2093554016","doi":"10.1109/tcomm.2012.12.110670","title":"Transmit Antenna Selection for Security Enhancement in MIMO Wiretap Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":424,"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 British Columbia","funders":"","keywords":"Fading; Transmitter; Channel (broadcasting); Channel state information; MIMO; Topology (electrical circuits); Computer science; Secrecy; Antenna (radio); Selection (genetic algorithm); Nakagami distribution; Signal-to-noise ratio (imaging); Algorithm; Computer network; Telecommunications; Mathematics; Wireless; Artificial intelligence; Combinatorics; Computer security","score_opus":0.03391912688999205,"score_gpt":0.2874597000552449,"score_spread":0.25354057316525286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093554016","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.033121683,0.00045200658,0.9616034,0.00018327046,0.000046262914,0.00004243648,0.000044018598,0.00021041677,0.0042964956],"genre_scores_gemma":[0.9250315,0.0011140591,0.070384316,0.0001152834,0.000095093885,0.00009235583,0.000053838172,0.00004238253,0.0030712835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991043,0.00036195043,0.000025117366,0.000084732565,0.0002569429,0.0001669181],"domain_scores_gemma":[0.9971974,0.0017218762,0.00035501356,0.00027183205,0.00038287626,0.000071074384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013206003,0.0010126628,0.0006199131,0.0004304005,0.0004036183,0.0010566864,0.00067291275,0.0006446387,0.001717733],"category_scores_gemma":[0.0028025964,0.00034917088,0.00063104194,0.0007573835,0.001438706,0.0012085296,0.0009145936,0.0008468304,0.00053544616],"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.00040954718,0.00007236676,0.0016431267,0.0001595418,0.0000955285,0.0004219009,0.0001741879,0.81464314,0.028879069,0.11196786,0.0015288561,0.04000482],"study_design_scores_gemma":[0.000010201765,0.00011552891,0.00017368927,0.000011646128,0.00002880861,0.00012993588,0.000021419546,0.987655,0.0044255853,0.00678338,0.0006304461,0.000014423556],"about_ca_topic_score_codex":0.0006818004,"about_ca_topic_score_gemma":0.0008048886,"teacher_disagreement_score":0.001717733,"about_ca_system_score_codex":0.00081748475,"about_ca_system_score_gemma":0.0007451714,"threshold_uncertainty_score":0.0069841146},"labels":[],"label_agreement":null},{"id":"W2095214648","doi":"10.1109/tit.2013.2256952","title":"MIMO Multiple Access Channel With an Arbitrarily Varying Eavesdropper: Secrecy Degrees of Freedom","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":67,"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 Toronto","funders":"","keywords":"Eavesdropping; Secrecy; Transmitter; MIMO; Computer science; Channel (broadcasting); Transmission (telecommunications); Converse; Computer network; Secure transmission; Degrees of freedom (physics and chemistry); Topology (electrical circuits); Mathematics; Telecommunications; Computer security; Combinatorics; Physics","score_opus":0.015694880566927083,"score_gpt":0.22808261236903907,"score_spread":0.21238773180211198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095214648","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.0714709,0.001019933,0.9089924,0.0006167866,0.000093552066,0.000043299577,0.00025705175,0.00013936439,0.017366758],"genre_scores_gemma":[0.9735121,0.001419614,0.020768315,0.00010055071,0.0001071049,0.00006064461,0.00007283789,0.000015272719,0.0039435336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865687,0.00045356614,0.000041752264,0.00018058863,0.00039134428,0.00027580527],"domain_scores_gemma":[0.99573,0.00287234,0.000511962,0.0003683728,0.00040232713,0.000115069524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013299172,0.0012016194,0.0010912083,0.00047519043,0.00084182055,0.0019000527,0.00073606055,0.00103937,0.0013625104],"category_scores_gemma":[0.003620235,0.000558776,0.0006347737,0.0011150255,0.0024593347,0.0017684798,0.001653765,0.0013817088,0.00040171802],"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.00036452786,0.000056027606,0.0012219216,0.00025498372,0.000091347196,0.0018898584,0.00027715278,0.593563,0.022273012,0.3674953,0.0015818784,0.010931004],"study_design_scores_gemma":[0.000031875883,0.00013614203,0.00047661882,0.000031985754,0.00006124248,0.0006495295,0.00010135865,0.93244374,0.00723387,0.057233494,0.0015403136,0.00005980571],"about_ca_topic_score_codex":0.0018730718,"about_ca_topic_score_gemma":0.0013817857,"teacher_disagreement_score":0.0019000527,"about_ca_system_score_codex":0.0011255115,"about_ca_system_score_gemma":0.0009975776,"threshold_uncertainty_score":0.008166194},"labels":[],"label_agreement":null},{"id":"W2096141515","doi":"10.1186/1687-6180-2012-78","title":"Distributed transform coding via source-splitting","year":2012,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","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":"University of Manitoba","funders":"","keywords":"Distributed source coding; Algorithm; Rate distortion; Computer science; Entropy (arrow of time); Gaussian; Source code; Mathematics; Quantization (signal processing); Theoretical computer science; Coding (social sciences); Decoding methods; Variable-length code; Statistics","score_opus":0.014785664047219454,"score_gpt":0.27992446582408137,"score_spread":0.2651388017768619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096141515","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.0060345717,0.00011460699,0.9919574,0.000064151325,0.00001983097,0.00002560107,0.000038877697,0.00015796063,0.0015869038],"genre_scores_gemma":[0.44196677,0.00045611945,0.55240834,0.00015497369,0.000083202285,0.00018207154,0.0003172552,0.000084299296,0.004347023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993881,0.0001220875,0.000026684791,0.00010055006,0.00032006012,0.00004241371],"domain_scores_gemma":[0.9992029,0.00032119043,0.00007190367,0.00018113285,0.00019993576,0.000022897762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005645356,0.0005153332,0.00042677746,0.000431454,0.0002571285,0.0005727794,0.0007130077,0.00061527244,0.00170132],"category_scores_gemma":[0.0020906057,0.00016422037,0.0003683671,0.0008655257,0.00075907423,0.0009952916,0.0010330619,0.0009357116,0.000545626],"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.00030955268,0.000073275965,0.00042870414,0.00017003428,0.0000456499,0.00019415062,0.00018443867,0.20413259,0.107847154,0.28121242,0.0032499991,0.40215197],"study_design_scores_gemma":[0.00004128863,0.00011960428,0.00014203292,0.000023976881,0.000015561605,0.00024495024,0.000021163822,0.9006493,0.039926533,0.052878615,0.0059139514,0.000022895205],"about_ca_topic_score_codex":0.0007867399,"about_ca_topic_score_gemma":0.0010020884,"teacher_disagreement_score":0.00170132,"about_ca_system_score_codex":0.00053279067,"about_ca_system_score_gemma":0.00081928814,"threshold_uncertainty_score":0.0056915283},"labels":[],"label_agreement":null},{"id":"W2096297385","doi":"10.1109/isit.2010.5513405","title":"On the achievable rates in decentralized networks with Randomized Masking","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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":"Transmitter; Computer science; Channel (broadcasting); Entropy power inequality; Interference (communication); Transmission (telecommunications); Upper and lower bounds; Information theory; Masking (illustration); Topology (electrical circuits); Algorithm; Computer network; Theoretical computer science; Mathematics; Telecommunications; Combinatorics; Entropy rate; Statistics; Principle of maximum entropy; Artificial intelligence","score_opus":0.005880159251118996,"score_gpt":0.21840263747577982,"score_spread":0.21252247822466083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096297385","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.09268386,0.0020295233,0.87665176,0.0015418639,0.0001075047,0.00023105042,0.0004916456,0.00067971245,0.025583008],"genre_scores_gemma":[0.9095081,0.0017731764,0.08345091,0.00036325108,0.00018489663,0.0006895069,0.0003290087,0.00018803235,0.0035130628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939061,0.0029931795,0.000207245,0.00067043205,0.0011022397,0.0011208768],"domain_scores_gemma":[0.9553591,0.037735548,0.0025517137,0.0018478957,0.0018089451,0.0006966579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007334733,0.0024339661,0.0022876095,0.0020348702,0.001582553,0.0031758302,0.0024176282,0.0018252651,0.0033577175],"category_scores_gemma":[0.036066946,0.0010738284,0.0010851445,0.001726432,0.0037924536,0.0043274625,0.004082564,0.002516342,0.00091350544],"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.0005332586,0.00009352204,0.00060624455,0.00035030203,0.00008267423,0.00026100312,0.00031929056,0.7375858,0.0051860507,0.23611836,0.002207536,0.01665594],"study_design_scores_gemma":[0.0000516107,0.00007094597,0.00014407028,0.00006417924,0.00002148393,0.0000898018,0.00005093577,0.90245676,0.0016185642,0.09477831,0.000623425,0.000029952107],"about_ca_topic_score_codex":0.0019514647,"about_ca_topic_score_gemma":0.0016017382,"teacher_disagreement_score":0.007334733,"about_ca_system_score_codex":0.0038001304,"about_ca_system_score_gemma":0.0027107538,"threshold_uncertainty_score":0.038790286},"labels":[],"label_agreement":null},{"id":"W2096448522","doi":"10.1109/cwit.2009.5069532","title":"On the feedback capacity of a discrete non-binary noise channel with memory","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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":"Noise (video); Channel (broadcasting); Binary number; Computer science; Fading; Channel capacity; Algorithm; Control theory (sociology); Mathematics; Telecommunications; Arithmetic; Artificial intelligence","score_opus":0.013362552020516697,"score_gpt":0.21334723861980837,"score_spread":0.19998468659929167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096448522","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5074811,0.008021289,0.4403588,0.0034275784,0.00036439247,0.0000907459,0.00078521116,0.00041517254,0.0390558],"genre_scores_gemma":[0.98992145,0.0021345248,0.005312761,0.00013428576,0.00021842842,0.000084469524,0.0000981184,0.00004875731,0.0020471571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985291,0.00061300624,0.000043204418,0.0001275772,0.00029958168,0.00038745906],"domain_scores_gemma":[0.97709787,0.019913921,0.0010226209,0.0006052987,0.0010302395,0.00033006008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022026037,0.0011524315,0.0013339587,0.0014913786,0.00071149605,0.0018739242,0.0015943554,0.00118126,0.0039058342],"category_scores_gemma":[0.014919996,0.00041915633,0.0005180123,0.0015913796,0.0033262067,0.003420371,0.001922114,0.001531337,0.00039978704],"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.00038482717,0.00010969252,0.00070087175,0.00046584677,0.00007204226,0.0006396966,0.00041735737,0.45425734,0.009138529,0.52013075,0.002331703,0.011351358],"study_design_scores_gemma":[0.00002744051,0.000058949223,0.00029342558,0.00010370251,0.000032364595,0.00016451058,0.00006546176,0.85886204,0.0020496247,0.13762479,0.00067014043,0.00004754607],"about_ca_topic_score_codex":0.0023105135,"about_ca_topic_score_gemma":0.00090611883,"teacher_disagreement_score":0.0039058342,"about_ca_system_score_codex":0.0021686957,"about_ca_system_score_gemma":0.0010105626,"threshold_uncertainty_score":0.01573509},"labels":[],"label_agreement":null},{"id":"W2096924655","doi":"10.1109/icassp.2014.6854695","title":"Efficient jamming strategies on a MIMO Gaussian channel with known target signal covariance","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Alberta","funders":"","keywords":"Jamming; MIMO; Covariance; Closed-form expression; Channel (broadcasting); Gaussian; Computer science; Mathematical optimization; Mathematics; Control theory (sociology); Telecommunications; Statistics; Physics; Artificial intelligence","score_opus":0.009337763533795337,"score_gpt":0.2171156558205921,"score_spread":0.20777789228679677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096924655","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.04595239,0.00034961864,0.948455,0.00018882271,0.00003089194,0.000036270834,0.000057126825,0.000111015535,0.0048188725],"genre_scores_gemma":[0.94688934,0.00068259233,0.048423655,0.00010167244,0.000053956956,0.00007450904,0.00006450169,0.0000285001,0.003681428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992662,0.00030673834,0.000020168362,0.000106423664,0.0001661223,0.0001343775],"domain_scores_gemma":[0.9987546,0.00081713777,0.00018444404,0.00006194491,0.00014025116,0.00004155946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007930396,0.0013392766,0.0010234383,0.00046633565,0.00045857817,0.0007926346,0.0006728923,0.0010786374,0.0009146293],"category_scores_gemma":[0.002181919,0.0004407678,0.0006038955,0.0009073742,0.0011362468,0.0010082244,0.0011136422,0.000827359,0.00025215786],"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.00006832468,0.000023300126,0.00015480927,0.0000825695,0.000031779746,0.00013198041,0.000060156868,0.9739464,0.0043675415,0.013289834,0.00033904897,0.007504164],"study_design_scores_gemma":[0.00000993382,0.000050723906,0.00008716443,0.0000056811677,0.000011441337,0.00003686869,0.000021911577,0.9952992,0.00080147345,0.0035229723,0.0001428351,0.0000097614075],"about_ca_topic_score_codex":0.0022752848,"about_ca_topic_score_gemma":0.0020287412,"teacher_disagreement_score":0.0022752848,"about_ca_system_score_codex":0.00057899416,"about_ca_system_score_gemma":0.0009252932,"threshold_uncertainty_score":0.0045241117},"labels":[],"label_agreement":null},{"id":"W2097440336","doi":"10.1109/tit.2006.871608","title":"On the joint source-channel coding error exponent for discrete memoryless systems","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":75,"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":"Exponent; Additive white Gaussian noise; Mathematics; Channel (broadcasting); Source code; Decoding methods; Discrete mathematics; Topology (electrical circuits); Algorithm; White noise; Combinatorics; Computer science; Statistics; Telecommunications","score_opus":0.01852788324696426,"score_gpt":0.22141527418384127,"score_spread":0.20288739093687702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097440336","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.11887575,0.0019396377,0.86642677,0.0004952418,0.00008050116,0.000043689364,0.00009026311,0.00023018275,0.011817951],"genre_scores_gemma":[0.9484585,0.0012168642,0.04750274,0.000094996096,0.00006756885,0.00008786993,0.000082461025,0.000085067266,0.0024038735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990238,0.000260379,0.00006261945,0.00010541753,0.0004294586,0.00011832107],"domain_scores_gemma":[0.98702383,0.0103468895,0.0007777771,0.00075754046,0.0009146065,0.00017935113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029830544,0.0011510525,0.0006969141,0.0010665577,0.0003334186,0.0013335509,0.000864878,0.0007524162,0.0020559516],"category_scores_gemma":[0.020926204,0.0003431539,0.00046563678,0.00083252555,0.0018651986,0.0030756944,0.0016529354,0.001606274,0.0004062248],"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.00016764856,0.000032618456,0.0011663937,0.00015911458,0.00003795499,0.00023829615,0.00034514657,0.63377196,0.007822822,0.3381229,0.00069573335,0.017439459],"study_design_scores_gemma":[0.000004414281,0.000025598347,0.0002094009,0.000024984745,0.0000064688757,0.00006242818,0.000027280996,0.964116,0.0026665917,0.032565523,0.00027757758,0.000013802044],"about_ca_topic_score_codex":0.0012003251,"about_ca_topic_score_gemma":0.0010673449,"teacher_disagreement_score":0.0029830544,"about_ca_system_score_codex":0.0019466913,"about_ca_system_score_gemma":0.0007802827,"threshold_uncertainty_score":0.015776038},"labels":[],"label_agreement":null},{"id":"W2097679877","doi":"10.1109/isit.2006.262008","title":"Lossless Source Coding using Tree Structured Random Binning","year":2006,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Entropy encoding; Lossless compression; Variable-length code; Decoding methods; Tunstall coding; Computer science; Algorithm; Data compression; Context-adaptive binary arithmetic coding; Entropy (arrow of time); Random variable; Random binary tree; Theoretical computer science; Tree (set theory); Arithmetic coding; Source code; Binary tree; Mathematics; Statistics","score_opus":0.013364283882250742,"score_gpt":0.23208948337145857,"score_spread":0.21872519948920782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097679877","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.015822927,0.00020286276,0.98229295,0.00008611067,0.00002204163,0.000033000604,0.000036272777,0.00024036758,0.001263501],"genre_scores_gemma":[0.53498924,0.00053348695,0.4614446,0.00020818596,0.00004767731,0.00015827412,0.00017789044,0.00009563571,0.0023449464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940586,0.00014590789,0.000028857174,0.0000757228,0.0002940012,0.00004961838],"domain_scores_gemma":[0.9986358,0.00052590336,0.00020653826,0.0003124198,0.00025739154,0.00006185544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078758,0.0004410864,0.00055318105,0.0005656384,0.00023871734,0.0005852504,0.00092760543,0.0006263488,0.0009953475],"category_scores_gemma":[0.0028672623,0.00020980366,0.00029714513,0.00089878764,0.0007771697,0.0011776973,0.0010540657,0.0008796892,0.00040867022],"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.00042997545,0.000113628,0.000720736,0.00021543771,0.00007413183,0.00028247596,0.00018868224,0.41483587,0.101904005,0.32064554,0.0014642333,0.1591253],"study_design_scores_gemma":[0.000029356517,0.000078126606,0.00015810541,0.00002258187,0.000013426365,0.00015705479,0.000007905058,0.9450248,0.025174143,0.027428687,0.0018784186,0.000027411837],"about_ca_topic_score_codex":0.00042398094,"about_ca_topic_score_gemma":0.00047342948,"teacher_disagreement_score":0.0009953475,"about_ca_system_score_codex":0.0005092448,"about_ca_system_score_gemma":0.00050888216,"threshold_uncertainty_score":0.004165232},"labels":[],"label_agreement":null},{"id":"W2097790167","doi":"10.1109/isit.2001.935987","title":"On the Poor-Verdu conjecture for the reliability function of channels with memory","year":2002,"lang":"en","type":"article","venue":"","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":"Upper and lower bounds; Counterexample; Conjecture; Erasure; Computer science; Decoding methods; Reliability (semiconductor); Function (biology); Binary number; Coding (social sciences); Mathematics; Algorithm; Discrete mathematics; Statistics; Arithmetic","score_opus":0.01798386297064743,"score_gpt":0.20382285701424338,"score_spread":0.18583899404359594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097790167","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.14892517,0.012372654,0.75383157,0.021569896,0.0005945832,0.00020988083,0.001587358,0.0006612642,0.060247727],"genre_scores_gemma":[0.920841,0.007407393,0.05932965,0.0035418083,0.0013127757,0.00067769253,0.00074611657,0.00035466772,0.005788872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99012077,0.00412672,0.0003992984,0.0013780505,0.0021613985,0.0018137953],"domain_scores_gemma":[0.79463506,0.17996806,0.004332405,0.011223357,0.0076660467,0.0021750997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01840076,0.0020882217,0.0040089926,0.0039083785,0.0048525566,0.005351176,0.0039742626,0.0042780642,0.005980707],"category_scores_gemma":[0.11619472,0.0013876872,0.0021995082,0.0035336607,0.011321918,0.015512596,0.006123852,0.011657729,0.0012386882],"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.00076591596,0.000077701756,0.0013611856,0.00032792139,0.00009639497,0.00025982325,0.00058909244,0.07759011,0.0020238103,0.89254487,0.010146317,0.014216916],"study_design_scores_gemma":[0.00010359598,0.00012799364,0.0005855655,0.00016671706,0.000051865885,0.00028217703,0.00010796438,0.13167123,0.0018893996,0.86211365,0.0028051832,0.00009464555],"about_ca_topic_score_codex":0.0030638871,"about_ca_topic_score_gemma":0.0018223833,"teacher_disagreement_score":0.01840076,"about_ca_system_score_codex":0.00459858,"about_ca_system_score_gemma":0.0027474535,"threshold_uncertainty_score":0.0973137},"labels":[],"label_agreement":null},{"id":"W2098132403","doi":"10.1109/isit.2010.5513651","title":"Partial zero-forcing precoding for the interference channel with partially cooperating transmitters","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":10,"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 Toronto","funders":"","keywords":"Zero-forcing precoding; Precoding; Transmitter; Interference (communication); Channel (broadcasting); Signal-to-noise ratio (imaging); Adjacent-channel interference; Noise (video); Computer science; Gaussian noise; Channel capacity; Topology (electrical circuits); Mathematics; Telecommunications; Control theory (sociology); Algorithm; MIMO; Combinatorics","score_opus":0.019111044906934493,"score_gpt":0.23839786492276607,"score_spread":0.21928682001583158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098132403","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.08166721,0.00027968956,0.91183746,0.0003552771,0.00003815915,0.000026743131,0.000087676985,0.0000933785,0.0056142923],"genre_scores_gemma":[0.95605475,0.0003791611,0.04076778,0.000092790884,0.00004780334,0.00005450885,0.000055413413,0.000014333907,0.002533482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995962,0.00015107173,0.000011768199,0.000052726722,0.000114724746,0.00007352474],"domain_scores_gemma":[0.99905294,0.00050045474,0.00016113525,0.00013359282,0.00011461987,0.00003734145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059192046,0.0007933578,0.00076876674,0.00024657257,0.0005170984,0.00063457893,0.00087637414,0.0006867763,0.00088724936],"category_scores_gemma":[0.0018276949,0.0002498859,0.00059183245,0.00040883682,0.0011817742,0.00066098553,0.00080909184,0.0007407399,0.0002260989],"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.00012786248,0.000036634472,0.0005623839,0.00014374952,0.000051140334,0.00055397896,0.00018788314,0.81989956,0.011754955,0.15034021,0.0009833905,0.015358272],"study_design_scores_gemma":[0.000009528539,0.000049558803,0.000100934834,0.00000834373,0.000012454217,0.00009879745,0.000013797518,0.98181033,0.0008048366,0.016733877,0.00034541643,0.000012146923],"about_ca_topic_score_codex":0.0025093404,"about_ca_topic_score_gemma":0.0021827465,"teacher_disagreement_score":0.0025093404,"about_ca_system_score_codex":0.0006263962,"about_ca_system_score_gemma":0.0007866361,"threshold_uncertainty_score":0.004989505},"labels":[],"label_agreement":null},{"id":"W2098434322","doi":"10.1109/cwit.2013.6621603","title":"Approximate bounds for limited backhaul uplink multicell processing with single-user compression","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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 Toronto","funders":"","keywords":"Computer science; Base station; Backhaul (telecommunications); Decodes; Telecommunications link; Constant (computer programming); Decoding methods; Algorithm; Computer network","score_opus":0.018269245955584806,"score_gpt":0.22687630961701308,"score_spread":0.20860706366142828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098434322","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.027990477,0.0024978826,0.95108926,0.0005999087,0.00007799428,0.00005081999,0.00015367397,0.0003234142,0.017216686],"genre_scores_gemma":[0.89431673,0.0030118476,0.09368921,0.00044156346,0.00021832902,0.00024198391,0.00029770323,0.0002412217,0.0075413184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833256,0.00044239912,0.000042440413,0.00016257317,0.0006878469,0.00033209837],"domain_scores_gemma":[0.9879522,0.009439992,0.00052777043,0.0008274103,0.00097462075,0.00027814758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031698414,0.0020660078,0.0011574924,0.001317447,0.00074801047,0.0023297754,0.0017846139,0.0012604623,0.00433467],"category_scores_gemma":[0.015896363,0.00050177873,0.0006287721,0.0016395093,0.0026946638,0.004787234,0.0033797286,0.0026649234,0.0007572972],"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.00019053211,0.0000701313,0.00052176404,0.00028151652,0.000051862353,0.00016696459,0.00017933059,0.68284035,0.0036218483,0.28456908,0.0023849416,0.025121791],"study_design_scores_gemma":[0.000004089691,0.000023261404,0.00006718796,0.000026414364,0.000006667587,0.000040062678,0.000027798153,0.94614965,0.0008786858,0.052203774,0.0005630396,0.000009390832],"about_ca_topic_score_codex":0.002429796,"about_ca_topic_score_gemma":0.0020134642,"teacher_disagreement_score":0.00433467,"about_ca_system_score_codex":0.0029211643,"about_ca_system_score_gemma":0.0017497703,"threshold_uncertainty_score":0.021194637},"labels":[],"label_agreement":null},{"id":"W2102783949","doi":"10.1109/icc.2007.438","title":"Sending Correlated Gaussian Sources over a Gaussian MAC: To Code, or not to Code","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"Concordia University","funders":"","keywords":"Computer science; Algorithm; Fusion center; Transmission (telecommunications); Additive white Gaussian noise; Gaussian; Coding (social sciences); Source code; Decoding methods; Code (set theory); Channel (broadcasting); Topology (electrical circuits); Telecommunications; Mathematics; Wireless; Statistics; Cognitive radio; Physics; Combinatorics","score_opus":0.023919800243618384,"score_gpt":0.30386460128473336,"score_spread":0.27994480104111497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102783949","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.142693,0.00046666854,0.85071206,0.00068017433,0.00007794802,0.000075237615,0.00011097363,0.00018505885,0.004998972],"genre_scores_gemma":[0.9520777,0.0003882163,0.04463815,0.00012395969,0.00007122228,0.000053078387,0.00004945285,0.000021423451,0.00257686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989109,0.00044733417,0.000032466087,0.00015376393,0.00022000309,0.00023541178],"domain_scores_gemma":[0.995542,0.0031270776,0.0005179117,0.00026510944,0.00043085095,0.00011711972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022782322,0.0010850974,0.0011070494,0.00054207724,0.00051062234,0.00095224346,0.0009546112,0.0010130893,0.001402994],"category_scores_gemma":[0.0056291255,0.00034289196,0.00047037986,0.001008751,0.0016789527,0.0013422684,0.001104513,0.0006376332,0.00022531814],"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.0006385377,0.00012113504,0.0017318374,0.00025216487,0.00011498228,0.0006225536,0.00029830835,0.8387436,0.0073722685,0.110741556,0.0018046133,0.037558485],"study_design_scores_gemma":[0.000028005936,0.00007248623,0.00016712099,0.000010192715,0.000035743735,0.000080879036,0.000051588373,0.9791557,0.0017750949,0.018256865,0.0003510293,0.00001519694],"about_ca_topic_score_codex":0.002557835,"about_ca_topic_score_gemma":0.002750766,"teacher_disagreement_score":0.002557835,"about_ca_system_score_codex":0.0011166311,"about_ca_system_score_gemma":0.0012690605,"threshold_uncertainty_score":0.012048602},"labels":[],"label_agreement":null},{"id":"W2103113479","doi":"10.1109/tit.2009.2025554","title":"Precoding for the AWGN Channel With Discrete Interference","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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":"Emphasis (telecommunications); Mathematics; Channel (broadcasting); Precoding; Combinatorics; Computer science; Telecommunications","score_opus":0.011977445169591662,"score_gpt":0.2304539970844034,"score_spread":0.21847655191481175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103113479","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.014124629,0.000567857,0.9656208,0.0010395612,0.0003681096,0.00007860621,0.00061831076,0.00048746867,0.0170946],"genre_scores_gemma":[0.48621702,0.0024945557,0.4701533,0.0008067036,0.00048344344,0.00028866928,0.0013585065,0.00016772909,0.038030054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955446,0.00010176273,0.000022360702,0.0000542152,0.00020942098,0.000057701105],"domain_scores_gemma":[0.9993129,0.00028636644,0.00004888679,0.00013099838,0.00019822636,0.000022718039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043259622,0.0006246861,0.00030724,0.0004280954,0.00028359014,0.00076175365,0.0004770349,0.00085809367,0.006493257],"category_scores_gemma":[0.0026634347,0.00019808444,0.00035797444,0.00085263286,0.00047974035,0.0006512043,0.00063389493,0.0009391928,0.002081436],"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.00040264727,0.00007345728,0.00069472357,0.0003974272,0.000079935315,0.00093136576,0.00028520424,0.3416246,0.029222922,0.39565122,0.024051223,0.20658533],"study_design_scores_gemma":[0.000041560197,0.00006349883,0.00040658424,0.000064715496,0.000020663574,0.00056109135,0.000037644964,0.9133036,0.007052188,0.06823167,0.010181362,0.00003539481],"about_ca_topic_score_codex":0.0041101575,"about_ca_topic_score_gemma":0.0068920883,"teacher_disagreement_score":0.006493257,"about_ca_system_score_codex":0.00063948665,"about_ca_system_score_gemma":0.0016454324,"threshold_uncertainty_score":0.021722138},"labels":[],"label_agreement":null},{"id":"W2103335393","doi":"10.1109/isit.2010.5513331","title":"AEP of Output when Rate is above capacity: The Gaussian case","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Waterloo","funders":"","keywords":"Codebook; Gaussian; Channel capacity; Equipartition theorem; Channel (broadcasting); Relay; Mathematics; Computer science; Algorithm; Mathematical optimization; Topology (electrical circuits); Combinatorics; Telecommunications; Physics","score_opus":0.020514667019713804,"score_gpt":0.2340310033078966,"score_spread":0.2135163362881828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103335393","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.26714805,0.0012953179,0.700402,0.0014851687,0.000096244024,0.00010352967,0.0005820876,0.0007895988,0.028098002],"genre_scores_gemma":[0.98642623,0.0007519546,0.010216264,0.00016908372,0.00011618417,0.00008248975,0.0001250964,0.0001333609,0.0019793918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962804,0.0012711117,0.00014274185,0.0004656013,0.0010127923,0.00082727085],"domain_scores_gemma":[0.95739895,0.033194616,0.0030426579,0.0026134916,0.0027348856,0.0010154494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049204906,0.0012670072,0.0016676396,0.001448336,0.0009220809,0.0021845296,0.0014646302,0.0015693338,0.0034259357],"category_scores_gemma":[0.049328085,0.00075307506,0.0009177961,0.0014759445,0.0051628994,0.004460647,0.0028206313,0.002564986,0.00061603554],"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.0012502281,0.00013765888,0.006301713,0.0004936768,0.00015549865,0.003991248,0.0011123035,0.39999527,0.022183819,0.5361483,0.0028668826,0.025363388],"study_design_scores_gemma":[0.00005236393,0.00023691407,0.0028539067,0.00014674879,0.00007137131,0.0031240971,0.0004032262,0.78851676,0.012438005,0.19075131,0.0012801122,0.00012523381],"about_ca_topic_score_codex":0.0016103627,"about_ca_topic_score_gemma":0.000894366,"teacher_disagreement_score":0.0049204906,"about_ca_system_score_codex":0.0015146176,"about_ca_system_score_gemma":0.0008730053,"threshold_uncertainty_score":0.026022375},"labels":[],"label_agreement":null},{"id":"W2103402422","doi":"10.1109/tit.2008.2011436","title":"Joint Source–Channel Coding Excess Distortion Exponent for Some Memoryless Continuous-Alphabet Systems","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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":"Gaussian; Exponent; Mathematics; Distortion (music); Source code; Upper and lower bounds; Discrete mathematics; Algorithm; Topology (electrical circuits); Computer science; Combinatorics; Mathematical analysis; Physics; Telecommunications","score_opus":0.01534998377513118,"score_gpt":0.22538147524452534,"score_spread":0.21003149146939415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103402422","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.39097476,0.0014357347,0.5904437,0.001077554,0.00008615073,0.000066510955,0.00023734228,0.00020541172,0.015472935],"genre_scores_gemma":[0.98225635,0.0005795151,0.015058726,0.0000699356,0.00004852931,0.000034509645,0.000069258276,0.000026246744,0.001856956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991524,0.00019171934,0.000053030777,0.000112816,0.0003232527,0.00016681635],"domain_scores_gemma":[0.9860476,0.011009915,0.0011244665,0.00062497123,0.00090626685,0.00028671446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021794215,0.0008234156,0.0007479281,0.0007376545,0.0004079883,0.0012958982,0.00075313787,0.00073050056,0.0022387635],"category_scores_gemma":[0.013597696,0.0003103867,0.00034288247,0.0006942936,0.0016974121,0.0020600117,0.001476717,0.001461,0.00023665557],"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.0002967256,0.00005492773,0.0015214382,0.00019600026,0.000047358746,0.0005592987,0.00035961354,0.69766325,0.008896579,0.27449405,0.0009534251,0.014957294],"study_design_scores_gemma":[0.000017091921,0.000055669534,0.00035838762,0.000025897183,0.000016673665,0.00015443304,0.000054375232,0.95897174,0.0034019558,0.036596682,0.00032240004,0.000024733828],"about_ca_topic_score_codex":0.0015621225,"about_ca_topic_score_gemma":0.0010317212,"teacher_disagreement_score":0.0022387635,"about_ca_system_score_codex":0.001754739,"about_ca_system_score_gemma":0.0009487012,"threshold_uncertainty_score":0.012731612},"labels":[],"label_agreement":null},{"id":"W2104128911","doi":"10.1016/j.sysconle.2008.06.006","title":"Robust coding for a class of sources: Applications in control and reliable communication over limited capacity channels","year":2008,"lang":"en","type":"article","venue":"Systems & Control Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":15,"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 Ottawa","funders":"Research Promotion Foundation; European Commission","keywords":"Channel capacity; Entropy (arrow of time); Mathematics; Information theory; Maximization; Class (philosophy); Dynamical systems theory; Entropy maximization; Applied mathematics; Rényi entropy; Coding (social sciences); Mathematical optimization; Computer science; Principle of maximum entropy; Statistics; Artificial intelligence","score_opus":0.02616549671541945,"score_gpt":0.21333271574985507,"score_spread":0.18716721903443562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104128911","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.008284858,0.0014517892,0.985578,0.000664092,0.0000904788,0.000028782732,0.00011672191,0.00018090972,0.0036043976],"genre_scores_gemma":[0.6324701,0.010473692,0.33870304,0.0007627007,0.0012591543,0.0003730518,0.00053232117,0.00029188386,0.015134181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995346,0.00012256016,0.000019678228,0.000080517,0.00020542098,0.00003725542],"domain_scores_gemma":[0.9974226,0.0017555999,0.00025764998,0.00021753486,0.00031106482,0.000035572804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010776006,0.00096291,0.0009735498,0.0009803271,0.00039678562,0.0011510908,0.0008243651,0.0017989951,0.0019054682],"category_scores_gemma":[0.0044835634,0.00030408925,0.000625637,0.001475456,0.0012184497,0.0013136975,0.0008753042,0.0015863949,0.00060510024],"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.0002338079,0.00006608091,0.00034008455,0.0004361008,0.00009017386,0.00024162151,0.00014934145,0.2353355,0.024834855,0.58062387,0.0069140512,0.15073448],"study_design_scores_gemma":[0.000035205823,0.00007251755,0.00020523107,0.000048512637,0.000034575194,0.000198583,0.000021567774,0.8291004,0.004937464,0.16003971,0.0052663735,0.000039922423],"about_ca_topic_score_codex":0.00063442776,"about_ca_topic_score_gemma":0.00046888134,"teacher_disagreement_score":0.0019054682,"about_ca_system_score_codex":0.00042267266,"about_ca_system_score_gemma":0.00045156278,"threshold_uncertainty_score":0.0063744187},"labels":[],"label_agreement":null},{"id":"W2104453881","doi":"10.1109/isit.2012.6283566","title":"Multiple access channel with various degrees of asymmetric state information","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"Queen's University","funders":"","keywords":"Encoder; Computer science; Channel state information; Independent and identically distributed random variables; Channel (broadcasting); Characterization (materials science); Decoding methods; Process (computing); State (computer science); Channel capacity; Algorithm; Computer network; Telecommunications; Wireless; Mathematics; Random variable","score_opus":0.01886585875500607,"score_gpt":0.24093598728147858,"score_spread":0.2220701285264725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104453881","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.17465173,0.0008910365,0.8035656,0.002336146,0.00010194276,0.00013617973,0.0005612534,0.0002439919,0.017512102],"genre_scores_gemma":[0.96236944,0.0005030125,0.03214434,0.00019574787,0.0001514438,0.00022474602,0.0001192418,0.000027637787,0.0042644367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933531,0.0028602043,0.00031331804,0.0008990596,0.0016091259,0.0009651556],"domain_scores_gemma":[0.9730708,0.018126352,0.003478469,0.0027529213,0.0019514436,0.0006199718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005195454,0.0016907083,0.0021652726,0.0011557373,0.0013841715,0.0027809965,0.0021214543,0.0020475432,0.0019652918],"category_scores_gemma":[0.021552496,0.00070805213,0.0007779651,0.0020787427,0.0034201937,0.004816109,0.0031453182,0.002628347,0.0004752854],"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.0005535348,0.00008387298,0.0009843914,0.00016867038,0.00007903687,0.0011287071,0.0004068429,0.42325962,0.0036211025,0.55969274,0.001064858,0.00895661],"study_design_scores_gemma":[0.000060607097,0.00007157741,0.00020260789,0.000022603695,0.000036603025,0.00017549844,0.000061579194,0.8653868,0.0016268975,0.13144127,0.0008702145,0.0000437111],"about_ca_topic_score_codex":0.0017230879,"about_ca_topic_score_gemma":0.0010483748,"teacher_disagreement_score":0.005195454,"about_ca_system_score_codex":0.0018984978,"about_ca_system_score_gemma":0.0014704235,"threshold_uncertainty_score":0.02747649},"labels":[],"label_agreement":null},{"id":"W2105486143","doi":"10.1109/icassp.2006.1661064","title":"A Coding Theorem for Multiterminal Estimation","year":2006,"lang":"en","type":"article","venue":"","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":"McMaster University","funders":"","keywords":"Bounded function; Statistic; Joint probability distribution; Mutual information; Mathematics; Generalization; Algorithm; Computer science; Coding (social sciences); Sufficient statistic; Discrete mathematics; Applied mathematics; Statistics; Mathematical analysis","score_opus":0.011930437177106361,"score_gpt":0.255873502955773,"score_spread":0.24394306577866662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105486143","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.0016203681,0.0003631227,0.9936255,0.00029824895,0.000110739034,0.000019191966,0.00009107112,0.00008278143,0.0037889602],"genre_scores_gemma":[0.4135793,0.0032033762,0.56512177,0.0021750345,0.0011923355,0.0005908419,0.00070305413,0.00035243895,0.013081779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791366,0.0005278972,0.00010564037,0.00038230556,0.0008346906,0.00023568912],"domain_scores_gemma":[0.9888525,0.0076701087,0.0004746002,0.0011501368,0.0016283878,0.00022428941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003178012,0.0008152145,0.000958395,0.0016967352,0.0010732674,0.0019301551,0.0014937886,0.0016790264,0.0038795974],"category_scores_gemma":[0.013257785,0.00042630133,0.0011996649,0.0014070785,0.0023004056,0.0036189128,0.0026813936,0.0033367232,0.0015769828],"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.000040066327,0.000017672352,0.00023686289,0.000096623364,0.00002153918,0.00018278573,0.0001197374,0.028464453,0.0022572342,0.92861825,0.0036575894,0.036287114],"study_design_scores_gemma":[0.000031922013,0.00007243426,0.00019273518,0.00012005905,0.000025374518,0.0006462895,0.000028208822,0.23845261,0.0042319875,0.73877287,0.017372198,0.000053410997],"about_ca_topic_score_codex":0.0011400855,"about_ca_topic_score_gemma":0.0005196106,"teacher_disagreement_score":0.0038795974,"about_ca_system_score_codex":0.0013785962,"about_ca_system_score_gemma":0.0014147554,"threshold_uncertainty_score":0.016807139},"labels":[],"label_agreement":null},{"id":"W2106711692","doi":"10.1109/tit.2003.809560","title":"Secret-key agreement over unauthenticated public channels-part II: the simulatability condition","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":103,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"A priori and a posteriori; Computer science; Formalism (music); Key (lock); Secret sharing; Context (archaeology); Theoretical computer science; Representation (politics); Authentication (law); Channel (broadcasting); Cryptography; Computer security; Mathematics; Topology (electrical circuits); Computer network; Combinatorics","score_opus":0.014349473895898947,"score_gpt":0.2329499708838691,"score_spread":0.21860049698797016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106711692","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.027165055,0.00036965864,0.9570019,0.0017225243,0.00012771325,0.0002083845,0.00037313713,0.00023039593,0.0128011955],"genre_scores_gemma":[0.88043916,0.00095084053,0.106553786,0.00075501413,0.00038412542,0.001326976,0.00070737704,0.00016719001,0.008715449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895112,0.0031095173,0.00076020753,0.002219585,0.0030324073,0.0013671122],"domain_scores_gemma":[0.9714983,0.020422662,0.0021131916,0.0040297215,0.001496929,0.00043907925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00983493,0.0012075474,0.0018268392,0.0013223492,0.002130414,0.0045672064,0.0022326973,0.0038639691,0.0069521684],"category_scores_gemma":[0.03166406,0.0010466145,0.0025177894,0.0016265397,0.010815097,0.015364981,0.0048580626,0.006874766,0.001936256],"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.000111211244,0.000019486664,0.00014654845,0.000054323038,0.000014611619,0.00013261804,0.0001809606,0.008191499,0.0011057229,0.9871159,0.0005694016,0.0023576429],"study_design_scores_gemma":[0.00006822654,0.000042566317,0.000052339994,0.000025660509,0.000011422608,0.00014464771,0.00003203327,0.062757514,0.003023368,0.93194276,0.0018794542,0.000019941815],"about_ca_topic_score_codex":0.000621399,"about_ca_topic_score_gemma":0.0003039426,"teacher_disagreement_score":0.00983493,"about_ca_system_score_codex":0.002721956,"about_ca_system_score_gemma":0.0027746626,"threshold_uncertainty_score":0.052012682},"labels":[],"label_agreement":null},{"id":"W2106861055","doi":"10.1109/acssc.2010.5757865","title":"Randomized on-off signaling for asynchronous interference channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Transmitter; Computer science; Rayleigh fading; Upper and lower bounds; Topology (electrical circuits); Asynchronous communication; Fading; Interference (communication); Channel (broadcasting); Telecommunications; Mathematics","score_opus":0.0183296997931817,"score_gpt":0.26529508210420094,"score_spread":0.24696538231101925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106861055","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.08381739,0.00046528838,0.9084239,0.00031164207,0.00009237137,0.00008597896,0.00008678322,0.00030438788,0.0064123054],"genre_scores_gemma":[0.96935195,0.00024730634,0.028545888,0.00010935363,0.000069921865,0.00006148673,0.000038310664,0.000026551854,0.001549248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981893,0.00072894717,0.00007618107,0.00021502381,0.00050286937,0.0002877726],"domain_scores_gemma":[0.9952525,0.003060449,0.000728032,0.0005319295,0.00025396122,0.00017311533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018788395,0.0009916924,0.0007633472,0.00048772717,0.0006565749,0.0011643198,0.0010588029,0.0008029145,0.0016653374],"category_scores_gemma":[0.0060110213,0.00035510774,0.00045725206,0.0004427634,0.001568896,0.0015253134,0.0013637897,0.0010459671,0.00025054291],"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.0007720987,0.000140297,0.0008762837,0.00019608831,0.000051906525,0.0004354012,0.00026963072,0.6916131,0.01893237,0.24276187,0.001161128,0.042789925],"study_design_scores_gemma":[0.000019977588,0.00009292874,0.00009344971,0.000010729107,0.000014487631,0.00007663789,0.00001517784,0.97603285,0.001665185,0.021512484,0.000454035,0.000012109649],"about_ca_topic_score_codex":0.0011790588,"about_ca_topic_score_gemma":0.0015401322,"teacher_disagreement_score":0.0018788395,"about_ca_system_score_codex":0.0012016017,"about_ca_system_score_gemma":0.0012710904,"threshold_uncertainty_score":0.009936392},"labels":[],"label_agreement":null},{"id":"W2107389462","doi":"10.1109/isit.2003.1228387","title":"Capacity achieving probability measure of an input-bounded vector gaussian channel","year":2003,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"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 Toronto","funders":"","keywords":"Bounded function; Constraint (computer-aided design); Measure (data warehouse); Gaussian; Probability distribution; Channel (broadcasting); Mathematical optimization; Channel capacity; Additive white Gaussian noise; Noise (video); Probability mass function; Mathematics; Gaussian noise; Distribution (mathematics); Probability density function; Computer science; Topology (electrical circuits); Applied mathematics; Algorithm; Statistics; Telecommunications; Mathematical analysis; Combinatorics; Artificial intelligence; Data mining; Physics","score_opus":0.034414032763761836,"score_gpt":0.23814248677170927,"score_spread":0.20372845400794742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107389462","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.1580925,0.00083289447,0.80543315,0.0021675061,0.00013959795,0.00014033436,0.000988849,0.0006247626,0.03158037],"genre_scores_gemma":[0.9726284,0.00088148,0.019842248,0.00021347059,0.00024530443,0.00024295112,0.00027659364,0.000088225075,0.005581136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728906,0.000967174,0.00009086855,0.00035502453,0.0007505487,0.00054744695],"domain_scores_gemma":[0.9838119,0.012005157,0.0012884033,0.0006845497,0.0015469923,0.0006628666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00324908,0.0015491039,0.0014318683,0.0017083479,0.0007729653,0.0030889576,0.0018967143,0.0014536642,0.0057734028],"category_scores_gemma":[0.012725955,0.00054488,0.00065147714,0.001671841,0.0036211056,0.0035377669,0.0018814516,0.0019541709,0.0007081426],"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.00023738013,0.00008208294,0.00041892112,0.00019954822,0.00005039084,0.0002429865,0.00020742131,0.22232985,0.0050561978,0.7609176,0.0019934888,0.008264145],"study_design_scores_gemma":[0.00004740681,0.00010727865,0.00034750625,0.00004548038,0.000027253833,0.00012588195,0.000059527618,0.8432582,0.0023548368,0.15277092,0.00080767885,0.000047984704],"about_ca_topic_score_codex":0.001584093,"about_ca_topic_score_gemma":0.00070031954,"teacher_disagreement_score":0.0057734028,"about_ca_system_score_codex":0.0023927847,"about_ca_system_score_gemma":0.0018533936,"threshold_uncertainty_score":0.019313931},"labels":[],"label_agreement":null},{"id":"W2107484830","doi":"10.1109/allerton.2011.6120305","title":"On the capacity of memoryless finite-state multiple access channels with asymmetric noisy state information at the encoders","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"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":"Independent and identically distributed random variables; Encoder; State information; Upper and lower bounds; State (computer science); Finite state; Computer science; Information theory; Channel capacity; Process (computing); Encoding (memory); Topology (electrical circuits); Mathematics; Algorithm; Channel (broadcasting); Computer network; Random variable; Combinatorics; Statistics; Markov chain; Mathematical analysis; Artificial intelligence","score_opus":0.04512741354612344,"score_gpt":0.22393117961261258,"score_spread":0.17880376606648912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107484830","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.29136574,0.011604997,0.63746256,0.0039286334,0.00035551377,0.0000874738,0.0010808585,0.00044923023,0.053664982],"genre_scores_gemma":[0.97922003,0.0041256174,0.012161448,0.00022701673,0.00039033208,0.00015788041,0.00022988713,0.000083683255,0.0034040564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979658,0.000759268,0.00007412553,0.00020737533,0.00048859435,0.0005048413],"domain_scores_gemma":[0.97417146,0.02202496,0.0010466608,0.0009712329,0.0014013171,0.00038427333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003014445,0.0014606739,0.0013260545,0.0018121974,0.0007723332,0.002959145,0.0018652421,0.0011622659,0.0034663428],"category_scores_gemma":[0.022348482,0.0006325657,0.0006432174,0.0019835248,0.0038122423,0.0046820734,0.00246826,0.0023223194,0.00046777396],"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.0003064078,0.00008003675,0.0006485305,0.00035180405,0.00007914836,0.0003377942,0.00039402908,0.43189302,0.00387317,0.5469205,0.0029632037,0.012152343],"study_design_scores_gemma":[0.000017473374,0.000029714764,0.0002394303,0.00011554643,0.00002150338,0.000067842855,0.000055238914,0.77410156,0.0010890474,0.22334939,0.00088034006,0.00003291597],"about_ca_topic_score_codex":0.0028307524,"about_ca_topic_score_gemma":0.0012607301,"teacher_disagreement_score":0.0034663428,"about_ca_system_score_codex":0.0023441212,"about_ca_system_score_gemma":0.0014321589,"threshold_uncertainty_score":0.017007828},"labels":[],"label_agreement":null},{"id":"W2108236351","doi":"10.1109/18.841196","title":"The capacity-cost function of discrete additive noise channels with and without feedback","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","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":"Queen's University","funders":"","keywords":"Upper and lower bounds; Aperiodic graph; Markov chain; Mathematics; Noise (video); Function (biology); Channel capacity; Markov process; Topology (electrical circuits); Combinatorics; Discrete mathematics; Mathematical analysis; Computer science; Statistics","score_opus":0.007147524987580594,"score_gpt":0.20126124492046119,"score_spread":0.1941137199328806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108236351","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.35422158,0.0020776999,0.6239325,0.0008936588,0.000078630226,0.00007990887,0.00043272332,0.00022476788,0.018058565],"genre_scores_gemma":[0.98030955,0.00066670316,0.01726784,0.000053760028,0.000026145857,0.00006690371,0.0000722185,0.000029369508,0.00150738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878687,0.00041954152,0.000036975944,0.0001377851,0.0002997273,0.00031912138],"domain_scores_gemma":[0.98809135,0.010029735,0.00058681314,0.0004433616,0.0006629913,0.00018563354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017286778,0.00079757004,0.00066581875,0.000707728,0.00046140436,0.0016465135,0.0011148825,0.0009923493,0.0021224692],"category_scores_gemma":[0.013313592,0.00025783133,0.00038799178,0.0011572333,0.0022394336,0.002519083,0.0010875448,0.0010677945,0.00023535003],"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.00018931286,0.000043769567,0.000740893,0.00016672265,0.000027215061,0.00013968577,0.00009326836,0.7270194,0.0043790047,0.2542052,0.0005965351,0.012398937],"study_design_scores_gemma":[0.00000927112,0.00003191268,0.00027342176,0.000023934681,0.000013550128,0.00006488635,0.000038951475,0.9560171,0.0024153492,0.040746033,0.00034765806,0.000017978758],"about_ca_topic_score_codex":0.0023962648,"about_ca_topic_score_gemma":0.0013874368,"teacher_disagreement_score":0.0024900686,"about_ca_system_score_codex":0.0024900686,"about_ca_system_score_gemma":0.0011815712,"threshold_uncertainty_score":0.018066823},"labels":[],"label_agreement":null},{"id":"W2108250525","doi":"10.1109/tit.2009.2032803","title":"On the Redundancy of Slepian–Wolf Coding","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Waterloo","funders":"","keywords":"Emphasis (telecommunications); Notation; Mathematics; Decoding methods; Discrete mathematics; Combinatorics; Computer science; Algorithm; Arithmetic","score_opus":0.009391756757221476,"score_gpt":0.22049165870512452,"score_spread":0.21109990194790304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108250525","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.058195837,0.0038037193,0.89952385,0.0011513672,0.00026016744,0.0000511103,0.0003056842,0.00028851238,0.036419753],"genre_scores_gemma":[0.82396907,0.0039836913,0.1541997,0.00056567264,0.0008414972,0.0001844182,0.0006483267,0.00020802871,0.015399709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823606,0.0006989272,0.00008619869,0.00020837209,0.00061128783,0.00015916328],"domain_scores_gemma":[0.9962321,0.0022168793,0.00031916716,0.0006817144,0.00046733636,0.000082938044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017308523,0.000955741,0.0006733211,0.001059377,0.00054507656,0.0009434574,0.0011612595,0.0010362176,0.0030735692],"category_scores_gemma":[0.009417063,0.00036868735,0.00050448906,0.0011758326,0.0014139189,0.0019143806,0.0015839889,0.0014944631,0.00087060337],"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.0004312238,0.000023698089,0.0006198759,0.0002501415,0.000046940168,0.0006579944,0.00034410667,0.07854705,0.011426027,0.83809936,0.005701466,0.06385216],"study_design_scores_gemma":[0.000037084665,0.00010707875,0.000481876,0.00016561872,0.000043579807,0.0007441427,0.00006127701,0.54122597,0.0073604644,0.44099134,0.008719259,0.000062242696],"about_ca_topic_score_codex":0.0013242554,"about_ca_topic_score_gemma":0.00091014104,"teacher_disagreement_score":0.0030735692,"about_ca_system_score_codex":0.0009905654,"about_ca_system_score_gemma":0.00078728626,"threshold_uncertainty_score":0.010282099},"labels":[],"label_agreement":null},{"id":"W2108545731","doi":"","title":"Constellation Shaping for Broadcast Channels in Practical Situations","year":2011,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Constellation; Additive white Gaussian noise; Dimension (graph theory); Modulation (music); Computer science; Constellation diagram; Topology (electrical circuits); Gaussian; Telecommunications; Algorithm; Mathematics; Theoretical computer science; White noise; Decoding methods; Acoustics; Physics; Bit error rate","score_opus":0.05056101543291634,"score_gpt":0.2746899502538407,"score_spread":0.22412893482092433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108545731","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.04589198,0.001019425,0.9241876,0.0009339126,0.0000976765,0.00004186747,0.0001024689,0.00030667303,0.027418341],"genre_scores_gemma":[0.9131012,0.0023778176,0.07013749,0.0002679968,0.00036946364,0.00010475735,0.00018003437,0.00014038806,0.013320817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898475,0.00042111336,0.000023629258,0.000110275054,0.00028239973,0.00017788117],"domain_scores_gemma":[0.9951208,0.0038000727,0.00023766982,0.0003813587,0.00034633663,0.00011373807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001248207,0.0008614558,0.00087502867,0.00061225053,0.0007757132,0.0015931717,0.0005475239,0.0013039372,0.0051867226],"category_scores_gemma":[0.009243736,0.00054083264,0.00040304387,0.0010740116,0.0019053647,0.0014648798,0.0017782398,0.0018331324,0.0009679081],"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.0006539353,0.000055686472,0.0009087568,0.00044208672,0.00004734729,0.00072464504,0.0008324363,0.4319002,0.014457124,0.45708618,0.005356915,0.08753467],"study_design_scores_gemma":[0.00003922281,0.00007506483,0.00032782875,0.000066350956,0.000023930006,0.0005779853,0.00016775005,0.59304667,0.002914464,0.39830098,0.004424469,0.000035259636],"about_ca_topic_score_codex":0.0006026654,"about_ca_topic_score_gemma":0.0005548296,"teacher_disagreement_score":0.0051867226,"about_ca_system_score_codex":0.00081818964,"about_ca_system_score_gemma":0.0007198464,"threshold_uncertainty_score":0.017351389},"labels":[],"label_agreement":null},{"id":"W2108739512","doi":"10.1109/glocom.2008.ecp.356","title":"Secret Key Generation and Agreement in UWB Communication Channels","year":2008,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Key generation; Shared secret; Low-density parity-check code; Key (lock); Transceiver; Computer network; Channel (broadcasting); Public-key cryptography; Decoding methods; Computer security; Wireless; Algorithm; Telecommunications; Encryption","score_opus":0.03540755572473176,"score_gpt":0.23600031534227384,"score_spread":0.20059275961754208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108739512","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.115253195,0.00026400268,0.879767,0.00017040774,0.000031233885,0.00008913902,0.00003520408,0.0002773273,0.004112565],"genre_scores_gemma":[0.88431185,0.00027003145,0.11277915,0.0000362635,0.000033394124,0.00011289063,0.00005470891,0.000038478796,0.0023632988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9959132,0.0014457148,0.00017156349,0.0003668584,0.0016550199,0.00044767754],"domain_scores_gemma":[0.99454486,0.0037227643,0.00060245284,0.0006158968,0.0004196676,0.0000943446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024701932,0.00035762243,0.0006821878,0.0006069665,0.0008507197,0.0011481451,0.0006822278,0.00093346403,0.0011253973],"category_scores_gemma":[0.006907089,0.00027814176,0.00032948583,0.00077316165,0.002438776,0.002214403,0.0019652273,0.00084798905,0.0004105547],"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.0013746838,0.00014041725,0.0016238806,0.00030898734,0.00007861655,0.0013774686,0.0020026974,0.20645948,0.09659685,0.5421701,0.0013591368,0.1465076],"study_design_scores_gemma":[0.00020080697,0.0002710156,0.0004267913,0.000043208067,0.00003060838,0.0006362857,0.00018424429,0.6735904,0.115563735,0.2047218,0.0042564035,0.000074732925],"about_ca_topic_score_codex":0.00028416145,"about_ca_topic_score_gemma":0.00016149237,"teacher_disagreement_score":0.0024701932,"about_ca_system_score_codex":0.00064637145,"about_ca_system_score_gemma":0.0007652149,"threshold_uncertainty_score":0.013063788},"labels":[],"label_agreement":null},{"id":"W2109446578","doi":"10.1007/978-3-642-13681-8_40","title":"Turbo Code Using Adaptive Puncturing for Pixel Domain Distributed Video Coding","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Université Laval","funders":"","keywords":"Puncturing; Computer science; Encoder; Parity bit; Turbo code; Distributed source coding; Coding (social sciences); Decoding methods; Algorithm; Coding tree unit; Codec; Real-time computing; Theoretical computer science; Computer engineering; Variable-length code; Computer hardware; Telecommunications; Mathematics","score_opus":0.027385590623205808,"score_gpt":0.2580633238110887,"score_spread":0.2306777331878829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109446578","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.0115942005,0.00043916187,0.98438466,0.0000863496,0.00008212331,0.000026359563,0.000029651497,0.0004415948,0.002915859],"genre_scores_gemma":[0.4276494,0.0009391347,0.55767137,0.00015852448,0.00017690434,0.00009650805,0.00015096882,0.00018302958,0.012974153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997595,0.00006285416,0.000011958861,0.000028471244,0.00011555645,0.000021672962],"domain_scores_gemma":[0.99937075,0.000283368,0.00003225806,0.00014003472,0.00015696597,0.000016615213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031229143,0.0003688213,0.00035550198,0.0003576867,0.00024051854,0.00044907417,0.00056837243,0.00071116426,0.0021840567],"category_scores_gemma":[0.0014074858,0.0001826137,0.0002978951,0.0005940871,0.00044179545,0.00062004727,0.00053596083,0.0007906751,0.0007981521],"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.00054480025,0.00008811752,0.00059465406,0.00028863346,0.00008075452,0.00047999562,0.00017306724,0.12532061,0.19500726,0.12875398,0.005923693,0.5427444],"study_design_scores_gemma":[0.000039909468,0.00017296166,0.00043540943,0.000039362174,0.000034995024,0.000720316,0.000012097578,0.8965231,0.075000994,0.020203881,0.0067802723,0.000036688183],"about_ca_topic_score_codex":0.0006312308,"about_ca_topic_score_gemma":0.0010354251,"teacher_disagreement_score":0.0021840567,"about_ca_system_score_codex":0.0003462998,"about_ca_system_score_gemma":0.00048504645,"threshold_uncertainty_score":0.007306397},"labels":[],"label_agreement":null},{"id":"W2109586982","doi":"10.1002/sec.1333","title":"Impact of secondary user communication on security communication of primary user","year":2015,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Transmitter; Secrecy; Transmitter power output; Cognitive radio; Constraint (computer-aided design); Channel (broadcasting); Context (archaeology); Computer network; Interference (communication); Topology (electrical circuits); Telecommunications; Computer security; Wireless; Mathematics","score_opus":0.016607863575978963,"score_gpt":0.25765576943785895,"score_spread":0.24104790586188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109586982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6448172,0.0021941527,0.30305916,0.0010894787,0.0002934866,0.00008105082,0.00023276026,0.0004234558,0.047809277],"genre_scores_gemma":[0.9981166,0.00018674943,0.0011394189,0.000028281527,0.000022083053,0.00000762972,0.00001030273,0.000007575082,0.00048130527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981522,0.0007551528,0.000041466163,0.00016048472,0.0004915049,0.00039914166],"domain_scores_gemma":[0.99175185,0.0055178874,0.0007140489,0.0005993681,0.0011269201,0.00028984874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012738549,0.0010175921,0.0010576411,0.00046915447,0.0009483714,0.0016430417,0.0005754884,0.0009826889,0.0040146457],"category_scores_gemma":[0.008027938,0.00027019874,0.00053625717,0.00038359646,0.0013943186,0.0010448726,0.0018710499,0.00092645147,0.00042635822],"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.0010850461,0.0001696392,0.017329449,0.0005238003,0.0002028982,0.003901315,0.0005334487,0.8028144,0.056108885,0.08238648,0.0026729945,0.032271616],"study_design_scores_gemma":[0.000027110498,0.0004653427,0.004327,0.000058227284,0.00013857831,0.0014540448,0.00019516434,0.95856583,0.016982809,0.016286138,0.0014489786,0.000050747567],"about_ca_topic_score_codex":0.0018510151,"about_ca_topic_score_gemma":0.0009669639,"teacher_disagreement_score":0.0040146457,"about_ca_system_score_codex":0.0010716353,"about_ca_system_score_gemma":0.001082458,"threshold_uncertainty_score":0.013430297},"labels":[],"label_agreement":null},{"id":"W2109908968","doi":"10.1109/isit.2009.5205799","title":"Hybrid digital-analog joint source-channel coding for broadcasting correlated Gaussian sources","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":13,"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":"Computer science; Gaussian; Algorithm; Coding (social sciences); Bandwidth (computing); Channel (broadcasting); Topology (electrical circuits); Theoretical computer science; Mathematics; Telecommunications; Statistics; Physics; Combinatorics","score_opus":0.023417470267449853,"score_gpt":0.23241727868177978,"score_spread":0.2089998084143299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109908968","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.036098603,0.00046829146,0.95645374,0.00040640787,0.00006915578,0.000044400007,0.00025388066,0.00026875894,0.0059367963],"genre_scores_gemma":[0.91365635,0.000703494,0.07707639,0.00013324119,0.00006842277,0.00008677043,0.0002555206,0.00003837141,0.007981544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995103,0.00014580169,0.000017292969,0.000058878937,0.00017311604,0.00009461321],"domain_scores_gemma":[0.9989875,0.00064580253,0.000087039865,0.0000990648,0.00014967014,0.00003085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000837643,0.0005508271,0.0005516359,0.00038478422,0.00030758028,0.00077049545,0.0009799093,0.0010111699,0.0021318174],"category_scores_gemma":[0.0016321603,0.00025318246,0.000492169,0.00083828764,0.00092984905,0.0010501257,0.0010362985,0.00078145874,0.00030134807],"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.0002810552,0.000043937853,0.00047111537,0.00014374388,0.00003990356,0.00029870588,0.00013168796,0.8725613,0.0065334016,0.09619575,0.0011490751,0.022150367],"study_design_scores_gemma":[0.000015473472,0.000025106418,0.00006319354,0.0000072265802,0.000013351171,0.000044962766,0.000011833933,0.99081016,0.0012680093,0.007327035,0.0004049803,0.0000086953905],"about_ca_topic_score_codex":0.0069026155,"about_ca_topic_score_gemma":0.00794116,"teacher_disagreement_score":0.0069026155,"about_ca_system_score_codex":0.0013539322,"about_ca_system_score_gemma":0.0011710079,"threshold_uncertainty_score":0.0137248635},"labels":[],"label_agreement":null},{"id":"W2111046425","doi":"10.1109/dcc.2006.72","title":"Side Information Aware Coding Strategy in the Quadratic Gaussian CEO Problem","year":2006,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; Quadratic equation; Gaussian; Rate–distortion theory; Coding (social sciences); Mathematical optimization; Rate distortion; Computer science; Distortion (music); Algorithm; Mathematics; Statistics; Telecommunications; Bandwidth (computing)","score_opus":0.011114440315724986,"score_gpt":0.22945559919171649,"score_spread":0.2183411588759915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111046425","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.028581925,0.00071672164,0.9567009,0.0006515592,0.000103954706,0.00005875077,0.00008260531,0.00007353798,0.013030178],"genre_scores_gemma":[0.8554798,0.0014227079,0.12727119,0.00032334487,0.000271226,0.00016513659,0.00018206857,0.000072430295,0.014812061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924505,0.0002970946,0.000027685277,0.00009454148,0.0002257079,0.00011002727],"domain_scores_gemma":[0.99830663,0.0012086693,0.00011251203,0.000120262775,0.00019716163,0.000054805023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012179851,0.00071276346,0.00079420424,0.0003356732,0.0003066676,0.00075482955,0.0005748218,0.0006657908,0.0039788047],"category_scores_gemma":[0.0027471413,0.00022884614,0.00028464792,0.00073739205,0.0011479373,0.0011889067,0.001035247,0.0010019041,0.0005357711],"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.00032275953,0.000053153213,0.0005183319,0.00030333642,0.00005553176,0.00043730836,0.00014722333,0.5263181,0.011286821,0.37972477,0.007749558,0.07308317],"study_design_scores_gemma":[0.000039676783,0.00008156278,0.0001391848,0.000026508107,0.000018550576,0.00015484894,0.000032212327,0.9282166,0.0029423162,0.06643304,0.001895209,0.000020261188],"about_ca_topic_score_codex":0.001191083,"about_ca_topic_score_gemma":0.0012335535,"teacher_disagreement_score":0.0039788047,"about_ca_system_score_codex":0.00067642215,"about_ca_system_score_gemma":0.0011233804,"threshold_uncertainty_score":0.013310492},"labels":[],"label_agreement":null},{"id":"W2111339146","doi":"10.1109/tit.2009.2013018","title":"Error Exponents for Asymmetric Two-User Discrete Memoryless Source-Channel Coding Systems","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","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":"Queen's University","funders":"","keywords":"Exponent; Decoding methods; Encoder; Channel (broadcasting); Source code; Mathematics; Lossless compression; Coding (social sciences); Transmitter; Algorithm; Computer science; Topology (electrical circuits); Discrete mathematics; Data compression; Statistics; Telecommunications; Combinatorics","score_opus":0.015455896946020144,"score_gpt":0.2536186090595721,"score_spread":0.23816271211355197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111339146","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.37523866,0.0010363332,0.615796,0.00052585185,0.000064245134,0.000082376355,0.00011922326,0.00018076823,0.0069565536],"genre_scores_gemma":[0.9863853,0.00034093513,0.012165,0.00003793656,0.000025305806,0.000043296535,0.000037156176,0.000024382538,0.0009407347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988128,0.0003753738,0.0000891415,0.00013632685,0.00040461402,0.00018173196],"domain_scores_gemma":[0.9826804,0.013542983,0.0016523814,0.0008143827,0.001113428,0.0001964799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025096687,0.0008439087,0.00075201475,0.0008550986,0.00046594336,0.0012020476,0.00070899515,0.000800257,0.0011234436],"category_scores_gemma":[0.019731594,0.00032953825,0.00031734022,0.0006887981,0.0014933911,0.002101476,0.0014541245,0.0015130448,0.00020117269],"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.00021076787,0.000052613832,0.002208939,0.00014926065,0.000035641813,0.0005706939,0.00053470494,0.78530586,0.010350177,0.1874341,0.0006290488,0.012518227],"study_design_scores_gemma":[0.000008707392,0.000029427445,0.00024824825,0.000015248088,0.00000819898,0.00009507897,0.000038377693,0.9727544,0.0021449795,0.024479125,0.00016359195,0.000014600646],"about_ca_topic_score_codex":0.00073260703,"about_ca_topic_score_gemma":0.00043985806,"teacher_disagreement_score":0.0025096687,"about_ca_system_score_codex":0.0012467531,"about_ca_system_score_gemma":0.0006148583,"threshold_uncertainty_score":0.0132725835},"labels":[],"label_agreement":null},{"id":"W2112256428","doi":"10.1109/glocom.2010.5683210","title":"Secrecy in Two-Way Relay Systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Secrecy; Decoding methods; Computer science; Relay; Computer network; Path loss; Wireless; Information-theoretic security; Path (computing); Computer security; Communications system; Confidentiality; Power (physics); Telecommunications","score_opus":0.008224369609528666,"score_gpt":0.25328228750764414,"score_spread":0.24505791789811548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112256428","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.081458494,0.006630215,0.8820199,0.0010660015,0.00017845789,0.00006985033,0.00027391023,0.0002919134,0.028011298],"genre_scores_gemma":[0.97081685,0.004627971,0.019500459,0.00011791599,0.00015216767,0.00008411883,0.000094065705,0.000034333578,0.0045720926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977221,0.0010599602,0.0001023133,0.00025815342,0.00057455245,0.00028287215],"domain_scores_gemma":[0.9941228,0.004174307,0.00062298507,0.0004767858,0.0005154016,0.00008766962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024995997,0.00088274386,0.0013923423,0.00087690237,0.0008749936,0.0023128595,0.00072451535,0.0016152244,0.002060997],"category_scores_gemma":[0.0059441905,0.00064036396,0.0005918474,0.00156166,0.0019450993,0.0029616852,0.0019949374,0.0011473397,0.00088491954],"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.00022329016,0.00004299766,0.0013451335,0.00046748604,0.00010189914,0.001037978,0.0006455381,0.46548063,0.0068165706,0.4993114,0.0022753389,0.022251809],"study_design_scores_gemma":[0.00005934322,0.000143404,0.0005525352,0.00007751561,0.000046927966,0.0008079888,0.0001762502,0.7516712,0.002897906,0.23938327,0.0040934626,0.00009024088],"about_ca_topic_score_codex":0.0011310859,"about_ca_topic_score_gemma":0.0005231258,"teacher_disagreement_score":0.0024995997,"about_ca_system_score_codex":0.0009916116,"about_ca_system_score_gemma":0.0007621,"threshold_uncertainty_score":0.013219297},"labels":[],"label_agreement":null},{"id":"W2112390972","doi":"10.1109/icnf.2011.5994315","title":"Channel noise and correlation noise of video sequences in distributed video coding","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"Toronto Metropolitan University","funders":"","keywords":"Encoder; Computer science; Coding (social sciences); Residual frame; Distributed source coding; Decoding methods; Correlation; Noise (video); Algorithm; Channel (broadcasting); Residual; Artificial intelligence; Computer vision; Speech recognition; Frame (networking); Reference frame; Mathematics; Telecommunications; Statistics; Variable-length code","score_opus":0.027827389544995033,"score_gpt":0.2334609945017532,"score_spread":0.20563360495675817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112390972","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.08440407,0.00171124,0.90975165,0.00025345237,0.00012514167,0.000036971385,0.00009484145,0.00014111566,0.0034814891],"genre_scores_gemma":[0.9402041,0.0025247827,0.052413512,0.0001652128,0.00014881387,0.00009330509,0.00023773882,0.000096938515,0.0041156006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989145,0.00025044565,0.00003616427,0.00017653279,0.00049626513,0.00012617324],"domain_scores_gemma":[0.9956228,0.0032036044,0.00037394234,0.00021005953,0.0005335059,0.000055999983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011126455,0.000593726,0.00046214412,0.0006432165,0.00031541014,0.00061852625,0.00045133106,0.0008260844,0.00059187924],"category_scores_gemma":[0.006086908,0.00028706802,0.00032970705,0.0009919457,0.001173127,0.0012739028,0.00048243796,0.0008595728,0.00013780239],"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.0003665755,0.000088131965,0.0059830514,0.0003309192,0.00008242267,0.0008718298,0.0003883369,0.7472235,0.039166756,0.16571878,0.0010696853,0.038710147],"study_design_scores_gemma":[0.000009411388,0.000082151695,0.002403319,0.000030245244,0.0000290803,0.00027595382,0.00004353924,0.9719614,0.008077862,0.015674403,0.001376349,0.000036302634],"about_ca_topic_score_codex":0.0027481385,"about_ca_topic_score_gemma":0.0018385383,"teacher_disagreement_score":0.0027481385,"about_ca_system_score_codex":0.0008192331,"about_ca_system_score_gemma":0.00064199406,"threshold_uncertainty_score":0.0059440136},"labels":[],"label_agreement":null},{"id":"W2113292808","doi":"10.1109/tit.2010.2040867","title":"Interactive Encoding and Decoding for One Way Learning: Near Lossless Recovery With Side Information at the Decoder","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada); University of Waterloo","funders":"","keywords":"Decoding methods; Computer science; Alphabet; Encoder; Coding (social sciences); Algorithm; Artificial intelligence; Information retrieval; Mathematics; Statistics; Philosophy; Operating system","score_opus":0.007401680144173783,"score_gpt":0.2182925791372947,"score_spread":0.2108908989931209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113292808","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.020477112,0.0002851722,0.9751625,0.00030594334,0.000026019645,0.000037042297,0.000061700455,0.00026406432,0.0033804986],"genre_scores_gemma":[0.7739143,0.0008452895,0.21488735,0.0003174788,0.0001250336,0.00021617863,0.00025559036,0.0001637314,0.009275171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810505,0.00065414974,0.000068206165,0.00032098874,0.00053473434,0.00031695972],"domain_scores_gemma":[0.9935049,0.0044762488,0.0004834485,0.0008476544,0.0005119758,0.00017569403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029430925,0.0013327968,0.0014030534,0.00078585866,0.000877822,0.001944246,0.0024326826,0.0020790445,0.0023395626],"category_scores_gemma":[0.007574129,0.00058830256,0.0007623738,0.0010820414,0.0028398428,0.003939628,0.0029126601,0.0029477782,0.00084956374],"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.00078505435,0.00015401983,0.00048297306,0.00015309533,0.00007178459,0.00029523353,0.00031494384,0.7269384,0.007569361,0.19949266,0.0016776297,0.062064853],"study_design_scores_gemma":[0.000023976163,0.000062894964,0.000041219213,0.000013424893,0.000012790652,0.000071455266,0.000021484673,0.9447068,0.002883008,0.051700246,0.00044339328,0.000019302646],"about_ca_topic_score_codex":0.0024891603,"about_ca_topic_score_gemma":0.0026144772,"teacher_disagreement_score":0.0029430925,"about_ca_system_score_codex":0.0020018981,"about_ca_system_score_gemma":0.0023267604,"threshold_uncertainty_score":0.015564799},"labels":[],"label_agreement":null},{"id":"W2114798828","doi":"10.1109/isit.2009.5205778","title":"A computation approach to the minimum total rate problem of causal video coding","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada); University of Waterloo","funders":"","keywords":"Frame (networking); Computer science; Coding (social sciences); Algorithm; Artificial intelligence; Mathematics; Statistics; Computer network","score_opus":0.018047484360254298,"score_gpt":0.24942983895202914,"score_spread":0.23138235459177484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114798828","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.0055627916,0.0004251992,0.9877886,0.0006960273,0.000056979283,0.00004351422,0.0001324846,0.00009786704,0.0051965523],"genre_scores_gemma":[0.5105002,0.0028705625,0.46426344,0.0005550441,0.0006071813,0.00045367746,0.0009373112,0.0004104165,0.019402144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978835,0.00087250717,0.000086007,0.0003812125,0.00055227487,0.00022444283],"domain_scores_gemma":[0.99380577,0.0048957616,0.00030115692,0.00033879007,0.0005332008,0.00012534254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024819449,0.0013359574,0.0014144784,0.0016445082,0.00091371086,0.0026985533,0.0028812976,0.0020860387,0.0058754846],"category_scores_gemma":[0.012330263,0.0006344314,0.0010430297,0.002662852,0.0024435993,0.004465528,0.002290212,0.0027947766,0.0006381749],"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.00013182408,0.000037663853,0.00021694359,0.00019322688,0.000032782646,0.00010055981,0.00010240264,0.3462424,0.000833824,0.6172453,0.00346579,0.03139722],"study_design_scores_gemma":[0.000019283378,0.000029968622,0.00006683566,0.000022242833,0.000010234041,0.0000319291,0.000021221103,0.7109473,0.00041106634,0.28711623,0.001309005,0.000014607002],"about_ca_topic_score_codex":0.0052859504,"about_ca_topic_score_gemma":0.0044948813,"teacher_disagreement_score":0.0058754846,"about_ca_system_score_codex":0.0028466661,"about_ca_system_score_gemma":0.0031111578,"threshold_uncertainty_score":0.020654142},"labels":[],"label_agreement":null},{"id":"W2116107552","doi":"10.1109/isit.2010.5513355","title":"Zero-forcing for the symmetric Interference Channel with conferencing encoders","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":9,"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":"Transmitter; Encoder; Interference (communication); Channel (broadcasting); Computer science; Zero (linguistics); Gaussian; Channel capacity; Topology (electrical circuits); Telecommunications; Forcing (mathematics); Mathematics; Combinatorics; Physics; Mathematical analysis","score_opus":0.019892084456962125,"score_gpt":0.2353390185395288,"score_spread":0.21544693408256665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116107552","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.07167785,0.00041763656,0.9141003,0.00054939184,0.00007574298,0.00004900764,0.00020172948,0.00018336033,0.012745034],"genre_scores_gemma":[0.9367006,0.0005601904,0.05612094,0.00016224541,0.00007806142,0.00013993472,0.00012744871,0.000044201803,0.0060663293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872214,0.0005003043,0.000042986252,0.00014463985,0.00035188656,0.0002379787],"domain_scores_gemma":[0.99530184,0.0032936642,0.000421389,0.00039662945,0.00045426586,0.00013212643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002019529,0.00090416893,0.0009464975,0.0005557455,0.00090147124,0.0013288371,0.0011737663,0.001071094,0.0027937097],"category_scores_gemma":[0.0050938893,0.0004558985,0.00063322193,0.0006664415,0.0024420493,0.0012324871,0.001579621,0.0012239284,0.0006860629],"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.00028376302,0.000040326107,0.0003789915,0.00016535675,0.000037575093,0.0004942253,0.00030417327,0.39969754,0.008920447,0.5763793,0.0014815438,0.011816742],"study_design_scores_gemma":[0.00003557239,0.00006680372,0.00013261744,0.000039874838,0.000019793426,0.00014939118,0.000042650812,0.88763183,0.003476768,0.10716784,0.0011976092,0.000039235976],"about_ca_topic_score_codex":0.0019700197,"about_ca_topic_score_gemma":0.0019481324,"teacher_disagreement_score":0.0027937097,"about_ca_system_score_codex":0.001565621,"about_ca_system_score_gemma":0.0019300028,"threshold_uncertainty_score":0.011359453},"labels":[],"label_agreement":null},{"id":"W2117654872","doi":"10.1109/isit.2007.4557472","title":"Error Exponents for Asymmetric Two-User Discrete Memoryless Source-Channel Systems","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"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":"Encoder; Channel (broadcasting); Transmitter; Decoding methods; Exponent; Computer science; Mathematics; Algorithm; Topology (electrical circuits); Discrete mathematics; Telecommunications; Statistics; Combinatorics","score_opus":0.025116105316979553,"score_gpt":0.28711271797202703,"score_spread":0.2619966126550475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117654872","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.23890568,0.0010213207,0.74961466,0.0005750139,0.00008164334,0.000101456106,0.00016170007,0.0002172837,0.009321136],"genre_scores_gemma":[0.97181386,0.00053990295,0.025999608,0.00006474095,0.000044575772,0.00008395664,0.000055254215,0.000036043522,0.0013620338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986076,0.00037953808,0.00012625362,0.00017159752,0.00050048414,0.00021453742],"domain_scores_gemma":[0.9822375,0.013505294,0.0016016344,0.0012347257,0.0011959649,0.00022493266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002721085,0.0009859449,0.00081517024,0.0011374165,0.00052767457,0.0013278701,0.0007200361,0.0007769961,0.0015994513],"category_scores_gemma":[0.02378926,0.0003359232,0.0003640318,0.00067616015,0.0015584684,0.0022995851,0.0018105772,0.0016057212,0.00030732263],"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.00042160388,0.00006312119,0.0033988548,0.00029418984,0.000057546098,0.0008940843,0.0009968649,0.41039407,0.02136282,0.53234345,0.0013456263,0.028427707],"study_design_scores_gemma":[0.000023961527,0.00008453374,0.0006876708,0.00006991178,0.000024340794,0.0004318679,0.0001035103,0.8774173,0.009012646,0.111287855,0.0008117313,0.000044629833],"about_ca_topic_score_codex":0.00047116133,"about_ca_topic_score_gemma":0.00033026826,"teacher_disagreement_score":0.002721085,"about_ca_system_score_codex":0.0012343792,"about_ca_system_score_gemma":0.0007561899,"threshold_uncertainty_score":0.014390647},"labels":[],"label_agreement":null},{"id":"W2119360038","doi":"10.1109/glocom.2010.5683783","title":"Distortion Analysis of Wyner-Ziv Distributed Video Coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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":"Computer science; Codec; Encoder; Coding (social sciences); Decoding methods; Coding tree unit; Bottleneck; ENCODE; Multiview Video Coding; Algorithm; Video quality; Real-time computing; Artificial intelligence; Video processing; Video tracking; Computer hardware; Mathematics","score_opus":0.008511844442523826,"score_gpt":0.23916447768617222,"score_spread":0.2306526332436484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119360038","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.010250719,0.0007160685,0.9857307,0.00012811832,0.000024356532,0.00001675776,0.000073939984,0.000065003485,0.0029942836],"genre_scores_gemma":[0.856822,0.0029865124,0.12935686,0.00011563318,0.00008531136,0.00012032849,0.00046744876,0.00013284797,0.009913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910563,0.00019322023,0.000034863147,0.00012002283,0.00048722865,0.00005891884],"domain_scores_gemma":[0.9988374,0.0005641208,0.00014047617,0.00012728648,0.0003060353,0.000024688838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009922232,0.00067283807,0.00045075064,0.00069539575,0.0001947654,0.00073205365,0.0008904524,0.00061159406,0.0012375996],"category_scores_gemma":[0.0029876926,0.00026185607,0.0004469736,0.0005492108,0.0008258723,0.001300589,0.00047793105,0.0007984271,0.00033925442],"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.000115630966,0.000026404088,0.00077261846,0.00012829414,0.00003805802,0.00015499213,0.000121263205,0.68219745,0.01491557,0.25408906,0.0015453364,0.045895312],"study_design_scores_gemma":[0.000002852514,0.000014593392,0.00016818475,0.0000067949763,0.0000041044095,0.00006817906,0.0000070049246,0.98298544,0.0025230276,0.013454652,0.000755158,0.000009972635],"about_ca_topic_score_codex":0.0036403565,"about_ca_topic_score_gemma":0.001408851,"teacher_disagreement_score":0.0036403565,"about_ca_system_score_codex":0.0018386976,"about_ca_system_score_gemma":0.000616737,"threshold_uncertainty_score":0.013340771},"labels":[],"label_agreement":null},{"id":"W2120193017","doi":"10.1109/ciss.2009.5054851","title":"A cross-layer approach to enhance the security of wireless networks based on MIMO","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Electronic Science and Technology of China","keywords":"Physical layer; Computer science; Wireless Transport Layer Security; Computer network; MIMO; Wireless network; Wireless; Wireless security; Encryption; Broadcasting (networking); Key distribution in wireless sensor networks; Channel (broadcasting); Telecommunications","score_opus":0.012566029932462176,"score_gpt":0.27982814603485767,"score_spread":0.2672621161023955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120193017","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.047851324,0.0014700373,0.9410596,0.0005096001,0.0002886656,0.00011908659,0.000029465711,0.00034618867,0.008326002],"genre_scores_gemma":[0.8466296,0.0011191448,0.1468435,0.00036046904,0.00022442787,0.00006305678,0.000034057448,0.000019289257,0.0047063553],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928695,0.00021163981,0.00005036781,0.00009050924,0.00025355248,0.00010701628],"domain_scores_gemma":[0.9991386,0.0002662576,0.00009607924,0.00023379573,0.00021646608,0.000048831396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009649078,0.00063860987,0.00037394642,0.0005800328,0.00054456096,0.0006765301,0.00046582942,0.0006235232,0.0018645419],"category_scores_gemma":[0.001194127,0.00023890793,0.0006353084,0.00035115864,0.0007875376,0.0014478147,0.001219328,0.0011064116,0.00039756938],"study_design_candidate":"not_applicable","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.0005804036,0.00024598074,0.0015550429,0.0005503978,0.00026077928,0.0010245929,0.00046288018,0.06560147,0.46259588,0.30472088,0.003123119,0.15927853],"study_design_scores_gemma":[0.00012828439,0.001598577,0.0017509763,0.00010306455,0.0002725606,0.0033179834,0.00012668455,0.6526912,0.2748976,0.03521688,0.029738298,0.00015782213],"about_ca_topic_score_codex":0.00021566135,"about_ca_topic_score_gemma":0.00026709063,"teacher_disagreement_score":0.0018645419,"about_ca_system_score_codex":0.00039759252,"about_ca_system_score_gemma":0.00034456086,"threshold_uncertainty_score":0.0062375665},"labels":[],"label_agreement":null},{"id":"W2120371241","doi":"10.1109/itw.2007.4313128","title":"Distributed Estimation; Three Theorems","year":2007,"lang":"en","type":"article","venue":"","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":"McMaster University","funders":"","keywords":"Estimator; Bivariate analysis; Distributed source coding; Computer science; Coding (social sciences); Estimation; Upper and lower bounds; Algorithm; Mathematics; Decoding methods; Mathematical optimization; Statistics; Channel code","score_opus":0.010367655089488522,"score_gpt":0.2445040624983228,"score_spread":0.23413640740883426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120371241","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.0032392542,0.002131128,0.9683345,0.0022286286,0.00024453073,0.000062206454,0.00024739408,0.00021045336,0.023301931],"genre_scores_gemma":[0.5626724,0.010181539,0.3939811,0.0041275388,0.0024631692,0.0009581648,0.00089201826,0.0005446076,0.024179565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946491,0.0019429082,0.00025488227,0.0008610161,0.0019327458,0.00035934534],"domain_scores_gemma":[0.96418166,0.02645879,0.0017954394,0.0036602765,0.0034439887,0.00045979905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012242307,0.0017765404,0.0013021369,0.0027005558,0.001187073,0.0034346664,0.0025136755,0.0021379336,0.0052443338],"category_scores_gemma":[0.04146665,0.00071361515,0.0019024335,0.0020906616,0.004618713,0.006351886,0.0055935173,0.0047082677,0.0017741921],"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.0000386273,0.000023140014,0.00038893055,0.00012240729,0.000035672423,0.00008832066,0.0001272662,0.012294717,0.00035300283,0.95479584,0.005364432,0.026367702],"study_design_scores_gemma":[0.00003781436,0.000032130265,0.00028123026,0.00011193152,0.00003682836,0.00035071012,0.000052767627,0.0836321,0.0010290607,0.90397257,0.010425696,0.000037154754],"about_ca_topic_score_codex":0.0014914619,"about_ca_topic_score_gemma":0.00060814666,"teacher_disagreement_score":0.012242307,"about_ca_system_score_codex":0.0029277757,"about_ca_system_score_gemma":0.0018580139,"threshold_uncertainty_score":0.064744234},"labels":[],"label_agreement":null},{"id":"W2120403301","doi":"10.48550/arxiv.1109.5420","title":"Incremental Relaying for the Gaussian Interference Channel with a Degraded Broadcasting Relay","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Relay channel; Channel (broadcasting); Computer science; Broadcasting (networking); Transmitter; Topology (electrical circuits); Interference (communication); Computer network; Transmission (telecommunications); Telecommunications; Electrical engineering; Physics; Engineering; Power (physics)","score_opus":0.1193048405335296,"score_gpt":0.19562420782510126,"score_spread":0.07631936729157165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120403301","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.112068124,0.001218352,0.8772897,0.00034549547,0.000049098737,0.000063866304,0.000086308406,0.0001847809,0.008694333],"genre_scores_gemma":[0.9714147,0.0006692055,0.02595133,0.00008391136,0.000040550694,0.000038298127,0.000035248362,0.00001814738,0.0017486127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895084,0.00038426102,0.000033682078,0.00012184731,0.00023057114,0.0002788009],"domain_scores_gemma":[0.9967542,0.0022239806,0.0003039112,0.00022461385,0.00038494315,0.00010820302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014843739,0.0012705371,0.0009162137,0.0005951018,0.0006891191,0.0011173832,0.0013692811,0.0009239475,0.0012493661],"category_scores_gemma":[0.004980672,0.00030896484,0.0006967474,0.00066182076,0.0021549936,0.0016473738,0.0012106114,0.001028346,0.00026043737],"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.00023708488,0.000044018372,0.00044289866,0.00016853573,0.00005263578,0.00052501354,0.00037712217,0.84063005,0.008103437,0.13282438,0.00073954626,0.015855156],"study_design_scores_gemma":[0.0000128006395,0.00009567458,0.00009881673,0.000009356774,0.000026029862,0.00014372512,0.000044013934,0.979627,0.0011446003,0.01829772,0.0004812761,0.000018909317],"about_ca_topic_score_codex":0.004720156,"about_ca_topic_score_gemma":0.0032749993,"teacher_disagreement_score":0.004720156,"about_ca_system_score_codex":0.0016991477,"about_ca_system_score_gemma":0.00088824745,"threshold_uncertainty_score":0.012328267},"labels":[],"label_agreement":null},{"id":"W2124840461","doi":"10.1109/isit.2007.4557603","title":"Distributed Parameter Estimation with Side Information: A Factor Graph Approach","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Factor graph; Decoding methods; Algorithm; Low-density parity-check code; Computer science; Belief propagation; Distributed source coding; Message passing; Expectation–maximization algorithm; Mathematics; Channel code; Maximum likelihood; Statistics","score_opus":0.011669570810708888,"score_gpt":0.22478153248576044,"score_spread":0.21311196167505156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124840461","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.0009311867,0.00003318452,0.99867624,0.00003071781,0.00000443078,0.0000062736767,0.00000935841,0.00007338187,0.00023512942],"genre_scores_gemma":[0.19842526,0.00043348334,0.79798305,0.000115006886,0.000078266494,0.00013298466,0.00021530525,0.00013083966,0.0024858539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918586,0.00034215304,0.00003680618,0.00014630222,0.00024137131,0.000047577625],"domain_scores_gemma":[0.99794394,0.0014184202,0.00015291365,0.00024933548,0.00020229389,0.000033151424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010270268,0.0011893106,0.0011347721,0.0010097495,0.00037322342,0.00087256037,0.0011991,0.0010739455,0.0022395605],"category_scores_gemma":[0.00418887,0.0005652124,0.00073947356,0.00080820645,0.0009880889,0.0023477674,0.0011585613,0.0012914189,0.00091756694],"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.00016165717,0.00004117957,0.00038151018,0.00013410825,0.000067642555,0.00011597239,0.00010014192,0.705392,0.008986052,0.10463391,0.0013107555,0.17867498],"study_design_scores_gemma":[0.000011495516,0.000025881445,0.000055971617,0.000008948508,0.000007954302,0.000050409948,0.000006612674,0.96458477,0.0023047586,0.032090105,0.0008416527,0.0000115357325],"about_ca_topic_score_codex":0.0011412835,"about_ca_topic_score_gemma":0.0011410231,"teacher_disagreement_score":0.0022395605,"about_ca_system_score_codex":0.000664277,"about_ca_system_score_gemma":0.00079898536,"threshold_uncertainty_score":0.0074920654},"labels":[],"label_agreement":null},{"id":"W2124991406","doi":"10.1109/acssc.2012.6489314","title":"Improved modeling of the correlation between continuous-valued sources in LDPC-based DSC","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Algorithm; Binary number; Randomness; Computer science; Distributed source coding; Decoding methods; Correlation; Theoretical computer science; Mathematics; Channel code; Statistics; Arithmetic","score_opus":0.026418000920852544,"score_gpt":0.2528663107399213,"score_spread":0.22644830981906872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124991406","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.04815715,0.00023260938,0.9479438,0.00018084602,0.000021530348,0.000032989927,0.00010462552,0.00025960122,0.003066792],"genre_scores_gemma":[0.9329329,0.00045512087,0.06256278,0.000074175165,0.000027967677,0.000077709556,0.000111323345,0.00007160346,0.0036864055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937433,0.00020818775,0.00002210814,0.00008304705,0.00025363246,0.000058634254],"domain_scores_gemma":[0.9984515,0.0008545628,0.00018983177,0.00019878591,0.00026757809,0.000037764097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079978176,0.000670195,0.0005869824,0.000475789,0.00036248346,0.0007543356,0.0007840721,0.0009693446,0.00074151973],"category_scores_gemma":[0.003377033,0.00040993464,0.00038367673,0.0007444435,0.0009228447,0.0013623481,0.0006499949,0.0011238112,0.00032530184],"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.00004915517,0.000016661974,0.00036680506,0.00002419651,0.000009287318,0.00010127702,0.000057997488,0.96852356,0.004705931,0.020857435,0.00019613843,0.005091545],"study_design_scores_gemma":[0.0000016796645,0.000004441922,0.00002621893,0.0000020176572,0.0000016067828,0.00001535492,0.0000013787901,0.99774384,0.0007433289,0.0013698823,0.00008639051,0.000003812044],"about_ca_topic_score_codex":0.0039274283,"about_ca_topic_score_gemma":0.002290513,"teacher_disagreement_score":0.0039274283,"about_ca_system_score_codex":0.0013713862,"about_ca_system_score_gemma":0.00096426316,"threshold_uncertainty_score":0.009950161},"labels":[],"label_agreement":null},{"id":"W2126013577","doi":"10.1109/isbmsb.2009.5133844","title":"Wyner-Ziv video coding with region adaptive quantization and progressive channel noise modeling","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Quantization (signal processing); Computer science; Coding (social sciences); Algorithm; Decoding methods; Channel (broadcasting); Adaptive coding; Computer vision; Artificial intelligence; Speech recognition; Data compression; Mathematics; Telecommunications","score_opus":0.025336410859606136,"score_gpt":0.23511360022394903,"score_spread":0.2097771893643429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126013577","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.0049533714,0.00017682054,0.9941227,0.000038526778,0.000014650475,0.000029577843,0.000021838223,0.00011534926,0.0005271867],"genre_scores_gemma":[0.3163866,0.0007996971,0.67904097,0.00015377087,0.00004637847,0.00018277748,0.00020196752,0.0000881208,0.0030997929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945563,0.00012458439,0.00003414983,0.00007630274,0.00027500166,0.000034342193],"domain_scores_gemma":[0.9996044,0.00012117853,0.000058151792,0.00009322757,0.00010670923,0.000016352113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077606854,0.0006967291,0.0005393511,0.0005017182,0.000201896,0.00047836453,0.0011922211,0.0006014001,0.00077668374],"category_scores_gemma":[0.0017153118,0.00022852236,0.00050733954,0.0005058246,0.00055777637,0.0019646501,0.0006800979,0.00086725183,0.00029502547],"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.00039697014,0.00008679137,0.0009461041,0.0002178201,0.00007185178,0.0004420317,0.00021459941,0.4571152,0.12712653,0.1483717,0.0017621258,0.26324823],"study_design_scores_gemma":[0.000018157496,0.00006346982,0.00011531107,0.00001663263,0.00001340686,0.00013767093,0.000010284465,0.97238916,0.017808517,0.007777065,0.0016252722,0.000025044614],"about_ca_topic_score_codex":0.0025288851,"about_ca_topic_score_gemma":0.002973094,"teacher_disagreement_score":0.0025288851,"about_ca_system_score_codex":0.0005582274,"about_ca_system_score_gemma":0.0005822262,"threshold_uncertainty_score":0.005028367},"labels":[],"label_agreement":null},{"id":"W2127931873","doi":"10.1109/isit.2004.1365515","title":"On the computation of the joint source-channel error exponent for memoryless systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"Queen's University","funders":"","keywords":"Channel code; Exponent; Computation; Lossless compression; Channel (broadcasting); Upper and lower bounds; Mathematics; Source model; Discrete mathematics; Combinatorics; Probability of error; Random variable; Decoding methods; Mathematical analysis; Algorithm; Computer science; Data compression; Telecommunications; Theoretical computer science; Statistics","score_opus":0.044955719061881734,"score_gpt":0.24620194780445837,"score_spread":0.20124622874257664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127931873","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.052441385,0.0015186861,0.9332334,0.0006486243,0.00010633785,0.000031094318,0.000055242162,0.00020173242,0.011763497],"genre_scores_gemma":[0.88451254,0.0030302873,0.104227975,0.00026676332,0.00022870327,0.00014507046,0.0001408049,0.00019338218,0.007254433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992592,0.00027303674,0.00003377567,0.000076595825,0.0002752207,0.00008216459],"domain_scores_gemma":[0.9884113,0.009716183,0.00059469393,0.0004986335,0.0006544145,0.00012479599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027509336,0.0012453456,0.000782231,0.0013835746,0.00048534543,0.0013199119,0.0010919372,0.00089265,0.0022153175],"category_scores_gemma":[0.024793984,0.00042909212,0.00039323972,0.001225156,0.002804404,0.0042384365,0.001623232,0.001663434,0.00065108854],"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.000097219614,0.000028970031,0.0006595089,0.0001066025,0.000029413954,0.00016558002,0.00028018546,0.38202032,0.0030163052,0.5987483,0.0013172424,0.013530239],"study_design_scores_gemma":[0.0000052689934,0.000016068856,0.00018730859,0.000027160984,0.0000068987815,0.000058864774,0.000026416568,0.85396147,0.0013136461,0.1437814,0.0005992757,0.000016247544],"about_ca_topic_score_codex":0.0012408338,"about_ca_topic_score_gemma":0.0008921255,"teacher_disagreement_score":0.0027509336,"about_ca_system_score_codex":0.0014914009,"about_ca_system_score_gemma":0.0006469517,"threshold_uncertainty_score":0.0145484805},"labels":[],"label_agreement":null},{"id":"W2128031934","doi":"10.1109/tit.2013.2294368","title":"Lossless Coding for Distributed Streaming Sources","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":22,"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 Toronto","funders":"","keywords":"Distributed source coding; Encoder; Decoding methods; Computer science; Algorithm; Source code; Variable-length code; Lossless compression; Entropy encoding; Upper and lower bounds; Entropy (arrow of time); Theoretical computer science; Coding (social sciences); Data compression; Mathematics; Statistics","score_opus":0.008494965284645975,"score_gpt":0.22043993110051716,"score_spread":0.2119449658158712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128031934","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.013714467,0.00029935513,0.9839092,0.00019331931,0.000024641113,0.000020631996,0.00007209493,0.0001606496,0.0016056268],"genre_scores_gemma":[0.7701138,0.0011203795,0.22182705,0.00020259975,0.00013757017,0.00017195141,0.0003326439,0.000069561494,0.006024411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958163,0.00009273995,0.000022300444,0.00006083212,0.00020470371,0.000037770733],"domain_scores_gemma":[0.99799937,0.0012298624,0.00018825465,0.00023718091,0.00030459167,0.00004081875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090629235,0.0004445149,0.00045428387,0.0003994476,0.0002323844,0.0006348112,0.00081762613,0.00053924724,0.0011013304],"category_scores_gemma":[0.0048145643,0.00021206969,0.00021328904,0.00055457477,0.00063674833,0.001457934,0.0009762676,0.0011544032,0.00029034904],"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.0002253701,0.000037559068,0.00046514158,0.00017643372,0.00001963679,0.0002896178,0.00014419449,0.5144362,0.018106109,0.3763787,0.0025304423,0.08719065],"study_design_scores_gemma":[0.000012086217,0.0000237648,0.000074716714,0.000011778306,0.0000039787983,0.00006013036,0.0000094358,0.934598,0.002738695,0.061433487,0.0010276111,0.000006341594],"about_ca_topic_score_codex":0.0008485929,"about_ca_topic_score_gemma":0.0007641055,"teacher_disagreement_score":0.0011013304,"about_ca_system_score_codex":0.0008069644,"about_ca_system_score_gemma":0.0006726464,"threshold_uncertainty_score":0.0058549047},"labels":[],"label_agreement":null},{"id":"W2131093212","doi":"10.1109/glocom.2010.5683999","title":"Time Correlation Analysis of Secret Key Generation via UWB Channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":10,"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":"Key (lock); Computer science; Key generation; Channel (broadcasting); Spatial correlation; Secrecy; Wireless; Characterization (materials science); Algorithm; Cryptography; Computer network; Telecommunications; Computer security; Physics","score_opus":0.009888231358007609,"score_gpt":0.2261635257363186,"score_spread":0.21627529437831097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131093212","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.27673247,0.0004882542,0.7173695,0.00025820493,0.00002960704,0.000027733597,0.00014592218,0.00025398438,0.004694355],"genre_scores_gemma":[0.9862103,0.00035695772,0.012077158,0.000027730719,0.000026108,0.000022023167,0.0000828421,0.000027573547,0.0011693593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994017,0.00018009293,0.000017127182,0.00006505642,0.00024287414,0.0000930701],"domain_scores_gemma":[0.9963134,0.0026687183,0.00046946245,0.00020770218,0.00028296132,0.000057824964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010852546,0.0003829262,0.0004117317,0.00059150596,0.00026005946,0.0005574785,0.00043079501,0.00041592552,0.0010672397],"category_scores_gemma":[0.004544796,0.00023629887,0.00031436302,0.0005619523,0.0008966932,0.0011534969,0.00050109974,0.0007880477,0.0001471144],"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.00020777699,0.00003835725,0.0021566553,0.00008393492,0.000050544393,0.00027387645,0.0001181224,0.8904214,0.014928525,0.07580844,0.00049621,0.015416185],"study_design_scores_gemma":[0.0000018748186,0.000009495226,0.00031008205,0.0000027967847,0.0000033383615,0.000025440462,0.000007866281,0.99457765,0.001567104,0.0034097058,0.00007889258,0.000005791846],"about_ca_topic_score_codex":0.0011830216,"about_ca_topic_score_gemma":0.0006970177,"teacher_disagreement_score":0.0011830216,"about_ca_system_score_codex":0.00065011415,"about_ca_system_score_gemma":0.0005867497,"threshold_uncertainty_score":0.0057394505},"labels":[],"label_agreement":null},{"id":"W2131633956","doi":"10.1109/mahss.2005.1542826","title":"Distortion sum-rate performance of successive coding strategy in gaussian wireless sensor networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"Concordia University","funders":"","keywords":"Wireless sensor network; Rate distortion; Computer science; Gaussian; Distortion (music); Coding (social sciences); Rate–distortion theory; Distributed source coding; Decoding methods; Algorithm; Source code; Mathematical optimization; Mathematics; Channel code; Telecommunications; Statistics; Computer network; Bandwidth (computing); Data compression","score_opus":0.012150833387129654,"score_gpt":0.23835735398231314,"score_spread":0.22620652059518348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131633956","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.16209242,0.0020768414,0.8272049,0.0007143778,0.00006590039,0.00007452752,0.00012623379,0.0001926183,0.007452166],"genre_scores_gemma":[0.9661235,0.00093650375,0.03121593,0.00012559305,0.00003125215,0.000049787286,0.00007216386,0.000038918788,0.0014063703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975503,0.0009889412,0.00008257962,0.00028638556,0.00071618374,0.00037560647],"domain_scores_gemma":[0.98917305,0.008197545,0.00077959255,0.00050475314,0.0011190528,0.00022602048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004104205,0.0014710271,0.0013485779,0.0007704771,0.0004693025,0.0011744709,0.0014056588,0.001157709,0.0010739772],"category_scores_gemma":[0.011377864,0.00037988654,0.0006295596,0.0010124535,0.0021905715,0.0026574337,0.0018492972,0.0011235119,0.00024202763],"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.0003621568,0.000053482585,0.00064859836,0.00013249432,0.00006338313,0.00012952522,0.00014384947,0.9253292,0.005689338,0.05116319,0.00048362478,0.015801147],"study_design_scores_gemma":[0.000022975793,0.00015582707,0.00022178012,0.00001096999,0.000015841184,0.00011001206,0.00004270187,0.9814742,0.002788394,0.014939989,0.00019456663,0.000022886787],"about_ca_topic_score_codex":0.002885476,"about_ca_topic_score_gemma":0.0012882511,"teacher_disagreement_score":0.004104205,"about_ca_system_score_codex":0.0021218432,"about_ca_system_score_gemma":0.0013596617,"threshold_uncertainty_score":0.021705389},"labels":[],"label_agreement":null},{"id":"W2132472950","doi":"10.1109/isit.2011.6033718","title":"An alternative to decoding interference or treating interference as Gaussian noise","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"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":"Decoding methods; Gaussian noise; Computer science; Code word; Algorithm; Transmitter; Interference (communication); Gaussian; Zero-forcing precoding; Noise (video); Topology (electrical circuits); Telecommunications; Mathematics; Theoretical computer science; Channel (broadcasting); Precoding; MIMO; Physics; Artificial intelligence","score_opus":0.06126274845906893,"score_gpt":0.31238651592624594,"score_spread":0.251123767467177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132472950","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.012666505,0.00044191137,0.9765662,0.0010374193,0.000084755266,0.000018941546,0.000041740826,0.00010526961,0.009037244],"genre_scores_gemma":[0.8104366,0.0016140133,0.17820098,0.0012035648,0.00040682382,0.000107300075,0.00007600468,0.000108358654,0.007846365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977276,0.0009641846,0.00006434248,0.0003772862,0.0006361179,0.0002305914],"domain_scores_gemma":[0.9951173,0.0031565097,0.00050015905,0.00074404804,0.00038704879,0.00009491725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002677273,0.0006967982,0.0009589878,0.00047079005,0.0005229396,0.0015941847,0.0017811058,0.0021138147,0.0014384353],"category_scores_gemma":[0.007916581,0.00033567304,0.00065085036,0.00070453755,0.0032825524,0.004146771,0.001562333,0.002157113,0.00056544354],"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.00012999712,0.000051491483,0.00088282785,0.0001220402,0.000040710198,0.00014149108,0.00020560539,0.17328487,0.0034986467,0.7891014,0.0018135004,0.030727461],"study_design_scores_gemma":[0.000028850889,0.00012659536,0.00021768275,0.000062588144,0.000027692442,0.00021104189,0.00007079138,0.6986117,0.0026469312,0.29293144,0.00503354,0.000031204712],"about_ca_topic_score_codex":0.0010599197,"about_ca_topic_score_gemma":0.0010431877,"teacher_disagreement_score":0.002677273,"about_ca_system_score_codex":0.0012384523,"about_ca_system_score_gemma":0.001133866,"threshold_uncertainty_score":0.014158964},"labels":[],"label_agreement":null},{"id":"W2132903062","doi":"10.1109/milcom.1989.103983","title":"Diversity and coding for an interference model","year":2003,"lang":"en","type":"article","venue":"","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":"University of Waterloo","funders":"","keywords":"Binary number; Computer science; Interference (communication); Coding (social sciences); Diversity (politics); Keying; Diversity combining; Phase-shift keying; Algorithm; Binary symmetric channel; Theoretical computer science; Channel (broadcasting); Mathematics; Bit error rate; Statistics; Telecommunications; Law; Arithmetic; Political science; Fading; Channel capacity","score_opus":0.07201464796768081,"score_gpt":0.27087163056780056,"score_spread":0.19885698260011975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132903062","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.032378603,0.0012060245,0.9192351,0.0017191324,0.00015636235,0.000028355706,0.00016647542,0.00012896222,0.0449809],"genre_scores_gemma":[0.91340876,0.0015369691,0.065866254,0.000656937,0.00037575298,0.00014941284,0.00018725204,0.00008133102,0.017737314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990834,0.00031423534,0.000023729017,0.00008057511,0.0003418401,0.00015632247],"domain_scores_gemma":[0.9984396,0.0009844522,0.00014219324,0.00016893257,0.00021548157,0.000049329894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011282461,0.0005360157,0.00054682477,0.00082074275,0.00053200306,0.0015500055,0.00089131144,0.0011689556,0.0037538656],"category_scores_gemma":[0.003689616,0.00021398831,0.00067495817,0.0009173047,0.0012612026,0.0021627995,0.0011205535,0.0015418364,0.0007593308],"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.000022707287,0.0000125789375,0.000106958905,0.000025179681,0.0000076154815,0.00008427902,0.00007396156,0.13182735,0.0008158237,0.86134773,0.0018169155,0.003858853],"study_design_scores_gemma":[0.000007916493,0.00001618892,0.00007066775,0.000012844995,0.000004270098,0.00006606336,0.000017167287,0.6867146,0.00021035498,0.31097615,0.0018924429,0.000011284262],"about_ca_topic_score_codex":0.002621416,"about_ca_topic_score_gemma":0.001513839,"teacher_disagreement_score":0.0037538656,"about_ca_system_score_codex":0.0017243368,"about_ca_system_score_gemma":0.001041441,"threshold_uncertainty_score":0.012557924},"labels":[],"label_agreement":null},{"id":"W2132972662","doi":"10.1109/icc.2008.363","title":"Symmetric Distributed Source Coding using LDPC Code","year":2008,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Alberta","funders":"Serono Symposia International Foundation","keywords":"Distributed source coding; Computer science; Source code; Coding (social sciences); Wireless sensor network; Linear network coding; Low-density parity-check code; Distributed computing; Code (set theory); Decoding methods; Variable-length code; Computer engineering; Theoretical computer science; Computer network; Algorithm; Mathematics","score_opus":0.044544031110661145,"score_gpt":0.25606388453634565,"score_spread":0.21151985342568452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132972662","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.009335613,0.00016033891,0.9852004,0.00020082813,0.000040749885,0.00008328172,0.00013148253,0.00045816347,0.004389166],"genre_scores_gemma":[0.5662677,0.00071015715,0.4228475,0.00022157167,0.00007203842,0.00037918286,0.00049859955,0.00008381064,0.008919453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926513,0.00023451116,0.0000364379,0.00009098532,0.00031916943,0.000053741423],"domain_scores_gemma":[0.9987954,0.0003527221,0.00012441259,0.00038255175,0.00031332494,0.000031504886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057535403,0.00046424445,0.00055246835,0.0005942981,0.00037081548,0.00056657806,0.0008630953,0.00068004377,0.0015299384],"category_scores_gemma":[0.0021229319,0.00019754916,0.0003094483,0.00097483804,0.0007114425,0.0007302632,0.000901418,0.00078578456,0.00072379416],"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.00039610715,0.00011803408,0.00064910075,0.00041286,0.00006179947,0.00063667895,0.00019340047,0.28764564,0.090284646,0.2973937,0.0070833527,0.31512475],"study_design_scores_gemma":[0.00009014596,0.00008312328,0.00021134307,0.000041336898,0.000021917986,0.00028451256,0.00001479553,0.9004055,0.033019368,0.05714115,0.008649627,0.000037223424],"about_ca_topic_score_codex":0.0016682951,"about_ca_topic_score_gemma":0.001542626,"teacher_disagreement_score":0.0016682951,"about_ca_system_score_codex":0.0007549533,"about_ca_system_score_gemma":0.0014054239,"threshold_uncertainty_score":0.0054776073},"labels":[],"label_agreement":null},{"id":"W2133129288","doi":"10.1109/isit.2003.1228272","title":"A property of the intrinsic mutual information","year":2003,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mutual information; Property (philosophy); Measure (data warehouse); Context (archaeology); Computer science; Key (lock); Computation; Theoretical computer science; Correlation; Information theory; Mathematics; Data mining; Algorithm; Artificial intelligence; Statistics; Computer security","score_opus":0.007682789140887497,"score_gpt":0.18637397264955233,"score_spread":0.17869118350866484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133129288","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.0329559,0.0016116023,0.9462786,0.001114096,0.00021580732,0.00008473475,0.00052335544,0.00033745568,0.01687853],"genre_scores_gemma":[0.90491664,0.0027897044,0.084632,0.0007039859,0.0009853846,0.00044953098,0.00056194264,0.0002328338,0.00472797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945708,0.0017384097,0.00035635082,0.0011539329,0.0017449307,0.0004356066],"domain_scores_gemma":[0.98268026,0.010666582,0.0024455513,0.0023088537,0.0015025128,0.0003963002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031888918,0.0009796115,0.0014657234,0.0021579466,0.0011179178,0.0028580406,0.001504114,0.001769251,0.0032676777],"category_scores_gemma":[0.02436146,0.0004713698,0.0011994536,0.0017615913,0.004731467,0.0075449697,0.003073683,0.0024603163,0.0010137617],"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.00010176529,0.000042128097,0.0013812238,0.00028327724,0.00011644116,0.0002921538,0.0003119261,0.016970374,0.007174273,0.9498044,0.0024049124,0.02111708],"study_design_scores_gemma":[0.000026818916,0.00019647738,0.001694618,0.00012761942,0.00007182298,0.0012038327,0.00011922082,0.121440984,0.007784524,0.8598595,0.0073618544,0.00011263889],"about_ca_topic_score_codex":0.00022204196,"about_ca_topic_score_gemma":0.0001331724,"teacher_disagreement_score":0.0032676777,"about_ca_system_score_codex":0.0009633004,"about_ca_system_score_gemma":0.00094875233,"threshold_uncertainty_score":0.016864657},"labels":[],"label_agreement":null},{"id":"W2134169741","doi":"10.1109/wcsp.2013.6677244","title":"Secrecy-based channel assignment for device-to-device communication: An auction approach","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Eavesdropping; Computer science; Secrecy; Computer network; Interference (communication); Channel (broadcasting); Wireless; Key (lock); Transmission (telecommunications); Cellular communication; Computer security; Telecommunications; Base station","score_opus":0.03855343970506984,"score_gpt":0.27309820531298973,"score_spread":0.2345447656079199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134169741","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.0069014532,0.00013365637,0.99058515,0.00012698624,0.000029885885,0.00007764564,0.000020620091,0.00009782566,0.002026731],"genre_scores_gemma":[0.68121195,0.00039563538,0.31304294,0.00013392618,0.00007353149,0.00024405477,0.0000690468,0.00006548739,0.0047634956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815947,0.00080556166,0.00007500476,0.000219408,0.0004039306,0.00033662986],"domain_scores_gemma":[0.9979819,0.0011257669,0.00018875382,0.0002249038,0.0002919559,0.00018661404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029094892,0.0009783198,0.001598636,0.00090979855,0.0012013328,0.0019498318,0.002665149,0.0014816893,0.0037554635],"category_scores_gemma":[0.004001272,0.00057138404,0.000908562,0.001646081,0.0013744988,0.002531339,0.0021768122,0.0016675625,0.0007134614],"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.00019676742,0.00016455735,0.00058702513,0.00013315945,0.000077380944,0.00029945764,0.00013990208,0.8517558,0.004086673,0.08643674,0.0027470936,0.05337552],"study_design_scores_gemma":[0.000024844576,0.000033718192,0.00004906239,0.0000050605,0.000009247942,0.00007579578,0.000020253412,0.98544794,0.0005549679,0.013206432,0.0005600678,0.00001256954],"about_ca_topic_score_codex":0.0020193234,"about_ca_topic_score_gemma":0.0018762633,"teacher_disagreement_score":0.0037554635,"about_ca_system_score_codex":0.001357682,"about_ca_system_score_gemma":0.0022252125,"threshold_uncertainty_score":0.015387058},"labels":[],"label_agreement":null},{"id":"W2134201128","doi":"10.1109/icc.1993.397272","title":"Analysis of the capacity region for the non-cooperative multiaccess channel with Rician fading","year":2002,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"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":"Rician fading; Fading; Channel (broadcasting); Computer science; Transmission (telecommunications); Computer network; Set (abstract data type); Gaussian; Information transmission; Aloha; Telecommunications; Wireless; Throughput","score_opus":0.04395539127973148,"score_gpt":0.24149361581758624,"score_spread":0.19753822453785477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134201128","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.0632552,0.008185841,0.85571223,0.0016748094,0.00011120079,0.0000842926,0.00047284653,0.00050914765,0.06999452],"genre_scores_gemma":[0.96021914,0.0052419403,0.024713017,0.00021742751,0.00020678161,0.00020243487,0.0002790648,0.00018004279,0.008740263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988452,0.0004452869,0.00001736739,0.00007759393,0.0003450078,0.00026948814],"domain_scores_gemma":[0.99213374,0.0061932644,0.00046370807,0.00026009584,0.0007944755,0.00015467708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025765933,0.0012189831,0.0009732855,0.0017064153,0.0006269487,0.002238327,0.0013257433,0.0009415451,0.0047709863],"category_scores_gemma":[0.009253864,0.0005681433,0.0007125822,0.0012790815,0.0021004723,0.0016034311,0.0012021106,0.0013879661,0.0007390418],"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.00008782804,0.000027483404,0.00031336863,0.00017618212,0.000057213783,0.00028808226,0.00019806346,0.7529546,0.001937571,0.23475868,0.0025108873,0.006689974],"study_design_scores_gemma":[0.000006108849,0.0000203364,0.00024031005,0.000051050036,0.00001695715,0.00010248634,0.000057293244,0.93791145,0.00045668837,0.05990598,0.0012088851,0.000022358565],"about_ca_topic_score_codex":0.007574853,"about_ca_topic_score_gemma":0.0030554424,"teacher_disagreement_score":0.007574853,"about_ca_system_score_codex":0.002789406,"about_ca_system_score_gemma":0.0015615106,"threshold_uncertainty_score":0.020238638},"labels":[],"label_agreement":null},{"id":"W2135641237","doi":"10.1109/isit.2006.261928","title":"On the Excess Distortion Exponent for Memoryless Gaussian Source-Channel Pairs","year":2006,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"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":"Exponent; Distortion (music); Mathematics; Gaussian; Quadratic equation; Channel (broadcasting); Gaussian noise; Channel code; Upper and lower bounds; Additive white Gaussian noise; Gaussian random field; Decoding methods; Gaussian process; Statistical physics; Mathematical analysis; Algorithm; Physics; Statistics; Computer science; Telecommunications; Geometry; White noise","score_opus":0.01600184812705732,"score_gpt":0.21931611079955363,"score_spread":0.2033142626724963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135641237","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.19782174,0.0060520316,0.77169704,0.0011013552,0.00021093087,0.00008547724,0.00037690025,0.0003739948,0.022280606],"genre_scores_gemma":[0.96073097,0.003456178,0.032143783,0.00020632376,0.00024502113,0.00008930212,0.00018490845,0.00011152667,0.0028319256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848574,0.0003400993,0.000115411975,0.00021554231,0.00061610463,0.00022714016],"domain_scores_gemma":[0.9730354,0.02178211,0.0018490383,0.0014376161,0.0014126222,0.000483275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032600253,0.0014945435,0.0010392992,0.001912259,0.00048930035,0.002172704,0.0010191585,0.0009148503,0.0036003222],"category_scores_gemma":[0.02838399,0.0005187219,0.00039350524,0.0009640675,0.0026618633,0.005129084,0.002822681,0.0022255182,0.00068198075],"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.0007685074,0.00008924308,0.002932528,0.00045300074,0.00006053538,0.0010650815,0.0005141409,0.20307617,0.024064822,0.73335344,0.0016510927,0.031971388],"study_design_scores_gemma":[0.00006390802,0.00023801776,0.001984907,0.00029150574,0.000051985597,0.0018742982,0.00019549139,0.6604028,0.01645599,0.31552812,0.0027521779,0.00016075165],"about_ca_topic_score_codex":0.00044257398,"about_ca_topic_score_gemma":0.00033056625,"teacher_disagreement_score":0.0036003222,"about_ca_system_score_codex":0.0013596915,"about_ca_system_score_gemma":0.0005826115,"threshold_uncertainty_score":0.017240882},"labels":[],"label_agreement":null},{"id":"W2136689674","doi":"10.1109/isit.2010.5513287","title":"On optimal causal coding of partially observed Markov sources under classical and non-classical information structures","year":2010,"lang":"en","type":"article","venue":"","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":"Queen's University","funders":"","keywords":"Counterexample; Markov decision process; Coding (social sciences); Markov process; Markov chain; Computer science; Conjecture; Mathematical optimization; Mathematics; Theoretical computer science; Algorithm; Discrete mathematics; Machine learning","score_opus":0.01607025418917735,"score_gpt":0.23942370881842087,"score_spread":0.22335345462924353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136689674","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.06517347,0.00046862644,0.92588943,0.0011077158,0.000050420775,0.00006451026,0.00019468728,0.00008910765,0.0069619375],"genre_scores_gemma":[0.89801955,0.0013744204,0.093998164,0.00019191686,0.00017814442,0.00020610378,0.0003331733,0.0000760309,0.005622487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977837,0.0011625151,0.000086118394,0.00029488982,0.0004007838,0.00027200874],"domain_scores_gemma":[0.9855378,0.011966058,0.0011770794,0.00057464984,0.00050072884,0.00024373081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033320945,0.0010295729,0.0009761755,0.00078399555,0.00050872937,0.0012972999,0.001206496,0.0011924276,0.002360824],"category_scores_gemma":[0.013702431,0.0005182684,0.00059398945,0.0011469519,0.0033631201,0.0035512063,0.0019649353,0.0018348135,0.0002404234],"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.00010641353,0.00004046408,0.00023330872,0.00008340442,0.0000224152,0.00006374374,0.00011709775,0.30347225,0.00107101,0.6840781,0.00052537536,0.010186353],"study_design_scores_gemma":[0.000036583802,0.000051419855,0.00012292624,0.000025724337,0.000010062946,0.000026076164,0.00002652558,0.6008875,0.0008365906,0.39755055,0.00040604695,0.000020060193],"about_ca_topic_score_codex":0.001767883,"about_ca_topic_score_gemma":0.0016143234,"teacher_disagreement_score":0.0033320945,"about_ca_system_score_codex":0.0024820182,"about_ca_system_score_gemma":0.0026229436,"threshold_uncertainty_score":0.018008351},"labels":[],"label_agreement":null},{"id":"W2137791875","doi":"10.1109/icc.2007.597","title":"Minimum Energy Data Gathering in Correlated Sensor Networks with Cooperative Transmission","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of British Columbia","funders":"","keywords":"MIMO; Wireless sensor network; Node (physics); Transmission (telecommunications); Computer science; Cooperative MIMO; Constellation; Coding (social sciences); Topology (electrical circuits); Efficient energy use; Data transmission; Algorithm; Mathematical optimization; Channel (broadcasting); Mathematics; Computer network; 3G MIMO; Statistics; Telecommunications; Engineering","score_opus":0.016738480303399514,"score_gpt":0.24060554458761454,"score_spread":0.22386706428421504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137791875","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.1115645,0.00038339637,0.88535935,0.00020661963,0.000020832846,0.000028931045,0.000030535044,0.000062681516,0.0023432886],"genre_scores_gemma":[0.9433395,0.00040807074,0.05514476,0.000054711065,0.000023014576,0.00007337827,0.000029426377,0.000016889708,0.0009102516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991799,0.00043446326,0.00002121084,0.000095457486,0.00018283329,0.00008610584],"domain_scores_gemma":[0.9981212,0.001305324,0.00023489278,0.00012190691,0.00015746466,0.000059304446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013758504,0.0006669727,0.0008165497,0.0004989462,0.00036207782,0.0005833463,0.0008004546,0.00063121726,0.00051691115],"category_scores_gemma":[0.0033145314,0.00041844972,0.0004161044,0.0010158708,0.0011752072,0.0012322454,0.0009620352,0.00050668325,0.000112695125],"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.000052355346,0.00002493363,0.00028882432,0.000052629424,0.000022054206,0.000103315484,0.000050840397,0.97230476,0.0035417157,0.018121297,0.00014903261,0.0052881665],"study_design_scores_gemma":[0.000011037421,0.000045961457,0.00008583227,0.000003900414,0.0000065007425,0.000019851203,0.000017009845,0.9908618,0.0008913949,0.007898489,0.00015332355,0.0000048532916],"about_ca_topic_score_codex":0.00080296415,"about_ca_topic_score_gemma":0.00092117686,"teacher_disagreement_score":0.0013758504,"about_ca_system_score_codex":0.00063212094,"about_ca_system_score_gemma":0.00055306085,"threshold_uncertainty_score":0.0072762966},"labels":[],"label_agreement":null},{"id":"W2138057312","doi":"10.1109/tcomm.2012.050912.110147","title":"Two Useful Bounds Related to Weighted Sums of Rayleigh Random Variables with Applications to Interference Systems","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"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 Alberta","funders":"","keywords":"Cumulative distribution function; Mathematics; Rayleigh distribution; Random variable; Rayleigh scattering; Upper and lower bounds; Context (archaeology); Function (biology); Constant (computer programming); Probability density function; Applied mathematics; Combinatorics; Discrete mathematics; Statistics; Mathematical analysis; Computer science; Physics","score_opus":0.023797860561646598,"score_gpt":0.27497698142799293,"score_spread":0.2511791208663463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138057312","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.004774111,0.005849884,0.9770314,0.0008222945,0.00057277,0.00005379089,0.00010874797,0.0001667058,0.010620286],"genre_scores_gemma":[0.43192294,0.020365342,0.52313405,0.0024606087,0.005989027,0.0007693213,0.0005635506,0.000782973,0.014012293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920896,0.0026347488,0.00039000847,0.0009824951,0.0029542507,0.00094877783],"domain_scores_gemma":[0.949101,0.037857376,0.003824488,0.0032179996,0.004990404,0.00100862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077445144,0.0038787406,0.0019281685,0.0053204508,0.001201964,0.0045065186,0.0032879347,0.002768537,0.0046566105],"category_scores_gemma":[0.069000825,0.0009818415,0.0017259751,0.004379207,0.004246609,0.008092532,0.0047415416,0.008721247,0.001675357],"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.0001914324,0.00012644695,0.0009949731,0.00056031754,0.00013974488,0.0005472961,0.0006426146,0.13908987,0.0073555023,0.75343454,0.007599479,0.08931788],"study_design_scores_gemma":[0.000028298928,0.0001543996,0.0009629485,0.00030781585,0.00013107824,0.0011497472,0.0001860408,0.5302732,0.0072198412,0.44102874,0.018370925,0.0001869844],"about_ca_topic_score_codex":0.0012368124,"about_ca_topic_score_gemma":0.0009905325,"teacher_disagreement_score":0.0077445144,"about_ca_system_score_codex":0.0025866427,"about_ca_system_score_gemma":0.0013439525,"threshold_uncertainty_score":0.04095745},"labels":[],"label_agreement":null},{"id":"W2140302921","doi":"10.1109/vtcf.2006.365","title":"Source-Channel Communication in One-Helper Problem","year":2006,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Wireless Communication Security 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":"Concordia University","funders":"","keywords":"Fusion center; Computer science; Channel code; Channel (broadcasting); Coding (social sciences); Distributed source coding; Scheduling (production processes); Computer network; Power consumption; Source code; Linear network coding; Power (physics); Decoding methods; Algorithm; Mathematical optimization; Telecommunications; Wireless; Mathematics; Cognitive radio","score_opus":0.016153655919326243,"score_gpt":0.21645147511820567,"score_spread":0.20029781919887943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140302921","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.08769598,0.0009074677,0.89651114,0.001725785,0.00019530498,0.00021103048,0.00036752198,0.00016864366,0.012217119],"genre_scores_gemma":[0.89424527,0.0005934947,0.094883606,0.00032580644,0.00029906578,0.00020460144,0.0002617791,0.00008375552,0.009102643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811065,0.00076589,0.000053664186,0.00038463506,0.00028002873,0.00040521627],"domain_scores_gemma":[0.9922008,0.0061501674,0.0005101348,0.0003952834,0.00041635078,0.00032724746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033139202,0.0012239261,0.0022843513,0.0006775977,0.00121022,0.0017087774,0.0024669373,0.002810696,0.0062580267],"category_scores_gemma":[0.007302972,0.000568148,0.00067562296,0.0010878226,0.0020934548,0.0027416225,0.0020541747,0.0014867698,0.00063740596],"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.000687619,0.00026851307,0.0014168853,0.0006189698,0.00018904204,0.0016824311,0.00045663462,0.7921912,0.0035343983,0.1515576,0.010035161,0.037361514],"study_design_scores_gemma":[0.00014344577,0.00014429288,0.00025293947,0.000028049199,0.00004539368,0.00045716172,0.00019807661,0.90342623,0.0013118292,0.0916631,0.0022929786,0.000036532012],"about_ca_topic_score_codex":0.0015424694,"about_ca_topic_score_gemma":0.0014590736,"teacher_disagreement_score":0.0062580267,"about_ca_system_score_codex":0.001185347,"about_ca_system_score_gemma":0.001294487,"threshold_uncertainty_score":0.020935237},"labels":[],"label_agreement":null},{"id":"W2140623855","doi":"10.1109/ciss.2009.5054736","title":"Generalized degrees of freedom of the symmetric gaussian interference channel with partial unidirectional transmitter cooperation","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"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":"Interference (communication); Transmitter; Channel (broadcasting); Degrees of freedom (physics and chemistry); Topology (electrical circuits); Multiplexing; Channel capacity; Upper and lower bounds; Noise (video); Computer science; Co-channel interference; Encoder; Orthogonality; Interference alignment; Gaussian noise; Zero-forcing precoding; Signal-to-noise ratio (imaging); Gaussian; Telecommunications; Control theory (sociology); Mathematics; MIMO; Precoding; Physics; Algorithm; Combinatorics; Mathematical analysis","score_opus":0.016562151865683397,"score_gpt":0.22421574005539233,"score_spread":0.20765358818970892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140623855","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.4569717,0.0011398044,0.525276,0.00044128677,0.00006185928,0.000058686343,0.00027761536,0.00013948981,0.015633492],"genre_scores_gemma":[0.9877172,0.0004701713,0.010541859,0.000060934057,0.000030730487,0.000056525038,0.000049728566,0.000008149583,0.0010645961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919873,0.0003245558,0.00002694654,0.00007423006,0.00015581702,0.00021981457],"domain_scores_gemma":[0.9987387,0.0006489344,0.00020291058,0.00019386197,0.00013620706,0.00007947661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088158937,0.0008507469,0.0006601655,0.00047956067,0.00050135754,0.0011125687,0.00063274323,0.0005496539,0.000887887],"category_scores_gemma":[0.0016704585,0.0002525845,0.00042009476,0.00071139814,0.0018855276,0.0011823806,0.0010592438,0.0007057068,0.00016648251],"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.00028481305,0.000035912577,0.00057750626,0.00013944205,0.000038550035,0.00051736063,0.00023343312,0.49951065,0.014593203,0.47681004,0.00078434934,0.006474796],"study_design_scores_gemma":[0.000033858585,0.00008420344,0.00037290173,0.000024021449,0.00002480116,0.00017333025,0.00008124546,0.8686452,0.0029916225,0.12655745,0.00095881167,0.000052572952],"about_ca_topic_score_codex":0.0016177522,"about_ca_topic_score_gemma":0.0013079123,"teacher_disagreement_score":0.0016177522,"about_ca_system_score_codex":0.0007524789,"about_ca_system_score_gemma":0.0007248748,"threshold_uncertainty_score":0.0054596663},"labels":[],"label_agreement":null},{"id":"W2141746073","doi":"10.1109/tit.2012.2236381","title":"Incremental Relaying for the Gaussian Interference Channel With a Degraded Broadcasting Relay","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":9,"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 Toronto","funders":"","keywords":"Relay; Relay channel; Computer science; Channel (broadcasting); Topology (electrical circuits); Broadcasting (networking); Transmitter; Interference (communication); Computer network; Transmission (telecommunications); Telecommunications; Mathematics; Physics; Power (physics)","score_opus":0.02062139363930787,"score_gpt":0.23517059458312273,"score_spread":0.21454920094381486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141746073","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.10968499,0.0012292321,0.879757,0.00035381375,0.00005068329,0.000065210224,0.00008957543,0.00018611651,0.008583396],"genre_scores_gemma":[0.97140247,0.000678012,0.025906038,0.00008727588,0.000041595264,0.000039564933,0.000036322162,0.000018420715,0.0017903477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989166,0.00039732087,0.000034914236,0.00012604483,0.0002360311,0.0002891213],"domain_scores_gemma":[0.99661785,0.0023209134,0.00031177423,0.00023035996,0.00040667062,0.000112444744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001512242,0.0012973703,0.0009377898,0.00060730765,0.0007012572,0.0011374138,0.0014053509,0.00093848835,0.0012645965],"category_scores_gemma":[0.005077353,0.00031724252,0.0007032784,0.00067976455,0.0021687762,0.0016896704,0.0012424511,0.0010469331,0.00026341205],"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.0002451922,0.000044952598,0.00045475474,0.00017459595,0.000055024364,0.00054068037,0.00038598533,0.84005433,0.007925311,0.13336842,0.00077882037,0.015971923],"study_design_scores_gemma":[0.000013293252,0.00009476266,0.00009815136,0.000009536969,0.000026564747,0.00014330598,0.00004525172,0.97960985,0.001110563,0.018345056,0.00048464953,0.00001904007],"about_ca_topic_score_codex":0.0048575466,"about_ca_topic_score_gemma":0.0033775931,"teacher_disagreement_score":0.0048575466,"about_ca_system_score_codex":0.0017287403,"about_ca_system_score_gemma":0.0009139678,"threshold_uncertainty_score":0.012542963},"labels":[],"label_agreement":null},{"id":"W2142207149","doi":"10.1109/cdc.2004.1429570","title":"Robust capacity of white Gaussian noise channels with uncertainty","year":2004,"lang":"en","type":"article","venue":"2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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 Ottawa","funders":"","keywords":"Shannon–Hartley theorem; Channel capacity; Mathematics; Transmitter; Capacity planning; Additive white Gaussian noise; Multiplicative function; White noise; Channel (broadcasting); Robustness (evolution); Control theory (sociology); Computer science; Mathematical optimization; Coding (social sciences); Telecommunications; Statistics; Mathematical analysis","score_opus":0.031550939341375456,"score_gpt":0.23418548781471202,"score_spread":0.20263454847333656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142207149","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.030666985,0.0006995196,0.96394026,0.00034800486,0.000034247772,0.000028154878,0.00024532227,0.00021999462,0.0038175269],"genre_scores_gemma":[0.9365914,0.0012064914,0.058589675,0.00016006867,0.00015605813,0.00018405684,0.00038589817,0.00014650491,0.0025798862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691224,0.00096961606,0.00013000547,0.0004693322,0.0010086533,0.0005101277],"domain_scores_gemma":[0.9932811,0.0049391626,0.00058091263,0.00042764566,0.0006617324,0.00010928821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002639228,0.0008984113,0.001352226,0.0012321315,0.00045609282,0.002546259,0.0016780683,0.0012282875,0.001521957],"category_scores_gemma":[0.014471309,0.00046334433,0.00075629697,0.0015422542,0.0030727102,0.0044182376,0.0019411729,0.0012650591,0.0002861859],"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.000068345165,0.000010887557,0.00012856387,0.000065100954,0.000021993133,0.00007467165,0.0000562905,0.8595188,0.0012897903,0.13128434,0.00042530335,0.007055827],"study_design_scores_gemma":[0.000004841872,0.000013659765,0.00007658741,0.000017379689,0.0000050909607,0.000029627945,0.000014896104,0.9245099,0.0009281644,0.07402549,0.00035608796,0.000018354998],"about_ca_topic_score_codex":0.0037851336,"about_ca_topic_score_gemma":0.0013395688,"teacher_disagreement_score":0.0037851336,"about_ca_system_score_codex":0.0023916513,"about_ca_system_score_gemma":0.0017077016,"threshold_uncertainty_score":0.0173527},"labels":[],"label_agreement":null},{"id":"W2143627081","doi":"10.1109/cwit.2011.5872157","title":"Resource allocation for secure OFDMA decode-and-forward relay networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of British Columbia","funders":"","keywords":"Computer science; Relay; Orthogonal frequency-division multiple access; Secrecy; Resource allocation; Frequency-division multiple access; Artificial noise; Scheduling (production processes); Optimization problem; Iterative method; Mathematical optimization; Orthogonal frequency-division multiplexing; Computer network; Power (physics); Algorithm; Transmitter; Mathematics","score_opus":0.021104997593771248,"score_gpt":0.2203561053408395,"score_spread":0.19925110774706825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143627081","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.018836578,0.0005480306,0.9766989,0.00030398768,0.00003408573,0.000052081356,0.00008172274,0.00007563136,0.0033689728],"genre_scores_gemma":[0.79892975,0.0013222736,0.1934972,0.00011141465,0.00008238691,0.00029282103,0.000112924,0.00008657573,0.0055646393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993013,0.0003179257,0.00002242991,0.00009695928,0.00017222893,0.00008916588],"domain_scores_gemma":[0.9992907,0.00048906205,0.00008565957,0.00003877858,0.00007046218,0.000025389014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010715813,0.00089324004,0.0010434287,0.0003963535,0.00045395273,0.0012795707,0.0007225362,0.0007914112,0.0017667364],"category_scores_gemma":[0.0023007558,0.0004568876,0.0003489725,0.0006399183,0.0008900567,0.0013625751,0.0009897269,0.00082550885,0.00048814857],"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.00007536268,0.000041414725,0.00012082426,0.000064090935,0.000017413724,0.00008690453,0.000061313964,0.9453195,0.0021252732,0.03588248,0.00086245715,0.015342963],"study_design_scores_gemma":[0.000012179962,0.000017361976,0.000035689787,0.0000043228133,0.000004945233,0.00002137707,0.00001530054,0.9893987,0.0006251077,0.009265299,0.0005946426,0.000005149197],"about_ca_topic_score_codex":0.0019268467,"about_ca_topic_score_gemma":0.0021485996,"teacher_disagreement_score":0.0019268467,"about_ca_system_score_codex":0.0012752643,"about_ca_system_score_gemma":0.0012855234,"threshold_uncertainty_score":0.009252787},"labels":[],"label_agreement":null},{"id":"W2145901689","doi":"10.1109/cwit.2007.375710","title":"On Optimum Conventional Quantization for Source Coding with Side Information at the Decoder","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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":"Coding (social sciences); Computer science; Quantization (signal processing); Algorithm; Distortion (music); Lossy compression; Discrete mathematics; Theoretical computer science; Artificial intelligence; Mathematics; Statistics; Bandwidth (computing); Telecommunications","score_opus":0.012418035845753095,"score_gpt":0.2480474615688988,"score_spread":0.2356294257231457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145901689","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.022604646,0.0024071282,0.96380824,0.00065870484,0.00008014992,0.00005767666,0.00023123529,0.00022700297,0.009925121],"genre_scores_gemma":[0.73393416,0.0048878705,0.24766941,0.0004450098,0.00028166728,0.00025104746,0.0007259298,0.00014396642,0.011660903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988146,0.0004585776,0.00004685619,0.00013770327,0.0004196132,0.00012260462],"domain_scores_gemma":[0.99793005,0.0016585666,0.00008765977,0.00009770754,0.00019803816,0.00002797449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017647621,0.001052176,0.0010418677,0.000589135,0.00031293815,0.0010698609,0.00094271876,0.0011615836,0.0027436868],"category_scores_gemma":[0.005559613,0.00058486,0.00032802712,0.0008919346,0.001522307,0.002310017,0.0011881075,0.0011651259,0.00077029865],"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.0005896709,0.000044629454,0.00036603288,0.00027581354,0.000042690222,0.00016160117,0.00020689065,0.6627245,0.0062204762,0.26274094,0.00476144,0.06186531],"study_design_scores_gemma":[0.00004295014,0.000053029213,0.00010950521,0.000046504927,0.00001197162,0.000058126123,0.000021189777,0.93872166,0.00135398,0.058431625,0.001132121,0.000017345203],"about_ca_topic_score_codex":0.0038459913,"about_ca_topic_score_gemma":0.004618887,"teacher_disagreement_score":0.0038459913,"about_ca_system_score_codex":0.0019819387,"about_ca_system_score_gemma":0.0021045313,"threshold_uncertainty_score":0.014380097},"labels":[],"label_agreement":null},{"id":"W2145921837","doi":"10.1109/ausctw.2011.5728730","title":"Resource allocation for secure OFDMA communication systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"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 British Columbia","funders":"","keywords":"Computer science; Subcarrier; Orthogonal frequency-division multiple access; Telecommunications link; Resource allocation; Scheduling (production processes); Frequency-division multiple access; Base station; Mathematical optimization; Iterative method; Optimization problem; Computer network; Maximization; Artificial noise; Orthogonal frequency-division multiplexing; Secrecy; Transmitter; Algorithm; Mathematics","score_opus":0.03807838911643079,"score_gpt":0.23096140574228965,"score_spread":0.19288301662585886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145921837","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.022373939,0.0010347329,0.97008264,0.00031476567,0.00007201179,0.00004626158,0.000044269913,0.000097514414,0.0059338734],"genre_scores_gemma":[0.86522496,0.0011270419,0.12940364,0.00008909974,0.00010233179,0.00014834224,0.0000620211,0.00003910637,0.0038034983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999295,0.00032311847,0.000025295398,0.00008650683,0.00018359418,0.00008657071],"domain_scores_gemma":[0.99934894,0.00040842444,0.00007866227,0.00005618646,0.00008145214,0.000026357508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075339375,0.00058251375,0.0006615363,0.0002936437,0.00059514324,0.0010804232,0.00050369074,0.00056758994,0.0018694086],"category_scores_gemma":[0.0020259502,0.00027135247,0.00024656174,0.00058313477,0.00068480964,0.0010746456,0.00091624295,0.0006893484,0.0005474884],"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.00012635738,0.00006306885,0.00030012665,0.000109148146,0.00003768514,0.00022213196,0.0001151105,0.8255091,0.006925765,0.11070315,0.0019216606,0.053966597],"study_design_scores_gemma":[0.000010434763,0.000020514894,0.000058738915,0.0000064242704,0.000005828906,0.00004081808,0.000019827192,0.9803719,0.0007908475,0.01733352,0.0013349906,0.0000062075956],"about_ca_topic_score_codex":0.0015434478,"about_ca_topic_score_gemma":0.0013969677,"teacher_disagreement_score":0.0018694086,"about_ca_system_score_codex":0.0008649037,"about_ca_system_score_gemma":0.0010474195,"threshold_uncertainty_score":0.006275356},"labels":[],"label_agreement":null},{"id":"W2146198330","doi":"10.1109/tit.2011.2146350","title":"Feedback Capacity of a Class of Symmetric Finite-State Markov Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":17,"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":"International Federation of Automatic Control","keywords":"Finite state; Markov process; Markov chain; Entropy (arrow of time); Mathematics; Channel capacity; Channel (broadcasting); Symmetry (geometry); Function (biology); Noise (video); Class (philosophy); Finite set; Topology (electrical circuits); Applied mathematics; Statistical physics; Discrete mathematics; Control theory (sociology); Computer science; Combinatorics; Mathematical analysis; Telecommunications; Physics; Statistics; Quantum mechanics","score_opus":0.021283171149604256,"score_gpt":0.2088022663887609,"score_spread":0.18751909523915664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146198330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49709746,0.0010175376,0.4749022,0.00095973816,0.00013240716,0.000119123564,0.0006937329,0.00032055756,0.024757287],"genre_scores_gemma":[0.99412125,0.0002528304,0.00438407,0.00005498064,0.000050300965,0.00005887445,0.00007459126,0.00001662971,0.000986564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990013,0.00029817809,0.000036681584,0.00012137656,0.00027316238,0.0002692931],"domain_scores_gemma":[0.99434704,0.003999908,0.0004849335,0.00041786782,0.0005309754,0.00021930535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012071064,0.00045062692,0.000670356,0.0006672808,0.0004819921,0.0012584978,0.00084530097,0.0006913695,0.0025736208],"category_scores_gemma":[0.005994346,0.00018583713,0.0004811883,0.0005217054,0.0016143695,0.0018957098,0.0009726765,0.00080490764,0.00020546952],"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.00020543308,0.000071511124,0.00090161036,0.00014739273,0.0000457638,0.00034659184,0.00018258828,0.23865193,0.008216705,0.73788327,0.0015114548,0.011835756],"study_design_scores_gemma":[0.000022139671,0.000040493454,0.00033328473,0.000017612374,0.000010458699,0.000146688,0.000033477383,0.74660367,0.0021643923,0.24990503,0.0007000867,0.000022706885],"about_ca_topic_score_codex":0.0013599338,"about_ca_topic_score_gemma":0.00047580875,"teacher_disagreement_score":0.0025736208,"about_ca_system_score_codex":0.0012342534,"about_ca_system_score_gemma":0.0012829882,"threshold_uncertainty_score":0.008955121},"labels":[],"label_agreement":null},{"id":"W2148334288","doi":"10.1109/isit.2004.1365100","title":"An approximation of the Gilbert-Elliott channel via a queue-based channel model","year":2004,"lang":"en","type":"article","venue":"","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":"Queen's University","funders":"","keywords":"Divergence (linguistics); Autocorrelation; Queue; Channel (broadcasting); Algorithm; Bit error rate; Computer science; Mathematics; Applied mathematics; Statistics; Telecommunications","score_opus":0.016298054028626805,"score_gpt":0.2327899037048734,"score_spread":0.2164918496762466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148334288","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.09691094,0.0007690841,0.8956745,0.0007026136,0.00013942027,0.000067624904,0.00021749917,0.00022777505,0.005290616],"genre_scores_gemma":[0.9589399,0.00089375547,0.03527313,0.00022073004,0.000085302716,0.00009811543,0.00009882472,0.00004884966,0.0043413416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993594,0.0002654702,0.000017330092,0.00006832342,0.00015435218,0.0001351687],"domain_scores_gemma":[0.99826473,0.0010197321,0.00020735674,0.00013739981,0.0002858741,0.00008498299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013807057,0.00083369337,0.0009020391,0.000719122,0.00064382795,0.0013474155,0.0014964788,0.0013909221,0.0012768705],"category_scores_gemma":[0.0044037974,0.00045722612,0.00050858536,0.0010123869,0.0014705985,0.0023822952,0.00082834554,0.0013672613,0.00031639438],"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.00006741546,0.000023642899,0.0004508717,0.000031195326,0.000012215077,0.00014601607,0.00007719878,0.86853176,0.0018761588,0.12657444,0.00050182117,0.0017073296],"study_design_scores_gemma":[0.000005736111,0.000009906338,0.000035339137,0.0000036123347,0.0000034277698,0.000018258188,0.000007012979,0.9930608,0.00017330404,0.0065401364,0.00013399486,0.000008474585],"about_ca_topic_score_codex":0.011626204,"about_ca_topic_score_gemma":0.0060541523,"teacher_disagreement_score":0.011626204,"about_ca_system_score_codex":0.0017093127,"about_ca_system_score_gemma":0.0016368758,"threshold_uncertainty_score":0.023117065},"labels":[],"label_agreement":null},{"id":"W2149271506","doi":"10.1109/isit.2009.5205547","title":"On the Degrees of Freedom of the 3-user Gaussian interference channel: The symmetric case","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":21,"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":"Degrees of freedom (physics and chemistry); Interference (communication); Channel (broadcasting); Measure (data warehouse); Gaussian; Function (biology); Topology (electrical circuits); Irrational number; Set (abstract data type); Mathematics; Computer science; Control theory (sociology); Combinatorics; Telecommunications; Physics; Geometry; Artificial intelligence; Quantum mechanics","score_opus":0.021692069115154717,"score_gpt":0.23939533313505257,"score_spread":0.21770326401989784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149271506","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.23735082,0.0034414076,0.68652505,0.0011938328,0.00018087418,0.00005240908,0.0002623457,0.00009552303,0.07089772],"genre_scores_gemma":[0.9817617,0.0018621652,0.013550403,0.000116484145,0.00011919964,0.000044785807,0.0000628301,0.000021618289,0.0024608187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873096,0.00047759284,0.00003211283,0.000093638824,0.00036713562,0.00029848883],"domain_scores_gemma":[0.99774206,0.001448079,0.00026388926,0.00023576594,0.00020842136,0.00010175418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013678859,0.00097456045,0.00071076857,0.00066933356,0.000847548,0.0016039374,0.00053627486,0.00064760435,0.002315234],"category_scores_gemma":[0.0037536016,0.00027880952,0.0005617419,0.00078260864,0.0027289495,0.0016839011,0.0013968374,0.0011749851,0.00039879733],"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.0001723494,0.000027015472,0.0004727824,0.000115875,0.000022015913,0.00043019338,0.00017555656,0.17567666,0.0055213724,0.8034026,0.0012772401,0.012706292],"study_design_scores_gemma":[0.00002853579,0.00011383009,0.00054516544,0.00007863468,0.000019835408,0.00052790943,0.00016532559,0.4988468,0.0029348151,0.49363887,0.0030253872,0.000074860334],"about_ca_topic_score_codex":0.0013074677,"about_ca_topic_score_gemma":0.0010085204,"teacher_disagreement_score":0.002315234,"about_ca_system_score_codex":0.0008616754,"about_ca_system_score_gemma":0.00079783425,"threshold_uncertainty_score":0.0077452064},"labels":[],"label_agreement":null},{"id":"W2149792368","doi":"10.1109/isit.2010.5513275","title":"On the error exponent to redundancy ratio of interactive encoding and decoding","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Decoding methods; Exponent; Redundancy (engineering); Encoding (memory); Computer science; Coding (social sciences); Algorithm; Probability of error; Ergodic theory; Low-density parity-check code; Source code; Theoretical computer science; Error detection and correction; Discrete mathematics; Mathematics; Statistics; Artificial intelligence; Pure mathematics","score_opus":0.01833751768126094,"score_gpt":0.27156084326218427,"score_spread":0.2532233255809233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149792368","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.12666087,0.004727937,0.85175544,0.00047758617,0.00016134966,0.00010689101,0.00010425965,0.00029841182,0.015707172],"genre_scores_gemma":[0.91427803,0.0022259846,0.08109106,0.000136488,0.00016978252,0.00017217899,0.000087439075,0.00009292427,0.0017461401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960438,0.0016014636,0.00023183259,0.0005209733,0.0011871996,0.00041476652],"domain_scores_gemma":[0.9737004,0.0203135,0.002209901,0.0017080524,0.0017865852,0.00028148363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004050679,0.0018592533,0.00093527354,0.0015705618,0.0004562065,0.0012681459,0.0011513485,0.0008911234,0.00147544],"category_scores_gemma":[0.033830114,0.0004299265,0.00039422783,0.0010741957,0.0027985773,0.0032138021,0.0019037622,0.0015245061,0.0003807186],"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.00083030463,0.00012966392,0.0038220286,0.00053582096,0.00010952221,0.0006867069,0.0006390772,0.25981465,0.04189335,0.58170927,0.0018159456,0.10801359],"study_design_scores_gemma":[0.00006393922,0.00077973667,0.0016648206,0.00018417825,0.00008417671,0.0013651553,0.00015943356,0.8470064,0.040674284,0.10290643,0.0049647405,0.00014666756],"about_ca_topic_score_codex":0.00036379587,"about_ca_topic_score_gemma":0.00020355095,"teacher_disagreement_score":0.004050679,"about_ca_system_score_codex":0.0011644918,"about_ca_system_score_gemma":0.0006629548,"threshold_uncertainty_score":0.021422267},"labels":[],"label_agreement":null},{"id":"W2149831263","doi":"10.1109/isbmsb.2010.5463126","title":"Distributed video coding without channel codes","year":2010,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Distributed source coding; Context-adaptive binary arithmetic coding; Encoder; Decoding methods; Coding tree unit; Coding (social sciences); Tunstall coding; Variable-length code; Adaptive coding; Computational complexity theory; Algorithm; Theoretical computer science; Multiview Video Coding; Data compression; Computer engineering; Computer hardware; Video processing; Lossless compression; Video tracking; Mathematics","score_opus":0.013078041046216975,"score_gpt":0.24759476704879452,"score_spread":0.23451672600257753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149831263","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.009439876,0.00045362706,0.98428,0.00016626403,0.0001372481,0.000060281192,0.00006589577,0.00033917243,0.005057669],"genre_scores_gemma":[0.6453747,0.00084581214,0.3372691,0.00034012418,0.00020549333,0.00028039984,0.00034064637,0.000079586105,0.015264177],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952984,0.000077500416,0.00001761272,0.000097643235,0.00022629583,0.000051102317],"domain_scores_gemma":[0.99935824,0.00018342046,0.000041585372,0.0001844519,0.00020844306,0.000023804843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032831088,0.00049582816,0.00055083993,0.0004246708,0.00032045651,0.00057517993,0.00078031095,0.0007430146,0.002174546],"category_scores_gemma":[0.0014899636,0.00015831449,0.00027750395,0.00059464626,0.0004667544,0.00087987946,0.0007990645,0.0009942799,0.00068432133],"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.0007307039,0.000111695066,0.00051888154,0.00027717414,0.000054328833,0.00036615197,0.0001441147,0.22266002,0.10244873,0.171482,0.006848606,0.49435756],"study_design_scores_gemma":[0.00011445352,0.00013161352,0.00024156627,0.00003653838,0.000026675845,0.0003252645,0.000023496312,0.9208809,0.031093728,0.035054382,0.012043669,0.00002770338],"about_ca_topic_score_codex":0.0015164259,"about_ca_topic_score_gemma":0.0017818139,"teacher_disagreement_score":0.002174546,"about_ca_system_score_codex":0.0006279833,"about_ca_system_score_gemma":0.0007581566,"threshold_uncertainty_score":0.0072746277},"labels":[],"label_agreement":null},{"id":"W2151442132","doi":"10.1109/ciss.2009.5054708","title":"Secrecy capacity region of Gaussian broadcast channel","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":32,"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":"Secrecy; Converse; Computer science; Transmitter; Information-theoretic security; Channel (broadcasting); Gaussian; Coding (social sciences); Additive white Gaussian noise; Topology (electrical circuits); Computer network; Channel capacity; Node (physics); Mathematics; Computer security; Physics; Statistics","score_opus":0.027507745400563624,"score_gpt":0.23298278421140897,"score_spread":0.20547503881084533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151442132","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.1783611,0.005376842,0.7074116,0.0034097347,0.00014648473,0.00016249614,0.0020786654,0.000840861,0.10221226],"genre_scores_gemma":[0.9771633,0.0025994529,0.01436495,0.00027452115,0.00017412475,0.0002512483,0.00047569477,0.000113976515,0.0045826742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761367,0.0006787874,0.000065377804,0.00024981366,0.0007039352,0.00068838673],"domain_scores_gemma":[0.98888946,0.008136204,0.0007661702,0.00050226314,0.0014182926,0.0002876947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022199356,0.0009810022,0.00118085,0.0015617246,0.0011213447,0.0024492736,0.0011626341,0.00085607404,0.0054289615],"category_scores_gemma":[0.0077006076,0.00049276795,0.00073712226,0.0014811455,0.0030173296,0.0026420737,0.0020245991,0.0016187694,0.0010438677],"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.0004232583,0.000054336684,0.0006084466,0.00046054096,0.00009549489,0.0005700208,0.000654419,0.34111807,0.01123252,0.62893444,0.005329634,0.010518771],"study_design_scores_gemma":[0.00005322828,0.000091861795,0.00050423073,0.00015133423,0.00005227233,0.00035500433,0.00020901776,0.6657815,0.0063600596,0.32257706,0.0037848842,0.0000794414],"about_ca_topic_score_codex":0.0033379951,"about_ca_topic_score_gemma":0.0009174817,"teacher_disagreement_score":0.0054289615,"about_ca_system_score_codex":0.0027232505,"about_ca_system_score_gemma":0.00209886,"threshold_uncertainty_score":0.019758642},"labels":[],"label_agreement":null},{"id":"W2156440304","doi":"10.1186/s13640-015-0068-3","title":"Distributed video coding supporting hierarchical GOP structures with transmitted motion vectors","year":2015,"lang":"en","type":"article","venue":"EURASIP Journal on Image and Video Processing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Iran Telecommunication Research Center; National Research Foundation of Korea; National IT Industry Promotion Agency; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Encoder; Computer science; Coding (social sciences); Algorithm; Entropy (arrow of time); Computational complexity theory; Decoding methods; Algorithmic efficiency; Real-time computing; Mathematics; Statistics","score_opus":0.019407028663596792,"score_gpt":0.27749742276784733,"score_spread":0.25809039410425055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156440304","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.049044233,0.0002416082,0.9483024,0.000111387904,0.00004694557,0.000047012913,0.000063688945,0.00051262043,0.0016301177],"genre_scores_gemma":[0.60458004,0.00019537103,0.39207572,0.00009760827,0.000058054615,0.00009000538,0.0002693627,0.000046853595,0.0025869117],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997899,0.000038986374,0.000008929326,0.000042205167,0.00010059413,0.000019411958],"domain_scores_gemma":[0.99967134,0.00008302682,0.000034570454,0.000071622555,0.00011598191,0.000023475588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021501316,0.00044732483,0.000375115,0.0005682874,0.0002873213,0.00029817896,0.0007390583,0.0003416831,0.0008238676],"category_scores_gemma":[0.00072286703,0.00012791874,0.00022560576,0.00048443125,0.00028156015,0.00066450716,0.00048519953,0.0005497152,0.00022027112],"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.0005385733,0.00017079886,0.0013954262,0.0001405662,0.000054663524,0.00035753427,0.00014134088,0.15344852,0.31959414,0.018601816,0.003438074,0.5021186],"study_design_scores_gemma":[0.000047891484,0.0000977469,0.00046652387,0.0000102683025,0.000013585387,0.00013187321,0.00002053176,0.9623755,0.031078035,0.003576238,0.0021659262,0.000015897824],"about_ca_topic_score_codex":0.0028919699,"about_ca_topic_score_gemma":0.004161238,"teacher_disagreement_score":0.0028919699,"about_ca_system_score_codex":0.00046900267,"about_ca_system_score_gemma":0.000622012,"threshold_uncertainty_score":0.005750239},"labels":[],"label_agreement":null},{"id":"W2156492938","doi":"10.1109/bsc.2006.1644580","title":"A Type Covering Lemma and the Excess Distortion Exponent for Coding Memoryless Laplacian Sources","year":2006,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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":"Lemma (botany); Exponent; Mathematics; Lossy compression; Laplace operator; Distortion (music); Coding (social sciences); Discrete mathematics; Upper and lower bounds; Source code; Mathematical analysis; Computer science; Statistics; Bandwidth (computing); Telecommunications","score_opus":0.009866678584584091,"score_gpt":0.21256069407705783,"score_spread":0.20269401549247373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156492938","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.07583677,0.0010581836,0.89668936,0.0011821638,0.00020492951,0.00007143222,0.00022161248,0.00022012772,0.024515394],"genre_scores_gemma":[0.9165572,0.0017708908,0.07182714,0.0008017253,0.00054157194,0.00019339223,0.00023988995,0.00018515773,0.007883039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990723,0.00019184424,0.000059718684,0.00013297117,0.0004268146,0.00011630539],"domain_scores_gemma":[0.9919748,0.0054597487,0.00063266576,0.0007565493,0.0008615889,0.00031472737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016735747,0.0005732709,0.0006866961,0.0015734836,0.0006263222,0.0019393797,0.0008182415,0.0010006536,0.0035995338],"category_scores_gemma":[0.013346393,0.0002809177,0.00071775,0.001004839,0.0021742056,0.0050092908,0.0017405901,0.00222337,0.00051894935],"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.00007728218,0.000018889046,0.00061937136,0.00007620633,0.000016396445,0.00020707678,0.0001234842,0.015177308,0.006559189,0.9587942,0.0015002668,0.016830383],"study_design_scores_gemma":[0.00002879991,0.000108807224,0.0007220593,0.000053186075,0.00002427829,0.0011573664,0.00008609988,0.23690693,0.009717222,0.7453862,0.005743195,0.00006579313],"about_ca_topic_score_codex":0.0002931226,"about_ca_topic_score_gemma":0.00016551415,"teacher_disagreement_score":0.0035995338,"about_ca_system_score_codex":0.0013016379,"about_ca_system_score_gemma":0.00042823315,"threshold_uncertainty_score":0.012041628},"labels":[],"label_agreement":null},{"id":"W2156919496","doi":"10.1109/isit.2003.1228273","title":"A new measure for conditional mutual information and its properties","year":2003,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Infimum and supremum; Mutual information; Measure (data warehouse); Context (archaeology); Key (lock); Computer science; Information theory; Conditional mutual information; Theoretical computer science; Upper and lower bounds; Discrete mathematics; Mathematics; Statistics; Data mining; Artificial intelligence; Computer security","score_opus":0.024212337943863668,"score_gpt":0.21627303795999053,"score_spread":0.19206070001612685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156919496","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.03192664,0.0014803244,0.952466,0.0012702906,0.0001274601,0.00010581636,0.00061826914,0.0003754843,0.011629804],"genre_scores_gemma":[0.80798525,0.002199533,0.1799509,0.0008290733,0.0011120318,0.0009305969,0.0011619909,0.00035976243,0.0054708063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99165666,0.0028919957,0.00053005846,0.0015186124,0.0027696833,0.00063305546],"domain_scores_gemma":[0.9624273,0.026097486,0.003643173,0.003892739,0.0029362815,0.0010029757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075630867,0.0013298367,0.0014742189,0.004929462,0.0013772071,0.0042379233,0.002932795,0.002584604,0.0045383326],"category_scores_gemma":[0.036728263,0.0007556493,0.0015645869,0.0033543187,0.0058034975,0.0115146395,0.0036706934,0.0034227495,0.00093251653],"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.00009090283,0.000041986306,0.0012548581,0.0001775473,0.00008770933,0.00016382434,0.0002578673,0.021055281,0.0023583383,0.9560102,0.0016260402,0.016875554],"study_design_scores_gemma":[0.000031045172,0.00014724744,0.0014085257,0.00009427684,0.00006636494,0.0007273233,0.000084575324,0.2111312,0.0031975093,0.77645785,0.006525037,0.00012900896],"about_ca_topic_score_codex":0.0006131846,"about_ca_topic_score_gemma":0.0003061695,"teacher_disagreement_score":0.0075630867,"about_ca_system_score_codex":0.0023645419,"about_ca_system_score_gemma":0.0011696445,"threshold_uncertainty_score":0.039997876},"labels":[],"label_agreement":null},{"id":"W2156994179","doi":"10.1109/cwit.2007.375720","title":"Source Side Information Can Increase the Joint Source-Channel Coding Error Exponent","year":2007,"lang":"en","type":"article","venue":"","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":"Queen's University","funders":"","keywords":"Exponent; Encoder; Channel (broadcasting); Binary symmetric channel; Computer science; Coding (social sciences); Decoding methods; Binary number; Joint (building); Channel capacity; Algorithm; Side channel attack; Mathematics; Channel code; Statistics; Telecommunications; Cryptography; Engineering; Arithmetic","score_opus":0.02035152491611192,"score_gpt":0.2286364480141017,"score_spread":0.2082849230979898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156994179","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.33562204,0.001938108,0.64781606,0.0010238541,0.00013770303,0.000055784272,0.00012930082,0.00034186777,0.012935223],"genre_scores_gemma":[0.98214865,0.0006522201,0.016092133,0.00006309966,0.0000448235,0.000037699916,0.000027750206,0.000040236242,0.0008934376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987545,0.0005024672,0.00006381788,0.00010813093,0.00035018908,0.00022094585],"domain_scores_gemma":[0.9557039,0.039304737,0.0019317082,0.001505221,0.0013432684,0.00021126977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028267456,0.0014217733,0.00089869736,0.000769781,0.00047562056,0.0011265595,0.0005252851,0.0010868806,0.0016543162],"category_scores_gemma":[0.026660597,0.0004859373,0.00053572364,0.0007308418,0.0017137742,0.0026309032,0.0017426793,0.0017347778,0.00030071754],"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.00044060493,0.00007994535,0.0038143122,0.00027862933,0.00009536521,0.0010892567,0.00041983154,0.7736196,0.02938807,0.16673,0.0010663483,0.02297812],"study_design_scores_gemma":[0.000023901412,0.00012013166,0.00057493494,0.00005445503,0.000049572078,0.0003510862,0.0000632689,0.9441067,0.013681308,0.040403042,0.0005276219,0.00004403901],"about_ca_topic_score_codex":0.00033742923,"about_ca_topic_score_gemma":0.0003683204,"teacher_disagreement_score":0.0028267456,"about_ca_system_score_codex":0.00066514517,"about_ca_system_score_gemma":0.0005197949,"threshold_uncertainty_score":0.014949441},"labels":[],"label_agreement":null},{"id":"W2157463142","doi":"10.1109/isit.2002.1023363","title":"Coding for the Wyner-Ziv problem with turbo-like codes","year":2003,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Turbo code; Computer science; Concatenation (mathematics); Algorithm; Coding (social sciences); Decoding methods; Encoder; Theoretical computer science; Mathematics; Arithmetic; Statistics","score_opus":0.01582211061168708,"score_gpt":0.22890775786997275,"score_spread":0.21308564725828566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157463142","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.012879528,0.0006504539,0.97979546,0.00044654252,0.00008351575,0.00006937195,0.000053392152,0.000089723566,0.0059320317],"genre_scores_gemma":[0.5797986,0.0022556393,0.40881473,0.00041582226,0.00027809566,0.00041978617,0.00030356835,0.00009254239,0.007621235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983772,0.0006252431,0.00010479768,0.00012181846,0.00062560575,0.0001452634],"domain_scores_gemma":[0.9978969,0.0012849774,0.00022400513,0.00031951032,0.00022915789,0.000045456265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002391771,0.00063321233,0.000734282,0.00064260035,0.0006814133,0.0013443674,0.0010009406,0.0014318773,0.0025585785],"category_scores_gemma":[0.007523758,0.00029709982,0.0005387515,0.0009607491,0.0020886988,0.00352004,0.002018259,0.0016768337,0.00062526565],"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.00015372148,0.000023453222,0.00018711283,0.00016691131,0.00002804615,0.00016378649,0.0001752846,0.061851382,0.0058024502,0.88815445,0.0016694164,0.041624],"study_design_scores_gemma":[0.00008968755,0.000115128045,0.000107844215,0.000099169934,0.000023535255,0.00026845816,0.000055090048,0.42443272,0.009835969,0.558432,0.0064887865,0.000051586256],"about_ca_topic_score_codex":0.0007532979,"about_ca_topic_score_gemma":0.0008744548,"teacher_disagreement_score":0.0025585785,"about_ca_system_score_codex":0.0008554865,"about_ca_system_score_gemma":0.0016160781,"threshold_uncertainty_score":0.012649059},"labels":[],"label_agreement":null},{"id":"W2158946869","doi":"10.1109/tcomm.2013.112213.130302","title":"MIMO Broadcast Channel with an Unknown Eavesdropper: Secrecy Degrees of Freedom","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":20,"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 Toronto","funders":"","keywords":"Codebook; Degrees of freedom (physics and chemistry); Secrecy; MIMO; Channel (broadcasting); Artificial noise; Computer science; Linear subspace; Subspace topology; Information-theoretic security; Computer network; Transmitter; Mathematics; Computer security; Algorithm; Artificial intelligence; Physics","score_opus":0.025662316516211533,"score_gpt":0.2507151855061691,"score_spread":0.22505286898995758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158946869","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.14313409,0.001059443,0.84021574,0.0010968938,0.00010014194,0.000049615424,0.00043058212,0.0001505633,0.01376294],"genre_scores_gemma":[0.98030627,0.0010061029,0.013833725,0.0000999435,0.00011683286,0.00006159736,0.00010080693,0.000021306938,0.0044533983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998497,0.0005622754,0.00004024366,0.00017670605,0.0004254193,0.00029831822],"domain_scores_gemma":[0.9940439,0.004117889,0.00071855105,0.00042359374,0.0005470625,0.00014890435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017691002,0.0011257275,0.001383047,0.00055859814,0.0007491419,0.0014617111,0.0008129048,0.0015776024,0.0014723149],"category_scores_gemma":[0.0053719995,0.0005918722,0.0007135899,0.0011065803,0.0030158036,0.002019356,0.0015081255,0.0015137929,0.00038073616],"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.00033010764,0.000058222573,0.0011212126,0.00020738081,0.00007469206,0.0012072026,0.00022353565,0.8079529,0.010337368,0.17129572,0.0012162484,0.0059754336],"study_design_scores_gemma":[0.00005204875,0.00009285207,0.0004259269,0.000019465748,0.000042489253,0.00032530376,0.00009640109,0.96503586,0.0025776988,0.030728443,0.00056876626,0.00003470886],"about_ca_topic_score_codex":0.0027635137,"about_ca_topic_score_gemma":0.0015179623,"teacher_disagreement_score":0.0027635137,"about_ca_system_score_codex":0.0011756631,"about_ca_system_score_gemma":0.0008950104,"threshold_uncertainty_score":0.009355962},"labels":[],"label_agreement":null},{"id":"W2159637183","doi":"10.1109/isit.2009.5205815","title":"The secrecy capacity region of the degraded vector Gaussian broadcast channel","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"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":"MIMO; Computer science; Secrecy; Channel (broadcasting); Superposition principle; Gaussian; Computer network; Topology (electrical circuits); Information-theoretic security; Node (physics); Dirty paper coding; Coding (social sciences); Channel capacity; Telecommunications; Mathematics; Precoding; Computer security; Physics; Statistics","score_opus":0.02463985667516852,"score_gpt":0.22139391253790486,"score_spread":0.19675405586273634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159637183","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.17794462,0.0072357957,0.7096852,0.0039927443,0.00017803036,0.0001332558,0.0018138939,0.00068672595,0.0983297],"genre_scores_gemma":[0.9748317,0.0030643502,0.015844451,0.0003458831,0.00022374249,0.00021719479,0.00044125316,0.0000932749,0.004938239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977653,0.00078113895,0.000057422203,0.0002151749,0.00062978175,0.0005511922],"domain_scores_gemma":[0.98811835,0.00891436,0.00076012017,0.000645369,0.0012666186,0.00029521767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025440631,0.0010043164,0.0010853512,0.0011676052,0.0009250498,0.0022887613,0.0010845393,0.0008782675,0.004729112],"category_scores_gemma":[0.00851782,0.00053189584,0.0006728102,0.0012447359,0.003159474,0.002787831,0.0023794104,0.0018435252,0.00095694873],"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.0006142725,0.00005453538,0.0005393188,0.0004371754,0.000106983236,0.0006537908,0.00057742745,0.4076655,0.009434902,0.56214935,0.0059307707,0.011835978],"study_design_scores_gemma":[0.000058626938,0.00009813615,0.00056491396,0.00015520932,0.000055809367,0.0004160305,0.00018797602,0.67561436,0.0052370885,0.31245214,0.005078885,0.00008082436],"about_ca_topic_score_codex":0.0026544328,"about_ca_topic_score_gemma":0.000736191,"teacher_disagreement_score":0.004729112,"about_ca_system_score_codex":0.002306423,"about_ca_system_score_gemma":0.0016613733,"threshold_uncertainty_score":0.016734302},"labels":[],"label_agreement":null},{"id":"W2163784633","doi":"10.1109/itw.2009.5351249","title":"Broadcasting correlated Gaussian sources with bandwidth expansion","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"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":"Gaussian; Computer science; Coding (social sciences); Algorithm; Bandwidth (computing); Channel (broadcasting); Source code; Topology (electrical circuits); Theoretical computer science; Mathematics; Computer network; Physics; Statistics; Combinatorics","score_opus":0.007559471628939487,"score_gpt":0.20667732366339608,"score_spread":0.1991178520344566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163784633","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.19981676,0.0012315009,0.788155,0.0005226354,0.00012125534,0.000066539775,0.0002037953,0.0003677233,0.009514823],"genre_scores_gemma":[0.96391463,0.000786882,0.02955625,0.00010991202,0.00008441895,0.00006346265,0.00012439174,0.0000326277,0.00532735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925166,0.00023183029,0.000019525278,0.00010528402,0.00025757853,0.0001341673],"domain_scores_gemma":[0.99709785,0.0020296746,0.0003027239,0.00021849804,0.00028518372,0.00006610361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012471842,0.00061834144,0.00068189204,0.00053221965,0.00030056766,0.00082405726,0.0009563262,0.0011026915,0.0015491032],"category_scores_gemma":[0.0037052755,0.00036790367,0.00047563305,0.0010655518,0.0011729191,0.001333384,0.00094614667,0.0007019744,0.00031571096],"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.00040456324,0.00009930173,0.0010070198,0.00016441826,0.00009271462,0.00029440224,0.00023401977,0.825204,0.013743998,0.13023086,0.0010575844,0.027467214],"study_design_scores_gemma":[0.000022799366,0.000045811288,0.00016350001,0.000007977209,0.000023625864,0.00006307269,0.000021217567,0.98954856,0.0015831566,0.008033594,0.00047394252,0.000012728118],"about_ca_topic_score_codex":0.0033706678,"about_ca_topic_score_gemma":0.0024725772,"teacher_disagreement_score":0.0033706678,"about_ca_system_score_codex":0.0012686332,"about_ca_system_score_gemma":0.00078457553,"threshold_uncertainty_score":0.009204686},"labels":[],"label_agreement":null},{"id":"W2163988682","doi":"10.1109/ccece.2009.5090214","title":"DC-guided compression scheme for distributed video coding","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Université Laval","funders":"","keywords":"Encoder; Computer science; Discrete cosine transform; Coding (social sciences); Decoding methods; Algorithm; Data compression; Scheme (mathematics); Computational complexity theory; Transform coding; Bit rate; Block (permutation group theory); Theoretical computer science; Computer hardware; Image (mathematics); Mathematics; Computer vision","score_opus":0.03282111526140187,"score_gpt":0.29538320479544794,"score_spread":0.2625620895340461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163988682","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.01763585,0.0017479819,0.96999836,0.00033462717,0.00024376171,0.00011767037,0.00015197878,0.00052090647,0.009248936],"genre_scores_gemma":[0.4519383,0.0018462853,0.5282586,0.0005960078,0.00029825623,0.00021082062,0.0006367771,0.00007858196,0.01613627],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997986,0.000024727495,0.000007160295,0.000029158764,0.00012535881,0.000014952782],"domain_scores_gemma":[0.9998154,0.000029166818,0.000016503725,0.00004185587,0.0000881412,0.000008923085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001422173,0.00031692753,0.00022527175,0.0005785457,0.00028947173,0.00027277548,0.0005269874,0.0003470767,0.0018724691],"category_scores_gemma":[0.0004417864,0.00007131176,0.00013247077,0.00068613683,0.00025688027,0.000367065,0.00037292074,0.0005571242,0.0006274144],"study_design_candidate":"not_applicable","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.00030265318,0.00008213098,0.0005508881,0.00021632524,0.000032251566,0.00025056908,0.000072907664,0.020678464,0.23706362,0.05835924,0.008993178,0.6733977],"study_design_scores_gemma":[0.00011756745,0.00030079103,0.0012398174,0.000091596994,0.00005637748,0.0019001894,0.00005210396,0.6516631,0.24297011,0.018169584,0.08336685,0.00007191986],"about_ca_topic_score_codex":0.0017265601,"about_ca_topic_score_gemma":0.0027371647,"teacher_disagreement_score":0.0018724691,"about_ca_system_score_codex":0.00042577134,"about_ca_system_score_gemma":0.00044946154,"threshold_uncertainty_score":0.0062640905},"labels":[],"label_agreement":null},{"id":"W2166542733","doi":"10.1109/isit.2006.261609","title":"Successive Coding Strategy in the m-helper Problem","year":2006,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Concordia University","funders":"","keywords":"Encoder; Coding (social sciences); Computer science; Algorithm; Gaussian; Rate distortion; Rate–distortion theory; Decoding methods; Lossy compression; Distributed source coding; Channel code; Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Data compression; Statistics; Physics","score_opus":0.01268759477760932,"score_gpt":0.23902623913901272,"score_spread":0.22633864436140338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166542733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61736333,0.00075854204,0.37119696,0.00048269995,0.00005263734,0.00017320587,0.00011909728,0.00015908884,0.009694437],"genre_scores_gemma":[0.96766627,0.00020086602,0.031081643,0.000042424766,0.000023637744,0.00006207099,0.000059904207,0.000015741221,0.0008474081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986608,0.00071080634,0.000039321203,0.00011278372,0.0002558737,0.00022045747],"domain_scores_gemma":[0.98632634,0.011300501,0.00074906717,0.000595102,0.000650285,0.00037856796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004112335,0.0008967813,0.00091628835,0.0006392085,0.0003750764,0.0007916771,0.0010116816,0.00097353675,0.0015770355],"category_scores_gemma":[0.012045264,0.00018566658,0.00058094686,0.000709161,0.0016315434,0.0011765155,0.0014633908,0.0007328256,0.00014588928],"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.0006060002,0.00012700575,0.00082723086,0.00012524927,0.0000756933,0.0001693272,0.00010446442,0.94007826,0.0030617176,0.038552012,0.00048723654,0.01578579],"study_design_scores_gemma":[0.00009382323,0.00053802057,0.00019255685,0.0000143747075,0.000020625606,0.00010802841,0.000046548434,0.9812696,0.0036839356,0.0138320485,0.0001866122,0.000013838399],"about_ca_topic_score_codex":0.0016888493,"about_ca_topic_score_gemma":0.0008863119,"teacher_disagreement_score":0.004112335,"about_ca_system_score_codex":0.000881227,"about_ca_system_score_gemma":0.001415064,"threshold_uncertainty_score":0.021748364},"labels":[],"label_agreement":null},{"id":"W2168896888","doi":"10.1109/isit.2004.1365384","title":"On the discreteness of the capacity-achieving probability measure of conditional gaussian channels","year":2004,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"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 Toronto","funders":"","keywords":"Measure (data warehouse); Probability mass function; Probability measure; Probability distribution; Mathematics; Bounded function; Channel (broadcasting); Covariance matrix; Conditional probability distribution; Constraint (computer-aided design); Gaussian; Conditional probability; Covariance; Topology (electrical circuits); Computer science; Algorithm; Discrete mathematics; Mathematical analysis; Combinatorics; Statistics; Physics; Telecommunications","score_opus":0.02830993436876642,"score_gpt":0.21788049016566166,"score_spread":0.18957055579689525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168896888","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.101828925,0.0009901727,0.8793226,0.0010029419,0.00007911944,0.00004331114,0.0003457214,0.00016293037,0.016224299],"genre_scores_gemma":[0.94837934,0.0012324445,0.04722531,0.00023676343,0.00026545115,0.00015375402,0.00024524197,0.00006770899,0.0021940037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733317,0.0010591212,0.00011874837,0.0004377715,0.00067628076,0.00037489974],"domain_scores_gemma":[0.9818864,0.014051712,0.0012559613,0.0011777522,0.0010029182,0.000625337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039646137,0.0008485892,0.0009137387,0.0014877369,0.0007823298,0.0024733443,0.0011244232,0.00089159765,0.00234236],"category_scores_gemma":[0.017231436,0.0004341649,0.00068887224,0.0013546841,0.005526384,0.0045064013,0.0020254084,0.0022395432,0.0002666413],"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.00007975807,0.000024272744,0.0002982572,0.00006765559,0.000018335611,0.0000836028,0.00016281464,0.040786736,0.0018299512,0.95140564,0.00051776867,0.004725282],"study_design_scores_gemma":[0.000027934908,0.00009865541,0.00052107644,0.00005797556,0.000018346247,0.00015690259,0.00005686137,0.3352915,0.0023723496,0.66007555,0.0012745761,0.00004829021],"about_ca_topic_score_codex":0.0012520064,"about_ca_topic_score_gemma":0.00047899873,"teacher_disagreement_score":0.0039646137,"about_ca_system_score_codex":0.0019154195,"about_ca_system_score_gemma":0.0011895729,"threshold_uncertainty_score":0.020967126},"labels":[],"label_agreement":null},{"id":"W2169354172","doi":"10.1109/glocom.2013.6831156","title":"Secure OFDM transmission based on multiple relay selection and cooperation","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"Western University","funders":"","keywords":"Relay; Computer network; Computer science; Subcarrier; Orthogonal frequency-division multiplexing; Relay channel; Transmission (telecommunications); Selection (genetic algorithm); Node (physics); Cooperative diversity; Channel (broadcasting); Multiplexing; Fading; Electronic engineering; Telecommunications; Engineering; Power (physics)","score_opus":0.005670832702526604,"score_gpt":0.1928550495690196,"score_spread":0.187184216866493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169354172","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.114458434,0.00065494137,0.8800817,0.00020458917,0.000053029235,0.00006121436,0.000031019295,0.00015441464,0.00430067],"genre_scores_gemma":[0.9643775,0.00033251685,0.034398463,0.000039737526,0.00002418794,0.000049103706,0.000013601398,0.0000057851216,0.0007591972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99911886,0.0003596172,0.000043120785,0.0001144912,0.0002654858,0.00009838671],"domain_scores_gemma":[0.99886143,0.0006002431,0.00020630534,0.00019006825,0.00011095871,0.00003090806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091139367,0.00065212813,0.00056695193,0.0004198996,0.0004986554,0.00048123236,0.0006050394,0.0005671184,0.0005028692],"category_scores_gemma":[0.0017831374,0.00023843869,0.00048536164,0.00053132477,0.0009487998,0.0008831275,0.00093816785,0.00037319638,0.00017853617],"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.000760869,0.00012356383,0.003376012,0.00031848074,0.00020843219,0.0025028288,0.00088375,0.5982422,0.100888945,0.17239165,0.0019886186,0.118314676],"study_design_scores_gemma":[0.000059087153,0.00029071097,0.00040060157,0.000017299757,0.000055845954,0.0008237483,0.000057114605,0.96619326,0.01401773,0.016588481,0.001460057,0.000036039943],"about_ca_topic_score_codex":0.00050914387,"about_ca_topic_score_gemma":0.00045790197,"teacher_disagreement_score":0.00091139367,"about_ca_system_score_codex":0.0004125682,"about_ca_system_score_gemma":0.00041529123,"threshold_uncertainty_score":0.004819989},"labels":[],"label_agreement":null},{"id":"W2171404613","doi":"10.1109/cwit.2013.6621590","title":"An enhanced cross-layer authentication mechanism for wireless communications based on PER and RSSI","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Physical layer; Authentication (law); Spoofing attack; Computer network; Wireless; Wireless network; Network packet; Computer security; Telecommunications","score_opus":0.023457115953581496,"score_gpt":0.3041392626381995,"score_spread":0.280682146684618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171404613","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.030587504,0.00051569054,0.9634199,0.00013159674,0.00016776127,0.00012286301,0.0000677705,0.0036789547,0.0013079399],"genre_scores_gemma":[0.88234943,0.0004454599,0.11385773,0.00021315548,0.00019242986,0.0001216552,0.00017683416,0.00005525941,0.0025881382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752265,0.0004523214,0.00029063754,0.00052670244,0.0010294724,0.00017818886],"domain_scores_gemma":[0.99624,0.000781226,0.00081012305,0.0008790054,0.0012035153,0.000086199114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024807435,0.000744843,0.0009993522,0.00132709,0.00039302028,0.0008895552,0.001399503,0.00079243374,0.00096137135],"category_scores_gemma":[0.0043863645,0.00030530817,0.0006754118,0.0007333415,0.00054361735,0.0020117806,0.0010168605,0.0012253853,0.0008406218],"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.0017467185,0.0005829148,0.0076941345,0.0005617954,0.00033059053,0.0009722064,0.00038949813,0.06346949,0.335015,0.034610435,0.0040427246,0.55058455],"study_design_scores_gemma":[0.000093940886,0.0015136701,0.0057561384,0.000048950107,0.00022815283,0.0019336813,0.000033841396,0.85890067,0.11604885,0.0057491246,0.009544873,0.00014812869],"about_ca_topic_score_codex":0.00039382817,"about_ca_topic_score_gemma":0.00033428942,"teacher_disagreement_score":0.0024807435,"about_ca_system_score_codex":0.0003852098,"about_ca_system_score_gemma":0.0005703143,"threshold_uncertainty_score":0.013119578},"labels":[],"label_agreement":null},{"id":"W2175451653","doi":"10.1109/pacrim.2015.7334844","title":"Secrecy capacity and wireless energy harvesting in amplify-and-forward relay networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"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 British Columbia","funders":"","keywords":"Relay; Jamming; Secrecy; Computer network; Computer science; Wireless; Energy harvesting; Relay channel; Energy (signal processing); Power (physics); Telecommunications; Computer security; Mathematics; Physics","score_opus":0.028301634109962268,"score_gpt":0.2182910036199994,"score_spread":0.18998936951003714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175451653","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.23135173,0.006327941,0.71105486,0.0022803114,0.00014074965,0.0000645373,0.00049572514,0.00030841125,0.047975786],"genre_scores_gemma":[0.9894791,0.0018316199,0.0059306067,0.000069422225,0.000087145,0.00006422692,0.000075594,0.00002803438,0.0024342572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986896,0.00052514253,0.000052264964,0.00011660171,0.0003450419,0.00027141365],"domain_scores_gemma":[0.9896868,0.008093746,0.00080741866,0.00036145965,0.0008949203,0.00015572553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021240807,0.00087002205,0.00081692066,0.0014691505,0.0006926176,0.0018225333,0.0008669457,0.001087015,0.0023760893],"category_scores_gemma":[0.007657261,0.0006550246,0.0005086896,0.0017153682,0.0031225467,0.0025038752,0.0016284937,0.0009975372,0.0004627623],"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.00012261301,0.000046561072,0.0008284533,0.00021137942,0.0000515332,0.00038878882,0.00031769113,0.76037043,0.0068182196,0.2189265,0.0014479007,0.01046992],"study_design_scores_gemma":[0.000009400891,0.00004582841,0.00039581174,0.000044112574,0.000016664073,0.00013390796,0.0000919271,0.90519875,0.0019023294,0.09141531,0.00071199174,0.000034033048],"about_ca_topic_score_codex":0.0023391987,"about_ca_topic_score_gemma":0.0013306963,"teacher_disagreement_score":0.0023760893,"about_ca_system_score_codex":0.001989351,"about_ca_system_score_gemma":0.0010963462,"threshold_uncertainty_score":0.014433801},"labels":[],"label_agreement":null},{"id":"W2176748244","doi":"10.2197/ipsjjip.23.554","title":"A Model for Adversarial Wiretap Channels and its Applications","year":2015,"lang":"en","type":"article","venue":"Journal of Information Processing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Alberta Innovates","keywords":"Computer science; Secrecy; Adversarial system; Adversary; Alice and Bob; Secure communication; Channel (broadcasting); Computer network; Coding (social sciences); Secure coding; Secret sharing; Transmission (telecommunications); Computer security; Theoretical computer science; Cryptography; Telecommunications; Alice (programming language); Encryption; Artificial intelligence; Mathematics; Information security","score_opus":0.040268984927513296,"score_gpt":0.2779475069577659,"score_spread":0.23767852203025258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176748244","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.0068812408,0.00053941057,0.97060454,0.0015350024,0.000103660794,0.0000735253,0.00023331733,0.00013579227,0.019893557],"genre_scores_gemma":[0.7513026,0.0048818043,0.20057118,0.0011388073,0.0007961271,0.0010519687,0.00063375157,0.00021591038,0.039407883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975327,0.0010023363,0.00012910705,0.0003825507,0.0006802701,0.00027291357],"domain_scores_gemma":[0.994783,0.003430556,0.0004965951,0.00068445347,0.0004025817,0.00020274456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019075068,0.0012399537,0.000903681,0.001077367,0.0012373556,0.002393339,0.0026317216,0.0035763087,0.0068908585],"category_scores_gemma":[0.006818838,0.0006143826,0.0011230957,0.0017004755,0.004057757,0.0058264695,0.0028757765,0.005019178,0.0015883732],"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.000017494262,0.000013602293,0.000043366817,0.00003353849,0.0000061295605,0.000093098795,0.00008749951,0.029926034,0.00043093174,0.9663726,0.0010385663,0.0019371929],"study_design_scores_gemma":[0.0000215366,0.000044872988,0.000043263874,0.000039768234,0.000012042942,0.00016665772,0.000050248942,0.30373272,0.0004952098,0.6863922,0.008975656,0.000025828667],"about_ca_topic_score_codex":0.0021320323,"about_ca_topic_score_gemma":0.00088901084,"teacher_disagreement_score":0.0068908585,"about_ca_system_score_codex":0.0021170187,"about_ca_system_score_gemma":0.00122161,"threshold_uncertainty_score":0.023052216},"labels":[],"label_agreement":null},{"id":"W2188354969","doi":"10.22215/etd/2011-08829","title":"Detecting the evil twin attack in a single hop wireless network using four-square antennas","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; Library and Archives Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless network; Square (algebra); Computer science; Wireless; Telecommunications; Mathematics; Geometry","score_opus":0.07017720567430616,"score_gpt":0.284834302938683,"score_spread":0.21465709726437684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188354969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7571552,0.0002460638,0.23793204,0.00033857065,0.000063262305,0.000038560185,0.000036296522,0.00035358078,0.0038364131],"genre_scores_gemma":[0.9721453,0.000110131376,0.025735037,0.000042711305,0.00001367383,0.00001764552,0.000029978166,0.000008997901,0.0018965594],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994281,0.00019314919,0.000025694053,0.00007870482,0.00017250246,0.000101761994],"domain_scores_gemma":[0.9983803,0.0009815199,0.00018708009,0.00017418785,0.00019531643,0.0000816177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004758187,0.00043547052,0.00051920686,0.0005536872,0.0003530845,0.00048162375,0.0004749539,0.0006919694,0.0006528162],"category_scores_gemma":[0.0022217794,0.00027205836,0.0002267098,0.00026668806,0.0004243224,0.0009750512,0.001143003,0.00051825185,0.00022280434],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.005563629,0.0003647544,0.032113086,0.0002557972,0.00043307358,0.002681682,0.0010537804,0.24262342,0.37355453,0.017093332,0.002792003,0.32147086],"study_design_scores_gemma":[0.000052549956,0.00071903045,0.0035510946,0.00001369972,0.000051348114,0.0008693535,0.00024461004,0.9469853,0.04366231,0.0029147102,0.00091179734,0.000024244076],"about_ca_topic_score_codex":0.0003879899,"about_ca_topic_score_gemma":0.0005871531,"teacher_disagreement_score":0.0006919694,"about_ca_system_score_codex":0.00030958463,"about_ca_system_score_gemma":0.00023152013,"threshold_uncertainty_score":0.0025164485},"labels":[],"label_agreement":null},{"id":"W2198098203","doi":"","title":"Secure Downlink Transmission in Massive MIMO System with Zero-Forcing Precoding","year":2014,"lang":"en","type":"article","venue":"European Wireless Conference","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":10,"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 British Columbia","funders":"","keywords":"Precoding; Telecommunications link; Zero-forcing precoding; MIMO; Base station; Path loss; Computer science; Transmission (telecommunications); Artificial noise; Computer network; Electronic engineering; Channel (broadcasting); Telecommunications; Wireless; Transmitter; Engineering","score_opus":0.012187713811306823,"score_gpt":0.20007962138507995,"score_spread":0.18789190757377314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2198098203","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.38848463,0.0014402915,0.59744567,0.00066918414,0.00008321165,0.00006025478,0.0002666549,0.00030503437,0.01124503],"genre_scores_gemma":[0.99323964,0.0004861822,0.005211824,0.000037338345,0.000036137037,0.000020501659,0.000040852596,0.000013577599,0.00091391883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991211,0.00030335668,0.000034664627,0.00007121979,0.00026210453,0.0002075026],"domain_scores_gemma":[0.99643517,0.0021516418,0.0005847444,0.0002582151,0.00047668815,0.0000935227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015666732,0.001035036,0.0009298344,0.0006121303,0.0005483862,0.0012071708,0.0005415125,0.00085430493,0.0010162595],"category_scores_gemma":[0.0046500973,0.00044267654,0.00055696355,0.0007353594,0.0013603236,0.0011367444,0.0012225365,0.0006576502,0.00029067916],"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.00016879597,0.000026604932,0.0014942628,0.000100502715,0.000050165338,0.0005125502,0.00013247623,0.9528848,0.007266801,0.03199243,0.00045269245,0.0049179248],"study_design_scores_gemma":[0.000005156591,0.000031436306,0.00021961101,0.000008467102,0.0000122041665,0.00006438591,0.000024533665,0.9957813,0.001071591,0.002707094,0.00006564297,0.000008614196],"about_ca_topic_score_codex":0.0029072477,"about_ca_topic_score_gemma":0.0017781383,"teacher_disagreement_score":0.0029072477,"about_ca_system_score_codex":0.001281867,"about_ca_system_score_gemma":0.0007762919,"threshold_uncertainty_score":0.009300649},"labels":[],"label_agreement":null},{"id":"W220014954","doi":"10.1109/tit.2019.2942615","title":"On the Compound Broadcast Channel: Multiple Description Coding and Interference Decoding","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","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":"Université de Montréal","funders":"European Commission","keywords":"Decoding methods; Decodes; Encoder; Computer science; Coding (social sciences); Encoding (memory); Channel (broadcasting); Upper and lower bounds; Dirty paper coding; Algorithm; Computer network; Theoretical computer science; Precoding; Mathematics; MIMO; Artificial intelligence","score_opus":0.02810047614797787,"score_gpt":0.2340389823542498,"score_spread":0.20593850620627194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W220014954","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.037290752,0.0011498892,0.94826853,0.000671368,0.00005029433,0.000052249274,0.00018678504,0.00009347855,0.012236744],"genre_scores_gemma":[0.8348975,0.0029608435,0.15289308,0.00027357432,0.00019982625,0.00020350238,0.00037048894,0.00006846849,0.008132735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984181,0.0006591136,0.000048217844,0.00015177029,0.00051383144,0.0002090078],"domain_scores_gemma":[0.99407744,0.004619757,0.00036397084,0.00038925564,0.00047320683,0.00007638897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020128635,0.0007880917,0.00097345514,0.0007671162,0.000576153,0.0014720403,0.000776888,0.001056787,0.0015242274],"category_scores_gemma":[0.006510808,0.0003383542,0.00045649038,0.0013316155,0.0020815074,0.0022982026,0.0014821098,0.0015623374,0.00043522049],"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.00025480246,0.000032389587,0.00042939666,0.00018969706,0.000030598654,0.00034265502,0.00021977014,0.353515,0.0041670958,0.61187077,0.001961742,0.026986077],"study_design_scores_gemma":[0.000017859844,0.000045779056,0.00013507745,0.000027557966,0.000011987742,0.00015314034,0.000036017445,0.8463831,0.0031928802,0.14799444,0.0019758933,0.000026204372],"about_ca_topic_score_codex":0.003076475,"about_ca_topic_score_gemma":0.0014287416,"teacher_disagreement_score":0.003076475,"about_ca_system_score_codex":0.0017790884,"about_ca_system_score_gemma":0.0015263255,"threshold_uncertainty_score":0.01290828},"labels":[],"label_agreement":null},{"id":"W2204421240","doi":"10.1109/milcom.2015.7357456","title":"On physical layer security for cognitive radio networks with primary user interference","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Cognitive radio; Computer network; Computer science; Transmitter; Secrecy; Physical layer; Interference (communication); Channel (broadcasting); Computer security; Telecommunications; Wireless","score_opus":0.025918573129329426,"score_gpt":0.2645687511681297,"score_spread":0.2386501780388003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204421240","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.09697363,0.009206563,0.86586624,0.0016567351,0.00032144698,0.00008028384,0.000072279334,0.000120385695,0.02570247],"genre_scores_gemma":[0.97269833,0.0051681316,0.019424219,0.00023705247,0.0003246665,0.00005753337,0.000021963393,0.000026210444,0.0020417923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782795,0.0008383163,0.00006140864,0.00019699738,0.0005660481,0.00050921424],"domain_scores_gemma":[0.9955071,0.003113224,0.00044219423,0.00030292833,0.0005313729,0.00010308347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021636032,0.001582843,0.0012946047,0.0009549327,0.00105556,0.0024221232,0.00094508496,0.0014654498,0.0014987163],"category_scores_gemma":[0.007597642,0.00041929202,0.0009223418,0.0010937246,0.0027603735,0.0027951314,0.0017986892,0.0016710787,0.00023732732],"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.00017424898,0.00011162149,0.001926481,0.00038609086,0.00014928974,0.00090762007,0.00032119456,0.7613102,0.008862902,0.20136811,0.0016724177,0.022809803],"study_design_scores_gemma":[0.000011475457,0.00010231153,0.00041387358,0.000039852748,0.000041369185,0.0003337541,0.000090723945,0.9613472,0.001293674,0.035431143,0.00086963805,0.000024983276],"about_ca_topic_score_codex":0.0025375094,"about_ca_topic_score_gemma":0.001564292,"teacher_disagreement_score":0.0025375094,"about_ca_system_score_codex":0.0017124187,"about_ca_system_score_gemma":0.0015631774,"threshold_uncertainty_score":0.012424469},"labels":[],"label_agreement":null},{"id":"W2205029453","doi":"10.1016/j.sysconle.2015.09.013","title":"On the tightness of linear policies for stabilization of linear systems over Gaussian networks","year":2015,"lang":"en","type":"article","venue":"Systems & Control Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Linear-quadratic-Gaussian control; Gaussian; Mathematics; Linear system; Logarithm; Scalar (mathematics); Control theory (sociology); Quadratic equation; Gaussian noise; Channel (broadcasting); Channel capacity; Applied mathematics; Mathematical optimization; Computer science; Optimal control; Coding (social sciences); Algorithm; Mathematical analysis; Telecommunications; Statistics","score_opus":0.022659033848535542,"score_gpt":0.24983174028016,"score_spread":0.22717270643162446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2205029453","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.08204945,0.0031615521,0.8954367,0.0029066328,0.00036065897,0.00017257669,0.00028941373,0.00050340645,0.015119575],"genre_scores_gemma":[0.9512521,0.0042996015,0.03435723,0.001036973,0.00046983536,0.0003693501,0.00035336116,0.00033497703,0.007526551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952538,0.0017159581,0.00024192863,0.0009165126,0.0008832823,0.000988552],"domain_scores_gemma":[0.93622106,0.05055921,0.0040241717,0.0020377159,0.0040706634,0.003087176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011417769,0.003103533,0.00432164,0.0027218305,0.0018185134,0.003742852,0.0025154683,0.0026615304,0.00733691],"category_scores_gemma":[0.06382648,0.0016062143,0.0017302791,0.0019942957,0.0067707766,0.0061218846,0.0067643668,0.008144345,0.0005737317],"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.00088271155,0.00020040551,0.0008688399,0.000648178,0.00018231058,0.00016810957,0.00070102094,0.65872175,0.005221125,0.30635625,0.0029890581,0.023060355],"study_design_scores_gemma":[0.000060843835,0.00030475695,0.0005011958,0.00015904359,0.000042344152,0.000030429619,0.00013961509,0.83308864,0.0011460868,0.16361465,0.00086391746,0.000048370668],"about_ca_topic_score_codex":0.0067869616,"about_ca_topic_score_gemma":0.0035762154,"teacher_disagreement_score":0.011417769,"about_ca_system_score_codex":0.004116271,"about_ca_system_score_gemma":0.003761168,"threshold_uncertainty_score":0.060383618},"labels":[],"label_agreement":null},{"id":"W2207433731","doi":"10.1109/itwf.2015.7360789","title":"The capacity of a broadcast channel with Gaussian jamming and a friendly eavesdropper","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Jamming; Computer science; Channel (broadcasting); Gaussian; Computer network; Computer security; Telecommunications; Electronic engineering; Engineering; Physics","score_opus":0.021939854020623935,"score_gpt":0.21970330802822913,"score_spread":0.1977634540076052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2207433731","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.41735187,0.0049814153,0.51030445,0.0027816142,0.00024316045,0.00009415716,0.0017315419,0.00052291754,0.06198886],"genre_scores_gemma":[0.98702776,0.0015663918,0.0071532475,0.00009442061,0.000128318,0.00008966853,0.00020557534,0.000035176305,0.0036993385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990876,0.0002921799,0.000024808607,0.00007241593,0.00024019282,0.0002828342],"domain_scores_gemma":[0.99290437,0.005693847,0.0003909006,0.00023958665,0.00062480156,0.00014643473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012392423,0.00068197167,0.00065151224,0.0012350301,0.00058071903,0.0017707481,0.0008684323,0.0009087619,0.002850846],"category_scores_gemma":[0.006215532,0.00035517188,0.00036982365,0.0011738474,0.0025113798,0.0013912302,0.0012505238,0.0008149485,0.00056860194],"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.0003633672,0.000059020575,0.00074453093,0.00028998381,0.00006172057,0.00057328487,0.00043817124,0.66907924,0.008147279,0.30343103,0.0047778892,0.012034418],"study_design_scores_gemma":[0.000028624165,0.000056706667,0.00052651844,0.000082142324,0.000030846204,0.00020478133,0.0001470608,0.89992553,0.00201744,0.09508409,0.0018380313,0.000058222195],"about_ca_topic_score_codex":0.0046173804,"about_ca_topic_score_gemma":0.0017810804,"teacher_disagreement_score":0.0046173804,"about_ca_system_score_codex":0.0018821672,"about_ca_system_score_gemma":0.0013848844,"threshold_uncertainty_score":0.013656139},"labels":[],"label_agreement":null},{"id":"W2212474043","doi":"10.1109/tit.2017.2710058","title":"The MIMO Wiretap Channel Decomposed","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","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":"University of Toronto","funders":"Qatar National Research Fund; Israel Science Foundation; German-Israeli Foundation for Scientific Research and Development","keywords":"MIMO; Computer science; Channel (broadcasting); Channel capacity; Gaussian; Precoding; Topology (electrical circuits); Secure transmission; Transmission (telecommunications); Dirty paper coding; Coding (social sciences); Multi-user MIMO; Telecommunications; Computer network; Mathematics; Physics; Statistics; Combinatorics","score_opus":0.015344077174099914,"score_gpt":0.2497384821419171,"score_spread":0.2343944049678172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2212474043","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.033087287,0.0012633589,0.92939824,0.001121475,0.00028782967,0.00007661507,0.00042479197,0.00018772818,0.034152664],"genre_scores_gemma":[0.90136915,0.002811778,0.06756172,0.00039510586,0.00040827293,0.00015519829,0.00042580438,0.000053736112,0.026819251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925405,0.00020288116,0.000026748445,0.00014791779,0.00025457534,0.0001137163],"domain_scores_gemma":[0.9987815,0.00063751446,0.00015366472,0.0001693846,0.00021240847,0.000045496472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041981033,0.0004071128,0.0004112927,0.00027677522,0.00045490765,0.0014502358,0.0005305614,0.0010857277,0.004585318],"category_scores_gemma":[0.0021755043,0.00019611345,0.0003190037,0.00066406274,0.00110415,0.0018560976,0.0011013435,0.0014425713,0.00084505696],"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.00017507061,0.000038807106,0.00038326543,0.00026201457,0.00004311767,0.00058358983,0.00020415777,0.119365774,0.013432902,0.82510346,0.0064343335,0.033973567],"study_design_scores_gemma":[0.000034267447,0.00014641254,0.0003411486,0.000055354536,0.000032410368,0.00069890026,0.00016386576,0.64066696,0.014182371,0.32400972,0.019606762,0.00006185636],"about_ca_topic_score_codex":0.00088576815,"about_ca_topic_score_gemma":0.00050691125,"teacher_disagreement_score":0.004585318,"about_ca_system_score_codex":0.00056940346,"about_ca_system_score_gemma":0.0006614027,"threshold_uncertainty_score":0.015339434},"labels":[],"label_agreement":null},{"id":"W2218552649","doi":"10.1109/mcom.2015.7355563","title":"Physical layer security in wireless cooperative relay networks: state of the art and beyond","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":175,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Computer network; Physical layer; PHY; Wireless; Relay; Wireless network; Exploit; Telecommunications; Computer security; Power (physics)","score_opus":0.024604683587843058,"score_gpt":0.27530288895369204,"score_spread":0.25069820536584897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218552649","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010979887,0.73537284,0.20963734,0.0079101315,0.0007135084,0.00007582573,0.000047365804,0.00019695384,0.0350662],"genre_scores_gemma":[0.21497497,0.7189277,0.05639569,0.0015057847,0.0034096483,0.00013869141,0.00008200229,0.000052750576,0.0045128264],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984413,0.00053913094,0.00011007148,0.00018531168,0.0005951333,0.00012912079],"domain_scores_gemma":[0.995581,0.0029509212,0.00031672852,0.00045993936,0.0005950491,0.00009634529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036231086,0.001050602,0.0010312982,0.0011047365,0.0007396991,0.004378396,0.0017783052,0.0027220196,0.0018633434],"category_scores_gemma":[0.00476537,0.00074608834,0.00067710807,0.0016496433,0.0036732403,0.009805732,0.002163377,0.0034441657,0.0009381343],"study_design_candidate":"not_applicable","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.00016085026,0.00018391729,0.0010269016,0.0032826397,0.00009163626,0.00034060364,0.00062445767,0.022528213,0.0069252597,0.3188986,0.007843034,0.6380938],"study_design_scores_gemma":[0.00006062502,0.0010115681,0.0017324347,0.0041749165,0.00018570249,0.0022515254,0.00095283316,0.17305891,0.016042802,0.4858655,0.31433535,0.0003278644],"about_ca_topic_score_codex":0.00063703884,"about_ca_topic_score_gemma":0.00035423078,"teacher_disagreement_score":0.004378396,"about_ca_system_score_codex":0.0010983904,"about_ca_system_score_gemma":0.00090389315,"threshold_uncertainty_score":0.019161105},"labels":[],"label_agreement":null},{"id":"W2218632165","doi":"10.1109/milcom.2015.7357505","title":"Disguised jamming against OFDM transmission through nonlinear amplify-and-forward","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"Western University","funders":"","keywords":"Jamming; Computer science; Orthogonal frequency-division multiplexing; Near-far problem; Electronic engineering; Transmission (telecommunications); Interference (communication); Nonlinear distortion; Synchronization (alternating current); Wireless; Communications system; Distortion (music); Noise (video); Computer network; Channel (broadcasting); Telecommunications; Engineering; Bandwidth (computing); Artificial intelligence","score_opus":0.030350954516718275,"score_gpt":0.2628586830529661,"score_spread":0.23250772853624785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218632165","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.19963454,0.0009164834,0.7914123,0.0003193736,0.0000873989,0.00010462334,0.000034557685,0.000419973,0.0070708427],"genre_scores_gemma":[0.9432865,0.0005560458,0.053501137,0.00009821065,0.000043785425,0.000042550102,0.000020777012,0.000009455897,0.002441589],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968123,0.00005954733,0.00001960414,0.000051489063,0.00014883874,0.000039207403],"domain_scores_gemma":[0.999464,0.00017716095,0.00015651557,0.00006296005,0.00012299701,0.000016374031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032719696,0.00049237354,0.00023828597,0.00039588925,0.00042858906,0.0003468797,0.00049980724,0.00050823303,0.00072886195],"category_scores_gemma":[0.0010089874,0.0001896778,0.00019928456,0.00023136943,0.00053506886,0.0007880432,0.00059518975,0.0004343203,0.00029862876],"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.00058600283,0.000085183536,0.0015122719,0.000448606,0.000090209825,0.0005285614,0.0005781316,0.029920338,0.77463675,0.022986805,0.0007019625,0.1679251],"study_design_scores_gemma":[0.000060355138,0.0009987069,0.00139944,0.00008062942,0.00013644724,0.0016453743,0.0001672434,0.39729962,0.5823077,0.005410541,0.010430816,0.00006313069],"about_ca_topic_score_codex":0.00032831653,"about_ca_topic_score_gemma":0.00050988863,"teacher_disagreement_score":0.00072886195,"about_ca_system_score_codex":0.00024933877,"about_ca_system_score_gemma":0.0002518962,"threshold_uncertainty_score":0.0024383068},"labels":[],"label_agreement":null},{"id":"W2279481688","doi":"10.1109/vtcfall.2015.7391133","title":"Secure Robust Resource Allocation in the Presence of Active Eavesdroppers Using Full-Duplex Receivers","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Jamming; Robustness (evolution); Transmitter; Computer science; Secrecy; Maximization; Transmitter power output; Physical layer; Computer network; Channel state information; Artificial noise; Secure communication; Adversary; Resource allocation; Duplex (building); Channel (broadcasting); Wireless; Computer security; Telecommunications; Mathematical optimization; Mathematics","score_opus":0.05667941359171713,"score_gpt":0.27067066696771747,"score_spread":0.21399125337600033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279481688","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.030160291,0.00018243723,0.96804696,0.00006110037,0.000012919716,0.000013213491,0.000012842275,0.00010328821,0.0014069921],"genre_scores_gemma":[0.9514136,0.00016544465,0.047150873,0.000037733178,0.000024174718,0.00002759013,0.000011860212,0.000016412609,0.0011523284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994061,0.0002166709,0.000025259638,0.00009371105,0.00016966324,0.00008858291],"domain_scores_gemma":[0.9994584,0.00024327087,0.00012847527,0.00008063273,0.00006449092,0.000024861925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009034575,0.00065643445,0.0006238278,0.00027667338,0.0002818107,0.00085436105,0.0007979506,0.00059227116,0.0006445429],"category_scores_gemma":[0.0011716272,0.000268172,0.00041468558,0.00027918242,0.00085807854,0.0009726704,0.00096268946,0.00052056665,0.00021287477],"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.00016464927,0.00004593592,0.0004317081,0.00007479252,0.000073435986,0.00024370117,0.000105681174,0.8893022,0.032191653,0.051050074,0.00042047873,0.025895745],"study_design_scores_gemma":[0.000007806236,0.000049751918,0.000064967804,0.0000028580357,0.000008070818,0.0000378213,0.000010017959,0.99282575,0.0031203676,0.0036099064,0.00025478023,0.000007944425],"about_ca_topic_score_codex":0.00058693375,"about_ca_topic_score_gemma":0.00039560648,"teacher_disagreement_score":0.0009034575,"about_ca_system_score_codex":0.0004193024,"about_ca_system_score_gemma":0.00053096935,"threshold_uncertainty_score":0.004777968},"labels":[],"label_agreement":null},{"id":"W2279672151","doi":"10.1109/isit.2016.7541647","title":"Privacy-aware MMSE estimation","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security 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":"Queen's University","funders":"","keywords":"Predictability; Binary number; Random variable; Constraint (computer-aided design); Minimum mean square error; Mathematics; Channel (broadcasting); Binary symmetric channel; Combinatorics; Computer science; Discrete mathematics; Algorithm; Statistics; Decoding methods; Channel code; Telecommunications; Arithmetic; Geometry","score_opus":0.019121971427368392,"score_gpt":0.2686938253560848,"score_spread":0.24957185392871645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279672151","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.011978586,0.0004403212,0.9844338,0.0007180027,0.0000408512,0.00002758816,0.00023882407,0.00016707448,0.0019549143],"genre_scores_gemma":[0.7794723,0.002225794,0.20751937,0.0006157056,0.00048463995,0.00019658182,0.0009805564,0.00020160456,0.0083035175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967906,0.0013177504,0.00016760206,0.0007134812,0.00065854046,0.00035209605],"domain_scores_gemma":[0.987066,0.009828464,0.00077591656,0.0013364555,0.0008035827,0.00018967329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045019067,0.0014512948,0.0020867824,0.00078399514,0.0006176349,0.0021614754,0.00154144,0.0015399386,0.0023204265],"category_scores_gemma":[0.028134704,0.0009976437,0.000940541,0.0012889256,0.002207916,0.0035962092,0.0027122665,0.002228043,0.0008258951],"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.0003456901,0.000052748932,0.0026398513,0.00030546842,0.00022601268,0.0002822525,0.00017300609,0.8157133,0.00534431,0.12757762,0.002650555,0.04468921],"study_design_scores_gemma":[0.000027465794,0.000087393644,0.0006559301,0.00005071011,0.00004585963,0.00018981531,0.000038970556,0.9174058,0.0040791337,0.07602926,0.0013574109,0.00003232409],"about_ca_topic_score_codex":0.0026837257,"about_ca_topic_score_gemma":0.0018935493,"teacher_disagreement_score":0.0045019067,"about_ca_system_score_codex":0.0012609834,"about_ca_system_score_gemma":0.0024157912,"threshold_uncertainty_score":0.023808658},"labels":[],"label_agreement":null},{"id":"W2281178725","doi":"10.1007/s00453-015-0104-9","title":"Zero-Information Protocols and Unambiguity in Arthur–Merlin Communication","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":18,"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":"Theory of computation; Zero (linguistics); Merlin (protein); Zero-knowledge proof; Computer science; Ground zero; Physics; Philosophy; Algorithm; Biology; Linguistics","score_opus":0.01020371742461373,"score_gpt":0.24572306962393312,"score_spread":0.23551935219931938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281178725","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.24697725,0.004967952,0.5939151,0.017447574,0.00077769003,0.00016483139,0.0002251131,0.00046136102,0.13506316],"genre_scores_gemma":[0.9262913,0.0019408232,0.0437576,0.0011688179,0.00047299245,0.00024800518,0.00012319439,0.00012600128,0.02587136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973666,0.0011649708,0.0001349573,0.00041419244,0.000551662,0.0003676509],"domain_scores_gemma":[0.9902442,0.0072130193,0.00061000156,0.0011871528,0.00042778457,0.00031791386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038665964,0.00093889266,0.0014210255,0.0025894186,0.0037181813,0.0037566307,0.0021158585,0.0031901528,0.005742784],"category_scores_gemma":[0.01532095,0.0007409023,0.001071072,0.002583401,0.009070137,0.01173452,0.005753328,0.006342749,0.00079356116],"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.000023461236,0.000007195413,0.000040617484,0.000013739689,0.0000027668766,0.000015125584,0.00013013271,0.0009250155,0.00011772242,0.9960796,0.000557147,0.0020875337],"study_design_scores_gemma":[0.000011905784,0.000007227472,0.000029537327,0.000011094776,0.0000041799967,0.000022769626,0.000026648662,0.0061747697,0.00019402786,0.9924172,0.0010913694,0.000009340448],"about_ca_topic_score_codex":0.00096087955,"about_ca_topic_score_gemma":0.00084295514,"teacher_disagreement_score":0.005742784,"about_ca_system_score_codex":0.0025424915,"about_ca_system_score_gemma":0.0015718454,"threshold_uncertainty_score":0.020448744},"labels":[],"label_agreement":null},{"id":"W2283332069","doi":"","title":"On Capacity and Bounds for the Gaussian CZIC and CBZIC with Linear Coded Approximation","year":2013,"lang":"en","type":"article","venue":"ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Dalhousie University","funders":"","keywords":"Interference (communication); Gaussian; Channel (broadcasting); Channel capacity; Computer science; Cognitive radio; Extension (predicate logic); Component (thermodynamics); Upper and lower bounds; Mathematics; Topology (electrical circuits); Applied mathematics; Mathematical optimization; Telecommunications; Algorithm; Wireless; Combinatorics; Mathematical analysis; Physics","score_opus":0.014130927871096998,"score_gpt":0.21577053104568553,"score_spread":0.20163960317458854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283332069","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.04123304,0.020260267,0.84693336,0.002856412,0.0003777343,0.00010667785,0.0006315214,0.0004970317,0.08710393],"genre_scores_gemma":[0.8897418,0.016500732,0.07924131,0.0011628342,0.0010074461,0.0005047471,0.00064156833,0.0002863839,0.010913299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598,0.000974436,0.00011777083,0.0004450117,0.001446078,0.0010365676],"domain_scores_gemma":[0.9721657,0.022009341,0.0009742375,0.0011837111,0.0031881628,0.0004788695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004922132,0.0019312174,0.0014526794,0.003043652,0.0011252773,0.0040499386,0.0025363655,0.0016692922,0.005123814],"category_scores_gemma":[0.027993256,0.00064475794,0.0011118593,0.0035563647,0.0050375112,0.005567459,0.0045091035,0.0053389445,0.0009671703],"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.00016264754,0.00006690146,0.00046860924,0.00044064733,0.00006356657,0.00022507779,0.00043870264,0.19698134,0.0023918247,0.76852876,0.0054788403,0.024753097],"study_design_scores_gemma":[0.000026804022,0.00007944345,0.00047757896,0.00044739415,0.00007513088,0.00031861986,0.00020514692,0.6429266,0.0042269393,0.3435098,0.0076039312,0.00010260394],"about_ca_topic_score_codex":0.007134505,"about_ca_topic_score_gemma":0.0034092923,"teacher_disagreement_score":0.007134505,"about_ca_system_score_codex":0.005541394,"about_ca_system_score_gemma":0.0028248793,"threshold_uncertainty_score":0.040205836},"labels":[],"label_agreement":null},{"id":"W2286924897","doi":"10.1017/s1759078715001099","title":"A review of directional modulation technology","year":2015,"lang":"en","type":"review","venue":"International Journal of Microwave and Wireless Technologies","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University","keywords":"Physical layer; Computer science; Key (lock); Wireless; Cryptography; Modulation (music); Computer network; Computer security; Telecommunications; Electronic engineering; Engineering","score_opus":0.03417661417780892,"score_gpt":0.33197266799195924,"score_spread":0.2977960538141503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286924897","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026704947,0.9923792,0.0006067408,0.0005029158,0.0005574639,0.000008498906,0.00004299651,0.0000134289285,0.0056217196],"genre_scores_gemma":[0.0016398189,0.99523443,0.0005694342,0.00025122112,0.00043507534,0.000008972779,0.000051212002,0.000003585976,0.0018062203],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999681,0.000045931556,0.000045833807,0.00005808087,0.00014211066,0.000027087295],"domain_scores_gemma":[0.9994455,0.0002849469,0.00006941877,0.000020680103,0.00014658427,0.000032857468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051120913,0.0008242433,0.0008774461,0.0029081437,0.00038208097,0.0012751932,0.00091839966,0.00093008036,0.0077817584],"category_scores_gemma":[0.0010949017,0.0003187991,0.00048307944,0.0031726859,0.00047559018,0.0019730474,0.0006090474,0.0012184944,0.0038551986],"study_design_candidate":"not_applicable","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.000047675665,0.00009042214,0.00032315304,0.02263114,0.000054318745,0.00031645477,0.00014239189,0.00075287715,0.0031605563,0.023924816,0.055964448,0.8925917],"study_design_scores_gemma":[0.0000026932562,0.000044060645,0.00030995085,0.0021113663,0.000027383483,0.00069103343,0.000046185905,0.00009066145,0.00038228492,0.0026617765,0.9936194,0.000013138877],"about_ca_topic_score_codex":0.0008952522,"about_ca_topic_score_gemma":0.0011554159,"teacher_disagreement_score":0.0077817584,"about_ca_system_score_codex":0.0005872801,"about_ca_system_score_gemma":0.0012571166,"threshold_uncertainty_score":0.026032507},"labels":[],"label_agreement":null},{"id":"W2289922692","doi":"10.1109/glocomw.2015.7414111","title":"Verification of Key Generation from Individual OFDM Subcarrier's Channel Response","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; University College Dublin; Queen's University Belfast; Royal Academy of Engineering; Rice University","keywords":"Subcarrier; Key generation; Orthogonal frequency-division multiplexing; Physical layer; Key (lock); Computer science; Channel (broadcasting); Wireless; Computer network; Electronic engineering; Randomness; Telecommunications; Engineering; Computer security; Encryption","score_opus":0.0779485203860886,"score_gpt":0.2615325726444232,"score_spread":0.1835840522583346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289922692","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.29652515,0.00019919334,0.6973054,0.00024347888,0.000110122266,0.00017769179,0.0001417546,0.000697902,0.00459942],"genre_scores_gemma":[0.95879567,0.00006290099,0.040368147,0.000037353893,0.000015389272,0.000055612672,0.000049782084,0.000038256712,0.00057684083],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982174,0.0005134177,0.0001069664,0.00031069637,0.000672311,0.00017915636],"domain_scores_gemma":[0.99542123,0.002510594,0.00048346515,0.0009928399,0.0004981783,0.00009371577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001578492,0.00029023582,0.00045466013,0.00036385292,0.0005453057,0.00057628896,0.00050795096,0.00056225125,0.001528496],"category_scores_gemma":[0.0064191,0.00017419303,0.00028827426,0.00021771707,0.00094316574,0.0011834917,0.0009566602,0.0007342446,0.00046865272],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0012168536,0.0001891803,0.0053132395,0.0004986946,0.00012411053,0.000915809,0.0008952104,0.054358374,0.7162706,0.12191138,0.00095013797,0.09735626],"study_design_scores_gemma":[0.00010031615,0.0005015674,0.0023237702,0.000035626657,0.00004020009,0.00079911266,0.00013973923,0.3730385,0.60747427,0.011969042,0.0034972378,0.00008063859],"about_ca_topic_score_codex":0.00019899862,"about_ca_topic_score_gemma":0.00012340187,"teacher_disagreement_score":0.001578492,"about_ca_system_score_codex":0.00036287986,"about_ca_system_score_gemma":0.0006623343,"threshold_uncertainty_score":0.008347988},"labels":[],"label_agreement":null},{"id":"W2290880884","doi":"10.1109/wcnc.2015.7127629","title":"Secrecy rate with friendly full-duplex relay","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"McGill University","funders":"","keywords":"Relay; Secrecy; Relay channel; Computer science; Fading; Channel state information; Computer network; Interference (communication); Channel (broadcasting); Power (physics); Wireless; Telecommunications; Computer security; Physics","score_opus":0.019690587254262086,"score_gpt":0.23114264808303026,"score_spread":0.21145206082876816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290880884","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.15410319,0.0013910815,0.82511157,0.00021705085,0.00006370022,0.000049443246,0.00015662194,0.00033347402,0.018573942],"genre_scores_gemma":[0.98064786,0.00051091355,0.017415764,0.00002516833,0.000014754822,0.000020912152,0.000032450036,0.000016161139,0.0013159983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899954,0.0004351102,0.00003948804,0.00013010297,0.00023265474,0.0001630757],"domain_scores_gemma":[0.9981968,0.0010367247,0.00018601751,0.0002629589,0.0002687659,0.00004881189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012419659,0.0008555129,0.00079577236,0.00047923348,0.00036167452,0.0012130348,0.0007717622,0.00068004313,0.0013122832],"category_scores_gemma":[0.002499254,0.00026728117,0.0006578596,0.0006309454,0.0010559905,0.001547813,0.0011341986,0.0005411565,0.00035601124],"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.00030461187,0.00004357968,0.0012140782,0.0001914878,0.00007132022,0.00048651686,0.00013157175,0.8851931,0.019808311,0.06638823,0.0008838938,0.025283275],"study_design_scores_gemma":[0.000014865037,0.00012033545,0.00027558565,0.000013716075,0.000030592168,0.00029961046,0.000038670354,0.9836156,0.008116809,0.006785341,0.00066695834,0.000021901425],"about_ca_topic_score_codex":0.0010384856,"about_ca_topic_score_gemma":0.00054711464,"teacher_disagreement_score":0.0013122832,"about_ca_system_score_codex":0.0009671241,"about_ca_system_score_gemma":0.0007180643,"threshold_uncertainty_score":0.007017076},"labels":[],"label_agreement":null},{"id":"W2290883389","doi":"10.1109/glocom.2015.7417241","title":"Secure MIMO AF Relaying Design: An Intercept Probability Constrained Approach","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Wireless Communication Security 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":"McGill University","funders":"","keywords":"Eavesdropping; MIMO; Artificial noise; Robustness (evolution); Computer science; Channel state information; Secure transmission; Transmission (telecommunications); Interference alignment; Channel (broadcasting); Signal-to-noise ratio (imaging); Precoding; Computer network; Wireless; Mathematical optimization; Transmitter; Mathematics; Telecommunications","score_opus":0.17274338810332737,"score_gpt":0.335392778933646,"score_spread":0.16264939083031862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290883389","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.0048243245,0.00021046918,0.99302447,0.00010635951,0.00001641647,0.0000293393,0.000028095626,0.000060140257,0.0017004025],"genre_scores_gemma":[0.78619224,0.0013846868,0.20816797,0.0001477412,0.00013562125,0.00024559192,0.00009385996,0.00004703781,0.0035853572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991702,0.00024459654,0.000042965163,0.00014837782,0.00033397556,0.000059847633],"domain_scores_gemma":[0.99875855,0.00067031954,0.000257488,0.000100104124,0.00018412422,0.000029483117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010900202,0.0015578365,0.0008568721,0.00059136335,0.0003734749,0.0012151228,0.0009196075,0.0012092942,0.0014656256],"category_scores_gemma":[0.0026194945,0.0005399568,0.00066984724,0.00063699484,0.0007835963,0.0010153087,0.0009298176,0.00091109716,0.0005147858],"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.00005406684,0.000027766142,0.00027089528,0.00010658945,0.000042268515,0.00014268358,0.00007209506,0.9420906,0.008536505,0.023065612,0.00041625966,0.025174575],"study_design_scores_gemma":[0.000011032961,0.00006913669,0.00006321383,0.000008402644,0.000014493441,0.000053911073,0.000008762802,0.992926,0.0017026728,0.004682643,0.0004513835,0.0000084357725],"about_ca_topic_score_codex":0.0015230697,"about_ca_topic_score_gemma":0.0010961994,"teacher_disagreement_score":0.0015578365,"about_ca_system_score_codex":0.0006676637,"about_ca_system_score_gemma":0.0010489818,"threshold_uncertainty_score":0.005764663},"labels":[],"label_agreement":null},{"id":"W2293476944","doi":"10.1049/el.2015.2160","title":"Performance analysis of physical layer security over <i>α</i> – <i>μ</i> fading channel","year":2015,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Fading; Physical layer; Channel (broadcasting); Computer science; Electronic engineering; Computer network; Telecommunications; Engineering; Wireless","score_opus":0.012895161136774016,"score_gpt":0.23778925981728416,"score_spread":0.22489409868051013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293476944","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.33907184,0.0048370496,0.62162346,0.001142343,0.00017535858,0.0001024061,0.00032207425,0.00067690265,0.032048684],"genre_scores_gemma":[0.99361753,0.0010174758,0.004374788,0.00005003169,0.00003680808,0.000019503243,0.000043688673,0.00002087591,0.0008193205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981281,0.0006340598,0.00006641247,0.00019182678,0.00046675856,0.00051283155],"domain_scores_gemma":[0.9950572,0.0027540107,0.0006976051,0.00037403122,0.0009837904,0.00013327111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019091361,0.0013634065,0.0009760802,0.0009677523,0.00078758417,0.0017478623,0.0007138899,0.0008359764,0.0022968482],"category_scores_gemma":[0.005795654,0.00033792932,0.000550678,0.0010716119,0.0017801252,0.0017265872,0.001301685,0.0008315674,0.00040921138],"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.00031980168,0.000039878247,0.0026270768,0.00019756335,0.000096831296,0.00047256323,0.0001606119,0.9188918,0.016904255,0.044500664,0.0012466506,0.014542334],"study_design_scores_gemma":[0.0000058516057,0.00010042664,0.0006490748,0.000022112177,0.000028036136,0.0002304375,0.00005676931,0.99149656,0.0033810604,0.0037242563,0.00028218396,0.000023158651],"about_ca_topic_score_codex":0.0037410834,"about_ca_topic_score_gemma":0.0017213393,"teacher_disagreement_score":0.0037410834,"about_ca_system_score_codex":0.0018128047,"about_ca_system_score_gemma":0.0014065184,"threshold_uncertainty_score":0.013152838},"labels":[],"label_agreement":null},{"id":"W2295129189","doi":"10.1109/isit.2016.7541813","title":"Secure Degrees of Freedom of the Gaussian Diamond-Wiretap Channel","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"Qatar National Research Fund; Qatar Foundation","keywords":"Channel state information; Converse; Computer science; Channel (broadcasting); Relay; Gaussian; Fading; Noise (video); Randomness; Topology (electrical circuits); Telecommunications; Computer network; Wireless; Mathematics; Physics; Artificial intelligence; Statistics; Power (physics)","score_opus":0.018074068866637517,"score_gpt":0.2354848618994076,"score_spread":0.21741079303277008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295129189","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.069806345,0.0003155627,0.9175565,0.0005187858,0.000042072217,0.00003983477,0.00013930512,0.000083209066,0.011498274],"genre_scores_gemma":[0.93864524,0.00053011323,0.05534564,0.00015471154,0.000047857247,0.00012134083,0.00011298577,0.000029304196,0.0050127357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803275,0.0008542981,0.000069036425,0.00022930473,0.0005213805,0.00029328855],"domain_scores_gemma":[0.9965863,0.0022652384,0.0003098348,0.00041491646,0.00030745383,0.00011618628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019253275,0.0006750794,0.0006351319,0.00043114912,0.0005148979,0.0012019331,0.0006670948,0.0008944154,0.002111162],"category_scores_gemma":[0.00511939,0.00033916323,0.00044121823,0.0006621384,0.0026521133,0.002612455,0.0021290043,0.0017089222,0.00037964142],"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.00020031304,0.000024388488,0.00022248439,0.000054387383,0.000019212352,0.00022994756,0.00014242355,0.15105203,0.004530362,0.83465016,0.00072792283,0.008146428],"study_design_scores_gemma":[0.00006012892,0.0001054894,0.00012192637,0.000028762182,0.000010962035,0.00017294429,0.00007734694,0.59008354,0.0030086823,0.40440232,0.0018930244,0.000034924295],"about_ca_topic_score_codex":0.00087222585,"about_ca_topic_score_gemma":0.00067600777,"teacher_disagreement_score":0.002111162,"about_ca_system_score_codex":0.000896589,"about_ca_system_score_gemma":0.00093983364,"threshold_uncertainty_score":0.0101822615},"labels":[],"label_agreement":null},{"id":"W2295830844","doi":"10.1109/spawc.2016.7536826","title":"Physical layer security for massive MIMO systems impaired by phase noise","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":13,"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 British Columbia","funders":"","keywords":"Artificial noise; Precoding; Telecommunications link; Computer science; MIMO; Phase noise; Physical layer; Base station; Transmission (telecommunications); Noise (video); Secrecy; Ergodic theory; Computer network; Beamforming; Electronic engineering; Topology (electrical circuits); Telecommunications; Wireless; Mathematics; Electrical engineering; Engineering; Computer security","score_opus":0.02176428847741266,"score_gpt":0.30092248377963915,"score_spread":0.27915819530222646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295830844","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.37868688,0.001310289,0.61057925,0.000492731,0.00009083393,0.00003299244,0.00007945868,0.00019771165,0.008529804],"genre_scores_gemma":[0.99183273,0.0003688118,0.0071635777,0.000038747632,0.000022158672,0.000009913894,0.0000126926225,0.000007267028,0.0005441663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990115,0.00041515537,0.000035071535,0.000105870015,0.00025568492,0.00017676996],"domain_scores_gemma":[0.99558026,0.0032655317,0.0005016471,0.00034344287,0.0002427412,0.00006633523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014160728,0.0009906169,0.0007820797,0.00031521986,0.0006232466,0.0012310734,0.00037513554,0.0007751554,0.00093383243],"category_scores_gemma":[0.0060504377,0.0003083181,0.00037757328,0.00034718326,0.0014843923,0.0017423433,0.001254919,0.0007291402,0.000256024],"study_design_candidate":"not_applicable","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.00034490894,0.000080750964,0.0033497075,0.00025544275,0.00012806551,0.00071950245,0.00024571922,0.84873784,0.04907519,0.07775831,0.0004012391,0.018903444],"study_design_scores_gemma":[0.00001312737,0.00020231133,0.00058021327,0.000027099022,0.000031092655,0.0002968457,0.000065959895,0.97731334,0.010751599,0.0103040375,0.000396086,0.000018309605],"about_ca_topic_score_codex":0.00044492443,"about_ca_topic_score_gemma":0.00039856418,"teacher_disagreement_score":0.0014160728,"about_ca_system_score_codex":0.00057056744,"about_ca_system_score_gemma":0.00047728576,"threshold_uncertainty_score":0.007488966},"labels":[],"label_agreement":null},{"id":"W2296652344","doi":"10.1109/hicss.2016.713","title":"Securing D2D Wireless Links by Continuous Authenticity with Legitimacy Patterns","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Legitimacy; Wireless; Computer science; Computer security; Measure (data warehouse); Wireless Transport Layer Security; Telecommunications; Wireless network; Wi-Fi array; Data mining; Politics","score_opus":0.0057780449562798795,"score_gpt":0.2008321637427621,"score_spread":0.19505411878648224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296652344","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.35179445,0.00019880755,0.63450074,0.0006710421,0.00007307878,0.00025739142,0.00005612343,0.00042254015,0.012025782],"genre_scores_gemma":[0.9653747,0.000058620528,0.03364399,0.000038781367,0.000023826975,0.00006815695,0.000022337481,0.000014539629,0.00075502647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99238294,0.0036179633,0.00054770854,0.000599055,0.0023652855,0.00048701008],"domain_scores_gemma":[0.9734741,0.010734051,0.0046677957,0.0064554624,0.0036745388,0.0009941433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046475227,0.0007542436,0.00073353964,0.0014289124,0.0014521906,0.0027737366,0.0009634216,0.0010224413,0.0012638223],"category_scores_gemma":[0.033209305,0.00032387525,0.00035951895,0.001393546,0.0027769436,0.004766216,0.0047466075,0.0013988802,0.00046086017],"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.0014802485,0.0007810671,0.045018822,0.00023638213,0.00014424883,0.0006311981,0.0014405898,0.16205935,0.045915637,0.19252512,0.0017980689,0.5479692],"study_design_scores_gemma":[0.00025922194,0.0016873245,0.0093023125,0.00011301566,0.000105598665,0.0013765586,0.00086801447,0.8068768,0.03791382,0.13269703,0.008589956,0.00021039494],"about_ca_topic_score_codex":0.0006126048,"about_ca_topic_score_gemma":0.0005932209,"teacher_disagreement_score":0.0046475227,"about_ca_system_score_codex":0.00090324547,"about_ca_system_score_gemma":0.001259053,"threshold_uncertainty_score":0.02457875},"labels":[],"label_agreement":null},{"id":"W2301554092","doi":"10.1109/isit.2014.6875210","title":"A source-channel separation theorem with application to the source broadcast problem","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"McMaster University","funders":"","keywords":"Converse; Source separation; Mutual fund separation theorem; Separation (statistics); Channel (broadcasting); Computer science; Simple (philosophy); Separation principle; Mathematics; Algorithm; Telecommunications; Physics; Geometry","score_opus":0.005790375793536853,"score_gpt":0.22251763467558958,"score_spread":0.21672725888205271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301554092","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.002166975,0.00020109121,0.99043137,0.0004653704,0.000100767014,0.000050356583,0.00011171318,0.000082807856,0.0063895234],"genre_scores_gemma":[0.39243886,0.0025473996,0.5809426,0.0009490411,0.0013138187,0.00088936504,0.0009570037,0.00038681345,0.019575085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745065,0.00088096625,0.00011448462,0.00046433313,0.0008225275,0.00026710628],"domain_scores_gemma":[0.98836666,0.009430011,0.0005197159,0.0005299411,0.0009256371,0.00022806528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039921133,0.0017672435,0.0013136762,0.0015324601,0.0017402811,0.002526364,0.001492877,0.0018401702,0.009200303],"category_scores_gemma":[0.011480863,0.0007168671,0.0019094679,0.0021053625,0.00305188,0.004278765,0.00470665,0.00674322,0.0025130732],"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.00015004938,0.000115651004,0.00031128517,0.00030073925,0.00008979721,0.00025463576,0.00030220006,0.114026666,0.005455319,0.8317679,0.009912415,0.037313435],"study_design_scores_gemma":[0.00006755288,0.00011397836,0.00020771092,0.00007217995,0.00006174927,0.0004986567,0.00012683377,0.43757012,0.0050443704,0.5468868,0.009287694,0.00006232807],"about_ca_topic_score_codex":0.00109343,"about_ca_topic_score_gemma":0.0007959138,"teacher_disagreement_score":0.009200303,"about_ca_system_score_codex":0.0017241924,"about_ca_system_score_gemma":0.0026351318,"threshold_uncertainty_score":0.03077811},"labels":[],"label_agreement":null},{"id":"W2314565273","doi":"10.1109/twc.2016.2535442","title":"Physical Layer Authentication Enhancement Using Two-Dimensional Channel Quantization","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":141,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; False alarm; Quantization (signal processing); Physical layer; Algorithm; MIMO; Multipath propagation; Channel (broadcasting); Wireless; Test statistic; Spoofing attack; Statistical hypothesis testing; Mathematics; Statistics; Artificial intelligence; Computer network; Telecommunications","score_opus":0.04496404008474349,"score_gpt":0.3044346510291962,"score_spread":0.25947061094445273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2314565273","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.019353565,0.00083931704,0.976442,0.00020748813,0.00021844587,0.00010263221,0.00005484074,0.0007317135,0.002050063],"genre_scores_gemma":[0.7644607,0.0008985094,0.23029156,0.00030169514,0.00015347287,0.000098369426,0.00010839529,0.000024268902,0.003663054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988458,0.00028163486,0.0000977011,0.00016911076,0.00046167898,0.00014397992],"domain_scores_gemma":[0.998672,0.0004492354,0.00017536514,0.0002773181,0.00037708282,0.000049088678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010303825,0.000701132,0.0007867313,0.0006619191,0.0004812454,0.0007180048,0.0007736768,0.0006957189,0.0015580173],"category_scores_gemma":[0.002434118,0.00026833033,0.00039932784,0.000659587,0.0006536788,0.0017144221,0.0014867336,0.0009461449,0.00047812585],"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.0008536016,0.00023775744,0.0019494287,0.00042313323,0.00008563081,0.00045049062,0.00029782215,0.11923253,0.24395764,0.05280851,0.0039779874,0.57572556],"study_design_scores_gemma":[0.000087677014,0.0004189841,0.00091252656,0.000043059466,0.000058323607,0.0007225515,0.00005258386,0.91282004,0.07035893,0.0065341303,0.007893788,0.000097372504],"about_ca_topic_score_codex":0.00060388946,"about_ca_topic_score_gemma":0.0006477303,"teacher_disagreement_score":0.0015580173,"about_ca_system_score_codex":0.00036598145,"about_ca_system_score_gemma":0.0006976966,"threshold_uncertainty_score":0.0054492354},"labels":[],"label_agreement":null},{"id":"W2322120353","doi":"10.1109/milcom.2014.254","title":"Digital RF Memory Jamming on OFDM SISO","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Radar jamming and deception; Jamming; Electronic engineering; Computer science; Interference (communication); Multipath propagation; Repeater (horology); Digital radio frequency memory; Orthogonal frequency-division multiplexing; Engineering; Telecommunications; Radar; Channel (broadcasting); Pulse-Doppler radar","score_opus":0.007977965861968046,"score_gpt":0.20852232867465167,"score_spread":0.20054436281268362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2322120353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8795692,0.0007172712,0.10771327,0.000086521846,0.00006220202,0.000031481653,0.0000242868,0.00019921796,0.011596568],"genre_scores_gemma":[0.9933113,0.00023058464,0.0046156226,0.000025381602,0.000019202043,0.0000069350735,0.000010750701,0.0000061681344,0.0017741966],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998796,0.000029750207,0.0000049977043,0.000012262764,0.000050435956,0.000022944801],"domain_scores_gemma":[0.99966526,0.00020435882,0.000047955215,0.00002613289,0.00004723736,0.000009205039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016273966,0.00023054454,0.00014776658,0.00024079412,0.00014068415,0.00024204608,0.00012964604,0.00019343308,0.0012422729],"category_scores_gemma":[0.0006651642,0.000059468046,0.0001315506,0.00015727557,0.00031898517,0.00026692668,0.00018506826,0.00013350272,0.00016648648],"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.001729152,0.00014236684,0.0065589417,0.00059778814,0.00012182939,0.0015723185,0.00048767973,0.25805795,0.5661036,0.022106191,0.00057183614,0.14195046],"study_design_scores_gemma":[0.00007286029,0.0024887784,0.008359914,0.00007126846,0.00014944759,0.0012569265,0.00023677443,0.67024195,0.30682215,0.003722987,0.006534015,0.00004292682],"about_ca_topic_score_codex":0.0002499941,"about_ca_topic_score_gemma":0.00023724884,"teacher_disagreement_score":0.0012422729,"about_ca_system_score_codex":0.00011937231,"about_ca_system_score_gemma":0.000069421934,"threshold_uncertainty_score":0.0041558146},"labels":[],"label_agreement":null},{"id":"W2330170324","doi":"","title":"Robust Entropy Rate for Uncertain Sources: Applications to Communication and Control Systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Ottawa","funders":"","keywords":"Entropy rate; Joint entropy; Mathematics; Rényi entropy; Maximum entropy thermodynamics; Maximum entropy probability distribution; Min entropy; Shannon's source coding theorem; Entropy (arrow of time); Joint quantum entropy; Information theory; Conditional entropy; Transfer entropy; Statistical physics; Markov process; Entropy power inequality; Applied mathematics; Principle of maximum entropy; Statistics; Physics","score_opus":0.026424623947863952,"score_gpt":0.25578940310151305,"score_spread":0.22936477915364908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2330170324","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.006320067,0.003979707,0.98216516,0.00057281606,0.0001719048,0.000021022755,0.00006762441,0.00009105614,0.0066105444],"genre_scores_gemma":[0.8270923,0.010897281,0.1540283,0.0003266233,0.0016311435,0.00019828424,0.0002525171,0.0001826917,0.005390901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983063,0.0005435362,0.00010417733,0.0002632839,0.00069351116,0.000089353096],"domain_scores_gemma":[0.9954947,0.0030526882,0.0005555214,0.0002977345,0.000507351,0.0000920545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023109787,0.00093577395,0.0009978788,0.0011947533,0.00038368933,0.0016442984,0.0008456325,0.0011656948,0.0016507996],"category_scores_gemma":[0.0079669,0.00031096902,0.0008370816,0.0013108904,0.0020121837,0.0027758016,0.0017008658,0.0018172296,0.00027762252],"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.0000606278,0.000021043583,0.0004103818,0.00027230458,0.00006125711,0.0002606811,0.00016541913,0.3738938,0.0048268107,0.5842108,0.0013156461,0.034501214],"study_design_scores_gemma":[0.0000063589064,0.00006515595,0.0002944792,0.0000638185,0.000016747881,0.00017073813,0.00003444218,0.73016256,0.0020108835,0.26252842,0.004599198,0.00004712611],"about_ca_topic_score_codex":0.0006718004,"about_ca_topic_score_gemma":0.00024720034,"teacher_disagreement_score":0.0023109787,"about_ca_system_score_codex":0.0011588399,"about_ca_system_score_gemma":0.0006154622,"threshold_uncertainty_score":0.012221754},"labels":[],"label_agreement":null},{"id":"W2331758476","doi":"10.1109/tit.2016.2549541","title":"Signaling Over Two-User Parallel Gaussian Interference Channels: Outage Analysis","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security 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":"University of Waterloo","funders":"","keywords":"Interference (communication); Channel (broadcasting); Signal-to-noise ratio (imaging); Algorithm; Topology (electrical circuits); Fading; Decoding methods; Gaussian; Gaussian noise; Random variable; Signal-to-interference-plus-noise ratio; Noise (video); Statistics; Mathematics; Computer science; Physics; Telecommunications; Combinatorics; Artificial intelligence","score_opus":0.011325656484158807,"score_gpt":0.24767207146870363,"score_spread":0.2363464149845448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331758476","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.17191914,0.0020981466,0.8068429,0.0007593069,0.000058363858,0.00006450939,0.00036691286,0.0005169408,0.017373702],"genre_scores_gemma":[0.980587,0.0011946608,0.015905017,0.0000974239,0.00006825039,0.000045650515,0.0001364423,0.000053724856,0.0019117616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846363,0.00042934145,0.000051106945,0.0001202334,0.00056332594,0.0003724565],"domain_scores_gemma":[0.99369216,0.004451822,0.000537151,0.00039006627,0.0007894557,0.00013938159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024189362,0.0010678062,0.0011003227,0.0009916419,0.0006892501,0.0011353808,0.00088993035,0.0008618433,0.002111002],"category_scores_gemma":[0.007980864,0.0003840218,0.0006230892,0.0014506087,0.0017821616,0.0015772382,0.0012393307,0.0011897195,0.00035342513],"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.00007415442,0.00002020458,0.00083195354,0.00006330937,0.000020656866,0.00020946747,0.0000933147,0.95626324,0.0016708799,0.034329414,0.0005787845,0.005844591],"study_design_scores_gemma":[0.0000028654858,0.000011234238,0.00017608635,0.000006248086,0.0000062995823,0.000054560714,0.000016919601,0.9942194,0.00032754915,0.005033041,0.00013860669,0.000007176896],"about_ca_topic_score_codex":0.008061031,"about_ca_topic_score_gemma":0.0040394585,"teacher_disagreement_score":0.008061031,"about_ca_system_score_codex":0.0026516619,"about_ca_system_score_gemma":0.0011538222,"threshold_uncertainty_score":0.019239247},"labels":[],"label_agreement":null},{"id":"W2333118136","doi":"10.1109/lcomm.2016.2549011","title":"Secure Communications in Underlay Cognitive Radio Networks: User Scheduling and Performance Analysis","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eavesdropping; Computer science; Computer network; Underlay; Scheduling (production processes); Cognitive radio; Telecommunications link; Secrecy; Transmitter; Cognitive network; Telecommunications; Signal-to-noise ratio (imaging); Wireless; Computer security; Engineering","score_opus":0.025383898286585622,"score_gpt":0.2679925894506053,"score_spread":0.24260869116401965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2333118136","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.32628086,0.0027190505,0.65729064,0.0006272122,0.000090198606,0.00015265244,0.0002010881,0.000460825,0.012177513],"genre_scores_gemma":[0.98934454,0.000760595,0.00895391,0.000046304853,0.000048641698,0.000040485374,0.000038500846,0.000027565795,0.0007394888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997661,0.0006886197,0.00007903806,0.00022519693,0.00077680004,0.0005692247],"domain_scores_gemma":[0.992246,0.0049251416,0.001042065,0.00063450786,0.00095689675,0.00019537612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027402407,0.0015135615,0.0013934525,0.0010419561,0.0009104212,0.0019334749,0.00097349647,0.0009226926,0.0015131788],"category_scores_gemma":[0.0129108075,0.00039864247,0.00049361156,0.0016998864,0.0015456959,0.0016812491,0.0016427869,0.0010629356,0.00034736618],"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.00035916647,0.00009111132,0.002104959,0.00012625787,0.00007439544,0.00028173806,0.00021868685,0.9175887,0.0078883935,0.046338513,0.0007649795,0.024163058],"study_design_scores_gemma":[0.000010839881,0.00007445784,0.00032486787,0.000011244143,0.000020536765,0.0001074785,0.000044078515,0.98945796,0.0018610032,0.007840613,0.00023401297,0.000012914879],"about_ca_topic_score_codex":0.00602329,"about_ca_topic_score_gemma":0.0042089056,"teacher_disagreement_score":0.00602329,"about_ca_system_score_codex":0.0020423701,"about_ca_system_score_gemma":0.0022080452,"threshold_uncertainty_score":0.01481849},"labels":[],"label_agreement":null},{"id":"W2334908797","doi":"10.1109/mwscas.2014.6908538","title":"Joint noise distribution parameter estimation and LDPC decoding using variational Bayes","year":2014,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Factor graph; Estimation theory; Algorithm; Estimator; Decoding methods; Posterior probability; Joint probability distribution; Bayes' theorem; Low-density parity-check code; Computer science; Mathematics; Applied mathematics; Bayesian probability; Mathematical optimization; Statistics","score_opus":0.02119542647598378,"score_gpt":0.24486573431577863,"score_spread":0.22367030783979486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2334908797","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.0034144726,0.00010604788,0.99584794,0.00009816144,0.000008766106,0.000012043939,0.000021681322,0.00006427733,0.00042656698],"genre_scores_gemma":[0.4526923,0.00068011176,0.54009664,0.00020809266,0.000097489865,0.00015388838,0.00029815716,0.00022858933,0.005544692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988367,0.00050249306,0.000048287726,0.0002360156,0.00028108383,0.00009539567],"domain_scores_gemma":[0.99703974,0.0023337994,0.00018085986,0.00016869539,0.00022549303,0.000051372263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018952894,0.0009812173,0.001375752,0.0007457344,0.0005323252,0.0011743412,0.001342505,0.0012667895,0.0013239861],"category_scores_gemma":[0.0083490405,0.0008825593,0.00084999815,0.0010302352,0.001497339,0.0022067658,0.0013298234,0.0017381718,0.00033837726],"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.000051025723,0.000017743094,0.00046787033,0.00006512542,0.00004410559,0.00008091081,0.00010958011,0.9067349,0.0015379337,0.061928805,0.00046836454,0.028493583],"study_design_scores_gemma":[0.0000042158204,0.0000042937336,0.00003911826,0.000003853252,0.0000036224199,0.000013963869,0.000003969438,0.9829033,0.00035942817,0.016464267,0.00019372598,0.000006167964],"about_ca_topic_score_codex":0.012380892,"about_ca_topic_score_gemma":0.0074859327,"teacher_disagreement_score":0.012380892,"about_ca_system_score_codex":0.0015558901,"about_ca_system_score_gemma":0.0019585926,"threshold_uncertainty_score":0.024617672},"labels":[],"label_agreement":null},{"id":"W2339624507","doi":"10.1109/allerton.2015.7447126","title":"Erasure adversarial wiretap channels","year":2015,"lang":"en","type":"article","venue":"","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":"Code word; Secrecy; Computer science; Erasure; Upper and lower bounds; Adversary; Code (set theory); Channel (broadcasting); Decoding methods; Erasure code; Binary erasure channel; Constant (computer programming); Fraction (chemistry); Theoretical computer science; Algorithm; Computer network; Mathematics; Channel capacity; Computer security","score_opus":0.036393482404075625,"score_gpt":0.23881433206898198,"score_spread":0.20242084966490637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339624507","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.034663294,0.00024772572,0.9517238,0.000558101,0.0000982032,0.000079612364,0.0003934751,0.00042956191,0.011806196],"genre_scores_gemma":[0.9240452,0.00071131886,0.061884794,0.000287597,0.00013007259,0.00031605142,0.00031384992,0.00008965534,0.012221429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799156,0.0006353503,0.000087996865,0.0003074188,0.0005337491,0.00044399584],"domain_scores_gemma":[0.9924114,0.004608801,0.0006274152,0.00155697,0.0005951313,0.00020044562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014031262,0.0009122951,0.0009916235,0.00059625064,0.00082297117,0.0015651567,0.0012683825,0.0015734244,0.003815877],"category_scores_gemma":[0.008262478,0.00046793092,0.00072333973,0.00097321125,0.0022133125,0.0030744516,0.0028686107,0.0025901848,0.00084639713],"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.00048731966,0.00005991119,0.0005161903,0.00016802637,0.000058166963,0.00069145137,0.00025697678,0.28206697,0.011967815,0.6765684,0.0045383438,0.022620358],"study_design_scores_gemma":[0.000035463254,0.000097053686,0.000119153105,0.000039504546,0.000027672804,0.00034350227,0.00005381684,0.84082025,0.008912724,0.14493392,0.004573952,0.00004300255],"about_ca_topic_score_codex":0.00082538417,"about_ca_topic_score_gemma":0.0006579897,"teacher_disagreement_score":0.003815877,"about_ca_system_score_codex":0.00081392797,"about_ca_system_score_gemma":0.0008651979,"threshold_uncertainty_score":0.012765408},"labels":[],"label_agreement":null},{"id":"W2340160310","doi":"10.1109/tvt.2016.2555946","title":"Secure Communication in OFDMA-Based Cognitive Radio Networks: An Incentivized Secondary Network Coexistence Approach","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Eavesdropping; Computer network; Cognitive radio; Base station; Computer science; Orthogonal frequency-division multiple access; Transmission (telecommunications); Frame (networking); Secrecy; Relay; Orthogonal frequency-division multiplexing; Wireless; Telecommunications; Computer security","score_opus":0.011540236763460924,"score_gpt":0.23068899195555487,"score_spread":0.21914875519209395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2340160310","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.045959607,0.00071350625,0.93931997,0.0010268348,0.0001309825,0.00008817952,0.000023462735,0.0001030404,0.012634415],"genre_scores_gemma":[0.96778274,0.00037027037,0.028946467,0.00013229104,0.0001096931,0.00007530028,0.000010236428,0.000014490299,0.0025585864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841917,0.00058161165,0.000048453545,0.00024127743,0.00046183952,0.00024774036],"domain_scores_gemma":[0.99818265,0.00085532735,0.00025056067,0.00022026598,0.00029852107,0.00019262686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016029113,0.0006975683,0.00067164673,0.0005835726,0.0010914656,0.0016831782,0.0017859567,0.0013596999,0.0011523399],"category_scores_gemma":[0.002243188,0.0002927869,0.0006089003,0.00048691448,0.0019047825,0.0019774428,0.002448618,0.0014594232,0.0002388772],"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.00023914337,0.0003373799,0.0012446723,0.0002399355,0.00013322875,0.0011374953,0.0007744548,0.2714463,0.021745943,0.6545176,0.0021694102,0.046014432],"study_design_scores_gemma":[0.000030746556,0.00013176752,0.00018712267,0.000021744265,0.00004144751,0.0002882267,0.000087031076,0.92183185,0.0018034377,0.072114654,0.0034301162,0.000031837815],"about_ca_topic_score_codex":0.0013588779,"about_ca_topic_score_gemma":0.0015006806,"teacher_disagreement_score":0.0017859567,"about_ca_system_score_codex":0.0011649705,"about_ca_system_score_gemma":0.0015192349,"threshold_uncertainty_score":0.008477151},"labels":[],"label_agreement":null},{"id":"W2340757385","doi":"10.1109/allerton.2015.7447177","title":"Achievable sum-rate of the two-user Gaussian interference channel through rate-splitting and successive decoding","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Waterloo","funders":"","keywords":"Decoding methods; Sequential decoding; List decoding; Interference (communication); Computer science; Algorithm; Gaussian; Channel (broadcasting); Joint (building); Coding (social sciences); Mathematics; Telecommunications; Statistics; Concatenated error correction code; Block code; Physics; Engineering","score_opus":0.036514843355300454,"score_gpt":0.27820002952652834,"score_spread":0.2416851861712279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2340757385","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.058301877,0.00090717996,0.92820716,0.00019207728,0.000034133023,0.00005893328,0.000114857896,0.00033562412,0.01184819],"genre_scores_gemma":[0.8980159,0.0009870739,0.099171296,0.00009047233,0.000041789815,0.00013030188,0.00012247596,0.00006625064,0.0013744568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976834,0.00074048457,0.0001157399,0.00025260542,0.00077068264,0.00043705906],"domain_scores_gemma":[0.99522275,0.0031519406,0.0003621477,0.0005692164,0.00058292504,0.000111114074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002677226,0.0019486387,0.0013041557,0.00093645323,0.0007304397,0.0014249722,0.0010911387,0.0008627874,0.0012356185],"category_scores_gemma":[0.0076478533,0.00043347507,0.0009396094,0.0014567204,0.0019037529,0.0018318694,0.0022740532,0.0013471884,0.00049305387],"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.0005297267,0.00012484471,0.0012186734,0.00058626785,0.00017856577,0.00072535506,0.0005543388,0.5849006,0.06321545,0.26287612,0.001396317,0.08369361],"study_design_scores_gemma":[0.000036176665,0.00019776568,0.00033957054,0.00006851639,0.000060852035,0.00067994505,0.000081349695,0.8782138,0.041098557,0.07740523,0.0017582265,0.000059946226],"about_ca_topic_score_codex":0.0008505147,"about_ca_topic_score_gemma":0.0008325434,"teacher_disagreement_score":0.002677226,"about_ca_system_score_codex":0.000827028,"about_ca_system_score_gemma":0.0014824881,"threshold_uncertainty_score":0.014158726},"labels":[],"label_agreement":null},{"id":"W2340757643","doi":"10.1109/allerton.2015.7447185","title":"Delay in cooperative communications: Higher multiplexing gain in Gaussian interference channels with full-duplex transmitters","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Orthogonal frequency-division multiplexing; Cyclic prefix; Computer science; Transmitter; Multiplexing; Channel (broadcasting); Interference (communication); Electronic engineering; Telecommunications; Engineering","score_opus":0.0554611107089544,"score_gpt":0.28142320152383926,"score_spread":0.22596209081488486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2340757643","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.090207584,0.004173647,0.88037634,0.0008275201,0.0001942989,0.000050560953,0.00010964497,0.00014573385,0.023914544],"genre_scores_gemma":[0.94877034,0.002945184,0.043936983,0.00026337412,0.0002981777,0.000081874634,0.000037777747,0.000027260965,0.0036390356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945253,0.0001612732,0.0000152305065,0.00008716714,0.00018842793,0.00009526178],"domain_scores_gemma":[0.99857044,0.00085347873,0.00015971783,0.00012969351,0.00019910635,0.00008742873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010261026,0.000808723,0.00053620077,0.00053755706,0.00065826223,0.0011681959,0.00079218345,0.0007955222,0.0012774683],"category_scores_gemma":[0.0031310592,0.00035323782,0.00031573747,0.0011787612,0.002070156,0.0015640105,0.0013182377,0.0011460213,0.00033417437],"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.00030654785,0.00007890539,0.0006725677,0.00033577144,0.000033478038,0.0006952272,0.0007762509,0.16443302,0.0330181,0.75262415,0.0026405884,0.044385422],"study_design_scores_gemma":[0.00004032811,0.0002727056,0.000541588,0.000057539994,0.000040015646,0.0007033733,0.00020161286,0.68460184,0.008649189,0.29788795,0.0069368705,0.00006695968],"about_ca_topic_score_codex":0.0010987823,"about_ca_topic_score_gemma":0.0011714252,"teacher_disagreement_score":0.0012774683,"about_ca_system_score_codex":0.001270637,"about_ca_system_score_gemma":0.0007890088,"threshold_uncertainty_score":0.00921917},"labels":[],"label_agreement":null},{"id":"W2343701890","doi":"10.1049/iet-com.2015.0876","title":"Optimal power allocation to improve secrecy performance of non‐regenerative cooperative systems using an untrusted relay","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":17,"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 Alberta","funders":"","keywords":"Secrecy; Relay; Computer science; Computer network; Power (physics); Computer security","score_opus":0.026751281704157078,"score_gpt":0.2849738364231965,"score_spread":0.25822255471903943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343701890","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.1791992,0.0006198257,0.81316245,0.00021560151,0.000032840002,0.000043648273,0.000020864503,0.00012653689,0.0065790815],"genre_scores_gemma":[0.98056066,0.00017287984,0.018535249,0.000021888047,0.000009867815,0.000014699565,0.000004578634,0.000007872456,0.00067235396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994311,0.00025486483,0.000025361214,0.00006852206,0.00014699722,0.000073076146],"domain_scores_gemma":[0.9991549,0.00055014965,0.00011449369,0.00007643978,0.00008388633,0.00002016927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008145762,0.00063470413,0.00044288885,0.00022962841,0.00022120644,0.0005741048,0.00046845956,0.0004440717,0.00073009037],"category_scores_gemma":[0.0019746546,0.00024747037,0.0002611186,0.0003534644,0.00083272986,0.00060700206,0.0006501671,0.00040807208,0.00015872427],"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.00019493955,0.000066209315,0.00043455826,0.00010377498,0.000054767414,0.00012813474,0.00018825986,0.9064634,0.043049365,0.024350233,0.00028959336,0.024676735],"study_design_scores_gemma":[0.000027078691,0.00015852015,0.00024239373,0.000008598661,0.000023178116,0.00006270266,0.00003396571,0.98028827,0.013223086,0.005531428,0.00038835983,0.000012387706],"about_ca_topic_score_codex":0.00050713384,"about_ca_topic_score_gemma":0.00061169115,"teacher_disagreement_score":0.0008145762,"about_ca_system_score_codex":0.0004845559,"about_ca_system_score_gemma":0.000504414,"threshold_uncertainty_score":0.0043079257},"labels":[],"label_agreement":null},{"id":"W2344696675","doi":"10.1109/lcomm.2016.2558145","title":"The Gaussian Diamond-Wiretap Channel with Conferencing Relays","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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 Toronto","funders":"","keywords":"Confidentiality; Computer science; Computer network; Channel (broadcasting); Computer security; Teleconference; Gaussian; Degrees of freedom (physics and chemistry); Internet privacy; Telecommunications; Physics","score_opus":0.021851700120953246,"score_gpt":0.231995442580198,"score_spread":0.21014374245924475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344696675","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.22408813,0.00142293,0.7429686,0.0012690754,0.0002669494,0.00009092809,0.0006513869,0.0002350744,0.029006984],"genre_scores_gemma":[0.9774302,0.00075264147,0.015880432,0.00012391346,0.000072433955,0.000056453166,0.0001252006,0.000014798942,0.0055439305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867344,0.00040024015,0.00003289665,0.00016601077,0.0002899897,0.0004374573],"domain_scores_gemma":[0.99696773,0.0017462327,0.00032030695,0.00028946679,0.0005073921,0.000168974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014587367,0.0008819733,0.0011029416,0.0006365818,0.00070689485,0.001249479,0.0011268889,0.0016104362,0.0023688087],"category_scores_gemma":[0.003970001,0.00039317677,0.00047938403,0.0012402117,0.0020763227,0.0022472003,0.0015932787,0.0014091234,0.00045593962],"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.0006133167,0.00006084089,0.00080152403,0.00018240165,0.000057208606,0.0018742299,0.00017815101,0.40231907,0.005201502,0.5763301,0.0031749965,0.009206593],"study_design_scores_gemma":[0.00007635468,0.00010711547,0.00021410073,0.000020155692,0.000027182292,0.00033335533,0.00009733211,0.92112845,0.0011734617,0.07523952,0.0015304147,0.0000525454],"about_ca_topic_score_codex":0.0053160666,"about_ca_topic_score_gemma":0.0037108106,"teacher_disagreement_score":0.0053160666,"about_ca_system_score_codex":0.0014297304,"about_ca_system_score_gemma":0.0014096858,"threshold_uncertainty_score":0.010570288},"labels":[],"label_agreement":null},{"id":"W2358248302","doi":"10.1109/tifs.2016.2566446","title":"Delay-Aware Optimization of Physical Layer Security in Multi-Hop Wireless Body Area Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Physical layer; Computer network; Wireless sensor network; Network topology; Nash equilibrium; Topology (electrical circuits); Node (physics); Distributed computing; Wireless; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.012678307871622668,"score_gpt":0.2320039779186135,"score_spread":0.21932567004699083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2358248302","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.102719314,0.0006071327,0.89313275,0.00030902596,0.000057967238,0.000047178655,0.000031384872,0.00006220774,0.00303305],"genre_scores_gemma":[0.9688062,0.00030352912,0.02917457,0.00003055757,0.000022006414,0.000035794346,0.000014219525,0.000019858475,0.0015932093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993523,0.00028680795,0.000018735662,0.0000867959,0.00014487444,0.00011052392],"domain_scores_gemma":[0.9984011,0.001125227,0.00019643872,0.000064034546,0.00013423913,0.000079024314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014875656,0.0009471867,0.0006966448,0.0004711681,0.00041106812,0.0009841997,0.0008951387,0.00091687916,0.00077431666],"category_scores_gemma":[0.0032006982,0.00044915723,0.00031853237,0.00050337566,0.0012966229,0.0013336773,0.0011374203,0.00064719864,0.00010899352],"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.000032406148,0.000016187265,0.0001887412,0.000019285158,0.000010329316,0.000029370392,0.000019263116,0.9893405,0.001173775,0.004902099,0.00007844154,0.004189602],"study_design_scores_gemma":[0.000005654832,0.000039343573,0.000071883595,0.0000023904593,0.000004294374,0.000013584824,0.000012619002,0.9965585,0.00040570894,0.0027727636,0.00010958294,0.00000371068],"about_ca_topic_score_codex":0.0014687637,"about_ca_topic_score_gemma":0.001515238,"teacher_disagreement_score":0.0014875656,"about_ca_system_score_codex":0.0010190489,"about_ca_system_score_gemma":0.0011113205,"threshold_uncertainty_score":0.007867098},"labels":[],"label_agreement":null},{"id":"W2398767638","doi":"","title":"Rate-adaptive Secure HARQ Protocol for Block-Fading Channels","year":2014,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Fading; Channel state information; Transmitter; Rayleigh fading; Hybrid automatic repeat request; Computer network; Throughput; Secrecy; Link adaptation; Channel (broadcasting); Jamming; Block (permutation group theory); Code rate; Secure communication; Decoding methods; Telecommunications link; Wireless; Computer security; Telecommunications; Mathematics","score_opus":0.022186811387937568,"score_gpt":0.2581137868626792,"score_spread":0.23592697547474165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398767638","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.04695011,0.00107313,0.94274443,0.0011591811,0.00029873388,0.00021536105,0.00023685698,0.0005521462,0.0067699067],"genre_scores_gemma":[0.92103165,0.001019873,0.06895058,0.00040491467,0.0002680913,0.00027839732,0.00021337686,0.0000642114,0.0077689616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847263,0.00044850836,0.000072523086,0.00015274042,0.00056854205,0.00028507187],"domain_scores_gemma":[0.9954797,0.002358266,0.00035743107,0.00084240385,0.00084215,0.00011995734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023320632,0.00066473294,0.0008364939,0.00059553876,0.000727105,0.0011226106,0.0010367853,0.00085195724,0.002458474],"category_scores_gemma":[0.0054000835,0.0003634412,0.00029509494,0.0007283381,0.000955807,0.0012794408,0.0024383871,0.0014155923,0.000713471],"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.0016217105,0.0002569632,0.001598535,0.0005325031,0.00022804512,0.0010196571,0.00077739795,0.37587693,0.12524472,0.29420242,0.011541631,0.18709947],"study_design_scores_gemma":[0.00012601218,0.00025578975,0.00041721662,0.000033153352,0.00006286447,0.00041172424,0.00009217015,0.91357446,0.012450895,0.06793398,0.0045805485,0.00006132067],"about_ca_topic_score_codex":0.00067779404,"about_ca_topic_score_gemma":0.00074664096,"teacher_disagreement_score":0.002458474,"about_ca_system_score_codex":0.0006398756,"about_ca_system_score_gemma":0.0011991005,"threshold_uncertainty_score":0.012333274},"labels":[],"label_agreement":null},{"id":"W2399530416","doi":"10.1109/icassp.2016.7472327","title":"Energy efficient beamforming for secure communication in cognitive radio networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Concordia University","funders":"","keywords":"Beamforming; Computer science; Cognitive radio; Mathematical optimization; Efficient energy use; Quality of service; Base station; Transmitter power output; Underlay; Optimization problem; Iterative method; Artificial noise; Channel (broadcasting); Signal-to-noise ratio (imaging); Physical layer; Algorithm; Wireless; Mathematics; Computer network; Telecommunications; Transmitter; Engineering","score_opus":0.012659092832321599,"score_gpt":0.24414129349027963,"score_spread":0.23148220065795802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399530416","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.010227052,0.00058042316,0.9866117,0.00015277397,0.000035211142,0.0000108228405,0.000010877995,0.000037815615,0.002333345],"genre_scores_gemma":[0.82485086,0.0028040416,0.16805689,0.00016811522,0.00012769934,0.00010358464,0.000041452055,0.00004646848,0.0038008902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999608,0.00014818666,0.000013066401,0.000044346623,0.00014040913,0.00004598746],"domain_scores_gemma":[0.9996118,0.00027557975,0.000035415233,0.00002107412,0.000046394885,0.000009846712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005488529,0.00077222753,0.00045652364,0.0003103855,0.00030026233,0.00062030763,0.0002985832,0.00053379004,0.0009213064],"category_scores_gemma":[0.0012746492,0.00022439903,0.00029436324,0.000644299,0.00077117374,0.0010036377,0.0005960768,0.0006055806,0.00026568005],"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.000091712354,0.000036857175,0.00036950843,0.00013411226,0.000034641715,0.00012591257,0.00010279135,0.79470724,0.02276024,0.12153622,0.0011235129,0.058977257],"study_design_scores_gemma":[0.0000062073223,0.000036555914,0.00006694613,0.00000782903,0.0000068990744,0.00003148415,0.000018843986,0.9831844,0.0019276836,0.013942105,0.00076350034,0.0000074790178],"about_ca_topic_score_codex":0.0008264848,"about_ca_topic_score_gemma":0.00088888756,"teacher_disagreement_score":0.0009213064,"about_ca_system_score_codex":0.00048777222,"about_ca_system_score_gemma":0.00049121474,"threshold_uncertainty_score":0.0035390854},"labels":[],"label_agreement":null},{"id":"W2402414467","doi":"10.1007/978-3-319-25645-0_28","title":"New Message Authentication Code Based on APN Functions and Stream Ciphers","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"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 Waterloo","funders":"","keywords":"Computer science; Message authentication code; Code (set theory); Authentication (law); Data Authentication Algorithm; Stream cipher attack; CBC-MAC; Stream cipher; Bounded function; Authentication protocol; Computer network; Theoretical computer science; Computer security; Cryptography; Programming language; Mathematics","score_opus":0.023151834648561607,"score_gpt":0.2530836571570288,"score_spread":0.2299318225084672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402414467","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.025035461,0.0022144485,0.94526726,0.00035804938,0.0015129257,0.00027637705,0.0001671822,0.0034129277,0.021755299],"genre_scores_gemma":[0.4163269,0.0021909429,0.5111137,0.00070149155,0.0010034885,0.00073277147,0.0007814644,0.0007933661,0.06635592],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99923265,0.00013125158,0.00006895561,0.00011884208,0.00035829167,0.00008996982],"domain_scores_gemma":[0.99902344,0.00022055877,0.00009953505,0.00020695466,0.00039613745,0.000053370182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006089227,0.0008368185,0.00077360385,0.0013547726,0.0007433872,0.001080322,0.0008498819,0.00097259774,0.004904102],"category_scores_gemma":[0.0015475655,0.00031875778,0.00055857573,0.0008950278,0.0008790814,0.0024183607,0.0011825574,0.0019418944,0.0027296203],"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.0014081971,0.00020248027,0.00063023745,0.0007569498,0.000086832035,0.0006921029,0.00027406838,0.010865416,0.17243649,0.30334342,0.017729066,0.4915748],"study_design_scores_gemma":[0.00031278186,0.0012550016,0.0017198967,0.00038244555,0.00024317206,0.004934467,0.00007478261,0.29869592,0.32202893,0.09512794,0.2749461,0.00027864348],"about_ca_topic_score_codex":0.0003084386,"about_ca_topic_score_gemma":0.00028411677,"teacher_disagreement_score":0.004904102,"about_ca_system_score_codex":0.0006888782,"about_ca_system_score_gemma":0.000936982,"threshold_uncertainty_score":0.01640582},"labels":[],"label_agreement":null},{"id":"W2405665546","doi":"10.4086/toc.2018.v014a020","title":"","year":2018,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Environment and Climate Change Canada; National Science Foundation","keywords":"Computer science; Mathematics; Combinatorics","score_opus":0.014508259151787866,"score_gpt":0.24930232802088315,"score_spread":0.2347940688690953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405665546","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05015436,0.0019818323,0.5684106,0.010344927,0.00082001544,0.00019221139,0.0021216709,0.002048959,0.3639254],"genre_scores_gemma":[0.71665794,0.001968786,0.20936002,0.0031840522,0.00031525426,0.0003404235,0.0013770778,0.000660513,0.06613596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948525,0.000093930634,0.00001978702,0.0000895479,0.00016153707,0.00014987787],"domain_scores_gemma":[0.9990989,0.00043305967,0.00007466978,0.00016162147,0.00013615421,0.00009568534],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037011376,0.00055005244,0.0004249502,0.0011491741,0.0014905072,0.001673844,0.0008966151,0.0013950114,0.022611378],"category_scores_gemma":[0.0023153806,0.000175034,0.0007533438,0.0009828368,0.0013034001,0.0023641933,0.0015148722,0.0017415042,0.0047457605],"study_design_candidate":"not_applicable","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.00010263804,0.00004039954,0.0002896112,0.00015414557,0.0000140535085,0.0004848211,0.00007774482,0.0034931044,0.00376262,0.9505333,0.017891042,0.023156475],"study_design_scores_gemma":[0.000027404558,0.000044073735,0.00046846905,0.000043441367,0.00002240358,0.0011050996,0.000075498596,0.028058851,0.0055098613,0.88657933,0.07803175,0.000033799177],"about_ca_topic_score_codex":0.0016383623,"about_ca_topic_score_gemma":0.0015899062,"teacher_disagreement_score":0.9773886,"about_ca_system_score_codex":0.0012166139,"about_ca_system_score_gemma":0.00049790094,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2439302226","doi":"10.1109/iwcit.2016.7491616","title":"Rate-splitting and successive decoding for Gaussian interference channels","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Decoding methods; Sequential decoding; List decoding; Interference (communication); Joint (building); Gaussian; Mathematics; Algorithm; Coding (social sciences); Computer science; Single antenna interference cancellation; Channel (broadcasting); Telecommunications; Concatenated error correction code; Statistics; Block code; Physics","score_opus":0.022028485666035852,"score_gpt":0.26322015113583946,"score_spread":0.2411916654698036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2439302226","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.040126245,0.0012093206,0.9516546,0.00016140909,0.000035396224,0.000035666762,0.000036571997,0.00014609781,0.0065947156],"genre_scores_gemma":[0.88660246,0.0016592703,0.109119646,0.00010160778,0.000070427974,0.00008111036,0.00005459126,0.00004888104,0.0022620263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986286,0.00053618505,0.00006164623,0.0001275015,0.00045179584,0.00019426811],"domain_scores_gemma":[0.9973918,0.001750825,0.00022767685,0.00027408724,0.00030442685,0.000051193616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017901405,0.0010098125,0.0006373009,0.00058239215,0.00046683563,0.0008228057,0.00056572305,0.00052583386,0.0010757056],"category_scores_gemma":[0.005150047,0.00029915734,0.0006061306,0.0008604968,0.0017248129,0.0014653417,0.0010625239,0.0010977089,0.0003212558],"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.0003227564,0.00006152569,0.0006944723,0.00027445087,0.00008658691,0.00037527335,0.00064404565,0.46180046,0.034792904,0.42359936,0.0010573413,0.07629082],"study_design_scores_gemma":[0.00002130173,0.0001467633,0.00019205413,0.00002887153,0.000027656095,0.0003642712,0.00005218708,0.91497344,0.013732612,0.06836511,0.002059507,0.000036322515],"about_ca_topic_score_codex":0.0013643067,"about_ca_topic_score_gemma":0.0010686157,"teacher_disagreement_score":0.0017901405,"about_ca_system_score_codex":0.00080134254,"about_ca_system_score_gemma":0.0010105222,"threshold_uncertainty_score":0.009467244},"labels":[],"label_agreement":null},{"id":"W2461678157","doi":"10.1007/978-3-319-49175-2_7","title":"Detecting Algebraic Manipulation in Leaky Storage Systems","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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 Calgary","funders":"","keywords":"Code word; Adversary; Code (set theory); Upper and lower bounds; Algebraic number; Binary logarithm; Discrete mathematics; Computer science; Mathematics; Combinatorics; Algorithm; Decoding methods; Computer security","score_opus":0.019638891446530308,"score_gpt":0.23647081967447642,"score_spread":0.2168319282279461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2461678157","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.270329,0.0010573,0.71200633,0.0010551163,0.0002512563,0.0001507573,0.00040850148,0.0060042827,0.008737437],"genre_scores_gemma":[0.91510874,0.00032401842,0.07984319,0.00016567647,0.00010437689,0.000058447877,0.0002966872,0.00029041237,0.0038083754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99543035,0.00068836886,0.00034336722,0.0006435877,0.002360732,0.00053352653],"domain_scores_gemma":[0.9879903,0.00615166,0.0013547405,0.0029873298,0.0012899118,0.00022592941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014643715,0.00075121224,0.0010597277,0.0011613657,0.0010632651,0.0028178697,0.0015097298,0.001670868,0.0032620386],"category_scores_gemma":[0.015436187,0.00082813326,0.00073676126,0.0012691765,0.002661358,0.0070331558,0.0055824607,0.0026091225,0.0007900632],"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.0018844724,0.00027726765,0.014515593,0.0010613876,0.0002588711,0.001436397,0.0020632006,0.08970577,0.09212391,0.46449924,0.013911572,0.3182623],"study_design_scores_gemma":[0.00008236443,0.00031977726,0.0017801231,0.000149778,0.00008755999,0.0012027698,0.0004685933,0.4104906,0.119067386,0.45743278,0.0087912455,0.00012703738],"about_ca_topic_score_codex":0.0004917045,"about_ca_topic_score_gemma":0.0005288064,"teacher_disagreement_score":0.0032620386,"about_ca_system_score_codex":0.00090354064,"about_ca_system_score_gemma":0.0009061819,"threshold_uncertainty_score":0.010912597},"labels":[],"label_agreement":null},{"id":"W2467251259","doi":"10.1109/tit.2017.2692215","title":"Optimal Zero Delay Coding of Markov Sources: Stationary and Finite Memory Codes","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Mathematics; Markov process; Aperiodic graph; Markov model; Mathematical optimization; Applied mathematics; Combinatorics; Statistics","score_opus":0.014241607280895673,"score_gpt":0.24529759658405986,"score_spread":0.23105598930316418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467251259","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.10027222,0.00083656283,0.8908925,0.00067509897,0.000079688274,0.00004151803,0.00018699237,0.00015383464,0.0068616136],"genre_scores_gemma":[0.9597643,0.0007154806,0.035241947,0.00009073676,0.00006125701,0.00006194971,0.00014340322,0.00004076123,0.003880147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991667,0.00019513111,0.0000410811,0.00018649912,0.0002079235,0.00020254677],"domain_scores_gemma":[0.9950477,0.0035665166,0.0006406781,0.0001916101,0.00041810246,0.00013545726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012542808,0.0008103981,0.00080697244,0.0006677859,0.00053219026,0.0013471756,0.001069219,0.000895439,0.0016249152],"category_scores_gemma":[0.0068300203,0.00042020532,0.000502106,0.0008943293,0.0021590395,0.001752049,0.0013421848,0.0014275081,0.00024655493],"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.00023111152,0.00003229217,0.00042005113,0.00010706294,0.000021834872,0.00013847498,0.00015476828,0.72417283,0.0035435515,0.25190648,0.0007581354,0.018513419],"study_design_scores_gemma":[0.000017502352,0.000030909003,0.000077875855,0.000022478458,0.000008848393,0.000025397982,0.000024405768,0.9348795,0.001832881,0.062738076,0.0003238729,0.000018185252],"about_ca_topic_score_codex":0.006754401,"about_ca_topic_score_gemma":0.0036717607,"teacher_disagreement_score":0.006754401,"about_ca_system_score_codex":0.0022987484,"about_ca_system_score_gemma":0.0023998201,"threshold_uncertainty_score":0.016678631},"labels":[],"label_agreement":null},{"id":"W2468432040","doi":"10.1109/tcomm.2016.2582873","title":"Source-Interference Recovery Over Broadcast Channels: Asymptotic Bounds and Analog Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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":"Upper and lower bounds; Encoder; Algorithm; Gaussian; Mathematics; Fading; Decoding methods; Dirty paper coding; Distortion (music); Computer science; Topology (electrical circuits); Telecommunications; Channel (broadcasting); Precoding; MIMO; Statistics; Bandwidth (computing); Combinatorics","score_opus":0.024505061057995353,"score_gpt":0.2561437748499788,"score_spread":0.23163871379198345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2468432040","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.022854943,0.0018022212,0.96515614,0.00036500272,0.000033290642,0.000027518303,0.000055491728,0.00014696337,0.009558422],"genre_scores_gemma":[0.89944154,0.0027953861,0.0932484,0.00018328211,0.00013796912,0.00012938894,0.00015140219,0.0000803841,0.0038322294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873954,0.00033306872,0.00003686223,0.0001047207,0.0006430251,0.00014276337],"domain_scores_gemma":[0.9920557,0.0063627,0.00047598392,0.00035810738,0.00063619745,0.00011121976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024043212,0.0011077198,0.0008542642,0.0010247441,0.00044971803,0.0015618578,0.0010621683,0.0010810173,0.0020555838],"category_scores_gemma":[0.016516702,0.00033498363,0.00043910852,0.0012834747,0.002026708,0.002662172,0.002487076,0.0016630033,0.00030504633],"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.00012346043,0.00004483773,0.0006249267,0.00023674796,0.000045618934,0.00012372422,0.00016357971,0.8235338,0.0031488598,0.13850644,0.00081787515,0.032630112],"study_design_scores_gemma":[0.000005845312,0.000023318342,0.00007462595,0.000021918615,0.000008943391,0.000048979226,0.000027110567,0.97183686,0.0011730024,0.026456725,0.00031473037,0.000007964444],"about_ca_topic_score_codex":0.0022913641,"about_ca_topic_score_gemma":0.0012795446,"teacher_disagreement_score":0.0024043212,"about_ca_system_score_codex":0.0019620415,"about_ca_system_score_gemma":0.0010389413,"threshold_uncertainty_score":0.014235616},"labels":[],"label_agreement":null},{"id":"W2471662310","doi":"10.1109/vtcspring.2016.7504462","title":"Secrecy Enhancement via Cooperative Relays in Multi-Hop Communication Systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Secrecy; Computer science; Artificial noise; Channel state information; Transmitter; Hop (telecommunications); Computer network; Transmitter power output; Wireless; Interference (communication); Relay; Power (physics); Channel (broadcasting); Telecommunications; Computer security","score_opus":0.02580559771008496,"score_gpt":0.2673582418126619,"score_spread":0.24155264410257693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2471662310","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.07800238,0.0019229454,0.9129641,0.00025132083,0.00006083043,0.000031241474,0.000032221196,0.00027033567,0.0064646387],"genre_scores_gemma":[0.9754353,0.0008241788,0.022806054,0.000031095744,0.00003852764,0.000017864159,0.000012983977,0.000012882492,0.00082104356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922335,0.0003392678,0.000034652112,0.00010281672,0.00019575185,0.00010414682],"domain_scores_gemma":[0.9989274,0.00062226714,0.00012049442,0.00014015706,0.00015619554,0.000033341945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010236636,0.00096917234,0.000828912,0.0005773371,0.0004949048,0.0008282883,0.00072361523,0.00071008416,0.00057638483],"category_scores_gemma":[0.0019064723,0.00029939733,0.00048410764,0.0007226074,0.0010012849,0.0011866948,0.0012550444,0.0005113198,0.0002219006],"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.00021024386,0.000048459075,0.0007710257,0.00023740828,0.00013287546,0.000734059,0.00040817668,0.83797455,0.036657304,0.07573498,0.00074928766,0.046341605],"study_design_scores_gemma":[0.000017178747,0.00015595737,0.00014602144,0.000016488591,0.00005516862,0.00022244705,0.00004421064,0.9746227,0.009635688,0.013404531,0.0016538824,0.000025660978],"about_ca_topic_score_codex":0.0007633396,"about_ca_topic_score_gemma":0.0006499268,"teacher_disagreement_score":0.0010236636,"about_ca_system_score_codex":0.0005212901,"about_ca_system_score_gemma":0.00044078188,"threshold_uncertainty_score":0.005413711},"labels":[],"label_agreement":null},{"id":"W2485062826","doi":"10.1109/icc.2016.7510895","title":"Energy efficient optimization for physical layer security in cognitive relay networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Relay; Mathematical optimization; Computer science; Underlay; Physical layer; Maximization; Optimization problem; Secure transmission; Efficient energy use; Transmission (telecommunications); Cognitive radio; Interference (communication); Transmitter power output; Wireless; Power (physics); Signal-to-noise ratio (imaging); Mathematics; Computer network; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.013145676389524621,"score_gpt":0.25570681261677963,"score_spread":0.242561136227255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2485062826","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.025530476,0.0006460972,0.96794015,0.00033091582,0.000034487035,0.000027870874,0.00003153946,0.00005499158,0.005403536],"genre_scores_gemma":[0.91413635,0.0009986999,0.08054301,0.000113432405,0.000059981623,0.000108058906,0.00004575223,0.0000486292,0.003946128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993888,0.0002823857,0.00001843201,0.00007084043,0.00016105788,0.00007838607],"domain_scores_gemma":[0.9994708,0.0003749654,0.00004985502,0.000034168137,0.000054921074,0.00001537459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012106604,0.0009785253,0.00070459663,0.00043688584,0.00033210745,0.0011583092,0.00060402276,0.0007966954,0.0010288993],"category_scores_gemma":[0.0021034142,0.00035259285,0.00042201058,0.00073054305,0.0012084731,0.0012149127,0.0010494711,0.00080860045,0.00017312996],"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.000052822874,0.000026859316,0.00016021791,0.00006232567,0.000021916481,0.00005813365,0.00004305849,0.9379162,0.002327625,0.046656698,0.00053891714,0.012135175],"study_design_scores_gemma":[0.000006320225,0.000018204306,0.00004999979,0.000004224307,0.0000037369289,0.000014084448,0.0000103835955,0.9884,0.0004628026,0.010744399,0.00028197464,0.0000038564926],"about_ca_topic_score_codex":0.0015859967,"about_ca_topic_score_gemma":0.0013270968,"teacher_disagreement_score":0.0015859967,"about_ca_system_score_codex":0.0011690736,"about_ca_system_score_gemma":0.0010354227,"threshold_uncertainty_score":0.008482218},"labels":[],"label_agreement":null},{"id":"W2487967768","doi":"10.1109/icc.2016.7511625","title":"A novel nonlinear secure transmission design for MU-MISO systems with limited feedback","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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 British Columbia","funders":"","keywords":"Precoding; Channel state information; Transmitter; Zero-forcing precoding; Computer science; Ergodic theory; Artificial noise; Beamforming; Telecommunications link; Secure transmission; Transmission (telecommunications); Channel (broadcasting); Nonlinear system; Control theory (sociology); Topology (electrical circuits); Secure communication; Robustness (evolution); MIMO; Wireless; Computer network; Mathematics; Telecommunications; Encryption; Artificial intelligence","score_opus":0.028229608422809145,"score_gpt":0.2331965800444408,"score_spread":0.20496697162163166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487967768","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.026886545,0.00045467,0.96708095,0.00022285587,0.00004272765,0.000067005356,0.00003663022,0.000077208504,0.005131427],"genre_scores_gemma":[0.9082074,0.00083335064,0.08525118,0.00012285114,0.0000803919,0.00014096024,0.00004071302,0.000023790808,0.0052992464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996692,0.0001052505,0.0000137186225,0.00005197295,0.00012861061,0.000031348587],"domain_scores_gemma":[0.9995552,0.00017936293,0.00010195046,0.000033598928,0.000110874505,0.000019001307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005388254,0.0007973995,0.00043747097,0.00025124187,0.00039222796,0.00062044064,0.00066729385,0.00057109114,0.001795867],"category_scores_gemma":[0.0011734571,0.0002680299,0.00029291588,0.00029135615,0.00068066723,0.00073312456,0.0006104451,0.00050129346,0.0004355614],"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.0002523186,0.00010584941,0.0014202503,0.0006090243,0.000108478765,0.0006026268,0.0005987203,0.744878,0.08341346,0.08469261,0.0020217982,0.08129692],"study_design_scores_gemma":[0.000013913655,0.0001337658,0.00013472048,0.000012439631,0.000017202943,0.000110350215,0.000025781783,0.991176,0.0039828084,0.003561026,0.00081892,0.000013036757],"about_ca_topic_score_codex":0.0010485696,"about_ca_topic_score_gemma":0.0014226313,"teacher_disagreement_score":0.001795867,"about_ca_system_score_codex":0.00065360963,"about_ca_system_score_gemma":0.0005725425,"threshold_uncertainty_score":0.006007731},"labels":[],"label_agreement":null},{"id":"W2507273085","doi":"10.1109/spawc.2016.7536825","title":"Experimental study on channel reciprocity in wireless key generation","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Queen's University; University College Dublin; Queen's University Belfast; Royal Academy of Engineering; Rice University","keywords":"Wireless; Computer science; Multipath propagation; Fading; Channel (broadcasting); Coherence bandwidth; Key (lock); Electronic engineering; Delay spread; Computer network; Telecommunications; Engineering; Computer security","score_opus":0.04517197777435501,"score_gpt":0.2852378999677431,"score_spread":0.24006592219338813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507273085","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9666744,0.00026822474,0.028906884,0.0001593518,0.0000749607,0.000089638714,0.0001362153,0.000093985014,0.0035964272],"genre_scores_gemma":[0.99265975,0.00013593043,0.006548849,0.000032881428,0.000018186283,0.00007168799,0.000084831394,0.000018279832,0.0004295444],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99770796,0.0007547573,0.0001472069,0.00037591672,0.0006474441,0.0003665984],"domain_scores_gemma":[0.99113363,0.0054807877,0.000962451,0.0012393115,0.0010080923,0.00017580317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002104899,0.00050582143,0.00035463864,0.00036030792,0.0006750022,0.0004736687,0.00080931734,0.000608091,0.0028415853],"category_scores_gemma":[0.0077403304,0.00033039486,0.00024449165,0.00043068785,0.0017237788,0.0014357269,0.0012059065,0.00085809076,0.00035207425],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0012112936,0.00092183665,0.005728352,0.00041349937,0.00007091168,0.0006525054,0.00068790815,0.009700565,0.95048475,0.013448585,0.0006021139,0.016077738],"study_design_scores_gemma":[0.000263385,0.006411378,0.010333367,0.00005980494,0.00008598616,0.0010264717,0.0007066577,0.07063043,0.9000041,0.0068913954,0.0034578925,0.00012916254],"about_ca_topic_score_codex":0.00020915155,"about_ca_topic_score_gemma":0.0001913313,"teacher_disagreement_score":0.0028415853,"about_ca_system_score_codex":0.00027090783,"about_ca_system_score_gemma":0.00034894524,"threshold_uncertainty_score":0.011131883},"labels":[],"label_agreement":null},{"id":"W2508771649","doi":"10.1007/978-3-319-49175-2_13","title":"Almost Perfect Privacy for Additive Gaussian Privacy Filters","year":2016,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mutual information; Random variable; Gaussian; Mathematics; Information theory; Distribution (mathematics); Private information retrieval; Interpretation (philosophy); Variable (mathematics); Combinatorics; Discrete mathematics; Computer science; Statistics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.019534786693188252,"score_gpt":0.27954265046021504,"score_spread":0.2600078637670268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508771649","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.04024794,0.0007889268,0.94079775,0.0023464647,0.0001433991,0.00004827677,0.00048680307,0.00042022395,0.014720214],"genre_scores_gemma":[0.92422,0.0012117337,0.059666485,0.0013640176,0.0005279646,0.00015601797,0.00046906897,0.00014771638,0.012237083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907122,0.0026231636,0.00039243366,0.0015882686,0.00299719,0.001686672],"domain_scores_gemma":[0.9799447,0.013511452,0.001158962,0.003469505,0.0013000573,0.00061525544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052895043,0.0016353038,0.0020299929,0.0012043363,0.0012089607,0.0051605753,0.0021161141,0.0030849795,0.004617532],"category_scores_gemma":[0.025751233,0.0012621862,0.0014824232,0.0018796963,0.00428521,0.0068740346,0.0057744565,0.005018373,0.0011076434],"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.00047963395,0.000090307585,0.0006713315,0.00018914802,0.0001297507,0.00023514836,0.0002388318,0.101283796,0.0039396803,0.8626981,0.0035210662,0.026523123],"study_design_scores_gemma":[0.000048568585,0.00006466483,0.0002737323,0.000043973825,0.000043863583,0.00018420049,0.00004456564,0.23330495,0.00216573,0.76226735,0.0015237015,0.000034656092],"about_ca_topic_score_codex":0.0011692669,"about_ca_topic_score_gemma":0.0010192672,"teacher_disagreement_score":0.0052895043,"about_ca_system_score_codex":0.0026589711,"about_ca_system_score_gemma":0.0027699354,"threshold_uncertainty_score":0.02797395},"labels":[],"label_agreement":null},{"id":"W2508924641","doi":"10.1109/isit.2016.7541548","title":"Helper-assisted state cancelation for multiple access channels","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"","keywords":"Channel (broadcasting); Gaussian; Computer science; State (computer science); Boundary (topology); Topology (electrical circuits); Channel capacity; Sequence (biology); Computer network; Algorithm; Mathematics; Combinatorics; Physics; Mathematical analysis","score_opus":0.04544860140953949,"score_gpt":0.2933353560044334,"score_spread":0.2478867545948939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508924641","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.034796312,0.0014379971,0.95660776,0.0001849418,0.000056893958,0.000034426972,0.00005035567,0.00032077974,0.0065104207],"genre_scores_gemma":[0.93924093,0.0012549846,0.05616844,0.00011363253,0.000106391555,0.00008163814,0.00006790267,0.00006850236,0.002897603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981857,0.0006363432,0.000038019396,0.00017004808,0.0006595788,0.0003102829],"domain_scores_gemma":[0.98825604,0.009017785,0.0006543048,0.00074195286,0.0011406055,0.0001892836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002184122,0.0011442929,0.00085702894,0.00072795054,0.0007415677,0.001508168,0.00080540945,0.0007448447,0.0016067728],"category_scores_gemma":[0.010733664,0.0004515822,0.00046692303,0.00065725355,0.0021636342,0.0018457656,0.001748484,0.0012670392,0.00037210877],"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.0004924767,0.000097858654,0.00097164605,0.00034158435,0.00009882295,0.0004053495,0.00049160665,0.67790544,0.022610705,0.24298678,0.0021448338,0.05145292],"study_design_scores_gemma":[0.000014447825,0.00007531191,0.00013153885,0.000018074858,0.000018831803,0.00008777255,0.000030327477,0.9689426,0.00520867,0.024389584,0.0010560572,0.000026859641],"about_ca_topic_score_codex":0.0027942625,"about_ca_topic_score_gemma":0.0023539495,"teacher_disagreement_score":0.0027942625,"about_ca_system_score_codex":0.0012627406,"about_ca_system_score_gemma":0.0014624706,"threshold_uncertainty_score":0.011550903},"labels":[],"label_agreement":null},{"id":"W2509597920","doi":"10.1109/isit.2016.7541427","title":"When is noisy state information at the encoder as useless as no information or as good as noise-free state?","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"McMaster University","funders":"","keywords":"Encoder; Mutual information; State (computer science); Computer science; Noise (video); Channel (broadcasting); Information theory; Binary number; Decoding methods; Binary symmetric channel; State information; Noise measurement; Channel capacity; Algorithm; Artificial intelligence; Mathematics; Noise reduction; Telecommunications; Arithmetic; Statistics","score_opus":0.008217975559925884,"score_gpt":0.22710637126738664,"score_spread":0.21888839570746077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509597920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5378522,0.010517997,0.26348245,0.06348148,0.0020085878,0.0001417453,0.0020520976,0.0006344135,0.11982896],"genre_scores_gemma":[0.989599,0.001381065,0.0050981883,0.00097399583,0.00053495343,0.00004178377,0.0001246396,0.00006478569,0.0021815381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962657,0.001412108,0.00023567046,0.00073283334,0.0007710023,0.0005826754],"domain_scores_gemma":[0.9783466,0.015235471,0.0023629563,0.0017592249,0.0014740195,0.00082163326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050535356,0.00041127036,0.0012469253,0.0014084445,0.0010352811,0.0052067097,0.0010646867,0.003668678,0.0029882835],"category_scores_gemma":[0.031186001,0.000488916,0.0005098663,0.0010842377,0.008813829,0.012285033,0.0012385921,0.0017730682,0.00057696056],"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.0009553491,0.000103048595,0.007945716,0.0006326166,0.00020808686,0.0006410449,0.0010073412,0.015919246,0.0059111924,0.904043,0.0088450825,0.053788286],"study_design_scores_gemma":[0.000039633716,0.000085439104,0.00399734,0.00015706969,0.00008126264,0.00046405167,0.0014633903,0.030779514,0.0047996948,0.95316404,0.0048514004,0.00011716571],"about_ca_topic_score_codex":0.0011934891,"about_ca_topic_score_gemma":0.0011138906,"teacher_disagreement_score":0.0052067097,"about_ca_system_score_codex":0.002186244,"about_ca_system_score_gemma":0.00096151925,"threshold_uncertainty_score":0.026725948},"labels":[],"label_agreement":null},{"id":"W2513682746","doi":"10.1109/isit.2016.7541307","title":"To feedback or not to feedback","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Channel (broadcasting); Channel capacity; Interference (communication); Computer science; Transmission (telecommunications); Transmission channel; Upper and lower bounds; Control theory (sociology); Topology (electrical circuits); Mathematics; Telecommunications; Combinatorics; Artificial intelligence","score_opus":0.027037579143198834,"score_gpt":0.2788366863998788,"score_spread":0.25179910725668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513682746","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31809714,0.0014903245,0.5577079,0.005285713,0.0010150083,0.0002538754,0.0012613318,0.0011304866,0.113758184],"genre_scores_gemma":[0.98154014,0.0002736281,0.010711565,0.000507835,0.00012070339,0.000093925395,0.00008131837,0.000047231628,0.006623642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857414,0.00040299754,0.000043738775,0.00034819884,0.00023745131,0.00039352998],"domain_scores_gemma":[0.9938386,0.003796436,0.0006379379,0.0009679258,0.0005140615,0.00024503662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013929058,0.00073375716,0.00053381594,0.00034365806,0.00085591245,0.0014192909,0.001044766,0.0012903793,0.008864272],"category_scores_gemma":[0.009353411,0.0002625996,0.0005078195,0.00038295833,0.0014796976,0.0025796695,0.0011611776,0.0010741476,0.0012210971],"study_design_candidate":"not_applicable","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.002297083,0.0004346509,0.007264826,0.0005810589,0.00020610633,0.0009970382,0.0009448297,0.18258679,0.035350386,0.636728,0.012740933,0.1198683],"study_design_scores_gemma":[0.00024181113,0.0006913642,0.0019473411,0.00019369274,0.00017761893,0.0007199569,0.000568109,0.4789955,0.018225458,0.47698292,0.021113113,0.00014311458],"about_ca_topic_score_codex":0.001432594,"about_ca_topic_score_gemma":0.0014567779,"teacher_disagreement_score":0.008864272,"about_ca_system_score_codex":0.0007239373,"about_ca_system_score_gemma":0.0011113035,"threshold_uncertainty_score":0.029653966},"labels":[],"label_agreement":null},{"id":"W2514702254","doi":"10.1109/iscas.2016.7539148","title":"A study on compression rate bounds in distributed video coding based on correlation noise models","year":2016,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Discrete cosine transform; Decoding methods; Distributed source coding; Correlation coefficient; Computer science; Data compression; Coding (social sciences); Algorithm; Context-adaptive binary arithmetic coding; Upper and lower bounds; Coding tree unit; Correlation; Data compression ratio; Noise (video); Mathematics; Speech recognition; Image compression; Artificial intelligence; Statistics; Variable-length code; Image processing; Mathematical analysis","score_opus":0.032655138114188624,"score_gpt":0.269510801480666,"score_spread":0.23685566336647734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514702254","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.032684714,0.0046713757,0.94896406,0.0010512791,0.000099708486,0.000058852755,0.000075389195,0.0002296288,0.012165002],"genre_scores_gemma":[0.9082711,0.0067807427,0.0775182,0.00060248724,0.00037531476,0.00029018082,0.00022001013,0.0003576318,0.005584473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962225,0.0014929525,0.00010027946,0.00039284703,0.0012855538,0.00050583656],"domain_scores_gemma":[0.9604791,0.03371387,0.001601916,0.0013802336,0.0024548615,0.0003700355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060702707,0.0022003883,0.0016257461,0.0015303966,0.00077076827,0.0023021519,0.001811135,0.0019367621,0.0023121103],"category_scores_gemma":[0.03846689,0.0007035888,0.0011148991,0.001281651,0.0024219598,0.0045860205,0.0021877436,0.003870279,0.0003388649],"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.0002136805,0.00008157304,0.000735627,0.0002817061,0.000078980775,0.00033232052,0.00019749517,0.8182183,0.008678959,0.15291788,0.0014176256,0.016845878],"study_design_scores_gemma":[0.0000069832336,0.00005788286,0.0001531715,0.000055024277,0.00002386284,0.00011268863,0.000030747833,0.9805623,0.0025311229,0.015986683,0.00045761323,0.000021736667],"about_ca_topic_score_codex":0.0030805876,"about_ca_topic_score_gemma":0.0015691896,"teacher_disagreement_score":0.0060702707,"about_ca_system_score_codex":0.0028869554,"about_ca_system_score_gemma":0.0015382408,"threshold_uncertainty_score":0.03210306},"labels":[],"label_agreement":null},{"id":"W2516026999","doi":"10.1109/mcom.2016.7537191","title":"Physical layer security issues in interference- alignment-based wireless networks","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":150,"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 British Columbia; Carleton University","funders":"","keywords":"Eavesdropping; Physical layer; Jamming; Computer science; Interference (communication); Computer network; Wireless; Computer security; Scheme (mathematics); Wireless network; Key (lock); Telecommunications; Channel (broadcasting)","score_opus":0.026748012581992827,"score_gpt":0.29148667265276956,"score_spread":0.26473866007077673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516026999","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.050863355,0.025024142,0.89789593,0.005069286,0.0004758605,0.00012063326,0.000042366697,0.0002954226,0.020213062],"genre_scores_gemma":[0.8861086,0.018788269,0.08798221,0.00088997534,0.0006525947,0.00014305409,0.000039166815,0.00003547837,0.005360739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987503,0.00049948075,0.00010437426,0.00013848061,0.00035680833,0.00015042168],"domain_scores_gemma":[0.99734455,0.0016531016,0.00038167415,0.00028836445,0.0002827832,0.00004968832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002027115,0.00076719845,0.00055917475,0.0007181892,0.0013029744,0.0033257613,0.00072054815,0.001547984,0.0012272227],"category_scores_gemma":[0.0039043021,0.00056570064,0.00045810302,0.0010155516,0.0023898103,0.004838333,0.0015171198,0.0020893905,0.0003517694],"study_design_candidate":"not_applicable","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.00031189976,0.00014811556,0.0034361954,0.0010831603,0.00015338231,0.0021518846,0.0015390343,0.13190712,0.04611069,0.61034846,0.0057311505,0.19707882],"study_design_scores_gemma":[0.000042559346,0.0005739685,0.0019083647,0.000405252,0.00016389127,0.0034813762,0.0012583783,0.542152,0.036078375,0.36787438,0.045913298,0.0001480818],"about_ca_topic_score_codex":0.00056648545,"about_ca_topic_score_gemma":0.00043218117,"teacher_disagreement_score":0.0033257613,"about_ca_system_score_codex":0.0008598149,"about_ca_system_score_gemma":0.0005535318,"threshold_uncertainty_score":0.010720491},"labels":[],"label_agreement":null},{"id":"W2516387900","doi":"10.1109/isit.2016.7541278","title":"Structural results for two-user interactive communication","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Encoding (memory); Dynamic programming; Fidelity; Random access; Decomposition; Homogeneous; Theoretical computer science; Function (biology); Information theory; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Telecommunications; Statistics; Computer network","score_opus":0.01874246459371712,"score_gpt":0.29075467067825295,"score_spread":0.2720122060845358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516387900","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.021826586,0.0003769416,0.94256544,0.0013515692,0.00008215964,0.00012843765,0.00028344794,0.00014604945,0.03323941],"genre_scores_gemma":[0.86809295,0.0016844659,0.09392848,0.00085235,0.00041156262,0.00089154736,0.0007600843,0.00022839311,0.033150192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99498296,0.0016351535,0.00017226093,0.00082624314,0.0015109176,0.00087253604],"domain_scores_gemma":[0.9795593,0.013605475,0.0021421337,0.0015526792,0.002102641,0.0010378604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036814564,0.0018173599,0.0015345183,0.001507058,0.0018261898,0.0025451062,0.0032568239,0.0029541266,0.020784294],"category_scores_gemma":[0.01712416,0.0009281938,0.001613621,0.0016876888,0.004140719,0.006154946,0.0045971093,0.004148298,0.0031081308],"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.000053784162,0.00006821082,0.00023126954,0.00012257147,0.000032647138,0.0001427446,0.00029452058,0.06596967,0.0007935272,0.9255676,0.0018738934,0.0048495363],"study_design_scores_gemma":[0.00003674875,0.00007261936,0.00019434394,0.000040790663,0.00002101817,0.000108162916,0.00012745679,0.3735011,0.00054177525,0.6224938,0.002821795,0.000040359057],"about_ca_topic_score_codex":0.0024601675,"about_ca_topic_score_gemma":0.0017602602,"teacher_disagreement_score":0.020784294,"about_ca_system_score_codex":0.0030535155,"about_ca_system_score_gemma":0.00221264,"threshold_uncertainty_score":0.06953037},"labels":[],"label_agreement":null},{"id":"W2517764325","doi":"10.1109/isit.2016.7541502","title":"Feedback does not increase the capacity of compound channels with additive noise","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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 Ottawa","funders":"","keywords":"Noise (video); Channel (broadcasting); Constraint (computer-aided design); Channel capacity; Ergodicity; Transmitter; Control theory (sociology); Saddle point; Stability (learning theory); Saddle; Point (geometry); Property (philosophy); Topology (electrical circuits); Mathematics; Computer science; Mathematical optimization; Telecommunications; Control (management); Combinatorics; Statistics","score_opus":0.014812053169776466,"score_gpt":0.21299401896334755,"score_spread":0.19818196579357109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517764325","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55091935,0.0011328405,0.42598063,0.0010923645,0.00018961876,0.00007038238,0.0005021439,0.0008431927,0.019269578],"genre_scores_gemma":[0.99125415,0.00022032108,0.0071661854,0.00008134772,0.000025332925,0.000027708173,0.0000529621,0.000046325342,0.0011257355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986401,0.00043758878,0.00004948428,0.00019640931,0.0002618692,0.00041443427],"domain_scores_gemma":[0.98150945,0.015338248,0.0010130777,0.0012011817,0.0006135755,0.0003244482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020232014,0.0010714317,0.001327026,0.0005521625,0.00060869375,0.0015369327,0.00093945634,0.0011853894,0.0036114755],"category_scores_gemma":[0.012253752,0.0005109892,0.0006872853,0.0007652135,0.0020647254,0.002937135,0.0015662817,0.001402511,0.00030517374],"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.00077561126,0.000089313355,0.000783696,0.0002550846,0.00012657672,0.00047461028,0.000096741845,0.9009425,0.013566725,0.065136746,0.0019930946,0.015759349],"study_design_scores_gemma":[0.000028919938,0.00019121628,0.00035135716,0.000032991906,0.000062896994,0.00028652046,0.00006166662,0.9408224,0.008248351,0.049114373,0.0007660208,0.000033156997],"about_ca_topic_score_codex":0.0009241016,"about_ca_topic_score_gemma":0.0010083935,"teacher_disagreement_score":0.0036114755,"about_ca_system_score_codex":0.0014496573,"about_ca_system_score_gemma":0.0015075569,"threshold_uncertainty_score":0.0120815635},"labels":[],"label_agreement":null},{"id":"W2518061183","doi":"10.1109/isit.2016.7541690","title":"The maximum Han-Kobayashi sum-rate for Gaussian interference channels","year":2016,"lang":"en","type":"article","venue":"","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 Waterloo","funders":"","keywords":"Interference (communication); Gaussian; Boundary (topology); Topology (electrical circuits); Power (physics); Mathematics; Channel (broadcasting); Applied mathematics; Combinatorics; Computer science; Mathematical analysis; Physics; Telecommunications","score_opus":0.023636891861508236,"score_gpt":0.2564902053497044,"score_spread":0.23285331348819616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518061183","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.08462922,0.0061625405,0.8608189,0.0005384742,0.00008818588,0.00011422652,0.00044859288,0.00038626895,0.04681348],"genre_scores_gemma":[0.9412299,0.0039507183,0.051373772,0.00012944563,0.00011598596,0.00020160654,0.00017900998,0.00009577785,0.002723854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794036,0.00089471677,0.00011111846,0.00026122417,0.0004895735,0.00030300368],"domain_scores_gemma":[0.9957243,0.0027649074,0.00057845993,0.00036616583,0.00045385273,0.000112256326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002302303,0.001396268,0.0012520881,0.0010496291,0.00083386136,0.0021769095,0.0010905048,0.00068243267,0.0026337712],"category_scores_gemma":[0.008818404,0.000439374,0.0008079931,0.0014268876,0.002061149,0.0028260616,0.0020320553,0.001194375,0.0008397712],"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.00044931844,0.0000611045,0.0007840562,0.0009986239,0.000120990844,0.00038420752,0.00068870524,0.18592823,0.017540764,0.73431224,0.0035732777,0.055158567],"study_design_scores_gemma":[0.000041472285,0.00022361965,0.0010771599,0.00026638573,0.00009710589,0.00091222243,0.0002682429,0.5603971,0.021293035,0.40843326,0.006851227,0.00013915774],"about_ca_topic_score_codex":0.0007898047,"about_ca_topic_score_gemma":0.00062389293,"teacher_disagreement_score":0.0026337712,"about_ca_system_score_codex":0.0012051517,"about_ca_system_score_gemma":0.0010581092,"threshold_uncertainty_score":0.012175918},"labels":[],"label_agreement":null},{"id":"W2518646054","doi":"10.1109/access.2016.2604618","title":"Experimental Study on Key Generation for Physical Layer Security in Wireless Communications","year":2016,"lang":"en","type":"article","venue":"IEEE Access","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":102,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; University College Dublin; Queen's University Belfast; Royal Academy of Engineering; Rice University","keywords":"Computer science; Multipath propagation; Testbed; Decorrelation; Key generation; Wireless; Key (lock); Physical layer; Channel (broadcasting); Anechoic chamber; Randomness; Computer network; Telecommunications; Computer security; Encryption; Algorithm","score_opus":0.09424227749366394,"score_gpt":0.38039900575613295,"score_spread":0.286156728262469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518646054","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93151474,0.00024368321,0.065430075,0.00018019672,0.000086052474,0.00016572185,0.00015470358,0.00027550056,0.0019493223],"genre_scores_gemma":[0.9864769,0.0001453854,0.012666159,0.000029402496,0.000015691967,0.000073651885,0.00009767242,0.000021606542,0.00047356437],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997834,0.00086139864,0.00016379174,0.0002455843,0.0005659495,0.0003292068],"domain_scores_gemma":[0.99318475,0.004114502,0.00074837677,0.0010590089,0.0006448344,0.0002486344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016925015,0.0006596005,0.00043268796,0.000482386,0.0006651696,0.00063109247,0.00078270107,0.0006370528,0.001974806],"category_scores_gemma":[0.0062579615,0.00024186545,0.00025960585,0.00038905567,0.0012617409,0.0018832809,0.0010937101,0.00072565104,0.00033269657],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0023110344,0.0020844666,0.009051357,0.0009522441,0.0001638804,0.00086204085,0.0009824266,0.03632905,0.87881565,0.012613958,0.001169481,0.05466448],"study_design_scores_gemma":[0.00022567163,0.011007397,0.008645554,0.00007226214,0.00012288912,0.0014455585,0.00076671847,0.07506515,0.8944247,0.004168292,0.003951611,0.00010404399],"about_ca_topic_score_codex":0.0002003192,"about_ca_topic_score_gemma":0.00018940582,"teacher_disagreement_score":0.001974806,"about_ca_system_score_codex":0.00041004407,"about_ca_system_score_gemma":0.00034789677,"threshold_uncertainty_score":0.008950949},"labels":[],"label_agreement":null},{"id":"W2521375007","doi":"10.1109/jsac.2016.2611979","title":"Secrecy-Based Energy-Efficient Data Offloading via Dual Connectivity Over Unlicensed Spectrums","year":2016,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Secrecy; Dual (grammatical number); Computer security","score_opus":0.03865880970438533,"score_gpt":0.28795919812453746,"score_spread":0.24930038842015212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521375007","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.11907794,0.00023258664,0.8732179,0.00017082496,0.000051276773,0.00003762872,0.000061967425,0.00026937816,0.006880436],"genre_scores_gemma":[0.94759464,0.00014356922,0.05072769,0.000046495694,0.000017660486,0.00004047595,0.000059171613,0.000024912168,0.0013454803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996624,0.00008619204,0.000013324215,0.000051974977,0.00009830551,0.00008780942],"domain_scores_gemma":[0.9996025,0.00019274456,0.00005677373,0.00005594014,0.00005552742,0.000036607737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033812993,0.00053712353,0.00053484045,0.00036796276,0.00035346337,0.0007886017,0.00059359556,0.00047342296,0.0014143182],"category_scores_gemma":[0.0010415869,0.0002169698,0.00042278005,0.0005006481,0.00053386326,0.0007406655,0.0010343051,0.0005128554,0.000292456],"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.00022529886,0.00009367888,0.00095324736,0.00008318864,0.000022955379,0.00025049047,0.00012244475,0.8974343,0.022818733,0.023544818,0.0012225467,0.053228293],"study_design_scores_gemma":[0.000005489403,0.000021910068,0.00007026885,0.0000024461813,0.0000027986346,0.000023800645,0.000011937395,0.9955505,0.0015098228,0.002590161,0.00020679849,0.000004072968],"about_ca_topic_score_codex":0.0009307593,"about_ca_topic_score_gemma":0.0011335339,"teacher_disagreement_score":0.0014143182,"about_ca_system_score_codex":0.00038525456,"about_ca_system_score_gemma":0.00043153195,"threshold_uncertainty_score":0.0047314167},"labels":[],"label_agreement":null},{"id":"W2526436503","doi":"","title":"Streaming of Markov Sources over Burst Erasure Channels","year":2015,"lang":"en","type":"dissertation","venue":"TSpace (University of Toronto)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McMaster University","keywords":"Erasure; Computer science; Markov chain; Computer network; Machine learning; Programming language","score_opus":0.012152631301297118,"score_gpt":0.24471577070440467,"score_spread":0.23256313940310755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526436503","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17785114,0.0009809709,0.8150577,0.00064614764,0.000058355236,0.000092755676,0.00031261262,0.00044577362,0.0045545814],"genre_scores_gemma":[0.96080357,0.0008234717,0.0340833,0.00010120494,0.000079283105,0.00009751523,0.00023484422,0.000052139425,0.0037246384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914515,0.00025620637,0.000047078305,0.000113339156,0.0003068969,0.0001313459],"domain_scores_gemma":[0.9938923,0.004546817,0.00057328114,0.00031817015,0.00048059627,0.00018878213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013529834,0.00062611897,0.00082183606,0.00074274885,0.0004669827,0.0009788222,0.0010599681,0.0008340962,0.0011816375],"category_scores_gemma":[0.008240037,0.00046280824,0.00043567937,0.0007529882,0.0011303228,0.002182353,0.001531146,0.0013771645,0.00018843364],"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.00038398238,0.000048535538,0.00087563053,0.0001504936,0.000032991687,0.00044566445,0.00025222328,0.7199235,0.007991931,0.25062084,0.0009343808,0.018339878],"study_design_scores_gemma":[0.000012041236,0.000018971203,0.000093659044,0.000008550037,0.000004221099,0.000038664104,0.000016724634,0.9741101,0.000981376,0.024518495,0.00018877581,0.00000835993],"about_ca_topic_score_codex":0.0026835112,"about_ca_topic_score_gemma":0.0014418358,"teacher_disagreement_score":0.0026835112,"about_ca_system_score_codex":0.0013752125,"about_ca_system_score_gemma":0.00083361985,"threshold_uncertainty_score":0.009977937},"labels":[],"label_agreement":null},{"id":"W2528141713","doi":"10.1002/cpe.3966","title":"Increasing secret key capacity of OFDM systems: a geometric program approach","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","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 British Columbia","funders":"","keywords":"Key (lock); Computer science; Orthogonal frequency-division multiplexing; Randomness; Key generation; Computer network; Channel (broadcasting); Mathematics; Computer security; Encryption","score_opus":0.03330636539040255,"score_gpt":0.2998832872455095,"score_spread":0.26657692185510695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528141713","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.13065892,0.0006479499,0.8437434,0.00056475494,0.000039390972,0.000042817504,0.00007552058,0.00015221526,0.02407505],"genre_scores_gemma":[0.96603805,0.0005766856,0.030615525,0.000075989505,0.00005617422,0.00006699396,0.0000438963,0.000044974146,0.0024816555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995789,0.00016238974,0.000009646609,0.000047542264,0.00012263257,0.000078896315],"domain_scores_gemma":[0.99822766,0.0012040514,0.00015159162,0.0001363177,0.00024098717,0.00003937806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006736048,0.00043592072,0.00037002415,0.00088555174,0.00033528334,0.0006972791,0.00040336442,0.0003518518,0.0029231177],"category_scores_gemma":[0.0030518498,0.00021464018,0.00036079963,0.00065076165,0.0012074237,0.0014400149,0.0007717645,0.00067556015,0.0002626885],"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.0000844045,0.000050616793,0.00060187257,0.00009190454,0.000025323883,0.0001960646,0.00013358737,0.5412016,0.012161585,0.41354424,0.0015316685,0.030377131],"study_design_scores_gemma":[0.0000032789976,0.000023142591,0.00011254596,0.000006684596,0.000004505725,0.00006150388,0.000017572238,0.9600979,0.0016114909,0.03744227,0.00061143516,0.0000076286915],"about_ca_topic_score_codex":0.0006369089,"about_ca_topic_score_gemma":0.0003456593,"teacher_disagreement_score":0.0029231177,"about_ca_system_score_codex":0.000839268,"about_ca_system_score_gemma":0.0005729915,"threshold_uncertainty_score":0.009778857},"labels":[],"label_agreement":null},{"id":"W2530027684","doi":"10.1109/twc.2016.2617328","title":"Optimal Relay Selection for Secure Cooperative Communications With an Adaptive Eavesdropper","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Eavesdropping; Relay; Computer science; Jamming; Secrecy; Channel (broadcasting); Computer network; Selection (genetic algorithm); Relay channel; Channel state information; Secure communication; Wireless; Telecommunications; Computer security; Encryption; Artificial intelligence","score_opus":0.03125541988931355,"score_gpt":0.27766283058701446,"score_spread":0.24640741069770092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2530027684","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.04380204,0.0005483036,0.9522321,0.00017077994,0.000027000855,0.00003674081,0.000044268454,0.0001082605,0.003030428],"genre_scores_gemma":[0.9569782,0.0006606077,0.04089203,0.00004269825,0.000030703464,0.00006092408,0.000043142114,0.000015029104,0.0012766725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884593,0.00046754704,0.000053727745,0.00018842153,0.00027388489,0.00017055454],"domain_scores_gemma":[0.9983657,0.0010936708,0.00019998515,0.00012352034,0.00017009448,0.000047143036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010825172,0.0012329669,0.0009630705,0.0006502771,0.0005738539,0.0008812815,0.00067852275,0.00066896115,0.0009270855],"category_scores_gemma":[0.0034630583,0.00043583993,0.000549176,0.0007987642,0.0010415596,0.0010511602,0.0009062008,0.00057796144,0.00031304467],"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.00025384693,0.000046805126,0.0009032755,0.00014088964,0.00007578646,0.00060007453,0.0002793949,0.8895855,0.014507161,0.05883264,0.001186254,0.033588413],"study_design_scores_gemma":[0.000012795665,0.00006988824,0.00011649436,0.000006600673,0.00001662634,0.000098692166,0.000040394323,0.9869501,0.0017420893,0.0105794035,0.00035504403,0.00001186554],"about_ca_topic_score_codex":0.0012596761,"about_ca_topic_score_gemma":0.0012997104,"teacher_disagreement_score":0.0012596761,"about_ca_system_score_codex":0.0008504527,"about_ca_system_score_gemma":0.0007475231,"threshold_uncertainty_score":0.0061705112},"labels":[],"label_agreement":null},{"id":"W2536833123","doi":"10.1109/allerton.2008.4797644","title":"Secure broadcasting : The secrecy rate region","year":2008,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":48,"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":"Secrecy; Information-theoretic security; Computer science; Converse; Computer network; Broadcasting (networking); Channel (broadcasting); Upper and lower bounds; Computer security; Mathematics","score_opus":0.032100546364115495,"score_gpt":0.21349249586724026,"score_spread":0.18139194950312476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536833123","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.05032618,0.0057362947,0.8356623,0.0030280736,0.0001998985,0.00013684765,0.00074275234,0.0005939908,0.10357366],"genre_scores_gemma":[0.9222869,0.0067925663,0.056884743,0.0007606084,0.00062305055,0.0005373188,0.0005339988,0.00040852153,0.011172248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953082,0.0016668726,0.00014288463,0.00071156054,0.001288949,0.0008815876],"domain_scores_gemma":[0.9747438,0.01922015,0.0017999246,0.001555637,0.0022184977,0.0004620625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004973786,0.0016605804,0.0017841442,0.0015087475,0.001738722,0.0038577542,0.0018179562,0.0018517035,0.0077251946],"category_scores_gemma":[0.018520968,0.0009327995,0.001473541,0.00159482,0.0047765276,0.0065242173,0.002821907,0.004174754,0.002048784],"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.00017282508,0.00003000747,0.00025947407,0.00025291552,0.000050326442,0.0002145944,0.00031712107,0.06056537,0.004974755,0.923876,0.00232829,0.0069584413],"study_design_scores_gemma":[0.000076583,0.0001397602,0.0003787919,0.00023331285,0.000083467836,0.00075410254,0.00019041532,0.31178162,0.009001156,0.6668551,0.010409568,0.000096048534],"about_ca_topic_score_codex":0.0020030483,"about_ca_topic_score_gemma":0.0005063868,"teacher_disagreement_score":0.0077251946,"about_ca_system_score_codex":0.003418819,"about_ca_system_score_gemma":0.0021815216,"threshold_uncertainty_score":0.026304185},"labels":[],"label_agreement":null},{"id":"W2537125279","doi":"10.1109/camsap.2007.4498007","title":"Data Extraction from Wireless Sensor Networks Using Fountain Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of British Columbia","funders":"","keywords":"Computer science; Fountain code; Decoding methods; Wireless sensor network; Decodes; Concatenation (mathematics); Binary number; Source code; Encoder; Channel (broadcasting); Real-time computing; Algorithm; Theoretical computer science; Computer network; Linear code; Block code; Mathematics","score_opus":0.063125657910537,"score_gpt":0.3282572543411414,"score_spread":0.2651315964306044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2537125279","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.011176071,0.0002386487,0.98736715,0.00008793237,0.000021783439,0.000023995717,0.00003647274,0.00032259987,0.0007253989],"genre_scores_gemma":[0.29739887,0.0004817689,0.6975331,0.00014721692,0.000048850816,0.00014910747,0.00021160654,0.00009755838,0.003931909],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928445,0.0001695677,0.000040077422,0.0001080422,0.00033793232,0.000060032206],"domain_scores_gemma":[0.99879164,0.000502433,0.00014761392,0.00034907088,0.00017631607,0.000032858086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005378074,0.00055930245,0.0006855687,0.00069906126,0.00045823643,0.00061270176,0.00091262016,0.00073787494,0.000807599],"category_scores_gemma":[0.003442999,0.00024434648,0.00045449805,0.00092565257,0.00094652,0.0016022857,0.0017964117,0.00078165013,0.0004727316],"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.00046858934,0.00007741637,0.00094024173,0.00038116472,0.00008108827,0.00037367095,0.00044726927,0.15489146,0.12033898,0.09388255,0.0019770614,0.62614053],"study_design_scores_gemma":[0.000037257672,0.00012968587,0.00036880103,0.0000518269,0.00002574947,0.0006121818,0.00006175793,0.77958566,0.1645284,0.042307362,0.012233716,0.000057624366],"about_ca_topic_score_codex":0.0009849501,"about_ca_topic_score_gemma":0.0010933882,"teacher_disagreement_score":0.0009849501,"about_ca_system_score_codex":0.0005134032,"about_ca_system_score_gemma":0.00068479957,"threshold_uncertainty_score":0.0037250519},"labels":[],"label_agreement":null},{"id":"W2539938992","doi":"10.1109/itw2.2006.323813","title":"Combined Source Coding and Watermarking","year":2006,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Waterloo","funders":"","keywords":"Digital watermarking; Independent and identically distributed random variables; Mathematics; Embedding; Coding (social sciences); Variable-length code; Channel code; Source code; Random variable; Algorithm; Dirty paper coding; Maximization; Shannon–Fano coding; Distortion (music); Discrete mathematics; Channel (broadcasting); Computer science; Decoding methods; Statistics; Telecommunications; Mathematical optimization; Image (mathematics); Artificial intelligence","score_opus":0.005460607757358552,"score_gpt":0.18695380032717995,"score_spread":0.1814931925698214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539938992","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.008923624,0.00090647995,0.98584634,0.00034407325,0.0000830221,0.000040375555,0.00004851105,0.00008627362,0.0037212719],"genre_scores_gemma":[0.7234147,0.0029273531,0.25964692,0.00037690817,0.0005595915,0.0002918429,0.0002557393,0.00006822364,0.0124587035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705327,0.0008537804,0.00012393743,0.00058278133,0.0011463645,0.00023987044],"domain_scores_gemma":[0.9950169,0.0033569117,0.00046950302,0.000591374,0.0004806709,0.0000847275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025800266,0.0011602145,0.0016339079,0.0013025203,0.0005131713,0.0019853814,0.0015859781,0.0028710042,0.0022249275],"category_scores_gemma":[0.009099218,0.00057894643,0.0009075454,0.0021797463,0.0022544512,0.0039439006,0.00338572,0.0017503101,0.0006742413],"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.00051027443,0.00007763623,0.00087984663,0.0006079806,0.00024105843,0.0009535751,0.00024568316,0.4358389,0.01905834,0.38033998,0.0024449392,0.15880173],"study_design_scores_gemma":[0.00006909817,0.00013441905,0.00021440707,0.00006829491,0.00006394633,0.0005565094,0.00004509259,0.858019,0.0077907513,0.128492,0.004500867,0.00004564119],"about_ca_topic_score_codex":0.0005798648,"about_ca_topic_score_gemma":0.00047375675,"teacher_disagreement_score":0.0028710042,"about_ca_system_score_codex":0.0009821408,"about_ca_system_score_gemma":0.0009846728,"threshold_uncertainty_score":0.013644695},"labels":[],"label_agreement":null},{"id":"W2542825542","doi":"10.1109/acssc.2011.6190151","title":"On the ergodic secrecy capacity of the wiretap channel under imperfect main channel estimation","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":20,"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 Toronto","funders":"","keywords":"Independent and identically distributed random variables; Upper and lower bounds; Fading; Transmitter; Ergodic theory; Channel state information; Rayleigh fading; Computer science; Secrecy; Channel (broadcasting); Information-theoretic security; Topology (electrical circuits); Channel capacity; Dirty paper coding; Telecommunications; Mathematics; Wireless; Random variable; Statistics; Computer security; Precoding; Combinatorics; MIMO","score_opus":0.04102844637795725,"score_gpt":0.22052856247501618,"score_spread":0.17950011609705893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2542825542","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.18138099,0.005949447,0.7540323,0.0016665226,0.00020113566,0.00007016625,0.0008724495,0.0005499317,0.055277128],"genre_scores_gemma":[0.9800008,0.004157181,0.012216787,0.00013753497,0.00026211672,0.00013844272,0.0003168686,0.00010662711,0.0026634836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766326,0.0007108674,0.000071581,0.00020188569,0.00066937914,0.00068302784],"domain_scores_gemma":[0.97345364,0.02110068,0.0015751955,0.0015440288,0.0019348147,0.0003916328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034573183,0.0015774372,0.0015957283,0.0022889029,0.0010118629,0.0025560095,0.0012379651,0.00092862773,0.0030743086],"category_scores_gemma":[0.019292044,0.0006076649,0.000673737,0.0021538392,0.0055574463,0.003767346,0.0027679408,0.001958821,0.0007048905],"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.00019714897,0.00004062374,0.0007045016,0.00021338082,0.00006452006,0.0003689313,0.00019327327,0.76598155,0.0038381193,0.21559231,0.002144224,0.010661479],"study_design_scores_gemma":[0.0000103386055,0.00003891088,0.0004771095,0.00012110853,0.000031430915,0.00015728008,0.00007605183,0.9198396,0.003107173,0.075352564,0.00073176046,0.000056632594],"about_ca_topic_score_codex":0.0037406692,"about_ca_topic_score_gemma":0.0020710565,"teacher_disagreement_score":0.0037406692,"about_ca_system_score_codex":0.0027132714,"about_ca_system_score_gemma":0.0019102206,"threshold_uncertainty_score":0.019686282},"labels":[],"label_agreement":null},{"id":"W2543489562","doi":"","title":"Ergodic Secrecy Rates of the Full-Duplex AF and DF Relay Wire-Tap Fading Channels","year":2016,"lang":"en","type":"article","venue":"European Wireless Conference","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Fading; Relay; Ergodic theory; Secrecy; Computer science; Electronic engineering; Computer network; Telecommunications; Physics; Channel (broadcasting); Engineering; Mathematics; Computer security","score_opus":0.027071423066646682,"score_gpt":0.2365682884750939,"score_spread":0.20949686540844722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2543489562","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.718432,0.0025782303,0.2233337,0.0010443561,0.00014542676,0.00009054692,0.0026850025,0.00072135654,0.05096943],"genre_scores_gemma":[0.991325,0.00082735886,0.0030692376,0.000053870364,0.00005211649,0.00005868232,0.00041714567,0.00008171705,0.0041148625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983553,0.0004277346,0.00007686901,0.00013678665,0.00041570413,0.000587491],"domain_scores_gemma":[0.9854635,0.010805886,0.00081838336,0.0012416303,0.0012895573,0.00038109353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004689675,0.0012444105,0.0011564294,0.0018193861,0.0010978783,0.0021494208,0.0011113887,0.0010194231,0.006863008],"category_scores_gemma":[0.015992472,0.0007199782,0.0009439456,0.0013898311,0.0027258173,0.0025433335,0.0023308774,0.0010107292,0.0010739041],"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.0012369257,0.00007569316,0.0056335744,0.00031667636,0.00018956808,0.0005457205,0.00074248214,0.7073274,0.011415286,0.2496227,0.0022429766,0.020651026],"study_design_scores_gemma":[0.00007720402,0.0001412646,0.005364334,0.00015692107,0.000277827,0.0009789817,0.0005109738,0.89100605,0.018445533,0.081273176,0.0015661631,0.00020167425],"about_ca_topic_score_codex":0.0023631745,"about_ca_topic_score_gemma":0.0024887458,"teacher_disagreement_score":0.006863008,"about_ca_system_score_codex":0.0018002491,"about_ca_system_score_gemma":0.0025395197,"threshold_uncertainty_score":0.024801672},"labels":[],"label_agreement":null},{"id":"W2547255492","doi":"10.1109/tic-sth.2009.5444414","title":"DiStributed video coding over MIMO wireless fading channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Fading; Computer science; MIMO; Multipath propagation; Precoding; Wireless; Codec; Decoding methods; Bit error rate; Channel (broadcasting); Multi-user MIMO; Computer network; Electronic engineering; Algorithm; Telecommunications; Engineering","score_opus":0.015323858879974915,"score_gpt":0.25144984185928226,"score_spread":0.23612598297930734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547255492","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.083353385,0.00060881005,0.9098363,0.00020779019,0.00005636633,0.00003910321,0.00008583984,0.00023832991,0.0055740704],"genre_scores_gemma":[0.94765073,0.0005381549,0.049043525,0.000059022495,0.00004335496,0.0000314726,0.00007488601,0.000014214059,0.0025446776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996667,0.000072378,0.000009124694,0.000048418315,0.00015514383,0.000048209135],"domain_scores_gemma":[0.99951994,0.00022870443,0.000048420672,0.000058318765,0.00012391577,0.000020801714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035530055,0.0004117678,0.00042013123,0.00020383937,0.00021874286,0.00038340784,0.00047258587,0.00034167938,0.0007404516],"category_scores_gemma":[0.001063976,0.00012173594,0.0001555896,0.00034523656,0.00029532376,0.000420873,0.00046788852,0.00036193253,0.00015758796],"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.0003295835,0.00007556976,0.0009534146,0.00014096791,0.000038435304,0.000350893,0.000082440834,0.75359917,0.0836259,0.034008,0.0016416777,0.12515394],"study_design_scores_gemma":[0.000021830494,0.00006484263,0.0002737279,0.0000082278475,0.000006931569,0.00009468077,0.000016312764,0.97964203,0.013719738,0.005326993,0.00081545004,0.000009164832],"about_ca_topic_score_codex":0.0016997748,"about_ca_topic_score_gemma":0.0020679347,"teacher_disagreement_score":0.0016997748,"about_ca_system_score_codex":0.0005575811,"about_ca_system_score_gemma":0.00045975973,"threshold_uncertainty_score":0.0040456057},"labels":[],"label_agreement":null},{"id":"W2547752052","doi":"10.1109/ccece.2016.7726723","title":"Estimating the steganographic capacity of band-limited channels","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Ottawa","funders":"","keywords":"Steganography; Covert; Channel capacity; Computer science; Probability of error; Adversary; Channel (broadcasting); Covert channel; Algorithm; Mathematics; Telecommunications; Computer security; Artificial intelligence; Embedding","score_opus":0.025288640861016176,"score_gpt":0.23214411286367426,"score_spread":0.20685547200265808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547752052","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.39632428,0.00069292483,0.59677297,0.00022230053,0.000018536715,0.00006208261,0.00021920772,0.00023939443,0.005448309],"genre_scores_gemma":[0.9861907,0.0003031973,0.012828832,0.000017629292,0.000015302447,0.00003959931,0.000079613645,0.000018802506,0.0005063513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915564,0.00024387072,0.00003075079,0.00012262461,0.0002634174,0.00018364334],"domain_scores_gemma":[0.9848304,0.012836361,0.0008065267,0.00068489905,0.00070862076,0.00013312558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011933191,0.00065731496,0.0006457841,0.0013749215,0.00031608442,0.0008932163,0.0007007682,0.0009972883,0.000999386],"category_scores_gemma":[0.016403249,0.000453179,0.00033393968,0.00061718095,0.0017145844,0.003091978,0.0015518065,0.000766093,0.00023865317],"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.00008933605,0.000027855258,0.0017552081,0.000084676656,0.000034988403,0.000157567,0.0000632755,0.9610538,0.011014049,0.015236335,0.00019464611,0.010288176],"study_design_scores_gemma":[0.0000024555982,0.000013355523,0.0005474188,0.00001419959,0.0000045978272,0.0000832985,0.000023401211,0.9862884,0.0055818977,0.007284025,0.00013918792,0.000017772998],"about_ca_topic_score_codex":0.0019417208,"about_ca_topic_score_gemma":0.0008258566,"teacher_disagreement_score":0.0019417208,"about_ca_system_score_codex":0.0010976859,"about_ca_system_score_gemma":0.00062120095,"threshold_uncertainty_score":0.007964253},"labels":[],"label_agreement":null},{"id":"W2547852178","doi":"10.1109/tcomm.2016.2625257","title":"Secure Full-Duplex Spectrum-Sharing Wiretap Networks with Different Antenna Reception Schemes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Jiangsu Province; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; Royal Academy of Engineering","keywords":"Jamming; Secrecy; Computer science; Beamforming; Topology (electrical circuits); Antenna (radio); Signal-to-noise ratio (imaging); Telecommunications; Algorithm; Computer network; Mathematics; Physics; Computer security","score_opus":0.021100030737998283,"score_gpt":0.23986032186122833,"score_spread":0.21876029112323003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547852178","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.28451484,0.0008111243,0.70479006,0.000250529,0.0000337982,0.00005522998,0.000091920345,0.0001672849,0.00928519],"genre_scores_gemma":[0.98488796,0.00028578605,0.013968714,0.000020503727,0.000013235563,0.000025420193,0.000024352401,0.000008690041,0.0007653982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867517,0.0005735496,0.000042725485,0.00013764075,0.0003687362,0.00020218165],"domain_scores_gemma":[0.9962406,0.0024064996,0.00044692704,0.00038607477,0.00043863244,0.00008135793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012740417,0.0008463355,0.0007142002,0.00043047624,0.0004565413,0.00096334354,0.0006796217,0.0006939989,0.0009957858],"category_scores_gemma":[0.003927917,0.0002996829,0.0004359706,0.0007885582,0.0015677416,0.0023035628,0.0012363507,0.0006199592,0.00022337782],"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.00043877485,0.000067751185,0.0015341111,0.0001430663,0.000080270365,0.00041138032,0.00020333838,0.86049247,0.018660653,0.099178545,0.00043427947,0.01835533],"study_design_scores_gemma":[0.0000100947855,0.000099825695,0.00013849663,0.0000061469723,0.000020074385,0.00013382584,0.00004083346,0.9888465,0.0044925124,0.00600921,0.00018844414,0.000013955803],"about_ca_topic_score_codex":0.00059163925,"about_ca_topic_score_gemma":0.0005091711,"teacher_disagreement_score":0.0012740417,"about_ca_system_score_codex":0.0009096972,"about_ca_system_score_gemma":0.00051171007,"threshold_uncertainty_score":0.0067378283},"labels":[],"label_agreement":null},{"id":"W2548682766","doi":"10.1109/ccece.2016.7726710","title":"Adaptive granular HARQ LDPC-based coding for secrecy enhancement in wiretap channels","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Université Laval","funders":"","keywords":"Retransmission; Decoding methods; Computer science; Network packet; Hybrid automatic repeat request; Algorithm; Code word; Low-density parity-check code; Information leakage; Computer network; Channel (broadcasting); Coding (social sciences); Theoretical computer science; Mathematics; Statistics","score_opus":0.02817638119409757,"score_gpt":0.2532726448618741,"score_spread":0.22509626366777655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548682766","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.044935048,0.00031916704,0.9515307,0.00016471231,0.000026053915,0.000037896403,0.0000737692,0.0002812288,0.0026315204],"genre_scores_gemma":[0.9215087,0.0004146992,0.07559024,0.000089871646,0.00002971313,0.000056184595,0.000074834854,0.000042623677,0.002193079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990971,0.00029690616,0.000028727543,0.00010304893,0.00036134807,0.00011285031],"domain_scores_gemma":[0.9983816,0.0007400257,0.0002315105,0.00028699893,0.00031109084,0.000048744398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000730949,0.0004651226,0.0005099477,0.00049733196,0.00038010662,0.0006405291,0.00077927695,0.00059479254,0.0009362298],"category_scores_gemma":[0.0021336714,0.00022174577,0.0002730893,0.0008475516,0.0010998694,0.0011903123,0.0009514413,0.00085380726,0.00027917046],"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.00034436633,0.000055508674,0.0006278537,0.00018150898,0.00005193643,0.00039686266,0.00022365407,0.7461095,0.037670434,0.15902191,0.001185281,0.054131165],"study_design_scores_gemma":[0.000008685603,0.00004408684,0.000075534655,0.000010071672,0.000007090078,0.000064751504,0.000013820934,0.984522,0.0034857907,0.011276559,0.00047856817,0.000013073198],"about_ca_topic_score_codex":0.0020068963,"about_ca_topic_score_gemma":0.0018749349,"teacher_disagreement_score":0.0020068963,"about_ca_system_score_codex":0.0008005629,"about_ca_system_score_gemma":0.0009606841,"threshold_uncertainty_score":0.0058085322},"labels":[],"label_agreement":null},{"id":"W2549473036","doi":"10.1109/allerton.2009.5394898","title":"Feedback capacity of a class of symmetric finite-state Markov channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Finite state; Class (philosophy); Markov chain; Symmetry (geometry); Markov process; State (computer science); Channel capacity; Mathematics; Topology (electrical circuits); Channel (broadcasting); Control theory (sociology); Computer science; Discrete mathematics; Combinatorics; Telecommunications; Algorithm; Statistics; Control (management); Artificial intelligence","score_opus":0.019791127826805695,"score_gpt":0.23179354529411256,"score_spread":0.21200241746730686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549473036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5495421,0.0009980887,0.4226276,0.0008926994,0.00013364936,0.00014832188,0.00082988344,0.00038416608,0.02444343],"genre_scores_gemma":[0.99480116,0.0002182142,0.0038269146,0.00005264497,0.00005398786,0.0000633177,0.00007553697,0.000016904447,0.0008914311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998618,0.0003949659,0.000052192234,0.00017154972,0.00038361317,0.00037972885],"domain_scores_gemma":[0.99260956,0.005062991,0.0007508327,0.0005925822,0.0006674727,0.00031662907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015320873,0.00048234325,0.00089167414,0.00069199747,0.0005679035,0.0013853341,0.00091225555,0.0007230131,0.0027443927],"category_scores_gemma":[0.006866252,0.0002099139,0.0005027022,0.00058784604,0.0017833378,0.002189944,0.0010414495,0.00096924754,0.00022187138],"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.0003606875,0.00010948081,0.0011055398,0.00020848471,0.000066432985,0.00042386947,0.00018249177,0.21696986,0.013182094,0.74964803,0.0016932595,0.016049776],"study_design_scores_gemma":[0.00004716888,0.00009482444,0.0006026127,0.000028656972,0.000020326203,0.00025700283,0.00005032041,0.6967934,0.0044918344,0.29648852,0.0010851814,0.00004014327],"about_ca_topic_score_codex":0.0010747152,"about_ca_topic_score_gemma":0.00042823274,"teacher_disagreement_score":0.0027443927,"about_ca_system_score_codex":0.0014185585,"about_ca_system_score_gemma":0.001430897,"threshold_uncertainty_score":0.010292411},"labels":[],"label_agreement":null},{"id":"W2549737148","doi":"10.1109/lcomm.2016.2626278","title":"The Gaussian Diamond-Wiretap Channel With Rate-Limited Relay Cooperation","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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 Toronto","funders":"Qatar National Research Fund","keywords":"Relay; Relay channel; Computer science; Computer network; Channel state information; Gaussian; Channel (broadcasting); Topology (electrical circuits); Transmission (telecommunications); Hop (telecommunications); Telecommunications; Wireless; Mathematics; Physics","score_opus":0.018198626645912916,"score_gpt":0.23114702632383127,"score_spread":0.21294839967791834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549737148","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.048020866,0.0005043664,0.9334627,0.0005806283,0.000111727226,0.00007792969,0.00023168858,0.00010969461,0.016900454],"genre_scores_gemma":[0.93615836,0.0011183289,0.05765024,0.0002223981,0.00008159035,0.0001517694,0.00013203357,0.000018911951,0.004466376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986804,0.00045142154,0.000047702993,0.00016397475,0.00042370806,0.0002327131],"domain_scores_gemma":[0.9973086,0.0014657206,0.00032558272,0.00036241245,0.00041852088,0.00011908623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015345812,0.0005945941,0.0007489706,0.0005667447,0.0004991821,0.001015926,0.0009645613,0.0011518165,0.0015612318],"category_scores_gemma":[0.0040420643,0.00034715032,0.00036759218,0.0008399652,0.0021294085,0.0021863335,0.002089986,0.0014141849,0.0004299632],"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.00026658896,0.000033097338,0.0003662319,0.00014128625,0.000024806546,0.0009002235,0.00023289076,0.122623965,0.006503163,0.8553075,0.002350687,0.011249582],"study_design_scores_gemma":[0.00009604874,0.0001752523,0.00020431762,0.000052382908,0.000021004349,0.00077300426,0.0001098031,0.7556532,0.004238953,0.2337651,0.004835859,0.0000750465],"about_ca_topic_score_codex":0.0016644686,"about_ca_topic_score_gemma":0.0010944299,"teacher_disagreement_score":0.0016644686,"about_ca_system_score_codex":0.0008170242,"about_ca_system_score_gemma":0.0011389067,"threshold_uncertainty_score":0.008115709},"labels":[],"label_agreement":null},{"id":"W2551453762","doi":"10.1109/allerton.2012.6483230","title":"Channel capacity in the non-asymptotic regime: Taylor-type expansion and computable benchmarks","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"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":"Taylor series; Type (biology); Applied mathematics; Computable general equilibrium; Channel (broadcasting); Asymptotic expansion; Computer science; Mathematics; Mathematical analysis; Economics; Telecommunications; Geology","score_opus":0.03060262818506441,"score_gpt":0.23399987428644364,"score_spread":0.20339724610137924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551453762","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.09780038,0.0051138173,0.7719724,0.005967365,0.0003472716,0.00008583586,0.00051859755,0.000555509,0.11763888],"genre_scores_gemma":[0.93594974,0.0031669275,0.04607839,0.00062983343,0.000630794,0.00032480853,0.00041181565,0.0002840856,0.012523578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983708,0.0007353282,0.000040113173,0.00017549143,0.00045176927,0.00022643538],"domain_scores_gemma":[0.98431003,0.013093453,0.00058548356,0.0006017152,0.0011144329,0.0002947931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002978048,0.00087800605,0.0011905291,0.0017595273,0.00066494494,0.0021178871,0.0012916243,0.001087445,0.004290689],"category_scores_gemma":[0.029485064,0.00031086558,0.00066634594,0.0014019662,0.0035156924,0.0056409673,0.0018976146,0.0033416187,0.00053021073],"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.000031119664,0.00002276255,0.00019390209,0.00009245713,0.000007877389,0.000079076664,0.00007156044,0.06402726,0.00033525363,0.9285284,0.002314052,0.004296332],"study_design_scores_gemma":[0.000007672929,0.000014163211,0.00013498422,0.00004622473,0.0000047997287,0.0000506227,0.00003081546,0.5039766,0.00029561194,0.49411002,0.0013150411,0.000013577855],"about_ca_topic_score_codex":0.002337977,"about_ca_topic_score_gemma":0.0013428752,"teacher_disagreement_score":0.004290689,"about_ca_system_score_codex":0.0030190255,"about_ca_system_score_gemma":0.0015089486,"threshold_uncertainty_score":0.021904647},"labels":[],"label_agreement":null},{"id":"W2552494113","doi":"10.1109/allerton.2012.6483278","title":"Non-asymptotic fixed-rate Slepian-Wolf coding theorem","year":2012,"lang":"en","type":"article","venue":"","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":"University of Waterloo","funders":"","keywords":"Converse; Mathematics; Discrete mathematics; Converse theorem; Shannon–Fano coding; Algorithm; Applied mathematics; Combinatorics; Variable-length code; Computer science; Decoding methods; Pure mathematics","score_opus":0.013349196820280159,"score_gpt":0.23918740020244222,"score_spread":0.22583820338216207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552494113","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.011559044,0.0007644824,0.9735131,0.0005948752,0.00007542581,0.000045431025,0.00018630645,0.00031554425,0.012945756],"genre_scores_gemma":[0.7441822,0.0040110867,0.23686112,0.0010889042,0.00029063085,0.00066917395,0.0007081461,0.00034359377,0.011845108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970187,0.0008757249,0.000120252946,0.0003310331,0.001306982,0.00034725567],"domain_scores_gemma":[0.9871732,0.008966211,0.00067651895,0.0014681962,0.0015360203,0.00017992755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005061492,0.0020524696,0.0014427423,0.0016022315,0.000889312,0.0015914766,0.0022004324,0.0016037419,0.0030992387],"category_scores_gemma":[0.025316646,0.0007908202,0.0016062106,0.0011723394,0.0031220438,0.004115427,0.0025878968,0.0037682357,0.0013349678],"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.00024965408,0.00004711692,0.00065170246,0.0003730459,0.00007260015,0.00038181213,0.00037746882,0.30607638,0.009427735,0.65640473,0.0054641888,0.02047367],"study_design_scores_gemma":[0.00001830984,0.00006171838,0.0001862847,0.00009742332,0.000024588726,0.00032967632,0.000051807692,0.82767797,0.00670272,0.16208863,0.0027049868,0.00005586756],"about_ca_topic_score_codex":0.0023376124,"about_ca_topic_score_gemma":0.0014687357,"teacher_disagreement_score":0.005061492,"about_ca_system_score_codex":0.0020912287,"about_ca_system_score_gemma":0.002185016,"threshold_uncertainty_score":0.026768029},"labels":[],"label_agreement":null},{"id":"W2554630205","doi":"10.1109/allerton.2012.6483473","title":"Real-time coding of Gauss-Markov sources over burst erasure channels","year":2012,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Toronto","funders":"","keywords":"Erasure; Binary erasure channel; Algorithm; Encoder; Markov process; Computer science; Markov chain; Network packet; Gaussian; Markov model; Upper and lower bounds; Channel (broadcasting); Mathematics; Channel capacity; Telecommunications; Physics; Statistics; Computer network","score_opus":0.014353514992049258,"score_gpt":0.24662680610219567,"score_spread":0.2322732911101464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2554630205","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.2611979,0.0009468413,0.734766,0.00038967875,0.000030607232,0.000028972348,0.00005715534,0.00015163829,0.0024311321],"genre_scores_gemma":[0.9795889,0.00037416277,0.019159326,0.000027539021,0.0000148640665,0.00002000965,0.00002826208,0.000012547491,0.00077439134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994287,0.00023690912,0.000018121895,0.000038081187,0.00016403236,0.000114176204],"domain_scores_gemma":[0.99453497,0.004331587,0.0005224773,0.0002264154,0.000303589,0.000080913574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017431754,0.0005189246,0.0005031008,0.00040207643,0.000244667,0.0005594229,0.00057781604,0.00049213145,0.00062978256],"category_scores_gemma":[0.0056770258,0.0002136833,0.00024718314,0.0005420147,0.0011689684,0.0013921731,0.00089139846,0.00073913153,0.00009098268],"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.00015873658,0.000022510329,0.00039273073,0.00004676653,0.000015373067,0.00010518095,0.00009881289,0.9221696,0.004858171,0.063788146,0.0001607858,0.00818312],"study_design_scores_gemma":[0.0000055176893,0.00001802899,0.00004822968,0.0000032485857,0.0000019123713,0.000017560802,0.000009051533,0.9923516,0.0012339188,0.0062343767,0.00007193181,0.000004527578],"about_ca_topic_score_codex":0.0019583986,"about_ca_topic_score_gemma":0.001167663,"teacher_disagreement_score":0.0019583986,"about_ca_system_score_codex":0.0007092353,"about_ca_system_score_gemma":0.00055038393,"threshold_uncertainty_score":0.009218931},"labels":[],"label_agreement":null},{"id":"W2555336608","doi":"10.1109/access.2016.2628808","title":"Joint Secure AF Relaying and Artificial Noise Optimization: A Penalized Difference-of-Convex Programming Framework","year":2016,"lang":"en","type":"article","venue":"IEEE Access","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Artificial noise; Computer science; Relay; Robustness (evolution); Semidefinite programming; Secure transmission; Mathematical optimization; Robust optimization; Optimization problem; MIMO; Convex optimization; Physical layer; Transmission (telecommunications); Wireless; Channel (broadcasting); Algorithm; Computer network; Mathematics; Regular polygon; Power (physics); Telecommunications","score_opus":0.04152872685809027,"score_gpt":0.2889733166641995,"score_spread":0.24744458980610923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555336608","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.0044322433,0.00016603422,0.99314487,0.00023004023,0.000024315506,0.000031689182,0.00003691541,0.000072599345,0.001861295],"genre_scores_gemma":[0.49830955,0.00080759823,0.49286067,0.00047348402,0.00015050657,0.0005237203,0.00030665367,0.00017376081,0.006393955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989801,0.00045138263,0.00003986227,0.00015401015,0.0002658918,0.00010869408],"domain_scores_gemma":[0.99799454,0.0014258431,0.00015919715,0.000079639845,0.00026288608,0.00007790852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021988072,0.00152151,0.0014587471,0.00057583733,0.00034215677,0.0013779497,0.0014690002,0.0015508241,0.0021557934],"category_scores_gemma":[0.0039770533,0.0005596421,0.0009660048,0.0007230368,0.0011814265,0.0010571954,0.001387049,0.0024086093,0.00041674907],"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.00007045549,0.000055943794,0.00026386755,0.00009509574,0.000035750938,0.000093929586,0.000039925137,0.96185523,0.0011107501,0.022361375,0.0009108155,0.01310689],"study_design_scores_gemma":[0.000006309355,0.000017170929,0.000017222428,0.0000037386967,0.0000028837064,0.000009867275,0.0000031211805,0.9975229,0.00014981016,0.0020696893,0.00019484594,0.0000024758642],"about_ca_topic_score_codex":0.0038140244,"about_ca_topic_score_gemma":0.0023700679,"teacher_disagreement_score":0.0038140244,"about_ca_system_score_codex":0.0010356787,"about_ca_system_score_gemma":0.0019606517,"threshold_uncertainty_score":0.011628509},"labels":[],"label_agreement":null},{"id":"W2557746379","doi":"10.1109/twc.2016.2633336","title":"Robust Resource Allocation to Enhance Physical Layer Security in Systems With Full-Duplex Receivers: Active Adversary","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Iran National Science Foundation","keywords":"Computer science; Jamming; Secrecy; Physical layer; Maximization; Transmitter; Computer network; Transmitter power output; Adversary; Artificial noise; Resource allocation; Transmission (telecommunications); Secure communication; Channel (broadcasting); Secure transmission; Computer security; Wireless; Telecommunications; Mathematical optimization; Encryption; Mathematics","score_opus":0.023433560547200874,"score_gpt":0.26384918146071007,"score_spread":0.2404156209135092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557746379","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.01655829,0.00028572913,0.9814497,0.00009443478,0.000021717617,0.000017069027,0.000011416626,0.000095941126,0.0014656777],"genre_scores_gemma":[0.9346196,0.0003530818,0.06309154,0.00007693376,0.000064114145,0.00004800266,0.000014401745,0.00002434564,0.0017079889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990602,0.00036057946,0.00003842254,0.00013989005,0.00025567715,0.00014511429],"domain_scores_gemma":[0.99935025,0.00026639068,0.00012649882,0.00011746799,0.00010527815,0.000034024237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012632327,0.00089690124,0.0007714057,0.00034984408,0.00031231286,0.000984609,0.0011617683,0.000670224,0.001126583],"category_scores_gemma":[0.0015153851,0.00032106167,0.0005003874,0.00035733188,0.001067039,0.0013612781,0.0012659892,0.0007731407,0.00029423504],"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.00015462496,0.00008708186,0.00043213263,0.00013747094,0.00010021904,0.0002573962,0.00013691359,0.8595235,0.028681796,0.07035888,0.00075067295,0.03937928],"study_design_scores_gemma":[0.0000095404785,0.00007674252,0.0000732075,0.000004983329,0.000012049489,0.000048367776,0.000009786547,0.99225605,0.0026216938,0.0044213263,0.00045624815,0.00001008483],"about_ca_topic_score_codex":0.0005789729,"about_ca_topic_score_gemma":0.00041552447,"teacher_disagreement_score":0.0012632327,"about_ca_system_score_codex":0.00051941845,"about_ca_system_score_gemma":0.0006782467,"threshold_uncertainty_score":0.0066806674},"labels":[],"label_agreement":null},{"id":"W2564180036","doi":"10.1109/tvt.2016.2645702","title":"Minimizing Secrecy Outage Probability in Multiuser Wireless Systems With Stochastic Traffic","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":9,"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":"Computer science; Wireless; Secrecy; Wireless network; Scheduling (production processes); Computer network; Reliability (semiconductor); Channel (broadcasting); Mathematical optimization; Distributed computing; Computer security; Telecommunications; Mathematics","score_opus":0.01183439360668706,"score_gpt":0.21203275788973022,"score_spread":0.20019836428304316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564180036","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.08654671,0.00040587678,0.9090759,0.00047008297,0.000034733945,0.000042553715,0.00008454081,0.00021178936,0.0031278238],"genre_scores_gemma":[0.97081316,0.0004068301,0.027628848,0.0000609526,0.00005231552,0.000062976265,0.000049566403,0.00004628555,0.00087906996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998106,0.00086146995,0.00008962625,0.00021410924,0.00038650067,0.000342347],"domain_scores_gemma":[0.9894084,0.008503113,0.0008717847,0.00040124494,0.000568901,0.00024667112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028116729,0.0013714508,0.0013896484,0.00076296425,0.00069326215,0.0017943642,0.0010776412,0.0010599348,0.0010113453],"category_scores_gemma":[0.008810568,0.00066777604,0.000532208,0.0013522969,0.0016736925,0.0018697992,0.0016151698,0.0009710305,0.0001900908],"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.00005449344,0.00001969562,0.00039203634,0.000047084824,0.00001716548,0.00008177112,0.00004274943,0.9772081,0.001326481,0.016358882,0.0002405368,0.0042110714],"study_design_scores_gemma":[0.000007066633,0.000017781396,0.0000936563,0.0000046034133,0.0000055450396,0.000021770145,0.000012552172,0.9926468,0.00063929654,0.006464131,0.00008140672,0.0000053091385],"about_ca_topic_score_codex":0.0024168189,"about_ca_topic_score_gemma":0.0015159011,"teacher_disagreement_score":0.0028116729,"about_ca_system_score_codex":0.0020564192,"about_ca_system_score_gemma":0.0018152525,"threshold_uncertainty_score":0.0149204135},"labels":[],"label_agreement":null},{"id":"W2565469751","doi":"10.1016/j.phycom.2016.12.001","title":"Cognitive radio network with secrecy and interference constraints","year":2016,"lang":"en","type":"article","venue":"Physical Communication","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Cognitive radio; Secrecy; Interference (communication); Co-channel interference; Computer network; Telecommunications; Computer security; Wireless; Channel (broadcasting)","score_opus":0.016083350681746864,"score_gpt":0.24961991300952108,"score_spread":0.2335365623277742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565469751","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.050970633,0.0023828724,0.90801454,0.0016153996,0.0004367471,0.00010196489,0.00025602747,0.00024537207,0.035976425],"genre_scores_gemma":[0.9461441,0.0017071463,0.042717468,0.00039153214,0.00039084814,0.0001562846,0.00008555698,0.000026778536,0.008380305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817514,0.00047097664,0.00005847789,0.00028888823,0.00049548224,0.0005111135],"domain_scores_gemma":[0.996539,0.0020925046,0.0003196106,0.00029074997,0.00061085407,0.00014731371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017426593,0.0017948782,0.0017865611,0.0010659137,0.0013350205,0.0027665917,0.0021598253,0.0017760018,0.0019191926],"category_scores_gemma":[0.0057503637,0.0006144798,0.00065102126,0.0023572238,0.0016521487,0.0020625915,0.0020314297,0.0018394846,0.00067525345],"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.0009091626,0.0002657663,0.0012073901,0.00057051156,0.00030924662,0.0018519062,0.00031331566,0.62374896,0.013609737,0.26076743,0.009408487,0.08703806],"study_design_scores_gemma":[0.00010410344,0.00014342839,0.0003064609,0.000038009777,0.00014134956,0.00073847256,0.00006634329,0.9278344,0.0021240446,0.065084144,0.0033674429,0.000051809468],"about_ca_topic_score_codex":0.0039178985,"about_ca_topic_score_gemma":0.0041419636,"teacher_disagreement_score":0.0039178985,"about_ca_system_score_codex":0.0015126078,"about_ca_system_score_gemma":0.0026060531,"threshold_uncertainty_score":0.010974765},"labels":[],"label_agreement":null},{"id":"W2568383335","doi":"10.1109/tit.2012.2218215","title":"On the Capacity of the $K$-User Cyclic Gaussian Interference Channel","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":39,"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 Toronto","funders":"","keywords":"Interference (communication); Gaussian; Channel (broadcasting); Computer science; Topology (electrical circuits); Algorithm; Combinatorics; Mathematics; Physics; Telecommunications","score_opus":0.01632402139219326,"score_gpt":0.21589665316033885,"score_spread":0.19957263176814558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568383335","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.20596048,0.014199522,0.64183944,0.004135948,0.00034883272,0.00011482666,0.0013071875,0.00062091695,0.1314729],"genre_scores_gemma":[0.9697472,0.0065292213,0.015583663,0.00046190992,0.00042819942,0.00020599087,0.00043470206,0.00015833591,0.0064507197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980725,0.0006704649,0.000040012328,0.00018240437,0.00038091312,0.0006536769],"domain_scores_gemma":[0.9868282,0.010089509,0.0007096687,0.0005650851,0.0014055843,0.0004019895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024834448,0.001713713,0.0013100217,0.0016731437,0.0011743053,0.0027128342,0.0017790418,0.0010495315,0.0050739986],"category_scores_gemma":[0.013946771,0.0007264927,0.00085233967,0.002198965,0.0048181205,0.0039651846,0.0028064838,0.0026429924,0.0012530329],"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.0004827301,0.00006154488,0.0009169728,0.00037107716,0.00010912124,0.000549703,0.0006123973,0.4545412,0.0055152015,0.5157582,0.007535641,0.013546172],"study_design_scores_gemma":[0.000030295814,0.00007394091,0.0006192629,0.00017209312,0.000052192096,0.00029822637,0.00020025158,0.79871243,0.0024814436,0.19374014,0.003527401,0.00009240217],"about_ca_topic_score_codex":0.009362925,"about_ca_topic_score_gemma":0.0028231777,"teacher_disagreement_score":0.009362925,"about_ca_system_score_codex":0.003418333,"about_ca_system_score_gemma":0.002354339,"threshold_uncertainty_score":0.02480179},"labels":[],"label_agreement":null},{"id":"W2571711166","doi":"10.1049/iet-com.2016.0617","title":"Non‐linear transceiver design for secure communications with artificial noise‐assisted MIMO relay","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security 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":"McGill University","funders":"","keywords":"Artificial noise; Relay; Computer science; MIMO; Precoding; Transceiver; Mathematical optimization; Relay channel; Physical layer; Channel (broadcasting); Relaxation (psychology); Power (physics); Mathematics; Telecommunications; Wireless","score_opus":0.09101922775802859,"score_gpt":0.3226872621371945,"score_spread":0.23166803437916592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571711166","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.007462495,0.00022902373,0.9905336,0.00008079411,0.000022582715,0.000020771164,0.000013534771,0.000041025487,0.0015961477],"genre_scores_gemma":[0.82340187,0.0010721465,0.16926233,0.0001401375,0.000080949576,0.0001882694,0.00007322829,0.00003805067,0.005743051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993056,0.00025828855,0.000032571228,0.00012995196,0.00022718516,0.000046505043],"domain_scores_gemma":[0.9990085,0.0005800993,0.00017243365,0.0000678307,0.00015152643,0.000019651015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010649565,0.0010350054,0.0006745472,0.0002472199,0.00023551974,0.0010068724,0.0006572476,0.0010953132,0.0012545635],"category_scores_gemma":[0.0022922505,0.00038876836,0.0005057602,0.00034195225,0.0009003776,0.00082382676,0.0007751627,0.00077710126,0.00044427172],"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.00009537841,0.0000399637,0.00025819824,0.00025575852,0.000064260996,0.00017641054,0.00014865347,0.9158906,0.02211353,0.035995312,0.00047964792,0.024482338],"study_design_scores_gemma":[0.000011872991,0.00013599276,0.000082335086,0.000010304294,0.00001468712,0.000058944002,0.00001551402,0.9915354,0.003669862,0.0036651348,0.0007900991,0.00000973265],"about_ca_topic_score_codex":0.0004981922,"about_ca_topic_score_gemma":0.00043843914,"teacher_disagreement_score":0.0012545635,"about_ca_system_score_codex":0.0005375704,"about_ca_system_score_gemma":0.00067856157,"threshold_uncertainty_score":0.0056321025},"labels":[],"label_agreement":null},{"id":"W2581580340","doi":"10.1155/2017/7206187","title":"Physical Layer Authentication Enhancement Using Maximum SNR Ratio Based Cooperative AF Relaying","year":2017,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Western University","funders":"","keywords":"Computer science; Relay; Computer network; Physical layer; Authentication (law); Spoofing attack; Transmitter; Maximal-ratio combining; Transmission (telecommunications); Channel (broadcasting); Wireless network; Wireless; Macrocell; Signal-to-noise ratio (imaging); Telecommunications; Computer security; Fading; Power (physics); Base station","score_opus":0.040576279678649525,"score_gpt":0.3212144891352171,"score_spread":0.2806382094565676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581580340","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.08125097,0.00060734595,0.912428,0.00019536521,0.00007156716,0.000058802325,0.00003762882,0.00057223847,0.0047779176],"genre_scores_gemma":[0.91283494,0.00036932807,0.08556117,0.00006497621,0.000048406277,0.000028196706,0.000025959182,0.000012877201,0.0010541476],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99925894,0.00021313128,0.000055555472,0.000107677275,0.0002755655,0.000089153844],"domain_scores_gemma":[0.9981602,0.00087017694,0.00028958425,0.00027709987,0.00035816254,0.00004480156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009514354,0.0009119461,0.00052582764,0.00060787343,0.0004242328,0.00069359026,0.00070019515,0.0006903007,0.0009221736],"category_scores_gemma":[0.003330166,0.00018623588,0.00041914635,0.0005043001,0.0006655107,0.001347882,0.0009023684,0.0005088542,0.00044433062],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00096409704,0.00029675855,0.0037225373,0.0003594458,0.00011661843,0.001261282,0.0007270928,0.17191884,0.42674488,0.04117314,0.0015605523,0.3511548],"study_design_scores_gemma":[0.000054526885,0.00083550584,0.0014682587,0.000033107506,0.00012379534,0.0016924626,0.00011022005,0.88466567,0.09881066,0.008216251,0.0039235386,0.00006605315],"about_ca_topic_score_codex":0.00041199103,"about_ca_topic_score_gemma":0.00057652185,"teacher_disagreement_score":0.0009514354,"about_ca_system_score_codex":0.0003019572,"about_ca_system_score_gemma":0.0003535739,"threshold_uncertainty_score":0.0050317645},"labels":[],"label_agreement":null},{"id":"W2584926063","doi":"10.1109/glocom.2016.7842142","title":"Physical Layer Secure Information Exchange Protocol for MIMO Ad Hoc Networks against Passive Attacks","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Physical layer; Relay; MIMO; Wireless ad hoc network; Channel (broadcasting); Transmission (telecommunications); Protocol (science); Cryptography; Relay channel; Computer security; Wireless; Telecommunications","score_opus":0.019744693566047543,"score_gpt":0.2901261689164199,"score_spread":0.2703814753503724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584926063","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.022903776,0.00025077624,0.973389,0.00026024977,0.00007378927,0.00019832188,0.00002211026,0.00024083129,0.0026610882],"genre_scores_gemma":[0.82792294,0.00033625084,0.16764523,0.0001969769,0.00007288104,0.00044606216,0.00009412386,0.00002215221,0.0032633424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981267,0.00059645803,0.00017408447,0.00017880266,0.0007664642,0.00015752291],"domain_scores_gemma":[0.9980767,0.00071891595,0.00036819486,0.00045827485,0.00030417746,0.00007368835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016758139,0.0005466622,0.00051847467,0.00065088813,0.0008985311,0.0009706527,0.0010397488,0.0010234909,0.0009281054],"category_scores_gemma":[0.0029498602,0.00024526563,0.0005640919,0.00039561137,0.0010642821,0.0022880677,0.0017360522,0.0010867298,0.0002556023],"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.0005076624,0.0003388167,0.0019677198,0.0006408965,0.0002784931,0.0016656534,0.0013230458,0.17832477,0.15591949,0.5258026,0.0037182646,0.12951252],"study_design_scores_gemma":[0.00012406694,0.00068628194,0.0006249789,0.000062233485,0.00013826539,0.0015019762,0.00014562346,0.8844396,0.048392646,0.049899776,0.013894927,0.00008968487],"about_ca_topic_score_codex":0.0001758485,"about_ca_topic_score_gemma":0.00015922815,"teacher_disagreement_score":0.0016758139,"about_ca_system_score_codex":0.0005539401,"about_ca_system_score_gemma":0.00078339694,"threshold_uncertainty_score":0.008862674},"labels":[],"label_agreement":null},{"id":"W2588149931","doi":"10.1109/access.2017.2667882","title":"Secrecy Energy Efficiency Maximization in Cognitive Radio Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Access","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Concordia University","funders":"China Postdoctoral Science Foundation; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Beamforming; Computer science; Mathematical optimization; Maximization; Cognitive radio; Utility maximization problem; Quality of service; Transmitter power output; Fractional programming; Convex optimization; Wireless; Mathematics; Regular polygon; Telecommunications; Transmitter","score_opus":0.032200390732275395,"score_gpt":0.3063281055353455,"score_spread":0.27412771480307013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588149931","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.048842985,0.0010916346,0.94364214,0.00027659844,0.000037228892,0.00002094217,0.000032900596,0.000064690204,0.005990976],"genre_scores_gemma":[0.9690026,0.0011257924,0.027797861,0.00008180092,0.00006597047,0.00004755152,0.000023841549,0.000022084047,0.0018325604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885714,0.0005175806,0.000031947005,0.00012939167,0.00027043672,0.00019357438],"domain_scores_gemma":[0.9985644,0.0010361322,0.00013921788,0.00006787299,0.00015537914,0.000036979203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013585989,0.0011024126,0.0007937979,0.0005180953,0.0004245443,0.0013329034,0.0006936167,0.0009404388,0.00062091596],"category_scores_gemma":[0.0028704677,0.0004396327,0.0005361839,0.0008380865,0.0014798252,0.0014091757,0.0009613682,0.0006631321,0.00017508942],"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.000093092465,0.000033085118,0.00044647322,0.00011580861,0.00004317319,0.00019168998,0.00011043622,0.9303781,0.007006919,0.049239222,0.0003876634,0.011954398],"study_design_scores_gemma":[0.000008594995,0.000048757953,0.00013448541,0.000008690441,0.0000132936675,0.000055153607,0.000029653824,0.9854519,0.0018155973,0.012070933,0.00035295953,0.000010002694],"about_ca_topic_score_codex":0.0014541585,"about_ca_topic_score_gemma":0.0008708801,"teacher_disagreement_score":0.0014541585,"about_ca_system_score_codex":0.0012004852,"about_ca_system_score_gemma":0.000767969,"threshold_uncertainty_score":0.008710146},"labels":[],"label_agreement":null},{"id":"W2591260756","doi":"10.1109/cns.2016.7860534","title":"Robust and secure beamformer design for MIMO relaying with imperfect eavesdropper CSI","year":2016,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Mitacs","keywords":"Beamforming; Computer science; MIMO; Relay; Artificial noise; Physical layer; Node (physics); Signal-to-noise ratio (imaging); Channel (broadcasting); Mathematical optimization; Computer network; Wireless; Telecommunications; Mathematics; Engineering; Power (physics)","score_opus":0.02768781403102748,"score_gpt":0.2228138383688331,"score_spread":0.1951260243378056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591260756","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.0013463163,0.000066218985,0.997929,0.00003093365,0.000010576451,0.000010430756,0.000012858088,0.000052256597,0.00054143404],"genre_scores_gemma":[0.33340862,0.0011692862,0.65971786,0.00015417974,0.0001292976,0.00029439898,0.00019417827,0.00008022316,0.0048519187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934274,0.0002131953,0.000031247568,0.00010894933,0.00024972597,0.000054149263],"domain_scores_gemma":[0.99908817,0.00045750788,0.00013524262,0.00009780227,0.00019227168,0.000028981105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010591737,0.0014166833,0.0008101252,0.00030698002,0.00023892387,0.00088823476,0.00086136675,0.0010549874,0.0023851932],"category_scores_gemma":[0.0021608358,0.0005410977,0.00063760765,0.00047759523,0.00069634913,0.0008619078,0.00074690254,0.0008849141,0.0013537672],"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.00014188985,0.0000465165,0.0003724311,0.0002227887,0.000089064284,0.00017182497,0.00013084376,0.8349855,0.037224073,0.035575405,0.001475995,0.08956373],"study_design_scores_gemma":[0.000021997772,0.00014649476,0.00010838303,0.000013181134,0.000020359304,0.00008775535,0.000017234219,0.98816586,0.0049737776,0.005090198,0.001340076,0.000014581214],"about_ca_topic_score_codex":0.00077951275,"about_ca_topic_score_gemma":0.0010760962,"teacher_disagreement_score":0.0023851932,"about_ca_system_score_codex":0.00043161772,"about_ca_system_score_gemma":0.00088487315,"threshold_uncertainty_score":0.007979274},"labels":[],"label_agreement":null},{"id":"W2593532667","doi":"10.1155/2017/7843843","title":"A Novel Secure Transmission Scheme in MIMO Two-Way Relay Channels with Physical Layer Approach","year":2017,"lang":"en","type":"article","venue":"Mobile Information Systems","topic":"Wireless Communication Security 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":"University of Waterloo","funders":"","keywords":"Computer science; Relay; Encryption; MIMO; Transmission (telecommunications); Precoding; Algorithm; Physical layer; Secure transmission; Artificial noise; Computer network; Channel (broadcasting); Wireless; Telecommunications","score_opus":0.017416615914933802,"score_gpt":0.2528230382034693,"score_spread":0.2354064222885355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593532667","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.027810926,0.00066733547,0.9629343,0.00051465747,0.00020093382,0.00019031053,0.00013285778,0.00042801624,0.0071207033],"genre_scores_gemma":[0.88496125,0.00060679123,0.10743775,0.00026311586,0.00013772637,0.00016533233,0.00010586134,0.000029266195,0.006292792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823976,0.0005259869,0.00013381202,0.0002999579,0.0005117676,0.00028868357],"domain_scores_gemma":[0.9981509,0.00062053476,0.0002933507,0.0005193754,0.00031847472,0.00009728217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011501899,0.0009169307,0.00075744017,0.0006604934,0.0011105303,0.0011749818,0.001127401,0.0014348583,0.0023272599],"category_scores_gemma":[0.0023420537,0.00035337996,0.00086800166,0.00073377736,0.001052184,0.0024480345,0.0021673443,0.0012315249,0.0006613261],"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.0010214758,0.00020603555,0.0014034507,0.0005846239,0.00029623232,0.0016807723,0.0011788494,0.20134194,0.14040585,0.50581944,0.006465504,0.13959579],"study_design_scores_gemma":[0.00014959213,0.00057918037,0.0003878334,0.00006383765,0.00014919548,0.0016317631,0.00012974003,0.89890254,0.037501857,0.051017325,0.0093453545,0.00014181872],"about_ca_topic_score_codex":0.000639572,"about_ca_topic_score_gemma":0.000513062,"teacher_disagreement_score":0.0023272599,"about_ca_system_score_codex":0.0008545597,"about_ca_system_score_gemma":0.00096201914,"threshold_uncertainty_score":0.007785499},"labels":[],"label_agreement":null},{"id":"W2596303574","doi":"","title":"Non-Cryptography Authentication for Wireless Communications Based on Two Uncorrelated Attributes","year":2013,"lang":"en","type":"article","venue":"International Journal of Computer and Internet Security","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":"Université Laval; Western University","funders":"","keywords":"Spoofing attack; Computer science; Transmitter; Physical layer; Authentication (law); Wireless; Computer network; Cryptography; Channel (broadcasting); Computer security; Telecommunications","score_opus":0.012284990889807517,"score_gpt":0.2649545303839524,"score_spread":0.2526695394941449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2596303574","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.053698026,0.0025034887,0.92869073,0.0006592886,0.0004682242,0.0002265193,0.000085550164,0.00034387497,0.013324254],"genre_scores_gemma":[0.87715536,0.0013959657,0.11208102,0.00016707982,0.00021203778,0.00016431327,0.0001364345,0.000024541712,0.008663266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971214,0.0008255424,0.0002519537,0.00045945458,0.0011438655,0.00019777147],"domain_scores_gemma":[0.9971499,0.0007822177,0.00054972735,0.0009372381,0.00051366404,0.000067261084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014149736,0.00046100258,0.00052088354,0.0008723389,0.00082681363,0.0014761166,0.0007575907,0.0008405753,0.0024810608],"category_scores_gemma":[0.0041922526,0.000196739,0.0004995374,0.0009693884,0.001231427,0.003402061,0.0015216259,0.0012134503,0.001352427],"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.0010199226,0.00015978125,0.0040116305,0.0006406738,0.00010454125,0.0008751591,0.0005419909,0.01464292,0.12249294,0.5747695,0.0031860622,0.27755487],"study_design_scores_gemma":[0.00019715937,0.0012258138,0.005981185,0.00035117133,0.00018165336,0.003671524,0.00031917088,0.60350657,0.13942884,0.17872027,0.06615936,0.0002573312],"about_ca_topic_score_codex":0.0002867119,"about_ca_topic_score_gemma":0.00030637186,"teacher_disagreement_score":0.0024810608,"about_ca_system_score_codex":0.0008214156,"about_ca_system_score_gemma":0.0010617878,"threshold_uncertainty_score":0.008300006},"labels":[],"label_agreement":null},{"id":"W2598134248","doi":"10.1007/978-3-319-62389-4_17","title":"Information Complexity of the AND Function in the Two-Party and Multi-party Settings","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Generalization; Function (biology); Theoretical computer science; Mathematics","score_opus":0.02730523446569865,"score_gpt":0.25464198189135845,"score_spread":0.2273367474256598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598134248","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.15009159,0.0061596255,0.73378986,0.012895107,0.00045365372,0.0002851632,0.0018167985,0.00040583394,0.09410243],"genre_scores_gemma":[0.90487826,0.004670074,0.06393779,0.0008198143,0.0011865275,0.0004924095,0.00083939685,0.00030099356,0.022874676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99333465,0.0025839978,0.00030584834,0.0008579611,0.0018512034,0.0010663047],"domain_scores_gemma":[0.955647,0.036446262,0.0016414399,0.0037107123,0.0017600661,0.0007945566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057505383,0.0015185103,0.0028424258,0.0015991924,0.0017404931,0.0070577976,0.003126453,0.0028413988,0.010180502],"category_scores_gemma":[0.026249742,0.0009591386,0.002087549,0.0022996627,0.00439224,0.014685387,0.0037864882,0.006611399,0.0011782096],"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.0001684589,0.000051928073,0.00035223874,0.00017059977,0.000040868887,0.00010557261,0.00017485708,0.024657082,0.00056724844,0.9558016,0.004381174,0.013528322],"study_design_scores_gemma":[0.00002435283,0.000027447475,0.00024683747,0.00003929435,0.000022584289,0.00013709847,0.000045023924,0.095529005,0.00032967186,0.9024151,0.0011559193,0.000027684493],"about_ca_topic_score_codex":0.0014970782,"about_ca_topic_score_gemma":0.0009872881,"teacher_disagreement_score":0.010180502,"about_ca_system_score_codex":0.0055317665,"about_ca_system_score_gemma":0.0034100423,"threshold_uncertainty_score":0.04013604},"labels":[],"label_agreement":null},{"id":"W2598183357","doi":"10.1109/vtcfall.2016.7881036","title":"Hybrid Digital-Analog Communication of a Bivariate Gaussian Source over a Fading MAC","year":2016,"lang":"en","type":"article","venue":"","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":"University of Manitoba","funders":"","keywords":"Rayleigh fading; Fading; Computer science; Channel state information; Gaussian; Bivariate analysis; Decoding methods; Channel (broadcasting); Algorithm; Coding (social sciences); Electronic engineering; Wireless; Mathematics; Telecommunications; Statistics; Engineering; Physics","score_opus":0.01049256804296327,"score_gpt":0.2273523995437463,"score_spread":0.21685983150078303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598183357","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.078352064,0.0004590615,0.91844106,0.0002761672,0.00003602248,0.00003544192,0.000057831836,0.00011382568,0.0022285192],"genre_scores_gemma":[0.97595793,0.00027872002,0.022765247,0.000039587117,0.000025515552,0.000025000161,0.000020553436,0.0000062410527,0.00088126806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991679,0.00036401453,0.000035829973,0.00010362528,0.00022295264,0.000105595966],"domain_scores_gemma":[0.9975083,0.001743511,0.00026262074,0.00014286599,0.0002678671,0.000074697644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017349768,0.00085837656,0.0008815297,0.00047637828,0.00042793504,0.0009300644,0.0006411148,0.0007192163,0.0011332446],"category_scores_gemma":[0.0038214035,0.00024345955,0.00041255518,0.000811845,0.0011208048,0.0011227974,0.0014279548,0.0006139117,0.000112225964],"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.00015815484,0.000019809884,0.00045540277,0.00009048982,0.000029560191,0.00021616647,0.00007124458,0.94335705,0.004112103,0.03826509,0.0002624317,0.01296254],"study_design_scores_gemma":[0.0000068841596,0.000039164377,0.000052633073,0.0000040482046,0.000011844897,0.000032580134,0.000009571063,0.995231,0.00085704756,0.0036437304,0.000105909334,0.000005538688],"about_ca_topic_score_codex":0.0023242193,"about_ca_topic_score_gemma":0.0015464864,"teacher_disagreement_score":0.0023242193,"about_ca_system_score_codex":0.0009345867,"about_ca_system_score_gemma":0.000681804,"threshold_uncertainty_score":0.009175539},"labels":[],"label_agreement":null},{"id":"W2598653415","doi":"10.1007/s11042-017-4635-8","title":"A joint correlation noise estimation and decoding algorithm for distributed video coding","year":2017,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Queensland Cyber Infrastructure Foundation","keywords":"Computer science; Decoding methods; Algorithm; Codec; Coding (social sciences); Mathematics; Statistics; Telecommunications","score_opus":0.033750701977782155,"score_gpt":0.2830928958208927,"score_spread":0.24934219384311054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598653415","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.0015241884,0.00008369971,0.99782723,0.000043626187,0.000023106937,0.000012352456,0.000017366858,0.00021245358,0.00025602],"genre_scores_gemma":[0.07252438,0.00028324442,0.92314863,0.00012325366,0.000092687114,0.00013886066,0.00026179914,0.00012051923,0.0033065744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880004,0.00030889263,0.000071769,0.00020546469,0.000510458,0.000103339065],"domain_scores_gemma":[0.9982408,0.00079331885,0.00013069059,0.0003055505,0.00047116083,0.00005857842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014189477,0.0010997348,0.0012567646,0.0008875013,0.00064785534,0.001036379,0.0012617415,0.0015936147,0.0021753346],"category_scores_gemma":[0.0050144913,0.0006761975,0.000874254,0.0012448428,0.0006518026,0.0016003653,0.0019431879,0.0019814512,0.0016548984],"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.0005657183,0.0001610535,0.0008353752,0.00012683489,0.00017125101,0.00012916328,0.00015307101,0.24436833,0.040331207,0.037238754,0.0044541066,0.67146516],"study_design_scores_gemma":[0.00003941889,0.000071438866,0.00025351736,0.00001778666,0.00003315079,0.00013663968,0.0000144108235,0.9780045,0.011031238,0.008203432,0.0021637161,0.000030760715],"about_ca_topic_score_codex":0.004709548,"about_ca_topic_score_gemma":0.0072537684,"teacher_disagreement_score":0.004709548,"about_ca_system_score_codex":0.00083794945,"about_ca_system_score_gemma":0.0024342441,"threshold_uncertainty_score":0.009364247},"labels":[],"label_agreement":null},{"id":"W2601472403","doi":"10.1109/vtcfall.2016.7881217","title":"Secrecy Performance of Dual-Hop Threshold Relaying System with Diversity Reception","year":2016,"lang":"en","type":"preprint","venue":"","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":"Memorial University of Newfoundland","funders":"","keywords":"Relay; Secrecy; Computer science; Ergodic theory; Channel state information; Signal-to-noise ratio (imaging); Computer network; Maximal-ratio combining; Hop (telecommunications); Diversity gain; Channel (broadcasting); Outage probability; Wireless; Topology (electrical circuits); Telecommunications; Fading; Mathematics; Physics; Electrical engineering; Computer security; Engineering; Power (physics)","score_opus":0.020279885832005504,"score_gpt":0.2159029881624554,"score_spread":0.19562310233044988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601472403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81249833,0.00138446,0.17403841,0.00045214334,0.000078324374,0.00003810191,0.00018041332,0.00027020814,0.011059548],"genre_scores_gemma":[0.99796885,0.00016971599,0.0014044371,0.000013904246,0.000009691753,0.000005390904,0.000025019528,0.000005513196,0.00039752387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986064,0.00047340652,0.00007384159,0.00018494965,0.00027382627,0.00038763357],"domain_scores_gemma":[0.9956654,0.00255687,0.00044198707,0.00037583645,0.00081076846,0.00014911196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016893946,0.0010349009,0.0011626646,0.0007118481,0.00089394127,0.0014949605,0.00064161996,0.0012045645,0.0012007236],"category_scores_gemma":[0.0035067112,0.00038926027,0.0006061248,0.00067762804,0.0013963624,0.0016532133,0.0013306659,0.0007340736,0.0003690017],"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.0018241359,0.0000936356,0.005937781,0.00030736005,0.00024766463,0.0013538554,0.0006017444,0.9027171,0.04280091,0.0291989,0.0006974385,0.014219525],"study_design_scores_gemma":[0.000041478695,0.00030210044,0.0007607892,0.00001628789,0.0000761086,0.00041904565,0.00012110419,0.98423415,0.00943688,0.0043792753,0.00017188229,0.00004082099],"about_ca_topic_score_codex":0.0024903836,"about_ca_topic_score_gemma":0.0013660567,"teacher_disagreement_score":0.0024903836,"about_ca_system_score_codex":0.0010913132,"about_ca_system_score_gemma":0.0010671563,"threshold_uncertainty_score":0.008934438},"labels":[],"label_agreement":null},{"id":"W2611822227","doi":"10.48550/arxiv.1705.01596","title":"Capacity of Burst Noise-Erasure Channels With and Without Feedback and Input Cost","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Erasure; Binary erasure channel; Channel capacity; Entropy (arrow of time); Channel (broadcasting); Upper and lower bounds; Markov chain; Noise (video); Control theory (sociology); Markov process; Computer science; Mathematics; Topology (electrical circuits); Telecommunications; Combinatorics; Physics; Statistics","score_opus":0.06700782821878426,"score_gpt":0.1967173244308889,"score_spread":0.12970949621210465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611822227","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.2951101,0.002053015,0.66907704,0.001175248,0.00016386031,0.00011537681,0.0008613596,0.00053096213,0.030913088],"genre_scores_gemma":[0.9768162,0.0006228363,0.019285876,0.00008038303,0.00006645063,0.00014279554,0.00014947627,0.00006758364,0.002768387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982101,0.0006056294,0.00006512396,0.00021542958,0.00046837766,0.00043547654],"domain_scores_gemma":[0.98604125,0.011292755,0.00064512744,0.0007867881,0.0010239665,0.00021015792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018116954,0.0009767495,0.00088187493,0.0011293826,0.0008754531,0.0021463465,0.0012360805,0.0009612097,0.0029516094],"category_scores_gemma":[0.01360689,0.00031252403,0.00044775696,0.0012866792,0.0025243845,0.0027885546,0.0016800273,0.001314908,0.00033130674],"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.0004572449,0.00007569466,0.0005638878,0.00023462948,0.000040333503,0.00027699312,0.00024249703,0.43047372,0.008213989,0.5384578,0.00198246,0.018980863],"study_design_scores_gemma":[0.00001381613,0.00004154798,0.00021000275,0.00003965205,0.000015147851,0.0000961426,0.00005023496,0.8633165,0.0048880777,0.13029137,0.0010052714,0.000032304662],"about_ca_topic_score_codex":0.0019055523,"about_ca_topic_score_gemma":0.0011585988,"teacher_disagreement_score":0.0029516094,"about_ca_system_score_codex":0.002624245,"about_ca_system_score_gemma":0.0018130211,"threshold_uncertainty_score":0.019040287},"labels":[],"label_agreement":null},{"id":"W2617309511","doi":"10.1109/tcomm.2017.2708110","title":"Joint Transceiver Design for Secure Downlink Communications Over an Amplify-and-Forward MIMO Relay","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Relay; Artificial noise; Telecommunications link; Computer science; Beamforming; Base station; Transceiver; MIMO; Mathematical optimization; Constraint (computer-aided design); Covariance matrix; Computer network; Wireless; Power (physics); Algorithm; Mathematics; Telecommunications; Physical layer","score_opus":0.09634926893443778,"score_gpt":0.326003359148615,"score_spread":0.2296540902141772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617309511","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.006996878,0.000077239514,0.99186325,0.000054468328,0.000011745434,0.000020902507,0.000016468533,0.000079755235,0.0008793829],"genre_scores_gemma":[0.6928549,0.0004973757,0.30215588,0.00011181133,0.000060791866,0.00022424337,0.00012945614,0.00006479177,0.0039007682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989779,0.00035504744,0.000051233623,0.00015953451,0.0003529787,0.00010339749],"domain_scores_gemma":[0.99924314,0.00032528446,0.00013440925,0.0000818901,0.0001731728,0.000042092754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001273921,0.0011767717,0.0008500966,0.0003889242,0.00039188896,0.0009962796,0.000766234,0.0008724482,0.0018124724],"category_scores_gemma":[0.0022185629,0.0004160931,0.0005299612,0.00055997027,0.00058338826,0.0010502908,0.001149922,0.0009381312,0.00067589217],"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.00010179989,0.000060036626,0.0005577634,0.00013585706,0.000053174892,0.00023297583,0.00013607657,0.9034907,0.019086812,0.023000052,0.0010981411,0.052046604],"study_design_scores_gemma":[0.000011818726,0.00007928474,0.000049962833,0.0000045501765,0.000012511357,0.000059447197,0.000014618905,0.99444604,0.0028289198,0.0019549185,0.00053037895,0.000007490706],"about_ca_topic_score_codex":0.0010570297,"about_ca_topic_score_gemma":0.0011782438,"teacher_disagreement_score":0.0018124724,"about_ca_system_score_codex":0.0005390964,"about_ca_system_score_gemma":0.0012167089,"threshold_uncertainty_score":0.0067371726},"labels":[],"label_agreement":null},{"id":"W2682285226","doi":"10.1109/ccece.2017.7946837","title":"Nash equilibria of deception strategies in the IEEE 802.22 cognitive radio networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Deception; Jamming; Nash equilibrium; Computer security; Computer science; Cognitive radio; Strategy; Incentive; Channel (broadcasting); Game theory; Computer network; Scheme (mathematics); Telecommunications; Wireless; Mathematical optimization; Mathematical economics; Mathematics; Economics; Microeconomics; Psychology","score_opus":0.02550530200327614,"score_gpt":0.29161642269826166,"score_spread":0.2661111206949855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2682285226","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.19456452,0.0006245643,0.77391416,0.00080642157,0.00006796798,0.00013677073,0.00006230191,0.00010346113,0.029719802],"genre_scores_gemma":[0.9776422,0.00030531056,0.018479306,0.000089758316,0.000017292452,0.00011219896,0.00001580465,0.000011956344,0.0033262323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980089,0.001106241,0.00007236411,0.00018654345,0.00035409455,0.0002719036],"domain_scores_gemma":[0.9958983,0.0028305638,0.00057018915,0.00014501486,0.00039836834,0.00015743794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002211824,0.00094079546,0.00077245466,0.0007816636,0.00082331354,0.0023536896,0.0011802291,0.0015752817,0.0019959793],"category_scores_gemma":[0.0108975,0.00044228806,0.0006385591,0.0005479327,0.00211887,0.0022400825,0.0015333351,0.0013099432,0.00033478122],"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.00019077453,0.0000819768,0.00096796115,0.00015075109,0.00009135218,0.0005411468,0.0005248862,0.408321,0.0041676657,0.569656,0.0008867577,0.014419733],"study_design_scores_gemma":[0.00003520666,0.00008557973,0.00026241297,0.00003067443,0.00001695194,0.00012947097,0.00012559185,0.8703079,0.0007948409,0.12741935,0.00076182967,0.000030156703],"about_ca_topic_score_codex":0.00270238,"about_ca_topic_score_gemma":0.0015976242,"teacher_disagreement_score":0.00270238,"about_ca_system_score_codex":0.0016962497,"about_ca_system_score_gemma":0.0011253742,"threshold_uncertainty_score":0.012307167},"labels":[],"label_agreement":null},{"id":"W2699584971","doi":"10.1109/tcomm.2017.2764892","title":"Secure Broadcasting Using Independent Secret Keys","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":34,"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 Toronto","funders":"National Science Foundation","keywords":"Computer science; Broadcasting (networking); Computer network; Transmitter; Channel (broadcasting); Coding (social sciences); Channel capacity; Encryption; Computer security; Topology (electrical circuits); Mathematics","score_opus":0.07183492949968856,"score_gpt":0.31641869231116115,"score_spread":0.2445837628114726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2699584971","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.0454591,0.00084435457,0.9381218,0.0008515119,0.00008163548,0.00007520161,0.00018429538,0.00020431257,0.014177783],"genre_scores_gemma":[0.8832252,0.0025496213,0.10202983,0.00017066076,0.00024989614,0.00019613862,0.00029421775,0.00011673145,0.01116779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974617,0.000886241,0.00010757713,0.00035625958,0.00072454807,0.00046366453],"domain_scores_gemma":[0.99333763,0.0048845243,0.0005552917,0.0006624024,0.00043441888,0.0001257904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018704971,0.0010185767,0.0014070837,0.0008767307,0.0009404831,0.0021574856,0.0012760413,0.0019164801,0.0035134829],"category_scores_gemma":[0.008956195,0.00065124495,0.0008171386,0.0018262871,0.0022409076,0.005772461,0.0024435727,0.0022390287,0.000890441],"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.00046847842,0.000060093873,0.00036533497,0.0004667891,0.00007810796,0.00042972266,0.00044025722,0.28991115,0.01450375,0.6588752,0.0030254265,0.03137564],"study_design_scores_gemma":[0.000057045494,0.00010705338,0.00015026635,0.000038627124,0.00004739763,0.0002891944,0.00012526162,0.7281634,0.0065842005,0.26005492,0.004345858,0.0000367388],"about_ca_topic_score_codex":0.0011198801,"about_ca_topic_score_gemma":0.00066389126,"teacher_disagreement_score":0.0035134829,"about_ca_system_score_codex":0.002007972,"about_ca_system_score_gemma":0.0014492957,"threshold_uncertainty_score":0.0145689845},"labels":[],"label_agreement":null},{"id":"W2715771073","doi":"10.1109/ccece.2017.7946684","title":"Using friendly jamming to improve route security and quality in ad hoc networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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 British Columbia","funders":"","keywords":"Jamming; Computer science; Computer network; Physical layer; Wireless ad hoc network; Secrecy; Quality of service; Node (physics); Wireless; Context (archaeology); Computer security; Telecommunications; Engineering","score_opus":0.03793189262137717,"score_gpt":0.3283764090397458,"score_spread":0.29044451641836866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2715771073","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.10842572,0.0008723762,0.88780516,0.0001470355,0.000030287503,0.00003519055,0.000017280536,0.00021761461,0.002449393],"genre_scores_gemma":[0.94645983,0.0007678378,0.051942516,0.00003677672,0.00002969353,0.000019299445,0.000016677097,0.000030263132,0.0006970032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992106,0.0003689717,0.000036324058,0.0000639663,0.0002331715,0.00008691711],"domain_scores_gemma":[0.9988117,0.0005919981,0.00023810678,0.00014566506,0.0001572033,0.000055375713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092816417,0.0009895274,0.00046773427,0.00071587344,0.000368306,0.0009517531,0.0004975243,0.00060976826,0.00037334475],"category_scores_gemma":[0.0030960254,0.00038983347,0.00032960926,0.0007386193,0.0007713333,0.0011200844,0.0010890227,0.0004515929,0.00015249473],"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.00011055772,0.000054366417,0.0015675846,0.00010938125,0.000087474546,0.00014795529,0.00011979545,0.8927644,0.038584284,0.012639005,0.00034835213,0.053466883],"study_design_scores_gemma":[0.000012256937,0.00034250578,0.000814968,0.000012248406,0.000054036325,0.00018823371,0.000060075206,0.9808381,0.010046022,0.0066121537,0.0009991331,0.000020209198],"about_ca_topic_score_codex":0.0005037051,"about_ca_topic_score_gemma":0.0008551242,"teacher_disagreement_score":0.0009895274,"about_ca_system_score_codex":0.00035183385,"about_ca_system_score_gemma":0.00034504902,"threshold_uncertainty_score":0.004908681},"labels":[],"label_agreement":null},{"id":"W2726729862","doi":"10.1109/tcomm.2017.2723565","title":"Secure Massive MIMO Relaying Systems in a Poisson Field of Eavesdroppers","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Electrical, Communications and Cyber Systems; Engineering and Physical Sciences Research Council; Queen's University; Queen's University Belfast; Australian Research Council; Royal Academy of Engineering; Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Relay; Channel state information; Computer network; Telecommunications link; Computer science; MIMO; Transmission (telecommunications); Reliability (semiconductor); Secure transmission; Poisson point process; Signal-to-noise ratio (imaging); Channel (broadcasting); Antenna (radio); Power (physics); Wireless; Poisson distribution; Telecommunications; Mathematics; Encryption; Physics; Statistics","score_opus":0.030768441062426512,"score_gpt":0.3004351606004512,"score_spread":0.26966671953802474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726729862","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.18765423,0.0017880575,0.798541,0.00073625706,0.00018956221,0.00013171339,0.00027430413,0.0002592301,0.01042556],"genre_scores_gemma":[0.9845675,0.0009773782,0.0095623415,0.00008546665,0.000085492735,0.00006972026,0.0000635625,0.000012572714,0.0045758653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984855,0.000548413,0.00007212391,0.00025416174,0.00034899422,0.0002908454],"domain_scores_gemma":[0.99418145,0.0034950455,0.0011240679,0.00029803076,0.00066196447,0.00023943608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002204556,0.0013723294,0.002407377,0.00095851003,0.0011992982,0.0020125513,0.0019809448,0.0018287549,0.0011621718],"category_scores_gemma":[0.004568952,0.00096654607,0.0010722271,0.0015785377,0.0021756566,0.0017864141,0.0023150987,0.0011381226,0.00039573226],"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.00022373474,0.00005072607,0.0010883178,0.000136393,0.00009551707,0.0017462476,0.00022373219,0.8968389,0.004889956,0.08875094,0.00073840463,0.005217135],"study_design_scores_gemma":[0.000020931098,0.00008338161,0.00018416725,0.000007324937,0.000027818623,0.00013731998,0.000056004377,0.99156946,0.00048871816,0.007185364,0.00021682167,0.000022704682],"about_ca_topic_score_codex":0.004943234,"about_ca_topic_score_gemma":0.002588569,"teacher_disagreement_score":0.004943234,"about_ca_system_score_codex":0.0017293937,"about_ca_system_score_gemma":0.0007471321,"threshold_uncertainty_score":0.012547731},"labels":[],"label_agreement":null},{"id":"W2733866746","doi":"10.1109/isit.2017.8007046","title":"Covert communication with noncausal channel-state information at the transmitter","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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 Toronto","funders":"","keywords":"Transmitter; Computer science; Covert channel; Channel (broadcasting); Covert; State (computer science); Channel state information; Information theory; Telecommunications; Wireless; Mathematics; Algorithm","score_opus":0.00821366698048766,"score_gpt":0.21478895497222936,"score_spread":0.20657528799174169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2733866746","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.08139223,0.0009957975,0.9030519,0.0015474389,0.00013458038,0.00010198585,0.00021153249,0.00013246003,0.012432076],"genre_scores_gemma":[0.9585459,0.0010589719,0.036503952,0.00019713845,0.00018218561,0.00014102871,0.00010384455,0.00003534744,0.0032316877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974009,0.00082302437,0.00009955627,0.00046764442,0.00077727955,0.00043174194],"domain_scores_gemma":[0.9798716,0.016429428,0.001513414,0.0014891622,0.00051445595,0.00018207147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023697296,0.0011793886,0.0016345334,0.0007829126,0.0010999417,0.0018330887,0.0014735857,0.0026444823,0.0021109963],"category_scores_gemma":[0.015053286,0.00064663205,0.001203027,0.0010203779,0.0039594765,0.0048733014,0.0029850248,0.0021467009,0.0003125431],"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.00035904275,0.00010150761,0.0011214626,0.0005186641,0.00014020708,0.0016278343,0.0004135835,0.590609,0.010793844,0.3731114,0.001653189,0.019550262],"study_design_scores_gemma":[0.000037053895,0.00008136033,0.00018716542,0.00004041842,0.000040891115,0.0005415444,0.000065680695,0.85478055,0.005119269,0.13798371,0.0010860403,0.00003624452],"about_ca_topic_score_codex":0.0007357467,"about_ca_topic_score_gemma":0.0004997272,"teacher_disagreement_score":0.0026444823,"about_ca_system_score_codex":0.0015313253,"about_ca_system_score_gemma":0.0010119611,"threshold_uncertainty_score":0.012532473},"labels":[],"label_agreement":null},{"id":"W2734691861","doi":"10.1109/iccchinaw.2015.7961602","title":"Secrecy analysis for forward link multi-user massive MIMO system with MRT precoding","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of British Columbia","funders":"","keywords":"Precoding; MIMO; Computer science; Transmitter power output; Topology (electrical circuits); Upper and lower bounds; Base station; Computer network; Antenna (radio); Secrecy; Transmission (telecommunications); Limit (mathematics); Telecommunications; Mathematics; Channel (broadcasting); Computer security; Transmitter","score_opus":0.0380650357393481,"score_gpt":0.267744421574124,"score_spread":0.22967938583477587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734691861","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.12259171,0.0038407869,0.8448085,0.0010575963,0.00012406455,0.0000725559,0.00038853774,0.0003393896,0.026776966],"genre_scores_gemma":[0.9814997,0.002339271,0.011976061,0.00013678473,0.00012353994,0.000057955265,0.00015439387,0.000048825477,0.0036634044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986833,0.00039359007,0.00005030245,0.00012393917,0.00046236053,0.00028647875],"domain_scores_gemma":[0.99625164,0.0019937614,0.00056677905,0.00022804945,0.0008619145,0.0000979815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001597098,0.0016294321,0.0012717394,0.0009960382,0.0008938331,0.0015071227,0.00066369545,0.0010378729,0.0027530782],"category_scores_gemma":[0.0040696044,0.0006145182,0.00093702885,0.0011695927,0.0016231269,0.001774235,0.0014260183,0.0010797781,0.0006727707],"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.00012636637,0.000023429418,0.0011585485,0.00018680318,0.00006443591,0.0005134825,0.00019667133,0.93662477,0.008957374,0.045458693,0.0008852156,0.0058042123],"study_design_scores_gemma":[0.0000047778376,0.000046049114,0.00031633445,0.000016994778,0.00001679486,0.00015110662,0.000042312528,0.992071,0.0014188366,0.0057085077,0.00018745127,0.000019868228],"about_ca_topic_score_codex":0.0041431696,"about_ca_topic_score_gemma":0.002638046,"teacher_disagreement_score":0.0041431696,"about_ca_system_score_codex":0.0015629437,"about_ca_system_score_gemma":0.0012165009,"threshold_uncertainty_score":0.0113399625},"labels":[],"label_agreement":null},{"id":"W2737300431","doi":"10.1109/twc.2017.2729541","title":"Optimal Beamforming for Gaussian MIMO Wiretap Channels With Two Transmit Antennas","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Precoding; MIMO; Beamforming; Computer science; Transmitter; Covariance; Channel (broadcasting); Gaussian; Mathematical optimization; Channel capacity; Topology (electrical circuits); Mathematics; Telecommunications; Statistics; Physics","score_opus":0.04069246104871444,"score_gpt":0.2996016540926724,"score_spread":0.258909193043958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737300431","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.02089748,0.0002785505,0.9752601,0.00018978327,0.000026345517,0.000017290637,0.0000714331,0.00007640105,0.0031826699],"genre_scores_gemma":[0.83833796,0.0018228333,0.15446521,0.00014679256,0.000071764975,0.0001234852,0.00020950662,0.00005684499,0.0047656004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993723,0.00026427102,0.000018539578,0.00007857998,0.00017099337,0.00009527204],"domain_scores_gemma":[0.9986634,0.00088101847,0.00015388147,0.00007219299,0.00018588327,0.000043611642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006468879,0.0009239136,0.0007196791,0.00031696077,0.00029717828,0.00083526975,0.00044280966,0.00083798985,0.0012343386],"category_scores_gemma":[0.002452124,0.0004344031,0.00033857653,0.00094299053,0.0012055988,0.0010783318,0.0007117576,0.00079188804,0.0004914077],"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.000121004676,0.000029165325,0.0004433567,0.00014392345,0.00003320357,0.00030890998,0.00009071107,0.89159566,0.01032369,0.07063235,0.001232303,0.025045667],"study_design_scores_gemma":[0.000013719536,0.000036740035,0.00010392264,0.000011714109,0.0000062516847,0.000070703354,0.000033177334,0.98252755,0.0022847278,0.014521797,0.00037676247,0.000012983636],"about_ca_topic_score_codex":0.001542758,"about_ca_topic_score_gemma":0.0018111778,"teacher_disagreement_score":0.001542758,"about_ca_system_score_codex":0.00058127416,"about_ca_system_score_gemma":0.00087191217,"threshold_uncertainty_score":0.0042175055},"labels":[],"label_agreement":null},{"id":"W2738208647","doi":"10.1109/lwc.2017.2731840","title":"Physical Layer Security in Ultra-Dense Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Physical layer; Secrecy; Stochastic geometry; Computer science; Rician fading; Fading; Computer network; Wireless; Channel (broadcasting); Telecommunications; Mathematics; Computer security; Statistics","score_opus":0.025510955519572345,"score_gpt":0.2852912983913028,"score_spread":0.25978034287173046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738208647","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.33710518,0.0029392191,0.64844704,0.00076503743,0.00009453238,0.000046449528,0.00009147742,0.00013233653,0.010378754],"genre_scores_gemma":[0.9923503,0.00091703935,0.006012649,0.00004976557,0.000035500143,0.00001525378,0.000013923524,0.0000066891866,0.00059889077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992398,0.0003432715,0.000021026135,0.00006724039,0.0001750375,0.00015367659],"domain_scores_gemma":[0.99728477,0.0017266924,0.0004658352,0.00021801236,0.00023254838,0.00007223943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011976862,0.0007590732,0.00073069375,0.00047873196,0.00061985635,0.0011798819,0.0006104093,0.0006435801,0.00063561514],"category_scores_gemma":[0.0039297626,0.0004146494,0.0003414407,0.0005580053,0.0019604166,0.0022344016,0.0017488895,0.0008801286,0.000116633615],"study_design_candidate":"not_applicable","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.000074207914,0.000033765293,0.0014637336,0.00011336418,0.00003622777,0.0005285224,0.00019248106,0.8916917,0.0072251707,0.09075079,0.0005561893,0.007333865],"study_design_scores_gemma":[0.000006201709,0.0000551909,0.00066324015,0.000015963155,0.000010262598,0.00017498831,0.00008854835,0.9751251,0.0009550881,0.022485578,0.00040888775,0.000010886082],"about_ca_topic_score_codex":0.0017638693,"about_ca_topic_score_gemma":0.0012029547,"teacher_disagreement_score":0.0017638693,"about_ca_system_score_codex":0.0008644068,"about_ca_system_score_gemma":0.0005027091,"threshold_uncertainty_score":0.006334007},"labels":[],"label_agreement":null},{"id":"W2740798375","doi":"10.1109/cwit.2017.7994823","title":"Physical layer secrecy for wireless communication systems using adaptive HARQ with error contamination","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"Université Laval","funders":"","keywords":"Retransmission; Computer science; Hybrid automatic repeat request; Network packet; Decoding methods; Computer network; Physical layer; Error detection and correction; Wireless; Channel (broadcasting); Low-density parity-check code; Automatic repeat request; Real-time computing; Algorithm; Telecommunications; Telecommunications link","score_opus":0.06526737039360916,"score_gpt":0.3151175450374748,"score_spread":0.24985017464386564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740798375","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.023499476,0.00041039704,0.9737872,0.00020134104,0.000055929482,0.000044605244,0.000019180636,0.0002706721,0.0017112431],"genre_scores_gemma":[0.8768661,0.0005471925,0.12013573,0.00017430147,0.000099321565,0.00008377908,0.000044009583,0.000033849938,0.0020156736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986739,0.00045360072,0.00006788497,0.00013816374,0.00053306884,0.00013336916],"domain_scores_gemma":[0.99773175,0.00096939324,0.00029904683,0.00058807334,0.00035047127,0.0000612773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017651251,0.0006505979,0.0005983981,0.0005611607,0.00092597667,0.0010164856,0.0008736107,0.00071261305,0.00080207025],"category_scores_gemma":[0.0033989619,0.00028861413,0.00048667946,0.0006422921,0.0014046009,0.0015189723,0.0022207026,0.0011680996,0.00028213815],"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.00061003264,0.00015148507,0.0025377532,0.00041452915,0.00020216116,0.0012688028,0.0009441368,0.32098523,0.12226489,0.3435539,0.0024458913,0.20462106],"study_design_scores_gemma":[0.000050722134,0.00027434435,0.00042514288,0.00004502672,0.00006705533,0.0005043054,0.000066180386,0.9452172,0.01914548,0.030080754,0.0040560416,0.00006772177],"about_ca_topic_score_codex":0.0005813124,"about_ca_topic_score_gemma":0.00053118303,"teacher_disagreement_score":0.0017651251,"about_ca_system_score_codex":0.00053727074,"about_ca_system_score_gemma":0.0007708626,"threshold_uncertainty_score":0.009335041},"labels":[],"label_agreement":null},{"id":"W2740981266","doi":"10.1109/cwit.2017.7994825","title":"Secrecy rate maximization for MIMO wiretap channels with channel uncertainty","year":2017,"lang":"en","type":"article","venue":"","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":"Université Laval","funders":"","keywords":"MIMO; Channel state information; Computer science; Maximization; Covariance matrix; Channel (broadcasting); Transmitter; Covariance; Constraint (computer-aided design); Imperfect; Mathematical optimization; Secrecy; Precoding; Algorithm; Wireless; Telecommunications; Mathematics; Statistics; Computer security","score_opus":0.025786760086577085,"score_gpt":0.2579721903196186,"score_spread":0.2321854302330415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740981266","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.04188141,0.0008839753,0.9511275,0.00030682364,0.000035668876,0.000031845895,0.00014248934,0.0001414846,0.005448744],"genre_scores_gemma":[0.9526885,0.001801674,0.041993953,0.000065901484,0.000083083854,0.00010983826,0.00015589326,0.00007174568,0.0030293963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825186,0.00088552234,0.000063187465,0.00016548413,0.0003925118,0.00024142617],"domain_scores_gemma":[0.9934187,0.005055767,0.0006225788,0.00025704235,0.0005457714,0.00010012252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022501007,0.0013992605,0.0015017528,0.00064781395,0.0005035638,0.0016556989,0.0008306539,0.001150796,0.001487055],"category_scores_gemma":[0.0057527004,0.0006648353,0.00075638783,0.0017326517,0.001773677,0.0018492885,0.0017540557,0.0012845345,0.0004828028],"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.00011888088,0.000020628475,0.0002681243,0.00015169248,0.000046028945,0.00027366797,0.00008106268,0.955255,0.0042836666,0.03042319,0.0005725448,0.008505487],"study_design_scores_gemma":[0.000007792083,0.000035629007,0.00008700149,0.000011655211,0.000010735912,0.000060879433,0.000022946324,0.98916185,0.002207775,0.008174663,0.00020582366,0.000013172065],"about_ca_topic_score_codex":0.0014943093,"about_ca_topic_score_gemma":0.0009257698,"teacher_disagreement_score":0.0022501007,"about_ca_system_score_codex":0.00094120967,"about_ca_system_score_gemma":0.0011009695,"threshold_uncertainty_score":0.011899829},"labels":[],"label_agreement":null},{"id":"W2741407548","doi":"10.1109/cwit.2017.7994830","title":"On linear analog coding of sources with memory over fading and broadcast channels with correlated noise","year":2017,"lang":"en","type":"article","venue":"","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":"University of Manitoba","funders":"","keywords":"Fading; Encoder; Rayleigh fading; Algorithm; Computer science; Channel state information; Decoding methods; Quantization (signal processing); Mathematics; Telecommunications; Wireless","score_opus":0.013412706534979401,"score_gpt":0.23667627639876943,"score_spread":0.22326356986379003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741407548","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.08728086,0.0012231463,0.9054721,0.0002054319,0.000034933564,0.000041977404,0.000058719692,0.00010892129,0.005573843],"genre_scores_gemma":[0.9574084,0.0014344534,0.03801705,0.000050415605,0.0000598663,0.00004867852,0.000087635126,0.00002192845,0.0028713963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995653,0.00017419562,0.000013875224,0.00004014439,0.00015450695,0.000051952193],"domain_scores_gemma":[0.99826413,0.0013394592,0.00015396113,0.00007778833,0.00014763194,0.000016930791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080071774,0.0006009927,0.00059677,0.0003257074,0.00018115311,0.00051734026,0.00051272835,0.00040939508,0.0010088168],"category_scores_gemma":[0.00287899,0.0002133771,0.00025248458,0.00073830545,0.0008205203,0.00078212144,0.0007047481,0.00045868,0.00013273097],"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.00011681201,0.000017487439,0.00028960456,0.00008436207,0.00002738556,0.00009801471,0.000062681094,0.93833995,0.0049331496,0.030182675,0.00034076147,0.0255072],"study_design_scores_gemma":[0.000005407027,0.00003859008,0.000077448356,0.0000065717622,0.000008741004,0.000032694243,0.000008425918,0.99501365,0.0014015388,0.0032382074,0.00016334653,0.0000054361417],"about_ca_topic_score_codex":0.0035492158,"about_ca_topic_score_gemma":0.0027356006,"teacher_disagreement_score":0.0035492158,"about_ca_system_score_codex":0.00062689313,"about_ca_system_score_gemma":0.0007207096,"threshold_uncertainty_score":0.0070571303},"labels":[],"label_agreement":null},{"id":"W2742332316","doi":"","title":"Intrinsic capacity","year":2017,"lang":"en","type":"article","venue":"International Symposium on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McMaster University","funders":"","keywords":"Generalization; Binary number; Channel (broadcasting); Encoder; Realization (probability); State (computer science); Mathematics; Convex combination; Regular polygon; Channel capacity; Topology (electrical circuits); Computer science; Algorithm; Convex optimization; Combinatorics; Mathematical analysis; Telecommunications; Statistics; Arithmetic","score_opus":0.01188079133535296,"score_gpt":0.24096647797940265,"score_spread":0.22908568664404969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742332316","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.09064012,0.0013635628,0.8288522,0.0012854497,0.00015532575,0.00009320358,0.0028372703,0.00044143488,0.07433152],"genre_scores_gemma":[0.92519957,0.0020706789,0.05751572,0.0003251538,0.000303424,0.00031869084,0.0013430469,0.00023286256,0.012690932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970106,0.0008228883,0.00016613267,0.000566528,0.00090468087,0.0005290547],"domain_scores_gemma":[0.9924359,0.004464592,0.00048369853,0.0011734867,0.0011841757,0.00025823456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019361142,0.0008831531,0.00086328574,0.0016197484,0.00086539943,0.0027188654,0.0019069605,0.0009885253,0.010735173],"category_scores_gemma":[0.00956218,0.00044957382,0.000812076,0.0013352984,0.0023992187,0.0054179993,0.0021593668,0.0015062253,0.0013938985],"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.00006054749,0.000017114446,0.00036306775,0.00015033744,0.00003011475,0.000089857,0.0001078391,0.02784134,0.0030572133,0.95600957,0.001985946,0.010287189],"study_design_scores_gemma":[0.000016202914,0.00004128612,0.00057364965,0.00007146362,0.00003076612,0.00037369487,0.00007458204,0.11959109,0.0045713517,0.8661742,0.008426643,0.000055078373],"about_ca_topic_score_codex":0.00072126713,"about_ca_topic_score_gemma":0.0005123104,"teacher_disagreement_score":0.010735173,"about_ca_system_score_codex":0.0016666561,"about_ca_system_score_gemma":0.0013381769,"threshold_uncertainty_score":0.035912752},"labels":[],"label_agreement":null},{"id":"W2743047657","doi":"10.1109/tifs.2018.2818650","title":"Covert Communication With Channel-State Information at the Transmitter","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"Korea Electric Power Corporation; National Research Foundation of Korea; Ministry of Education","keywords":"Transmitter; Additive white Gaussian noise; Channel (broadcasting); Channel state information; Computer science; Channel capacity; Covert; Key (lock); Telecommunications; Computer network; Topology (electrical circuits); Mathematics; Wireless; Computer security; Combinatorics","score_opus":0.007838086871942923,"score_gpt":0.20477804734854915,"score_spread":0.19693996047660622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743047657","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.09482311,0.0010952543,0.8891936,0.0015905822,0.00013876776,0.00008129901,0.00025117083,0.00016485792,0.012661301],"genre_scores_gemma":[0.9551547,0.0009485538,0.039504707,0.00018233416,0.00017105462,0.00012602126,0.00013882104,0.000041843414,0.003731998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997503,0.0007930303,0.0000969777,0.00046672896,0.0007181883,0.00042200106],"domain_scores_gemma":[0.9827722,0.013638649,0.0012966758,0.0014428787,0.00065321947,0.00019637086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024241589,0.0010957494,0.0017479464,0.000823618,0.0011657904,0.0019806884,0.0013567545,0.0027131012,0.002253131],"category_scores_gemma":[0.015850255,0.00066823734,0.0010720525,0.0011312988,0.0035489374,0.005147649,0.0032257314,0.0020345014,0.00038453506],"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.0003281185,0.00007889611,0.0011165672,0.0003458865,0.00010594411,0.0012485916,0.00037019092,0.67055917,0.007697259,0.30069774,0.0015948141,0.015856814],"study_design_scores_gemma":[0.000024424044,0.000048556703,0.00013893281,0.000031036514,0.000026159953,0.00035534133,0.000055070308,0.89823425,0.003616007,0.09668863,0.00075355824,0.000027970138],"about_ca_topic_score_codex":0.000991974,"about_ca_topic_score_gemma":0.0006424222,"teacher_disagreement_score":0.0027131012,"about_ca_system_score_codex":0.0017903552,"about_ca_system_score_gemma":0.0010729019,"threshold_uncertainty_score":0.0129900575},"labels":[],"label_agreement":null},{"id":"W2743670993","doi":"10.1109/isit.2017.8006519","title":"On the capacity of burst noise-erasure channels with and without feedback","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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":"Erasure; Binary erasure channel; Channel capacity; Entropy (arrow of time); Computer science; Channel (broadcasting); Ergodic theory; Noise (video); Erasure code; Mutual information; Shannon–Hartley theorem; Control theory (sociology); Mathematics; Topology (electrical circuits); Algorithm; Decoding methods; Telecommunications; Combinatorics; Physics","score_opus":0.02958316630228077,"score_gpt":0.24210954726624745,"score_spread":0.21252638096396667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743670993","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.38342905,0.009474323,0.52664685,0.002706404,0.00039545886,0.00018536409,0.0017605416,0.0004651133,0.074936956],"genre_scores_gemma":[0.9827172,0.0033266027,0.009638687,0.00013629941,0.00021620754,0.00020125044,0.00023005143,0.00009637978,0.003437273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981164,0.00065900804,0.000051997144,0.00020491658,0.00040531447,0.00056246476],"domain_scores_gemma":[0.9690512,0.02716877,0.0010682005,0.0008414762,0.0015103687,0.00035997265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027370553,0.0017530592,0.0013773673,0.0024125755,0.001068204,0.0027043447,0.0020442575,0.0013921673,0.005002365],"category_scores_gemma":[0.020263096,0.00053576194,0.00063681026,0.0022964408,0.004355528,0.0048888726,0.0026674378,0.0020525146,0.00041886693],"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.00036314112,0.00007358954,0.0006209002,0.00032047593,0.000056966,0.0002955215,0.00032705851,0.38325787,0.0043802573,0.5947744,0.002452904,0.0130769145],"study_design_scores_gemma":[0.00002405142,0.00005441741,0.00037180178,0.00012533917,0.000027621387,0.00019167503,0.00014016371,0.7533972,0.0018478783,0.24240373,0.0013649546,0.000051182626],"about_ca_topic_score_codex":0.00320317,"about_ca_topic_score_gemma":0.0016130366,"teacher_disagreement_score":0.005002365,"about_ca_system_score_codex":0.003038127,"about_ca_system_score_gemma":0.0020610187,"threshold_uncertainty_score":0.022043228},"labels":[],"label_agreement":null},{"id":"W2745125159","doi":"10.1109/tvt.2017.2735414","title":"Joint Design of Optimal Precoding and Cooperative Jamming for Multiuser Secure Broadcast Systems","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":9,"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 Toronto; Queen's University","funders":"National Research Foundation of Korea","keywords":"Precoding; Jamming; Artificial noise; Covariance matrix; Base station; Computer science; Zero-forcing precoding; Covariance; Signal-to-noise ratio (imaging); Interference (communication); Asymptotically optimal algorithm; Iterative method; Algorithm; Mathematical optimization; Mathematics; Beamforming; Telecommunications; MIMO; Wireless; Statistics; Physical layer; Physics","score_opus":0.035468298721844184,"score_gpt":0.2621483525013123,"score_spread":0.22668005377946812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745125159","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.018898726,0.00021406155,0.97837013,0.00016888119,0.000021835673,0.000043539294,0.00004201693,0.0001177685,0.0021231207],"genre_scores_gemma":[0.8843694,0.00044966186,0.112157606,0.00012133342,0.000054902983,0.00023515982,0.00011184017,0.000039867955,0.0024601612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982855,0.0006288962,0.00006592563,0.0002813663,0.0004563436,0.00028197418],"domain_scores_gemma":[0.99810326,0.001005499,0.00033123427,0.00012213769,0.0003392002,0.000098604396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016612776,0.001636701,0.0015144482,0.00060734234,0.0005270658,0.0014174216,0.0011362728,0.0014678297,0.0013060918],"category_scores_gemma":[0.0044608093,0.001003489,0.0006880246,0.00090957014,0.001535752,0.0012206103,0.0018045496,0.0012238992,0.0004679657],"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.00018492785,0.000050588198,0.00041667817,0.00012389943,0.000072516516,0.00013778076,0.00015540025,0.95155144,0.0051820027,0.01923151,0.00066178176,0.022231538],"study_design_scores_gemma":[0.000024557075,0.0000502232,0.00006321589,0.0000069464672,0.000014937366,0.000019073577,0.000019940195,0.994928,0.000880795,0.0037427344,0.00024034755,0.0000092244],"about_ca_topic_score_codex":0.0035732344,"about_ca_topic_score_gemma":0.0038818058,"teacher_disagreement_score":0.0035732344,"about_ca_system_score_codex":0.0012099999,"about_ca_system_score_gemma":0.0022331518,"threshold_uncertainty_score":0.008785725},"labels":[],"label_agreement":null},{"id":"W2750168807","doi":"10.1007/s11042-017-5103-1","title":"Decoder driven side information generation using ensemble of MLP networks for distributed video coding","year":2017,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Multilayer perceptron; Peak signal-to-noise ratio; Mean squared error; Perceptron; Algorithm; Coding (social sciences); Codec; Artificial intelligence; Pattern recognition (psychology); Artificial neural network; Statistics; Mathematics","score_opus":0.04760603448161886,"score_gpt":0.2909549448834583,"score_spread":0.24334891040183942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750168807","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.0229816,0.0001700701,0.9748105,0.00010902208,0.000039958395,0.000017344799,0.00005271873,0.00035388468,0.0014648807],"genre_scores_gemma":[0.6888599,0.00024754918,0.30453688,0.00016406269,0.00009704192,0.000086323635,0.0002697098,0.000115950184,0.005622478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996295,0.00012052358,0.000015498656,0.000072570976,0.00011385181,0.000048133148],"domain_scores_gemma":[0.99912256,0.00045095754,0.000051090265,0.00011937886,0.00021705672,0.00003899083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073012064,0.0005459009,0.00059383234,0.00029195705,0.00030217838,0.00052980357,0.00077762123,0.0009079467,0.0017529433],"category_scores_gemma":[0.0018335006,0.00033887426,0.00036567543,0.00033643856,0.0003205286,0.00091956905,0.0008621756,0.0013429048,0.00047214978],"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.0005621185,0.00016246951,0.0012451784,0.00009746,0.00012128283,0.00017025098,0.00011349525,0.58619815,0.06309182,0.01498545,0.0022724674,0.3309799],"study_design_scores_gemma":[0.000004057806,0.000022310656,0.00008922321,0.0000036956362,0.000008817503,0.00002141053,0.0000025716106,0.9927019,0.0055337176,0.0013621906,0.00024585423,0.000004406404],"about_ca_topic_score_codex":0.001426154,"about_ca_topic_score_gemma":0.003647825,"teacher_disagreement_score":0.0017529433,"about_ca_system_score_codex":0.00046541865,"about_ca_system_score_gemma":0.0005671794,"threshold_uncertainty_score":0.005864203},"labels":[],"label_agreement":null},{"id":"W2750302792","doi":"10.1109/lcomm.2017.2741458","title":"On the Secrecy Performance Analysis of SIMO Systems Over $\\kappa$ – $\\mu$ Fading Channels","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fading; Secrecy; Notation; Computer science; Noise (video); Mathematics; Algorithm; Topology (electrical circuits); Discrete mathematics; Combinatorics; Arithmetic; Artificial intelligence","score_opus":0.043293201592725795,"score_gpt":0.281125965585593,"score_spread":0.2378327639928672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750302792","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.21033606,0.005740138,0.73051274,0.0012351548,0.00017894106,0.0000840248,0.00046536457,0.00044762425,0.05099984],"genre_scores_gemma":[0.98518723,0.0028202243,0.009299612,0.00012999435,0.00014718046,0.000035476172,0.00010195786,0.000056252808,0.0022221678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986634,0.00050031976,0.00004337356,0.000132045,0.000377681,0.00028319252],"domain_scores_gemma":[0.9949292,0.003500888,0.0005232199,0.0003876926,0.0005923045,0.00006681051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019889078,0.001637097,0.0009698134,0.0010783857,0.0008174248,0.0015242731,0.0005271547,0.00076451927,0.0027471543],"category_scores_gemma":[0.00726372,0.00036203413,0.0005638658,0.0014135069,0.0021386172,0.0019890307,0.0013483237,0.001023531,0.00068758475],"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.00018529172,0.000024440144,0.0008773729,0.00018387694,0.00004961059,0.0002571331,0.00015901632,0.87358594,0.006503787,0.107698545,0.00096892787,0.00950614],"study_design_scores_gemma":[0.0000057061256,0.000056985264,0.00029213555,0.000027255137,0.000018238423,0.00013723885,0.00005760318,0.9824159,0.0028264353,0.013622643,0.0005174506,0.0000224182],"about_ca_topic_score_codex":0.0028061222,"about_ca_topic_score_gemma":0.0016612255,"teacher_disagreement_score":0.0028061222,"about_ca_system_score_codex":0.0014808733,"about_ca_system_score_gemma":0.0010860711,"threshold_uncertainty_score":0.010744572},"labels":[],"label_agreement":null},{"id":"W2751804009","doi":"10.1109/tsp.2017.2745454","title":"On Linear Precoding for the Two-User MISO Broadcast Channel With Confidential Messages and Per-Antenna Constraints","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Precoding; Transmitter; Computer science; Secure transmission; Maximization; Channel (broadcasting); Optimization problem; Mathematical optimization; Artificial noise; Secrecy; Transmission (telecommunications); Multi-user; Zero-forcing precoding; Antenna (radio); MIMO; Algorithm; Computer network; Mathematics; Telecommunications","score_opus":0.027056103019477792,"score_gpt":0.2831523528942052,"score_spread":0.2560962498747274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751804009","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.011996405,0.0008218744,0.9825811,0.00033980704,0.000053548953,0.00004860474,0.000093314644,0.00007649415,0.003988817],"genre_scores_gemma":[0.77032477,0.0045414316,0.21427971,0.00043352315,0.00036927935,0.0003971466,0.00028750513,0.0000932372,0.009273483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989496,0.00042909838,0.000035294364,0.00014530553,0.00031369147,0.00012706814],"domain_scores_gemma":[0.99668056,0.0024844154,0.00031279307,0.00014092085,0.00032938243,0.00005189373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013317779,0.0017912477,0.0012609072,0.00053545786,0.00039682552,0.0011755236,0.00070961803,0.0013673102,0.0024751553],"category_scores_gemma":[0.0055177794,0.0005355791,0.0005610008,0.0012422506,0.0015512723,0.0012661392,0.0011563275,0.0013040204,0.0007258512],"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.00009837757,0.000039044662,0.00021743454,0.00024724548,0.000043197277,0.00018672289,0.00014071296,0.94465,0.003533745,0.033432115,0.0012003497,0.016211137],"study_design_scores_gemma":[0.000018205883,0.00007375156,0.00007079197,0.00001793907,0.000013327129,0.00004921996,0.000023549179,0.98798895,0.0010003215,0.010223758,0.000505673,0.00001449827],"about_ca_topic_score_codex":0.0030470195,"about_ca_topic_score_gemma":0.003165371,"teacher_disagreement_score":0.0030470195,"about_ca_system_score_codex":0.0011041337,"about_ca_system_score_gemma":0.0013233431,"threshold_uncertainty_score":0.008280158},"labels":[],"label_agreement":null},{"id":"W2755224554","doi":"10.1007/s11277-017-4429-3","title":"Effect of Power Amplifier Nonlinearity on the Physical Layer Security of MIMO Systems","year":2017,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; MIMO; Rayleigh fading; Secrecy; Physical layer; Nonlinear system; Diversity gain; Block code; Amplifier; Power (physics); Monte Carlo method; Telecommunications; Channel (broadcasting); Electronic engineering; Topology (electrical circuits); Fading; Mathematics; Wireless; Statistics; Physics; Electrical engineering; Computer security; Engineering; Decoding methods","score_opus":0.03207504311089258,"score_gpt":0.31725029216861617,"score_spread":0.28517524905772357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755224554","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8477331,0.0009258192,0.13149704,0.00079165574,0.00009670239,0.00002931735,0.00013968837,0.00036637555,0.018420327],"genre_scores_gemma":[0.99694854,0.00020621328,0.001661411,0.00003263698,0.000017904667,0.0000049297555,0.000014001081,0.000016033331,0.0010983185],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959046,0.00012110578,0.000014417694,0.000043953816,0.00012647168,0.00010367661],"domain_scores_gemma":[0.99542266,0.0036966836,0.00027870227,0.000210405,0.00031282756,0.00007874778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005828606,0.00040124648,0.00029311536,0.00022975916,0.00037655226,0.0005722888,0.0002945269,0.0007466616,0.004421234],"category_scores_gemma":[0.0048401146,0.00026873665,0.00021227382,0.00021683288,0.00074039167,0.0011054387,0.00056944665,0.0007744247,0.00064947474],"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.0018313802,0.00017303304,0.006254769,0.000330484,0.00014372618,0.0017238565,0.00051949016,0.24237733,0.69219404,0.023040984,0.00065082085,0.030760136],"study_design_scores_gemma":[0.000039748393,0.00046835697,0.007974053,0.00007135882,0.000120131095,0.0014050917,0.0001788124,0.7507454,0.23261149,0.005325917,0.000986051,0.00007349898],"about_ca_topic_score_codex":0.00048633234,"about_ca_topic_score_gemma":0.0005827475,"teacher_disagreement_score":0.004421234,"about_ca_system_score_codex":0.0003107678,"about_ca_system_score_gemma":0.0002743788,"threshold_uncertainty_score":0.014790475},"labels":[],"label_agreement":null},{"id":"W2761953145","doi":"10.1109/infocom.2017.8057120","title":"Interactive message transmission over adversarial wiretap channel II","year":2017,"lang":"en","type":"article","venue":"","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":"University of Calgary","funders":"","keywords":"Computer science; Channel (broadcasting); Computer network; Adversary; Adversarial system; Code word; Transmitter; Jamming; Protocol (science); Computer security; Wireless; Secure communication; Eavesdropping; Transmission (telecommunications); Alice and Bob; Shared secret; Wireless sensor network; Theoretical computer science; Cryptography; Decoding methods; Telecommunications; Alice (programming language)","score_opus":0.013863563626774858,"score_gpt":0.2680290491411867,"score_spread":0.2541654855144118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761953145","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.10136547,0.00028887417,0.8794385,0.0006006736,0.00004941423,0.00015214473,0.00026989356,0.00061525253,0.017219815],"genre_scores_gemma":[0.9388229,0.00036007978,0.053158533,0.00014585741,0.00004300269,0.0003042108,0.00022029906,0.00008468713,0.0068603386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663144,0.0010060724,0.00013553526,0.0005325634,0.0010010789,0.0006933126],"domain_scores_gemma":[0.9912009,0.0052389726,0.00096850423,0.0017644636,0.00050573365,0.0003213408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017309504,0.0008436273,0.00089713756,0.0006555492,0.00090925046,0.0015543211,0.0015168028,0.0014245531,0.0029089886],"category_scores_gemma":[0.006656422,0.00041816934,0.0008076483,0.00079060625,0.002532047,0.0032707197,0.003209249,0.0023197741,0.00050860207],"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.00065797125,0.00010424545,0.00092353055,0.0002162308,0.0001060418,0.0009973992,0.000996591,0.21985674,0.03137219,0.728509,0.0023287365,0.0139313545],"study_design_scores_gemma":[0.000047877304,0.00014130164,0.00022525546,0.00003653568,0.000035339664,0.00029942076,0.00010590717,0.8277059,0.019896032,0.14772113,0.003725376,0.000059982398],"about_ca_topic_score_codex":0.001054483,"about_ca_topic_score_gemma":0.00053265836,"teacher_disagreement_score":0.0029089886,"about_ca_system_score_codex":0.0014946922,"about_ca_system_score_gemma":0.0010159599,"threshold_uncertainty_score":0.010844767},"labels":[],"label_agreement":null},{"id":"W2762622133","doi":"10.1109/infocom.2017.8057119","title":"Secret key agreement using a virtual wiretap channel","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":10,"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); Computer science; Channel (broadcasting); Computer security; Computer network","score_opus":0.04158768556955691,"score_gpt":0.28132807574108415,"score_spread":0.23974039017152723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762622133","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.023870979,0.00010223935,0.9708118,0.000267544,0.000049082584,0.00006360353,0.000034954246,0.00023073854,0.0045689917],"genre_scores_gemma":[0.7894113,0.0004050886,0.20339087,0.00015766923,0.00007092018,0.00029674827,0.000104634855,0.000106713655,0.006056015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99551976,0.0018366118,0.0002605463,0.0006152401,0.0013535586,0.00041424955],"domain_scores_gemma":[0.9908798,0.0047996277,0.0009257672,0.002344996,0.00082139985,0.00022846885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034515844,0.0005583522,0.00080731773,0.00060674816,0.001182638,0.0028204138,0.0012855356,0.0012630443,0.0024776242],"category_scores_gemma":[0.007825516,0.0005284167,0.0007590092,0.00093274046,0.0032999434,0.007757467,0.0037511417,0.0021421665,0.00060604047],"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.00041445965,0.00008045459,0.000377622,0.00015936833,0.000068133006,0.00033320862,0.00045837578,0.06795259,0.024059994,0.8826272,0.0011707916,0.02229773],"study_design_scores_gemma":[0.00016003996,0.00024170587,0.00015822325,0.000052415282,0.000070647584,0.00034722235,0.00015663348,0.5995853,0.050649803,0.33663496,0.011861564,0.00008157772],"about_ca_topic_score_codex":0.00036773764,"about_ca_topic_score_gemma":0.00024035486,"teacher_disagreement_score":0.0034515844,"about_ca_system_score_codex":0.0009854429,"about_ca_system_score_gemma":0.0012171709,"threshold_uncertainty_score":0.018253922},"labels":[],"label_agreement":null},{"id":"W2766032087","doi":"10.1109/tcomm.2017.2768516","title":"Security Optimization of Exposure Region-Based Beamforming With a Uniform Circular Array","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Queen's University Belfast; Rice University","keywords":"Beamforming; Computer science; Wireless; Context (archaeology); Information leakage; Metric (unit); Algorithm; Topology (electrical circuits); Mathematical optimization; Mathematics; Engineering; Computer network; Telecommunications; Combinatorics","score_opus":0.02513715767388952,"score_gpt":0.2514067566561165,"score_spread":0.22626959898222698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766032087","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.017841958,0.00019944213,0.977724,0.000102204394,0.000013960674,0.000017186043,0.000019922492,0.00009759602,0.003983722],"genre_scores_gemma":[0.77341634,0.000684166,0.22226372,0.00014330377,0.00004518246,0.000092935625,0.000058696827,0.0000611061,0.0032344817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992918,0.00032516077,0.000026637546,0.00013110311,0.00013644973,0.00008882019],"domain_scores_gemma":[0.9990441,0.000540297,0.00015297219,0.000091829585,0.0001265491,0.00004427273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008260073,0.0007916341,0.0005571067,0.00028066445,0.00024032233,0.00064056116,0.000427249,0.000571627,0.0015965893],"category_scores_gemma":[0.002148391,0.0003434172,0.0004333371,0.0005197429,0.0008448456,0.0010429476,0.0011275627,0.00051747414,0.0005303341],"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.00031680285,0.00004672922,0.0010147111,0.00014667693,0.000071783645,0.00020864,0.00012577583,0.8237073,0.05887494,0.05338641,0.00090835715,0.061191913],"study_design_scores_gemma":[0.00002168829,0.0002205974,0.00036662837,0.000017838805,0.00002803597,0.00018678502,0.0000431575,0.97609484,0.013113787,0.008562154,0.001316478,0.000028010152],"about_ca_topic_score_codex":0.0003342996,"about_ca_topic_score_gemma":0.00026248622,"teacher_disagreement_score":0.0015965893,"about_ca_system_score_codex":0.0004232331,"about_ca_system_score_gemma":0.0004032443,"threshold_uncertainty_score":0.005341172},"labels":[],"label_agreement":null},{"id":"W2767012393","doi":"10.1109/tcomm.2017.2765637","title":"Robust MISO Beamforming With Cooperative Jamming for Secure Transmission From Perspectives of QoS and Secrecy Rate","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Jamming; Artificial noise; Computer science; Quality of service; Transmission (telecommunications); Transmitter power output; Secure transmission; Precoding; Covariance; Mathematical optimization; Optimization problem; Signal-to-noise ratio (imaging); Secrecy; Computer network; Channel (broadcasting); MIMO; Transmitter; Telecommunications; Mathematics; Algorithm; Computer security","score_opus":0.03821635600304873,"score_gpt":0.27179020867265397,"score_spread":0.23357385266960523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767012393","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.008828077,0.00021087904,0.9886541,0.00015801717,0.000020820018,0.0000241042,0.000023060173,0.00009204745,0.0019888117],"genre_scores_gemma":[0.79595095,0.00079204614,0.20021492,0.00020220681,0.00008547176,0.00020841314,0.00007271695,0.000057677862,0.0024155758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986438,0.000519447,0.00006680055,0.0001807148,0.00041902845,0.00017020515],"domain_scores_gemma":[0.9983991,0.0008552893,0.00032108635,0.00012982405,0.0002373789,0.000057375557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00150233,0.0021813596,0.0008947149,0.0005672676,0.00044209248,0.0009414671,0.0006532678,0.0009968798,0.001356084],"category_scores_gemma":[0.003620273,0.00053457974,0.00065454154,0.00085940113,0.0011764477,0.0014754708,0.0010230688,0.0009597112,0.00061233423],"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.0002834294,0.00006323151,0.00044547202,0.00019944906,0.00006710642,0.00015068449,0.00014105113,0.8654685,0.024543103,0.06998007,0.00088442204,0.037773456],"study_design_scores_gemma":[0.000023890614,0.00015074154,0.00009993851,0.000017809109,0.00001926796,0.000069195616,0.0000320846,0.98347753,0.005277254,0.010197272,0.000610895,0.000024150708],"about_ca_topic_score_codex":0.00066771364,"about_ca_topic_score_gemma":0.0006866529,"teacher_disagreement_score":0.0021813596,"about_ca_system_score_codex":0.00070925866,"about_ca_system_score_gemma":0.00081002567,"threshold_uncertainty_score":0.00794518},"labels":[],"label_agreement":null},{"id":"W2767464508","doi":"10.1007/s11276-017-1605-z","title":"Power allocation policy and performance analysis of secure and reliable communication in cognitive radio networks","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Electronic Components and Systems for European Leadership; Bộ Giáo dục và Ðào tạo","keywords":"Eavesdropping; Computer science; Cognitive radio; Constraint (computer-aided design); Interference (communication); Performance metric; Channel (broadcasting); Computer network; Power (physics); Metric (unit); Channel state information; Computer security; Mathematical optimization; Telecommunications; Wireless; Mathematics","score_opus":0.010296717256972496,"score_gpt":0.25777343061874614,"score_spread":0.24747671336177363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767464508","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.16695243,0.002104431,0.81682366,0.0009079946,0.00009237516,0.00014397793,0.000099039455,0.0002843577,0.012591761],"genre_scores_gemma":[0.98717415,0.00063817966,0.011153316,0.000049580693,0.00004843345,0.00005945622,0.000019369196,0.000030470568,0.00082709227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966941,0.0016350081,0.00008961946,0.0002599884,0.0007451545,0.00057610084],"domain_scores_gemma":[0.9828956,0.013054759,0.0018142334,0.00070665486,0.0012769243,0.00025183297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052268305,0.0015630323,0.0011465362,0.00136788,0.0007734207,0.0019467459,0.0010954526,0.0012591771,0.0015186034],"category_scores_gemma":[0.02377299,0.0005187446,0.0005190626,0.001300109,0.002608647,0.0023411412,0.0015043912,0.0013582135,0.00029383806],"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.0001518976,0.000040139614,0.0005083483,0.00008666255,0.000028758144,0.00012309352,0.00011882964,0.93989635,0.00303113,0.046865568,0.00045294958,0.008696242],"study_design_scores_gemma":[0.0000108063705,0.00006356596,0.00015224036,0.000012298708,0.000011626761,0.000049484257,0.000036852816,0.9868678,0.0007804852,0.011868291,0.00013599629,0.000010651686],"about_ca_topic_score_codex":0.002401627,"about_ca_topic_score_gemma":0.0009213024,"teacher_disagreement_score":0.0052268305,"about_ca_system_score_codex":0.0023157068,"about_ca_system_score_gemma":0.001520022,"threshold_uncertainty_score":0.027642488},"labels":[],"label_agreement":null},{"id":"W2769254131","doi":"10.1109/vtcspring.2017.8108372","title":"Internal Collusive Eavesdropping of Interference Alignment Networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of British Columbia; Carleton University","funders":"","keywords":"Eavesdropping; Computer science; Computer network; Interference (communication); Decoding methods; Computer security; Channel (broadcasting); Telecommunications","score_opus":0.018125107760112655,"score_gpt":0.2640327968704162,"score_spread":0.24590768911030353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769254131","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.095190614,0.00037976116,0.89583874,0.00012334039,0.000038678714,0.000053597643,0.000030529,0.00020227347,0.008142484],"genre_scores_gemma":[0.97623867,0.00031083403,0.022055091,0.000058974936,0.000024144798,0.000041049054,0.000023310351,0.000011793255,0.0012361772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983785,0.00061307405,0.00006782859,0.00022667955,0.00039687267,0.00031691534],"domain_scores_gemma":[0.99793017,0.0009456987,0.00036986655,0.0004387995,0.00024898443,0.000066462395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009841735,0.0010563673,0.00062357786,0.00040558155,0.0008121936,0.00096147665,0.0006755338,0.0005172559,0.00088942633],"category_scores_gemma":[0.0033009816,0.00029280642,0.00045873056,0.0006127073,0.0012354573,0.0015020388,0.0019940415,0.00076229207,0.00027584162],"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.00067934796,0.00010456249,0.007215057,0.0003062788,0.0003136238,0.002008498,0.0010194232,0.5773775,0.08444803,0.18287435,0.0024264732,0.14122686],"study_design_scores_gemma":[0.00001842639,0.00019967913,0.00061358715,0.00002893514,0.00006995146,0.0007692805,0.000115512856,0.94564044,0.031079853,0.018963771,0.0024700423,0.000030442072],"about_ca_topic_score_codex":0.0006830485,"about_ca_topic_score_gemma":0.00049938436,"teacher_disagreement_score":0.0010563673,"about_ca_system_score_codex":0.00046037213,"about_ca_system_score_gemma":0.00041602622,"threshold_uncertainty_score":0.005204916},"labels":[],"label_agreement":null},{"id":"W2769390761","doi":"10.1109/tcomm.2017.2776114","title":"Cooperative Secure Communication in Two-Hop Buffer-Aided Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Buffer (optical fiber); Hop (telecommunications); Spread spectrum; Telecommunications; Code division multiple access","score_opus":0.030481619510830667,"score_gpt":0.31254329822400323,"score_spread":0.28206167871317256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769390761","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.07945147,0.0005498465,0.91772467,0.00017492136,0.000051116876,0.00005782774,0.000050182043,0.00023121701,0.0017087085],"genre_scores_gemma":[0.96127206,0.0002608516,0.037110183,0.000062076804,0.00001579991,0.00006773759,0.000029595407,0.00000998278,0.0011717303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992673,0.00022664733,0.00004309968,0.00012623561,0.00018091266,0.00015582146],"domain_scores_gemma":[0.9985089,0.0008347353,0.0002266015,0.00017768658,0.0001918672,0.000060150596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013782122,0.0009104888,0.0009014008,0.0005662569,0.00062019384,0.0012088496,0.0016349544,0.0007179915,0.00089959294],"category_scores_gemma":[0.0021673443,0.00038401486,0.0004218046,0.0006944679,0.00096616725,0.0017373502,0.0014598249,0.0006286885,0.00018537628],"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.00043455683,0.00014841631,0.000983058,0.0001739817,0.00008544463,0.000348047,0.00040415922,0.8584634,0.026357213,0.072057106,0.00096083566,0.03958392],"study_design_scores_gemma":[0.000018590285,0.00010007769,0.00006112209,0.000006931488,0.000016559728,0.00004755528,0.000019920399,0.99058086,0.003898176,0.0048604743,0.00037431624,0.000015401381],"about_ca_topic_score_codex":0.0012064886,"about_ca_topic_score_gemma":0.0015104014,"teacher_disagreement_score":0.0016349544,"about_ca_system_score_codex":0.00075096777,"about_ca_system_score_gemma":0.0010711674,"threshold_uncertainty_score":0.007288754},"labels":[],"label_agreement":null},{"id":"W2772294983","doi":"10.1109/wcsp.2017.8171168","title":"Beneficial jamming design for interference alignment networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of British Columbia; Carleton University","funders":"","keywords":"Eavesdropping; Jamming; Computer science; Interference (communication); Precoding; Zero-forcing precoding; Transmission (telecommunications); Scheme (mathematics); Computer network; Beamforming; Telecommunications; MIMO; Mathematics","score_opus":0.050204226494754714,"score_gpt":0.28514777880042225,"score_spread":0.23494355230566755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772294983","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.013125421,0.00024820445,0.9815316,0.00008343219,0.0000272425,0.000030351493,0.000012854377,0.00010293701,0.004838026],"genre_scores_gemma":[0.81573343,0.00073428213,0.18020098,0.00021727674,0.00009102991,0.00015859753,0.00004857578,0.000028267013,0.0027875602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994054,0.00025152013,0.000021520931,0.00009016224,0.00016055448,0.00007083222],"domain_scores_gemma":[0.9995413,0.00014532839,0.00011099198,0.000046818157,0.0001235485,0.00003207749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000518702,0.00088764384,0.00037882203,0.0004190199,0.00045796437,0.00047852233,0.0006414133,0.00046481058,0.0013576315],"category_scores_gemma":[0.0012777792,0.0002472067,0.00026189577,0.00049373135,0.00059753406,0.0007182166,0.0008746981,0.0005678721,0.00041510756],"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.00049959694,0.00015290824,0.0012419171,0.00040177026,0.00013502799,0.0004642657,0.00038948527,0.363682,0.15742822,0.2181659,0.0040198686,0.2534191],"study_design_scores_gemma":[0.00003218238,0.00044497263,0.00036773089,0.00004209793,0.000060822193,0.00042775297,0.00006626573,0.9441554,0.021157667,0.025491828,0.0077219936,0.000031242365],"about_ca_topic_score_codex":0.00027581427,"about_ca_topic_score_gemma":0.0004378139,"teacher_disagreement_score":0.0013576315,"about_ca_system_score_codex":0.00037955784,"about_ca_system_score_gemma":0.0004273822,"threshold_uncertainty_score":0.0045417547},"labels":[],"label_agreement":null},{"id":"W2774408587","doi":"10.1109/pacrim.2017.8121886","title":"An improved cooperative jamming strategy for PHY security in a multi-hop communications system","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Jamming; Secrecy; Computer science; Beamforming; Relay; Physical layer; Wireless; Hop (telecommunications); Computer network; PHY; Communications system; Optimization problem; Mathematical optimization; Distributed computing; Computer security; Telecommunications; Algorithm; Mathematics","score_opus":0.06503890250745029,"score_gpt":0.34855942051525546,"score_spread":0.2835205180078052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774408587","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.025607226,0.00030345755,0.97055095,0.00012430295,0.000029790774,0.00003296117,0.000008341889,0.00007860404,0.0032643997],"genre_scores_gemma":[0.9185782,0.00025032434,0.07894723,0.00012342207,0.00003613153,0.000055773475,0.000016766464,0.000013776023,0.0019783685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994137,0.00020835784,0.000021309854,0.00007255988,0.00020350853,0.00008050365],"domain_scores_gemma":[0.9996159,0.00015811942,0.00005730284,0.000042354335,0.00009112652,0.000035069002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000615225,0.0007067709,0.0005156059,0.000445932,0.0004186865,0.00055332767,0.0008647726,0.00068562303,0.0006500553],"category_scores_gemma":[0.00094643206,0.00019933304,0.00038026625,0.00044168474,0.00061148865,0.0008345219,0.0008937722,0.0006560873,0.00018088747],"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.00019681992,0.00012327722,0.0007980266,0.00019221184,0.000112499714,0.00052350416,0.00028709212,0.7897362,0.060185432,0.066968046,0.0014653034,0.07941165],"study_design_scores_gemma":[0.000012852498,0.00012540979,0.00010667332,0.0000055112832,0.000016210415,0.00010568624,0.000018601308,0.9933656,0.002518744,0.0030690876,0.0006450334,0.000010581516],"about_ca_topic_score_codex":0.0009263367,"about_ca_topic_score_gemma":0.0010161129,"teacher_disagreement_score":0.0009263367,"about_ca_system_score_codex":0.0004649353,"about_ca_system_score_gemma":0.0006592655,"threshold_uncertainty_score":0.0033733249},"labels":[],"label_agreement":null},{"id":"W2781303461","doi":"10.1109/cns.2017.8228670","title":"Physical layer security using BCH and LDPC codes with adaptive granular HARQ","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"Université Laval","funders":"","keywords":"Hybrid automatic repeat request; Retransmission; Computer science; Low-density parity-check code; BCH code; Decoding methods; Forward error correction; Algorithm; Automatic repeat request; Computer network; Channel (broadcasting); Network packet; Telecommunications link","score_opus":0.031705284060681245,"score_gpt":0.28045966703240766,"score_spread":0.24875438297172642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781303461","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.033735473,0.0008974548,0.9617132,0.00019276357,0.000075403696,0.00007137499,0.00004409228,0.00038573513,0.0028844045],"genre_scores_gemma":[0.7732116,0.00077165675,0.2235827,0.00013671187,0.000061116436,0.0000935131,0.000058501475,0.000035242687,0.0020489306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991602,0.00025839338,0.000034501867,0.00008300994,0.0003781248,0.000085677624],"domain_scores_gemma":[0.9986303,0.0005557532,0.00021479759,0.00031408566,0.00023923494,0.000045805195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007836336,0.00067916454,0.00061442045,0.0007398246,0.0005660418,0.000959288,0.0008066822,0.0007562325,0.00075992866],"category_scores_gemma":[0.0023948185,0.00021684715,0.00031969455,0.0008470713,0.0012776629,0.001312602,0.0011229005,0.0009514943,0.00022929543],"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.00033039934,0.00012575503,0.0011318492,0.0002910266,0.0000908794,0.00040816714,0.0002770566,0.5534249,0.04335,0.20599093,0.0018463158,0.19273265],"study_design_scores_gemma":[0.00001898978,0.00008038299,0.00015830185,0.000023376817,0.000014834261,0.00013859679,0.000022452767,0.9762457,0.005046747,0.016855998,0.0013673647,0.00002724252],"about_ca_topic_score_codex":0.0014822806,"about_ca_topic_score_gemma":0.0016344205,"teacher_disagreement_score":0.0014822806,"about_ca_system_score_codex":0.0008179881,"about_ca_system_score_gemma":0.00085236237,"threshold_uncertainty_score":0.005934894},"labels":[],"label_agreement":null},{"id":"W2786414161","doi":"10.48550/arxiv.1805.01974","title":"Lossy Transmission of Correlated Sources over Two-Way Channels","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Converse; Additive white Gaussian noise; Lossy compression; Gaussian; Coding (social sciences); Mathematics; Modulo; Algorithm; Topology (electrical circuits); Computer science; White noise; Discrete mathematics; Statistics; Physics; Combinatorics; Geometry","score_opus":0.04179865623046022,"score_gpt":0.20075382024091612,"score_spread":0.1589551640104559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786414161","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.071239375,0.0005117585,0.92008954,0.0004887555,0.00006421532,0.000033331056,0.00017346289,0.0001424406,0.0072571896],"genre_scores_gemma":[0.941483,0.0009219874,0.05305851,0.00017815451,0.000079708836,0.000101453144,0.00013136429,0.00003623521,0.0040096752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998271,0.0005611197,0.00007599674,0.00023547106,0.00061009364,0.00024623578],"domain_scores_gemma":[0.99337405,0.0042712134,0.0007390479,0.0009886625,0.0005040061,0.0001230076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023216764,0.0011180202,0.00082563626,0.00057017873,0.00049191265,0.0016293692,0.0008823839,0.000829172,0.001452398],"category_scores_gemma":[0.008641461,0.00053387624,0.0005717837,0.0010475902,0.0018965672,0.0021638132,0.003165258,0.0016109585,0.00031578384],"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.0005002507,0.000068767295,0.0014150668,0.0003298287,0.00014770603,0.0007123237,0.0004648306,0.55689776,0.03148788,0.35447684,0.0021460226,0.051352695],"study_design_scores_gemma":[0.000030657233,0.00010736099,0.00045226014,0.000050160586,0.000054686046,0.00047727712,0.000097736236,0.8735358,0.015888033,0.10713633,0.0021151158,0.000054600376],"about_ca_topic_score_codex":0.0005768712,"about_ca_topic_score_gemma":0.0005682186,"teacher_disagreement_score":0.0023216764,"about_ca_system_score_codex":0.0010114787,"about_ca_system_score_gemma":0.0008483087,"threshold_uncertainty_score":0.012278318},"labels":[],"label_agreement":null},{"id":"W2790153540","doi":"10.1109/twc.2018.2812881","title":"Multi-Hop Routing in Covert Wireless Networks","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security 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":"University of Calgary","funders":"Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Covert; Computer science; Computer network; Alice and Bob; Hop (telecommunications); Key (lock); Wireless; Wireless network; Covert channel; Transmission (telecommunications); Alice (programming language); Telecommunications; Computer security","score_opus":0.03800853480962164,"score_gpt":0.2901884406262545,"score_spread":0.25217990581663285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790153540","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.041566905,0.0037395863,0.94742703,0.00075385766,0.00018152391,0.00011148787,0.00007167393,0.00021997768,0.00592793],"genre_scores_gemma":[0.8040116,0.0058608106,0.18521711,0.00019053296,0.00028223335,0.00020637747,0.00016268171,0.00006247653,0.0040062466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992829,0.00030554523,0.000026116617,0.00010066381,0.00020699063,0.00007773401],"domain_scores_gemma":[0.99847525,0.0011155097,0.0001648864,0.00011881136,0.00009196961,0.000033569922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077717635,0.0005367632,0.00060901383,0.0008310644,0.0007180335,0.0010552518,0.00067987596,0.0010957484,0.0009653695],"category_scores_gemma":[0.0031179073,0.0003503823,0.00037507602,0.001114245,0.0009785924,0.0016679808,0.0008515969,0.0007060795,0.00020608521],"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.000081625294,0.000031204396,0.0004281479,0.00023026756,0.000046556972,0.00032430762,0.00016235776,0.86797595,0.004691273,0.07452243,0.0020643412,0.049441554],"study_design_scores_gemma":[0.0000114486775,0.00005709678,0.00018504438,0.000024499872,0.000011550702,0.00020213187,0.00004221865,0.9452839,0.0016341918,0.048384055,0.004149801,0.000014076111],"about_ca_topic_score_codex":0.0007971268,"about_ca_topic_score_gemma":0.0008384466,"teacher_disagreement_score":0.0010957484,"about_ca_system_score_codex":0.0010295724,"about_ca_system_score_gemma":0.00046233577,"threshold_uncertainty_score":0.0074700713},"labels":[],"label_agreement":null},{"id":"W2791803390","doi":"10.1109/globalsip.2017.8308617","title":"An algorithm for optimal secure signaling over cognitive radio MIMO channels","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Ottawa","funders":"","keywords":"MIMO; Cognitive radio; Backtracking; Computer science; Algorithm; Maximization; Constraint (computer-aided design); Channel (broadcasting); Interference (communication); Transmitter power output; Transmitter; Mathematical optimization; Wireless; Mathematics; Telecommunications","score_opus":0.02284068689941194,"score_gpt":0.3000640360019784,"score_spread":0.27722334910256646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791803390","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.0026210912,0.00005513237,0.9952537,0.00007490676,0.000021691729,0.000036229245,0.00002323958,0.00026376106,0.0016502393],"genre_scores_gemma":[0.18586035,0.00018220763,0.8098744,0.000094747746,0.00004323937,0.0004131042,0.00016274773,0.00015423833,0.0032149004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963856,0.00009273223,0.00001984267,0.00006127432,0.0001274808,0.000060050275],"domain_scores_gemma":[0.9991848,0.00051802717,0.00006245264,0.00004550716,0.00015428489,0.000035020665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008110606,0.0010139114,0.0010254268,0.00075211655,0.0005326977,0.0010186892,0.0011453349,0.001481101,0.0050667175],"category_scores_gemma":[0.0024592187,0.00044523008,0.00054476777,0.0007471627,0.0006897072,0.00089598994,0.0013438591,0.0014655873,0.001317518],"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.00012974752,0.000049092334,0.00018927475,0.00010416343,0.00002255033,0.000082347186,0.000089316985,0.85382754,0.003693663,0.047234472,0.0023764067,0.09220151],"study_design_scores_gemma":[0.00002182273,0.0000231675,0.000017496272,0.0000060284183,0.0000024384321,0.000016585496,0.000008137546,0.99304056,0.00042796286,0.0059143645,0.00051722856,0.0000041632975],"about_ca_topic_score_codex":0.0020364278,"about_ca_topic_score_gemma":0.0020614523,"teacher_disagreement_score":0.0050667175,"about_ca_system_score_codex":0.00071546185,"about_ca_system_score_gemma":0.0021524746,"threshold_uncertainty_score":0.016949892},"labels":[],"label_agreement":null},{"id":"W2792456449","doi":"10.1109/lcomm.2018.2807425","title":"Distributed-Relay Beamforming for Secrecy Energy Efficiency With Coordinated Eavesdroppers","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Nanjing University of Posts and Telecommunications; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Relay; Beamforming; Computer science; Secrecy; Computer network; Efficient energy use; Energy (signal processing); Computer security; Telecommunications; Electrical engineering; Engineering; Power (physics); Mathematics","score_opus":0.01576881900403084,"score_gpt":0.24671002828887,"score_spread":0.23094120928483916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792456449","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.005044875,0.000105995714,0.9934661,0.00006222081,0.00001434418,0.000010524043,0.000011087178,0.000047425106,0.0012374086],"genre_scores_gemma":[0.7749893,0.0007322571,0.22006957,0.00014813295,0.000063420695,0.00013778714,0.00005527379,0.00003816768,0.0037661511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927884,0.00024736652,0.000035861984,0.0001249364,0.0002536363,0.00005935857],"domain_scores_gemma":[0.9995925,0.0001973721,0.000057358633,0.00006070372,0.00007636357,0.00001579423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078923436,0.0011280316,0.00076823146,0.00029090123,0.0003369072,0.00064815395,0.0006982247,0.0006695122,0.0012848598],"category_scores_gemma":[0.0011138922,0.00028784582,0.0005068975,0.0005665629,0.0007069457,0.0012045056,0.0009208258,0.00078051735,0.0004892948],"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.00017555967,0.00006912588,0.0004672866,0.00017020079,0.00007932376,0.00021553469,0.00012237504,0.7424965,0.051107552,0.12738346,0.0014808363,0.07623227],"study_design_scores_gemma":[0.00001677618,0.00008548402,0.00007631677,0.00001008567,0.00001634238,0.00007923422,0.00001590154,0.9802924,0.0077776695,0.010476638,0.0011406002,0.000012640473],"about_ca_topic_score_codex":0.00038594825,"about_ca_topic_score_gemma":0.00056351256,"teacher_disagreement_score":0.0012848598,"about_ca_system_score_codex":0.00052849454,"about_ca_system_score_gemma":0.00059153046,"threshold_uncertainty_score":0.0042983294},"labels":[],"label_agreement":null},{"id":"W2793222875","doi":"10.1049/iet-com.2017.0719","title":"Maximising the degrees of freedom of the physical‐layer secured relay networks with artificial jamming","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Jamming; Physical layer; Degrees of freedom (physics and chemistry); Relay; Computer science; Layer (electronics); Telecommunications; Computer network; Physics; Nanotechnology; Materials science; Quantum mechanics; Wireless","score_opus":0.029828621906412216,"score_gpt":0.26204911993757396,"score_spread":0.23222049803116174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793222875","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.039724957,0.0002683711,0.9563486,0.00012817876,0.00001836446,0.000020585707,0.000023147672,0.000043198183,0.0034245558],"genre_scores_gemma":[0.9240609,0.0004891375,0.07364708,0.000048321348,0.000028622788,0.00007016828,0.00002804718,0.000018994073,0.0016087528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999385,0.00031600706,0.000020668482,0.000085456726,0.00012094252,0.00007199987],"domain_scores_gemma":[0.9987626,0.0008284052,0.00016563197,0.000107015745,0.0000906565,0.000045742683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010852722,0.0011234467,0.0005956789,0.00031643026,0.0002520485,0.00066099525,0.00057411985,0.0007698448,0.00091647485],"category_scores_gemma":[0.003086348,0.00038158096,0.0004396893,0.00040807112,0.0013047383,0.0013305905,0.0012838476,0.0006579248,0.00018798445],"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.00019505578,0.000037203266,0.0003431517,0.00017829456,0.000050708655,0.00010959318,0.0001086924,0.8723602,0.021155596,0.08576112,0.00043874077,0.019261636],"study_design_scores_gemma":[0.000015199928,0.00013697469,0.00017318228,0.000014135703,0.000012885529,0.00006482901,0.000025166424,0.9744322,0.0033947781,0.021092657,0.0006207435,0.000017252909],"about_ca_topic_score_codex":0.00024567006,"about_ca_topic_score_gemma":0.00025708534,"teacher_disagreement_score":0.0011234467,"about_ca_system_score_codex":0.00043581042,"about_ca_system_score_gemma":0.0004287934,"threshold_uncertainty_score":0.00573951},"labels":[],"label_agreement":null},{"id":"W2796716076","doi":"10.31130/jst.2016.19","title":"Secrecy Rate and Optimal Power Allocation of the Amplify-and-Forward Relay Wire-Tap System","year":2016,"lang":"en","type":"article","venue":"The University of Danang - Journal of Science and Technology","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":"McGill University","funders":"","keywords":"Relay; Secrecy; Rayleigh fading; Computer science; Power (physics); Mathematical optimization; Channel (broadcasting); Fading; Mathematics; Computer network; Computer security","score_opus":0.004740927597454902,"score_gpt":0.17728299911534254,"score_spread":0.17254207151788764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796716076","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.16083497,0.00083742046,0.82623655,0.00036223067,0.000035424862,0.00005911646,0.00014264189,0.00014003097,0.011351572],"genre_scores_gemma":[0.97651756,0.00044804325,0.020056639,0.00003431241,0.00001831982,0.000046377736,0.000043564363,0.00002578837,0.0028094307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899405,0.00042195086,0.00003501271,0.00015237398,0.00021403035,0.00018256756],"domain_scores_gemma":[0.9981573,0.0011371967,0.00023740539,0.00010426783,0.0003217451,0.000042109332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017256843,0.00082529255,0.0009334868,0.00050300604,0.000450776,0.0015281461,0.0006161183,0.00078776426,0.001799286],"category_scores_gemma":[0.003138735,0.00038516385,0.0005369272,0.0005762843,0.0013423407,0.0015481536,0.0010104096,0.00074351014,0.00035863917],"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.00012675516,0.00003056003,0.0006377958,0.00009305934,0.000045196502,0.00022688993,0.00009948737,0.93021023,0.00793288,0.052759584,0.00044572863,0.0073919],"study_design_scores_gemma":[0.000007558836,0.000025991916,0.00011666668,0.000006347841,0.00001162794,0.00005191143,0.000026481264,0.9930662,0.0019541543,0.0045894105,0.00013359991,0.000010027478],"about_ca_topic_score_codex":0.0020926392,"about_ca_topic_score_gemma":0.0011443894,"teacher_disagreement_score":0.0020926392,"about_ca_system_score_codex":0.0012899615,"about_ca_system_score_gemma":0.0011108848,"threshold_uncertainty_score":0.00935936},"labels":[],"label_agreement":null},{"id":"W2796907741","doi":"10.31130/jst.2017.34","title":"Energy Detection with Diversity Reception","year":2017,"lang":"en","type":"article","venue":"The University of Danang - Journal of Science and Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University; University of Alberta; Huawei Technologies (Canada)","funders":"","keywords":"Nakagami distribution; Rician fading; Monte Carlo method; Computer science; Energy (signal processing); Moment-generating function; Algorithm; False alarm; Probability density function; Applied mathematics; Diversity scheme; Square (algebra); Detector; Statistical physics; Diversity combining; Topology (electrical circuits); Fading; Channel (broadcasting); Mathematics; Statistics; Telecommunications; Physics; Combinatorics","score_opus":0.008682214355228264,"score_gpt":0.18558318225173948,"score_spread":0.17690096789651122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796907741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5989933,0.0015635645,0.38575643,0.00049717963,0.00004569851,0.00008330254,0.00018526669,0.000266796,0.012608502],"genre_scores_gemma":[0.9930299,0.00014172267,0.0060948296,0.0000537513,0.000012607894,0.000019009358,0.000034390596,0.000008223399,0.0006055002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983467,0.0004930614,0.00004810114,0.00029154724,0.00046713842,0.00035351713],"domain_scores_gemma":[0.9925216,0.0058646817,0.0006130848,0.00034263334,0.00054501963,0.00011298762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017696796,0.0008457228,0.0008281123,0.0006812169,0.00034756344,0.001096787,0.00087866676,0.0010192547,0.0008047643],"category_scores_gemma":[0.0086020045,0.00026764226,0.00038563047,0.0007810054,0.0010462776,0.0017372402,0.0012231265,0.00052406685,0.00021107396],"study_design_candidate":"not_applicable","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.0005131023,0.000082105216,0.005432242,0.000120933626,0.00011463205,0.00039993276,0.000121986675,0.92580795,0.01513533,0.031040872,0.00032835713,0.020902613],"study_design_scores_gemma":[0.000016908658,0.00018014087,0.00081705255,0.000009769028,0.000019323923,0.000265259,0.000031663094,0.9857737,0.005432119,0.0072412253,0.00019517123,0.000017572265],"about_ca_topic_score_codex":0.0008185948,"about_ca_topic_score_gemma":0.0005397028,"teacher_disagreement_score":0.0017696796,"about_ca_system_score_codex":0.0011648906,"about_ca_system_score_gemma":0.00060586375,"threshold_uncertainty_score":0.009359062},"labels":[],"label_agreement":null},{"id":"W2799710179","doi":"10.1109/tit.2018.2834516","title":"Capacity Achieving Distributions and Separation Principle for Feedback Gaussian Channels With Memory: the LQG Theory of Directed Information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":13,"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 Ottawa","funders":"","keywords":"Linear-quadratic-Gaussian control; Information theory; Separation principle; Gaussian; Separation (statistics); Computer science; Control theory (sociology); Mathematics; Control (management); Artificial intelligence; Statistics; Machine learning; Physics","score_opus":0.0127012307515208,"score_gpt":0.2407918347222992,"score_spread":0.2280906039707784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799710179","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.0046302355,0.00017950009,0.99127394,0.00018190475,0.000021184404,0.000021989337,0.000046989702,0.0000731942,0.003571042],"genre_scores_gemma":[0.7279608,0.0014637302,0.25696018,0.00044079652,0.00022238324,0.00060381956,0.00027607064,0.000244192,0.011827931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993604,0.00026262127,0.000019433657,0.00006835887,0.00020621852,0.00008297939],"domain_scores_gemma":[0.99856156,0.0010097224,0.000116043455,0.00007182004,0.00019575398,0.00004514186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015422822,0.00090420985,0.0006200759,0.0007915255,0.0003365234,0.0012353036,0.0010958575,0.00075502164,0.002856067],"category_scores_gemma":[0.0039649624,0.00036000714,0.0007807706,0.00066654506,0.0017631534,0.0016693408,0.0010332636,0.0015032829,0.00050746044],"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.000025357678,0.000026632693,0.00013402717,0.000063383595,0.000022717606,0.000039512324,0.00006785206,0.26281843,0.0019161154,0.7214094,0.0012178252,0.012258805],"study_design_scores_gemma":[0.0000100454,0.000021959193,0.000053200456,0.000011828294,0.0000046132727,0.000018498478,0.000011036481,0.82522273,0.00047750724,0.17328374,0.0008708285,0.00001390912],"about_ca_topic_score_codex":0.0015885185,"about_ca_topic_score_gemma":0.00089209527,"teacher_disagreement_score":0.002856067,"about_ca_system_score_codex":0.0014622513,"about_ca_system_score_gemma":0.0014016083,"threshold_uncertainty_score":0.010609448},"labels":[],"label_agreement":null},{"id":"W2799779867","doi":"10.1109/isit.2018.8437918","title":"Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Best-Effort and Save-and-Transmit","year":2018,"lang":"en","type":"preprint","venue":"","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":"University of Toronto","funders":"Division of Electrical, Communications and Cyber Systems; National Science Foundation","keywords":"Independent and identically distributed random variables; Energy (signal processing); Transmitter power output; Mathematics; Dirty paper coding; Additive white Gaussian noise; Block (permutation group theory); Channel (broadcasting); Gaussian process; Gaussian; Markov process; Discrete mathematics; Combinatorics; Statistics; Transmitter; Random variable; Computer science; Telecommunications; White noise; Physics; Precoding; MIMO","score_opus":0.024242680907298378,"score_gpt":0.2804427690806926,"score_spread":0.25620008817339424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799779867","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.045477424,0.002416432,0.9344495,0.00072411145,0.000120932025,0.000095792006,0.00020952769,0.00053694414,0.015969332],"genre_scores_gemma":[0.92516685,0.0027013621,0.066825226,0.00029539733,0.00018052697,0.00028204647,0.00024217568,0.00021109202,0.004095292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948881,0.0016305194,0.00026191515,0.00052006426,0.0016536366,0.0010458478],"domain_scores_gemma":[0.9690851,0.023080418,0.0024714177,0.0020215816,0.002903063,0.00043835817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067964536,0.0023401515,0.0019310473,0.0019841336,0.0013899853,0.002750876,0.0023104984,0.0016193566,0.0024517798],"category_scores_gemma":[0.032057267,0.00066007243,0.0013150828,0.0022206646,0.004328669,0.0042000995,0.0037054145,0.0028505086,0.0009477798],"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.0004902191,0.0001708754,0.0011052795,0.0005570937,0.00012560833,0.00054257776,0.0006707751,0.53473943,0.010365778,0.39731154,0.0033394082,0.050581377],"study_design_scores_gemma":[0.000025007603,0.000101820624,0.0002893411,0.00010172221,0.00004718217,0.00047440417,0.0001521001,0.88254833,0.0069312835,0.10788164,0.0013754282,0.0000717768],"about_ca_topic_score_codex":0.0022741875,"about_ca_topic_score_gemma":0.002019282,"teacher_disagreement_score":0.0067964536,"about_ca_system_score_codex":0.0029872821,"about_ca_system_score_gemma":0.002159813,"threshold_uncertainty_score":0.03594351},"labels":[],"label_agreement":null},{"id":"W2802595113","doi":"10.1109/access.2018.2833423","title":"Cascaded &lt;inline-formula&gt; &lt;tex-math notation=\"LaTeX\"&gt;$\\alpha-\\mu$ &lt;/tex-math&gt; &lt;/inline-formula&gt; Fading Channels: Reliability and Security Analysis","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Fading; Nakagami distribution; Fading distribution; Cumulative distribution function; Weibull fading; Mathematics; Algorithm; Probability density function; Rayleigh fading; Statistics; Computer science; Topology (electrical circuits); Applied mathematics; Combinatorics; Decoding methods","score_opus":0.022910769159939826,"score_gpt":0.2939410104852559,"score_spread":0.27103024132531606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802595113","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.020547122,0.0005923119,0.9484108,0.00036205698,0.00024193744,0.00011285513,0.0010958002,0.0009460921,0.027691014],"genre_scores_gemma":[0.6617508,0.0036596719,0.26208472,0.0006061176,0.0004193824,0.00037479648,0.0027299793,0.0015526853,0.06682191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995584,0.00006237265,0.000018915669,0.000086112916,0.00021216378,0.00006190543],"domain_scores_gemma":[0.99900997,0.00030193472,0.00013402963,0.00025002542,0.0002669652,0.000037078917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046564118,0.0007637299,0.00060875673,0.00079693156,0.0003729092,0.0012128985,0.0011191505,0.00055739883,0.027222583],"category_scores_gemma":[0.0022480385,0.00037805305,0.0009789687,0.0010973174,0.0008117789,0.0016787738,0.0009077537,0.0011800246,0.0066169915],"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.00023808471,0.00012051844,0.0023709524,0.00048755095,0.00010667651,0.0013761512,0.00023335096,0.4010061,0.036761153,0.3631332,0.041986085,0.15218028],"study_design_scores_gemma":[0.000013393116,0.000030890376,0.0008176565,0.000033047523,0.000015151948,0.0003848054,0.000029573703,0.91915303,0.012346363,0.052607868,0.014537445,0.00003077667],"about_ca_topic_score_codex":0.0043111104,"about_ca_topic_score_gemma":0.004204731,"teacher_disagreement_score":0.027222583,"about_ca_system_score_codex":0.0012567138,"about_ca_system_score_gemma":0.0010877708,"threshold_uncertainty_score":0.091068566},"labels":[],"label_agreement":null},{"id":"W2803444851","doi":"10.1155/2018/9624856","title":"A Novel Approach to Enhance the Physical Layer Channel Security of Wireless Cooperative Vehicular Communication Using Decode‐and‐Forward Best Relaying Selection","year":2018,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":14,"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":"Alexandria University; United Arab Emirates University","keywords":"Computer science; Cooperative diversity; Computer network; Precoding; Wireless; Diversity gain; Transmission (telecommunications); Relay; Multipath propagation; Secrecy; Channel (broadcasting); Physical layer; Antenna diversity; Telecommunications; Fading; MIMO; Computer security","score_opus":0.025789521962851624,"score_gpt":0.3043111729875441,"score_spread":0.2785216510246925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803444851","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.019169802,0.000351926,0.9760991,0.00015096662,0.000043222928,0.000038386304,0.000018654257,0.00016130795,0.003966756],"genre_scores_gemma":[0.81016225,0.000779353,0.18452491,0.000108489854,0.000081908685,0.0000603556,0.000039608793,0.000026858192,0.004216218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995152,0.0001534338,0.000018079565,0.0000620071,0.00019593305,0.000055381428],"domain_scores_gemma":[0.9995678,0.00017522725,0.0000483086,0.00009349928,0.000098721684,0.00001648273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005055394,0.00068320346,0.00041630873,0.0004999314,0.00044639513,0.00053568685,0.00064491556,0.00047904762,0.00077519077],"category_scores_gemma":[0.0008438773,0.00016765673,0.00041056276,0.00028843287,0.00057600776,0.0007882073,0.0006655647,0.0005480719,0.00029419854],"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.00021834162,0.00019756133,0.0017530939,0.00025043162,0.00019971633,0.0006778486,0.0005509667,0.38216308,0.21355054,0.15915896,0.0026525196,0.23862685],"study_design_scores_gemma":[0.000024696506,0.00033845915,0.0003714849,0.000018305602,0.0000693082,0.0007097159,0.0000750526,0.93423736,0.04192732,0.013949103,0.008241313,0.000037829588],"about_ca_topic_score_codex":0.00058757997,"about_ca_topic_score_gemma":0.0012125844,"teacher_disagreement_score":0.00077519077,"about_ca_system_score_codex":0.00039627042,"about_ca_system_score_gemma":0.000542201,"threshold_uncertainty_score":0.0028751493},"labels":[],"label_agreement":null},{"id":"W2804928260","doi":"10.1109/icct.2017.8359631","title":"Secrecy capacity of artificial noise aided Rician/Rayleigh MIMO channels","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Partenariat Canadien Contre Le Cancer; National Science Foundation","keywords":"Rician fading; Artificial noise; MIMO; Secrecy; Computer science; Rayleigh fading; Transmitter; Fading; Null (SQL); Electronic engineering; Computer network; Topology (electrical circuits); Channel (broadcasting); Engineering; Computer security; Electrical engineering; Data mining","score_opus":0.044235908283522384,"score_gpt":0.2677719508269214,"score_spread":0.223536042543399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804928260","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.42794538,0.002200377,0.53016347,0.0007681351,0.00010046236,0.000054611635,0.00071063585,0.00037830343,0.037678614],"genre_scores_gemma":[0.99412316,0.00046166268,0.00387608,0.000039775936,0.000037258073,0.00002508876,0.00007805156,0.000013122467,0.0013457822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873394,0.00040338392,0.000042912012,0.000118351956,0.00032915984,0.00037226625],"domain_scores_gemma":[0.99545395,0.0029661183,0.0004593192,0.0004531051,0.0005575,0.000109892004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001736206,0.00055907806,0.00064184965,0.0008475795,0.00042318486,0.0012477837,0.00050681876,0.0006332262,0.001674079],"category_scores_gemma":[0.003625199,0.00025661784,0.0003552272,0.00081217044,0.0024798138,0.0010970535,0.0011276831,0.000549978,0.0003564002],"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.00026195936,0.000027503063,0.0008925779,0.00012424293,0.00004862686,0.0002522123,0.00015055516,0.82050526,0.010391652,0.1570828,0.001040114,0.009222491],"study_design_scores_gemma":[0.000010341511,0.000056349745,0.0006530059,0.00002245259,0.000016383456,0.00009851837,0.000050943498,0.95343435,0.004930621,0.040113937,0.0005824614,0.00003069684],"about_ca_topic_score_codex":0.0016792974,"about_ca_topic_score_gemma":0.0008065888,"teacher_disagreement_score":0.001736206,"about_ca_system_score_codex":0.0011282268,"about_ca_system_score_gemma":0.00095003226,"threshold_uncertainty_score":0.009182036},"labels":[],"label_agreement":null},{"id":"W2807810272","doi":"10.1109/wcnc.2018.8377208","title":"Secrecy performance analysis over mixed α-μ and κ-μ fading channels","year":2018,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fading; Secrecy; Computer science; Telecommunications; Computer network; Computer security; Channel (broadcasting)","score_opus":0.01258731645188198,"score_gpt":0.23773340254869665,"score_spread":0.22514608609681466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807810272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5168013,0.0026120592,0.46379897,0.0004358257,0.000054980785,0.000090882226,0.000213588,0.00023670736,0.015755765],"genre_scores_gemma":[0.9943896,0.00055595743,0.0043196143,0.000023661698,0.000020561994,0.00001735292,0.000023183646,0.000009303013,0.00064084976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841416,0.0006390431,0.00005564318,0.00015335294,0.00035925853,0.00037855012],"domain_scores_gemma":[0.9931179,0.004546196,0.0010750423,0.00040605213,0.0006780566,0.00017671596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019622273,0.001465108,0.0008801365,0.00084449275,0.0007262854,0.0016397255,0.0007195196,0.00066052336,0.0009545435],"category_scores_gemma":[0.0061596585,0.00031874198,0.0005785335,0.0010312014,0.0018892501,0.0017837359,0.0015512338,0.0007098537,0.000207059],"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.00013497433,0.00002197767,0.0015741133,0.00006602309,0.00004602666,0.00023643166,0.00007219531,0.9635049,0.0040464434,0.02607281,0.00016904874,0.0040550404],"study_design_scores_gemma":[0.000006401867,0.00007608037,0.00046432458,0.000010842244,0.000021754217,0.00012366755,0.000052908617,0.99275994,0.0015400775,0.00479676,0.00013020802,0.000017028424],"about_ca_topic_score_codex":0.0034299935,"about_ca_topic_score_gemma":0.0017539806,"teacher_disagreement_score":0.0034299935,"about_ca_system_score_codex":0.0012935558,"about_ca_system_score_gemma":0.0009673278,"threshold_uncertainty_score":0.010377407},"labels":[],"label_agreement":null},{"id":"W2808669017","doi":"10.1109/tdsc.2018.2846258","title":"Physical Layer based Message Authentication with Secure Channel Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; China Postdoctoral Science Foundation","keywords":"Computer science; Authentication (law); Message authentication code; Authentication protocol; Computer network; Physical layer; Data Authentication Algorithm; PHY; Hash function; Channel (broadcasting); Theoretical computer science; Computer security; Cryptography; Wireless","score_opus":0.013347861099777187,"score_gpt":0.2423302788624251,"score_spread":0.22898241776264794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808669017","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.024151074,0.00037156907,0.9690618,0.00034319048,0.0000863924,0.00013808429,0.00005500964,0.00037892527,0.0054138983],"genre_scores_gemma":[0.8615959,0.0005850475,0.1324197,0.00018621475,0.00011761937,0.00025066562,0.000084805026,0.000042010128,0.004718018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762505,0.0006417054,0.0001228405,0.0003448309,0.00089633785,0.0003692425],"domain_scores_gemma":[0.99558336,0.0020708032,0.0006132244,0.0009351247,0.0006937589,0.00010382582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015974675,0.00074717304,0.0006240981,0.0008910686,0.0008900096,0.0014319835,0.0011151524,0.0010983454,0.0024450028],"category_scores_gemma":[0.0050592325,0.00028281898,0.00050604664,0.0009475315,0.0024003352,0.0035625326,0.002353356,0.0013899528,0.0008806632],"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.00054802006,0.000100047495,0.00097065483,0.00036610043,0.000058580117,0.00041870648,0.00042916634,0.18508917,0.033795066,0.717164,0.001712843,0.05934768],"study_design_scores_gemma":[0.00006348364,0.00025135197,0.00016914801,0.00004835125,0.000046501864,0.0002819643,0.000059450475,0.89693713,0.02533568,0.06949801,0.0072558704,0.000053123007],"about_ca_topic_score_codex":0.0010269216,"about_ca_topic_score_gemma":0.0007385587,"teacher_disagreement_score":0.0024450028,"about_ca_system_score_codex":0.0010356407,"about_ca_system_score_gemma":0.0019169918,"threshold_uncertainty_score":0.008448303},"labels":[],"label_agreement":null},{"id":"W2815431952","doi":"10.1109/access.2018.2853700","title":"On Physical Layer Security Over the Fisher-Snedecor ${\\mathcal{F}}$ Wiretap Fading Channels","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Secrecy; Physical layer; Fading; Computer science; Channel (broadcasting); Monte Carlo method; Topology (electrical circuits); Computer network; Mathematics; Telecommunications; Wireless; Computer security; Statistics; Combinatorics","score_opus":0.035580162284374356,"score_gpt":0.32326989071966544,"score_spread":0.28768972843529106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2815431952","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.13644542,0.0038478384,0.8198763,0.0012611753,0.00018131468,0.00005433592,0.00023126122,0.00018844737,0.03791398],"genre_scores_gemma":[0.97121036,0.0042466153,0.020306937,0.0002833347,0.00013316127,0.000046954352,0.000062497085,0.000052756262,0.0036573722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985953,0.00056954834,0.00004098296,0.000119735676,0.0004320331,0.00024240084],"domain_scores_gemma":[0.99586546,0.0031414314,0.00033928218,0.0002812115,0.0003169426,0.000055666635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019406409,0.0012346191,0.00080837164,0.0011066266,0.0005864534,0.0012137196,0.0005895124,0.00093449274,0.0021547873],"category_scores_gemma":[0.0063220738,0.00033873555,0.0004780454,0.0011209245,0.0031396046,0.0033293765,0.001393294,0.00136408,0.00043765322],"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.00015578796,0.000037118563,0.0007071229,0.00017786775,0.000038745195,0.0003921816,0.00012633528,0.5959501,0.0047879885,0.37671995,0.0015733449,0.019333376],"study_design_scores_gemma":[0.000009855028,0.00008292821,0.00026949833,0.00005666701,0.000015020331,0.00024080297,0.000053816762,0.91311914,0.0028095576,0.08232695,0.0009827089,0.000033096756],"about_ca_topic_score_codex":0.001985252,"about_ca_topic_score_gemma":0.0014050364,"teacher_disagreement_score":0.0021547873,"about_ca_system_score_codex":0.001254846,"about_ca_system_score_gemma":0.0010489079,"threshold_uncertainty_score":0.010263205},"labels":[],"label_agreement":null},{"id":"W2883492073","doi":"10.1109/vtcspring.2018.8417694","title":"Physical Layer Security through Secure Channel Estimation","year":2018,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Equivocation; Physical layer; Secrecy; Computer science; Channel (broadcasting); Computer network; Secure channel; Secure coding; Wireless; Computer security; Transceiver; Transmission (telecommunications); Secure communication; Telecommunications; Encryption; Information security","score_opus":0.01927952931537977,"score_gpt":0.2854918192754845,"score_spread":0.2662122899601047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883492073","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.02697558,0.00028667986,0.96969396,0.00024318075,0.00003291498,0.000024420762,0.000031798838,0.00042388387,0.0022875948],"genre_scores_gemma":[0.92890394,0.00049420615,0.06850192,0.00011123503,0.000053176664,0.000041759627,0.000044114448,0.000022224316,0.0018275706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892265,0.00033376197,0.00006311274,0.0001581741,0.00038058296,0.00014165322],"domain_scores_gemma":[0.9977296,0.0009129401,0.00039513005,0.0007101185,0.00021383142,0.00003834397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009891842,0.0005391537,0.0005604469,0.0004664128,0.00047282377,0.0011127536,0.00050935743,0.0006861279,0.0011971018],"category_scores_gemma":[0.0030963023,0.00030001337,0.0003500094,0.00043367324,0.0011294807,0.0021545477,0.0017540507,0.0009725101,0.00038393014],"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.00059640786,0.00015469348,0.0037597169,0.00033050185,0.00017829638,0.0006169434,0.00047805317,0.3873777,0.14161783,0.22616576,0.0035364116,0.23518768],"study_design_scores_gemma":[0.0000262486,0.00012564064,0.0006048813,0.000030020154,0.00003947061,0.0004582308,0.00006770232,0.9057846,0.056551676,0.032944057,0.003314881,0.00005260653],"about_ca_topic_score_codex":0.00041709584,"about_ca_topic_score_gemma":0.00035007397,"teacher_disagreement_score":0.0011971018,"about_ca_system_score_codex":0.00035818695,"about_ca_system_score_gemma":0.00075962674,"threshold_uncertainty_score":0.0052313805},"labels":[],"label_agreement":null},{"id":"W2883612868","doi":"10.1109/access.2018.2859781","title":"A Collaborative PHY-Aided Technique for End-to-End IoT Device Authentication","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Western University","funders":"","keywords":"Computer science; Computer network; Cryptography; Authentication (law); Authentication protocol; Computer security","score_opus":0.03024612565095277,"score_gpt":0.3444718235006143,"score_spread":0.31422569784966153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883612868","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.00670453,0.000088208,0.991046,0.00005308699,0.000044003318,0.00004183629,0.000011102844,0.00036493168,0.0016462876],"genre_scores_gemma":[0.632558,0.00018980382,0.36200213,0.00018657823,0.00007598016,0.00011774021,0.00007654987,0.00003798068,0.004755223],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99834573,0.00044352486,0.00011855352,0.0002923385,0.00067588553,0.00012398287],"domain_scores_gemma":[0.9989619,0.00020178159,0.00012456656,0.00045429828,0.00022310871,0.000034236342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009167433,0.0006615398,0.00059831084,0.0006474843,0.000681325,0.00078968913,0.0010738156,0.0010494301,0.0021849026],"category_scores_gemma":[0.002020398,0.00029400954,0.00064436166,0.0006004242,0.0005844547,0.0021820206,0.0026060867,0.0010278333,0.0013544003],"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.00080308923,0.00029438644,0.0020237037,0.00018915806,0.0001379522,0.0010285813,0.000491807,0.055254832,0.42431805,0.08158601,0.0033961462,0.43047628],"study_design_scores_gemma":[0.000051151343,0.0004139205,0.0010045805,0.000028266508,0.00007361825,0.0019087541,0.000064509346,0.8576343,0.11832768,0.009628466,0.010804601,0.000060179973],"about_ca_topic_score_codex":0.00020412722,"about_ca_topic_score_gemma":0.00025834265,"teacher_disagreement_score":0.0021849026,"about_ca_system_score_codex":0.000250408,"about_ca_system_score_gemma":0.00047520836,"threshold_uncertainty_score":0.0073091984},"labels":[],"label_agreement":null},{"id":"W2885421144","doi":"10.1109/tcomm.2018.2885800","title":"Robust Distributed Compression of Symmetrically Correlated Gaussian Sources","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security 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":"McMaster University","funders":"","keywords":"Compression (physics); Gaussian; Computer science; Gaussian process; Electronic engineering; Engineering; Physics","score_opus":0.03926466377736963,"score_gpt":0.2615554079986081,"score_spread":0.22229074422123846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885421144","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.0857424,0.00041259997,0.9108758,0.0002363339,0.0000192494,0.000029122997,0.00009871218,0.00012534781,0.0024603775],"genre_scores_gemma":[0.944413,0.0004384656,0.052728724,0.00006907864,0.00003458436,0.000048293652,0.00013122657,0.000021332526,0.0021151514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950707,0.00014448375,0.000023577892,0.00010683131,0.00015220382,0.00006590825],"domain_scores_gemma":[0.9988422,0.00067282486,0.00018889907,0.000119404904,0.00014104588,0.000035730645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081672595,0.0007435055,0.00081316935,0.0002930589,0.00017015221,0.0006351558,0.00079712825,0.00067829585,0.0008147489],"category_scores_gemma":[0.0028416705,0.000280593,0.00028403633,0.00050939753,0.0007678055,0.0010607353,0.000937575,0.0006034186,0.00021255472],"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.00036123287,0.000041385938,0.0005126867,0.00011488609,0.000043545788,0.0003603156,0.00010263134,0.9059052,0.017561335,0.04910788,0.0005157128,0.025373187],"study_design_scores_gemma":[0.000017073215,0.00006308587,0.00016122512,0.0000074430245,0.000008149267,0.00008740899,0.000016284106,0.9868852,0.0042471145,0.008320056,0.00017745492,0.000009561328],"about_ca_topic_score_codex":0.0008177921,"about_ca_topic_score_gemma":0.0007180817,"teacher_disagreement_score":0.0008177921,"about_ca_system_score_codex":0.0006450204,"about_ca_system_score_gemma":0.0005140677,"threshold_uncertainty_score":0.0046800375},"labels":[],"label_agreement":null},{"id":"W2885566751","doi":"10.23919/acc.2018.8430803","title":"Two-Way Gaussian Channels with an Intelligent Jammer","year":2018,"lang":"en","type":"article","venue":"","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":"Jamming; Nash equilibrium; Channel (broadcasting); Gaussian; Computer science; Gaussian noise; Noise (video); Mathematical optimization; Minimum mean square error; Game theory; Power (physics); Control theory (sociology); Mathematics; Algorithm; Telecommunications; Statistics; Mathematical economics; Artificial intelligence; Control (management); Physics","score_opus":0.022791109675782954,"score_gpt":0.27366796376344477,"score_spread":0.2508768540876618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885566751","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.26965883,0.00017358018,0.7140545,0.0004171643,0.00004146277,0.000089422676,0.00010485385,0.00015266653,0.0153075475],"genre_scores_gemma":[0.9808617,0.00009598949,0.016369283,0.000047265465,0.000016570832,0.00004602399,0.00001656328,0.000008849888,0.0025377627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881685,0.0004147421,0.000023705023,0.0001579852,0.00024194183,0.0003448638],"domain_scores_gemma":[0.99716383,0.0016958355,0.00043165433,0.0001781895,0.00035071184,0.00017985271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013335726,0.0010448407,0.000823853,0.0006597765,0.00080770906,0.0017545369,0.0009761936,0.0015120605,0.0017467686],"category_scores_gemma":[0.00527939,0.00040341308,0.00055260793,0.0008096734,0.0024606825,0.0019415886,0.0017180615,0.0008562543,0.00030180812],"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.00025060243,0.00007434588,0.00095532124,0.000059394573,0.0000544471,0.00047430108,0.00019032654,0.826385,0.004687302,0.16320185,0.00034442605,0.0033226744],"study_design_scores_gemma":[0.000036691366,0.000068915564,0.00022487614,0.000006581236,0.00001995838,0.00008316563,0.00006538548,0.97012085,0.000989323,0.028032675,0.00032935332,0.0000221711],"about_ca_topic_score_codex":0.002907997,"about_ca_topic_score_gemma":0.0024871354,"teacher_disagreement_score":0.002907997,"about_ca_system_score_codex":0.0010041427,"about_ca_system_score_gemma":0.0008360437,"threshold_uncertainty_score":0.007285595},"labels":[],"label_agreement":null},{"id":"W2885994734","doi":"10.1109/isit.2018.8437594","title":"Secure Key Agreement over Partially Corrupted Channels","year":2018,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"University of Calgary","keywords":"Alice and Bob; Adversary; Computer science; Key (lock); Disjoint sets; Channel (broadcasting); Cryptography; Shared secret; Key exchange; Set (abstract data type); Public-key cryptography; Theoretical computer science; Pre-shared key; Computer network; Computer security; Mathematics; Discrete mathematics; Alice (programming language); Encryption","score_opus":0.01685646573759275,"score_gpt":0.2558454098782533,"score_spread":0.23898894414066058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885994734","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.058532216,0.00031289074,0.93666667,0.0005530653,0.00006583387,0.00008615408,0.000156907,0.00041139344,0.0032149514],"genre_scores_gemma":[0.91600573,0.0003685983,0.080136396,0.0001630577,0.00011382079,0.00019924229,0.00021276288,0.00009137336,0.0027091694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98577845,0.0056030485,0.0009407228,0.002060072,0.0041700974,0.0014475893],"domain_scores_gemma":[0.9569633,0.026075644,0.004360513,0.0100326715,0.0019900394,0.0005778438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067511355,0.0008991054,0.0020013903,0.000807239,0.001513225,0.004030676,0.0021058044,0.0018189654,0.0016695792],"category_scores_gemma":[0.026049875,0.00094418944,0.0011667251,0.0014417968,0.0049056523,0.008572985,0.005773783,0.003423332,0.0006103555],"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.0010222197,0.0000930908,0.0010988886,0.00026550252,0.00018520997,0.0007753635,0.0011697836,0.29238668,0.020473577,0.6606531,0.0015593106,0.020317225],"study_design_scores_gemma":[0.00012752759,0.0001667765,0.00020038828,0.00005318899,0.00006151887,0.00037452247,0.00015412939,0.6832417,0.021621319,0.28950393,0.004436142,0.000058887425],"about_ca_topic_score_codex":0.00048646497,"about_ca_topic_score_gemma":0.00024585493,"teacher_disagreement_score":0.0067511355,"about_ca_system_score_codex":0.0015164288,"about_ca_system_score_gemma":0.0019479424,"threshold_uncertainty_score":0.035703838},"labels":[],"label_agreement":null},{"id":"W2886433039","doi":"10.1109/access.2019.2944543","title":"On the Security Analysis of a Cooperative Incremental Relaying Protocol in the Presence of an Active Eavesdropper","year":2019,"lang":"en","type":"preprint","venue":"IEEE Access","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer network; Computer science; Secure transmission; Information leakage; Secrecy; Channel state information; Relay; Physical layer; Secure communication; Jamming; Transmitter; Channel (broadcasting); Eavesdropping; Transmission (telecommunications); Context (archaeology); Wireless; Computer security; Telecommunications; Encryption; Power (physics)","score_opus":0.04493091673237438,"score_gpt":0.3611103299855469,"score_spread":0.3161794132531725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886433039","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.08767162,0.0013253278,0.89697176,0.00070647954,0.00004482589,0.00006804084,0.00007736885,0.00008895245,0.013045597],"genre_scores_gemma":[0.96256965,0.0020464326,0.030969338,0.00010082419,0.000105626976,0.00009765871,0.000070464266,0.00003949232,0.004000413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984906,0.0006384908,0.00004916183,0.00016882508,0.00044404718,0.00020879008],"domain_scores_gemma":[0.9924084,0.0057764454,0.00056611135,0.000410236,0.0007331952,0.00010562669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022178285,0.0012838237,0.0008728498,0.0012646309,0.0005935644,0.001315736,0.00087562995,0.0011405569,0.0016372942],"category_scores_gemma":[0.009582891,0.00040185303,0.000821157,0.0007976834,0.0031305815,0.002302853,0.001401547,0.0015432171,0.0003283422],"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.00013319134,0.000053249634,0.00069568184,0.00017330983,0.000065024484,0.0005873092,0.0003389267,0.6720341,0.012378634,0.30084392,0.0008554972,0.011841093],"study_design_scores_gemma":[0.000005818365,0.00006890111,0.00018342605,0.000021385214,0.000020737207,0.00015300309,0.000035599278,0.9685789,0.001691067,0.028838476,0.0003843902,0.000018383083],"about_ca_topic_score_codex":0.0018492857,"about_ca_topic_score_gemma":0.0008575877,"teacher_disagreement_score":0.0022178285,"about_ca_system_score_codex":0.0016614825,"about_ca_system_score_gemma":0.0013292517,"threshold_uncertainty_score":0.01205492},"labels":[],"label_agreement":null},{"id":"W2887629581","doi":"10.1109/icc.2018.8422837","title":"Improving Secrecy under High Correlation via Discriminatory Channel Estimation","year":2018,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Secrecy; Precoding; Channel (broadcasting); Fading; Transmitter; Decoding methods; Artificial noise; Computer network; Wireless; Alice and Bob; Computer security; Transmission (telecommunications); Telecommunications; Alice (programming language); MIMO","score_opus":0.011070494415498485,"score_gpt":0.22996456200691476,"score_spread":0.21889406759141627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887629581","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.12856348,0.000327962,0.86862355,0.00023866231,0.000036402744,0.000023641,0.00003257145,0.00020137803,0.0019522407],"genre_scores_gemma":[0.9578433,0.00028138055,0.040902246,0.0000624056,0.000030504896,0.000015731577,0.000027231492,0.000008369763,0.0008287801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986761,0.00048383558,0.00006068782,0.00020691605,0.00033012408,0.0002422529],"domain_scores_gemma":[0.9954958,0.0025766962,0.00086873106,0.00065649656,0.00029730212,0.00010510799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016643187,0.00073585537,0.00065768184,0.00038207055,0.00046473125,0.00063002843,0.0006444925,0.00074953854,0.0003997112],"category_scores_gemma":[0.006399254,0.0003658991,0.0003409708,0.0006999409,0.0013305253,0.0016422966,0.0020491877,0.0010023372,0.00016409499],"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.0008234059,0.00015241255,0.0052819764,0.00017154485,0.000100318444,0.0006909066,0.00031279365,0.75249076,0.07384281,0.05639836,0.0007886512,0.1089461],"study_design_scores_gemma":[0.000027755219,0.00014268067,0.00054556306,0.000013483063,0.000026262505,0.00029213863,0.00003075814,0.97252095,0.020190915,0.005730433,0.00044722494,0.00003184018],"about_ca_topic_score_codex":0.0008684517,"about_ca_topic_score_gemma":0.0008782265,"teacher_disagreement_score":0.0016643187,"about_ca_system_score_codex":0.00051930733,"about_ca_system_score_gemma":0.001000208,"threshold_uncertainty_score":0.0088018775},"labels":[],"label_agreement":null},{"id":"W2887906137","doi":"10.1109/tcomm.2018.2881117","title":"Learning-Aided Physical Layer Authentication as an Intelligent Process","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":193,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Ministère de la Défense Nationale","keywords":"Physical layer; Computer science; Authentication (law); Robustness (evolution); Authentication protocol; Lightweight Extensible Authentication Protocol; Distributed computing; Wireless","score_opus":0.03787961938960948,"score_gpt":0.336655443153291,"score_spread":0.2987758237636815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887906137","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.014307657,0.000094015704,0.984446,0.00010059342,0.000028783745,0.000027077036,0.00001021093,0.0003145174,0.00067111896],"genre_scores_gemma":[0.8835822,0.00015416351,0.11378717,0.000106418534,0.00004541204,0.000056829398,0.00003806768,0.000027028855,0.0022027893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985012,0.0003969801,0.000098952005,0.0003445418,0.0004807034,0.0001777932],"domain_scores_gemma":[0.9979938,0.0007823785,0.0003258894,0.00045920492,0.00038705827,0.000051736133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015333103,0.0006445484,0.0008718424,0.00044577132,0.00058080343,0.0011182842,0.0011577852,0.0010696898,0.0011869424],"category_scores_gemma":[0.0041284673,0.00028886079,0.0005991046,0.0005484761,0.0013262389,0.0025297706,0.0015082555,0.0014398434,0.0005984871],"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.0005007849,0.00016608881,0.0019831527,0.00014692779,0.00008229154,0.00017789559,0.00023231219,0.6113425,0.04428464,0.038227506,0.0012363703,0.30161962],"study_design_scores_gemma":[0.00000708115,0.00006736816,0.00018566776,0.0000036399713,0.000008597439,0.00004493524,0.0000070446763,0.9898316,0.0056246733,0.003780812,0.00042797616,0.000010595562],"about_ca_topic_score_codex":0.0009466841,"about_ca_topic_score_gemma":0.0007609145,"teacher_disagreement_score":0.0015333103,"about_ca_system_score_codex":0.00056519976,"about_ca_system_score_gemma":0.0010982967,"threshold_uncertainty_score":0.008109033},"labels":[],"label_agreement":null},{"id":"W2888848318","doi":"10.1109/ccece.2018.8447723","title":"Multiple Antenna Physical Layer Security Against Passive Eavesdroppers: A Tutorial","year":2018,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Physical layer; Secrecy; Computer science; Relay; Computer network; Wireless; Channel (broadcasting); Wireless network; Antenna (radio); Telecommunications; Emphasis (telecommunications); Computer security","score_opus":0.013949873160724676,"score_gpt":0.25392414958206583,"score_spread":0.23997427642134114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888848318","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023019488,0.88563687,0.06892778,0.0018799977,0.0033306882,0.00008571034,0.00014082008,0.00015650383,0.037539743],"genre_scores_gemma":[0.020638378,0.90851814,0.036481354,0.0014679695,0.008447564,0.00016061297,0.00025712722,0.00007269613,0.023956226],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99976486,0.000048240636,0.000026432881,0.000052855656,0.00008267342,0.0000248571],"domain_scores_gemma":[0.9996178,0.00022452092,0.00003707347,0.000021762591,0.00007935162,0.000019415986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057680527,0.0016854521,0.0008330767,0.0015808541,0.00037278052,0.0013494105,0.0006531062,0.0015752444,0.0047607883],"category_scores_gemma":[0.0006966362,0.00050217443,0.00058905745,0.0018607688,0.00076445116,0.0028662398,0.000639835,0.002619989,0.0040751565],"study_design_candidate":"not_applicable","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.00010195008,0.0004324768,0.0006644808,0.008092991,0.00012638536,0.0007832126,0.0005018173,0.008611536,0.011864888,0.14608468,0.12586935,0.6968663],"study_design_scores_gemma":[0.0000084058765,0.0004258543,0.0012835732,0.0020745983,0.00007008583,0.0021942165,0.00015410055,0.008240609,0.0021766478,0.03607376,0.9472284,0.00006979349],"about_ca_topic_score_codex":0.00049815915,"about_ca_topic_score_gemma":0.0005139609,"teacher_disagreement_score":0.0047607883,"about_ca_system_score_codex":0.00050468557,"about_ca_system_score_gemma":0.0004919492,"threshold_uncertainty_score":0.01592648},"labels":[],"label_agreement":null},{"id":"W2892673973","doi":"10.1109/icee.2018.8472472","title":"Lower and Upper Bounds on the Capacity of a Class of Gaussian Relay Channels","year":2018,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Relay; Relay channel; Upper and lower bounds; Gaussian; Computer science; Topology (electrical circuits); Mathematics; Algorithm; Telecommunications; Computer network; Combinatorics; Physics; Mathematical analysis","score_opus":0.021251236513609467,"score_gpt":0.23763021949475524,"score_spread":0.21637898298114577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892673973","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.06182302,0.02140115,0.8226866,0.004134499,0.0005586665,0.00013242313,0.0014641976,0.00073963584,0.08705982],"genre_scores_gemma":[0.9045814,0.01488415,0.066616446,0.0012352816,0.0014267364,0.000608421,0.0011453734,0.00039619303,0.009105994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99475324,0.0009771175,0.00019206961,0.0006708435,0.0018316377,0.0015750166],"domain_scores_gemma":[0.9793427,0.016358716,0.000899126,0.0011733861,0.001759069,0.00046697518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037964643,0.0025215573,0.0021674258,0.0032951224,0.0015876369,0.0044741933,0.0025791004,0.0027115198,0.0070747836],"category_scores_gemma":[0.021575054,0.0006882289,0.001474685,0.0029547052,0.0033323604,0.006201936,0.0032613676,0.005746096,0.0013815516],"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.00030450965,0.00020501621,0.00082930835,0.00075564923,0.00014989442,0.00043637157,0.00046382964,0.28737232,0.009048976,0.6502979,0.007902667,0.042233564],"study_design_scores_gemma":[0.000030881452,0.00012103844,0.00075939717,0.00044794034,0.00008613817,0.0005124258,0.00016894622,0.665872,0.0056021386,0.31670144,0.009562525,0.00013507593],"about_ca_topic_score_codex":0.002676219,"about_ca_topic_score_gemma":0.0017384033,"teacher_disagreement_score":0.0070747836,"about_ca_system_score_codex":0.0035921363,"about_ca_system_score_gemma":0.0018041889,"threshold_uncertainty_score":0.026062846},"labels":[],"label_agreement":null},{"id":"W2894949059","doi":"10.1109/tit.2018.2878219","title":"Lattice-Based Robust Distributed Source Coding","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gaussian; Distributed source coding; Algorithm; Computer science; Lattice (music); Shannon–Fano coding; Coding (social sciences); Source code; Variable-length code; Rate distortion; Rate–distortion theory; Theoretical computer science; Mathematics; Decoding methods; Statistics; Physics; Data compression","score_opus":0.013600685699314686,"score_gpt":0.22163363051763968,"score_spread":0.208032944818325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894949059","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.0043066437,0.00019144225,0.99359787,0.00016844283,0.000038842885,0.000027830427,0.00003625811,0.00023847833,0.0013941602],"genre_scores_gemma":[0.5782616,0.00040974372,0.41721222,0.00029354024,0.000087230655,0.00018532024,0.00018085199,0.000073294694,0.0032961941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709105,0.0010544147,0.00010761298,0.00032051463,0.0012648137,0.00016163003],"domain_scores_gemma":[0.99777114,0.0009570073,0.00024348844,0.00038117706,0.0005458844,0.00010133753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019817245,0.0006468136,0.0013777319,0.0007351727,0.00057285797,0.0012415709,0.0021506085,0.0013021365,0.0016987919],"category_scores_gemma":[0.004627732,0.0003805963,0.00068374735,0.001079882,0.0015788999,0.0017935963,0.002381503,0.0019453225,0.0010389849],"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.0003838253,0.00009382429,0.00030689163,0.00017440775,0.00007398995,0.00020622011,0.00013430981,0.6872422,0.02438309,0.18835536,0.0021302977,0.09651552],"study_design_scores_gemma":[0.000032849795,0.000044749275,0.000019539633,0.000007963401,0.0000054182865,0.000052531235,0.000006666195,0.98334193,0.0029073628,0.012737663,0.00082228455,0.000021009719],"about_ca_topic_score_codex":0.0014461722,"about_ca_topic_score_gemma":0.0009667538,"teacher_disagreement_score":0.0021506085,"about_ca_system_score_codex":0.0013051889,"about_ca_system_score_gemma":0.0013309048,"threshold_uncertainty_score":0.0104804635},"labels":[],"label_agreement":null},{"id":"W2896569878","doi":"10.1109/tcomm.2018.2875486","title":"Optimal Design of a Two-Stage Wyner-Ziv Scalar Quantizer With Forwardly/Reversely Degraded Side Information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Algorithm; Minification; Scalar (mathematics); Directed acyclic graph; Dynamic programming; Source code; Partition (number theory); Mathematics; Property (philosophy); Optimization problem; Encoder; Computer science; Mathematical optimization; Discrete mathematics; Combinatorics","score_opus":0.041390576054619765,"score_gpt":0.27514921807884907,"score_spread":0.2337586420242293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896569878","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.008927987,0.00019065705,0.9886812,0.00009231794,0.0000229413,0.000041877283,0.000039673316,0.0001250437,0.0018782968],"genre_scores_gemma":[0.55374765,0.0003678901,0.4401143,0.00012613185,0.000036311423,0.0001826596,0.00014076353,0.00004970696,0.0052345153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937445,0.00013893316,0.000041175466,0.00018081769,0.00019395725,0.00007069951],"domain_scores_gemma":[0.99950874,0.00023142686,0.00008862302,0.000040868596,0.000107920416,0.000022384043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009530517,0.00080396445,0.00083514594,0.00030455523,0.000363553,0.0010620109,0.0010401094,0.0007913788,0.0030266878],"category_scores_gemma":[0.0012060485,0.00047671326,0.00044383807,0.000427257,0.00066191284,0.0014914846,0.0008015892,0.00086552935,0.0004715089],"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.0005684095,0.00013242985,0.00062306173,0.00046502837,0.0001134393,0.00014635462,0.0002487818,0.5859148,0.09067956,0.09556744,0.0023151054,0.22322555],"study_design_scores_gemma":[0.000046150297,0.00015982971,0.00010868145,0.000016885993,0.000021346876,0.00005112456,0.000020241368,0.9759329,0.014737859,0.007168692,0.0017127057,0.000023471757],"about_ca_topic_score_codex":0.0014803684,"about_ca_topic_score_gemma":0.002653057,"teacher_disagreement_score":0.0030266878,"about_ca_system_score_codex":0.00089934486,"about_ca_system_score_gemma":0.001243776,"threshold_uncertainty_score":0.010125279},"labels":[],"label_agreement":null},{"id":"W2904233643","doi":"10.1049/iet-com.2018.5216","title":"Cooperative jamming‐based physical‐layer security of cooperative cognitive radio networks: system model and enabling techniques","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"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 New Brunswick","funders":"","keywords":"Jamming; Physical layer; Cognitive radio; Computer science; Computer network; Layer (electronics); Telecommunications; Wireless","score_opus":0.02865989531718224,"score_gpt":0.2915801016213723,"score_spread":0.2629202063041901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904233643","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.04167572,0.0013960382,0.93169445,0.0006438581,0.00007519159,0.00010662487,0.00008791584,0.00017084947,0.02414924],"genre_scores_gemma":[0.9590636,0.0012958184,0.03330135,0.000108489105,0.000060235066,0.00015608358,0.00003334662,0.000013891902,0.0059671686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996437,0.00014857021,0.000009291662,0.000051077248,0.00009675497,0.00005061364],"domain_scores_gemma":[0.99981385,0.000070159964,0.000035746652,0.00002499136,0.00004484537,0.000010411692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046515896,0.00068873377,0.00047299397,0.0003279665,0.0004421902,0.0011646926,0.0009120778,0.0009323432,0.00097487937],"category_scores_gemma":[0.0006140791,0.0002643321,0.00044632496,0.000551226,0.000944001,0.0009176391,0.0008044047,0.00078962516,0.0003206952],"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.00010260094,0.00009472165,0.0006317478,0.00018379984,0.000053457185,0.00038470567,0.00025269514,0.7893367,0.01720863,0.17223096,0.0015246778,0.017995302],"study_design_scores_gemma":[0.000006353959,0.000065823086,0.000113219685,0.0000111317295,0.000016993117,0.000076632525,0.000027136932,0.98758763,0.0010419176,0.00994301,0.0010990695,0.000011117704],"about_ca_topic_score_codex":0.0022160301,"about_ca_topic_score_gemma":0.0021764578,"teacher_disagreement_score":0.0022160301,"about_ca_system_score_codex":0.000839882,"about_ca_system_score_gemma":0.0006912134,"threshold_uncertainty_score":0.0060938597},"labels":[],"label_agreement":null},{"id":"W2904255561","doi":"10.1049/iet-com.2018.5635","title":"Secrecy performance of a two‐way communication network with two half‐duplex DF relays","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Secrecy; Computer science; Duplex (building); Computer network; Telecommunications; Computer security; Chemistry","score_opus":0.020833190925555786,"score_gpt":0.2726434243523782,"score_spread":0.2518102334268224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904255561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7832332,0.0014602748,0.2026428,0.00044722392,0.00008280657,0.0000791837,0.00017836291,0.00025847173,0.01161756],"genre_scores_gemma":[0.9960764,0.00017687379,0.00299601,0.000016370379,0.000004594407,0.000015826834,0.000021731885,0.000004594399,0.0006875895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879766,0.00049716246,0.000052177835,0.00014843456,0.0002845841,0.00022005284],"domain_scores_gemma":[0.9963924,0.002372656,0.00039407174,0.00018212858,0.00057652267,0.00008212569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013868165,0.0011907893,0.0007824129,0.0007709975,0.00064849097,0.001359116,0.00068152073,0.0012311003,0.0008821704],"category_scores_gemma":[0.0032967958,0.00023635295,0.000563159,0.00063370436,0.001138166,0.0018458695,0.0011517989,0.0005557187,0.00017737791],"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.00033938175,0.00003650065,0.0012816832,0.00009817204,0.000059572805,0.00020608348,0.00007782068,0.98127407,0.0071581006,0.0036405728,0.00016070138,0.005667248],"study_design_scores_gemma":[0.000014104623,0.00025694343,0.0003736373,0.000009259675,0.000033601744,0.00012036541,0.000059819722,0.99219936,0.005646188,0.0011379499,0.00012899144,0.000019767862],"about_ca_topic_score_codex":0.0035618793,"about_ca_topic_score_gemma":0.0018339901,"teacher_disagreement_score":0.0035618793,"about_ca_system_score_codex":0.0015126639,"about_ca_system_score_gemma":0.0007452019,"threshold_uncertainty_score":0.010975182},"labels":[],"label_agreement":null},{"id":"W2907327353","doi":"10.48550/arxiv.1901.01626","title":"Joint Source-Channel Coding for the Transmission of Correlated Sources over Two-Way Channels","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lossy compression; Lossless compression; Coding (social sciences); Channel code; Computer science; Channel (broadcasting); Variable-length code; Source code; Tunstall coding; Algorithm; Adaptive coding; Decoding methods; Theoretical computer science; Mathematics; Telecommunications; Data compression; Statistics; Artificial intelligence","score_opus":0.06434788633977218,"score_gpt":0.2040904431851308,"score_spread":0.13974255684535863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907327353","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.011801193,0.00022800354,0.98480356,0.0001415065,0.000036260066,0.000024809182,0.000047264315,0.00009879414,0.002818575],"genre_scores_gemma":[0.8024837,0.00069267425,0.19296145,0.00011759341,0.00007071195,0.00017001606,0.00012758047,0.00004273056,0.0033335788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992111,0.00025303251,0.000035592846,0.00008892846,0.00030893608,0.00010229328],"domain_scores_gemma":[0.99767965,0.0014101642,0.00021075441,0.00038134973,0.0002609585,0.000057135425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011683394,0.0006681714,0.0005036564,0.0005656745,0.0005028402,0.00087500195,0.00084909395,0.00056576513,0.0015738986],"category_scores_gemma":[0.0033099428,0.00025146524,0.00045499048,0.0010008309,0.001384935,0.0011045892,0.0018470206,0.0013208858,0.00029939445],"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.00016305703,0.000037973434,0.00040880372,0.00016614166,0.000040537623,0.00020036953,0.00027239328,0.36314628,0.0162038,0.5535767,0.0019211359,0.06386289],"study_design_scores_gemma":[0.000017109754,0.000048074904,0.00009902107,0.000022415466,0.000017440658,0.000119544755,0.00002254513,0.9328822,0.0060524396,0.058568116,0.0021286895,0.000022350256],"about_ca_topic_score_codex":0.0009892314,"about_ca_topic_score_gemma":0.0012519181,"teacher_disagreement_score":0.0015738986,"about_ca_system_score_codex":0.00085027644,"about_ca_system_score_gemma":0.001047688,"threshold_uncertainty_score":0.006178856},"labels":[],"label_agreement":null},{"id":"W2907860850","doi":"10.1109/comst.2018.2865607","title":"A Comprehensive Survey on Cooperative Relaying and Jamming Strategies for Physical Layer Security","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":278,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Horizon 2020 Framework Programme","keywords":"Eavesdropping; Jamming; Computer science; Physical layer; Computer network; Key (lock); Wireless; Cryptography; Beamforming; Computer security; Telecommunications","score_opus":0.09882018726467656,"score_gpt":0.35696227644069545,"score_spread":0.2581420891760189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907860850","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035458023,0.86662704,0.08936153,0.00081334653,0.00080239057,0.00008709543,0.00012075536,0.00017182776,0.03847022],"genre_scores_gemma":[0.029977284,0.927385,0.030204752,0.00058933435,0.0014145387,0.00010822164,0.00022657194,0.000047994265,0.010046287],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994832,0.00011326447,0.00005897985,0.00008608878,0.00021178456,0.000046726724],"domain_scores_gemma":[0.9993698,0.0004105052,0.0000576238,0.000041008883,0.000105516825,0.000015434825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059443945,0.001154573,0.0008765758,0.0018780929,0.00044053697,0.0013027051,0.0008498229,0.0012802235,0.0050486154],"category_scores_gemma":[0.0010587394,0.0005635773,0.00060273486,0.0027181155,0.00054205884,0.0023054301,0.0006912714,0.0013198208,0.0024233714],"study_design_candidate":"not_applicable","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.00006935119,0.0001507496,0.00055473944,0.0066537694,0.00007586291,0.00026604204,0.00023840123,0.010103356,0.0077983793,0.09058975,0.025003662,0.8584959],"study_design_scores_gemma":[0.00001543133,0.00055089965,0.0012830985,0.0026405838,0.00013286086,0.0023596599,0.0002299234,0.020608405,0.0048206495,0.03796151,0.92929107,0.00010602799],"about_ca_topic_score_codex":0.00055310904,"about_ca_topic_score_gemma":0.0005331656,"teacher_disagreement_score":0.0050486154,"about_ca_system_score_codex":0.00050358585,"about_ca_system_score_gemma":0.00056639046,"threshold_uncertainty_score":0.016889274},"labels":[],"label_agreement":null},{"id":"W2913163982","doi":"10.32920/ryerson.14651595.v1","title":"Enhancement of Wyner-Ziv video coding for wireless channels","year":2021,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Fading; Computer science; Encoder; Decoding methods; Algorithm; Coding (social sciences); Channel (broadcasting); Wireless; Real-time computing; Mathematics; Telecommunications; Statistics","score_opus":0.031899828977247566,"score_gpt":0.2813180670560394,"score_spread":0.24941823807879182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913163982","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.026718227,0.0010012754,0.9660405,0.0001930363,0.000079832396,0.000046433986,0.000060154776,0.00025204621,0.0056084534],"genre_scores_gemma":[0.6055812,0.0022887338,0.38610762,0.000245557,0.00010241177,0.00012719778,0.00028568495,0.00007244906,0.005189063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949884,0.00008371058,0.000019340423,0.000040291838,0.00030574916,0.000052049454],"domain_scores_gemma":[0.9994777,0.0001621067,0.000055324028,0.00007050246,0.00021813945,0.00001629015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044899495,0.00047914515,0.00030249372,0.00048838335,0.00021209556,0.00041511114,0.0005054354,0.0004971727,0.000884469],"category_scores_gemma":[0.0014465511,0.00010950712,0.0002805002,0.0006782774,0.00037035075,0.00080869795,0.0005596586,0.0006842812,0.00024134346],"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.00029785506,0.00011572981,0.001559322,0.00030647032,0.00004659126,0.00043339617,0.00019327864,0.2242176,0.20893843,0.17506929,0.0046138903,0.3842081],"study_design_scores_gemma":[0.000011847092,0.00007658769,0.00032868897,0.000028547582,0.000011127381,0.0001896446,0.000019698253,0.9405834,0.046010993,0.006843691,0.0058752685,0.000020556836],"about_ca_topic_score_codex":0.002748976,"about_ca_topic_score_gemma":0.0032718966,"teacher_disagreement_score":0.002748976,"about_ca_system_score_codex":0.0005027305,"about_ca_system_score_gemma":0.0007608979,"threshold_uncertainty_score":0.0054659247},"labels":[],"label_agreement":null},{"id":"W2914450851","doi":"10.1145/3308897.3308944","title":"Interference Management Schemes for High Spectral Efficiency Satellite Communications","year":2019,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Concordia University","funders":"","keywords":"Single antenna interference cancellation; Interference (communication); Computer science; Asynchronous communication; Communications satellite; Electronic engineering; Spectral efficiency; Adjacent-channel interference; Channel (broadcasting); Co-channel interference; Satellite; Waveform; Reuse; Noma; Telecommunications; Computer network; Telecommunications link; Engineering","score_opus":0.06000796866045134,"score_gpt":0.3342993618196767,"score_spread":0.27429139315922535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914450851","genre_codex":"review","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.007096399,0.87636375,0.09487275,0.00083886785,0.0008749969,0.000106193824,0.000052957363,0.00018290782,0.019611338],"genre_scores_gemma":[0.10656939,0.80126244,0.07481461,0.00084029563,0.0026823394,0.00016579976,0.00020777593,0.00007878587,0.013378591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992949,0.00017279228,0.000059487425,0.00007361552,0.0003495113,0.000049698625],"domain_scores_gemma":[0.99910516,0.0004346189,0.0001278983,0.00006147434,0.00025079199,0.00002003629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007382294,0.00065524067,0.0006942618,0.0013019324,0.00037583878,0.0010720682,0.0007338879,0.0006963667,0.003397896],"category_scores_gemma":[0.0013382675,0.00026274563,0.00046606886,0.0014858419,0.0003495592,0.0015057111,0.0005676616,0.0010390626,0.0015858428],"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.000082535815,0.00011557828,0.00041321982,0.0029757472,0.00007990808,0.00011541955,0.00008743938,0.005878361,0.011795805,0.018519625,0.006601313,0.9533351],"study_design_scores_gemma":[0.000041077194,0.0022241538,0.0034562617,0.003081026,0.000435041,0.0036748673,0.00030784076,0.02963203,0.03192925,0.019673087,0.905381,0.0001643945],"about_ca_topic_score_codex":0.00037319443,"about_ca_topic_score_gemma":0.0004415643,"teacher_disagreement_score":0.003397896,"about_ca_system_score_codex":0.00058039866,"about_ca_system_score_gemma":0.00039536913,"threshold_uncertainty_score":0.011367023},"labels":[],"label_agreement":null},{"id":"W2915498241","doi":"10.1109/lwc.2019.2922610","title":"Design and Performance Analysis of Secure Multicasting Cooperative Protocol for Wireless Sensor Network Applications","year":2019,"lang":"en","type":"preprint","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Université du Québec à Montréal","funders":"","keywords":"Computer network; Relay; Computer science; Secrecy; Beamforming; Channel state information; Wireless; Multicast; Hop (telecommunications); Transmission (telecommunications); Wireless sensor network; Computer security; Telecommunications","score_opus":0.049450084915339906,"score_gpt":0.3125135281763849,"score_spread":0.26306344326104497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915498241","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.052869245,0.0012363832,0.9388626,0.00034529367,0.00005672883,0.00013489237,0.000033021228,0.00022009815,0.0062417523],"genre_scores_gemma":[0.95402324,0.00069763715,0.043572437,0.000054543045,0.000057172776,0.00015466224,0.00003310355,0.000027310889,0.0013798554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981559,0.00071973185,0.00006381777,0.00016152236,0.0007226542,0.00017646703],"domain_scores_gemma":[0.9978103,0.0011213797,0.0002256376,0.00016235367,0.0006311026,0.0000492427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023399733,0.00085917936,0.0006822002,0.0007196523,0.0006428439,0.00094539067,0.00081170426,0.000665156,0.0010793328],"category_scores_gemma":[0.005151914,0.00034479256,0.00043351596,0.000509668,0.0007279758,0.0008501942,0.0008614886,0.00068959704,0.00025380938],"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.00018385232,0.00006346524,0.001237069,0.00017713595,0.00007601338,0.0002304534,0.0002231319,0.86857134,0.021424595,0.067987785,0.0014407536,0.038384497],"study_design_scores_gemma":[0.0000037648215,0.00006403759,0.000065138214,0.0000040578043,0.000009335268,0.000027661281,0.0000109303055,0.995974,0.00096028176,0.0025884535,0.00028849926,0.0000038093995],"about_ca_topic_score_codex":0.0018292292,"about_ca_topic_score_gemma":0.0017970343,"teacher_disagreement_score":0.0023399733,"about_ca_system_score_codex":0.0017044538,"about_ca_system_score_gemma":0.0011579115,"threshold_uncertainty_score":0.012375116},"labels":[],"label_agreement":null},{"id":"W2917328431","doi":"10.1109/lwc.2019.2900310","title":"Achievable Secure Degrees of Freedom of ${K}$ -User MISO Broadcast Channel With Imperfect CSIT","year":2019,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","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 British Columbia","funders":"National Natural Science Foundation of China","keywords":"Degrees of freedom (physics and chemistry); Imperfect; Computer science; Computer network; Channel (broadcasting); Broadcasting (networking); Telecommunications; Physics","score_opus":0.011482889251643516,"score_gpt":0.22211101525899868,"score_spread":0.21062812600735517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917328431","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.068513215,0.0009158127,0.9112273,0.000743148,0.000058562306,0.00005446294,0.00027681363,0.0001672425,0.018043546],"genre_scores_gemma":[0.97464716,0.00058494776,0.023228647,0.0001084737,0.000035293146,0.00006571274,0.00009612308,0.00001710561,0.0012164784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986891,0.00040832494,0.000059799026,0.00015469058,0.00038809146,0.00030003514],"domain_scores_gemma":[0.9981775,0.0010433405,0.00026536672,0.00023704211,0.00019893049,0.000077849036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012362206,0.0013090089,0.00085631624,0.00052048627,0.0007800594,0.0014484788,0.00061831845,0.0009893615,0.001561921],"category_scores_gemma":[0.004063351,0.0003976251,0.00064102677,0.0007890144,0.0020560357,0.0017321819,0.0018852009,0.0012818957,0.0003639572],"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.0003042665,0.000040633076,0.001044673,0.00028314907,0.00006911689,0.0003986792,0.00030604823,0.58226085,0.013955623,0.38366365,0.0013886112,0.016284699],"study_design_scores_gemma":[0.000036465222,0.00008051279,0.0002506714,0.000058466645,0.000021231956,0.00022194769,0.00011554799,0.87805516,0.0050460296,0.114713244,0.0013529261,0.000047760605],"about_ca_topic_score_codex":0.0013357189,"about_ca_topic_score_gemma":0.0012009582,"teacher_disagreement_score":0.001561921,"about_ca_system_score_codex":0.00126851,"about_ca_system_score_gemma":0.0013228247,"threshold_uncertainty_score":0.009203672},"labels":[],"label_agreement":null},{"id":"W2917753748","doi":"10.3390/e21020213","title":"Asymptotic Rate-Distortion Analysis of Symmetric Remote Gaussian Source Coding: Centralized Encoding vs. Distributed Encoding","year":2019,"lang":"en","type":"article","venue":"Entropy","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":"McMaster University","funders":"","keywords":"Gaussian; Independent and identically distributed random variables; Encoding (memory); Distortion (music); Distributed source coding; Algorithm; Computer science; Rate distortion; Compressed sensing; Coding (social sciences); Source code; Decoding methods; Rate–distortion theory; Mathematics; Data compression; Random variable; Variable-length code; Statistics; Artificial intelligence; Telecommunications; Bandwidth (computing); Physics","score_opus":0.010539675256807907,"score_gpt":0.23641373137151941,"score_spread":0.2258740561147115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917753748","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.06903296,0.0051866234,0.89691305,0.0019984357,0.00013771451,0.00008970164,0.0003993046,0.00029235656,0.025949841],"genre_scores_gemma":[0.9378993,0.0046846503,0.049820643,0.00037653098,0.00033953978,0.0001680545,0.00037978974,0.00018068257,0.0061506405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801767,0.0008127331,0.00006566014,0.00018445356,0.00064607634,0.00027339693],"domain_scores_gemma":[0.9828614,0.013231161,0.0010805046,0.0009380589,0.0016278906,0.00026095723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004049906,0.001886716,0.0013864104,0.0013563514,0.0005440478,0.001822954,0.0019080171,0.0014691435,0.0031213155],"category_scores_gemma":[0.022607623,0.0006087167,0.0007373028,0.001406199,0.0027558699,0.004311211,0.0028697816,0.0021818744,0.00059148984],"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.00039660916,0.00009522904,0.0009349485,0.0003254801,0.00008807112,0.00041194362,0.0002646667,0.5280725,0.007863297,0.43995956,0.0026097016,0.018978037],"study_design_scores_gemma":[0.000014993751,0.00008113891,0.00042020294,0.00006132442,0.000026815502,0.00032664803,0.00007662242,0.9226578,0.0020776493,0.07348603,0.00073329575,0.000037480146],"about_ca_topic_score_codex":0.001607289,"about_ca_topic_score_gemma":0.0009701271,"teacher_disagreement_score":0.004049906,"about_ca_system_score_codex":0.0029859063,"about_ca_system_score_gemma":0.0012543132,"threshold_uncertainty_score":0.021664381},"labels":[],"label_agreement":null},{"id":"W2918569083","doi":"","title":"Intrinsic Capacity","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","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":"McMaster University","funders":"","keywords":"Generalization; Channel (broadcasting); Binary number; Encoder; Convex combination; State (computer science); Channel capacity; Realization (probability); Mathematics; Regular polygon; Decoding methods; Binary erasure channel; Computer science; Information theory; Topology (electrical circuits); Algorithm; Convex optimization; Combinatorics; Telecommunications; Arithmetic; Mathematical analysis; Statistics","score_opus":0.007868082910500965,"score_gpt":0.19756019010329598,"score_spread":0.189692107192795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918569083","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.10185552,0.0017694004,0.8103248,0.0014589009,0.000171325,0.00009708977,0.0031508051,0.000441643,0.08073053],"genre_scores_gemma":[0.9347873,0.0022980098,0.04891643,0.0003147676,0.00030442694,0.0003072119,0.0013361154,0.00021416802,0.01152158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970797,0.0007996915,0.00016648868,0.0005817613,0.0008455493,0.0005267814],"domain_scores_gemma":[0.99250424,0.004416357,0.0004905365,0.0011745417,0.0011563055,0.00025803913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019229541,0.00087333395,0.0009004908,0.0016091557,0.0007989302,0.0026711368,0.002081752,0.0010618642,0.010457509],"category_scores_gemma":[0.009645753,0.00045734667,0.0007983578,0.0013504281,0.0024424838,0.0052155694,0.002265349,0.0014893833,0.0013349792],"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.000061582476,0.000016899718,0.00035626677,0.00016837133,0.000035525245,0.00008957608,0.000111478286,0.033837162,0.00341346,0.94931716,0.0021723504,0.010420194],"study_design_scores_gemma":[0.00001751285,0.00004021249,0.0006290747,0.00008140944,0.00003108094,0.00038977526,0.000071508024,0.1315472,0.0048131994,0.85325897,0.009060879,0.00005925239],"about_ca_topic_score_codex":0.0007628196,"about_ca_topic_score_gemma":0.00046765534,"teacher_disagreement_score":0.010457509,"about_ca_system_score_codex":0.0017061993,"about_ca_system_score_gemma":0.0013217574,"threshold_uncertainty_score":0.034983873},"labels":[],"label_agreement":null},{"id":"W2919528851","doi":"10.1007/s11042-019-7249-5","title":"Successive refinement of side information frames in distributed video coding","year":2019,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Decoding methods; Discrete cosine transform; Encoder; Residual frame; Coding (social sciences); Distributed source coding; Frame (networking); Algorithm; Reference frame; Computer vision; Variable-length code; Telecommunications; Mathematics; Image (mathematics); Statistics","score_opus":0.009818088476175924,"score_gpt":0.2370952062122901,"score_spread":0.22727711773611417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919528851","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.016256304,0.00019185148,0.9827079,0.000036285193,0.000031044394,0.000014469526,0.000017616474,0.00009514217,0.0006493895],"genre_scores_gemma":[0.33103317,0.0006447753,0.66416293,0.000059569815,0.0000731925,0.00007783608,0.00016713684,0.00009579974,0.0036855927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927944,0.0002678797,0.000032510325,0.000059399827,0.0003080017,0.00005277918],"domain_scores_gemma":[0.99803513,0.0012066024,0.000109057866,0.00031138916,0.0002913534,0.000046401958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011476114,0.0005306304,0.00044006394,0.0005127552,0.00022995025,0.00038243952,0.0006831569,0.00052486215,0.0012232303],"category_scores_gemma":[0.0039499556,0.00036884044,0.00032684684,0.0006606237,0.00054606225,0.0007745011,0.0007428515,0.0008381846,0.00031605188],"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.0010874643,0.00010033167,0.0011004462,0.00016276985,0.00006878001,0.00025027795,0.0003766556,0.33905736,0.17076719,0.08174089,0.0018798695,0.40340793],"study_design_scores_gemma":[0.000019866384,0.00006452774,0.00019804688,0.000010959953,0.000009801381,0.000072282186,0.000014968413,0.9738849,0.018986894,0.005591648,0.0011367399,0.00000946824],"about_ca_topic_score_codex":0.002711151,"about_ca_topic_score_gemma":0.005093701,"teacher_disagreement_score":0.002711151,"about_ca_system_score_codex":0.00045587093,"about_ca_system_score_gemma":0.00055364054,"threshold_uncertainty_score":0.006069243},"labels":[],"label_agreement":null},{"id":"W2920823316","doi":"10.1109/isit.2019.8849553","title":"Wiretap Secret Key Capacity of Tree-PIN","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"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":"Upper and lower bounds; Tree (set theory); Key (lock); Computer science; Information leakage; Adversary; Random variable; Theoretical computer science; Computer network; Mathematics; Discrete mathematics; Topology (electrical circuits); Combinatorics; Computer security; Statistics","score_opus":0.012868806764901854,"score_gpt":0.20843410768330992,"score_spread":0.19556530091840807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920823316","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.15559445,0.0026725864,0.77899975,0.0010683395,0.00012645798,0.00017249682,0.0014876659,0.00065170747,0.059226584],"genre_scores_gemma":[0.9705254,0.0016253317,0.02174638,0.00017128736,0.0001244882,0.00023400265,0.00045343587,0.00014540298,0.004974366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982217,0.0003545735,0.000054705324,0.00027847174,0.000500175,0.0005903101],"domain_scores_gemma":[0.9887305,0.008614776,0.0007145333,0.000783002,0.0007908748,0.0003663433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017152285,0.0007157885,0.0010122441,0.0016441819,0.000852693,0.0026999307,0.0016971882,0.0008700233,0.0070793005],"category_scores_gemma":[0.01134463,0.0004118927,0.00074687164,0.0019817322,0.0028452238,0.0052472926,0.0024721867,0.0023429072,0.0008275964],"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.00018929155,0.000078697056,0.0007937932,0.00041425036,0.000057704732,0.00047504774,0.00029209847,0.31780124,0.006546731,0.6519471,0.0055780173,0.015826045],"study_design_scores_gemma":[0.000008510191,0.000038535847,0.0003090116,0.0000628547,0.000019027859,0.00026553092,0.00009736314,0.7037179,0.0036282472,0.2894797,0.0023390364,0.000034208984],"about_ca_topic_score_codex":0.0012282155,"about_ca_topic_score_gemma":0.0007709453,"teacher_disagreement_score":0.0070793005,"about_ca_system_score_codex":0.002329681,"about_ca_system_score_gemma":0.0015379032,"threshold_uncertainty_score":0.023682654},"labels":[],"label_agreement":null},{"id":"W2921099176","doi":"10.1186/s13638-019-1369-5","title":"Amplify-and-forward relay identification using joint Tx/Rx I/Q imbalance-based device fingerprinting","year":2019,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Relay; Identification (biology); Keying; Fingerprint (computing); Quadrature amplitude modulation; Compensation (psychology); Algorithm; Electronic engineering; Real-time computing; Telecommunications; Bit error rate; Decoding methods; Artificial intelligence; Power (physics)","score_opus":0.04109239516597152,"score_gpt":0.2750090435197121,"score_spread":0.2339166483537406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921099176","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.04782019,0.00022523168,0.94979095,0.000073874115,0.000028749782,0.00006193748,0.00003641092,0.0005888508,0.001373727],"genre_scores_gemma":[0.8411483,0.00019797782,0.15724485,0.000058546695,0.000033659515,0.00005841841,0.00005651026,0.000018243154,0.0011834413],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994006,0.00012288662,0.000040967618,0.00013144377,0.00026346042,0.000040650975],"domain_scores_gemma":[0.9992472,0.00023319806,0.00021015515,0.00015689015,0.00012650617,0.000026056327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006023722,0.0006507678,0.00058221264,0.0007118651,0.0003885779,0.0007602872,0.00055306853,0.00048816486,0.00093477505],"category_scores_gemma":[0.002080609,0.0001973338,0.00029588997,0.0005211398,0.00048698572,0.0014383503,0.00077265414,0.00040834784,0.0004795095],"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.0007960767,0.00021799463,0.006983506,0.00021424214,0.00008227395,0.00035785366,0.00028381663,0.09951619,0.23864886,0.015243397,0.0012869714,0.6363688],"study_design_scores_gemma":[0.000046379915,0.00053251896,0.0028528094,0.000026962503,0.00007775845,0.0015308943,0.00005741877,0.8085432,0.17802188,0.0052299467,0.0030262778,0.000053966905],"about_ca_topic_score_codex":0.00038367874,"about_ca_topic_score_gemma":0.00043611255,"teacher_disagreement_score":0.00093477505,"about_ca_system_score_codex":0.0003882952,"about_ca_system_score_gemma":0.00034344225,"threshold_uncertainty_score":0.003185749},"labels":[],"label_agreement":null},{"id":"W2921914961","doi":"10.1007/s00440-020-00967-w","title":"Stability of the Shannon–Stam inequality via the Föllmer process","year":2020,"lang":"en","type":"article","venue":"Probability Theory and Related Fields","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; Israel Science Foundation","keywords":"Covariance; Bounded function; Stochastic process; Gaussian process; Stability (learning theory); Entropy (arrow of time); Mathematical proof; Mathematical finance; Multivariate random variable","score_opus":0.01880990440055895,"score_gpt":0.23725446839830322,"score_spread":0.21844456399774426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921914961","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.17560843,0.001446855,0.7341629,0.0055310917,0.0002695429,0.00015788215,0.0007658108,0.0004806552,0.08157676],"genre_scores_gemma":[0.9600708,0.00057484163,0.02145169,0.00049960206,0.0001951018,0.00022864575,0.00024360833,0.0001685587,0.016567118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982181,0.0005476866,0.00006462484,0.000352699,0.0005099451,0.00030695857],"domain_scores_gemma":[0.9856765,0.009704546,0.001212816,0.00059674954,0.0022035697,0.00060586375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003909327,0.0009357254,0.0010159013,0.002019553,0.0015613396,0.0030900445,0.00170991,0.0017427506,0.010511783],"category_scores_gemma":[0.022398774,0.0004596528,0.0012223125,0.00095368025,0.004249263,0.0049518747,0.0026834232,0.0031073226,0.0015941474],"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.00011884004,0.000029309156,0.0007238171,0.00008178832,0.00003406185,0.00016349391,0.00021085433,0.030866992,0.00440294,0.95542234,0.0024448815,0.005500776],"study_design_scores_gemma":[0.000020290332,0.000051360417,0.0004423301,0.00003897291,0.0000119514925,0.000069723304,0.000085997504,0.5600071,0.0018364085,0.43583375,0.0015644613,0.000037754395],"about_ca_topic_score_codex":0.004266567,"about_ca_topic_score_gemma":0.0017539647,"teacher_disagreement_score":0.010511783,"about_ca_system_score_codex":0.0033535664,"about_ca_system_score_gemma":0.0016190521,"threshold_uncertainty_score":0.03516543},"labels":[],"label_agreement":null},{"id":"W2925280121","doi":"10.1109/tit.2020.2966197","title":"Fundamental Limits of Decentralized Data Shuffling","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"National Science Foundation of Sri Lanka; European Research Council; European Commission","keywords":"Shuffling; Converse; Computer science; Distributed computing; Constraint (computer-aided design); Distributed data store; Theoretical computer science; Engineering; Mathematics","score_opus":0.0561776954809643,"score_gpt":0.2902311953398642,"score_spread":0.2340534998588999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2925280121","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.07060618,0.0012504793,0.90719646,0.0022938892,0.00013718661,0.00011953232,0.00026959463,0.000578173,0.017548567],"genre_scores_gemma":[0.89462894,0.0011391721,0.09882237,0.00069534994,0.00024907695,0.00046615142,0.00027334967,0.00020434712,0.003521228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99182785,0.0027444747,0.00034184754,0.001408764,0.0024989296,0.0011781767],"domain_scores_gemma":[0.9633973,0.025389858,0.0022956645,0.0055477573,0.002323956,0.0010454382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067604207,0.0010694574,0.0018386276,0.0012445078,0.0022087512,0.0038488368,0.0028171437,0.0023186323,0.0035200112],"category_scores_gemma":[0.034488726,0.0009541651,0.0011554494,0.0015823367,0.004568234,0.0081853,0.0066136946,0.004360359,0.0008893133],"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.0005215154,0.0001406648,0.00056483876,0.00035393354,0.000059645517,0.00021797935,0.00057292334,0.2150041,0.011194468,0.7326143,0.004383739,0.03437188],"study_design_scores_gemma":[0.000042802345,0.000089570814,0.00019385396,0.000052084655,0.00001974382,0.00019276737,0.00011875488,0.55748975,0.005815223,0.4333153,0.0026212214,0.000048889877],"about_ca_topic_score_codex":0.0009981352,"about_ca_topic_score_gemma":0.0006075543,"teacher_disagreement_score":0.0067604207,"about_ca_system_score_codex":0.00278423,"about_ca_system_score_gemma":0.002241188,"threshold_uncertainty_score":0.035752952},"labels":[],"label_agreement":null},{"id":"W2929522431","doi":"10.1109/cwit.2019.8929920","title":"Capacity of Generalized Discrete-Memoryless Push-to-Talk Two-Way Channels","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"Queen's University","funders":"","keywords":"Channel (broadcasting); Channel capacity; Transmission (telecommunications); Symmetry (geometry); Property (philosophy); Topology (electrical circuits); Convex hull; Transmission channel","score_opus":0.018376345787368076,"score_gpt":0.2522480820931349,"score_spread":0.2338717363057668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2929522431","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.22970666,0.0013310866,0.73608124,0.000719428,0.00009125686,0.00010141057,0.00083966187,0.0006301258,0.030499134],"genre_scores_gemma":[0.98704904,0.00049288146,0.0098389955,0.000083391606,0.00003944027,0.00011077661,0.00012528477,0.000037129834,0.0022230619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983425,0.00045936447,0.000056157667,0.00021296242,0.0005540999,0.0003748798],"domain_scores_gemma":[0.9959144,0.0025995788,0.00035165405,0.0005526947,0.0004774834,0.00010411551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012085146,0.00082747056,0.0010292836,0.0007420555,0.0005692752,0.0018569344,0.001720521,0.00083790877,0.0023940906],"category_scores_gemma":[0.0047206045,0.00038913675,0.00058290974,0.0011346224,0.0024550941,0.002549309,0.0017142335,0.0010956227,0.00039298902],"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.00018799235,0.00003233617,0.00021877023,0.00016894005,0.000038431474,0.0003818054,0.00019833974,0.58883977,0.006307885,0.39324605,0.001356213,0.009023413],"study_design_scores_gemma":[0.000017516004,0.000031696523,0.0001601805,0.000021937749,0.0000129503715,0.00014654857,0.00004844282,0.8655063,0.0024300658,0.1304844,0.0011047717,0.00003526849],"about_ca_topic_score_codex":0.0026988534,"about_ca_topic_score_gemma":0.00095585163,"teacher_disagreement_score":0.0026988534,"about_ca_system_score_codex":0.0015176646,"about_ca_system_score_gemma":0.0011132805,"threshold_uncertainty_score":0.011011481},"labels":[],"label_agreement":null},{"id":"W2938954758","doi":"10.1109/isplc.2019.8693263","title":"Securing MIMO Power Line Communications with Full-Duplex Jamming Receivers","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Secrecy; Jamming; Power-line communication; Computer network; Network packet; MIMO; Wireless; Physical layer; Duplex (building); Transmission (telecommunications); Confidentiality; Channel (broadcasting); Computer security; Power (physics); Telecommunications","score_opus":0.011074661825811282,"score_gpt":0.22703595053280703,"score_spread":0.21596128870699574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2938954758","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.13546681,0.00031326726,0.8566637,0.00019176873,0.000030827036,0.000032180295,0.000038033577,0.00019446161,0.00706887],"genre_scores_gemma":[0.97056526,0.00016633487,0.027846565,0.000051087856,0.000014434019,0.000020299149,0.000014887844,0.0000073978326,0.0013137117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995634,0.00016169244,0.00001360387,0.00004290597,0.00015139446,0.00006699099],"domain_scores_gemma":[0.9990767,0.0005864388,0.00015203474,0.00007424577,0.00008540829,0.000025082849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063025666,0.0005040387,0.00034883316,0.00021350896,0.0002371403,0.00062224147,0.00027599075,0.00055491587,0.0011003079],"category_scores_gemma":[0.0014616054,0.00023540501,0.00026097475,0.00031107015,0.0007055108,0.00078873435,0.0005728056,0.00038416937,0.0003251034],"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.00020974896,0.00005145917,0.0009457261,0.00011506621,0.000061235405,0.00019461721,0.0001010471,0.90935946,0.047217585,0.017946051,0.0004531885,0.02334477],"study_design_scores_gemma":[0.000016655507,0.00013509662,0.00021166763,0.000007002043,0.000011631567,0.00008805563,0.000023922596,0.9878991,0.0087582655,0.0025171372,0.0003228842,0.000008585057],"about_ca_topic_score_codex":0.00037250557,"about_ca_topic_score_gemma":0.00040804857,"teacher_disagreement_score":0.0011003079,"about_ca_system_score_codex":0.00028212118,"about_ca_system_score_gemma":0.00031656516,"threshold_uncertainty_score":0.0036808848},"labels":[],"label_agreement":null},{"id":"W2939031118","doi":"10.1109/vtcfall.2018.8690916","title":"Optimized Signaling of Binary Correlated Sources Over Gaussian Multiple Access Channels","year":2018,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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":"Binary number; Computer science; Gaussian; Mathematics; Physics; Arithmetic","score_opus":0.02405677172124856,"score_gpt":0.2757962263140469,"score_spread":0.25173945459279834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939031118","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.121536314,0.00034691082,0.87377936,0.00021676581,0.0000465988,0.00004832679,0.00008096857,0.00015837616,0.0037863823],"genre_scores_gemma":[0.87443507,0.0002989331,0.1237077,0.00008810318,0.000023887238,0.00005851294,0.000060884,0.00002212314,0.0013047544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881554,0.0004934066,0.00007069064,0.00013432148,0.00037140303,0.00011471564],"domain_scores_gemma":[0.99864846,0.0005313438,0.00037394476,0.00019321326,0.00020302561,0.00005007994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008485456,0.0006754163,0.00054852496,0.00042286288,0.00029159655,0.0007563337,0.0006060298,0.00055579556,0.00081701943],"category_scores_gemma":[0.0022660096,0.0003033208,0.0002818986,0.00074434775,0.0007100357,0.00087873964,0.0010637499,0.0006058421,0.00023226059],"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.00069703197,0.00012953607,0.001379835,0.0004060669,0.00011325285,0.00039306944,0.0003179161,0.49151075,0.164386,0.22887799,0.0008371685,0.110951416],"study_design_scores_gemma":[0.000057937592,0.00023070094,0.00034075428,0.000031253825,0.000033266922,0.00018162404,0.00003848251,0.92247707,0.048648834,0.026672315,0.0012428222,0.00004498152],"about_ca_topic_score_codex":0.00022426494,"about_ca_topic_score_gemma":0.0003832388,"teacher_disagreement_score":0.0008485456,"about_ca_system_score_codex":0.00051342574,"about_ca_system_score_gemma":0.00067141344,"threshold_uncertainty_score":0.004487574},"labels":[],"label_agreement":null},{"id":"W2942638925","doi":"10.1109/tvt.2019.2913934","title":"Secrecy Analysis in Wireless Network With Passive Eavesdroppers by Using Partial Cooperation","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer network; Jamming; Beamforming; Computer science; Secrecy; Transmission (telecommunications); Wireless; Broadcasting (networking); Multicast; Wireless network; Secure transmission; Telecommunications; Computer security; Encryption","score_opus":0.00579213081979211,"score_gpt":0.2144010910957968,"score_spread":0.2086089602760047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942638925","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.060686197,0.0015900292,0.9260918,0.00038686453,0.00004297257,0.000037783957,0.000102752114,0.00010453758,0.010957075],"genre_scores_gemma":[0.9730864,0.0026103922,0.020957634,0.00008349546,0.00010290549,0.000075849035,0.000078604164,0.00003807358,0.002966779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988538,0.00043746457,0.0000434892,0.00010582867,0.0003722183,0.00018723987],"domain_scores_gemma":[0.99732083,0.0017401072,0.00028095586,0.00020450307,0.0003922542,0.00006140782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015628634,0.0011746901,0.0007471621,0.0012222299,0.0006619506,0.0010459133,0.00090586033,0.00077137334,0.0013035863],"category_scores_gemma":[0.003338706,0.0004825265,0.0010331022,0.0009789995,0.0017190883,0.0023614045,0.0012719557,0.00092923,0.00035528684],"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.00010810172,0.000029593439,0.0011245051,0.00021307805,0.00007944131,0.0005804343,0.0002902897,0.77331054,0.012422341,0.20267901,0.0009522549,0.008210368],"study_design_scores_gemma":[0.0000044144986,0.000032814798,0.00020749087,0.000013494125,0.000020436666,0.00013463577,0.000035864938,0.98045987,0.001241015,0.017477201,0.00036035143,0.000012308578],"about_ca_topic_score_codex":0.00216864,"about_ca_topic_score_gemma":0.00097027456,"teacher_disagreement_score":0.00216864,"about_ca_system_score_codex":0.0012030229,"about_ca_system_score_gemma":0.0008534583,"threshold_uncertainty_score":0.008728504},"labels":[],"label_agreement":null},{"id":"W2943221627","doi":"10.1049/el.2019.0707","title":"Secrecy outage analysis of double shadowed Rician channels","year":2019,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Rician fading; Secrecy; Computer science; Transmitter; Line-of-sight; Telecommunications; Electronic engineering; Physics; Computer security; Channel (broadcasting); Fading; Engineering","score_opus":0.006579919006149386,"score_gpt":0.2183443074745629,"score_spread":0.21176438846841353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943221627","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.345082,0.0017247329,0.63683724,0.0004547766,0.00009427366,0.000033853208,0.00031169644,0.00023772389,0.015223685],"genre_scores_gemma":[0.9951324,0.0004211054,0.003301134,0.00002470533,0.000026830045,0.0000071196487,0.00004287842,0.000010667188,0.001033158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929106,0.00020531277,0.000022819208,0.00006560851,0.00022783037,0.00018718577],"domain_scores_gemma":[0.99758685,0.0013995463,0.00027735723,0.00028611458,0.0003677424,0.00008249756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010611033,0.0007564768,0.0006727175,0.0006596734,0.00031647072,0.00076830137,0.0005443922,0.0006392158,0.001196832],"category_scores_gemma":[0.0029244411,0.00027441335,0.0004614631,0.00070034526,0.0013276582,0.0009846864,0.0010665577,0.000724126,0.0002158753],"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.00010723398,0.000021155834,0.0010792069,0.00006251825,0.000030183859,0.0004630377,0.000101239355,0.94618696,0.005189789,0.0414766,0.0006672332,0.004614835],"study_design_scores_gemma":[0.0000030906833,0.00001777977,0.00027239136,0.00000386731,0.000005139703,0.00009223948,0.000023418477,0.9948637,0.0005982451,0.0039536683,0.00015914196,0.0000072261605],"about_ca_topic_score_codex":0.0027636176,"about_ca_topic_score_gemma":0.0013773653,"teacher_disagreement_score":0.0027636176,"about_ca_system_score_codex":0.0010720121,"about_ca_system_score_gemma":0.00064559234,"threshold_uncertainty_score":0.007778108},"labels":[],"label_agreement":null},{"id":"W2944211749","doi":"10.1109/tvt.2019.2916209","title":"On Countermeasures of Pilot Spoofing Attack in Massive MIMO Systems: A Double Channel Training Based Approach","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Precoding; Telecommunications link; Channel (broadcasting); MIMO; Spoofing attack; Computer science; Computer network; Jamming; Base station; Transmission (telecommunications); Telecommunications","score_opus":0.03464117845901562,"score_gpt":0.24675316996398947,"score_spread":0.21211199150497384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944211749","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.033472914,0.0014686831,0.9583396,0.00038629532,0.00009973044,0.00004573697,0.000022719874,0.00009060284,0.0060736453],"genre_scores_gemma":[0.92965007,0.0019492971,0.06548755,0.00016419854,0.00018475975,0.00005615718,0.00002434605,0.000020696263,0.0024630006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990101,0.00035513117,0.000037235193,0.0001425219,0.0002956752,0.0001592443],"domain_scores_gemma":[0.99769044,0.0014470019,0.00030506385,0.00021192871,0.00028571425,0.00005986241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010450314,0.0011097123,0.00079950097,0.00065878883,0.00037041274,0.00092441234,0.0005343718,0.0010873103,0.0009329106],"category_scores_gemma":[0.0027992106,0.00027296954,0.00055100035,0.0004940519,0.0013764965,0.0015129923,0.000962665,0.0009286715,0.00019213716],"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.00023029669,0.000112677255,0.001242114,0.00036469396,0.00013694231,0.00039439512,0.00022351669,0.81246525,0.03672032,0.08219866,0.00074183213,0.06516936],"study_design_scores_gemma":[0.000005949221,0.00020570392,0.00030723808,0.000021927275,0.00002564485,0.00016231246,0.000043128006,0.98676574,0.0051444033,0.0067035104,0.00059687137,0.000017586559],"about_ca_topic_score_codex":0.0006483544,"about_ca_topic_score_gemma":0.0005300776,"teacher_disagreement_score":0.0011097123,"about_ca_system_score_codex":0.0005259031,"about_ca_system_score_gemma":0.00059809623,"threshold_uncertainty_score":0.0055267215},"labels":[],"label_agreement":null},{"id":"W2947899572","doi":"10.1109/lcomm.2019.2920347","title":"Secrecy Performance of Correlated $\\alpha$ -$\\mu$ Fading Channels","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Secrecy; Fading; Computer science; Channel (broadcasting); Telecommunications; Topology (electrical circuits); Computer network; Mathematics; Computer security; Combinatorics","score_opus":0.01793768378011158,"score_gpt":0.2364878587204194,"score_spread":0.21855017494030785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947899572","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.824723,0.0010175993,0.16053891,0.0002827178,0.000049048467,0.000033683747,0.00033352737,0.00029413914,0.012727296],"genre_scores_gemma":[0.99692637,0.00039096302,0.0020050441,0.000022265313,0.0000139119265,0.000008007972,0.00004995326,0.0000145396125,0.0005688527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983247,0.00058211404,0.00005512788,0.00018167018,0.00045200868,0.00040445873],"domain_scores_gemma":[0.99282223,0.004546934,0.00086481427,0.0006726463,0.00093466096,0.00015875406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022945146,0.0012206214,0.0010241454,0.0006290091,0.0005547617,0.0014570416,0.0006461044,0.00083518936,0.0010465937],"category_scores_gemma":[0.006911836,0.00040652617,0.00042897798,0.0011145194,0.0023723622,0.0017706831,0.0013677386,0.0007469705,0.0003041748],"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.0004562793,0.000039723196,0.0023591162,0.000105583196,0.00008768403,0.0004887519,0.00013091096,0.94416916,0.012492913,0.0331204,0.00047539137,0.0060741007],"study_design_scores_gemma":[0.000019324165,0.00017680158,0.0009961725,0.000030399151,0.000046430196,0.00035797115,0.00008625072,0.9779009,0.012800621,0.00731692,0.00021539057,0.000052834996],"about_ca_topic_score_codex":0.0022672887,"about_ca_topic_score_gemma":0.0015082016,"teacher_disagreement_score":0.0022945146,"about_ca_system_score_codex":0.0011590343,"about_ca_system_score_gemma":0.001479039,"threshold_uncertainty_score":0.012134671},"labels":[],"label_agreement":null},{"id":"W2949484157","doi":"10.48550/arxiv.1808.02456","title":"Learning-Aided Physical Layer Authentication as an Intelligent Process","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Western University","funders":"","keywords":"Computer science; Physical layer; Authentication (law); Robustness (evolution); Authentication protocol; Distributed computing; Wireless; Computer security","score_opus":0.06738765669366464,"score_gpt":0.23881350109599314,"score_spread":0.1714258444023285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949484157","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.0123486025,0.00008258889,0.9864907,0.00009889726,0.000025518615,0.000024659605,0.000010066013,0.00026947004,0.0006495299],"genre_scores_gemma":[0.87379485,0.00015364807,0.12351239,0.00010534891,0.000047266883,0.000057534846,0.000040567156,0.000029749788,0.002258679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983835,0.00045729967,0.00010313798,0.0003799916,0.0004957842,0.0001801859],"domain_scores_gemma":[0.99787974,0.0008554772,0.00032808012,0.0004958579,0.00038925416,0.0000516348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016424882,0.0006740855,0.00088952767,0.00044759354,0.0005689025,0.0011616899,0.0011947067,0.0011484661,0.0011718689],"category_scores_gemma":[0.00440381,0.00031178363,0.0006324976,0.00058810075,0.0013874276,0.002535063,0.0016528544,0.0015211471,0.0006302251],"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.00046631545,0.00015335654,0.0019083865,0.00014606724,0.000082593586,0.00016971833,0.00023385351,0.6513087,0.038222745,0.04119075,0.0012517163,0.2648658],"study_design_scores_gemma":[0.000006146512,0.000056787838,0.00017011925,0.0000036427127,0.000007923651,0.000039694954,0.0000067550154,0.98983675,0.00502158,0.004437471,0.00040338445,0.000009750906],"about_ca_topic_score_codex":0.00092633144,"about_ca_topic_score_gemma":0.0007358253,"teacher_disagreement_score":0.0016424882,"about_ca_system_score_codex":0.0005843028,"about_ca_system_score_gemma":0.0010696404,"threshold_uncertainty_score":0.008686423},"labels":[],"label_agreement":null},{"id":"W2949688507","doi":"10.48550/arxiv.1110.0748","title":"Compress-Forward without Wyner-Ziv Binning for the One-Way and Two-Way Relay Channels","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McGill University","funders":"","keywords":"Decoding methods; Relay; Computer science; Channel (broadcasting); Algorithm; Relay channel; Coding (social sciences); Telecommunications; Mathematics; Statistics","score_opus":0.10854947185902256,"score_gpt":0.2123160327048801,"score_spread":0.10376656084585753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949688507","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.09009409,0.001348312,0.8861751,0.0006285399,0.00009168233,0.00012584699,0.00023986766,0.00019025993,0.02110629],"genre_scores_gemma":[0.9025251,0.0019210104,0.08701528,0.00022259659,0.00007960351,0.00014825175,0.00016894689,0.00007603211,0.007843198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943966,0.00013056834,0.000025242281,0.00006594851,0.00022932509,0.00010920812],"domain_scores_gemma":[0.9985669,0.0007950407,0.0001607725,0.00025721992,0.00018045204,0.000039523635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011534062,0.0011241934,0.0006716631,0.00073373684,0.000572315,0.0012032572,0.00064357644,0.000909292,0.002866601],"category_scores_gemma":[0.0033313213,0.00022460603,0.00061974477,0.00074667437,0.0016002321,0.0021059709,0.0010543223,0.0013510603,0.00037052663],"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.00022499087,0.00007983678,0.00053641526,0.0001829428,0.000044958197,0.0003380465,0.00020420541,0.2797267,0.015918845,0.67380285,0.0013863745,0.027553841],"study_design_scores_gemma":[0.000026430711,0.00009312744,0.00025306674,0.00003266323,0.000031822776,0.0003550126,0.00005889123,0.8420871,0.019058373,0.13506287,0.0029001078,0.000040656327],"about_ca_topic_score_codex":0.0018957909,"about_ca_topic_score_gemma":0.0015907767,"teacher_disagreement_score":0.002866601,"about_ca_system_score_codex":0.0011775139,"about_ca_system_score_gemma":0.0009610137,"threshold_uncertainty_score":0.009589732},"labels":[],"label_agreement":null},{"id":"W2949743812","doi":"10.48550/arxiv.0805.4023","title":"Robust Joint Source-Channel Coding for Delay-Limited Applications","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Channel code; Bounded function; Coding (social sciences); Additive white Gaussian noise; Computer science; Gaussian; Channel (broadcasting); Decoding methods; Algorithm; Distortion (music); Mathematics; Topology (electrical circuits); Telecommunications; Statistics; Bandwidth (computing); Combinatorics","score_opus":0.1141097164998514,"score_gpt":0.2669791748854843,"score_spread":0.15286945838563287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949743812","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.019091628,0.0005300317,0.9787119,0.00018334243,0.000019539766,0.000019013549,0.000029253715,0.000097361204,0.0013178623],"genre_scores_gemma":[0.8786987,0.0008820229,0.11789999,0.00008335678,0.00007197724,0.000078584,0.00007301896,0.000040164276,0.0021721872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921346,0.00028147857,0.000034155823,0.00010974106,0.00028610896,0.000074949035],"domain_scores_gemma":[0.9973174,0.0019368017,0.00025142444,0.00025332486,0.00019329146,0.00004772483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013181368,0.00069244794,0.0006691645,0.00042509608,0.00029126814,0.0007562029,0.00089045113,0.0008566154,0.00082414795],"category_scores_gemma":[0.0046768878,0.00025401879,0.00034146558,0.00075519795,0.0010175093,0.0015006656,0.0015080034,0.0010075005,0.00022198203],"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.00015475681,0.000026632724,0.00023416322,0.00013528077,0.000035540503,0.000137611,0.00009645573,0.8113223,0.012231226,0.12870324,0.00054709986,0.046375725],"study_design_scores_gemma":[0.0000101596115,0.000036123216,0.000048832313,0.000011111469,0.000008605255,0.000051391653,0.0000124413355,0.96475786,0.004000778,0.030285686,0.00076827966,0.000008769223],"about_ca_topic_score_codex":0.00070025783,"about_ca_topic_score_gemma":0.00044875985,"teacher_disagreement_score":0.0013181368,"about_ca_system_score_codex":0.0006967816,"about_ca_system_score_gemma":0.0007671041,"threshold_uncertainty_score":0.006971061},"labels":[],"label_agreement":null},{"id":"W2949935738","doi":"10.1109/isit.2015.7282426","title":"The degraded Gaussian diamond-wiretap channel","year":2015,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"","keywords":"Randomness; Relay; Upper and lower bounds; Channel (broadcasting); Gaussian; Computer science; Topology (electrical circuits); Encoder; Secrecy; Channel code; Relay channel; Coding (social sciences); Computer network; Algorithm; Mathematics; Decoding methods; Combinatorics; Statistics; Computer security; Physics","score_opus":0.038454924705965496,"score_gpt":0.26663076609450365,"score_spread":0.22817584138853814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949935738","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.12197841,0.0015592412,0.844375,0.00083921006,0.00010841037,0.00006910805,0.00083993265,0.00044505423,0.02978564],"genre_scores_gemma":[0.96563065,0.0008984346,0.029649008,0.00016116626,0.000067272056,0.000088667104,0.00031440798,0.00003408194,0.0031563612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976853,0.0006386588,0.00007883763,0.00030433352,0.0008575714,0.00043524287],"domain_scores_gemma":[0.98736703,0.008325607,0.0007701513,0.001203069,0.0019860524,0.00034817614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016932164,0.0006865564,0.0009020498,0.00091309164,0.0004902829,0.0017194197,0.0010797314,0.00092667126,0.0033909886],"category_scores_gemma":[0.011188419,0.0003265998,0.00029078283,0.0009837357,0.0021864553,0.0026806465,0.0017214409,0.0013589872,0.00064376136],"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.00076257944,0.00006095488,0.0010762013,0.00043332428,0.00007030928,0.0009433677,0.00032194416,0.41193554,0.012841292,0.53993416,0.004787889,0.026832502],"study_design_scores_gemma":[0.000027088645,0.000086101165,0.00024707045,0.00004837425,0.000016359734,0.00039319418,0.000094177354,0.872014,0.005379776,0.11904757,0.002598238,0.000048003752],"about_ca_topic_score_codex":0.0017212386,"about_ca_topic_score_gemma":0.0009386319,"teacher_disagreement_score":0.0033909886,"about_ca_system_score_codex":0.0011954756,"about_ca_system_score_gemma":0.0010786781,"threshold_uncertainty_score":0.011344016},"labels":[],"label_agreement":null},{"id":"W2950450451","doi":"10.48550/arxiv.1704.03606","title":"Privacy-Aware Guessing Efficiency","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Random variable; Binary number; Independent and identically distributed random variables; Mathematics; Combinatorics; Discrete mathematics; Piecewise linear function; Piecewise; Variable (mathematics); Constraint (computer-aided design); Maximization; Expression (computer science); Computer science; Statistics; Mathematical optimization; Mathematical analysis; Arithmetic","score_opus":0.08542977361175264,"score_gpt":0.20948579443375642,"score_spread":0.12405602082200379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950450451","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.08973814,0.000943977,0.89280164,0.0033034289,0.00007370436,0.00016070703,0.0005454635,0.00042764915,0.012005327],"genre_scores_gemma":[0.9265102,0.00089471706,0.06577302,0.00038677588,0.00013604523,0.00022469461,0.0003085832,0.00018064537,0.0055851997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99267113,0.0033980617,0.0003498573,0.0016102501,0.0011579503,0.00081282493],"domain_scores_gemma":[0.9485603,0.039886508,0.0026552193,0.0070868745,0.0012398473,0.00057123014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008753213,0.0012450407,0.0024818883,0.0010964877,0.00115883,0.0033772865,0.0035681874,0.0028110258,0.004871493],"category_scores_gemma":[0.050890982,0.00095506565,0.0014267593,0.0016250104,0.0037560007,0.01164942,0.005197111,0.0032624605,0.0011994033],"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.00079718465,0.00013263534,0.0033301841,0.0004019149,0.00017832451,0.00038562968,0.00038951435,0.561712,0.0063459254,0.3794194,0.0035097809,0.04339751],"study_design_scores_gemma":[0.000047303784,0.00008904004,0.0005520024,0.000060510716,0.000035640904,0.00025925317,0.00006346114,0.7771591,0.0046259537,0.21586102,0.0012082538,0.000038438342],"about_ca_topic_score_codex":0.0009258329,"about_ca_topic_score_gemma":0.0006081733,"teacher_disagreement_score":0.008753213,"about_ca_system_score_codex":0.002631575,"about_ca_system_score_gemma":0.0019310464,"threshold_uncertainty_score":0.046291947},"labels":[],"label_agreement":null},{"id":"W2950512683","doi":"","title":"Common Randomness and Secret Key Capacities of Two-way Channels.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","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":"University of Calgary","funders":"","keywords":"Randomness; Upper and lower bounds; Channel (broadcasting); Computer science; Channel capacity; Coding (social sciences); Binary number; Key (lock); Theoretical computer science; Cryptography; Channel code; Binary erasure channel; Key generation; Information theory; Binary symmetric channel; Information-theoretic security; Discrete mathematics; Algorithm; Mathematics; Computer network; Decoding methods; Computer security; Arithmetic; Statistics","score_opus":0.023761823754686454,"score_gpt":0.2554894605825143,"score_spread":0.23172763682782788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950512683","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.21788158,0.002410102,0.70373183,0.0029910526,0.00021826314,0.00024768757,0.0011758816,0.00035867118,0.07098487],"genre_scores_gemma":[0.976508,0.0007523854,0.018027265,0.00017204469,0.00010711981,0.00036223547,0.00021549605,0.00006907276,0.0037864605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994885,0.0017628197,0.00016687853,0.000505644,0.0015021489,0.001177458],"domain_scores_gemma":[0.95979136,0.032233514,0.0021508473,0.0030528759,0.0017227804,0.0010486742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004398784,0.0011282713,0.0009733031,0.0021355331,0.0016280937,0.00423079,0.002172608,0.0017430444,0.0064520505],"category_scores_gemma":[0.02415022,0.000779917,0.0010304089,0.0019681342,0.0055288374,0.0073172273,0.0046222047,0.0034127773,0.0007152147],"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.00014825005,0.000042858504,0.00022430779,0.000095346535,0.000023634922,0.00012011885,0.00020622642,0.06523127,0.002020892,0.9257765,0.0015084423,0.0046022907],"study_design_scores_gemma":[0.0000479474,0.000052710464,0.00022834694,0.00007613071,0.000027330552,0.00023083268,0.00009414794,0.32415423,0.0031648385,0.66928047,0.0025912102,0.000051728824],"about_ca_topic_score_codex":0.0014020129,"about_ca_topic_score_gemma":0.00079111935,"teacher_disagreement_score":0.0064520505,"about_ca_system_score_codex":0.0035742158,"about_ca_system_score_gemma":0.0018112133,"threshold_uncertainty_score":0.025932908},"labels":[],"label_agreement":null},{"id":"W2950547709","doi":"10.48550/arxiv.1001.1768","title":"On the Secure DoF of the Single-Antenna MAC","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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":"Coding (social sciences); Secure coding; Scheme (mathematics); Topology (electrical circuits); Computer science; Dimension (graph theory); Antenna (radio); Mathematics; Telecommunications; Statistics","score_opus":0.05650662461924639,"score_gpt":0.16794204756260467,"score_spread":0.11143542294335829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950547709","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.020814786,0.0028103723,0.93507546,0.0014674857,0.00016204487,0.000046471996,0.0002779524,0.00017751024,0.039167825],"genre_scores_gemma":[0.868846,0.0071129,0.10788165,0.0007920424,0.0008644678,0.0003744706,0.00036542816,0.00016495738,0.013598232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984187,0.0005608047,0.0000700952,0.00022259305,0.0005334167,0.00019432139],"domain_scores_gemma":[0.9960718,0.002704365,0.00027909424,0.00050530996,0.0003281172,0.000111338755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002337649,0.0012371499,0.0009829983,0.0008071413,0.00060563715,0.0019054001,0.001122392,0.0010105242,0.0034577274],"category_scores_gemma":[0.006436224,0.0004741609,0.0010074606,0.0007547921,0.0031615726,0.0027073582,0.0024145837,0.0036505747,0.0010681007],"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.00010204246,0.000016125241,0.000120172925,0.00011594529,0.00002176915,0.0001298112,0.00014828355,0.0693431,0.004522574,0.91335005,0.0020624893,0.010067629],"study_design_scores_gemma":[0.000034518835,0.000093918316,0.00017642329,0.000091283895,0.000021720693,0.00020800176,0.000042573723,0.35545194,0.0037406129,0.63268644,0.007404623,0.000047918533],"about_ca_topic_score_codex":0.00076255907,"about_ca_topic_score_gemma":0.00033766124,"teacher_disagreement_score":0.0034577274,"about_ca_system_score_codex":0.001687603,"about_ca_system_score_gemma":0.0011866332,"threshold_uncertainty_score":0.012362838},"labels":[],"label_agreement":null},{"id":"W2950831396","doi":"10.48550/arxiv.1602.02294","title":"A Source-Channel Separation Theorem with Application to the Source Broadcast Problem","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"McMaster University","funders":"","keywords":"Converse; Separation (statistics); Source separation; Channel (broadcasting); Reduction (mathematics); Argument (complex analysis); Computer science; Mutual fund separation theorem; Mathematics; Algorithm; Telecommunications; Geometry; Economics","score_opus":0.02522740399910895,"score_gpt":0.1848184136433601,"score_spread":0.15959100964425116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950831396","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.0014200275,0.00016459775,0.9892972,0.00055613613,0.00011139483,0.000059663693,0.0000895846,0.0000758004,0.008225529],"genre_scores_gemma":[0.23432815,0.0021347075,0.73736924,0.0010613307,0.0011552315,0.0008736827,0.00057139527,0.00032434604,0.022181932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976526,0.00093338965,0.00009551394,0.00041604982,0.0007159413,0.00018658413],"domain_scores_gemma":[0.993874,0.0045544715,0.00031966096,0.00048605396,0.0005989295,0.00016683698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033951758,0.0017450533,0.0011994073,0.0016409782,0.0014256971,0.0020402768,0.0016650637,0.001988514,0.010097271],"category_scores_gemma":[0.008724257,0.0007095014,0.0019011961,0.0018262627,0.0028054335,0.003652863,0.004794926,0.0073484173,0.0027825625],"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.00007979552,0.00010225575,0.0002000866,0.0002543482,0.0000700638,0.00020371661,0.00023045887,0.06841285,0.0050711837,0.880584,0.010768508,0.03402265],"study_design_scores_gemma":[0.000060928855,0.00010140366,0.00018878236,0.00008247212,0.00005407715,0.00052898336,0.00012350225,0.3399412,0.0046150214,0.6398921,0.01435375,0.000057782523],"about_ca_topic_score_codex":0.00082255446,"about_ca_topic_score_gemma":0.00081181055,"teacher_disagreement_score":0.010097271,"about_ca_system_score_codex":0.001539641,"about_ca_system_score_gemma":0.0023776125,"threshold_uncertainty_score":0.033778727},"labels":[],"label_agreement":null},{"id":"W2950883843","doi":"10.1109/tcomm.2019.2921966","title":"Transmit Antenna Selection in Secure MIMO Systems Over $\\alpha-\\mu$ Fading Channels","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Concordia University","funders":"","keywords":"Fading; Transmitter; MIMO; Channel state information; Secrecy; Computer science; Channel (broadcasting); Channel capacity; Antenna (radio); Topology (electrical circuits); Upper and lower bounds; Computer network; Electronic engineering; Telecommunications; Mathematics; Engineering; Wireless; Computer security","score_opus":0.01944448894364269,"score_gpt":0.2558385507497109,"score_spread":0.2363940618060682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950883843","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.3833071,0.0015591424,0.60398763,0.00048538495,0.000061080646,0.000039125927,0.0001773925,0.0002805475,0.0101025],"genre_scores_gemma":[0.9958617,0.00048090285,0.003005643,0.000023731647,0.000025045565,0.000012757132,0.000015004005,0.000007806248,0.00056740403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987037,0.0005440644,0.000043374814,0.00012373268,0.00028532444,0.0002997258],"domain_scores_gemma":[0.99534625,0.0034088653,0.0006089929,0.0002290356,0.0003080389,0.00009891781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015896714,0.0010632925,0.0007459522,0.00044753533,0.0006657077,0.0013357768,0.00038739524,0.0006029673,0.00080601446],"category_scores_gemma":[0.005498307,0.00046176472,0.00028397268,0.0008761098,0.0016545501,0.0012398615,0.0008563387,0.0005354558,0.00026936614],"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.00019793512,0.000018733876,0.0018279472,0.000071432594,0.00004008549,0.00041831477,0.00015675498,0.9499995,0.0067757657,0.031593405,0.0003577188,0.008542329],"study_design_scores_gemma":[0.000010107215,0.0000879058,0.0005662496,0.000012880487,0.000020128355,0.0001450378,0.0000620169,0.9883338,0.0026445496,0.007917422,0.00018403973,0.000015810214],"about_ca_topic_score_codex":0.0021890088,"about_ca_topic_score_gemma":0.002148762,"teacher_disagreement_score":0.0021890088,"about_ca_system_score_codex":0.001031766,"about_ca_system_score_gemma":0.0007027019,"threshold_uncertainty_score":0.008407056},"labels":[],"label_agreement":null},{"id":"W2951040947","doi":"10.48550/arxiv.0801.1306","title":"Capacity Bounds for the Gaussian Interference Channel","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"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":"Interference (communication); Channel (broadcasting); Gaussian; Computer science; Telecommunications; Physics; Quantum mechanics","score_opus":0.09699289630834028,"score_gpt":0.27974106677695293,"score_spread":0.18274817046861264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951040947","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.03019409,0.009394776,0.9057524,0.0012104231,0.00022387096,0.00010063602,0.0007456831,0.0006915514,0.0516865],"genre_scores_gemma":[0.8990613,0.01048571,0.07821761,0.00065429736,0.0008654696,0.0006291305,0.00093141745,0.0003088895,0.008846149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996789,0.00071581843,0.00013331819,0.00036803784,0.0012838196,0.0007100752],"domain_scores_gemma":[0.9845834,0.009894177,0.001106385,0.0012624053,0.002791752,0.0003619018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003058955,0.0018311467,0.0014093991,0.0020475832,0.000983455,0.0032042828,0.0015914744,0.0009889543,0.0066275876],"category_scores_gemma":[0.017404875,0.00048844924,0.0008227991,0.002404527,0.0024257738,0.0040765135,0.0031886492,0.002631719,0.0014224119],"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.00033308106,0.00007870713,0.00072715216,0.0005807589,0.0001091911,0.00031856634,0.00055952807,0.3756944,0.0070574693,0.5437346,0.0102109425,0.060595553],"study_design_scores_gemma":[0.000020469348,0.00009602014,0.0006078825,0.00020816998,0.00006521021,0.00043781463,0.00017282554,0.6625596,0.006378649,0.31916797,0.010183501,0.000101858015],"about_ca_topic_score_codex":0.0031493218,"about_ca_topic_score_gemma":0.00167072,"teacher_disagreement_score":0.0066275876,"about_ca_system_score_codex":0.0031371315,"about_ca_system_score_gemma":0.0018071953,"threshold_uncertainty_score":0.022761524},"labels":[],"label_agreement":null},{"id":"W2951380130","doi":"10.1109/tcns.2019.2923385","title":"Two-Way Gaussian Networks With a Jammer and Decentralized Control","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Control of Network Systems","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Jamming; Nash equilibrium; Channel (broadcasting); Gaussian; Computer science; Mathematical optimization; Constraint (computer-aided design); Gaussian noise; Noise (video); Power control; Control theory (sociology); Game theory; Power (physics); Mathematics; Control (management); Telecommunications; Algorithm; Mathematical economics","score_opus":0.005577657446790629,"score_gpt":0.20087117428294934,"score_spread":0.19529351683615873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951380130","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.19638406,0.00024924794,0.7920619,0.0004825387,0.000044675457,0.000082218714,0.00008670372,0.00015044115,0.010458317],"genre_scores_gemma":[0.98127085,0.000114589195,0.015473961,0.00004860209,0.000023306287,0.00006245943,0.00001606024,0.000009204459,0.00298086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892586,0.00041289255,0.000023055427,0.00017831329,0.00020469881,0.00025507732],"domain_scores_gemma":[0.9981092,0.0010415945,0.00035926938,0.0001361446,0.00024145085,0.00011241118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012007601,0.0008408188,0.0008555065,0.0005640989,0.00070366455,0.0014000363,0.0010778717,0.0015044872,0.0014882436],"category_scores_gemma":[0.0040055346,0.00035644646,0.00049060036,0.0007884353,0.0019468109,0.0018413627,0.0013386211,0.00080386293,0.00024403633],"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.00012589796,0.0000684051,0.0004536355,0.00003756557,0.000030077366,0.00020952012,0.00009717848,0.9000828,0.002240061,0.09209457,0.00030592186,0.0042543467],"study_design_scores_gemma":[0.000021767806,0.00003965295,0.00012218792,0.000003462283,0.0000074659897,0.000031760654,0.000026004795,0.98252904,0.00029343888,0.016672658,0.00024280096,0.000009797699],"about_ca_topic_score_codex":0.0036600132,"about_ca_topic_score_gemma":0.0033377935,"teacher_disagreement_score":0.0036600132,"about_ca_system_score_codex":0.0012599564,"about_ca_system_score_gemma":0.0007937359,"threshold_uncertainty_score":0.009141624},"labels":[],"label_agreement":null},{"id":"W2951735454","doi":"10.48550/arxiv.0809.0032","title":"A Variational Inference Framework for Soft-In-Soft-Out Detection in Multiple Access Channels","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Inference; Multiuser detection; Decoding methods; Algorithm; Channel (broadcasting); Detector; Artificial intelligence","score_opus":0.09884173917998423,"score_gpt":0.3307147508745018,"score_spread":0.23187301169451757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951735454","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000917716,0.00013043804,0.99786633,0.00020705035,0.000018313553,0.000009850087,0.00003399682,0.00002922002,0.00078698306],"genre_scores_gemma":[0.27603668,0.0011709563,0.71418756,0.00060827745,0.0004129241,0.00029533808,0.0003275133,0.00019072497,0.0067700823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844235,0.0008247811,0.00005656859,0.00022993896,0.00032796187,0.00011849604],"domain_scores_gemma":[0.99522287,0.0038245772,0.0002266375,0.0002249907,0.0003706004,0.00013029164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044432995,0.0011491189,0.0013196177,0.0011281419,0.00069413614,0.00183503,0.002642261,0.0019589225,0.0032490012],"category_scores_gemma":[0.009352263,0.00084130693,0.0014711428,0.0009511848,0.002630294,0.0021449102,0.0023828095,0.00323544,0.000465194],"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.000026215292,0.00003057131,0.0004367987,0.00010540309,0.00008976705,0.000095309704,0.00011433718,0.40808073,0.0010057716,0.5708566,0.001303994,0.01785449],"study_design_scores_gemma":[0.000007451702,0.000014603741,0.00006111965,0.000012187775,0.000008643614,0.000024084091,0.0000071291224,0.8562576,0.00024228315,0.14245069,0.0009017928,0.000012326421],"about_ca_topic_score_codex":0.0040418226,"about_ca_topic_score_gemma":0.0040498385,"teacher_disagreement_score":0.0044432995,"about_ca_system_score_codex":0.0017773533,"about_ca_system_score_gemma":0.002256299,"threshold_uncertainty_score":0.023498714},"labels":[],"label_agreement":null},{"id":"W2951765939","doi":"10.48550/arxiv.1304.2688","title":"Efficient Wireless Security Through Jamming, Coding and Routing","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Computer science; Physical layer; Goodput; Computer network; Jamming; Wireless network; Linear network coding; Wireless; Distributed computing; Network packet; Telecommunications","score_opus":0.046571688850621976,"score_gpt":0.19078163579839522,"score_spread":0.14420994694777323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951765939","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.014479596,0.00035056382,0.9815801,0.0002962761,0.000022044713,0.000029669949,0.000025937592,0.00023363723,0.0029822076],"genre_scores_gemma":[0.60290045,0.0012478888,0.39131972,0.00016025586,0.00006637364,0.00014315448,0.00010884409,0.00009263626,0.0039606197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990779,0.00037593744,0.00003413458,0.000102984566,0.00029641128,0.0001125427],"domain_scores_gemma":[0.99846375,0.00089263957,0.0001829275,0.0003264679,0.000102235004,0.000031985357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009996245,0.0009076469,0.0006239878,0.00073056744,0.00051813945,0.001028814,0.0009724638,0.00097174593,0.0010035244],"category_scores_gemma":[0.004003431,0.0003982632,0.00047425262,0.0010078197,0.0015798007,0.0025242274,0.0017881708,0.0012986072,0.00034604556],"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.00009813268,0.000046717716,0.00022741563,0.000093562456,0.000027469536,0.000059074024,0.00010049521,0.8127639,0.008534474,0.10783656,0.0014814168,0.06873082],"study_design_scores_gemma":[0.000017908898,0.00002662363,0.00007246956,0.00001691207,0.000010458846,0.00005064279,0.000021455679,0.9363819,0.0029321807,0.058995374,0.0014647006,0.000009436802],"about_ca_topic_score_codex":0.0010349769,"about_ca_topic_score_gemma":0.0014882847,"teacher_disagreement_score":0.0010349769,"about_ca_system_score_codex":0.0008238566,"about_ca_system_score_gemma":0.0012540013,"threshold_uncertainty_score":0.0059775114},"labels":[],"label_agreement":null},{"id":"W2951799516","doi":"10.48550/arxiv.0904.4735","title":"The Secrecy Capacity Region of the Degraded Vector Gaussian Broadcast Channel","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Wireless Communication Security 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":"University of Waterloo","funders":"","keywords":"Secrecy; MIMO; Computer science; Channel (broadcasting); Superposition principle; Gaussian; Computer network; Topology (electrical circuits); Information-theoretic security; Coding (social sciences); Node (physics); Dirty paper coding; Channel capacity; Telecommunications; Mathematics; Precoding; Computer security; Physics; Combinatorics; Statistics","score_opus":0.05933421882492324,"score_gpt":0.24766054590335157,"score_spread":0.18832632707842833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951799516","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.18832256,0.006667662,0.70020396,0.0041925637,0.00018003512,0.0001159679,0.0016332984,0.00063019607,0.098053835],"genre_scores_gemma":[0.9746987,0.002882506,0.01594524,0.00036236347,0.00023520373,0.00020797474,0.0004261177,0.000095923584,0.005145935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978136,0.00078850775,0.000056992285,0.00021989831,0.0006213751,0.00049960136],"domain_scores_gemma":[0.98906076,0.008240891,0.0006882289,0.00062636705,0.0011068827,0.00027685132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024703247,0.000982863,0.0010495841,0.0011345737,0.0009034072,0.0022570214,0.0010723134,0.00090841134,0.004427752],"category_scores_gemma":[0.008527349,0.00053365465,0.00065971963,0.0012266774,0.0031437834,0.002715236,0.0024970355,0.0020396973,0.00091017276],"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.0005765692,0.00005308674,0.00056612527,0.00038608979,0.000103125516,0.00062913925,0.00059917103,0.3785073,0.00985263,0.591278,0.005617073,0.01183163],"study_design_scores_gemma":[0.00004966334,0.00008250236,0.0005206037,0.00013099732,0.000049017992,0.000364964,0.00017234763,0.6457148,0.005061305,0.34317338,0.004610096,0.000070280956],"about_ca_topic_score_codex":0.0023366672,"about_ca_topic_score_gemma":0.00064297044,"teacher_disagreement_score":0.004427752,"about_ca_system_score_codex":0.0022364256,"about_ca_system_score_gemma":0.0014829625,"threshold_uncertainty_score":0.01622647},"labels":[],"label_agreement":null},{"id":"W2951934635","doi":"10.48550/arxiv.1006.5087","title":"Gaussian Z-Interference Channel with a Relay Link: Achievability Region and Asymptotic Sum Capacity","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Interference (communication); Relay; Topology (electrical circuits); Channel (broadcasting); Noise (video); Channel capacity; Telecommunications; Computer science; Mathematics; Physics; Combinatorics; Power (physics)","score_opus":0.055545849809618984,"score_gpt":0.1767329948623837,"score_spread":0.1211871450527647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951934635","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.077306785,0.0031978218,0.878057,0.00075144914,0.000058614936,0.0000907029,0.00026478356,0.0005202211,0.039752606],"genre_scores_gemma":[0.950854,0.002681352,0.042477414,0.0003364386,0.000113962815,0.00021830577,0.00016041718,0.000074598356,0.0030835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822086,0.0006441129,0.000064883636,0.00021036157,0.0004485065,0.0004113049],"domain_scores_gemma":[0.9922126,0.0054419646,0.0007270388,0.00038408977,0.0010326596,0.00020154992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024288914,0.0014231591,0.0011443812,0.0012904659,0.0009259992,0.002184623,0.0012757302,0.0010203671,0.0021366186],"category_scores_gemma":[0.010016227,0.00050736155,0.0009137091,0.0014474998,0.003155344,0.0026333716,0.002452006,0.0017704,0.0007173113],"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.00028003744,0.000063157655,0.00068792934,0.00034560412,0.000107600186,0.00071554066,0.00044531203,0.4301799,0.010123524,0.53991383,0.0024209407,0.014716712],"study_design_scores_gemma":[0.00003642072,0.000107424006,0.00030646016,0.00007084555,0.000054625863,0.00046332506,0.000112855436,0.8480324,0.0039416896,0.14486428,0.0019462125,0.00006336681],"about_ca_topic_score_codex":0.0031711026,"about_ca_topic_score_gemma":0.0014217503,"teacher_disagreement_score":0.0031711026,"about_ca_system_score_codex":0.00217884,"about_ca_system_score_gemma":0.0018081401,"threshold_uncertainty_score":0.015808642},"labels":[],"label_agreement":null},{"id":"W2952224110","doi":"10.48550/arxiv.1407.8494","title":"Joint Design of Optimal Cooperative Jamming and Power Allocation for Linear Precoding","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Precoding; Jamming; Computer science; Base station; Zero-forcing precoding; Secrecy; Channel (broadcasting); Computer network; Optimization problem; Transmitter power output; Physical layer; Mathematical optimization; Telecommunications; Wireless; Mathematics; Algorithm; Computer security; MIMO; Transmitter","score_opus":0.09023278522356695,"score_gpt":0.2064551929584359,"score_spread":0.11622240773486894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952224110","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.011926717,0.000161354,0.9857788,0.000108968394,0.000016247837,0.000033842218,0.000017953253,0.00006999563,0.0018860785],"genre_scores_gemma":[0.7625706,0.00047182676,0.2337307,0.00013093051,0.00006652818,0.0002677907,0.00006850778,0.000040254527,0.0026527669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986539,0.00059495633,0.000044563596,0.0002373401,0.00027596706,0.00019332342],"domain_scores_gemma":[0.99866736,0.0008245874,0.00019437107,0.00007004356,0.0001860053,0.00005769709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013284828,0.0016106172,0.0012681175,0.00059823814,0.00039869908,0.0010918712,0.00085614703,0.0013583384,0.001205403],"category_scores_gemma":[0.0042176023,0.00084714836,0.00064146036,0.00092149206,0.0011848955,0.0009542393,0.0012347902,0.0008946178,0.00036523104],"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.00017564863,0.00008201453,0.0004737048,0.00015896204,0.000080449565,0.00015254041,0.00016983387,0.92281115,0.010090949,0.023454988,0.0010460374,0.041303806],"study_design_scores_gemma":[0.000016486327,0.000060199385,0.00006455698,0.0000067963438,0.000011925351,0.000028237493,0.000018378625,0.99459153,0.0010210883,0.0038827187,0.00029024432,0.00000772972],"about_ca_topic_score_codex":0.001725166,"about_ca_topic_score_gemma":0.0020657375,"teacher_disagreement_score":0.001725166,"about_ca_system_score_codex":0.0008871775,"about_ca_system_score_gemma":0.0017006561,"threshold_uncertainty_score":0.0070257783},"labels":[],"label_agreement":null},{"id":"W2952946716","doi":"","title":"Rate Adaptation for Secure HARQ Protocols","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Wireless Communication Security 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":"McGill University; Institut National de la Recherche Scientifique","funders":"","keywords":"Hybrid automatic repeat request; Computer science; Adaptation (eye); Computer network; Psychology; Neuroscience","score_opus":0.025502289424909015,"score_gpt":0.2607698954498185,"score_spread":0.23526760602490948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952946716","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.017857695,0.0014830374,0.9716806,0.0009204359,0.00033134836,0.00007494685,0.000060705388,0.00042185537,0.0071694483],"genre_scores_gemma":[0.88507944,0.0026720264,0.09673904,0.00048125145,0.00095203135,0.00032397185,0.00016621102,0.00022672726,0.0133591825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977997,0.00082290324,0.00007242349,0.0002724121,0.0007522511,0.00028035828],"domain_scores_gemma":[0.9935509,0.004113922,0.00030177046,0.0010135502,0.00087609875,0.0001437472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003196341,0.0009421778,0.00096399314,0.00065326435,0.0007558171,0.0019872806,0.0011208833,0.000921169,0.003806076],"category_scores_gemma":[0.01213907,0.00057716493,0.00039774622,0.00095282204,0.0015977997,0.0018393653,0.0024880038,0.0028997022,0.00132294],"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.0005366562,0.000146779,0.00080379756,0.000269101,0.000081048085,0.0003439536,0.00046743796,0.34020543,0.027148282,0.4862624,0.008098026,0.13563699],"study_design_scores_gemma":[0.000033390308,0.000063837266,0.00022611952,0.000032686767,0.00002402781,0.0001505208,0.000045522123,0.85729104,0.0026882219,0.13649939,0.002915131,0.000030131303],"about_ca_topic_score_codex":0.00070558576,"about_ca_topic_score_gemma":0.00052091107,"teacher_disagreement_score":0.003806076,"about_ca_system_score_codex":0.000929137,"about_ca_system_score_gemma":0.00097088394,"threshold_uncertainty_score":0.016904056},"labels":[],"label_agreement":null},{"id":"W2952966314","doi":"10.48550/arxiv.0904.1892","title":"Lattice Strategies for the Dirty Multiple Access Channel","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","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 Toronto","funders":"","keywords":"Channel (broadcasting); Lattice (music); Computer security; Computer science; Computer network; Business; Physics; Acoustics","score_opus":0.10300304320523185,"score_gpt":0.3271324361329636,"score_spread":0.22412939292773176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952966314","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.06743231,0.0008044314,0.89831716,0.0014598969,0.00013241693,0.000109473156,0.00017836192,0.00016647449,0.03139946],"genre_scores_gemma":[0.85001993,0.0010788476,0.13507505,0.00044131323,0.00013498023,0.0002792386,0.00014463846,0.00008273704,0.01274327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984268,0.0007724331,0.000052119874,0.00014101894,0.0003638819,0.00024376115],"domain_scores_gemma":[0.9968168,0.0020913011,0.00034689644,0.00025115235,0.00027101787,0.00022290411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017631869,0.00086125225,0.0008097872,0.00068956293,0.00072954816,0.0022568956,0.0012135913,0.0012419228,0.005139455],"category_scores_gemma":[0.0042837798,0.0003889889,0.00064629724,0.00089104776,0.0028393,0.0022711416,0.001807112,0.0023949107,0.0008275814],"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.00011104958,0.000043103442,0.0000940076,0.00005583647,0.000016249416,0.00013309122,0.0001265562,0.114136,0.0016879279,0.8736115,0.0012384461,0.00874623],"study_design_scores_gemma":[0.00006799378,0.0000658166,0.00004540308,0.00002003724,0.000006707015,0.00009487638,0.00005682464,0.5242456,0.00090364425,0.4722888,0.0021692612,0.00003500771],"about_ca_topic_score_codex":0.0012604767,"about_ca_topic_score_gemma":0.0010962088,"teacher_disagreement_score":0.005139455,"about_ca_system_score_codex":0.0019716995,"about_ca_system_score_gemma":0.0014535554,"threshold_uncertainty_score":0.017193139},"labels":[],"label_agreement":null},{"id":"W2953079802","doi":"10.48550/arxiv.1810.01567","title":"Lattice-based Robust Distributed Source Coding","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"McMaster University","funders":"","keywords":"Gaussian; Rate distortion; Lattice (music); Coding (social sciences); Computer science; Distributed source coding; Quadratic equation; Algorithm; Shannon–Fano coding; Source code; Mathematics; Variable-length code; Statistical physics; Theoretical computer science; Physics; Statistics; Decoding methods; Quantum mechanics; Geometry","score_opus":0.0772510405235416,"score_gpt":0.18729611655445455,"score_spread":0.11004507603091294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953079802","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.004769154,0.00017512121,0.9930547,0.00017284675,0.00003573997,0.000025354411,0.00003547077,0.0002016875,0.001529982],"genre_scores_gemma":[0.5935805,0.00040602172,0.40142772,0.00029712252,0.000086538654,0.00016797632,0.00017927891,0.00007709138,0.0037777682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729425,0.0009768185,0.00009788714,0.00032080445,0.0011555025,0.0001548595],"domain_scores_gemma":[0.9979944,0.00087245693,0.00021532881,0.00037378288,0.0004558837,0.000088099136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018310648,0.0006201164,0.0012070442,0.0007015955,0.0005302853,0.0012371812,0.0019695584,0.0012165966,0.0017148742],"category_scores_gemma":[0.0044851005,0.0003654574,0.0006409398,0.0010200513,0.0015651225,0.0017511826,0.0024073033,0.0018960139,0.0009475021],"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.00035408477,0.00008762224,0.00031594295,0.00016443213,0.00007146916,0.0002026537,0.00014220919,0.64514273,0.025088875,0.23736212,0.0019449273,0.08912288],"study_design_scores_gemma":[0.000030597475,0.000044420547,0.000022185768,0.000008566502,0.0000055808773,0.000056897374,0.00000791861,0.9770188,0.0033207894,0.018540146,0.00092323485,0.000020849473],"about_ca_topic_score_codex":0.0012137191,"about_ca_topic_score_gemma":0.00079844607,"teacher_disagreement_score":0.0019695584,"about_ca_system_score_codex":0.0012143857,"about_ca_system_score_gemma":0.0011274737,"threshold_uncertainty_score":0.009683728},"labels":[],"label_agreement":null},{"id":"W2953177019","doi":"10.1049/iet-com.2019.0198","title":"Physical layer secrecy performance of multiple antennas transmission with partial legitimate user CSI","year":2019,"lang":"en","type":"article","venue":"IET Communications","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 Victoria","funders":"","keywords":"Secrecy; Physical layer; Computer science; Transmission (telecommunications); Computer network; Secure transmission; Layer (electronics); Telecommunications; Computer security; Wireless; Materials science","score_opus":0.018963444710705844,"score_gpt":0.255696522959321,"score_spread":0.23673307824861514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953177019","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.35718137,0.0019000031,0.6142034,0.00065595383,0.000104228595,0.00005565054,0.00025332565,0.0005660613,0.025079964],"genre_scores_gemma":[0.98458165,0.0006512774,0.01313853,0.000061198334,0.000016850323,0.000022464967,0.0000625009,0.000016607779,0.001448972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998432,0.0007206824,0.00007339234,0.0001177329,0.0004060517,0.00025006672],"domain_scores_gemma":[0.99487996,0.0034788472,0.0005750851,0.00042289103,0.00055293215,0.00009026008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018858156,0.0010829902,0.00077721494,0.00039987985,0.00045443285,0.000979928,0.0005802009,0.0008687455,0.001659424],"category_scores_gemma":[0.004590777,0.00029422462,0.0005427623,0.0007639075,0.0012849853,0.001412951,0.0013431644,0.0007510594,0.00041693743],"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.0007152148,0.000072669885,0.0025930963,0.00028573038,0.00014608496,0.00041790068,0.00015160127,0.89937717,0.036473144,0.03280521,0.0007905797,0.026171554],"study_design_scores_gemma":[0.000018677212,0.00017047372,0.00055169786,0.000021640773,0.000037529768,0.00021237296,0.000049799673,0.97688645,0.018002719,0.0037354676,0.00028236883,0.000030880772],"about_ca_topic_score_codex":0.0013497652,"about_ca_topic_score_gemma":0.0011062914,"teacher_disagreement_score":0.0018858156,"about_ca_system_score_codex":0.0007007776,"about_ca_system_score_gemma":0.00090053974,"threshold_uncertainty_score":0.009973288},"labels":[],"label_agreement":null},{"id":"W2955965660","doi":"10.1109/iswcs.2019.8877294","title":"Early Detection for Optimal-Latency Communications in Multi-Hop Links","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Hydro-Québec; École de Technologie Supérieure","funders":"","keywords":"Wireless; Channel (broadcasting); Reliability (semiconductor); Coding (social sciences); Error detection and correction; Transmission (telecommunications); Hybrid automatic repeat request; Latency (audio)","score_opus":0.037027100636306765,"score_gpt":0.2942203329294353,"score_spread":0.2571932322931285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955965660","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.10978183,0.00060066074,0.88726175,0.00025761963,0.000051876254,0.00009426683,0.00003137315,0.00039172874,0.0015289856],"genre_scores_gemma":[0.92416656,0.00022959444,0.07432769,0.00010709277,0.000036774403,0.00008093622,0.000027056847,0.000027239843,0.000996979],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985586,0.0003587534,0.00007205143,0.00020143462,0.00058401,0.00022524544],"domain_scores_gemma":[0.9876391,0.008000219,0.0016202676,0.0012624073,0.0010668703,0.0004110573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002153503,0.00053835625,0.0007371588,0.000787949,0.0008830998,0.0010073003,0.0012137654,0.0007883726,0.00084730616],"category_scores_gemma":[0.011278562,0.00034193907,0.00027039947,0.000483713,0.0017364491,0.0017921047,0.0016934542,0.0013236734,0.00019229643],"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.0019937526,0.00045583252,0.0045780605,0.00074566517,0.00008235091,0.0011816542,0.0014403225,0.27495807,0.27983645,0.26644418,0.0020298336,0.16625385],"study_design_scores_gemma":[0.00006288076,0.00064145774,0.0006702421,0.000053395168,0.000027968837,0.00043721386,0.00009225708,0.90239257,0.054666556,0.039382257,0.0015135226,0.0000596553],"about_ca_topic_score_codex":0.00043829827,"about_ca_topic_score_gemma":0.00063067727,"teacher_disagreement_score":0.002153503,"about_ca_system_score_codex":0.0009747818,"about_ca_system_score_gemma":0.0016747,"threshold_uncertainty_score":0.0113889575},"labels":[],"label_agreement":null},{"id":"W2961674272","doi":"10.1109/icc.2019.8761588","title":"Towards a Win-Win Spectrum Sharing Channel: A Secrecy Perspective","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"McGill University","funders":"","keywords":"Secrecy; Computer science; Eavesdropping; Computer network; Throughput; Transmission (telecommunications); Channel (broadcasting); Forward secrecy; Computer security; Wireless; Telecommunications; Public-key cryptography; Encryption","score_opus":0.011886696851781337,"score_gpt":0.24498480454651064,"score_spread":0.2330981076947293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961674272","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.024842184,0.0007468996,0.953824,0.0021927876,0.00013436147,0.00010039609,0.00008251918,0.000098316516,0.01797863],"genre_scores_gemma":[0.9084591,0.0014535544,0.08414108,0.00035568743,0.00025044274,0.00020159541,0.00004371076,0.000046396177,0.0050483905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660647,0.0014277108,0.00009950753,0.00033377085,0.0008819095,0.0006506031],"domain_scores_gemma":[0.99607736,0.00210119,0.000512491,0.0005273491,0.00050836743,0.00027322164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035448356,0.0012648416,0.0012580293,0.0011483545,0.0021115919,0.0049086213,0.0013641657,0.002224774,0.0041682073],"category_scores_gemma":[0.005357357,0.00077590806,0.0006469585,0.0011179333,0.004333656,0.006256568,0.005347264,0.0030794453,0.00083837233],"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.00021536712,0.000078344114,0.0005290566,0.00017974548,0.00004776691,0.0003379855,0.00037047415,0.09964694,0.0067357584,0.87382025,0.0017451702,0.016293144],"study_design_scores_gemma":[0.00005500791,0.00022719314,0.00023135488,0.00009938215,0.00004214796,0.00055364135,0.00046222834,0.5046925,0.0065279827,0.47710353,0.009924203,0.00008079835],"about_ca_topic_score_codex":0.0008238048,"about_ca_topic_score_gemma":0.0007747658,"teacher_disagreement_score":0.0049086213,"about_ca_system_score_codex":0.0014800372,"about_ca_system_score_gemma":0.0024145746,"threshold_uncertainty_score":0.018747091},"labels":[],"label_agreement":null},{"id":"W2962760265","doi":"10.3390/e19080389","title":"On the Reliability Function of Variable-Rate Slepian-Wolf Coding","year":2017,"lang":"en","type":"article","venue":"Entropy","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Decoding methods; Variable (mathematics); Algorithm; Discrete mathematics; Mathematical analysis","score_opus":0.016362120831959436,"score_gpt":0.23864368948839315,"score_spread":0.22228156865643373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962760265","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.0882187,0.0015640708,0.8932089,0.0005628301,0.00006673779,0.0000347568,0.000119245364,0.0002472257,0.015977588],"genre_scores_gemma":[0.93164533,0.0023636827,0.059752684,0.00014931199,0.0001620941,0.00013964991,0.00017470079,0.0001839212,0.0054285144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986487,0.00050956284,0.000048992966,0.00013975552,0.00045365718,0.00019921236],"domain_scores_gemma":[0.9887116,0.008265411,0.0006746687,0.0008301757,0.0013123055,0.00020582887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030894524,0.0010927379,0.00076462416,0.0019034749,0.0006351522,0.0014854938,0.0010833343,0.0009405952,0.0021348158],"category_scores_gemma":[0.016622053,0.00045277053,0.0005604305,0.0011978928,0.0032966656,0.0026224086,0.0016031829,0.0023474747,0.0008022487],"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.00016405727,0.000019561397,0.00058713224,0.00012836725,0.000018421257,0.00015557715,0.00025071597,0.23125274,0.007269609,0.74398994,0.0010923574,0.015071449],"study_design_scores_gemma":[0.000012922138,0.00005858293,0.00025389474,0.00007394665,0.000012874141,0.00017806167,0.000045769288,0.7869045,0.0047909617,0.20638685,0.0012433744,0.000038327402],"about_ca_topic_score_codex":0.0013956997,"about_ca_topic_score_gemma":0.00050496345,"teacher_disagreement_score":0.0030894524,"about_ca_system_score_codex":0.0016675895,"about_ca_system_score_gemma":0.0011219723,"threshold_uncertainty_score":0.016338825},"labels":[],"label_agreement":null},{"id":"W2962835128","doi":"10.1109/tcomm.2016.2591530","title":"BER-Based Physical Layer Security With Finite Codelength: Combining Strong Converse and Error Amplification","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":26,"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":"Converse; Bit error rate; Computer science; Erasure; Physical layer; Algorithm; Binary number; Transmission (telecommunications); Additive white Gaussian noise; Decoding methods; Topology (electrical circuits); Theoretical computer science; Mathematics; Computer network; Channel (broadcasting); Telecommunications; Arithmetic; Wireless; Combinatorics","score_opus":0.04125545553687764,"score_gpt":0.2765831914220022,"score_spread":0.23532773588512457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962835128","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.018855825,0.0007454222,0.970051,0.00046073765,0.000104506085,0.000049831182,0.000047975678,0.00023250477,0.009452181],"genre_scores_gemma":[0.8404573,0.0014444236,0.15110391,0.0003999442,0.00023890895,0.00017122057,0.00007653398,0.000092023845,0.0060155857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997303,0.0009031822,0.00012850556,0.00034113688,0.0010210613,0.00030309154],"domain_scores_gemma":[0.9946849,0.002902468,0.0005978094,0.0009222621,0.0007294782,0.0001630501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024863097,0.0017936075,0.0011108689,0.0012684091,0.0008804133,0.00212382,0.0015426954,0.0014216122,0.0019455253],"category_scores_gemma":[0.0076299245,0.0006493541,0.000770029,0.00093538093,0.0036470126,0.00448453,0.0046794256,0.0026580899,0.0007341355],"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.00030187887,0.00011840319,0.0005433203,0.00034362116,0.00009258249,0.0005690056,0.00044533235,0.2314649,0.055180717,0.6563331,0.0017888991,0.052818198],"study_design_scores_gemma":[0.000028668002,0.00022112991,0.0001598241,0.00008859198,0.000045385787,0.0006730887,0.00006553191,0.8346579,0.025730291,0.13534991,0.0028650486,0.00011472124],"about_ca_topic_score_codex":0.00041577627,"about_ca_topic_score_gemma":0.0004947532,"teacher_disagreement_score":0.0024863097,"about_ca_system_score_codex":0.0011910916,"about_ca_system_score_gemma":0.0012421316,"threshold_uncertainty_score":0.013148963},"labels":[],"label_agreement":null},{"id":"W2962953293","doi":"10.1109/iwcmc.2019.8766490","title":"Raptor Code based on punctured LDPC for Secrecy in Massive MiMo","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Eavesdropping; Fountain code; MIMO; Computer network; Secrecy; Physical layer; Raptor code; Decoding methods; Network packet; Channel (broadcasting); Artificial noise; Code (set theory); Jamming; Transmitter; Wireless; Low-density parity-check code; Computer security; Telecommunications","score_opus":0.011446607500069513,"score_gpt":0.24082225111179947,"score_spread":0.22937564361172996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962953293","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.053310968,0.0016902093,0.93230283,0.00036467757,0.00010532423,0.00006487044,0.00010619596,0.0004885899,0.011566297],"genre_scores_gemma":[0.860255,0.0012460876,0.13421497,0.00015873426,0.000050502993,0.00012149159,0.000083859944,0.00004520334,0.0038242154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945027,0.00020645099,0.00001554893,0.000057838104,0.00020824609,0.00006153389],"domain_scores_gemma":[0.99913627,0.00043252466,0.000100263336,0.00013057789,0.0001672399,0.000033143147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047181553,0.00053283176,0.00043943306,0.0004576587,0.0005109627,0.0005516036,0.0004971109,0.0007466866,0.0013314557],"category_scores_gemma":[0.001986975,0.00022788353,0.00034267904,0.0005099533,0.0009872161,0.00071678957,0.0006636445,0.00073217356,0.00046738394],"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.00031771197,0.0000603758,0.0008964464,0.00032211436,0.00007411492,0.0009713885,0.0003351095,0.6828322,0.03886616,0.21069644,0.0029908663,0.061637033],"study_design_scores_gemma":[0.000018834442,0.000080490165,0.00016586746,0.000031654305,0.000012267874,0.0002994314,0.000019191912,0.9689444,0.010078736,0.018064756,0.0022539825,0.00003037501],"about_ca_topic_score_codex":0.0018105264,"about_ca_topic_score_gemma":0.001425218,"teacher_disagreement_score":0.0018105264,"about_ca_system_score_codex":0.0004864302,"about_ca_system_score_gemma":0.0008615017,"threshold_uncertainty_score":0.004454136},"labels":[],"label_agreement":null},{"id":"W2963090386","doi":"10.1109/tvt.2019.2931277","title":"Artificial Noise Scheme for Correlated MISO Wiretap Channels","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":10,"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":"Ergodic theory; Secrecy; Artificial noise; Channel (broadcasting); Noise (video); Upper and lower bounds; Signal-to-noise ratio (imaging); Topology (electrical circuits); Computer science; Correlation; SIGNAL (programming language); Mathematics; Electronic engineering; Telecommunications; Engineering; Computer security; Artificial intelligence; Transmitter; Combinatorics; Mathematical analysis","score_opus":0.011808026807163063,"score_gpt":0.23090913343898917,"score_spread":0.2191011066318261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963090386","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.11246467,0.00060065975,0.8732588,0.00039673518,0.00009626342,0.000048670398,0.00008359563,0.0001108115,0.012939825],"genre_scores_gemma":[0.9678389,0.0005829015,0.028924027,0.00011757625,0.000051379568,0.000048213824,0.000037051315,0.000025123858,0.0023749392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851996,0.00062522996,0.00005614644,0.00017310889,0.00044867294,0.00017694182],"domain_scores_gemma":[0.99443734,0.0035935107,0.0008584156,0.0005145841,0.0004726338,0.00012352505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016688069,0.0008015235,0.0006610174,0.00045292164,0.0005154696,0.0010706654,0.00066337356,0.0006601794,0.001323596],"category_scores_gemma":[0.0059480234,0.00024107941,0.0003423499,0.0006807853,0.001975934,0.0017412896,0.0014144199,0.0010296656,0.00026229984],"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.00052621635,0.000068502246,0.001279492,0.0002778339,0.00007721013,0.00044179094,0.00024164494,0.48141542,0.035619948,0.45776427,0.0009210739,0.021366578],"study_design_scores_gemma":[0.00001701507,0.00017006141,0.00033582302,0.00004453854,0.0000340434,0.0002683936,0.000058330083,0.9488075,0.012818883,0.0357295,0.0016684029,0.000047552854],"about_ca_topic_score_codex":0.000370152,"about_ca_topic_score_gemma":0.00043287117,"teacher_disagreement_score":0.0016688069,"about_ca_system_score_codex":0.0008826072,"about_ca_system_score_gemma":0.00069714896,"threshold_uncertainty_score":0.0088256},"labels":[],"label_agreement":null},{"id":"W2963122821","doi":"10.1109/ita.2013.6502988","title":"New non-asymptotic random channel coding theorems","year":2013,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Waterloo","funders":"","keywords":"Mathematics; Discrete mathematics; Binary number; Applied mathematics; Constant (computer programming); Combinatorics; Computer science; Arithmetic","score_opus":0.007863954225488846,"score_gpt":0.2068833226115034,"score_spread":0.19901936838601456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963122821","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.005784363,0.00105584,0.97580713,0.0004180946,0.00024054613,0.00006914903,0.00018355277,0.00033419428,0.016107121],"genre_scores_gemma":[0.5263337,0.0057517188,0.4460946,0.0017022637,0.0012531623,0.0012613733,0.0009814047,0.00060871546,0.016013073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99354964,0.0020747988,0.0003569988,0.0008117358,0.0026690117,0.0005378602],"domain_scores_gemma":[0.97339034,0.01836787,0.0018169902,0.0032317871,0.0027972024,0.00039578447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008477444,0.002457342,0.0015715117,0.003595259,0.0009630875,0.0031223972,0.0030662185,0.001948939,0.0043806517],"category_scores_gemma":[0.03587588,0.00082020514,0.0018042225,0.0019034143,0.0049754144,0.005699567,0.0037371044,0.0064871134,0.0018499265],"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.000055448,0.000034469474,0.00027204835,0.00017691434,0.000044346598,0.00012687332,0.00013786594,0.03784996,0.0025671998,0.9383289,0.002614782,0.017791223],"study_design_scores_gemma":[0.000031615273,0.00009069029,0.0003224078,0.00014465232,0.000049486564,0.00056637835,0.000039290306,0.3522732,0.007008869,0.63228536,0.007083815,0.000104319806],"about_ca_topic_score_codex":0.00050464657,"about_ca_topic_score_gemma":0.0004995312,"teacher_disagreement_score":0.008477444,"about_ca_system_score_codex":0.0026203801,"about_ca_system_score_gemma":0.0017896215,"threshold_uncertainty_score":0.0448336},"labels":[],"label_agreement":null},{"id":"W2963658073","doi":"10.1109/cns.2015.7346838","title":"Adversarial wiretap channel with public discussion","year":2015,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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":"Adversarial system; Computer science; Channel (broadcasting); Telecommunications; Computer network; Computer security; Artificial intelligence","score_opus":0.03685030809863261,"score_gpt":0.22808735543760114,"score_spread":0.19123704733896854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963658073","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.047633186,0.0005251173,0.86553824,0.007925795,0.00039180287,0.00041059963,0.001468337,0.0011909239,0.07491594],"genre_scores_gemma":[0.8800492,0.0005072656,0.066013664,0.0009294289,0.0003557736,0.00074901216,0.0005623101,0.00019122718,0.05064212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936547,0.0025118946,0.00022581237,0.0011911886,0.0014459415,0.0009704644],"domain_scores_gemma":[0.9805988,0.011685658,0.0017520507,0.003977662,0.0012455302,0.00074030657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004272395,0.0014463286,0.0013941347,0.001048705,0.001977326,0.003629906,0.003245789,0.0041958955,0.015902944],"category_scores_gemma":[0.016766708,0.00080560567,0.0012715226,0.0012448048,0.004072079,0.008212571,0.005813962,0.00483893,0.0028326334],"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.00045800352,0.00008933434,0.00035842782,0.00010913202,0.00004455619,0.0006189289,0.00036676307,0.0758823,0.0017492842,0.9040016,0.0070575695,0.009264177],"study_design_scores_gemma":[0.00015605922,0.00008108361,0.00010806082,0.000040445673,0.00003410167,0.00018728901,0.00008641388,0.5128601,0.0020613547,0.47359326,0.010729518,0.000062333354],"about_ca_topic_score_codex":0.0020585312,"about_ca_topic_score_gemma":0.0016724477,"teacher_disagreement_score":0.015902944,"about_ca_system_score_codex":0.0031346167,"about_ca_system_score_gemma":0.0026728956,"threshold_uncertainty_score":0.053200603},"labels":[],"label_agreement":null},{"id":"W2963728200","doi":"10.1109/twc.2017.2659724","title":"Analysis and Design of Secure Massive MIMO Systems in the Presence of Hardware Impairments","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":123,"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 British Columbia","funders":"","keywords":"Artificial noise; Precoding; Computer science; Telecommunications link; MIMO; Base station; Noise (video); Transceiver; Transmission (telecommunications); Computer hardware; Phase noise; Secrecy; Electronic engineering; Wireless; Computer network; Transmitter; Telecommunications; Channel (broadcasting); Engineering; Artificial intelligence","score_opus":0.03368444558871831,"score_gpt":0.2853404049934569,"score_spread":0.2516559594047386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963728200","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.056953505,0.001335873,0.9247761,0.0005396555,0.00005235683,0.000075117954,0.00014587445,0.00016988092,0.01595167],"genre_scores_gemma":[0.9695346,0.001501882,0.024160082,0.00009513143,0.00007101435,0.00011647179,0.00008018199,0.00003286441,0.0044077607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993381,0.00018046555,0.000019851577,0.00006294143,0.00029791045,0.00010060795],"domain_scores_gemma":[0.99867487,0.0007083403,0.00023177713,0.0000735495,0.00025653015,0.000054981065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009338226,0.0009244151,0.0007501478,0.00046419978,0.000398674,0.0013675719,0.000486608,0.00091254414,0.0019301112],"category_scores_gemma":[0.0028541486,0.0005839229,0.00047447425,0.00050061324,0.0010764694,0.000765919,0.0010428801,0.00078377366,0.00045616913],"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.000025880545,0.000008757943,0.0003178288,0.000062254236,0.000019566254,0.00011317381,0.000043876287,0.97207266,0.003175938,0.020418629,0.000246958,0.0034944352],"study_design_scores_gemma":[0.000004323771,0.000027195392,0.00016600835,0.000010288065,0.00000696292,0.000027704311,0.000016067164,0.99404186,0.00060015195,0.0048457505,0.0002474303,0.0000063279595],"about_ca_topic_score_codex":0.0028597985,"about_ca_topic_score_gemma":0.002191786,"teacher_disagreement_score":0.0028597985,"about_ca_system_score_codex":0.0012409898,"about_ca_system_score_gemma":0.001381912,"threshold_uncertainty_score":0.009003997},"labels":[],"label_agreement":null},{"id":"W2963753797","doi":"10.1109/bsc.2018.8494701","title":"Successive Wyner-Ziv Coding for the Binary CEO Problem under Log-Loss","year":2018,"lang":"en","type":"preprint","venue":"","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":"McMaster University","funders":"","keywords":"Decoding methods; Binary number; Decodes; Logarithm; Upper and lower bounds; Algorithm; Low-density parity-check code; Distributed source coding; Mathematics; Coding (social sciences); Computer science; Binary code; Discrete mathematics; Theoretical computer science; Variable-length code; Arithmetic; Statistics","score_opus":0.03599085928043774,"score_gpt":0.2952396737729533,"score_spread":0.2592488144925156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963753797","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.056452803,0.0007811459,0.9290854,0.0009473257,0.00007294365,0.00008836989,0.00013752533,0.0001015038,0.012332901],"genre_scores_gemma":[0.8255365,0.0015754405,0.16256222,0.00034403516,0.00014307776,0.000249293,0.00037306928,0.000088388064,0.009127943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991074,0.00033683103,0.00003288114,0.00012357415,0.00025419449,0.00014508172],"domain_scores_gemma":[0.9973175,0.0020317226,0.00025796235,0.00014869639,0.00016950545,0.00007452087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013332323,0.0007994225,0.0008484769,0.0005966295,0.0005508098,0.00147781,0.0008541035,0.00121042,0.002535813],"category_scores_gemma":[0.0056895474,0.00027906083,0.000415313,0.0009910294,0.0014828666,0.0024040067,0.0017254485,0.0018931762,0.00035294262],"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.00023043988,0.00009667619,0.000606841,0.00039104043,0.00003553457,0.00038446186,0.00017930867,0.35111165,0.006481515,0.582824,0.0038779944,0.053780507],"study_design_scores_gemma":[0.00004536033,0.000080873484,0.00017868882,0.000050627532,0.000012884455,0.00023233515,0.000080732694,0.78401357,0.004632204,0.2083996,0.0022438467,0.000029290406],"about_ca_topic_score_codex":0.0011864387,"about_ca_topic_score_gemma":0.001076673,"teacher_disagreement_score":0.002535813,"about_ca_system_score_codex":0.0010379466,"about_ca_system_score_gemma":0.0017708037,"threshold_uncertainty_score":0.008483171},"labels":[],"label_agreement":null},{"id":"W2963811057","doi":"10.1109/itw.2017.8277937","title":"Lossy transmission of correlated sources over two-way channels","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"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":"Converse; Additive white Gaussian noise; Lossy compression; Gaussian; Coding (social sciences); Algorithm; Decoding methods; Mathematics; Computer science; Scalar (mathematics); Topology (electrical circuits); White noise; Statistical physics; Telecommunications; Statistics; Physics; Combinatorics; Geometry","score_opus":0.016494004213094163,"score_gpt":0.2775895118761295,"score_spread":0.26109550766303535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963811057","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.06954401,0.00059899566,0.92206186,0.0004193648,0.00006018056,0.000033930748,0.00017823717,0.00014296472,0.006960459],"genre_scores_gemma":[0.94619465,0.0010395328,0.04907179,0.00015242236,0.00006801289,0.000098474266,0.00012553272,0.000030989435,0.0032186492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984275,0.0004960946,0.00007271927,0.00019524482,0.000569546,0.00023890276],"domain_scores_gemma":[0.99227047,0.005185396,0.00085419416,0.0009561801,0.00060390035,0.00012994897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024076046,0.0011472168,0.0009030917,0.00058522355,0.0004988715,0.0016096445,0.000868137,0.0007597701,0.0013529087],"category_scores_gemma":[0.008707968,0.0005133146,0.0006011233,0.0010699633,0.0019116193,0.0020555954,0.0028157213,0.0014936123,0.00026952566],"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.00046025898,0.000062246705,0.0012931176,0.0003540301,0.00014790338,0.00068789173,0.00041609933,0.6156413,0.031319674,0.30339944,0.0017981295,0.044420015],"study_design_scores_gemma":[0.000027625521,0.00010867029,0.00047304938,0.00004910272,0.00005793499,0.00048345627,0.0000915498,0.89927673,0.017379131,0.0802929,0.0017025996,0.000057322093],"about_ca_topic_score_codex":0.00071819406,"about_ca_topic_score_gemma":0.0006650723,"teacher_disagreement_score":0.0024076046,"about_ca_system_score_codex":0.0010963911,"about_ca_system_score_gemma":0.00089470856,"threshold_uncertainty_score":0.012732804},"labels":[],"label_agreement":null},{"id":"W2964021047","doi":"10.3390/e21080732","title":"The Secret Key Capacity of a Class of Noisy Channels with Correlated Sources","year":2019,"lang":"en","type":"article","venue":"Entropy","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Horizon 2020 Framework Programme; Knut och Alice Wallenbergs Stiftelse; Stiftelsen för Strategisk Forskning; Stiftelsen för Strategisk Forskning; European Commission","keywords":"Channel (broadcasting); Key (lock); Binary number; Upper and lower bounds; Scheme (mathematics); Computer science; Transmission (telecommunications); Class (philosophy); Channel capacity; Topology (electrical circuits); Theoretical computer science; Mathematics; Telecommunications; Combinatorics; Computer security; Artificial intelligence; Arithmetic; Mathematical analysis","score_opus":0.006972486365565015,"score_gpt":0.19049997450788658,"score_spread":0.18352748814232156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964021047","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.17167896,0.0021393332,0.8002187,0.0008677799,0.00008226815,0.000073013405,0.00039791482,0.00022307843,0.024318969],"genre_scores_gemma":[0.98132265,0.0016514933,0.014085117,0.00008615261,0.00009818728,0.00008979857,0.00013672172,0.000061700994,0.0024682458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984376,0.00048221042,0.000043928245,0.00019923352,0.000518383,0.00031868805],"domain_scores_gemma":[0.9814827,0.016269945,0.0008014076,0.0006238691,0.0006437103,0.00017829085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022921327,0.0008956553,0.0009953509,0.0012629951,0.00064035144,0.0023331004,0.0012966249,0.0011477491,0.0025564313],"category_scores_gemma":[0.015364966,0.00036754628,0.00048863667,0.0012334771,0.003257244,0.0040518204,0.002159143,0.0014926853,0.00029246326],"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.00023232891,0.000059696253,0.00049794366,0.000391537,0.000057749337,0.00031164652,0.00024984108,0.634261,0.008673664,0.3384716,0.001258725,0.0155343],"study_design_scores_gemma":[0.000011259779,0.000035587138,0.00020817516,0.000055440072,0.000015466347,0.00015225947,0.00005835391,0.90777683,0.0035355906,0.08720045,0.0009227502,0.000027807664],"about_ca_topic_score_codex":0.00089605007,"about_ca_topic_score_gemma":0.00039122492,"teacher_disagreement_score":0.0025564313,"about_ca_system_score_codex":0.0017125225,"about_ca_system_score_gemma":0.0010778758,"threshold_uncertainty_score":0.012425244},"labels":[],"label_agreement":null},{"id":"W2964193638","doi":"10.1109/tit.2015.2453352","title":"Outer Bounds on the Admissible Source Region for Broadcast Channels With Correlated Sources","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lossy compression; Channel (broadcasting); Characterization (materials science); Computer science; Atomic broadcast; Mathematics; Topology (electrical circuits); Algorithm; Telecommunications; Wireless; Combinatorics; Physics; Artificial intelligence; Optics","score_opus":0.02515607787475048,"score_gpt":0.22412970652069783,"score_spread":0.19897362864594736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964193638","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.009357139,0.0018131951,0.9735556,0.00042642138,0.0001162209,0.000071263115,0.00025014504,0.0002823356,0.014127725],"genre_scores_gemma":[0.66415054,0.010148423,0.30365926,0.0012821341,0.0014572401,0.0014328454,0.0016806092,0.001530376,0.014658568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906736,0.0033954198,0.00041187264,0.0009830676,0.0032450792,0.0012909467],"domain_scores_gemma":[0.8867367,0.0969451,0.0039643017,0.0050457744,0.0055578128,0.0017502974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009121655,0.0039720866,0.0027659603,0.0039839707,0.0018860507,0.0052759536,0.0035109194,0.0020984316,0.00939681],"category_scores_gemma":[0.05809873,0.0012792917,0.0021314388,0.0033306377,0.0054554804,0.007207263,0.008454616,0.008068427,0.002336385],"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.0009923781,0.0001542879,0.0008661196,0.0009030093,0.00014626714,0.0005092329,0.0010514044,0.34449378,0.013872269,0.5817507,0.0059621613,0.049298372],"study_design_scores_gemma":[0.000048553273,0.00019986012,0.0004669218,0.00044267302,0.00012133881,0.00047612173,0.00026298338,0.56648594,0.01058186,0.41215265,0.008624054,0.00013697465],"about_ca_topic_score_codex":0.0010314668,"about_ca_topic_score_gemma":0.0007965394,"teacher_disagreement_score":0.00939681,"about_ca_system_score_codex":0.002759779,"about_ca_system_score_gemma":0.0019008828,"threshold_uncertainty_score":0.048240483},"labels":[],"label_agreement":null},{"id":"W2964307264","doi":"10.1109/isit.2011.6033717","title":"On the capacity of the K-user cyclic Gaussian interference channel","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"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 Toronto","funders":"","keywords":"Interference (communication); Channel (broadcasting); Gaussian; Topology (electrical circuits); Channel capacity; Dimension (graph theory); Constant (computer programming); Power (physics); Upper and lower bounds; Telecommunications; Computer science; Mathematics; Physics; Combinatorics; Mathematical analysis; Quantum mechanics","score_opus":0.05032718656413263,"score_gpt":0.22002815885244184,"score_spread":0.16970097228830922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964307264","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15877572,0.009359634,0.71939737,0.002339942,0.00019326368,0.000072738454,0.0006197864,0.00038866996,0.1088529],"genre_scores_gemma":[0.97432387,0.004150079,0.017068567,0.00024295949,0.00022468175,0.00013593162,0.00017557624,0.00008739346,0.003591036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988538,0.0003875647,0.000027810796,0.00010929346,0.00031463895,0.00030689582],"domain_scores_gemma":[0.9930593,0.005362849,0.0003339613,0.00036854736,0.0007214623,0.0001539775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014535445,0.0010341865,0.0007426278,0.0010592908,0.0006783705,0.001654577,0.00089656503,0.0006023788,0.0037578351],"category_scores_gemma":[0.008717126,0.00032998563,0.00045457995,0.00144515,0.0031348981,0.0023206838,0.0019552622,0.0015990089,0.0008177863],"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.00038488946,0.00004194241,0.0005378576,0.00032482608,0.000052194144,0.00035894892,0.00048363043,0.32907602,0.009482933,0.63056594,0.0039689154,0.024721893],"study_design_scores_gemma":[0.00002317068,0.00007915071,0.0005070181,0.00017714663,0.000030307661,0.00030001183,0.00016624334,0.7066758,0.0069486867,0.2797234,0.0053070197,0.000061995604],"about_ca_topic_score_codex":0.0027351128,"about_ca_topic_score_gemma":0.0008255911,"teacher_disagreement_score":0.0037578351,"about_ca_system_score_codex":0.0015944047,"about_ca_system_score_gemma":0.0011408443,"threshold_uncertainty_score":0.012571216},"labels":[],"label_agreement":null},{"id":"W2964323994","doi":"10.1109/allerton.2011.6120222","title":"Incremental relaying for the Gaussian interference channel with a degraded broadcasting relay","year":2011,"lang":"en","type":"article","venue":"","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 Toronto","funders":"","keywords":"Relay; Relay channel; Transmitter; Computer science; Channel (broadcasting); Interference (communication); Broadcasting (networking); Topology (electrical circuits); Transmission (telecommunications); Computer network; Gaussian; Telecommunications; Electronic engineering; Electrical engineering; Engineering; Physics","score_opus":0.0661959174035866,"score_gpt":0.24083869133450045,"score_spread":0.17464277393091385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964323994","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.16562955,0.00090053456,0.8253591,0.0004431468,0.000042158947,0.00005184872,0.00008135826,0.00019409343,0.007298234],"genre_scores_gemma":[0.97323394,0.00048768683,0.024715656,0.0000742231,0.000037955793,0.000025122035,0.000029692032,0.0000120546265,0.0013836623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992347,0.0003059177,0.000021971378,0.000080331876,0.00018818755,0.00016890367],"domain_scores_gemma":[0.99755704,0.001658029,0.0002445706,0.00022123978,0.00024007451,0.00007901106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012490959,0.0007974633,0.0006770858,0.0004559541,0.0006065707,0.0008135647,0.0009445692,0.00062229665,0.0008801256],"category_scores_gemma":[0.0044304538,0.00023952559,0.00060164806,0.00053422595,0.0018363484,0.0014161754,0.0009025171,0.00076290837,0.0001993507],"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.00026937725,0.000041224623,0.0005508455,0.00012413065,0.000040685634,0.0006205999,0.0003356469,0.8346926,0.008630885,0.13907632,0.00065231964,0.014965461],"study_design_scores_gemma":[0.000014525249,0.00008119602,0.000117141244,0.000006018835,0.000023965975,0.00016053632,0.000036139536,0.976356,0.0013820776,0.021361228,0.00044594676,0.000015137049],"about_ca_topic_score_codex":0.0036968798,"about_ca_topic_score_gemma":0.0027530326,"teacher_disagreement_score":0.0036968798,"about_ca_system_score_codex":0.0012695313,"about_ca_system_score_gemma":0.0007323969,"threshold_uncertainty_score":0.009211183},"labels":[],"label_agreement":null},{"id":"W2967282136","doi":"10.1109/twc.2019.2934462","title":"WFRFT-Aided Power-Efficient Multi-Beam Directional Modulation Schemes Based on Frequency Diverse Array","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"State Key Laboratory of Rail Traffic Control and Safety; Queen's University Belfast; Natural Science Foundation of Beijing Municipality; Beijing Municipal Science and Technology Commission; China Scholarship Council; Queen's University; National Natural Science Foundation of China","keywords":"Computer science; Robustness (evolution); Artificial noise; Wireless; Beam (structure); Physical layer; Bit error rate; Modulation (music); Fractional Fourier transform; Transmission (telecommunications); Power (physics); Electronic engineering; Telecommunications; Optics; Channel (broadcasting); Physics; Fourier transform; Acoustics; Engineering","score_opus":0.024767165764690038,"score_gpt":0.2619575081261347,"score_spread":0.23719034236144468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967282136","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.07014255,0.0007396976,0.92215604,0.00022803515,0.00009122802,0.000042001222,0.00006097421,0.00020674003,0.0063326615],"genre_scores_gemma":[0.83213633,0.0008241827,0.1628037,0.0002058147,0.000082515035,0.00007783764,0.00008942481,0.000016680446,0.0037635195],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99959177,0.000117991236,0.000023776098,0.000064422995,0.00014648818,0.000055555905],"domain_scores_gemma":[0.9994524,0.00016737163,0.00012456877,0.000103067774,0.00012776363,0.000024785879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004619047,0.0006041759,0.00039872245,0.00040108967,0.00042165667,0.00047107603,0.00055242865,0.0005193682,0.0011195244],"category_scores_gemma":[0.00095937797,0.0001578701,0.000368626,0.00067474524,0.00047733303,0.0008952291,0.00066559156,0.0005155484,0.0003005344],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0008171744,0.00018101757,0.0020690698,0.000346052,0.00013675161,0.00039487868,0.00039496188,0.18535687,0.37431017,0.11968804,0.003134713,0.3131703],"study_design_scores_gemma":[0.000061045845,0.00034581294,0.0005214695,0.000030980904,0.00005435358,0.0005893083,0.00005566446,0.8952688,0.086043365,0.010234137,0.0067276135,0.000067384455],"about_ca_topic_score_codex":0.00044777663,"about_ca_topic_score_gemma":0.0006379757,"teacher_disagreement_score":0.0011195244,"about_ca_system_score_codex":0.00036402448,"about_ca_system_score_gemma":0.00033157153,"threshold_uncertainty_score":0.0037451982},"labels":[],"label_agreement":null},{"id":"W2975077913","doi":"10.1109/isit.2019.8849363","title":"Towards an Algebraic Network Information Theory: Distributed Lossy Computation of Linear Functions","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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 British Columbia","funders":"","keywords":"Decoding methods; Lossy compression; Encoding (memory); Computation; Computer science; Theoretical computer science; Distributed source coding; Coding (social sciences); Linear network coding; Algorithm; Linear code; Mathematics; Block code; Channel code; Computer network; Artificial intelligence","score_opus":0.008102746453451347,"score_gpt":0.23257854314270432,"score_spread":0.22447579668925297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975077913","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.0055997195,0.00032560673,0.9893043,0.00051004457,0.00003239146,0.00002121921,0.00004512059,0.00003990188,0.0041216626],"genre_scores_gemma":[0.5568601,0.0025598526,0.43431428,0.00053268863,0.00039443458,0.00029816187,0.00019653591,0.00011106244,0.0047328495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985116,0.000726509,0.000048898397,0.00020099092,0.00039788464,0.00011406729],"domain_scores_gemma":[0.9957813,0.0029532916,0.00032831848,0.00047956753,0.00034434532,0.000113118855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027614331,0.0009611859,0.0012503267,0.0011037856,0.00059691106,0.0021936616,0.0020090998,0.001212462,0.0014437105],"category_scores_gemma":[0.010569491,0.00051283906,0.00093673513,0.0015285624,0.0037267106,0.0042792284,0.0034029472,0.0036819987,0.0005458463],"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.000044703273,0.0000253812,0.0001523139,0.00007019739,0.00001786533,0.000054230015,0.00009942933,0.20326766,0.00073998095,0.78400314,0.0008416889,0.010683449],"study_design_scores_gemma":[0.000008641505,0.000020693826,0.000027909942,0.00001469863,0.0000043925234,0.000024660147,0.000013658478,0.57051194,0.0003261343,0.4279976,0.0010405598,0.000009132586],"about_ca_topic_score_codex":0.0009692624,"about_ca_topic_score_gemma":0.0007191532,"teacher_disagreement_score":0.0027614331,"about_ca_system_score_codex":0.0017575234,"about_ca_system_score_gemma":0.0012876929,"threshold_uncertainty_score":0.014604032},"labels":[],"label_agreement":null},{"id":"W2975582433","doi":"10.1109/isit.2019.8849438","title":"Non-Malleable Codes against Active Physical Layer Adversary","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Calgary","funders":"","keywords":"Code word; Computer science; Adversary; Cryptography; Secret sharing; Set (abstract data type); Class (philosophy); Physical layer; Theoretical computer science; Function (biology); Fraction (chemistry); Computer security; Computer network; Decoding methods; Algorithm; Telecommunications; Wireless; Programming language","score_opus":0.008376145003172705,"score_gpt":0.2336653852258009,"score_spread":0.2252892402226282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975582433","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.058725566,0.0005159257,0.9291222,0.0007539182,0.00007414589,0.000120770084,0.00011940999,0.0005213789,0.010046736],"genre_scores_gemma":[0.90861815,0.0006451545,0.08351968,0.00032425576,0.00011580863,0.00028364718,0.00014316205,0.00018775309,0.006162399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960169,0.0011314556,0.0001726593,0.00063356786,0.0013348943,0.00071042567],"domain_scores_gemma":[0.9651923,0.02061275,0.0038766274,0.006603126,0.0026688229,0.0010464415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041955328,0.001519828,0.001093618,0.001769037,0.0011079384,0.0025568025,0.0020783274,0.0016298502,0.0029662931],"category_scores_gemma":[0.03174221,0.00049065927,0.0011289546,0.0011252643,0.0038786593,0.0048451335,0.003912755,0.0035763527,0.0008954492],"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.00027633473,0.000084931366,0.0010339252,0.00020385328,0.00005023195,0.00016389572,0.00034369106,0.17970355,0.0121003715,0.77636385,0.0017580332,0.027917301],"study_design_scores_gemma":[0.00004205087,0.00023959692,0.00028565453,0.00012507643,0.000034741315,0.00033669436,0.00008075772,0.73927116,0.020229647,0.23500663,0.0042867023,0.00006132379],"about_ca_topic_score_codex":0.0010595345,"about_ca_topic_score_gemma":0.0007590269,"teacher_disagreement_score":0.0041955328,"about_ca_system_score_codex":0.003123809,"about_ca_system_score_gemma":0.0025762133,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2975595616","doi":"10.1109/isit.2019.8849858","title":"New Sum-Rate Capacity Results for Multi-User Interference Channels","year":2019,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"Interference (communication); Gaussian; Computer science; Wireless; Wireless network; Channel capacity; Topology (electrical circuits); Computer network; Mathematics; Telecommunications; Channel (broadcasting)","score_opus":0.05964104810829891,"score_gpt":0.28213602546776845,"score_spread":0.22249497735946955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975595616","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.00947694,0.0061783493,0.9335831,0.00070339104,0.00048059778,0.0000826347,0.00040678898,0.0003283048,0.04875988],"genre_scores_gemma":[0.71916056,0.027533602,0.2253549,0.0019415638,0.002916658,0.0009115196,0.0011927375,0.00070184114,0.020286681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969337,0.0006247531,0.00014383909,0.00035669433,0.0015248086,0.00041628839],"domain_scores_gemma":[0.9912247,0.005557133,0.00047370148,0.0008431846,0.0016712054,0.00023006342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003360018,0.0028300432,0.0013686873,0.0028166024,0.000933977,0.0029392987,0.0018971232,0.001050036,0.004957496],"category_scores_gemma":[0.0145277,0.0006714039,0.0013659103,0.0032878204,0.0030457492,0.0061186855,0.003551515,0.0058388785,0.0017000005],"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.00013391658,0.00012578414,0.0004381205,0.0009140938,0.00009989756,0.00031977188,0.00050478795,0.14257306,0.010262405,0.779374,0.011090349,0.054163747],"study_design_scores_gemma":[0.000013359097,0.00008161927,0.00051643443,0.00024788675,0.000074034644,0.0004107483,0.00012855265,0.56118,0.008707118,0.41032064,0.018229138,0.00009045223],"about_ca_topic_score_codex":0.0009585716,"about_ca_topic_score_gemma":0.0007569264,"teacher_disagreement_score":0.004957496,"about_ca_system_score_codex":0.0020200363,"about_ca_system_score_gemma":0.00126937,"threshold_uncertainty_score":0.017769694},"labels":[],"label_agreement":null},{"id":"W2976384503","doi":"10.1109/isit.2019.8849454","title":"On the Capacity of Gaussian Multiple-Access Interference Channels","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Interference (communication); Computer science; Channel capacity; Adjacent-channel interference; Gaussian; Electronic engineering; Channel (broadcasting); Telecommunications; Physics; Engineering","score_opus":0.04087216352682525,"score_gpt":0.25955447429965667,"score_spread":0.2186823107728314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976384503","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.1852206,0.009380619,0.7039993,0.0027546664,0.00023967687,0.00010137018,0.0007420535,0.00040010634,0.09716171],"genre_scores_gemma":[0.9797977,0.0032399825,0.013510765,0.00016515056,0.00018212495,0.00013143764,0.00016505859,0.00006927863,0.0027384048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981396,0.00076390913,0.000037111506,0.00014105559,0.00044730605,0.00047105015],"domain_scores_gemma":[0.98697585,0.010944899,0.0005247615,0.000490946,0.0008415488,0.00022189699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021680426,0.0014098207,0.0010759635,0.0014989896,0.0007782184,0.0021803428,0.0011967694,0.00093314133,0.0036362873],"category_scores_gemma":[0.01597251,0.00046838477,0.0005738304,0.0016720742,0.0035396195,0.003026137,0.0020890306,0.002177215,0.00061109476],"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.00014866114,0.000035404668,0.00044337983,0.00017338166,0.000038727543,0.00020671281,0.00025160427,0.46925047,0.0018786108,0.5185651,0.001912828,0.0070951157],"study_design_scores_gemma":[0.000012940294,0.000024452092,0.00019063342,0.0000781075,0.000010852889,0.0000713007,0.000056733123,0.7885003,0.0008416626,0.2089517,0.0012389172,0.000022330483],"about_ca_topic_score_codex":0.003206832,"about_ca_topic_score_gemma":0.0012793763,"teacher_disagreement_score":0.0036362873,"about_ca_system_score_codex":0.002341599,"about_ca_system_score_gemma":0.0012509027,"threshold_uncertainty_score":0.016989589},"labels":[],"label_agreement":null},{"id":"W2976956053","doi":"10.1109/isit.2019.8849577","title":"Joint Source-Channel Coding for the Transmission of Correlated Sources over Two-Way Channels","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":9,"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":"Lossy compression; Channel code; Lossless compression; Coding (social sciences); Computer science; Variable-length code; Tunstall coding; Algorithm; Channel (broadcasting); Decoding methods; Source code; Theoretical computer science; Context-adaptive binary arithmetic coding; Shannon–Fano coding; Adaptive coding; Context-adaptive variable-length coding; Mathematics; Coding tree unit; Telecommunications; Data compression; Statistics; Artificial intelligence","score_opus":0.02007848606354787,"score_gpt":0.24832113896398486,"score_spread":0.228242652900437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976956053","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.010503689,0.00023682609,0.9864157,0.00012094612,0.000035272296,0.000025699419,0.000043702432,0.000099935925,0.0025182145],"genre_scores_gemma":[0.7978216,0.0007201158,0.19811924,0.00010790138,0.0000649777,0.00016727703,0.0001180143,0.00003729968,0.002843631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992556,0.000228257,0.000035310797,0.00008346002,0.0002973415,0.00010006839],"domain_scores_gemma":[0.99780697,0.001317164,0.00020458364,0.0003455053,0.0002709037,0.000054936427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011560323,0.0006875425,0.0005183699,0.00058440113,0.000530348,0.0008289337,0.00086618407,0.0005478014,0.001492666],"category_scores_gemma":[0.003147885,0.00024574174,0.00045346247,0.0010332857,0.0013301027,0.0010790064,0.0017071733,0.0012355467,0.0002681697],"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.00016409419,0.000037888985,0.00042385096,0.00018269432,0.000042240452,0.0002201583,0.000282927,0.38697228,0.018665804,0.5189807,0.0019320839,0.07209528],"study_design_scores_gemma":[0.00001658522,0.000051597097,0.000096020165,0.000022742695,0.000018362998,0.00012644312,0.000021649037,0.9475718,0.0065463022,0.043470617,0.002034408,0.000023413459],"about_ca_topic_score_codex":0.00114433,"about_ca_topic_score_gemma":0.0014994957,"teacher_disagreement_score":0.001492666,"about_ca_system_score_codex":0.00083734124,"about_ca_system_score_gemma":0.0011122645,"threshold_uncertainty_score":0.0061137676},"labels":[],"label_agreement":null},{"id":"W2980322243","doi":"10.1109/tvt.2019.2947375","title":"Ergodic Secrecy Rate of $K$-User MISO Broadcast Channel With Improved Random Beamforming","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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 British Columbia","funders":"Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Beamforming; Secrecy; Noma; Transmitter; Artificial noise; Computer science; Ergodic theory; Topology (electrical circuits); Channel (broadcasting); Fading; Computer network; Signal-to-noise ratio (imaging); Telecommunications; Mathematics; Telecommunications link; Computer security","score_opus":0.004578005143059563,"score_gpt":0.1948110092680085,"score_spread":0.19023300412494895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980322243","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.262405,0.0035496554,0.7165635,0.0007278362,0.00015670076,0.00005611298,0.0004559306,0.00054895855,0.015536289],"genre_scores_gemma":[0.9867019,0.0013100122,0.009686374,0.00007987102,0.000059626815,0.000041681116,0.00016371881,0.000051743194,0.0019050024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774015,0.0007492983,0.00008973209,0.00021726737,0.00059801945,0.00060554524],"domain_scores_gemma":[0.99439406,0.0031682749,0.0008023384,0.00052920135,0.000953951,0.0001523036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024322881,0.0018893525,0.0014650802,0.0009494857,0.00085798494,0.0014126054,0.0009198595,0.0009195659,0.0015391808],"category_scores_gemma":[0.0058445614,0.00043623373,0.0009228899,0.0014096777,0.0021501,0.0024863486,0.0017219868,0.0010219032,0.00048686366],"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.00033167767,0.000029350607,0.002269017,0.00020317498,0.00011049835,0.0004288014,0.00017411057,0.9296895,0.008920128,0.047592502,0.0009727737,0.009278448],"study_design_scores_gemma":[0.000012923875,0.000055586675,0.0004481707,0.000022718174,0.000043449854,0.00018775718,0.000067707355,0.9885904,0.004440463,0.005779389,0.00030663982,0.00004483641],"about_ca_topic_score_codex":0.003185135,"about_ca_topic_score_gemma":0.001948266,"teacher_disagreement_score":0.003185135,"about_ca_system_score_codex":0.0015806163,"about_ca_system_score_gemma":0.0013147234,"threshold_uncertainty_score":0.012863338},"labels":[],"label_agreement":null},{"id":"W2982493600","doi":"10.1109/wcnc.2019.8886042","title":"Secrecy Analysis of a TAS/MRC Scheme in $\\alpha-\\mu$ Fading Channels","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Concordia University","funders":"","keywords":"Secrecy; Fading; Maximal-ratio combining; MIMO; Antenna (radio); Computer science; Outage probability; Monte Carlo method; Electronic engineering; Computer network; Diversity gain; Topology (electrical circuits); Telecommunications; Statistics; Mathematics; Channel (broadcasting); Engineering; Computer security; Electrical engineering","score_opus":0.011046835713520341,"score_gpt":0.24333198086864077,"score_spread":0.23228514515512044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982493600","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.2832308,0.0027624492,0.676845,0.0008881415,0.00010858417,0.000104120976,0.00045065428,0.00038381875,0.035226386],"genre_scores_gemma":[0.99072903,0.0008830152,0.0066094147,0.000056883273,0.0000544591,0.000021789549,0.000048168826,0.000023410195,0.0015738837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984285,0.0006121098,0.000047249887,0.000107226624,0.00043916394,0.0003656183],"domain_scores_gemma":[0.9942252,0.0040475964,0.0006296377,0.00030824883,0.0006717912,0.00011757746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021818765,0.0012212424,0.0010101161,0.0009155492,0.0007226704,0.0012908292,0.0007172665,0.0007754475,0.00238244],"category_scores_gemma":[0.0057826615,0.00039901794,0.0006941616,0.0010955636,0.0021577054,0.0014832782,0.001348255,0.000681947,0.0005129632],"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.00021959619,0.000019123776,0.0010582284,0.00012198426,0.000066233086,0.00041514004,0.000121429795,0.93119645,0.009028787,0.051607706,0.0005236643,0.0056216754],"study_design_scores_gemma":[0.000009556283,0.00008684742,0.00045309565,0.000020910937,0.000040524115,0.0002539556,0.000059410573,0.988325,0.0035880439,0.0068211555,0.00031866782,0.000022787337],"about_ca_topic_score_codex":0.0031649289,"about_ca_topic_score_gemma":0.0017312265,"teacher_disagreement_score":0.0031649289,"about_ca_system_score_codex":0.0017405412,"about_ca_system_score_gemma":0.0014095502,"threshold_uncertainty_score":0.012628615},"labels":[],"label_agreement":null},{"id":"W2987936195","doi":"10.1109/vtcfall.2019.8891253","title":"Secure DoF for the MIMO MAC: The Case of Knowing Eavesdropper's Channel Statistics Only","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Memorial University of Newfoundland","funders":"","keywords":"Channel state information; Computer science; Physical layer; MIMO; Jamming; Computer network; Channel (broadcasting); Fading; Encryption; Gaussian; Secure communication; Computer security; Topology (electrical circuits); Telecommunications; Mathematics; Wireless","score_opus":0.013607255383364025,"score_gpt":0.25673497880531304,"score_spread":0.24312772342194902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987936195","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.034974508,0.0032446047,0.91018164,0.0017080191,0.00021851783,0.00008249542,0.00055308745,0.00031062815,0.048726544],"genre_scores_gemma":[0.9522487,0.0036930908,0.03383397,0.00044763496,0.00035411512,0.000263754,0.00023489435,0.000102388614,0.008821641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974821,0.0005657445,0.00009956581,0.00030563114,0.0008794797,0.0006675279],"domain_scores_gemma":[0.99141216,0.005434161,0.0008698575,0.0010506428,0.0009161217,0.00031695273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029186292,0.0026248256,0.0012732423,0.0019928168,0.0015590184,0.0029950438,0.0012977689,0.0014534959,0.0051085404],"category_scores_gemma":[0.010970033,0.00061191275,0.0011398188,0.0015772915,0.0039674714,0.004056726,0.005077418,0.0029752122,0.0010435947],"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.00020315,0.000113215945,0.0011498157,0.00058882235,0.000092877366,0.0006538869,0.00039960098,0.40975678,0.010680265,0.54339856,0.005958798,0.02700425],"study_design_scores_gemma":[0.000009023893,0.00010770516,0.00057641463,0.00012407149,0.00004354567,0.00046365158,0.00019399099,0.812579,0.0030687058,0.18017645,0.0026031737,0.00005428119],"about_ca_topic_score_codex":0.0027407997,"about_ca_topic_score_gemma":0.0032936824,"teacher_disagreement_score":0.0051085404,"about_ca_system_score_codex":0.0031565318,"about_ca_system_score_gemma":0.002157573,"threshold_uncertainty_score":0.02290231},"labels":[],"label_agreement":null},{"id":"W2990309384","doi":"","title":"Secrecy Analysis of a TAS/MRC Scheme in α-μ Fading Channels.","year":2019,"lang":"en","type":"article","venue":"Wireless Communications and Networking Conference","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Fading; Secrecy; Computer science; Fading distribution; Scheme (mathematics); Maximal-ratio combining; Telecommunications; Computer network; Electronic engineering; Mathematics; Computer security; Channel (broadcasting); Engineering; Rayleigh fading","score_opus":0.029293635360560673,"score_gpt":0.2615811920801954,"score_spread":0.23228755671963475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990309384","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.14988193,0.0055013997,0.7151801,0.0028272716,0.0004518908,0.00026130598,0.0013118593,0.0006841547,0.12390004],"genre_scores_gemma":[0.9784681,0.0015448766,0.010912221,0.00018209283,0.000142783,0.000056182365,0.00013754307,0.000064857144,0.008491342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984598,0.00049622613,0.000041167925,0.000086761574,0.0004820476,0.0004339126],"domain_scores_gemma":[0.99566627,0.0027116037,0.0003620702,0.00034151992,0.00078501244,0.0001335409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020729848,0.0012707852,0.0009418008,0.0011615222,0.00096763065,0.0016472011,0.0008731139,0.0010591091,0.009177654],"category_scores_gemma":[0.0047950987,0.00053897436,0.00093323115,0.0011820664,0.0021218543,0.0017138493,0.0014312753,0.001174401,0.0014570076],"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.00072680303,0.00006635105,0.0012025932,0.00042690826,0.00020289408,0.0008874474,0.00041459626,0.58216465,0.023854448,0.37011957,0.006545867,0.013387793],"study_design_scores_gemma":[0.000032605538,0.00014095986,0.000555949,0.000088346555,0.0000893508,0.00055872963,0.00016280115,0.94306153,0.0041395454,0.04935451,0.0017672025,0.000048446585],"about_ca_topic_score_codex":0.0042418954,"about_ca_topic_score_gemma":0.003365717,"teacher_disagreement_score":0.009177654,"about_ca_system_score_codex":0.002197944,"about_ca_system_score_gemma":0.0020678875,"threshold_uncertainty_score":0.030702293},"labels":[],"label_agreement":null},{"id":"W2990463783","doi":"10.11648/j.jeee.20190706.11","title":"Invited Paper: Raptor Code and Massive MiMo for Secure Wireless Delivery in 5G","year":2019,"lang":"en","type":"article","venue":"Journal of Electrical and Electronic Engineering","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"École de Technologie Supérieure","funders":"","keywords":"Eavesdropping; Computer science; MIMO; Physical layer; Artificial noise; Computer network; Fountain code; Secrecy; Transmission (telecommunications); Code (set theory); Wireless; Secure transmission; Channel (broadcasting); Computer security; Telecommunications; Decoding methods; Block code; Concatenated error correction code","score_opus":0.003685328197507719,"score_gpt":0.19372844001002806,"score_spread":0.19004311181252034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990463783","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.07234018,0.062547386,0.65314853,0.037885945,0.057668544,0.00025357734,0.0003782147,0.0011595017,0.114618056],"genre_scores_gemma":[0.681419,0.035519175,0.09832045,0.004904833,0.022277346,0.00012581341,0.0003717422,0.00033386247,0.15672776],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99967206,0.00011422906,0.00000869209,0.0000659953,0.00010694742,0.000032083706],"domain_scores_gemma":[0.999421,0.00021507368,0.000028531666,0.000035692516,0.0002557924,0.000043927343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057608954,0.0005833624,0.0003177874,0.00042696483,0.00041716362,0.0008379502,0.0005377262,0.001285963,0.0061918255],"category_scores_gemma":[0.0016742783,0.00014065865,0.0003714667,0.00045832797,0.00050861714,0.00092076097,0.0004443592,0.0011248072,0.0021744147],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0010020382,0.0001271783,0.0025845445,0.0012948832,0.0003033126,0.0023338636,0.0005893277,0.07147594,0.030966748,0.1791451,0.37784863,0.33232853],"study_design_scores_gemma":[0.00012446329,0.00075808197,0.0013684846,0.00020321454,0.00021104305,0.0026126096,0.00040189808,0.39090475,0.03561022,0.05490493,0.51269585,0.0002044374],"about_ca_topic_score_codex":0.0006312684,"about_ca_topic_score_gemma":0.00065228227,"teacher_disagreement_score":0.0061918255,"about_ca_system_score_codex":0.0003389395,"about_ca_system_score_gemma":0.00028800778,"threshold_uncertainty_score":0.020713687},"labels":[],"label_agreement":null},{"id":"W2992225407","doi":"10.1063/1.5126723","title":"A minimax approach to one-shot entropy inequalities","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Ministry of Education - Singapore; National Research Foundation Singapore","keywords":"Mathematical proof; Minimax; Information theory; Entropy (arrow of time); Quantum; Simple (philosophy); Quantum relative entropy; Smoothing","score_opus":0.06831374393054442,"score_gpt":0.28574156391851163,"score_spread":0.21742781998796723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2992225407","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.0141292615,0.00094793394,0.9620322,0.0021621324,0.00013206953,0.000045965342,0.00013712537,0.00006883632,0.02034438],"genre_scores_gemma":[0.76423645,0.0026017781,0.21219155,0.001502647,0.0011289942,0.00047776935,0.0002604684,0.00021552277,0.017384822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966466,0.0014242636,0.00015420881,0.00055718026,0.00095022743,0.0002674576],"domain_scores_gemma":[0.9850743,0.012323959,0.00056165445,0.00089242327,0.0007980756,0.0003496363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007256485,0.0012115539,0.0013319053,0.0018904491,0.0010799803,0.0029686762,0.0025472473,0.0016898062,0.005926781],"category_scores_gemma":[0.023021279,0.0005567481,0.0011758152,0.0014700707,0.004264924,0.0077773044,0.0036044847,0.0060687866,0.00056385883],"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.000011321234,0.000013077595,0.00008025925,0.00003698919,0.00001221491,0.00003767157,0.00005661168,0.009346276,0.0005866661,0.98612,0.00046696735,0.0032320905],"study_design_scores_gemma":[0.000005518936,0.000016692133,0.000101870755,0.000017797242,0.00000494419,0.000025332834,0.000014342306,0.089706816,0.00029347575,0.90905553,0.00074796326,0.000009691236],"about_ca_topic_score_codex":0.00081022055,"about_ca_topic_score_gemma":0.00065171375,"teacher_disagreement_score":0.007256485,"about_ca_system_score_codex":0.0028577296,"about_ca_system_score_gemma":0.0014139822,"threshold_uncertainty_score":0.03837639},"labels":[],"label_agreement":null},{"id":"W2995242809","doi":"10.1109/cwit.2019.8929922","title":"Lattice-based Robust Distributed Source Coding for Three Correlated Sources","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McMaster University","funders":"","keywords":"Gaussian; Rate distortion; Degenerate energy levels; Lattice (music); Distributed source coding; Computer science; Coding (social sciences); Quadratic equation; Algorithm; Statistical physics; Decoding methods; Theoretical computer science; Topology (electrical circuits); Mathematics; Physics; Channel code; Statistics; Combinatorics; Quantum mechanics; Geometry","score_opus":0.019800371923941948,"score_gpt":0.2221609183555821,"score_spread":0.20236054643164014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995242809","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.009389351,0.00013380437,0.9892847,0.00014001424,0.00002153426,0.000023349841,0.000028878254,0.00016387239,0.0008145136],"genre_scores_gemma":[0.60237426,0.00022558686,0.39500558,0.00019395888,0.000041460706,0.000113815906,0.00011456481,0.000044645607,0.0018861544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975575,0.00093992124,0.000105930085,0.00025832752,0.0009833395,0.00015492462],"domain_scores_gemma":[0.99756277,0.0010308387,0.00035414656,0.0004424161,0.0004903764,0.000119376666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002141656,0.0005974811,0.0013111326,0.00059385103,0.0005958124,0.0010796217,0.0017527739,0.001131746,0.0011949656],"category_scores_gemma":[0.0041222004,0.00036042457,0.0008408878,0.0010168033,0.0014541362,0.0017706369,0.0025029606,0.0018371913,0.0006373039],"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.0007243167,0.0001297146,0.0007017641,0.00020087871,0.00012756177,0.00033970954,0.00028688725,0.6320219,0.048607603,0.19741155,0.0015676671,0.11788041],"study_design_scores_gemma":[0.00003872266,0.000055220116,0.0000366078,0.000009172982,0.0000088852485,0.00007522206,0.000011468513,0.9821921,0.0057319663,0.011276404,0.00053428987,0.000030041414],"about_ca_topic_score_codex":0.0012845839,"about_ca_topic_score_gemma":0.00096869457,"teacher_disagreement_score":0.002141656,"about_ca_system_score_codex":0.0012369173,"about_ca_system_score_gemma":0.001455751,"threshold_uncertainty_score":0.011326313},"labels":[],"label_agreement":null},{"id":"W2995308193","doi":"10.1109/cwit.2019.8929923","title":"Scalar Quantizer Design for Two-Way Channels","year":2019,"lang":"en","type":"article","venue":"","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":"Algorithm; Multiplicative function; Binary number; Gaussian; Computer science; Quantization (signal processing); Duplex (building); Mathematics; Electronic engineering; Engineering; Physics; Mathematical analysis; Arithmetic","score_opus":0.031816764314876074,"score_gpt":0.2710969611505302,"score_spread":0.23928019683565416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995308193","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.011397411,0.00027462706,0.98644906,0.0000858442,0.000032413904,0.000038937254,0.00004135077,0.000115290604,0.0015649681],"genre_scores_gemma":[0.8121467,0.00065886247,0.18225557,0.00010343502,0.000053253032,0.00013161536,0.00011390763,0.000034345117,0.0045022764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994777,0.00013327414,0.000034184537,0.000083653744,0.00023469754,0.000036464568],"domain_scores_gemma":[0.9992386,0.00035713258,0.00011684375,0.00006534779,0.00020308612,0.000018952658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077676546,0.00041667896,0.0003495422,0.00028263137,0.0002392681,0.0009160265,0.00052996445,0.00038927232,0.0023349228],"category_scores_gemma":[0.0016412539,0.00019329647,0.00013905013,0.00047639097,0.00056964013,0.0010152792,0.00060774275,0.00054577633,0.00038537855],"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.00024496342,0.00007416047,0.0009129583,0.00051902886,0.00005493203,0.00011977622,0.00022713651,0.5513694,0.06620194,0.1674286,0.0026603048,0.21018669],"study_design_scores_gemma":[0.000026669037,0.00013017988,0.00014668657,0.000024034305,0.000010380433,0.0000810213,0.00002969624,0.9620465,0.015629262,0.019226262,0.0026282403,0.000021080614],"about_ca_topic_score_codex":0.0005317025,"about_ca_topic_score_gemma":0.00066863385,"teacher_disagreement_score":0.0023349228,"about_ca_system_score_codex":0.00051324297,"about_ca_system_score_gemma":0.0006483176,"threshold_uncertainty_score":0.0078110695},"labels":[],"label_agreement":null},{"id":"W2997506252","doi":"10.48550/arxiv.2001.01159","title":"The Asymptotic Generalized Poor-Verdu Bound Achieves the BSC Error Exponent at Zero Rate","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Upper and lower bounds; Mathematics; Exponent; Zero (linguistics); Function (biology); Binary number; Binary symmetric channel; Applied mathematics; Combinatorics; Statistics; Coding (social sciences); Mathematical analysis; Channel capacity; Arithmetic","score_opus":0.07651575857988922,"score_gpt":0.19934147361597343,"score_spread":0.12282571503608421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997506252","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.057666544,0.0042647836,0.89062357,0.0030590491,0.00044698,0.00012287765,0.0006427586,0.0007845533,0.04238881],"genre_scores_gemma":[0.88912964,0.0028786992,0.095792934,0.0017508296,0.0007973165,0.00050982484,0.000509792,0.0003437434,0.008287255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935574,0.0020786782,0.00029329033,0.0009123695,0.0021263661,0.0010319548],"domain_scores_gemma":[0.96772176,0.020900477,0.0016414727,0.0047013806,0.004310659,0.00072416675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006969463,0.0025454597,0.002452328,0.0042549223,0.001642958,0.0035155804,0.0033312787,0.0028377885,0.0056386082],"category_scores_gemma":[0.0529718,0.00058556197,0.0012430014,0.0032820392,0.0063159894,0.0062524574,0.0050523006,0.004851571,0.0016795796],"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.00024844575,0.000041521907,0.0011974686,0.00032667487,0.000087393666,0.00030223824,0.00019572911,0.096425675,0.004408986,0.8510876,0.008745775,0.036932502],"study_design_scores_gemma":[0.0000298047,0.00013700202,0.0007284687,0.00015989078,0.000052407646,0.0005562678,0.000082153056,0.34927693,0.0052105845,0.63995403,0.0037190865,0.0000933237],"about_ca_topic_score_codex":0.0016162466,"about_ca_topic_score_gemma":0.0015120576,"teacher_disagreement_score":0.006969463,"about_ca_system_score_codex":0.0036554274,"about_ca_system_score_gemma":0.0025154552,"threshold_uncertainty_score":0.0368585},"labels":[],"label_agreement":null},{"id":"W2998901236","doi":"10.1109/lcomm.2020.2965535","title":"Comments on “AN-Aided Secrecy Precoding for SWIPT in Cognitive MIMO Broadcast Channels”","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","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":"University of Ottawa","funders":"","keywords":"Precoding; Secrecy; MIMO; Artificial noise; Computer science; Channel (broadcasting); Cognitive radio; Maximization; Algorithm; Wireless; Transmitter; Topology (electrical circuits); Mathematics; Computer network; Telecommunications; Mathematical optimization; Combinatorics; Computer security","score_opus":0.10336969794502628,"score_gpt":0.3277937017716794,"score_spread":0.22442400382665312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998901236","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008543401,0.003878573,0.0055181026,0.77826595,0.19659734,0.0000971626,0.00092114735,0.00039752256,0.013469838],"genre_scores_gemma":[0.0132387895,0.0037596996,0.0039526382,0.85135514,0.08496971,0.00014560751,0.00029658925,0.00028176408,0.042000163],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99358433,0.0016005278,0.00072852866,0.000804222,0.0027824426,0.0004998295],"domain_scores_gemma":[0.98159057,0.0087822825,0.0009178474,0.0006187118,0.007632327,0.00045832686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005384512,0.0015201609,0.0011472311,0.0008668949,0.002558054,0.001998032,0.004272133,0.01717485,0.016098991],"category_scores_gemma":[0.029506652,0.0007226308,0.0015648343,0.0011865416,0.002481578,0.0031488875,0.0014260162,0.014077083,0.0125170825],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00004521865,0.0000123998625,0.00009357555,0.00008984393,0.000008402298,0.00019126588,0.00011777155,0.00021218136,0.00030610024,0.005251544,0.99050176,0.0031700418],"study_design_scores_gemma":[0.00003052906,0.00004129514,0.0009776116,0.00016380074,0.00002418523,0.0002674929,0.0002200626,0.0013726495,0.0015928942,0.0073683,0.98784083,0.00010035241],"about_ca_topic_score_codex":0.019120408,"about_ca_topic_score_gemma":0.015494073,"teacher_disagreement_score":0.019120408,"about_ca_system_score_codex":0.003962447,"about_ca_system_score_gemma":0.003419105,"threshold_uncertainty_score":0.05385655},"labels":[],"label_agreement":null},{"id":"W2999016727","doi":"10.1186/s13638-019-1634-7","title":"Efficient physical layer key generation technique in wireless communications","year":2020,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Key generation; Computer science; Randomness; Key (lock); Physical layer; Wireless; RSS; Transmitter; Bit error rate; Computer network; Algorithm; Telecommunications; Cryptography; Computer security; Channel (broadcasting); Mathematics","score_opus":0.06178977430987615,"score_gpt":0.29272182121044715,"score_spread":0.230932046900571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999016727","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.041691415,0.0017887895,0.95348233,0.00029524023,0.00012096211,0.000080474296,0.000060700546,0.0004971877,0.0019829131],"genre_scores_gemma":[0.87623066,0.0005760803,0.12083634,0.0001585269,0.00009073514,0.00008080146,0.00007436967,0.000025427686,0.0019269969],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99841654,0.00059430406,0.00010093264,0.00025131993,0.00048461065,0.00015221506],"domain_scores_gemma":[0.9985637,0.00044659947,0.00034068065,0.00040200452,0.00020665258,0.000040340994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010992865,0.00068842724,0.00062326685,0.0006343784,0.00050040096,0.0006861221,0.00093287515,0.00078231265,0.0013282608],"category_scores_gemma":[0.0025352114,0.0002958087,0.0004085762,0.0008159578,0.000715999,0.0021182299,0.001593922,0.0008342862,0.0004981461],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0013237849,0.00020472515,0.0020065422,0.00075478514,0.00027427537,0.00078438316,0.00039780984,0.110703774,0.41283336,0.09399731,0.0036187423,0.37310055],"study_design_scores_gemma":[0.00017179051,0.00079463836,0.0014463797,0.00009005674,0.00012322169,0.0016018632,0.00009385161,0.7603599,0.19545531,0.027970877,0.011754584,0.00013758098],"about_ca_topic_score_codex":0.00015778943,"about_ca_topic_score_gemma":0.00013736486,"teacher_disagreement_score":0.0013282608,"about_ca_system_score_codex":0.00041648318,"about_ca_system_score_gemma":0.00039101162,"threshold_uncertainty_score":0.0058136582},"labels":[],"label_agreement":null},{"id":"W2999286278","doi":"10.3390/s20020438","title":"Defending Against Randomly Located Eavesdroppers by Establishing a Protecting Region","year":2020,"lang":"en","type":"article","venue":"Sensors","topic":"Wireless Communication Security 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":"Memorial University of Newfoundland","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Eavesdropping; Jamming; Computer network; Computer science; Transmission (telecommunications); Artificial noise; Wireless sensor network; Secrecy; Beamforming; Wireless; Computer security; Wireless network; Channel (broadcasting); Transmitter; Telecommunications","score_opus":0.020042669053734103,"score_gpt":0.20942603928269068,"score_spread":0.18938337022895657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999286278","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.07511726,0.0006562809,0.9211186,0.00015473597,0.000040553667,0.00003759195,0.000024474617,0.0002040142,0.0026465089],"genre_scores_gemma":[0.94742286,0.0007572398,0.0510252,0.00006992629,0.000048412694,0.00004818984,0.00002152135,0.00002355458,0.0005831616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814045,0.00078827725,0.000093648094,0.00027349812,0.0005156836,0.0001884009],"domain_scores_gemma":[0.9946232,0.0032077886,0.0009117869,0.00068366964,0.00043002292,0.00014358512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015847816,0.0013449179,0.0009188627,0.0007446745,0.00069629867,0.0010314982,0.0009649364,0.0010629877,0.000482138],"category_scores_gemma":[0.005456653,0.00030782228,0.00063409767,0.0005579537,0.0017968734,0.002465423,0.0020084411,0.00083728624,0.0002693926],"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.00046820022,0.000110510584,0.0038367745,0.00033911833,0.00024895574,0.0012980198,0.0005763277,0.68270475,0.15560935,0.07458142,0.0008632619,0.07936333],"study_design_scores_gemma":[0.000017838047,0.00059709756,0.00092004554,0.000040169998,0.00010969561,0.0010466605,0.00023797677,0.92153895,0.055876516,0.017720612,0.0018473298,0.000047110752],"about_ca_topic_score_codex":0.0003796279,"about_ca_topic_score_gemma":0.00024701565,"teacher_disagreement_score":0.0015847816,"about_ca_system_score_codex":0.00044998454,"about_ca_system_score_gemma":0.00070302375,"threshold_uncertainty_score":0.0083812475},"labels":[],"label_agreement":null},{"id":"W3000406194","doi":"10.1109/tvt.2020.2965959","title":"Deep Artificial Noise: Deep Learning-Based Precoding Optimization for Artificial Noise Scheme","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Precoding; Artificial noise; Zero-forcing precoding; Scheme (mathematics); Channel (broadcasting); Deep learning; Noise (video); Computer science; Artificial neural network; Wireless; Artificial intelligence; Algorithm; MIMO; Electronic engineering; Mathematics; Telecommunications; Engineering; Transmitter","score_opus":0.020868967831511823,"score_gpt":0.24262632594441613,"score_spread":0.2217573581129043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000406194","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.014349969,0.00026608506,0.9822051,0.00024144005,0.00004088551,0.000023198469,0.000031642452,0.00008597177,0.002755714],"genre_scores_gemma":[0.8458946,0.0004489588,0.14561689,0.00030124426,0.000074224125,0.00009071089,0.00009287781,0.00004765704,0.007432929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993855,0.00022512946,0.000024057865,0.0001140546,0.00016784729,0.00008335092],"domain_scores_gemma":[0.9990208,0.00058852433,0.00009733613,0.00009670234,0.00014407947,0.000052515115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012126075,0.00084767316,0.0007323442,0.00025246243,0.00031330655,0.0007183292,0.00086999475,0.0011437469,0.0018264924],"category_scores_gemma":[0.0026774984,0.00027998557,0.00034435038,0.0004189035,0.0013965846,0.0013499556,0.0011952269,0.0016057396,0.00027476074],"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.0001223827,0.000040312603,0.00036304365,0.00007320347,0.000032929875,0.00007993902,0.000049079317,0.9090377,0.0034570924,0.056002095,0.00095735944,0.029784953],"study_design_scores_gemma":[0.000004261546,0.00001774346,0.000015375645,0.0000031988814,0.000003229303,0.000010425889,0.0000028488853,0.99462116,0.0004791847,0.004629667,0.00020990684,0.0000029706075],"about_ca_topic_score_codex":0.0017345994,"about_ca_topic_score_gemma":0.0021763938,"teacher_disagreement_score":0.0018264924,"about_ca_system_score_codex":0.0009399224,"about_ca_system_score_gemma":0.0009495486,"threshold_uncertainty_score":0.006819606},"labels":[],"label_agreement":null},{"id":"W3000465536","doi":"10.1109/tit.2020.2967048","title":"On the Commitment Capacity of Unfair Noisy Channels","year":2020,"lang":"","type":"article","venue":"University of Washington Tacoma Digital Commons (University of Washington Tacoma)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Oblivious transfer; Computer science; Channel (broadcasting); Cryptography; Binary symmetric channel; Binary number; Adversary; Cryptographic primitive; Channel capacity; Computer security; Point (geometry); Theoretical computer science; Noise (video); Cryptographic protocol; Computer network; Mathematics; Artificial intelligence; Arithmetic","score_opus":0.02639158041173163,"score_gpt":0.18965010394208096,"score_spread":0.16325852353034934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000465536","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.30069524,0.0049382746,0.5983719,0.0058037075,0.00036400836,0.00014894972,0.0006911209,0.00037259792,0.08861414],"genre_scores_gemma":[0.97175163,0.0022791028,0.0185944,0.00037476345,0.00035926956,0.00018791867,0.00018072376,0.00015307374,0.006119115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952773,0.0014953987,0.00014977428,0.00076486496,0.0011064806,0.0012061922],"domain_scores_gemma":[0.94643444,0.04395395,0.002280205,0.003470347,0.0024960074,0.0013651098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052569434,0.0010958737,0.0015298657,0.0028861184,0.002207727,0.0050746556,0.0026383884,0.0021439593,0.007391327],"category_scores_gemma":[0.034231,0.00082507555,0.0010610876,0.0021555515,0.011541573,0.011720616,0.0042225895,0.0055652335,0.0010918935],"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.00013176241,0.000047649835,0.0002711845,0.000107655156,0.000021456479,0.00012266543,0.0003136311,0.062057346,0.001668315,0.9290463,0.0013423512,0.0048696874],"study_design_scores_gemma":[0.000019983385,0.000037218877,0.00019880351,0.000093796516,0.000014973788,0.00009986616,0.00011175853,0.20702529,0.0018158653,0.78913075,0.001387646,0.000063942745],"about_ca_topic_score_codex":0.0019522336,"about_ca_topic_score_gemma":0.0006502285,"teacher_disagreement_score":0.007391327,"about_ca_system_score_codex":0.0041254377,"about_ca_system_score_gemma":0.0022309134,"threshold_uncertainty_score":0.02993226},"labels":[],"label_agreement":null},{"id":"W3000658051","doi":"10.48550/arxiv.2001.02612","title":"Adaptive Coding for Two-Way Lossy Source-Channel Communication","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lossy compression; Channel code; Computer science; Coding (social sciences); Channel (broadcasting); Distributed source coding; Algorithm; Source code; Decoding methods; Theoretical computer science; Mathematics; Telecommunications; Artificial intelligence; Statistics","score_opus":0.11070263680260868,"score_gpt":0.20976415464548154,"score_spread":0.09906151784287286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000658051","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.008643887,0.00015336719,0.98948634,0.0001008596,0.00003208261,0.000019636951,0.000020664032,0.00011027152,0.001432863],"genre_scores_gemma":[0.68174267,0.0005446661,0.31257698,0.00014106782,0.00009321418,0.00019255903,0.00010390773,0.00005004516,0.0045549003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939954,0.00016380515,0.00002403142,0.00007035677,0.00027863713,0.0000635572],"domain_scores_gemma":[0.9989961,0.00048572503,0.00012424088,0.00019621305,0.0001688094,0.000028967544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066248555,0.0006151373,0.00034640796,0.00043630775,0.00036300268,0.00061896996,0.00092976936,0.0005774141,0.0012448077],"category_scores_gemma":[0.0019646185,0.00020807903,0.00026190202,0.0007150467,0.001010816,0.0010191392,0.0014174572,0.0013198094,0.00029653782],"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.00029599425,0.00008274707,0.0005808255,0.00017025862,0.000047788268,0.00028999057,0.00032702606,0.3860149,0.056413885,0.37701634,0.0030099673,0.17575036],"study_design_scores_gemma":[0.00002411946,0.00008086858,0.00016078129,0.000019599522,0.000014952279,0.00018916736,0.00002054455,0.9426812,0.012448126,0.04097016,0.003361946,0.000028517543],"about_ca_topic_score_codex":0.0006161216,"about_ca_topic_score_gemma":0.00073706184,"teacher_disagreement_score":0.0012448077,"about_ca_system_score_codex":0.0005318234,"about_ca_system_score_gemma":0.0005725692,"threshold_uncertainty_score":0.004164338},"labels":[],"label_agreement":null},{"id":"W3004619250","doi":"10.1109/jsyst.2020.2967470","title":"Artificial-Noise-Aided Energy-Efficient Secure Beamforming for Multi-Eavesdroppers in Cognitive Radio Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Graduate Research and Innovation Projects of Jiangsu Province; China Scholarship Council; National Natural Science Foundation of China","keywords":"Artificial noise; Eavesdropping; Computer science; Beamforming; Cognitive radio; Base station; Channel state information; Transmitter power output; Secure transmission; Maximization; Efficient energy use; Secrecy; Convex optimization; Computer network; Mathematical optimization; Wireless; Channel (broadcasting); Transmitter; Telecommunications; Mathematics; Engineering; Electrical engineering; Regular polygon; Encryption; Computer security","score_opus":0.058538028439763176,"score_gpt":0.2823687537131773,"score_spread":0.22383072527341413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004619250","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.015522097,0.00036622648,0.9824767,0.0001040562,0.000023180244,0.000009921648,0.00001006962,0.000047775164,0.0014400424],"genre_scores_gemma":[0.8922803,0.0010680539,0.10402047,0.00013000466,0.000051540595,0.00007390084,0.000040990333,0.000026820915,0.0023078788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993017,0.0002827529,0.000022009512,0.00009030708,0.00019121148,0.00011201298],"domain_scores_gemma":[0.9991573,0.0005789387,0.00007842975,0.00003790709,0.00012226247,0.000025284051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009969558,0.0010556133,0.0007452122,0.00035011233,0.00039089515,0.00080468494,0.0007058501,0.00083183136,0.00052663917],"category_scores_gemma":[0.001991901,0.00038286013,0.0006017628,0.0006259161,0.0010919699,0.0010611254,0.0008303089,0.0007668443,0.00016205152],"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.00006494418,0.000026959038,0.00032451932,0.00005911284,0.00003433079,0.000075374366,0.000060686878,0.95592326,0.005653417,0.021902498,0.00027749856,0.015597421],"study_design_scores_gemma":[0.0000029632556,0.00001618794,0.000029045184,0.0000019289537,0.0000043499626,0.0000112054795,0.000006694001,0.9974706,0.00054303254,0.0018235078,0.0000868961,0.0000035920116],"about_ca_topic_score_codex":0.0025278642,"about_ca_topic_score_gemma":0.0019638322,"teacher_disagreement_score":0.0025278642,"about_ca_system_score_codex":0.00072115613,"about_ca_system_score_gemma":0.00087476603,"threshold_uncertainty_score":0.0052725077},"labels":[],"label_agreement":null},{"id":"W3005412203","doi":"10.1109/tit.2020.2971474","title":"Generalized Gaussian Multiterminal Source Coding: The Symmetric Case","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Distortion (music); Gaussian; Encoder; Coding (social sciences); Distributed source coding; Rate–distortion theory; Source code; Algorithm; Mathematics; Decoding methods; Discrete mathematics; Rate distortion; Computer science; Variable-length code; Theoretical computer science; Topology (electrical circuits); Data compression; Combinatorics; Statistics; Telecommunications; Physics","score_opus":0.017665512023352065,"score_gpt":0.23361914236221765,"score_spread":0.21595363033886558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005412203","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.11936063,0.0006033863,0.8665582,0.0006069799,0.000067208726,0.00008533821,0.00031994932,0.00015374433,0.0122446455],"genre_scores_gemma":[0.9612528,0.00053304795,0.03477916,0.0001340813,0.00007090415,0.00005627239,0.00013148983,0.00002017506,0.0030220686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866855,0.00041649732,0.000044340835,0.00022677697,0.000399969,0.00024389994],"domain_scores_gemma":[0.99669814,0.0015947076,0.0005361464,0.00050031615,0.0005221064,0.00014866669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015796633,0.00077400426,0.0009838659,0.00059648056,0.00038346302,0.001231868,0.0014050697,0.0013844715,0.0017927344],"category_scores_gemma":[0.006112648,0.00029932027,0.0004282078,0.0010755473,0.0014503463,0.0017470339,0.0015030976,0.0009927881,0.0005392817],"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.00028728024,0.000054822696,0.0013570036,0.00020524347,0.000058059908,0.0017126728,0.00022714645,0.59713465,0.006771285,0.3618314,0.0016451436,0.028715236],"study_design_scores_gemma":[0.000032466072,0.000047620517,0.00031695297,0.000018106299,0.000014527135,0.0003875505,0.000044212804,0.8999094,0.0016642853,0.096985325,0.000552769,0.000026858781],"about_ca_topic_score_codex":0.0024766806,"about_ca_topic_score_gemma":0.0021727248,"teacher_disagreement_score":0.0024766806,"about_ca_system_score_codex":0.0012429256,"about_ca_system_score_gemma":0.0010970624,"threshold_uncertainty_score":0.009018064},"labels":[],"label_agreement":null},{"id":"W3005982595","doi":"10.14288/1.0387136","title":"Physical layer security for jamming signal aided multi-antenna communication systems","year":2019,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","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":"University of British Columbia","funders":"","keywords":"Physical layer; Jamming; Computer science; SIGNAL (programming language); Antenna (radio); Telecommunications; Computer security; Physics; Wireless","score_opus":0.012177957177283398,"score_gpt":0.19927316104803502,"score_spread":0.18709520387075163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005982595","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.0071680145,0.0005383825,0.9880114,0.00029377788,0.000040505307,0.000046236328,0.000037492522,0.0000759258,0.0037882724],"genre_scores_gemma":[0.68370754,0.0025246998,0.30659708,0.00039082975,0.00018548369,0.00035034874,0.00020072982,0.000074166484,0.0059691463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980882,0.0008340256,0.00009467206,0.00022462978,0.0006017335,0.00015678276],"domain_scores_gemma":[0.99798775,0.0010045605,0.00030492872,0.0003457078,0.000302776,0.00005430649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022005728,0.0012411991,0.00073287205,0.0003905955,0.0005016687,0.0018620241,0.0006310602,0.0010740504,0.0031968334],"category_scores_gemma":[0.0041950843,0.00044912723,0.00076339487,0.00052508013,0.0011578084,0.0016891429,0.0016007518,0.0018613613,0.0010066201],"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.00028400612,0.000096746655,0.0007037741,0.0005286192,0.00011605845,0.00020329788,0.00021951064,0.63710624,0.030424744,0.23223577,0.0033600584,0.09472117],"study_design_scores_gemma":[0.000027578704,0.00019942845,0.00014475641,0.000051439358,0.000025808265,0.00011723403,0.00003649288,0.9503831,0.005830013,0.039330687,0.0038300669,0.000023416858],"about_ca_topic_score_codex":0.0004007845,"about_ca_topic_score_gemma":0.00041029096,"teacher_disagreement_score":0.0031968334,"about_ca_system_score_codex":0.0009187104,"about_ca_system_score_gemma":0.0011957176,"threshold_uncertainty_score":0.0116378665},"labels":[],"label_agreement":null},{"id":"W3006433578","doi":"10.1109/itw44776.2019.8989345","title":"A Modular Semantically Secure Wiretap Code with Shared Key for Weakly Symmetric Channels","year":2019,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Calgary","funders":"","keywords":"Communication source; Computer science; Secrecy; Decoding methods; Key (lock); Modular design; Encoding (memory); Reliability (semiconductor); Channel (broadcasting); Computer network; Code (set theory); Computer security; Theoretical computer science; Telecommunications; Programming language","score_opus":0.010414383984800475,"score_gpt":0.21940915170186875,"score_spread":0.2089947677170683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006433578","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.047168303,0.00011042147,0.94818896,0.0002892517,0.0000440992,0.00006266303,0.000100125966,0.00016475722,0.00387135],"genre_scores_gemma":[0.813018,0.00039058257,0.18040037,0.00014500524,0.000118936034,0.00032146802,0.0002228624,0.00010538345,0.0052773296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852556,0.00039622557,0.000074359246,0.00019956085,0.0005882337,0.00021605719],"domain_scores_gemma":[0.99640405,0.0016693652,0.00060443167,0.0006602754,0.00048557116,0.00017625596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012769203,0.00079293683,0.00067956466,0.00066433277,0.0006946073,0.0012026741,0.0010050485,0.0010450926,0.0017184165],"category_scores_gemma":[0.005703822,0.00034213017,0.0006888827,0.0009646735,0.0026796383,0.002431978,0.0030670494,0.0017338373,0.000584238],"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.00020907223,0.000033941807,0.0003454172,0.00013088285,0.000027381788,0.00039012145,0.00027733043,0.109008156,0.012313519,0.8546784,0.0013209123,0.021264857],"study_design_scores_gemma":[0.0000678013,0.00023536396,0.00016655475,0.0000566278,0.000033466433,0.00036311348,0.000065448585,0.6304764,0.018128933,0.3458366,0.0045126444,0.00005695596],"about_ca_topic_score_codex":0.00043752982,"about_ca_topic_score_gemma":0.00034872792,"teacher_disagreement_score":0.0017184165,"about_ca_system_score_codex":0.00084833655,"about_ca_system_score_gemma":0.0012145361,"threshold_uncertainty_score":0.006753087},"labels":[],"label_agreement":null},{"id":"W3013736034","doi":"10.1109/ccnc46108.2020.9045329","title":"Deep Learning Decoder for MIMO Communications with Impulsive Noise","year":2020,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Computer science; MIMO; Noise (video); Decoding methods; 3G MIMO; Electronic engineering; Telecommunications; Artificial intelligence; Speech recognition; Engineering; Beamforming","score_opus":0.02193850686667621,"score_gpt":0.2564804380440819,"score_spread":0.23454193117740568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013736034","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.025103891,0.0002773938,0.97135377,0.00017418974,0.000028558015,0.000018918336,0.000081242644,0.00029460737,0.002667427],"genre_scores_gemma":[0.85683024,0.00035868902,0.13675097,0.00019321912,0.000042903383,0.000059252474,0.00018604948,0.000045884462,0.0055327625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962664,0.00010067309,0.000017562463,0.00005982292,0.00013775413,0.0000575166],"domain_scores_gemma":[0.9990466,0.000645749,0.00006222133,0.00006301279,0.00015623118,0.000026233743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007531142,0.00047368454,0.00056389836,0.0002465521,0.00021577632,0.00055455783,0.0005365287,0.0006578633,0.0013087247],"category_scores_gemma":[0.0024918718,0.00023241388,0.00027115177,0.0003403435,0.00056995597,0.0007575636,0.0006250029,0.00085416855,0.00026392087],"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.000053100808,0.000019719551,0.00034231629,0.00004677958,0.000017896014,0.000053215987,0.000027678372,0.9542709,0.0024902117,0.021773433,0.0004522073,0.020452565],"study_design_scores_gemma":[0.0000020307357,0.000011134174,0.000031822296,0.0000019940235,0.0000019069121,0.000009260022,0.0000020450611,0.996847,0.000782312,0.0021651783,0.00014363302,0.000001735159],"about_ca_topic_score_codex":0.004268666,"about_ca_topic_score_gemma":0.005003896,"teacher_disagreement_score":0.004268666,"about_ca_system_score_codex":0.00085834105,"about_ca_system_score_gemma":0.0013309789,"threshold_uncertainty_score":0.008487642},"labels":[],"label_agreement":null},{"id":"W3014980692","doi":"10.1109/ccece43985.2019.9052395","title":"Secrecy Based Resource Allocation for D2D Communication Using Tabu Search Algorithm","year":2019,"lang":"en","type":"article","venue":"","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":"Polytechnique Montréal","funders":"","keywords":"Subcarrier; Computer science; Tabu search; Spectral efficiency; Resource allocation; Cellular network; Physical layer; Computer network; Heuristic; Wireless; Radio resource management; Optimization problem; Secrecy; Distributed computing; Wireless network; Algorithm; Orthogonal frequency-division multiplexing; Channel (broadcasting); Telecommunications","score_opus":0.02639796671415485,"score_gpt":0.27798565725433466,"score_spread":0.2515876905401798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014980692","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.05892896,0.0019054126,0.926188,0.00047933398,0.00009296957,0.00021146554,0.00028373473,0.00061542116,0.011294711],"genre_scores_gemma":[0.66423965,0.00075785787,0.3297622,0.00025765656,0.00003311521,0.00043891597,0.000383001,0.00011279931,0.004014863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995871,0.00018619969,0.00001662683,0.000057332894,0.000072498515,0.00008022827],"domain_scores_gemma":[0.9991793,0.00058237626,0.00006904695,0.000031023137,0.0000987689,0.000039414776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085444126,0.00095521886,0.0012303547,0.0012057419,0.00067951065,0.0010957823,0.0011278527,0.0011523548,0.004522024],"category_scores_gemma":[0.0020257295,0.00046252666,0.0007657504,0.0016309595,0.0006084246,0.0008513697,0.00087043707,0.0007186575,0.00044262438],"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.000042085572,0.000032298853,0.00042066857,0.00004780477,0.000029013232,0.000035012494,0.000024501636,0.97913146,0.00035055698,0.002993781,0.00085846294,0.016034346],"study_design_scores_gemma":[0.000016314994,0.000014990639,0.00005256564,0.000006070674,0.0000056854005,0.000010613413,0.000014662987,0.9977882,0.00012890865,0.0016743981,0.00028448526,0.0000030637225],"about_ca_topic_score_codex":0.008842653,"about_ca_topic_score_gemma":0.006801335,"teacher_disagreement_score":0.008842653,"about_ca_system_score_codex":0.0010749272,"about_ca_system_score_gemma":0.0022000587,"threshold_uncertainty_score":0.017582357},"labels":[],"label_agreement":null},{"id":"W3015227276","doi":"10.1177/1550147720916384","title":"An efficient emerging network and secured hopping scheme employed over the unsecured public channels","year":2020,"lang":"en","type":"article","venue":"International Journal of Distributed Sensor Networks","topic":"Wireless Communication Security 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":"École de Technologie Supérieure","funders":"Ministry of Science and ICT, South Korea","keywords":"Computer science; Jamming; Wireless; Secrecy; Computer network; Frequency-hopping spread spectrum; Computer security; Channel (broadcasting); Wireless network; Telecommunications","score_opus":0.017402418023203577,"score_gpt":0.2563081959770682,"score_spread":0.23890577795386464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015227276","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.20822437,0.0005885122,0.7795295,0.0003054555,0.0001334575,0.00011602244,0.000081941165,0.00026909658,0.0107517],"genre_scores_gemma":[0.9680713,0.00021386967,0.029181212,0.000033398643,0.000022579823,0.000035174882,0.000028821565,0.000006020502,0.0024075168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973243,0.00006628326,0.000012681462,0.00006089883,0.00008758332,0.000040106097],"domain_scores_gemma":[0.9997013,0.000072193274,0.000056972225,0.000082426785,0.000067146204,0.000019923216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025735266,0.00025220186,0.00021208587,0.00034577594,0.00033258778,0.00042098676,0.00047012232,0.0003905197,0.001183468],"category_scores_gemma":[0.00073926605,0.00008901945,0.00020847181,0.00036677587,0.0005424928,0.0007926819,0.00059384253,0.0003225155,0.0002757133],"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.00078398077,0.0001897419,0.0024232653,0.0004114984,0.00009809386,0.0009768661,0.0006192508,0.22005066,0.21940112,0.3713961,0.0021595834,0.18148969],"study_design_scores_gemma":[0.000054214164,0.0005085208,0.0007545941,0.000036854537,0.000040319755,0.000759555,0.00011399613,0.91990054,0.040167414,0.03045302,0.007161927,0.000049038055],"about_ca_topic_score_codex":0.00043926638,"about_ca_topic_score_gemma":0.00036053726,"teacher_disagreement_score":0.001183468,"about_ca_system_score_codex":0.0003037427,"about_ca_system_score_gemma":0.000435691,"threshold_uncertainty_score":0.0039591193},"labels":[],"label_agreement":null},{"id":"W3015787955","doi":"10.48550/arxiv.2004.03954","title":"A Simple Capacity Outer Bound for Two-Way Channels and Capacity Approximation Results","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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); Coding (social sciences); Simple (philosophy); Channel (broadcasting); Computation; Mathematics; Computer science; Algorithm; Mathematical analysis; Statistics; Geometry; Telecommunications","score_opus":0.11603019044745722,"score_gpt":0.2121868979237297,"score_spread":0.09615670747627247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015787955","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.020430604,0.0010401245,0.95725834,0.0004363394,0.00012595984,0.00008707784,0.00019192592,0.00036419422,0.020065391],"genre_scores_gemma":[0.801109,0.0019965097,0.18862687,0.0004348846,0.00033108928,0.0004358676,0.0004326258,0.00040363136,0.0062295296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99638844,0.00094389863,0.00013962443,0.00041996763,0.0015332353,0.0005747834],"domain_scores_gemma":[0.9820379,0.013093849,0.0009957809,0.002067519,0.0014900062,0.00031494297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003488702,0.0016437209,0.0013616547,0.0021313182,0.0011248839,0.0023685552,0.002109188,0.0013913434,0.006122981],"category_scores_gemma":[0.024888799,0.0005085689,0.0014376903,0.0026847634,0.0045942934,0.0057919263,0.0031085976,0.004330632,0.001104848],"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.00020955545,0.00010198629,0.00071331963,0.00030992329,0.000053735876,0.00025068715,0.0002962733,0.25246102,0.00989356,0.70167536,0.0035262888,0.030508393],"study_design_scores_gemma":[0.000014145873,0.000058913214,0.00029997178,0.000063148735,0.00002267809,0.00021284363,0.00005476222,0.68526405,0.010659329,0.3006681,0.0026135764,0.000068524685],"about_ca_topic_score_codex":0.0015786325,"about_ca_topic_score_gemma":0.0008950112,"teacher_disagreement_score":0.006122981,"about_ca_system_score_codex":0.0020349137,"about_ca_system_score_gemma":0.001501073,"threshold_uncertainty_score":0.020483375},"labels":[],"label_agreement":null},{"id":"W3017308685","doi":"10.1109/tcomm.2020.2987565","title":"Lattice-Based Robust Distributed Source Coding for Three Correlated Sources","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gaussian; Rate distortion; Distributed source coding; Lattice (music); Degenerate energy levels; Coding (social sciences); Rate–distortion theory; Mathematics; Algorithm; Quadratic equation; Source code; Gaussian process; Computer science; Statistical physics; Decoding methods; Theoretical computer science; Applied mathematics; Channel code; Physics; Statistics; Quantum mechanics; Geometry","score_opus":0.06467019300070098,"score_gpt":0.2588014935177366,"score_spread":0.19413130051703564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017308685","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.018163078,0.00022613401,0.97969717,0.00021863737,0.000025865726,0.000028335347,0.000049244405,0.00012519,0.0014662957],"genre_scores_gemma":[0.7254981,0.00028082615,0.27165103,0.00012922242,0.000034900084,0.00010249247,0.00014738351,0.000040408395,0.002115514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791676,0.00088213815,0.00007950926,0.00020816583,0.000739624,0.00017393885],"domain_scores_gemma":[0.99653566,0.0020633154,0.0004683333,0.00037850798,0.00040375086,0.00015038156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002663888,0.00067228364,0.0016033326,0.00059274695,0.00053415087,0.0012831913,0.0018003561,0.0014443988,0.0010307442],"category_scores_gemma":[0.005263221,0.00036377626,0.00086436974,0.0011901944,0.0019301231,0.0016451401,0.002700972,0.0018395756,0.00036668323],"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.00038995306,0.000057950514,0.00026839523,0.0001357595,0.000059168655,0.00021153352,0.000117837575,0.8065516,0.013272238,0.13358055,0.00074690836,0.04460816],"study_design_scores_gemma":[0.00002200037,0.000027038192,0.000020167046,0.0000063181556,0.000004215491,0.000041264,0.000009043076,0.98519045,0.0020180782,0.012450385,0.00019423233,0.000016804926],"about_ca_topic_score_codex":0.0014065987,"about_ca_topic_score_gemma":0.0007834951,"teacher_disagreement_score":0.002663888,"about_ca_system_score_codex":0.0014607753,"about_ca_system_score_gemma":0.0015583816,"threshold_uncertainty_score":0.014088213},"labels":[],"label_agreement":null},{"id":"W3029883195","doi":"10.1109/tcomm.2020.2997401","title":"Security Enhancement via Antenna Selection in MIMOME Channels With Discrete Inputs","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":14,"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 British Columbia","funders":"National Natural Science Foundation of China","keywords":"Rayleigh fading; QAM; Quadrature amplitude modulation; Computer science; Antenna (radio); Channel (broadcasting); Topology (electrical circuits); Artificial noise; Communications system; Electronic engineering; Fading; Telecommunications; Bit error rate; Mathematics; Engineering; Transmitter","score_opus":0.021637268988591363,"score_gpt":0.25126453838190155,"score_spread":0.22962726939331018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029883195","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.20497419,0.0008739532,0.78591394,0.00030326893,0.00005768845,0.000019348048,0.00008389722,0.00019676676,0.0075769788],"genre_scores_gemma":[0.9864811,0.0005306135,0.012200637,0.00003856283,0.000029013963,0.00001208253,0.000019142853,0.000007760331,0.0006809698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990939,0.00045431283,0.000032601674,0.00009949025,0.00020851933,0.000111179346],"domain_scores_gemma":[0.9974154,0.0018001565,0.00030379137,0.0002710979,0.0001648352,0.00004476792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087117474,0.0005785313,0.000477755,0.00022625804,0.000293086,0.0007592298,0.00039472908,0.00045275176,0.0006372107],"category_scores_gemma":[0.0028004115,0.00021186678,0.00030633097,0.0005218484,0.0010577359,0.0007463707,0.0008455979,0.0005634481,0.00019302996],"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.00064793456,0.00004734352,0.0038743683,0.00028426846,0.00009074239,0.00089760823,0.0003461228,0.72961855,0.090582706,0.121832386,0.0008432167,0.05093473],"study_design_scores_gemma":[0.000013309056,0.00019718539,0.00088844483,0.000031235166,0.000035888526,0.00037097168,0.00006360607,0.9631539,0.019696204,0.014558535,0.00096342666,0.000027289769],"about_ca_topic_score_codex":0.00024718975,"about_ca_topic_score_gemma":0.00032984253,"teacher_disagreement_score":0.00087117474,"about_ca_system_score_codex":0.00031549312,"about_ca_system_score_gemma":0.00031295072,"threshold_uncertainty_score":0.00460732},"labels":[],"label_agreement":null},{"id":"W3030674378","doi":"","title":"Secret Keys from Channel Noise.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","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":"University of Calgary","funders":"","keywords":"Computer science; Randomness; Initialization; Channel (broadcasting); Upper and lower bounds; Binary symmetric channel; Alice and Bob; Key (lock); Computer network; Protocol (science); Binary number; Computer security; Verifiable secret sharing; Adversary; Theoretical computer science; Channel capacity; Alice (programming language); Mathematics; Arithmetic; Statistics; Set (abstract data type)","score_opus":0.026329738865295677,"score_gpt":0.24071884263436844,"score_spread":0.21438910376907275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030674378","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.03992916,0.002403751,0.8916509,0.0033422448,0.0005055994,0.00014678392,0.0006250504,0.0004261573,0.060970385],"genre_scores_gemma":[0.92568004,0.0021564646,0.0477124,0.00071002665,0.0004473756,0.00043358983,0.0004906749,0.00013431147,0.022235138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956754,0.0014789394,0.00016492358,0.00067057816,0.0014605144,0.0005497217],"domain_scores_gemma":[0.98081857,0.014395162,0.0013073775,0.0022881057,0.0008842068,0.00030658775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003101458,0.0011605275,0.0013477004,0.0008965356,0.001315203,0.003638119,0.0016333394,0.0028846764,0.008844462],"category_scores_gemma":[0.018782387,0.000657403,0.00071581133,0.0013598301,0.003565796,0.0069053657,0.0035282266,0.003553924,0.002065081],"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.00028920476,0.00003911673,0.00043642716,0.00036691283,0.00006713482,0.0002515167,0.00013527105,0.08144043,0.0049718427,0.8902339,0.004462515,0.01730574],"study_design_scores_gemma":[0.000074092415,0.000079360485,0.00033531588,0.00014463712,0.00005598115,0.00052573526,0.00008076721,0.30906457,0.008610894,0.6691868,0.011789311,0.00005261435],"about_ca_topic_score_codex":0.0004117307,"about_ca_topic_score_gemma":0.00035345124,"teacher_disagreement_score":0.008844462,"about_ca_system_score_codex":0.0018535067,"about_ca_system_score_gemma":0.0015607377,"threshold_uncertainty_score":0.029587686},"labels":[],"label_agreement":null},{"id":"W3033035734","doi":"10.1109/lwc.2020.2999333","title":"Dynamic Spectrum Anti-Jamming in Broadband Communications: A Hierarchical Deep Reinforcement Learning Approach","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Jamming; Computer science; Reinforcement learning; Frequency band; Frequency-hopping spread spectrum; Selection (genetic algorithm); Broadband; Convergence (economics); Throughput; Q-learning; Telecommunications; Algorithm; Artificial intelligence; Wireless; Bandwidth (computing)","score_opus":0.02210946267116902,"score_gpt":0.2529385481066058,"score_spread":0.2308290854354368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033035734","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.0347837,0.0003110804,0.9616479,0.0002574428,0.000031106007,0.0000237457,0.000014745798,0.00023768096,0.0026925039],"genre_scores_gemma":[0.94690865,0.00016626022,0.050575867,0.00015703955,0.000035115292,0.000046166722,0.00002561181,0.00002089494,0.002064313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976283,0.00006887972,0.000009393105,0.00004733921,0.000052142354,0.000059295526],"domain_scores_gemma":[0.99953675,0.00023090446,0.00006823674,0.000028108656,0.000094992916,0.00004100345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005612698,0.0005131163,0.0006728826,0.00028265023,0.00031496573,0.00045016257,0.0009497151,0.00073705416,0.0010441213],"category_scores_gemma":[0.001234401,0.00027062953,0.0002684273,0.00025002268,0.00058130745,0.0006266978,0.0006912612,0.00093463744,0.00014525285],"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.000053986576,0.000053047203,0.00076061254,0.000034174314,0.000031048035,0.000057964007,0.000047379282,0.94505394,0.002214104,0.006201918,0.00066263555,0.044829056],"study_design_scores_gemma":[0.0000024126798,0.000011348586,0.000032925996,0.0000012572929,0.0000024320386,0.0000039798856,0.000002413637,0.9990088,0.00009717274,0.0007647775,0.00007123256,0.0000012981689],"about_ca_topic_score_codex":0.005815646,"about_ca_topic_score_gemma":0.0044661765,"teacher_disagreement_score":0.005815646,"about_ca_system_score_codex":0.00061397435,"about_ca_system_score_gemma":0.0007690401,"threshold_uncertainty_score":0.011563599},"labels":[],"label_agreement":null},{"id":"W3033929564","doi":"10.1049/el.2020.1684","title":"Comments on ‘Precoding for secrecy rate maximisation in cognitive MIMO wiretap channels’","year":2020,"lang":"en","type":"article","venue":"Electronics Letters","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 Ottawa","funders":"","keywords":"Secrecy; Precoding; MIMO; Convex optimization; Channel (broadcasting); Sequence (biology); Regular polygon; Computer science; Solver; Mathematical optimization; Mathematics; Algorithm; Telecommunications; Computer security","score_opus":0.03851036138574388,"score_gpt":0.2626988503597801,"score_spread":0.2241884889740362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033929564","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005892817,0.0047110873,0.004526549,0.9249373,0.061055344,0.000023889546,0.00040097896,0.00017343117,0.0035821323],"genre_scores_gemma":[0.015809583,0.0032901093,0.0043072286,0.90637106,0.06051429,0.00009480684,0.00011599626,0.00020115008,0.009295761],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.988901,0.0032755332,0.001303909,0.0016776118,0.004061965,0.00077992096],"domain_scores_gemma":[0.9629298,0.023658186,0.0019059418,0.0011857612,0.009657608,0.0006626518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009315283,0.0013929224,0.0014007484,0.0009759473,0.002421788,0.0026320706,0.0058033075,0.021841154,0.007656522],"category_scores_gemma":[0.060732506,0.00074033625,0.0016047606,0.0013944568,0.0054555372,0.005267562,0.0021058384,0.023503214,0.007958587],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00006902284,0.0000136149365,0.00016650336,0.00018452208,0.000016166226,0.00026084896,0.0003326752,0.0004614333,0.0002935437,0.018597811,0.97460073,0.0050031827],"study_design_scores_gemma":[0.00006336329,0.00008725624,0.0015820668,0.0005088512,0.00004538959,0.00065647083,0.00040903667,0.00309743,0.0018434284,0.05321692,0.9382502,0.000239498],"about_ca_topic_score_codex":0.012461336,"about_ca_topic_score_gemma":0.0075134644,"teacher_disagreement_score":0.021841154,"about_ca_system_score_codex":0.0036995923,"about_ca_system_score_gemma":0.003460433,"threshold_uncertainty_score":0.04926449},"labels":[],"label_agreement":null},{"id":"W3044105291","doi":"10.1109/tsp.2020.3010451","title":"Algorithms for Globally-Optimal Secure Signaling Over Gaussian MIMO Wiretap Channels Under Interference Constraints","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"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 Ottawa","funders":"","keywords":"MIMO; Transmitter power output; Mathematical optimization; Covariance matrix; Computer science; Covariance; Constraint (computer-aided design); Channel (broadcasting); Convergence (economics); Gaussian; Mathematics; Algorithm; Telecommunications; Transmitter","score_opus":0.040297310458064804,"score_gpt":0.2803710837485797,"score_spread":0.2400737732905149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044105291","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.004152418,0.00012846098,0.99345,0.00009503932,0.00001950708,0.000033442593,0.000031362408,0.00014511557,0.0019446112],"genre_scores_gemma":[0.46337256,0.0009281539,0.52741235,0.00014445646,0.00009920037,0.0004631337,0.0003480244,0.00021819556,0.007013879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999498,0.00015480258,0.00002702212,0.00009114202,0.00012829815,0.00010060792],"domain_scores_gemma":[0.9983575,0.0011012171,0.00016016068,0.00010051344,0.00022251616,0.000057974834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011997552,0.0017119651,0.0016822648,0.0005996653,0.00054615334,0.0015170375,0.0012613307,0.0016967746,0.0035609894],"category_scores_gemma":[0.003096825,0.0006132915,0.00086071854,0.0010637373,0.0012391643,0.0013103373,0.0017644437,0.0020088358,0.00092493003],"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.000067623696,0.00002165648,0.00016561386,0.0000830904,0.00002149465,0.00006854923,0.00008406327,0.9345333,0.0014882153,0.03014456,0.00094888284,0.032373007],"study_design_scores_gemma":[0.000011181625,0.00002916538,0.000024503144,0.000009815377,0.000004482742,0.000021511765,0.000018875426,0.98908293,0.00059569936,0.009881917,0.00031317127,0.000006849415],"about_ca_topic_score_codex":0.0029483738,"about_ca_topic_score_gemma":0.003373958,"teacher_disagreement_score":0.0035609894,"about_ca_system_score_codex":0.0011124432,"about_ca_system_score_gemma":0.0024439155,"threshold_uncertainty_score":0.0119127035},"labels":[],"label_agreement":null},{"id":"W3046608666","doi":"10.1109/tifs.2020.3013210","title":"Secure Interference Exploitation Precoding in MISO Wiretap Channel: Destructive Region Redefinition With Efficient Solutions","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":23,"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 British Columbia","funders":"Key Science and Technology Program of Shaanxi Province; Fundamental Research Funds for the Central Universities; Southeast University","keywords":"Precoding; Computer science; Zero-forcing precoding; Karush–Kuhn–Tucker conditions; Artificial noise; Channel state information; Channel (broadcasting); Convex optimization; Transmitter power output; MIMO; Optimization problem; Interference (communication); Transmitter; Mathematical optimization; Algorithm; Regular polygon; Wireless; Mathematics; Computer network; Telecommunications","score_opus":0.02736995863524533,"score_gpt":0.20817561818918356,"score_spread":0.18080565955393824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046608666","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.0071160193,0.0003062369,0.9877341,0.00013858973,0.00002926627,0.00002811886,0.000021321272,0.00006870006,0.004557689],"genre_scores_gemma":[0.6107853,0.0019761377,0.37795857,0.0003012891,0.00017880827,0.00029504913,0.00012499673,0.00009626675,0.008283528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993407,0.00022841539,0.000024301999,0.0000877831,0.0002307302,0.00008801965],"domain_scores_gemma":[0.99928844,0.00036272625,0.000089642104,0.00010540334,0.00011862428,0.000034997418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008844357,0.0013068999,0.00071484677,0.0004270043,0.0003485677,0.0010331894,0.00090437004,0.00092083775,0.0018177001],"category_scores_gemma":[0.0018692111,0.0003128266,0.00050034706,0.0007099816,0.0012224329,0.0011011305,0.0017363391,0.0015102273,0.00055070635],"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.00017509844,0.00008534007,0.00050712144,0.00023399934,0.00007637166,0.00038249613,0.00031985503,0.55478287,0.02362085,0.3237655,0.0032098843,0.09284065],"study_design_scores_gemma":[0.000013565122,0.000058752554,0.000056485078,0.000017931028,0.000010824437,0.000120499986,0.000039987623,0.96610314,0.0038506384,0.027843084,0.0018716548,0.0000134331785],"about_ca_topic_score_codex":0.00048141793,"about_ca_topic_score_gemma":0.00055527827,"teacher_disagreement_score":0.0018177001,"about_ca_system_score_codex":0.0005231981,"about_ca_system_score_gemma":0.0006885664,"threshold_uncertainty_score":0.0060808063},"labels":[],"label_agreement":null},{"id":"W3048207934","doi":"10.48550/arxiv.2008.02977","title":"A Channel Model of Transceivers for Multiterminal Secret Key Agreement","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"University of Calgary","funders":"","keywords":"Channel (broadcasting); Key (lock); Transceiver; Computer science; Terminal (telecommunication); Variable (mathematics); Random variable; Channel capacity; Shared secret; Computer network; Telecommunications; Mathematics; Wireless; Computer security; Statistics","score_opus":0.12378915752634118,"score_gpt":0.20296951387982906,"score_spread":0.07918035635348789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048207934","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.016139226,0.00020077277,0.97299284,0.00068288133,0.00007171415,0.00006882517,0.00020129808,0.00015554873,0.009486916],"genre_scores_gemma":[0.8696765,0.0010561314,0.108723335,0.00055218156,0.00030896784,0.00063575414,0.0003056179,0.00012465916,0.018616877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977381,0.0007879971,0.00008985265,0.00041968114,0.00063434354,0.00033010793],"domain_scores_gemma":[0.9964761,0.0021689096,0.00039119268,0.0004451404,0.00037096872,0.00014765575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001801401,0.001091528,0.0010132988,0.0007714516,0.0010815946,0.002405266,0.0022890782,0.0022825394,0.005277908],"category_scores_gemma":[0.004396949,0.00069445604,0.0009869598,0.0011998668,0.0022420732,0.0043367473,0.0020306895,0.0033047695,0.0013011185],"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.00012815499,0.00008482111,0.00036840638,0.00011739858,0.000034611236,0.0006215978,0.0002755789,0.2539356,0.0054767528,0.7307389,0.0028564893,0.0053616976],"study_design_scores_gemma":[0.00003544133,0.00008960344,0.00010766533,0.000023248023,0.000024154278,0.0002096031,0.000054102115,0.86039335,0.0015196876,0.13444434,0.0030618624,0.000036958423],"about_ca_topic_score_codex":0.0015881124,"about_ca_topic_score_gemma":0.0013540792,"teacher_disagreement_score":0.005277908,"about_ca_system_score_codex":0.0021506965,"about_ca_system_score_gemma":0.0015851031,"threshold_uncertainty_score":0.017656326},"labels":[],"label_agreement":null},{"id":"W3080483966","doi":"10.1109/isit44484.2020.9174376","title":"The Asymptotic Generalized Poor-Verdú Bound Achieves the BSC Error Exponent at Zero Rate","year":2020,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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":"Upper and lower bounds; Exponent; Mathematics; Zero (linguistics); Binary symmetric channel; Binary number; Function (biology); Decoding methods; Applied mathematics; Combinatorics; Mathematical analysis; Channel code; Statistics; Arithmetic","score_opus":0.028453955979787806,"score_gpt":0.24261473796017344,"score_spread":0.21416078198038563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080483966","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.04357942,0.0049052364,0.90839636,0.002665136,0.00046652794,0.00013278436,0.00058227987,0.0007874397,0.038484804],"genre_scores_gemma":[0.8680469,0.003686485,0.115274325,0.0020599894,0.0008957557,0.0006042909,0.00056922494,0.00037428393,0.008488851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927071,0.002299212,0.00034017625,0.0009860544,0.0024821672,0.0011852406],"domain_scores_gemma":[0.9623431,0.024672164,0.0018248872,0.005198144,0.0051762094,0.0007856114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007909099,0.0027303551,0.0026614708,0.0046594315,0.0017082414,0.0034944408,0.0036349485,0.002920788,0.005872299],"category_scores_gemma":[0.0590037,0.00060209556,0.0013499768,0.0035383971,0.006630203,0.0065731234,0.005068225,0.004858886,0.0017144115],"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.00026710992,0.000046624555,0.0012123069,0.00039294534,0.000099519515,0.0003295129,0.00019826918,0.10815277,0.0043896944,0.8329534,0.00999481,0.041963026],"study_design_scores_gemma":[0.000033566583,0.00017833394,0.00075844605,0.00020345235,0.00006198222,0.0006804731,0.00009016149,0.396862,0.0053420267,0.5914572,0.0042224247,0.00010995063],"about_ca_topic_score_codex":0.0018884148,"about_ca_topic_score_gemma":0.0017128305,"teacher_disagreement_score":0.007909099,"about_ca_system_score_codex":0.003906771,"about_ca_system_score_gemma":0.0028832392,"threshold_uncertainty_score":0.041827857},"labels":[],"label_agreement":null},{"id":"W3080854183","doi":"10.1109/isit44484.2020.9174385","title":"New Formulas of Ergodic Feedback Capacity of AGN Channels Driven by Stable and Unstable Autoregressive Noise","year":2020,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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 Ottawa","funders":"","keywords":"Ergodicity; Autoregressive model; Ergodic theory; Noise (video); Gaussian noise; Invariant (physics); Gaussian; Channel (broadcasting); Control theory (sociology); Channel capacity; Mathematics; Applied mathematics; Statistical physics; Computer science; Physics; Statistics; Pure mathematics; Telecommunications; Algorithm; Control (management)","score_opus":0.017948708747065133,"score_gpt":0.21343209773102878,"score_spread":0.19548338898396364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080854183","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.10862038,0.00200429,0.8558953,0.0006202272,0.00012690356,0.00006034346,0.00040862893,0.00032784132,0.031936184],"genre_scores_gemma":[0.97403437,0.0010872808,0.020594224,0.00019756432,0.00020458098,0.00011901973,0.00013908382,0.00011760731,0.003506314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990476,0.00023911931,0.000050684233,0.00015652647,0.00033254578,0.000173467],"domain_scores_gemma":[0.99319106,0.0049531916,0.00064077694,0.0002500759,0.00075397355,0.00021094519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016783806,0.00082400144,0.0005142772,0.0017768398,0.0003292001,0.0011375812,0.0009598383,0.0007812447,0.00433761],"category_scores_gemma":[0.010966624,0.00025545075,0.00055539445,0.00077422074,0.0018227865,0.0028062807,0.0010967029,0.0013736901,0.00035675208],"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.00009900673,0.00005855838,0.001363764,0.0003039764,0.000058311278,0.0003550492,0.00034636687,0.2315097,0.011807949,0.7377722,0.0015050974,0.014819982],"study_design_scores_gemma":[0.000012264287,0.0000536803,0.0010010859,0.00007341314,0.000030820065,0.00029674257,0.00007871395,0.7902235,0.003788658,0.20280561,0.0015751553,0.000060447703],"about_ca_topic_score_codex":0.00083646295,"about_ca_topic_score_gemma":0.0006086737,"teacher_disagreement_score":0.00433761,"about_ca_system_score_codex":0.0014569777,"about_ca_system_score_gemma":0.0006181526,"threshold_uncertainty_score":0.014510751},"labels":[],"label_agreement":null},{"id":"W3080863193","doi":"10.1109/isit44484.2020.9173946","title":"Adaptive Coding for Two-Way Lossy Source-Channel Communication","year":2020,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"Queen's University","funders":"","keywords":"Lossy compression; Channel code; Computer science; Coding (social sciences); Channel (broadcasting); Distributed source coding; Decoding methods; Source code; Algorithm; Transmission (telecommunications); Theoretical computer science; Electronic engineering; Computer network; Telecommunications; Mathematics; Artificial intelligence; Engineering; Statistics","score_opus":0.046313401518249454,"score_gpt":0.262967623144533,"score_spread":0.21665422162628353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080863193","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.007271227,0.00016269047,0.9910466,0.0000842193,0.00003322003,0.00002167961,0.000018495373,0.00012047267,0.0012413377],"genre_scores_gemma":[0.68395126,0.0005822212,0.31100327,0.00013941868,0.000093546034,0.0001993503,0.00010429864,0.00004457657,0.0038821225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994136,0.00015289937,0.000024326055,0.00006484721,0.00027704568,0.00006738794],"domain_scores_gemma":[0.9990639,0.00043367106,0.00012395733,0.00016626365,0.00018217543,0.000030013414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006597935,0.0006267584,0.00035860398,0.0004551443,0.00039040062,0.0005849177,0.0009776438,0.0005756456,0.0011779469],"category_scores_gemma":[0.0018122767,0.00021172683,0.00027993968,0.00073633104,0.00096594123,0.00096338073,0.0012696553,0.0012537643,0.00028095735],"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.00032164666,0.00009117216,0.0006401364,0.00020418596,0.000053601794,0.0003474687,0.0003475086,0.41806883,0.064998046,0.31064278,0.003539769,0.20074475],"study_design_scores_gemma":[0.000025858231,0.000097545984,0.00016703825,0.000021521724,0.000016677426,0.0002094296,0.000018833014,0.95805186,0.012854159,0.025212666,0.0032919133,0.00003256745],"about_ca_topic_score_codex":0.0008222606,"about_ca_topic_score_gemma":0.0010431544,"teacher_disagreement_score":0.0011779469,"about_ca_system_score_codex":0.0005612155,"about_ca_system_score_gemma":0.0006850541,"threshold_uncertainty_score":0.004071951},"labels":[],"label_agreement":null},{"id":"W3086497262","doi":"10.1186/s13638-021-02065-4","title":"An overview of generic tools for information-theoretic secrecy performance analysis over wiretap fading channels","year":2021,"lang":"en","type":"review","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Fonds National de la Recherche Luxembourg; Université du Luxembourg","keywords":"Fading; Computer science; Physical layer; Secrecy; Eavesdropping; Wireless; Computer network; Transmission (telecommunications); Cryptography; Wireless security; Computer security; Channel (broadcasting); Telecommunications; Wireless network","score_opus":0.13185284955062115,"score_gpt":0.3630556364647774,"score_spread":0.23120278691415624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086497262","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033641548,0.014328227,0.97080934,0.00028690402,0.00014239682,0.00007460509,0.00023752674,0.00033074312,0.010426174],"genre_scores_gemma":[0.520482,0.08916707,0.38045493,0.00078025245,0.0022588135,0.00093004975,0.0009242556,0.00037347715,0.0046291207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972441,0.0013011965,0.00024738107,0.0002968205,0.00072507776,0.00018539654],"domain_scores_gemma":[0.99283046,0.0043621003,0.0007163132,0.0011168115,0.0008601564,0.0001142198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038459422,0.0025784357,0.0013965832,0.005921221,0.00048997294,0.0028988076,0.001725281,0.0013824003,0.0022766558],"category_scores_gemma":[0.010384447,0.00070784905,0.0016612667,0.005583493,0.002491789,0.0037303981,0.0019608028,0.0038893174,0.0013993498],"study_design_candidate":"not_applicable","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.000050084836,0.00012928998,0.001513061,0.0008732253,0.00014423835,0.00047559565,0.0002766627,0.17484146,0.0042829583,0.73405784,0.0055694343,0.07778632],"study_design_scores_gemma":[0.000007977296,0.000110883724,0.0009878469,0.0005370229,0.00006117931,0.0004254765,0.00011165646,0.6856413,0.0023922033,0.2890061,0.020623572,0.00009480734],"about_ca_topic_score_codex":0.0014479588,"about_ca_topic_score_gemma":0.0005113347,"teacher_disagreement_score":0.005921221,"about_ca_system_score_codex":0.0016264499,"about_ca_system_score_gemma":0.00088546355,"threshold_uncertainty_score":0.020339549},"labels":[],"label_agreement":null},{"id":"W3088483589","doi":"10.1109/lcomm.2020.3025903","title":"Physical Layer Security Over Mixture Gamma Distributed Fading Channels With Discrete Inputs: A Unified and General Analytical Framework","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Fading; Computer science; Physical layer; Secrecy; Gaussian; Signal-to-noise ratio (imaging); Algorithm; Channel (broadcasting); Applied mathematics; Topology (electrical circuits); Mathematics; Telecommunications; Wireless","score_opus":0.023026879415238108,"score_gpt":0.2733684997219714,"score_spread":0.2503416203067333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088483589","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.025153127,0.0008561561,0.9644893,0.0003761698,0.000045101948,0.000031766976,0.00006957589,0.0001610011,0.008817831],"genre_scores_gemma":[0.94617045,0.0023431354,0.047352865,0.00016825633,0.00013576937,0.00007430344,0.00004948119,0.000057052304,0.0036487405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870396,0.0004980644,0.000048768186,0.00014128751,0.00041048194,0.00019741041],"domain_scores_gemma":[0.9974898,0.0014436339,0.00039042646,0.00031445007,0.0002896181,0.00007204573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017574263,0.0016347389,0.0011017376,0.0011768343,0.00050333986,0.002197483,0.0010678346,0.0010631761,0.0016081432],"category_scores_gemma":[0.0054778457,0.0005257559,0.00085281,0.00120665,0.002672631,0.0025983874,0.0017753205,0.0017575669,0.00041847245],"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.00007870483,0.000038091595,0.0005430848,0.00014369012,0.000045713226,0.0003471438,0.00016024854,0.6284426,0.008288723,0.34849954,0.0006300249,0.012782405],"study_design_scores_gemma":[0.0000056409094,0.00004145947,0.0001389833,0.00003096884,0.000015782709,0.00016833685,0.00003167154,0.94819,0.0017399013,0.049021818,0.0005985584,0.000016889862],"about_ca_topic_score_codex":0.00095970574,"about_ca_topic_score_gemma":0.00070643215,"teacher_disagreement_score":0.002197483,"about_ca_system_score_codex":0.001741259,"about_ca_system_score_gemma":0.0011590935,"threshold_uncertainty_score":0.0126338005},"labels":[],"label_agreement":null},{"id":"W3094216785","doi":"10.1109/tvt.2020.3034529","title":"Comments on “Precoding and Artificial Noise Design for Cognitive MIMOME Wiretap Channels”","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Vehicular Technology","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":"University of Ottawa","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Secrecy; Bounded function; Maximization; Convergence (economics); Mathematical optimization; Sequence (biology); Precoding; Computer science; Artificial noise; Point (geometry); Regular polygon; Rate of convergence; Mathematics; Channel (broadcasting); Wireless; Telecommunications; Physical layer","score_opus":0.05976992722837755,"score_gpt":0.28264019401257734,"score_spread":0.2228702667841998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094216785","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002058402,0.0038465327,0.020940049,0.854936,0.10793093,0.000091043556,0.00078661373,0.00057761226,0.008832858],"genre_scores_gemma":[0.06268455,0.00503661,0.018428745,0.7745635,0.10124259,0.00035609226,0.00043132636,0.0006124981,0.036644075],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98918927,0.0032081087,0.0008340535,0.001341984,0.004646687,0.00077988417],"domain_scores_gemma":[0.9663756,0.017229911,0.0014699191,0.0012141303,0.01304493,0.0006654478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007799643,0.0013865352,0.0012165207,0.00093777553,0.002328881,0.0019473704,0.0046354546,0.013582636,0.010765527],"category_scores_gemma":[0.055357635,0.00069887645,0.0014122972,0.001081043,0.003507748,0.0036834893,0.0018208799,0.013101713,0.0063184164],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000100486475,0.000021694988,0.00017451185,0.00018273623,0.000018269431,0.00031023173,0.00031846002,0.0009948305,0.00057457364,0.02060017,0.9704716,0.0062324163],"study_design_scores_gemma":[0.00009520153,0.0001412804,0.0016133221,0.00041228303,0.000071766895,0.00051310105,0.0005995477,0.009632521,0.0047303587,0.05430441,0.9275777,0.00030865954],"about_ca_topic_score_codex":0.013702542,"about_ca_topic_score_gemma":0.008030969,"teacher_disagreement_score":0.013702542,"about_ca_system_score_codex":0.0035783297,"about_ca_system_score_gemma":0.0036683711,"threshold_uncertainty_score":0.041248918},"labels":[],"label_agreement":null},{"id":"W3094374777","doi":"10.1109/tifs.2020.3032276","title":"Physical-Layer Secret Key Generation via CQI-Mapped Spatial Modulation in Multi-Hop Wiretap Ad-Hoc Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"European Research Council; Engineering and Physical Sciences Research Council; Royal Society","keywords":"Computer science; Physical layer; Computer network; Wireless ad hoc network; Key generation; Secrecy; Key (lock); Wireless; Encryption; Wireless network; Computer security; Telecommunications","score_opus":0.022541335207689993,"score_gpt":0.23433401272891258,"score_spread":0.21179267752122258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094374777","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.099036604,0.00073866395,0.8952214,0.0002182791,0.000046023102,0.000057884667,0.000050068546,0.00017137105,0.00445974],"genre_scores_gemma":[0.97043645,0.00035616444,0.028421767,0.000039521816,0.000017113149,0.000033275246,0.000018235662,0.0000072765506,0.0006701382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994105,0.000260403,0.000021185448,0.00005197913,0.00020130907,0.0000545429],"domain_scores_gemma":[0.99908113,0.0005026867,0.00016675766,0.00012432695,0.00010318564,0.000021961258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082676363,0.00037904183,0.00035299646,0.00035788657,0.00031756118,0.0005486131,0.0005216669,0.00039365867,0.0005370501],"category_scores_gemma":[0.0019280575,0.00018538546,0.00019258451,0.0005664906,0.0012484601,0.00090656837,0.00092610146,0.0004707665,0.00015965855],"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.0003509401,0.0000718099,0.0014380511,0.0003579993,0.00007644387,0.00077164604,0.0004391387,0.69492847,0.084948026,0.14542471,0.0012346903,0.06995804],"study_design_scores_gemma":[0.000011078227,0.00010994705,0.00014308815,0.000014948028,0.000011052057,0.00016572908,0.000038161408,0.97860134,0.0101655945,0.010132115,0.00059053313,0.000016389102],"about_ca_topic_score_codex":0.00034102818,"about_ca_topic_score_gemma":0.0003530801,"teacher_disagreement_score":0.00082676363,"about_ca_system_score_codex":0.00042677217,"about_ca_system_score_gemma":0.00036474183,"threshold_uncertainty_score":0.0043723583},"labels":[],"label_agreement":null},{"id":"W3098640227","doi":"","title":"One-shot capacity bounds on the simultaneous transmission of classical and quantum information","year":2020,"lang":"en","type":"article","venue":"UTS ePRESS (University of Technology Sydney)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"U.S. Army; Australian Research Council; Generalitat de Catalunya","keywords":"Classical capacity; Quantum capacity; Quantum channel; Amplitude damping channel; Quantum information; Quantum; Converse; Qubit; Channel (broadcasting); Transmission (telecommunications); Computer science; Mathematics; Topology (electrical circuits); Statistical physics; Quantum network; Quantum mechanics; Physics; Telecommunications; Combinatorics","score_opus":0.03061822084237527,"score_gpt":0.20464415795348082,"score_spread":0.17402593711110553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098640227","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.064963184,0.00521604,0.8465937,0.0026806032,0.00033210672,0.00027343075,0.0009029789,0.00042002404,0.078618],"genre_scores_gemma":[0.9368157,0.0052827606,0.046098243,0.0007546198,0.00060514116,0.0006497578,0.000559032,0.00021908883,0.009015645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947872,0.0018854577,0.00016538764,0.0007711036,0.0013115626,0.0010791873],"domain_scores_gemma":[0.9613839,0.031786196,0.0016381526,0.0019897067,0.0022837895,0.00091832905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005913667,0.003384943,0.002322147,0.002334305,0.0017873991,0.004349622,0.0040366356,0.0026591013,0.008977929],"category_scores_gemma":[0.03304975,0.0012132834,0.002063736,0.0027675207,0.0064776577,0.009639695,0.006149389,0.005884616,0.0012801888],"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.00027596767,0.00016258664,0.00033556434,0.0006818001,0.00015803316,0.00036815504,0.00055880635,0.112431146,0.0049468563,0.8610638,0.0045349603,0.014482354],"study_design_scores_gemma":[0.000033095293,0.00019012616,0.00027971237,0.0002045511,0.00012032425,0.0004966712,0.00018711043,0.44267672,0.004813812,0.5474809,0.0034179261,0.000099084544],"about_ca_topic_score_codex":0.0020413802,"about_ca_topic_score_gemma":0.0010102965,"teacher_disagreement_score":0.008977929,"about_ca_system_score_codex":0.004380839,"about_ca_system_score_gemma":0.0025126382,"threshold_uncertainty_score":0.03178537},"labels":[],"label_agreement":null},{"id":"W3100341354","doi":"","title":"Counterexamples to Additivity of Minimum Output p-Renyi Entropy for p Close to 0","year":2008,"lang":"en","type":"article","venue":"UCL Discovery (University College London)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":33,"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 Waterloo","funders":"","keywords":"Additive function; Counterexample; Multiplicative function; Conjecture; Mathematics; Entropy (arrow of time); Combinatorics; Discrete mathematics; Statistical physics; Physics; Quantum mechanics; Mathematical analysis","score_opus":0.017568628478430902,"score_gpt":0.2113797518526397,"score_spread":0.1938111233742088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100341354","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.37434775,0.0021373008,0.4786768,0.018884845,0.0007821661,0.00013906865,0.00079841714,0.0014881138,0.12274555],"genre_scores_gemma":[0.98026913,0.00044743164,0.013527364,0.0012426607,0.0005484421,0.00013629597,0.00016976631,0.00020411864,0.0034547893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925648,0.0027043174,0.00036933715,0.0011536494,0.0023788698,0.0008290258],"domain_scores_gemma":[0.9392629,0.05349387,0.0021003366,0.0028798329,0.001293379,0.00096971093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008650988,0.0012821918,0.0021689062,0.0027200228,0.002550631,0.0050610546,0.0025407474,0.0034345048,0.007257543],"category_scores_gemma":[0.05921673,0.0011159537,0.0019027421,0.00172119,0.009101957,0.00795196,0.009479358,0.0062627643,0.00077914365],"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.00024029103,0.000036778805,0.00072204386,0.00012619472,0.000053837837,0.0003385391,0.0002688436,0.007981626,0.0016944981,0.98140633,0.0022209687,0.0049100737],"study_design_scores_gemma":[0.000034166984,0.000028203429,0.00034795544,0.00003056532,0.000019571133,0.00031637246,0.00004442857,0.026030898,0.0020529893,0.97014105,0.00092625135,0.000027530978],"about_ca_topic_score_codex":0.000322419,"about_ca_topic_score_gemma":0.00023105838,"teacher_disagreement_score":0.008650988,"about_ca_system_score_codex":0.0017113172,"about_ca_system_score_gemma":0.0006914598,"threshold_uncertainty_score":0.045751333},"labels":[],"label_agreement":null},{"id":"W3101985270","doi":"10.1109/twc.2015.2500578","title":"Linear Precoding of Data and Artificial Noise in Secure Massive MIMO Systems","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":177,"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 British Columbia","funders":"","keywords":"Precoding; Artificial noise; Telecommunications link; Base station; MIMO; Data transmission; Zero-forcing precoding; Polynomial; Ergodic theory","score_opus":0.09114750185726761,"score_gpt":0.3124666539971344,"score_spread":0.2213191521398668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101985270","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.07790021,0.0005750889,0.9168454,0.00024887949,0.000052889238,0.00002382041,0.000058611757,0.00008765342,0.0042074486],"genre_scores_gemma":[0.9646742,0.0005524217,0.032599658,0.000073700496,0.000051223236,0.000033824188,0.000032665994,0.00001145718,0.0019709643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992926,0.00027880908,0.00002387594,0.000097773416,0.00021624276,0.00009077877],"domain_scores_gemma":[0.9987658,0.00073138846,0.00020314884,0.000108878136,0.0001612325,0.000029584391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007439435,0.0005907194,0.00048473218,0.00020269898,0.00032796056,0.00078174256,0.00045172448,0.0007175896,0.00064450665],"category_scores_gemma":[0.0020735166,0.00025630635,0.00029422634,0.0004845848,0.0012604808,0.00092483265,0.00072184514,0.00061075354,0.00018315305],"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.00007574995,0.000018643,0.0004780967,0.00008156514,0.000019532386,0.0002556205,0.00008747433,0.9255359,0.0058723516,0.059543177,0.00025691016,0.007775022],"study_design_scores_gemma":[0.0000065611907,0.00003663079,0.00009167944,0.0000053731874,0.000005513455,0.00004284967,0.000018803157,0.9920204,0.0012727648,0.006245487,0.0002475456,0.000006478273],"about_ca_topic_score_codex":0.0017933744,"about_ca_topic_score_gemma":0.0015292838,"teacher_disagreement_score":0.0017933744,"about_ca_system_score_codex":0.0006680233,"about_ca_system_score_gemma":0.00057767757,"threshold_uncertainty_score":0.0048468113},"labels":[],"label_agreement":null},{"id":"W3107219844","doi":"10.1109/tifs.2020.3040877","title":"Secure Content Delivery in Two-Tier Cache-Enabled mmWave Heterogeneous Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Windsor","funders":"Xidian University; Natural Sciences and Engineering Research Council of Canada; Shenzhen University; National Natural Science Foundation of China","keywords":"Computer science; Cache; Computer network; Base station; Throughput; Transmission (telecommunications); Resource allocation; Stochastic geometry; Artificial noise; Secrecy; Heterogeneous network; Wireless network; Wireless; Telecommunications; Channel (broadcasting); Transmitter; Computer security","score_opus":0.018655546970566043,"score_gpt":0.21428125752509386,"score_spread":0.19562571055452782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107219844","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.36058635,0.0013448201,0.6329611,0.00038875677,0.00007074563,0.00007252962,0.00015262951,0.00023512845,0.00418792],"genre_scores_gemma":[0.98921096,0.00026464046,0.009605221,0.00005139486,0.00001658827,0.000023439794,0.00002800618,0.000007536252,0.0007920338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991518,0.00025545736,0.000030006495,0.00013646236,0.00019993374,0.00022629548],"domain_scores_gemma":[0.99851376,0.00068561715,0.00028013086,0.00016673292,0.00028247206,0.000071361355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007740666,0.00076480274,0.0008078811,0.00056226226,0.0008061773,0.0011275773,0.0010243498,0.00096201315,0.00054558646],"category_scores_gemma":[0.0022491117,0.00031576215,0.00040754766,0.0008697937,0.00096162787,0.0019556372,0.0011705741,0.00044696423,0.00014399517],"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.00051225425,0.00009672914,0.0032619773,0.00014030775,0.00012227906,0.0010820719,0.00019777186,0.9050091,0.02929705,0.036340605,0.0009141678,0.02302561],"study_design_scores_gemma":[0.00000724105,0.00005897342,0.00025874516,0.0000045264355,0.000018593231,0.00010827493,0.000042206288,0.9945756,0.0026096238,0.0020993347,0.00020707116,0.00000978043],"about_ca_topic_score_codex":0.004183001,"about_ca_topic_score_gemma":0.0032710135,"teacher_disagreement_score":0.004183001,"about_ca_system_score_codex":0.0015047801,"about_ca_system_score_gemma":0.0005143483,"threshold_uncertainty_score":0.010917962},"labels":[],"label_agreement":null},{"id":"W3107998045","doi":"10.1049/iet-com.2019.1344","title":"Impact of antenna correlation on the physical layer security of cooperative relaying with OSTBC system","year":2020,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security 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":"Polytechnique Montréal","funders":"","keywords":"Physical layer; Computer science; Antenna (radio); Telecommunications; Computer security; Wireless","score_opus":0.037455460577610636,"score_gpt":0.2867812665103328,"score_spread":0.2493258059327222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107998045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7161668,0.0013488417,0.27052128,0.00036278125,0.00003498532,0.000055450215,0.00011844076,0.00025919217,0.011132238],"genre_scores_gemma":[0.9970578,0.00020224151,0.0024110025,0.000012978232,0.0000067303986,0.000007924858,0.000013793745,0.0000072332555,0.0002802313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782467,0.0008727541,0.000075003634,0.00017770375,0.0006860449,0.000363694],"domain_scores_gemma":[0.992362,0.0051565873,0.0010363067,0.0005453375,0.00080556085,0.00009407301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018200107,0.0010099174,0.0008841652,0.0005153094,0.00061750604,0.0012737687,0.00055667886,0.0007104662,0.00085603487],"category_scores_gemma":[0.006434678,0.00031118878,0.0005189619,0.0008155206,0.001285065,0.0011841502,0.00080013316,0.0005920604,0.00019307836],"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.00019678759,0.000027765356,0.0037897127,0.0000656792,0.000076140765,0.0005682712,0.00009176415,0.96359897,0.013702229,0.010844039,0.00018547018,0.006853183],"study_design_scores_gemma":[0.000006914249,0.00013696044,0.001595179,0.000015305606,0.00005204146,0.00034006345,0.000068308385,0.98896664,0.007296366,0.0013381283,0.0001625543,0.000021651738],"about_ca_topic_score_codex":0.002568602,"about_ca_topic_score_gemma":0.0021189032,"teacher_disagreement_score":0.002568602,"about_ca_system_score_codex":0.0014027635,"about_ca_system_score_gemma":0.001237513,"threshold_uncertainty_score":0.010177851},"labels":[],"label_agreement":null},{"id":"W3119183140","doi":"10.1109/tvt.2021.3050104","title":"Exploiting Deep Learning for Secure Transmission in an Underlay Cognitive Radio Network","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Chongqing Jiaotong University; Government of Jiangsu Province; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Cognitive radio; Wireless network; Transmitter; Transmitter power output; Computer network; Underlay; Wireless; Computer engineering; Channel (broadcasting); Signal-to-noise ratio (imaging); Telecommunications","score_opus":0.015285207136821029,"score_gpt":0.2567035649860879,"score_spread":0.24141835784926685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119183140","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.04471027,0.0002850572,0.95263386,0.00015246129,0.00002473031,0.000014160662,0.000012899849,0.00015565005,0.0020108528],"genre_scores_gemma":[0.9416665,0.00020357553,0.056638535,0.00009284536,0.000020072515,0.000031422613,0.000019587855,0.000019256791,0.0013082393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996669,0.00008710762,0.000011990618,0.000057172518,0.000099635065,0.000077174474],"domain_scores_gemma":[0.9995759,0.00024036202,0.00006238385,0.00003120637,0.00007113271,0.00001898355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066002336,0.00064373383,0.0005809995,0.0002443488,0.00026448083,0.00058663485,0.0006731196,0.00066739874,0.0005002393],"category_scores_gemma":[0.0013663708,0.0003027349,0.00039212644,0.00027755077,0.00067739526,0.0007908549,0.00080801354,0.00091393944,0.000109888504],"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.000053675256,0.000027057185,0.00030629692,0.00002864029,0.000026352209,0.000056099783,0.000028006363,0.9602987,0.00452534,0.005127161,0.0001878252,0.029334806],"study_design_scores_gemma":[0.0000013220647,0.000009385743,0.000020741583,0.0000010053634,0.00000224574,0.0000052064156,0.0000016417233,0.99863535,0.00044840056,0.0008235838,0.000049829363,0.0000013124069],"about_ca_topic_score_codex":0.0026026207,"about_ca_topic_score_gemma":0.0030180728,"teacher_disagreement_score":0.0026026207,"about_ca_system_score_codex":0.0006102511,"about_ca_system_score_gemma":0.00074195827,"threshold_uncertainty_score":0.0051749945},"labels":[],"label_agreement":null},{"id":"W3120362878","doi":"10.36227/techrxiv.13571078.v1","title":"On A Class of Time-Varying Gaussian ISI Channels","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Columbia College","funders":"","keywords":"Mathematics; Upper and lower bounds; Gaussian; Matrix (chemical analysis); Intersymbol interference; Additive white Gaussian noise; Combinatorics; Eigenvalues and eigenvectors; Topology (electrical circuits); Mathematical analysis; Algorithm; Decoding methods; Statistics; Physics; White noise","score_opus":0.018823225519750228,"score_gpt":0.25689325363436527,"score_spread":0.23807002811461503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120362878","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.15791021,0.0019258074,0.81154877,0.00088752614,0.00011069813,0.000065986234,0.00038669864,0.00021588361,0.026948418],"genre_scores_gemma":[0.9699424,0.0030499622,0.018046103,0.00019762378,0.00025946554,0.00007788369,0.00029301536,0.000050273793,0.008083338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989207,0.00025024163,0.000023885954,0.00017503268,0.00036978166,0.00026035655],"domain_scores_gemma":[0.99722797,0.0018528403,0.00038744786,0.00015445513,0.00029876563,0.00007850101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084556,0.0009898669,0.0007926448,0.0008541339,0.0006907896,0.0011937892,0.00071223284,0.0009771079,0.0016293739],"category_scores_gemma":[0.0039583617,0.00025652244,0.0004871705,0.0013403925,0.0017045197,0.0018745923,0.000769036,0.0012427168,0.00034623264],"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.00010113302,0.000041363364,0.0011073006,0.00009620004,0.000034764642,0.00043291197,0.00011743053,0.6784146,0.004549897,0.30084753,0.0015222575,0.012734694],"study_design_scores_gemma":[0.000011210106,0.000033202545,0.000505039,0.00001520139,0.000009873403,0.00018599085,0.00004557337,0.9246727,0.0011266322,0.071883686,0.0014903262,0.000020493491],"about_ca_topic_score_codex":0.00495009,"about_ca_topic_score_gemma":0.002167632,"teacher_disagreement_score":0.00495009,"about_ca_system_score_codex":0.0012877015,"about_ca_system_score_gemma":0.00083309255,"threshold_uncertainty_score":0.009842515},"labels":[],"label_agreement":null},{"id":"W3120880522","doi":"10.1109/cdc42340.2020.9303941","title":"Optimality of Stationary and Deterministic Policies for Zero-Delay Coding of ℝ<sup>d</sup>-Valued Linear Markov Sources with Quadratic Cost","year":2020,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Markov chain; Markov process; Alphabet; Mathematics; Markov model; Discrete mathematics; Coding (social sciences); Zero (linguistics); Markov decision process; Mathematical optimization; Combinatorics; Applied mathematics; Algorithm; Statistics","score_opus":0.030826036854486098,"score_gpt":0.27658631164595965,"score_spread":0.24576027479147355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120880522","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.102651626,0.0007039384,0.8853875,0.0011603911,0.000073339324,0.00011917665,0.00035471315,0.00018264075,0.009366764],"genre_scores_gemma":[0.9391069,0.00075993646,0.054650202,0.0001584769,0.000054694297,0.00012135733,0.00026282397,0.00008047633,0.0048050634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981591,0.0005705801,0.000092200935,0.00034989888,0.00037889814,0.00044937848],"domain_scores_gemma":[0.9826147,0.014502165,0.001283635,0.00034279237,0.0009337967,0.00032301943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038690178,0.0010546227,0.001103806,0.0008692026,0.00064208824,0.0019542044,0.0011753769,0.001191931,0.002948448],"category_scores_gemma":[0.015791444,0.0007313943,0.0006635743,0.00092645455,0.0022053826,0.002553804,0.0013938108,0.0021280847,0.00041558588],"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.00042213913,0.00008456699,0.0005423244,0.00014630733,0.00003428275,0.00008231208,0.00015177355,0.75495225,0.0025140662,0.2217444,0.0012229846,0.018102642],"study_design_scores_gemma":[0.000031831773,0.000055981174,0.00014118147,0.000029736762,0.000010044665,0.000024140292,0.00002799949,0.94453704,0.0017239938,0.053106967,0.0002897226,0.000021391214],"about_ca_topic_score_codex":0.007172782,"about_ca_topic_score_gemma":0.0045339726,"teacher_disagreement_score":0.007172782,"about_ca_system_score_codex":0.0045233984,"about_ca_system_score_gemma":0.0050154906,"threshold_uncertainty_score":0.03281969},"labels":[],"label_agreement":null},{"id":"W3121050167","doi":"10.1109/tit.2021.3049309","title":"Boundary of the Gaussian Han-Kobayashi Rate Region","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Boundary (topology); Gaussian; Mathematics; Interference (communication); Function (biology); Envelope (radar); Combinatorics; Channel (broadcasting); Topology (electrical circuits); Applied mathematics; Mathematical analysis; Computer science; Physics; Telecommunications","score_opus":0.00927483194062176,"score_gpt":0.21333466880189694,"score_spread":0.20405983686127518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121050167","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.097597696,0.005287124,0.7938882,0.0020345573,0.00015215311,0.00014546463,0.0006707246,0.0006046656,0.09961934],"genre_scores_gemma":[0.94665307,0.003390183,0.042689618,0.00042218095,0.00018481999,0.00027767188,0.00021625003,0.00016162773,0.0060045947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973367,0.0010236644,0.000111647714,0.0004030132,0.00057249144,0.0005524584],"domain_scores_gemma":[0.99255955,0.0048445454,0.0007649947,0.00048606706,0.0010655541,0.00027928408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032883706,0.0010906435,0.0012259065,0.0011150605,0.0010352406,0.0032854134,0.0012862533,0.0010902653,0.0047453325],"category_scores_gemma":[0.012091947,0.0004702321,0.000773738,0.0009281792,0.0033808274,0.00323445,0.0025139935,0.001966639,0.001244864],"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.00030534028,0.000037812428,0.00039189833,0.00029797282,0.000042835694,0.00030569898,0.0004712215,0.059243694,0.007247172,0.9155835,0.0026881364,0.01338469],"study_design_scores_gemma":[0.00006660073,0.00014315796,0.00065580977,0.00029743044,0.00004813803,0.0007760886,0.00030449074,0.42769432,0.010430803,0.55039364,0.009066778,0.0001228658],"about_ca_topic_score_codex":0.0015054395,"about_ca_topic_score_gemma":0.00046338144,"teacher_disagreement_score":0.0047453325,"about_ca_system_score_codex":0.0016917612,"about_ca_system_score_gemma":0.0016727652,"threshold_uncertainty_score":0.017390788},"labels":[],"label_agreement":null},{"id":"W3121629650","doi":"","title":"Spinal Codes Optimization: Error Probability Analysis and Transmission Scheme Design.","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Windsor","funders":"","keywords":"Decoding methods; Additive white Gaussian noise; Computer science; Algorithm; Transmission (telecommunications); Transmitter; Binary symmetric channel; Channel (broadcasting); Concatenated error correction code; Block code; Low-density parity-check code; Telecommunications","score_opus":0.08811534099770948,"score_gpt":0.20952286676390194,"score_spread":0.12140752576619246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121629650","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.004705338,0.000717204,0.9902057,0.00027273418,0.000037274414,0.00005263623,0.0000896243,0.00009121331,0.0038282648],"genre_scores_gemma":[0.61695176,0.0033652696,0.36925748,0.0003872561,0.00024009119,0.0004938723,0.00041213547,0.00021170947,0.008680435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815565,0.00065446313,0.000071108094,0.0002164667,0.00071717624,0.00018510397],"domain_scores_gemma":[0.9957748,0.0026835375,0.0004391932,0.00023720945,0.0007692171,0.00009607848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017418608,0.0015382599,0.0009019962,0.0009904744,0.00047378926,0.0011766915,0.0012423759,0.0012258377,0.002897446],"category_scores_gemma":[0.0111756595,0.0005010243,0.00051031314,0.0014333718,0.001352546,0.0018008145,0.0015595083,0.0015502039,0.0006540452],"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.00014635925,0.000053655207,0.00056246156,0.0002919408,0.00004951891,0.00014385756,0.00018071025,0.7769155,0.0061729774,0.14669946,0.0042833015,0.06450029],"study_design_scores_gemma":[0.000009021889,0.000049492883,0.00007853764,0.000029224007,0.000012003624,0.00007720007,0.000020166633,0.9734123,0.0016543485,0.023225404,0.0014203099,0.000012087645],"about_ca_topic_score_codex":0.002987816,"about_ca_topic_score_gemma":0.0022374315,"teacher_disagreement_score":0.002987816,"about_ca_system_score_codex":0.001855405,"about_ca_system_score_gemma":0.0023686714,"threshold_uncertainty_score":0.013461947},"labels":[],"label_agreement":null},{"id":"W3123137409","doi":"10.1109/tit.2021.3053166","title":"Rate Splitting and Successive Decoding for Gaussian Interference Channels","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Interference (communication); Gaussian; List decoding; Mathematics; Sequential decoding; Coding (social sciences); Algorithm; Dirty paper coding; Joint (building); Computer science; Channel (broadcasting); Topology (electrical circuits); Telecommunications; Statistics; Block code; Combinatorics; Concatenated error correction code; Precoding; MIMO; Physics","score_opus":0.013263367387529885,"score_gpt":0.24525816857805932,"score_spread":0.23199480119052943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123137409","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.026308628,0.00084572216,0.96665287,0.00013551828,0.00003282675,0.000034330198,0.000035546887,0.0001451195,0.0058095013],"genre_scores_gemma":[0.8064006,0.0017251824,0.18864232,0.00013702089,0.00010067007,0.000108301094,0.00007271283,0.00005216502,0.0027610923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843305,0.00059654133,0.00007060745,0.00014793249,0.00054832984,0.00020358765],"domain_scores_gemma":[0.99766517,0.0014866504,0.000202501,0.00031356522,0.00028473244,0.000047404385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016947871,0.00080972235,0.00056246005,0.00055483595,0.00044536716,0.0007181711,0.0006192113,0.000485034,0.0011606739],"category_scores_gemma":[0.005007898,0.0002599432,0.0005333442,0.00092427596,0.0015218788,0.0012218456,0.00096194627,0.0009923753,0.00030992719],"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.00031755143,0.000055569642,0.0005807149,0.00023487327,0.000058214602,0.00026041205,0.00046273533,0.37140396,0.031968966,0.48039773,0.0011106475,0.11314867],"study_design_scores_gemma":[0.000030617,0.00016405935,0.00018713274,0.000033453667,0.000029994682,0.00038500878,0.00004446144,0.8932447,0.01543119,0.086957216,0.0034520624,0.000040105024],"about_ca_topic_score_codex":0.0013364695,"about_ca_topic_score_gemma":0.0011775094,"teacher_disagreement_score":0.0016947871,"about_ca_system_score_codex":0.00077174284,"about_ca_system_score_gemma":0.0010739419,"threshold_uncertainty_score":0.008962989},"labels":[],"label_agreement":null},{"id":"W3132719608","doi":"10.1109/globecom42002.2020.9348134","title":"Physical-Layer Security for Cognitive Radio Networks over Cascaded Rayleigh Fading Channels","year":2020,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Secrecy; Cognitive radio; Rayleigh fading; Fading; Transmitter; Computer science; Computer network; Channel (broadcasting); Physical layer; Underlay; Path loss; Topology (electrical circuits); Electronic engineering; Telecommunications; Signal-to-noise ratio (imaging); Computer security; Wireless; Engineering; Electrical engineering","score_opus":0.030170041906387897,"score_gpt":0.27460626160624724,"score_spread":0.24443621969985935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132719608","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.23538342,0.0014838224,0.7573386,0.00030345065,0.0000946971,0.00006383556,0.00005680334,0.0002116799,0.005063785],"genre_scores_gemma":[0.9904145,0.00043606333,0.008697421,0.000030483625,0.00001954729,0.000017986764,0.000010005872,0.000005559449,0.00036835327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892825,0.00029217926,0.00004274353,0.00014964343,0.00036189976,0.00022526074],"domain_scores_gemma":[0.9960806,0.002505038,0.00050231937,0.0003943378,0.0004374227,0.00008032267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014214809,0.00088029675,0.00049836934,0.00046028482,0.0008395503,0.0011918753,0.00074387045,0.0006659117,0.00072991743],"category_scores_gemma":[0.0046246033,0.00030193734,0.00060237106,0.00046773962,0.0014467535,0.001531138,0.0011377659,0.0008038492,0.00012612628],"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.00025111405,0.00006534559,0.0020219774,0.00019618688,0.000107008826,0.0005923641,0.00025642483,0.91156507,0.018528817,0.03881808,0.0005351169,0.027062494],"study_design_scores_gemma":[0.000010417273,0.00013634616,0.0004787298,0.00001543547,0.000032246677,0.00016781007,0.000044710847,0.98701,0.0033984229,0.008321481,0.00036721243,0.000017310926],"about_ca_topic_score_codex":0.0027314683,"about_ca_topic_score_gemma":0.0028369224,"teacher_disagreement_score":0.0027314683,"about_ca_system_score_codex":0.0011566426,"about_ca_system_score_gemma":0.0010330195,"threshold_uncertainty_score":0.008392096},"labels":[],"label_agreement":null},{"id":"W3133005020","doi":"10.1016/j.phycom.2021.101293","title":"Power allocation and scaling law analysis for secured and energy efficient URLLC IoT networks","year":2021,"lang":"en","type":"article","venue":"Physical Communication","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Mathematical optimization; Throughput; Internet of Things; Scaling; Reliability (semiconductor); Efficient energy use; Transmitter power output; Optimization problem; Power (physics); Computer network; Algorithm; Telecommunications; Wireless; Computer security; Mathematics","score_opus":0.009086286853525983,"score_gpt":0.24172725304885326,"score_spread":0.2326409661953273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133005020","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.038992956,0.0013779225,0.9403407,0.00078780536,0.00011124749,0.000061239145,0.00007979881,0.00024023408,0.018008118],"genre_scores_gemma":[0.957549,0.0013989643,0.031686552,0.0001923988,0.00012812637,0.00009341459,0.0000796613,0.00013616704,0.008735855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966383,0.00010189282,0.000011265291,0.00004371995,0.00012598018,0.000053295567],"domain_scores_gemma":[0.9988782,0.0006646659,0.00012056929,0.00008536819,0.00022031376,0.000030874526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009373696,0.0005771819,0.0006422299,0.00062787405,0.0004397509,0.0011756081,0.00066549936,0.00057975587,0.0036026358],"category_scores_gemma":[0.0043099076,0.00029216506,0.0004329182,0.000718499,0.0009195326,0.0016321222,0.00071999256,0.0010448159,0.0003718731],"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.00005073607,0.00006821336,0.0006437346,0.00011215132,0.000031824213,0.0001384225,0.00013740818,0.79872817,0.005800124,0.1616717,0.0036277836,0.028989807],"study_design_scores_gemma":[9.501728e-7,0.0000053752465,0.00007937303,0.0000050660633,0.0000021633616,0.000017033091,0.000013089002,0.9859293,0.00015905543,0.013457829,0.00032841024,0.00000229369],"about_ca_topic_score_codex":0.0021062472,"about_ca_topic_score_gemma":0.0017378415,"teacher_disagreement_score":0.0036026358,"about_ca_system_score_codex":0.0014468046,"about_ca_system_score_gemma":0.00059752725,"threshold_uncertainty_score":0.012052},"labels":[],"label_agreement":null},{"id":"W3133347211","doi":"10.1109/globecom42002.2020.9348194","title":"Nearest APs-Based Downlink Pilot Transmission for High Secrecy Rates in Cell-Free Massive MIMO","year":2020,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Telecommunications link; Information leakage; Computer science; MIMO; Secrecy; Beamforming; Spoofing attack; Transmission (telecommunications); Computer network; Channel (broadcasting); Algorithm; Electronic engineering; Telecommunications; Engineering; Computer security","score_opus":0.02498070245898787,"score_gpt":0.2475656009259756,"score_spread":0.22258489846698773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133347211","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.1730552,0.0008735026,0.82090193,0.00016061596,0.000043848322,0.000034603778,0.000060299153,0.0003055106,0.004564547],"genre_scores_gemma":[0.98355836,0.00027123574,0.015805598,0.000029897554,0.00001560382,0.000013476167,0.000014195115,0.000007727295,0.00028403258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999141,0.00034780672,0.000034743956,0.0000879956,0.00026995767,0.00011837773],"domain_scores_gemma":[0.9976681,0.001339215,0.00038848192,0.0003332881,0.00019584796,0.000075024625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010387492,0.0007685441,0.0006540265,0.0003562122,0.00047883118,0.0007751875,0.00044408796,0.0005723946,0.0005954669],"category_scores_gemma":[0.003702571,0.0003308396,0.00032924183,0.00058956834,0.0010866196,0.0010017959,0.0013591839,0.0005563725,0.0002510295],"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.0007936175,0.00011290938,0.0043033906,0.0004374441,0.0001258542,0.0011440681,0.00053764845,0.75739837,0.1034574,0.048259355,0.0008677484,0.08256221],"study_design_scores_gemma":[0.00001594958,0.00030403057,0.00061104936,0.000028517738,0.000043160322,0.0006054575,0.000097240656,0.96661603,0.026144808,0.0048968312,0.0006065599,0.000030352228],"about_ca_topic_score_codex":0.00036112018,"about_ca_topic_score_gemma":0.00049545965,"teacher_disagreement_score":0.0010387492,"about_ca_system_score_codex":0.0003057585,"about_ca_system_score_gemma":0.00046750603,"threshold_uncertainty_score":0.005493462},"labels":[],"label_agreement":null},{"id":"W3133741277","doi":"10.23977/acss.2021.050102","title":"Secure Lossy Transmission over Wiretap Channels with Side Information and State Information","year":2021,"lang":"en","type":"article","venue":"Advances in Computer Signals and Systems","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Information leakage; Lossy compression; Entropy (arrow of time); Code rate; Algorithm; Computer science; Channel (broadcasting); Transmission (telecommunications); Information theory; Rate–distortion theory; Mathematics; Channel state information; Source code; Statistics; Telecommunications; Decoding methods; Wireless; Data compression","score_opus":0.0054582575366588755,"score_gpt":0.2152779243701899,"score_spread":0.209819666833531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133741277","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.039176997,0.0005479344,0.95665824,0.00028800298,0.000053643238,0.00002966552,0.00009767199,0.00015745153,0.0029903692],"genre_scores_gemma":[0.9617849,0.0012253859,0.033310696,0.000102793725,0.000082496,0.00007217181,0.000115245006,0.000046386966,0.003259987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983215,0.00043106734,0.000086077496,0.0003002037,0.00061744836,0.00024379916],"domain_scores_gemma":[0.99556714,0.0026312687,0.00068249163,0.0005220105,0.00051772204,0.000079401754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013300324,0.0008929332,0.0011796711,0.00058486615,0.0005910142,0.0012966167,0.0010317871,0.0009997787,0.0016572943],"category_scores_gemma":[0.005510735,0.00041816477,0.00048468204,0.00087505986,0.0016806906,0.0042074732,0.0018303188,0.0015800355,0.00042609088],"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.0009918879,0.00008036756,0.0013451636,0.0006400037,0.00015505588,0.0011682286,0.00039952746,0.6696863,0.032153867,0.2021322,0.0025160518,0.08873132],"study_design_scores_gemma":[0.000023325645,0.00014834257,0.00020556885,0.0000380977,0.000037736896,0.00037327548,0.00007325884,0.9626903,0.009377368,0.025868302,0.0011267086,0.000037768794],"about_ca_topic_score_codex":0.0009769747,"about_ca_topic_score_gemma":0.0005117506,"teacher_disagreement_score":0.0016572943,"about_ca_system_score_codex":0.0008477023,"about_ca_system_score_gemma":0.00072831445,"threshold_uncertainty_score":0.007033944},"labels":[],"label_agreement":null},{"id":"W3136372906","doi":"10.1109/tcomm.2021.3065980","title":"Lightweight Continuous Authentication via Intelligently Arranged Pseudo-Random Access in 5G-and-Beyond","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Computer network; Random access; Cryptography; Authentication (law); Overhead (engineering); Transceiver; Distributed computing; Computer engineering; Wireless; Computer security; Telecommunications","score_opus":0.025724177900297625,"score_gpt":0.28288387184848235,"score_spread":0.2571596939481847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136372906","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.10781904,0.0019546698,0.8800636,0.0008407576,0.00024747133,0.00024407699,0.00011572331,0.0017791128,0.0069355234],"genre_scores_gemma":[0.96568954,0.00021548684,0.031976502,0.00017389904,0.00004724269,0.00006400445,0.000043235814,0.000015403639,0.0017748175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986029,0.00048520108,0.000101394355,0.0002248108,0.0003789459,0.0002067703],"domain_scores_gemma":[0.99877435,0.00032110905,0.00026713163,0.0003782281,0.00019796695,0.00006115745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001076975,0.00066673534,0.00076681987,0.00063185615,0.0008786739,0.00090350665,0.0008860564,0.0008618836,0.0018337902],"category_scores_gemma":[0.0019757205,0.00025926973,0.00036244545,0.0005610246,0.001078899,0.0024484594,0.0019550705,0.00079224125,0.0005341058],"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.0030735529,0.0002757353,0.003920744,0.0005346543,0.00014936284,0.0022142828,0.0010906697,0.13998589,0.18866546,0.2461386,0.0072696963,0.40668136],"study_design_scores_gemma":[0.00017381663,0.00092719315,0.0013864256,0.00008891632,0.00010719046,0.0017148511,0.00018882613,0.8788437,0.047233704,0.05664321,0.012534339,0.00015778292],"about_ca_topic_score_codex":0.00064567605,"about_ca_topic_score_gemma":0.00094559154,"teacher_disagreement_score":0.0018337902,"about_ca_system_score_codex":0.0004915438,"about_ca_system_score_gemma":0.00062637206,"threshold_uncertainty_score":0.006134689},"labels":[],"label_agreement":null},{"id":"W3136561982","doi":"10.1109/tit.2021.3138769","title":"Zero-Delay Lossy Coding of Linear Vector Markov Sources: Optimality of Stationary Codes and Near Optimality of Finite Memory Codes","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Markov chain; Discrete mathematics; Markov process; Zero (linguistics); Coding (social sciences); Combinatorics; Algorithm; Statistics","score_opus":0.01219420957808383,"score_gpt":0.24095987537929608,"score_spread":0.22876566580121224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136561982","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.115067065,0.0010417972,0.8723827,0.0010095744,0.00007054805,0.00006121177,0.0003261561,0.00018311897,0.009857768],"genre_scores_gemma":[0.91629624,0.0013172755,0.075604275,0.00020564212,0.00008573592,0.00009988581,0.00036196914,0.00010794383,0.00592094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990951,0.0002729237,0.000049269158,0.00016168822,0.00025890244,0.00016211405],"domain_scores_gemma":[0.9914484,0.006853648,0.00056407216,0.0003320231,0.00063232554,0.00016954815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002108648,0.0007016924,0.0007957887,0.00072915375,0.0004190267,0.001517968,0.0010378042,0.00089986983,0.0022064815],"category_scores_gemma":[0.012118913,0.00050152076,0.0004660513,0.0008209492,0.0017456332,0.0022027001,0.0011313758,0.0016272158,0.00037765232],"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.00030584354,0.00004919222,0.0004896188,0.00013134249,0.000022758912,0.00006100053,0.00012381178,0.60457295,0.0034074343,0.36179882,0.0012146813,0.027822535],"study_design_scores_gemma":[0.000019817897,0.000044005134,0.00013341478,0.000035126835,0.0000068473537,0.000027255897,0.000021740289,0.8875501,0.0023957542,0.10933248,0.0004163723,0.00001710976],"about_ca_topic_score_codex":0.0039626393,"about_ca_topic_score_gemma":0.0026918103,"teacher_disagreement_score":0.0039626393,"about_ca_system_score_codex":0.0027294802,"about_ca_system_score_gemma":0.0029769214,"threshold_uncertainty_score":0.019803822},"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},{"id":"W3139528444","doi":"10.1109/tcomm.2021.3067058","title":"Covert Surveillance via Proactive Eavesdropping Under Channel Uncertainty","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":39,"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 British Columbia, Okanagan Campus; University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Eavesdropping; Computer science; Covert; Transmitter; False alarm; Real-time computing; Transmission (telecommunications); Channel (broadcasting); Wireless; Decoding methods; Computer security; Computer network; Artificial intelligence; Telecommunications","score_opus":0.030790753083949397,"score_gpt":0.26549407510601253,"score_spread":0.23470332202206312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139528444","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.31710774,0.0012054885,0.67408955,0.00034122134,0.00006504285,0.000057744754,0.00007113884,0.00025605527,0.0068060234],"genre_scores_gemma":[0.9951186,0.00021417458,0.004212377,0.00002440392,0.000013485379,0.000011164951,0.000013899871,0.0000062687004,0.00038561827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986603,0.00037022366,0.000043063974,0.0002036206,0.000381284,0.00034137943],"domain_scores_gemma":[0.99298286,0.004896454,0.0010398444,0.0003073737,0.00061247195,0.00016102735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012125515,0.0013176723,0.00100674,0.00054323685,0.00067788386,0.0010669592,0.0006768284,0.00089775806,0.00058842],"category_scores_gemma":[0.006045751,0.00032363605,0.00057088543,0.00053209614,0.0014848652,0.0015991414,0.0014210511,0.00083270844,0.0001077707],"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.00029088542,0.000052346622,0.0023125836,0.00012693454,0.00009718275,0.000644558,0.00015385351,0.94973546,0.018368302,0.011606797,0.00038585652,0.01622531],"study_design_scores_gemma":[0.000005543717,0.00010191912,0.0004712061,0.0000069563575,0.000024749112,0.00013300519,0.000032192816,0.99326694,0.004094452,0.0017572575,0.00009166281,0.000014128069],"about_ca_topic_score_codex":0.0016873376,"about_ca_topic_score_gemma":0.0011560026,"teacher_disagreement_score":0.0016873376,"about_ca_system_score_codex":0.000982901,"about_ca_system_score_gemma":0.0007163651,"threshold_uncertainty_score":0.0071314573},"labels":[],"label_agreement":null},{"id":"W3151935904","doi":"10.1109/iccspa49915.2021.9385753","title":"Cascaded κ-µ Fading Channels with Colluding Eavesdroppers: Physical-Layer Security Analysis","year":2021,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Secrecy; Fading; Channel (broadcasting); Transmitter; Computer science; Computer network; Physical layer; Topology (electrical circuits); Algorithm; Computer security; Wireless; Mathematics; Telecommunications; Combinatorics","score_opus":0.019721169903958877,"score_gpt":0.25963576370437685,"score_spread":0.23991459380041796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151935904","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.18000007,0.0012531936,0.8016078,0.0005084057,0.00008281836,0.00010949219,0.0002096543,0.00019254083,0.01603614],"genre_scores_gemma":[0.98555726,0.0011084457,0.009972629,0.00006315522,0.00005581631,0.000049156544,0.000051249048,0.000018264194,0.0031240021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988172,0.00025295353,0.000040415704,0.0001741393,0.00039429794,0.00032104625],"domain_scores_gemma":[0.99684024,0.0016378917,0.00061564444,0.00027387324,0.0005242453,0.0001079835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013495827,0.0013025457,0.0008380585,0.000697224,0.00063766143,0.0012101537,0.0010718115,0.0010732894,0.002000481],"category_scores_gemma":[0.004224162,0.00058331515,0.00093049736,0.0007310413,0.0019648774,0.002465316,0.001529988,0.001338611,0.0003897883],"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.000100658115,0.000029146326,0.0013622056,0.000089661065,0.000055053515,0.0004957714,0.00013021867,0.91983277,0.0056060893,0.06759758,0.00052637566,0.004174525],"study_design_scores_gemma":[0.0000067761794,0.000034939963,0.00033751465,0.000011481884,0.000021958758,0.000117071,0.000035311223,0.99142975,0.0008978718,0.006850478,0.00024048524,0.000016400178],"about_ca_topic_score_codex":0.00530985,"about_ca_topic_score_gemma":0.0030029765,"teacher_disagreement_score":0.00530985,"about_ca_system_score_codex":0.0016431812,"about_ca_system_score_gemma":0.0010515527,"threshold_uncertainty_score":0.011922181},"labels":[],"label_agreement":null},{"id":"W3152904640","doi":"10.1109/tccn.2021.3074178","title":"Physical-Layer Security on Maximal Ratio Combining for SIMO Cognitive Radio Networks Over Cascaded κ-μ Fading Channels","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Cognitive Communications and Networking","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fading; Transmitter; Cognitive radio; Transmission (telecommunications); Computer science; Notation; Topology (electrical circuits); Algorithm; Mathematics; Computer network; Telecommunications; Channel (broadcasting); Combinatorics; Arithmetic; Wireless","score_opus":0.04295668249818185,"score_gpt":0.297516699221967,"score_spread":0.25456001672378514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3152904640","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.14297305,0.0016930684,0.8409886,0.0006064687,0.000118882715,0.000053085256,0.000085482454,0.00018405524,0.0132973],"genre_scores_gemma":[0.9817359,0.00086991437,0.016109934,0.0001171208,0.00008852325,0.000036150668,0.000022718461,0.00000876723,0.0010110898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874413,0.00039179748,0.000043096756,0.00020359865,0.00037714659,0.00024017575],"domain_scores_gemma":[0.99750394,0.0016290146,0.0003334342,0.00020595659,0.00026097998,0.00006662206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013717042,0.001154528,0.0006487905,0.0004220989,0.0006111638,0.0011027561,0.0006687632,0.0006775897,0.0010196568],"category_scores_gemma":[0.0042399783,0.00033311962,0.00060579594,0.0004901843,0.0015171864,0.0015482398,0.0013772367,0.0008591985,0.00025120165],"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.0013066591,0.00012515146,0.0028965194,0.00038528824,0.00022625185,0.0010304089,0.00044680428,0.6188356,0.049067944,0.24554554,0.0023703405,0.077763386],"study_design_scores_gemma":[0.000035101184,0.00028814786,0.0008109021,0.000046425383,0.00006868592,0.00040955865,0.0000824272,0.9481896,0.00722964,0.041451003,0.0013375874,0.00005099546],"about_ca_topic_score_codex":0.0013529867,"about_ca_topic_score_gemma":0.0010731197,"teacher_disagreement_score":0.0013717042,"about_ca_system_score_codex":0.0010462009,"about_ca_system_score_gemma":0.00087948056,"threshold_uncertainty_score":0.007590711},"labels":[],"label_agreement":null},{"id":"W3157275269","doi":"10.1109/jrfid.2021.3077756","title":"Securing the Inter-Spacecraft Links: Physical Layer Key Generation From Doppler Frequency Shift","year":2021,"lang":"en","type":"article","venue":"IEEE Journal of Radio Frequency Identification","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Polytechnique Montréal","funders":"","keywords":"Key generation; Key (lock); Superposition principle; Computer science; Spacecraft; Physical layer; Doppler effect; Component (thermodynamics); Secrecy; Electronic engineering; Wireless; Telecommunications; Cryptography; Algorithm; Mathematics; Physics; Engineering; Aerospace engineering; Computer security","score_opus":0.027254790702024554,"score_gpt":0.26542979852174975,"score_spread":0.2381750078197252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157275269","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.009213031,0.00036661862,0.9890322,0.000115165574,0.000030918098,0.000029046501,0.000018957224,0.00009484145,0.0010992022],"genre_scores_gemma":[0.7939541,0.00097145117,0.20241183,0.00014408711,0.00009250775,0.00010758476,0.00007338729,0.000032913922,0.0022122664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99906844,0.00026985985,0.000052824274,0.00013721542,0.0003783938,0.000093228344],"domain_scores_gemma":[0.9987362,0.0006177608,0.00021348958,0.00026466104,0.00014070875,0.000027152484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010213753,0.00065963913,0.00047661015,0.0004183901,0.0004727848,0.0009620608,0.0006411808,0.0007790969,0.0012619146],"category_scores_gemma":[0.003647969,0.00026967836,0.00041024757,0.0005718825,0.00097304344,0.0025233675,0.0016310674,0.0011081558,0.0005721506],"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.00048710924,0.0000947888,0.0019099454,0.00065978064,0.00011879025,0.000571611,0.00052147615,0.40802783,0.12655035,0.18379751,0.001809335,0.27545148],"study_design_scores_gemma":[0.000027552709,0.00022711938,0.00044502312,0.0000410241,0.000030673575,0.00062433275,0.00007109329,0.92122567,0.04743464,0.025931217,0.003890199,0.000051443287],"about_ca_topic_score_codex":0.0002696714,"about_ca_topic_score_gemma":0.00024247155,"teacher_disagreement_score":0.0012619146,"about_ca_system_score_codex":0.0004188969,"about_ca_system_score_gemma":0.00075465697,"threshold_uncertainty_score":0.0054016113},"labels":[],"label_agreement":null},{"id":"W3157654480","doi":"10.1109/tcomm.2021.3077935","title":"Robust Deception Scheme for Secure Interference Exploitation Under PSK Modulations","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"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 British Columbia","funders":"Key Science and Technology Program of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Deception; Channel state information; Transmission (telecommunications); Interference (communication); Artificial noise; Overhead (engineering); Channel (broadcasting); Precoding; Transmitter; Relaxation (psychology); Antenna (radio); Wireless; Computer network; Electronic engineering; Telecommunications; MIMO; Engineering","score_opus":0.09581227425649212,"score_gpt":0.2970397573741499,"score_spread":0.20122748311765776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157654480","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.013570721,0.00022938405,0.9841462,0.000105945255,0.000023311091,0.000025638628,0.000016707576,0.00007994894,0.0018022419],"genre_scores_gemma":[0.8629959,0.00050052337,0.13391235,0.00010185521,0.00004742529,0.00008080573,0.000044485532,0.000020438001,0.0022962554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868435,0.00043563734,0.0000612306,0.00017240185,0.0004718028,0.00017466414],"domain_scores_gemma":[0.99837387,0.0008412134,0.00027979715,0.00022750384,0.00020528617,0.000072240844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012678354,0.00087906834,0.0008655833,0.0004240391,0.00046784818,0.000991596,0.0011377026,0.00084785454,0.0011135017],"category_scores_gemma":[0.003649609,0.0002789571,0.00056826114,0.00067628967,0.0010473706,0.0014014569,0.0015015518,0.0016134284,0.00034710052],"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.00030928245,0.00007211377,0.00056735077,0.00019517234,0.00008031718,0.00031516212,0.00026417244,0.8148435,0.020829458,0.08211258,0.0010549739,0.079356015],"study_design_scores_gemma":[0.000012858269,0.00006231592,0.000049594437,0.0000089127125,0.000008490623,0.00007698403,0.00001654431,0.9906502,0.0032744699,0.0054975213,0.00033213722,0.000010035158],"about_ca_topic_score_codex":0.0009090889,"about_ca_topic_score_gemma":0.0006988565,"teacher_disagreement_score":0.0012678354,"about_ca_system_score_codex":0.00071854796,"about_ca_system_score_gemma":0.0009194871,"threshold_uncertainty_score":0.0067050457},"labels":[],"label_agreement":null},{"id":"W3157932900","doi":"10.48550/arxiv.2105.01448","title":"Securing the Inter-Spacecraft Links: Physical Layer Key Generation from Doppler Frequency Shift","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Carleton University; Polytechnique Montréal","funders":"","keywords":"Key generation; Key (lock); Superposition principle; Computer science; Spacecraft; Physical layer; Doppler effect; Component (thermodynamics); Secrecy; Spectral density; Electronic engineering; Telecommunications; Wireless; Cryptography; Algorithm; Mathematics; Physics; Engineering; Aerospace engineering; Computer security","score_opus":0.07083171870248045,"score_gpt":0.20043514583755773,"score_spread":0.12960342713507728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157932900","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.008744234,0.00034600266,0.98952776,0.00011823153,0.000029571362,0.000024754567,0.000018447068,0.00008343774,0.0011075649],"genre_scores_gemma":[0.7694069,0.0010445361,0.22658281,0.00015980152,0.00010578909,0.0001078614,0.00007857276,0.00003918578,0.0024745292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904877,0.00028572016,0.000051902472,0.000141256,0.00038428203,0.00008798614],"domain_scores_gemma":[0.99864274,0.000689388,0.00021643192,0.00028444608,0.00013976906,0.00002728341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010254879,0.00065388065,0.0004610324,0.00043176342,0.00045030247,0.0009629238,0.00063005544,0.0007815846,0.0012980853],"category_scores_gemma":[0.003794636,0.000276922,0.00041084934,0.0006038529,0.0010027756,0.0025373828,0.0016774406,0.0011829834,0.0005998802],"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.0004795808,0.000092798065,0.0017936246,0.0006338278,0.000117868796,0.00052658486,0.0005250855,0.38448024,0.120492876,0.20893173,0.0018050633,0.28012082],"study_design_scores_gemma":[0.000028505852,0.0002140444,0.00045524552,0.000044567794,0.000031878946,0.00062324223,0.00007653658,0.91053075,0.047362916,0.036254026,0.0043268083,0.000051410007],"about_ca_topic_score_codex":0.00023390958,"about_ca_topic_score_gemma":0.00020986669,"teacher_disagreement_score":0.0012980853,"about_ca_system_score_codex":0.0004236424,"about_ca_system_score_gemma":0.00068677886,"threshold_uncertainty_score":0.005423367},"labels":[],"label_agreement":null},{"id":"W3161017057","doi":"10.1109/isit45174.2021.9517832","title":"Neural Computation of Capacity Region of Memoryless Multiple Access Channels","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Toronto Metropolitan University","funders":"","keywords":"Upper and lower bounds; Divergence (linguistics); Parameterized complexity; Mutual information; Boundary (topology); Kullback–Leibler divergence; Estimator; Channel (broadcasting); Mathematics; Set (abstract data type); Computation; Computer science; Algorithm; Applied mathematics; Topology (electrical circuits); Combinatorics; Mathematical analysis; Statistics; Telecommunications","score_opus":0.0887922708078204,"score_gpt":0.3008880704200598,"score_spread":0.21209579961223943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161017057","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.023657983,0.00022130397,0.9725948,0.0002637,0.000017653309,0.00002206893,0.00004834348,0.00014625878,0.0030278843],"genre_scores_gemma":[0.8306378,0.00035256392,0.16541459,0.00018495353,0.00004749592,0.00017313626,0.00014037699,0.00013253314,0.0029165023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992481,0.0003120627,0.000031216045,0.000106721665,0.00021690084,0.000084935695],"domain_scores_gemma":[0.99440384,0.0045603425,0.00027099944,0.00022002011,0.00039546253,0.00014936368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027830547,0.0006493008,0.00081022555,0.00075294194,0.00040288118,0.001451135,0.0014778333,0.0013147215,0.0019186694],"category_scores_gemma":[0.015536047,0.00046284066,0.0005243664,0.00045869293,0.0016332672,0.002697578,0.001686762,0.001703543,0.00022591875],"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.000049659484,0.000015824153,0.0002748722,0.000048824266,0.000013736809,0.000042137504,0.00005378727,0.9090521,0.0013947531,0.081944264,0.00029191485,0.006818257],"study_design_scores_gemma":[0.0000014805893,0.0000027608683,0.000020280755,0.000003361715,6.917987e-7,0.000004385218,0.0000020962796,0.9901191,0.00030107764,0.009483239,0.000059147344,0.0000023601267],"about_ca_topic_score_codex":0.002587332,"about_ca_topic_score_gemma":0.0016734472,"teacher_disagreement_score":0.0027830547,"about_ca_system_score_codex":0.001989043,"about_ca_system_score_gemma":0.0012603945,"threshold_uncertainty_score":0.014718413},"labels":[],"label_agreement":null},{"id":"W3163348940","doi":"10.1109/icassp39728.2021.9414769","title":"Optimal Detection in the Presence of Non-Gaussian Jamming","year":2021,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Carleton University","funders":"","keywords":"Gaussian; Detector; Transmitter; Channel (broadcasting); Algorithm; Additive white Gaussian noise; Gaussian noise; SIGNAL (programming language); Computer science; Transmission (telecommunications); Detection theory; Gaussian network model; Telecommunications; Physics","score_opus":0.011531288819310793,"score_gpt":0.2492841447967069,"score_spread":0.23775285597739612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163348940","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.13706583,0.0004238012,0.8576609,0.000558749,0.00003883931,0.000031776635,0.00007328926,0.00018498988,0.003961874],"genre_scores_gemma":[0.95101863,0.00020414044,0.047513925,0.00010450922,0.000033009084,0.00001930365,0.00004029593,0.000012866831,0.0010534885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981926,0.00074902707,0.000058240817,0.00028970276,0.0004062717,0.0003042607],"domain_scores_gemma":[0.99419445,0.004584877,0.0004979403,0.00027352822,0.0003365295,0.000112831796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022514628,0.00065211573,0.0011621525,0.00046219543,0.0003570608,0.001085225,0.00075761304,0.0012061313,0.00045187303],"category_scores_gemma":[0.011269007,0.00065339607,0.00036911655,0.00054747565,0.002217204,0.0016950711,0.0015730896,0.00095896627,0.00013518638],"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.00025771384,0.000046371257,0.0012108312,0.00008508085,0.000055226483,0.00053894945,0.00014529552,0.93375176,0.0047715385,0.047573976,0.00045044397,0.011112812],"study_design_scores_gemma":[0.000013516772,0.000030636806,0.0002408542,0.000005240874,0.000008475666,0.000081711,0.000027312106,0.9857001,0.0010673887,0.012705422,0.00011004397,0.000009299489],"about_ca_topic_score_codex":0.0021502688,"about_ca_topic_score_gemma":0.0020279835,"teacher_disagreement_score":0.0022514628,"about_ca_system_score_codex":0.0008450513,"about_ca_system_score_gemma":0.001233648,"threshold_uncertainty_score":0.0119069815},"labels":[],"label_agreement":null},{"id":"W3164808597","doi":"10.1109/tcomm.2023.3256415","title":"Constrained Secrecy Capacity of Finite-Input Intersymbol Interference Wiretap Channels","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"McMaster University","funders":"","keywords":"Intersymbol interference; Computer science; Markov chain; Markov process; Nyquist ISI criterion; Mathematical optimization; Secrecy; Iterative method; Interference (communication); Algorithm; Mathematics; Decoding methods; Computer network; Channel (broadcasting); Statistics; Computer security","score_opus":0.06085588529188848,"score_gpt":0.28098068462304443,"score_spread":0.22012479933115595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164808597","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.12381711,0.0007609943,0.8530121,0.00056017295,0.000046181623,0.0000650884,0.0006656871,0.00026737677,0.020805307],"genre_scores_gemma":[0.9780766,0.00084645895,0.018418679,0.000056213572,0.00004552939,0.000119903634,0.0002022017,0.0000525014,0.0021818518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853575,0.0004959312,0.000050654595,0.0001690712,0.00047688445,0.00027170798],"domain_scores_gemma":[0.9923889,0.0059248833,0.00052616,0.00048665603,0.0005434583,0.00012979642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016314354,0.0010085304,0.00097487995,0.00071037206,0.0005328673,0.0017342097,0.0014265337,0.0008973958,0.0028094237],"category_scores_gemma":[0.008240204,0.00039329822,0.00047809712,0.0013992884,0.0021002237,0.002427548,0.0015289941,0.001273255,0.00047225103],"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.00009617301,0.00002655489,0.0002172708,0.0001451539,0.000026183641,0.00026232365,0.000083297666,0.8261541,0.0035327142,0.16247804,0.0006017607,0.006376308],"study_design_scores_gemma":[0.000008469805,0.00001675108,0.00011442561,0.000022916634,0.000006379871,0.000043967455,0.000019989235,0.93520445,0.0018883332,0.062362444,0.00029863187,0.000013240939],"about_ca_topic_score_codex":0.002080915,"about_ca_topic_score_gemma":0.00121301,"teacher_disagreement_score":0.0028094237,"about_ca_system_score_codex":0.0014668341,"about_ca_system_score_gemma":0.0015733751,"threshold_uncertainty_score":0.010642707},"labels":[],"label_agreement":null},{"id":"W3168665672","doi":"10.1109/vtc2021-spring51267.2021.9448800","title":"Multi-Antenna Covert Communication With Jamming in the Presence of a Mobile Warden","year":2021,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Jamming; Computer science; Eavesdropping; Transmitter power output; Transmitter; Computer network; Covert; Transmission (telecommunications); Throughput; Base station; Wireless; Telecommunications","score_opus":0.016048939123801786,"score_gpt":0.2533779745569612,"score_spread":0.23732903543315942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168665672","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.22113445,0.0005605484,0.7718609,0.00033395554,0.000042621927,0.000042949334,0.000029299212,0.00018375125,0.0058116606],"genre_scores_gemma":[0.9846431,0.00017746794,0.01431134,0.000033942688,0.000017218304,0.000024711262,0.0000107958085,0.000009403645,0.00077192584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913955,0.00026219388,0.000027580769,0.00014242787,0.00025248266,0.00017569489],"domain_scores_gemma":[0.9984635,0.0007594685,0.00037754382,0.00018584215,0.00014849703,0.000065134154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005953699,0.00076275313,0.00081819977,0.00054200774,0.00073299045,0.00069720903,0.0008538309,0.0009316715,0.0005178884],"category_scores_gemma":[0.002154925,0.00032079886,0.0004503564,0.0007217196,0.0011668663,0.001272052,0.0012147167,0.000524147,0.00018051549],"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.0002522114,0.000056723944,0.0019239754,0.00014575396,0.0000969186,0.00088598294,0.00025300565,0.91401047,0.03444091,0.015304967,0.00061004434,0.032018997],"study_design_scores_gemma":[0.0000065876893,0.00012094317,0.00041438823,0.0000067085352,0.000021076465,0.0002718415,0.00004496591,0.9907708,0.0050992332,0.0028927417,0.0003379372,0.000012626519],"about_ca_topic_score_codex":0.0008044806,"about_ca_topic_score_gemma":0.00078119524,"teacher_disagreement_score":0.0009316715,"about_ca_system_score_codex":0.0006107323,"about_ca_system_score_gemma":0.00034709045,"threshold_uncertainty_score":0.0044312477},"labels":[],"label_agreement":null},{"id":"W3180641914","doi":"10.1109/iccworkshops50388.2021.9473807","title":"Enhancing Secrecy Capacity in Alternate AF Relaying Networks with Inter-Relay Interference","year":2021,"lang":"en","type":"article","venue":"","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":"Dalhousie University","funders":"","keywords":"Computer science; Relay; Secrecy; Fading; Artificial noise; Computer network; Wireless; Channel state information; Linear network coding; Electronic engineering; Channel (broadcasting); Physical layer; Telecommunications; Network packet; Power (physics); Engineering; Computer security","score_opus":0.023321866273442966,"score_gpt":0.2305318468967664,"score_spread":0.20720998062332344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180641914","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.29088742,0.001252108,0.6923624,0.0002770292,0.00006043829,0.000028382832,0.000086152395,0.0002936329,0.014752394],"genre_scores_gemma":[0.9866981,0.00038614523,0.012355351,0.000018882369,0.000013801652,0.000013259547,0.000017205863,0.0000071319682,0.00049018726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930835,0.00025035808,0.000028482777,0.00007598899,0.00020198114,0.00013480878],"domain_scores_gemma":[0.99798644,0.0012723578,0.00019924589,0.00022829279,0.00025959365,0.000054035663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009797572,0.00056670234,0.0005323067,0.0005231961,0.00047736807,0.0008088621,0.00070614676,0.000580778,0.0007083748],"category_scores_gemma":[0.0027399112,0.00021614552,0.0003529206,0.000619484,0.0011333466,0.0013008447,0.0009416232,0.00050115207,0.0001993068],"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.00027738253,0.000062201114,0.0013262542,0.00017054575,0.000051682426,0.000535953,0.00032937663,0.8154924,0.039321,0.0924243,0.00065458595,0.049354322],"study_design_scores_gemma":[0.00000848928,0.00009254309,0.00024350303,0.00001120741,0.000016492593,0.00015326553,0.00004050453,0.98069006,0.0074141873,0.0107698,0.0005426177,0.000017342772],"about_ca_topic_score_codex":0.0010897466,"about_ca_topic_score_gemma":0.0008225196,"teacher_disagreement_score":0.0010897466,"about_ca_system_score_codex":0.00064245984,"about_ca_system_score_gemma":0.0007081311,"threshold_uncertainty_score":0.0051814914},"labels":[],"label_agreement":null},{"id":"W3181432070","doi":"10.1109/jiot.2021.3095126","title":"Reliability Benefit of Location-Based Relay Selection for Cognitive Relay Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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":"Natural Science Foundation of Hunan Province; China Scholarship Council; National Natural Science Foundation of China","keywords":"Relay; Reliability (semiconductor); Computer science; Transmission (telecommunications); Selection (genetic algorithm); Overhead (engineering); Computer network; Stochastic geometry; Reliability engineering; Telecommunications; Statistics; Mathematics; Artificial intelligence; Engineering; Power (physics)","score_opus":0.012058976060867959,"score_gpt":0.25469269226804975,"score_spread":0.2426337162071818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181432070","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.08401811,0.0013400188,0.9091643,0.00037724976,0.00005526199,0.00003782875,0.000083633444,0.0001854226,0.004738081],"genre_scores_gemma":[0.98384386,0.0006791182,0.0147179635,0.000048315098,0.00004260289,0.000035180536,0.000023126677,0.000020952713,0.00058886345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869543,0.0005457345,0.000039071594,0.00017659173,0.00035801335,0.00018527986],"domain_scores_gemma":[0.99530953,0.0032284963,0.0005214541,0.00030303083,0.00055848755,0.000078987316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017121589,0.0011335787,0.00080246053,0.0007227909,0.0004042959,0.00089461135,0.001143778,0.00070147146,0.00089562667],"category_scores_gemma":[0.009024398,0.0003513438,0.00044509728,0.00064582744,0.0012110157,0.0014669948,0.0010270244,0.0006258508,0.00020790371],"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.00016315593,0.000043225704,0.001062888,0.00016462857,0.00005607421,0.00034390783,0.00016701405,0.90742695,0.013611332,0.056401704,0.000712877,0.019846182],"study_design_scores_gemma":[0.000012199866,0.00016602114,0.0005474418,0.000022539061,0.000048796912,0.00032039644,0.00007630031,0.97355723,0.00354879,0.021100637,0.00057596527,0.000023709406],"about_ca_topic_score_codex":0.0013740911,"about_ca_topic_score_gemma":0.0011745582,"teacher_disagreement_score":0.0017121589,"about_ca_system_score_codex":0.0011103051,"about_ca_system_score_gemma":0.0008873453,"threshold_uncertainty_score":0.00905484},"labels":[],"label_agreement":null},{"id":"W3183480454","doi":"10.1109/twc.2021.3096818","title":"Joint Resource Allocation for Ultra-Reliable and Low-Latency Radio Access Networks With Edge Computing","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Latency (audio); Network packet; Computer network; Transmission delay; Edge computing; Distributed computing; Computation; Energy consumption; Low latency (capital markets); Computation offloading; Efficient energy use; Enhanced Data Rates for GSM Evolution; Packet loss; Telecommunications; Algorithm","score_opus":0.027171798796177593,"score_gpt":0.2615853206823602,"score_spread":0.23441352188618259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183480454","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.053774666,0.00095924234,0.9410054,0.00023005552,0.00005486333,0.000083994266,0.000034193137,0.00016830773,0.003689238],"genre_scores_gemma":[0.92802274,0.0003847405,0.069758974,0.00007637622,0.00004642917,0.000082505874,0.000030243978,0.00003446722,0.0015635475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905926,0.00028960113,0.00004170926,0.00018181182,0.00019148148,0.00023608957],"domain_scores_gemma":[0.99919814,0.00043334192,0.00010315375,0.000074330324,0.00011516524,0.00007586505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096670544,0.0008230191,0.00089361204,0.00044736298,0.0006742416,0.0012275542,0.0015158224,0.000493849,0.0013579957],"category_scores_gemma":[0.0021029718,0.0003192258,0.0003617466,0.0007545459,0.0006720514,0.002015091,0.0014625103,0.0006514306,0.00015833322],"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.00030227358,0.00014656114,0.0008383346,0.00019894863,0.00007018192,0.00024268903,0.00012482308,0.858296,0.011753541,0.040806744,0.0019697344,0.08525025],"study_design_scores_gemma":[0.00000879753,0.00005651693,0.00010117598,0.0000052145165,0.000014319485,0.000047108042,0.000033786055,0.9902171,0.0014061921,0.0075822063,0.0005188603,0.00000879857],"about_ca_topic_score_codex":0.0013621405,"about_ca_topic_score_gemma":0.0022332242,"teacher_disagreement_score":0.0015158224,"about_ca_system_score_codex":0.0007296132,"about_ca_system_score_gemma":0.0009885606,"threshold_uncertainty_score":0.0052937865},"labels":[],"label_agreement":null},{"id":"W3189761152","doi":"10.1109/icc42927.2021.9500621","title":"Secrecy Analysis for Energy Harvesting-Enabled Cognitive Radio Networks in Cascaded Fading Channels","year":2021,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Jamming; Secrecy; Fading; Cognitive radio; Computer science; Energy harvesting; Underlay; Computer network; Physical layer; Reliability (semiconductor); Maximum power transfer theorem; Channel (broadcasting); Wireless; Transmission (telecommunications); Electronic engineering; Energy (signal processing); Telecommunications; Signal-to-noise ratio (imaging); Power (physics); Computer security; Engineering; Mathematics; Statistics","score_opus":0.022508377810597505,"score_gpt":0.252766594393617,"score_spread":0.23025821658301948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189761152","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.16645049,0.002049844,0.8146982,0.00052909245,0.000095878786,0.000096165044,0.00017533403,0.00017006716,0.015734928],"genre_scores_gemma":[0.9904208,0.0010506327,0.006550746,0.00005766311,0.000045316097,0.000044139255,0.000034292418,0.0000179214,0.0017783033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986016,0.00043565276,0.000047157908,0.00016707613,0.00042004493,0.0003284258],"domain_scores_gemma":[0.9927188,0.0050148326,0.00085124146,0.00030491257,0.0009615278,0.00014865679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018744771,0.0016112184,0.00095229474,0.0011179178,0.00086165813,0.0016216286,0.0010592246,0.0011524854,0.0017670897],"category_scores_gemma":[0.0056194076,0.0006750186,0.0010510209,0.0008451734,0.0025590942,0.0016024398,0.0016098262,0.0012471505,0.00031465146],"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.00018945092,0.000043943786,0.0013122645,0.0002620721,0.00010317581,0.00081152364,0.00024660563,0.91659606,0.012023838,0.06085658,0.0005901722,0.006964388],"study_design_scores_gemma":[0.0000050762264,0.000074553565,0.00037547943,0.000024199013,0.000037621725,0.0001787557,0.00005232548,0.9891468,0.0015629685,0.00833036,0.00019176332,0.000020099718],"about_ca_topic_score_codex":0.0026609506,"about_ca_topic_score_gemma":0.0022588617,"teacher_disagreement_score":0.0026609506,"about_ca_system_score_codex":0.0016378461,"about_ca_system_score_gemma":0.0011616047,"threshold_uncertainty_score":0.011883438},"labels":[],"label_agreement":null},{"id":"W3191209711","doi":"10.3390/fi13080205","title":"Cascaded κ-μ Fading Channels with Colluding and Non-Colluding Eavesdroppers: Physical-Layer Security Analysis","year":2021,"lang":"en","type":"article","venue":"Future Internet","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Eavesdropping; Secrecy; Computer science; Fading; Physical layer; Computer network; Transmitter; Poisson point process; Computer security; Topology (electrical circuits); Poisson distribution; Telecommunications; Wireless; Channel (broadcasting); Mathematics; Statistics","score_opus":0.010713098105262936,"score_gpt":0.24106678138399584,"score_spread":0.2303536832787329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191209711","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.14309695,0.00082329486,0.8452292,0.00030449493,0.00005076922,0.0001001388,0.00015569288,0.0001533946,0.010086176],"genre_scores_gemma":[0.9845515,0.0010443165,0.011392673,0.000050690698,0.00004700004,0.000059967504,0.000052468553,0.000014432307,0.002787061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998958,0.00021498204,0.00003932128,0.00015539236,0.00035098818,0.00028142886],"domain_scores_gemma":[0.99707437,0.0015459529,0.0005999952,0.00024945775,0.00043131993,0.00009890168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012903301,0.0012618245,0.00082301826,0.00071952236,0.0005960259,0.0012063805,0.0011896641,0.0010302038,0.0019951398],"category_scores_gemma":[0.003764981,0.0005591524,0.0009198061,0.00076800305,0.0016688077,0.002025824,0.0014639783,0.0013366491,0.00036289665],"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.00012309024,0.000047284433,0.0018771412,0.00011927914,0.000062404324,0.0009845778,0.00017353475,0.8790734,0.008892231,0.10128138,0.0005865165,0.0067791766],"study_design_scores_gemma":[0.000005703315,0.00004515544,0.0003829934,0.000009100027,0.000024855975,0.00017768145,0.00003589813,0.9907844,0.0011213679,0.007158992,0.00023688792,0.000016956074],"about_ca_topic_score_codex":0.0036984712,"about_ca_topic_score_gemma":0.0021146536,"teacher_disagreement_score":0.0036984712,"about_ca_system_score_codex":0.001329348,"about_ca_system_score_gemma":0.0009602531,"threshold_uncertainty_score":0.009645164},"labels":[],"label_agreement":null},{"id":"W3191578566","doi":"","title":"Signaling Games in Higher Dimensions: Geometric Properties of Equilibrium Solutions","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security 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":"Queen's University","funders":"","keywords":"Independent and identically distributed random variables; Gaussian; Scalar (mathematics); Mathematical optimization; Signaling game; Computer science; Distortion (music); Generalization; Applied mathematics; Mathematics; Quadratic equation; Mathematical economics; Mathematical analysis; Random variable; Physics; Geometry","score_opus":0.14240116132942282,"score_gpt":0.19180311373622622,"score_spread":0.049401952406803396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191578566","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.09902847,0.00030626066,0.87353665,0.0015298305,0.000047283207,0.00018256938,0.00027216793,0.0001059569,0.024990756],"genre_scores_gemma":[0.8769246,0.00078538206,0.11235524,0.00046760333,0.000120878874,0.0005137898,0.00029958895,0.00012457346,0.008408393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729186,0.0012603131,0.00015729721,0.0004588259,0.00043613446,0.00039567077],"domain_scores_gemma":[0.9918567,0.0055113914,0.0012664129,0.00034955092,0.0006040156,0.00041194353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034156311,0.0020191784,0.0015831761,0.0013914594,0.0011735868,0.0034812286,0.00147165,0.00311272,0.005737728],"category_scores_gemma":[0.014289509,0.0007768024,0.001730559,0.0010537877,0.0032009552,0.004369585,0.0034397412,0.0030453596,0.0008485649],"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.000040910705,0.000046515383,0.00033061206,0.00005850745,0.000035174995,0.000117565505,0.0001885113,0.067422956,0.0014080724,0.9258554,0.0007533304,0.0037425812],"study_design_scores_gemma":[0.000040526316,0.000056054036,0.00018895394,0.00003292376,0.0000132937885,0.000076281045,0.0001330936,0.26486513,0.0006049257,0.732899,0.0010632598,0.000026452308],"about_ca_topic_score_codex":0.0009907618,"about_ca_topic_score_gemma":0.00065035524,"teacher_disagreement_score":0.005737728,"about_ca_system_score_codex":0.0027613556,"about_ca_system_score_gemma":0.0012209296,"threshold_uncertainty_score":0.020035088},"labels":[],"label_agreement":null},{"id":"W3193396119","doi":"10.1109/tit.2021.3107215","title":"Vector Gaussian Successive Refinement With Degraded Side Information","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security 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":"McMaster University","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Natural Science Foundation of Tianjin City; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Converse; Mathematics; Gaussian; Monotone polygon; Quadratic equation; Upper and lower bounds; Random variable; Algorithm; Gaussian process; Matching (statistics); Gaussian random field; Discrete mathematics; Combinatorics; Mathematical analysis; Statistics","score_opus":0.006778377218197648,"score_gpt":0.20762778639906698,"score_spread":0.20084940918086933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193396119","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.017192466,0.00029863924,0.97908235,0.00014667434,0.000026433465,0.00003211069,0.00006359947,0.0000954066,0.0030623132],"genre_scores_gemma":[0.7359409,0.0011893306,0.2556758,0.00026483345,0.000098393764,0.000163779,0.00024829665,0.00010034579,0.006318303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986889,0.0004467803,0.00006767733,0.0001800335,0.00043906737,0.00017768303],"domain_scores_gemma":[0.9967713,0.0020714384,0.00033815912,0.00042713492,0.0003111381,0.00008082258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027170454,0.0012591346,0.0009494269,0.00050615205,0.00030995053,0.00087585906,0.0012783227,0.0007722493,0.0021818734],"category_scores_gemma":[0.007094262,0.0003684974,0.00084986695,0.0008257437,0.0018745885,0.0020909412,0.002053392,0.0015584722,0.0005556735],"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.0005956434,0.00005759008,0.0008092538,0.0003508866,0.00011515969,0.0005184474,0.00039537452,0.39999697,0.03773969,0.5039411,0.001441185,0.054038722],"study_design_scores_gemma":[0.00003468845,0.00011355676,0.00013780761,0.00002599366,0.000022880791,0.00017689972,0.000026625312,0.9133598,0.0141684525,0.070839055,0.0010670987,0.000027162778],"about_ca_topic_score_codex":0.0016350921,"about_ca_topic_score_gemma":0.0011586673,"teacher_disagreement_score":0.0027170454,"about_ca_system_score_codex":0.0009084732,"about_ca_system_score_gemma":0.0008328576,"threshold_uncertainty_score":0.014369309},"labels":[],"label_agreement":null},{"id":"W3198016044","doi":"10.1109/isit45174.2021.9517832","title":"Neural Computation of Capacity Region of Memoryless Multiple Access Channels","year":2021,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Upper and lower bounds; Mutual information; Parameterized complexity; Divergence (linguistics); Boundary (topology); Kullback–Leibler divergence; Estimator; Channel (broadcasting); Set (abstract data type); Mathematics; Computer science; Algorithm; Topology (electrical circuits); Combinatorics; Artificial intelligence; Mathematical analysis; Statistics; Telecommunications","score_opus":0.12633980607014952,"score_gpt":0.20795036526710933,"score_spread":0.08161055919695981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198016044","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.0345745,0.000256693,0.96070886,0.0003483874,0.000020589474,0.000022640173,0.000046156405,0.00015450268,0.003867689],"genre_scores_gemma":[0.8826736,0.00023325357,0.114312105,0.0001591,0.000033029053,0.00011651156,0.00008799586,0.000086415595,0.0022979626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940896,0.000241041,0.000024113007,0.00008377261,0.00017350509,0.00006864291],"domain_scores_gemma":[0.99592173,0.0032652207,0.00021559779,0.00016426296,0.00031269653,0.00012043183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023718907,0.0005209119,0.0006966392,0.00064022915,0.00037383824,0.0013057217,0.0012812708,0.0011720887,0.0015413146],"category_scores_gemma":[0.012680002,0.00040661864,0.0004410271,0.00034915106,0.0015738426,0.0023010252,0.001618196,0.0014894578,0.00017102047],"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.0000466356,0.000015996686,0.00029817945,0.00004170079,0.000012308557,0.00004238985,0.000052216838,0.9200966,0.0015392265,0.07101609,0.0002620406,0.0065766172],"study_design_scores_gemma":[0.000001353558,0.0000025785098,0.00002016189,0.0000029616292,5.5908333e-7,0.0000041421085,0.0000021009787,0.99179006,0.0002598342,0.007861638,0.00005258999,0.0000020549753],"about_ca_topic_score_codex":0.0022492337,"about_ca_topic_score_gemma":0.0015294324,"teacher_disagreement_score":0.0023718907,"about_ca_system_score_codex":0.001793914,"about_ca_system_score_gemma":0.0010828436,"threshold_uncertainty_score":0.013015866},"labels":[],"label_agreement":null},{"id":"W3198805658","doi":"10.1109/isit45174.2021.9518202","title":"Second-Order Asymptotics for One-way Secret Key Agreement","year":2021,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alice and Bob; Key (lock); Alice (programming language); Computer science; Public-key cryptography; Cryptography; One-way function; Shared secret; Theoretical computer science; Construct (python library); Protocol (science); Order (exchange); Key-agreement protocol; Key exchange; Key distribution; Discrete mathematics; Computer security; Computer network; Mathematics; Encryption","score_opus":0.023932885897247135,"score_gpt":0.2504430442407956,"score_spread":0.22651015834354848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198805658","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.019552508,0.0030152,0.93739897,0.002537143,0.00032142625,0.00012492899,0.00023982194,0.0014580206,0.035352077],"genre_scores_gemma":[0.6888092,0.0069245403,0.27004892,0.002782211,0.0017620659,0.0016142532,0.0009148839,0.001710983,0.0254329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902103,0.0027058295,0.0003455922,0.0013862641,0.003918836,0.0014331164],"domain_scores_gemma":[0.9176409,0.064840615,0.0035216946,0.007792396,0.0046916176,0.0015127981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010130555,0.0025063748,0.0023664718,0.003364762,0.0028361103,0.004018161,0.0038169206,0.0030529827,0.009201194],"category_scores_gemma":[0.08195767,0.001203514,0.0032951322,0.0032834387,0.00846149,0.014827755,0.0056863246,0.012209219,0.004069823],"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.00026062323,0.0001284192,0.0010802163,0.00034610607,0.000090559835,0.00027449967,0.0005454178,0.050607566,0.0037761722,0.92147875,0.0055673933,0.01584435],"study_design_scores_gemma":[0.000042901906,0.0000943909,0.00039205025,0.00012346967,0.000053031174,0.00023197086,0.00008994293,0.31094465,0.0026560894,0.6799553,0.005355744,0.00006038063],"about_ca_topic_score_codex":0.0017915511,"about_ca_topic_score_gemma":0.0014727083,"teacher_disagreement_score":0.010130555,"about_ca_system_score_codex":0.00764853,"about_ca_system_score_gemma":0.003576547,"threshold_uncertainty_score":0.05549419},"labels":[],"label_agreement":null},{"id":"W3199885671","doi":"10.46470/03d8ffbd.bd54c70c","title":"Physical Layer Security Analysis of Hybrid MIMO Technology","year":2021,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"MIMO; Physical layer; Computer science; Spatial multiplexing; Multi-user MIMO; Fading; Spectral efficiency; Electronic engineering; Computer network; Wireless; 3G MIMO; Single antenna interference cancellation; Telecommunications; Channel (broadcasting); Engineering","score_opus":0.010241084089165124,"score_gpt":0.25981781273762555,"score_spread":0.24957672864846042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199885671","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.30477348,0.004503459,0.6366936,0.0006894061,0.000113284004,0.000097320175,0.0002943826,0.00025592456,0.05257917],"genre_scores_gemma":[0.98856455,0.0008262703,0.007970687,0.00006119268,0.000041971573,0.00002722153,0.00004548122,0.000015505257,0.0024471544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929,0.00017026626,0.00001959105,0.00007928536,0.00028390417,0.00015707068],"domain_scores_gemma":[0.99862957,0.000655658,0.00022097932,0.00013609648,0.0003187937,0.000038993043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007545595,0.0008206118,0.00040099982,0.00064783957,0.00034180415,0.0012377328,0.0004542828,0.0007538946,0.0022062948],"category_scores_gemma":[0.0016969725,0.00023793204,0.00044565875,0.0004498938,0.0011384804,0.0012150401,0.0008459073,0.0005787597,0.0004567916],"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.00017783459,0.000062239866,0.0019891672,0.00015932479,0.00009315667,0.00046193122,0.00012521727,0.7749942,0.035753436,0.17342986,0.0009900378,0.01176358],"study_design_scores_gemma":[0.0000033283527,0.000046706064,0.00046600527,0.000009873704,0.000009342798,0.0000985903,0.000022443652,0.9902548,0.0017269359,0.007033592,0.00031781118,0.000010503429],"about_ca_topic_score_codex":0.0010344352,"about_ca_topic_score_gemma":0.0004820555,"teacher_disagreement_score":0.0022062948,"about_ca_system_score_codex":0.0009936369,"about_ca_system_score_gemma":0.00044510615,"threshold_uncertainty_score":0.0073807836},"labels":[],"label_agreement":null},{"id":"W3207738372","doi":"10.1109/iswcs49558.2021.9562204","title":"To Jam or Not to Jam in Gaussian MIMO Wiretap Channels ?: Invited Paper","year":2021,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Ottawa","funders":"","keywords":"MIMO; Artificial noise; Computer science; Precoding; Jamming; Transmitter power output; Secrecy; Fading; Channel state information; Telecommunications; Computer network; Topology (electrical circuits); Channel (broadcasting); Wireless; Physical layer; Transmitter; Computer security; Engineering; Electrical engineering; Physics","score_opus":0.025558482281105785,"score_gpt":0.28101921701388943,"score_spread":0.25546073473278363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207738372","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.10730997,0.125248,0.54303104,0.048163738,0.013073462,0.00010766839,0.0005878697,0.00031094835,0.16216736],"genre_scores_gemma":[0.8071388,0.076632336,0.039040208,0.0038009575,0.012450897,0.00004606808,0.0002237502,0.00016761122,0.060499493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966836,0.00011253257,0.000010025299,0.000068716865,0.0000656401,0.0000747134],"domain_scores_gemma":[0.9990664,0.00061250705,0.000050829534,0.00002917108,0.00018989327,0.000051212806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007517608,0.00044568488,0.00040248927,0.00031057795,0.00034215514,0.001260443,0.00043434429,0.0010845849,0.0033703442],"category_scores_gemma":[0.0023464274,0.00023357259,0.00028921245,0.000614793,0.0011078165,0.0016376831,0.0005505964,0.0013162412,0.0007220704],"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.000496345,0.000155126,0.0013855388,0.0014168628,0.00015788492,0.00089768786,0.0005581004,0.08697367,0.008501919,0.59193873,0.116087675,0.19143043],"study_design_scores_gemma":[0.000058142134,0.00036375536,0.0018838189,0.00055838254,0.0001371771,0.0011648773,0.0010993019,0.27881423,0.011772635,0.5459835,0.15792574,0.00023849438],"about_ca_topic_score_codex":0.0009231577,"about_ca_topic_score_gemma":0.0008708145,"teacher_disagreement_score":0.0033703442,"about_ca_system_score_codex":0.0007056372,"about_ca_system_score_gemma":0.00035466114,"threshold_uncertainty_score":0.011274934},"labels":[],"label_agreement":null},{"id":"W3211079129","doi":"10.1109/tit.2022.3150597","title":"Decoder Ties Do Not Affect the Error Exponent of the Memoryless Binary Symmetric Channel","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science and Technology, Taiwan","keywords":"Binary symmetric channel; Decoding methods; Probability of error; Binary number; Mathematics; Upper and lower bounds; Channel (broadcasting); Algorithm; Context (archaeology); Combinatorics; Binary erasure channel; Discrete mathematics; Coding (social sciences); Channel code; Computer science; Statistics; Channel capacity; Telecommunications; Arithmetic","score_opus":0.01571022881577252,"score_gpt":0.2302066348714496,"score_spread":0.21449640605567707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211079129","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.47687557,0.0037285998,0.47709885,0.0035307214,0.0003735658,0.00008851,0.0005819685,0.00061421306,0.037108038],"genre_scores_gemma":[0.9806608,0.00071764796,0.0150273135,0.00031645788,0.000085931606,0.00004618026,0.00010233136,0.0001038926,0.0029392908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981515,0.00051962957,0.000079209305,0.00034363175,0.00046326514,0.00044271178],"domain_scores_gemma":[0.97168195,0.020474432,0.002259078,0.0035932453,0.0014711756,0.0005201194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003111553,0.00095001014,0.0010373836,0.00094754726,0.0008904825,0.0021725306,0.0014783414,0.0012912287,0.002454146],"category_scores_gemma":[0.039960906,0.00056599674,0.00043810406,0.00073522667,0.0029130452,0.00460571,0.0021555913,0.002887584,0.00044107632],"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.00154916,0.000099331104,0.004981263,0.00055022596,0.00016354393,0.0008146926,0.000509949,0.30009234,0.030000722,0.6019718,0.005567302,0.05369966],"study_design_scores_gemma":[0.00008233445,0.00029961552,0.0019506454,0.00016434297,0.00009712441,0.00081699924,0.00016042976,0.7375714,0.028433502,0.22744294,0.0028663005,0.0001143779],"about_ca_topic_score_codex":0.0011225304,"about_ca_topic_score_gemma":0.0013268592,"teacher_disagreement_score":0.003111553,"about_ca_system_score_codex":0.0018690616,"about_ca_system_score_gemma":0.0016373269,"threshold_uncertainty_score":0.01645565},"labels":[],"label_agreement":null},{"id":"W3215009688","doi":"10.1109/itw48936.2021.9611419","title":"Secret Key Capacity of Wiretapped Polytree-PIN","year":2021,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Channel (broadcasting); Randomness; Key (lock); Shared secret; Information leakage; Computer network; Theoretical computer science; Adversary; Information-theoretic security; Point (geometry); Key generation; Secrecy; Topology (electrical circuits); Cryptography; Computer security; Mathematics; Combinatorics","score_opus":0.01858253250838794,"score_gpt":0.21914235380921873,"score_spread":0.20055982130083078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215009688","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.28626412,0.00160871,0.663013,0.0013122405,0.00012573652,0.00016162852,0.0016100983,0.00063152344,0.04527293],"genre_scores_gemma":[0.98962116,0.0008155346,0.0062822,0.00009670173,0.00004584651,0.00013727072,0.00019306116,0.00007119004,0.0027369822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981127,0.00047184786,0.000060291983,0.00031950898,0.00045918341,0.00057647086],"domain_scores_gemma":[0.9899267,0.0073675183,0.00076722115,0.000892754,0.0006937187,0.0003520652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014749069,0.000937554,0.001332147,0.0011020084,0.0010600409,0.002568745,0.0018997298,0.0011940332,0.0058453614],"category_scores_gemma":[0.008011456,0.00052871945,0.0008968594,0.0013731604,0.00336104,0.005230335,0.0031487122,0.0019886864,0.0006678702],"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.00036360853,0.00008904604,0.00045456423,0.00041107068,0.00007575033,0.0005451757,0.0003402375,0.46961334,0.0073233796,0.507224,0.003969001,0.009590898],"study_design_scores_gemma":[0.000022589598,0.00007319742,0.00015432552,0.00005115015,0.00002416826,0.0002533596,0.00012745117,0.76104724,0.0026480395,0.2342396,0.0013192113,0.000039750623],"about_ca_topic_score_codex":0.0018422673,"about_ca_topic_score_gemma":0.0008572943,"teacher_disagreement_score":0.0058453614,"about_ca_system_score_codex":0.0023886473,"about_ca_system_score_gemma":0.0017104384,"threshold_uncertainty_score":0.019554675},"labels":[],"label_agreement":null},{"id":"W3217582627","doi":"10.1109/twc.2021.3097000","title":"Joint Secure Transceiver Design and Power Allocation for AN-Assisted MIMO Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Eavesdropping; Computer science; Artificial noise; MIMO; Secrecy; Transceiver; Interference (communication); Transmitter power output; Computer network; Channel (broadcasting); Physical layer; Secure communication; Electronic engineering; Wireless; Transmitter; Telecommunications; Computer security; Encryption; Engineering","score_opus":0.046993120017577876,"score_gpt":0.27378299053002186,"score_spread":0.22678987051244398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217582627","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.00754588,0.0001437833,0.98992795,0.000072071685,0.000023853163,0.000025285766,0.000015687207,0.00006287133,0.0021826357],"genre_scores_gemma":[0.82159734,0.0006932607,0.17322232,0.0001354515,0.000099769524,0.00017287441,0.000057857815,0.000028489007,0.003992631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928254,0.00022941722,0.000039937397,0.00010509096,0.00025509368,0.00008798189],"domain_scores_gemma":[0.9992617,0.00028466663,0.0001400452,0.00008129875,0.0002010094,0.000031246764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086663966,0.0010032462,0.00044743487,0.00037489194,0.00038967555,0.00094508496,0.0006777236,0.000630753,0.0013466593],"category_scores_gemma":[0.0014194795,0.00030341942,0.00033033377,0.00049587095,0.00064385834,0.00077067787,0.00089948584,0.0006625168,0.00049691525],"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.000080101214,0.00006145089,0.0004827972,0.00013503354,0.00005362168,0.0001912807,0.00011290934,0.87439847,0.026965639,0.04074782,0.0009950175,0.05577597],"study_design_scores_gemma":[0.00000803814,0.00007110902,0.00006364021,0.000006035539,0.000012162801,0.000060262188,0.000015177759,0.9907135,0.0032468643,0.0049856165,0.00080950436,0.000008057918],"about_ca_topic_score_codex":0.0006958257,"about_ca_topic_score_gemma":0.001031848,"teacher_disagreement_score":0.0013466593,"about_ca_system_score_codex":0.0005296574,"about_ca_system_score_gemma":0.00081343594,"threshold_uncertainty_score":0.0045832396},"labels":[],"label_agreement":null},{"id":"W4200065057","doi":"10.1109/vtc2021-fall52928.2021.9625332","title":"Secrecy Outage Probability and Secrecy Capacity for Autonomous Driving in a Cascaded Rayleigh Fading Environment","year":2021,"lang":"en","type":"article","venue":"2021 IEEE 94th Vehicular Technology Conference (VTC2021-Fall)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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":"Rayleigh fading; Secrecy; Relay; Fading; Computer science; Transmitter; Computer network; Secure communication; Transmission (telecommunications); Wireless; Communications system; Electronic engineering; Computer security; Telecommunications; Engineering; Channel (broadcasting); Encryption","score_opus":0.02327316765091591,"score_gpt":0.227065883454158,"score_spread":0.2037927158032421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200065057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70224583,0.0016920296,0.2778881,0.00062314834,0.00007829068,0.00007720519,0.0005085984,0.00035748212,0.016529372],"genre_scores_gemma":[0.9967687,0.00031934454,0.002376875,0.0000105246245,0.000013519055,0.000012177696,0.000050568815,0.000008959391,0.0004393145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991392,0.00024329155,0.00003267808,0.00008554145,0.00026756685,0.00023175689],"domain_scores_gemma":[0.9887052,0.008733129,0.0010236718,0.0005236867,0.0008288714,0.00018538714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014743865,0.00058791245,0.000526398,0.0008919146,0.00053544616,0.00082612026,0.00055115693,0.00059750304,0.0021207107],"category_scores_gemma":[0.009636696,0.0002749599,0.00042065623,0.0010346378,0.0014023087,0.0013420869,0.0008893428,0.00065821485,0.00028796218],"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.00012256647,0.000025264311,0.0025398317,0.00005209115,0.000017097622,0.00030654235,0.00007192274,0.9754768,0.002199319,0.013023211,0.00051527517,0.0056501417],"study_design_scores_gemma":[0.000007293794,0.000087046436,0.0015475615,0.0000121845105,0.000013776766,0.0002045288,0.00007297973,0.99117273,0.0016756468,0.0049959687,0.00018964753,0.000020672067],"about_ca_topic_score_codex":0.0037683162,"about_ca_topic_score_gemma":0.0026655102,"teacher_disagreement_score":0.0037683162,"about_ca_system_score_codex":0.0013285252,"about_ca_system_score_gemma":0.0010282692,"threshold_uncertainty_score":0.009639204},"labels":[],"label_agreement":null},{"id":"W4200084599","doi":"10.1145/3453186","title":"MEC-Based Jamming-Aided Anti-Eavesdropping with Deep Reinforcement Learning for WBANs","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Internet Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Eavesdropping; Computer science; Jamming; Reinforcement learning; Benchmark (surveying); Transmission (telecommunications); Wireless sensor network; Energy consumption; Data transmission; Wireless; Channel (broadcasting); Computer network; Artificial intelligence; Telecommunications; Engineering; Electrical engineering","score_opus":0.013136715178443397,"score_gpt":0.2413551674865831,"score_spread":0.2282184523081397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200084599","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.0470536,0.0003349798,0.94947255,0.0001929536,0.000042164895,0.000033974055,0.000016210222,0.00035971103,0.0024937815],"genre_scores_gemma":[0.973245,0.000099028286,0.025067447,0.00009847002,0.000014318186,0.000030268526,0.00001840672,0.000014190959,0.0014130404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995555,0.00011870081,0.000022173934,0.00008371852,0.00012261813,0.000097216376],"domain_scores_gemma":[0.99920124,0.00038571912,0.00010764261,0.00007715707,0.00017885078,0.00004930269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008196575,0.0005992468,0.0006443402,0.00022865225,0.00030179345,0.00043380415,0.0009122855,0.0006571349,0.0008454025],"category_scores_gemma":[0.0019599472,0.00023222738,0.0002937235,0.00021636183,0.00070572604,0.0008200345,0.0009330115,0.0010440666,0.00015515921],"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.00014559139,0.00009691839,0.0008407669,0.0000552297,0.00004792046,0.0000853422,0.00007135444,0.92334074,0.0061793635,0.006284583,0.00068433245,0.06216775],"study_design_scores_gemma":[0.0000041678354,0.000033009666,0.000051381478,0.0000020883892,0.000004113743,0.00001046772,0.0000031626346,0.9982443,0.00072618126,0.00082842226,0.00008974096,0.0000029988003],"about_ca_topic_score_codex":0.002623308,"about_ca_topic_score_gemma":0.002996616,"teacher_disagreement_score":0.002623308,"about_ca_system_score_codex":0.0005640986,"about_ca_system_score_gemma":0.00087535015,"threshold_uncertainty_score":0.0052161217},"labels":[],"label_agreement":null},{"id":"W4205681265","doi":"10.1109/tvt.2022.3143174","title":"Resource Allocation for URLLC-Oriented Two-Way UAV Relaying","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Flexibility (engineering); Resource allocation; Optimization problem; Constraint (computer-aided design); Mathematical optimization; Resource management (computing); Software deployment; Wireless; Transmission (telecommunications); Distributed computing; Computer network; Engineering; Algorithm; Telecommunications; Mathematics","score_opus":0.010830410893873184,"score_gpt":0.23730690337605936,"score_spread":0.22647649248218618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205681265","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.04616153,0.0009344002,0.94500273,0.00022898929,0.000052888547,0.00007882828,0.000050571824,0.0002263815,0.007263692],"genre_scores_gemma":[0.93490803,0.00051282515,0.062037047,0.00005574556,0.000034225843,0.000090475005,0.00004552633,0.000028635352,0.002287501],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994523,0.00018614811,0.000028037155,0.00009897676,0.0001134402,0.00012113767],"domain_scores_gemma":[0.9995571,0.00020468268,0.000077758974,0.000032810593,0.00009554753,0.000031988304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006233672,0.00089636137,0.0008359211,0.0005168023,0.0005158411,0.001118964,0.00086948345,0.0006803429,0.0015737759],"category_scores_gemma":[0.0012590596,0.00033861044,0.00039812218,0.00066424184,0.0005056245,0.0010078523,0.00090092124,0.0004770701,0.00029025687],"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.00012380289,0.00006258327,0.00057812536,0.00015808873,0.00004131376,0.00028670434,0.0001356568,0.92754966,0.012311836,0.013165264,0.0016604888,0.043926485],"study_design_scores_gemma":[0.000009790814,0.000038036498,0.00008073895,0.0000039845922,0.000009612666,0.000055581422,0.000022870472,0.9970074,0.0010839883,0.0013038457,0.00037666727,0.000007412694],"about_ca_topic_score_codex":0.0031160733,"about_ca_topic_score_gemma":0.0035260213,"teacher_disagreement_score":0.0031160733,"about_ca_system_score_codex":0.00088077073,"about_ca_system_score_gemma":0.0009424714,"threshold_uncertainty_score":0.006390512},"labels":[],"label_agreement":null},{"id":"W4210320086","doi":"10.1109/globecom46510.2021.9686005","title":"Anti-Jamming in Cell Free mMIMO systems","year":2021,"lang":"en","type":"article","venue":"2021 IEEE Global Communications Conference (GLOBECOM)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Jamming; Computer science; Exploit; Real-time computing; Computer security","score_opus":0.03353475156486492,"score_gpt":0.26973714704263235,"score_spread":0.23620239547776745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210320086","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.08487617,0.0007905299,0.9072634,0.00020105338,0.0000739797,0.000039910465,0.0000314823,0.00021812091,0.006505389],"genre_scores_gemma":[0.9569053,0.0003665447,0.040404588,0.00015463673,0.0000665251,0.000050182225,0.000022599583,0.000016041926,0.0020136074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999241,0.00029381757,0.0000209356,0.00011577189,0.00023340975,0.000095174706],"domain_scores_gemma":[0.99926907,0.00031106733,0.00014621578,0.00007885749,0.00015627699,0.000038528182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007246404,0.0008114177,0.00069617026,0.00031568628,0.00045234108,0.0008285333,0.0006625904,0.0009420997,0.00071672606],"category_scores_gemma":[0.0017449213,0.00033436625,0.000386341,0.00036340053,0.00082266226,0.00094813824,0.0010183031,0.00068592787,0.00032530617],"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.0004216475,0.00011590088,0.0016059441,0.00025371442,0.0001481092,0.00037039502,0.00029272938,0.8132366,0.069094025,0.0402705,0.0010716866,0.073118694],"study_design_scores_gemma":[0.000011517222,0.00017561104,0.0003903886,0.000011918431,0.000021824644,0.000091515874,0.000031363383,0.98806584,0.00599039,0.004511478,0.000680583,0.000017565584],"about_ca_topic_score_codex":0.000533832,"about_ca_topic_score_gemma":0.0005776429,"teacher_disagreement_score":0.0009420997,"about_ca_system_score_codex":0.00029090984,"about_ca_system_score_gemma":0.00035153326,"threshold_uncertainty_score":0.0038323402},"labels":[],"label_agreement":null},{"id":"W4221156816","doi":"10.1109/ciss53076.2022.9751178","title":"On Distributed Lossy Coding of Symmetrically Correlated Gaussian Sources","year":2022,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Huawei Technologies (Canada); McMaster University","funders":"","keywords":"Lossy compression; Encoder; Upper and lower bounds; Gaussian; Distortion (music); Algorithm; Cramér–Rao bound; Rate distortion; Function (biology); Decoding methods; Mathematics; Discrete mathematics; Computer science; Coding (social sciences); Statistics; Mathematical analysis; Physics; Telecommunications","score_opus":0.010145557330683005,"score_gpt":0.21911023057698667,"score_spread":0.20896467324630366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221156816","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.028330863,0.0010517071,0.96597886,0.0004278255,0.00004144966,0.000036368616,0.00008823118,0.000103695085,0.0039409823],"genre_scores_gemma":[0.88435733,0.003484996,0.09877312,0.00029667758,0.00019575222,0.00026157196,0.00033581286,0.0000927297,0.012201982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893147,0.00039426365,0.000031562475,0.00015694516,0.00033975128,0.0001460382],"domain_scores_gemma":[0.9961093,0.0029061644,0.00033962948,0.00021636268,0.00035086155,0.00007762975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019094007,0.0015379266,0.0011394966,0.00083942397,0.00041535046,0.0010885161,0.001717629,0.0015154948,0.0015895163],"category_scores_gemma":[0.00725686,0.00059328193,0.0004623803,0.001212078,0.0021771602,0.0031493905,0.0018396834,0.0016326405,0.00041029725],"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.00012557798,0.00002384537,0.00017295404,0.00007840085,0.000018187198,0.000160819,0.00008073604,0.875219,0.0015703606,0.111917324,0.00068187463,0.0099509815],"study_design_scores_gemma":[0.000011989869,0.000022736504,0.000053820204,0.000011726765,0.000005976641,0.000040668765,0.000010453242,0.97075135,0.00052150944,0.028266056,0.00029537553,0.000008343006],"about_ca_topic_score_codex":0.0029673653,"about_ca_topic_score_gemma":0.002024678,"teacher_disagreement_score":0.0029673653,"about_ca_system_score_codex":0.0021561855,"about_ca_system_score_gemma":0.0009832573,"threshold_uncertainty_score":0.015644252},"labels":[],"label_agreement":null},{"id":"W4224924102","doi":"10.1109/icassp43922.2022.9747823","title":"Data-Driven Optimization for Zero-Delay Lossy Source Coding with Side Information","year":2022,"lang":"en","type":"article","venue":"ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","topic":"Wireless Communication Security 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":"University of Toronto","funders":"","keywords":"Quantization (signal processing); Computer science; Algorithm; Decoding methods; Encoder; Lossy compression; Rate–distortion theory; Markov process; Coding (social sciences); Theoretical computer science; Data compression; Mathematics; Artificial intelligence","score_opus":0.04797476613202885,"score_gpt":0.28985177087721303,"score_spread":0.2418770047451842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224924102","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.009453076,0.00009390291,0.9891262,0.00005380452,0.000009105918,0.000018473344,0.000024246188,0.00014024436,0.0010808483],"genre_scores_gemma":[0.6905082,0.00020665546,0.3050997,0.00011881539,0.000027440854,0.00014988736,0.00013475635,0.00007559413,0.003679094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997745,0.00005965338,0.000012997917,0.000040290422,0.000089241454,0.000023248629],"domain_scores_gemma":[0.99965,0.0001951676,0.000041278046,0.000034498968,0.00006839773,0.000010697235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005132342,0.0005834884,0.00048976537,0.00018497072,0.00022153929,0.00050628063,0.00083075126,0.0004709081,0.0015363811],"category_scores_gemma":[0.0012123955,0.00028716165,0.00025225861,0.00026393193,0.0005474412,0.0007891648,0.0007327442,0.0007490752,0.00038720344],"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.00018133756,0.000053572723,0.00032330645,0.00012178399,0.0000346416,0.00007156643,0.00011521099,0.83758104,0.024181802,0.041904125,0.0010053238,0.094426244],"study_design_scores_gemma":[0.000009807309,0.000030097697,0.000031998738,0.000005251166,0.0000031584027,0.000014853884,0.0000032949326,0.99079144,0.0050379983,0.003655922,0.00041093247,0.000005295659],"about_ca_topic_score_codex":0.0012764758,"about_ca_topic_score_gemma":0.0018932142,"teacher_disagreement_score":0.0015363811,"about_ca_system_score_codex":0.0005516707,"about_ca_system_score_gemma":0.00087682426,"threshold_uncertainty_score":0.005139649},"labels":[],"label_agreement":null},{"id":"W4225831761","doi":"10.23977/acss.2022.060107","title":"Physical-layer Security from Channel Resolvability","year":2022,"lang":"en","type":"article","venue":"Advances in Computer Signals and Systems","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Secrecy; Physical layer; Channel (broadcasting); Computer science; Computer network; Wireless; Layer (electronics); Point (geometry); Computer security; Telecommunications; Mathematics","score_opus":0.016492967419280396,"score_gpt":0.2596233220298596,"score_spread":0.24313035461057922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225831761","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.042335235,0.0012544681,0.9396856,0.0010153947,0.00016345776,0.00008482382,0.000092002796,0.00038312277,0.014985858],"genre_scores_gemma":[0.9009211,0.0017047388,0.09317861,0.00031410524,0.00021319947,0.00016920983,0.000109835,0.000119296405,0.0032699753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9917904,0.0032470708,0.0003010683,0.00082067185,0.0028678882,0.00097289064],"domain_scores_gemma":[0.9577323,0.03031538,0.0026836642,0.00642156,0.0023289565,0.00051811256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006864321,0.0017655956,0.0015299938,0.0014844751,0.0012155853,0.0037508407,0.0013704436,0.0021587887,0.0029034105],"category_scores_gemma":[0.030381044,0.000683601,0.0009992855,0.0010274348,0.0054191635,0.007208385,0.0062578283,0.003962511,0.001037391],"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.0008419767,0.00009741496,0.0019987635,0.0004944798,0.00014568775,0.0006383072,0.0004030655,0.18503647,0.04432053,0.70423746,0.0013802118,0.060405746],"study_design_scores_gemma":[0.00008330818,0.0005759107,0.0010982872,0.00020706028,0.00009365687,0.0019301733,0.00021527005,0.57341033,0.087010145,0.33026472,0.004950417,0.00016075982],"about_ca_topic_score_codex":0.00024045639,"about_ca_topic_score_gemma":0.00016050281,"teacher_disagreement_score":0.006864321,"about_ca_system_score_codex":0.0009799186,"about_ca_system_score_gemma":0.0014593723,"threshold_uncertainty_score":0.036302447},"labels":[],"label_agreement":null},{"id":"W4226036023","doi":"10.1109/tac.2022.3142121","title":"Quadratic signaling with prior mismatch at an encoder and decoder: equilibria, continuity, and robustness properties","year":2022,"lang":"en","type":"article","venue":"Bilkent University Institutional Repository (Bilkent University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Stackelberg competition; Affine transformation; Mathematical optimization; Robustness (evolution); Computer science; Encoder; Gaussian; Probabilistic logic; Prior probability; Observability; Nash equilibrium; Mathematics; Mathematical economics; Applied mathematics; Artificial intelligence; Bayesian probability","score_opus":0.013072331713286967,"score_gpt":0.16855868401833055,"score_spread":0.15548635230504357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226036023","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.119205244,0.00014253338,0.8666683,0.0014611676,0.0000352552,0.00012360411,0.000235135,0.00025376314,0.011874956],"genre_scores_gemma":[0.9407487,0.00017885517,0.052703638,0.00018659161,0.00004090517,0.00019772482,0.00011840932,0.00006609946,0.005759001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952887,0.0018585211,0.00022905448,0.0010558082,0.0009581638,0.0006096116],"domain_scores_gemma":[0.9837986,0.010794278,0.0025946163,0.0011591497,0.0010215071,0.0006318364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005466108,0.0016155043,0.0019268051,0.0009101571,0.0010438403,0.002820265,0.002492857,0.0031261186,0.004353928],"category_scores_gemma":[0.03194368,0.0008984071,0.0014207149,0.0009999598,0.0036626696,0.0052742846,0.0038237004,0.003551287,0.000772214],"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.000415083,0.00014743945,0.0009819192,0.00013470273,0.00011327356,0.00047458793,0.0004421343,0.3617271,0.005669204,0.6183419,0.00086025696,0.010692378],"study_design_scores_gemma":[0.00006190391,0.00015339539,0.0002666436,0.00003600198,0.000030472424,0.00011907988,0.00009569705,0.72749746,0.00279988,0.2683646,0.00052734395,0.000047534766],"about_ca_topic_score_codex":0.0020851248,"about_ca_topic_score_gemma":0.0009046622,"teacher_disagreement_score":0.005466108,"about_ca_system_score_codex":0.0031002038,"about_ca_system_score_gemma":0.0021307413,"threshold_uncertainty_score":0.028907835},"labels":[],"label_agreement":null},{"id":"W4226445202","doi":"10.1063/5.0088507","title":"Uniform continuity bound for sandwiched Rényi conditional entropy","year":2022,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Google","keywords":"Conditional entropy; Mathematics; Upper and lower bounds; Entropy (arrow of time); Dimension (graph theory); Combinatorics; Simple (philosophy); Conditional quantum entropy; Statistical physics; Mathematical analysis; Discrete mathematics; Pure mathematics; Physics; Joint quantum entropy; Thermodynamics; Statistics; Principle of maximum entropy; Maximum entropy thermodynamics","score_opus":0.01971534044519943,"score_gpt":0.26862425758491204,"score_spread":0.2489089171397126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226445202","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.058467623,0.0038942855,0.91387874,0.0019069047,0.0003660838,0.00010652325,0.00052468496,0.00064312265,0.020212065],"genre_scores_gemma":[0.857393,0.0029022396,0.12529784,0.0015913474,0.0009037264,0.0004675863,0.0007100093,0.0005850149,0.010149277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961784,0.0012858905,0.0001973097,0.0008702517,0.00095802755,0.0005101145],"domain_scores_gemma":[0.97219014,0.01884864,0.001399547,0.0031556368,0.0029358505,0.0014701564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009415814,0.0019218426,0.0018759266,0.0029974265,0.0011421972,0.0032581137,0.0041382047,0.0024300793,0.009450786],"category_scores_gemma":[0.042784285,0.0010213212,0.0020226885,0.0017029381,0.005389245,0.009802358,0.0074842107,0.0066716075,0.0015214063],"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.00041685137,0.000101869264,0.0030864526,0.00041569138,0.00017998314,0.0005315643,0.00039709208,0.040703915,0.010157344,0.91677505,0.0029461787,0.024288053],"study_design_scores_gemma":[0.00003889763,0.00021276317,0.0027713107,0.00022688495,0.0000980488,0.00058939564,0.00008875508,0.35243163,0.012696924,0.62695247,0.0037544349,0.00013846176],"about_ca_topic_score_codex":0.00074911903,"about_ca_topic_score_gemma":0.00040262128,"teacher_disagreement_score":0.009450786,"about_ca_system_score_codex":0.0022399887,"about_ca_system_score_gemma":0.00095670164,"threshold_uncertainty_score":0.049796224},"labels":[],"label_agreement":null},{"id":"W4226452241","doi":"10.1109/twc.2022.3157885","title":"Mean-Field Artificial Noise Assistance and Uplink Power Control in Covert IoT Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); York University","funders":"","keywords":"Stackelberg competition; Artificial noise; Computer science; Covert; Computer security; Transmission (telecommunications); Telecommunications link; Secrecy; Game theory; Wireless; Computer network; Channel (broadcasting); Transmitter; Telecommunications; Mathematics","score_opus":0.01819467926173051,"score_gpt":0.2513880791529263,"score_spread":0.2331933998911958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226452241","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.07419501,0.00075557036,0.91406554,0.0005648444,0.00014534908,0.00004587184,0.00007070897,0.00012692889,0.010030177],"genre_scores_gemma":[0.98672706,0.00034287304,0.010104102,0.00008935434,0.000059299873,0.000040590265,0.00001946673,0.000016100346,0.0026010717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905664,0.00027761652,0.0000267059,0.00021423287,0.00026245633,0.00016234978],"domain_scores_gemma":[0.9976355,0.001445545,0.00041452682,0.00011553319,0.00030086385,0.000087956745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087465433,0.00092829595,0.0008453538,0.00050850026,0.00063623185,0.001124915,0.0009912706,0.001246626,0.0012470945],"category_scores_gemma":[0.0029403388,0.00038525055,0.00064885884,0.00045505882,0.0020056083,0.0014657192,0.0009459452,0.0009410075,0.00022660001],"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.00014665464,0.000055233275,0.001082533,0.00014979979,0.00006492071,0.0005658418,0.00017814172,0.8827029,0.009158545,0.09462981,0.00076874375,0.010496905],"study_design_scores_gemma":[0.0000072262983,0.000047139278,0.00015900315,0.000007433216,0.000010874134,0.00006375012,0.000018281795,0.98813885,0.0006030824,0.010579164,0.00035391786,0.000011279017],"about_ca_topic_score_codex":0.0015870422,"about_ca_topic_score_gemma":0.00093280745,"teacher_disagreement_score":0.0015870422,"about_ca_system_score_codex":0.0011213116,"about_ca_system_score_gemma":0.0005631781,"threshold_uncertainty_score":0.008135736},"labels":[],"label_agreement":null},{"id":"W4230675624","doi":"10.1002/wcm.723","title":"Joint optimization of power scheduling and rate‐distortion performance in<i>one‐helper</i>problem","year":2008,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","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":"Concordia University; Queen's University","funders":"","keywords":"Computer science; Mathematical optimization; Scheduling (production processes); Coding (social sciences); Rate–distortion theory; Optimization problem; Gaussian; Channel code; Decoding methods; Information theory; Source code; Fusion center; Algorithm; Wireless; Telecommunications; Mathematics; Cognitive radio","score_opus":0.024924281214584214,"score_gpt":0.23310509517172573,"score_spread":0.20818081395714153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230675624","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.13837959,0.0011577873,0.8449799,0.0017454114,0.00008007671,0.00016058036,0.00028162124,0.00022426905,0.012990751],"genre_scores_gemma":[0.93528795,0.00050980825,0.060067825,0.00018093699,0.00011341757,0.00011080727,0.000114298935,0.00009167761,0.0035233677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830353,0.00087100186,0.00006364754,0.00025075141,0.00022682513,0.00028416462],"domain_scores_gemma":[0.99320835,0.004997969,0.00067654933,0.00037012584,0.00043688077,0.00031006293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004133707,0.00156636,0.0023681025,0.0007627782,0.00062458246,0.0023235106,0.001612348,0.001885917,0.0024488568],"category_scores_gemma":[0.0075981673,0.0006669556,0.0005715183,0.0009756818,0.0019010812,0.0020282373,0.0013153915,0.0010354152,0.00048529476],"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.00055142574,0.00018911583,0.00089380186,0.00025817854,0.00014636459,0.00037902154,0.00015334446,0.9155963,0.005045607,0.04707691,0.002862783,0.02684723],"study_design_scores_gemma":[0.00007369438,0.0001320161,0.00032967044,0.00002116197,0.000032794338,0.0001519406,0.00006983401,0.9734369,0.0024084426,0.02280641,0.0005125666,0.000024563937],"about_ca_topic_score_codex":0.0023820116,"about_ca_topic_score_gemma":0.0009576438,"teacher_disagreement_score":0.004133707,"about_ca_system_score_codex":0.00200894,"about_ca_system_score_gemma":0.0015766248,"threshold_uncertainty_score":0.021861374},"labels":[],"label_agreement":null},{"id":"W4235898637","doi":"10.31130/jst.2015.12","title":"Capacity of Bernoulli-Gaussian Interference Channels in Rayleigh Fading with Full CSI","year":2015,"lang":"en","type":"article","venue":"The University of Danang - Journal of Science and Technology","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":"McGill University","funders":"","keywords":"Upper and lower bounds; Rayleigh fading; Channel state information; Fading; Gaussian; Bernoulli's principle; Channel (broadcasting); Channel capacity; Mathematics; Transmitter; Piecewise; Interference (communication); Control theory (sociology); Topology (electrical circuits); Computer science; Telecommunications; Mathematical analysis; Physics; Combinatorics; Wireless","score_opus":0.02020149842799908,"score_gpt":0.2029118081558591,"score_spread":0.18271030972786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235898637","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.1300192,0.0023681503,0.8537119,0.0004211079,0.000044533983,0.000049923667,0.000281464,0.00044404448,0.012659703],"genre_scores_gemma":[0.97361463,0.001104543,0.02372629,0.00008480152,0.00003707832,0.000098818295,0.00012103419,0.000048545695,0.0011644036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982152,0.00056731043,0.00004432671,0.00016983319,0.000504363,0.0004990375],"domain_scores_gemma":[0.99029607,0.0077672303,0.0005184011,0.00041766994,0.00090949266,0.000091111986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021456205,0.0010874528,0.0010502562,0.0013404799,0.000565942,0.0013806511,0.001123679,0.0007191741,0.0011489737],"category_scores_gemma":[0.012370331,0.00035479775,0.00035512936,0.0015215309,0.0025033406,0.0020334483,0.0012833489,0.0010149465,0.00030800785],"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.00006454176,0.0000141136325,0.00056419894,0.00007835723,0.000020156398,0.00013324794,0.000070550464,0.9614036,0.0019069947,0.02822889,0.0003380058,0.0071774093],"study_design_scores_gemma":[0.0000026153516,0.000012898157,0.00021302725,0.00001393617,0.0000065220593,0.00004081827,0.000016775268,0.99017686,0.0011555188,0.008161845,0.00018787778,0.000011370758],"about_ca_topic_score_codex":0.0045671565,"about_ca_topic_score_gemma":0.0022067681,"teacher_disagreement_score":0.0045671565,"about_ca_system_score_codex":0.0018257039,"about_ca_system_score_gemma":0.0013596986,"threshold_uncertainty_score":0.013246477},"labels":[],"label_agreement":null},{"id":"W4250445649","doi":"10.1109/isit.2014.6874782","title":"Table of contents","year":2014,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; National Institute of Information and Communications Technology; Russian Academy of Sciences; University at Buffalo; University of California, Davis; University of California, Riverside; University of California, Los Angeles; University of Illinois at Urbana-Champaign; École Normale Supérieure de Lyon; Pontifícia Universidade Católica do Rio de Janeiro; Lomonosov Moscow State University; Universität Rostock; ITMO University; Shahid Rajaee Teacher Training University; Ministry of Public Security of the People's Republic of China; Alexandria University; University of Science and Technology of China; Universidade Federal de Pernambuco; Singapore University of Technology and Design; University of Tsukuba; National Taiwan University; Austrian Institute of Technology; National Taiwan Normal University; Bilkent Üniversitesi; University of California, Irvine; Oulun Yliopisto; National Chiao Tung University; Technische Universität München; Xidian University; Nanjing University of Science and Technology; Universitetet i Bergen; Chinese University of Hong Kong; Universidad de Buenos Aires; Centre National de la Recherche Scientifique; University of Tokyo; Tartu Ülikool; Kharazmi University; Danmarks Tekniske Universitet; Hong Kong Polytechnic University; Kungliga Tekniska Högskolan; Qatar University; Orta Doğu Teknik Üniversitesi; Mahidol University; Universidad Carlos III de Madrid; Tsinghua University; Branco Weiss Fellowship – Society in Science; King Abdullah University of Science and Technology; Indian Institute of Technology Madras; American University in Cairo; Institute for Research in Fundamental Sciences; Strong; University of Hong Kong; Tel Aviv University; Electronics and Telecommunications Research Institute; Hebrew University of Jerusalem; Beijing Institute of Technology; Queen's University; Iran Telecommunication Research Center; Universidad Complutense de Madrid; Shanghai Educational Development Foundation; Technion-Israel Institute of Technology; Concordia University; Institute for Infocomm Research; Chalmers Tekniska Högskola; University of California, San Diego; University of Johannesburg; Southern Methodist University; Worcester Polytechnic Institute; Aalto-Yliopisto; Gyeongsang National University; California State University, Northridge; Pusan National University; Jet Propulsion Laboratory; Technische Universität Dresden; Pohang University of Science and Technology; Bar-Ilan University; Università degli Studi di Brescia; Dankook University; Yonsei University; Sharif University of Technology; Chinese Academy of Sciences; Technische Universität Kaiserslautern; Monash University; Technische Universiteit Delft; Griffith University; University of Newcastle Australia; Sun Yat-sen University; École Polytechnique Fédérale de Lausanne; Nanyang Technological University; Agency for Science, Technology and Research; University College London; York University; University of South Australia; Institute of Science and Technology Austria; University of Tokushima; University of Cyprus; Princeton University; University of Patras; Shanghai Jiao Tong University; Raytheon Company; Rutgers, The State University of New Jersey; Technische Universität Darmstadt; Ben-Gurion University of the Negev; McMaster University; University of Science and Technology Beijing; University of Ottawa; Intel Corporation; Hong Kong University of Science and Technology; North Carolina State University; Université du Luxembourg; Eidgenössische Technische Hochschule Zürich; Max-Planck-Institut für Mathematik in den Naturwissenschaften; Southeast University; Nanjing University; Indian Institute of Technology Bombay; Institut national de recherche en informatique et en automatique (INRIA); University College Dublin; Université de Lorraine; McGill University; Drexel University; University of Notre Dame; Tata Institute of Fundamental Research; Colorado State University; Centre National d’Etudes Spatiales; Institute for Information and Communications Technology Promotion; University of Arizona; Indian Institute of Science; University of Waterloo; City University of Hong Kong; Lawrence Berkeley National Laboratory; Seoul National University; Northwestern University; Politecnico di Torino; Budapesti Műszaki és Gazdaságtudományi Egyetem; University of Minnesota; Massachusetts Institute of Technology; Helsingin Yliopisto; Syracuse University; Magyar Tudományos Akadémia; Samsung; Universidade Estadual de Campinas; Universitat Pompeu Fabra; Arizona State University; Turun Yliopisto; Yale University; University of California, Santa Barbara; University of Wisconsin-Madison; Norges Teknisk-Naturvitenskapelige Universitet; Consejo Nacional de Investigaciones Científicas y Técnicas; École Normale Supérieure; Rice University; Georgia Institute of Technology; University of Toronto; Ulsan National Institute of Science and Technology; Imperial College London; Korea Advanced Institute of Science and Technology; University of Alberta; California Institute of Technology; Universidad de Chile; Beijing Jiaotong University; Iowa State University; Korea University; Jacobs University; Carnegie Mellon University; Institució Catalana de Recerca i Estudis Avançats; Louisiana State University; University of Southern California; Purdue University; University of Texas at Austin; Ohio State University; Lunds Universitet; University of Sydney; Indian National Science Academy; Aalborg Universitet; National University of Singapore","keywords":"Table (database); Computer science; Database","score_opus":0.013633670503543045,"score_gpt":0.22215232476178182,"score_spread":0.20851865425823876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250445649","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007323927,0.0044604894,0.003873434,0.007162372,0.0187072,0.00043544016,0.014775162,0.0017697733,0.94808376],"genre_scores_gemma":[0.0040250253,0.0032370547,0.0021899834,0.003123038,0.0036688035,0.00020903074,0.011707959,0.0007137396,0.97112536],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993042,0.00009800411,0.000052100542,0.00012865024,0.0003456954,0.00007136978],"domain_scores_gemma":[0.9973551,0.00043163274,0.000115366194,0.00032301727,0.0013443019,0.00043055764],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006770639,0.00079519436,0.00090826896,0.0025606833,0.0016981886,0.0039407564,0.0016650789,0.0014273273,0.78247726],"category_scores_gemma":[0.0064933617,0.00029550146,0.0005369963,0.0024351,0.00044395082,0.002859234,0.002080522,0.0015064247,0.6712027],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000021707747,0.000023914006,0.00014351156,0.00018129521,0.0000034731333,0.000046530768,0.000040103074,0.00010873259,0.00017272455,0.0045565795,0.92913324,0.06556812],"study_design_scores_gemma":[0.0000023490313,0.000009423505,0.0001527027,0.00007954272,0.000001720661,0.000059731363,0.000034534598,0.000041154253,0.00006240462,0.0011707912,0.99838233,0.000003252058],"about_ca_topic_score_codex":0.002464296,"about_ca_topic_score_gemma":0.0026739254,"teacher_disagreement_score":0.21752274,"about_ca_system_score_codex":0.001551098,"about_ca_system_score_gemma":0.0024095764,"threshold_uncertainty_score":0.31026977},"labels":[],"label_agreement":null},{"id":"W4280530302","doi":"10.1109/wcnc51071.2022.9771727","title":"Physical Layer Authentication for LEO Satellite Constellations","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Wireless Communications and Networking Conference (WCNC)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Physical layer; Computer science; Transmitter; Spoofing attack; Authentication (law); Fading; Computer network; Satellite; Node (physics); False alarm; Channel (broadcasting); Wireless; Telecommunications; Computer security; Artificial intelligence; Engineering","score_opus":0.05421901260512946,"score_gpt":0.2884848776591816,"score_spread":0.23426586505405217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280530302","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.079499975,0.0009945341,0.91227186,0.00057196134,0.00012567121,0.00007355673,0.000039207138,0.0007620109,0.0056611514],"genre_scores_gemma":[0.9581895,0.00026236626,0.03927912,0.0000663907,0.000045221055,0.00002901612,0.000035253175,0.000010699364,0.0020823907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993174,0.000187525,0.000045098546,0.00008786941,0.00025089263,0.00011117845],"domain_scores_gemma":[0.99868625,0.00038457618,0.00022963088,0.0003852722,0.00027258057,0.00004157564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007554837,0.00032211267,0.00027002543,0.00049187,0.000679195,0.00094188744,0.00040670548,0.00058035133,0.0018292703],"category_scores_gemma":[0.0033210672,0.0001612122,0.00020017562,0.0003044928,0.0006899248,0.0014832894,0.0015819465,0.0006448664,0.00066390075],"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.0011101968,0.0001399503,0.008566555,0.00039188765,0.00009112081,0.0015661205,0.0012389022,0.1614756,0.25357354,0.12561482,0.0052815755,0.4409498],"study_design_scores_gemma":[0.000032659093,0.00028878654,0.002022866,0.000049737228,0.000034512508,0.00094457844,0.00020696668,0.92303497,0.046614885,0.016185822,0.010528448,0.000055772474],"about_ca_topic_score_codex":0.000632692,"about_ca_topic_score_gemma":0.0006157382,"teacher_disagreement_score":0.0018292703,"about_ca_system_score_codex":0.00044826113,"about_ca_system_score_gemma":0.00039168316,"threshold_uncertainty_score":0.0061194897},"labels":[],"label_agreement":null},{"id":"W4282556227","doi":"10.36227/techrxiv.20055920","title":"Reputation-Aware Relay Selection with Opportunistic Spectrum Access: A Blockchain Approach","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security 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":"Carleton University","funders":"","keywords":"Relay; Computer science; Blockchain; Cognitive radio; Computer network; Secrecy; Latency (audio); Computer security; Reputation; Credibility; Selection (genetic algorithm); Telecommunications; Wireless; Artificial intelligence","score_opus":0.03201545788076131,"score_gpt":0.2740884944302809,"score_spread":0.24207303654951956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282556227","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.03709291,0.00033028072,0.9556599,0.00044651364,0.00004724889,0.00011733691,0.0000734151,0.00021956886,0.0060128807],"genre_scores_gemma":[0.9243128,0.00028889024,0.06979093,0.000059598195,0.000051704013,0.00011421467,0.0000751845,0.000034697972,0.005272102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981583,0.00080167357,0.00007473306,0.00028180305,0.00044676315,0.00023673955],"domain_scores_gemma":[0.9951739,0.0029269215,0.00053071347,0.00064279966,0.00045759216,0.00026803964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025112187,0.0005348537,0.0011737462,0.0005812163,0.00083902973,0.0017108099,0.0018753115,0.0012752012,0.004399735],"category_scores_gemma":[0.00610879,0.00040927553,0.0005085715,0.0008670288,0.0013895888,0.0028943964,0.0021183486,0.0010928811,0.0006242067],"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.00029825224,0.00014043917,0.0013543532,0.00008133981,0.0000615013,0.00044737256,0.00022470726,0.8473295,0.0040812613,0.09285185,0.0012023663,0.051926915],"study_design_scores_gemma":[0.000016687865,0.000030375752,0.000050142986,0.00000485431,0.000005712923,0.000036568967,0.000013686031,0.9823675,0.00040854132,0.016533833,0.000525714,0.000006401155],"about_ca_topic_score_codex":0.002469372,"about_ca_topic_score_gemma":0.002787228,"teacher_disagreement_score":0.004399735,"about_ca_system_score_codex":0.0010188217,"about_ca_system_score_gemma":0.0014095603,"threshold_uncertainty_score":0.014718592},"labels":[],"label_agreement":null},{"id":"W4282582198","doi":"10.36227/techrxiv.20055920.v1","title":"Reputation-Aware Relay Selection with Opportunistic Spectrum Access: A Blockchain Approach","year":2022,"lang":"en","type":"preprint","venue":"","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":"Carleton University","funders":"","keywords":"Computer science; Relay; Blockchain; Computer network; Cognitive radio; Secrecy; Computer security; Latency (audio); Reputation; Selection (genetic algorithm); Credibility; Telecommunications; Wireless; Artificial intelligence","score_opus":0.03201545788076131,"score_gpt":0.2740884944302809,"score_spread":0.24207303654951956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282582198","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.038563967,0.00032136255,0.95500016,0.0004133522,0.000044363453,0.00012727366,0.00007763606,0.0002248553,0.0052269134],"genre_scores_gemma":[0.9221717,0.00028753583,0.07258156,0.000061140556,0.000048920796,0.000126368,0.00007919333,0.000034116118,0.0046093827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981001,0.0008047674,0.00008305846,0.00030476943,0.00046754914,0.00023975573],"domain_scores_gemma":[0.9944201,0.0034177648,0.00061488285,0.00075015344,0.00050081767,0.00029624542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002591841,0.0005688995,0.001220676,0.00062867673,0.0009365313,0.0017536893,0.0019174782,0.001328496,0.004382736],"category_scores_gemma":[0.006695337,0.00042227336,0.00055347744,0.0009233204,0.0014536945,0.002936924,0.002243676,0.0011312583,0.00062216795],"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.00035088186,0.00015325444,0.0016129756,0.00010237425,0.00007359542,0.0005416093,0.00027571546,0.84009683,0.00496722,0.09764159,0.0011802249,0.053003646],"study_design_scores_gemma":[0.00002143843,0.000036536367,0.00005660364,0.0000060642255,0.000007549873,0.000050901537,0.000015489915,0.9795346,0.00051612913,0.019160474,0.0005863001,0.0000077857285],"about_ca_topic_score_codex":0.002211131,"about_ca_topic_score_gemma":0.0026521941,"teacher_disagreement_score":0.004382736,"about_ca_system_score_codex":0.0009474273,"about_ca_system_score_gemma":0.0014938149,"threshold_uncertainty_score":0.01466167},"labels":[],"label_agreement":null},{"id":"W4283218341","doi":"10.1155/2022/5342655","title":"Statistical Characteristics and Security Analysis over Multi-Cascade κ-μ Shadowed Channels","year":2022,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":true,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Henan Polytechnic University","keywords":"Cascade; Eavesdropping; Probability density function; Fading; Cumulative distribution function; Reliability (semiconductor); Computer science; Correctness; Channel (broadcasting); Statistics; Statistical physics; Algorithm; Mathematics; Topology (electrical circuits); Telecommunications; Physics; Engineering; Computer security","score_opus":0.010301090317398894,"score_gpt":0.263630084694524,"score_spread":0.2533289943771251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283218341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4994919,0.0010115809,0.4923437,0.0002998818,0.0000436279,0.000074650816,0.00033464536,0.00033601234,0.0060639745],"genre_scores_gemma":[0.9955876,0.00038401163,0.0031363822,0.000022687638,0.000024912031,0.000017712913,0.000062998806,0.00001560121,0.0007481265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990754,0.00015707186,0.000029492357,0.00016477559,0.00034099928,0.00023218695],"domain_scores_gemma":[0.99506783,0.002330328,0.0011203001,0.00048931135,0.0008316849,0.0001606401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009913372,0.0011445715,0.00075733947,0.0010386835,0.00067374826,0.00081330654,0.00085528026,0.00066037575,0.0012381845],"category_scores_gemma":[0.004613024,0.0004897542,0.00065729336,0.0011002775,0.0015998511,0.0018392194,0.0009689808,0.0008781554,0.00024328154],"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.00035497776,0.000058129634,0.011776373,0.00017706648,0.00010600544,0.0015409975,0.00036496532,0.88901424,0.03392868,0.048887946,0.00080333656,0.012987149],"study_design_scores_gemma":[0.000008359077,0.0000833113,0.0031542191,0.000010722073,0.000032948887,0.0004122781,0.00007001065,0.98387593,0.003968619,0.0080467,0.00029549634,0.000041413135],"about_ca_topic_score_codex":0.0035153748,"about_ca_topic_score_gemma":0.0019923626,"teacher_disagreement_score":0.0035153748,"about_ca_system_score_codex":0.0010044364,"about_ca_system_score_gemma":0.00069398264,"threshold_uncertainty_score":0.0072878003},"labels":[],"label_agreement":null},{"id":"W4285042956","doi":"10.22215/etd/2022-15015","title":"Optimal Detection in the Presence of Non-Gaussian Jamming","year":2022,"lang":"en","type":"dissertation","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Carleton University","funders":"Ministère de l'Education Nationale, de l'Enseignement Superieur et de la Recherche; Ministry of Higher Education and Scientific Research; Ministry of Education, Libya","keywords":"Jamming; Transmitter; Computer science; Gaussian; Eavesdropping; Additive white Gaussian noise; Channel (broadcasting); Gaussian noise; Detector; Electronic engineering; Channel state information; Algorithm; Telecommunications; Wireless; Computer network; Engineering; Physics","score_opus":0.009046152155926721,"score_gpt":0.268189383118491,"score_spread":0.25914323096256425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285042956","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.04894515,0.0006079274,0.94672644,0.00036451803,0.00003139941,0.000020255822,0.000037781407,0.0002037881,0.0030626506],"genre_scores_gemma":[0.8722573,0.0006788835,0.12380772,0.00014857473,0.000064091975,0.000052566797,0.000083293125,0.000031224325,0.0028762878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988067,0.00043642928,0.000045471854,0.00023595674,0.0002915553,0.00018381781],"domain_scores_gemma":[0.99482924,0.0041478323,0.00044513406,0.00015752173,0.0003316821,0.000088640285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016520882,0.0006151247,0.001434385,0.00052301015,0.0003445308,0.0015975914,0.0008793108,0.0012398042,0.0005252743],"category_scores_gemma":[0.008719414,0.0007580655,0.00052780204,0.00056846347,0.001617365,0.0015508218,0.0014787827,0.0010445805,0.00022402429],"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.00016466342,0.00005156918,0.0012335739,0.00015584861,0.00005944578,0.00028995704,0.00019984695,0.90797406,0.005641845,0.05580363,0.0006588045,0.027766744],"study_design_scores_gemma":[0.000006914723,0.000024108853,0.00019825115,0.000008048482,0.0000052491782,0.00004466191,0.00001849285,0.98908734,0.0007882311,0.009631014,0.00017676597,0.000010990056],"about_ca_topic_score_codex":0.001679809,"about_ca_topic_score_gemma":0.0016513759,"teacher_disagreement_score":0.001679809,"about_ca_system_score_codex":0.0011069762,"about_ca_system_score_gemma":0.0016563154,"threshold_uncertainty_score":0.008737206},"labels":[],"label_agreement":null},{"id":"W4285464686","doi":"10.32920/ryerson.14651595","title":"Enhancement of Wyner-Ziv video coding for wireless channels","year":2021,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Fading; Computer science; Encoder; Decoding methods; Algorithm; Coding (social sciences); Channel (broadcasting); Wireless; Real-time computing; Mathematics; Telecommunications; Statistics","score_opus":0.031899828977247566,"score_gpt":0.2813180670560394,"score_spread":0.24941823807879182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285464686","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.026718227,0.0010012754,0.9660405,0.0001930363,0.000079832396,0.000046433986,0.000060154776,0.00025204621,0.0056084534],"genre_scores_gemma":[0.6055812,0.0022887338,0.38610762,0.000245557,0.00010241177,0.00012719778,0.00028568495,0.00007244906,0.005189063],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99949884,0.00008371058,0.000019340423,0.000040291838,0.00030574916,0.000052049454],"domain_scores_gemma":[0.9994777,0.0001621067,0.000055324028,0.00007050246,0.00021813945,0.00001629015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044899495,0.00047914515,0.00030249372,0.00048838335,0.00021209556,0.00041511114,0.0005054354,0.0004971727,0.000884469],"category_scores_gemma":[0.0014465511,0.00010950712,0.0002805002,0.0006782774,0.00037035075,0.00080869795,0.0005596586,0.0006842812,0.00024134346],"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.00029785506,0.00011572981,0.001559322,0.00030647032,0.00004659126,0.00043339617,0.00019327864,0.2242176,0.20893843,0.17506929,0.0046138903,0.3842081],"study_design_scores_gemma":[0.000011847092,0.00007658769,0.00032868897,0.000028547582,0.000011127381,0.0001896446,0.000019698253,0.9405834,0.046010993,0.006843691,0.0058752685,0.000020556836],"about_ca_topic_score_codex":0.002748976,"about_ca_topic_score_gemma":0.0032718966,"teacher_disagreement_score":0.002748976,"about_ca_system_score_codex":0.0005027305,"about_ca_system_score_gemma":0.0007608979,"threshold_uncertainty_score":0.0054659247},"labels":[],"label_agreement":null},{"id":"W4287854949","doi":"10.1109/mnet.002.2100312","title":"Autonomous Collaborative Authentication with Privacy Preservation in 6G: From Homogeneity to Heterogeneity","year":2022,"lang":"en","type":"article","venue":"IEEE Network","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"H2020 European Research Council; National Natural Science Foundation of China","keywords":"Computer science; Authentication (law); Computer security; Overhead (engineering); Information sharing; Computer network; World Wide Web","score_opus":0.0170007635704327,"score_gpt":0.24865339090557173,"score_spread":0.23165262733513903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287854949","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.039096918,0.00047872995,0.95677644,0.00040423323,0.00005327944,0.00008478007,0.00003094306,0.0002990298,0.0027756603],"genre_scores_gemma":[0.95477855,0.00026175662,0.04305992,0.00011918499,0.00006989439,0.000056371642,0.000044989956,0.00001612077,0.0015931741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99568594,0.00133892,0.00026506002,0.0009512985,0.0011960866,0.00056277576],"domain_scores_gemma":[0.99594706,0.0010131064,0.000530452,0.0018011658,0.00048244026,0.00022587166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027337617,0.0006052877,0.001140142,0.0006440526,0.0014603497,0.0022517904,0.0019009166,0.0014158688,0.000739233],"category_scores_gemma":[0.0048278724,0.00035951106,0.0009675029,0.001078111,0.0019399464,0.0049384753,0.0052936203,0.0015777752,0.00034313658],"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.0011588815,0.0002344547,0.007058831,0.00030309576,0.00023957739,0.0017731045,0.0020344646,0.25581318,0.060955126,0.3554483,0.0035254895,0.31145546],"study_design_scores_gemma":[0.000043270928,0.00027908452,0.0010790398,0.000031962838,0.00008459747,0.00089904206,0.00023977298,0.8977471,0.014221153,0.07854124,0.0067618084,0.00007190014],"about_ca_topic_score_codex":0.0013278453,"about_ca_topic_score_gemma":0.0006434102,"teacher_disagreement_score":0.0027337617,"about_ca_system_score_codex":0.0010459089,"about_ca_system_score_gemma":0.0012454784,"threshold_uncertainty_score":0.014457703},"labels":[],"label_agreement":null},{"id":"W4287855148","doi":"10.1109/mnet.005.2100336","title":"Audio-Based Security Techniques for Secure Device-to-Device Communications","year":2022,"lang":"en","type":"article","venue":"IEEE Network","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"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 New Brunswick; University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Computer science; Jamming; Computer security; Computer network; Key (lock); Secure communication; Transmission (telecommunications); Secure transmission; Telecommunications; Encryption","score_opus":0.02778900915874035,"score_gpt":0.2883409479884754,"score_spread":0.2605519388297351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287855148","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.013834049,0.0078050015,0.96237475,0.0007055889,0.000286901,0.00007762896,0.00003264032,0.00025004984,0.014633346],"genre_scores_gemma":[0.6864737,0.015101804,0.2830421,0.0006369878,0.0007309986,0.00017302588,0.00007727591,0.00007535498,0.013688744],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991591,0.00017325323,0.000050562525,0.00010010416,0.0004408344,0.000076108474],"domain_scores_gemma":[0.99883336,0.00049656513,0.00018300166,0.00023508212,0.00022308873,0.000028867362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006360909,0.0008184212,0.0003902339,0.00097302074,0.0006963219,0.0011117037,0.00062771636,0.0009348614,0.0031973377],"category_scores_gemma":[0.0016233535,0.0003210889,0.00045787316,0.0005651192,0.0011826983,0.0024901028,0.0015406726,0.0014629365,0.0011276884],"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.0003560597,0.00010448964,0.00084825745,0.0012579546,0.000101228106,0.00065477716,0.000627733,0.023414113,0.29540175,0.33552605,0.003601608,0.33810595],"study_design_scores_gemma":[0.00011671887,0.0010620019,0.0015037676,0.0006071015,0.00027721116,0.0064515113,0.00072639954,0.34271207,0.3609399,0.14116527,0.14421871,0.00021943433],"about_ca_topic_score_codex":0.00020021171,"about_ca_topic_score_gemma":0.00020676956,"teacher_disagreement_score":0.0031973377,"about_ca_system_score_codex":0.00048200059,"about_ca_system_score_gemma":0.00038221976,"threshold_uncertainty_score":0.010696173},"labels":[],"label_agreement":null},{"id":"W4288752527","doi":"10.1007/s11432-021-3262-3","title":"Outage-driven link selection for secure buffer-aided networks","year":2022,"lang":"en","type":"article","venue":"Science China Information Sciences","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":30,"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 British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Secrecy; Computer science; Computer network; Channel state information; Communication source; Queue; Channel (broadcasting); Queueing theory; Transmission (telecommunications); Wireless; Computer security; Telecommunications","score_opus":0.012298448084369903,"score_gpt":0.25974184022435853,"score_spread":0.24744339213998862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288752527","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.06212223,0.00072602247,0.9324961,0.0005210333,0.00015387723,0.000099350604,0.00017742538,0.0005553129,0.0031486824],"genre_scores_gemma":[0.96734667,0.00032844028,0.029951284,0.00010249186,0.00007076178,0.00007392406,0.00009451524,0.000035560362,0.0019963868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989421,0.00033394102,0.000040184455,0.00013901775,0.00029453923,0.00025034533],"domain_scores_gemma":[0.9961396,0.0027678087,0.00028026712,0.00025563332,0.00041726633,0.00013947432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016638046,0.0008750174,0.0010173324,0.00070978265,0.0007804593,0.0012380766,0.0010692322,0.00060912763,0.0024055738],"category_scores_gemma":[0.006448133,0.00050208106,0.00023402154,0.0008611308,0.0008699081,0.0013173636,0.0018529175,0.001026499,0.0004225854],"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.0011399064,0.00014324686,0.0016741777,0.00021348623,0.00007128764,0.00031970697,0.00030441917,0.8345873,0.024340061,0.039923046,0.004398131,0.092885256],"study_design_scores_gemma":[0.00001913328,0.00007547525,0.00015147663,0.0000101375645,0.000015013501,0.00006739759,0.000027336913,0.9885053,0.00261285,0.00810909,0.00039530665,0.0000115292905],"about_ca_topic_score_codex":0.0012354197,"about_ca_topic_score_gemma":0.003259864,"teacher_disagreement_score":0.0024055738,"about_ca_system_score_codex":0.00093736907,"about_ca_system_score_gemma":0.0019823802,"threshold_uncertainty_score":0.008799136},"labels":[],"label_agreement":null},{"id":"W4289655492","doi":"10.1109/isit50566.2022.9834771","title":"Two-terminal source coding with common sum reconstruction","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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 Toronto","funders":"Science and Engineering Research Council; Huawei Technologies","keywords":"Modulo; Source code; Algorithm; Distributed source coding; Computer science; Computation; Coding (social sciences); Binary number; Theoretical computer science; Rate distortion; Lossy compression; Terminal (telecommunication); Discrete mathematics; Variable-length code; Mathematics; Decoding methods; Arithmetic; Artificial intelligence; Computer network; Statistics","score_opus":0.0074796377199129,"score_gpt":0.2318155201879125,"score_spread":0.2243358824679996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655492","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.021915533,0.00025120255,0.97117394,0.00054024847,0.000067840505,0.00007776187,0.00010799008,0.00011440386,0.005751115],"genre_scores_gemma":[0.792722,0.0005686595,0.2011436,0.0002996658,0.00012578431,0.00023861337,0.00027368276,0.00004670373,0.004581255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767345,0.00083914463,0.00010273294,0.00034262755,0.00078337366,0.0002585725],"domain_scores_gemma":[0.9960295,0.0024177318,0.00036672826,0.0006019969,0.00041807178,0.00016597012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002147929,0.0012953633,0.0015336061,0.00072057184,0.00073745457,0.0019154331,0.0018708818,0.0018582101,0.0021871189],"category_scores_gemma":[0.007550367,0.00036567455,0.00093489664,0.001346955,0.002173764,0.0027587423,0.0054603154,0.0027636203,0.0005841475],"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.00047849477,0.00014072807,0.00067692954,0.00035390502,0.000086050364,0.0009634133,0.0004935685,0.29313233,0.011238871,0.6390283,0.0023530303,0.051054403],"study_design_scores_gemma":[0.00007554912,0.00014753015,0.000112745234,0.000048818525,0.000027540176,0.00046993114,0.00008054773,0.78963757,0.00905001,0.1986082,0.0017019463,0.000039612834],"about_ca_topic_score_codex":0.00049405027,"about_ca_topic_score_gemma":0.00035372257,"teacher_disagreement_score":0.0021871189,"about_ca_system_score_codex":0.0010053623,"about_ca_system_score_gemma":0.0011853537,"threshold_uncertainty_score":0.011359453},"labels":[],"label_agreement":null},{"id":"W4291722333","doi":"10.1109/tvt.2022.3175971","title":"Secure Transmission for MISO Wiretap Channels Using General Multi-Fractional Fourier Transform: An Approach in Signal Domain","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"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 Windsor","funders":"Natural Science Foundation of Heilongjiang Province; National Natural Science Foundation of China","keywords":"Artificial noise; Transmitter; Transmission (telecommunications); Computer science; Secure transmission; Interference (communication); Superposition principle; Transmitter power output; SIGNAL (programming language); Noise (video); Electronic engineering; Signal-to-noise ratio (imaging); Channel (broadcasting); Telecommunications; Mathematics; Engineering; Artificial intelligence","score_opus":0.024563900415730016,"score_gpt":0.2668105868319682,"score_spread":0.24224668641623817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291722333","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.0316903,0.0011516646,0.962302,0.0003040641,0.00009295514,0.00003335905,0.000022882712,0.00013591704,0.004266875],"genre_scores_gemma":[0.8271521,0.0017457248,0.16739544,0.00020931325,0.000113539725,0.0000736181,0.000038572227,0.00002427723,0.0032475716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996531,0.000098352226,0.000019936318,0.00005203282,0.00013471262,0.000041897594],"domain_scores_gemma":[0.99969816,0.000107804866,0.000061386825,0.00006387081,0.000056930712,0.000011833202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039164117,0.00061430945,0.00044401412,0.0003798016,0.0005258845,0.00062151096,0.0004695146,0.0006835991,0.0009530645],"category_scores_gemma":[0.00061666087,0.00016690993,0.00042148307,0.00047510533,0.0008550786,0.0014838673,0.0007053515,0.00080683746,0.0002484785],"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.0005699376,0.00012362606,0.0015374653,0.0006187809,0.00013904671,0.0010508747,0.0005895072,0.1985261,0.19498973,0.38224965,0.0029580386,0.2166473],"study_design_scores_gemma":[0.000026186519,0.00024118226,0.00024418332,0.00004061638,0.000042365136,0.0006855074,0.00007697894,0.9375949,0.034358416,0.02114264,0.0054950872,0.00005193646],"about_ca_topic_score_codex":0.0004247795,"about_ca_topic_score_gemma":0.00044142522,"teacher_disagreement_score":0.0009530645,"about_ca_system_score_codex":0.00041588888,"about_ca_system_score_gemma":0.00030452127,"threshold_uncertainty_score":0.0031883717},"labels":[],"label_agreement":null},{"id":"W4292157874","doi":"10.1016/j.eswa.2022.118394","title":"GPDS: A multi-agent deep reinforcement learning game for anti-jamming secure computing in MEC network","year":2022,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":38,"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 Waterloo; University of Windsor","funders":"National Key Research and Development Program of China; State Key Laboratory of Industrial Control Technology; Zhejiang University; Hunan Provincial Innovation Foundation for Postgraduate; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Reinforcement learning; Computer science; Jamming; Artificial intelligence; Computer security; Distributed computing","score_opus":0.016364903858268578,"score_gpt":0.2595943896520062,"score_spread":0.24322948579373763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292157874","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.04931851,0.00015379858,0.9430004,0.00052889244,0.000090255264,0.00010860626,0.000085074586,0.0006679814,0.0060464526],"genre_scores_gemma":[0.9287986,0.000082368795,0.06519548,0.00019185904,0.000017273474,0.00011227363,0.000043473574,0.00004114484,0.0055175917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970967,0.00009976341,0.000010165702,0.000049779177,0.00006153407,0.00006917346],"domain_scores_gemma":[0.9994772,0.00030755947,0.000031856158,0.000030172972,0.00008367413,0.00006957169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071351306,0.0004900096,0.0006789089,0.00020381818,0.00033163378,0.0006303153,0.0011491325,0.0011613347,0.0039995317],"category_scores_gemma":[0.0017372329,0.00024780515,0.000312156,0.00013450439,0.00065691327,0.0007332035,0.001363626,0.001343062,0.00027109025],"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.0001691644,0.00006631368,0.00042962522,0.000050715356,0.0000287317,0.00010445589,0.000046572106,0.9585852,0.0021495933,0.015208813,0.0015542791,0.021606468],"study_design_scores_gemma":[0.000009165676,0.000020177655,0.000024305451,0.0000017355509,0.0000025579257,0.0000063621274,0.0000035130147,0.99781597,0.00017448314,0.0017383862,0.00020141482,0.000001835698],"about_ca_topic_score_codex":0.0057571204,"about_ca_topic_score_gemma":0.0062013334,"teacher_disagreement_score":0.0057571204,"about_ca_system_score_codex":0.0006991706,"about_ca_system_score_gemma":0.0011103859,"threshold_uncertainty_score":0.013379753},"labels":[],"label_agreement":null},{"id":"W4292969453","doi":"10.1109/tifs.2022.3201386","title":"On Message Authentication Channel Capacity Over a Wiretap Channel","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"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 Windsor","funders":"National Natural Science Foundation of China","keywords":"Computer science; Channel (broadcasting); Computer network; Code word; Secrecy; Alice and Bob; Message authentication code; Channel capacity; Authentication (law); Key (lock); Topology (electrical circuits); Coding (social sciences); Transmitter; Decoding methods; Computer security; Telecommunications; Mathematics; Cryptography; Combinatorics; Alice (programming language)","score_opus":0.011732698473157617,"score_gpt":0.20909324173522306,"score_spread":0.19736054326206545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292969453","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.09351928,0.0017462263,0.856653,0.0015665183,0.0002503572,0.00012839636,0.00076623406,0.0009413584,0.044428717],"genre_scores_gemma":[0.9731472,0.0011770639,0.017376726,0.00018416064,0.00014763091,0.00017106207,0.00020420976,0.000084646905,0.0075071966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770665,0.0006703432,0.000064357824,0.00040820127,0.0005921549,0.00055821566],"domain_scores_gemma":[0.9956019,0.0021185966,0.00049972394,0.0007485822,0.00082991464,0.00020117922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009963386,0.0012181358,0.0011547105,0.0011540381,0.0013942783,0.002020947,0.0016699051,0.0013654552,0.0064057265],"category_scores_gemma":[0.004643234,0.00044252927,0.0007753988,0.0015681463,0.0027195455,0.0056733983,0.002222435,0.0022092063,0.0011952575],"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.00030085424,0.000059763093,0.00039288666,0.00024590627,0.00004433455,0.0004479258,0.00026741705,0.22218166,0.006943114,0.7543965,0.004197957,0.010521596],"study_design_scores_gemma":[0.00003323222,0.00009617933,0.00012881034,0.000037311678,0.00003425447,0.0002004704,0.00007275709,0.858283,0.0031517707,0.13356766,0.004332088,0.00006244319],"about_ca_topic_score_codex":0.0044445377,"about_ca_topic_score_gemma":0.0016355935,"teacher_disagreement_score":0.0064057265,"about_ca_system_score_codex":0.0026904806,"about_ca_system_score_gemma":0.0017441706,"threshold_uncertainty_score":0.02142936},"labels":[],"label_agreement":null},{"id":"W4295973897","doi":"10.4108/eetinis.v9i32.1909","title":"Intelligent Bi-directional Relaying Communication for Edge Intelligence based Industrial IoT Networks","year":2022,"lang":"en","type":"article","venue":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Rayleigh fading; Enhanced Data Rates for GSM Evolution; Computer science; Channel (broadcasting); Group (periodic table); Range (aeronautics); Communications system; Channel state information; Order (exchange); Fading; Signal-to-noise ratio (imaging); Telecommunications; Wireless; Engineering; Business; Physics","score_opus":0.06043244985038614,"score_gpt":0.2573885266375754,"score_spread":0.19695607678718924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295973897","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.12461312,0.003016083,0.84382373,0.0006182058,0.00014228643,0.00006969964,0.00007327023,0.00025904883,0.027384624],"genre_scores_gemma":[0.9440961,0.0019703002,0.04831457,0.00007877459,0.000057593323,0.000031177486,0.00007689424,0.000017038195,0.0053575584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997851,0.00006459611,0.0000125490305,0.000038397873,0.000070307506,0.00002902722],"domain_scores_gemma":[0.99958354,0.00019287512,0.00004697932,0.00007404776,0.000086930406,0.000015625068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039125752,0.00040145312,0.00023409698,0.0004603309,0.00036966027,0.00080269796,0.00045617673,0.0003987679,0.0010413032],"category_scores_gemma":[0.0009182163,0.00008587461,0.00021279602,0.00038726674,0.00031134338,0.00101819,0.00042208016,0.00039111488,0.00029520327],"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.00038828334,0.00017352092,0.004090662,0.00043652704,0.000095957956,0.00077821285,0.00077172247,0.2698718,0.08609946,0.19458432,0.00509087,0.43761858],"study_design_scores_gemma":[0.00001327442,0.00052907044,0.0018665013,0.00004023246,0.0000831849,0.00075694616,0.0002681058,0.9084027,0.022110948,0.044101592,0.021787876,0.000039557],"about_ca_topic_score_codex":0.000555512,"about_ca_topic_score_gemma":0.0008691396,"teacher_disagreement_score":0.0010413032,"about_ca_system_score_codex":0.0003669866,"about_ca_system_score_gemma":0.00021813264,"threshold_uncertainty_score":0.0034834743},"labels":[],"label_agreement":null},{"id":"W4299831463","doi":"10.48550/arxiv.1512.06298","title":"Streaming Data Transmission in the Moderate Deviations and Central Limit\\n Regimes","year":2015,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","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":"University of Toronto","funders":"","keywords":"Erasure; Decoding methods; Encoder; Large deviations theory; Noisy-channel coding theorem; Limit (mathematics); Coding (social sciences); Central limit theorem; Computer science; Channel (broadcasting); Mathematics; Range (aeronautics); Algorithm; Block code; Statistics; Telecommunications; Mathematical analysis","score_opus":0.1566397823080948,"score_gpt":0.22330703138284197,"score_spread":0.06666724907474716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299831463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5997007,0.0010228367,0.38212627,0.0011082686,0.00012641173,0.00006991926,0.00015525172,0.00043375764,0.015256582],"genre_scores_gemma":[0.9875066,0.00021667693,0.011078284,0.00008853977,0.000042845506,0.000036989066,0.00003714389,0.000028434379,0.00096445286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998629,0.00046263754,0.000058245056,0.00018430727,0.0004175988,0.00024833065],"domain_scores_gemma":[0.9871416,0.009063604,0.0013693781,0.0011139294,0.00081997714,0.00049149926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021228925,0.0006549013,0.0007813062,0.000522476,0.00069846626,0.0013762934,0.001641082,0.0012391042,0.0010909874],"category_scores_gemma":[0.012797517,0.00035025357,0.0006024727,0.0005445996,0.003241087,0.0032280427,0.0021708875,0.002590818,0.00015319383],"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.00051482976,0.00014118005,0.0025291846,0.0001623956,0.00006565375,0.000960348,0.00041162036,0.36897925,0.022002194,0.59596455,0.0007498495,0.007518986],"study_design_scores_gemma":[0.000027830496,0.00008563376,0.0003870847,0.000019773246,0.000010269041,0.00015878835,0.00007162382,0.9236376,0.004983335,0.07030587,0.00027375895,0.000038409267],"about_ca_topic_score_codex":0.0016215042,"about_ca_topic_score_gemma":0.0007746916,"teacher_disagreement_score":0.0021228925,"about_ca_system_score_codex":0.0012567437,"about_ca_system_score_gemma":0.0008233371,"threshold_uncertainty_score":0.011227071},"labels":[],"label_agreement":null},{"id":"W4300803856","doi":"10.1109/icc45855.2022.9838746","title":"Towards Improving the Security of Cognitive Radio Networks-Based Energy Harvesting","year":2022,"lang":"en","type":"article","venue":"ICC 2022 - IEEE International Conference on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Transmitter; Cognitive radio; Rayleigh fading; Jamming; Computer network; Underlay; Fading; Computer science; Energy harvesting; Channel (broadcasting); Energy (signal processing); Wireless; Physical layer; Telecommunications; Signal-to-noise ratio (imaging); Physics","score_opus":0.05840315086530686,"score_gpt":0.3067867448102028,"score_spread":0.24838359394489593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300803856","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.13662831,0.0042457413,0.8480934,0.0007238839,0.00009187511,0.000063024876,0.00002108936,0.00028919592,0.009843506],"genre_scores_gemma":[0.94744843,0.0020624762,0.049010277,0.00013971778,0.00003394721,0.000024358209,0.000017403743,0.0000160112,0.0012473828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999546,0.00013042765,0.000016077021,0.00006149484,0.00018139249,0.00006467508],"domain_scores_gemma":[0.99894077,0.0005780242,0.00014109505,0.00014393966,0.00016993961,0.000026277032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009504732,0.0006526405,0.00040697443,0.00038253015,0.00035860637,0.0010694361,0.0007953997,0.00075333414,0.00063405687],"category_scores_gemma":[0.002124224,0.00020625307,0.00027960786,0.00028207497,0.00080453156,0.0017418806,0.0012722301,0.00067400554,0.00020111074],"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.00054716645,0.00024788242,0.0049606324,0.00077059446,0.00016713372,0.000585578,0.0005357511,0.3479643,0.31412628,0.0849247,0.0013215889,0.24384844],"study_design_scores_gemma":[0.00002003908,0.0005173834,0.00157665,0.00011537779,0.00008055804,0.0005752529,0.00023216842,0.8835818,0.08159248,0.026738882,0.0049326,0.000036793772],"about_ca_topic_score_codex":0.0003020073,"about_ca_topic_score_gemma":0.00036029608,"teacher_disagreement_score":0.0010694361,"about_ca_system_score_codex":0.00034530094,"about_ca_system_score_gemma":0.00040989884,"threshold_uncertainty_score":0.0050266385},"labels":[],"label_agreement":null},{"id":"W4300856996","doi":"10.48550/arxiv.1103.3054","title":"On the Capacity of Memoryless Finite-State Multiple Access Channels with\\n Asymmetric Noisy State Information at the Encoders","year":2011,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Independent and identically distributed random variables; Encoder; State (computer science); State information; Upper and lower bounds; Channel (broadcasting); Finite state; Channel capacity; Computer science; Information theory; Topology (electrical circuits); Mathematics; Computer network; Algorithm; Combinatorics; Random variable; Statistics; Mathematical analysis; Markov chain","score_opus":0.09174483541347649,"score_gpt":0.18928580283003957,"score_spread":0.09754096741656308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300856996","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.3474912,0.0108132595,0.5752709,0.004662523,0.00039550022,0.000083739564,0.0010215645,0.00039297744,0.059868395],"genre_scores_gemma":[0.9793722,0.0037907115,0.011485229,0.00022673178,0.00040246797,0.00013816603,0.00021263152,0.00007369437,0.004298219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850416,0.0005520016,0.00005209668,0.00017276673,0.00036710355,0.0003519074],"domain_scores_gemma":[0.9838848,0.0135592595,0.00070962345,0.00067518005,0.0008948607,0.0002762469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025250644,0.0012156571,0.0009653258,0.0015601225,0.00067317614,0.002543388,0.0016137102,0.0010344805,0.0033394883],"category_scores_gemma":[0.016474208,0.0005316723,0.00051517657,0.0016776905,0.0036807412,0.004226491,0.0023957686,0.0021142059,0.00039959443],"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.00034284004,0.00008799409,0.00089486194,0.00034427512,0.00007619576,0.00037190862,0.00044735183,0.3871354,0.004902437,0.58652836,0.0039385324,0.014929868],"study_design_scores_gemma":[0.000015590336,0.000026889968,0.00025370263,0.000090402245,0.000018765564,0.00006724855,0.00005870117,0.7983368,0.0011001023,0.19907692,0.0009276407,0.000027209895],"about_ca_topic_score_codex":0.0027154929,"about_ca_topic_score_gemma":0.0012617002,"teacher_disagreement_score":0.0033394883,"about_ca_system_score_codex":0.0022651043,"about_ca_system_score_gemma":0.0012358874,"threshold_uncertainty_score":0.01643461},"labels":[],"label_agreement":null},{"id":"W4303959454","doi":"10.48550/arxiv.2007.04080","title":"Decoder Ties Do Not Affect the Error Exponent of the Memoryless Binary Symmetric Channel","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science and Technology, Taiwan","keywords":"Probability of error; Binary symmetric channel; Decoding methods; Binary number; Mathematics; Upper and lower bounds; Channel (broadcasting); Context (archaeology); Algorithm; Binary erasure channel; Channel code; Coding (social sciences); Combinatorics; Discrete mathematics; Statistics; Computer science; Channel capacity; Telecommunications; Arithmetic; Mathematical analysis","score_opus":0.10115476988804077,"score_gpt":0.20603985622857854,"score_spread":0.10488508634053777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4303959454","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.47834045,0.0022179368,0.480739,0.003465133,0.0002989165,0.000068077854,0.00050689856,0.0004697932,0.033893794],"genre_scores_gemma":[0.980491,0.0005295961,0.01575736,0.00024346053,0.00009741603,0.00004136337,0.00009292126,0.00009277392,0.0026541913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983804,0.00046025764,0.00006711039,0.00031828982,0.00048803398,0.0002858355],"domain_scores_gemma":[0.98061395,0.013343668,0.0018228423,0.0028379397,0.0010038161,0.00037788888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021748834,0.0008819355,0.0008958461,0.00075827684,0.0007233615,0.001878792,0.0012726118,0.0013394366,0.0022942787],"category_scores_gemma":[0.031704336,0.00045122547,0.00030448145,0.0006955906,0.0024567237,0.0045135063,0.001756564,0.0030844924,0.00041701295],"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.0012166335,0.00009856174,0.0047909343,0.00044387756,0.0001292249,0.00074642675,0.00038615573,0.20853107,0.03570308,0.6822715,0.004594251,0.061088376],"study_design_scores_gemma":[0.000071538714,0.00025162075,0.0018170688,0.00012145145,0.00007297919,0.00084050343,0.000101302925,0.6045799,0.035096508,0.35389057,0.0030717682,0.00008472462],"about_ca_topic_score_codex":0.00051554426,"about_ca_topic_score_gemma":0.00053556584,"teacher_disagreement_score":0.0022942787,"about_ca_system_score_codex":0.0013140147,"about_ca_system_score_gemma":0.0009730092,"threshold_uncertainty_score":0.0115020275},"labels":[],"label_agreement":null},{"id":"W4309738116","doi":"10.36227/techrxiv.21547695.v1","title":"High-Rate Secret Key Generation Using Physical Layer Security and Physical Unclonable Functions","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Western University","funders":"","keywords":"Key generation; Computer science; Physical layer; Randomness; Key (lock); Wireless; Channel (broadcasting); Overhead (engineering); Pre-shared key; Physical unclonable function; Computer network; Key exchange; Public-key cryptography; Computer security; Encryption; Telecommunications; Mathematics","score_opus":0.037165653452710196,"score_gpt":0.2783774802418525,"score_spread":0.2412118267891423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309738116","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.100899495,0.0010450133,0.89284253,0.00022336339,0.00008147848,0.000088303386,0.000050466813,0.00053126086,0.0042381543],"genre_scores_gemma":[0.92563266,0.00045470204,0.07225607,0.00009551663,0.000041449228,0.00006088407,0.00004002941,0.000023385002,0.0013953281],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994586,0.00015100412,0.0000374887,0.000108957596,0.00018228599,0.00006155605],"domain_scores_gemma":[0.9993703,0.00019921188,0.00019571568,0.00013478681,0.00008160387,0.00001840662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000489002,0.0006174139,0.0003863322,0.0003447434,0.0003179468,0.00058611645,0.0006391183,0.0005421702,0.0010574411],"category_scores_gemma":[0.0009871324,0.00022587372,0.0004058625,0.00038325338,0.000632758,0.001567876,0.0009233143,0.00061436417,0.0004211662],"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.0008435602,0.00014093744,0.0027648224,0.00074914366,0.00016343495,0.0007486766,0.0004159487,0.07670484,0.64737046,0.08094916,0.0012675917,0.18788135],"study_design_scores_gemma":[0.000085875305,0.0008979778,0.0011959468,0.00006800361,0.000096538206,0.0011743446,0.00005929763,0.644531,0.3309087,0.010124802,0.010767032,0.00009050505],"about_ca_topic_score_codex":0.00016843354,"about_ca_topic_score_gemma":0.00017785601,"teacher_disagreement_score":0.0010574411,"about_ca_system_score_codex":0.00037086854,"about_ca_system_score_gemma":0.00026740046,"threshold_uncertainty_score":0.0035375357},"labels":[],"label_agreement":null},{"id":"W4309741840","doi":"10.36227/techrxiv.21547695","title":"High-Rate Secret Key Generation Using Physical Layer Security and Physical Unclonable Functions","year":2022,"lang":"en","type":"preprint","venue":"","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":"Western University","funders":"","keywords":"Key generation; Computer science; Physical layer; Randomness; Key (lock); Wireless; Channel (broadcasting); Overhead (engineering); Physical unclonable function; Pre-shared key; Computer network; Key exchange; Public-key cryptography; Computer security; Encryption; Telecommunications; Mathematics","score_opus":0.037165653452710196,"score_gpt":0.2783774802418525,"score_spread":0.2412118267891423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309741840","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.12827614,0.00092619593,0.8652059,0.00021693244,0.00007855595,0.000085529624,0.000052958112,0.0005970796,0.004560849],"genre_scores_gemma":[0.9181715,0.00040422048,0.079630114,0.00008976677,0.000037343176,0.000056010762,0.000038685237,0.000026179761,0.0015461108],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995468,0.0001360596,0.000029541781,0.00009126668,0.00014329333,0.000052917],"domain_scores_gemma":[0.99944776,0.00018560572,0.00017236244,0.000106957086,0.00007073687,0.000016534199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041714456,0.00056457706,0.00036086293,0.00031324592,0.00029462716,0.00057737425,0.0006148099,0.00049680413,0.0010974904],"category_scores_gemma":[0.00089044514,0.00021811185,0.00034370902,0.0003561954,0.0006222972,0.0014410109,0.0008133259,0.0005210616,0.00038819652],"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.000783043,0.00014758248,0.0023327158,0.00061855896,0.000137758,0.00059801067,0.00036278862,0.07912305,0.6701489,0.06579536,0.0011824035,0.1787698],"study_design_scores_gemma":[0.000071149756,0.0006875537,0.00097401114,0.000043509986,0.00006953168,0.0007204041,0.000043778742,0.69042325,0.292147,0.0063370443,0.008414052,0.00006867201],"about_ca_topic_score_codex":0.00018450657,"about_ca_topic_score_gemma":0.00020162281,"teacher_disagreement_score":0.0010974904,"about_ca_system_score_codex":0.00035903516,"about_ca_system_score_gemma":0.00024743142,"threshold_uncertainty_score":0.003671527},"labels":[],"label_agreement":null},{"id":"W4310360835","doi":"10.36227/techrxiv.21568656.v1","title":"Bit-Interleaved Coded Energy-Based Modulation with Iterative Decoding","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pairwise error probability; Decoding methods; Computer science; Algorithm; Coding gain; Energy (signal processing); Turbo code; Modulation (music); Coding (social sciences); Bit error rate; Theoretical computer science; Mathematics; Fading; Statistics; Physics","score_opus":0.018905905146468997,"score_gpt":0.248205955793354,"score_spread":0.229300050646885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310360835","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.008334452,0.00017686322,0.9894238,0.00006241788,0.000014151735,0.000016713951,0.00000982883,0.00007938764,0.0018824578],"genre_scores_gemma":[0.42711577,0.00034734115,0.56900537,0.00014070369,0.000044166292,0.00007208132,0.00005502175,0.000026437441,0.0031931791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993018,0.00021633509,0.00003607896,0.000080237885,0.00031526646,0.000050278286],"domain_scores_gemma":[0.99946815,0.00024775436,0.000072666044,0.00009365514,0.0001019977,0.000015843254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004881453,0.00056568615,0.000550248,0.00036271574,0.00027220004,0.0006677831,0.00094505114,0.00076457387,0.0009306317],"category_scores_gemma":[0.001678626,0.00023345952,0.00035506522,0.0004834065,0.0005514381,0.00089622685,0.0008465967,0.0008408826,0.0005958132],"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.000314464,0.00012991963,0.0017802955,0.000459496,0.00012582568,0.0003901537,0.00038328927,0.40769374,0.13261905,0.17625201,0.0012569812,0.27859473],"study_design_scores_gemma":[0.000018187593,0.00015031047,0.00017417024,0.000029357023,0.000021342072,0.00032041376,0.000015115592,0.9596103,0.02407175,0.01309776,0.0024699084,0.000021441427],"about_ca_topic_score_codex":0.00035944543,"about_ca_topic_score_gemma":0.00061592105,"teacher_disagreement_score":0.00094505114,"about_ca_system_score_codex":0.00040553938,"about_ca_system_score_gemma":0.0006267354,"threshold_uncertainty_score":0.0031132698},"labels":[],"label_agreement":null},{"id":"W4310360836","doi":"10.36227/techrxiv.21568656","title":"Bit-Interleaved Coded Energy-Based Modulation with Iterative Decoding","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pairwise error probability; Decoding methods; Computer science; Algorithm; Coding gain; Energy (signal processing); Turbo code; Modulation (music); Coding (social sciences); Theoretical computer science; Mathematics; Fading; Statistics","score_opus":0.018905905146468997,"score_gpt":0.248205955793354,"score_spread":0.229300050646885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310360836","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.009642039,0.00018549855,0.98760253,0.00007309787,0.000016009399,0.000017072693,0.000011532402,0.00009506832,0.0023571455],"genre_scores_gemma":[0.4464488,0.00034234987,0.54909563,0.0001476447,0.000043221247,0.00006704192,0.000056567485,0.000029166802,0.0037695654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993631,0.00019292344,0.000030192958,0.00007400348,0.0002928645,0.000047026737],"domain_scores_gemma":[0.9995664,0.00019712333,0.00005762349,0.000081331535,0.00008411823,0.000013306657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042045215,0.00052693795,0.0005314119,0.00033606176,0.00025804577,0.00062991737,0.00086242537,0.0007205794,0.0010377192],"category_scores_gemma":[0.001562368,0.00021567637,0.00033350315,0.00048166327,0.0005421028,0.0008327647,0.00079810456,0.000778653,0.0006105225],"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.0002948347,0.00012134948,0.0014819686,0.00039394328,0.00011612115,0.0003665367,0.00037713547,0.4103336,0.1380527,0.16261503,0.0013666343,0.2844802],"study_design_scores_gemma":[0.000017050048,0.00013053585,0.00018033267,0.000027060672,0.000018388475,0.00030226924,0.000015260874,0.95751697,0.025887026,0.013466969,0.0024177504,0.000020472551],"about_ca_topic_score_codex":0.00040000622,"about_ca_topic_score_gemma":0.00066615955,"teacher_disagreement_score":0.0010377192,"about_ca_system_score_codex":0.00042036857,"about_ca_system_score_gemma":0.00057275756,"threshold_uncertainty_score":0.0034714937},"labels":[],"label_agreement":null},{"id":"W4312050867","doi":"10.1109/tcomm.2022.3218822","title":"On Distributed Lossy Coding of Symmetrically Correlated Gaussian Sources","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"Huawei Technologies (Canada); McMaster University","funders":"","keywords":"Upper and lower bounds; Encoder; Lossy compression; Gaussian; Mathematics; Distortion (music); Algorithm; Discrete mathematics; Cramér–Rao bound; Combinatorics; Computer science; Mathematical analysis; Statistics; Telecommunications; Physics","score_opus":0.0212321375510016,"score_gpt":0.2501063285394391,"score_spread":0.2288741909884375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312050867","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.039864153,0.0011719072,0.95175457,0.0005124769,0.00006081778,0.000058372367,0.00018655819,0.00018260036,0.006208482],"genre_scores_gemma":[0.8798155,0.0030103244,0.10149034,0.00034653218,0.00019921846,0.00033089894,0.0006786019,0.0000860801,0.014042458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992155,0.000249632,0.000031287214,0.00011949157,0.00027107119,0.00011299702],"domain_scores_gemma":[0.9967847,0.0022853406,0.00026919186,0.00020535011,0.0003817514,0.0000736648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013409199,0.0012299535,0.0010225007,0.0008740799,0.00037975726,0.0010902061,0.0018019464,0.0013245132,0.0022556453],"category_scores_gemma":[0.0062594144,0.0005323026,0.00040622018,0.0011674784,0.0015595091,0.0024324558,0.0018655005,0.0015813133,0.00053121086],"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.00022709338,0.00003164397,0.0002460413,0.00010720667,0.000027723345,0.00016907399,0.000104943196,0.86443716,0.002552224,0.10306369,0.0016288966,0.02740428],"study_design_scores_gemma":[0.000009414283,0.000024345614,0.000059904687,0.000013283371,0.000005954355,0.000033073582,0.000009449569,0.97664475,0.00065936527,0.022207472,0.00032463268,0.0000083964105],"about_ca_topic_score_codex":0.0034149317,"about_ca_topic_score_gemma":0.0027609854,"teacher_disagreement_score":0.0034149317,"about_ca_system_score_codex":0.0019803226,"about_ca_system_score_gemma":0.0010561635,"threshold_uncertainty_score":0.014368296},"labels":[],"label_agreement":null},{"id":"W4312708751","doi":"10.1049/cmu2.12445","title":"Distributed secure transmission for covert communication under multi‐user network","year":2022,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Covert; Collusion; Computer network; Computer security; Transmission (telecommunications); Covert channel; Robustness (evolution); Telecommunications","score_opus":0.02975631721788517,"score_gpt":0.2822354633162386,"score_spread":0.2524791460983534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312708751","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.065775536,0.00035277152,0.9308712,0.0002237663,0.000073130424,0.00004821242,0.00002038073,0.00022507248,0.002409919],"genre_scores_gemma":[0.9698173,0.0001567976,0.02852696,0.000054800887,0.00004097224,0.000039523424,0.000019852865,0.000011658604,0.0013322376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985252,0.00040033742,0.00006048458,0.0002703136,0.00060777337,0.00013587167],"domain_scores_gemma":[0.9981686,0.0007443371,0.0002767953,0.00041243795,0.0003312926,0.00006659008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079289376,0.00051614287,0.0006403985,0.0005863368,0.0007576744,0.00057865627,0.0009182041,0.00078835187,0.0011041631],"category_scores_gemma":[0.002385352,0.00019952623,0.00039992732,0.00047295654,0.0007964757,0.0016303057,0.001127442,0.00071115687,0.00016351724],"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.0010491475,0.00019878926,0.002216464,0.00038153832,0.00020356095,0.001199294,0.0005291844,0.5614604,0.13841483,0.10145676,0.0026098976,0.19028011],"study_design_scores_gemma":[0.0000375917,0.00018893996,0.0003029147,0.000012807155,0.000025887157,0.00031495804,0.00002652654,0.9757701,0.01305458,0.008959485,0.001284061,0.000022054954],"about_ca_topic_score_codex":0.0005920818,"about_ca_topic_score_gemma":0.00044321953,"teacher_disagreement_score":0.0011041631,"about_ca_system_score_codex":0.0007800719,"about_ca_system_score_gemma":0.00047597705,"threshold_uncertainty_score":0.0056598783},"labels":[],"label_agreement":null},{"id":"W4312903180","doi":"10.1109/tifs.2022.3212198","title":"The Impact of Side Information on Physical Layer Security Under Correlated Fading Channels","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"European Regional Development Fund; Consejería de Economía, Innovación, Ciencia y Empleo, Junta de Andalucía","keywords":"Fading; Transmitter; Physical layer; Computer science; Secrecy; Outage probability; Channel state information; Copula (linguistics); Fading distribution; Computer network; Telecommunications; Computer security; Wireless; Channel (broadcasting); Mathematics; Econometrics; Rayleigh fading","score_opus":0.011208790775914017,"score_gpt":0.2447430772286412,"score_spread":0.23353428645272717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312903180","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.39772642,0.002133311,0.585046,0.0007856917,0.00013697178,0.000084086234,0.00037271125,0.0004674354,0.013247382],"genre_scores_gemma":[0.9918578,0.0008689374,0.0065808916,0.000058391215,0.000040774055,0.000019729421,0.000040931376,0.000035670557,0.00049681833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964386,0.0013158991,0.00011972472,0.00039299973,0.0009617386,0.0007710413],"domain_scores_gemma":[0.9533962,0.036588077,0.0038712332,0.0029659788,0.002728845,0.00044967153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036877354,0.0020992234,0.0016316669,0.000828762,0.000863649,0.001964022,0.00086220924,0.0011496991,0.001858035],"category_scores_gemma":[0.02535267,0.0006960933,0.000652388,0.0007953872,0.0028526508,0.0036236905,0.0019490469,0.0018835587,0.00039704482],"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.00029143618,0.00006899729,0.0040061423,0.00023682391,0.00012999795,0.001024345,0.00013621224,0.9257635,0.017240793,0.038591173,0.0005426441,0.0119678555],"study_design_scores_gemma":[0.000012181611,0.00020087809,0.0014305862,0.000060831844,0.00009303194,0.00061571837,0.00008293653,0.9719002,0.014296118,0.010995775,0.00026604332,0.000045668174],"about_ca_topic_score_codex":0.0012808242,"about_ca_topic_score_gemma":0.0011885512,"teacher_disagreement_score":0.0036877354,"about_ca_system_score_codex":0.0012655068,"about_ca_system_score_gemma":0.0015416134,"threshold_uncertainty_score":0.019502878},"labels":[],"label_agreement":null},{"id":"W4313291262","doi":"10.1109/ojcoms.2022.3232065","title":"New LLRT-Based Methods for Active Eavesdropper Detection in Cell-Free Massive MIMO","year":2022,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"False alarm; Overhead (engineering); Computer science; Telecommunications link; MIMO; Spectral efficiency; Constant false alarm rate; Computer network; Spoofing attack; Real-time computing; Algorithm; Artificial intelligence","score_opus":0.048549162510954466,"score_gpt":0.35908495530092926,"score_spread":0.3105357927899748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313291262","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.0021538793,0.00022918524,0.9970372,0.000028733346,0.000018911587,0.000013062125,0.000009145918,0.00015147077,0.00035843355],"genre_scores_gemma":[0.41667154,0.0012912503,0.5781495,0.00026560706,0.00027582937,0.00017682312,0.00016513668,0.00013615287,0.0028682004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985411,0.00055990607,0.00006283452,0.00016166853,0.0005773369,0.00009713892],"domain_scores_gemma":[0.99434423,0.0038999186,0.0006888464,0.00037660633,0.000566514,0.00012398342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001833422,0.0012851593,0.0011679934,0.00091471133,0.00029877626,0.000994504,0.001381758,0.00096281007,0.0009542184],"category_scores_gemma":[0.009678623,0.00045298896,0.00070587266,0.00077999575,0.0011903493,0.0016185212,0.0013740414,0.0014005202,0.0005930394],"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.00041529126,0.0001368647,0.0021898323,0.00057931524,0.0001952693,0.00056531985,0.00036625343,0.5691996,0.03561462,0.056264784,0.0019106751,0.33256215],"study_design_scores_gemma":[0.000008920292,0.00008063445,0.00024323595,0.000014989055,0.00001776904,0.00018501838,0.000014852451,0.98957413,0.004586246,0.0044155032,0.00082973076,0.000028966455],"about_ca_topic_score_codex":0.00053960795,"about_ca_topic_score_gemma":0.0004972173,"teacher_disagreement_score":0.001833422,"about_ca_system_score_codex":0.0004921882,"about_ca_system_score_gemma":0.0005730884,"threshold_uncertainty_score":0.009696186},"labels":[],"label_agreement":null},{"id":"W4313315845","doi":"10.1109/commnet56067.2022.9993858","title":"Deep Reinforcement Learning Based Anti-Jamming Using Clear Channel Assessment Information in a Cognitive Radio Environment","year":2022,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"Carleton University","funders":"","keywords":"Jamming; Computer science; Denial-of-service attack; Cognitive radio; Channel (broadcasting); Computer network; Wireless; Reinforcement learning; Telecommunications; Artificial intelligence; The Internet","score_opus":0.018093736065754918,"score_gpt":0.25069985905019454,"score_spread":0.2326061229844396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313315845","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.27246863,0.00039858665,0.7216823,0.00043379713,0.00007594192,0.00007837499,0.000018336961,0.00051186525,0.00433216],"genre_scores_gemma":[0.98286027,0.00004674963,0.016099509,0.00008559016,0.000010702407,0.000023748587,0.000009271971,0.0000082403885,0.0008558428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970263,0.000098692355,0.000012462177,0.000051245766,0.000060445647,0.000074482974],"domain_scores_gemma":[0.998806,0.00068566174,0.0001502537,0.000049418166,0.00022083694,0.0000877727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011580532,0.00067676225,0.000655762,0.00023646026,0.00032372738,0.0004558279,0.00079945294,0.00074392156,0.0006594276],"category_scores_gemma":[0.0024936872,0.00030252716,0.00024516325,0.00015277517,0.00083116227,0.0006060783,0.00088530156,0.0009790036,0.000099122284],"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.0001338705,0.0001137788,0.0010006654,0.000034957495,0.00003226085,0.0000765398,0.000063864856,0.9625088,0.0028336898,0.0018162088,0.0002741937,0.031111142],"study_design_scores_gemma":[0.000006847024,0.000045537716,0.00007829833,0.0000019177028,0.0000036693157,0.0000051486672,0.0000034039476,0.9991769,0.00027552003,0.00036102656,0.000039340397,0.0000022163495],"about_ca_topic_score_codex":0.0051972764,"about_ca_topic_score_gemma":0.004522258,"teacher_disagreement_score":0.0051972764,"about_ca_system_score_codex":0.00050192606,"about_ca_system_score_gemma":0.00097027456,"threshold_uncertainty_score":0.0103340745},"labels":[],"label_agreement":null},{"id":"W4313534845","doi":"10.1109/ojcoms.2023.3234338","title":"High-Rate Secret Key Generation Using Physical Layer Security and Physical Unclonable Functions","year":2023,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Key generation; Computer science; Physical layer; Randomness; Key (lock); Wireless; Channel (broadcasting); Overhead (engineering); Pre-shared key; Computer network; Physical unclonable function; Key exchange; Public-key cryptography; Computer security; Encryption; Telecommunications; Mathematics","score_opus":0.08087695697281036,"score_gpt":0.3260999161008283,"score_spread":0.24522295912801792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313534845","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.098263845,0.0010036421,0.8955763,0.00017864685,0.000083431194,0.00008731173,0.000050214087,0.0005934067,0.0041632694],"genre_scores_gemma":[0.9300899,0.0004258389,0.06764573,0.0000853237,0.00003932704,0.000059117618,0.000042506086,0.00002479538,0.001587509],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994574,0.00014804146,0.00003763897,0.00010697341,0.0001869527,0.00006299975],"domain_scores_gemma":[0.99936146,0.00021120916,0.0001882292,0.00013259564,0.00008813732,0.00001835879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050291425,0.00059845735,0.00039078525,0.00035381297,0.0003184604,0.0006008573,0.0006492105,0.0005281256,0.0012013459],"category_scores_gemma":[0.0010055111,0.00021635502,0.0003901264,0.00037314513,0.0005854454,0.0016220958,0.0008919329,0.0006072422,0.00047890015],"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.0009233482,0.00015027364,0.002949043,0.00077946327,0.00016130699,0.0007985146,0.0003998254,0.08937076,0.63089746,0.07405353,0.0012848654,0.19823161],"study_design_scores_gemma":[0.00007351439,0.00091967563,0.0012361333,0.000068295914,0.00009193901,0.0011865182,0.000058360685,0.66884965,0.30781356,0.008608445,0.011008027,0.00008594228],"about_ca_topic_score_codex":0.00017569214,"about_ca_topic_score_gemma":0.00018711857,"teacher_disagreement_score":0.0012013459,"about_ca_system_score_codex":0.00035803486,"about_ca_system_score_gemma":0.00027569043,"threshold_uncertainty_score":0.004018843},"labels":[],"label_agreement":null},{"id":"W4313895184","doi":"10.3390/e25010122","title":"Physical Layer Security in Two-Way SWIPT Relay Networks with Imperfect CSI and a Friendly Jammer","year":2023,"lang":"en","type":"article","venue":"Entropy","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"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":"Relay; Jamming; Computer science; Eavesdropping; Secrecy; Computer network; Relay channel; Physical layer; Channel state information; Signal-to-noise ratio (imaging); Channel (broadcasting); Energy (signal processing); Telecommunications; Wireless; Computer security; Power (physics); Mathematics; Physics","score_opus":0.006960378507535208,"score_gpt":0.2516348673284031,"score_spread":0.24467448882086792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313895184","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.11411224,0.0015218619,0.87753356,0.00044844308,0.00007067659,0.000024946978,0.00007885672,0.00016784834,0.006041552],"genre_scores_gemma":[0.97956014,0.00082884764,0.018217867,0.000048275604,0.000031839223,0.000023919225,0.00002138461,0.000011780232,0.0012558902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990212,0.0004092007,0.000043530094,0.00014821342,0.00024373629,0.0001340361],"domain_scores_gemma":[0.9976927,0.0014898047,0.00037646058,0.00021327242,0.00018209445,0.000045750672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012691825,0.0008670937,0.0009985289,0.0004284802,0.00049215136,0.0015020231,0.0006977448,0.0011137495,0.00051336014],"category_scores_gemma":[0.0032582886,0.00047139535,0.00049486355,0.0005552428,0.0018508583,0.0023253562,0.001551762,0.0007952353,0.00019146342],"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.0003593057,0.000057456382,0.0015068209,0.00040855256,0.00018146743,0.0015815364,0.00035018832,0.79055905,0.037879955,0.13528445,0.00078827067,0.03104289],"study_design_scores_gemma":[0.000013104331,0.000100066034,0.00028951143,0.000019142428,0.000029722178,0.0003436891,0.000053397107,0.9759926,0.004959177,0.017619751,0.00055764464,0.00002220499],"about_ca_topic_score_codex":0.000789472,"about_ca_topic_score_gemma":0.0004728912,"teacher_disagreement_score":0.0015020231,"about_ca_system_score_codex":0.0007809987,"about_ca_system_score_gemma":0.00068934314,"threshold_uncertainty_score":0.0067121387},"labels":[],"label_agreement":null},{"id":"W4315777823","doi":"10.1109/gcwkshps56602.2022.10008698","title":"GRAND for Rayleigh Fading Channels","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Globecom Workshops (GC Wkshps)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Fading; Decoding methods; Algorithm; Rayleigh fading; Computer science; BCH code; Code (set theory); Multipath propagation; Channel (broadcasting); Mathematics; Telecommunications","score_opus":0.019436392833521138,"score_gpt":0.2510370625127393,"score_spread":0.23160066967921814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315777823","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.0630807,0.0072588017,0.8349877,0.0017036336,0.00083485217,0.00022790344,0.0011505143,0.0021537766,0.088602126],"genre_scores_gemma":[0.85780936,0.006689018,0.0998093,0.0009730468,0.00042026764,0.0002499012,0.00089638185,0.00019339897,0.032959264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961853,0.00010747632,0.000010182434,0.000060934817,0.0001132096,0.000089732974],"domain_scores_gemma":[0.9993255,0.00027215327,0.00006413743,0.00013451342,0.00018248781,0.00002128823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041505098,0.00094554835,0.00046556396,0.00031127277,0.0004886064,0.000890016,0.000488913,0.0005784544,0.0073337182],"category_scores_gemma":[0.0020851456,0.00016466631,0.00034630296,0.00045711326,0.00052221783,0.00070892146,0.0007323376,0.0010716327,0.0024091224],"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.00027951231,0.00005670663,0.0015022494,0.00043250713,0.00006675419,0.00076759595,0.00010920861,0.5836493,0.01703504,0.2211097,0.031773686,0.14321773],"study_design_scores_gemma":[0.000020797565,0.00012676243,0.00063103216,0.0000512235,0.000023199016,0.000649533,0.00005017189,0.92175585,0.00552375,0.03978242,0.03133834,0.00004693907],"about_ca_topic_score_codex":0.0032117926,"about_ca_topic_score_gemma":0.004145043,"teacher_disagreement_score":0.0073337182,"about_ca_system_score_codex":0.00056177855,"about_ca_system_score_gemma":0.0009110286,"threshold_uncertainty_score":0.024533749},"labels":[],"label_agreement":null},{"id":"W4315783193","doi":"10.1109/gcwkshps56602.2022.10008779","title":"Analytical Method of Physical Layer Authentication for Performance Evaluation","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Globecom Workshops (GC Wkshps)","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":"Western University","funders":"Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Eavesdropping; Physical layer; Computer science; Authentication (law); Binary number; Probability density function; Benchmark (surveying); Noise (video); Algorithm; Receiver operating characteristic; Channel (broadcasting); Stability (learning theory); Variance (accounting); Mathematics; Statistics; Artificial intelligence; Machine learning; Computer network; Telecommunications","score_opus":0.03759380676408463,"score_gpt":0.3355786586556045,"score_spread":0.29798485189151985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315783193","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.003259029,0.00077912165,0.9872556,0.00018501826,0.000092630384,0.00010318107,0.00011703114,0.0007996357,0.0074088764],"genre_scores_gemma":[0.5608253,0.004513695,0.42109224,0.0005298801,0.000371817,0.0008372245,0.0005311873,0.00052210654,0.010776587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688256,0.0009751265,0.00014384487,0.00033211606,0.0014373154,0.00022910885],"domain_scores_gemma":[0.99614537,0.0016966806,0.0003262237,0.0006991543,0.0010907858,0.000041717223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002334575,0.0019444302,0.000833187,0.0019683365,0.0006809942,0.0016297216,0.0013648038,0.0011578287,0.007932623],"category_scores_gemma":[0.012371159,0.00040072357,0.00077213853,0.0015552108,0.00086761924,0.0026285283,0.0011770547,0.0018509933,0.0027094602],"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.00015771904,0.0002091934,0.0016665865,0.0007695909,0.00011565589,0.00037964917,0.00035599354,0.55087256,0.03764557,0.23035918,0.01017645,0.16729191],"study_design_scores_gemma":[0.000008724841,0.000092887625,0.0003577913,0.00005462535,0.000021344033,0.00026745832,0.00005659855,0.97124815,0.007301059,0.014654586,0.005902535,0.00003428678],"about_ca_topic_score_codex":0.0019613113,"about_ca_topic_score_gemma":0.0012283091,"teacher_disagreement_score":0.007932623,"about_ca_system_score_codex":0.0013884796,"about_ca_system_score_gemma":0.0014571637,"threshold_uncertainty_score":0.0265373},"labels":[],"label_agreement":null},{"id":"W4319994188","doi":"10.2139/ssrn.4347462","title":"Identity-Based Attack Detection Using Received Signal Strength in Mimo Systems","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"SIGNAL (programming language); Identity (music); MIMO; Computer science; Signal strength; Computer security; Speech recognition; Political science; Telecommunications; Acoustics; Physics; Wireless","score_opus":0.024631919058431432,"score_gpt":0.28075974078028076,"score_spread":0.25612782172184934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319994188","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.18067944,0.0007303822,0.8102893,0.00047107486,0.00021293195,0.00005702619,0.00014050498,0.00044949722,0.006969758],"genre_scores_gemma":[0.96373147,0.00037311902,0.03350052,0.00012532296,0.000105002255,0.000026069514,0.00008421299,0.000012094972,0.002042046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986688,0.00040751445,0.000060022576,0.00017517254,0.0004627734,0.00022580719],"domain_scores_gemma":[0.99813867,0.0010230094,0.00025178294,0.00019845506,0.0003134117,0.00007469013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009840792,0.00065006426,0.00068941544,0.00071896164,0.00036085365,0.0010443511,0.00042191663,0.00089966675,0.0010770962],"category_scores_gemma":[0.0039685,0.00031035623,0.00031342366,0.00058231445,0.00055148744,0.0011450863,0.0013326699,0.000762263,0.00072625943],"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.001845821,0.00039396127,0.01798735,0.00042397986,0.00033301103,0.0012737357,0.00051324005,0.2612124,0.25809228,0.047151454,0.0027726765,0.40800008],"study_design_scores_gemma":[0.000027589305,0.00032802147,0.0043292763,0.000029978943,0.00007245352,0.0007982713,0.00008344282,0.95354164,0.034686625,0.0050211223,0.0010396147,0.000042012016],"about_ca_topic_score_codex":0.0004619373,"about_ca_topic_score_gemma":0.0005043744,"teacher_disagreement_score":0.0010770962,"about_ca_system_score_codex":0.00031532656,"about_ca_system_score_gemma":0.00044458164,"threshold_uncertainty_score":0.00520432},"labels":[],"label_agreement":null},{"id":"W4323065265","doi":"10.1109/tvt.2023.3251943","title":"Secrecy Performance Analysis of Heterogeneous Networks With Unreliable Wireless Backhaul and Imperfect Channel Estimation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Queen's University; Queen's University Belfast; Royal Academy of Engineering","keywords":"Backhaul (telecommunications); Nakagami distribution; Fading; Secrecy; Eavesdropping; Wireless; Computer science; Computer network; Transmitter; Channel (broadcasting); Artificial noise; Telecommunications; Computer security","score_opus":0.007157958093598131,"score_gpt":0.2125862709370113,"score_spread":0.20542831284341317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323065265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5200581,0.001200223,0.46942285,0.0005084017,0.000043649005,0.0000624836,0.00019404896,0.0002008967,0.008309319],"genre_scores_gemma":[0.9961637,0.00028386584,0.0030391861,0.000018474118,0.00001580258,0.000012814576,0.00003350911,0.000008542862,0.00042409461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845076,0.0006179861,0.000052126394,0.000163953,0.0003603935,0.00035474793],"domain_scores_gemma":[0.99264455,0.004911962,0.0010115152,0.0005139299,0.0007395461,0.00017846854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025671988,0.0010525575,0.0008516387,0.0008199524,0.00073154276,0.001320357,0.0009451921,0.0007451319,0.0007492929],"category_scores_gemma":[0.00810783,0.00035309474,0.00059085595,0.0009883577,0.0017154693,0.0015661415,0.0017433332,0.0006804574,0.00017181909],"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.0001356984,0.000017108752,0.0018269614,0.000045248053,0.000040235238,0.00026464093,0.00008837393,0.9767422,0.0029067383,0.014119327,0.00018778688,0.003625697],"study_design_scores_gemma":[0.000004881492,0.00004378319,0.00039245634,0.000004946948,0.00001865028,0.00005674212,0.000042528132,0.9957852,0.001189066,0.0023914217,0.00006069599,0.000009673931],"about_ca_topic_score_codex":0.0040582563,"about_ca_topic_score_gemma":0.0018766992,"teacher_disagreement_score":0.0040582563,"about_ca_system_score_codex":0.001741655,"about_ca_system_score_gemma":0.0008540928,"threshold_uncertainty_score":0.013576806},"labels":[],"label_agreement":null},{"id":"W4327808488","doi":"10.1109/tmc.2023.3258750","title":"Optimal Random Access Strategies for Trigger-Based Multiple-Packet Reception Channels","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Communication Security 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":"University of Waterloo","funders":"","keywords":"Notation; Network packet; Channel (broadcasting); Computer science; Algorithm; Discrete mathematics; Mathematics; Arithmetic; Computer network","score_opus":0.04334691770578537,"score_gpt":0.31602089040250614,"score_spread":0.2726739726967208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327808488","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.04944164,0.0005615794,0.94255847,0.0002503121,0.000059783317,0.00016760586,0.00009862789,0.00031930793,0.006542658],"genre_scores_gemma":[0.94200516,0.00049384835,0.053387687,0.0001620582,0.00007317574,0.00025369984,0.0000708256,0.00008834266,0.0034651055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797887,0.00070473005,0.00008118022,0.0003156735,0.0004305776,0.0004890371],"domain_scores_gemma":[0.99324787,0.00449435,0.0010109999,0.00032251643,0.0005907816,0.0003333351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019892135,0.0016030174,0.0010296077,0.0009574745,0.00055984134,0.0017762319,0.002413643,0.0011231262,0.0025732243],"category_scores_gemma":[0.009416894,0.0005952698,0.0006340137,0.0008978337,0.0013863029,0.00168054,0.0015374303,0.0011526045,0.00058802444],"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.00045382185,0.00016399003,0.0007977749,0.00020268034,0.00010030601,0.00038808314,0.00023773508,0.8066922,0.015735906,0.1463043,0.0016839342,0.02723927],"study_design_scores_gemma":[0.000035945668,0.000109314744,0.000106803556,0.000014277189,0.000022537472,0.00008133559,0.000039052906,0.98264253,0.0016320635,0.014748339,0.0005463111,0.000021468602],"about_ca_topic_score_codex":0.0017668776,"about_ca_topic_score_gemma":0.0017589311,"teacher_disagreement_score":0.0025732243,"about_ca_system_score_codex":0.0014170929,"about_ca_system_score_gemma":0.0018636812,"threshold_uncertainty_score":0.010520101},"labels":[],"label_agreement":null},{"id":"W4376605106","doi":"10.1016/j.aeue.2023.154709","title":"Identity-based attack detection using received signal strength in MIMO systems","year":2023,"lang":"en","type":"article","venue":"AEU - International Journal of Electronics and Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"RSS; MIMO; Computer science; Algorithm; Identity (music); Pattern recognition (psychology); Artificial intelligence; Mathematics; Telecommunications; Channel (broadcasting)","score_opus":0.040330611116812375,"score_gpt":0.32499173890876704,"score_spread":0.2846611277919547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376605106","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.16937034,0.00079532637,0.8217127,0.00047279388,0.00020678762,0.000060453007,0.00016519583,0.0004928707,0.0067235995],"genre_scores_gemma":[0.95919365,0.00036992884,0.037839588,0.00012768059,0.000096572134,0.000027959091,0.000104115294,0.00001236701,0.002228017],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99869376,0.00039408493,0.000060550145,0.00017331247,0.00044762564,0.00023057907],"domain_scores_gemma":[0.99832684,0.00086504983,0.0002330255,0.0001978333,0.00030353616,0.00007360525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009960396,0.00064504927,0.0007036354,0.0007075297,0.00033448802,0.0010209715,0.00042628872,0.00088303286,0.001049853],"category_scores_gemma":[0.0037515478,0.00031033345,0.00033779937,0.00056475465,0.0005098364,0.0010775329,0.0013400926,0.0007472058,0.00073739485],"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.0017958982,0.00037377936,0.01816235,0.00039789348,0.00033741127,0.0010889142,0.00043570774,0.25799593,0.24322425,0.041052714,0.0030522046,0.432083],"study_design_scores_gemma":[0.000025535246,0.00028458046,0.003965873,0.000025676269,0.000057642166,0.00064030424,0.00006772917,0.9563094,0.033292286,0.004274655,0.0010196401,0.000036711608],"about_ca_topic_score_codex":0.00050272426,"about_ca_topic_score_gemma":0.00056788616,"teacher_disagreement_score":0.001049853,"about_ca_system_score_codex":0.00030896542,"about_ca_system_score_gemma":0.00046964688,"threshold_uncertainty_score":0.00526762},"labels":[],"label_agreement":null},{"id":"W4379117199","doi":"10.1109/jiot.2023.3282214","title":"Adaptive Physical-Layer Authentication for IoT in MIMO Communication Systems Using Support Vector Machine","year":2023,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":18,"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":"Computer science; Spoofing attack; Authentication (law); Physical layer; MIMO; Computer network; Wireless; Link layer; Support vector machine; Channel (broadcasting); Computer security; Artificial intelligence; Telecommunications","score_opus":0.05210300379520688,"score_gpt":0.3107130308842381,"score_spread":0.2586100270890312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379117199","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.19876857,0.0005139301,0.7971518,0.00024448664,0.00012440394,0.000061457926,0.000022808608,0.00060616375,0.0025063236],"genre_scores_gemma":[0.9804889,0.00008052798,0.01867236,0.000021205182,0.000011183504,0.000014294673,0.000013887335,0.000004202069,0.0006933689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999561,0.00015859943,0.000026458358,0.000059758266,0.00013563993,0.00005850918],"domain_scores_gemma":[0.999228,0.00038866614,0.00010065761,0.00007842161,0.00018438652,0.000019894915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071000867,0.0003462749,0.00040218202,0.00017889128,0.00030087613,0.00051129225,0.00032575306,0.00040084525,0.00089512084],"category_scores_gemma":[0.0015370095,0.00009841141,0.0002519231,0.00021732302,0.00030009347,0.0006767578,0.00040207375,0.0005229015,0.00029056225],"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.0010714018,0.00032039304,0.0039754785,0.00020665897,0.00009131549,0.00026848304,0.00016349272,0.42493045,0.09329601,0.008013111,0.0017591302,0.46590406],"study_design_scores_gemma":[0.0000059757854,0.0002271289,0.0005464686,0.0000042045385,0.000007735129,0.00004309711,0.000018188837,0.9889464,0.00938204,0.00053939375,0.0002724598,0.0000070420956],"about_ca_topic_score_codex":0.0005819297,"about_ca_topic_score_gemma":0.0006368704,"teacher_disagreement_score":0.00089512084,"about_ca_system_score_codex":0.00025924426,"about_ca_system_score_gemma":0.00023747039,"threshold_uncertainty_score":0.0037549138},"labels":[],"label_agreement":null},{"id":"W4379117226","doi":"10.1109/twc.2023.3280464","title":"Securing Large-Scale D2D Networks Using Covert Communication and Friendly Jamming","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":26,"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 Manitoba; Ericsson (Canada)","funders":"","keywords":"Stackelberg competition; Covert; Jamming; Computer science; Secrecy; Exploit; Artificial noise; Computer network; Stochastic geometry; Computer security; Game theory; Transmitter; Mathematics; Channel (broadcasting)","score_opus":0.021472602832984158,"score_gpt":0.2680532102910516,"score_spread":0.24658060745806745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379117226","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.04804607,0.00030387184,0.94762385,0.00019355392,0.000046803525,0.00004214023,0.000025806326,0.00010509524,0.0036127975],"genre_scores_gemma":[0.9519071,0.0004256355,0.046119068,0.00008310618,0.000033032014,0.00007912807,0.000030375082,0.0000146884,0.0013079369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992642,0.00023155258,0.00002256441,0.000115518036,0.00022533906,0.00014086411],"domain_scores_gemma":[0.99876213,0.00062793883,0.00024836374,0.00014486127,0.00013158938,0.00008520537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070107117,0.0011158745,0.0007407883,0.00059776223,0.0006851517,0.0008955047,0.0010316529,0.0010969767,0.00072445424],"category_scores_gemma":[0.0024365704,0.00039473607,0.00080892106,0.00060419086,0.001209744,0.0015922739,0.002191736,0.0009179832,0.00019075257],"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.00004666708,0.000022105185,0.0005646364,0.00005924795,0.000031000913,0.00022275213,0.00007818194,0.9567423,0.0057854312,0.025296407,0.0003445019,0.010806759],"study_design_scores_gemma":[0.0000048132183,0.000037880924,0.00008068187,0.0000036489305,0.000006076603,0.00005151368,0.000012789939,0.9949999,0.00069919066,0.0037899427,0.000306279,0.000007221852],"about_ca_topic_score_codex":0.001842826,"about_ca_topic_score_gemma":0.0015450455,"teacher_disagreement_score":0.001842826,"about_ca_system_score_codex":0.00075286085,"about_ca_system_score_gemma":0.0006611988,"threshold_uncertainty_score":0.0054624677},"labels":[],"label_agreement":null},{"id":"W4382289048","doi":"10.1007/978-981-99-1203-2_11","title":"Beamforming Technique for Improving Physical Layer Security in an MIMO-OFDM Wireless Channel","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in networks and systems","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Physical layer; Beamforming; MIMO; Channel sounding; MIMO-OFDM; Orthogonal frequency-division multiplexing; Computer science; Multi-user MIMO; Wireless; Electronic engineering; Telecommunications link; Computer network; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.021575788712661678,"score_gpt":0.2543283388842433,"score_spread":0.23275255017158158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382289048","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.015170544,0.000664526,0.9773422,0.0001924485,0.00017041276,0.000025310836,0.0000546991,0.00036659048,0.0060133277],"genre_scores_gemma":[0.38951477,0.0025863752,0.58649284,0.00048751011,0.00033755798,0.00008950053,0.0002078196,0.000105947205,0.02017762],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998209,0.00004179029,0.000008695606,0.000033186392,0.00006866773,0.000026849004],"domain_scores_gemma":[0.99968517,0.00013427109,0.00002572452,0.000042575717,0.00009896423,0.0000133685835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002289496,0.0008193483,0.00035078335,0.00024183154,0.0003101019,0.00043145975,0.0003449002,0.00056887406,0.0050185085],"category_scores_gemma":[0.00051907153,0.00019339066,0.00033213088,0.0005853282,0.00030271296,0.0005605173,0.00036895665,0.0006902575,0.0015958985],"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.0003169886,0.00009870573,0.0005965095,0.00021666475,0.00007010889,0.00024793766,0.00009495787,0.03432851,0.6790465,0.031954143,0.003476369,0.24955261],"study_design_scores_gemma":[0.00007453,0.00078540976,0.0017857354,0.000085816384,0.0001698656,0.0016110505,0.000099680896,0.6982909,0.27125472,0.010953294,0.014798394,0.00009063187],"about_ca_topic_score_codex":0.00025687783,"about_ca_topic_score_gemma":0.00065501896,"teacher_disagreement_score":0.0050185085,"about_ca_system_score_codex":0.00016779524,"about_ca_system_score_gemma":0.00027313983,"threshold_uncertainty_score":0.016788542},"labels":[],"label_agreement":null},{"id":"W4382365049","doi":"10.1109/itw55543.2023.10161609","title":"The Secrecy Capacity of Gaussian Wiretap Channels with Rate-Limited Help at the Encoder","year":2023,"lang":"en","type":"article","venue":"","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":"University of Ottawa","funders":"","keywords":"Secrecy; Transmitter; Encoder; Computer science; Coding (social sciences); Computer network; Channel capacity; Channel (broadcasting); Computer security; Gaussian; Telecommunications; Topology (electrical circuits); Mathematics; Statistics; Electrical engineering; Physics; Engineering","score_opus":0.024233002935032676,"score_gpt":0.23168649723777288,"score_spread":0.2074534943027402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382365049","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.32124132,0.0031843914,0.62027705,0.0010580089,0.00018021287,0.000096420525,0.0010241136,0.00043737245,0.052501176],"genre_scores_gemma":[0.9879376,0.0012937755,0.007549365,0.000047855523,0.00006312569,0.00005247086,0.00012540891,0.000032441774,0.0028978905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998415,0.00049293664,0.000043532364,0.00015020362,0.00037533845,0.0005229429],"domain_scores_gemma":[0.9872133,0.009052432,0.0011339937,0.0008119064,0.0015363494,0.00025198603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020066297,0.001227197,0.0010328473,0.0012262728,0.00074257824,0.0018623397,0.0009845655,0.0009474286,0.0032628481],"category_scores_gemma":[0.008835359,0.0005277198,0.0005451787,0.0014899289,0.003962291,0.0026347197,0.0016266977,0.0010968874,0.0005842123],"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.00062174175,0.000058509006,0.0007275778,0.00035957273,0.00007608289,0.0006850838,0.00026880397,0.58526593,0.014537695,0.38387775,0.002089833,0.011431329],"study_design_scores_gemma":[0.00003537398,0.00013314425,0.0004622928,0.00010877887,0.00004663927,0.000379114,0.00014963416,0.9054022,0.009385611,0.08241736,0.0013874611,0.00009242232],"about_ca_topic_score_codex":0.0025746773,"about_ca_topic_score_gemma":0.0016145279,"teacher_disagreement_score":0.0032628481,"about_ca_system_score_codex":0.00168204,"about_ca_system_score_gemma":0.0018083019,"threshold_uncertainty_score":0.012204111},"labels":[],"label_agreement":null},{"id":"W4383753047","doi":"10.1109/tvt.2023.3293481","title":"Covert Communication in Two-Hop Cooperative Cognitive Radio System","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":10,"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 New Brunswick","funders":"Natural Science Foundation of Hubei Province; National Natural Science Foundation of China","keywords":"Covert; Underlay; Transmitter; Cognitive radio; Computer network; Computer science; Transmitter power output; Transmission (telecommunications); Covert channel; Interference (communication); Overlay; Telecommunications; Signal-to-noise ratio (imaging); Wireless; Channel (broadcasting)","score_opus":0.01250856251808129,"score_gpt":0.262036222337571,"score_spread":0.2495276598194897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383753047","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.2872775,0.0013122779,0.7030193,0.00035027225,0.00007190534,0.00005495782,0.00006324672,0.00022367059,0.007626803],"genre_scores_gemma":[0.9936958,0.00022611844,0.0054357857,0.00003575418,0.000017381777,0.00002121806,0.000010967966,0.0000042096403,0.0005527532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804497,0.0004929458,0.00005698957,0.00030829493,0.0006955568,0.0004012558],"domain_scores_gemma":[0.99745446,0.0015104724,0.0004170838,0.00021932164,0.00032279664,0.000075789016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010335501,0.00076085905,0.00092555204,0.000661265,0.00081792654,0.0010583753,0.0011821729,0.0012668933,0.0004647887],"category_scores_gemma":[0.0036254213,0.0003160507,0.0005286728,0.00074019376,0.0015677656,0.0013900897,0.0012390381,0.0005195202,0.0001073423],"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.00039429023,0.000102821345,0.004063265,0.00026670846,0.0001874779,0.0028352018,0.0007598208,0.8803874,0.03039855,0.046743732,0.0008598012,0.03300093],"study_design_scores_gemma":[0.000011533227,0.00008445339,0.00041463907,0.0000074652535,0.000024285888,0.00042394194,0.000047702113,0.99016297,0.0020464952,0.0064621335,0.00029530202,0.000019108113],"about_ca_topic_score_codex":0.0022852698,"about_ca_topic_score_gemma":0.0016241712,"teacher_disagreement_score":0.0022852698,"about_ca_system_score_codex":0.0011098714,"about_ca_system_score_gemma":0.00057731866,"threshold_uncertainty_score":0.008052707},"labels":[],"label_agreement":null},{"id":"W4384946062","doi":"10.1109/iwcmc58020.2023.10182942","title":"LDPC and ultra-massive multi-input multi-output for secrecy in 6G","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Eavesdropping; Physical layer; Low-density parity-check code; MIMO; Computer network; Jamming; Wireless; Secure transmission; Decoding methods; Secrecy; Artificial noise; Wireless network; Beamforming; Channel (broadcasting); Computer security; Telecommunications; Encryption","score_opus":0.04477915214774469,"score_gpt":0.2938765958925635,"score_spread":0.2490974437448188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384946062","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.045880184,0.0021075155,0.93767965,0.0009232926,0.00018346673,0.000058303514,0.000086611246,0.0006011092,0.012479843],"genre_scores_gemma":[0.8791944,0.001493592,0.11376198,0.00030392848,0.00009341924,0.000054230393,0.00006772745,0.000035517543,0.0049952506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949825,0.00015493673,0.000020403306,0.00005704399,0.00020394464,0.00006537095],"domain_scores_gemma":[0.99948514,0.00020392757,0.000060012888,0.00009368049,0.0001332191,0.000024031164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047337305,0.00047910903,0.00034876066,0.0004784899,0.0006499063,0.0007022393,0.00051424146,0.0007865768,0.001522676],"category_scores_gemma":[0.0011979287,0.00019070205,0.00037162256,0.00057019887,0.0008785471,0.00096291135,0.0007748618,0.0008997867,0.0003640163],"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.00036916288,0.00012501946,0.001867094,0.00044702715,0.00012560003,0.00089018286,0.00036447908,0.3871269,0.061254594,0.37482435,0.004381504,0.16822407],"study_design_scores_gemma":[0.00003374354,0.00023934453,0.00041983987,0.00007798881,0.00004293102,0.00069346256,0.000047510748,0.9034342,0.036271658,0.045918413,0.012765553,0.000055352357],"about_ca_topic_score_codex":0.0015804387,"about_ca_topic_score_gemma":0.0019440453,"teacher_disagreement_score":0.0015804387,"about_ca_system_score_codex":0.0005875772,"about_ca_system_score_gemma":0.00090574985,"threshold_uncertainty_score":0.005093932},"labels":[],"label_agreement":null},{"id":"W4385801059","doi":"10.1109/iccci59363.2023.10210105","title":"Robust Data Exchange Across Wind Turbines","year":2023,"lang":"en","type":"article","venue":"","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":"Carleton University","funders":"","keywords":"Wind power; Computer science; Software deployment; Smart grid; Relay; Wireless; Secrecy; Benchmark (surveying); Distributed computing; Grid; Turbine; Topology (electrical circuits); Computer network; Telecommunications; Engineering; Aerospace engineering; Computer security; Electrical engineering; Power (physics)","score_opus":0.14440522394015412,"score_gpt":0.3215837179459155,"score_spread":0.17717849400576138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385801059","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.055764947,0.0003022231,0.9381341,0.00042904884,0.00007601965,0.00005227281,0.00017269081,0.0004465171,0.004622268],"genre_scores_gemma":[0.975023,0.00019939274,0.02327561,0.00008323118,0.00004924132,0.00005608164,0.00015893202,0.000039684677,0.0011148812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835086,0.00046959685,0.00015094945,0.00033365647,0.0005246971,0.00017027243],"domain_scores_gemma":[0.9963965,0.0018844345,0.0004761885,0.0007194924,0.00045081845,0.00007263643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016915085,0.0005941007,0.0008990553,0.00043359553,0.0007142737,0.0015349383,0.00093712885,0.001180828,0.0015983796],"category_scores_gemma":[0.0072202366,0.00026002995,0.00039671472,0.0008508693,0.0008576072,0.0030402392,0.0018621199,0.00085850054,0.00042227373],"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.0004007766,0.000050676583,0.0010823482,0.00016183923,0.000082696606,0.0007199621,0.00021417098,0.8134142,0.019680372,0.099047825,0.0029772595,0.062167812],"study_design_scores_gemma":[0.000017259636,0.00007340149,0.00017847291,0.000008449359,0.000010047506,0.000095291995,0.000046178127,0.96207345,0.0047514094,0.03146419,0.0012694051,0.000012479164],"about_ca_topic_score_codex":0.00057311327,"about_ca_topic_score_gemma":0.00032573164,"teacher_disagreement_score":0.0016915085,"about_ca_system_score_codex":0.00059403246,"about_ca_system_score_gemma":0.00056740164,"threshold_uncertainty_score":0.008945644},"labels":[],"label_agreement":null},{"id":"W4386057507","doi":"10.1109/isit54713.2023.10206990","title":"Distributed Lossy Computation with Structured Codes: From Discrete to Continuous Sources","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"Ministry of Education; National Research Foundation; National Science Foundation","keywords":"Lossy compression; Decoding methods; Computer science; Encoding (memory); Algorithm; Rate–distortion theory; Encoder; Theoretical computer science; Gaussian; Computation; Data compression; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.009160112584267278,"score_gpt":0.24076454683402612,"score_spread":0.23160443424975885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386057507","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.017422419,0.0005531318,0.9791976,0.00026931436,0.000024444265,0.00002701675,0.00003774689,0.00010573189,0.0023625344],"genre_scores_gemma":[0.79050976,0.0012407302,0.20480244,0.00023065567,0.000107601314,0.0000950836,0.00013938089,0.00010530036,0.0027689885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986504,0.00047747095,0.000046374098,0.00019197824,0.00052327325,0.00011056137],"domain_scores_gemma":[0.9947962,0.0038188547,0.0003465378,0.00053089036,0.0003749494,0.00013261587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020019333,0.0007066719,0.0009802721,0.0004963462,0.0002760034,0.0014957251,0.0011688926,0.0008790536,0.001148314],"category_scores_gemma":[0.011232389,0.00037499488,0.0005289468,0.0008465315,0.002210223,0.0028763122,0.0021287734,0.0019234639,0.00028287858],"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.0001650006,0.00004121138,0.0002499383,0.00009957022,0.000022560489,0.00011733079,0.00010428682,0.79055077,0.0029539564,0.17807278,0.0006778053,0.026944749],"study_design_scores_gemma":[0.000012541287,0.000039070557,0.00004186302,0.000017561824,0.0000036648566,0.00006242672,0.000015751586,0.9313494,0.0012766995,0.06675569,0.0004172758,0.0000080901855],"about_ca_topic_score_codex":0.0011377373,"about_ca_topic_score_gemma":0.0008471806,"teacher_disagreement_score":0.0020019333,"about_ca_system_score_codex":0.0011891021,"about_ca_system_score_gemma":0.0012672951,"threshold_uncertainty_score":0.010587335},"labels":[],"label_agreement":null},{"id":"W4386072351","doi":"10.1109/isit54713.2023.10206791","title":"The Cardinality Bound on the Information Bottleneck Representations is Tight","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Information bottleneck method; Cardinality (data modeling); Combinatorics; Bottleneck; Hamming distance; Alphabet; Upper and lower bounds; Mathematics; Hamming code; Characterization (materials science); Function (biology); Discrete mathematics; Variable (mathematics); Random variable; Computer science; Algorithm; Decoding methods; Mutual information; Block code","score_opus":0.02572784857464373,"score_gpt":0.27348441220238223,"score_spread":0.2477565636277385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386072351","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.089352354,0.0022756532,0.8770017,0.0054973443,0.00018585823,0.00012412925,0.0014486053,0.00059088157,0.023523496],"genre_scores_gemma":[0.83625245,0.0034520635,0.14675266,0.0015386498,0.00087620725,0.00071056327,0.0016208754,0.00063832797,0.008158221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99318403,0.002123802,0.00032698218,0.0010952611,0.0022184486,0.0010514937],"domain_scores_gemma":[0.948714,0.039716624,0.0024932155,0.00578258,0.002075533,0.0012181128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069060945,0.0017958304,0.0022703768,0.0022380298,0.0015718126,0.0048311907,0.0028420396,0.0024861395,0.0055253594],"category_scores_gemma":[0.05762494,0.0009873206,0.0012250947,0.002622517,0.004503437,0.012905472,0.0068724095,0.007160992,0.001429915],"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.0009364073,0.00024166664,0.001684683,0.00058496353,0.000099132885,0.00032476612,0.0005186228,0.15760773,0.009396685,0.7580341,0.008363381,0.062207792],"study_design_scores_gemma":[0.00006567022,0.00020588467,0.0007184677,0.00018706563,0.000037662536,0.00043841003,0.000104877276,0.3933602,0.0065175453,0.5944892,0.003811825,0.00006317124],"about_ca_topic_score_codex":0.0006695607,"about_ca_topic_score_gemma":0.00048011,"teacher_disagreement_score":0.0069060945,"about_ca_system_score_codex":0.0022546302,"about_ca_system_score_gemma":0.0021835358,"threshold_uncertainty_score":0.036523342},"labels":[],"label_agreement":null},{"id":"W4386075162","doi":"10.1109/isit54713.2023.10206487","title":"Gaussian Broadcast Channels with Bidirectional Conferencing Decoders and Correlated Noises","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Toronto","funders":"","keywords":"Gaussian; Channel (broadcasting); Upper and lower bounds; Decoding methods; Lambda; Noise (video); Computer science; Gaussian noise; Topology (electrical circuits); Mathematics; Telecommunications; Algorithm; Computer network; Discrete mathematics; Physics; Combinatorics; Mathematical analysis; Image (mathematics); Optics; Artificial intelligence; Quantum mechanics","score_opus":0.016348434393403763,"score_gpt":0.22567217124463396,"score_spread":0.20932373685123018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386075162","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.15315066,0.00093605195,0.8287961,0.00051553437,0.00010180869,0.000076301156,0.00035894584,0.00035073035,0.015713967],"genre_scores_gemma":[0.97196835,0.0005789163,0.023095759,0.000112647744,0.000072038056,0.00009800951,0.00011462996,0.000022516058,0.0039370214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762076,0.0008580877,0.000067749905,0.0003373964,0.00053304073,0.0005829726],"domain_scores_gemma":[0.9949458,0.0030207979,0.00065099436,0.00044882638,0.00075029023,0.00018321241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013761832,0.0015284634,0.001376667,0.00072483334,0.00092593965,0.0017375223,0.0013807274,0.0015089306,0.001515447],"category_scores_gemma":[0.006479432,0.00065318367,0.00065261684,0.0014343945,0.0024566795,0.0017856132,0.0022642908,0.0015772682,0.0005147539],"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.0006361977,0.0000755139,0.0010449784,0.00023347301,0.00009562124,0.0010262972,0.00034527062,0.6028871,0.009327688,0.36792552,0.0019429821,0.014459394],"study_design_scores_gemma":[0.000043309734,0.00008939076,0.00023096643,0.000021073889,0.000047366175,0.0002449773,0.000059934046,0.95418614,0.003533466,0.040271886,0.0012241333,0.000047354886],"about_ca_topic_score_codex":0.0066930223,"about_ca_topic_score_gemma":0.0049133096,"teacher_disagreement_score":0.0066930223,"about_ca_system_score_codex":0.0018273272,"about_ca_system_score_gemma":0.0017262708,"threshold_uncertainty_score":0.013308167},"labels":[],"label_agreement":null},{"id":"W4386212465","doi":"10.1109/siu59756.2023.10223930","title":"Secrecy Outage Probability of SWIPT-OFDMA Schemes with Transmit Antenna Selection","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Orthogonal frequency-division multiple access; Wireless; Secrecy; Maximum power transfer theorem; Computer network; Frequency-division multiple access; Telecommunications; Power (physics); Orthogonal frequency-division multiplexing; Computer security; Channel (broadcasting)","score_opus":0.017939284574184363,"score_gpt":0.2280304318238388,"score_spread":0.21009114724965444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386212465","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6887454,0.0033907066,0.28727692,0.00070244644,0.00010297871,0.00009362005,0.000583432,0.00041762143,0.018686978],"genre_scores_gemma":[0.9962669,0.00038974668,0.0028396985,0.000021058717,0.000016207046,0.000017117842,0.0000558968,0.000013778124,0.00037971343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966474,0.0015087039,0.00016735423,0.000252017,0.00084987225,0.0005745974],"domain_scores_gemma":[0.9827069,0.012679986,0.002050743,0.0010735675,0.0012595379,0.00022921947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003864,0.0010710495,0.0012114294,0.0008322837,0.00083768443,0.001263137,0.00069658674,0.0010014194,0.0010639982],"category_scores_gemma":[0.013194729,0.0003860163,0.0005756006,0.0013746493,0.0018182149,0.0017977417,0.0014449524,0.0007420442,0.0002304997],"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.0008837264,0.00009440917,0.008945649,0.00033989034,0.00017021887,0.0011445839,0.0003196655,0.9254766,0.012797466,0.030497953,0.0007910638,0.018538797],"study_design_scores_gemma":[0.000033154985,0.0003253535,0.0029850318,0.000044083106,0.000094393756,0.00069634727,0.00018266295,0.97541296,0.010296549,0.009447252,0.00043607785,0.000046147],"about_ca_topic_score_codex":0.0014905247,"about_ca_topic_score_gemma":0.0011522372,"teacher_disagreement_score":0.003864,"about_ca_system_score_codex":0.0013020713,"about_ca_system_score_gemma":0.0012352378,"threshold_uncertainty_score":0.020435035},"labels":[],"label_agreement":null},{"id":"W4386322005","doi":"10.1109/jiot.2023.3310587","title":"Low-Complexity Dynamic Directional Modulation: Vulnerability and Information Leakage","year":2023,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"CHIST-ERA; Foreign Affairs and International Trade Canada; Ministério da Ciência, Tecnologia, Inovações e Comunicações; Università degli Studi di Ferrara; Universidade Estadual de Campinas; Politechnika Wrocławska; Oulun Yliopisto; Aalborg Universitet; Technological University Dublin; Instituto Nacional de Telecomunicações; Trinity College Dublin; Inyuvesi Yakwazulu-Natali; Science Foundation Ireland; National Research Foundation; Business Finland; Fundação de Amparo à Pesquisa do Estado de São Paulo; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Instituto de Telecomunicações; Concordia University; Academy of Finland; RWTH Aachen University; BioDelivery Sciences International","keywords":"Information leakage; Computer science; Wireless; Leakage (economics); Antenna (radio); Electronic engineering; Transmission (telecommunications); Computer network; Telecommunications; Engineering","score_opus":0.017968242477971543,"score_gpt":0.26394528676228457,"score_spread":0.24597704428431302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386322005","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.082393296,0.0015368289,0.90595,0.0008294991,0.000080072794,0.000032536496,0.000057999474,0.00016672998,0.008953047],"genre_scores_gemma":[0.945817,0.00082857715,0.05149799,0.00016626567,0.000059455808,0.000027852371,0.00003052393,0.00002085201,0.0015515381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983183,0.0006857137,0.000068837224,0.00019258396,0.0005837631,0.00015088436],"domain_scores_gemma":[0.9946032,0.0032725588,0.0005589573,0.0012545143,0.00025280972,0.000058001067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014331022,0.00052236294,0.0007070016,0.00056041876,0.0004895721,0.0011272298,0.00064542104,0.0008954663,0.00087423157],"category_scores_gemma":[0.008752402,0.0002391185,0.0003073279,0.0009854969,0.0013351014,0.0021777796,0.0014015877,0.001161468,0.00024662734],"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.0007304457,0.0001370565,0.0056729275,0.00049180735,0.00014359762,0.0007573525,0.0005467834,0.19067015,0.12282016,0.4123866,0.001681532,0.26396164],"study_design_scores_gemma":[0.00002886007,0.0004561752,0.0017949038,0.00010381331,0.000070974136,0.0027389706,0.00012357788,0.8251666,0.05948087,0.10285263,0.0071138986,0.00006873686],"about_ca_topic_score_codex":0.00013650724,"about_ca_topic_score_gemma":0.00011527472,"teacher_disagreement_score":0.0014331022,"about_ca_system_score_codex":0.00060759013,"about_ca_system_score_gemma":0.00033987823,"threshold_uncertainty_score":0.007579088},"labels":[],"label_agreement":null},{"id":"W4386323222","doi":"10.1109/icce-taiwan58799.2023.10226772","title":"Secure Communication with Physical Layer Coding Scheme","year":2023,"lang":"en","type":"article","venue":"","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":"Education and Early Childhood Development","funders":"Ministry of Science and Technology","keywords":"Communication source; Computer science; Secrecy; Computer network; Encryption; Computer security; Secure communication; Physical layer; Decoding methods; Cryptography; Information-theoretic security; Message authentication code; Secure coding; Information security; Wireless; Telecommunications; Security service","score_opus":0.02044017593248255,"score_gpt":0.2610817794370843,"score_spread":0.2406416035046018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386323222","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.015052139,0.002051477,0.95332676,0.0014469546,0.0004746406,0.00031148063,0.00026973296,0.0006175671,0.026449287],"genre_scores_gemma":[0.8087716,0.003599646,0.1679133,0.0010074115,0.00033545092,0.0007121083,0.00044824174,0.000064825486,0.017147502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848026,0.00028677858,0.000105082225,0.00018583854,0.0006698931,0.000272114],"domain_scores_gemma":[0.99882144,0.00032960583,0.0001389592,0.00025964837,0.00040739684,0.0000429294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088506285,0.0007935075,0.00064563786,0.0008469377,0.0010263827,0.0013064469,0.0007658022,0.0012143331,0.0036377718],"category_scores_gemma":[0.0027579358,0.00022479285,0.0004708563,0.0011688815,0.0010325866,0.0015856843,0.0017325652,0.0014622569,0.0010368624],"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.00049604283,0.00011432054,0.0008666276,0.0007106803,0.00009451131,0.0012727322,0.0005495353,0.10976008,0.05569028,0.6146053,0.01922201,0.19661789],"study_design_scores_gemma":[0.00024896354,0.0004418083,0.00071170146,0.00039413114,0.00012918151,0.002194123,0.00014969264,0.7059984,0.037888803,0.18729596,0.064315654,0.00023164514],"about_ca_topic_score_codex":0.002525731,"about_ca_topic_score_gemma":0.0019775182,"teacher_disagreement_score":0.0036377718,"about_ca_system_score_codex":0.0010048116,"about_ca_system_score_gemma":0.0019232469,"threshold_uncertainty_score":0.01216954},"labels":[],"label_agreement":null},{"id":"W4386552795","doi":"10.1109/ojcoms.2023.3313352","title":"Empowering Security and Trust in 5G and Beyond: A Deep Reinforcement Learning Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Reinforcement learning; Computer science; Intrusion detection system; Bandwidth (computing); Internet of Things; Distributed computing; Deep learning; Artificial intelligence; Computer network; Computer security","score_opus":0.03128956785249813,"score_gpt":0.30950634054412535,"score_spread":0.2782167726916272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386552795","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.058113072,0.0006857679,0.93076074,0.002619711,0.000089228255,0.00006357904,0.00005835493,0.00033498782,0.0072745737],"genre_scores_gemma":[0.9647172,0.00026499946,0.031870157,0.00031066578,0.000049362192,0.000054864955,0.000032984444,0.000022699149,0.0026770097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993299,0.0002475047,0.000026289124,0.0001258741,0.000137847,0.00013259512],"domain_scores_gemma":[0.9978726,0.0012761722,0.0002505072,0.00009960963,0.00033686258,0.00016425012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015254224,0.00064061425,0.000868563,0.00035016425,0.00038310437,0.0010574457,0.0012608598,0.001513158,0.0017247291],"category_scores_gemma":[0.0042709145,0.0003581593,0.0004386787,0.0002983365,0.0014971815,0.001472029,0.0013014978,0.0019830358,0.00019681592],"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.0000761475,0.00008536147,0.002179525,0.000052323485,0.00005601758,0.00013968468,0.00010276086,0.9404596,0.0010830316,0.026008103,0.0012190063,0.028538391],"study_design_scores_gemma":[0.0000049091464,0.000014512883,0.0000924687,0.0000044656827,0.0000045054962,0.000007649416,0.000005836977,0.9936845,0.00011737295,0.0058669266,0.00019350606,0.000003306871],"about_ca_topic_score_codex":0.00687227,"about_ca_topic_score_gemma":0.0054295,"teacher_disagreement_score":0.00687227,"about_ca_system_score_codex":0.0014658051,"about_ca_system_score_gemma":0.0015625361,"threshold_uncertainty_score":0.013664544},"labels":[],"label_agreement":null},{"id":"W4387717425","doi":"10.1109/lwc.2023.3324981","title":"EsaNet: Environment Semantics Enabled Physical Layer Authentication","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; European Commission; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; National Science Foundation","keywords":"Computer science; Spoofing attack; Physical layer; Computer network; Wireless network; Authentication (law); Wireless; Wireless security; Computer security; Telecommunications","score_opus":0.02934541922318499,"score_gpt":0.2619509789833638,"score_spread":0.2326055597601788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387717425","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.08366963,0.0004141576,0.90828264,0.0003353026,0.00015762921,0.000068162226,0.00016474625,0.0027410577,0.0041666115],"genre_scores_gemma":[0.94131,0.00021854635,0.05491946,0.00025449126,0.000031980853,0.00004495595,0.00025716375,0.00003221014,0.0029311718],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99967253,0.000059622267,0.000019527597,0.00006680269,0.00010565886,0.00007586099],"domain_scores_gemma":[0.99965537,0.00007009594,0.000064158536,0.00007904402,0.00010405034,0.000027381384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004083842,0.0004151834,0.0003413419,0.00036215046,0.00034256652,0.00051624863,0.0006415922,0.00051969633,0.0009485436],"category_scores_gemma":[0.0009778002,0.00014196623,0.00023223578,0.00025269817,0.00048443058,0.0017695273,0.0014816463,0.0009058115,0.00035062776],"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.0011525416,0.0003823803,0.007793059,0.00022733481,0.00014212403,0.00076998695,0.0002165267,0.15431184,0.15456305,0.031353667,0.011038835,0.63804865],"study_design_scores_gemma":[0.000020213321,0.00024595953,0.001402107,0.000016245052,0.000035321682,0.00030071085,0.000046303896,0.9416189,0.043779902,0.007533097,0.004966963,0.000034290497],"about_ca_topic_score_codex":0.0008637967,"about_ca_topic_score_gemma":0.0014372255,"teacher_disagreement_score":0.0009485436,"about_ca_system_score_codex":0.00034585377,"about_ca_system_score_gemma":0.0004953477,"threshold_uncertainty_score":0.003173232},"labels":[],"label_agreement":null},{"id":"W4387872657","doi":"10.1109/icc45041.2023.10279803","title":"Doubly Securing Large-Scale D2D Networks","year":2023,"lang":"en","type":"article","venue":"","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":"University of Manitoba; York University","funders":"","keywords":"Covert; Jamming; Computer science; Secrecy; Exploit; Stackelberg competition; Computer network; Computer security; Reliability (semiconductor); Stochastic geometry; Artificial noise; Transmitter; Power (physics); Mathematics","score_opus":0.011898002304535147,"score_gpt":0.24006552513263546,"score_spread":0.22816752282810032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387872657","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.081094004,0.0003508292,0.9142151,0.00022356621,0.000052329295,0.00004602045,0.000054246186,0.00014055209,0.0038233886],"genre_scores_gemma":[0.97688043,0.0002801165,0.021447254,0.000059816597,0.000024831663,0.000046685374,0.000027828182,0.000010576871,0.0012223792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991559,0.0002752605,0.000028585206,0.0001387848,0.00024307924,0.00015838358],"domain_scores_gemma":[0.99809223,0.0009788492,0.00034131375,0.00030709375,0.00016007829,0.00012041607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077643176,0.0009140931,0.0007183645,0.0005578083,0.0007059756,0.00089196605,0.0011085554,0.0009907046,0.0008482691],"category_scores_gemma":[0.0028524555,0.00034906785,0.00062179513,0.0005398783,0.0012984631,0.0016214248,0.0026707416,0.0007920842,0.00021442906],"study_design_candidate":"not_applicable","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.000103508835,0.000028410963,0.0009686582,0.00008153089,0.00004963454,0.00042225138,0.00013402003,0.9193126,0.00965433,0.052904785,0.00063435396,0.01570596],"study_design_scores_gemma":[0.000007813673,0.000046654437,0.00015458073,0.0000049462146,0.000008911843,0.00010838971,0.00002185038,0.9876699,0.0014983357,0.009867758,0.00059990265,0.0000109362245],"about_ca_topic_score_codex":0.0011791729,"about_ca_topic_score_gemma":0.0009338439,"teacher_disagreement_score":0.0011791729,"about_ca_system_score_codex":0.00069758855,"about_ca_system_score_gemma":0.00049214833,"threshold_uncertainty_score":0.0050613284},"labels":[],"label_agreement":null},{"id":"W4387883697","doi":"10.1109/icc45041.2023.10278964","title":"Securing Cognitive Radio Networks via Relay and Jammer-Based Energy Harvesting on Cascaded Channels","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Jamming; Computer network; Underlay; Cognitive radio; Computer science; Energy harvesting; Rayleigh fading; Transmitter; Fading; Wireless; Energy (signal processing); Secrecy; Physical layer; Exploit; Channel (broadcasting); Telecommunications; Power (physics); Signal-to-noise ratio (imaging); Computer security; Mathematics; Physics","score_opus":0.017987359812425233,"score_gpt":0.232908435191772,"score_spread":0.2149210753793468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387883697","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.21859524,0.00062230485,0.7734491,0.000119301825,0.00004665417,0.000058067923,0.0000314539,0.00017415386,0.00690364],"genre_scores_gemma":[0.984917,0.0003642514,0.01341591,0.000027492097,0.000018449191,0.00002064978,0.000008304789,0.0000058451938,0.001222135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995291,0.00012919959,0.000016693817,0.00011403705,0.00013340371,0.00007757512],"domain_scores_gemma":[0.99896705,0.0006166539,0.00016999418,0.00012693518,0.000091649716,0.000027733853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005881568,0.00073292997,0.0005624054,0.00032702263,0.00040662562,0.00068760046,0.00082835107,0.0007949193,0.00069441996],"category_scores_gemma":[0.0013844287,0.0002849042,0.00051793427,0.00031252136,0.0012197868,0.0012252796,0.0009884796,0.00043586153,0.00017751717],"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.0004560958,0.00011774683,0.0021164403,0.0002460926,0.00012153944,0.0013670202,0.00035854356,0.8166126,0.07223514,0.060104135,0.00044635558,0.04581834],"study_design_scores_gemma":[0.000012881045,0.00028819861,0.00060689624,0.000016394655,0.00004179174,0.0003926579,0.00004828667,0.98082435,0.007852091,0.009324291,0.0005684194,0.000023806222],"about_ca_topic_score_codex":0.00059231464,"about_ca_topic_score_gemma":0.0006796191,"teacher_disagreement_score":0.00082835107,"about_ca_system_score_codex":0.00036565625,"about_ca_system_score_gemma":0.00028285754,"threshold_uncertainty_score":0.003110528},"labels":[],"label_agreement":null},{"id":"W4387918077","doi":"10.1109/twc.2023.3325384","title":"Achieving Covert Communication in Large-Scale SWIPT-Enabled D2D Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":16,"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 Manitoba; Artificial Intelligence in Medicine (Canada); Ericsson (Canada)","funders":"National Natural Science Foundation of China; National Research Foundation Singapore","keywords":"Computer science; Covert; Wireless; Computer network; Scale (ratio); Telecommunications","score_opus":0.019122862894883696,"score_gpt":0.2626043478042409,"score_spread":0.24348148490935723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387918077","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.031511515,0.00035152695,0.9635506,0.00032377927,0.00004485107,0.000050679606,0.00008257741,0.00008975489,0.00399464],"genre_scores_gemma":[0.9468476,0.0007751597,0.049226288,0.00014724395,0.000047007714,0.00013751005,0.0000745354,0.000028828126,0.0027157855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989335,0.00033270413,0.000034825174,0.00025571397,0.00026552443,0.00017781471],"domain_scores_gemma":[0.9979486,0.0013370246,0.0003205609,0.00016978943,0.00013454091,0.000089488276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011042551,0.0012231796,0.0010744747,0.00045164718,0.0006736247,0.001424857,0.001563799,0.0014987614,0.0010516284],"category_scores_gemma":[0.003074953,0.0006233176,0.0008551413,0.0005253499,0.0018600515,0.0019111417,0.0024418219,0.0012812256,0.00022526142],"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.00006228277,0.000032379186,0.00052037294,0.00012289161,0.000041526324,0.0004314975,0.00010065979,0.88960236,0.0064052367,0.093262084,0.00073993875,0.008678783],"study_design_scores_gemma":[0.000009295351,0.000040357838,0.00012918352,0.000009551433,0.000008292338,0.00010301992,0.00002536877,0.97367054,0.0011462022,0.024171775,0.00067436363,0.000012037387],"about_ca_topic_score_codex":0.0017376323,"about_ca_topic_score_gemma":0.0012090489,"teacher_disagreement_score":0.0017376323,"about_ca_system_score_codex":0.0015582918,"about_ca_system_score_gemma":0.0008134979,"threshold_uncertainty_score":0.011306226},"labels":[],"label_agreement":null},{"id":"W4387950938","doi":"","title":"Covert communication with noncausal channel-state information at the transmitter","year":2018,"lang":"en","type":"other","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"University of Toronto","funders":"","keywords":"Transmitter; Computer science; Channel (broadcasting); Covert channel; State (computer science); Covert; Channel state information; Telecommunications; Computer network; Wireless; Algorithm; Philosophy","score_opus":0.005108702033563898,"score_gpt":0.1855741636915736,"score_spread":0.1804654616580097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387950938","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.10230103,0.0015391366,0.8399672,0.0013002129,0.00052519824,0.00007193991,0.0004203349,0.0005718637,0.053302992],"genre_scores_gemma":[0.9440187,0.0012117665,0.033579078,0.00025684587,0.0004956732,0.00007872247,0.00024679131,0.00006033715,0.02005192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993228,0.000112025606,0.000018467037,0.000112750145,0.00031089838,0.00012312537],"domain_scores_gemma":[0.9983217,0.0010273188,0.0001749409,0.0002959952,0.00013911491,0.00004093221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004555299,0.0007582303,0.00075621845,0.00050031487,0.000654857,0.0010121574,0.00056977646,0.0015391647,0.004984913],"category_scores_gemma":[0.002430086,0.00027833862,0.00044423342,0.0005688792,0.0010607429,0.0012702027,0.0011448354,0.0007992873,0.0008596719],"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.0013724925,0.00016143732,0.002460013,0.0008059639,0.00016989374,0.0033555226,0.0005778795,0.28386846,0.088718064,0.44448966,0.007754802,0.16626583],"study_design_scores_gemma":[0.0000685579,0.00019144067,0.001090587,0.00008895995,0.00007546376,0.0014703561,0.000051411193,0.84565735,0.03404171,0.107593074,0.009612628,0.00005845385],"about_ca_topic_score_codex":0.0004601861,"about_ca_topic_score_gemma":0.0007098757,"teacher_disagreement_score":0.004984913,"about_ca_system_score_codex":0.00059069466,"about_ca_system_score_gemma":0.00048060107,"threshold_uncertainty_score":0.016676188},"labels":[],"label_agreement":null},{"id":"W4387969887","doi":"10.1109/cns59707.2023.10288672","title":"High-speed OFDM Physical-Layer Key Exchange","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Computer science; Physical layer; Key generation; Key (lock); Orthogonal frequency-division multiplexing; Channel (broadcasting); Wireless; Aloha; Key exchange; Computer network; NIST; Throughput; Telecommunications; Public-key cryptography","score_opus":0.029981671146320162,"score_gpt":0.26855167159007026,"score_spread":0.2385700004437501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387969887","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.06279073,0.00028058936,0.92509514,0.00044745722,0.00015588193,0.0002738635,0.00012877963,0.00076044915,0.010067148],"genre_scores_gemma":[0.8737409,0.00021829637,0.12005639,0.00020032632,0.0000681318,0.00029250007,0.00009560348,0.000030357423,0.0052974643],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991535,0.00021373364,0.000062169616,0.000104474566,0.00033984447,0.00012633264],"domain_scores_gemma":[0.99851507,0.0007226068,0.00016441828,0.00029261067,0.00027273822,0.00003260358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001634752,0.00033539857,0.00042418105,0.00037740328,0.0006403917,0.00075770007,0.00057951367,0.0007491148,0.0036793582],"category_scores_gemma":[0.004358964,0.00014545133,0.00017204187,0.00037063155,0.0004761597,0.0012356509,0.00093706365,0.0005848472,0.00074684486],"study_design_candidate":"not_applicable","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.001316496,0.00039299752,0.0050263354,0.00043270894,0.00013649151,0.0014136331,0.0007631756,0.14790681,0.21166511,0.17825815,0.008672731,0.4440153],"study_design_scores_gemma":[0.00025649837,0.0007443759,0.0017854063,0.000054798373,0.00005755694,0.0014051654,0.00016907828,0.78851146,0.13956508,0.034306094,0.033047557,0.0000968959],"about_ca_topic_score_codex":0.00032210682,"about_ca_topic_score_gemma":0.00038079626,"teacher_disagreement_score":0.0036793582,"about_ca_system_score_codex":0.00046115485,"about_ca_system_score_gemma":0.0006077173,"threshold_uncertainty_score":0.012308717},"labels":[],"label_agreement":null},{"id":"W4388408173","doi":"10.3390/e25111522","title":"Energy-Limited Joint Source–Channel Coding of Gaussian Sources over Gaussian Channels with Unknown Noise Level","year":2023,"lang":"en","type":"article","venue":"Entropy","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Tangled Art + Disability; Tel Aviv University; Israel Science Foundation","keywords":"Gaussian noise; Additive white Gaussian noise; Shannon–Hartley theorem; Gaussian; Mathematics; Pulse-position modulation; Algorithm; Computer science; Topology (electrical circuits); White noise; Physics; Telecommunications; Statistics; Pulse (music); Combinatorics; Pulse-amplitude modulation","score_opus":0.02815704184092932,"score_gpt":0.23360444175209388,"score_spread":0.20544739991116456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388408173","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.066226214,0.00035615338,0.93066925,0.0002630926,0.000028419232,0.000025307123,0.00007897371,0.00008542335,0.002267057],"genre_scores_gemma":[0.9437374,0.00042589122,0.053661108,0.000060710907,0.00003449084,0.00004914213,0.00008093372,0.000020097272,0.0019302262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991992,0.00030265274,0.000035344317,0.00009925205,0.00026451846,0.00009901985],"domain_scores_gemma":[0.99791044,0.0014958065,0.00023137497,0.00013392208,0.00018381038,0.00004461271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011627482,0.00072595285,0.00081328594,0.00031531753,0.00022831351,0.00068678247,0.0007614303,0.0007279231,0.00070895924],"category_scores_gemma":[0.0033679774,0.00023274896,0.00033446378,0.0006621939,0.0013964755,0.0013700717,0.0013482363,0.00069010135,0.00015085698],"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.00019795742,0.000026775757,0.00029473807,0.00015627481,0.000033985685,0.00015169443,0.000103642626,0.8817235,0.010235586,0.08887558,0.0003230865,0.01787722],"study_design_scores_gemma":[0.000012974252,0.00003832551,0.00006220476,0.000015217453,0.000009521023,0.000043883498,0.000011246433,0.98247117,0.004328766,0.01278942,0.00020676135,0.0000105007175],"about_ca_topic_score_codex":0.0009904362,"about_ca_topic_score_gemma":0.0008371087,"teacher_disagreement_score":0.0011627482,"about_ca_system_score_codex":0.00064083864,"about_ca_system_score_gemma":0.0008864673,"threshold_uncertainty_score":0.006149292},"labels":[],"label_agreement":null},{"id":"W4389169165","doi":"10.1109/tit.2023.3338215","title":"On a Class of Time-Varying Gaussian ISI Channels","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Columbia College","funders":"","keywords":"Channel (broadcasting); Upper and lower bounds; Computer science; Algorithm; Combinatorics; Mathematics; Telecommunications; Mathematical analysis","score_opus":0.010432682626857485,"score_gpt":0.2313363599901174,"score_spread":0.22090367736325991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389169165","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.18696332,0.003930568,0.76392585,0.001294964,0.00032763154,0.00009113752,0.00059624837,0.00033981714,0.042530492],"genre_scores_gemma":[0.9604118,0.004587812,0.018150344,0.0003386352,0.00073145586,0.000089677946,0.00041264837,0.00007866141,0.015199007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988028,0.00024250738,0.000033814827,0.00020831688,0.0003826648,0.00032993083],"domain_scores_gemma":[0.99708444,0.0016266588,0.0004887209,0.00020287745,0.0004487831,0.00014841415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001044175,0.0008884248,0.00088024884,0.0012299715,0.001070694,0.0017419495,0.0010432001,0.0011370498,0.0030541338],"category_scores_gemma":[0.004110548,0.00027816196,0.0007715362,0.0018507157,0.0018536891,0.0022765582,0.0009828162,0.0016146455,0.0005700231],"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.00015959835,0.00008174561,0.0021230907,0.00015248048,0.000053831707,0.00066924596,0.00031091514,0.20007853,0.004362099,0.7722916,0.0031439762,0.01657298],"study_design_scores_gemma":[0.000032402757,0.0000641694,0.001099087,0.000040051233,0.000034875786,0.00046174653,0.000110725254,0.7622646,0.0012212835,0.23022763,0.0043969266,0.000046483245],"about_ca_topic_score_codex":0.0061375857,"about_ca_topic_score_gemma":0.0021607103,"teacher_disagreement_score":0.0061375857,"about_ca_system_score_codex":0.0013995223,"about_ca_system_score_gemma":0.001089527,"threshold_uncertainty_score":0.012203693},"labels":[],"label_agreement":null},{"id":"W4389544151","doi":"10.1109/ccpqt60491.2023.00047","title":"Physical Layer Enhanced Encryption over Wireless Channel","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Encryption; Computer science; Physical layer; Cryptography; Computer network; Wireless; Probabilistic encryption; Channel (broadcasting); Algorithm; Telecommunications","score_opus":0.01979780306907706,"score_gpt":0.2744134719944794,"score_spread":0.2546156689254023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389544151","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.03301555,0.000972911,0.9540038,0.0002341451,0.00017589904,0.0000896524,0.00009911349,0.0007434178,0.01066544],"genre_scores_gemma":[0.7925035,0.0012498643,0.19176613,0.0002337867,0.00012295303,0.00013131167,0.0001834642,0.00008827079,0.01372078],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993556,0.00011232198,0.00005043549,0.00008089446,0.00030474592,0.000096075455],"domain_scores_gemma":[0.99911755,0.00026126057,0.00012657652,0.00028511568,0.0001883673,0.0000210723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005413484,0.00044365367,0.00042309452,0.00032041862,0.0003006648,0.0007928692,0.0005141501,0.00047789715,0.002317383],"category_scores_gemma":[0.0012733733,0.00015529997,0.00034208188,0.0003643375,0.00037400858,0.00208374,0.001006509,0.0008637831,0.0008228371],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00069277914,0.0001625627,0.0017578963,0.0009704911,0.000108472435,0.0011495097,0.0004841955,0.08169096,0.390841,0.21704806,0.0068009975,0.29829317],"study_design_scores_gemma":[0.000098522156,0.00047709126,0.0012149323,0.000096284326,0.000093793235,0.0022661844,0.000111215166,0.5959594,0.30904248,0.023102487,0.06743579,0.00010178762],"about_ca_topic_score_codex":0.00019146178,"about_ca_topic_score_gemma":0.00022560771,"teacher_disagreement_score":0.002317383,"about_ca_system_score_codex":0.00031225392,"about_ca_system_score_gemma":0.0003056623,"threshold_uncertainty_score":0.007752359},"labels":[],"label_agreement":null},{"id":"W4389989653","doi":"10.1155/2023/9895680","title":"Retracted: Statistical Characteristics and Security Analysis over Multi-Cascade <i>κ</i>-<i>μ</i> Shadowed Channels","year":2023,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":true,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cascade; Computer science; Statistical analysis; Computer security; Operations research; Statistics; Engineering; Mathematics","score_opus":0.012039575123728675,"score_gpt":0.27246639049600874,"score_spread":0.2604268153722801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389989653","genre_codex":"editorial","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.010819408,0.0038804822,0.052070823,0.2521139,0.6493772,0.00024761772,0.0041981875,0.0046931007,0.022599295],"genre_scores_gemma":[0.22353622,0.008150467,0.04074844,0.088383995,0.23665386,0.0004341548,0.0081626745,0.0049213665,0.3890088],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954672,0.00076448615,0.00043793532,0.00049039087,0.0024813777,0.00035863344],"domain_scores_gemma":[0.94798476,0.0081998445,0.0011286346,0.004980437,0.034626134,0.0030802246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005914446,0.0012673392,0.0015075562,0.0016831044,0.0027325647,0.0035373247,0.0036761942,0.0050519123,0.032555576],"category_scores_gemma":[0.05468393,0.00065838237,0.001382145,0.0015336565,0.0019835248,0.0040816837,0.0026138555,0.0075566866,0.017940676],"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.00011697411,0.000046391775,0.0010399206,0.00016038388,0.000031696294,0.000614913,0.00018089077,0.00085950975,0.00083666656,0.0046904422,0.9646037,0.026818436],"study_design_scores_gemma":[0.000095267256,0.00022908459,0.0048655435,0.00035019286,0.00013813164,0.0017421431,0.00060788903,0.020821875,0.0038941298,0.022733644,0.94433093,0.0001912464],"about_ca_topic_score_codex":0.017271938,"about_ca_topic_score_gemma":0.011179139,"teacher_disagreement_score":0.032555576,"about_ca_system_score_codex":0.0032346454,"about_ca_system_score_gemma":0.005144922,"threshold_uncertainty_score":0.10890925},"labels":[],"label_agreement":null},{"id":"W4390189529","doi":"10.1109/milcom58377.2023.10356292","title":"Constant Scaling Asymptotics of Communication Bounds in Covert Channels Against Selective Adversary","year":2023,"lang":"en","type":"article","venue":"","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":"Toronto Metropolitan University","funders":"Tsinghua Shenzhen International Graduate School","keywords":"Code word; Binary number; Transmitter; Covert; Adversary; Mathematics; Constraint (computer-aided design); Adversary model; Computer science; Constant (computer programming); Upper and lower bounds; Distribution (mathematics); Simple (philosophy); Square root; Algorithm; Decoding methods; Computer network; Statistics; Arithmetic; Mathematical analysis","score_opus":0.014240440785015891,"score_gpt":0.24882199176299696,"score_spread":0.23458155097798108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390189529","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.08918491,0.008090865,0.8361972,0.0042024665,0.00047433865,0.00015860984,0.0005496053,0.0026083305,0.058533642],"genre_scores_gemma":[0.93995917,0.004259524,0.042920113,0.0012077643,0.0007573458,0.0004353864,0.0004135666,0.0007289661,0.009318156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946004,0.0011731164,0.0001360452,0.0010096374,0.0018470951,0.0012337075],"domain_scores_gemma":[0.9316473,0.056765303,0.002723594,0.0046342798,0.002986357,0.0012432273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055699805,0.0022923944,0.0019472676,0.0026320308,0.0019593094,0.0032024465,0.0023973284,0.0017852666,0.006627927],"category_scores_gemma":[0.06497616,0.0010086467,0.0011994661,0.0020100342,0.006597215,0.008954815,0.0049315677,0.005495705,0.0014036474],"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.0006341289,0.00020398042,0.003953802,0.0008580275,0.00020004023,0.0008632373,0.000992996,0.32599613,0.01704711,0.59042084,0.009662992,0.049166784],"study_design_scores_gemma":[0.000022577788,0.00013875662,0.0012004577,0.00015338186,0.00006110717,0.00048241866,0.00016246273,0.74378324,0.004883185,0.24623023,0.0028151646,0.000067016525],"about_ca_topic_score_codex":0.0021540043,"about_ca_topic_score_gemma":0.0014939616,"teacher_disagreement_score":0.006627927,"about_ca_system_score_codex":0.0054857587,"about_ca_system_score_gemma":0.0020025554,"threshold_uncertainty_score":0.039802134},"labels":[],"label_agreement":null},{"id":"W4390357257","doi":"10.1109/tcomm.2023.3347768","title":"IRS-Assisted Covert Communication With Equal and Unequal Transmit Prior Probabilities","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Covert; Transmitter power output; Transmission (telecommunications); Computer science; Signal-to-noise ratio (imaging); Wireless; Throughput; Statistical power; Computer network; Power (physics); Algorithm; Channel (broadcasting); Mathematics; Telecommunications; Transmitter; Statistics","score_opus":0.03447038401678132,"score_gpt":0.25948539314202695,"score_spread":0.22501500912524564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390357257","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.108870424,0.00060666923,0.88133305,0.0003186494,0.00005934485,0.000054763666,0.00007167495,0.00036596798,0.008319492],"genre_scores_gemma":[0.9345778,0.00035386492,0.062855914,0.00007679126,0.0000341095,0.00005694833,0.000057144407,0.000027678328,0.0019597006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910396,0.00018173034,0.000031787888,0.00017970512,0.00033079385,0.00017199089],"domain_scores_gemma":[0.9984642,0.00067287625,0.0003234672,0.00025168355,0.00021923358,0.00006850109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061211514,0.0008577654,0.0006090541,0.0005601248,0.0005164374,0.00069507444,0.00085655507,0.00068010954,0.0010982989],"category_scores_gemma":[0.0028892567,0.00023712286,0.0004351091,0.0007655428,0.0009345417,0.0015908357,0.0014135567,0.0007062376,0.0003294164],"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.0006895941,0.00014086938,0.0030301833,0.0002904525,0.00010965029,0.0006921591,0.00044173584,0.61539817,0.11272495,0.06993237,0.0024014013,0.19414847],"study_design_scores_gemma":[0.0000240622,0.00020400953,0.00057488267,0.000017983451,0.000030039682,0.00038605407,0.000058544545,0.95508546,0.032613136,0.009021282,0.0019486945,0.000035924342],"about_ca_topic_score_codex":0.00072942825,"about_ca_topic_score_gemma":0.0008928006,"teacher_disagreement_score":0.0010982989,"about_ca_system_score_codex":0.00073891005,"about_ca_system_score_gemma":0.00066823664,"threshold_uncertainty_score":0.00536114},"labels":[],"label_agreement":null},{"id":"W4390534264","doi":"10.1109/tmc.2023.3347580","title":"Cooperative Deep Reinforcement Learning Enabled Power Allocation for Packet Duplication URLLC in Multi-Connectivity Vehicular Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"Natural Science Foundation of Jiangsu Province for Distinguished Young Scholars; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Retransmission; Network packet; Computer network; Reinforcement learning; Scheduling (production processes); Telecommunications link; Distributed computing; Artificial intelligence","score_opus":0.015167811872945696,"score_gpt":0.2680953196626805,"score_spread":0.25292750778973483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390534264","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.0975117,0.00021862917,0.8991996,0.0002172549,0.000033581728,0.000036128367,0.000015728934,0.0002835079,0.002483802],"genre_scores_gemma":[0.9893444,0.00003749677,0.00981889,0.00004743509,0.000005878014,0.000022795988,0.000009842515,0.000008315186,0.0007049773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996699,0.000090131434,0.000012806672,0.00007145476,0.00006815452,0.00008762387],"domain_scores_gemma":[0.9994019,0.00029369345,0.00009467074,0.000035392437,0.00011968552,0.00005453942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079645816,0.00050609343,0.0005622003,0.00021065013,0.00027557375,0.0004477098,0.0009388546,0.00058010913,0.0006996165],"category_scores_gemma":[0.0017889377,0.00024164299,0.0002392852,0.00021043375,0.0007165,0.00058319396,0.00084459776,0.0007369129,0.000106135565],"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.00008409601,0.000047313617,0.0006781342,0.000026443646,0.000018715637,0.00007942015,0.00005163376,0.96915126,0.0024385736,0.0030358948,0.00042507966,0.023963416],"study_design_scores_gemma":[0.00000404013,0.000019544294,0.00003348046,9.75802e-7,0.0000023437042,0.0000060371153,0.000003226588,0.99905986,0.00028078008,0.00053671416,0.00005179619,0.0000013036048],"about_ca_topic_score_codex":0.004012606,"about_ca_topic_score_gemma":0.0032766338,"teacher_disagreement_score":0.004012606,"about_ca_system_score_codex":0.000659862,"about_ca_system_score_gemma":0.00088562095,"threshold_uncertainty_score":0.007978499},"labels":[],"label_agreement":null},{"id":"W4390590880","doi":"10.1109/tvt.2023.3348272","title":"UAV-Relayed Finite-Blocklength Covert Communication With Channel Estimation","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Covert; Transmission (telecommunications); Transmitter; Channel (broadcasting); Relay; Transmitter power output; Computer science; Power (physics); Real-time computing; Algorithm; Computer network; Telecommunications; Physics","score_opus":0.007303910244404928,"score_gpt":0.2208678879026273,"score_spread":0.21356397765822235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390590880","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.10290471,0.00079739385,0.89225274,0.00015262348,0.00004605779,0.000046601457,0.00007705883,0.0002530397,0.0034697247],"genre_scores_gemma":[0.95033425,0.00032694772,0.04822112,0.00002948524,0.000018490904,0.000037335274,0.000053320655,0.000009277262,0.00096970034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995797,0.00010855145,0.000017982591,0.00009603992,0.00012572067,0.00007194005],"domain_scores_gemma":[0.9990195,0.0004891492,0.00019891019,0.00012817756,0.00012953175,0.00003466312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032668578,0.000593166,0.00048816556,0.0003288933,0.0003095743,0.00039497003,0.0006639884,0.00047218375,0.00076932076],"category_scores_gemma":[0.0017576087,0.00017029812,0.0002949481,0.00047521287,0.0004919692,0.001001458,0.00070229016,0.00038026535,0.00019838045],"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.00055730116,0.0000695493,0.0016486562,0.0003088073,0.00008061599,0.0007898827,0.00029800512,0.76549715,0.07121004,0.02563734,0.001451728,0.1324509],"study_design_scores_gemma":[0.0000148033205,0.0001900513,0.00033882083,0.0000118124835,0.000016415624,0.0002412024,0.000024476105,0.9841322,0.011269961,0.002891521,0.000852592,0.000016161186],"about_ca_topic_score_codex":0.001375927,"about_ca_topic_score_gemma":0.001685643,"teacher_disagreement_score":0.001375927,"about_ca_system_score_codex":0.00046052094,"about_ca_system_score_gemma":0.0004930278,"threshold_uncertainty_score":0.0033413172},"labels":[],"label_agreement":null},{"id":"W4390961202","doi":"10.48550/arxiv.2401.06859","title":"Joint Power Optimization and AP Selection for Secure Cell-Free Massive MIMO","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Queen's University Belfast; European Commission; Government of the United Kingdom","keywords":"Eavesdropping; Computer science; Joint (building); Telecommunications link; Mathematical optimization; Heuristic; Optimization problem; Selection (genetic algorithm); Power (physics); Power control; MIMO; Channel (broadcasting); Computer network; Algorithm; Mathematics; Engineering; Artificial intelligence","score_opus":0.032143624841453264,"score_gpt":0.1752622287918999,"score_spread":0.14311860395044662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390961202","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.036486283,0.0003004243,0.96028084,0.00019046606,0.000032193697,0.000031044223,0.000027016767,0.00009952102,0.0025521822],"genre_scores_gemma":[0.95089334,0.0002503137,0.04653673,0.000075066906,0.000043834934,0.000041773652,0.000028973207,0.000021190519,0.0021086943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927944,0.0002850485,0.000016702148,0.000115249546,0.00018502242,0.00011862707],"domain_scores_gemma":[0.9992454,0.00044784494,0.00010362521,0.00008302398,0.00007693747,0.000043220156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007466463,0.0010921593,0.0007199452,0.00021730935,0.00032939913,0.0007366967,0.000630114,0.0006497199,0.0010354794],"category_scores_gemma":[0.0017116513,0.00036129387,0.00034260668,0.00042652735,0.0009923124,0.0009362271,0.0010362546,0.00075521885,0.00029966148],"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.0001267047,0.000057482623,0.00065984804,0.00006719681,0.00005313921,0.00018520505,0.00006275276,0.9415232,0.01032367,0.02273705,0.0006187598,0.02358506],"study_design_scores_gemma":[0.0000076616025,0.00004465095,0.00009698933,0.0000023683058,0.00000702664,0.000034931112,0.000011246286,0.9939976,0.0012202061,0.004393469,0.00017955728,0.0000043789305],"about_ca_topic_score_codex":0.0008108025,"about_ca_topic_score_gemma":0.0008982773,"teacher_disagreement_score":0.0010921593,"about_ca_system_score_codex":0.000397325,"about_ca_system_score_gemma":0.00058596313,"threshold_uncertainty_score":0.003948748},"labels":[],"label_agreement":null},{"id":"W4391021929","doi":"10.1109/cdc49753.2023.10383642","title":"Reinforcement Learning for Zero-Delay Coding Over a Noisy Channel with Feedback","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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":"Reinforcement learning; Lossy compression; Computer science; Coding (social sciences); Markov process; Markov chain; Source code; Theoretical computer science; Decoding methods; Markov decision process; Block code; Algorithm; Channel (broadcasting); Mathematics; Artificial intelligence; Machine learning; Telecommunications","score_opus":0.021680261206460005,"score_gpt":0.2540751132417851,"score_spread":0.23239485203532512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391021929","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.049692124,0.0003581016,0.9453226,0.00057939615,0.00005269375,0.000045690053,0.000059955662,0.00015655733,0.003732912],"genre_scores_gemma":[0.96468973,0.00024698945,0.03205681,0.000091079855,0.00002438152,0.000072464856,0.000039165894,0.000021327296,0.0027581223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993969,0.00023371127,0.000025758685,0.00010085942,0.00015153548,0.00009118009],"domain_scores_gemma":[0.9960432,0.00310784,0.0003236543,0.0001227679,0.0002901326,0.00011239416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015595156,0.0004964993,0.0006608617,0.0003286842,0.00041183297,0.0007194,0.00094184116,0.000788607,0.0019242688],"category_scores_gemma":[0.0062184273,0.0002348506,0.000316637,0.00041315108,0.0019120515,0.0011790898,0.0008348321,0.0013240889,0.0001763583],"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.000095898824,0.000029512066,0.00028171102,0.000047735855,0.000009182274,0.000056262736,0.00006732381,0.9299738,0.0010571475,0.060296588,0.00029545987,0.0077894367],"study_design_scores_gemma":[0.000009973348,0.00001621829,0.000032510732,0.000003800373,0.000001768663,0.000005110573,0.0000043100436,0.9871273,0.00017475124,0.012520011,0.00010072149,0.000003488616],"about_ca_topic_score_codex":0.007187858,"about_ca_topic_score_gemma":0.004093956,"teacher_disagreement_score":0.007187858,"about_ca_system_score_codex":0.0017549637,"about_ca_system_score_gemma":0.0015314587,"threshold_uncertainty_score":0.014292002},"labels":[],"label_agreement":null},{"id":"W4391807095","doi":"10.1109/twc.2024.3363186","title":"Covert D2D Communication Underlaying Cellular Network: A System-Level Security Perspective","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; Ericsson (Canada)","funders":"National Natural Science Foundation of China","keywords":"Cellular network; Computer science; Covert; Perspective (graphical); Computer network; Computer security; Artificial intelligence","score_opus":0.032062331873142606,"score_gpt":0.271511761084661,"score_spread":0.2394494292115184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391807095","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.092793465,0.0036336135,0.87719804,0.0018505953,0.00023060864,0.00010217273,0.0001730064,0.00011703162,0.023901474],"genre_scores_gemma":[0.9829459,0.0015529502,0.012745545,0.00012688941,0.000093133924,0.000053827294,0.000035570407,0.00001101778,0.0024351666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992429,0.0002100122,0.000017547769,0.0001427762,0.00019673376,0.00019001866],"domain_scores_gemma":[0.9991635,0.00043616694,0.00014685461,0.00008097415,0.000120663324,0.000051832547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005752802,0.0009005836,0.00068582786,0.00046935887,0.00070160616,0.0017368946,0.0009834451,0.0014242586,0.0019276133],"category_scores_gemma":[0.0016592038,0.0002952458,0.0005557953,0.00042619405,0.0014798914,0.0017242578,0.0016094667,0.001307974,0.0002042413],"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.00006446918,0.000034477504,0.0013521777,0.0001764862,0.00006170765,0.00055610505,0.00013274205,0.8022916,0.0075772796,0.17447755,0.0010330939,0.0122423535],"study_design_scores_gemma":[0.000005309439,0.000066189015,0.00030584657,0.000020697269,0.00001793023,0.00013639448,0.000059086615,0.9729835,0.0009631373,0.024085922,0.0013414645,0.00001459548],"about_ca_topic_score_codex":0.0033333502,"about_ca_topic_score_gemma":0.0023736265,"teacher_disagreement_score":0.0033333502,"about_ca_system_score_codex":0.0015515663,"about_ca_system_score_gemma":0.0011323673,"threshold_uncertainty_score":0.01125747},"labels":[],"label_agreement":null},{"id":"W4391952613","doi":"10.1109/tvt.2024.3367362","title":"Enabling Deep Learning-Based Physical-Layer Secret Key Generation for FDD-OFDM Systems in Multi-Environments","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Engineering and Physical Sciences Research Council; National Natural Science Foundation of China","keywords":"Physical layer; Key (lock); Orthogonal frequency-division multiplexing; Computer science; Electronic engineering; Layer (electronics); Computer network; Telecommunications; Engineering; Materials science; Channel (broadcasting); Wireless; Computer security; Nanotechnology","score_opus":0.026410964962477072,"score_gpt":0.2663892021730431,"score_spread":0.23997823721056605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391952613","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.042540275,0.00030805258,0.9544928,0.00024058105,0.00004882171,0.000028830671,0.000041726897,0.00056196045,0.001736889],"genre_scores_gemma":[0.937693,0.00019974793,0.06049772,0.00014153324,0.00002195938,0.000039314473,0.000066446606,0.000024361212,0.001316035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995958,0.00009590985,0.000020370202,0.00007697802,0.0000994499,0.00011138158],"domain_scores_gemma":[0.9993148,0.00034299082,0.000090262816,0.00010169914,0.00011389502,0.000036307898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007417115,0.0006773353,0.0005671724,0.00029826455,0.00037108443,0.0006946152,0.000875034,0.0006644917,0.00093966635],"category_scores_gemma":[0.0018861747,0.00028544417,0.0003976975,0.00038862863,0.0007507871,0.0023778216,0.0017233463,0.0013917787,0.0002671818],"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.00020440842,0.00014640362,0.0013293318,0.0001159471,0.000056633748,0.00019081036,0.00011925756,0.79711175,0.017181491,0.016037013,0.0017663212,0.16574062],"study_design_scores_gemma":[0.0000047312756,0.000027543269,0.000061807325,0.000003149017,0.0000043020123,0.000023903069,0.000009154103,0.99334717,0.0034215313,0.0028250017,0.00026736912,0.000004351254],"about_ca_topic_score_codex":0.001329246,"about_ca_topic_score_gemma":0.0019579104,"teacher_disagreement_score":0.001329246,"about_ca_system_score_codex":0.000790038,"about_ca_system_score_gemma":0.00080871914,"threshold_uncertainty_score":0.0057321787},"labels":[],"label_agreement":null},{"id":"W4391992316","doi":"10.1109/jproc.2024.3364256","title":"Physical Layer Covert Communication in B5G Wireless Networks—its Research, Applications, and Challenges","year":2024,"lang":"en","type":"article","venue":"Proceedings of the IEEE","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":45,"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":"Ministry of Science and Technology, Taiwan; National Natural Science Foundation of China","keywords":"Physical layer; Covert; Computer network; Layer (electronics); Wireless; Computer science; Wireless network; Network layer; Telecommunications; Nanotechnology; Linguistics; Materials science; Philosophy","score_opus":0.05756803683498696,"score_gpt":0.3109112964948197,"score_spread":0.25334325965983273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391992316","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04663806,0.23742077,0.62027276,0.022714967,0.002115522,0.00016490988,0.00017561682,0.00021980173,0.07027756],"genre_scores_gemma":[0.6287067,0.25760335,0.0973402,0.0024179856,0.0032626214,0.00021509895,0.0001758658,0.00006768686,0.010210504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998976,0.0003239078,0.00003747696,0.00012505478,0.0004413903,0.00009616828],"domain_scores_gemma":[0.99786735,0.0013432918,0.00023618084,0.00023700326,0.00025924033,0.000057010577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015804238,0.00073257874,0.00071023125,0.0013865953,0.0010531798,0.0027481224,0.00093420385,0.0022155272,0.0012657039],"category_scores_gemma":[0.0029877594,0.00043543524,0.0004802219,0.0020321684,0.0029655176,0.005037691,0.0015079726,0.0026407146,0.0004315544],"study_design_candidate":"not_applicable","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.000058922134,0.000071399896,0.0016951103,0.0008934342,0.000043790304,0.000569605,0.00043280196,0.03627386,0.005631472,0.77600163,0.008447652,0.16988032],"study_design_scores_gemma":[0.000013331859,0.0002593521,0.0015544528,0.00092523266,0.00004339432,0.0019304305,0.00073343236,0.2796058,0.007221511,0.59419227,0.11340614,0.000114715316],"about_ca_topic_score_codex":0.00095318205,"about_ca_topic_score_gemma":0.0007752059,"teacher_disagreement_score":0.0027481224,"about_ca_system_score_codex":0.0015458718,"about_ca_system_score_gemma":0.00081316865,"threshold_uncertainty_score":0.011216164},"labels":[],"label_agreement":null},{"id":"W4392152655","doi":"10.1109/globecom54140.2023.10437531","title":"Covert Communication via IRS with Unequal Transmit Prior Probabilities","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"Western University","funders":"","keywords":"Computer science; Covert; Computer network; Computer security; Telecommunications","score_opus":0.010869740067377696,"score_gpt":0.21326371134761712,"score_spread":0.20239397128023942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392152655","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.1781816,0.00041943337,0.8124128,0.0003162446,0.000041411593,0.00005279738,0.00006732376,0.00038525194,0.0081232395],"genre_scores_gemma":[0.95963764,0.00021021524,0.03855706,0.00005955911,0.00002080389,0.00003677451,0.00004510707,0.000021264685,0.0014115716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903333,0.00020086094,0.0000352179,0.00017732341,0.00038920273,0.0001639989],"domain_scores_gemma":[0.99852955,0.0006576372,0.00031922388,0.0002694312,0.00016832733,0.000055759687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006168116,0.00070109725,0.00061908824,0.00047211398,0.0004999164,0.00064591883,0.000775412,0.0005987832,0.00093593274],"category_scores_gemma":[0.0024527377,0.00025608233,0.00044171207,0.0006652064,0.0010454193,0.0014493723,0.0014258288,0.0006450582,0.0002753723],"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.0007006318,0.00012884095,0.004694223,0.00025257803,0.000118561606,0.0010259326,0.00046441547,0.5782968,0.17960085,0.07687813,0.0017389923,0.15610005],"study_design_scores_gemma":[0.000019284733,0.00017909633,0.00073996687,0.000012898993,0.00002552231,0.00040339242,0.000048374666,0.9498511,0.03760591,0.009600434,0.0014797489,0.000034295055],"about_ca_topic_score_codex":0.00052157784,"about_ca_topic_score_gemma":0.0005591463,"teacher_disagreement_score":0.00093593274,"about_ca_system_score_codex":0.00063592085,"about_ca_system_score_gemma":0.0005120355,"threshold_uncertainty_score":0.004613936},"labels":[],"label_agreement":null},{"id":"W4392158201","doi":"10.1109/globecom54140.2023.10437887","title":"Secure Terahertz Indoor Communications Using Blockage Feature-Based Artificial Noise in 6G","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security 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":"University of Windsor","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Terahertz radiation; Computer science; Feature (linguistics); Noise (video); Telecommunications; Artificial intelligence; Optoelectronics; Materials science","score_opus":0.047306411125461086,"score_gpt":0.29808898299214315,"score_spread":0.25078257186668207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392158201","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.1356354,0.0013721116,0.85583544,0.00027160312,0.00007918549,0.000046886555,0.000059848895,0.0003088045,0.0063907136],"genre_scores_gemma":[0.9757494,0.00064197025,0.022022761,0.00005449539,0.000027920669,0.00003009246,0.00002660558,0.000009975742,0.0014368363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951303,0.0001402355,0.000020113772,0.00006830753,0.00018413227,0.000074223455],"domain_scores_gemma":[0.9995105,0.00019045424,0.00011974762,0.00008231523,0.0000744556,0.000022543407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038645742,0.00057555665,0.00054146245,0.00032931715,0.00051530695,0.00061624136,0.0004936212,0.0005626037,0.000789152],"category_scores_gemma":[0.000996115,0.00019615983,0.00040445448,0.00045672603,0.0007600855,0.0010658025,0.0008956519,0.00048663796,0.00026661053],"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.00089511595,0.00009192291,0.0037982555,0.00036210023,0.00014877737,0.000930444,0.00040110401,0.51976544,0.2563738,0.11322964,0.0014353187,0.10256812],"study_design_scores_gemma":[0.000019740568,0.00031468523,0.00075592514,0.00002891634,0.000051012466,0.0005665355,0.000050295595,0.9427981,0.044433802,0.007700791,0.0032332412,0.00004698906],"about_ca_topic_score_codex":0.0005615395,"about_ca_topic_score_gemma":0.0006430231,"teacher_disagreement_score":0.000789152,"about_ca_system_score_codex":0.00044049456,"about_ca_system_score_gemma":0.00028335716,"threshold_uncertainty_score":0.003196001},"labels":[],"label_agreement":null},{"id":"W4392158327","doi":"10.1109/globecom54140.2023.10437020","title":"Robust Deep Joint Source Channel Coding with Time-Varying Noise","year":2023,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Toronto Metropolitan University","funders":"National Key Research and Development Program of China","keywords":"Computer science; Joint (building); Coding (social sciences); Channel code; Noise (video); Decoding methods; Speech recognition; Telecommunications; Artificial intelligence; Engineering; Mathematics; Statistics","score_opus":0.032405098066856736,"score_gpt":0.21795367682786246,"score_spread":0.18554857876100572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392158327","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.008596511,0.00023238531,0.98931855,0.00015449965,0.00006710387,0.000021540276,0.00005244048,0.0005409886,0.0010159368],"genre_scores_gemma":[0.705816,0.0007968326,0.2851752,0.00043677897,0.00017110865,0.00016163466,0.00052723475,0.00016998786,0.006745114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988564,0.00026627196,0.000054273114,0.00020827126,0.00044234938,0.00017243355],"domain_scores_gemma":[0.99807215,0.00083335745,0.0001928568,0.000312418,0.0005151408,0.000074022086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015250369,0.0014248556,0.0010904804,0.00058080896,0.00054733607,0.00085229654,0.001476935,0.0011053403,0.0013353252],"category_scores_gemma":[0.0044281404,0.00041804442,0.0006232802,0.0010061676,0.0010347018,0.002107388,0.0021184627,0.0023090017,0.0005095019],"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.00040748203,0.000113744514,0.0007751744,0.00015154535,0.00009753656,0.0002687246,0.00015704094,0.6630966,0.021582345,0.034017142,0.004844325,0.27448824],"study_design_scores_gemma":[0.0000070984715,0.00002628917,0.000051104318,0.0000069908792,0.000009879352,0.000042705808,0.0000066198227,0.99135333,0.0042523076,0.0037413384,0.0004903428,0.0000120932655],"about_ca_topic_score_codex":0.005173152,"about_ca_topic_score_gemma":0.005656096,"teacher_disagreement_score":0.005173152,"about_ca_system_score_codex":0.0007576506,"about_ca_system_score_gemma":0.0019871888,"threshold_uncertainty_score":0.010286093},"labels":[],"label_agreement":null},{"id":"W4392158351","doi":"10.1109/globecom54140.2023.10436880","title":"Covert Communication Based on Non-Ideal Detection of Overt Channels","year":2023,"lang":"en","type":"article","venue":"","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":"University of Windsor","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China","keywords":"Computer science; Covert; Ideal (ethics); Covert channel; Computer network; Computer security","score_opus":0.013739698827109032,"score_gpt":0.24448763792740047,"score_spread":0.23074793910029143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392158351","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.15852575,0.0009564128,0.8283994,0.00039993745,0.00010212921,0.00006605141,0.00005244532,0.0001613759,0.01133642],"genre_scores_gemma":[0.9859372,0.00035081338,0.012323978,0.000072979485,0.000026954864,0.000023367147,0.00001420767,0.000012905154,0.0012377412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986305,0.00032480832,0.000040842577,0.00027175166,0.00044041345,0.00029160315],"domain_scores_gemma":[0.9978331,0.0011572806,0.00040778102,0.00020342127,0.00032376684,0.00007462063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007815902,0.0009192725,0.0006637369,0.00049970124,0.00065269053,0.0010163477,0.00084671413,0.000870893,0.00088762725],"category_scores_gemma":[0.002769992,0.00028598733,0.0005165233,0.00043012144,0.0019432238,0.0020038062,0.0009912825,0.0006165692,0.00019680166],"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.0006164748,0.00014901329,0.003862294,0.00037634568,0.00011994217,0.0014546628,0.0005483343,0.7143324,0.09405093,0.13321614,0.0015303263,0.04974318],"study_design_scores_gemma":[0.000012376567,0.00015899353,0.0004035335,0.000014146026,0.000023317383,0.0003387501,0.00007105614,0.9773661,0.009550755,0.011336119,0.00069977104,0.00002498767],"about_ca_topic_score_codex":0.0012072047,"about_ca_topic_score_gemma":0.00087150524,"teacher_disagreement_score":0.0012072047,"about_ca_system_score_codex":0.0008595761,"about_ca_system_score_gemma":0.0005797526,"threshold_uncertainty_score":0.0062366724},"labels":[],"label_agreement":null},{"id":"W4392399515","doi":"10.5220/0012454400003648","title":"Towards Generalized Diffie-Hellman-esque Key Agreement via Generic Split KEM Construction","year":2024,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Toronto Metropolitan University","funders":"","keywords":"Key (lock); Computer science; Computer security","score_opus":0.015588381184232848,"score_gpt":0.24267377318062222,"score_spread":0.22708539199638939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392399515","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.024068967,0.00035023864,0.9639913,0.0006410282,0.00020891806,0.00016377005,0.00015261742,0.00048107526,0.009942168],"genre_scores_gemma":[0.59670746,0.00056396256,0.39017323,0.00065469986,0.0002061323,0.00036096806,0.0005533909,0.0002757513,0.010504374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99485105,0.0016085205,0.00032876027,0.0008353785,0.0015753306,0.0008010255],"domain_scores_gemma":[0.9949452,0.0014452438,0.0002936866,0.0023313432,0.00064072397,0.00034376068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051008854,0.00093952887,0.0020583076,0.001440442,0.0019152829,0.003357218,0.0032309378,0.0024730358,0.005576619],"category_scores_gemma":[0.0067698536,0.0007517973,0.0016015848,0.0021825596,0.0037525017,0.009843836,0.015551523,0.0051869736,0.0028048614],"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.00027405357,0.00009739305,0.00024095726,0.00020095614,0.0000626474,0.00024699743,0.0005410008,0.011825822,0.005979299,0.9443658,0.0028529058,0.0333122],"study_design_scores_gemma":[0.00009556182,0.00009143843,0.000112557675,0.00006378977,0.00005433987,0.00028237555,0.00017620042,0.08442682,0.006854813,0.9001482,0.007635852,0.000058159403],"about_ca_topic_score_codex":0.00027828396,"about_ca_topic_score_gemma":0.00035066117,"teacher_disagreement_score":0.005576619,"about_ca_system_score_codex":0.0013413421,"about_ca_system_score_gemma":0.0021705013,"threshold_uncertainty_score":0.026976407},"labels":[],"label_agreement":null},{"id":"W4396624167","doi":"10.3389/frcmn.2024.1370496","title":"Secure authentication in MIMO systems: exploring physical limits","year":2024,"lang":"en","type":"article","venue":"Frontiers in Communications and Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"MIMO; Authentication (law); Computer science; Computer security; Computer network; Channel (broadcasting)","score_opus":0.03289620937097304,"score_gpt":0.25910164873367725,"score_spread":0.2262054393627042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396624167","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.046521213,0.0061715376,0.90544176,0.0018362378,0.00030621214,0.000042737083,0.00005963967,0.00017362698,0.039447013],"genre_scores_gemma":[0.9636715,0.004558999,0.027376603,0.00024127273,0.0003292622,0.00005700363,0.00002834483,0.00002158826,0.0037153657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986577,0.0004760218,0.000048328133,0.0001462652,0.0004851671,0.0001865914],"domain_scores_gemma":[0.9951573,0.0034251357,0.00039090562,0.00042868312,0.00051196583,0.00008599974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014511946,0.00063638616,0.0007017901,0.0006303843,0.0007652434,0.002301738,0.00062842574,0.0012377028,0.0020225027],"category_scores_gemma":[0.006617446,0.00043925527,0.00042403833,0.00059552764,0.0026630727,0.0030542414,0.0019444904,0.0017768281,0.00056552974],"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.000113267844,0.000054348373,0.001066328,0.00027618048,0.000052549556,0.000492771,0.00044519783,0.33325517,0.013409051,0.6156142,0.0017994603,0.03342143],"study_design_scores_gemma":[0.000007235786,0.00006627318,0.00030654683,0.000047853337,0.000012232855,0.0002641154,0.00010584569,0.892079,0.0019313156,0.10315974,0.0019876705,0.000032160104],"about_ca_topic_score_codex":0.0009963822,"about_ca_topic_score_gemma":0.0007206856,"teacher_disagreement_score":0.002301738,"about_ca_system_score_codex":0.0010295612,"about_ca_system_score_gemma":0.0005343668,"threshold_uncertainty_score":0.0076747537},"labels":[],"label_agreement":null},{"id":"W4396983017","doi":"10.1109/ncic61838.2023.00046","title":"Deep Learning Based Adaptive Physical Layer Key Distribution","year":2023,"lang":"en","type":"article","venue":"","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":"University of Waterloo","funders":"","keywords":"Key (lock); Computer science; Layer (electronics); Artificial intelligence; Materials science; Nanotechnology; Computer security","score_opus":0.02106301789163666,"score_gpt":0.2562036776862292,"score_spread":0.23514065979459253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396983017","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.03976444,0.00042630226,0.9560483,0.00025497875,0.00006998814,0.00003718432,0.000050774364,0.0009523813,0.0023956443],"genre_scores_gemma":[0.91991687,0.0002765371,0.074724644,0.00018905298,0.00003758708,0.000057109228,0.00012860831,0.000041776504,0.0046277964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996959,0.000044882647,0.00001671829,0.00006673644,0.0000909095,0.00008484688],"domain_scores_gemma":[0.99957436,0.00015677232,0.0000636853,0.000049111575,0.00013054995,0.000025576324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006169298,0.0005528616,0.00057742954,0.00037657272,0.00024778128,0.00057668623,0.0012196167,0.0005918175,0.0017942274],"category_scores_gemma":[0.0014436514,0.0003041119,0.00033857135,0.00039380227,0.00056653353,0.001504523,0.00096097845,0.001289219,0.0003725416],"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.00023437258,0.00018458642,0.00126413,0.000095898344,0.00005210741,0.000098184864,0.000066572386,0.6997738,0.01829369,0.01224369,0.0029044852,0.26478857],"study_design_scores_gemma":[0.000004311286,0.000014419814,0.00004639408,0.0000017199476,0.0000030622193,0.0000082861325,0.0000026153937,0.9968755,0.0015889518,0.001274138,0.00017856165,0.0000019905956],"about_ca_topic_score_codex":0.0025719285,"about_ca_topic_score_gemma":0.0033730534,"teacher_disagreement_score":0.0025719285,"about_ca_system_score_codex":0.00077509845,"about_ca_system_score_gemma":0.0008426339,"threshold_uncertainty_score":0.0060022473},"labels":[],"label_agreement":null},{"id":"W4399169495","doi":"10.1109/smc-iot62253.2023.00027","title":"Design of Physical Layer secure communication for real wireless propagation environment","year":2023,"lang":"en","type":"article","venue":"","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":"University of Waterloo","funders":"","keywords":"Physical layer; Computer science; Wireless; Key (lock); Radio propagation; Layer (electronics); Transmission (telecommunications); Computer network; Application layer; Distributed computing; Computer security; Telecommunications","score_opus":0.034255799733452684,"score_gpt":0.2682448504970826,"score_spread":0.23398905076362989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399169495","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.011859025,0.00010355104,0.9860832,0.00007701853,0.000023135237,0.000040314222,0.000007555742,0.00018391175,0.0016222982],"genre_scores_gemma":[0.6836402,0.0005964248,0.3124171,0.00008046909,0.000033807315,0.00020562403,0.000044961034,0.00006717612,0.002914334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942386,0.00017613835,0.000028352455,0.00011043553,0.00020838162,0.00005285098],"domain_scores_gemma":[0.9995763,0.00013446559,0.00007292189,0.00007097254,0.00012781053,0.000017552153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048475387,0.0006173904,0.0004135291,0.00029619533,0.0005578216,0.0008223213,0.0007105021,0.0006334782,0.0011929333],"category_scores_gemma":[0.0010892599,0.0002948812,0.0004018513,0.00023667903,0.0005629106,0.0012870241,0.0006301389,0.0005803102,0.00043884784],"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.00020713657,0.00011621625,0.002508815,0.0003885165,0.000106369036,0.00051697524,0.00045671704,0.6520442,0.16891782,0.058984373,0.0015332918,0.11421962],"study_design_scores_gemma":[0.000019119067,0.00011730091,0.0002467759,0.00001532181,0.000026545917,0.0002134452,0.000049242535,0.9742672,0.018631564,0.0036808397,0.002714948,0.000017725199],"about_ca_topic_score_codex":0.00069471716,"about_ca_topic_score_gemma":0.00064893765,"teacher_disagreement_score":0.0011929333,"about_ca_system_score_codex":0.0004866783,"about_ca_system_score_gemma":0.00087424903,"threshold_uncertainty_score":0.0039907694},"labels":[],"label_agreement":null},{"id":"W4399800473","doi":"10.1109/ojcoms.2024.3416808","title":"From 5G to 6G Networks: A Survey on AI-Based Jamming and Interference Detection and Mitigation","year":2024,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":46,"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 Ottawa","funders":"","keywords":"Jamming; Interference (communication); Computer science; Telecommunications; Computer security; Physics; Channel (broadcasting)","score_opus":0.03952200624806048,"score_gpt":0.3152591608913827,"score_spread":0.2757371546433222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399800473","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041153072,0.9360079,0.021819858,0.0015323794,0.0012799854,0.00008788334,0.00018125388,0.00017004312,0.03480539],"genre_scores_gemma":[0.02102988,0.96315277,0.0074974997,0.0012229024,0.0013673899,0.000059506812,0.00029289917,0.000036652975,0.005340565],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951816,0.00009394161,0.000050580933,0.00008782238,0.00019086717,0.000058517046],"domain_scores_gemma":[0.9993119,0.00037576578,0.000058400732,0.000032020806,0.00018700285,0.000034912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005266553,0.0011510542,0.0006594336,0.0027807266,0.0004794012,0.0015175388,0.00096920604,0.0010705016,0.005899502],"category_scores_gemma":[0.001206099,0.00039702893,0.0004399354,0.004084972,0.0004345541,0.002942635,0.00086212094,0.0010787022,0.002396602],"study_design_candidate":"not_applicable","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.00007467955,0.00009127862,0.0012024356,0.00710325,0.00005536877,0.0003262447,0.0002859856,0.0030718832,0.0031723662,0.024357336,0.031115873,0.9291434],"study_design_scores_gemma":[0.000012227343,0.00029188202,0.0015679272,0.0034622024,0.00013337373,0.0016580041,0.0005105383,0.0062136566,0.0021532574,0.012893997,0.97102755,0.000075448486],"about_ca_topic_score_codex":0.0013890271,"about_ca_topic_score_gemma":0.0015754333,"teacher_disagreement_score":0.005899502,"about_ca_system_score_codex":0.00044344497,"about_ca_system_score_gemma":0.000827921,"threshold_uncertainty_score":0.019735754},"labels":[],"label_agreement":null},{"id":"W4400114562","doi":"10.1109/ietc61393.2024.10564473","title":"Secrecy and Resilience in Next-Gen Wi-Fi: Exploring a Multi-User Down-Link Non-Orthogonal Transmission Framework","year":2024,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Link (geometry); Computer science; Secrecy; Resilience (materials science); Transmission (telecommunications); Computer network; Computer security; Telecommunications; Physics","score_opus":0.041110795563430225,"score_gpt":0.2820967139097497,"score_spread":0.2409859183463195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400114562","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.035070024,0.0011666905,0.9421094,0.0012304307,0.00015389801,0.00006336161,0.000066859335,0.00014058164,0.019998783],"genre_scores_gemma":[0.8996994,0.0020839355,0.08985108,0.00029695104,0.00022205782,0.00010507009,0.000050862487,0.00004797302,0.007642675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906474,0.00036649907,0.000030996747,0.00013197679,0.00023795525,0.00016783312],"domain_scores_gemma":[0.99825114,0.00083953486,0.00023441153,0.00029932382,0.00025816495,0.00011746846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014388292,0.00082873786,0.0006273384,0.00089781877,0.0010113149,0.0016067136,0.0012589948,0.0010528067,0.001912472],"category_scores_gemma":[0.0023781802,0.00037980938,0.0007289262,0.00051560445,0.0025405334,0.0026282594,0.0025788906,0.0017663663,0.00037945618],"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.000098829245,0.00006476449,0.0005073846,0.00012748525,0.00003991547,0.0004820663,0.0003310823,0.20244347,0.008548409,0.76540536,0.0014367911,0.020514423],"study_design_scores_gemma":[0.000009504511,0.00010001729,0.00022320844,0.000032872267,0.000023224986,0.0002022323,0.00010056659,0.86619955,0.0021694498,0.1281667,0.0027341698,0.00003851398],"about_ca_topic_score_codex":0.0015588758,"about_ca_topic_score_gemma":0.0010552512,"teacher_disagreement_score":0.001912472,"about_ca_system_score_codex":0.0010914443,"about_ca_system_score_gemma":0.0011676752,"threshold_uncertainty_score":0.007919073},"labels":[],"label_agreement":null},{"id":"W4400488061","doi":"10.1109/tgcn.2024.3425792","title":"Federated Learning-Enabled Jamming Detection for Stochastic Terrestrial and Non-Terrestrial Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Green Communications and Networking","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Jamming; Terrestrial plant; Computer science; Terrestrial ecosystem; Ecology; Biology; Physics; Ecosystem","score_opus":0.022691614786784726,"score_gpt":0.2573253716229446,"score_spread":0.2346337568361599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400488061","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.031890385,0.00009744029,0.9664837,0.000100838246,0.000026374455,0.000018034527,0.00002234029,0.00040198702,0.0009587963],"genre_scores_gemma":[0.8581408,0.00007132157,0.13920605,0.00017745886,0.000039007788,0.000048314854,0.00010689228,0.000048920752,0.002161275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996001,0.00010612978,0.00001827556,0.00009609062,0.00010241912,0.00007712415],"domain_scores_gemma":[0.9987369,0.0006509352,0.0001621473,0.00013028466,0.00025414504,0.00006552311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097256387,0.000654376,0.0006656836,0.00045113987,0.00040320258,0.0006484013,0.0011237817,0.0009334774,0.00086443976],"category_scores_gemma":[0.003337719,0.00026498234,0.0004545626,0.00037327537,0.0006905991,0.0008708037,0.0011999216,0.00092147,0.00019548579],"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.00010592305,0.00005184751,0.0012041803,0.000029511637,0.000034849458,0.00006215735,0.00004416284,0.9160245,0.003452386,0.0030608347,0.0005774999,0.07535218],"study_design_scores_gemma":[0.0000019988258,0.0000129883665,0.0000681492,0.0000015400426,0.0000019983568,0.000010917752,0.0000034837008,0.998579,0.0004891562,0.00074817456,0.00008082196,0.0000018245898],"about_ca_topic_score_codex":0.0036307443,"about_ca_topic_score_gemma":0.004217504,"teacher_disagreement_score":0.0036307443,"about_ca_system_score_codex":0.0005752274,"about_ca_system_score_gemma":0.0009373226,"threshold_uncertainty_score":0.007219255},"labels":[],"label_agreement":null},{"id":"W4401109326","doi":"10.1007/s11277-024-11461-0","title":"The Impact of Diverse Jamming Schemes against LTE-Based Remote Detonation Devices","year":2024,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Jamming; Computer science; Waveform; Detonation; Transmitter; Synchronization (alternating current); Electronic engineering; Real-time computing; Computer network; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.031927857537321976,"score_gpt":0.3193104391427576,"score_spread":0.2873825816054356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401109326","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9486082,0.0013012828,0.037210695,0.00043734582,0.00016190193,0.000038789854,0.000108656015,0.00036559353,0.011767412],"genre_scores_gemma":[0.99852943,0.000077904784,0.00080290297,0.000048270063,0.000010114761,0.0000032501368,0.000021462241,0.0000074042755,0.00049930986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981962,0.00045813175,0.000050320894,0.00015264338,0.0005398739,0.00060285267],"domain_scores_gemma":[0.99325716,0.0040901266,0.00056741753,0.0006473894,0.0011685322,0.00026933942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012005703,0.0009294562,0.0004818157,0.0006857435,0.0010273355,0.0009085893,0.00060840376,0.0012444841,0.0025044386],"category_scores_gemma":[0.0070301355,0.0001913501,0.00036287587,0.0004500051,0.00066202605,0.0010304006,0.0012151535,0.00070761266,0.0004911529],"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.014838432,0.00059473887,0.027599374,0.00072958943,0.00061869517,0.0017284706,0.00067051686,0.39201653,0.3283632,0.010201704,0.0026479615,0.2199908],"study_design_scores_gemma":[0.00026370556,0.008847008,0.06185435,0.00022892354,0.00093780225,0.0035446142,0.0017445167,0.7165887,0.19707419,0.0042520445,0.0044773016,0.00018681574],"about_ca_topic_score_codex":0.0013434144,"about_ca_topic_score_gemma":0.0019474437,"teacher_disagreement_score":0.0025044386,"about_ca_system_score_codex":0.0006805592,"about_ca_system_score_gemma":0.00043676034,"threshold_uncertainty_score":0.008378208},"labels":[],"label_agreement":null},{"id":"W4401211760","doi":"10.1109/tifs.2024.3436885","title":"Integrated Communications and Security: RIS-Assisted Simultaneous Transmission and Generation of Secret Keys","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; Engineering and Physical Sciences Research Council; European Commission; Queen's University; Southeast University; National Natural Science Foundation of China; Queen's University Belfast; National Science Foundation","keywords":"Computer science; Transmission (telecommunications); Computer security; Computer network; Telecommunications","score_opus":0.018774333083553595,"score_gpt":0.2432424407792955,"score_spread":0.2244681076957419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401211760","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.02996511,0.00024263455,0.9623479,0.00024881662,0.00005886788,0.000049107308,0.00002100016,0.00023924398,0.0068273484],"genre_scores_gemma":[0.9160611,0.00019555235,0.080874756,0.00013247099,0.000035488705,0.000077203054,0.000030780266,0.00002094429,0.0025716017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935156,0.000137431,0.000026936605,0.00014404581,0.00021902345,0.000121069104],"domain_scores_gemma":[0.9996049,0.00011190217,0.00009420465,0.00008190615,0.00007716777,0.000029806204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054711464,0.00062450924,0.000429426,0.00029945155,0.0003229207,0.0008139306,0.0010836724,0.000732413,0.00145581],"category_scores_gemma":[0.0009451192,0.00024104082,0.00041837431,0.00036120674,0.00093534176,0.0014302417,0.0012520608,0.00085725635,0.00037903266],"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.0003347546,0.00015595021,0.0016952422,0.00022355282,0.00009233861,0.0004525587,0.00027931287,0.59751093,0.13097875,0.13140436,0.0020826885,0.13478956],"study_design_scores_gemma":[0.000017357637,0.00018000088,0.00014379006,0.00000820447,0.000016854385,0.00012959723,0.000020621728,0.9740242,0.012667521,0.010637471,0.0021396736,0.000014652087],"about_ca_topic_score_codex":0.0006471222,"about_ca_topic_score_gemma":0.0007276242,"teacher_disagreement_score":0.00145581,"about_ca_system_score_codex":0.00064480124,"about_ca_system_score_gemma":0.00082310016,"threshold_uncertainty_score":0.0048701763},"labels":[],"label_agreement":null},{"id":"W4401326099","doi":"10.1109/tccn.2024.3438379","title":"Generative AI for Secure Physical Layer Communications: A Survey","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Cognitive Communications and Networking","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":63,"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":"Computer science; Physical layer; Computer network; Layer (electronics); Telecommunications; Wireless","score_opus":0.08242531335143641,"score_gpt":0.3473854756081475,"score_spread":0.26496016225671104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401326099","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068520056,0.13966475,0.8125952,0.0030053721,0.00044621777,0.00009307185,0.00017283444,0.00055509,0.036615405],"genre_scores_gemma":[0.40393245,0.36172906,0.21153936,0.0019038429,0.0022584274,0.00038675003,0.0006224041,0.0004487615,0.017178943],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940133,0.00021571218,0.000044481752,0.00010480189,0.00019411327,0.000039680705],"domain_scores_gemma":[0.9980478,0.0015885562,0.00005771565,0.00013810108,0.0001292336,0.000038638784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011927526,0.0012031989,0.0010640225,0.0010546362,0.00037006754,0.0019146311,0.0014282186,0.0015724628,0.0032417763],"category_scores_gemma":[0.0027626888,0.0005649819,0.001009008,0.0014374015,0.0013224373,0.0020240566,0.0013946653,0.0022763698,0.0010691248],"study_design_candidate":"not_applicable","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.000059329053,0.0001254367,0.0020664504,0.002508977,0.00023650443,0.0002813849,0.00038716596,0.32108045,0.0025187307,0.2901046,0.0098199155,0.3708111],"study_design_scores_gemma":[0.000015286083,0.00014471558,0.00075012434,0.0006569561,0.00007037226,0.0004800077,0.00016672014,0.72318864,0.0016825104,0.19388644,0.07888643,0.00007181808],"about_ca_topic_score_codex":0.002005409,"about_ca_topic_score_gemma":0.0012704887,"teacher_disagreement_score":0.0032417763,"about_ca_system_score_codex":0.00092478597,"about_ca_system_score_gemma":0.00086852576,"threshold_uncertainty_score":0.010844827},"labels":[],"label_agreement":null},{"id":"W4401806895","doi":"10.1109/lwc.2024.3448614","title":"Covert Communications for Text Semantic With Finite Blocklength","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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":"Natural Science Foundation of Fujian Province; National Natural Science Foundation of China","keywords":"Computer science; Covert; Theoretical computer science; Computer network","score_opus":0.023875735656729406,"score_gpt":0.26744422764846404,"score_spread":0.24356849199173464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401806895","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.06288442,0.0011610958,0.92032415,0.0005538824,0.00010367077,0.00007518804,0.00026093615,0.00038244936,0.014254311],"genre_scores_gemma":[0.8833746,0.0011506957,0.1070274,0.00022108013,0.00013316097,0.0001780873,0.00035778934,0.00009007175,0.007467068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913675,0.0002002618,0.000038327325,0.0001256453,0.00038456114,0.00011445679],"domain_scores_gemma":[0.99736494,0.0016072508,0.00036699587,0.00032127206,0.00029502535,0.00004455925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007699699,0.00090848317,0.00061001093,0.00057333073,0.0007420244,0.00082736183,0.0007865922,0.0009264713,0.003537634],"category_scores_gemma":[0.0040451833,0.00022772413,0.00051077834,0.0009347056,0.0009901564,0.0021566276,0.00084306404,0.0007041583,0.0010504974],"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.0006429948,0.00010971961,0.0013736989,0.0006085628,0.000115050425,0.000979386,0.00036310626,0.5502201,0.06744912,0.2430739,0.0060463278,0.12901801],"study_design_scores_gemma":[0.000018789366,0.00008933124,0.000237275,0.00002131406,0.000020343117,0.00023548218,0.000032905024,0.94217193,0.01452033,0.038527947,0.0040969327,0.000027414682],"about_ca_topic_score_codex":0.0013223592,"about_ca_topic_score_gemma":0.0020402973,"teacher_disagreement_score":0.003537634,"about_ca_system_score_codex":0.0013450731,"about_ca_system_score_gemma":0.00060740486,"threshold_uncertainty_score":0.011834562},"labels":[],"label_agreement":null},{"id":"W4402156735","doi":"10.1109/icc51166.2024.10622458","title":"Federated Learning-based MARL for Strengthening Physical-Layer Security in B5G Networks","year":2024,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Polytechnique Montréal","funders":"","keywords":"Computer science; Layer (electronics); Physical layer; Telecommunications; Materials science; Nanotechnology; Wireless","score_opus":0.013546910258778539,"score_gpt":0.26819213619133725,"score_spread":0.2546452259325587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402156735","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.059155524,0.00039959457,0.9367488,0.00038492162,0.000057230845,0.000051254694,0.000020546848,0.00044796578,0.0027341861],"genre_scores_gemma":[0.9697168,0.00008841099,0.028786443,0.00015171168,0.00001747636,0.000030298557,0.000015450836,0.000018909539,0.0011744811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993519,0.00025990346,0.000022943192,0.000107761975,0.00013671441,0.00012066076],"domain_scores_gemma":[0.9986089,0.0007307963,0.0001824949,0.0001052938,0.00026268917,0.00010980276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017651671,0.00078303047,0.0008307746,0.00031881704,0.00040882124,0.00064082677,0.0010147599,0.00087119796,0.0011700027],"category_scores_gemma":[0.003336501,0.00025446602,0.00029598307,0.00021324022,0.0010616675,0.0011357042,0.0013798415,0.0011602439,0.00020523436],"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.00015488033,0.00008820121,0.00087115203,0.00004683826,0.000034484397,0.00009833064,0.000056139586,0.94868076,0.0028456128,0.006057198,0.0006563627,0.040409938],"study_design_scores_gemma":[0.0000074042973,0.000041161067,0.00005551767,0.0000029163064,0.000003999125,0.000011349699,0.000004734748,0.9978822,0.00038178577,0.0014736732,0.00013259852,0.000002626843],"about_ca_topic_score_codex":0.002639138,"about_ca_topic_score_gemma":0.0030717186,"teacher_disagreement_score":0.002639138,"about_ca_system_score_codex":0.00075464725,"about_ca_system_score_gemma":0.0010855477,"threshold_uncertainty_score":0.00933516},"labels":[],"label_agreement":null},{"id":"W4402474941","doi":"10.1109/ccece59415.2024.10667215","title":"Impact of Hardware Impairments on Physical Layer Security of Cell-Free Massive MIMO","year":2024,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Physical layer; MIMO; Computer science; Layer (electronics); Computer hardware; Hardware security module; Embedded system; Computer network; Computer security; Telecommunications; Cryptography; Wireless; Materials science; Channel (broadcasting); Nanotechnology","score_opus":0.012187139695525404,"score_gpt":0.2868142290280378,"score_spread":0.2746270893325124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402474941","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54063725,0.0011008825,0.44010067,0.0003787734,0.00007974782,0.00003731152,0.000095584284,0.00021731897,0.017352538],"genre_scores_gemma":[0.99395144,0.0003808962,0.0051447083,0.000036941234,0.000017808263,0.000005815494,0.000012351397,0.0000068291283,0.00044325655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994247,0.0001506117,0.000019169725,0.00007013813,0.00022079427,0.00011466722],"domain_scores_gemma":[0.997615,0.0015088371,0.00034814846,0.00023224676,0.0002255433,0.0000702755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007070414,0.0008348775,0.00035830357,0.00025588882,0.00029731746,0.0006795831,0.00031621795,0.00052100694,0.00073496636],"category_scores_gemma":[0.0035900667,0.00023533005,0.00023715135,0.00028591265,0.001449039,0.0007808804,0.0007980703,0.0006307419,0.00019861969],"study_design_candidate":"not_applicable","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.00039008577,0.00008611237,0.0119100725,0.00038765295,0.00014544086,0.0015288265,0.0005020538,0.69858146,0.17497122,0.06642799,0.00053107017,0.044538014],"study_design_scores_gemma":[0.000017168706,0.0006585676,0.010649177,0.00013183145,0.00013291155,0.0013240215,0.00029160493,0.90498245,0.063261636,0.016818004,0.0016758045,0.000056833996],"about_ca_topic_score_codex":0.0005709512,"about_ca_topic_score_gemma":0.0007283731,"teacher_disagreement_score":0.0008348775,"about_ca_system_score_codex":0.00043228274,"about_ca_system_score_gemma":0.0004920618,"threshold_uncertainty_score":0.0037392378},"labels":[],"label_agreement":null},{"id":"W4402626708","doi":"10.1109/twc.2024.3459628","title":"Secure Transmission in Cell-Free Massive MIMO Under Active Eavesdropping","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; European Commission; Queen's University; Queen's University Belfast; Department for the Economy; Government of the United Kingdom","keywords":"Eavesdropping; Computer science; MIMO; Transmission (telecommunications); Computer network; Wireless; Computer security; Telecommunications; Channel (broadcasting)","score_opus":0.02065979265706951,"score_gpt":0.2666127867306031,"score_spread":0.2459529940735336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402626708","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.24850568,0.00064048613,0.7438026,0.00033536693,0.00008823502,0.00004484349,0.0000921903,0.00016511361,0.0063254563],"genre_scores_gemma":[0.98682934,0.0003297663,0.011725068,0.000052713818,0.00003190587,0.000020407491,0.000023100603,0.000008394937,0.0009793241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994085,0.0002077829,0.000013731784,0.000076276156,0.00017233135,0.00012154408],"domain_scores_gemma":[0.99843174,0.0009640424,0.00024729263,0.00014740445,0.00015156061,0.000057904213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063215254,0.00084632053,0.00060635305,0.00024688873,0.0004544513,0.0007952027,0.0005508757,0.0008303323,0.0005732275],"category_scores_gemma":[0.0023351847,0.00025495538,0.00041135508,0.00047019313,0.0012305335,0.0008529262,0.0010946686,0.00057766435,0.0002251723],"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.00014392033,0.00004233789,0.001274624,0.000096303025,0.000065954584,0.00085038407,0.00014860147,0.9337582,0.020853087,0.03165274,0.00047783178,0.0106360335],"study_design_scores_gemma":[0.000007941962,0.00006292789,0.00021852483,0.000004046339,0.0000128552665,0.00008632359,0.000029175431,0.9931116,0.0023839392,0.0038890287,0.00018519397,0.000008431687],"about_ca_topic_score_codex":0.0013691853,"about_ca_topic_score_gemma":0.001090816,"teacher_disagreement_score":0.0013691853,"about_ca_system_score_codex":0.00046328185,"about_ca_system_score_gemma":0.00039346117,"threshold_uncertainty_score":0.0033613443},"labels":[],"label_agreement":null},{"id":"W4403752250","doi":"10.1002/9781394170944.ch11","title":"Physical‐Layer Authentication for 6G Systems","year":2024,"lang":"en","type":"other","venue":"","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":"Western University","funders":"","keywords":"Layer (electronics); Computer science; Authentication (law); Computer security; Materials science; Nanotechnology","score_opus":0.020915925412664155,"score_gpt":0.28615107338322054,"score_spread":0.26523514797055636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403752250","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.026006136,0.0035328171,0.94478124,0.0013031124,0.00044262822,0.00013516068,0.00006954716,0.001864224,0.021865059],"genre_scores_gemma":[0.8878165,0.002506875,0.09421845,0.00039175132,0.00023841068,0.00009558529,0.0001060967,0.000057351746,0.0145689305],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927205,0.00021861892,0.00004750537,0.000101079546,0.0002693735,0.00009138353],"domain_scores_gemma":[0.99922776,0.00018337008,0.00010242511,0.000267488,0.00019332237,0.000025600859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006626649,0.00083278463,0.0003502295,0.00054129737,0.00075140514,0.0013261125,0.0005919972,0.00084137986,0.005895175],"category_scores_gemma":[0.0019123809,0.00018441967,0.0002814093,0.0004665173,0.0006793497,0.0021889429,0.0012618419,0.0009314203,0.001855785],"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.0005707857,0.00015822673,0.0022194604,0.0005256168,0.0000714846,0.00053735584,0.00035376678,0.1066354,0.07834746,0.23809694,0.020641442,0.55184215],"study_design_scores_gemma":[0.000025876663,0.00028172033,0.00085174205,0.00010753951,0.00004496675,0.000786876,0.00010347931,0.84937817,0.030138105,0.055607267,0.06262566,0.000048578844],"about_ca_topic_score_codex":0.0007120808,"about_ca_topic_score_gemma":0.00071825046,"teacher_disagreement_score":0.005895175,"about_ca_system_score_codex":0.0005950006,"about_ca_system_score_gemma":0.0005315882,"threshold_uncertainty_score":0.01972133},"labels":[],"label_agreement":null},{"id":"W4404171063","doi":"10.1016/j.dcan.2024.10.019","title":"Joint jammer selection and power optimization in covert communications against a warden with uncertain locations","year":2024,"lang":"en","type":"article","venue":"Digital Communications and Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Jiangsu Provincial Key Research and Development Program; Canadian Anesthesiologists' Society","keywords":"Computer science; Joint (building); Selection (genetic algorithm); Power (physics); Covert; Telecommunications; Computer network; Operations research; Artificial intelligence","score_opus":0.015768489223992054,"score_gpt":0.23558375610054136,"score_spread":0.21981526687654931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404171063","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.09051698,0.0004377788,0.9046916,0.00024348334,0.000029711462,0.000043144257,0.000030664665,0.0001935896,0.0038131399],"genre_scores_gemma":[0.9196153,0.00035210518,0.07755961,0.00009438278,0.000034993045,0.00007291007,0.000056628294,0.00003482914,0.0021791717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907625,0.00024751716,0.000028929562,0.00018140288,0.00024896814,0.00021697918],"domain_scores_gemma":[0.9984016,0.00095691136,0.00030142814,0.000105439925,0.0001537175,0.000080877064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088120805,0.0010048111,0.0011606285,0.0007942663,0.0007852891,0.0009906782,0.0009295377,0.0010100015,0.00068989844],"category_scores_gemma":[0.0030651095,0.0006252603,0.00065749197,0.000979885,0.0014309094,0.0013221785,0.0013011483,0.0007250938,0.00020140357],"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.00013458752,0.000031601077,0.0006344584,0.000068822104,0.00005177797,0.00037746574,0.00014117648,0.9607518,0.007034763,0.009903864,0.00047510583,0.020394713],"study_design_scores_gemma":[0.000008859843,0.000057744128,0.00020853322,0.000005347285,0.000011986577,0.000087008535,0.000036669975,0.99398357,0.0017392051,0.0036276593,0.00022396514,0.000009472321],"about_ca_topic_score_codex":0.002138071,"about_ca_topic_score_gemma":0.0018805338,"teacher_disagreement_score":0.002138071,"about_ca_system_score_codex":0.0008302574,"about_ca_system_score_gemma":0.00091332704,"threshold_uncertainty_score":0.006024003},"labels":[],"label_agreement":null},{"id":"W4406785297","doi":"10.1109/icc52391.2025.11160896","title":"Joint Task Offloading and User Scheduling in 5G MEC Under Jamming Attacks","year":2025,"lang":"en","type":"preprint","venue":"","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":"University of Ottawa","funders":"","keywords":"Jamming; Computer science; Scheduling (production processes); Joint (building); Task (project management); Computer network; Computer security; Engineering; Operations management","score_opus":0.026927490638776565,"score_gpt":0.2749852131881776,"score_spread":0.24805772254940103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406785297","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.09141864,0.0007037319,0.90333277,0.00026737206,0.00011600381,0.000092316484,0.00004231146,0.00043475901,0.0035920525],"genre_scores_gemma":[0.9360609,0.00019182172,0.061988477,0.00009252576,0.00005247005,0.00004499834,0.000035682886,0.00004622449,0.0014868748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992787,0.00017753281,0.000029719175,0.00012507777,0.00015437165,0.00023458211],"domain_scores_gemma":[0.99944526,0.0001939192,0.000084374034,0.00009319646,0.00009732605,0.00008593295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007096454,0.00088115945,0.0009116091,0.00035417068,0.00062652223,0.0007553264,0.0009934419,0.0006916687,0.0010335477],"category_scores_gemma":[0.0013666325,0.00023549907,0.0004347293,0.00045616567,0.00052004267,0.0009350544,0.00084143924,0.0006604931,0.00014817576],"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.00028612008,0.00011144667,0.0010069131,0.00010069328,0.000051636638,0.00017291745,0.0001023667,0.90952426,0.011599989,0.007694417,0.0012775201,0.068071745],"study_design_scores_gemma":[0.000010087739,0.00007443978,0.00025314168,0.000004185387,0.000012411363,0.000048319667,0.000030867188,0.99531305,0.0014613898,0.0020837318,0.00070193625,0.000006371256],"about_ca_topic_score_codex":0.00417877,"about_ca_topic_score_gemma":0.005453566,"teacher_disagreement_score":0.00417877,"about_ca_system_score_codex":0.0006441403,"about_ca_system_score_gemma":0.0013870979,"threshold_uncertainty_score":0.0083088875},"labels":[],"label_agreement":null},{"id":"W4408353286","doi":"10.1109/icassp49660.2025.10887653","title":"Movable Antenna Aided Physical Layer Security with No Eavesdropper CSI","year":2025,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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 Alberta","funders":"","keywords":"Physical layer; Computer science; Computer security; Computer network; Telecommunications; Wireless","score_opus":0.006168301400538597,"score_gpt":0.23652130372582958,"score_spread":0.230353002325291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408353286","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.0059073307,0.0002362229,0.99131197,0.00009900268,0.000039524803,0.00001791281,0.000027316246,0.0001671567,0.0021935024],"genre_scores_gemma":[0.8292821,0.00062654197,0.16438131,0.0001594147,0.000086287124,0.00009753472,0.00006663964,0.000038250004,0.005261963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941707,0.00018468524,0.000026244348,0.00009243121,0.0001850433,0.00009454667],"domain_scores_gemma":[0.999356,0.00025303397,0.00011404525,0.00014625696,0.000097231445,0.000033535252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005529133,0.001415471,0.0008959224,0.0003670557,0.00036296598,0.0009278803,0.0012964408,0.0009811303,0.0021979986],"category_scores_gemma":[0.0012968829,0.00035463713,0.0005792356,0.00056608143,0.0009743706,0.001396048,0.0015322887,0.0012083281,0.0008254388],"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.00033169938,0.000066861365,0.00066958775,0.00027417656,0.00015583466,0.0005647503,0.0001704942,0.70457166,0.079306684,0.10974109,0.002829755,0.10131743],"study_design_scores_gemma":[0.000014558378,0.000160418,0.0001142546,0.0000131623865,0.000026647747,0.0002484342,0.000022079206,0.98145217,0.008734732,0.0072739366,0.0019178466,0.000021733478],"about_ca_topic_score_codex":0.0005130581,"about_ca_topic_score_gemma":0.00068196066,"teacher_disagreement_score":0.0021979986,"about_ca_system_score_codex":0.0004149531,"about_ca_system_score_gemma":0.00067694485,"threshold_uncertainty_score":0.0073530674},"labels":[],"label_agreement":null},{"id":"W4408928998","doi":"10.1007/978-3-031-82014-4_13","title":"Converse Techniques for Identification via Channels","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"","keywords":"Converse; Computer science; Identification (biology); Algorithm; Theoretical computer science; Mathematics; Geometry","score_opus":0.014311821520713896,"score_gpt":0.25669563407910306,"score_spread":0.24238381255838917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408928998","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.004584516,0.0025082447,0.85736215,0.0013307219,0.0010514627,0.000062999556,0.00016057887,0.00033702858,0.1326023],"genre_scores_gemma":[0.36456388,0.011397013,0.39391106,0.002949641,0.002776346,0.00064864475,0.0006639687,0.0006846939,0.22240469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987563,0.0004688897,0.00005133787,0.00020979183,0.00038182279,0.00013190773],"domain_scores_gemma":[0.99853194,0.00091620634,0.000051972576,0.000290452,0.00016795668,0.000041464296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013134349,0.0015524449,0.001052567,0.0014937139,0.0017622237,0.002468637,0.0012884875,0.0018399969,0.011750768],"category_scores_gemma":[0.0033567667,0.0007811487,0.0015990456,0.0012795768,0.002834025,0.0047127632,0.00440331,0.0054194024,0.005034181],"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.000041252795,0.000027859105,0.00004376537,0.000114313094,0.000014396656,0.000117680895,0.00025017708,0.0018652907,0.0026862659,0.960951,0.007975882,0.025912168],"study_design_scores_gemma":[0.000011134708,0.00003880184,0.000099322584,0.00007372164,0.00003443165,0.00047000928,0.000113177535,0.017680198,0.004596685,0.94529307,0.031551253,0.000038208218],"about_ca_topic_score_codex":0.0003431493,"about_ca_topic_score_gemma":0.0003213051,"teacher_disagreement_score":0.011750768,"about_ca_system_score_codex":0.0008130183,"about_ca_system_score_gemma":0.0006889799,"threshold_uncertainty_score":0.039310217},"labels":[],"label_agreement":null},{"id":"W4410811445","doi":"10.1007/978-3-031-85008-0_2","title":"Cyber Security Technologies for Privacy in 6G Networks","year":2025,"lang":"en","type":"book-chapter","venue":"Advanced sciences and technologies for security applications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer security; Internet privacy; Computer science; Business","score_opus":0.014331099574644755,"score_gpt":0.27475947395298317,"score_spread":0.26042837437833843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410811445","genre_codex":"other","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.005381327,0.09003728,0.21136802,0.009035279,0.004014125,0.00007115657,0.0001256383,0.0004336086,0.6795335],"genre_scores_gemma":[0.12522556,0.13622147,0.08658377,0.0044299727,0.0047218916,0.00013297366,0.0002281567,0.00025256356,0.6422036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997657,0.000053016694,0.0000082494025,0.000028385855,0.0001225366,0.000022211681],"domain_scores_gemma":[0.9997861,0.00012202143,0.00001314702,0.000036319965,0.000031569565,0.00001092056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027138222,0.0007021102,0.0003043236,0.0005395087,0.00050931016,0.0022432234,0.0005018646,0.0013311324,0.01544751],"category_scores_gemma":[0.0004650377,0.00023366683,0.00035314154,0.00061272713,0.0010388077,0.0035230587,0.00089616666,0.0021644672,0.0036684964],"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.0000133361855,0.000021316735,0.00006586016,0.00023006623,0.0000095345795,0.00008753858,0.00017584748,0.0027350318,0.0032549538,0.8210537,0.02973727,0.14261553],"study_design_scores_gemma":[0.0000032028106,0.000040273346,0.00020969361,0.00032876918,0.0000126852665,0.0005266948,0.000116397285,0.0067510195,0.003126693,0.31808946,0.67078006,0.0000150655915],"about_ca_topic_score_codex":0.00030723415,"about_ca_topic_score_gemma":0.00054106367,"teacher_disagreement_score":0.01544751,"about_ca_system_score_codex":0.0007593073,"about_ca_system_score_gemma":0.00038892124,"threshold_uncertainty_score":0.05167705},"labels":[],"label_agreement":null},{"id":"W4413180438","doi":"10.1109/gcwkshp64532.2024.11100742","title":"Signal Detection in Non-Gaussian Barrage-Jammed Multiple Antenna Systems Via Decision Fusion","year":2024,"lang":"en","type":"article","venue":"","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":"Carleton University","funders":"","keywords":"Computer science; Detection theory; Antenna (radio); Fusion; Gaussian; SIGNAL (programming language); Sensor fusion; Electronic engineering; Telecommunications; Artificial intelligence; Engineering; Physics; Detector","score_opus":0.008483046881632905,"score_gpt":0.23108614842617506,"score_spread":0.22260310154454216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413180438","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.06136545,0.00065079395,0.9351584,0.0002463917,0.000038105503,0.000028841112,0.000029584931,0.000096388125,0.0023862047],"genre_scores_gemma":[0.9523666,0.00030411937,0.04645451,0.00008298191,0.000027871456,0.00002700418,0.000026680944,0.0000079038955,0.00070241146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977927,0.001049977,0.000089263114,0.00022841484,0.00062184996,0.0002178548],"domain_scores_gemma":[0.9976386,0.0016353593,0.00029105414,0.00012005595,0.0002560517,0.000058993235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026372331,0.0007297609,0.0009888461,0.00053708383,0.00048545512,0.001083112,0.00079211366,0.00087519584,0.00058748137],"category_scores_gemma":[0.0053308727,0.00034887472,0.00052876736,0.0008738783,0.0012646826,0.0015022304,0.0016383507,0.0010451414,0.00019225225],"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.00036895974,0.000045146975,0.0009780576,0.00010897217,0.000090942136,0.00018385715,0.00023258128,0.9043793,0.007088575,0.044578627,0.0004669625,0.04147798],"study_design_scores_gemma":[0.000010506745,0.000061661,0.00012201499,0.00000840522,0.000009022034,0.00003612033,0.000018919445,0.9878769,0.0017173036,0.009949954,0.00017723962,0.00001197167],"about_ca_topic_score_codex":0.0010773322,"about_ca_topic_score_gemma":0.00094679784,"teacher_disagreement_score":0.0026372331,"about_ca_system_score_codex":0.0007270998,"about_ca_system_score_gemma":0.0007223382,"threshold_uncertainty_score":0.013947189},"labels":[],"label_agreement":null},{"id":"W4413755039","doi":"10.1109/tit.2025.3603494","title":"Multivariate Analytic Combinatorics for Cost Constrained Channels","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"H2020 European Research Council; National Science Foundation","keywords":"Multivariate statistics; Mathematics; Combinatorics; Computer science; Discrete mathematics; Statistics","score_opus":0.011770013073238618,"score_gpt":0.2595444928571003,"score_spread":0.2477744797838617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413755039","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.1595494,0.0007893578,0.814272,0.0015455046,0.00007573334,0.00007224224,0.00043651467,0.00020478504,0.02305443],"genre_scores_gemma":[0.9476782,0.0012008455,0.04263419,0.00038346095,0.00027897724,0.00021947036,0.00034994437,0.00016389406,0.007091012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983907,0.00055023347,0.00007975843,0.00024754557,0.000513591,0.00021826243],"domain_scores_gemma":[0.988076,0.008086234,0.0013116744,0.00094997353,0.001021051,0.00055500027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024269337,0.0008863634,0.00095881417,0.00343666,0.00096029026,0.002955776,0.0012330291,0.0008328703,0.0047630775],"category_scores_gemma":[0.016521791,0.00038579464,0.0010314549,0.0021965443,0.0039943187,0.005873722,0.0020917172,0.0026840626,0.00042674472],"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.000008418376,0.000007719812,0.00021526896,0.000018753643,0.0000060174493,0.000042991756,0.000048604295,0.009011107,0.0003689886,0.9879297,0.00034146867,0.002000892],"study_design_scores_gemma":[0.000005280683,0.000007563147,0.00019561351,0.000011174538,0.0000056656645,0.000064950946,0.000035921865,0.07513895,0.00028028974,0.9232986,0.0009427996,0.000013186452],"about_ca_topic_score_codex":0.0009540166,"about_ca_topic_score_gemma":0.00055183686,"teacher_disagreement_score":0.0047630775,"about_ca_system_score_codex":0.0021336854,"about_ca_system_score_gemma":0.00090540166,"threshold_uncertainty_score":0.01593405},"labels":[],"label_agreement":null},{"id":"W4414054218","doi":"10.1109/lwc.2025.3607032","title":"Joint Transmit Probabilities Optimization for AoI-Constrained Covert Communications With Multiple Friendly Jammers","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; Ontario Ministry of Research and Innovation; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; Agence Nationale de la Recherche","keywords":"Covert; Joint (building); Channel (broadcasting); Jamming; Throughput; Noise (video); Selection (genetic algorithm); Artificial noise; Sampling (signal processing)","score_opus":0.02008483865894526,"score_gpt":0.2458992257003919,"score_spread":0.22581438704144666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414054218","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.112916365,0.000305232,0.8829854,0.00026203637,0.000030439178,0.000033318345,0.000032018117,0.000090338595,0.0033448215],"genre_scores_gemma":[0.9704898,0.00017088332,0.027599491,0.000055780507,0.000024189416,0.00004487436,0.000027032458,0.000021174985,0.0015667988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999228,0.0002573566,0.000023061672,0.00012210496,0.00023391501,0.00013550815],"domain_scores_gemma":[0.997891,0.0014513572,0.00031039017,0.00010073377,0.00015560909,0.000091008325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010650352,0.0008722886,0.0008354297,0.00039139463,0.00041612796,0.0007452981,0.00059026526,0.0007652992,0.0006910484],"category_scores_gemma":[0.004046288,0.00042478254,0.00040223377,0.0005318743,0.0011367606,0.0009742731,0.0010713231,0.000586556,0.0001282084],"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.000097260505,0.000023994955,0.0006360938,0.000035392746,0.00003564041,0.00011844626,0.00006954118,0.9740543,0.0041211313,0.010860205,0.00019937956,0.009748692],"study_design_scores_gemma":[0.0000054195702,0.000034788558,0.000114974544,0.000002403842,0.000005980222,0.00002477738,0.000008713012,0.9966792,0.0008051118,0.002194479,0.00012049298,0.000003779218],"about_ca_topic_score_codex":0.0012532789,"about_ca_topic_score_gemma":0.00095327245,"teacher_disagreement_score":0.0012532789,"about_ca_system_score_codex":0.00074645464,"about_ca_system_score_gemma":0.0007473657,"threshold_uncertainty_score":0.00563246},"labels":[],"label_agreement":null},{"id":"W4414229146","doi":"10.1109/twc.2025.3607091","title":"Jamming Detection and Channel Estimation for Spatially Correlated Beamspace Massive MIMO","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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 Alberta","funders":"Fundamental Research Funds for the Central Universities; Graduate Research and Innovation Projects of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Jamming; Channel (broadcasting); Telecommunications link; MIMO; Minimum mean square error; Transmission (telecommunications); Random access; Multivariate random variable","score_opus":0.01553188673237768,"score_gpt":0.26219842313470804,"score_spread":0.24666653640233036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414229146","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.04733522,0.00018866979,0.95147675,0.00010054523,0.000018430163,0.000014545946,0.000022888853,0.00012804457,0.00071493606],"genre_scores_gemma":[0.89431983,0.0002839622,0.10423412,0.00011295754,0.00006998339,0.00003941303,0.000058865084,0.000018814302,0.00086220633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909353,0.00038688065,0.000029816652,0.00011587674,0.00026713777,0.00010684935],"domain_scores_gemma":[0.99683195,0.0021163784,0.0004726099,0.00024201366,0.00028408252,0.00005290459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008986411,0.00055428996,0.0005385584,0.00032985164,0.0003023014,0.0005283061,0.0003983217,0.000609924,0.00038719733],"category_scores_gemma":[0.0051363595,0.00032120955,0.0003596547,0.00044537376,0.0009081621,0.000875245,0.00091898174,0.0006081916,0.00015721754],"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.0002555419,0.000050430735,0.002088706,0.00016209467,0.00010764284,0.00025045997,0.00021009843,0.89182913,0.021277681,0.017883029,0.00044095653,0.0654443],"study_design_scores_gemma":[0.000006109493,0.000048118076,0.00048754484,0.0000054079533,0.000009366678,0.00006496594,0.000021380854,0.9922558,0.0041855774,0.0027535965,0.00015234106,0.000009803911],"about_ca_topic_score_codex":0.0010558305,"about_ca_topic_score_gemma":0.001002519,"teacher_disagreement_score":0.0010558305,"about_ca_system_score_codex":0.00031892527,"about_ca_system_score_gemma":0.0005634433,"threshold_uncertainty_score":0.0047525167},"labels":[],"label_agreement":null},{"id":"W4414539293","doi":"10.1109/icc52391.2025.11162114","title":"A Two-Stage CAE-Based Federated Learning Framework for Efficient Jamming Detection in 5G Networks","year":2025,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Autoencoder; Federated learning; Jamming; Encoder; Convergence (economics); Deep learning; Unsupervised learning; Data modeling","score_opus":0.010384288602101468,"score_gpt":0.27267485684342563,"score_spread":0.2622905682413242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414539293","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.016344517,0.00011405058,0.98173195,0.0001404857,0.000022069307,0.00003459453,0.000032035317,0.00094088184,0.00063943426],"genre_scores_gemma":[0.7211042,0.000112670044,0.27413914,0.00026260855,0.000049251903,0.00014035164,0.00020333537,0.000062102794,0.003926352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915254,0.00018769372,0.0000419061,0.00029370026,0.00019917682,0.0001249385],"domain_scores_gemma":[0.9989969,0.00035533434,0.00010513119,0.00016280457,0.00032151828,0.000058268517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014818029,0.00073005795,0.0009984919,0.00051704276,0.000576703,0.00074083946,0.0015737055,0.0012884241,0.0010688733],"category_scores_gemma":[0.0027654779,0.00038600288,0.00060960674,0.00042521927,0.00087446056,0.0012910985,0.0012642286,0.0014046577,0.00031710524],"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.00024953694,0.0001955286,0.0016664338,0.00004319285,0.000071360904,0.00012794945,0.00009973193,0.79849887,0.00856477,0.008073827,0.0015720344,0.18083669],"study_design_scores_gemma":[0.0000045612815,0.000024864845,0.000106113825,0.0000018786401,0.0000039311217,0.00001926678,0.0000037548393,0.99714214,0.0013549987,0.0011655253,0.00016886629,0.0000042116503],"about_ca_topic_score_codex":0.006912265,"about_ca_topic_score_gemma":0.00853789,"teacher_disagreement_score":0.006912265,"about_ca_system_score_codex":0.0008408973,"about_ca_system_score_gemma":0.001649567,"threshold_uncertainty_score":0.013744056},"labels":[],"label_agreement":null},{"id":"W4415828031","doi":"10.1016/j.comnet.2025.111825","title":"Novel secure user scheduling for uplink wireless networks against potential eavesdroppers","year":2025,"lang":"en","type":"article","venue":"Computer Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Ministry of Science ICT and Future Planning; National Research Foundation of Korea; Ministry of Science, ICT and Future Planning","keywords":"Telecommunications link; Secrecy; Scheduling (production processes); Base station; Channel state information; User equipment; Wireless; Wireless network","score_opus":0.007955866449695299,"score_gpt":0.2290825939709418,"score_spread":0.2211267275212465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415828031","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.043748606,0.00055931654,0.94947773,0.00026008877,0.0002108174,0.0000874276,0.000055863875,0.0005317791,0.005068381],"genre_scores_gemma":[0.90046656,0.00038310298,0.09533483,0.00013854363,0.00021507291,0.000070130125,0.000055055843,0.00006410144,0.0032725765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891806,0.00028125825,0.000049592643,0.0001553829,0.00032978045,0.0002660876],"domain_scores_gemma":[0.99775606,0.0008687494,0.00027130585,0.00056280574,0.00037270595,0.0001683754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010966419,0.0007296796,0.00090907206,0.0005041033,0.0012690502,0.0012735218,0.0009848047,0.0005256908,0.0020653857],"category_scores_gemma":[0.0031351354,0.00036507542,0.00032114587,0.0006808878,0.0006803624,0.0010910732,0.0014040212,0.0009819944,0.00063410547],"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.0017723322,0.00046358598,0.002056158,0.00023654793,0.0001566035,0.00070287235,0.0005722929,0.43833116,0.11667175,0.17727315,0.010072104,0.25169137],"study_design_scores_gemma":[0.000036138415,0.00018843178,0.00020021076,0.0000098264045,0.000031200954,0.00021426183,0.00005531115,0.971837,0.009510904,0.01527426,0.002622611,0.000019817595],"about_ca_topic_score_codex":0.0012249337,"about_ca_topic_score_gemma":0.0025297694,"teacher_disagreement_score":0.0020653857,"about_ca_system_score_codex":0.0008365047,"about_ca_system_score_gemma":0.002098176,"threshold_uncertainty_score":0.00690943},"labels":[],"label_agreement":null},{"id":"W4415971194","doi":"10.1109/tdsc.2025.3629675","title":"Incentive Mechanism Design for Collaborative Physical Layer Authentication: A Centralized Governance Approach","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Western University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Stackelberg competition; Incentive; Authentication (law); Physical layer; Mechanism design; Wireless; Key (lock); Reliability (semiconductor); Layer (electronics)","score_opus":0.02454033996746111,"score_gpt":0.2740580008034,"score_spread":0.24951766083593888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415971194","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.009345883,0.00009330619,0.98873705,0.00016811026,0.000031626045,0.00011126955,0.000015802449,0.00016492854,0.0013320366],"genre_scores_gemma":[0.84416956,0.00014618106,0.1527009,0.00013483601,0.00006867946,0.00029411653,0.00003740203,0.000034174405,0.0024142098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99454075,0.0021869587,0.00037811356,0.0013225588,0.0010144942,0.0005571548],"domain_scores_gemma":[0.99329066,0.0024587717,0.0011271165,0.0011982382,0.0013862295,0.00053892855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069067585,0.00088382914,0.0013644419,0.00087728683,0.0012382187,0.0020445143,0.0033288258,0.0014096408,0.002896814],"category_scores_gemma":[0.012949488,0.0005507859,0.0007599946,0.0008521431,0.0016194361,0.003884681,0.0031322453,0.0020541823,0.000479903],"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.0005733374,0.00041769206,0.0038964138,0.00026441543,0.00017968567,0.00042735616,0.0006018477,0.51269794,0.017899932,0.2895119,0.0033907704,0.17013873],"study_design_scores_gemma":[0.00008126859,0.00021956186,0.0003218655,0.00002162891,0.000044000066,0.00013286706,0.000043358952,0.95762193,0.003271718,0.03581209,0.0023979219,0.000031816828],"about_ca_topic_score_codex":0.001079449,"about_ca_topic_score_gemma":0.0011568773,"teacher_disagreement_score":0.0069067585,"about_ca_system_score_codex":0.0014358958,"about_ca_system_score_gemma":0.0030033905,"threshold_uncertainty_score":0.03652692},"labels":[],"label_agreement":null},{"id":"W4416219098","doi":"10.1016/j.automatica.2025.112685","title":"Integrity attacks on multi-level secured channels: A structured fusion approach","year":2025,"lang":"en","type":"article","venue":"Automatica","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fusion; Sensor fusion; Key (lock); Cryptography; Data integrity","score_opus":0.04598907361626403,"score_gpt":0.2997079245115547,"score_spread":0.25371885089529067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416219098","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.0068220543,0.000100425365,0.9914603,0.00015543612,0.00002217299,0.000026203168,0.000024567802,0.00012770692,0.0012610642],"genre_scores_gemma":[0.7302838,0.0006101204,0.2644403,0.00028797326,0.0002067063,0.00011403155,0.00015740495,0.00011653706,0.0037831035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636036,0.0010859597,0.0001637385,0.0004484399,0.0014331805,0.00050831796],"domain_scores_gemma":[0.9951853,0.0019928452,0.00055378117,0.0014838584,0.0006387058,0.00014547042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029805978,0.0010677497,0.001489992,0.0012891404,0.00088275346,0.0022244186,0.0013284101,0.0018297622,0.0020530985],"category_scores_gemma":[0.005848455,0.0006673173,0.0016435237,0.001060938,0.0022462865,0.0049748006,0.004644532,0.0028934798,0.0005828381],"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.0005804615,0.00018556627,0.001043492,0.00018723843,0.00027662574,0.00046481844,0.00038818282,0.4952037,0.042528357,0.322487,0.0023809841,0.13427354],"study_design_scores_gemma":[0.00001182584,0.00007359002,0.00017271741,0.00001664122,0.00003302877,0.00009338435,0.000038556107,0.8996134,0.005611914,0.093512535,0.0008006539,0.000021868773],"about_ca_topic_score_codex":0.00061603205,"about_ca_topic_score_gemma":0.0005205463,"teacher_disagreement_score":0.0029805978,"about_ca_system_score_codex":0.0008843299,"about_ca_system_score_gemma":0.0010295601,"threshold_uncertainty_score":0.015763104},"labels":[],"label_agreement":null},{"id":"W4416410083","doi":"10.48550/arxiv.2503.20223","title":"Phase-Only Zero-Forcing for Secure Wireless Communication in Multi-User Systems","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","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":"University of Toronto","funders":"","keywords":"Partition (number theory); Beamforming; Artificial noise; Physical layer; Wireless; Channel (broadcasting); Transmission (telecommunications); Secrecy","score_opus":0.06071138248804963,"score_gpt":0.3283635071385713,"score_spread":0.2676521246505217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416410083","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.02494247,0.00031300055,0.971493,0.00017767923,0.000024110106,0.000019591755,0.000016656522,0.000060081376,0.0029533873],"genre_scores_gemma":[0.80642045,0.0006506759,0.19037801,0.00010313072,0.00004139394,0.00008916679,0.00003725734,0.00003134141,0.0022485375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996685,0.0001535497,0.000010215322,0.000027143611,0.00011571531,0.000024910778],"domain_scores_gemma":[0.9992372,0.00052369287,0.000072996496,0.000089835194,0.00005813986,0.000018124885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007856389,0.0004187919,0.0003726775,0.00024946575,0.00041605538,0.0004395351,0.00041756764,0.0005606589,0.0013441541],"category_scores_gemma":[0.0021463782,0.00020372552,0.00035769914,0.00034909547,0.00096029893,0.00064868847,0.00067890214,0.0006275761,0.00024932664],"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.00011114396,0.000029322817,0.0006014927,0.000106137275,0.000025676356,0.00010158615,0.00013582144,0.82603544,0.012193413,0.12492272,0.0007540956,0.034983125],"study_design_scores_gemma":[0.000012499302,0.000047028676,0.00012649469,0.000014872307,0.000005033778,0.00003978427,0.0000113259575,0.9717129,0.0022045523,0.025124796,0.0006931856,0.0000074914],"about_ca_topic_score_codex":0.00055275176,"about_ca_topic_score_gemma":0.00065329956,"teacher_disagreement_score":0.0013441541,"about_ca_system_score_codex":0.0004675575,"about_ca_system_score_gemma":0.0006515178,"threshold_uncertainty_score":0.004496634},"labels":[],"label_agreement":null},{"id":"W4416514043","doi":"10.1109/itw62417.2025.11240394","title":"Round-Preserving Asymptotic Compression of Prior-Free Interactive Protocols","year":2025,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Sherbrooke O.E.M (Canada); Université de Sherbrooke","funders":"","keywords":"Communication complexity; Bounded function; Protocol (science); Communications protocol; Coding (social sciences); Information theory; Data compression; Computational complexity theory","score_opus":0.013485986664880378,"score_gpt":0.3067944042913879,"score_spread":0.2933084176265075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416514043","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.070884675,0.0007426493,0.904391,0.0014094451,0.0000738452,0.00020285242,0.00048448477,0.0008607963,0.020950297],"genre_scores_gemma":[0.87056845,0.0009440755,0.11770737,0.00060912455,0.00026097344,0.00071235583,0.0007333644,0.00042535027,0.008038858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9890543,0.0034904282,0.0005409227,0.0018442816,0.0038723128,0.0011976981],"domain_scores_gemma":[0.92494744,0.052684776,0.0037523902,0.014882852,0.002490476,0.0012421298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007658348,0.001345009,0.0015521907,0.0016769974,0.0015997514,0.003647333,0.004435765,0.0023685892,0.00596392],"category_scores_gemma":[0.05347467,0.0012088934,0.0016662992,0.0017657375,0.005370164,0.01053929,0.007839104,0.006877831,0.0010873527],"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.0005471277,0.00013316533,0.001132158,0.0002529539,0.00009790226,0.00033445243,0.00074982515,0.18288736,0.0070433817,0.77402693,0.0020970977,0.030697683],"study_design_scores_gemma":[0.00005172964,0.00011458164,0.0004069226,0.00006284001,0.000046169374,0.0002754667,0.00006955603,0.38479534,0.0076179663,0.60439116,0.0021126345,0.000055696797],"about_ca_topic_score_codex":0.0008418189,"about_ca_topic_score_gemma":0.0006435568,"teacher_disagreement_score":0.007658348,"about_ca_system_score_codex":0.003277293,"about_ca_system_score_gemma":0.0025302204,"threshold_uncertainty_score":0.040501714},"labels":[],"label_agreement":null},{"id":"W4416582895","doi":"10.1109/tnse.2025.3636073","title":"To Trust or Not to Trust: On Calibration in ML-Based Resource Allocation for Wireless Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Calibration; Resource allocation; Channel (broadcasting); Reliability (semiconductor); Rayleigh fading; Key (lock); Function (biology); Monotonic function; Fading","score_opus":0.013879365993826989,"score_gpt":0.25560358837288655,"score_spread":0.24172422237905955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416582895","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.045384094,0.00085349503,0.94813174,0.0019178364,0.000059331367,0.000051678082,0.0000321918,0.00032862325,0.0032409527],"genre_scores_gemma":[0.94514394,0.0006938021,0.05232321,0.0005109433,0.00011496668,0.0000734022,0.000036030193,0.00013811377,0.0009656546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9906873,0.005390345,0.00032354362,0.001098866,0.0017182659,0.0007816696],"domain_scores_gemma":[0.92504084,0.06271124,0.004068074,0.003927885,0.0035859104,0.00066605024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01387349,0.0013457566,0.0015831083,0.0008457123,0.0009857443,0.0022966254,0.0020694367,0.002180905,0.0016141967],"category_scores_gemma":[0.12036679,0.00090608303,0.00063860015,0.0010471595,0.005069922,0.007339862,0.004297098,0.0044930954,0.00032295767],"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.00017790654,0.000053635507,0.0020039382,0.000090631926,0.000043410506,0.00013779802,0.00039429884,0.90287644,0.0016011284,0.059424665,0.0007446201,0.03245149],"study_design_scores_gemma":[0.000009111597,0.000058765054,0.0003336724,0.00003206854,0.000010284952,0.000055287852,0.000044985416,0.9741746,0.0012768935,0.023701077,0.00028156405,0.000021641828],"about_ca_topic_score_codex":0.0036328337,"about_ca_topic_score_gemma":0.0018184928,"teacher_disagreement_score":0.01387349,"about_ca_system_score_codex":0.0021991618,"about_ca_system_score_gemma":0.0020805716,"threshold_uncertainty_score":0.073370874},"labels":[],"label_agreement":null},{"id":"W4416922352","doi":"10.1109/jsac.2025.3639454","title":"Efficient Covert Communication With Ambient OFDM WiFi Backscatter","year":2025,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Ottawa","funders":"National Natural Science Foundation of China","keywords":"Backscatter (email); Covert; Transmission (telecommunications); Orthogonal frequency-division multiplexing; Covert channel; Throughput","score_opus":0.012259489735952941,"score_gpt":0.2662666177299913,"score_spread":0.25400712799403835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416922352","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.4047666,0.0010159151,0.5842739,0.00027012627,0.00011895677,0.00007450545,0.000098019016,0.0012109898,0.008171064],"genre_scores_gemma":[0.9411814,0.0003484236,0.055867527,0.000139253,0.00005948252,0.00003938723,0.00007546436,0.000031617397,0.0022574903],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958724,0.00006150705,0.000018424631,0.000066074084,0.00019701956,0.000069767244],"domain_scores_gemma":[0.9994461,0.00018262178,0.000116524454,0.00010555215,0.0001286836,0.000020516794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002766652,0.00038319716,0.00044051977,0.0003420884,0.00029345535,0.00032929206,0.0003069048,0.00038860235,0.0010772533],"category_scores_gemma":[0.00077621307,0.00013471798,0.00025783773,0.00028089946,0.00028336365,0.0007753537,0.00069383817,0.0002958598,0.00044039966],"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.0006773439,0.00014718549,0.0056232694,0.0003241905,0.000085356834,0.0006843238,0.0002962396,0.015672825,0.6625535,0.0076378207,0.0024233197,0.30387464],"study_design_scores_gemma":[0.00012269824,0.0018318634,0.007316495,0.00006716362,0.0001712924,0.003197093,0.00016544868,0.26687378,0.70123774,0.0034249495,0.015486054,0.000105522224],"about_ca_topic_score_codex":0.0002572381,"about_ca_topic_score_gemma":0.0004302451,"teacher_disagreement_score":0.0010772533,"about_ca_system_score_codex":0.00019806142,"about_ca_system_score_gemma":0.00014456929,"threshold_uncertainty_score":0.003603816},"labels":[],"label_agreement":null},{"id":"W4417029541","doi":"10.1007/s11276-025-04061-8","title":"Rank optimization technique of physical layer secrecy capacity in MIMO wiretap channel","year":2025,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"MIMO; Physical layer; Covariance; Secure transmission; Covariance matrix; Artificial noise; Channel (broadcasting); Wireless; Optimization problem; Rank (graph theory)","score_opus":0.016402942911476447,"score_gpt":0.2386521781519885,"score_spread":0.22224923524051204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417029541","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.009340458,0.0005768833,0.9815528,0.0003907714,0.000070939015,0.000021757773,0.0001610381,0.00017184089,0.007713665],"genre_scores_gemma":[0.65607065,0.003392197,0.32031912,0.000336263,0.00039465723,0.0002059583,0.000592358,0.00030102208,0.018387793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992054,0.00031542132,0.000026326443,0.00009542724,0.00025526085,0.0001021985],"domain_scores_gemma":[0.9988673,0.00057714444,0.00008383931,0.00016210554,0.00026901622,0.000040730847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011525732,0.0010631356,0.0007642949,0.0005813196,0.00041094646,0.0011924731,0.00077106984,0.0006659622,0.004534095],"category_scores_gemma":[0.0032442883,0.00044919082,0.00053302204,0.001036771,0.0011325307,0.0019380519,0.0011254568,0.0014773266,0.00092914194],"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.00022680691,0.0000899056,0.0006412699,0.00037170178,0.00007908388,0.00025872956,0.00023107148,0.5895401,0.018773293,0.30521032,0.009976663,0.07460104],"study_design_scores_gemma":[0.000007701235,0.000034914425,0.00015778274,0.000019109262,0.000012077074,0.000073402385,0.000026667614,0.96472013,0.0033510628,0.030434173,0.0011465001,0.00001647623],"about_ca_topic_score_codex":0.001950525,"about_ca_topic_score_gemma":0.0023135615,"teacher_disagreement_score":0.004534095,"about_ca_system_score_codex":0.0006587232,"about_ca_system_score_gemma":0.001118874,"threshold_uncertainty_score":0.015168071},"labels":[],"label_agreement":null},{"id":"W4417285377","doi":"10.1109/pimrc62392.2025.11275473","title":"Physical Layer Security in Cell-Free Massive MIMO with Hardware Impairments and Pilot Contamination","year":2025,"lang":"","type":"article","venue":"","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":"Lakehead University","funders":"","keywords":"Eavesdropping; Physical layer; MIMO; Artificial noise; Telecommunications link; Software deployment; Jamming; Noise (video)","score_opus":0.008952993777202095,"score_gpt":0.24980830417160238,"score_spread":0.24085531039440028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417285377","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54194975,0.0012618961,0.44774795,0.0003603897,0.000101174046,0.000044540255,0.00008894879,0.00015506732,0.008290355],"genre_scores_gemma":[0.9951835,0.00025420604,0.0041124057,0.000036492296,0.000020325033,0.000008404242,0.000008641846,0.0000031168406,0.0003729296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913627,0.00029914157,0.000020488967,0.00011108771,0.00023142999,0.00020161692],"domain_scores_gemma":[0.9976611,0.0014264038,0.00039594824,0.00021467735,0.00022202847,0.00007988986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008312842,0.00086143357,0.00057375117,0.00022078122,0.00045054656,0.0007584337,0.00037126738,0.0007577773,0.00043262032],"category_scores_gemma":[0.003354547,0.00028625657,0.00031728667,0.00027453763,0.0014889175,0.0009383708,0.0011125084,0.0005575696,0.00012823555],"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.0007342322,0.00009064841,0.008551756,0.00042407544,0.00022955348,0.0026546025,0.00061052333,0.76202416,0.12313484,0.066196196,0.00074559054,0.03460376],"study_design_scores_gemma":[0.00002354124,0.0006033156,0.003649202,0.00006507015,0.000098880075,0.001115663,0.00023576888,0.9574232,0.023312924,0.012466304,0.00096237235,0.00004375704],"about_ca_topic_score_codex":0.0006772885,"about_ca_topic_score_gemma":0.00057602866,"teacher_disagreement_score":0.00086143357,"about_ca_system_score_codex":0.00038305108,"about_ca_system_score_gemma":0.00050029176,"threshold_uncertainty_score":0.0043963194},"labels":[],"label_agreement":null},{"id":"W66989960","doi":"10.48550/arxiv.0806.1062","title":"Capacity of Block-Memoryless Channels with Causal Channel Side Information","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","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":"University of Waterloo","funders":"","keywords":"Transmitter; Channel (broadcasting); Block (permutation group theory); Channel capacity; Computer science; Function (biology); Mathematics; Channel state information; Telecommunications; Algorithm; Topology (electrical circuits); Wireless; Combinatorics","score_opus":0.03967464817307425,"score_gpt":0.23506577451323302,"score_spread":0.19539112634015876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66989960","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.24213697,0.0040933965,0.70141023,0.0018543099,0.00018386541,0.00006397323,0.001340852,0.00042998057,0.04848646],"genre_scores_gemma":[0.9812215,0.001554666,0.011113548,0.00012918616,0.00013340295,0.00009734507,0.00029338308,0.000054376516,0.0054025156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912924,0.00023596249,0.000034813896,0.00009015719,0.0002975274,0.00021231551],"domain_scores_gemma":[0.9951475,0.0035055003,0.00035201616,0.00043609744,0.0004598742,0.00009892561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011975996,0.0004321733,0.00057839765,0.00084733404,0.00036170418,0.0016603905,0.0011214461,0.0007795165,0.0034725412],"category_scores_gemma":[0.007558768,0.00027648616,0.0003043149,0.0011428213,0.0016515511,0.0024961934,0.0011188218,0.00087003456,0.0003869033],"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.00018861092,0.000027386084,0.00036957115,0.00015926102,0.000030457913,0.0002451545,0.0001918162,0.18772003,0.004217207,0.7896372,0.0029673825,0.014245887],"study_design_scores_gemma":[0.000022026241,0.00002226173,0.00028068558,0.000044453936,0.000014991112,0.00012560622,0.000040304443,0.55135167,0.0017411718,0.44447312,0.0018587373,0.000025033904],"about_ca_topic_score_codex":0.0022992175,"about_ca_topic_score_gemma":0.00097340834,"teacher_disagreement_score":0.0034725412,"about_ca_system_score_codex":0.0011336802,"about_ca_system_score_gemma":0.000987758,"threshold_uncertainty_score":0.011616766},"labels":[],"label_agreement":null},{"id":"W6901618406","doi":"10.60692/zvrxw-2d823","title":"Effects of CSI Knowledge on Secrecy of Threshold-Selection Decode-and-Forward Relaying","year":2017,"lang":"en","type":"article","venue":"Greater South Information System","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":"Memorial University of Newfoundland","funders":"","keywords":"Secrecy; Relay; Node (physics); Bottleneck; Channel state information; Channel (broadcasting); Information-theoretic security; Wireless","score_opus":0.021056476213720605,"score_gpt":0.2303555490138784,"score_spread":0.20929907280015778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6901618406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6835491,0.0030213734,0.29543108,0.0007024792,0.00007906178,0.00005310073,0.00021729524,0.00026958316,0.016676959],"genre_scores_gemma":[0.9972964,0.00062655285,0.0017126014,0.000015220349,0.000016159911,0.000006762832,0.000018604698,0.000008620312,0.00029894745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809045,0.00076289923,0.00009063688,0.00016923221,0.00043682684,0.00044996358],"domain_scores_gemma":[0.9808913,0.015535589,0.0015513278,0.00083579944,0.0009623158,0.00022358332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002516676,0.001289346,0.0012871829,0.00076187664,0.0009188053,0.0012965958,0.0006203327,0.000724224,0.0007752724],"category_scores_gemma":[0.012098431,0.0004954143,0.0005675158,0.0008604365,0.002121711,0.002622653,0.0015229428,0.0006850065,0.0002134475],"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.0005270177,0.00004447753,0.0024710246,0.00013030788,0.00008277299,0.0011249955,0.0001803721,0.9531867,0.01060672,0.021365723,0.00024413352,0.010035811],"study_design_scores_gemma":[0.000023915787,0.00027455942,0.0014647522,0.000038868424,0.00013431217,0.00055486494,0.00015199561,0.97198844,0.013897075,0.01113089,0.0002948541,0.000045461034],"about_ca_topic_score_codex":0.002220485,"about_ca_topic_score_gemma":0.0015918078,"teacher_disagreement_score":0.002516676,"about_ca_system_score_codex":0.0012963495,"about_ca_system_score_gemma":0.0011136397,"threshold_uncertainty_score":0.013309598},"labels":[],"label_agreement":null},{"id":"W6920242196","doi":"10.60692/v2pff-y3p32","title":"Secrecy Performance of Small-Cell Networks with Transmitter Selection and Unreliable Backhaul under Spectrum Sharing Environment","year":2021,"lang":"en","type":"article","venue":"Greater South Information System","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":"Memorial University of Newfoundland","funders":"","keywords":"Eavesdropping; Secrecy; Transmitter; Cognitive radio; Backhaul (telecommunications); Artificial noise; Transmitter power output; Selection (genetic algorithm)","score_opus":0.01306069200095012,"score_gpt":0.15847893468821647,"score_spread":0.14541824268726636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6920242196","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9345489,0.0005011843,0.061129056,0.00018903625,0.000027251233,0.00002327292,0.000073300565,0.000090127534,0.003417862],"genre_scores_gemma":[0.9986817,0.00010609417,0.000993356,0.000008618369,0.0000062211498,0.000005085968,0.000012428868,0.0000031491072,0.00018328527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900514,0.0003574092,0.000025162268,0.000085972555,0.0001946112,0.0003318391],"domain_scores_gemma":[0.99315053,0.004802632,0.0008264521,0.0002770494,0.00073259167,0.0002107345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001658043,0.00096187793,0.0007853343,0.0005964601,0.0008884485,0.0010570135,0.0006603461,0.00069651066,0.00059922424],"category_scores_gemma":[0.0054845233,0.00024667202,0.0003606782,0.00069879985,0.001992906,0.0012583883,0.0012076987,0.0005069661,0.00012413418],"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.0003790248,0.000042352705,0.0027092525,0.00005257851,0.000044436376,0.00036857516,0.00012937181,0.98026353,0.0073166005,0.0050621442,0.00015815692,0.0034739103],"study_design_scores_gemma":[0.000012531499,0.00014379821,0.0006465994,0.0000045485353,0.000023308576,0.000073303796,0.00006872208,0.9931076,0.0041676387,0.0016964694,0.000040196326,0.000015198687],"about_ca_topic_score_codex":0.0054494482,"about_ca_topic_score_gemma":0.0028925666,"teacher_disagreement_score":0.0054494482,"about_ca_system_score_codex":0.001150311,"about_ca_system_score_gemma":0.00089644594,"threshold_uncertainty_score":0.010835469},"labels":[],"label_agreement":null},{"id":"W6920287107","doi":"10.60692/tg7nc-fkb53","title":"Effects of CSI Knowledge on Secrecy of Threshold-Selection Decode-and-Forward Relaying","year":2017,"lang":"en","type":"article","venue":"Greater South Information System","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":"Memorial University of Newfoundland","funders":"","keywords":"Secrecy; Relay; Node (physics); Bottleneck; Channel state information; Channel (broadcasting); Information-theoretic security; Wireless","score_opus":0.021056476213720605,"score_gpt":0.2303555490138784,"score_spread":0.20929907280015778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6920287107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6835491,0.0030213734,0.29543108,0.0007024792,0.00007906178,0.00005310073,0.00021729524,0.00026958316,0.016676959],"genre_scores_gemma":[0.9972964,0.00062655285,0.0017126014,0.000015220349,0.000016159911,0.000006762832,0.000018604698,0.000008620312,0.00029894745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809045,0.00076289923,0.00009063688,0.00016923221,0.00043682684,0.00044996358],"domain_scores_gemma":[0.9808913,0.015535589,0.0015513278,0.00083579944,0.0009623158,0.00022358332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002516676,0.001289346,0.0012871829,0.00076187664,0.0009188053,0.0012965958,0.0006203327,0.000724224,0.0007752724],"category_scores_gemma":[0.012098431,0.0004954143,0.0005675158,0.0008604365,0.002121711,0.002622653,0.0015229428,0.0006850065,0.0002134475],"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.0005270177,0.00004447753,0.0024710246,0.00013030788,0.00008277299,0.0011249955,0.0001803721,0.9531867,0.01060672,0.021365723,0.00024413352,0.010035811],"study_design_scores_gemma":[0.000023915787,0.00027455942,0.0014647522,0.000038868424,0.00013431217,0.00055486494,0.00015199561,0.97198844,0.013897075,0.01113089,0.0002948541,0.000045461034],"about_ca_topic_score_codex":0.002220485,"about_ca_topic_score_gemma":0.0015918078,"teacher_disagreement_score":0.002516676,"about_ca_system_score_codex":0.0012963495,"about_ca_system_score_gemma":0.0011136397,"threshold_uncertainty_score":0.013309598},"labels":[],"label_agreement":null},{"id":"W6920555768","doi":"10.60692/cxk8n-gnq64","title":"Secrecy Performance of Small-Cell Networks with Transmitter Selection and Unreliable Backhaul under Spectrum Sharing Environment","year":2021,"lang":"en","type":"article","venue":"Greater South Information System","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":"Memorial University of Newfoundland","funders":"","keywords":"Eavesdropping; Secrecy; Transmitter; Cognitive radio; Backhaul (telecommunications); Artificial noise; Transmitter power output; Selection (genetic algorithm)","score_opus":0.01306069200095012,"score_gpt":0.15847893468821647,"score_spread":0.14541824268726636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6920555768","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9345489,0.0005011843,0.061129056,0.00018903625,0.000027251233,0.00002327292,0.000073300565,0.000090127534,0.003417862],"genre_scores_gemma":[0.9986817,0.00010609417,0.000993356,0.000008618369,0.0000062211498,0.000005085968,0.000012428868,0.0000031491072,0.00018328527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900514,0.0003574092,0.000025162268,0.000085972555,0.0001946112,0.0003318391],"domain_scores_gemma":[0.99315053,0.004802632,0.0008264521,0.0002770494,0.00073259167,0.0002107345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001658043,0.00096187793,0.0007853343,0.0005964601,0.0008884485,0.0010570135,0.0006603461,0.00069651066,0.00059922424],"category_scores_gemma":[0.0054845233,0.00024667202,0.0003606782,0.00069879985,0.001992906,0.0012583883,0.0012076987,0.0005069661,0.00012413418],"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.0003790248,0.000042352705,0.0027092525,0.00005257851,0.000044436376,0.00036857516,0.00012937181,0.98026353,0.0073166005,0.0050621442,0.00015815692,0.0034739103],"study_design_scores_gemma":[0.000012531499,0.00014379821,0.0006465994,0.0000045485353,0.000023308576,0.000073303796,0.00006872208,0.9931076,0.0041676387,0.0016964694,0.000040196326,0.000015198687],"about_ca_topic_score_codex":0.0054494482,"about_ca_topic_score_gemma":0.0028925666,"teacher_disagreement_score":0.0054494482,"about_ca_system_score_codex":0.001150311,"about_ca_system_score_gemma":0.00089644594,"threshold_uncertainty_score":0.010835469},"labels":[],"label_agreement":null},{"id":"W6977013692","doi":"10.60825/q0kn-jz16","title":"Mise à jour des intrants et des méthodes de calcul de l’ogive de maturité de la morue franche du nord du golfe du Saint Laurent (3Pn, 4RS) sur la période 1983-2023","year":2025,"lang":"fr","type":"report","venue":"Fisheries and Oceans Canada / Pêches et Océans Canada - Publications","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":true,"ca_institutions":"Fisheries and Oceans Canada","funders":"","keywords":"Western europe; Limiting","score_opus":0.02487012504691439,"score_gpt":0.25651814726891586,"score_spread":0.23164802222200148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977013692","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77166396,0.0029681316,0.2100605,0.0004595054,0.00015789212,0.00029171142,0.0039310628,0.0010180675,0.009449121],"genre_scores_gemma":[0.66955775,0.0015649104,0.30989698,0.00009201563,0.00004414832,0.00035635795,0.0030020701,0.00032449112,0.015161228],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9967525,0.001119351,0.00030838174,0.00079347007,0.0008387539,0.00018761771],"domain_scores_gemma":[0.9911377,0.0046122097,0.0009148371,0.00051637425,0.0026849099,0.00013394981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008955624,0.0009551152,0.0008595413,0.0021174215,0.0009743645,0.0022611818,0.0010761546,0.0006167376,0.0036760718],"category_scores_gemma":[0.013172205,0.0010524136,0.0016778838,0.0019756283,0.0005094861,0.00087138516,0.00086433516,0.0008638152,0.0012981521],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038243804,0.00011144344,0.74172103,0.0005788288,0.000703218,0.00021477843,0.0023025502,0.035501905,0.0067088157,0.003502392,0.0018461995,0.20642637],"study_design_scores_gemma":[0.0001509572,0.00043089013,0.7385518,0.00067157036,0.00053683936,0.00037306655,0.0028491835,0.18818212,0.020953452,0.0018553442,0.045259997,0.00018484413],"about_ca_topic_score_codex":0.2639955,"about_ca_topic_score_gemma":0.3970659,"teacher_disagreement_score":0.7360045,"about_ca_system_score_codex":0.0031325773,"about_ca_system_score_gemma":0.0049079973,"threshold_uncertainty_score":0.5249177},"labels":[],"label_agreement":null},{"id":"W6977128854","doi":"10.60692/7ymy8-sqh83","title":"Managing Neonatal and Early Childhood Syndromic Sepsis in Sub-District Hospitals in Resource Poor Settings: Improvement in Quality of Care through Introduction of a Package of Interventions in Rural Bangladesh","year":2017,"lang":"en","type":"article","venue":"Greater South Information System","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":"University of British Columbia","funders":"","keywords":"Triage; Psychological intervention; Sepsis; Public health; Emergency department; Resuscitation; Quality management; Intervention (counseling)","score_opus":0.013816635169352621,"score_gpt":0.23655613608833997,"score_spread":0.22273950091898737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977128854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97442526,0.0036708158,0.0007941721,0.0133188125,0.00013434901,0.0008853684,0.00027883434,0.00005285992,0.006439445],"genre_scores_gemma":[0.9871191,0.0052135037,0.004013471,0.0017835293,0.000053141386,0.00057552825,0.00014376911,0.000007373902,0.0010904773],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.998811,0.00067784666,0.000097695265,0.00006447534,0.00010418925,0.00024479328],"domain_scores_gemma":[0.99834764,0.00018521339,0.0002622998,0.000053466436,0.00019423992,0.0009571197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014967332,0.00030415304,0.00021310587,0.0003864132,0.00085430365,0.00093064987,0.0007321178,0.0006062967,0.0017093988],"category_scores_gemma":[0.0035325529,0.0001725752,0.00024191246,0.00070227013,0.0005849479,0.0005880447,0.0017987303,0.00079199136,0.00015614515],"study_design_candidate":"observational","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.0015424469,0.0049194717,0.30822286,0.005784676,0.0002125152,0.0051960303,0.031474657,0.0034975319,0.011315308,0.0027216969,0.011949658,0.61316323],"study_design_scores_gemma":[0.00076312793,0.012160508,0.8742121,0.002181539,0.00021817493,0.0017761269,0.05524241,0.0010049243,0.0026339013,0.0010237679,0.048614714,0.00016874917],"about_ca_topic_score_codex":0.019871581,"about_ca_topic_score_gemma":0.03176878,"teacher_disagreement_score":0.019871581,"about_ca_system_score_codex":0.0028397092,"about_ca_system_score_gemma":0.0067029297,"threshold_uncertainty_score":0.03951186},"labels":[],"label_agreement":null},{"id":"W6986585972","doi":"","title":"Pre-Privacy Amplification: A Post-Processing Technique for Quantum Key Distribution with Application to the Simplified Trusted Relay","year":2023,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","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":"University of Waterloo","funders":"Strong","keywords":"Quantum key distribution; Relay; Key (lock); Construct (python library); Power (physics); Quantum computer; Quantum","score_opus":0.011044911552668048,"score_gpt":0.22866266235705585,"score_spread":0.2176177508043878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6986585972","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.05009383,0.00020529957,0.93324727,0.0003711321,0.00008791979,0.00034222423,0.00016520073,0.0010702808,0.014416817],"genre_scores_gemma":[0.66732585,0.0004158081,0.3185173,0.00020199805,0.0000998186,0.00031885187,0.00027316264,0.00021129762,0.012635872],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826616,0.0002832805,0.000084466315,0.0003847104,0.0007512901,0.00023013462],"domain_scores_gemma":[0.9974419,0.0006384817,0.00050006725,0.0009572281,0.00038105997,0.000081191094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009150613,0.0010942547,0.0006774292,0.00057603634,0.00088073086,0.0013573219,0.001721826,0.001014919,0.007121159],"category_scores_gemma":[0.004277329,0.0004550332,0.0009355084,0.00053393125,0.0022048454,0.0022897143,0.0023416781,0.0019595108,0.002713216],"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.00077029644,0.00027588545,0.0019071884,0.0004886965,0.00008997324,0.0013416648,0.0007342863,0.07880481,0.4581216,0.36982888,0.0052238405,0.082412876],"study_design_scores_gemma":[0.000078994635,0.0005889233,0.000765639,0.000047820777,0.00008560847,0.0012975385,0.00013463762,0.52833486,0.4188581,0.03175292,0.017930508,0.00012446199],"about_ca_topic_score_codex":0.00081872975,"about_ca_topic_score_gemma":0.00081552676,"teacher_disagreement_score":0.007121159,"about_ca_system_score_codex":0.00093711104,"about_ca_system_score_gemma":0.0012015164,"threshold_uncertainty_score":0.023822606},"labels":[],"label_agreement":null},{"id":"W6990534493","doi":"","title":"Distributed lossy source coding using BCH-DFT codes","year":2014,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Distributed source coding; Lossy compression; Decoding methods; Encoder; Binary number; Context-adaptive binary arithmetic coding; Coding (social sciences); Quantization (signal processing); Variable-length code","score_opus":0.01917089811362026,"score_gpt":0.2505669615455036,"score_spread":0.23139606343188335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6990534493","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.009305942,0.0005381294,0.9832045,0.00024954986,0.000081570375,0.000074609015,0.00011480755,0.0002511004,0.006179839],"genre_scores_gemma":[0.5222336,0.0014568188,0.46659994,0.0003212549,0.00013658771,0.0003526265,0.00041282945,0.00008140522,0.0084048435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994375,0.00012669472,0.000024690788,0.00008741355,0.00028153713,0.00004213962],"domain_scores_gemma":[0.9991805,0.0003119544,0.00009387827,0.00016337378,0.00022504231,0.00002528524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000530684,0.00055230624,0.00045218822,0.0006742686,0.0003870071,0.0007081426,0.0008037787,0.0006782454,0.0017761311],"category_scores_gemma":[0.0020543458,0.0001728202,0.0003008813,0.0009360669,0.0008907541,0.0009895307,0.0008849221,0.001200025,0.0006191369],"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.00017320289,0.000078389094,0.00046052807,0.00023801958,0.000037985596,0.0002610399,0.00023208407,0.22472216,0.03684153,0.51339847,0.004877121,0.21867944],"study_design_scores_gemma":[0.00005940915,0.00009644713,0.00022288942,0.00006237674,0.000016097563,0.00024496054,0.000028899087,0.855869,0.019322438,0.11385456,0.010182661,0.000040255178],"about_ca_topic_score_codex":0.0015033939,"about_ca_topic_score_gemma":0.0014861356,"teacher_disagreement_score":0.0017761311,"about_ca_system_score_codex":0.0009818096,"about_ca_system_score_gemma":0.0011394966,"threshold_uncertainty_score":0.00712353},"labels":[],"label_agreement":null},{"id":"W7015017120","doi":"","title":"Security enhancements for sparse MIMO systems: A compressive sensing - artificial noise technique","year":2018,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","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":"McGill University","funders":"","keywords":"Physical layer; Artificial noise; MIMO; Compressed sensing; Adversary; Wireless; Randomness; Secrecy; Noise (video)","score_opus":0.022576947612751058,"score_gpt":0.26545015282404005,"score_spread":0.242873205211289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7015017120","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.015795013,0.00090102,0.9715199,0.00080090435,0.00018515476,0.000029211735,0.000037086545,0.00006990243,0.010661898],"genre_scores_gemma":[0.8230989,0.0036716976,0.15884508,0.00058889296,0.00071439496,0.00010176279,0.00010021616,0.000041554114,0.012837551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994449,0.00019604657,0.000019467394,0.000067780515,0.00021884532,0.000052952088],"domain_scores_gemma":[0.9989391,0.0006207083,0.00010905842,0.00012216796,0.00016313288,0.000045781184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075904315,0.0006179146,0.0004133291,0.00032892995,0.0003405027,0.0007300169,0.00041017897,0.0007514373,0.0015948951],"category_scores_gemma":[0.0021727858,0.00021901375,0.000521339,0.00039714025,0.0010741748,0.0012981948,0.0010703059,0.0012478634,0.0003609068],"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.00027105614,0.000093703224,0.001179927,0.00031002337,0.00008632485,0.0004981809,0.0004451196,0.3422829,0.056031972,0.4972955,0.0039287116,0.09757656],"study_design_scores_gemma":[0.0000126977775,0.0001816289,0.0003344993,0.000041131618,0.000021580498,0.00027579104,0.00007051614,0.9402794,0.0055657923,0.04870074,0.0044897846,0.000026480951],"about_ca_topic_score_codex":0.00052905193,"about_ca_topic_score_gemma":0.00058891065,"teacher_disagreement_score":0.0015948951,"about_ca_system_score_codex":0.00039002768,"about_ca_system_score_gemma":0.00040144657,"threshold_uncertainty_score":0.00533545},"labels":[],"label_agreement":null},{"id":"W7016009648","doi":"","title":"Zero-Delay Lossy Coding of Linear Vector Markov Sources with Applications to Networked Control","year":2021,"lang":"en","type":"dissertation","venue":"QSpace (Queen's University Library)","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":"Markov chain; Markov process; Encoder; Lossy compression; Markov decision process; Coding (social sciences); Optimal control; Control theory (sociology); Markov model; Rate of convergence","score_opus":0.004928368903094874,"score_gpt":0.191419791308291,"score_spread":0.18649142240519614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7016009648","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.04050863,0.0010504135,0.9516618,0.000600791,0.00007477703,0.000023160977,0.00005724705,0.00006767496,0.005955335],"genre_scores_gemma":[0.9480357,0.0016873344,0.0423429,0.00011226507,0.00010620836,0.00007359666,0.000077817014,0.000031380467,0.0075327805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971575,0.000074767486,0.000011345262,0.000055804365,0.00010383111,0.000038502534],"domain_scores_gemma":[0.9984811,0.0011477356,0.00015544429,0.000057210553,0.0001253995,0.000033030694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073782646,0.00042359554,0.0003710505,0.00028981804,0.00024630962,0.0006794057,0.00057018036,0.00046971,0.0013798132],"category_scores_gemma":[0.0036674843,0.00019609102,0.00024970298,0.00042885513,0.001131261,0.0010770084,0.00083275966,0.001142208,0.00013473738],"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.00005551305,0.000018583745,0.0002342474,0.00007657397,0.000009045186,0.000036584475,0.00008093818,0.69347996,0.0022059781,0.2848868,0.000397837,0.018517984],"study_design_scores_gemma":[0.0000041047556,0.00002137437,0.00005063771,0.0000094228535,0.0000027432527,0.000009727633,0.000010147283,0.96085995,0.00076727825,0.037875835,0.00038316948,0.0000056741164],"about_ca_topic_score_codex":0.0032067557,"about_ca_topic_score_gemma":0.0017736794,"teacher_disagreement_score":0.0032067557,"about_ca_system_score_codex":0.0013328551,"about_ca_system_score_gemma":0.00091580313,"threshold_uncertainty_score":0.009670556},"labels":[],"label_agreement":null},{"id":"W7021061897","doi":"","title":"Multiple Antenna Broadcast Channels with Random Channel Side Information","year":2011,"lang":"en","type":"dissertation","venue":"Library and Archives Canada (Government of Canada)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Channel (broadcasting); Channel state information; Transmitter; Additive white Gaussian noise; Transmission (telecommunications); Antenna (radio); Range (aeronautics); Rayleigh fading; Noise (video); Gaussian","score_opus":0.0036054374815553208,"score_gpt":0.1390657052268562,"score_spread":0.1354602677453009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7021061897","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064336844,0.0013464765,0.92042714,0.0005583164,0.00013717591,0.000052935375,0.0004179968,0.0005247499,0.012198352],"genre_scores_gemma":[0.95030004,0.0016345013,0.03892638,0.00010948185,0.00017813484,0.00009681893,0.00017625758,0.000038653056,0.008539711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990225,0.00036296117,0.000030938823,0.00012981545,0.0003076451,0.00014611238],"domain_scores_gemma":[0.99810576,0.0012396034,0.00024969387,0.00020258136,0.0001624019,0.000039882343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010018279,0.0007540459,0.0010204463,0.00038254837,0.0004142121,0.0011639118,0.0008719175,0.001148705,0.0017115998],"category_scores_gemma":[0.0035486089,0.000599641,0.00040307708,0.00092208403,0.0010733145,0.0010054465,0.0009222738,0.0009789346,0.00055370753],"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.00026799607,0.000029612635,0.0007408689,0.00019231996,0.000044334352,0.00039317357,0.00011442081,0.8315199,0.0063314545,0.14122999,0.0017657691,0.017370239],"study_design_scores_gemma":[0.000028739623,0.000047211863,0.00020584375,0.000017007085,0.000025098147,0.00012242381,0.000019879088,0.9690629,0.001953247,0.027187098,0.0013002376,0.000030375422],"about_ca_topic_score_codex":0.001847702,"about_ca_topic_score_gemma":0.0017527638,"teacher_disagreement_score":0.001847702,"about_ca_system_score_codex":0.0010427783,"about_ca_system_score_gemma":0.00067445013,"threshold_uncertainty_score":0.007565975},"labels":[],"label_agreement":null},{"id":"W7023745133","doi":"","title":"The prevalence and impact of bypassing phase 2 trials in neurologic drug development","year":2023,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institutes of Health Research","keywords":"Drug development; Phase (matter); Clinical trial; Drug; MEDLINE","score_opus":0.038311789950783305,"score_gpt":0.32207586761081786,"score_spread":0.28376407766003453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023745133","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6969438,0.12848555,0.015751947,0.07730854,0.0037437736,0.0017451697,0.0050200745,0.00044200147,0.07055913],"genre_scores_gemma":[0.95335543,0.017794967,0.006371499,0.016799092,0.0010698354,0.00052671146,0.0011195575,0.0001466582,0.00281618],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9675186,0.024130277,0.0020118456,0.001690506,0.0034196775,0.0012291541],"domain_scores_gemma":[0.7264229,0.19440803,0.048107553,0.006553239,0.012201857,0.012306421],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.05822147,0.00033001867,0.0008305344,0.0012206906,0.00076054776,0.0034529082,0.0009290937,0.0017639515,0.0074117226],"category_scores_gemma":[0.19203669,0.00036322197,0.00097171724,0.0014441141,0.0012530974,0.0029302866,0.0014227498,0.0028534879,0.00075570977],"study_design_candidate":"observational","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.019135274,0.00091155135,0.18664005,0.0012025537,0.00077373645,0.00020572562,0.00043552736,0.0014146653,0.0012488313,0.008220068,0.031174416,0.7486375],"study_design_scores_gemma":[0.009597413,0.04257292,0.73473775,0.006695792,0.003373068,0.0033185682,0.0016264677,0.0095148515,0.004293357,0.018301843,0.1656962,0.0002716807],"about_ca_topic_score_codex":0.0021740166,"about_ca_topic_score_gemma":0.004646098,"teacher_disagreement_score":0.94177854,"about_ca_system_score_codex":0.0019331437,"about_ca_system_score_gemma":0.0053272457,"threshold_uncertainty_score":0.30790824},"labels":[],"label_agreement":null},{"id":"W7023803883","doi":"","title":"Occurrence of Pyrenophora Tritici-repentis causing tan spot in argentina","year":2010,"lang":"en","type":"article","venue":"Conicet","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Hyporeflexia; TSG101; Liquation; Gestational period; Dysgeusia; Diafiltration","score_opus":0.014455973973564058,"score_gpt":0.2588494328155745,"score_spread":0.24439345884201044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023803883","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.979939,0.0068231383,0.00039136928,0.00019763316,0.000024983707,0.000026055042,0.00057924946,0.000037573114,0.011980925],"genre_scores_gemma":[0.9921211,0.005315554,0.00035235885,0.000040006064,0.00002152525,0.000009336994,0.0005146629,0.0000051113593,0.0016202974],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9998745,0.000017663511,0.000012373456,0.00003423639,0.000039796534,0.000021455888],"domain_scores_gemma":[0.99984384,0.00001993687,0.00007652525,0.0000059000704,0.000037643254,0.000016150529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013512232,0.00012977095,0.00015681867,0.00042411636,0.00027873486,0.00033831614,0.00010234855,0.00021350919,0.0010081899],"category_scores_gemma":[0.00020784723,0.00006832148,0.00006603873,0.00040921604,0.0001338622,0.00012801979,0.0001120349,0.00011807379,0.00020670176],"study_design_candidate":"observational","study_design_consensus":"observational","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.00054005545,0.00019036213,0.69670606,0.00065090554,0.000054989912,0.009623224,0.002522065,0.00047844026,0.15154986,0.00044945514,0.003819921,0.13341461],"study_design_scores_gemma":[0.000006540633,0.00021073602,0.98064387,0.00006889656,0.000026934262,0.0044041853,0.0006424972,0.00028926754,0.0042628124,0.000050888906,0.009384844,0.00000856586],"about_ca_topic_score_codex":0.012196752,"about_ca_topic_score_gemma":0.017853545,"teacher_disagreement_score":0.012196752,"about_ca_system_score_codex":0.00025681098,"about_ca_system_score_gemma":0.00012869123,"threshold_uncertainty_score":0.02425152},"labels":[],"label_agreement":null},{"id":"W7024497780","doi":"","title":"Solon and the Rhetoric of <i>Stasis</i>","year":2018,"lang":"en","type":"article","venue":"Project Muse (Johns Hopkins University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Rhetoric; Series (stratigraphy); Association (psychology); George (robot)","score_opus":0.013967378939467123,"score_gpt":0.21434865152190263,"score_spread":0.20038127258243552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024497780","genre_codex":"other","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.016756762,0.0070105544,0.0076268925,0.059804723,0.0025075981,0.000023761371,0.00009444813,0.000184453,0.90599084],"genre_scores_gemma":[0.8715839,0.0016160315,0.0023431394,0.006203393,0.0013877922,0.000039632578,0.000054781536,0.0004729303,0.116298325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964306,0.001959111,0.00010051442,0.0003674218,0.00072335126,0.00041902182],"domain_scores_gemma":[0.9963347,0.0021559652,0.00021036374,0.00032099683,0.00075316627,0.00022486129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039623287,0.00064885913,0.00057346217,0.0021909142,0.014217593,0.013362917,0.0017560181,0.003844647,0.011413243],"category_scores_gemma":[0.009067043,0.0004835001,0.00042647086,0.002365686,0.036541227,0.008728828,0.0040890793,0.008932343,0.0013494664],"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.0000113440765,0.0000028071597,0.00004185048,0.000013840377,0.000001706914,0.000012532725,0.005950479,0.000023043976,0.000026946125,0.98761785,0.005214544,0.001083063],"study_design_scores_gemma":[0.00004176588,0.000024929037,0.00031251847,0.00021663081,0.000016703207,0.00009236636,0.010846411,0.00057316007,0.00028258955,0.6180091,0.36955038,0.000033473843],"about_ca_topic_score_codex":0.08275886,"about_ca_topic_score_gemma":0.10182468,"teacher_disagreement_score":0.08275886,"about_ca_system_score_codex":0.019571347,"about_ca_system_score_gemma":0.008946838,"threshold_uncertainty_score":0.16455424},"labels":[],"label_agreement":null},{"id":"W7029612806","doi":"","title":"Iterative receivers for digital communications via variational inference and estimation","year":2008,"lang":"en","type":"dissertation","venue":"University of Oulu Repository (University of Oulu)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Diafiltration; Liquation; Emperipolesis; Triacetin; Proteogenomics","score_opus":0.011401921496395878,"score_gpt":0.21490302400114192,"score_spread":0.20350110250474604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7029612806","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.0018823553,0.00023904581,0.9964059,0.00021017302,0.000030864503,0.000026747452,0.00004429141,0.00009308263,0.0010674337],"genre_scores_gemma":[0.21701266,0.001421863,0.75809026,0.00029800003,0.0003611658,0.000623866,0.0006163958,0.00045205437,0.0211237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977041,0.0012241956,0.0001022114,0.0002980867,0.00049998076,0.00017142331],"domain_scores_gemma":[0.9849914,0.01300129,0.00046301543,0.00053188583,0.00083268055,0.0001798457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004862715,0.0017611033,0.003054321,0.0015834295,0.00091688306,0.0027624813,0.0033621055,0.0038372306,0.0044121593],"category_scores_gemma":[0.026056524,0.0024509495,0.0026477114,0.002065938,0.0038550997,0.0036711588,0.0042822245,0.005711196,0.0011854611],"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.00012627702,0.000070518,0.00037713867,0.00020914426,0.00016251212,0.0000773684,0.00024352582,0.7556811,0.00090718217,0.20614554,0.0016735962,0.03432603],"study_design_scores_gemma":[0.000020231248,0.0000122320935,0.00004501625,0.000015715143,0.000011808663,0.000011999256,0.000009871495,0.9542019,0.00036027684,0.044680946,0.00061780756,0.000012168972],"about_ca_topic_score_codex":0.011548815,"about_ca_topic_score_gemma":0.009767854,"teacher_disagreement_score":0.011548815,"about_ca_system_score_codex":0.002853804,"about_ca_system_score_gemma":0.0035953822,"threshold_uncertainty_score":0.025716782},"labels":[],"label_agreement":null},{"id":"W7092205663","doi":"10.1109/tifs.2025.3622317","title":"Polar-Domain Multi-User Key Generation in Near-Field Communications","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; Engineering and Physical Sciences Research Council; European Commission; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; Department for the Economy","keywords":"Telecommunications link; Precoding; Channel state information; Decorrelation; MIMO; Base station; Channel (broadcasting); Key generation; Physical layer; Overhead (engineering)","score_opus":0.014276607840664474,"score_gpt":0.2513515399323341,"score_spread":0.23707493209166963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092205663","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.014512284,0.0010298443,0.97952193,0.00022703737,0.00006207436,0.000032215426,0.00005722814,0.00018801178,0.004369375],"genre_scores_gemma":[0.8136346,0.00202576,0.18000866,0.00023444796,0.00009754157,0.00009250722,0.00012084448,0.000049759525,0.0037359106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994504,0.00021513825,0.000020627398,0.0000836001,0.00016359928,0.00006669231],"domain_scores_gemma":[0.999311,0.0003579195,0.00008074711,0.00012431288,0.00010207644,0.000023881094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008789825,0.0005235266,0.0004489592,0.0002787157,0.00032599666,0.00077530375,0.0006269846,0.00069009117,0.0016295555],"category_scores_gemma":[0.0018260715,0.00030562386,0.00028390205,0.0005872773,0.00087396585,0.0015733638,0.0009541838,0.0009723628,0.0005820597],"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.0002556312,0.00008527705,0.0009959745,0.0003268301,0.000039492435,0.00032692705,0.00017958881,0.6529099,0.026292786,0.17157982,0.0032900996,0.14371768],"study_design_scores_gemma":[0.000008347197,0.000060905062,0.00013259584,0.000022515862,0.0000071620975,0.0001148499,0.000027375696,0.9712242,0.00581877,0.019641586,0.0029245138,0.000017196533],"about_ca_topic_score_codex":0.00087673654,"about_ca_topic_score_gemma":0.001299308,"teacher_disagreement_score":0.0016295555,"about_ca_system_score_codex":0.00060858787,"about_ca_system_score_gemma":0.00079857465,"threshold_uncertainty_score":0.005451441},"labels":[],"label_agreement":null},{"id":"W7097026278","doi":"","title":"On the capacity-achieving distribution of the non-coherent Rician fading channel,” Canadian workshop on information theory","year":2003,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Rician fading; Fading; Fading distribution; Amplitude; Transmitter; Channel (broadcasting); Transmission (telecommunications); Distribution (mathematics)","score_opus":0.013527594414244143,"score_gpt":0.20396101586212298,"score_spread":0.19043342144787884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097026278","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.10941447,0.002607779,0.8443551,0.0028214594,0.00012644663,0.00008445933,0.0005397683,0.00022129242,0.039829172],"genre_scores_gemma":[0.9380282,0.0031368327,0.05095867,0.00029773134,0.0003871479,0.00015378575,0.00033727218,0.00008060652,0.0066197775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985166,0.0006321028,0.000042845633,0.00013801924,0.00045421923,0.00021620325],"domain_scores_gemma":[0.9933897,0.004215979,0.00045508152,0.00054190465,0.0010948795,0.0003024201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003960731,0.0008113643,0.0008226971,0.0013437088,0.0007576831,0.0019969123,0.0015648796,0.000858361,0.0036640256],"category_scores_gemma":[0.011375316,0.0005489434,0.00050033466,0.001554646,0.003411704,0.0027935875,0.0013503741,0.0018763329,0.0005548312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017234012,0.0000353698,0.00057046424,0.000103520055,0.000033148397,0.0001548127,0.00020757716,0.18466224,0.0025140985,0.79144084,0.004082943,0.016022641],"study_design_scores_gemma":[0.000024977897,0.000050461174,0.0004923837,0.00004045677,0.0000120098475,0.000096781514,0.00005463871,0.7475823,0.0016573006,0.24754007,0.0024161679,0.00003248605],"about_ca_topic_score_codex":0.0038039614,"about_ca_topic_score_gemma":0.0022946117,"teacher_disagreement_score":0.99619603,"about_ca_system_score_codex":0.0031545325,"about_ca_system_score_gemma":0.0016195517,"threshold_uncertainty_score":0.022887826},"labels":[],"label_agreement":null},{"id":"W7104183573","doi":"","title":"Adaptive Cooperative Transmission Design for Ultra-Reliable Low-Latency Communications via Deep Reinforcement Learning","year":2025,"lang":"","type":"article","venue":"ArXiv.org","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":"University of Victoria","funders":"","keywords":"Markov decision process; Transmission (telecommunications); Network packet; Reinforcement learning; Link adaptation; Reliability (semiconductor); Data transmission; Latency (audio); Coding (social sciences)","score_opus":0.04421592938892122,"score_gpt":0.286742917389954,"score_spread":0.24252698800103278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104183573","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.03595886,0.0002115918,0.9612332,0.00022407171,0.00003029463,0.000032166092,0.00001605729,0.00020148972,0.0020923002],"genre_scores_gemma":[0.9658251,0.000092216535,0.032231603,0.000101827245,0.00001578542,0.000081798884,0.000023594772,0.000023504846,0.0016046977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959856,0.00010405167,0.000017381286,0.00009623133,0.000098485114,0.000085313004],"domain_scores_gemma":[0.9988373,0.0006159243,0.0001826089,0.00005938629,0.00023142759,0.00007323192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009989867,0.0006838252,0.00067381473,0.00027526784,0.00035164587,0.00053675176,0.0012940783,0.0007575023,0.0011701209],"category_scores_gemma":[0.0026209247,0.00035966272,0.0003380505,0.00023688626,0.00082386564,0.00079107156,0.0009628953,0.0012077079,0.00018165074],"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.000047159374,0.00004446335,0.00053535076,0.000032954435,0.000022928934,0.00006166677,0.00006930379,0.972962,0.0024808408,0.005693467,0.00044918302,0.017600631],"study_design_scores_gemma":[0.0000038866597,0.000013843116,0.000020923722,0.0000012047431,0.0000025121817,0.000004188949,0.000002671889,0.99891317,0.00014487586,0.00083229056,0.00005893328,0.0000015193838],"about_ca_topic_score_codex":0.004598218,"about_ca_topic_score_gemma":0.0042340998,"teacher_disagreement_score":0.004598218,"about_ca_system_score_codex":0.00081806607,"about_ca_system_score_gemma":0.001149696,"threshold_uncertainty_score":0.009142935},"labels":[],"label_agreement":null},{"id":"W7104471027","doi":"10.71781/10391","title":"An exploration of approximation chains","year":2024,"lang":"en","type":"dissertation","venue":"Open MIND","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Domain (mathematical analysis); Maxim; Term (time)","score_opus":0.06472505183648569,"score_gpt":0.3530334898551882,"score_spread":0.2883084380187025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104471027","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.07026355,0.0073538325,0.77388036,0.0054780147,0.00036208826,0.000104946914,0.00052057806,0.00033786212,0.1416987],"genre_scores_gemma":[0.78122973,0.009316334,0.15247045,0.0008872712,0.0006251652,0.0003531183,0.00077204884,0.0004908911,0.05385498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976968,0.0008857688,0.00010794197,0.00041160424,0.00059741037,0.00030042813],"domain_scores_gemma":[0.9891209,0.0073564816,0.0007310906,0.0012249653,0.001068506,0.00049809855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030981326,0.0007517494,0.0011809326,0.0022426245,0.0019908936,0.0045229234,0.0016063328,0.002046356,0.019915065],"category_scores_gemma":[0.018127657,0.00072224665,0.0017971412,0.0024866266,0.0031533106,0.0064934692,0.0039519914,0.0033853115,0.0019455715],"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.000029282664,0.0000091589,0.00038201682,0.00007180424,0.000012828836,0.00004558352,0.00019473235,0.013422732,0.0002237249,0.9765182,0.0009778022,0.008111996],"study_design_scores_gemma":[0.000012771027,0.000034181507,0.0001649388,0.000097279095,0.000014232105,0.000072643874,0.000094158895,0.10611284,0.00025043107,0.8827159,0.010417988,0.000012628043],"about_ca_topic_score_codex":0.0037637684,"about_ca_topic_score_gemma":0.002073408,"teacher_disagreement_score":0.019915065,"about_ca_system_score_codex":0.003561429,"about_ca_system_score_gemma":0.0017614757,"threshold_uncertainty_score":0.066622555},"labels":[],"label_agreement":null},{"id":"W7131063257","doi":"10.1109/iccvw69036.2025.00671","title":"Tuning-Free Multi-Event Long Video Generation via Synchronized Coupled Sampling","year":2025,"lang":"","type":"article","venue":"","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Coherence (philosophical gambling strategy); Sampling (signal processing); Noise reduction; Consistency (knowledge bases); Inference; Focus (optics); Video denoising; Synchronization (alternating current); Baseline (sea)","score_opus":0.035060471458330085,"score_gpt":0.3052437598808508,"score_spread":0.2701832884225207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7131063257","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.014270226,0.000098263146,0.98376715,0.00007196329,0.000023078124,0.00005032239,0.000056688456,0.0008990428,0.0007633098],"genre_scores_gemma":[0.5397849,0.00016202775,0.45580918,0.00020477323,0.000063577754,0.00018679824,0.0004913088,0.00043160262,0.0028658682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992204,0.00019985174,0.000030319115,0.00024607868,0.00024421889,0.000059154427],"domain_scores_gemma":[0.9979582,0.0012127642,0.00015228931,0.0002611307,0.0002968402,0.0001187641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015375466,0.00086140825,0.0006792872,0.0004578051,0.00037393768,0.00073612895,0.001800584,0.00087760034,0.0017066932],"category_scores_gemma":[0.0061799525,0.00054300367,0.0005570146,0.0004594732,0.0005949884,0.001340872,0.0014893252,0.0011854719,0.0004867314],"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.0006758661,0.00023258824,0.0032086144,0.00016441137,0.00012858446,0.00028941204,0.0004212346,0.5937065,0.047069162,0.01855165,0.00444179,0.3311101],"study_design_scores_gemma":[0.000016634425,0.000023572586,0.00015758406,0.000002966042,0.0000069413536,0.000023708171,0.000012967068,0.9921327,0.0040861624,0.0029663,0.00056313776,0.000007321469],"about_ca_topic_score_codex":0.0054812236,"about_ca_topic_score_gemma":0.00785648,"teacher_disagreement_score":0.0054812236,"about_ca_system_score_codex":0.0007578788,"about_ca_system_score_gemma":0.00088265265,"threshold_uncertainty_score":0.01089859},"labels":[],"label_agreement":null},{"id":"W79764082","doi":"10.1007/978-1-4614-7085-4_11","title":"Optimal Coding and Control for Linear Gaussian Systems Over Gaussian Channels Under Quadratic Cost","year":2013,"lang":"en","type":"book-chapter","venue":"Systems & control","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Gaussian; Linear-quadratic-Gaussian control; Quadratic equation; Coding (social sciences); Mathematics; Computer science; Control (management); Mathematical optimization; Applied mathematics; Control theory (sociology); Optimal control; Statistics; Physics; Artificial intelligence; Geometry; Quantum mechanics","score_opus":0.02073049868951634,"score_gpt":0.2463522751478801,"score_spread":0.22562177645836376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79764082","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.011201837,0.0024259335,0.9666858,0.00066070544,0.00011805377,0.000036960086,0.00011680109,0.000091391026,0.01866251],"genre_scores_gemma":[0.80192095,0.008630827,0.1457349,0.00040996034,0.0008224729,0.000310388,0.00035365977,0.00016720017,0.04164969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926955,0.00019934609,0.000032422842,0.00010821589,0.00028247834,0.00010805667],"domain_scores_gemma":[0.9989556,0.00072581245,0.00007136557,0.000070962444,0.00015599364,0.00002026853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001068233,0.0010235879,0.0009235307,0.00043275979,0.00036845985,0.0014691281,0.0008816431,0.0011315035,0.0030296347],"category_scores_gemma":[0.0027751036,0.0004044335,0.00047307875,0.0010916392,0.0020457094,0.0017084668,0.0012336576,0.0020187795,0.00047498243],"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.0000647058,0.000030243584,0.00012169013,0.00015134056,0.000031475236,0.000050943778,0.00017223337,0.42413113,0.0023800018,0.5084274,0.0037995358,0.060639292],"study_design_scores_gemma":[0.00001506524,0.000031228617,0.00010915962,0.000033019307,0.0000078372395,0.00003004106,0.000026560923,0.7641311,0.00061156513,0.23324881,0.0017353294,0.00002030051],"about_ca_topic_score_codex":0.0061287414,"about_ca_topic_score_gemma":0.004144795,"teacher_disagreement_score":0.0061287414,"about_ca_system_score_codex":0.0016255295,"about_ca_system_score_gemma":0.001538177,"threshold_uncertainty_score":0.01218611},"labels":[],"label_agreement":null},{"id":"W925244956","doi":"10.1007/978-3-319-17470-9_13","title":"Limited View Adversary Codes: Bounds, Constructions and Applications","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"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 Calgary","funders":"","keywords":"Code word; Computer science; Adversary; Adversary model; Decoding methods; Upper and lower bounds; Code (set theory); Theoretical computer science; Adversarial system; List decoding; Construct (python library); Block code; Discrete mathematics; Mathematics; Algorithm; Concatenated error correction code; Computer network; Computer security","score_opus":0.02068158502302986,"score_gpt":0.25278353363241934,"score_spread":0.23210194860938949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W925244956","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.014119013,0.011193455,0.8913961,0.0026245923,0.00043309986,0.00014190881,0.00071912043,0.00078393973,0.078588784],"genre_scores_gemma":[0.555158,0.028794108,0.34051728,0.0020542236,0.002008102,0.0014248637,0.0020084889,0.0011895751,0.06684534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961294,0.001002688,0.00012770343,0.0005526499,0.0016369907,0.0005506793],"domain_scores_gemma":[0.9824975,0.012384134,0.0007593465,0.0025734704,0.0012726792,0.0005129257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031906564,0.0024774228,0.0021881869,0.0029343576,0.0020568203,0.0063603153,0.0038215707,0.002611912,0.00996166],"category_scores_gemma":[0.015712976,0.0014523164,0.0016418908,0.0052407533,0.0046656583,0.0097417785,0.007217823,0.009622194,0.004979207],"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.00014595043,0.000077722885,0.0002814621,0.00025208236,0.00003146695,0.00009320299,0.00026781004,0.027894514,0.0021781828,0.8972414,0.01206825,0.059467897],"study_design_scores_gemma":[0.000025498268,0.00006492039,0.0001360178,0.00021099222,0.000037256123,0.0003525676,0.00007287302,0.073305346,0.0031426179,0.9085263,0.014069669,0.000055900975],"about_ca_topic_score_codex":0.0016400651,"about_ca_topic_score_gemma":0.0013451198,"teacher_disagreement_score":0.00996166,"about_ca_system_score_codex":0.0046953917,"about_ca_system_score_gemma":0.0026717326,"threshold_uncertainty_score":0.03406757},"labels":[],"label_agreement":null}]}