{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":391,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":391,"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":"3fab393fcca8","filters":{"venue":"IEEE Transactions on Signal Processing"}},"results":[{"id":"W2788350651","doi":"10.1109/tsp.2018.2812733","title":"Fractional Programming for Communication Systems—Part I: Power Control and Beamforming","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1808,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Beamforming; Mathematical optimization; Optimization problem; Quadratic programming; Convex optimization; Maximization; Computer science; Iterative method; Mathematics; Convergence (economics); Fractional programming; Regular polygon; Nonlinear programming","retraction":null,"screen_n_in":null,"score":{"opus":0.01293441291470982,"gpt":0.2486897928834811,"spread":0.2357553799687713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000207861,0.0001718206,0.0001803178,0.000137971,0.0005530955,0.0001322679,0.00007976763,0.0001049372,0.00001266446],"category_scores_gemma":[0.000004209034,0.0001829164,0.00004056742,0.0001737298,0.00008161148,0.0006531685,5.693321e-7,0.0001701012,0.000007240044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001051903,"about_ca_system_score_gemma":0.00002692654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004548155,"about_ca_topic_score_gemma":0.000007037476,"domain_scores_codex":[0.9990948,0.00002468585,0.0003200756,0.0001938927,0.0001311034,0.0002354212],"domain_scores_gemma":[0.9993616,0.000123018,0.00008665314,0.0001391121,0.0002207525,0.00006880097],"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.0001018378,0.00005212038,0.000006526617,0.0002605077,0.00006946444,3.556092e-7,0.0006849422,0.9052906,0.004155735,0.00008173074,0.0000646895,0.08923148],"study_design_scores_gemma":[0.0009114582,0.0001366294,0.000003549107,0.0003991179,0.00005503013,0.00003116863,0.000538739,0.9883136,0.003879025,0.00005518324,0.00540067,0.0002758369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001187279,0.0005045412,0.9966328,0.00002814395,0.0003084005,0.0006219601,0.00002147796,0.0003759784,0.0003194917],"genre_scores_gemma":[0.9777318,0.0000145957,0.02174487,0.00002815808,0.0001235608,0.0002146445,0.000005990062,0.00005510623,0.00008123736],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9765446,"threshold_uncertainty_score":0.7459115,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113168978","doi":"10.1109/tsp.2002.806865","title":"Robust adaptive beamforming using worst-case performance optimization: a solution to the signal mismatch problem","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":1485,"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":"Adaptive beamformer; Beamforming; Diagonal; Control theory (sociology); SIGNAL (programming language); Computer science; Convex optimization; Optimization problem; Antenna array; Mathematical optimization; Algorithm; Mathematics; Antenna (radio); Regular polygon; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.05056948937366794,"gpt":0.2594660253364298,"spread":0.2088965359627618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006328172,0.00023776,0.0002053674,0.000329099,0.001090385,0.0002251241,0.0003738783,0.00009339434,0.00003888741],"category_scores_gemma":[0.000006280553,0.0002061253,0.00008822486,0.001548847,0.00007721341,0.001593076,0.00000532229,0.0002895595,0.000007630157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001923375,"about_ca_system_score_gemma":0.0002860244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003574127,"about_ca_topic_score_gemma":0.000009899383,"domain_scores_codex":[0.9981766,0.0001257991,0.0004876699,0.0004247916,0.0004526522,0.000332514],"domain_scores_gemma":[0.998876,0.00009351068,0.0002524914,0.0002756956,0.0003923267,0.0001099627],"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.00002000628,0.0000852471,0.000001669839,0.00004323177,0.00001228261,0.000005539049,0.000994783,0.9017516,0.0008110519,0.00008810404,0.00001523701,0.0961713],"study_design_scores_gemma":[0.0001522948,0.0001719514,8.156861e-7,0.0002944908,0.00002763533,0.0004563047,0.0001416662,0.906196,0.09217694,0.00009010708,0.00006997997,0.0002218116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002272981,0.00003402057,0.9955979,0.0001457986,0.0001335262,0.0005248845,0.000003071586,0.0003135703,0.0009742239],"genre_scores_gemma":[0.5556334,0.000002326026,0.4441757,0.00006639786,0.00001596479,0.00005335434,2.489648e-7,0.00001460421,0.00003795081],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5533605,"threshold_uncertainty_score":0.8405547,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153290280","doi":"10.1109/tsp.2004.830985","title":"The Kernel Recursive Least-Squares Algorithm","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1096,"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":"Algorithm; Kernel (algebra); Mathematics; Representation (politics); Bounded function; Least-squares function approximation; Signal processing; Recursive least squares filter; Nonlinear system; Computer science; Adaptive filter; Digital signal processing","retraction":null,"screen_n_in":null,"score":{"opus":0.01365143437247462,"gpt":0.2314048029116086,"spread":0.217753368539134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007397842,0.0001852271,0.0001245252,0.00008047733,0.0005306419,0.0001432862,0.0001729958,0.00008329709,0.00001189305],"category_scores_gemma":[0.000001180478,0.0001482734,0.00008291956,0.0002230518,0.00009250518,0.0001880723,7.410675e-7,0.0003575598,0.00003365343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009901348,"about_ca_system_score_gemma":0.00004455133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001700611,"about_ca_topic_score_gemma":0.00001258939,"domain_scores_codex":[0.9991262,0.00001761976,0.0001851867,0.0001789614,0.0002104598,0.0002815657],"domain_scores_gemma":[0.9996026,0.00005377003,0.00003277091,0.0001648178,0.00008294261,0.00006307347],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001524172,0.0000351354,2.169413e-7,0.0000111832,0.0000319125,0.00001183652,0.000303033,0.2312658,0.004944118,0.00003506127,0.0001279032,0.7632186],"study_design_scores_gemma":[0.000549901,0.0001607528,0.00001594403,0.0005086469,0.00006587752,0.00007845521,0.0005058523,0.1218707,0.8622503,0.0104508,0.003024541,0.0005182442],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003205507,0.0006641856,0.9936315,0.0001463285,0.0002381058,0.0001277594,0.00000562938,0.0008804498,0.00110054],"genre_scores_gemma":[0.9926164,0.0001093083,0.006948816,0.00007650346,0.00009054563,0.00002967069,7.10119e-7,0.00004561397,0.00008245908],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9894109,"threshold_uncertainty_score":0.6046414,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2706056020","doi":"10.1109/tsp.2018.2818082","title":"Massive Connectivity With Massive MIMO—Part I: Device Activity Detection and Channel Estimation","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":719,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Channel (broadcasting); Telecommunications link; MIMO; Coherence time; Exploit; Base station; False alarm; Coherence (philosophical gambling strategy); Constant false alarm rate; Real-time computing; Algorithm; Computer network; Mathematics; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01444700513411689,"gpt":0.2353521364346616,"spread":0.2209051313005447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001073584,0.0002595611,0.0002151472,0.0001860303,0.0004692049,0.00009161468,0.00005419849,0.0001315666,0.00001900274],"category_scores_gemma":[0.000005039037,0.0002551705,0.00002936535,0.0004217892,0.0001177456,0.001068328,7.363595e-7,0.0002653045,0.00001515057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001860573,"about_ca_system_score_gemma":0.00003726325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001476849,"about_ca_topic_score_gemma":0.0001465729,"domain_scores_codex":[0.9989849,0.00004655546,0.0001877387,0.0003418561,0.0001776328,0.000261276],"domain_scores_gemma":[0.9993837,0.00007949498,0.0001068347,0.0001307373,0.0002041056,0.00009507369],"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.0001407047,0.00003948818,0.000002405911,0.0001710394,0.00003753893,0.00000258967,0.0005178019,0.8067399,0.03047864,0.00000170294,0.000002703491,0.1618655],"study_design_scores_gemma":[0.0003861097,0.0001822947,0.00003236254,0.0002009442,0.00004500846,0.00002191185,0.000167985,0.6969807,0.3017042,0.0000382077,0.00001142887,0.0002288767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06770187,0.00003538869,0.9308622,0.00003089648,0.0002124723,0.0003500148,0.00001108659,0.0004436857,0.0003523601],"genre_scores_gemma":[0.9955316,0.000007010085,0.004124931,0.00001880143,0.0001129048,0.0001065324,0.000001517957,0.00006144509,0.00003532213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9278297,"threshold_uncertainty_score":0.99999,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144903371","doi":"10.1109/tsp.2010.2056923","title":"Cubature Kalman Filtering for Continuous-Discrete Systems: Theory and Simulations","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":572,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"University of Oxford; McMaster University","keywords":"Mathematics; Kalman filter; Nonlinear system; Filter (signal processing); Covariance; Context (archaeology); State vector; Applied mathematics; Curse of dimensionality; Gaussian; Algorithm; Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01305406023016089,"gpt":0.2595318407802652,"spread":0.2464777805501043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000369444,0.0001808387,0.0001840546,0.0001322394,0.0007701145,0.0005167517,0.000318819,0.0001463349,0.00001957971],"category_scores_gemma":[0.000009693739,0.0001627066,0.00006059013,0.000213698,0.0000758876,0.0006335393,0.000004088209,0.0004585113,0.000003741249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000106345,"about_ca_system_score_gemma":0.00004073543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003871691,"about_ca_topic_score_gemma":0.000008618893,"domain_scores_codex":[0.9988002,0.00006230621,0.0002537301,0.0004241726,0.0001809164,0.0002786558],"domain_scores_gemma":[0.9988474,0.0005249217,0.00009788504,0.0002936784,0.0001240758,0.0001119906],"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.0002406192,0.0002120895,0.00003730326,0.0004067691,0.00008241182,0.00001386211,0.002509515,0.2940076,0.1038917,0.01666077,0.0004967863,0.5814406],"study_design_scores_gemma":[0.0005691162,0.0001060222,0.00002191895,0.0002154101,0.00003950126,0.00006016835,0.0001352942,0.9797989,0.01151896,0.002391864,0.00476962,0.0003732119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00905322,0.0001546686,0.9891489,0.000113096,0.0007762552,0.0002568959,0.0000591342,0.0002937255,0.000144082],"genre_scores_gemma":[0.972704,0.000004946844,0.02669856,0.000119992,0.0001585374,0.0000339212,0.000005195955,0.00002229887,0.0002525274],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9636508,"threshold_uncertainty_score":0.6634981,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2788428941","doi":"10.1109/tsp.2018.2812748","title":"Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Smart Parking Systems Research","field":"Engineering","cited_by":538,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Telecommunications link; Computer science; Scheduling (production processes); Mathematical optimization; Optimization problem; Convex optimization; Distributed computing; Algorithm; Regular polygon; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.03411177826444568,"gpt":0.2986854867013103,"spread":0.2645737084368646,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007350601,0.0002566723,0.0002625579,0.0003164879,0.001660178,0.0003103933,0.0002885858,0.0001837291,0.00004676753],"category_scores_gemma":[0.000007567814,0.0002792325,0.0001090781,0.000443402,0.0001092619,0.0005592228,0.000003097035,0.000546031,0.00006596711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000270339,"about_ca_system_score_gemma":0.00008728895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000434323,"about_ca_topic_score_gemma":0.00002159877,"domain_scores_codex":[0.9981638,0.0000672868,0.0005151497,0.0003260509,0.000426018,0.0005017081],"domain_scores_gemma":[0.998849,0.0002325673,0.0001280807,0.0003080569,0.0003589491,0.0001233283],"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.0001137322,0.0001555689,0.00001504477,0.0008538085,0.0001672114,0.000001623187,0.001420855,0.6869254,0.01997533,0.00006868089,0.0001723709,0.2901304],"study_design_scores_gemma":[0.0004909725,0.0001465712,0.000005895866,0.0009706055,0.00004361217,0.00004500963,0.0003525543,0.9672015,0.0198539,0.0001260772,0.01039068,0.0003726361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02507663,0.0004362385,0.9718286,0.00006065239,0.0007382685,0.0006929002,0.00001121633,0.0007341025,0.000421343],"genre_scores_gemma":[0.9785184,0.000009634648,0.01998988,0.00001952958,0.0005802047,0.0005377744,0.00001190716,0.0001048469,0.0002277764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9534418,"threshold_uncertainty_score":0.999966,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102511552","doi":"10.1109/tsp.2003.812753","title":"Detection of LSB steganography via sample pair analysis","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":522,"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":"Least significant bit; Steganalysis; Steganography; Robustness (evolution); Computer science; Embedding; Digital watermarking; Artificial intelligence; Sample (material); Pattern recognition (psychology); Mathematics; Algorithm; Statistics; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.0149777103869064,"gpt":0.2444535555597215,"spread":0.2294758451728151,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002836325,0.0001866227,0.000255512,0.0009925284,0.000364509,0.0000794151,0.0003186025,0.00009404573,0.00001126414],"category_scores_gemma":[0.000002553842,0.0001772296,0.0003381742,0.003489377,0.00008626413,0.0007004216,0.000001383649,0.0002219291,0.000001121825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002510847,"about_ca_system_score_gemma":0.00003305667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001978586,"about_ca_topic_score_gemma":0.00001719348,"domain_scores_codex":[0.9985943,0.0001212699,0.000339745,0.0003848663,0.000302442,0.0002573919],"domain_scores_gemma":[0.999165,0.0001178335,0.000174396,0.0003293315,0.0001397828,0.00007365346],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006222012,0.0004541928,0.0005034861,0.0001137475,0.0004208595,0.00000528348,0.001040466,0.02763462,0.07482763,0.0003874805,0.000002587387,0.8945475],"study_design_scores_gemma":[0.0001886434,0.0002034477,0.0001045004,0.00004281311,0.0001719502,0.000008095868,0.00003760427,0.04719997,0.943139,0.008378273,0.0002588306,0.0002669391],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007154122,0.00008667744,0.9920334,0.00001687938,0.00007720479,0.0001131285,0.000004995578,0.0003794953,0.0001341462],"genre_scores_gemma":[0.9057118,0.000008523086,0.09418219,0.00004448338,0.000007527602,0.00002555026,5.934773e-7,0.00001066049,0.000008706202],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8985577,"threshold_uncertainty_score":0.7227213,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133598069","doi":"10.1109/78.852023","title":"Partial encryption of compressed images and videos","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":521,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; University of Waterloo","funders":"","keywords":"Encryption; Computer science; Set partitioning in hierarchical trees; Lossy compression; Data compression; On-the-fly encryption; 40-bit encryption; Multiple encryption; Probabilistic encryption; Image compression; Filesystem-level encryption; Computer network; Real-time computing; Algorithm; Image processing; Computer vision; Image (mathematics); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0146585499317986,"gpt":0.2449781220232591,"spread":0.2303195720914605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002079445,0.0001810387,0.0002031996,0.0001708817,0.0002548707,0.0001562933,0.0002654638,0.00007236395,0.0002435896],"category_scores_gemma":[0.000001873183,0.0001803044,0.00007211438,0.0004002018,0.0001409979,0.001189814,0.000001975968,0.0002187454,0.0000319208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003588169,"about_ca_system_score_gemma":0.00008094248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000329773,"about_ca_topic_score_gemma":0.000002186918,"domain_scores_codex":[0.9985774,0.00008735432,0.0003363485,0.0004004547,0.0003610514,0.0002374559],"domain_scores_gemma":[0.9993718,0.0001026612,0.0001066212,0.0002131234,0.0001058209,0.00009996177],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00009635166,0.0001762286,0.000004992395,0.00007660805,0.0000120671,0.000005700807,0.0004296613,0.0244533,0.2361904,0.00003990038,0.00002478736,0.73849],"study_design_scores_gemma":[0.000707559,0.0002166139,0.00016412,0.0001651435,0.00002875467,0.00002900641,0.00002333966,0.3515056,0.6461018,0.000659981,0.0001647287,0.0002333497],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04305687,0.0001289832,0.9558059,0.0002063119,0.00006390906,0.0001515178,0.000007271718,0.0001772254,0.0004020291],"genre_scores_gemma":[0.9867718,0.00003241654,0.01287903,0.0001295748,0.00003963559,0.0000207254,0.00000106532,0.00001414353,0.0001116375],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9437149,"threshold_uncertainty_score":0.7352601,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150835235","doi":"10.1109/tsp.2003.815395","title":"Robust adaptive beamforming for general-rank signal models","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":515,"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":"Adaptive beamformer; Beamforming; Robustness (evolution); Signal subspace; Computer science; Covariance matrix; Computational complexity theory; Sensor array; Signal processing; Algorithm; Adaptive filter; SIGNAL (programming language); Array processing; Control theory (sociology); Rank (graph theory); Subspace topology; Antenna array; Mathematics; Artificial intelligence; Noise (video); Machine learning; Digital signal processing; Telecommunications; Antenna (radio)","retraction":null,"screen_n_in":null,"score":{"opus":0.06330710987030926,"gpt":0.2738965409851671,"spread":0.2105894311148579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003976321,0.0002235745,0.0002514073,0.0003223789,0.0004366435,0.000135847,0.0003709348,0.000108987,0.00002500083],"category_scores_gemma":[0.000005130032,0.0002279107,0.0001584727,0.0006098363,0.00007182741,0.001713622,0.000001821008,0.0001999699,0.000003737729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001021318,"about_ca_system_score_gemma":0.0002486454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001389119,"about_ca_topic_score_gemma":0.000003157996,"domain_scores_codex":[0.9983812,0.00006227192,0.0004343365,0.000440117,0.0003710063,0.0003110736],"domain_scores_gemma":[0.998965,0.0001532767,0.0002072454,0.0002219963,0.00035461,0.00009792173],"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.00003570925,0.0001671756,3.843037e-7,0.00006681985,0.00002613128,9.98511e-7,0.0004667128,0.7180094,0.007787767,0.009076317,0.00003612298,0.2643265],"study_design_scores_gemma":[0.0002153818,0.0001551569,3.717132e-7,0.00009159894,0.00001780663,0.00001138052,0.0000272566,0.6369011,0.3472718,0.01506626,0.00006908797,0.0001728637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004639347,0.00005507816,0.99659,0.00005125108,0.00014162,0.0003956536,0.000009668215,0.0004127877,0.001880072],"genre_scores_gemma":[0.5444257,0.000003344806,0.4552523,0.00006298375,0.00001567865,0.0001012628,4.935051e-7,0.00001726625,0.0001209919],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5439618,"threshold_uncertainty_score":0.929393,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132506160","doi":"10.1109/tsp.2010.2043976","title":"Phased-MIMO Radar: A Tradeoff Between Phased-Array and MIMO Radars","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Radar Systems and Signal Processing","field":"Engineering","cited_by":472,"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":"Phased array; MIMO; Radar; Active electronically scanned array; Remote sensing; Radar engineering details; Radar configurations and types; Radar systems; Environmental science; Computer science; Electronic engineering; Geology; Beamforming; Telecommunications; Engineering; Radar imaging; Antenna (radio)","retraction":null,"screen_n_in":null,"score":{"opus":0.01431878004242053,"gpt":0.2372784112188631,"spread":0.2229596311764426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003621231,0.0005023004,0.0005246926,0.0003424395,0.0006854018,0.000374175,0.0002548882,0.0003097148,0.0001378517],"category_scores_gemma":[0.000003577659,0.0004932411,0.0001515719,0.0004972188,0.0001820516,0.0008085953,5.219123e-7,0.00120355,0.00002338101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006163011,"about_ca_system_score_gemma":0.0001194674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002461793,"about_ca_topic_score_gemma":0.00002858905,"domain_scores_codex":[0.9977084,0.00004510941,0.0006220835,0.0005295813,0.0004833948,0.0006113889],"domain_scores_gemma":[0.9990797,0.0001438621,0.0001058089,0.0002432325,0.00007799688,0.0003494073],"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.00003303497,0.00009412855,0.00002017088,0.0003501542,0.0000702629,0.000008616299,0.0005529094,0.0009840491,0.6385317,0.000004115707,0.00006303528,0.3592878],"study_design_scores_gemma":[0.002355114,0.0002773412,0.00007095281,0.0005705957,0.0002493726,0.000201866,0.0004113638,0.01027499,0.9657323,0.0002476964,0.01829604,0.00131239],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1139218,0.0009442098,0.8808537,0.0001186233,0.0004984508,0.0002715119,0.00004823188,0.0006371418,0.002706338],"genre_scores_gemma":[0.9945435,0.00001950714,0.004645287,0.00005535698,0.0004184842,0.00003131892,0.000003983051,0.0001330624,0.0001494915],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8806217,"threshold_uncertainty_score":0.9997519,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2784331297","doi":"10.1109/tsp.2018.2795540","title":"Sparse Activity Detection for Massive Connectivity","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":389,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fading; Computer science; Channel (broadcasting); Base station; False alarm; Algorithm; Compressed sensing; Wireless; Signature (topology); Mathematics; Telecommunications; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02796180552894003,"gpt":0.2590285853425017,"spread":0.2310667798135616,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009738021,0.0001993751,0.0001790621,0.0001500444,0.0003949845,0.00007436103,0.00008718623,0.0001277392,0.00003012336],"category_scores_gemma":[0.000003111801,0.0002093255,0.00009576031,0.0002228717,0.0000930396,0.0003104414,5.156921e-7,0.0002283923,0.0000174446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001026229,"about_ca_system_score_gemma":0.00002701621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001121267,"about_ca_topic_score_gemma":0.00005213065,"domain_scores_codex":[0.9991735,0.00002552047,0.0001382421,0.0002571933,0.0001348685,0.0002706879],"domain_scores_gemma":[0.99949,0.00009004422,0.00004562172,0.0001497454,0.0001597115,0.00006489297],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000131086,0.00006429444,0.000001336609,0.00003851905,0.00003655528,0.000001735518,0.0001493195,0.01794773,0.4265722,0.000003609995,0.00008023896,0.5549734],"study_design_scores_gemma":[0.0001939917,0.000172562,0.00002539511,0.00006570028,0.00003067443,0.000006863753,0.00002439807,0.2957004,0.703023,0.0002703589,0.0003090745,0.0001776036],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1501434,0.0000210195,0.8476683,0.00002248378,0.0003098257,0.0002425166,0.00001033961,0.0009687841,0.0006133298],"genre_scores_gemma":[0.9972408,0.000004002972,0.002322079,0.00004432102,0.0002152703,0.00008198505,4.722169e-7,0.00005166111,0.00003944758],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8470974,"threshold_uncertainty_score":0.8536048,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092323252","doi":"10.1109/tsp.2014.2314064","title":"Efficient Closed-Form Algorithms for AOA Based Self-Localization of Sensor Nodes Using Auxiliary Variables","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":283,"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":"Estimator; Algorithm; Mathematics; Angle of arrival; Initialization; Cramér–Rao bound; Minimum-variance unbiased estimator; Wireless sensor network; Noise (video); Computer science; Mathematical optimization; Estimation theory; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01707405181299742,"gpt":0.2408901146053025,"spread":0.2238160627923051,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002346899,0.0002176674,0.0002491344,0.0003034109,0.0002974189,0.00004642785,0.0001240275,0.0001923458,0.0000191289],"category_scores_gemma":[0.000008735938,0.0002157064,0.0001012686,0.0004617843,0.00006602727,0.0001057912,8.604943e-7,0.0001443777,0.000002300856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001120988,"about_ca_system_score_gemma":0.00006373855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000703767,"about_ca_topic_score_gemma":0.000001425196,"domain_scores_codex":[0.9988533,0.00002498417,0.0003888142,0.0002233938,0.0002303417,0.0002791761],"domain_scores_gemma":[0.9993907,0.0001285592,0.00008521865,0.0001526129,0.0001971339,0.00004581381],"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.00002399365,0.00008413024,0.000008909624,0.0005144418,0.00002309924,2.755597e-7,0.0001556164,0.9462394,0.009672138,0.00003510004,0.000005335183,0.04323759],"study_design_scores_gemma":[0.0004357878,0.00004773695,0.000002242885,0.0001341947,0.00006151755,0.000002018525,0.00009493976,0.6995079,0.2993328,0.0001081605,0.0001028426,0.000169849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01091542,0.00004811932,0.9875071,0.00001039169,0.0001972063,0.0002777804,0.00003148741,0.0008692369,0.0001432439],"genre_scores_gemma":[0.9407297,0.000004056394,0.05907842,0.00004146721,0.00004256008,0.00003244213,0.000006379618,0.00005579296,0.000009137635],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9298143,"threshold_uncertainty_score":0.8796253,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154354807","doi":"10.1109/tsp.2012.2189389","title":"Robust Adaptive Beamforming Based on Steering Vector Estimation With as Little as Possible Prior Information","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":280,"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":"Adaptive beamformer; Robustness (evolution); Mathematical optimization; Beamforming; Quadratic programming; Minimum-variance unbiased estimator; Computer science; Convex optimization; Control theory (sociology); Mathematics; Algorithm; Regular polygon; Artificial intelligence; Estimator; Statistics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02117742417983207,"gpt":0.2502864510795929,"spread":0.2291090268997608,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003360406,0.0002136036,0.0001830028,0.0004858547,0.0003819646,0.0002075982,0.0002560811,0.00009021543,0.00003250055],"category_scores_gemma":[0.00001576471,0.0001956899,0.000060345,0.0008035714,0.00005184308,0.00542541,0.000002741805,0.0002424666,0.00005545031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001960435,"about_ca_system_score_gemma":0.0002709659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005635457,"about_ca_topic_score_gemma":0.000001709223,"domain_scores_codex":[0.9984987,0.00004296196,0.0003715336,0.0002106798,0.0005905929,0.0002855452],"domain_scores_gemma":[0.9989637,0.0001339242,0.0002921904,0.0002374177,0.0002511825,0.0001215802],"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.0001197147,0.0001777576,0.00001105737,0.0001225136,0.00001305803,5.461259e-7,0.001325722,0.5243687,0.0006848826,0.0003890447,0.000004775293,0.4727822],"study_design_scores_gemma":[0.0002564448,0.0004720205,0.00008937141,0.0004300531,0.0000185009,0.00001519134,0.00006918715,0.7182996,0.2800044,0.0001338338,0.00002279529,0.0001886338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005493178,0.00001271193,0.990671,0.0000830216,0.0001340145,0.0003433019,0.000003652392,0.0005250473,0.002734106],"genre_scores_gemma":[0.7425889,8.197666e-7,0.2571791,0.0001047472,0.00001662994,0.00006443533,0.000002080714,0.00001414949,0.00002913382],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7370957,"threshold_uncertainty_score":0.7980002,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132679193","doi":"10.1109/tsp.2011.2125960","title":"Transmit Energy Focusing for DOA Estimation in MIMO Radar With Colocated Antennas","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Radar Systems and Signal Processing","field":"Engineering","cited_by":279,"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":"Rotational invariance; MIMO; Signal subspace; Energy (signal processing); Computer science; Waveform; Radar; Algorithm; Subspace topology; Antenna (radio); Focus (optics); Signal-to-noise ratio (imaging); Noise (video); Electronic engineering; Mathematics; Telecommunications; Computer vision; Engineering; Artificial intelligence; Beamforming; Physics; Statistics; Optics","retraction":null,"screen_n_in":null,"score":{"opus":0.02092456305696675,"gpt":0.2159068036417565,"spread":0.1949822405847897,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001906239,0.0003035702,0.0003282092,0.0003412605,0.0002693644,0.000095443,0.0001336986,0.0001504257,0.00002802488],"category_scores_gemma":[0.000001066985,0.0002772853,0.00007638105,0.0005669199,0.0000623704,0.0006346056,3.269372e-7,0.0002362897,0.000002698024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000124854,"about_ca_system_score_gemma":0.00009521654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009686205,"about_ca_topic_score_gemma":0.0001689819,"domain_scores_codex":[0.9985507,0.00002922198,0.0004558827,0.0003228495,0.0002278511,0.0004135165],"domain_scores_gemma":[0.9995678,0.00005432311,0.00007482462,0.0001157429,0.00009165941,0.00009562325],"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.0006067005,0.0002179714,0.000009985536,0.0008922982,0.00009034453,0.0000333827,0.002994663,0.362553,0.0317987,0.00003568834,0.00001830364,0.600749],"study_design_scores_gemma":[0.001267564,0.0002366701,0.00002231546,0.0009251565,0.00006727664,0.00004592924,0.0003179269,0.809707,0.1865376,0.0002918085,0.0001161694,0.0004646314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01657967,0.0003656625,0.9815683,0.00002008236,0.000115735,0.0002720534,0.00000896799,0.0003314334,0.0007380882],"genre_scores_gemma":[0.9789239,0.000009777502,0.02073644,0.00003687381,0.00003475408,0.0001102284,0.000003447451,0.00009317994,0.00005136512],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9623442,"threshold_uncertainty_score":0.9999679,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032278718","doi":"10.1109/tsp.2011.2172433","title":"Joint Secure Beamforming Design at the Source and the Relay for an Amplify-and-Forward MIMO Untrusted Relay System","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":246,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Beamforming; Computer science; MIMO; Relay channel; Computer network; Secrecy; Artificial noise; Signal-to-noise ratio (imaging); Telecommunications; Computer security; Transmitter; Channel (broadcasting); Power (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.04682904883414673,"gpt":0.2363888729056775,"spread":0.1895598240715307,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009161966,0.0002436625,0.0002612201,0.0001067846,0.001078678,0.0001296713,0.0002752841,0.0001725019,0.00001028924],"category_scores_gemma":[0.000005262221,0.0001625749,0.00007451116,0.0001858519,0.0002523275,0.0003516632,0.000006088523,0.0004976231,0.000002959699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000113457,"about_ca_system_score_gemma":0.00002608909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004084664,"about_ca_topic_score_gemma":0.00004165235,"domain_scores_codex":[0.9987584,0.0001698147,0.0003838903,0.0002409155,0.0001811316,0.0002658892],"domain_scores_gemma":[0.998977,0.0003441305,0.0001090031,0.0003991654,0.00008415564,0.00008652097],"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.002246744,0.0002787749,0.00001826119,0.003157866,0.0006747324,0.000005130812,0.1170565,0.4172767,0.03147346,0.003373297,0.000412866,0.4240257],"study_design_scores_gemma":[0.001188757,0.000161493,0.00001045172,0.0004975129,0.0002305193,0.0001423907,0.003712208,0.8865381,0.1052732,0.0003655991,0.001453894,0.000425812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01649271,0.0008200731,0.9806346,0.0001100979,0.00005330023,0.0008468895,0.00001202174,0.0007208455,0.0003094159],"genre_scores_gemma":[0.9833056,0.0001019321,0.0159528,0.00007523067,0.00002754012,0.0003940594,0.000002479318,0.0000745201,0.00006585621],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9668128,"threshold_uncertainty_score":0.8296428,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019492706","doi":"10.1109/tsp.2011.2180902","title":"Efficient Application of MUSIC Algorithm Under the Coexistence of Far-Field and Near-Field Sources","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":215,"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":"Narrowband; Algorithm; Field (mathematics); Multiple signal classification; Computer science; Mathematics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02923972409227907,"gpt":0.2621864913881508,"spread":0.2329467672958717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002321436,0.00009427876,0.0001415747,0.0001017092,0.0001596858,0.00002956027,0.000310691,0.00005957075,0.00001202821],"category_scores_gemma":[0.000004645245,0.00007500058,0.00004949431,0.0004395492,0.0001526669,0.0001518447,0.000004787837,0.0001257894,8.750551e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001059139,"about_ca_system_score_gemma":0.0000603671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001795882,"about_ca_topic_score_gemma":0.000006657792,"domain_scores_codex":[0.9991162,0.00003701944,0.0003032854,0.0001974276,0.0002485115,0.00009751494],"domain_scores_gemma":[0.9991242,0.000197051,0.0002459276,0.0002215581,0.0001807909,0.00003046893],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002054802,0.0001779823,0.00001322871,0.00009106645,0.0000143437,1.774011e-7,0.003294228,0.00621557,0.01069659,0.0007716109,0.000003721545,0.9787009],"study_design_scores_gemma":[0.00006973361,0.0001652644,0.00009269075,0.00007199789,0.00001536232,0.00000486172,0.0001836662,0.4270816,0.5712388,0.001006543,0.000006872079,0.00006257503],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02350786,0.00006644481,0.9756345,0.00007727387,0.00004468485,0.0001643443,0.00000160121,0.00007722363,0.0004260722],"genre_scores_gemma":[0.9160997,0.000004360057,0.08376601,0.00008844316,0.000004555634,0.00002304481,8.080934e-8,0.000005658254,0.000008125466],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9786384,"threshold_uncertainty_score":0.3058435,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144024329","doi":"10.1109/tsp.2008.929671","title":"Fully Parallel Stochastic LDPC Decoders","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":207,"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":"Decoding methods; Low-density parity-check code; Computer science; Field-programmable gate array; Parallel computing; Algorithm; Gate array; Clock rate; Throughput; FLOPS; Computer hardware; Wireless; Telecommunications; Chip","retraction":null,"screen_n_in":null,"score":{"opus":0.03476306807681433,"gpt":0.2671225874347176,"spread":0.2323595193579033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000196013,0.0002430478,0.000208446,0.0002848908,0.0007823708,0.0001224765,0.0006960044,0.0001063592,0.00002756892],"category_scores_gemma":[0.000005707737,0.0002466046,0.0001176167,0.0006466937,0.0001117839,0.0008145242,0.000003821992,0.0004583736,0.00007324738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000104951,"about_ca_system_score_gemma":0.0002494433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002157007,"about_ca_topic_score_gemma":0.00001550575,"domain_scores_codex":[0.998254,0.00005944763,0.0003051571,0.0005325058,0.0004408935,0.0004079884],"domain_scores_gemma":[0.9991075,0.0001326792,0.0001172665,0.0003617252,0.0001443576,0.0001364873],"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.0001088918,0.0005867411,0.00002320961,0.00008182434,0.00005155981,0.0001416832,0.005708339,0.2996517,0.007839043,0.0001948657,0.0006323573,0.6849797],"study_design_scores_gemma":[0.000683974,0.0004537081,0.00007805769,0.0002762207,0.00003366426,0.0007318467,0.0001221291,0.9524975,0.04161448,0.002466085,0.000165816,0.0008765592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005566345,0.00008473365,0.9915931,0.000257051,0.0002394473,0.00017945,0.000001151342,0.001444723,0.0006339467],"genre_scores_gemma":[0.8951853,0.000006113997,0.1041035,0.000321306,0.00003544068,0.00005179445,2.679743e-7,0.00002650508,0.0002697525],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.889619,"threshold_uncertainty_score":0.9999986,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2601496744","doi":"10.1109/tsp.2017.2740204","title":"Fast and Flexible Successive-Cancellation List Decoders for Polar Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":207,"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":"Decoding methods; Computer science; Algorithm; Error detection and correction; Coding gain; Polar code; Throughput; Polar; Coding (social sciences); Bit error rate; Parity bit; Computer engineering; Telecommunications; Mathematics; Statistics; Physics; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.03388292182735758,"gpt":0.311307947499687,"spread":0.2774250256723294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002840225,0.0001794527,0.0001770437,0.0001534265,0.001965638,0.0009702903,0.0005994313,0.00009123782,0.00000538729],"category_scores_gemma":[0.0000145609,0.0001830124,0.00006461214,0.0001165224,0.0001287181,0.001455163,0.000005639498,0.000200618,0.000002515088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006316484,"about_ca_system_score_gemma":0.000110035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001207008,"about_ca_topic_score_gemma":0.0001494912,"domain_scores_codex":[0.9988372,0.00002816796,0.0002096783,0.0004537625,0.0002024632,0.0002687106],"domain_scores_gemma":[0.9989699,0.0001506878,0.0002409659,0.000379886,0.0001723599,0.00008621555],"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.00005994446,0.00007618416,0.0002029413,0.0001404027,0.00001850437,0.000002780742,0.001008033,0.003378796,0.01661724,0.0002729633,0.00007355894,0.9781486],"study_design_scores_gemma":[0.0004785861,0.0002026028,0.0001671423,0.000278292,0.00003107487,0.00001697379,0.00008640621,0.6386877,0.3563243,0.003055464,0.0002903597,0.0003810189],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003986388,0.0001023015,0.9937209,0.0005987685,0.0002231497,0.0002563885,0.00001186275,0.0004713423,0.0006289163],"genre_scores_gemma":[0.9309876,0.00001184753,0.06846575,0.0001088444,0.00004734599,0.0000534244,9.162031e-7,0.00002080768,0.0003034382],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9777676,"threshold_uncertainty_score":0.9993337,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998272579","doi":"10.1109/tsp.2004.826175","title":"Efficient Architectures for 1-D and 2-D Lifting-Based Wavelet Transforms","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":187,"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":"Datapath; Computer science; Parallel computing; Discrete wavelet transform; Interleaving; Wavelet; Lifting scheme; Algorithm; Computer hardware; Wavelet transform; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02008979188986759,"gpt":0.2756101052116265,"spread":0.2555203133217589,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004204965,0.0002116887,0.0001981617,0.0002346419,0.0006085885,0.0002589839,0.0002760444,0.00007994669,0.000003906067],"category_scores_gemma":[0.000005198772,0.0001772595,0.0001189278,0.0003603489,0.00009266933,0.00007750609,0.000001094407,0.0002428231,0.000002976663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004926277,"about_ca_system_score_gemma":0.0002002618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009102811,"about_ca_topic_score_gemma":0.000003919889,"domain_scores_codex":[0.9986246,0.00004402101,0.0002502602,0.0004437416,0.0002774735,0.0003599591],"domain_scores_gemma":[0.9993691,0.0001865235,0.0000617503,0.0001682819,0.00009410779,0.0001202479],"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.00009671701,0.0001279227,2.965803e-7,0.00009675446,0.000008995856,0.000006292635,0.000953765,0.441929,0.010784,0.0000705091,0.000001082856,0.5459246],"study_design_scores_gemma":[0.002340758,0.0003762392,0.00001680099,0.0001974947,0.00002824483,0.00003695619,0.00002555888,0.605122,0.3869748,0.004516117,0.00005652376,0.0003084986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03474869,0.0001238911,0.963684,0.0007554,0.0001089107,0.0002895453,0.000006272303,0.0002016726,0.00008166685],"genre_scores_gemma":[0.7831961,5.956311e-7,0.2161133,0.0005791911,0.00003331991,0.00003783135,3.604002e-7,0.00001741921,0.00002184428],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7484474,"threshold_uncertainty_score":0.7228433,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127695678","doi":"10.1109/78.960397","title":"Near-field/far-field azimuth and elevation angle estimation using a single vector hydrophone","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Underwater Acoustics Research","field":"Earth and Planetary Sciences","cited_by":186,"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":"Hydrophone; Direction cosine; Azimuth; Acoustics; Underwater acoustics; Underwater; Direction of arrival; Direction finding; SIGNAL (programming language); Algorithm; Computer science; Geology; Mathematics; Physics; Optics; Telecommunications; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03641527635767104,"gpt":0.2695414694199151,"spread":0.2331261930622441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002021099,0.0001625031,0.0001467409,0.0001836707,0.0006629016,0.0003761653,0.0001022966,0.0001159102,0.0007991042],"category_scores_gemma":[0.00001258031,0.0001539445,0.00003649274,0.000513095,0.00006925859,0.0006120125,8.724212e-7,0.0002977223,0.00003927232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002617697,"about_ca_system_score_gemma":0.0001165183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008137355,"about_ca_topic_score_gemma":0.0003657028,"domain_scores_codex":[0.9986392,0.00005826417,0.0002338014,0.0003173814,0.0004054631,0.0003459335],"domain_scores_gemma":[0.9993755,0.0002221421,0.00006826989,0.0001079691,0.0000886628,0.0001375177],"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.0001713672,0.00006979839,0.0007514436,0.00005010342,0.00001263999,0.00001675761,0.0003689642,0.5296568,0.0207931,1.734032e-7,0.000008429135,0.4481004],"study_design_scores_gemma":[0.000283911,0.0004078997,0.0003538692,0.00007239915,0.0000294358,0.00006502766,0.00008839057,0.9602457,0.03801087,0.0002070685,0.00005520209,0.0001801861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3278813,0.0000794397,0.6713462,0.0001410547,0.00006979154,0.0001180654,0.000006146536,0.00005499221,0.0003029717],"genre_scores_gemma":[0.9894438,0.00002149144,0.01012709,0.0002340493,0.00005964924,0.000002126261,0.000007580266,0.00001078456,0.00009343727],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6615624,"threshold_uncertainty_score":0.874963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2557873547","doi":"10.1109/tsp.2016.2634550","title":"A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":184,"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":"Université de Lyon; Sichuan Provincial Youth Science and Technology Fund; National Natural Science Foundation of China; Agence Nationale de la Recherche","keywords":"Matching pursuit; Computer science; Mathematics; Mathematical optimization; Algorithm; Compressed sensing","retraction":null,"screen_n_in":null,"score":{"opus":0.01733816768298668,"gpt":0.2411272976174766,"spread":0.2237891299344899,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001053974,0.0002061404,0.0001805635,0.0001560547,0.0001989719,0.00009542147,0.0001103915,0.00009024335,0.0001607777],"category_scores_gemma":[0.00000101462,0.0001521147,0.0000853372,0.000125594,0.00004443894,0.0005062654,5.939091e-7,0.0001443488,0.00001693473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000826071,"about_ca_system_score_gemma":0.00005638707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002314748,"about_ca_topic_score_gemma":0.000009696387,"domain_scores_codex":[0.9990441,0.00001325916,0.0002059973,0.0002449977,0.0002084416,0.0002832005],"domain_scores_gemma":[0.99956,0.0001053855,0.00005200243,0.0001244774,0.00008822467,0.0000698975],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003814217,0.00008744674,0.000006498664,0.0001257342,0.0001174428,0.0000206296,0.0001740867,0.05034735,0.2723542,0.00003496519,0.0007901808,0.6755601],"study_design_scores_gemma":[0.001284772,0.000694075,0.00006514916,0.001486059,0.000140223,0.0001465174,0.00007595385,0.01825736,0.9716278,0.003533999,0.00195012,0.0007380057],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05032184,0.00002650749,0.9477237,0.0000789296,0.000108202,0.0002272026,0.00005847825,0.0007982134,0.0006568849],"genre_scores_gemma":[0.9941139,0.0000144738,0.005323308,0.00008938967,0.00008170312,0.0001021905,0.000005945869,0.00006847468,0.0002005632],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9437921,"threshold_uncertainty_score":0.6203057,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135288797","doi":"10.1109/tsp.2003.815387","title":"Minimum ber block precoders for zero-forcing equalization","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":177,"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":"Cyclic prefix; Mathematics; Orthogonal frequency-division multiplexing; Equalization (audio); Bit error rate; Minimum mean square error; Algorithm; Transmission (telecommunications); Control theory (sociology); Matrix (chemical analysis); Intersymbol interference; Signal-to-noise ratio (imaging); Telecommunications; Computer science; Statistics; Estimator","retraction":null,"screen_n_in":null,"score":{"opus":0.02643842865564636,"gpt":0.2727327219690952,"spread":0.2462942933134488,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001481999,0.0001875541,0.0001613531,0.000167301,0.0003003286,0.00005742517,0.0001397164,0.0001122133,0.00002667089],"category_scores_gemma":[0.000005704524,0.0002132191,0.00007488889,0.0002798619,0.00003647371,0.0003959993,4.66057e-7,0.000201735,0.000006360931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001108394,"about_ca_system_score_gemma":0.00003421688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001012564,"about_ca_topic_score_gemma":0.000004066014,"domain_scores_codex":[0.9990759,0.00003269961,0.0003082346,0.0001931801,0.0001396582,0.000250283],"domain_scores_gemma":[0.9994475,0.0001220426,0.00006005093,0.0002094525,0.0001012923,0.00005968551],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001723886,0.00005541993,0.000001800484,0.0001960515,0.00002459734,2.415506e-7,0.0004567862,0.8430734,0.04369969,0.0001623133,0.0000997007,0.1122128],"study_design_scores_gemma":[0.0003486223,0.00004804217,7.751399e-7,0.0001593721,0.00003035938,0.000005567516,0.000117312,0.2887047,0.7064717,0.001781938,0.002034727,0.0002969124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00237109,0.0002231568,0.9946887,0.00002110826,0.0001014486,0.0003575037,0.00000853568,0.0008972034,0.001331264],"genre_scores_gemma":[0.9527243,0.00005305533,0.04666863,0.00005467856,0.00001389164,0.0002342192,0.000003985749,0.00007812314,0.0001691359],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9503532,"threshold_uncertainty_score":0.8694824,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098061185","doi":"10.1109/tsp.2008.2008542","title":"MIMO Minimum Total MSE Transceiver Design With Imperfect CSI at Both Ends","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":177,"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":"MIMO; Mean squared error; Minimum mean square error; Channel state information; Channel (broadcasting); Transceiver; Control theory (sociology); Computer science; Joint (building); Mathematics; Telecommunications; Statistics; Engineering; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.01669496514568091,"gpt":0.2137949191906762,"spread":0.1970999540449953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008929072,0.0003575017,0.0002943748,0.0002093082,0.0004958625,0.00003839371,0.0001119107,0.0001448751,0.0001302522],"category_scores_gemma":[9.146393e-7,0.0003360049,0.00009565356,0.000447769,0.0001015358,0.0006368494,4.467004e-7,0.0003002842,0.00004169262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002562458,"about_ca_system_score_gemma":0.00007685395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005096767,"about_ca_topic_score_gemma":0.000009935758,"domain_scores_codex":[0.9985695,0.00004819828,0.000323608,0.0003616762,0.000277843,0.0004191592],"domain_scores_gemma":[0.9994629,0.00008036343,0.0000574507,0.0001808429,0.0000753335,0.0001430905],"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.0001839526,0.00005823169,0.000005766007,0.0001097518,0.00004841039,0.00003820811,0.001286702,0.9303123,0.05819385,3.321404e-7,0.00005855575,0.009703881],"study_design_scores_gemma":[0.001886203,0.0004443287,0.00003454985,0.0003298077,0.0001238536,0.0008232,0.0001507568,0.6102933,0.3849621,0.000006885618,0.0001113704,0.0008336584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03390545,0.000311019,0.9638655,0.00001110564,0.0001432396,0.0003435228,0.00001407911,0.0006270894,0.0007790582],"genre_scores_gemma":[0.9846436,0.00004423875,0.01415891,0.00002257096,0.00006883271,0.00009143028,0.000003805309,0.0001261608,0.0008404418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9507381,"threshold_uncertainty_score":0.9999092,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2553591559","doi":"10.1109/tsp.2018.2879620","title":"Iterative Channel Estimation Using LSE and Sparse Message Passing for MmWave MIMO Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":171,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"National Natural Science Foundation of China; Providence Health Care","keywords":"Algorithm; Message passing; Estimator; MIMO; Iterative method; Computer science; Channel (broadcasting); Sparse matrix; Gaussian; Mathematics; Statistics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02909254631096148,"gpt":0.2664146664222451,"spread":0.2373221201112837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001660643,0.0002528599,0.000250992,0.0002242424,0.0005475094,0.0002240574,0.00005848632,0.0001266317,0.000005806527],"category_scores_gemma":[0.00000476682,0.0002668285,0.00004320871,0.0002762625,0.00008338239,0.0009145858,7.958015e-7,0.0001459848,0.000004049045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001678528,"about_ca_system_score_gemma":0.00003554526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007474624,"about_ca_topic_score_gemma":0.000006244443,"domain_scores_codex":[0.9988813,0.00003428381,0.0003608143,0.0002956789,0.0001393843,0.0002885114],"domain_scores_gemma":[0.9994113,0.00007793321,0.0001071339,0.0001124623,0.0002057591,0.00008541442],"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.0000345909,0.00001925074,5.563972e-7,0.0003813044,0.00002784378,0.000001250662,0.001289844,0.9576596,0.01946901,0.000007598401,0.000006341127,0.02110283],"study_design_scores_gemma":[0.0004445728,0.00007932486,0.000001123391,0.0006981931,0.00006159206,0.00003227416,0.000403656,0.947856,0.0500445,0.00008574658,0.00002532672,0.0002676866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007569266,0.0003126875,0.9905702,0.00001120526,0.0004718991,0.0005778247,0.00003046969,0.0003171375,0.0001392851],"genre_scores_gemma":[0.9641898,0.000006798003,0.03536452,0.00001515494,0.0001859347,0.00009732383,0.000005448698,0.00007914,0.00005583257],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9566206,"threshold_uncertainty_score":0.9999784,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129114382","doi":"10.1109/tsp.2011.2165707","title":"A Novel Accelerometer-Based Gesture Recognition System","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Hand Gesture Recognition Systems","field":"Computer Science","cited_by":168,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Gesture; Gesture recognition; Accelerometer; Computer science; Dynamic time warping; Speech recognition; Artificial intelligence; Subspace topology; Notation; Pattern recognition (psychology); Computer vision; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.08925510916687908,"gpt":0.249298832377305,"spread":0.1600437232104259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003512502,0.0002768343,0.0002680756,0.0004162716,0.0004008241,0.0002565107,0.0004966831,0.0001878028,0.00006344685],"category_scores_gemma":[0.000002160803,0.0002519977,0.000150384,0.0008738877,0.00004490211,0.0009042011,0.000001994406,0.0003649851,0.000263626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001137015,"about_ca_system_score_gemma":0.0001676611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002598234,"about_ca_topic_score_gemma":0.000009495233,"domain_scores_codex":[0.9980783,0.0000989371,0.0004232065,0.0005793243,0.000457581,0.0003625775],"domain_scores_gemma":[0.9989269,0.00008440146,0.0002025268,0.0003165737,0.000293246,0.0001763147],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008155518,0.0006801654,0.000007681536,0.0004416187,0.0000540643,0.00003568875,0.001703921,0.0005699194,0.02075392,0.00003145275,0.0000271055,0.9756129],"study_design_scores_gemma":[0.003419188,0.0009141916,0.0003037203,0.003083861,0.0001746277,0.0006908013,0.0007959925,0.1528153,0.8353547,0.0003153608,0.000502088,0.00163017],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004042137,0.00004198042,0.991321,0.00006474099,0.0004754964,0.0003084781,0.00001962391,0.0007554912,0.002971076],"genre_scores_gemma":[0.9504198,0.000001121986,0.04903828,0.0002345235,0.00007800024,0.0001358455,0.000002519849,0.00002902607,0.00006084744],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9739828,"threshold_uncertainty_score":0.9999932,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100218807","doi":"10.1109/tsp.2009.2028972","title":"A General Description of Linear Time-Frequency Transforms and Formulation of a Fast, Invertible Transform That Samples the Continuous S-Transform Spectrum Nonredundantly","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":165,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Foothills Medical Centre; University of Calgary","funders":"","keywords":"Algorithm; Discrete Fourier transform (general); Harmonic wavelet transform; Fourier transform; Fractional Fourier transform; Constant Q transform; Non-uniform discrete Fourier transform; S transform; Computer science; Discrete-time Fourier transform; Short-time Fourier transform; Signal processing; Time–frequency analysis; Multidimensional signal processing; Wavelet transform; Hartley transform; Mathematics; Discrete wavelet transform; Fourier analysis; Wavelet; Digital signal processing; Artificial intelligence; Computer vision; Mathematical analysis; Filter (signal processing)","retraction":null,"screen_n_in":null,"score":{"opus":0.03218999549217932,"gpt":0.2664123395779608,"spread":0.2342223440857815,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006446295,0.0002750688,0.0004105168,0.0002821988,0.0004205712,0.0001413473,0.0003904956,0.0001255824,0.00001773823],"category_scores_gemma":[0.000002525413,0.0001969694,0.0002002406,0.0006151958,0.0001412764,0.001596288,0.000001131086,0.0002929714,0.000001740133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000468199,"about_ca_system_score_gemma":0.0001526357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009322171,"about_ca_topic_score_gemma":0.00002836253,"domain_scores_codex":[0.9981368,0.00009609498,0.0005723566,0.0003548597,0.0004816495,0.0003582981],"domain_scores_gemma":[0.999261,0.0001023517,0.0001788805,0.0002343221,0.000137201,0.00008619812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002618223,0.0002117324,0.00001226715,0.0001285453,0.000038066,0.000003506548,0.005502284,0.00243357,0.3015858,0.0004114084,0.000003870231,0.6894072],"study_design_scores_gemma":[0.001303122,0.0009178515,0.0003549012,0.0002519336,0.00009322492,0.00007195478,0.000130603,0.2008717,0.7753487,0.02034716,0.00002528005,0.000283557],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0680676,0.0002487454,0.9296411,0.0008220585,0.0000615729,0.0004047947,0.00001407591,0.00008417304,0.000655914],"genre_scores_gemma":[0.9569833,0.00005920107,0.04258997,0.0001629648,0.00003447289,0.00001009004,0.000002551214,0.00001671398,0.0001407103],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8889157,"threshold_uncertainty_score":0.803218,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964105372","doi":"10.1109/tsp.2017.2752689","title":"On the Shift Operator, Graph Frequency, and Optimal Filtering in Graph Signal Processing","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":163,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graph energy; Adjacency matrix; Laplacian matrix; Spectral graph theory; Mathematics; Voltage graph; Line graph; Algorithm; Graph; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02521948641295206,"gpt":0.2665720012858287,"spread":0.2413525148728766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003917146,0.0003824275,0.0002885081,0.000322833,0.002449482,0.001412388,0.001239487,0.0001336377,0.0000187576],"category_scores_gemma":[0.000006228344,0.0002980788,0.0001056825,0.0005606972,0.0003672598,0.002345104,0.00001687119,0.0009141908,0.000005401555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004770896,"about_ca_system_score_gemma":0.0001070586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002655133,"about_ca_topic_score_gemma":0.00005134472,"domain_scores_codex":[0.9976649,0.0001000951,0.0003953629,0.0007979823,0.000454144,0.0005874761],"domain_scores_gemma":[0.9987877,0.0001944517,0.0002365944,0.0005516753,0.00007964365,0.0001499375],"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.0001595428,0.0003303059,0.0003142688,0.0001551548,0.00003902524,0.0001767326,0.002650911,0.1934841,0.01597328,0.00196506,0.0000184811,0.7847331],"study_design_scores_gemma":[0.002470583,0.0009594843,0.003938649,0.003041725,0.00006523603,0.0001741923,0.0003038764,0.8435616,0.07815627,0.06519718,0.00004207994,0.002089089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1223793,0.0002520276,0.8757675,0.000807456,0.0001302864,0.0002656698,0.000003786646,0.000151852,0.0002421097],"genre_scores_gemma":[0.9870023,0.00002339117,0.01232578,0.0004627442,0.000051769,0.00008054812,3.642756e-7,0.00003459322,0.00001857181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.864623,"threshold_uncertainty_score":0.9999471,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2643502490","doi":"10.1109/tsp.2018.2818070","title":"Massive Connectivity With Massive MIMO—Part II: Achievable Rate Characterization","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":162,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"MIMO; Computer science; Mathematics; Beamforming; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.0115759705661001,"gpt":0.219952037435914,"spread":0.2083760668698139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001274358,0.0002951343,0.0002562299,0.0001876585,0.0006659466,0.0000992846,0.0001061037,0.0001288018,0.0001585537],"category_scores_gemma":[0.00000332589,0.0002822728,0.00004452574,0.0005493674,0.0001119424,0.001066678,0.00000120254,0.0002702108,0.00005570088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001734337,"about_ca_system_score_gemma":0.00006891793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003604341,"about_ca_topic_score_gemma":0.00002005718,"domain_scores_codex":[0.9987622,0.00005567859,0.0002907221,0.000360336,0.0001813539,0.0003497038],"domain_scores_gemma":[0.9992599,0.00004707721,0.0001286375,0.0001875001,0.0002754858,0.0001013852],"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.0001772902,0.00008618832,0.000009290548,0.0001424893,0.0000647282,0.000006405081,0.0008825161,0.7970808,0.1754537,0.00001291491,0.00002332404,0.02606036],"study_design_scores_gemma":[0.000779214,0.0003809066,0.00003884908,0.0004387375,0.00006905394,0.00001589624,0.000185702,0.5308309,0.4662099,0.00003788227,0.0005287052,0.0004841958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06393057,0.00001998941,0.9337775,0.00006264415,0.0003510491,0.0003659833,0.00003219745,0.0005676993,0.0008923332],"genre_scores_gemma":[0.996112,0.00001162959,0.002886256,0.00006113716,0.0002194133,0.0001071215,0.00002022494,0.00009396023,0.0004882834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9321814,"threshold_uncertainty_score":0.9999629,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962732261","doi":"10.1109/tsp.2017.2699643","title":"Near-Optimal Hybrid Processing for Massive MIMO Systems via Matrix Decomposition","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":156,"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":"Precoding; Baseband; MIMO; Matrix decomposition; QR decomposition; Singular value decomposition; Computer science; Orthogonal matrix; Radio frequency; Mathematical optimization; Control theory (sociology); Algorithm; Mathematics; Telecommunications; Eigenvalues and eigenvectors; Beamforming","retraction":null,"screen_n_in":null,"score":{"opus":0.01384856210437557,"gpt":0.2775742511481185,"spread":0.2637256890437429,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0001748859,0.0003548574,0.0003575764,0.0001568189,0.001921673,0.0009166281,0.0002848431,0.0001453083,0.00001148958],"category_scores_gemma":[0.000004408485,0.0003863854,0.0001224792,0.0001131803,0.00009815016,0.001557548,0.000001693891,0.0002863948,0.00002155613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000252135,"about_ca_system_score_gemma":0.00008195152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001210362,"about_ca_topic_score_gemma":0.000003603803,"domain_scores_codex":[0.9983686,0.00002553665,0.0004989712,0.0004100467,0.0002374984,0.0004593834],"domain_scores_gemma":[0.9989517,0.00005409501,0.0002810646,0.0003143022,0.0002661248,0.0001327644],"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.00007357234,0.00004044102,0.000003093037,0.0007672195,0.00003186931,0.000006314141,0.0001718444,0.9144832,0.01545373,0.000003027692,0.0000302078,0.06893551],"study_design_scores_gemma":[0.0007336486,0.0000816952,0.000005166417,0.0006282601,0.00008596026,0.00005964875,0.0001024369,0.9464952,0.05118648,0.00004099057,0.0001687472,0.0004118223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007060964,0.0004963889,0.9900364,0.00004128786,0.0006401376,0.0008218995,0.00004400568,0.000609254,0.0002496524],"genre_scores_gemma":[0.963688,0.00001134989,0.03540127,0.00001091102,0.0002146559,0.0003443289,0.00001288374,0.0001376247,0.000179036],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.956627,"threshold_uncertainty_score":0.9998588,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966184693","doi":"10.1109/tsp.2007.914964","title":"Square-Root Quadrature Kalman Filtering","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"U.S. Department of Homeland Security","keywords":"Extended Kalman filter; Mathematics; Kalman filter; Clenshaw–Curtis quadrature; Gauss–Hermite quadrature; Fast Kalman filter; Invariant extended Kalman filter; Adaptive quadrature; Gauss–Kronrod quadrature formula; Ensemble Kalman filter; Square root; Quadrature (astronomy); Control theory (sociology); Covariance intersection; Alpha beta filter; Tanh-sinh quadrature; Applied mathematics; Covariance matrix; Algorithm; Gaussian quadrature; Computer science; Mathematical analysis; Statistics; Artificial intelligence; Engineering; Integral equation; Electronic engineering; Nyström method; Geometry; Moving horizon estimation","retraction":null,"screen_n_in":null,"score":{"opus":0.02674836540943531,"gpt":0.2465436623518149,"spread":0.2197952969423796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001403357,0.0002412214,0.0002030905,0.0001899949,0.001077588,0.0002197636,0.0006284736,0.0001443055,0.00009445786],"category_scores_gemma":[0.000002033002,0.000226571,0.0001157336,0.0006525413,0.00008453134,0.0008982684,0.000004720574,0.0005818169,0.00009402137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004222344,"about_ca_system_score_gemma":0.00009071748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001149968,"about_ca_topic_score_gemma":0.000008451068,"domain_scores_codex":[0.9982364,0.00006111057,0.0003061205,0.0005481715,0.0004391983,0.0004089554],"domain_scores_gemma":[0.9991263,0.00009416018,0.00009513614,0.000426939,0.0001020001,0.0001554824],"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.0001192108,0.0006662302,0.00009340118,0.0001622895,0.00005377796,0.000439031,0.004562012,0.2141566,0.02621058,0.0004135929,0.004015078,0.7491081],"study_design_scores_gemma":[0.002084782,0.0006989417,0.00120203,0.001082988,0.00006191008,0.001835658,0.000218576,0.7576165,0.2069262,0.0009987438,0.0249556,0.002318051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01151429,0.0002030612,0.9857959,0.0002336514,0.0005356972,0.00009589078,0.000008260282,0.0006210995,0.0009921863],"genre_scores_gemma":[0.9733276,0.00002124473,0.0257435,0.0002966993,0.0001449423,0.00001633153,0.000002700544,0.00002514491,0.0004218357],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9618133,"threshold_uncertainty_score":0.9239296,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2171656554","doi":"10.1109/tsp.2005.859331","title":"Closed-form blind MIMO channel estimation for orthogonal space-time block codes","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":154,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Block code; Algorithm; Decoding methods; MIMO; Channel (broadcasting); Channel state information; Block (permutation group theory); Mathematics; Blind signal separation; Computer science; Control theory (sociology); Telecommunications; Artificial intelligence; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.01969777579488497,"gpt":0.2716100576845973,"spread":0.2519122818897123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001417493,0.0002432108,0.0002202891,0.0002390182,0.0003466281,0.00007351441,0.000210001,0.0001434609,0.00004238769],"category_scores_gemma":[0.000003260227,0.0002670262,0.0001005061,0.0002694599,0.00005990151,0.0006283879,0.000001277102,0.0003087041,0.00004397755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001528354,"about_ca_system_score_gemma":0.000044257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000128563,"about_ca_topic_score_gemma":0.000009674393,"domain_scores_codex":[0.9989257,0.00001579915,0.0003482812,0.0002171931,0.0002025698,0.0002904422],"domain_scores_gemma":[0.9993762,0.0001034398,0.00008042968,0.000228346,0.0001280038,0.00008362017],"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.0000483329,0.00006623413,1.27998e-7,0.00008155165,0.00001897702,2.027306e-7,0.0002047571,0.6602604,0.01382407,0.00001822351,0.00005092719,0.3254262],"study_design_scores_gemma":[0.0004088892,0.00004929798,0.000002444453,0.0001242493,0.0000271776,0.000006362274,0.00002532023,0.7448723,0.2529539,0.0005728922,0.0007241774,0.0002330725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01079921,0.0002087961,0.9866444,0.0002767098,0.00004453041,0.0004288368,0.00004183125,0.001172486,0.0003831763],"genre_scores_gemma":[0.9175379,0.00004815582,0.08173109,0.00005450677,0.00007531052,0.0002618183,0.00001446122,0.00007438556,0.0002023324],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9067388,"threshold_uncertainty_score":0.9999782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006682223","doi":"10.1109/tsp.2012.2202652","title":"Joint Estimation of Channel and Oscillator Phase Noise in MIMO Systems","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":152,"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":"Vetenskapsrådet","keywords":"Estimator; Phase noise; MIMO; Control theory (sociology); Cramér–Rao bound; Channel (broadcasting); Noise (video); Oscillator phase noise; Kalman filter; Computer science; Extended Kalman filter; Estimation theory; Algorithm; Mathematics; Electronic engineering; Statistics; Telecommunications; Engineering; Amplifier; Noise figure; Bandwidth (computing)","retraction":null,"screen_n_in":null,"score":{"opus":0.02781598415979668,"gpt":0.2785000692497842,"spread":0.2506840850899875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001479607,0.0001113304,0.0001655657,0.0002162096,0.00006016227,0.00001697803,0.00005850595,0.00006425545,0.000003965218],"category_scores_gemma":[0.000001898351,0.000118029,0.00002135267,0.0002141623,0.00003897672,0.0004821692,7.846037e-7,0.0001671812,0.000001847791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006657439,"about_ca_system_score_gemma":0.00001084356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008460993,"about_ca_topic_score_gemma":0.000001415599,"domain_scores_codex":[0.999355,0.00002300611,0.0002815048,0.00008290206,0.0001070443,0.0001505208],"domain_scores_gemma":[0.9996935,0.00003519303,0.00005724944,0.0001255304,0.00003314261,0.00005542845],"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.00001714411,0.0001534473,0.000005716058,0.0004299067,0.000008333458,2.840808e-7,0.0009597702,0.7887148,0.06699778,0.00002874602,0.000003847476,0.1426802],"study_design_scores_gemma":[0.000304367,0.00002869685,0.00002436394,0.0003113695,0.000008927263,0.000005951178,0.000138883,0.7574953,0.2415,0.00004903191,0.00001830954,0.0001146943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1117841,0.001099293,0.8865778,0.000008993363,0.00005519915,0.0001617125,0.000006961277,0.0002046695,0.0001013168],"genre_scores_gemma":[0.9951894,0.00008963017,0.004604199,0.000005217682,0.00001274652,0.00006605859,0.000001233876,0.00002537852,0.000006103563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8834054,"threshold_uncertainty_score":0.4813082,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119940423","doi":"10.1109/tsp.2007.897908","title":"Structured Threshold Policies for Dynamic Sensor Scheduling—A Partially Observed Markov Decision Process Approach","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":150,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Partially observable Markov decision process; Markov decision process; Mathematical optimization; Markov chain; Markov process; Scheduling (production processes); Computer science; Dynamic priority scheduling; Markov model; Job shop scheduling; Mathematics; Machine learning; Schedule; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02873138239138811,"gpt":0.2848172879348059,"spread":0.2560859055434178,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005880698,0.0003662782,0.0003342435,0.000301033,0.0009038408,0.0005703403,0.0006222765,0.0002443336,0.00001138977],"category_scores_gemma":[0.000009967682,0.0003356685,0.0002123591,0.001146351,0.00009496081,0.0007218517,0.000004571268,0.0004438023,0.000005530431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001206431,"about_ca_system_score_gemma":0.000156676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005489692,"about_ca_topic_score_gemma":0.00003284381,"domain_scores_codex":[0.9972628,0.00003133619,0.0006034886,0.0007675042,0.00060752,0.0007273958],"domain_scores_gemma":[0.9985349,0.0002040291,0.0002188073,0.0003756201,0.0004202882,0.000246422],"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.0003595882,0.0002384718,0.000007521709,0.0001035411,0.00004068906,0.000007211885,0.0004399787,0.436706,0.003334088,0.00006994986,0.00001361518,0.5586793],"study_design_scores_gemma":[0.0009371077,0.0001857333,0.0001255768,0.00009852387,0.00003631524,0.00005562384,0.0002742813,0.9694114,0.02683198,0.001481001,0.000128389,0.0004341101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03094151,0.0001133852,0.9671553,0.0001110314,0.0004885636,0.0005170794,0.00002753094,0.0004890626,0.0001565512],"genre_scores_gemma":[0.816572,0.000005721356,0.182927,0.0002109278,0.0001083795,0.00004413422,0.00000699136,0.00003580756,0.00008899931],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7856305,"threshold_uncertainty_score":0.9999095,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133575969","doi":"10.1109/tsp.2006.879265","title":"Joint estimation of channel response, frequency offset, and phase noise in OFDM","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":148,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Orthogonal frequency-division multiplexing; Carrier frequency offset; Estimator; Algorithm; Computer science; Intersymbol interference; Frequency offset; Channel (broadcasting); Frequency domain; Control theory (sociology); Mathematics; Telecommunications; Statistics; Decoding methods; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01809671378007323,"gpt":0.2693185609411627,"spread":0.2512218471610895,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001778214,0.0001269219,0.0001654692,0.0003363773,0.00007517542,0.00001746085,0.00007850962,0.00007271864,0.000009478931],"category_scores_gemma":[0.000004081586,0.0001424581,0.00002787274,0.0003270184,0.00006415946,0.000353084,7.774345e-7,0.0002116704,0.000001372332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008039593,"about_ca_system_score_gemma":0.00002575166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002868916,"about_ca_topic_score_gemma":0.00002353943,"domain_scores_codex":[0.9992233,0.00004218375,0.000358767,0.0001271076,0.0001204998,0.0001281656],"domain_scores_gemma":[0.9996406,0.00006662945,0.00006597578,0.0001513448,0.00004742875,0.00002795744],"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.00009163706,0.0001604212,0.00000282033,0.0001332076,0.000003920568,0.000001737857,0.0002443137,0.6048862,0.2617041,0.00002288419,0.000006428447,0.1327423],"study_design_scores_gemma":[0.0003946609,0.00006005352,0.0001202449,0.0002815895,0.000007134236,0.000005170231,0.00003825297,0.5196347,0.4778025,0.001526972,0.000004654907,0.0001240816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1959032,0.0003144239,0.8032046,0.00003895323,0.00001523257,0.0001311632,0.00001141302,0.0002237507,0.0001572786],"genre_scores_gemma":[0.9826312,0.00004416571,0.01720934,0.000008863464,0.000006417606,0.00005652753,0.000002925683,0.00002712377,0.00001344637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.786728,"threshold_uncertainty_score":0.5809274,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3046897407","doi":"10.1109/tsp.2020.3013389","title":"Padded Coprime Arrays for Improved DOA Estimation: Exploiting Hole Representation and Filling Strategies","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":141,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Fundamental Research Funds for the Central Universities; State Key Laboratory of Millimeter Waves; Southeast University; China Scholarship Council","keywords":"Coprime integers; Algorithm; Degrees of freedom (physics and chemistry); Representation (politics); Coupling (piping); Mathematics; Displacement (psychology); Computer science; Sensor array; Sparse array; Topology (electrical circuits); Combinatorics; Physics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04678453691023002,"gpt":0.3050323120149414,"spread":0.2582477751047113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001787898,0.0001513243,0.00019821,0.000124526,0.0003320383,0.0003503813,0.0002038398,0.00006496341,0.00000724744],"category_scores_gemma":[0.0000233883,0.000161161,0.00006575405,0.0004591428,0.00006132347,0.001867576,0.000003093799,0.0001395571,0.000001685802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000267446,"about_ca_system_score_gemma":0.0001222064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009320765,"about_ca_topic_score_gemma":0.000001105241,"domain_scores_codex":[0.9988425,0.00003708966,0.0003796948,0.0003921892,0.000186655,0.0001618217],"domain_scores_gemma":[0.9991276,0.0001954415,0.0002346329,0.0001349682,0.0002235785,0.00008380473],"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.00006173207,0.00006095876,0.000001192654,0.0002864503,0.00002309576,8.518156e-7,0.002889455,0.1473705,0.1705268,0.0006427415,0.00002762667,0.6781086],"study_design_scores_gemma":[0.0001987597,0.0001119155,0.000002380395,0.00007616956,0.00001247043,0.000002397471,0.000237078,0.6062809,0.3906342,0.002330875,0.00001050185,0.0001023439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00214586,0.0000317868,0.9960169,0.0006798352,0.00007718692,0.0003658287,0.000007548876,0.0005219189,0.0001531857],"genre_scores_gemma":[0.6526297,0.000003368416,0.3471515,0.0001010009,0.00002513774,0.00006889909,0.000002145662,0.00001169034,0.000006510878],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6780063,"threshold_uncertainty_score":0.6571956,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2171060285","doi":"10.1109/tsp.2011.2163630","title":"Delayed Stochastic Decoding of LDPC Codes","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":136,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Polytechnique Montréal","funders":"","keywords":"Decoding methods; Low-density parity-check code; Computer science; CMOS; Algorithm; Engineering; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04835232394564914,"gpt":0.2754522703981205,"spread":0.2270999464524713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002930269,0.0001723525,0.0002044708,0.0002843815,0.0002394108,0.00005426614,0.0005941327,0.00008121046,0.00003372348],"category_scores_gemma":[0.000005720563,0.0001715384,0.00009069558,0.0005444851,0.00007635661,0.0005894314,0.000003976596,0.0002716878,0.00001121306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005148798,"about_ca_system_score_gemma":0.0001149936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005602231,"about_ca_topic_score_gemma":0.00002317626,"domain_scores_codex":[0.9987267,0.00005201666,0.0003349173,0.0003462639,0.0002795428,0.0002605843],"domain_scores_gemma":[0.9991722,0.0001203936,0.0001754763,0.0002839697,0.0001708312,0.00007715035],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001354738,0.0005178474,0.00002476761,0.0001243736,0.00006315096,0.00001706224,0.009331552,0.009982212,0.05145228,0.0006310047,0.0000313882,0.9276889],"study_design_scores_gemma":[0.0002320574,0.0003865327,0.00003146292,0.0003256843,0.00004013571,0.00005153542,0.0001462809,0.364667,0.6306224,0.003166516,0.000004248193,0.0003260475],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01302204,0.00005290224,0.985036,0.00001860753,0.0001623015,0.0001261222,0.000002144057,0.0006072479,0.0009726515],"genre_scores_gemma":[0.8662999,0.000001855666,0.1335636,0.00005028175,0.00001167736,0.00002061477,1.290717e-7,0.00001725473,0.00003466876],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9273629,"threshold_uncertainty_score":0.6995134,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048185597","doi":"10.1109/tsp.2014.2299513","title":"Efficient Transmit Beamspace Design for Search-Free Based DOA Estimation in MIMO Radar","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Radar Systems and Signal Processing","field":"Engineering","cited_by":129,"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":"MIMO; Computer science; Algorithm; Transmitter power output; Radar; Beamforming; Mathematical optimization; Mathematics; Telecommunications; Transmitter; Channel (broadcasting)","retraction":null,"screen_n_in":null,"score":{"opus":0.02054507220466748,"gpt":0.241068710353131,"spread":0.2205236381484636,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008693865,0.0003154496,0.0003432373,0.000396648,0.0003365613,0.0001663308,0.0002509116,0.0001643941,0.00002495163],"category_scores_gemma":[0.000009418168,0.000317983,0.00012616,0.00052332,0.0000582661,0.0002040353,5.827584e-7,0.0003605931,0.00001021223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001804472,"about_ca_system_score_gemma":0.0001165849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001847695,"about_ca_topic_score_gemma":0.0000191817,"domain_scores_codex":[0.998132,0.0001023123,0.0004774703,0.0003760677,0.0004149674,0.0004972],"domain_scores_gemma":[0.9991594,0.000333818,0.0000549639,0.0002251584,0.00009302855,0.0001336412],"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.0000944022,0.00007576457,6.029161e-7,0.0006010575,0.00001133647,0.000001693454,0.0003892846,0.8471416,0.008787695,0.00000642218,0.0000363721,0.1428538],"study_design_scores_gemma":[0.001411085,0.0001366609,0.00000477448,0.0005584921,0.00003355765,0.000005263249,0.00008535561,0.925272,0.07188367,0.0001616718,0.0001136374,0.0003337652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007067629,0.0002118077,0.9911795,0.0001464727,0.000167515,0.0006246918,0.00001467054,0.0003497911,0.000237923],"genre_scores_gemma":[0.9230173,0.000001618159,0.07662664,0.00005523506,0.00005223882,0.0001214111,0.000003049976,0.00008626036,0.00003625836],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9159496,"threshold_uncertainty_score":0.9999272,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1522816417","doi":"10.1109/tsp.2002.805239","title":"Reduced-order H/sub ∞/ filtering for stochastic systems","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":129,"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":"Parametrization (atmospheric modeling); Mathematics; Constraint (computer-aided design); Rank (graph theory); Filter (signal processing); Simple (philosophy); Applied mathematics; Mathematical optimization; Filtering problem; Linear system; Order (exchange); Coupling (piping); Filtering theory; Control theory (sociology); Filter design; Computer science; Algorithm; Mathematical analysis; Combinatorics; Control (management)","retraction":null,"screen_n_in":null,"score":{"opus":0.02772842445171202,"gpt":0.2240107877288889,"spread":0.1962823632771769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001390039,0.0002252968,0.0002686138,0.0001343283,0.0002729457,0.0001456518,0.0001300666,0.0001124985,0.00005233056],"category_scores_gemma":[0.000004168936,0.000230997,0.0001073713,0.0002483483,0.00003464062,0.0002599681,3.535405e-7,0.0002052739,0.00003574882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001200975,"about_ca_system_score_gemma":0.00001663983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005961318,"about_ca_topic_score_gemma":0.000003855869,"domain_scores_codex":[0.9987977,0.00002199008,0.0003558166,0.0002576907,0.0002076705,0.0003591494],"domain_scores_gemma":[0.9994415,0.0001497873,0.00004353277,0.0001600764,0.0001096091,0.00009550228],"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.00002661201,0.00004282131,1.626917e-7,0.0003839934,0.00004231939,0.000001139729,0.0004212214,0.8891671,0.0321755,0.000005313469,0.00008012723,0.07765365],"study_design_scores_gemma":[0.0005639301,0.00008053485,0.000001025072,0.0002972916,0.00004789333,0.00001924249,0.0002565192,0.9886478,0.009395835,0.00002563959,0.0003834032,0.0002809204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009985966,0.00107017,0.9866633,0.00004244114,0.00074659,0.0004828886,0.00002526665,0.0004742007,0.0005092145],"genre_scores_gemma":[0.9987562,0.000006518783,0.0003828108,0.00002374515,0.0001981139,0.0003756688,0.000001036223,0.00005957841,0.00019636],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9887702,"threshold_uncertainty_score":0.9419783,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131900983","doi":"10.1109/tsp.2010.2096220","title":"Optimal Wideband Spectrum Sensing Framework for Cognitive Radio Systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":126,"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":"Cognitive radio; Wideband; Narrowband; Computer science; Optimization problem; Mathematical optimization; Convex optimization; Iterative method; Interference (communication); Computational complexity theory; Algorithm; Electronic engineering; Mathematics; Telecommunications; Channel (broadcasting); Regular polygon; Wireless; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01683184221360613,"gpt":0.2588942133858568,"spread":0.2420623711722507,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003870875,0.000337177,0.0003632659,0.0002504126,0.001033978,0.0008947697,0.0002871891,0.0002212408,0.00001427746],"category_scores_gemma":[0.00001749542,0.0003343238,0.0001883625,0.0005963451,0.000138906,0.0006862773,0.000003157772,0.0009626975,0.00001408381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006364853,"about_ca_system_score_gemma":0.0001847596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001751556,"about_ca_topic_score_gemma":0.00002489135,"domain_scores_codex":[0.9978065,0.00006733809,0.0003824215,0.0007292121,0.0003655999,0.0006489588],"domain_scores_gemma":[0.9982557,0.0008807939,0.0001768302,0.0002510613,0.0002314642,0.0002041913],"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.0003230081,0.0002737799,0.000008583236,0.0001602319,0.0001704164,0.0001016285,0.001955163,0.04813378,0.01518113,0.00448383,0.00004813427,0.9291603],"study_design_scores_gemma":[0.0007389183,0.0002425934,0.00001511384,0.0006333864,0.00007957076,0.0003557323,0.0002117935,0.9409856,0.05293055,0.003068773,0.0001902692,0.0005476609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01893818,0.000162505,0.9778779,0.0004253382,0.001458561,0.0004981326,0.00001226402,0.000340204,0.0002869685],"genre_scores_gemma":[0.9092101,0.00000752805,0.08989755,0.0001769127,0.0005709088,0.00001570385,0.000001554221,0.00004553797,0.00007414081],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9286126,"threshold_uncertainty_score":0.9999109,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112224082","doi":"10.1109/78.852028","title":"Robust H/sub 2//H/sub ∞/ filtering for linear systems with error variance constraints","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":125,"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":"Mathematics; Control theory (sociology); Norm (philosophy); Filtering problem; Transfer function; Upper and lower bounds; Linear system; Filter (signal processing); Variance (accounting); Applied mathematics; Constraint (computer-aided design); Algebraic Riccati equation; Mathematical optimization; Riccati equation; Computer science; Kalman filter; Statistics; Mathematical analysis; Differential equation","retraction":null,"screen_n_in":null,"score":{"opus":0.02658026608565668,"gpt":0.2195441331498665,"spread":0.1929638670642099,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002089283,0.0002939178,0.000351587,0.00009483925,0.0003145565,0.0001379981,0.0001525737,0.0001361967,0.00007623404],"category_scores_gemma":[0.000001555593,0.0002737409,0.000101618,0.0002489349,0.0001108781,0.0003522627,2.719022e-7,0.0002685773,0.00002977738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001134681,"about_ca_system_score_gemma":0.00007643444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009420301,"about_ca_topic_score_gemma":0.0000153273,"domain_scores_codex":[0.9985461,0.00003301412,0.0003990091,0.0003476281,0.0002479991,0.0004262244],"domain_scores_gemma":[0.9993991,0.0001313805,0.0000515781,0.0001896738,0.0001065064,0.000121751],"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.000192935,0.00004512807,0.000002046034,0.0004972821,0.00006749536,0.000005501225,0.0002534122,0.8603672,0.01404763,0.000003786621,0.00001293656,0.1245046],"study_design_scores_gemma":[0.001329455,0.0001855834,0.00001057021,0.0008140265,0.0000811672,0.00007279316,0.0003036306,0.970213,0.02583525,0.00001268937,0.0006933499,0.000448488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04430965,0.0002624535,0.9532292,0.0000311052,0.000259925,0.0006059664,0.00006605514,0.000465722,0.0007699584],"genre_scores_gemma":[0.9973952,0.00001112442,0.001854082,0.0000363714,0.0001794879,0.000326388,0.000003077527,0.00007091338,0.000123342],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9530855,"threshold_uncertainty_score":0.9999714,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964011032","doi":"10.1109/tsp.2017.2664054","title":"CaSCADE: Compressed Carrier and DOA Estimation","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":123,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Azrieli Foundation; Israel Science Foundation","keywords":"Compressed sensing; Computer science; Nyquist rate; Cognitive radio; Narrowband; Wideband; Signal reconstruction; Algorithm; Direction of arrival; Nyquist–Shannon sampling theorem; Sampling (signal processing); SIGNAL (programming language); Context (archaeology); Signal processing; Electronic engineering; Telecommunications; Detector; Wireless; Engineering; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.02455861300354502,"gpt":0.2667963627080747,"spread":0.2422377497045297,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005028587,0.0001439831,0.0001354174,0.00007703258,0.0006524855,0.0002740348,0.0001220068,0.00008372603,0.00001776012],"category_scores_gemma":[0.000001616737,0.0001451593,0.00003287776,0.00003819589,0.00009198202,0.0003858035,0.00000113256,0.0002136016,0.000004640949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002466003,"about_ca_system_score_gemma":0.00001329295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002247883,"about_ca_topic_score_gemma":0.000008042909,"domain_scores_codex":[0.9994174,0.00001057842,0.0001306755,0.0001598882,0.0001252377,0.0001561677],"domain_scores_gemma":[0.9996179,0.00002326762,0.00004476393,0.0002091668,0.00004278565,0.00006206462],"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.00002639212,0.00002866313,0.0000114016,0.00008427686,0.0000379057,0.0000153061,0.0003824511,0.2623915,0.05953551,0.0000130992,0.000216062,0.6772574],"study_design_scores_gemma":[0.0001690301,0.00001990214,0.0001308051,0.0001619087,0.00002788403,0.00001805487,0.00001820552,0.6773648,0.3214402,0.0003069632,0.0001867511,0.0001555286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06351545,0.000150493,0.9341211,0.00004944189,0.000120929,0.00009564259,0.000007315262,0.0005052435,0.001434338],"genre_scores_gemma":[0.9957812,0.00002538543,0.004026482,0.00003411387,0.00003708494,0.00001360051,7.551643e-7,0.0000299239,0.00005148251],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9322657,"threshold_uncertainty_score":0.5919425,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155835781","doi":"10.1109/78.863054","title":"Approximate maximum likelihood estimators for array processing in multiplicative noise environments","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":120,"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":"Estimator; Multiplicative noise; Multiplicative function; Mathematics; Applied mathematics; Noise (video); Signal-to-noise ratio (imaging); Algorithm; Estimation theory; Mathematical optimization; Statistics; Computer science; Mathematical analysis; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01559909910671208,"gpt":0.2656172499997385,"spread":0.2500181508930264,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003095171,0.0002656054,0.0002926443,0.0003386598,0.0002882077,0.0001396849,0.0004984829,0.0001169045,0.00003516402],"category_scores_gemma":[0.000005515108,0.0002732486,0.0001020143,0.0007036527,0.0001131452,0.001314807,0.000002230344,0.0002368947,0.00001595849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001424393,"about_ca_system_score_gemma":0.0001308734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001431841,"about_ca_topic_score_gemma":0.000003191385,"domain_scores_codex":[0.9980844,0.00005101551,0.0005461191,0.0005875981,0.0003552009,0.0003756131],"domain_scores_gemma":[0.9992421,0.00008044167,0.0002225871,0.0002806315,0.00007027137,0.000103986],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006222268,0.0003899875,0.00001805257,0.0001437306,0.00000709846,0.000001041724,0.001139007,0.01314753,0.02686478,0.0000135527,0.000003912014,0.9582091],"study_design_scores_gemma":[0.0005592345,0.0001291866,0.00009704385,0.0003409501,0.00001592839,0.000008013977,0.00003702783,0.4523019,0.5416757,0.004441488,0.0001103215,0.0002831364],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006174618,0.00005646336,0.9921187,0.0001087404,0.00004490809,0.0006569689,0.00001040292,0.000329656,0.0004995074],"genre_scores_gemma":[0.7403074,0.000009076905,0.2591757,0.00005992403,0.00001070838,0.0003491511,0.000001329105,0.0000269368,0.00005972374],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.957926,"threshold_uncertainty_score":0.999972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998914394","doi":"10.1109/tsp.2013.2290504","title":"Optimal Memory for Discrete-Time FIR Filters in State-Space","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":119,"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":"Finite impulse response; Estimator; Mathematics; Discrete time and continuous time; Filter (signal processing); Linear filter; State space; Algorithm; State-space representation; Digital filter; Impulse (physics); Polynomial; State (computer science); Impulse response; Control theory (sociology); Applied mathematics; Computer science; Statistics; Mathematical analysis; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01191744870620089,"gpt":0.2380668909866454,"spread":0.2261494422804445,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008190358,0.000240506,0.0002175552,0.0002046935,0.0001089677,0.0000753327,0.0001538966,0.00007843169,0.0001384442],"category_scores_gemma":[0.00000245543,0.0002503915,0.00007489954,0.0002134741,0.00005583964,0.000703597,0.000001235403,0.0002833702,0.00004376711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001562797,"about_ca_system_score_gemma":0.00002276078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001335233,"about_ca_topic_score_gemma":0.000005424095,"domain_scores_codex":[0.9989536,0.00001539942,0.0002554167,0.0002589017,0.0001365504,0.0003801266],"domain_scores_gemma":[0.9995971,0.00009401762,0.00003655429,0.0001371433,0.00005416291,0.00008100163],"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.00003368787,0.00002922611,8.173132e-7,0.0001108055,0.00001284861,0.000002210317,0.0002720886,0.8119016,0.1178203,9.795185e-7,0.0001425346,0.0696729],"study_design_scores_gemma":[0.0003688485,0.0001157807,0.00002847579,0.0002317225,0.000009948093,0.000004210666,0.00009296682,0.6241131,0.3741104,0.000359549,0.0002079337,0.0003570169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04606442,0.0000556971,0.9521737,0.00006224342,0.00006476401,0.0005183337,0.00003274436,0.0007633559,0.0002647478],"genre_scores_gemma":[0.9196096,0.000008224151,0.07932732,0.0000295992,0.00002583868,0.0004492051,0.000003199186,0.00008115444,0.0004658493],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8735452,"threshold_uncertainty_score":0.9999948,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2512859977","doi":"10.1109/tsp.2016.2603964","title":"Optimal and Robust Beamforming for Secure Transmission in MISO Visible-Light Communication Links","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":117,"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":"Beamforming; Computer science; Visible light communication; Transmitter; Channel (broadcasting); Transmission (telecommunications); Mathematical optimization; Telecommunications; Mathematics; Light-emitting diode; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01778675510351825,"gpt":0.2410613356459756,"spread":0.2232745805424574,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001792632,0.0001819765,0.0001901736,0.000238233,0.0002379643,0.00006049865,0.0002716095,0.0003027704,0.00001824891],"category_scores_gemma":[0.000004997332,0.0001473624,0.00004982563,0.0002605659,0.00009100452,0.000465673,0.000002616084,0.0004548961,0.000003413447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009534632,"about_ca_system_score_gemma":0.00002332457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001923425,"about_ca_topic_score_gemma":0.000009478679,"domain_scores_codex":[0.9990863,0.00002433366,0.0003240705,0.0001971178,0.0001188029,0.0002494298],"domain_scores_gemma":[0.9993276,0.0002441898,0.00004054145,0.0002700636,0.0000572293,0.00006040038],"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.00004698097,0.00006240977,0.000004197648,0.0001487383,0.00001380188,4.111725e-7,0.0004609526,0.1371161,0.04421115,0.00007260064,0.00001178024,0.8178509],"study_design_scores_gemma":[0.001352028,0.0001212997,0.00002244626,0.00137465,0.00002931919,0.000009077141,0.0003999209,0.5967055,0.397029,0.0006865529,0.001856159,0.0004140755],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02633318,0.001329967,0.9700141,0.001334894,0.00002255404,0.0002637369,0.000008003469,0.0004921512,0.0002014444],"genre_scores_gemma":[0.9176297,0.0008348277,0.08130724,0.00001985859,0.000007745884,0.0001226903,0.000001698762,0.00004071861,0.0000355241],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8912965,"threshold_uncertainty_score":0.6009264,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163708326","doi":"10.1109/tsp.2006.885761","title":"The Amplify-and-Forward Half-Duplex Cooperative System: Pairwise Error Probability and Precoder Design","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":117,"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; Diversity gain; Coding gain; MIMO; Control theory (sociology); Mathematics; Algorithm; Computer science; Quadrature amplitude modulation; Topology (electrical circuits); Bit error rate; Statistics; Decoding methods; Beamforming","retraction":null,"screen_n_in":null,"score":{"opus":0.06548811704567381,"gpt":0.2922827195025489,"spread":0.226794602456875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00176755,0.0002081008,0.0001877795,0.00008202962,0.00205208,0.0005354795,0.0004178699,0.00008059869,0.00000797393],"category_scores_gemma":[0.00001256085,0.0001497091,0.00003980231,0.00044195,0.0002357165,0.0005735105,0.00001273512,0.00039269,0.000006267195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001037665,"about_ca_system_score_gemma":0.0001322444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006159103,"about_ca_topic_score_gemma":0.00008820176,"domain_scores_codex":[0.9983087,0.0003365568,0.0003650394,0.0004299378,0.0002365538,0.0003231886],"domain_scores_gemma":[0.998376,0.0007468149,0.0001064568,0.0003647731,0.0002607967,0.0001451382],"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.0001273904,0.0001193652,0.00001680912,0.00009345807,0.00004316865,0.00000362245,0.003830685,0.01382888,0.00207112,0.00303677,0.00005347692,0.9767753],"study_design_scores_gemma":[0.000617825,0.000246127,0.0001940128,0.0002746889,0.00003570224,0.00006380954,0.0006631821,0.9818962,0.01377295,0.0002934971,0.001534827,0.0004072337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003273834,0.0009701902,0.9939073,0.000707027,0.00009522216,0.0005175764,0.000001233871,0.0002194859,0.0003081736],"genre_scores_gemma":[0.9769565,0.0001284482,0.02247394,0.0001581374,0.00002496187,0.00006908761,3.496796e-7,0.00001331846,0.0001751938],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.976368,"threshold_uncertainty_score":0.9992471,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016819565","doi":"10.1109/78.950793","title":"Diversity and attack characterization for improved robust watermarking","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Digital watermarking; Computer science; Watermark; Fading; Robustness (evolution); Channel (broadcasting); Transmission (telecommunications); SIGNAL (programming language); Spread spectrum; Interference (communication); Binary symmetric channel; Binary number; Signal processing; Algorithm; Theoretical computer science; Artificial intelligence; Telecommunications; Channel capacity; Mathematics; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.03821529687570775,"gpt":0.2553478968050691,"spread":0.2171325999293613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0001419675,0.0001432302,0.0001261152,0.0001563713,0.002365358,0.0001216707,0.0002467543,0.00006950752,0.000002074532],"category_scores_gemma":[7.159215e-7,0.0001350443,0.00005936898,0.000248405,0.00004687076,0.001167505,0.00001774044,0.0001251899,3.812486e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002560136,"about_ca_system_score_gemma":0.00001335994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002873678,"about_ca_topic_score_gemma":0.000001822296,"domain_scores_codex":[0.9991548,0.00002315368,0.0001545348,0.0003348578,0.00009928698,0.0002333319],"domain_scores_gemma":[0.9996078,0.00003579273,0.00008077641,0.000133277,0.00008148207,0.00006088838],"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.000135808,0.000102824,0.0002436497,0.00008352571,0.00002014352,0.000005065957,0.00197599,0.001102888,0.04720451,0.00004286371,0.000003512506,0.9490792],"study_design_scores_gemma":[0.001038812,0.0003566154,0.001035424,0.0002586151,0.00004983017,0.00007204274,0.00003520565,0.8303016,0.1620259,0.002152674,0.00200281,0.0006704765],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05540903,0.00001442937,0.9437041,0.0001932287,0.0000908677,0.0002172353,0.000004742407,0.0003363552,0.00002995701],"genre_scores_gemma":[0.9667189,0.00003910266,0.03288953,0.0002065837,0.0000321017,0.00002884512,0.000002591598,0.00001066835,0.00007163231],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9484087,"threshold_uncertainty_score":0.9989334,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126344571","doi":"10.1109/tsp.2003.820089","title":"A Generalized Capon Estimator for Localization of Multiple Spread Sources","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":114,"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":"Capon; Estimator; Algorithm; Mathematics; Estimation theory; Computer science; Statistics; Beamforming","retraction":null,"screen_n_in":null,"score":{"opus":0.02448896167966657,"gpt":0.279672682163631,"spread":0.2551837204839644,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001821922,0.0001402453,0.0002154117,0.0002618794,0.0002086234,0.00006030914,0.0002770262,0.00007896691,0.000006286546],"category_scores_gemma":[0.0000164553,0.0001400466,0.0001037788,0.0004834463,0.00007832061,0.0006215373,0.000001814067,0.00007506035,0.000001756019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006359459,"about_ca_system_score_gemma":0.000171954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009195157,"about_ca_topic_score_gemma":0.00001323881,"domain_scores_codex":[0.9988729,0.00002850903,0.0004083641,0.000264741,0.0002711877,0.0001543176],"domain_scores_gemma":[0.9990938,0.0001038428,0.000258232,0.0001839221,0.0003065726,0.00005367442],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008297922,0.0003897278,0.00001705766,0.0003324778,0.00002520826,6.233698e-7,0.001003654,0.734749,0.05799419,0.001337326,0.000009801995,0.204058],"study_design_scores_gemma":[0.0004358873,0.0001118667,0.000004481763,0.0001543089,0.00001386683,0.000003601715,0.00001326887,0.4087513,0.5876244,0.002765612,0.00003216592,0.0000892057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007278577,0.00004624031,0.9917964,0.00007062223,0.0000999415,0.0003312673,0.00001169133,0.0003093992,0.00005591358],"genre_scores_gemma":[0.7265551,0.000002804291,0.2733033,0.00003181092,0.00001024255,0.00006382533,0.000001419896,0.00001299338,0.00001852227],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7192765,"threshold_uncertainty_score":0.5710936,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153184506","doi":"10.1109/tsp.2006.890915","title":"The Variational Inference Approach to Joint Data Detection and Phase Noise Estimation in OFDM","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":112,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Estimator; Algorithm; Orthogonal frequency-division multiplexing; Probabilistic logic; Computer science; Mathematical optimization; Mathematics; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04704478796659195,"gpt":0.316986536329407,"spread":0.269941748362815,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005106531,0.0001148855,0.00009265013,0.0001915448,0.0002762139,0.00008056728,0.0002115603,0.00005929537,0.000002062836],"category_scores_gemma":[0.00001428809,0.0001062459,0.00001159567,0.0003960489,0.0000397451,0.0005379627,0.000004039219,0.0002931325,0.000002455764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001056673,"about_ca_system_score_gemma":0.00002385728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009693327,"about_ca_topic_score_gemma":0.00004898073,"domain_scores_codex":[0.9991748,0.00002451537,0.0002912348,0.0001859194,0.0001631549,0.0001604119],"domain_scores_gemma":[0.9993841,0.0001629531,0.0000434953,0.0003038117,0.00005178246,0.00005383336],"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.00002608708,0.00006080478,8.112427e-7,0.00002332575,0.000003961397,1.774575e-7,0.0002146103,0.3190919,0.02340774,0.00003079894,0.000001509498,0.6571383],"study_design_scores_gemma":[0.0002342368,0.00002678067,0.0001288254,0.00005197887,0.000006456603,0.000004608037,0.00007720486,0.9135337,0.08532451,0.0004194854,0.00007657045,0.0001155684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006331384,0.0000925252,0.9927067,0.00003947566,0.00003373807,0.0002388,0.000008662416,0.0002578997,0.0002908503],"genre_scores_gemma":[0.9352499,0.00003870026,0.06458876,0.00002348309,0.00001168449,0.00005639746,0.000006731643,0.00001874914,0.000005606629],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9289185,"threshold_uncertainty_score":0.4332581,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116066327","doi":"10.1109/tsp.2010.2043127","title":"Optimization and Analysis of Distributed Averaging With Short Node Memory","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":112,"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":"Convergence (economics); Rate of convergence; Node (physics); Algorithm; Acceleration; Mathematics; Network topology; Computer science; Grid; Mathematical optimization; Focus (optics); Series (stratigraphy); Topology (electrical circuits); Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01108059728990224,"gpt":0.2313950402271037,"spread":0.2203144429372014,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002327185,0.0001713278,0.0003019145,0.0003841845,0.000237022,0.0002001959,0.0002886625,0.00007600226,0.00001823735],"category_scores_gemma":[0.000002855571,0.0001506371,0.00007750744,0.00147477,0.00007899703,0.0006540702,0.000002450867,0.0002490568,9.243205e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002982957,"about_ca_system_score_gemma":0.00008195131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002374887,"about_ca_topic_score_gemma":0.00002954104,"domain_scores_codex":[0.9986779,0.00004307373,0.0003127799,0.0003966408,0.0003563437,0.0002132237],"domain_scores_gemma":[0.9991791,0.00007612291,0.0001316103,0.0002914163,0.0002181691,0.0001035484],"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.00002505509,0.0000994328,0.000265969,0.00003199191,0.0002525564,0.000004948415,0.0002658039,0.9432899,0.0138223,0.00001608379,0.000001483791,0.04192445],"study_design_scores_gemma":[0.000348949,0.00003646217,0.0004221308,0.00004584134,0.0003627882,0.00001095228,0.00004888371,0.9769571,0.02158549,0.000005079319,0.000006758477,0.0001695546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02286593,0.00002071912,0.9765344,0.00008706362,0.00008243402,0.0001446145,0.00004988759,0.0001307512,0.00008423784],"genre_scores_gemma":[0.9759953,0.000001690847,0.02389594,0.00003280908,0.00001232567,0.0000204284,0.00001610538,0.00001111958,0.00001428144],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9531294,"threshold_uncertainty_score":0.6142805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119215342","doi":"10.1109/tsp.2004.823502","title":"Transceiver Optimization for Block-Based Multiple Access Through ISI Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":111,"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":"Subcarrier; Transceiver; Transmitter; Computer science; Intersymbol interference; Mathematical optimization; Convex optimization; Semidefinite programming; Second-order cone programming; Optimization problem; Channel (broadcasting); Mathematics; Wireless; Telecommunications; Orthogonal frequency-division multiplexing; Regular polygon","retraction":null,"screen_n_in":null,"score":{"opus":0.03219193480296199,"gpt":0.2694817582706109,"spread":0.2372898234676489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0000749622,0.0002838577,0.000237241,0.0001733182,0.0004004092,0.0001437276,0.0001797123,0.0001604485,0.00003528936],"category_scores_gemma":[0.000003193962,0.0003108123,0.0001211677,0.0004594152,0.00004173135,0.001203842,3.420008e-7,0.0001879504,0.000006602761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000214453,"about_ca_system_score_gemma":0.00006443773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007782322,"about_ca_topic_score_gemma":0.00001534707,"domain_scores_codex":[0.9987748,0.00001480537,0.0003619365,0.0003264242,0.0001822816,0.000339775],"domain_scores_gemma":[0.9994714,0.00007161139,0.00007037849,0.0001468332,0.0001665692,0.00007318014],"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.00006852922,0.00008766961,7.720932e-7,0.0002815631,0.00002363476,0.000001229639,0.0004191411,0.9888361,0.002766144,0.000005466391,0.000005541791,0.007504184],"study_design_scores_gemma":[0.001774925,0.00006202019,4.309776e-7,0.0002493669,0.00004311668,0.000004047108,0.00004926855,0.7990333,0.1982963,0.0000903945,0.0001034825,0.0002933014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007779477,0.0001165196,0.9968466,0.00008834047,0.0004035999,0.0007887656,0.0000444697,0.0007328569,0.0002009666],"genre_scores_gemma":[0.9207955,0.00001428011,0.07855194,0.0000987222,0.00008505119,0.000292311,0.00001783404,0.0001100894,0.00003424057],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9200176,"threshold_uncertainty_score":0.9999344,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}