{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":30,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":30,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"1dc5f58e679c","filters":{"venue":"IEE Proceedings - Communications"}},"results":[{"id":"W2062379480","doi":"10.1049/ip-com:20040386","title":"Asymptotically minimum BER linear block precoders for MMSE equalisation","year":2004,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Block (permutation group theory); Minimum mean square error; Mathematics; Bit error rate; Disjoint sets; Control theory (sociology); Algorithm; Upper and lower bounds; Computer science; Statistics; Combinatorics; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.03708664960247209,"gpt":0.2983716188975032,"spread":0.2612849692950311,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002881391,0.0002379452,0.0002313887,0.0001759219,0.0003564987,0.00007438537,0.001492107,0.0001779347,0.000007108471],"category_scores_gemma":[0.0002639326,0.0002788102,0.0001045723,0.0003704411,0.0001940529,0.0005373742,0.0002386428,0.0003830996,0.0000345584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002522648,"about_ca_system_score_gemma":0.00004642942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009547398,"about_ca_topic_score_gemma":0.00002454671,"domain_scores_codex":[0.9987432,0.00001259467,0.0005266535,0.000218495,0.0001724147,0.0003266612],"domain_scores_gemma":[0.9979232,0.00023875,0.0001256603,0.001148539,0.0004505438,0.0001133066],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009823596,0.001331612,0.0007144959,0.0009771194,0.0005372528,4.808136e-7,0.01637316,0.0610099,0.1873283,0.6921356,0.01020684,0.02928696],"study_design_scores_gemma":[0.00443919,0.000472976,0.0007796348,0.0009287097,0.0003033086,0.00004732165,0.0023309,0.3393113,0.2175234,0.2114078,0.2196036,0.00285188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09663732,0.002587638,0.8119022,0.01792592,0.0003863398,0.005123806,0.0001624776,0.01060036,0.05467399],"genre_scores_gemma":[0.6962194,0.0007569513,0.3018667,0.0001271132,0.00004611322,0.0007775175,0.0000631863,0.00007581674,0.00006709084],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5995821,"threshold_uncertainty_score":0.9999664,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055198680","doi":"10.1049/ip-com:20050142","title":"Mobile positioning based on relaying capability of mobile stations in hybrid wireless networks","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Mobile wireless; Mobile ad hoc network; Flooding (psychology); Scheme (mathematics); Wireless; Cellular network; Wireless network; Real-time computing; Telecommunications; Network packet","retraction":null,"screen_n_in":null,"score":{"opus":0.007573176544881515,"gpt":0.2264956651098854,"spread":0.2189224885650039,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002287737,0.0001458679,0.0001967701,0.0002735955,0.0002011804,0.00004162437,0.0005139953,0.00009749939,0.00001365615],"category_scores_gemma":[0.00004023392,0.0001684671,0.00005508991,0.0006669245,0.000169335,0.0001908474,0.00006914298,0.0003500185,0.0000040395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001746655,"about_ca_system_score_gemma":0.00002226103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009402825,"about_ca_topic_score_gemma":0.00004811274,"domain_scores_codex":[0.9989912,0.0000164357,0.0004771407,0.0001576528,0.0001358619,0.0002217452],"domain_scores_gemma":[0.9990209,0.0001543711,0.00009860984,0.0005156176,0.0001853968,0.00002513112],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007626405,0.000237516,0.01553603,0.00009388126,0.00000994978,3.798492e-7,0.000438427,0.9675245,0.002566288,0.01058759,0.0006976223,0.002300158],"study_design_scores_gemma":[0.0003397687,0.00006911596,0.003332292,0.0001515544,0.00001432373,0.000001662935,0.000625259,0.9810134,0.01199965,0.001446683,0.0007943943,0.0002118926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9132072,0.0007826321,0.06047828,0.0001044172,0.0001073815,0.001002008,0.0000611237,0.001254411,0.02300253],"genre_scores_gemma":[0.9942379,0.0001215149,0.004600161,0.0000220523,0.00001439032,0.0008708827,0.0000882674,0.00003141978,0.00001342768],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08103067,"threshold_uncertainty_score":0.6869891,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035186408","doi":"10.1049/ip-com:20045315","title":"Adaptive scheduling algorithms for Ethernet passive optical networks","year":2005,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Advanced Photonic Communication Systems","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Polling; Computer network; Queue; Network packet; Real-time computing; Scheduling (production processes); Ethernet; Optical line termination; Algorithm; Passive optical network; Engineering; Wavelength-division multiplexing","retraction":null,"screen_n_in":null,"score":{"opus":0.04684089554312987,"gpt":0.2981721388700675,"spread":0.2513312433269376,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003094982,0.0002486018,0.0002856837,0.0001043625,0.0003651304,0.00009564101,0.001581395,0.0001771691,0.00001551102],"category_scores_gemma":[0.0001090421,0.000279036,0.0001136207,0.0003542664,0.000171753,0.0003305424,0.0003041862,0.0006003003,0.00004715338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002838781,"about_ca_system_score_gemma":0.00003210536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006455158,"about_ca_topic_score_gemma":0.0000284265,"domain_scores_codex":[0.9986625,0.00001635642,0.0005192824,0.0002339833,0.0001622387,0.0004055962],"domain_scores_gemma":[0.9977645,0.0004629432,0.0001340175,0.001086936,0.0004052463,0.0001463445],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007208881,0.0004261498,0.0002286115,0.0001528671,0.0006484232,3.83549e-7,0.008346929,0.4844583,0.008971376,0.2306617,0.006536566,0.2594966],"study_design_scores_gemma":[0.0004042219,0.00002912276,0.00004819021,0.00008122867,0.00003195554,0.00001059675,0.0009134709,0.8869443,0.0009794175,0.0007594932,0.1094999,0.000298172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008802186,0.0107557,0.9128472,0.004485913,0.0003882132,0.002759176,0.00006911217,0.002018775,0.05787371],"genre_scores_gemma":[0.6923467,0.0006284295,0.3056359,0.00008195759,0.000179331,0.0009189586,0.00002343792,0.00007046019,0.0001148361],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6835445,"threshold_uncertainty_score":0.9999662,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000812989","doi":"10.1049/ip-com:20050493","title":"Improved tangential sphere bound on the ML decoding error probability of linear binary block codes in AWGN and block fading channels","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Upper and lower bounds; Mathematics; Fading; Additive white Gaussian noise; Decoding methods; Algorithm; Block code; Bounding overwatch; Combinatorics; Topology (electrical circuits); Computer science; Statistics; White noise; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03629131720013724,"gpt":0.2669017111565289,"spread":0.2306103939563917,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00100009,0.0001846197,0.0002202256,0.0001619569,0.0006347608,0.0001853671,0.001830491,0.00008549997,0.000005401063],"category_scores_gemma":[0.0001291875,0.0001560941,0.00008675773,0.0008867134,0.0003752794,0.0003436746,0.0007809358,0.000348255,0.000001917328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004291029,"about_ca_system_score_gemma":0.00004466189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000146765,"about_ca_topic_score_gemma":0.0001504138,"domain_scores_codex":[0.9987007,0.00007720969,0.0004179818,0.0003513578,0.0001700342,0.0002826833],"domain_scores_gemma":[0.9982873,0.0003889014,0.0002367255,0.0008540351,0.0001824843,0.00005053893],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009695353,0.001335593,0.01482143,0.0002156384,0.00008478683,0.000001321421,0.0090035,0.00046344,0.09404475,0.8761546,0.0006610922,0.003116905],"study_design_scores_gemma":[0.002051006,0.0009318565,0.01405767,0.0010735,0.0001255726,0.00006334599,0.002321086,0.5810307,0.04649068,0.3450443,0.005402502,0.001407834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9926556,0.0004173554,0.0007412325,0.002963875,0.00008402598,0.0005545318,0.000007464384,0.0001204277,0.002455505],"genre_scores_gemma":[0.987203,0.00005194965,0.01247774,0.00007142771,0.00004537213,0.0001022094,0.000002377241,0.0000126289,0.00003330336],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5805672,"threshold_uncertainty_score":0.6365333,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020813517","doi":"10.1049/ip-com:20040969","title":"MIMO OFDM for broadband fixed wireless access","year":2005,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"MIMO; Orthogonal frequency-division multiplexing; Multipath propagation; Spatial multiplexing; Spatial correlation; Channel (broadcasting); Antenna diversity; Computer science; Spectral efficiency; MIMO-OFDM; Electronic engineering; Delay spread; Wireless; Diversity scheme; Diversity gain; Broadband; Multiplexing; Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04175739460071157,"gpt":0.3221242351248272,"spread":0.2803668405241156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002143622,0.0002431084,0.0002628992,0.0001929885,0.0003305651,0.0001830514,0.003209745,0.0001424627,0.00001872365],"category_scores_gemma":[0.00007529547,0.0002810878,0.00009790772,0.0004308297,0.0001729816,0.001129884,0.0005019297,0.0003818879,0.00002680263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001756727,"about_ca_system_score_gemma":0.00002325565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009986468,"about_ca_topic_score_gemma":0.00004955657,"domain_scores_codex":[0.9988227,0.00001117968,0.0004688473,0.0002120078,0.0001455796,0.000339725],"domain_scores_gemma":[0.9978181,0.0002199829,0.000129902,0.001364163,0.0003622551,0.0001055568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006809617,0.0008118267,0.002830114,0.0007763742,0.0003598212,2.255386e-7,0.004757211,0.003269318,0.1478655,0.2062026,0.1662261,0.4668329],"study_design_scores_gemma":[0.0008040281,0.00004288373,0.0005611919,0.0001908905,0.00005561953,0.00001020169,0.0002550093,0.1720102,0.1068156,0.006402361,0.7120536,0.0007983971],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1907671,0.01545564,0.4553642,0.02893915,0.0005198509,0.008065311,0.000364099,0.02121765,0.279307],"genre_scores_gemma":[0.8719328,0.00282223,0.123134,0.0001859923,0.00008658056,0.001370554,0.00005778831,0.00009258035,0.0003174786],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6811658,"threshold_uncertainty_score":0.9999641,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1989713667","doi":"10.1049/ip-com:20045215","title":"Design of an adaptive PI rate controller for streaming media traffic based on gain and phase margins","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Active queue management; Computer science; Router; Network congestion; Computer network; Network packet; Queue; Real-time computing; Buffer overflow; Explicit Congestion Notification; Robustness (evolution); Adaptive control; The Internet; Control theory (sociology); Control (management); TCP Friendly Rate Control","retraction":null,"screen_n_in":null,"score":{"opus":0.03665021532567122,"gpt":0.2698119325956443,"spread":0.2331617172699731,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008091963,0.0001697362,0.0002536703,0.0001507399,0.0003066948,0.0001183738,0.001016943,0.00006983533,0.000001904441],"category_scores_gemma":[0.00008148928,0.0001645417,0.00005245573,0.0002843033,0.0001576699,0.0003506482,0.00006690928,0.0001465798,0.000001462202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003274586,"about_ca_system_score_gemma":0.00008262391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001099006,"about_ca_topic_score_gemma":0.00001774722,"domain_scores_codex":[0.9988878,0.00009690278,0.0003308303,0.000299744,0.0001491869,0.0002354937],"domain_scores_gemma":[0.9976324,0.001249432,0.0002301555,0.0004617903,0.0003359044,0.0000902613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000667033,0.002146775,0.00003221757,0.00003236792,0.00007488788,0.000001054895,0.00171723,0.0584456,0.005783029,0.235339,0.001399715,0.6943611],"study_design_scores_gemma":[0.003651896,0.0005268719,0.0001516111,0.00004928039,0.00003457368,0.000001509311,0.000130416,0.9928648,0.0003142353,0.001755809,0.0003546138,0.0001643859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01442518,0.0002765936,0.9814908,0.002072637,0.0000483574,0.0009416228,0.00002388137,0.0001828491,0.0005380638],"genre_scores_gemma":[0.8980873,0.00002249787,0.1013402,0.0001699281,0.00004940313,0.0002745685,0.00001351466,0.00001409831,0.00002846726],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9344192,"threshold_uncertainty_score":0.6709816,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063059429","doi":"10.1049/ip-com:20010633","title":"RAKE receiver using blind adaptive minimum output energy detection for DS/CDMA over multipath fading channels","year":2001,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Fading; Rake receiver; Multipath propagation; Rake; Computer science; Code division multiple access; Spread spectrum; Delay spread; Multiuser detection; Detector; Algorithm; Electronic engineering; Channel (broadcasting); Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1357969264659821,"gpt":0.3417969223051041,"spread":0.205999995839122,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009043012,0.0003223036,0.0003370336,0.0005601756,0.0015641,0.0005820565,0.005165811,0.0002366208,0.000008506855],"category_scores_gemma":[0.0002710367,0.0003573136,0.0001786896,0.001722416,0.0002676989,0.001725128,0.002034249,0.0005535604,0.00001546302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000387997,"about_ca_system_score_gemma":0.0001400172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002661577,"about_ca_topic_score_gemma":0.000122154,"domain_scores_codex":[0.9974374,0.000130915,0.0006046869,0.0006310715,0.0004871254,0.0007087587],"domain_scores_gemma":[0.9952832,0.0007076384,0.0004337813,0.002123615,0.001222504,0.0002292785],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007844825,0.001802138,0.002028743,0.00013777,0.0006929855,0.000005771648,0.0236407,0.01227479,0.07493659,0.2074445,0.005681353,0.6705702],"study_design_scores_gemma":[0.001076109,0.0001099484,0.0002614924,0.0001120437,0.00002275961,0.00003041364,0.0003129087,0.9418172,0.002586471,0.002680267,0.05059277,0.0003976081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04628646,0.001213881,0.943004,0.003216553,0.0004095401,0.001174642,0.00001175229,0.0005511129,0.004132056],"genre_scores_gemma":[0.9030783,0.001082367,0.09421226,0.000178208,0.0002395843,0.0005656868,0.00001465905,0.00005441847,0.0005745646],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9295424,"threshold_uncertainty_score":0.9998879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126183826","doi":"10.1049/ip-com:20045260","title":"Modelling CSMA∕CA protocol for wireless channels that use collaborative codes modulation","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Carrier sense multiple access with collision avoidance; Computer science; Computer network; Network packet; Throughput; Markov chain; Distributed coordination function; Protocol (science); Multiple Access with Collision Avoidance for Wireless; Channel access method; Channel (broadcasting); Simple (philosophy); Wireless; IEEE 802.11; Routing protocol; Telecommunications; Optimized Link State Routing Protocol","retraction":null,"screen_n_in":null,"score":{"opus":0.1006283555115134,"gpt":0.329993772123047,"spread":0.2293654166115336,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004729614,0.0002720577,0.0002894356,0.0001528438,0.0009759174,0.001208523,0.002109087,0.0001561969,0.000003452239],"category_scores_gemma":[0.00002341811,0.0002679438,0.00009495416,0.0008454206,0.0001356084,0.002210847,0.0004694148,0.0002406018,0.000008724829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000974045,"about_ca_system_score_gemma":0.0001153499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001487627,"about_ca_topic_score_gemma":0.00003171191,"domain_scores_codex":[0.9982902,0.00004743567,0.000469933,0.0004684523,0.0003014306,0.0004225678],"domain_scores_gemma":[0.9971284,0.0003269523,0.0004350235,0.0009529202,0.001067489,0.00008917187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009648542,0.0005837313,0.001728443,0.0002122828,0.00005069826,3.974295e-7,0.00215363,0.1316465,0.001056885,0.8436871,0.01313217,0.005651651],"study_design_scores_gemma":[0.0007238167,0.00008082436,0.0001220538,0.0001767341,0.000007422937,0.000002561122,0.00005242362,0.9218044,0.001355588,0.02996046,0.04540523,0.000308424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"protocol","genre_scores_codex":[0.001250855,0.00001439252,0.766424,0.001561974,0.00005423883,0.22861,0.00002547289,0.0003490897,0.001710022],"genre_scores_gemma":[0.3187141,0.00000543412,0.1366434,0.00006747791,0.0001122142,0.5441905,0.00002468495,0.00002537856,0.0002167493],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8137267,"threshold_uncertainty_score":0.9999773,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995409733","doi":"10.1049/ip-com:20050020","title":"Gallager first bounding technique for the performance evaluation of maximum-likelihood decoded linear binary block codes","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounding overwatch; Upper and lower bounds; Code word; Mathematics; Binary number; Algorithm; Complement (music); Decoding methods; Probability of error; Discrete mathematics; Computer science; Statistics; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.03134370147656788,"gpt":0.2943495568022934,"spread":0.2630058553257255,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001375796,0.0002250829,0.0002391505,0.0002010337,0.0007162184,0.00005266596,0.001740304,0.000138511,0.000008608529],"category_scores_gemma":[0.0001391871,0.0002108464,0.00009861331,0.0005433812,0.00024369,0.0004088741,0.0002743729,0.0003373739,0.000004431573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002367223,"about_ca_system_score_gemma":0.00005235575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003129332,"about_ca_topic_score_gemma":0.00006865108,"domain_scores_codex":[0.9985775,0.00002732819,0.0006006684,0.0001774621,0.0003314381,0.0002856007],"domain_scores_gemma":[0.9970157,0.0004411411,0.0002489698,0.001294273,0.00096398,0.00003593129],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008356183,0.0009763608,0.007462221,0.001465971,0.0003861225,1.34655e-7,0.003061965,0.1005078,0.8092958,0.02924241,0.01220313,0.03531458],"study_design_scores_gemma":[0.0004656778,0.00006554675,0.001655634,0.0003090931,0.0001584538,0.000009283472,0.0002589948,0.6888775,0.284529,0.00735322,0.0159502,0.0003673602],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5990021,0.01872856,0.327648,0.005098358,0.0003562305,0.0146548,0.0001854502,0.004966336,0.0293602],"genre_scores_gemma":[0.8716978,0.002157989,0.1225341,0.0000151828,0.00004302251,0.003419841,0.00004575599,0.00006676942,0.00001952027],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5883698,"threshold_uncertainty_score":0.8598068,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043309691","doi":"10.1049/ip-com:20000663","title":"Acyclic Tanner graphs and maximum-likelihood decoding of linear block codes","year":2000,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Tanner graph; Decoding methods; List decoding; Coset; Sequential decoding; Block code; Linear code; Mathematics; Hamming code; Concatenated error correction code; Combinatorics; Discrete mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01849388440117623,"gpt":0.2588540239813282,"spread":0.240360139580152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004498642,0.000159402,0.0002078912,0.0002180118,0.0005230682,0.0001292519,0.002125441,0.00007358127,0.00002996453],"category_scores_gemma":[0.00004481184,0.0001597096,0.00009634776,0.0009230482,0.0002980423,0.0005398197,0.0004702548,0.0002375676,0.00001491835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001058019,"about_ca_system_score_gemma":0.00002317863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002365962,"about_ca_topic_score_gemma":0.000009192947,"domain_scores_codex":[0.9989173,0.00003183912,0.0003340608,0.0002861278,0.0001680274,0.0002625858],"domain_scores_gemma":[0.9985184,0.000173061,0.000136446,0.0008869892,0.0001721971,0.0001129112],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002759332,0.0004356727,0.009700733,0.00007478683,0.000113145,7.152592e-7,0.007056893,0.000008130753,0.01141528,0.7984645,0.0009013205,0.1718012],"study_design_scores_gemma":[0.001146952,0.0003388319,0.007317109,0.0003569551,0.0001184001,0.000117093,0.0007053519,0.0328516,0.009365157,0.9021941,0.04459294,0.0008955589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9634989,0.001920981,0.003501118,0.003315707,0.00007020576,0.0003320187,0.00001376697,0.0004837042,0.02686361],"genre_scores_gemma":[0.9331178,0.001262908,0.06533968,0.0001649168,0.00001284491,0.0000341692,0.000002639358,0.00001216768,0.00005284083],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1709056,"threshold_uncertainty_score":0.651277,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063354564","doi":"10.1049/ip-com:20045101","title":"Effects of imperfect channel estimation on space–time coding performance","year":2005,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Equaliser; Channel (broadcasting); Bit error rate; Computer science; Multipath propagation; Transmit diversity; Binary erasure channel; Coding (social sciences); Antenna diversity; Algorithm; Telecommunications; Electronic engineering; Antenna (radio); Fading; Mathematics; Channel capacity; Statistics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.009322300118657664,"gpt":0.2414360022677703,"spread":0.2321137021491126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002023807,0.0002023831,0.0002373896,0.0002437147,0.0002239926,0.00003116579,0.00107941,0.000099858,0.000007482329],"category_scores_gemma":[0.0001182468,0.0002262872,0.00005988788,0.0004076357,0.0001237574,0.0005764671,0.0001969926,0.0003724326,0.00008304779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001721527,"about_ca_system_score_gemma":0.00001209398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002671321,"about_ca_topic_score_gemma":9.695392e-7,"domain_scores_codex":[0.9990987,0.00001594174,0.0003540557,0.0001405313,0.000170067,0.0002207743],"domain_scores_gemma":[0.9985346,0.0002805719,0.0001466924,0.0008167916,0.0001607761,0.00006053062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000511842,0.0007230436,0.0003348786,0.001797112,0.0001901966,2.407002e-7,0.005947511,0.06300831,0.6879662,0.04808557,0.005095759,0.1868],"study_design_scores_gemma":[0.0002108558,0.00006728701,0.000552455,0.0003600622,0.00001978258,0.000003064344,0.00002482561,0.5794022,0.4170036,0.0003328249,0.00181361,0.0002093626],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8813508,0.003125001,0.04046844,0.002541201,0.0001331973,0.002280009,0.0000189673,0.005370879,0.06471156],"genre_scores_gemma":[0.943994,0.002858723,0.05265766,0.00003879855,0.00002853358,0.000283699,0.00001452324,0.00005483535,0.00006920652],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5163939,"threshold_uncertainty_score":0.9227725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128188853","doi":"10.1049/ip-com:20020306","title":"Destination-initiating path restoration protocol for wavelength-routed WDM networks","year":2002,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Survivability; Computer science; Backup; Provisioning; Node (physics); Protocol (science); Path (computing); Wavelength-division multiplexing; Connection (principal bundle); Transmission (telecommunications); Distributed computing; Telecommunications; Engineering; Wavelength; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.06512542462493823,"gpt":0.297122561553768,"spread":0.2319971369288298,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001860535,0.0002095713,0.0001802428,0.0001116126,0.0004668194,0.000113417,0.0007773655,0.0001859231,0.00001214986],"category_scores_gemma":[0.0006180957,0.000228188,0.00005421322,0.0005608239,0.0001102332,0.0005435315,0.0001556332,0.0004402436,0.00001600046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000156091,"about_ca_system_score_gemma":0.000006519638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001168921,"about_ca_topic_score_gemma":0.00000552226,"domain_scores_codex":[0.9988523,0.000009262539,0.000440498,0.0002018821,0.0001335098,0.0003625916],"domain_scores_gemma":[0.9985613,0.0003342672,0.0001321444,0.0005442862,0.0003654329,0.00006259039],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005026333,0.0006578862,0.002402897,0.0008411196,0.000188163,0.000001409262,0.002470942,0.06542382,0.003763546,0.4898727,0.04545588,0.3888713],"study_design_scores_gemma":[0.0004414628,0.00005867674,0.0001964585,0.0001283644,0.00001432785,0.000004087607,0.0001532375,0.9671525,0.0001600719,0.006472359,0.02495161,0.0002667772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002720937,0.0004855076,0.724785,0.003973199,0.0002876755,0.1971488,0.00003640781,0.01330734,0.05725506],"genre_scores_gemma":[0.4241093,0.0000831763,0.3442883,0.00004648115,0.0001043451,0.2312243,0.00002251256,0.00006699834,0.00005447902],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9017287,"threshold_uncertainty_score":0.9305235,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011531008","doi":"10.1049/ip-com:20059012","title":"Optimal precoder for block transmission over frequency-selective fading channels","year":2005,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Pairwise error probability; Fading; Diversity gain; Rayleigh fading; Algorithm; Computer science; Transmitter; Transmission (telecommunications); Channel (broadcasting); Detector; Mathematics; Control theory (sociology); Electronic engineering; Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02356752254613398,"gpt":0.2889739984830502,"spread":0.2654064759369162,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002151026,0.0002614985,0.000247356,0.0002087293,0.0004599336,0.00008272254,0.001460087,0.0001716779,0.00001824506],"category_scores_gemma":[0.00005629431,0.0002973184,0.0001140757,0.0003942823,0.0001109536,0.000818199,0.000146404,0.0004728251,0.00001327552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002731534,"about_ca_system_score_gemma":0.00002680081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006731807,"about_ca_topic_score_gemma":0.000007521328,"domain_scores_codex":[0.9987916,0.00001345807,0.0004398461,0.0002388088,0.0001454357,0.0003708733],"domain_scores_gemma":[0.9984894,0.0001812866,0.0001090802,0.000794276,0.0003150556,0.0001109183],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007919974,0.0008741139,0.0005693441,0.0005785128,0.0005143675,2.527341e-7,0.02553769,0.1331239,0.5610703,0.0646209,0.03595664,0.1770747],"study_design_scores_gemma":[0.0007184216,0.00009229922,0.0001664725,0.0002586206,0.00006456423,0.00001494149,0.0002287602,0.5866089,0.1969144,0.006508363,0.207634,0.0007903303],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07496108,0.01025346,0.8150181,0.006662241,0.0002379048,0.004899786,0.000109509,0.00916472,0.07869316],"genre_scores_gemma":[0.6652851,0.001369321,0.3320386,0.00005609599,0.00006692903,0.0009417132,0.00002387358,0.00007372895,0.0001446704],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.590324,"threshold_uncertainty_score":0.9999479,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990343640","doi":"10.1049/ip-com:20050345","title":"Performance analysis of channel aware frequency hopping","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Frequency-hopping spread spectrum; Transmitter; Channel (broadcasting); Computer science; Transmission (telecommunications); Scheme (mathematics); Electronic engineering; Modulation (music); Topology (electrical circuits); Telecommunications; Computer network; Algorithm; Mathematics; Engineering; Physics; Acoustics","retraction":null,"screen_n_in":null,"score":{"opus":0.01757864172699753,"gpt":0.2462681764945857,"spread":0.2286895347675882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001624616,0.0001655594,0.0002990049,0.000577661,0.0002088506,0.00002763994,0.001459416,0.00008942622,0.00001310207],"category_scores_gemma":[0.00002149065,0.0001931711,0.0001132122,0.001911191,0.000159505,0.0004457038,0.0002216376,0.0002742168,0.00000616129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001060688,"about_ca_system_score_gemma":0.00001310453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008041601,"about_ca_topic_score_gemma":0.00005379983,"domain_scores_codex":[0.9989985,0.000009659871,0.0004935509,0.000136923,0.0001539224,0.0002074654],"domain_scores_gemma":[0.9982322,0.0000740096,0.0001690655,0.001159233,0.0003275606,0.00003787334],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002419296,0.001356824,0.2136928,0.001708956,0.00399953,8.572601e-7,0.007564138,0.2295724,0.3096819,0.1920604,0.007538464,0.03279948],"study_design_scores_gemma":[0.0002167064,0.00003511942,0.05031457,0.0002092892,0.0005075932,0.00000335861,0.000412853,0.9069641,0.03431815,0.003558901,0.002836126,0.0006232449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7773252,0.004833747,0.06901434,0.0008855588,0.00009494278,0.0008514233,0.0001056272,0.004315643,0.1425736],"genre_scores_gemma":[0.9739747,0.002132727,0.02351088,0.00001512704,0.0000159681,0.000181345,0.00008769476,0.0000365189,0.00004503138],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6773916,"threshold_uncertainty_score":0.7877288,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027312028","doi":"10.1049/ip-com:20045012","title":"Suboptimal multiple-symbol differential detection of MPSK with diversity reception","year":2005,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Fading; Channel (broadcasting); Keying; Differential coding; Detector; Diversity combining; Computer science; Reduction (mathematics); Differential (mechanical device); Diversity gain; Mathematics; Computational complexity theory; Phase-shift keying; Telecommunications; Bit error rate; Physics; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.0179403765706274,"gpt":0.2271226388308674,"spread":0.20918226226024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009989599,0.0001683297,0.0001886304,0.0001765916,0.0003885856,0.00002598991,0.001007719,0.0001032899,0.00001786989],"category_scores_gemma":[0.00003620309,0.000178528,0.00005446937,0.0003435964,0.0001947596,0.0005965442,0.0005276839,0.0003648688,0.0000110748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001621203,"about_ca_system_score_gemma":0.000008082815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002957325,"about_ca_topic_score_gemma":0.0001395836,"domain_scores_codex":[0.999184,0.00001537505,0.0002975846,0.0001423349,0.000182151,0.0001785619],"domain_scores_gemma":[0.998678,0.00007778159,0.0001384486,0.0007622355,0.0002841909,0.00005930731],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001338922,0.0005015702,0.02106724,0.0001781145,0.0001744935,1.065245e-7,0.005390502,0.003836176,0.8442202,0.003465253,0.0003174046,0.1207151],"study_design_scores_gemma":[0.001443835,0.0002221665,0.03191948,0.0002459178,0.0001383321,0.0000186506,0.00122011,0.2690727,0.6858367,0.0005919412,0.008434189,0.0008559212],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8751787,0.0002989453,0.1182987,0.0002989575,0.00003644704,0.0004883487,0.00001692864,0.0014715,0.003911522],"genre_scores_gemma":[0.944306,0.0009906506,0.05446751,0.000009644231,0.0000313073,0.000112476,0.00002154563,0.00003577218,0.0000250623],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2652366,"threshold_uncertainty_score":0.728016,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009906984","doi":"10.1049/ip-com:20040400","title":"AQM controller design for IP routers supporting TCP flows based on pole placement","year":2004,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Active queue management; Control theory (sociology); Controller (irrigation); Full state feedback; Transient (computer programming); Queue; Computer science; Control (management); Network congestion; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.03936738592359705,"gpt":0.2829046621722708,"spread":0.2435372762486738,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008468438,0.0002164079,0.0002448107,0.0001467684,0.0006789545,0.0003184617,0.002114177,0.00008303583,0.000006103679],"category_scores_gemma":[0.0001565551,0.0002123092,0.0001342369,0.0003468021,0.00007002469,0.0003719571,0.0001764032,0.0002326277,0.00004031102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001672844,"about_ca_system_score_gemma":0.0002032798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000105224,"about_ca_topic_score_gemma":0.000006709583,"domain_scores_codex":[0.998397,0.00003432664,0.0004548223,0.0003909577,0.0002745914,0.000448285],"domain_scores_gemma":[0.99804,0.0004492669,0.000273081,0.0007596453,0.0003244883,0.0001535424],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003144669,0.001103173,0.0001673874,0.00004652143,0.0001660468,0.000001523837,0.002800666,0.1734383,0.001884545,0.6632802,0.009536112,0.147261],"study_design_scores_gemma":[0.003397231,0.0002883418,0.00005635971,0.00008686067,0.00003276221,0.000003114082,0.0001334814,0.9796532,0.0003673063,0.004820872,0.01088895,0.000271525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008987741,0.0001075827,0.9692333,0.02580337,0.000160477,0.0012537,0.000005850393,0.0004124759,0.002124519],"genre_scores_gemma":[0.791365,0.00001397315,0.2053339,0.002272699,0.00006833603,0.0007848864,0.000007155554,0.00001850711,0.0001355885],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8062149,"threshold_uncertainty_score":0.8657717,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2205007474","doi":"10.1049/ip-com:20041211","title":"NEXT cancellation system with improved convergence rate and tracking performance","year":2005,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rate of convergence; Adaptive filter; Computer science; Crosstalk; Convergence (economics); Least mean squares filter; Control theory (sociology); Tracking (education); Frequency domain; Algorithm; Electronic engineering; Engineering; Artificial intelligence; Telecommunications; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.02037531778097038,"gpt":0.2221923153551832,"spread":0.2018169975742128,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002221104,0.0001526097,0.0001418453,0.00008754735,0.0003703579,0.0001233322,0.0005919465,0.00005441203,0.000006687431],"category_scores_gemma":[0.00001198792,0.0001485853,0.00001899445,0.0002915,0.0001054954,0.0007991082,0.0001185359,0.0002565151,0.00001690628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001172287,"about_ca_system_score_gemma":0.00002441156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002690352,"about_ca_topic_score_gemma":0.00009097822,"domain_scores_codex":[0.9993235,0.00001054862,0.0002615309,0.0001367651,0.00007168765,0.0001959822],"domain_scores_gemma":[0.9989653,0.00005354474,0.00008155695,0.0006283284,0.0001934669,0.00007784834],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002236842,0.0005738242,0.0723012,0.003616475,0.0007332374,0.000001185245,0.02838383,0.02334965,0.4613582,0.08021471,0.004951377,0.3242926],"study_design_scores_gemma":[0.0003518334,0.00003373053,0.008514046,0.0002128469,0.00003477502,0.00002231382,0.0006338526,0.9569216,0.005114404,0.000009420463,0.02786862,0.0002825913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9705041,0.004317825,0.001883285,0.001100209,0.0000710787,0.0004401452,0.000008502643,0.0007767148,0.02089813],"genre_scores_gemma":[0.9858445,0.003539419,0.01028093,0.00003154573,0.00004354567,0.0001245163,0.00001074352,0.00003291584,0.00009189073],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9335719,"threshold_uncertainty_score":0.605913,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065716530","doi":"10.1049/ip-com:20050440","title":"Spectra of multimode coded signals","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Encoder; Code word; Randomness; Computer science; Algorithm; Coding (social sciences); Spectral density; Multi-mode optical fiber; Theoretical computer science; Mathematics; Decoding methods; Telecommunications; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02865470208723447,"gpt":0.3028430904918661,"spread":0.2741883884046317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002319629,0.0001345028,0.0001953958,0.0001628917,0.0002010897,0.00008258032,0.004189755,0.00005925514,0.00001003259],"category_scores_gemma":[0.00007066767,0.0001339876,0.00006002151,0.0005461235,0.0001751555,0.0009262497,0.001235557,0.0002073736,0.00001602729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003868641,"about_ca_system_score_gemma":0.00003625678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001187367,"about_ca_topic_score_gemma":0.00001084499,"domain_scores_codex":[0.9988561,0.0000200446,0.0004169763,0.0002639611,0.0002382436,0.0002047275],"domain_scores_gemma":[0.9976158,0.0001541023,0.0003052246,0.001522486,0.0003523214,0.00005013719],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000003858932,0.0003409568,0.0006412266,0.0000230329,0.00001006606,3.177942e-7,0.0003178503,0.00004031528,0.2864804,0.6963118,0.01035969,0.005470433],"study_design_scores_gemma":[0.0004262456,0.0000812406,0.002408889,0.0001650567,0.00001487731,0.00001610095,0.0000684576,0.1065751,0.6238374,0.2341904,0.03177915,0.0004370802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003761947,0.0005622072,0.9624485,0.002075185,0.00003653171,0.0003744401,0.00002425367,0.0008938996,0.02982297],"genre_scores_gemma":[0.5103977,0.00007004844,0.4893173,0.00004864775,0.00001255748,0.00005228057,0.000008425892,0.000008084528,0.00008494261],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5066357,"threshold_uncertainty_score":0.7785677,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983501575","doi":"10.1049/ip-com:20060070","title":"Statistical methods for computer network traffic analysis","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Complex Systems and Time Series Analysis","field":"Economics, Econometrics and Finance","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Estimator; Range (aeronautics); Computer science; Self-similarity; Wavelet; Data mining; Gaussian; Series (stratigraphy); Exponent; Process (computing); Algorithm; Statistics; Mathematics; Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04983256882751857,"gpt":0.3105456243678552,"spread":0.2607130555403366,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009471452,0.0001573027,0.00061029,0.0003013658,0.0004826655,0.0002215031,0.0007119867,0.00007839445,0.0002505235],"category_scores_gemma":[0.000046529,0.0001826963,0.0003377397,0.001307149,0.0001102251,0.0001493639,0.0001740786,0.0001284165,0.00006411634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006920234,"about_ca_system_score_gemma":0.000009938371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004193439,"about_ca_topic_score_gemma":0.0002033546,"domain_scores_codex":[0.9984245,0.00001775832,0.0008419087,0.0003648444,0.00003008493,0.0003209247],"domain_scores_gemma":[0.9984059,0.0003209179,0.0004115761,0.0006388837,0.0001546781,0.000068045],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006033027,0.0001136218,0.008100045,0.00002275258,0.0006365119,5.185967e-8,0.0001243199,0.005586061,0.000003802854,0.9669747,0.01477749,0.003654611],"study_design_scores_gemma":[0.0002028115,0.00003573498,0.01317271,0.000005305465,0.0002576936,0.000001558379,0.00003883098,0.61848,0.000001128024,0.03965854,0.3279102,0.0002355145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004120747,0.003223192,0.9724305,0.001533517,0.0001232879,0.0003905446,0.000222927,0.0001229337,0.01783241],"genre_scores_gemma":[0.468369,0.00005312948,0.5302762,0.00007341471,0.0002129242,0.0001421692,0.0001733746,0.00002032009,0.0006793925],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9273162,"threshold_uncertainty_score":0.7450138,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988638065","doi":"10.1049/ip-com:20000632","title":"Prioritised ATM switches on board satellites: architectural analysis and design","year":2000,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Asynchronous Transfer Mode; Computer science; Quality of service; Satellite constellation; Broadband; Computer network; Queue; Constellation; Architecture; Broadband networks; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03279180831479839,"gpt":0.2598263674676485,"spread":0.2270345591528501,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003923773,0.0001557808,0.0002329298,0.0002164037,0.000473432,0.0004835749,0.001361841,0.00006746488,0.00003429623],"category_scores_gemma":[0.00003115677,0.0001420497,0.0001059578,0.0009549595,0.000100507,0.0003333359,0.0001629308,0.0002383508,0.0000456619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004380054,"about_ca_system_score_gemma":0.0000203924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001007339,"about_ca_topic_score_gemma":0.00003060004,"domain_scores_codex":[0.998886,0.00005406295,0.0003118245,0.0003341887,0.000178443,0.0002354445],"domain_scores_gemma":[0.9986383,0.0002444008,0.0001006887,0.0007795455,0.000135286,0.0001017969],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001230668,0.0005742102,0.01646991,0.00008377028,0.001520704,0.000003865699,0.03280628,0.004173867,0.00418262,0.1611706,0.003618419,0.7752727],"study_design_scores_gemma":[0.0008903294,0.0005304977,0.03137627,0.0002476145,0.000289619,0.0001093993,0.0004811761,0.9103974,0.001927367,0.01236541,0.04038859,0.0009963588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.553623,0.002533326,0.3649633,0.0141417,0.00029136,0.001520056,0.000009108197,0.001326781,0.06159148],"genre_scores_gemma":[0.9540349,0.0003498049,0.0444554,0.0003223813,0.0000495756,0.0000765939,0.000002660428,0.000009649002,0.0006990015],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9062235,"threshold_uncertainty_score":0.5792619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072704385","doi":"10.1049/ip-com:20040524","title":"Double chip waveforms for asynchronous DS-CDMA systems with random signature sequences","year":2004,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba; University of Saskatchewan","funders":"","keywords":"Waveform; Chip; Rayleigh fading; Asynchronous communication; Electronic engineering; Multipath propagation; Interference (communication); Computer science; Signal-to-interference-plus-noise ratio; Noise (video); Code division multiple access; Algorithm; Signature (topology); Channel (broadcasting); Telecommunications; Fading; Mathematics; Physics; Engineering; Power (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.03842011548854348,"gpt":0.294715676216328,"spread":0.2562955607277846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.001002263,0.000300034,0.0003810479,0.0002529995,0.0013544,0.001034371,0.008257696,0.0001914202,0.000002809033],"category_scores_gemma":[0.0001145816,0.0002337719,0.0001090243,0.001286558,0.0004405541,0.001585716,0.001172486,0.0007561593,0.0000308851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003361197,"about_ca_system_score_gemma":0.0004494396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002410281,"about_ca_topic_score_gemma":0.0001133489,"domain_scores_codex":[0.9977347,0.00004336276,0.000509871,0.0005049956,0.0005712677,0.0006358044],"domain_scores_gemma":[0.9948384,0.0003672681,0.0003479361,0.002577503,0.001653081,0.0002157797],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002228854,0.0005062773,0.0004317664,0.0002152166,0.0001989857,0.000001344425,0.004697067,0.009839077,0.001572112,0.9752656,0.00184852,0.005201138],"study_design_scores_gemma":[0.03814033,0.00217444,0.001552352,0.002685152,0.0001920891,0.0004375799,0.004309481,0.708593,0.01255139,0.06834719,0.1572798,0.003737176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02999904,0.01257948,0.8624303,0.04066816,0.0006416645,0.008816221,0.00004058695,0.002348773,0.04247577],"genre_scores_gemma":[0.8962282,0.0006484198,0.1007733,0.0001355123,0.0001222681,0.001790967,0.00003593416,0.00003956249,0.0002258382],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9069184,"threshold_uncertainty_score":0.9999457,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997006052","doi":"10.1049/ip-com:20040365","title":"Performance analysis of multicarrier CDMA systems with parallel and serial concatenated coding in fading channels","year":2004,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Turbo code; Fading; Bit error rate; Algorithm; Convolutional code; Code division multiple access; Concatenated error correction code; Rayleigh fading; Multipath propagation; Turbo equalizer; Serial concatenated convolutional codes; Electronic engineering; Telecommunications link; Decoding methods; Telecommunications; Channel (broadcasting); Block code; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0205172527933003,"gpt":0.2507275195946645,"spread":0.2302102668013642,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002172987,0.0001705173,0.0003789019,0.000509694,0.000139342,0.00005045849,0.0006686843,0.00009123276,0.000001544705],"category_scores_gemma":[0.00003464262,0.0001718883,0.00003281691,0.00133255,0.0002103369,0.0004563743,0.0001663138,0.0002804647,8.078273e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001456701,"about_ca_system_score_gemma":0.00001641318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009632367,"about_ca_topic_score_gemma":0.00004774882,"domain_scores_codex":[0.9990547,0.00001325533,0.0004399099,0.0001555442,0.00012687,0.0002097015],"domain_scores_gemma":[0.9989373,0.00008015825,0.0001481197,0.0005817785,0.0001917893,0.00006082922],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004167231,0.0001029028,0.02953037,0.0003194593,0.0005966212,5.056571e-7,0.008492363,0.9162713,0.02832941,0.01555016,0.000008734645,0.0007565015],"study_design_scores_gemma":[0.00101898,0.00006027592,0.01014175,0.0005353297,0.0002296066,0.000008106636,0.001454437,0.9777339,0.008130799,0.0001397059,0.0001685604,0.0003785279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9861611,0.0006939865,0.01037394,0.0001350303,0.00002937702,0.0004912972,0.00001257234,0.0004405771,0.001662164],"genre_scores_gemma":[0.9771699,0.002374437,0.02012569,0.000007039907,0.000007244885,0.0002515386,0.00002420861,0.00003266026,0.000007237368],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06146261,"threshold_uncertainty_score":0.70094,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006164638","doi":"10.1049/ip-com:20060027","title":"Adaptive MLSD receiver employing noise correlation","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Noise (video); Channel (broadcasting); Algorithm; Computer science; Autoregressive model; Rayleigh fading; Energy (signal processing); Statistics; Signal-to-noise ratio (imaging); Bit error rate; Mathematics; Fading; Telecommunications; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01945113139744494,"gpt":0.2427290260591465,"spread":0.2232778946617015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001717714,0.0002191584,0.0001951194,0.0002121161,0.0004066908,0.00007734943,0.001231086,0.0001368386,0.00002093539],"category_scores_gemma":[0.00004656285,0.0002624397,0.00006803205,0.0005676357,0.00017426,0.0007625269,0.0002737769,0.0005140342,0.00009221952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002411544,"about_ca_system_score_gemma":0.00001650082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006616837,"about_ca_topic_score_gemma":0.00003992562,"domain_scores_codex":[0.9989207,0.00001969859,0.0004333265,0.0001864578,0.0001777649,0.000262092],"domain_scores_gemma":[0.9983206,0.0001445089,0.0001381706,0.001024285,0.0003138754,0.00005850813],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005847708,0.0007668069,0.02354624,0.0002203311,0.0002303782,0.000001630469,0.005120067,0.04334069,0.1947608,0.5990409,0.07947569,0.05343796],"study_design_scores_gemma":[0.0009946363,0.0001046897,0.02530192,0.0005095022,0.0001233086,0.00003607069,0.001234545,0.7259742,0.02995283,0.05877293,0.1551886,0.001806765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1183655,0.006904683,0.3270526,0.003184175,0.0004123234,0.002434928,0.00007476445,0.01566306,0.5259079],"genre_scores_gemma":[0.8843836,0.0009170453,0.1139193,0.00003754341,0.00004721288,0.0003019605,0.00005790042,0.00007191837,0.0002636015],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.766018,"threshold_uncertainty_score":0.9999828,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013775881","doi":"10.1049/ip-com:20030379","title":"Design of a new time orthogonal multiuser line code","year":2003,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Baud; Computer science; Data stream; Coding (social sciences); Data stream mining; Channel (broadcasting); Binary number; Computer network; Arithmetic; Telecommunications; Mathematics; Transmission (telecommunications); Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.05313894801924565,"gpt":0.288281332251594,"spread":0.2351423842323484,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002887161,0.0001849616,0.0002419501,0.0001561259,0.0001313544,0.00002621803,0.001312215,0.0001097399,0.00007007206],"category_scores_gemma":[0.0001942851,0.0002095375,0.00005579536,0.0004825956,0.0001384925,0.0003141767,0.0001630704,0.0003512283,0.00005730049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006923758,"about_ca_system_score_gemma":0.00005796159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005292562,"about_ca_topic_score_gemma":0.000003742043,"domain_scores_codex":[0.9990163,0.00003063966,0.0004540366,0.00013777,0.000151571,0.0002096711],"domain_scores_gemma":[0.9981791,0.0001977066,0.0001356091,0.001120653,0.0002667113,0.0001001815],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000420912,0.0007037636,0.001187687,0.0002246312,0.0003196438,5.326679e-7,0.005574249,0.03186598,0.7462001,0.160524,0.02889936,0.024458],"study_design_scores_gemma":[0.001355401,0.00016374,0.0003825988,0.000390375,0.0001070345,0.00003899229,0.0003446388,0.3627242,0.4457309,0.02863557,0.158958,0.001168488],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01266856,0.004749332,0.9357908,0.0009181949,0.00006879657,0.00137388,0.00003557568,0.003241436,0.04115346],"genre_scores_gemma":[0.5604228,0.001380075,0.4376062,0.00003288305,0.000009434747,0.0001019862,0.00001240369,0.00005223183,0.0003819886],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5477542,"threshold_uncertainty_score":0.8544691,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2542751485","doi":"10.1049/ip-com:20030923","title":"Dynamic lightpath restoration based on bidirectional initiation for wavelength-routed WDM networks","year":2003,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Survivability; Spare part; Backup; Computer science; Provisioning; Node (physics); Service recovery; Path (computing); Wavelength-division multiplexing; Distributed computing; Service (business); Engineering; Wavelength; Service quality","retraction":null,"screen_n_in":null,"score":{"opus":0.02187866597184415,"gpt":0.2590740091359867,"spread":0.2371953431641426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002133349,0.0001872248,0.0001550877,0.0001861271,0.0003486636,0.0000636839,0.0004070931,0.0001988722,0.000005566864],"category_scores_gemma":[0.0004626488,0.0002064639,0.00005981284,0.0005720408,0.00009178976,0.0002850749,0.00003380283,0.0003827687,0.00001090133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002650544,"about_ca_system_score_gemma":0.00002285604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.941424e-7,"about_ca_topic_score_gemma":0.00001183341,"domain_scores_codex":[0.9990811,0.00001368271,0.0003018175,0.0001981082,0.0001349534,0.0002703257],"domain_scores_gemma":[0.9988028,0.000336031,0.00008270048,0.000477405,0.0002499858,0.00005108858],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006823843,0.0003669237,0.0007353505,0.0001272669,0.00008922618,3.818213e-7,0.0002512698,0.5003519,0.003608748,0.4635542,0.00460296,0.02624354],"study_design_scores_gemma":[0.0003105243,0.00007152282,0.0004819077,0.00006032093,0.0000203786,0.000001722968,0.00006827698,0.9725952,0.000412287,0.009242211,0.01650776,0.0002279559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02353409,0.0009438451,0.9383544,0.002224008,0.000683801,0.001722058,0.00004161119,0.004729684,0.02776646],"genre_scores_gemma":[0.8107241,0.00034328,0.18814,0.00007912199,0.00002668944,0.0005115021,0.0000939666,0.00004727417,0.00003413046],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.78719,"threshold_uncertainty_score":0.8419355,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071229443","doi":"10.1049/ip-com:20050133","title":"Filter-bank design for multicarrier modulation systems with MPSK based on symbol-error-rate evaluation","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Cyclic prefix; Filter bank; Modulation (music); Algorithm; Discrete Fourier transform (general); Computer science; Filter (signal processing); Bit error rate; Electronic engineering; Phase-shift keying; Communications system; Mathematics; Telecommunications; Fourier transform; Engineering; Channel (broadcasting); Fractional Fourier transform; Fourier analysis; Physics; Acoustics","retraction":null,"screen_n_in":null,"score":{"opus":0.0705996726529543,"gpt":0.2889543459432077,"spread":0.2183546732902534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007559441,0.0002265164,0.0001906694,0.000233686,0.0003475894,0.0001559513,0.0004583884,0.0001162263,0.00001296737],"category_scores_gemma":[0.0001291912,0.0002270881,0.00005314816,0.0003862726,0.00008597853,0.000338294,0.00002276569,0.0001959597,0.0000227772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003243657,"about_ca_system_score_gemma":0.00005445112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000328265,"about_ca_topic_score_gemma":0.000006172183,"domain_scores_codex":[0.9987506,0.0000527087,0.0003804703,0.0002406897,0.0003144428,0.0002610368],"domain_scores_gemma":[0.9982235,0.0002686149,0.0001369219,0.0006370948,0.0006700339,0.00006382482],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004029053,0.00009787071,0.0004578365,0.00010032,0.00004211336,5.33005e-8,0.0002456856,0.9771429,0.01272116,0.004284121,0.004313967,0.0005536634],"study_design_scores_gemma":[0.0008057251,0.00007971347,0.002786415,0.0001397687,0.00009364595,0.000003219787,0.0001695307,0.9898154,0.002714593,0.0005518247,0.002574153,0.0002659955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2228295,0.0007662637,0.7300651,0.002190929,0.000977218,0.008877968,0.0001462135,0.002569744,0.03157702],"genre_scores_gemma":[0.9684175,0.000009307348,0.02852968,0.00002412437,0.0001303399,0.002548683,0.000133077,0.00007676781,0.0001304824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7455881,"threshold_uncertainty_score":0.9260383,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085183466","doi":"10.1049/ip-com:20045154","title":"Narrowband interference mitigation in an ultra-wideband receiver","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Narrowband; Electronic engineering; Wideband; Bandwidth (computing); Band-pass filter; Computer science; Interference (communication); Signal processing; Context (archaeology); Ultra-wideband; Filter (signal processing); Telecommunications; Channel (broadcasting); Engineering; Digital signal processing","retraction":null,"screen_n_in":null,"score":{"opus":0.0143314881935702,"gpt":0.2398240566325151,"spread":0.2254925684389449,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000215986,0.00020972,0.0002092238,0.0003711538,0.0002168195,0.0001146472,0.001822183,0.0001968343,0.00002753817],"category_scores_gemma":[0.00006799485,0.000243121,0.00004344587,0.0007898602,0.0002611268,0.0007396776,0.00007596498,0.0005913993,0.00004248643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001721686,"about_ca_system_score_gemma":0.00002227753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001588425,"about_ca_topic_score_gemma":0.001426193,"domain_scores_codex":[0.9988321,0.0000289197,0.0004908051,0.0002276358,0.0001157993,0.000304747],"domain_scores_gemma":[0.9983082,0.0001218461,0.000083429,0.001237436,0.0001917414,0.00005738047],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002569926,0.00080405,0.1341264,0.0001220503,0.00005935201,0.000001384302,0.004821136,0.00146904,0.7308737,0.1051365,0.007835769,0.014725],"study_design_scores_gemma":[0.004669447,0.0005387348,0.1300818,0.001264959,0.0002108054,0.0002059632,0.006973998,0.0741371,0.4822399,0.1873182,0.108116,0.004243162],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9064394,0.001606909,0.0013512,0.001930791,0.00008221179,0.0004852433,0.00001610663,0.001368107,0.08672009],"genre_scores_gemma":[0.993664,0.0005705216,0.00515397,0.00005076222,0.00002525367,0.0002964486,0.0000890209,0.0000444487,0.000105617],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2486338,"threshold_uncertainty_score":0.9914187,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059510432","doi":"10.1049/ip-com:20040548","title":"Quantiser design for AWGN and Rayleigh fading BPSK channels with soft output decoding","year":2004,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Additive white Gaussian noise; Phase-shift keying; Rayleigh fading; Demodulation; Decoding methods; Fading; Algorithm; Mathematics; Channel (broadcasting); Telecommunications; Computer science; Electronic engineering; Bit error rate; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.08265149304813776,"gpt":0.3166412969365811,"spread":0.2339898038884433,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004355662,0.0002244081,0.000236284,0.0002087048,0.0008367153,0.0004094783,0.002579212,0.00008064693,9.933148e-7],"category_scores_gemma":[0.0001769548,0.0002024229,0.00003989802,0.0004414326,0.0001740331,0.001880894,0.001077801,0.000238654,0.000005124819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008123109,"about_ca_system_score_gemma":0.00007341246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001364869,"about_ca_topic_score_gemma":0.000003181221,"domain_scores_codex":[0.9986488,0.0000174876,0.0003053859,0.0004715045,0.0001959106,0.0003609382],"domain_scores_gemma":[0.9979322,0.000328393,0.0002382427,0.00102811,0.0003415575,0.0001315093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006284563,0.0003255022,0.0005691528,0.0001418162,0.00008376352,0.000002159812,0.007239745,0.00100739,0.0215135,0.9185402,0.003403964,0.0471099],"study_design_scores_gemma":[0.004547897,0.001216051,0.0004724261,0.002058402,0.0001215528,0.0003148776,0.001166796,0.2344878,0.1895529,0.5041704,0.05953502,0.002355887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002198431,0.0004593817,0.99256,0.002783291,0.00005325218,0.0008357332,0.000007201328,0.0007287981,0.0003739161],"genre_scores_gemma":[0.4407946,0.0001742619,0.558478,0.0001455299,0.0000180991,0.0003293828,0.00000429757,0.00001950482,0.00003624132],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4385962,"threshold_uncertainty_score":0.8254568,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988213749","doi":"10.1049/ip-com:20050585","title":"Tight lower bounds on the symbol error rate of uncoded nonuniform signalling over AWGN channel","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Mathematics; Additive white Gaussian noise; Bernoulli's principle; Upper and lower bounds; Bonferroni correction; Channel (broadcasting); Range (aeronautics); Statistics; Algorithm; Combinatorics; Applied mathematics; Discrete mathematics; White noise; Computer science; Mathematical analysis; Telecommunications; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02316568344854083,"gpt":0.252681726460682,"spread":0.2295160430121412,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004190414,0.0002578104,0.0002604957,0.0001849918,0.0004153065,0.00007708383,0.002064024,0.0001266712,0.00003616461],"category_scores_gemma":[0.00006565523,0.0002225143,0.0001083877,0.0005922748,0.0002775615,0.000358977,0.0002926179,0.0005764564,0.00002548376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001462603,"about_ca_system_score_gemma":0.00002480207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005580227,"about_ca_topic_score_gemma":0.00004320692,"domain_scores_codex":[0.9987761,0.00002758696,0.0005425157,0.0001722242,0.0001937835,0.0002877683],"domain_scores_gemma":[0.9976509,0.0003688442,0.0002226699,0.001394911,0.0003145339,0.0000481412],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007255795,0.0009312617,0.0005342481,0.0002924346,0.0002526367,8.371228e-7,0.00335378,0.01983301,0.3073518,0.6406246,0.02498192,0.00177092],"study_design_scores_gemma":[0.001041898,0.0002297261,0.002430443,0.001099293,0.0001310072,0.000009685937,0.001315145,0.4041517,0.424125,0.09421717,0.06972641,0.001522525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.667276,0.003457951,0.04117592,0.009819931,0.0003873573,0.00315881,0.0001406827,0.005067199,0.2695162],"genre_scores_gemma":[0.992164,0.0006467414,0.006275245,0.0001478866,0.00004490595,0.0003550051,0.00003152682,0.00007905549,0.0002556959],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5464074,"threshold_uncertainty_score":0.907387,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976260570","doi":"10.1049/ip-com:20030180","title":"Rate controller for high-speed networks","year":2003,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Controller (irrigation); Leaky bucket; Computer science; Markov chain; Control theory (sociology); Process (computing); Markov process; Control (management); Mathematics; Statistics; Computer network; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02234975901314207,"gpt":0.249707666488322,"spread":0.2273579074751799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008053958,0.0001840336,0.0002517178,0.00008278323,0.0006198401,0.000326198,0.002089805,0.0001040525,0.000009649148],"category_scores_gemma":[0.0002131292,0.0001797336,0.0001020121,0.0004694866,0.0001094419,0.0004692784,0.0001730467,0.0002478441,0.00003201686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004366181,"about_ca_system_score_gemma":0.00006541207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005110457,"about_ca_topic_score_gemma":0.000005333302,"domain_scores_codex":[0.9987354,0.00005714253,0.0003536475,0.0003376163,0.0001243292,0.0003918882],"domain_scores_gemma":[0.9978541,0.0005131225,0.0001944163,0.000780203,0.0005271603,0.0001310144],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001111229,0.00007709293,0.00009088293,0.000003856614,0.00004222325,9.990485e-8,0.0001337025,0.0004426944,0.0002319368,0.9651092,0.00783607,0.02602117],"study_design_scores_gemma":[0.002224323,0.00008764566,0.0003076575,0.00002817285,0.00004371351,0.000008628843,0.00006106163,0.8340489,0.0001133922,0.0238984,0.1388382,0.0003399024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001454055,0.001505792,0.9706562,0.01093229,0.0004518902,0.001067402,0.000003988464,0.0005915731,0.01333676],"genre_scores_gemma":[0.9492393,0.0002088233,0.04789312,0.001242034,0.00009665686,0.0003336442,0.000005554467,0.00001921513,0.0009616608],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9477853,"threshold_uncertainty_score":0.7329326,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}