{"meta":{"query_hash":"8b5305c2e313","filters":{"venue":"European Transactions on Telecommunications"},"cohort_total":46,"direct_labels_cover":0,"predictions_cover":46,"exported":46,"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/8b5305c2e313","api":"https://metacan.xera.ac/api/v1/cohort?venue=European+Transactions+on+Telecommunications"},"results":[{"id":"W1903268680","doi":"10.1002/ett.1495","title":"On the error exponent of MIMO‐ARQ system over the fast fading channels","year":2011,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","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":"Fading; Hybrid automatic repeat request; Computer science; Automatic repeat request; Algorithm; Exponent; Decoding methods; Code word; Code rate; MIMO; Bit error rate; Channel (broadcasting); Electronic engineering; Mathematics; Computer network; Telecommunications; Engineering; Transmission (telecommunications)","score_opus":0.08077837576552113,"score_gpt":0.25861743510811647,"score_spread":0.17783905934259533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1903268680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4378224,0.00598196,0.5444399,0.001238735,0.0003416748,0.00006056584,0.00020844632,0.00030715662,0.009599062],"genre_scores_gemma":[0.99128,0.0010176662,0.0061926343,0.000063157204,0.00011492951,0.000025945834,0.000057047884,0.000041726296,0.0012068495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874413,0.00045423867,0.000056866294,0.0001596946,0.00041776607,0.00016727584],"domain_scores_gemma":[0.9868901,0.0094696805,0.0012069283,0.0006434373,0.0016313706,0.00015841937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002063034,0.0009400065,0.00078120234,0.00090397283,0.00045222123,0.00096868863,0.0006513691,0.0007373885,0.0014446898],"category_scores_gemma":[0.013969386,0.00034662368,0.0002231894,0.000704554,0.001127385,0.0019954066,0.0009323281,0.0011273765,0.00024679318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006729876,0.0000820273,0.0063012014,0.0003146703,0.00009337129,0.0012255366,0.0007115168,0.73383796,0.03630874,0.18946755,0.0023242484,0.02866024],"study_design_scores_gemma":[0.00002151141,0.00013059887,0.0013988549,0.0000587733,0.00002802074,0.0004957997,0.000083472856,0.9702213,0.0047360803,0.022204623,0.00056293345,0.000058044436],"about_ca_topic_score_codex":0.0010858492,"about_ca_topic_score_gemma":0.000623956,"teacher_disagreement_score":0.002063034,"about_ca_system_score_codex":0.00088490563,"about_ca_system_score_gemma":0.000526316,"threshold_uncertainty_score":0.010910511},"labels":[],"label_agreement":null},{"id":"W1972491259","doi":"10.1002/ett.1470","title":"Linear combination‐based energy detection algorithm in low signal‐to‐noise ratio for cognitive radios","year":2011,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","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 Victoria","funders":"National Natural Science Foundation of China","keywords":"Cognitive radio; False alarm; Energy (signal processing); Algorithm; Computer science; Detection theory; Statistical power; SIGNAL (programming language); Noise (video); Signal-to-noise ratio (imaging); Telecommunications; Artificial intelligence; Mathematics; Wireless; Statistics; Detector","score_opus":0.02399173461659212,"score_gpt":0.23692258666705546,"score_spread":0.21293085205046333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972491259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023138588,0.00021473454,0.9750889,0.00008089429,0.000028577013,0.00003134165,0.0000075874223,0.00037015433,0.0010393292],"genre_scores_gemma":[0.6207276,0.00014455874,0.37681744,0.00016779009,0.0000645532,0.00013428251,0.000041642288,0.00004202039,0.0018601546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845076,0.0004873818,0.00007381044,0.00029741132,0.00057926995,0.00011138648],"domain_scores_gemma":[0.9985697,0.0007922538,0.00017492646,0.0001051555,0.00030526516,0.000052731433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012049163,0.0006654841,0.00082724035,0.0006876021,0.00040600027,0.0009204719,0.0010604429,0.0006393498,0.0011272293],"category_scores_gemma":[0.0034885528,0.0004354807,0.00036257954,0.00070606434,0.000630711,0.0010100069,0.0009896349,0.00080863934,0.00045986008],"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.0011548728,0.0003268442,0.0020489702,0.00019479688,0.00021087671,0.0002072503,0.00023822808,0.25801927,0.055264875,0.013010722,0.0019337455,0.6673895],"study_design_scores_gemma":[0.00003682446,0.00012812526,0.00031511136,0.0000084460635,0.00002796172,0.00012512466,0.0000117065665,0.9867584,0.009408644,0.0026445566,0.0005181841,0.00001683848],"about_ca_topic_score_codex":0.00081402564,"about_ca_topic_score_gemma":0.0009136961,"teacher_disagreement_score":0.0012049163,"about_ca_system_score_codex":0.00055806094,"about_ca_system_score_gemma":0.0006799576,"threshold_uncertainty_score":0.0063723326},"labels":[],"label_agreement":null},{"id":"W1973580796","doi":"10.1002/ett.1185","title":"Estimating the minimum distance of large‐block turbo codes using iterative multiple‐impulse methods","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication 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":"Turbo code; Algorithm; Computer science; Dither; Turbo; Impulse (physics); Minimum distance; Turbo equalizer; Concatenated error correction code; Block code; Mathematics; Decoding methods; Mathematical optimization; Telecommunications","score_opus":0.028340002372778665,"score_gpt":0.3383813975324715,"score_spread":0.3100413951596928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973580796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09343831,0.0002028832,0.9052437,0.00006228451,0.000013405573,0.000014001625,0.00002109568,0.00024290766,0.00076150894],"genre_scores_gemma":[0.60570484,0.00015283456,0.3931105,0.000018273342,0.000013247021,0.000033307137,0.00007537843,0.00006249724,0.00082909566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949634,0.00019831097,0.000026859288,0.00006282396,0.00018575306,0.000029982395],"domain_scores_gemma":[0.99599445,0.0026694292,0.000579752,0.00026860627,0.000409028,0.00007874298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010601014,0.0004590219,0.00047848493,0.0009546526,0.00029615665,0.00047618328,0.0005695066,0.0005804874,0.0006583924],"category_scores_gemma":[0.006849617,0.0003480751,0.00030985894,0.0005062198,0.0005492603,0.0011979629,0.0007319347,0.0007554344,0.0003237956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030449915,0.00006498896,0.0034172575,0.00017674544,0.00007634472,0.00014704998,0.000264504,0.80645794,0.04538208,0.023079874,0.00048704995,0.120141566],"study_design_scores_gemma":[0.000012734237,0.00005592932,0.0008813172,0.000014700707,0.0000062192357,0.000095294614,0.00001751527,0.97426546,0.018644365,0.0055831447,0.0003952725,0.000028087537],"about_ca_topic_score_codex":0.00091809913,"about_ca_topic_score_gemma":0.00088406156,"teacher_disagreement_score":0.0010601014,"about_ca_system_score_codex":0.00045917567,"about_ca_system_score_gemma":0.00080154877,"threshold_uncertainty_score":0.005606413},"labels":[],"label_agreement":null},{"id":"W1974737638","doi":"10.1002/ett.965","title":"Efficient packet data service in a spread spectrum OFDM cellular system with 2‐dimensional radio resource allocation","year":2004,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Network Optimization","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Orthogonal frequency-division multiplexing; Link adaptation; Fading; Hybrid automatic repeat request; Network packet; Spectral efficiency; Throughput; Transmission delay; Real-time computing; Telecommunications link; Wireless; Telecommunications; Channel (broadcasting)","score_opus":0.013497502702964282,"score_gpt":0.1999728325211275,"score_spread":0.1864753298181632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974737638","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.57950515,0.00027865998,0.41524982,0.00016184287,0.000035241024,0.00007046454,0.000042145697,0.0003312423,0.004325474],"genre_scores_gemma":[0.98019457,0.00005255767,0.019120412,0.000016204,0.000011708248,0.000027460084,0.000015479756,0.000003707624,0.0005579467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996668,0.00013739086,0.000010445205,0.000022449627,0.00010345213,0.00005938303],"domain_scores_gemma":[0.9996462,0.00017060233,0.000051227333,0.000032434506,0.00007847134,0.000021105556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057244045,0.00032247155,0.0002744115,0.00028048144,0.00019062895,0.0005904827,0.00023680342,0.00033896795,0.00057802256],"category_scores_gemma":[0.0013436908,0.00012414921,0.00008716654,0.00024943982,0.0002888206,0.0004080756,0.00042866098,0.00017364843,0.00012234141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057186384,0.00016462596,0.0023660865,0.000050307677,0.000034995246,0.00028729544,0.00006846393,0.86664975,0.04441347,0.012179557,0.00087941665,0.07233405],"study_design_scores_gemma":[0.000023689967,0.000106078354,0.0003755217,0.0000012839324,0.000004732001,0.000035557867,0.000009436383,0.99570954,0.0025867233,0.00082201586,0.0003212733,0.0000040351924],"about_ca_topic_score_codex":0.0007658642,"about_ca_topic_score_gemma":0.00084920076,"teacher_disagreement_score":0.0007658642,"about_ca_system_score_codex":0.00046358907,"about_ca_system_score_gemma":0.00033316124,"threshold_uncertainty_score":0.0033636093},"labels":[],"label_agreement":null},{"id":"W1978489006","doi":"10.1002/ett.1210","title":"Cohen–Merhav bounds on the symbol error rate of uncoded signalling in AWGN interference","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication 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":"Additive white Gaussian noise; Algorithm; Mathematics; Upper and lower bounds; Computer science; Bounding overwatch; Channel (broadcasting); Interference (communication); Range (aeronautics); Signalling; Bernoulli's principle; Statistics; Telecommunications; Artificial intelligence; Engineering","score_opus":0.030984777897284762,"score_gpt":0.2657665337224378,"score_spread":0.23478175582515304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978489006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019586815,0.00501002,0.96168137,0.00080705545,0.00032646448,0.000058913683,0.00023421028,0.00020604176,0.012089133],"genre_scores_gemma":[0.6970842,0.0074399817,0.2817449,0.0011593779,0.00092103815,0.0009374447,0.0005121717,0.00025950943,0.009941361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99138355,0.003227423,0.00041711042,0.00087298336,0.0030523436,0.0010467041],"domain_scores_gemma":[0.930564,0.056004453,0.0035975156,0.0036426464,0.00543652,0.0007548116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014138184,0.0030369181,0.0022030114,0.0033336736,0.0010456921,0.0036493489,0.0031747357,0.0024335796,0.004940228],"category_scores_gemma":[0.064590685,0.00083556504,0.001355585,0.0024336814,0.004483866,0.0047894428,0.0050161425,0.0045652925,0.0013200484],"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.0008476028,0.0001140193,0.001482951,0.0010437486,0.00019061942,0.00045561636,0.0005878496,0.3620715,0.01731728,0.5366004,0.0042814366,0.07500701],"study_design_scores_gemma":[0.00004481578,0.00028641985,0.00091863767,0.00033130933,0.00007362622,0.000432668,0.0000890513,0.789718,0.013437692,0.19048335,0.0040489966,0.00013540733],"about_ca_topic_score_codex":0.0011629426,"about_ca_topic_score_gemma":0.0010035789,"teacher_disagreement_score":0.014138184,"about_ca_system_score_codex":0.0033741742,"about_ca_system_score_gemma":0.0027169953,"threshold_uncertainty_score":0.07477075},"labels":[],"label_agreement":null},{"id":"W1990842717","doi":"10.1002/ett.1231","title":"Antenna combining for multi‐antenna multi‐relay channels","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","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":"Carleton University","funders":"","keywords":"Relay; Antenna (radio); Beamforming; Computer science; Maximal-ratio combining; Channel (broadcasting); Antenna diversity; Constraint (computer-aided design); Topology (electrical circuits); Power (physics); Electronic engineering; Diversity gain; Telecommunications; Computer network; Electrical engineering; MIMO; Mathematics; Engineering; Fading; Physics","score_opus":0.09208213444534645,"score_gpt":0.32128555549961807,"score_spread":0.2292034210542716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990842717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17283048,0.002829265,0.7997632,0.00042237842,0.000096091535,0.00004876267,0.000103831175,0.00043120264,0.02347488],"genre_scores_gemma":[0.97971755,0.0006952887,0.017105823,0.000069712085,0.000055787594,0.000039673807,0.000033675602,0.000033770444,0.0022487515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985909,0.00060449727,0.000028243365,0.00012569096,0.0004160291,0.00023460093],"domain_scores_gemma":[0.9963503,0.0025386098,0.00043701156,0.0002696451,0.00033970122,0.000064751555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012086952,0.0010976436,0.0009402363,0.0004910497,0.00039835888,0.0013225544,0.00063590746,0.00088342035,0.0025285375],"category_scores_gemma":[0.0031450118,0.00035120096,0.0007390449,0.0008976442,0.0010421969,0.0012083965,0.00091028726,0.0008372822,0.0005802645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011569738,0.000020261814,0.00034657767,0.000055512584,0.00006828281,0.00015884332,0.00004844609,0.9652905,0.0073712673,0.016596688,0.00037965752,0.009548194],"study_design_scores_gemma":[0.000009994668,0.000086067004,0.00022995214,0.000009848221,0.000030509314,0.00010624552,0.000016643608,0.98837376,0.0033509172,0.0072607026,0.00051088224,0.000014473601],"about_ca_topic_score_codex":0.00087224244,"about_ca_topic_score_gemma":0.00055198936,"teacher_disagreement_score":0.0025285375,"about_ca_system_score_codex":0.0010026657,"about_ca_system_score_gemma":0.00033305262,"threshold_uncertainty_score":0.008458853},"labels":[],"label_agreement":null},{"id":"W1994721667","doi":"10.1002/ett.1411","title":"Performance analysis of best‐path selection scheme for multi‐hop amplify‐and‐forward relaying","year":2010,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"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":"Memorial University of Newfoundland","keywords":"Cumulative distribution function; Rayleigh fading; Probability density function; Outage probability; Path loss; Fading; Channel (broadcasting); Moment-generating function; Expression (computer science); Channel capacity; Probability of error; Mathematics; Computer science; Selection (genetic algorithm); Statistics; Topology (electrical circuits); Hop (telecommunications); Closed-form expression; Algorithm; Telecommunications; Wireless; Combinatorics; Mathematical analysis","score_opus":0.05175647231645616,"score_gpt":0.3003629027905945,"score_spread":0.24860643047413836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994721667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4348683,0.002746151,0.55181783,0.00052972935,0.00006939726,0.0000714176,0.00014152395,0.0004798756,0.009275719],"genre_scores_gemma":[0.9906241,0.0003735942,0.008204557,0.000023285615,0.000016630196,0.000015254747,0.000029078969,0.000014683364,0.0006988316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982868,0.0007303513,0.00005052339,0.0001458677,0.0005754612,0.00021087824],"domain_scores_gemma":[0.99455196,0.003827932,0.00045159584,0.00029315535,0.0007987863,0.000076635486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023191485,0.00089637376,0.000826003,0.00070069404,0.0005859302,0.0011879327,0.00063641224,0.0008276677,0.0010326476],"category_scores_gemma":[0.006337588,0.00029091787,0.00038960885,0.0005835112,0.0010571309,0.0009017289,0.00089566596,0.0004895299,0.00020490722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000398045,0.00005913533,0.002424099,0.00017812065,0.00011833131,0.0005145225,0.00030191007,0.9091227,0.026678687,0.031223295,0.00069671747,0.028284468],"study_design_scores_gemma":[0.000010261979,0.00009757236,0.00051122357,0.000013115473,0.000027804463,0.00017427013,0.000037474594,0.991683,0.0045707966,0.0026581527,0.00019933065,0.000016968635],"about_ca_topic_score_codex":0.002962409,"about_ca_topic_score_gemma":0.0026227215,"teacher_disagreement_score":0.002962409,"about_ca_system_score_codex":0.0014800203,"about_ca_system_score_gemma":0.0009871564,"threshold_uncertainty_score":0.012264967},"labels":[],"label_agreement":null},{"id":"W1996462199","doi":"10.1002/ett.4460120210","title":"QoS degradation in cellular systems due to H/O hysteresis","year":2001,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Power Line Communications and Noise","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":"Nortel (Canada)","funders":"","keywords":"Unavailability; Handover; Hysteresis; Degradation (telecommunications); Computer science; Quality of service; Channel (broadcasting); Computer network; Control theory (sociology); Reliability engineering; Engineering; Telecommunications; Physics","score_opus":0.020743905852119087,"score_gpt":0.22241930142786098,"score_spread":0.2016753955757419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996462199","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.9738887,0.00025253976,0.0241785,0.000072959796,0.000014649686,0.0000064176493,0.000013456493,0.00011395991,0.001458755],"genre_scores_gemma":[0.99974304,0.000022105667,0.00017032282,0.0000042729034,0.0000030613899,4.7109575e-7,0.0000015442599,0.0000011689035,0.00005398982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998578,0.000029902872,0.000004685199,0.000014395772,0.0000439152,0.000049334707],"domain_scores_gemma":[0.99914455,0.0005136064,0.00014690841,0.000042641175,0.00010027268,0.00005198978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000305711,0.00016075047,0.0001818067,0.00021093937,0.00024933735,0.0003678984,0.0001525983,0.00025676104,0.0006627237],"category_scores_gemma":[0.0016820248,0.00009068445,0.000079526435,0.00018408203,0.0005340353,0.00029536797,0.00026212208,0.00020847181,0.00005682023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012453684,0.00014610623,0.036190707,0.00018728519,0.00008160112,0.002586137,0.0004339676,0.6601446,0.22912033,0.00887998,0.00091393985,0.060069945],"study_design_scores_gemma":[0.00003042785,0.00016593529,0.011023897,0.000008874158,0.000022691642,0.00038092787,0.00016363744,0.96668,0.0182983,0.0028619238,0.00034786353,0.000015552443],"about_ca_topic_score_codex":0.001407652,"about_ca_topic_score_gemma":0.00073489605,"teacher_disagreement_score":0.001407652,"about_ca_system_score_codex":0.0003924404,"about_ca_system_score_gemma":0.0001587214,"threshold_uncertainty_score":0.0028473139},"labels":[],"label_agreement":null},{"id":"W1997392592","doi":"10.1002/ett.4460120412","title":"Using array signal processing to improve rural area coverage for satellite communications services","year":2001,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Satellite Communication Systems","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":true,"ca_institutions":"Nokia (Canada); Queen's University","funders":"","keywords":"Reflector (photography); Payload (computing); Geostationary orbit; Computer science; Interference (communication); Communications satellite; Electronic engineering; Automatic gain control; Antenna (radio); Parabolic antenna; Satellite; Signal processing; Antenna array; Telecommunications; Engineering; Digital signal processing; Optics; Physics; Aerospace engineering; Computer network","score_opus":0.04858372184357386,"score_gpt":0.2802061869938275,"score_spread":0.23162246515025364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997392592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30226046,0.00047223264,0.68760884,0.0002801032,0.000049049737,0.000038645212,0.00007943144,0.0010208789,0.008190376],"genre_scores_gemma":[0.8796318,0.00031623794,0.116416804,0.00012406214,0.000097921715,0.000029404011,0.00017209348,0.000059894493,0.0031517122],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985874,0.00004320909,0.000004856051,0.000027457249,0.000037200498,0.000028454198],"domain_scores_gemma":[0.99974877,0.00012441394,0.000033135868,0.000020220654,0.00006231341,0.000011124759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015544117,0.00034547085,0.00020315946,0.0003453755,0.00017654554,0.0002863412,0.00024458912,0.00027799676,0.002811693],"category_scores_gemma":[0.0006794167,0.00012346661,0.00015658619,0.00037909206,0.00015610794,0.00040267463,0.00037075893,0.00020147464,0.0007684946],"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.00054608105,0.00016949422,0.0043012556,0.000089818415,0.00007007424,0.00020132527,0.00010395785,0.1584308,0.42273265,0.0030433785,0.002153312,0.40815777],"study_design_scores_gemma":[0.00006770419,0.00079286477,0.0064703007,0.00001560906,0.00010243543,0.00036100863,0.00010781967,0.84330636,0.138554,0.0024035855,0.00779482,0.000023534367],"about_ca_topic_score_codex":0.00057680934,"about_ca_topic_score_gemma":0.0012749704,"teacher_disagreement_score":0.002811693,"about_ca_system_score_codex":0.0001382819,"about_ca_system_score_gemma":0.00015225397,"threshold_uncertainty_score":0.00940609},"labels":[],"label_agreement":null},{"id":"W1998932429","doi":"10.1002/ett.1279","title":"Novel DLC model for QoS enhancement of bursty VBR traffic in wireless ATM networks","year":2008,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Network Traffic and Congestion Control","field":"Computer Science","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":"DOD Prostate Cancer Research Program","keywords":"Variable bitrate; Computer science; Quality of service; Computer network; Wireless; Asynchronous Transfer Mode; Data transmission; Transmission (telecommunications); Constant bitrate; Real-time computing; Telecommunications","score_opus":0.03266858112907921,"score_gpt":0.23853188765095434,"score_spread":0.20586330652187512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998932429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049848385,0.00054833037,0.9365552,0.00082591514,0.00012977952,0.00012378524,0.0001350365,0.00038068515,0.011452915],"genre_scores_gemma":[0.9516533,0.00038800848,0.041909453,0.00021211714,0.00010599158,0.00018369115,0.000091274655,0.000069924805,0.00538624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999303,0.00022144806,0.000026471691,0.00011019137,0.0002263826,0.00011262025],"domain_scores_gemma":[0.99893504,0.00049900106,0.00013320205,0.00007267087,0.00028764288,0.0000724015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010881061,0.0007441903,0.00062741106,0.0008094238,0.0005528498,0.0013940744,0.0017097684,0.0015020367,0.0019549541],"category_scores_gemma":[0.0021620854,0.0002940718,0.0004529367,0.0004996027,0.0009315521,0.0014650502,0.0009375214,0.0014390723,0.00027742513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006553088,0.00007972001,0.00038998714,0.000059601538,0.000015577929,0.00015687483,0.00009930498,0.8942792,0.007127448,0.08795686,0.0012858161,0.008484174],"study_design_scores_gemma":[0.0000033585682,0.0000048700654,0.000011120306,0.0000014123679,0.0000016826402,0.0000066864613,0.0000022290278,0.9979371,0.00014455344,0.0017128757,0.00017233744,0.000001907434],"about_ca_topic_score_codex":0.005584113,"about_ca_topic_score_gemma":0.0021855554,"teacher_disagreement_score":0.005584113,"about_ca_system_score_codex":0.0023331305,"about_ca_system_score_gemma":0.0010726302,"threshold_uncertainty_score":0.016928136},"labels":[],"label_agreement":null},{"id":"W2003155084","doi":"10.1002/ett.1196","title":"Adaptive modulation over nonlinear time‐varying channels","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Network Optimization","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":"Link adaptation; Modulation (music); Computer science; Nonlinear system; Quadrature amplitude modulation; Transmission (telecommunications); Bit error rate; Control theory (sociology); Channel (broadcasting); Electronic engineering; Amplifier; QAM; Telecommunications; Bandwidth (computing); Physics; Engineering; Fading; Artificial intelligence; Acoustics","score_opus":0.014004055658360196,"score_gpt":0.22919663707628665,"score_spread":0.21519258141792647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003155084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25360572,0.0004823507,0.7371448,0.00024829534,0.00009421888,0.00003753831,0.0000323979,0.0002007156,0.00815382],"genre_scores_gemma":[0.9710488,0.00018960405,0.026276555,0.00005044936,0.00006916125,0.000017132803,0.00001447669,0.000006105196,0.0023278112],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998301,0.000048657887,0.0000061263418,0.000028793727,0.0000647361,0.000021596214],"domain_scores_gemma":[0.9996482,0.00014158007,0.000065397035,0.000047485653,0.000079231984,0.000018047773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001694791,0.000285294,0.00018741586,0.00014518957,0.00019821576,0.0002166056,0.00036984676,0.00026119803,0.00091227423],"category_scores_gemma":[0.0007321523,0.00006335311,0.00013165073,0.00019305572,0.00047101342,0.0003971864,0.0003773826,0.0003376276,0.00020158803],"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.00071919244,0.000089921945,0.002580486,0.0001919733,0.00008182476,0.00041610864,0.00018759386,0.36443818,0.4120447,0.041375104,0.0010371488,0.17683774],"study_design_scores_gemma":[0.000034880275,0.0001839609,0.0010611783,0.000009414365,0.000022055432,0.0002022343,0.000014589127,0.95971614,0.029905207,0.0064004743,0.002430194,0.00001978032],"about_ca_topic_score_codex":0.00050678663,"about_ca_topic_score_gemma":0.0005451756,"teacher_disagreement_score":0.00091227423,"about_ca_system_score_codex":0.00021664092,"about_ca_system_score_gemma":0.00013106516,"threshold_uncertainty_score":0.003051877},"labels":[],"label_agreement":null},{"id":"W2007082708","doi":"10.1002/ett.1168","title":"E‐model based comparison of multiple description coding and layered coding in packet networks","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","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":"Automatic repeat request; Network packet; Hybrid automatic repeat request; Packet loss; Go-Back-N ARQ; Computer science; Coding (social sciences); Selective Repeat ARQ; Computer network; Real-time computing; Algorithm; Mathematics; Statistics","score_opus":0.083164908306086,"score_gpt":0.3031603996088944,"score_spread":0.2199954913028084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007082708","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.58036464,0.0020406274,0.4078723,0.00074405206,0.00014794455,0.00013408253,0.00020770813,0.00057240116,0.007916251],"genre_scores_gemma":[0.98139155,0.00025070817,0.017652785,0.00006405718,0.000011643073,0.00002776835,0.00011384827,0.00002100335,0.0004667216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752825,0.0012685556,0.00007754115,0.00009059844,0.0007739111,0.0002611843],"domain_scores_gemma":[0.9765543,0.018557323,0.0008055212,0.0012169748,0.0025467116,0.0003192609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061056125,0.0005866698,0.00063458463,0.0008543867,0.00034090775,0.0012705759,0.00087456184,0.0011017428,0.0010112595],"category_scores_gemma":[0.021249995,0.00019998371,0.00037945437,0.00081473216,0.00091338006,0.0023734018,0.0016798851,0.00075270125,0.00015434145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011796849,0.00013647584,0.0017108985,0.00009431108,0.00008210887,0.00005931109,0.000042568077,0.93885916,0.00457965,0.012108784,0.00041583058,0.04073121],"study_design_scores_gemma":[0.000019340583,0.00023207958,0.0002765507,0.000008001406,0.000015440479,0.000024289637,0.0000149634425,0.99364024,0.0034236507,0.0022262074,0.00010218433,0.000016953956],"about_ca_topic_score_codex":0.005251573,"about_ca_topic_score_gemma":0.0024976304,"teacher_disagreement_score":0.0061056125,"about_ca_system_score_codex":0.0016799961,"about_ca_system_score_gemma":0.0012916711,"threshold_uncertainty_score":0.03228998},"labels":[],"label_agreement":null},{"id":"W2007938807","doi":"10.1002/ett.974","title":"Joint compensation of IQ imbalance, frequency offset and phase noise in OFDM receivers","year":2004,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Radio Frequency Integrated Circuit Design","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":"Nexen (Canada)","funders":"","keywords":"Orthogonal frequency-division multiplexing; Phase noise; Carrier frequency offset; Offset (computer science); Compensation (psychology); Computer science; Frequency offset; Electronic engineering; Joint (building); Noise (video); Telecommunications; Engineering; Artificial intelligence","score_opus":0.021770736053212857,"score_gpt":0.23292423110853688,"score_spread":0.21115349505532402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007938807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12913603,0.00030212142,0.86772245,0.00018116475,0.00004439019,0.00002483554,0.000013180612,0.000451641,0.0021242083],"genre_scores_gemma":[0.8845598,0.00019993221,0.11295411,0.00003684342,0.00006319095,0.00001559867,0.000026367945,0.000041637573,0.0021024775],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993641,0.00017223727,0.00002486859,0.00005982649,0.0003096058,0.00006938994],"domain_scores_gemma":[0.9994808,0.00023475802,0.0001032663,0.000042656906,0.00011975674,0.000018750658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072220946,0.0005258291,0.00042556034,0.00038311625,0.00027022604,0.0006208553,0.0004304151,0.00063780096,0.0006606322],"category_scores_gemma":[0.0016924613,0.00026585767,0.00020716937,0.00033964726,0.0004690161,0.0007419272,0.00035013552,0.0004008099,0.00029001205],"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.0009744777,0.00018728903,0.0077412166,0.00021412529,0.00013169037,0.00047372692,0.0003641041,0.31149626,0.38780928,0.029527366,0.001163503,0.25991693],"study_design_scores_gemma":[0.000039888688,0.00020936766,0.00093140017,0.000022237973,0.000051051993,0.00032861021,0.000025379348,0.8913049,0.10232934,0.00338942,0.0013477097,0.000020689164],"about_ca_topic_score_codex":0.0006693645,"about_ca_topic_score_gemma":0.0010680382,"teacher_disagreement_score":0.00072220946,"about_ca_system_score_codex":0.00050550833,"about_ca_system_score_gemma":0.00052043144,"threshold_uncertainty_score":0.0038194656},"labels":[],"label_agreement":null},{"id":"W2017532877","doi":"10.1002/ett.1429","title":"Covariance precoding schemes for MIMO OFDM over transmit‐antenna and path‐correlated channels","year":2010,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication 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":"Spinal Cord Injury Alberta; University of Alberta","funders":"","keywords":"Precoding; Orthogonal frequency-division multiplexing; Pairwise error probability; MIMO; MIMO-OFDM; Computer science; Covariance; Bit error rate; Algorithm; Control theory (sociology); Transmitter; Mathematics; Telecommunications; Statistics; Decoding methods; Beamforming; Artificial intelligence","score_opus":0.013764648938588727,"score_gpt":0.24299615483893966,"score_spread":0.22923150590035093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017532877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049816146,0.00040795622,0.94605243,0.00017915119,0.000044097338,0.000028615244,0.00004183685,0.00011022752,0.0033195722],"genre_scores_gemma":[0.88785475,0.00050952606,0.10864548,0.00009428458,0.000074951175,0.000049716713,0.00006153826,0.00002014642,0.0026895718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993943,0.00020217274,0.000023607563,0.000065557244,0.00023661806,0.0000778271],"domain_scores_gemma":[0.99888366,0.0005787062,0.00015681796,0.00013040588,0.00022539271,0.000025022218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006008596,0.00045689938,0.0004228282,0.00017123438,0.0003169505,0.00057345786,0.0005044121,0.0004054298,0.0008598648],"category_scores_gemma":[0.0026365723,0.00024093763,0.00030926132,0.00044885694,0.0006491845,0.0005473637,0.00051584386,0.00051004835,0.0002378522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022753877,0.00009351879,0.0012933186,0.00013083148,0.000093535375,0.00033482158,0.00020475374,0.7022294,0.031321187,0.08910481,0.0017255591,0.17324081],"study_design_scores_gemma":[0.000013931795,0.00006151888,0.00031778947,0.000009966866,0.000015604848,0.000094312076,0.000015126542,0.9855435,0.005295734,0.007772523,0.00084846106,0.000011626162],"about_ca_topic_score_codex":0.002159953,"about_ca_topic_score_gemma":0.0035909195,"teacher_disagreement_score":0.002159953,"about_ca_system_score_codex":0.0005322881,"about_ca_system_score_gemma":0.0009715187,"threshold_uncertainty_score":0.004294753},"labels":[],"label_agreement":null},{"id":"W2036282249","doi":"10.1002/ett.1269","title":"Two‐stage detection of partitioned random CDMA","year":2008,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Communication Networks Research","field":"Computer Science","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 Alberta","funders":"","keywords":"Code division multiple access; Asynchronous communication; Multiuser detection; Computer science; Transmission (telecommunications); Single antenna interference cancellation; Algorithm; Interference (communication); Maximum a posteriori estimation; Decoding methods; Electronic engineering; Mathematics; Telecommunications; Channel (broadcasting); Statistics; Maximum likelihood; Engineering","score_opus":0.04235289316292023,"score_gpt":0.2772319239691823,"score_spread":0.23487903080626205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036282249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13677669,0.00017280111,0.85869473,0.00009802149,0.00003154084,0.000036554153,0.000031753374,0.00038808555,0.0037697894],"genre_scores_gemma":[0.8740498,0.00011928638,0.12224253,0.00007177111,0.000034681354,0.00004191401,0.000054337885,0.000033361834,0.0033524092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988906,0.00038274899,0.000028092894,0.00013962574,0.00041992776,0.00013897612],"domain_scores_gemma":[0.998211,0.00092425256,0.00020021958,0.00022959712,0.00039241437,0.00004240628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006750623,0.00057640707,0.00052524055,0.00031915915,0.00021758591,0.00085941434,0.0006921313,0.00056362216,0.0013037267],"category_scores_gemma":[0.002727027,0.00038120378,0.00029371455,0.00029905187,0.0005593376,0.00068310904,0.00073379173,0.0003950615,0.00045241177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014220831,0.00017570784,0.0021778953,0.00022509153,0.00012208853,0.0006994666,0.00033811934,0.48422655,0.2666707,0.07935331,0.0014528546,0.16313623],"study_design_scores_gemma":[0.000035015983,0.00013035203,0.00027099147,0.0000073365436,0.000013767071,0.00017320165,0.000010828304,0.9712362,0.022867864,0.004530874,0.0007086779,0.0000149016605],"about_ca_topic_score_codex":0.00063830597,"about_ca_topic_score_gemma":0.0006484159,"teacher_disagreement_score":0.0013037267,"about_ca_system_score_codex":0.00045182678,"about_ca_system_score_gemma":0.00046217363,"threshold_uncertainty_score":0.004361391},"labels":[],"label_agreement":null},{"id":"W2041772334","doi":"10.1002/ett.1245","title":"Channel estimation for chip‐level Alamouti coded multi‐rate CDMA: blind subspace algorithms and performance analysis","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Space–time block code; Algorithm; Subspace topology; Channel (broadcasting); Code division multiple access; Block code; Computer science; Mathematics; Statistics; Telecommunications; Decoding methods; Artificial intelligence","score_opus":0.07966493314840496,"score_gpt":0.3228653944428553,"score_spread":0.24320046129445033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041772334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037739612,0.00031899454,0.9604078,0.0001140199,0.000011925259,0.000021468946,0.000023105595,0.00018283672,0.0011801269],"genre_scores_gemma":[0.7406207,0.0004954581,0.2566735,0.000071448194,0.00004549452,0.000078392404,0.00013900787,0.00004759489,0.0018284466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987979,0.000570456,0.000040830182,0.000097623015,0.00038866082,0.000104511906],"domain_scores_gemma":[0.9922976,0.005772857,0.0004719696,0.00043171766,0.00094065064,0.00008521358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020968744,0.0005317894,0.0005869136,0.0005444135,0.00031871552,0.00081771536,0.00041260023,0.0008537703,0.00094276096],"category_scores_gemma":[0.011177462,0.00025191807,0.00028722544,0.0005717894,0.0010006732,0.0009795938,0.0009803392,0.0007815463,0.00035594014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023490656,0.000055933448,0.0011912724,0.00012998245,0.00006498462,0.000045029206,0.00010240104,0.887102,0.009947774,0.02538176,0.0005682598,0.075175546],"study_design_scores_gemma":[0.000004848375,0.00001913784,0.00016734695,0.0000046319406,0.0000035151181,0.000021234428,0.000008015184,0.99509025,0.002321023,0.0022577294,0.00009583588,0.0000064551386],"about_ca_topic_score_codex":0.0026699163,"about_ca_topic_score_gemma":0.0016439353,"teacher_disagreement_score":0.0026699163,"about_ca_system_score_codex":0.00050704007,"about_ca_system_score_gemma":0.001059692,"threshold_uncertainty_score":0.011089504},"labels":[],"label_agreement":null},{"id":"W2043859521","doi":"10.1002/ett.1133","title":"The input–output weight enumeration of binary Hamming codes","year":2006,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication 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 Alberta","funders":"České Vysoké Učení Technické v Praze","keywords":"Hamming(7,4); Hamming graph; Hamming bound; Hamming code; Antipodal point; Hamming weight; Linear code; Algorithm; Hamming distance; Hamming space; Mathematics; Block code; Enumeration; Coding gain; Binary number; Discrete mathematics; Computer science; Decoding methods; Arithmetic","score_opus":0.009488280066091774,"score_gpt":0.21749413280186278,"score_spread":0.208005852735771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043859521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20088838,0.00030833887,0.7813886,0.00019963959,0.000083494124,0.0000831997,0.00026040917,0.0004434219,0.01634446],"genre_scores_gemma":[0.7670797,0.00024809566,0.22465865,0.000093921466,0.00003596814,0.00012835988,0.00040245618,0.00014821732,0.00720464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930394,0.00017442965,0.000045813016,0.000068744244,0.00029919375,0.000107761436],"domain_scores_gemma":[0.99899405,0.0004917049,0.000091256836,0.000147472,0.0002373229,0.000038219478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005703062,0.00036015804,0.00028184752,0.0007615812,0.00039705733,0.0010413493,0.000538376,0.0004395401,0.0030869362],"category_scores_gemma":[0.0038411587,0.00019070822,0.0002557032,0.0006027375,0.00058955816,0.0012060025,0.0009112552,0.0005905944,0.0008603762],"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.0003238533,0.000074829084,0.0013843561,0.00017450811,0.000024238416,0.00014839054,0.00018735115,0.09811796,0.049062315,0.67689294,0.0019704744,0.17163879],"study_design_scores_gemma":[0.000041005143,0.00009993718,0.0006305093,0.00007345738,0.000018297545,0.00020033465,0.00003528411,0.57952845,0.06830877,0.3451703,0.0058513824,0.000042342024],"about_ca_topic_score_codex":0.0006460435,"about_ca_topic_score_gemma":0.0007417992,"teacher_disagreement_score":0.0030869362,"about_ca_system_score_codex":0.00052077905,"about_ca_system_score_gemma":0.000669517,"threshold_uncertainty_score":0.010326803},"labels":[],"label_agreement":null},{"id":"W2047300650","doi":"10.1002/ett.1137","title":"Performance of collaborative codes in CSMA/CD environment","year":2006,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","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 Victoria","funders":"","keywords":"Carrier sense multiple access with collision avoidance; Computer science; Throughput; Network packet; Markov chain; Computer network; Channel (broadcasting); Distributed coordination function; Access control; Channel access method; Protocol (science); Collision; Scheme (mathematics); Wireless; Computer security; Mathematics; IEEE 802.11; Telecommunications","score_opus":0.007750151187723384,"score_gpt":0.1959455362840515,"score_spread":0.18819538509632813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047300650","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.8245581,0.00048543134,0.17045556,0.0001458134,0.00009670758,0.000051212122,0.00004410288,0.00067163527,0.0034914548],"genre_scores_gemma":[0.9928934,0.0000324199,0.0065463404,0.000015437497,0.00000661616,0.000012003809,0.000014213825,0.000008269436,0.0004711648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977457,0.0005587864,0.00007150715,0.00028006037,0.0008822039,0.00046178995],"domain_scores_gemma":[0.98697364,0.0071598166,0.0011031695,0.0014888606,0.0027115536,0.0005629591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002408545,0.0006145255,0.0005936125,0.00067795435,0.0007042932,0.0009464893,0.00081837794,0.0012062237,0.0008895065],"category_scores_gemma":[0.010393507,0.00023607504,0.00027111766,0.0005892077,0.00095265097,0.00086412975,0.0011239435,0.00060106494,0.00019591945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028470168,0.0004236655,0.006661578,0.00014972543,0.0001715105,0.000317966,0.00028871506,0.8629719,0.04761642,0.015788713,0.001027011,0.061735805],"study_design_scores_gemma":[0.000052934705,0.0003998588,0.00064659363,0.0000055204014,0.000025661444,0.0001032798,0.00003056313,0.9782218,0.018425323,0.0017934525,0.00027030666,0.000024648216],"about_ca_topic_score_codex":0.0060906936,"about_ca_topic_score_gemma":0.0023773941,"teacher_disagreement_score":0.0060906936,"about_ca_system_score_codex":0.00094355986,"about_ca_system_score_gemma":0.0011698517,"threshold_uncertainty_score":0.012737751},"labels":[],"label_agreement":null},{"id":"W2052181728","doi":"10.1002/ett.1059","title":"Reinforcement‐learning‐based self‐organisation for cell configuration in multimedia mobile networks","year":2005,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Communication Networks Research","field":"Computer Science","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":"National Science Council","keywords":"Reinforcement learning; Computer science; Computer network; Scheme (mathematics); Cellular network; Code division multiple access; Power control; Call Admission Control; Resource allocation; Wireless network; Code (set theory); Wireless; Distributed computing; Multimedia; Power (physics); Telecommunications; Artificial intelligence","score_opus":0.017929256479224824,"score_gpt":0.26536151849615647,"score_spread":0.24743226201693164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052181728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18931885,0.00024375215,0.8068085,0.00023848152,0.00004356752,0.000056755714,0.000013827883,0.00030644418,0.002969866],"genre_scores_gemma":[0.9815922,0.000036187008,0.017595695,0.000032295095,0.000012589623,0.000031101044,0.000009416962,0.000007994244,0.00068252435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997019,0.0001336916,0.000012332695,0.000042134776,0.000055847733,0.00005408015],"domain_scores_gemma":[0.99845004,0.00082151947,0.00025429335,0.00012199291,0.00022592054,0.00012631789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090692553,0.0003234886,0.0004804007,0.00020976087,0.00029092675,0.00038166504,0.0007384996,0.0005559921,0.0007419671],"category_scores_gemma":[0.0023907458,0.00016436512,0.00019761887,0.00016274214,0.0008889545,0.0005156509,0.00058531814,0.00046490607,0.00015126592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010349265,0.00011006969,0.00120612,0.000026529173,0.00002930072,0.0000794284,0.00008245655,0.94521326,0.0058837705,0.0076794005,0.00052388385,0.039062303],"study_design_scores_gemma":[0.000008275077,0.000024683386,0.0000807278,0.0000013883312,0.0000018548025,0.000008810781,0.0000030613933,0.9980465,0.00039326298,0.0013271874,0.00010171896,0.0000024634949],"about_ca_topic_score_codex":0.0017735681,"about_ca_topic_score_gemma":0.0010123918,"teacher_disagreement_score":0.0017735681,"about_ca_system_score_codex":0.00068509,"about_ca_system_score_gemma":0.00035276168,"threshold_uncertainty_score":0.0049707294},"labels":[],"label_agreement":null},{"id":"W2054100090","doi":"10.1002/ett.1170","title":"On the effects of interpolator window shape and symbol location on the BER of diversity PSAM 16‐QAM","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication 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 Alberta","funders":"","keywords":"Sinc function; Symbol (formal); Quadrature amplitude modulation; Window (computing); QAM; Bit error rate; Modulation (music); Computer science; Window function; Algorithm; Mathematics; Telecommunications; Channel (broadcasting); Physics; Acoustics; Computer vision","score_opus":0.012572791183272211,"score_gpt":0.22377745996688242,"score_spread":0.21120466878361022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054100090","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.9824028,0.00070530333,0.015682597,0.000061325285,0.000025091062,0.000008773612,0.00004153507,0.00009628023,0.000976414],"genre_scores_gemma":[0.99722385,0.00021819808,0.0023327416,0.000011646773,0.000011780297,0.0000046976643,0.000016365966,0.000019280142,0.00016147837],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995359,0.00018117455,0.000020399717,0.00005400603,0.00012736175,0.000081197846],"domain_scores_gemma":[0.99276227,0.00602429,0.00056676165,0.00029342758,0.00028573815,0.00006751312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010839078,0.00045055707,0.00045719388,0.00029348445,0.00023704217,0.0004497787,0.00025847126,0.000552202,0.00083867874],"category_scores_gemma":[0.006550861,0.00018839339,0.0002443409,0.00034790157,0.00045554858,0.00047101942,0.0003330717,0.00037345637,0.00014199846],"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.004831562,0.00013692348,0.007247965,0.00031245165,0.00015626017,0.0011049687,0.00024734528,0.42524654,0.5154689,0.0033938373,0.00023346554,0.041619737],"study_design_scores_gemma":[0.00011023506,0.001966236,0.015421947,0.00010516286,0.00025699305,0.0006861175,0.00010162401,0.4314935,0.54750997,0.0014634507,0.00078981544,0.00009502819],"about_ca_topic_score_codex":0.00042306306,"about_ca_topic_score_gemma":0.0002936191,"teacher_disagreement_score":0.0010839078,"about_ca_system_score_codex":0.00021395425,"about_ca_system_score_gemma":0.00015841326,"threshold_uncertainty_score":0.0057323575},"labels":[],"label_agreement":null},{"id":"W2056846689","doi":"10.1002/ett.4460110402","title":"Service Quality Control in Multimedia Wireless Networks","year":2000,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Networks and Protocols","field":"Computer Science","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":"Opera; Queen (butterfly); Citation; Library science; Service (business); Telecommunications; Art; Engineering; Art history; Computer science; Business","score_opus":0.022381127903495245,"score_gpt":0.27207318734452285,"score_spread":0.2496920594410276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056846689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020954318,0.0047230925,0.96746516,0.00090376183,0.00027189127,0.00005936892,0.000048652204,0.00039354787,0.005180122],"genre_scores_gemma":[0.920106,0.0029096864,0.0706259,0.00030564523,0.0007391224,0.0001106885,0.000096627125,0.00010005271,0.005006237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804914,0.0005424518,0.00009532118,0.00026624842,0.00079014275,0.000256686],"domain_scores_gemma":[0.9965842,0.0021991178,0.0002861008,0.00021285999,0.0006273687,0.000090384514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032886064,0.00064063194,0.0009852144,0.00087064743,0.0006628276,0.002094254,0.001462383,0.0009517133,0.0021717336],"category_scores_gemma":[0.0076908306,0.0003555898,0.00028379893,0.0014707834,0.0012994194,0.0018794521,0.00089453894,0.0012127946,0.00031204618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051937724,0.00018167784,0.0010278419,0.00031089256,0.00006412804,0.00013069625,0.00027459234,0.40139806,0.013041205,0.24651283,0.005567255,0.33097145],"study_design_scores_gemma":[0.000030504563,0.000058579004,0.0002661215,0.000016842268,0.000019124782,0.00003424703,0.000023799586,0.9521589,0.0017373983,0.043406006,0.002236162,0.000012198631],"about_ca_topic_score_codex":0.0041085416,"about_ca_topic_score_gemma":0.0024029308,"teacher_disagreement_score":0.0041085416,"about_ca_system_score_codex":0.0020367003,"about_ca_system_score_gemma":0.0009562192,"threshold_uncertainty_score":0.01739204},"labels":[],"label_agreement":null},{"id":"W2056853597","doi":"10.1002/ett.1114","title":"A new MAP‐based channel estimation technique for multiple input multiple output diversity schemes","year":2006,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication 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":"Channel (broadcasting); Computer science; Algorithm; Maximum a posteriori estimation; Intersymbol interference; A priori and a posteriori; Transmission (telecommunications); Diversity combining; Coding (social sciences); Antenna diversity; Maximum likelihood; Mathematics; Telecommunications; Wireless; Statistics; Fading","score_opus":0.022172968100693576,"score_gpt":0.23600756489526042,"score_spread":0.21383459679456684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056853597","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.002808342,0.00011675575,0.9959943,0.000041071125,0.000024554762,0.000013317461,0.000019499046,0.00025204505,0.0007301321],"genre_scores_gemma":[0.26874897,0.0004146426,0.7269128,0.00008404644,0.00013040741,0.00011627978,0.00014017448,0.00005153211,0.0034011244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995084,0.00013463171,0.000015312817,0.000047884263,0.00025468724,0.000038976657],"domain_scores_gemma":[0.9993668,0.0002800976,0.00006470747,0.00011055504,0.00015825652,0.00001960119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048598388,0.0004681872,0.00041080802,0.0005673511,0.00033092508,0.0005969102,0.0006380967,0.00045241372,0.0018170063],"category_scores_gemma":[0.002147639,0.00025645032,0.00033256717,0.0006005653,0.0003436838,0.00093267515,0.000767031,0.0007363566,0.00067630643],"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.0003050238,0.000101285215,0.0006697721,0.00017825082,0.00010816925,0.00018076286,0.00017249367,0.23190083,0.06018764,0.06332505,0.0036175542,0.6392532],"study_design_scores_gemma":[0.000023771718,0.000078463614,0.00027111013,0.000013190586,0.000019167497,0.00021576126,0.000013021913,0.96632105,0.018343491,0.0077334135,0.0069403895,0.000027114256],"about_ca_topic_score_codex":0.00080341194,"about_ca_topic_score_gemma":0.001026902,"teacher_disagreement_score":0.0018170063,"about_ca_system_score_codex":0.000281401,"about_ca_system_score_gemma":0.0005655193,"threshold_uncertainty_score":0.0060785413},"labels":[],"label_agreement":null},{"id":"W2069085483","doi":"10.1002/ett.1384","title":"Improved OFDMA uplink transmission<i>via</i>cooperative relaying in the presence of frequency offsets—Part I: Ergodic information rate analysis","year":2009,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","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; University of Alberta","funders":"","keywords":"Ergodic theory; Telecommunications link; Relay; Node (physics); Computer science; Transmission (telecommunications); Orthogonal frequency-division multiple access; Frequency offset; Offset (computer science); Computer network; Transmitter power output; Power (physics); Topology (electrical circuits); Orthogonal frequency-division multiplexing; Telecommunications; Mathematics; Transmitter; Physics; Acoustics","score_opus":0.021076179402429264,"score_gpt":0.2562649022384948,"score_spread":0.23518872283606554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069085483","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.58186656,0.0018621156,0.40367407,0.00022785121,0.000053232867,0.000059815837,0.00011168655,0.0006683958,0.011476326],"genre_scores_gemma":[0.98949265,0.0002022671,0.009894288,0.000014244159,0.000013009008,0.000012173953,0.000028020568,0.000017915505,0.0003254399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805695,0.0008098949,0.00007340479,0.000115598756,0.000676761,0.00026735733],"domain_scores_gemma":[0.99376786,0.0038793073,0.0007666841,0.0005126606,0.0009921612,0.00008131342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003427976,0.0008121929,0.0011675439,0.0006783854,0.0003887146,0.001006425,0.0006868957,0.00061796285,0.000672848],"category_scores_gemma":[0.007361608,0.00020892452,0.0004413804,0.00072844845,0.0009392318,0.0009943751,0.00074803474,0.00042510685,0.00017831534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030468023,0.000052725543,0.0016164572,0.000121413104,0.00007426352,0.00033694904,0.00011630087,0.95901084,0.013298213,0.006793125,0.00040891804,0.017866071],"study_design_scores_gemma":[0.000011501395,0.00015708998,0.00063458557,0.0000132344285,0.000058815163,0.000167223,0.000031517204,0.98895687,0.008705815,0.0009865575,0.00025700557,0.000019759298],"about_ca_topic_score_codex":0.0030183354,"about_ca_topic_score_gemma":0.0015646889,"teacher_disagreement_score":0.003427976,"about_ca_system_score_codex":0.0009242504,"about_ca_system_score_gemma":0.0006876499,"threshold_uncertainty_score":0.01812911},"labels":[],"label_agreement":null},{"id":"W2072629980","doi":"10.1002/ett.1249","title":"Efficient resource management for packet mode cdma2000","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Network Optimization","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":"CDMA2000; Computer science; Computer network; Network packet; Throughput; Wireless; Scheduling (production processes); Real-time computing; Telecommunications; Code division multiple access; Engineering","score_opus":0.010404988639302776,"score_gpt":0.23813696575112664,"score_spread":0.22773197711182386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072629980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25194868,0.00051519606,0.74075305,0.0002254708,0.000053644737,0.00010351315,0.00007866796,0.00045659774,0.0058651157],"genre_scores_gemma":[0.965692,0.00008620174,0.032666054,0.000037349157,0.000017487511,0.00003740291,0.000034955032,0.000014562367,0.0014138547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945563,0.00019814183,0.000015841923,0.000070310954,0.0001340976,0.00012597015],"domain_scores_gemma":[0.9991105,0.00046231094,0.00014416965,0.00008737063,0.0001450159,0.000050561903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001127891,0.0004085931,0.00031386412,0.00046562942,0.00033744753,0.0006114466,0.00075483066,0.00026872358,0.0015779006],"category_scores_gemma":[0.0021569394,0.0001722165,0.00012499403,0.00041102443,0.00034249402,0.00052392826,0.00053970236,0.00033311264,0.00023223135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065838837,0.00030437254,0.0015741729,0.00012236187,0.000036550384,0.000141581,0.0000893137,0.77116394,0.030945614,0.018481335,0.0037862966,0.17269607],"study_design_scores_gemma":[0.00001995202,0.000064434855,0.0001838858,0.0000019786946,0.000004885971,0.000028458539,0.00001362855,0.9943216,0.002988632,0.0020010048,0.0003671503,0.000004411174],"about_ca_topic_score_codex":0.0021604616,"about_ca_topic_score_gemma":0.002270288,"teacher_disagreement_score":0.0021604616,"about_ca_system_score_codex":0.0007043288,"about_ca_system_score_gemma":0.00071857916,"threshold_uncertainty_score":0.005964875},"labels":[],"label_agreement":null},{"id":"W2073350441","doi":"10.1002/ett.1169","title":"Vector quantisation for finite‐state Markov channels and application to wireless communications","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Data Compression Techniques","field":"Computer Science","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":"University of Manitoba","funders":"University of Manitoba","keywords":"Decoding methods; Algorithm; Fading; Channel (broadcasting); Maximum a posteriori estimation; Computer science; Markov chain; Channel state information; Markov process; Markov model; Wireless; Hidden Markov model; Electronic engineering; Speech recognition; Mathematics; Telecommunications; Engineering; Statistics; Maximum likelihood","score_opus":0.02581371447252368,"score_gpt":0.3026467157225275,"score_spread":0.2768330012500038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073350441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013154983,0.0006626627,0.9844044,0.0002013383,0.000045857087,0.000028934666,0.000037536916,0.00023470308,0.0012295943],"genre_scores_gemma":[0.81333035,0.0009268485,0.18289655,0.00011222039,0.00008429821,0.00012438712,0.00014408148,0.00003823602,0.002343078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993449,0.00022370355,0.000042078296,0.00007709159,0.00026222927,0.000050086197],"domain_scores_gemma":[0.9981421,0.0012919079,0.00014278865,0.00013285017,0.00026800742,0.000022345379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011954488,0.0003177662,0.00044856887,0.0003365058,0.0002552431,0.0007571945,0.00055400026,0.0004832128,0.0013947509],"category_scores_gemma":[0.0041239136,0.00020982188,0.00021825786,0.000593966,0.00063728326,0.00070564693,0.0005240838,0.00071376946,0.0001967013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013347583,0.000030217034,0.00037235985,0.000121092766,0.00002973591,0.00007281281,0.00011555237,0.7459414,0.0087664705,0.111334234,0.0014586732,0.131624],"study_design_scores_gemma":[0.000007175233,0.000020095786,0.000041064228,0.00000988219,0.0000036780975,0.0000156787,0.000005771491,0.98770905,0.001850218,0.009650053,0.00068148394,0.0000058017267],"about_ca_topic_score_codex":0.0032846045,"about_ca_topic_score_gemma":0.0023746723,"teacher_disagreement_score":0.0032846045,"about_ca_system_score_codex":0.0007883113,"about_ca_system_score_gemma":0.0008565203,"threshold_uncertainty_score":0.0065309405},"labels":[],"label_agreement":null},{"id":"W2073869199","doi":"10.1002/ett.1461","title":"OFDM channel estimation and data detection with superimposed pilots","year":2011,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication 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":"Estimator; Orthogonal frequency-division multiplexing; Algorithm; Mathematics; Channel (broadcasting); Statistics; Detector; Computer science; Telecommunications","score_opus":0.053208631184752796,"score_gpt":0.25021714623161345,"score_spread":0.19700851504686065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073869199","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.042386077,0.0002172009,0.9558706,0.00010184858,0.000031518255,0.000022786557,0.00003057489,0.00030712254,0.001032274],"genre_scores_gemma":[0.6073212,0.00023363781,0.39016476,0.00009939696,0.000059325306,0.00005699641,0.00010159334,0.000034146797,0.001928973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989095,0.0003448175,0.00003665947,0.00012145825,0.0005020444,0.000085567466],"domain_scores_gemma":[0.9973379,0.0013828048,0.00026371088,0.0004253662,0.00050178304,0.00008853619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011608038,0.0005172446,0.0006487991,0.00054504647,0.00023021262,0.0007604608,0.00076255546,0.00071339955,0.0009883633],"category_scores_gemma":[0.008807153,0.00046287218,0.0003122179,0.00067055534,0.0007960166,0.0011369074,0.0014229612,0.0006653811,0.00044982607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078055274,0.0001478411,0.0031694947,0.00016843056,0.00013693856,0.00041765434,0.0002679823,0.6022095,0.04235744,0.021842213,0.0010261239,0.32747582],"study_design_scores_gemma":[0.000034983856,0.00007881094,0.0005167163,0.000009807876,0.00001729989,0.000120170385,0.0000124342905,0.978449,0.017282173,0.0027686704,0.00069295254,0.000016998512],"about_ca_topic_score_codex":0.0014661778,"about_ca_topic_score_gemma":0.0016864552,"teacher_disagreement_score":0.0014661778,"about_ca_system_score_codex":0.00043117855,"about_ca_system_score_gemma":0.0010956858,"threshold_uncertainty_score":0.0061389804},"labels":[],"label_agreement":null},{"id":"W2079898523","doi":"10.1002/ett.1295","title":"Accurate closed‐form approximations for the performance of equal gain combining diversity systems in Nakagami fading channels","year":2008,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication 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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fading; Nakagami distribution; Closed-form expression; Diversity gain; Mathematics; Envelope (radar); Expression (computer science); Diversity combining; Outage probability; Computer science; Algorithm; Telecommunications; Topology (electrical circuits); Statistics; Mathematical analysis; Combinatorics","score_opus":0.04973518360916431,"score_gpt":0.253217334822959,"score_spread":0.20348215121379468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079898523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030390281,0.0008841478,0.96097046,0.00016848433,0.00003943295,0.00003686009,0.0001205643,0.00042883924,0.006961017],"genre_scores_gemma":[0.78155684,0.002872224,0.20417753,0.0002101836,0.00009814825,0.00032241276,0.0004401765,0.0002337977,0.010088793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879056,0.0002998242,0.000046588608,0.000095937285,0.0006036611,0.00016343342],"domain_scores_gemma":[0.9958407,0.0027140568,0.00031798557,0.0003654575,0.00071076927,0.000050983384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025132238,0.001031824,0.0010294081,0.0007329772,0.0004965629,0.0021582104,0.0010823151,0.0013767155,0.0035557735],"category_scores_gemma":[0.011823439,0.00059893704,0.00058140885,0.0008195771,0.0012536693,0.0024273356,0.001156382,0.0013823721,0.0019875255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045576573,0.000023752484,0.00038602337,0.00009975119,0.000020087504,0.00009054903,0.00019120426,0.9371742,0.003285141,0.043446694,0.0006824666,0.014554554],"study_design_scores_gemma":[0.000008870966,0.00002100692,0.00023276536,0.00003910789,0.000008523578,0.0000727097,0.00003184951,0.9831509,0.0017686902,0.013849213,0.00079960615,0.000016842261],"about_ca_topic_score_codex":0.0031394719,"about_ca_topic_score_gemma":0.0022551762,"teacher_disagreement_score":0.0035557735,"about_ca_system_score_codex":0.0017472077,"about_ca_system_score_gemma":0.001165797,"threshold_uncertainty_score":0.013291359},"labels":[],"label_agreement":null},{"id":"W2080150587","doi":"10.1002/ett.992","title":"Generation of multiple Rayleigh fading sequences with specified cross‐correlations","year":2004,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Communication Networks Research","field":"Computer Science","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 Alberta","funders":"","keywords":"Rayleigh fading; Fading; Toeplitz matrix; Algorithm; Computational complexity theory; Envelope (radar); Mathematics; Rayleigh scattering; Block (permutation group theory); Computer science; Telecommunications; Combinatorics; Physics; Optics; Decoding methods; Pure mathematics","score_opus":0.08923396043761851,"score_gpt":0.3016175358699047,"score_spread":0.2123835754322862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080150587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059117276,0.0000964255,0.9357904,0.00009308032,0.00009141397,0.00013197034,0.00010165155,0.00045997952,0.004117827],"genre_scores_gemma":[0.47272784,0.00017778101,0.5197659,0.000089141395,0.00005827266,0.0002548229,0.0003026248,0.00012034531,0.006503232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994295,0.00015175431,0.000021631125,0.00007679885,0.000252489,0.000067750974],"domain_scores_gemma":[0.9988661,0.0004016533,0.0001124991,0.0002852065,0.00025682873,0.00007768522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072783465,0.0007524007,0.0005235391,0.00052035926,0.00029001455,0.00053124025,0.0004922504,0.00044766927,0.0036639243],"category_scores_gemma":[0.002457673,0.00040324987,0.0004629558,0.00058644335,0.000395733,0.0005212086,0.0009765201,0.00076257216,0.001030089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075831515,0.00014785102,0.0013287805,0.00021994387,0.0000930269,0.0010607529,0.0002566535,0.3286472,0.23109472,0.12735002,0.0030214435,0.3060213],"study_design_scores_gemma":[0.000129061,0.00020192743,0.00044034145,0.000023840255,0.000021280499,0.00046371718,0.000030486279,0.8625848,0.11099569,0.01890416,0.006160028,0.00004459467],"about_ca_topic_score_codex":0.00024623825,"about_ca_topic_score_gemma":0.0004721709,"teacher_disagreement_score":0.0036639243,"about_ca_system_score_codex":0.00036376066,"about_ca_system_score_gemma":0.0006184546,"threshold_uncertainty_score":0.01225704},"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":"W2082166804","doi":"10.1002/ett.4460110204","title":"Analysis of a Dual‐Rate Transmission Scheme for Gaussian Broadcast Channels","year":2000,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Data Compression Techniques","field":"Computer Science","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":"Transmission (telecommunications); Computer science; Channel (broadcasting); Transmitter; Gaussian; Broadcasting (networking); Distortion (music); Electronic engineering; Telecommunications; Algorithm; Computer network; Bandwidth (computing); Engineering; Physics","score_opus":0.025319609387713413,"score_gpt":0.2880791669804673,"score_spread":0.2627595575927539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082166804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13826005,0.0004176319,0.85032874,0.00041147115,0.000050445975,0.00008170483,0.000072026734,0.0001639403,0.010213825],"genre_scores_gemma":[0.9630188,0.0002040967,0.03305748,0.000047658876,0.00002624744,0.000038826955,0.000031099622,0.000025552055,0.0035501749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885094,0.0004021098,0.00002817635,0.00009084722,0.00043377484,0.00019412539],"domain_scores_gemma":[0.9973827,0.0013884641,0.0003153111,0.00021596781,0.00058109104,0.000116463016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019048314,0.0005245201,0.0006435166,0.000548923,0.0004539947,0.0010404969,0.0010175451,0.00090969674,0.0026019304],"category_scores_gemma":[0.004037224,0.00035635062,0.00045005162,0.00059802324,0.0013463803,0.0010568378,0.0011198167,0.00066505105,0.0003345483],"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.00027135012,0.000052917243,0.00063755456,0.00007627862,0.000035173114,0.00019772569,0.00017322425,0.8548475,0.013486583,0.115314074,0.0008129321,0.014094776],"study_design_scores_gemma":[0.0000053670924,0.000021029316,0.000054777407,0.0000030195656,0.000005374063,0.000031820528,0.0000094767665,0.9971414,0.00060811156,0.0019631337,0.00015094971,0.000005381187],"about_ca_topic_score_codex":0.0029637981,"about_ca_topic_score_gemma":0.0017468334,"teacher_disagreement_score":0.0029637981,"about_ca_system_score_codex":0.0022692604,"about_ca_system_score_gemma":0.0009348463,"threshold_uncertainty_score":0.01646465},"labels":[],"label_agreement":null},{"id":"W2083075517","doi":"10.1002/ett.1092","title":"Gallager bounds on the performance of maximum‐likelihood decoded linear binary block codes in AWGN interference","year":2006,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication 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":"Bounding overwatch; Probability of error; Algorithm; Code word; Decoding methods; Binary number; Mathematics; Complement (music); Upper and lower bounds; Additive white Gaussian noise; Code (set theory); Computer science; Discrete mathematics; Statistics; White noise; Arithmetic","score_opus":0.013618359501956638,"score_gpt":0.22991511364080297,"score_spread":0.21629675413884633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083075517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06182234,0.01152571,0.89320254,0.001045896,0.00022864388,0.00008173116,0.00039256705,0.0009839268,0.030716669],"genre_scores_gemma":[0.89601904,0.009650213,0.08594004,0.0005331377,0.00040404013,0.000448914,0.0004952032,0.00031833316,0.006191168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99496764,0.0019366071,0.00024816595,0.0003557194,0.0018418464,0.000650025],"domain_scores_gemma":[0.97264004,0.021895532,0.0015226839,0.0016681012,0.0019696013,0.00030401623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067511997,0.002837667,0.0019520182,0.0025123153,0.0007084432,0.0038515965,0.0014253462,0.0021927268,0.0039269826],"category_scores_gemma":[0.036469948,0.00071231293,0.000943239,0.0020346642,0.0026144325,0.0040827403,0.0037898712,0.0021189405,0.0013548583],"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.0008880951,0.00005009258,0.0009812497,0.000449124,0.00017978097,0.0002693024,0.00046267817,0.6699608,0.014309945,0.2607617,0.0032320681,0.048455138],"study_design_scores_gemma":[0.00002192594,0.00019191735,0.0005576144,0.0002439638,0.000064941494,0.00017744089,0.000063156316,0.869403,0.016078299,0.111043595,0.002049444,0.000104696424],"about_ca_topic_score_codex":0.0016968207,"about_ca_topic_score_gemma":0.00084479,"teacher_disagreement_score":0.0067511997,"about_ca_system_score_codex":0.0022112664,"about_ca_system_score_gemma":0.0010606278,"threshold_uncertainty_score":0.035704136},"labels":[],"label_agreement":null},{"id":"W2083812595","doi":"10.1002/ett.4460120104","title":"Hybrid ARQ and optimal signal—to—interference ratio assignment for high—quality data transmission in DS—CDMA","year":2001,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Communication Networks Research","field":"Computer Science","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":"","keywords":"Hybrid automatic repeat request; Selective Repeat ARQ; Computer science; Automatic repeat request; Error detection and correction; Go-Back-N ARQ; Code division multiple access; Transmission (telecommunications); Convolutional code; Algorithm; Network packet; Throughput; Bit error rate; Word error rate; Real-time computing; Computer network; Decoding methods; Wireless; Speech recognition; Telecommunications","score_opus":0.0980398752711771,"score_gpt":0.3439451099290364,"score_spread":0.2459052346578593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083812595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3664787,0.0008022659,0.62856376,0.00019841269,0.000063006155,0.000053878048,0.000025234753,0.0003556932,0.0034590773],"genre_scores_gemma":[0.9779578,0.00008173697,0.021452965,0.000019259276,0.000017296037,0.0000141553455,0.000006666061,0.0000059536783,0.00044417486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992618,0.00039079192,0.000019373234,0.00005299725,0.00019512902,0.00007990746],"domain_scores_gemma":[0.9990169,0.0005713003,0.00010612937,0.00006735605,0.00020351699,0.000034779354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010898104,0.000350604,0.00035032883,0.00036727777,0.0003455135,0.00054351887,0.0005385369,0.00036673585,0.0006517153],"category_scores_gemma":[0.0014491327,0.00024465442,0.0002182198,0.00029340055,0.0007694183,0.0005240301,0.00036455793,0.00026261562,0.00011699517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010317527,0.00015405187,0.0023949204,0.00014014682,0.00011789385,0.00044249828,0.00028344666,0.790955,0.09044201,0.036004487,0.0010992339,0.07693447],"study_design_scores_gemma":[0.00004262321,0.0001770044,0.00024241094,0.0000028158186,0.000019066607,0.000062410894,0.000019399838,0.99152815,0.005314241,0.002310446,0.0002708011,0.00001050138],"about_ca_topic_score_codex":0.001643523,"about_ca_topic_score_gemma":0.002167036,"teacher_disagreement_score":0.001643523,"about_ca_system_score_codex":0.00051009137,"about_ca_system_score_gemma":0.00038054003,"threshold_uncertainty_score":0.0057635307},"labels":[],"label_agreement":null},{"id":"W2090797353","doi":"10.1002/ett.1430","title":"Pre‐LNA smart soft antenna selection for MIMO spatial multiplexing/diversity system when amplifier/sky noise dominates","year":2010,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Antenna Design and Analysis","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":"MIMO; Beamforming; Spatial multiplexing; Antenna (radio); Computer science; Electronic engineering; Diversity gain; Amplifier; Low-noise amplifier; Multiplexing; Noise (video); Antenna diversity; Noise figure; Telecommunications; Engineering; Bandwidth (computing)","score_opus":0.015001650008971038,"score_gpt":0.21225065173038127,"score_spread":0.19724900172141024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090797353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21222639,0.00022556691,0.7828658,0.00014039174,0.000048234306,0.00002723407,0.00002091457,0.00040858137,0.004036838],"genre_scores_gemma":[0.9439756,0.000059859616,0.054287337,0.0000641969,0.00002913293,0.000014898957,0.0000144437045,0.00001084372,0.0015436797],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961793,0.00017817189,0.000012174249,0.00003784039,0.00011069213,0.000043113403],"domain_scores_gemma":[0.99963737,0.00013217352,0.000083584404,0.000059636037,0.00005199058,0.00003537715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003339852,0.00041700064,0.00028292768,0.00018140962,0.0002011942,0.0004285047,0.0003437726,0.00025988126,0.0014632688],"category_scores_gemma":[0.000508289,0.0001637636,0.00024870175,0.00018262483,0.00047821656,0.00029286728,0.00043272966,0.0002669641,0.00057621946],"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.0013810484,0.00014138332,0.0048504346,0.00019261212,0.00013851208,0.00046265192,0.00018614065,0.15973887,0.53123933,0.019883659,0.001452578,0.28033274],"study_design_scores_gemma":[0.000096193144,0.0008094901,0.002651329,0.000017567629,0.00007649829,0.0008465623,0.00006360187,0.8384134,0.14941955,0.004632282,0.0029319003,0.000041610125],"about_ca_topic_score_codex":0.00025509737,"about_ca_topic_score_gemma":0.0008753639,"teacher_disagreement_score":0.0014632688,"about_ca_system_score_codex":0.00020505069,"about_ca_system_score_gemma":0.00025081873,"threshold_uncertainty_score":0.004895091},"labels":[],"label_agreement":null},{"id":"W2093444836","doi":"10.1002/ett.1221","title":"Performance analysis of nonlinearly amplified M‐QAM signals in MIMO channels","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Power Amplifier Design","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":"Queen's University","funders":"","keywords":"MIMO; Fading; QAM; Degradation (telecommunications); Quadrature amplitude modulation; Computer science; Nonlinear system; Channel (broadcasting); Amplifier; Electronic engineering; Control theory (sociology); Telecommunications; Mathematics; Bit error rate; Engineering; Physics; Bandwidth (computing)","score_opus":0.022827283310822122,"score_gpt":0.2560184982806313,"score_spread":0.23319121496980916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093444836","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.8417181,0.0013644013,0.148017,0.00023638191,0.000037751375,0.000025954232,0.00010796498,0.00022151053,0.00827094],"genre_scores_gemma":[0.9952844,0.00021773158,0.0035521914,0.0000186172,0.000014992161,0.0000059403337,0.00002541941,0.000011467024,0.0008693023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916387,0.00026601786,0.000022736976,0.00007394655,0.00032699326,0.00014648664],"domain_scores_gemma":[0.9955621,0.0030539928,0.0003620358,0.00023960216,0.00071648194,0.000065730615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001013629,0.0006801951,0.00042986893,0.00033592898,0.00029244792,0.00058644195,0.0003193004,0.0005520628,0.0016361192],"category_scores_gemma":[0.0037980496,0.00016382516,0.00027699696,0.00027695842,0.0007561003,0.0005392619,0.00044924713,0.00046547077,0.00045708255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009790584,0.00006236842,0.005104021,0.00022810242,0.00011252276,0.0005228866,0.0002715881,0.79988456,0.1612029,0.012139838,0.00028997243,0.019202111],"study_design_scores_gemma":[0.0000176505,0.00023855276,0.0021262665,0.000021560481,0.00003356527,0.00021762983,0.000040496285,0.94206107,0.0530637,0.0018516299,0.00029991614,0.00002791656],"about_ca_topic_score_codex":0.0013913541,"about_ca_topic_score_gemma":0.0009311749,"teacher_disagreement_score":0.0016361192,"about_ca_system_score_codex":0.0005966642,"about_ca_system_score_gemma":0.00030694166,"threshold_uncertainty_score":0.0054733753},"labels":[],"label_agreement":null},{"id":"W2094148320","doi":"10.1002/ett.1010","title":"Analysis of coherent MPSK schemes with generalized selection diversity in Rayleigh fading","year":2004,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication 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":"Medical Research Council; King Fahd University of Petroleum and Minerals","keywords":"Rayleigh fading; Expression (computer science); Phase-shift keying; Fading; Keying; Moment-generating function; Selection (genetic algorithm); Diversity combining; Modulation (music); Algorithm; Computer science; Mathematics; Diversity scheme; Rayleigh scattering; Electronic engineering; Probability density function; Telecommunications; Statistics; Bit error rate; Physics; Engineering; Optics; Artificial intelligence; Decoding methods; Acoustics","score_opus":0.02162674496828469,"score_gpt":0.2439785724252331,"score_spread":0.22235182745694843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094148320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27589265,0.0035838243,0.6960344,0.0006796886,0.00005829243,0.00011998063,0.00021842918,0.00032121528,0.02309159],"genre_scores_gemma":[0.972706,0.0012106755,0.022535224,0.00009038652,0.00010010344,0.00006631139,0.00009858476,0.00006267732,0.0031300292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998919,0.00034288343,0.00003384864,0.00006948033,0.00050875644,0.00012609527],"domain_scores_gemma":[0.99791354,0.0012502554,0.00026098333,0.00017628308,0.0003519133,0.000047073667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011769762,0.0010441575,0.0006948274,0.00060373644,0.00035699242,0.0009517342,0.00062167394,0.0007183292,0.0018063774],"category_scores_gemma":[0.003315308,0.00037094756,0.00049500883,0.0009599567,0.0010354641,0.0011111108,0.00095506787,0.0005138463,0.00035110457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017143469,0.00003383972,0.00089442567,0.00018060254,0.00008534852,0.00034545653,0.00016649441,0.87484246,0.025404714,0.078108095,0.0007826499,0.018984416],"study_design_scores_gemma":[0.000009116266,0.0000474409,0.00055136083,0.000011365008,0.000015451753,0.00010857238,0.000015257657,0.9878185,0.0017359128,0.009300134,0.00037542605,0.000011513822],"about_ca_topic_score_codex":0.0014399539,"about_ca_topic_score_gemma":0.0012530503,"teacher_disagreement_score":0.0018063774,"about_ca_system_score_codex":0.00143361,"about_ca_system_score_gemma":0.0006795867,"threshold_uncertainty_score":0.010401607},"labels":[],"label_agreement":null},{"id":"W2095362508","doi":"10.1002/ett.1255","title":"Orthogonality‐embedded space‐time codes","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Space–time block code; Block code; Circulant matrix; Orthogonality; Full Rate; Decoding methods; Mathematics; Space time; Algebraic number; Linear code; Discrete mathematics; Algorithm; Computer science; Combinatorics; Geometry; Engineering; Mathematical analysis","score_opus":0.012222094930476459,"score_gpt":0.24860765166729637,"score_spread":0.2363855567368199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095362508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060213935,0.00093429047,0.91553295,0.0002807658,0.00019023489,0.00008377622,0.00021781768,0.00022509511,0.02232119],"genre_scores_gemma":[0.6819786,0.0012595294,0.2981517,0.00024470192,0.00026013283,0.00016764473,0.0005991386,0.000067071545,0.0172714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926704,0.00013031665,0.000039420418,0.00007518157,0.00037281928,0.000115150455],"domain_scores_gemma":[0.9990709,0.00015981465,0.00014099557,0.00019042911,0.00037971092,0.00005816933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040343383,0.00039855583,0.0004253584,0.00063745974,0.0003642675,0.00075480656,0.00046719064,0.00037741603,0.0019002054],"category_scores_gemma":[0.0013835839,0.00015606299,0.00032778582,0.0008935567,0.00076540426,0.00079983246,0.0011175424,0.0007250766,0.0006547731],"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.00020674724,0.00005004987,0.00069423084,0.00011978537,0.00003151159,0.0002185434,0.00016801093,0.07734823,0.043495804,0.7557624,0.0027254939,0.1191791],"study_design_scores_gemma":[0.00009224256,0.00029826857,0.00106826,0.00006805654,0.000044993092,0.0010385031,0.00005904825,0.6446637,0.070028946,0.22702722,0.05551595,0.00009467521],"about_ca_topic_score_codex":0.0008446584,"about_ca_topic_score_gemma":0.00089531485,"teacher_disagreement_score":0.0019002054,"about_ca_system_score_codex":0.000503025,"about_ca_system_score_gemma":0.00089775195,"threshold_uncertainty_score":0.0063567758},"labels":[],"label_agreement":null},{"id":"W2101058896","doi":"10.1002/ett.1339","title":"New joint frame synchronisation and carrier frequency offset estimation method for OFDM systems","year":2008,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication 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":"Carrier frequency offset; Orthogonal frequency-division multiplexing; Frequency offset; Algorithm; Offset (computer science); Computer science; Frequency domain; Fast Fourier transform; Sequence (biology); Electronic engineering; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.029541180894299784,"score_gpt":0.2678893159716706,"score_spread":0.23834813507737082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101058896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009599088,0.000153079,0.9892635,0.000032942673,0.0000448993,0.000016795557,0.0000104503715,0.00029389584,0.0005853471],"genre_scores_gemma":[0.25994107,0.00022074029,0.73608357,0.000052638432,0.00008933202,0.00007667368,0.00008061252,0.000039074308,0.0034162381],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995938,0.00008944529,0.00001936282,0.00007210591,0.0001967623,0.000028645993],"domain_scores_gemma":[0.9997037,0.000080179874,0.000045277095,0.000043233264,0.00010871536,0.000018939501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042607504,0.00035221674,0.0004527934,0.0005736948,0.00027100678,0.00040417217,0.0004189692,0.00042605452,0.0013239911],"category_scores_gemma":[0.0012617434,0.00018784594,0.00021586091,0.0005125527,0.0002701485,0.00073891605,0.000458661,0.0004833837,0.00053472776],"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.00026187178,0.00006880804,0.0010590758,0.00008922163,0.000043177643,0.00008755677,0.00015795896,0.035209414,0.06529086,0.011482299,0.0018802966,0.8843694],"study_design_scores_gemma":[0.00010162708,0.00021475977,0.0012627448,0.000016625341,0.00003218803,0.00035165335,0.000031638665,0.9474034,0.03655297,0.0035654872,0.010420471,0.000046451518],"about_ca_topic_score_codex":0.000960524,"about_ca_topic_score_gemma":0.001026636,"teacher_disagreement_score":0.0013239911,"about_ca_system_score_codex":0.00021530283,"about_ca_system_score_gemma":0.00056193594,"threshold_uncertainty_score":0.004429221},"labels":[],"label_agreement":null},{"id":"W2109154295","doi":"10.1002/ett.4460110612","title":"SS‐MC‐MA Systems with Pilot Symbol Aided Channel Estimation in the Asynchronous Uplink","year":2000,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Communication Networks Research","field":"Computer Science","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":"","keywords":"Telecommunications link; Computer science; Asynchronous communication; Exploit; Channel (broadcasting); Electronic engineering; Spectral efficiency; Boosting (machine learning); Computer network; Telecommunications; Real-time computing; Engineering; Computer security","score_opus":0.02879625657969147,"score_gpt":0.2599143096495778,"score_spread":0.2311180530698863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109154295","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.8010177,0.0003229819,0.19525495,0.00010715304,0.000041402047,0.00003184964,0.000042270844,0.00024436842,0.0029372927],"genre_scores_gemma":[0.9930032,0.00002936347,0.006649709,0.00001019862,0.000017776043,0.0000096991635,0.000010208838,0.0000028446686,0.0002670533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923193,0.00031008574,0.000038926133,0.00008450442,0.00020116392,0.0001333081],"domain_scores_gemma":[0.9951704,0.0023833811,0.00069095835,0.0005808589,0.0010043053,0.00017008549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012366917,0.00048917957,0.0004952734,0.00029097724,0.00043553466,0.00059153134,0.0004258927,0.0006652276,0.00051488425],"category_scores_gemma":[0.0044308067,0.00025323845,0.00014063947,0.0003973805,0.0006795258,0.00046973038,0.0005365238,0.00045071603,0.00017488535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022427433,0.00025694733,0.013484614,0.00013342345,0.00013635194,0.0010363163,0.00033396485,0.83024865,0.08179419,0.010827031,0.00063398964,0.05887178],"study_design_scores_gemma":[0.000032674732,0.00029886916,0.0020417408,0.0000068972786,0.00003636637,0.000108719345,0.000026986922,0.9851526,0.011176763,0.0008703214,0.00023729348,0.000010817135],"about_ca_topic_score_codex":0.002099602,"about_ca_topic_score_gemma":0.0017199141,"teacher_disagreement_score":0.002099602,"about_ca_system_score_codex":0.00028705597,"about_ca_system_score_gemma":0.00045106892,"threshold_uncertainty_score":0.006540358},"labels":[],"label_agreement":null},{"id":"W2109823664","doi":"10.1002/ett.1253","title":"Wireless signal‐preamble assisted Mach–Zehnder modulator bias stabilisation in wireless signal transmission over optical fibre","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Photorefractive and Nonlinear Optics","field":"Physics and Astronomy","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; University of Calgary","funders":"","keywords":"Electro-optic modulator; SIGNAL (programming language); Lithium niobate; Mach–Zehnder interferometer; DC bias; Electronic engineering; Computer science; Pilot signal; Transmission (telecommunications); Preamble; Intermodulation; Bit error rate; Telecommunications; Optical modulator; Physics; Optics; Channel (broadcasting); Electrical engineering; Engineering; Phase modulation; Interferometry; Bandwidth (computing)","score_opus":0.03224614710478685,"score_gpt":0.2807612522664918,"score_spread":0.24851510516170494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109823664","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.6253959,0.0013582523,0.3685633,0.00021125958,0.0001205098,0.000106618325,0.000032157543,0.00067174755,0.003540256],"genre_scores_gemma":[0.94319296,0.00027901167,0.05384252,0.00003937595,0.00003788406,0.00003154453,0.000023158946,0.000020653657,0.0025328945],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99986136,0.000039274422,0.000009648543,0.000021309357,0.000050134975,0.000018150535],"domain_scores_gemma":[0.9997447,0.00008684821,0.000065275104,0.000038825365,0.0000551146,0.00000927569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025769346,0.00022188346,0.0001823807,0.00023640861,0.0002022505,0.00022470583,0.00037437066,0.0002945859,0.00073017343],"category_scores_gemma":[0.0006718113,0.00009797563,0.00009740514,0.00017719872,0.0002936048,0.00034196416,0.00028628387,0.00023949909,0.00023909388],"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.00045826618,0.000053910975,0.0008716986,0.00014521979,0.00001648038,0.00024580891,0.00019393749,0.009918319,0.84303105,0.0035190915,0.00039510726,0.14115113],"study_design_scores_gemma":[0.00005923187,0.00058076275,0.0015272123,0.000030573403,0.000029350325,0.00053100137,0.000035907586,0.13457723,0.85582834,0.00075870386,0.006018065,0.000023505017],"about_ca_topic_score_codex":0.00029755392,"about_ca_topic_score_gemma":0.00046977494,"teacher_disagreement_score":0.00073017343,"about_ca_system_score_codex":0.00016692377,"about_ca_system_score_gemma":0.00014146097,"threshold_uncertainty_score":0.0024427176},"labels":[],"label_agreement":null},{"id":"W2127914209","doi":"10.1002/ett.1414","title":"Channel code design with causal side information at the encoder","year":2010,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication 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 (broadcasting); Encoder; Binary symmetric channel; Interference (communication); Computer science; Binary erasure channel; Code (set theory); Hamming code; Additive white Gaussian noise; Binary number; Algorithm; Systematic code; Hamming distance; Binary code; Linear code; Decoding methods; Telecommunications; Mathematics; Channel capacity; Code rate; Block code; Arithmetic","score_opus":0.015514978791529483,"score_gpt":0.2238631872448761,"score_spread":0.20834820845334662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127914209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024555132,0.00038631767,0.9719277,0.00028571795,0.000061481245,0.00004786904,0.00009652656,0.00017072393,0.0024685347],"genre_scores_gemma":[0.7080993,0.0005696108,0.28756237,0.00026747145,0.00016104209,0.00019371735,0.00028621842,0.000067490655,0.0027927437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977653,0.00091480516,0.00010190154,0.0002446571,0.0007574388,0.00021585068],"domain_scores_gemma":[0.9957353,0.002221172,0.00048675673,0.00035694745,0.0010710472,0.00012879135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018104506,0.000677837,0.00083217106,0.0006115189,0.00039238224,0.0010454097,0.0007918016,0.0011789926,0.0016754001],"category_scores_gemma":[0.0074961493,0.00033667232,0.00031364633,0.0006914746,0.000903879,0.001103642,0.0010939643,0.0007645947,0.0004197011],"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.00058925257,0.000069125344,0.001118288,0.00047052934,0.00007674279,0.0003575799,0.00023334513,0.6183182,0.02288185,0.23170738,0.004123127,0.12005458],"study_design_scores_gemma":[0.00007855865,0.00010469139,0.0001499419,0.000043931075,0.00002547951,0.00014693815,0.000023757966,0.9401336,0.012176206,0.04509188,0.0019928939,0.000032123073],"about_ca_topic_score_codex":0.0010357695,"about_ca_topic_score_gemma":0.0009127168,"teacher_disagreement_score":0.0018104506,"about_ca_system_score_codex":0.000895774,"about_ca_system_score_gemma":0.0017875658,"threshold_uncertainty_score":0.009574652},"labels":[],"label_agreement":null},{"id":"W2134740342","doi":"10.1002/ett.944","title":"Effects of user distribution on the delay performance of downlink packet access in 3GPP WCDMA networks","year":2004,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Telecommunications link; Computer network; Computer science; Code division multiple access; Network packet; W-CDMA; Base station; 3rd Generation Partnership Project 2; Cellular network; Channel (broadcasting); Real-time computing","score_opus":0.019641187213228942,"score_gpt":0.2646134727734608,"score_spread":0.24497228556023187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134740342","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.9686655,0.00037583112,0.028403163,0.000120937635,0.00001591797,0.000014636714,0.000062631916,0.00019792361,0.0021434615],"genre_scores_gemma":[0.9989022,0.000065209155,0.00082402426,0.000012090836,0.0000030762624,0.0000039646497,0.000021217773,0.00001345572,0.00015481585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998594,0.00062404556,0.000042581156,0.00010542918,0.00033218408,0.00030182456],"domain_scores_gemma":[0.98248094,0.014170943,0.0009033002,0.0007229916,0.0014277429,0.0002941011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022332836,0.0005246321,0.0004459583,0.0005171832,0.00053511705,0.0010066058,0.00040165885,0.00061763136,0.0005716839],"category_scores_gemma":[0.013453522,0.00038997398,0.0002458957,0.00063121185,0.0007865296,0.000737567,0.0006620387,0.00058519066,0.0001316545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079406385,0.000072234754,0.011880492,0.000036650672,0.00005223303,0.0002538755,0.00010681196,0.9592359,0.01520758,0.0023620364,0.0002006259,0.009797604],"study_design_scores_gemma":[0.000038074657,0.00036927534,0.0035926905,0.000011145822,0.00005729239,0.00027464572,0.00009889236,0.95947087,0.034849364,0.000931546,0.00027516167,0.000031084106],"about_ca_topic_score_codex":0.004599462,"about_ca_topic_score_gemma":0.0024579626,"teacher_disagreement_score":0.004599462,"about_ca_system_score_codex":0.0015020074,"about_ca_system_score_gemma":0.0005901288,"threshold_uncertainty_score":0.011810839},"labels":[],"label_agreement":null},{"id":"W2138962228","doi":"10.1002/ett.905","title":"An efficient approach to lattice-based fixed-rate entropy-coded vector quantization","year":2003,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Data Compression Techniques","field":"Computer Science","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":"Vector quantization; Lattice (music); Mathematics; Algorithm; Applied mathematics; Computer science; Mathematical optimization; Statistical physics; Physics","score_opus":0.026070857222368734,"score_gpt":0.27553316122211313,"score_spread":0.2494623039997444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138962228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016354016,0.00014547963,0.99692875,0.00006444492,0.000026703461,0.000032691314,0.000024993597,0.00021361496,0.00092799176],"genre_scores_gemma":[0.106329925,0.00030633187,0.8910773,0.000085011365,0.000056304674,0.0001625009,0.000120366276,0.00008794184,0.0017742891],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989116,0.00034050082,0.000067664216,0.00010132959,0.00051465596,0.00006427775],"domain_scores_gemma":[0.99917173,0.0003717499,0.00007161776,0.00017571445,0.00016819288,0.000041073785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010360715,0.00054316514,0.00083870516,0.00083316676,0.0004808059,0.0010494341,0.0013217051,0.0007049973,0.0023026876],"category_scores_gemma":[0.0033987516,0.00034301585,0.00044613585,0.0012966687,0.0011464052,0.0014013501,0.0014747741,0.001794271,0.0008857825],"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.000230883,0.00010894341,0.00025799044,0.00019216666,0.00003705072,0.000090510664,0.00016940544,0.31883496,0.029141927,0.23455238,0.0037807524,0.41260293],"study_design_scores_gemma":[0.000027045586,0.000045864068,0.000041525203,0.000017040202,0.000006160292,0.00006721545,0.000012144507,0.95830464,0.008887642,0.029239329,0.003329035,0.000022382566],"about_ca_topic_score_codex":0.0015246948,"about_ca_topic_score_gemma":0.00197554,"teacher_disagreement_score":0.0023026876,"about_ca_system_score_codex":0.0008916648,"about_ca_system_score_gemma":0.0012950673,"threshold_uncertainty_score":0.0077032447},"labels":[],"label_agreement":null},{"id":"W2152740380","doi":"10.1002/ett.1316","title":"Analysis of the effects of Nyquist pulse‐shaping on the performance of OFDM systems with carrier frequency offset","year":2008,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication 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":"University of Alberta; Telus (Canada)","funders":"","keywords":"Carrier frequency offset; Subcarrier; Orthogonal frequency-division multiplexing; Nyquist–Shannon sampling theorem; Frequency offset; Bit error rate; Pulse shaping; Electronic engineering; Mathematics; Telecommunications; Computer science; Physics; Channel (broadcasting); Engineering; Optics","score_opus":0.0149168462829109,"score_gpt":0.2116266949376112,"score_spread":0.1967098486547003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152740380","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.84578234,0.00080995593,0.15029308,0.0000834728,0.000021278043,0.000018542196,0.000056446162,0.00035193705,0.0025829817],"genre_scores_gemma":[0.9919348,0.00015282397,0.0076030446,0.000008075263,0.00000553062,0.0000057796237,0.000022269573,0.000009414166,0.00025821297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951136,0.00010490552,0.000015240368,0.000031592244,0.00027898687,0.00005790329],"domain_scores_gemma":[0.9968606,0.0023794088,0.00029420204,0.00016494302,0.00027005502,0.00003068083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061460165,0.0003200791,0.00028276694,0.0002776654,0.00017121952,0.00026105365,0.00019015749,0.00037861388,0.0005599561],"category_scores_gemma":[0.0040404964,0.00012328026,0.00016611321,0.00028719672,0.00032573787,0.00035201668,0.0001995302,0.00026846313,0.0001298638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001041965,0.00006095748,0.004656191,0.00023054135,0.00009350955,0.00055945414,0.00025744658,0.7479389,0.16897397,0.0052312682,0.00025968262,0.07069621],"study_design_scores_gemma":[0.000009853381,0.00017234239,0.004471825,0.000011997208,0.000024180934,0.00018225846,0.000022719376,0.93480945,0.059512068,0.00055594486,0.0002122012,0.000015029584],"about_ca_topic_score_codex":0.0009440126,"about_ca_topic_score_gemma":0.00073410396,"teacher_disagreement_score":0.0009440126,"about_ca_system_score_codex":0.00040547908,"about_ca_system_score_gemma":0.00025913652,"threshold_uncertainty_score":0.0032503605},"labels":[],"label_agreement":null},{"id":"W2168838607","doi":"10.1002/ett.1088","title":"CAC and routing for multi‐service networks with blocked wide‐band calls delayed, Part II: approximative link MDP framework","year":2006,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Communication Networks Research","field":"Computer Science","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","funders":"","keywords":"Markov decision process; Routing (electronic design automation); Computer science; Markov process; Call Admission Control; Markov chain; Mathematical optimization; Quality of service; Set (abstract data type); Network packet; Computer network; Mathematics; Wireless network; Wireless; Telecommunications; Statistics","score_opus":0.03488776575646965,"score_gpt":0.27492640290360704,"score_spread":0.24003863714713738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168838607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05646882,0.0011484043,0.9367567,0.000954128,0.000102452155,0.00007703763,0.00008340382,0.00017086917,0.00423826],"genre_scores_gemma":[0.92607933,0.0006636943,0.06719345,0.00016908612,0.00008780476,0.00020748025,0.00009563877,0.000049267346,0.00545434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911755,0.00042981052,0.000021722306,0.00011414991,0.00017246464,0.0001444006],"domain_scores_gemma":[0.99597377,0.0031930418,0.00029723762,0.000086318214,0.0002995426,0.00015014289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026129805,0.00082584476,0.0017055164,0.0007952535,0.0005966352,0.0018749018,0.0012403529,0.0021776636,0.0023748293],"category_scores_gemma":[0.0061327796,0.0007638653,0.00068791345,0.000735104,0.0020192512,0.0013137489,0.0009348339,0.0018069363,0.00018741444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010360357,0.000004906803,0.000069807116,0.000007976318,0.000005192006,0.0000140823195,0.0000061075707,0.99423933,0.000046597004,0.004749354,0.00005757129,0.0007886489],"study_design_scores_gemma":[0.0000021781218,0.000002272489,0.000010827294,9.0056244e-7,0.0000010804533,0.0000013304526,0.0000014121042,0.99862564,0.000013879271,0.0013034738,0.0000362684,7.7074156e-7],"about_ca_topic_score_codex":0.017605677,"about_ca_topic_score_gemma":0.0061986186,"teacher_disagreement_score":0.017605677,"about_ca_system_score_codex":0.0033707174,"about_ca_system_score_gemma":0.0024924052,"threshold_uncertainty_score":0.035006344},"labels":[],"label_agreement":null},{"id":"W4245779315","doi":"10.1002/ett.1385","title":"Improved OFDMA uplink transmission <i>via</i> cooperative relaying in the presence of frequency offsets—Part II: Outage information rate analysis","year":2009,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","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; University of Alberta","funders":"","keywords":"Telecommunications link; Relay; Diversity gain; Computer science; Node (physics); Computer network; Orthogonal frequency-division multiplexing; Transmission (telecommunications); Interference (communication); Electronic engineering; Ergodic theory; Orthogonal frequency-division multiple access; Fading; Telecommunications; Engineering; Mathematics; Power (physics); Channel (broadcasting); Physics","score_opus":0.021225157682030916,"score_gpt":0.25620946153406804,"score_spread":0.2349843038520371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245779315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17734051,0.0022013574,0.80455226,0.0003795739,0.000069407535,0.000054311568,0.00011675169,0.00045861784,0.014827235],"genre_scores_gemma":[0.9719045,0.00071751606,0.026142055,0.000044929577,0.000050735936,0.000027450811,0.000049416503,0.000031049178,0.0010322742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908984,0.00030607093,0.00004055718,0.00007733129,0.00036450368,0.00012175088],"domain_scores_gemma":[0.99777395,0.0012121823,0.0003480076,0.00025980012,0.00036804492,0.00003796629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017186366,0.0006942939,0.0009541038,0.00048542503,0.00042281047,0.00095059955,0.000590983,0.0005706109,0.0010418101],"category_scores_gemma":[0.004326849,0.0002370867,0.0003985623,0.000660829,0.00086207205,0.0008251553,0.00070429756,0.00047845682,0.00030996324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002610085,0.0000710836,0.0020092104,0.0003360428,0.000106158775,0.0013045294,0.0005611634,0.8406987,0.039362732,0.058218107,0.0023219516,0.05474928],"study_design_scores_gemma":[0.000009814022,0.00008540653,0.000578429,0.000024421053,0.00005112152,0.0005193573,0.000054646884,0.98631847,0.0070605516,0.004389025,0.0008860634,0.00002275752],"about_ca_topic_score_codex":0.0017324061,"about_ca_topic_score_gemma":0.0011020977,"teacher_disagreement_score":0.0017324061,"about_ca_system_score_codex":0.00084568816,"about_ca_system_score_gemma":0.0005704214,"threshold_uncertainty_score":0.009089172},"labels":[],"label_agreement":null},{"id":"W4250256434","doi":"10.1002/ett.1056","title":"CAC and routing for multi‐service networks with blocked wide‐band calls delayed, part I: exact link MDP framework","year":2005,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Communication Networks Research","field":"Computer Science","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":"École de Technologie Supérieure","funders":"","keywords":"Markov decision process; Routing (electronic design automation); Computer science; Markov process; Computer network; Mathematical optimization; Markov chain; Set (abstract data type); Quality of service; Call Admission Control; Service (business); Clearance; Distributed computing; Mathematics; Wireless network; Telecommunications; Economics; Wireless; Statistics","score_opus":0.04433834447850925,"score_gpt":0.2929779859921931,"score_spread":0.24863964151368384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250256434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0680141,0.0012186839,0.9235594,0.0010693503,0.000120937926,0.00010152692,0.000133969,0.00019655284,0.0055855094],"genre_scores_gemma":[0.9292768,0.00061682274,0.06415647,0.00016393268,0.000080886006,0.00019793151,0.00010840602,0.00004429812,0.005354341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989473,0.0004944635,0.00002820601,0.00013641312,0.00021171765,0.00018182093],"domain_scores_gemma":[0.9962126,0.0030024643,0.00027137436,0.00008857421,0.00027707082,0.00014790898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002425132,0.0008091662,0.0017624535,0.0008298367,0.000630317,0.0018460081,0.0013371323,0.0018954861,0.0025761435],"category_scores_gemma":[0.006228652,0.00085854426,0.00063839875,0.00089334475,0.0018248057,0.001360534,0.0009315494,0.0015462325,0.0001806894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009954402,0.0000043909513,0.00006449275,0.0000074653285,0.00000460126,0.000015086102,0.000005225504,0.99472636,0.00003820085,0.0041156556,0.0000630474,0.00094544323],"study_design_scores_gemma":[0.000002668432,0.0000025090226,0.000013701431,9.656184e-7,0.0000011474003,0.0000017508269,0.0000015971848,0.99821943,0.00001709223,0.0016956227,0.000042571315,9.417039e-7],"about_ca_topic_score_codex":0.022799255,"about_ca_topic_score_gemma":0.008563284,"teacher_disagreement_score":0.022799255,"about_ca_system_score_codex":0.0035647203,"about_ca_system_score_gemma":0.0028406586,"threshold_uncertainty_score":0.045333087},"labels":[],"label_agreement":null}]}