{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009099743,0.00031515,0.88363063,0.0048451163,0.0003617213,0.00061349105,0.000011884236,0.0003211744,0.10080107],"genre_scores_gemma":[0.99526936,0.0003838493,0.0032497009,0.0005112198,0.000017480872,0.000076889206,0.000002594544,0.000025085677,0.00046385085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732685,0.0015871573,0.00042367345,0.00023771041,0.00021057004,0.00021404214],"domain_scores_gemma":[0.9952182,0.0007427862,0.00020380094,0.0036373034,0.00013532426,0.000062548],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00093407393,0.0001806759,0.00014958979,0.0001450109,0.001475201,0.00009693651,0.0038586406,0.000026823074,0.00016987266],"category_scores_gemma":[0.00003127733,0.000116428266,0.00015641234,0.0007235366,0.00017211516,0.0001852992,0.00011409375,0.0005381864,0.00022019907],"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.00003324669,0.001245476,0.000022023998,0.000023598135,0.00026419488,0.0000031791303,0.039070126,0.007326187,0.0010638268,0.84517926,0.002530656,0.10323821],"study_design_scores_gemma":[0.0054008407,0.0028503751,0.063321985,0.003822658,0.00051803625,0.00020345082,0.022567738,0.67119366,0.049526144,0.0033178802,0.17277384,0.004503389],"about_ca_topic_score_codex":0.000018724511,"about_ca_topic_score_gemma":0.000035871923,"teacher_disagreement_score":0.9861696,"about_ca_system_score_codex":0.00006798216,"about_ca_system_score_gemma":0.00003239373,"threshold_uncertainty_score":0.99982476},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005625826,0.00004125463,0.9941728,0.0005320257,0.00013742382,0.0005223482,0.000026281898,0.00023133717,0.0037739256],"genre_scores_gemma":[0.8762324,0.000045120498,0.122706905,0.0006657919,0.00003457808,0.00012147923,0.000027241027,0.00003941079,0.00012710263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981203,0.000574437,0.00041081983,0.00042583697,0.00015328158,0.00031530735],"domain_scores_gemma":[0.9982058,0.0005469737,0.00011389953,0.00072368747,0.00027052508,0.00013914768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043693482,0.00021185914,0.00018949545,0.00059634476,0.00061068044,0.00008887778,0.0006817294,0.00004978362,0.00003760169],"category_scores_gemma":[0.000034982062,0.0002447112,0.00014185488,0.0011418798,0.000063360785,0.00031979862,0.00001755917,0.00030706063,0.00005580854],"study_design_candidate":"design_other","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.000056959747,0.0011922402,0.000006117872,0.000006575926,0.000047902522,0.0000072677803,0.0014708027,0.0059487876,0.00055468286,0.0019505162,0.000025555255,0.9887326],"study_design_scores_gemma":[0.0017460185,0.00058118487,0.0022447591,0.000146373,0.000033781238,0.000011443335,0.00011638604,0.96062976,0.03252461,0.0005153243,0.0010263221,0.0004240164],"about_ca_topic_score_codex":0.000076017786,"about_ca_topic_score_gemma":0.00038351293,"teacher_disagreement_score":0.98830855,"about_ca_system_score_codex":0.00012333751,"about_ca_system_score_gemma":0.00007128209,"threshold_uncertainty_score":0.9979033},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01037429,0.0006108306,0.9819455,0.00010723675,0.00009761699,0.00035517814,0.00007054552,0.00060816505,0.00583063],"genre_scores_gemma":[0.5590156,0.00012075962,0.44070303,0.000034833993,0.000012676795,0.000016945172,0.000011976711,0.000053222637,0.000030978666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997969,0.0006914424,0.0007081703,0.0001830639,0.0001439293,0.00030444868],"domain_scores_gemma":[0.99589473,0.0016685046,0.00019186086,0.0020149625,0.00015905953,0.00007090038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013390745,0.00023958767,0.00024281602,0.0001999145,0.00072798,0.000038947197,0.001110898,0.000052314295,0.000025898962],"category_scores_gemma":[0.00011597146,0.0002194833,0.00013159793,0.0006582322,0.00021763287,0.00021956654,0.000034663193,0.0007231848,0.000010467288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032861968,0.00049400446,0.00007366957,0.00007582208,0.000216933,0.0000020385562,0.0064466335,0.75003964,0.06625824,0.0011025397,0.00007803352,0.17517956],"study_design_scores_gemma":[0.00047660328,0.000065479,0.001160559,0.00027332353,0.00008458994,0.000021418247,0.0013422746,0.7812158,0.2063158,0.0002967864,0.008203996,0.0005433711],"about_ca_topic_score_codex":0.0000110060355,"about_ca_topic_score_gemma":0.000095070565,"teacher_disagreement_score":0.54864126,"about_ca_system_score_codex":0.00012350923,"about_ca_system_score_gemma":0.000016846614,"threshold_uncertainty_score":0.8950269},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045401644,0.0002858868,0.9459969,0.00089777005,0.00008776942,0.0005224248,0.000084804306,0.00085268804,0.005870155],"genre_scores_gemma":[0.97174615,0.000060063543,0.027448826,0.000057871373,0.000032740845,0.000034333392,0.0004664336,0.00012189824,0.00003170697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838674,0.00027306585,0.00041249697,0.00036044387,0.00027069295,0.00029656797],"domain_scores_gemma":[0.99733275,0.000098215765,0.00007501465,0.0023284764,0.00006783631,0.000097701944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041618382,0.0002453525,0.00018677438,0.00026380847,0.0002935234,0.00004392711,0.0008564473,0.000045384913,0.000016989106],"category_scores_gemma":[0.000006170192,0.0002612875,0.000031278327,0.0011008867,0.000051731193,0.00015564916,0.000025553963,0.0005086206,0.00016634227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018566627,0.00018577458,0.0000030402855,0.000030185683,0.00003515393,0.0000059067497,0.00031968902,0.99722475,0.00028713702,0.00036041014,0.000028206268,0.0015011517],"study_design_scores_gemma":[0.0013143308,0.000046037254,0.0007358286,0.00040558793,0.00005220618,0.000037650647,0.00032442363,0.9941904,0.0010914466,0.0000095713895,0.001422594,0.0003699355],"about_ca_topic_score_codex":0.000053646327,"about_ca_topic_score_gemma":0.0007689434,"teacher_disagreement_score":0.92634445,"about_ca_system_score_codex":0.00046805633,"about_ca_system_score_gemma":0.000052373663,"threshold_uncertainty_score":0.9999839},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05529193,0.00023401657,0.90246505,0.00074447,0.000076816454,0.00047880827,0.000026078586,0.0006961641,0.039986663],"genre_scores_gemma":[0.9899362,0.0008645118,0.008761631,0.00014898792,0.000008314452,0.000056870882,0.000015226931,0.00007484418,0.00013343798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983476,0.00045744985,0.00065377407,0.00017090038,0.00011261509,0.0002576799],"domain_scores_gemma":[0.99674106,0.0012010512,0.000117374024,0.0017936574,0.00008937757,0.000057501005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011260364,0.00021306994,0.00020338033,0.00035952724,0.0002750263,0.00002975276,0.0013601002,0.000052956326,0.000099130884],"category_scores_gemma":[0.000051291005,0.00019684075,0.00009477434,0.00072150066,0.00018171279,0.00013970211,0.00002186948,0.0009662725,0.000071482355],"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.00020222683,0.0018436986,0.00016412883,0.00011281506,0.0002934471,0.000009121988,0.009300261,0.6589537,0.12495928,0.023169765,0.0005917726,0.18039973],"study_design_scores_gemma":[0.00203471,0.00075871026,0.013854865,0.0019959402,0.0001230571,0.000019133839,0.0061762556,0.09552883,0.8526309,0.0040709297,0.020738648,0.0020679834],"about_ca_topic_score_codex":0.000023462675,"about_ca_topic_score_gemma":0.0002864308,"teacher_disagreement_score":0.9346442,"about_ca_system_score_codex":0.00014636946,"about_ca_system_score_gemma":0.00001982265,"threshold_uncertainty_score":0.80269325},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040759135,0.0005724772,0.9924837,0.0021419618,0.0005064319,0.00060468505,0.0000137846255,0.0006234721,0.0026459065],"genre_scores_gemma":[0.66100675,0.0010259454,0.33534732,0.00078675913,0.000031382355,0.00006050474,0.000023118537,0.000047088193,0.0016711522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770683,0.0005276317,0.0006325231,0.00045715625,0.00016828864,0.0005075481],"domain_scores_gemma":[0.99593383,0.00072548504,0.00019142816,0.0025821258,0.00036350478,0.00020362494],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0017508363,0.00027752953,0.00023699047,0.00038466728,0.0018608783,0.00023681117,0.0029067164,0.00006159118,0.000038322283],"category_scores_gemma":[0.00009421543,0.00029252368,0.00022318949,0.00092094974,0.00013149454,0.0004461011,0.00010325382,0.00063767185,0.00023571536],"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.00011710408,0.0063119126,0.00014254497,0.000049728787,0.0004880312,0.00001891071,0.017259832,0.0054732277,0.028734207,0.06989294,0.001486776,0.8700248],"study_design_scores_gemma":[0.0035865735,0.00034947286,0.0045305784,0.00021405882,0.000049590046,0.00003511717,0.00059722154,0.9028281,0.0026607104,0.00006896819,0.08408567,0.0009939146],"about_ca_topic_score_codex":0.0000062743625,"about_ca_topic_score_gemma":0.00015097581,"teacher_disagreement_score":0.8973549,"about_ca_system_score_codex":0.00009753349,"about_ca_system_score_gemma":0.000050226707,"threshold_uncertainty_score":0.9999527},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05559861,0.000098634606,0.9406665,0.00056729786,0.0000892455,0.00028119172,0.000016176353,0.00016556431,0.002516767],"genre_scores_gemma":[0.7204547,0.0013320539,0.2777386,0.00008648036,0.000009357004,0.000050704777,0.000019644796,0.000016292148,0.0002921727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987067,0.00026275113,0.00041972517,0.00029615007,0.00011898177,0.00019567039],"domain_scores_gemma":[0.9976003,0.00033970887,0.00018104137,0.0014915429,0.00029620584,0.00009115534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007042841,0.00015743823,0.0002206904,0.00051332347,0.0010368578,0.00009277853,0.0011858516,0.000053300897,0.000039520743],"category_scores_gemma":[0.000060942482,0.00016529817,0.00015148273,0.0016124336,0.00010616196,0.00036440618,0.000055514953,0.00059053337,0.000021057802],"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.000048098096,0.001962468,0.0044942005,0.00006110786,0.001550097,3.49317e-7,0.0055434215,0.016728202,0.059578333,0.041151457,0.00019444204,0.8686878],"study_design_scores_gemma":[0.0004904707,0.00014509553,0.016230019,0.00003156329,0.0002277929,0.000004751151,0.00007406481,0.96893144,0.001756068,0.000011117608,0.011837202,0.000260448],"about_ca_topic_score_codex":0.000008573575,"about_ca_topic_score_gemma":0.00023038937,"teacher_disagreement_score":0.9522032,"about_ca_system_score_codex":0.000028892355,"about_ca_system_score_gemma":0.000043127046,"threshold_uncertainty_score":0.7974777},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1381657,0.0014740237,0.7369466,0.0015569833,0.00056799257,0.00092684786,0.00006950415,0.0011008289,0.119191565],"genre_scores_gemma":[0.9932599,0.00091715285,0.004358954,0.000077449375,0.000033971603,0.0001340953,0.00005527925,0.000077369245,0.0010858134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985946,0.00036860886,0.00047166224,0.00018381297,0.00011933286,0.00026198028],"domain_scores_gemma":[0.9977427,0.0001567789,0.000036614783,0.0018774853,0.000056106033,0.0001303215],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003497207,0.00019023987,0.0001836675,0.0005192227,0.0002661623,0.000083789586,0.0008558021,0.000044167566,0.000098041484],"category_scores_gemma":[0.000016574586,0.00021882803,0.00007422134,0.0009700406,0.000027177668,0.00018485164,0.00001563069,0.0004055216,0.0009086588],"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.00004181864,0.0013349596,0.00030844315,0.00007153442,0.00015920578,0.00004732207,0.0023072779,0.8528959,0.012023846,0.0017024728,0.0043954435,0.12471178],"study_design_scores_gemma":[0.0019412581,0.00024997172,0.029382745,0.00060369656,0.0001182139,0.00012217506,0.0016408414,0.12991212,0.005414859,0.000071918024,0.82870996,0.001832217],"about_ca_topic_score_codex":0.00008339072,"about_ca_topic_score_gemma":0.0003699544,"teacher_disagreement_score":0.8550942,"about_ca_system_score_codex":0.0001502774,"about_ca_system_score_gemma":0.000015096484,"threshold_uncertainty_score":0.9998692},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065052286,0.0052803615,0.9416738,0.0008500538,0.00019563436,0.0016461044,0.00022626609,0.0013766225,0.042245924],"genre_scores_gemma":[0.9271861,0.006565248,0.06479944,0.000336934,0.00006312445,0.00031501884,0.00017864212,0.00019881406,0.00035669113],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99776036,0.00040675828,0.0008315054,0.00029959448,0.00021543282,0.0004863577],"domain_scores_gemma":[0.9951212,0.0004324946,0.00015407173,0.0037537746,0.0002935057,0.00024499657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055988645,0.00038860625,0.00032845538,0.0004185556,0.0012536484,0.0002908796,0.0024837253,0.000090198024,0.00007372284],"category_scores_gemma":[0.00000966285,0.00044674997,0.00020294377,0.0009589464,0.00011010001,0.00046451442,0.00004461754,0.00054588844,0.00026889652],"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.00008730168,0.00067303836,0.00031616385,0.00027023046,0.0002981005,0.0000016376875,0.0066222744,0.07019596,0.10013407,0.00029042218,0.000058461123,0.8210524],"study_design_scores_gemma":[0.0014354517,0.00019409315,0.0017453936,0.0007492431,0.00020248305,0.000080161684,0.0031271446,0.10370474,0.006942259,0.00018193299,0.88014555,0.0014915366],"about_ca_topic_score_codex":0.000039644026,"about_ca_topic_score_gemma":0.00017706609,"teacher_disagreement_score":0.9206809,"about_ca_system_score_codex":0.00027844618,"about_ca_system_score_gemma":0.00004684952,"threshold_uncertainty_score":0.9997984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009438112,0.00015753435,0.98730063,0.0010195108,0.00015921467,0.00050919567,0.0000152453395,0.0001586704,0.001241861],"genre_scores_gemma":[0.9275837,0.0006593871,0.070629925,0.00021398556,0.000032259624,0.00015162237,0.000014201401,0.000027058933,0.00068785535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845374,0.00018733615,0.00056042924,0.00034439197,0.00014339546,0.00031073],"domain_scores_gemma":[0.9979672,0.0003256117,0.0001616089,0.001318027,0.00013394511,0.00009362392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039626876,0.00019024695,0.00024506144,0.00018043992,0.00043566985,0.000028105034,0.0013704834,0.00005290144,0.000012266278],"category_scores_gemma":[0.000008678341,0.00020450189,0.00016350091,0.00055053044,0.000117597425,0.00021808334,0.000020337444,0.0003493128,0.000015970454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023361632,0.0009059983,0.000004045781,0.0000054849575,0.000031652693,7.8397187e-7,0.0007417078,0.8025695,0.00021110481,0.0039104978,0.00020124896,0.19139463],"study_design_scores_gemma":[0.0011261976,0.00010669768,0.00022993807,0.000043109805,0.000015678695,0.000008645588,0.000022939128,0.9972413,0.00015204787,0.0000195212,0.00083846954,0.00019542889],"about_ca_topic_score_codex":0.000007960662,"about_ca_topic_score_gemma":0.000109000095,"teacher_disagreement_score":0.9181456,"about_ca_system_score_codex":0.000066314984,"about_ca_system_score_gemma":0.00010542229,"threshold_uncertainty_score":0.8339345},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033561955,0.00010277189,0.9571959,0.000055412536,0.00019151233,0.00024791018,0.000020897156,0.00093740487,0.03789201],"genre_scores_gemma":[0.90680146,0.0002700632,0.09204285,0.00006553596,0.00010247851,0.000013404816,0.00009827189,0.00011968591,0.0004862219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989006,0.000104794504,0.0003698746,0.00018998572,0.00014377593,0.0002909747],"domain_scores_gemma":[0.99883103,0.00019268855,0.00006080036,0.0007453561,0.00007218396,0.00009792043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029862908,0.00020065144,0.00013703322,0.0002557964,0.00038997992,0.00003729782,0.00032194323,0.000057520032,0.00021065604],"category_scores_gemma":[0.000008805553,0.0002415118,0.00008108371,0.00058671465,0.000049696744,0.00031479858,0.00000762178,0.0004274961,0.0004991129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011664538,0.00006979546,0.0000026042167,0.000003270101,0.000033846416,0.0000013150102,0.00021892197,0.9359263,0.0009083637,0.000060205857,0.00008828251,0.06267544],"study_design_scores_gemma":[0.00034091703,0.000041886422,0.00068494916,0.00004222836,0.000021382926,0.000004995719,0.000036799593,0.9921519,0.0019140292,0.000045200683,0.0044286265,0.00028704206],"about_ca_topic_score_codex":0.000003110068,"about_ca_topic_score_gemma":0.000010467146,"teacher_disagreement_score":0.9034453,"about_ca_system_score_codex":0.00014603145,"about_ca_system_score_gemma":0.000008429824,"threshold_uncertainty_score":0.98485655},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010958809,0.00035025013,0.98405886,0.00058035745,0.000057724137,0.00022605486,0.000003828414,0.00013424513,0.0036298875],"genre_scores_gemma":[0.9168129,0.00077578373,0.08214766,0.0001684033,0.000007105395,0.000010484611,0.000012198604,0.000019154792,0.000046325986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981672,0.00054926396,0.000620965,0.0002647801,0.0001406722,0.00025711334],"domain_scores_gemma":[0.9975868,0.0007679346,0.00018756991,0.0012371582,0.00012471728,0.000095847325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013710313,0.00016225051,0.00022265152,0.00038418363,0.0005174691,0.000092050606,0.0009913346,0.00004966551,0.000010745811],"category_scores_gemma":[0.00005716563,0.00018256142,0.00006586369,0.0008256359,0.00010701763,0.00032775252,0.00005945196,0.0005373774,0.000006213178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006941901,0.0013847809,0.007065517,0.00002790834,0.00004314336,0.0000024258543,0.0052180146,0.5470431,0.010817184,0.01838637,0.00017411466,0.40976802],"study_design_scores_gemma":[0.0006322792,0.000053931253,0.017099276,0.00011200288,0.000007057685,0.0000016936596,0.00016086604,0.9798791,0.0014444992,0.000034095112,0.00039903895,0.00017619571],"about_ca_topic_score_codex":0.000010674226,"about_ca_topic_score_gemma":0.00086394924,"teacher_disagreement_score":0.90585405,"about_ca_system_score_codex":0.00008613304,"about_ca_system_score_gemma":0.000034705736,"threshold_uncertainty_score":0.74446386},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5249708,0.0012713143,0.25646725,0.0009342599,0.00033565462,0.0010911754,0.00035922712,0.00086741475,0.2137029],"genre_scores_gemma":[0.9942404,0.0014626201,0.004118653,0.00003438766,0.000007456799,0.000025030744,0.000039530616,0.0000469047,0.000025033904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988727,0.00018576156,0.00048362472,0.0001681208,0.00010985314,0.0001799291],"domain_scores_gemma":[0.9990118,0.000067237466,0.000069772796,0.00071543857,0.000063075786,0.00007263992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024527605,0.00017009905,0.00020225762,0.00038299113,0.00011858315,0.000021216665,0.00029832651,0.000050198345,0.0000733004],"category_scores_gemma":[0.00002473808,0.00019500412,0.000060537623,0.00055473583,0.00012534326,0.00021177354,0.0000010387317,0.00046733723,0.000060288872],"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.0000347502,0.0018570864,0.00038153416,0.00013909984,0.00024262308,0.000026675036,0.0060015735,0.47808334,0.4500122,0.0076267393,0.0003030904,0.055291276],"study_design_scores_gemma":[0.032827854,0.0030324005,0.18174085,0.004358433,0.0006783425,0.00047709732,0.005828634,0.04886094,0.69642305,0.014147479,0.00633697,0.005287969],"about_ca_topic_score_codex":0.00011421675,"about_ca_topic_score_gemma":0.00019421318,"teacher_disagreement_score":0.46926957,"about_ca_system_score_codex":0.00021864763,"about_ca_system_score_gemma":0.000037664548,"threshold_uncertainty_score":0.7952037},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00773043,0.0007876744,0.98558414,0.00037988083,0.0002551322,0.00064493093,0.0001000926,0.0015180027,0.0029997223],"genre_scores_gemma":[0.8684037,0.0038817718,0.12700775,0.000063112304,0.000030940108,0.00025070566,0.00004857729,0.00012568984,0.00018779756],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883974,0.000118656535,0.00042225406,0.00025100252,0.00009105639,0.00027731247],"domain_scores_gemma":[0.9978574,0.0003867512,0.0000764791,0.0014665625,0.00010149119,0.00011131756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003057912,0.0002542888,0.00020974812,0.00021000046,0.0005720754,0.000078543606,0.00073529547,0.00009033182,0.000075714066],"category_scores_gemma":[0.00003800925,0.00029131485,0.00010876021,0.00032468824,0.00014788793,0.00033160258,0.000014319595,0.0010318515,0.000029239263],"study_design_candidate":"design_other","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.00006686516,0.0006771176,0.000055622833,0.00023764497,0.00028777588,0.0000014780759,0.0023497012,0.010225115,0.16769065,0.013377515,0.000708198,0.8043223],"study_design_scores_gemma":[0.002637904,0.000220904,0.0023141918,0.00050551764,0.00019760469,0.00004861665,0.00022477997,0.35016283,0.056804463,0.002474578,0.5826102,0.0017984007],"about_ca_topic_score_codex":0.000004214566,"about_ca_topic_score_gemma":0.00003215686,"teacher_disagreement_score":0.86067325,"about_ca_system_score_codex":0.000035409124,"about_ca_system_score_gemma":0.000016221444,"threshold_uncertainty_score":0.9999539},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0082234815,0.00021899547,0.9633368,0.0010604995,0.000090981244,0.00032414045,0.0000122382635,0.00038367332,0.026349146],"genre_scores_gemma":[0.96592885,0.0015412804,0.03113154,0.000105265164,0.00001950562,0.000077547826,0.000012917457,0.00003250035,0.0011506055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968973,0.001574037,0.0005752732,0.0003059832,0.00036177115,0.00028562857],"domain_scores_gemma":[0.9951452,0.00064609497,0.00021098788,0.0035890194,0.0002736276,0.00013508135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007312153,0.00017368073,0.00021802951,0.0003818771,0.001181354,0.00005843336,0.0026424604,0.00004109923,0.000105011975],"category_scores_gemma":[0.00005143637,0.00018580485,0.00017926501,0.0012544207,0.00028441515,0.0004965713,0.00008072122,0.0006118767,0.00033683798],"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.00042888283,0.007254104,0.00033927878,0.00009203731,0.00066179154,0.000047428737,0.01054552,0.32647598,0.07755853,0.044243105,0.0011388413,0.5312145],"study_design_scores_gemma":[0.018374225,0.0014756492,0.03246489,0.00034398076,0.00011732834,0.00042798466,0.000760485,0.5340192,0.2897311,0.0013151601,0.11835527,0.0026147983],"about_ca_topic_score_codex":0.0000610566,"about_ca_topic_score_gemma":0.00009800948,"teacher_disagreement_score":0.9577054,"about_ca_system_score_codex":0.00007483035,"about_ca_system_score_gemma":0.00008711443,"threshold_uncertainty_score":0.9086139},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069360416,0.00022744571,0.98854494,0.0021540618,0.00007127855,0.0006787733,0.000043640015,0.0003039303,0.001039912],"genre_scores_gemma":[0.7007973,0.000738172,0.2973734,0.00011035598,0.000016346272,0.000084451574,0.00007939322,0.00003360457,0.0007669552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974975,0.0006188158,0.00059089623,0.00051462854,0.00027149892,0.0005066556],"domain_scores_gemma":[0.9952989,0.0010834556,0.0002279629,0.0027959947,0.00036464146,0.00022903518],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0027682951,0.0002651087,0.00028094838,0.00088041765,0.0015878918,0.00029097954,0.0022583485,0.000081877704,0.000013192296],"category_scores_gemma":[0.00006949323,0.0002828309,0.00017551225,0.0024153215,0.00019335399,0.00065074075,0.000107897715,0.0006249625,0.000059958355],"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.00017051469,0.0016258315,0.00024398457,0.000058425525,0.00096799503,0.0000029227692,0.004765293,0.30777493,0.00041505773,0.0031480726,0.0001963244,0.6806307],"study_design_scores_gemma":[0.0010922869,0.000118099,0.04674892,0.000025084597,0.00010360215,0.000006330752,0.00009974373,0.9496119,0.0010658826,0.000042929696,0.00078604976,0.0002991564],"about_ca_topic_score_codex":0.00003491213,"about_ca_topic_score_gemma":0.00040824342,"teacher_disagreement_score":0.69386125,"about_ca_system_score_codex":0.00010888001,"about_ca_system_score_gemma":0.0000634384,"threshold_uncertainty_score":0.9999624},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009205408,0.0020912443,0.9294428,0.0009149972,0.00013107408,0.00040072826,0.000047235662,0.0014687456,0.056297757],"genre_scores_gemma":[0.9694463,0.0033672454,0.026376054,0.000023179715,0.000023756958,0.00007334572,0.000052125266,0.00006869531,0.0005692792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872285,0.00031315142,0.00051705743,0.00012361567,0.00013880097,0.00018452921],"domain_scores_gemma":[0.9976248,0.0004425774,0.00010868326,0.0016857996,0.000104190476,0.00003395105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030615792,0.00016710561,0.00014009963,0.00016567594,0.0007970898,0.000046903846,0.000881014,0.000041694777,0.000022210392],"category_scores_gemma":[0.000013665829,0.00015391238,0.000096222626,0.00041173256,0.0001855403,0.00019604212,0.000016902046,0.0004278421,0.000057385507],"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.000029210903,0.00067333557,0.0001132033,0.00005976398,0.00017891251,0.0000018594035,0.0008680941,0.48501965,0.05429239,0.01899129,0.004806629,0.43496567],"study_design_scores_gemma":[0.0010125384,0.00023212138,0.012308186,0.00029659373,0.00013024251,0.000023816921,0.00060300657,0.073864736,0.30802965,0.00253998,0.5997542,0.001204921],"about_ca_topic_score_codex":0.000025462514,"about_ca_topic_score_gemma":0.00011073998,"teacher_disagreement_score":0.9602409,"about_ca_system_score_codex":0.00007857249,"about_ca_system_score_gemma":0.000015466665,"threshold_uncertainty_score":0.62763643},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2531301,0.00033079615,0.65981483,0.00096324034,0.00011681664,0.0003332437,0.000022656162,0.00021599935,0.08507231],"genre_scores_gemma":[0.94161534,0.00053739676,0.05722098,0.00003624241,0.000009085691,0.000020017183,0.000011199439,0.000017230435,0.00053253287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985383,0.00044107542,0.0004055198,0.00024220945,0.00017367913,0.00019921048],"domain_scores_gemma":[0.9982927,0.0001940824,0.00013385332,0.001294184,0.000049143695,0.000036040412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029251308,0.00013455171,0.00014891355,0.00023022458,0.00022461938,0.000033285385,0.0010887015,0.0000305949,0.000027725204],"category_scores_gemma":[0.0000034475975,0.00014356921,0.000051959807,0.00076546834,0.00012854449,0.00019399408,0.000026445547,0.00026421345,0.000085085165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000651824,0.00063474657,0.0003604834,0.0000043695613,0.0000095407195,0.0000015553503,0.00029509375,0.9817302,0.00070979545,0.0041598883,0.000070856986,0.012016923],"study_design_scores_gemma":[0.0019773676,0.00072345993,0.16308081,0.00026642808,0.000036555215,0.000017946792,0.00027564846,0.7666385,0.03155915,0.00013863949,0.03424124,0.0010442478],"about_ca_topic_score_codex":0.00004232824,"about_ca_topic_score_gemma":0.000119771175,"teacher_disagreement_score":0.6884852,"about_ca_system_score_codex":0.00007738457,"about_ca_system_score_gemma":0.000029822177,"threshold_uncertainty_score":0.5854583},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053620903,0.00015869654,0.9874948,0.00177141,0.00006607642,0.0011728767,0.000002844674,0.0005204193,0.008276616],"genre_scores_gemma":[0.8828445,0.00051152805,0.11497464,0.0002877216,0.000045468725,0.0005390448,0.00013255877,0.0000470068,0.0006175185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727505,0.0010358068,0.0006291133,0.0003844954,0.00026767224,0.00040787336],"domain_scores_gemma":[0.9963569,0.0010630741,0.00021125644,0.002053956,0.0001845705,0.00013020923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010563255,0.00021655987,0.00017905077,0.0004207597,0.0007811466,0.0002190313,0.0020915929,0.000086048334,0.00014860548],"category_scores_gemma":[0.000029692308,0.00024994323,0.00011741487,0.00071696984,0.000066093045,0.0005937581,0.000043684027,0.00082580885,0.0003252404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012842407,0.00054509914,0.000017151986,0.0000072108737,0.000011050811,2.5294983e-7,0.0009835169,0.9294458,0.00022040923,0.00038142572,0.00020098746,0.06817423],"study_design_scores_gemma":[0.0012394481,0.00019757713,0.0004886348,0.000021211894,0.000008787615,9.947753e-7,0.00008871388,0.9556645,0.0023098506,0.000010529273,0.039734323,0.00023541521],"about_ca_topic_score_codex":0.000014565095,"about_ca_topic_score_gemma":0.00008258094,"teacher_disagreement_score":0.8823083,"about_ca_system_score_codex":0.00029024723,"about_ca_system_score_gemma":0.00012543295,"threshold_uncertainty_score":0.9999953},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5484299,0.0005636047,0.42640635,0.0015719509,0.00012324756,0.0012482482,0.0000373084,0.00056070247,0.02105871],"genre_scores_gemma":[0.99751115,0.00073025434,0.0014522058,0.00017301869,0.0000065439854,0.000026531301,0.0000063575767,0.000039881492,0.000054076572],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989385,0.0003222809,0.0003263467,0.00012230739,0.00015392152,0.00013664317],"domain_scores_gemma":[0.9954974,0.0025872227,0.00012260844,0.0016529786,0.00009785763,0.000041945856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000514948,0.000159324,0.0001469322,0.00017060779,0.00050924125,0.0000130968465,0.0009137321,0.00004330615,0.00003883632],"category_scores_gemma":[0.00011257509,0.00012069069,0.0000745581,0.00039788467,0.00024311479,0.00009104567,0.0000546396,0.000555047,0.000018254888],"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.00040156647,0.0039773392,0.00071612524,0.0007841568,0.0013455235,0.0000032067678,0.02358244,0.028583053,0.078079954,0.17635469,0.0030663782,0.6831056],"study_design_scores_gemma":[0.0016977615,0.0015275738,0.06899166,0.002202745,0.0003287819,0.000013123183,0.004987565,0.014828823,0.8969869,0.0031004024,0.004139063,0.0011956207],"about_ca_topic_score_codex":0.000015888922,"about_ca_topic_score_gemma":0.000044541637,"teacher_disagreement_score":0.8189069,"about_ca_system_score_codex":0.00008194371,"about_ca_system_score_gemma":0.0000079147985,"threshold_uncertainty_score":0.49216235},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025038002,0.00009438367,0.9723755,0.0040807338,0.00009256371,0.0017488607,0.0000133637195,0.0003860371,0.018704738],"genre_scores_gemma":[0.9815446,0.00029377884,0.014422508,0.002554246,0.000045040317,0.00070294866,0.000012346385,0.000032898588,0.00039163692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969971,0.0015240576,0.00055483496,0.00037770323,0.00017463336,0.00037162978],"domain_scores_gemma":[0.9970277,0.0005965623,0.00009643108,0.0020649445,0.00007650487,0.0001378347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008839537,0.00020393562,0.00023260702,0.00012768032,0.00042835702,0.00015689542,0.0020851516,0.00006719069,0.0003853001],"category_scores_gemma":[0.0000057477655,0.00021263947,0.00010188438,0.0010647444,0.00005597714,0.0003738715,0.000016843553,0.0007215587,0.0005477361],"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.000030946998,0.00053783174,0.000103769926,0.0000063994817,0.000023611226,0.000004076142,0.00060206646,0.18073949,0.000029536308,0.0008638123,0.00019322838,0.8168652],"study_design_scores_gemma":[0.0019791569,0.000078330035,0.02689771,0.00010530943,0.0000100004,0.000008377855,0.000040626015,0.93964267,0.00003948143,0.00012835933,0.03062021,0.00044976576],"about_ca_topic_score_codex":0.00023723612,"about_ca_topic_score_gemma":0.0007863336,"teacher_disagreement_score":0.9790408,"about_ca_system_score_codex":0.000058222617,"about_ca_system_score_gemma":0.000042030668,"threshold_uncertainty_score":0.8671186},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025802804,0.0001881649,0.9928453,0.00058770605,0.000073504976,0.0012263346,0.00015221913,0.0024395871,0.0022291827],"genre_scores_gemma":[0.5902311,0.0000678707,0.40876713,0.000044989025,0.000020446867,0.00029920103,0.0002170733,0.00007990613,0.0002722556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986582,0.00016491789,0.0004587346,0.00026300305,0.00015557912,0.00029960007],"domain_scores_gemma":[0.9973974,0.0005297594,0.000114602655,0.0017237347,0.00013210048,0.00010240104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002589573,0.00029467372,0.0002203562,0.00037354804,0.001023977,0.00005565626,0.0010596705,0.00009963038,0.000026966662],"category_scores_gemma":[0.00004728864,0.00036090493,0.0001822806,0.00039098694,0.00007934883,0.00031444378,0.00004951576,0.0004761424,0.000074182804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004852119,0.0005490855,0.000099843564,0.000107351254,0.00007296672,8.7347524e-7,0.00027257897,0.9158669,0.008726718,0.00065367756,0.006297172,0.06730429],"study_design_scores_gemma":[0.0021053362,0.00014965187,0.0016388949,0.00021125183,0.00008837509,0.0000051156135,0.00007837451,0.7122871,0.21145186,0.001986984,0.068982884,0.0010141392],"about_ca_topic_score_codex":0.00011714343,"about_ca_topic_score_gemma":0.0002254945,"teacher_disagreement_score":0.5899731,"about_ca_system_score_codex":0.00021163233,"about_ca_system_score_gemma":0.000034584413,"threshold_uncertainty_score":0.9998843},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020221632,0.0005451165,0.9788236,0.010413818,0.000049916147,0.00046170913,0.0000087241615,0.00012550651,0.0075494363],"genre_scores_gemma":[0.9709331,0.0044573327,0.02322456,0.0011764878,0.0000087808,0.000061167026,0.00004181488,0.000008787753,0.00008798495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962856,0.0021184664,0.0008686644,0.00026369697,0.00021331168,0.00025023537],"domain_scores_gemma":[0.9964465,0.0005996235,0.0002822791,0.002301427,0.0002927574,0.00007741647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015479987,0.00021675396,0.00026954222,0.00060100487,0.0008298702,0.00017944939,0.002890432,0.000052813797,0.00007777367],"category_scores_gemma":[0.00006253,0.00017684654,0.00021053731,0.0037945348,0.00010523344,0.0012361225,0.00003180156,0.00074786565,0.000030451803],"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.00003364607,0.0011654769,0.00011449885,0.000013709668,0.00025613056,0.0000020457833,0.020594304,0.035952333,0.006130145,0.017817358,0.0002767562,0.9176436],"study_design_scores_gemma":[0.0016753038,0.0005888167,0.045152567,0.00027354326,0.0003309225,0.000012912781,0.0007134219,0.93336487,0.0033364277,0.00076765014,0.012900848,0.00088274607],"about_ca_topic_score_codex":0.000038338727,"about_ca_topic_score_gemma":0.0001010429,"teacher_disagreement_score":0.96891093,"about_ca_system_score_codex":0.00005912864,"about_ca_system_score_gemma":0.00008654663,"threshold_uncertainty_score":0.7211593},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094391074,0.000121288846,0.88611823,0.00009641844,0.00009142537,0.00044741755,0.00003471095,0.00069706934,0.11144955],"genre_scores_gemma":[0.82851166,0.0002966114,0.16957375,0.00009353363,0.000040966534,0.000071162984,0.000089231355,0.00012286448,0.0012002374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900687,0.00006385154,0.00032929843,0.00018071737,0.00010979866,0.0003094748],"domain_scores_gemma":[0.99873763,0.00018688412,0.000040190756,0.0009071863,0.00003997716,0.0000881294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031785262,0.00016759417,0.00010883815,0.00021180915,0.0004027223,0.000027079288,0.00038386407,0.00003470108,0.000038946437],"category_scores_gemma":[0.0000038033081,0.00019657139,0.00008856096,0.00040576866,0.000043238044,0.000041559706,0.0000067058813,0.00023604774,0.00009843184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014952716,0.000098338634,5.9571494e-7,0.000017010158,0.00003903716,8.496036e-7,0.00017741285,0.9146939,0.000056165874,0.00064443145,0.00053446606,0.08372282],"study_design_scores_gemma":[0.000845845,0.000056404675,0.00034447407,0.00007042806,0.000070603506,0.0000054162247,0.0003965296,0.773072,0.0015969573,0.000067124216,0.22303155,0.00044263483],"about_ca_topic_score_codex":0.0000012620229,"about_ca_topic_score_gemma":0.000018145898,"teacher_disagreement_score":0.8275677,"about_ca_system_score_codex":0.0001340295,"about_ca_system_score_gemma":0.000003649245,"threshold_uncertainty_score":0.80159485},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037841286,0.00009382672,0.9916236,0.0042340034,0.00009946482,0.00117564,0.000088355606,0.0007606508,0.001546087],"genre_scores_gemma":[0.56191325,0.00029024848,0.43677837,0.00046650687,0.000015379028,0.00025788412,0.000063852785,0.000034568675,0.00017994159],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981867,0.00028599813,0.0005374003,0.00048531228,0.00017671516,0.0003278814],"domain_scores_gemma":[0.9941814,0.001332767,0.00019248005,0.0038585963,0.00022792623,0.00020683618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011013848,0.00021860209,0.00018313868,0.0004346995,0.0010809052,0.0001689935,0.0026217264,0.00004755036,0.000005322879],"category_scores_gemma":[0.00007721979,0.00024304059,0.00007491468,0.0007940754,0.00012159115,0.00055469334,0.00016778773,0.00032606567,0.0000767684],"study_design_candidate":"design_other","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.0000342192,0.00039068147,0.000008870266,0.000016780694,0.000027386019,8.1644555e-7,0.0011922088,0.0011688864,0.006025285,0.02729849,0.0004610088,0.9633754],"study_design_scores_gemma":[0.0023477909,0.0011668595,0.008861292,0.00037577542,0.000092196045,0.00007720331,0.00048612242,0.35161582,0.07033648,0.012964721,0.5493101,0.002365668],"about_ca_topic_score_codex":0.0000226441,"about_ca_topic_score_gemma":0.000103054066,"teacher_disagreement_score":0.9610097,"about_ca_system_score_codex":0.0000879344,"about_ca_system_score_gemma":0.00003056717,"threshold_uncertainty_score":0.9910908},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008403261,0.00020916875,0.9736982,0.000066277375,0.000034674456,0.0003160008,0.00005086546,0.0016366496,0.015584876],"genre_scores_gemma":[0.8976353,0.0012757397,0.10078224,0.000033048625,0.000005581224,0.000058529306,0.000080722544,0.000084427156,0.000044409968],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905115,0.00017499358,0.00027102814,0.00023646603,0.000096934775,0.00016943095],"domain_scores_gemma":[0.997023,0.000086722495,0.00005334369,0.0026992485,0.000055500528,0.000082197555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021464692,0.00019153574,0.0001320028,0.00020667803,0.00039984667,0.000038065504,0.0009232082,0.00004054393,0.00003928166],"category_scores_gemma":[0.000011646779,0.000196532,0.000021307977,0.00032699198,0.00013238723,0.0005752284,0.000034735684,0.00041145761,0.00005241674],"study_design_candidate":"design_other","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.00009477781,0.0006956684,0.00002979583,0.000072538394,0.00023681078,0.000004211863,0.004166897,0.032288335,0.01155056,0.00057034986,0.000120362,0.9501697],"study_design_scores_gemma":[0.002082584,0.0010228296,0.028251244,0.00035467563,0.00027800116,0.00020220847,0.0010605472,0.8075157,0.14537823,0.001137929,0.010734911,0.0019811369],"about_ca_topic_score_codex":0.000029859071,"about_ca_topic_score_gemma":0.00018096833,"teacher_disagreement_score":0.94818854,"about_ca_system_score_codex":0.000048485203,"about_ca_system_score_gemma":0.0000100015595,"threshold_uncertainty_score":0.8014342},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064553574,0.00051752984,0.93007815,0.00014834895,0.00013954425,0.0009303823,0.00007604365,0.0005421239,0.0030142972],"genre_scores_gemma":[0.9870535,0.00376648,0.008691504,0.00002069941,0.000012149653,0.00025526562,0.00003411941,0.000054613614,0.00011168161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987506,0.00019645438,0.000532896,0.00014205178,0.00014083335,0.00023716],"domain_scores_gemma":[0.99763083,0.0008025769,0.00013899486,0.001270514,0.000112923226,0.000044127093],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00051662046,0.00017923112,0.00021498946,0.00028385635,0.0013085908,0.000022449198,0.0011789611,0.00004902029,0.000009100589],"category_scores_gemma":[0.000027765327,0.00017599505,0.00009908001,0.0005629104,0.00016639978,0.00034982784,0.00005574991,0.00049990125,0.0000137055895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012029665,0.00013925183,0.000071989154,0.00006979145,0.00005064862,2.9756814e-7,0.003637272,0.9871746,0.00045948487,0.0011700284,0.000063933214,0.0071507166],"study_design_scores_gemma":[0.0007225076,0.00011015574,0.0021601869,0.0001967836,0.000030845174,0.000013572054,0.0010091867,0.9874714,0.0050992486,0.00007057691,0.0027738288,0.00034172818],"about_ca_topic_score_codex":0.000034331915,"about_ca_topic_score_gemma":0.000022827233,"teacher_disagreement_score":0.9224999,"about_ca_system_score_codex":0.00013562225,"about_ca_system_score_gemma":0.000020581841,"threshold_uncertainty_score":0.9999916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021408012,0.00017461818,0.96436155,0.0017575946,0.00008029466,0.00036234476,0.00001487287,0.00028452757,0.011556189],"genre_scores_gemma":[0.8334132,0.00036954472,0.16579698,0.000057145804,0.000029404586,0.000053416825,0.000034217795,0.000031100473,0.0002149954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977817,0.0006068983,0.0005491938,0.00037396338,0.00039353594,0.00029471083],"domain_scores_gemma":[0.99590594,0.00045900204,0.00017544287,0.0029754264,0.0003576072,0.00012656229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005668323,0.00019987485,0.00018863658,0.00037315575,0.001141243,0.0002362422,0.0026375575,0.000054016324,0.000041750358],"category_scores_gemma":[0.000044978126,0.00019010177,0.000106542444,0.0013523729,0.00032073725,0.0008206164,0.00006547159,0.0006193599,0.00013135727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020767118,0.00067688874,0.0003771562,0.000009259014,0.00008235252,0.000003391886,0.0017986012,0.93452084,0.0042623295,0.029365018,0.000045147557,0.028838253],"study_design_scores_gemma":[0.009677669,0.002111605,0.11208961,0.00094006845,0.00015983735,0.0002756224,0.0011043672,0.67656285,0.1748404,0.0031592322,0.015821233,0.0032574984],"about_ca_topic_score_codex":0.00007113097,"about_ca_topic_score_gemma":0.0003132863,"teacher_disagreement_score":0.81200516,"about_ca_system_score_codex":0.0001566004,"about_ca_system_score_gemma":0.00017191813,"threshold_uncertainty_score":0.8777634},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07788838,0.00011725307,0.91777,0.00027694568,0.0001849071,0.0008276668,0.00018443141,0.0016484096,0.0011020036],"genre_scores_gemma":[0.95287764,0.00073681545,0.045270074,0.00016938277,0.000026126268,0.00028498677,0.00044104163,0.00007947969,0.000114475995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986513,0.0001930514,0.0005720033,0.0001423561,0.0001784908,0.0002627495],"domain_scores_gemma":[0.9979819,0.00031766808,0.00010965508,0.0012502705,0.00024278648,0.00009770343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027458137,0.00025160675,0.00020365231,0.00037385087,0.00086848345,0.000062852785,0.0006657948,0.00008806226,0.000055562028],"category_scores_gemma":[0.000037844122,0.00029003565,0.00015481871,0.00038385944,0.00012003475,0.0008649581,0.000018754283,0.000422891,0.00016235912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002221382,0.0026156756,0.00078526506,0.00023935149,0.00067727146,0.0000034319462,0.017389432,0.78396857,0.03730467,0.0032406226,0.010188498,0.14336507],"study_design_scores_gemma":[0.0010567027,0.000057911588,0.007863461,0.000058811573,0.000019152796,0.000016525404,0.00011123667,0.9655833,0.0069723316,0.00004288205,0.01780483,0.00041282378],"about_ca_topic_score_codex":0.000025323772,"about_ca_topic_score_gemma":0.00003493068,"teacher_disagreement_score":0.8749892,"about_ca_system_score_codex":0.00012088858,"about_ca_system_score_gemma":0.000026174495,"threshold_uncertainty_score":0.9999552},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051684305,0.00012987913,0.9909369,0.0011648359,0.00003180903,0.00037217056,0.00014122139,0.0004620445,0.006244331],"genre_scores_gemma":[0.461415,0.0009503128,0.5355265,0.00023150982,0.000011754153,0.00011084574,0.000114706425,0.000037618607,0.001601727],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981695,0.00044464596,0.00054308726,0.00042390183,0.00016600374,0.0002529056],"domain_scores_gemma":[0.99675244,0.00031716248,0.00015516953,0.0025264246,0.00011909583,0.00012971301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046860432,0.00019946546,0.00030026454,0.0006159669,0.00050832995,0.000075556476,0.0017332514,0.000046069756,0.00046372777],"category_scores_gemma":[0.000012929178,0.00019507429,0.00031330585,0.0018802402,0.00008773669,0.00051105925,0.00002228148,0.00026357148,0.000051001818],"study_design_candidate":"design_other","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.00003895557,0.00072787143,0.000003263655,0.000015139545,0.00035378177,0.0000015478136,0.0008421604,0.020426646,0.005085138,0.0022759726,0.00039292738,0.9698366],"study_design_scores_gemma":[0.00135338,0.0005887965,0.0019058246,0.00022578271,0.00061332237,0.000012830597,0.00008238129,0.46489117,0.050771076,0.0012397582,0.47735843,0.0009572523],"about_ca_topic_score_codex":0.00001261872,"about_ca_topic_score_gemma":0.0000053661706,"teacher_disagreement_score":0.96887934,"about_ca_system_score_codex":0.00003241894,"about_ca_system_score_gemma":0.000033567045,"threshold_uncertainty_score":0.79548985},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.810896,0.0005794654,0.11696098,0.0012101157,0.0000998843,0.00075265346,0.00007719942,0.0012931703,0.06813055],"genre_scores_gemma":[0.9845987,0.0020476726,0.012932863,0.00006673652,0.000011458044,0.00009868837,0.000027010969,0.00007554951,0.00014130639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985111,0.00034608148,0.00058125245,0.00017502514,0.00014029414,0.0002462431],"domain_scores_gemma":[0.9973468,0.00042778562,0.00010201238,0.0020038786,0.00008223494,0.00003729676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037501616,0.00022523428,0.00020299721,0.00031421668,0.0002918116,0.000027157335,0.0012802662,0.000054693868,0.00007328858],"category_scores_gemma":[0.000015112556,0.00020616065,0.000089146095,0.000620321,0.000181017,0.0001573968,0.000028288208,0.0007728292,0.000100247846],"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.000100671285,0.0021211705,0.0006322917,0.00012518604,0.00012044307,0.0000037817802,0.0013388046,0.88864046,0.043963492,0.0032198364,0.0011458169,0.05858805],"study_design_scores_gemma":[0.0021063392,0.0012540879,0.04666985,0.0018022119,0.00011089104,0.000036557412,0.0009165077,0.3883601,0.525683,0.0021060964,0.028824417,0.0021299745],"about_ca_topic_score_codex":0.00003352376,"about_ca_topic_score_gemma":0.00019756034,"teacher_disagreement_score":0.5002804,"about_ca_system_score_codex":0.000116556264,"about_ca_system_score_gemma":0.00002233278,"threshold_uncertainty_score":0.8406988},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040243347,0.00021998523,0.97980505,0.013225601,0.000039101396,0.0008415964,0.00006726427,0.0001802214,0.0015968136],"genre_scores_gemma":[0.8074307,0.0013870527,0.19021022,0.00028439873,0.000017071887,0.00015177026,0.00010378123,0.000031511783,0.0003834945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963453,0.0015180911,0.00069046236,0.0007129458,0.0003085923,0.0004246264],"domain_scores_gemma":[0.99365664,0.0011712933,0.00012142456,0.0046507935,0.00014511502,0.00025472097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001960571,0.00023534386,0.00025396823,0.00037054333,0.0007183501,0.0003209425,0.0053415876,0.000042028394,0.00007754494],"category_scores_gemma":[0.000045140023,0.00024692796,0.00005805991,0.0007048083,0.000116055206,0.0007247465,0.00029427814,0.0006222429,0.00007002004],"study_design_candidate":"design_other","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.00011016408,0.0014950536,0.000044275886,0.000022243545,0.000056619057,0.000005948341,0.0010839623,0.04493876,0.0023360567,0.0076825423,0.00089484476,0.94132954],"study_design_scores_gemma":[0.00309759,0.00087917375,0.01642263,0.00037814313,0.000042036765,0.00005636668,0.00025457042,0.85978115,0.0057231737,0.0012010373,0.11094384,0.0012202678],"about_ca_topic_score_codex":0.00009060958,"about_ca_topic_score_gemma":0.00014421696,"teacher_disagreement_score":0.94010925,"about_ca_system_score_codex":0.00012331089,"about_ca_system_score_gemma":0.000104983184,"threshold_uncertainty_score":0.9999983},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013323283,0.000049545626,0.9827445,0.00019544558,0.00037097515,0.0004675385,0.00014982252,0.0010051018,0.001693793],"genre_scores_gemma":[0.9811535,0.00007872666,0.017662505,0.00004008403,0.00009928684,0.00006875174,0.00008212132,0.00008401339,0.0007309952],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987127,0.00016222277,0.0003809894,0.0002851356,0.00014018729,0.00031872193],"domain_scores_gemma":[0.99851394,0.00024908446,0.000084353596,0.0008298579,0.00017976061,0.00014301839],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00037939395,0.00025877965,0.0002457274,0.00030912447,0.0014048704,0.00010008206,0.0006589309,0.00009467912,0.0001490492],"category_scores_gemma":[0.00003391243,0.00028187936,0.00027870163,0.0003048527,0.00009262945,0.00021749396,0.00002274989,0.0006516267,0.00020096514],"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.0006671422,0.0028211647,0.005833567,0.0010323033,0.0031919703,0.000013060602,0.014366982,0.04881455,0.76265836,0.0019254154,0.004404812,0.15427071],"study_design_scores_gemma":[0.0012804831,0.00013033375,0.0066100415,0.00010775575,0.00040389085,0.000027715783,0.00076939946,0.9746709,0.0032779572,0.00005317195,0.0119718965,0.0006964471],"about_ca_topic_score_codex":0.00028532048,"about_ca_topic_score_gemma":0.0012478165,"teacher_disagreement_score":0.96783024,"about_ca_system_score_codex":0.00009171396,"about_ca_system_score_gemma":0.000019673447,"threshold_uncertainty_score":0.99996334},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14160584,0.00015648149,0.83583736,0.000048901384,0.0001087915,0.00022270324,0.00005084008,0.00026800844,0.021701073],"genre_scores_gemma":[0.9840486,0.00040995865,0.015161363,0.000038098344,0.000013524177,0.000014639613,0.000042678676,0.000057189714,0.000213939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986241,0.00012315539,0.00062453933,0.00018327525,0.00014695807,0.00029797934],"domain_scores_gemma":[0.99833375,0.00034584248,0.00007450565,0.0010866221,0.0000732955,0.000086000065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006443611,0.00018337599,0.00028598873,0.0011628361,0.00012160901,0.000018133615,0.00056969735,0.00004792616,0.00014466132],"category_scores_gemma":[0.000012634301,0.00021344222,0.00015040152,0.0024229037,0.00007331678,0.00017971211,0.0000066055845,0.00043499013,0.00008361078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017859475,0.00021179623,0.00025251645,0.000016300888,0.00030335915,0.0000017973668,0.00094574154,0.96704006,0.0047814273,0.00003956796,0.000021175918,0.026368381],"study_design_scores_gemma":[0.0022209557,0.00045685412,0.24323957,0.0002963408,0.0013540081,0.000012898169,0.0011892482,0.650625,0.07960983,0.00006952191,0.01903451,0.0018912794],"about_ca_topic_score_codex":0.00001573983,"about_ca_topic_score_gemma":0.00014080637,"teacher_disagreement_score":0.84244275,"about_ca_system_score_codex":0.000083936364,"about_ca_system_score_gemma":0.00001269369,"threshold_uncertainty_score":0.8703921},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26078373,0.00013398427,0.734013,0.00008406501,0.0000133669555,0.0002243002,0.000021712192,0.0005545965,0.0041712187],"genre_scores_gemma":[0.942257,0.0010750986,0.056502167,0.000019730556,0.0000027648869,0.000037949343,0.000038227998,0.00003780018,0.000029301831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99902034,0.00017689772,0.00035596348,0.00016115927,0.00012087971,0.00016473983],"domain_scores_gemma":[0.99876237,0.00008360788,0.000083695566,0.000936155,0.00008410484,0.00005004028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017976857,0.00016387587,0.00025686916,0.0008325122,0.0003156104,0.000015781749,0.0005874909,0.00004022145,0.00006578994],"category_scores_gemma":[0.000006407113,0.0001763233,0.00011150179,0.0021175628,0.00008766856,0.00019695774,0.000026528596,0.00040145483,0.000009468151],"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.000016054155,0.0002412739,0.0012349528,0.000010510135,0.00039381595,5.467113e-7,0.00075426884,0.9865661,0.0029018717,0.0010640285,0.0000037554798,0.0068128067],"study_design_scores_gemma":[0.011127853,0.001026677,0.23503436,0.0010451364,0.003956186,0.000029660934,0.0023247076,0.23429881,0.49676085,0.0016150841,0.008904437,0.0038762528],"about_ca_topic_score_codex":0.00013023624,"about_ca_topic_score_gemma":0.0013216115,"teacher_disagreement_score":0.7522673,"about_ca_system_score_codex":0.00026193238,"about_ca_system_score_gemma":0.000017057459,"threshold_uncertainty_score":0.71902555},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003899586,0.00027124077,0.8113208,0.00033257355,0.00005879711,0.0002588191,0.00004140208,0.00304898,0.18076783],"genre_scores_gemma":[0.89784056,0.00094899704,0.09972228,0.00013095746,0.000023989667,0.000032523087,0.00006481916,0.000122704,0.0011131841],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985134,0.00025162278,0.00051340216,0.00020113205,0.00017550073,0.00034492515],"domain_scores_gemma":[0.9969446,0.00045134022,0.00007310456,0.0022827028,0.00010045541,0.0001478001],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007284902,0.00025015726,0.0002046495,0.00031666455,0.00047679726,0.00004737065,0.0010481857,0.00006752888,0.00036977572],"category_scores_gemma":[0.000025110185,0.00029052314,0.00013259353,0.00061552634,0.0001562644,0.00022770825,0.000019737137,0.0007214049,0.0010547237],"study_design_candidate":"design_other","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.0000846257,0.0016448331,0.00015780916,0.00009704184,0.0005506239,0.00002187658,0.0031299007,0.13457306,0.07671526,0.017197836,0.0051877797,0.76063937],"study_design_scores_gemma":[0.002015362,0.0003580308,0.016885135,0.0003937798,0.00021189141,0.00012194139,0.0012092048,0.028025113,0.36105302,0.0025392114,0.58390117,0.0032861263],"about_ca_topic_score_codex":0.000005311547,"about_ca_topic_score_gemma":0.00005527835,"teacher_disagreement_score":0.893941,"about_ca_system_score_codex":0.00013923115,"about_ca_system_score_gemma":0.000015317573,"threshold_uncertainty_score":0.9999547},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054582517,0.0009780058,0.9917971,0.00044318152,0.00010545958,0.000732201,0.000113499176,0.0012336341,0.0040510865],"genre_scores_gemma":[0.51248133,0.0012709502,0.4856384,0.0000370356,0.00002076526,0.00017301094,0.00008194389,0.00007351176,0.00022307398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998619,0.00029074738,0.0005222781,0.00022341433,0.0001343411,0.00021018233],"domain_scores_gemma":[0.99794596,0.00032225472,0.00011157342,0.0013732999,0.00011403499,0.00013287988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003168277,0.00023056992,0.0002334595,0.00025820147,0.0007079773,0.000054418928,0.00042665825,0.00008417929,0.000035717138],"category_scores_gemma":[0.000055797576,0.00026627182,0.00008802712,0.00028425042,0.00007951328,0.00035076923,0.000011889948,0.00042686748,0.0000305627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017925782,0.0002127943,0.000028109305,0.00019500236,0.00023934347,0.0000017529316,0.003377161,0.67502844,0.011038366,0.012144846,0.005926953,0.29178932],"study_design_scores_gemma":[0.0009835081,0.00023914399,0.001842989,0.0002865386,0.00012719493,0.00014639323,0.00032695237,0.94957536,0.012090909,0.0021297757,0.03129599,0.0009552217],"about_ca_topic_score_codex":0.00008355642,"about_ca_topic_score_gemma":0.00003243177,"teacher_disagreement_score":0.5119355,"about_ca_system_score_codex":0.00018538912,"about_ca_system_score_gemma":0.000049855265,"threshold_uncertainty_score":0.99997896},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032098552,0.00043292448,0.9441599,0.0070665926,0.00008421991,0.0010568604,0.000008214451,0.00042768937,0.043553688],"genre_scores_gemma":[0.98205656,0.0010011763,0.015241908,0.00031725515,0.000021494241,0.00037116196,0.0000342372,0.000048607013,0.0009076283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99569625,0.0024027638,0.00056426116,0.0004244844,0.00045917937,0.0004530863],"domain_scores_gemma":[0.99399716,0.0008567956,0.00013059827,0.004767987,0.00013528358,0.00011220508],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014156483,0.00026004936,0.00021971887,0.00034667033,0.0011461196,0.0005292619,0.0052394792,0.000048076447,0.000080036916],"category_scores_gemma":[0.000018716291,0.00020685466,0.00007112335,0.0018012731,0.00018923901,0.00064420444,0.00004533468,0.001120675,0.0007817538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004711804,0.0014824186,0.000015284264,0.000019398169,0.00006138652,0.000011744301,0.003668381,0.8228921,0.000023183724,0.0056178938,0.00056134455,0.1655997],"study_design_scores_gemma":[0.0011423904,0.00061544194,0.005345094,0.00020872669,0.000021533931,0.00012634949,0.0004240562,0.986721,0.00004240343,0.00021949477,0.004673438,0.00046011756],"about_ca_topic_score_codex":0.00017375441,"about_ca_topic_score_gemma":0.00018976216,"teacher_disagreement_score":0.97884667,"about_ca_system_score_codex":0.00015636116,"about_ca_system_score_gemma":0.00011707756,"threshold_uncertainty_score":0.99999624},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56194615,0.000024233741,0.4223135,0.00017768495,0.000046496396,0.00034843857,0.00008869624,0.000086398315,0.014968387],"genre_scores_gemma":[0.9937523,0.00003181465,0.005259843,0.00007382536,0.00009019248,0.000027481234,0.00023191281,0.00008454023,0.0004480741],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99772656,0.0004589039,0.0006717539,0.000405295,0.0002970241,0.0004404691],"domain_scores_gemma":[0.998089,0.00057581,0.00016273296,0.00082512887,0.00012805194,0.00021928665],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007510397,0.00031205895,0.00028543235,0.00028994316,0.00045982713,0.000084503125,0.00049429905,0.000086699794,0.0013384657],"category_scores_gemma":[0.0000037151958,0.00031693178,0.0002174807,0.00062189024,0.00013465533,0.0003431597,0.000016354448,0.0009082966,0.000118236625],"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.00060614594,0.009377767,0.006636856,0.000055883545,0.00040338308,0.000018762968,0.0030858044,0.0050931433,0.2019395,0.0031078241,0.00023010661,0.7694448],"study_design_scores_gemma":[0.009027692,0.00095150253,0.25144157,0.0006996867,0.00048477118,0.00002068784,0.004165026,0.11616761,0.58853716,0.0013335607,0.024082486,0.003088266],"about_ca_topic_score_codex":0.00020664815,"about_ca_topic_score_gemma":0.00009807814,"teacher_disagreement_score":0.7663566,"about_ca_system_score_codex":0.00014846225,"about_ca_system_score_gemma":0.000102926315,"threshold_uncertainty_score":0.9999283},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009964401,0.00006089526,0.94884294,0.0010815677,0.0000807668,0.00046347076,0.000049840164,0.0013270066,0.047097072],"genre_scores_gemma":[0.938808,0.00068726734,0.05911861,0.00026615954,0.000016904445,0.00026110627,0.000071819915,0.00008338283,0.00068670226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891996,0.00024479668,0.00033645832,0.000115908835,0.00016013526,0.00022272584],"domain_scores_gemma":[0.9971137,0.00036596067,0.00008377974,0.002246814,0.00011149406,0.00007826041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034320998,0.00020855945,0.000118978816,0.00015796549,0.0008904793,0.000076112,0.0010179315,0.00005539943,0.0001392695],"category_scores_gemma":[0.000020810721,0.00016601155,0.000054620712,0.00037128123,0.00021055169,0.00052270514,0.000024401954,0.0010026365,0.00047195525],"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.00004563631,0.00018472747,0.0000075745093,0.000020278389,0.00013262131,0.0000013071726,0.0023059864,0.853824,0.009202001,0.0010186288,0.003318661,0.12993854],"study_design_scores_gemma":[0.0015102995,0.00033678403,0.0028727378,0.00012999817,0.00015840735,0.00021053872,0.00094472576,0.13714832,0.20521772,0.00053323124,0.64930874,0.0016284692],"about_ca_topic_score_codex":0.0000096096555,"about_ca_topic_score_gemma":0.0005984121,"teacher_disagreement_score":0.9378116,"about_ca_system_score_codex":0.000085622145,"about_ca_system_score_gemma":0.000021159956,"threshold_uncertainty_score":0.68489367},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19652939,0.00021828992,0.7961987,0.003893989,0.000082467486,0.0006808772,0.000015868762,0.00010349907,0.0022768734],"genre_scores_gemma":[0.9942606,0.0025885832,0.0028208497,0.00013505966,0.00001152566,0.000088939625,0.000027569315,0.00002282759,0.000044065942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731076,0.0012390888,0.00057353376,0.0002568776,0.00032307865,0.00029666565],"domain_scores_gemma":[0.9950323,0.0014464913,0.00024301173,0.0030189941,0.00018855702,0.00007065302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096353877,0.00017722923,0.0002108033,0.00022124706,0.0004253886,0.00008839134,0.004791239,0.00006135466,0.00001465101],"category_scores_gemma":[0.00006708887,0.00014628841,0.000118910764,0.0017724113,0.00025233426,0.00044752215,0.00016212786,0.0009412395,0.00003638376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069409325,0.0020443408,0.0003283433,0.000061781,0.00007709954,0.0000027764968,0.0008165125,0.89146227,0.00035973397,0.032507975,0.00020508852,0.07206466],"study_design_scores_gemma":[0.005266933,0.0017428349,0.4543498,0.0024338805,0.000084019215,0.000027715316,0.00015822385,0.4696087,0.05746741,0.0010425644,0.00655161,0.0012663334],"about_ca_topic_score_codex":0.000055205186,"about_ca_topic_score_gemma":0.00008481811,"teacher_disagreement_score":0.7977312,"about_ca_system_score_codex":0.00014341922,"about_ca_system_score_gemma":0.000092325005,"threshold_uncertainty_score":0.8903394},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079169305,0.000031233543,0.9875856,0.0005699853,0.000110072324,0.0005566603,0.000038364768,0.0012010132,0.009115377],"genre_scores_gemma":[0.51189107,0.000014725031,0.4874024,0.00045880617,0.0000064778237,0.00007536211,0.00004203704,0.000032884476,0.00007624091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653953,0.0018153666,0.00043693144,0.00061226176,0.00025560675,0.00034029147],"domain_scores_gemma":[0.9953087,0.00024882535,0.0001438842,0.003863931,0.00017784226,0.0002568409],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007346408,0.00025413348,0.00018487597,0.00039092798,0.0008183768,0.0002396084,0.0023467988,0.000046418136,0.000046638186],"category_scores_gemma":[0.00008722733,0.00025975765,0.00009210822,0.0011976665,0.000064012886,0.0004193092,0.00003004856,0.00039651716,0.00028994156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002997475,0.004695419,0.000014215327,0.000020635087,0.00003791387,0.0000031167276,0.0010836095,0.7471703,0.019594852,0.20040733,0.0006355263,0.026307061],"study_design_scores_gemma":[0.0012785991,0.0006039351,0.0021608023,0.0001122437,0.00005102342,0.000016795588,0.00014835644,0.79540336,0.12940797,0.0006472019,0.06893555,0.0012341739],"about_ca_topic_score_codex":0.000007798196,"about_ca_topic_score_gemma":0.00000529189,"teacher_disagreement_score":0.51109934,"about_ca_system_score_codex":0.00010592052,"about_ca_system_score_gemma":0.00008158426,"threshold_uncertainty_score":0.99998546},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9087363,0.0010535517,0.07307585,0.00018870854,0.000091750844,0.0009254122,0.00018340172,0.00030456673,0.015440474],"genre_scores_gemma":[0.9962656,0.0021196816,0.0013989497,0.000018083172,0.0000035932637,0.000072021976,0.000012268544,0.000042327,0.00006748838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99860597,0.00043039574,0.000504999,0.00011283362,0.00022010588,0.00012567866],"domain_scores_gemma":[0.99623066,0.0006216439,0.00025334212,0.0026931246,0.00017200876,0.000029225648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022215555,0.00015913355,0.00029358943,0.0002847296,0.0003639725,0.0000059262275,0.0012049754,0.000034347126,0.000019413188],"category_scores_gemma":[0.00004214014,0.00010824988,0.00016333762,0.0014768111,0.00036875907,0.000091838956,0.000016765996,0.00041732207,0.000002543688],"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.00003286223,0.00057697226,0.0038254082,0.0004615046,0.0020990644,8.0038313e-7,0.00362339,0.95448095,0.027288763,0.002837102,0.0000985658,0.004674616],"study_design_scores_gemma":[0.001127709,0.0012056191,0.21856965,0.0034999365,0.0023737794,0.00003107159,0.0011537551,0.20014286,0.56898606,0.000029588136,0.0017143537,0.0011655856],"about_ca_topic_score_codex":0.000055464923,"about_ca_topic_score_gemma":0.000055409804,"teacher_disagreement_score":0.7543381,"about_ca_system_score_codex":0.000058814014,"about_ca_system_score_gemma":0.000026660773,"threshold_uncertainty_score":0.44143018},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021178473,0.0005486383,0.9848476,0.00870028,0.00006460029,0.0009859906,0.000029118131,0.0004256855,0.0022802386],"genre_scores_gemma":[0.59901845,0.00042337461,0.39917767,0.00050541764,0.00006626044,0.0002623433,0.000060100698,0.00006481938,0.00042153904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969978,0.00092665275,0.00061755115,0.0005940321,0.0002819561,0.0005820184],"domain_scores_gemma":[0.9940443,0.0019557343,0.00026776662,0.0030625595,0.00048273586,0.00018691919],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009267759,0.00033657387,0.00029953217,0.00021492942,0.0027249148,0.0003802815,0.0025570695,0.00012363274,0.000015810883],"category_scores_gemma":[0.000056055873,0.00032370433,0.00009967328,0.0012847062,0.000235776,0.0004595588,0.00015655281,0.0012182827,0.000023183587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028783877,0.0030343868,0.0004365655,0.00008528027,0.0006206936,0.000009805,0.0074589318,0.71916026,0.00014473466,0.053278904,0.0023890608,0.21309356],"study_design_scores_gemma":[0.0014316028,0.00035613653,0.0022866935,0.00026451555,0.000060047314,0.000022340208,0.00019159752,0.97674984,0.00024030164,0.0004532128,0.017337505,0.00060620205],"about_ca_topic_score_codex":0.00018114339,"about_ca_topic_score_gemma":0.0009845744,"teacher_disagreement_score":0.59690064,"about_ca_system_score_codex":0.00009871483,"about_ca_system_score_gemma":0.00009549906,"threshold_uncertainty_score":0.9999215},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003868292,0.00041346808,0.97535557,0.012447105,0.000049732964,0.00050003856,0.000011669969,0.00012859494,0.007225533],"genre_scores_gemma":[0.97524923,0.0034867895,0.01980203,0.0012135562,0.000007940146,0.000052764102,0.000051050247,0.000008705681,0.00012790396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966092,0.0018440488,0.00084349595,0.0002580604,0.00020490811,0.00024025235],"domain_scores_gemma":[0.9966905,0.00046904953,0.0002907408,0.0021913338,0.00028678274,0.00007156479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015245924,0.00021403663,0.00026520813,0.00052106497,0.0011479702,0.0001570861,0.002684297,0.00005281341,0.000056356694],"category_scores_gemma":[0.000054896966,0.00017543648,0.00019724731,0.003338002,0.00009677294,0.0012667709,0.00004363089,0.0007227468,0.000019335032],"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.00004236575,0.0017032669,0.00011561361,0.000015182731,0.00026161177,0.0000021129065,0.032576542,0.038605716,0.00995318,0.01969751,0.00030457933,0.8967223],"study_design_scores_gemma":[0.0017595513,0.0008063189,0.026855392,0.0002693542,0.0003111059,0.000010016405,0.00071957003,0.944079,0.0047077173,0.00053538004,0.019074786,0.00087180984],"about_ca_topic_score_codex":0.000035412933,"about_ca_topic_score_gemma":0.000091309346,"teacher_disagreement_score":0.97138095,"about_ca_system_score_codex":0.00005603188,"about_ca_system_score_gemma":0.00006993844,"threshold_uncertainty_score":0.8829375},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014429379,0.0007342226,0.97676474,0.01821088,0.00006564895,0.0007939417,0.000019902425,0.0004389521,0.0015287503],"genre_scores_gemma":[0.60999006,0.0013839647,0.38669598,0.0012333436,0.00009450182,0.00017453713,0.000030706025,0.000068087094,0.0003288092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970048,0.0009135916,0.00060167053,0.0005883309,0.00028131212,0.0006103027],"domain_scores_gemma":[0.99323034,0.0022298687,0.00022501335,0.003618626,0.00040283552,0.00029329234],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0010407052,0.00032925903,0.00028486704,0.00021798535,0.0018175098,0.00044709563,0.0029678363,0.00012606107,0.000033860553],"category_scores_gemma":[0.00007673082,0.00031983,0.00010325757,0.0011054081,0.00017828666,0.00057476363,0.00012145089,0.0013401498,0.00006803633],"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.00015042057,0.0011058742,0.00022029446,0.00003123459,0.00036817967,0.000004087618,0.0037049009,0.44904613,0.00007040532,0.0059807454,0.0011279903,0.53818977],"study_design_scores_gemma":[0.0012715388,0.00025011602,0.0018648023,0.00022398854,0.000052871917,0.000027478933,0.00012717351,0.93180674,0.00018503013,0.00005524428,0.06359413,0.0005408657],"about_ca_topic_score_codex":0.000064094194,"about_ca_topic_score_gemma":0.0010372106,"teacher_disagreement_score":0.6085471,"about_ca_system_score_codex":0.000114356604,"about_ca_system_score_gemma":0.000104781764,"threshold_uncertainty_score":0.9999254},"labels":[],"label_agreement":null}]}