{"meta":{"query_hash":"3fab393fcca8","filters":{"venue":"IEEE Transactions on Signal Processing"},"cohort_total":391,"direct_labels_cover":0,"predictions_cover":391,"exported":391,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/3fab393fcca8","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Transactions+on+Signal+Processing"},"results":[{"id":"W1501140009","doi":"10.1109/tsp.2015.2457398","title":"Worst-Case Jamming on MIMO Gaussian Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Jamming; MIMO; Transceiver; Channel (broadcasting); Closed-form expression; Computer science; Gaussian; Interference (communication); Mathematical optimization; Algorithm; Mathematics; Telecommunications; Wireless","score_opus":0.0442335340115109,"score_gpt":0.27367462954889576,"score_spread":0.22944109553738487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501140009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20048265,0.0015283248,0.78638315,0.00036259132,0.00007097038,0.000045993496,0.0001463707,0.00024217936,0.010737747],"genre_scores_gemma":[0.9896443,0.00068698224,0.008365334,0.000058344638,0.000059689406,0.000021028321,0.00004216924,0.000024089575,0.0010981541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746025,0.00098504,0.00006686241,0.00025227448,0.00056792464,0.0006676916],"domain_scores_gemma":[0.98762137,0.009709447,0.0011689427,0.0004267331,0.00086499995,0.00020844112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023667351,0.0013987236,0.0011470503,0.0007202661,0.0008677966,0.001551689,0.00070839433,0.0012405224,0.00084300374],"category_scores_gemma":[0.00965183,0.0004914555,0.0004355446,0.0011536248,0.0017636956,0.0016147732,0.0011982077,0.0008530258,0.00023790868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001000816,0.0000142085655,0.00080085587,0.00007307177,0.00003225847,0.00030143588,0.0000717517,0.982203,0.0024668674,0.008821853,0.000276414,0.0048381444],"study_design_scores_gemma":[0.0000068474296,0.00006813007,0.00068066275,0.000013539511,0.000024618079,0.00022911138,0.00008072981,0.9895698,0.0015239798,0.007517021,0.00026199076,0.000023550605],"about_ca_topic_score_codex":0.0024385382,"about_ca_topic_score_gemma":0.0025044575,"teacher_disagreement_score":0.0024385382,"about_ca_system_score_codex":0.0011888638,"about_ca_system_score_gemma":0.0007017349,"threshold_uncertainty_score":0.012516677},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.02772842445171202,"score_gpt":0.2240107877288889,"score_spread":0.19628236327717688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522816417","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012807436,0.00020138397,0.9837425,0.00013287431,0.000016750873,0.000021900116,0.000051410167,0.0001303253,0.0028955434],"genre_scores_gemma":[0.8159538,0.0012780508,0.17409568,0.00018209868,0.00009254849,0.00015984008,0.00033158791,0.000075313976,0.007831139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995863,0.00010205247,0.000027741624,0.00009086678,0.00014612377,0.00004697152],"domain_scores_gemma":[0.9995326,0.0002765032,0.00007428801,0.000038070946,0.00006508027,0.0000135696055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005258707,0.0006608738,0.0007526245,0.00025871658,0.00032972023,0.0010389016,0.00048133486,0.00087539933,0.0025453605],"category_scores_gemma":[0.0012802363,0.00030535416,0.00067857193,0.0003498476,0.000798814,0.0010297676,0.0004930818,0.0009568298,0.00044912338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019608701,0.000056034543,0.00055670156,0.00042040859,0.00006305837,0.00022467492,0.00027320036,0.7111623,0.024467744,0.1738005,0.0016795398,0.08709965],"study_design_scores_gemma":[0.000018552675,0.00007383211,0.000197835,0.000014299447,0.000011305538,0.0000375473,0.000024803361,0.9600256,0.0041049947,0.032994144,0.0024824506,0.000014569523],"about_ca_topic_score_codex":0.0039735325,"about_ca_topic_score_gemma":0.003766242,"teacher_disagreement_score":0.0039735325,"about_ca_system_score_codex":0.0009367611,"about_ca_system_score_gemma":0.00084350066,"threshold_uncertainty_score":0.00851506},"labels":[],"label_agreement":null},{"id":"W1653958936","doi":"10.1109/tsp.2015.2461511","title":"Spatial Reuse Precoding for Scalable Downlink Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of British Columbia","funders":"","keywords":"Precoding; Zero-forcing precoding; Telecommunications link; Computer science; MIMO; Cellular network; Single antenna interference cancellation; Kronecker product; Base station; Scalability; Channel (broadcasting); Algorithm; Kronecker delta; Computer network","score_opus":0.02727550175885848,"score_gpt":0.24954350492016006,"score_spread":0.22226800316130157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1653958936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014873528,0.00029495146,0.9796045,0.00015134833,0.00004403068,0.00002541381,0.000048494112,0.00016440681,0.004793344],"genre_scores_gemma":[0.7247287,0.00113333,0.2681954,0.0002569712,0.00018297405,0.00013131325,0.00016216013,0.00004106593,0.0051679844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977404,0.00005154701,0.000009328942,0.000032411874,0.00009837952,0.000034442004],"domain_scores_gemma":[0.9996501,0.00015223084,0.000036409485,0.00007404605,0.00007322738,0.000013993267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026147784,0.00042491214,0.00028416308,0.00016688256,0.00023596836,0.00041257567,0.0003702524,0.0002643855,0.0017085309],"category_scores_gemma":[0.0010673983,0.00014892167,0.00021433791,0.0003637664,0.00044047378,0.00070454733,0.000491859,0.0005721876,0.0003917532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000656495,0.000038160317,0.00034058274,0.00011465648,0.00003037767,0.00023650088,0.00010942195,0.6779291,0.035305757,0.15583727,0.0034343256,0.12655823],"study_design_scores_gemma":[0.0000123770815,0.00006243821,0.00010786627,0.000010203329,0.000007363508,0.0000684313,0.000019621795,0.9684031,0.004273098,0.023231799,0.0037951986,0.000008482867],"about_ca_topic_score_codex":0.0013684538,"about_ca_topic_score_gemma":0.0023645633,"teacher_disagreement_score":0.0017085309,"about_ca_system_score_codex":0.00044239598,"about_ca_system_score_gemma":0.0004700148,"threshold_uncertainty_score":0.0057156086},"labels":[],"label_agreement":null},{"id":"W1662081346","doi":"10.1109/tsp.2015.2460223","title":"Linear Beamformer Design for Interference Alignment via Rank Minimization","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Matrix norm; Telecommunications link; Interference alignment; Algorithm; Minification; Rank (graph theory); Low-rank approximation; Interference (communication); Matrix (chemical analysis); Computer science; Mathematics; Norm (philosophy); Mathematical optimization; Beamforming; Telecommunications; MIMO; Combinatorics","score_opus":0.042207561381087506,"score_gpt":0.2662238182560557,"score_spread":0.22401625687496818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1662081346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051653467,0.00002909549,0.9988838,0.00002026139,0.0000067908145,0.00000755926,0.0000073992856,0.0000557424,0.00047287866],"genre_scores_gemma":[0.11006069,0.00033882723,0.88496435,0.00019913782,0.00009809711,0.0002601734,0.00017326756,0.00015691623,0.0037486271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858284,0.0006056141,0.00005590179,0.00024659265,0.0004082079,0.00010088169],"domain_scores_gemma":[0.9989779,0.00042060178,0.0001593133,0.0001304009,0.0002748288,0.000036931273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001290641,0.0015572321,0.0010489264,0.00045691832,0.00034923694,0.00094485667,0.0012275279,0.0009905612,0.0035034288],"category_scores_gemma":[0.0033277567,0.0006077121,0.0007738921,0.0007167384,0.00095136795,0.0013821819,0.0011540486,0.0014732231,0.001996212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012713418,0.000070304166,0.00036712704,0.0001774041,0.000087361455,0.000079519625,0.0001849601,0.7317921,0.017434916,0.06618771,0.0035537782,0.1799377],"study_design_scores_gemma":[0.000021180704,0.00009880995,0.00008355748,0.000015343667,0.000014786754,0.00006299056,0.000023812401,0.98050565,0.003810555,0.011746367,0.0035994803,0.000017545795],"about_ca_topic_score_codex":0.0009824487,"about_ca_topic_score_gemma":0.0013249145,"teacher_disagreement_score":0.0035034288,"about_ca_system_score_codex":0.00049694505,"about_ca_system_score_gemma":0.0010808783,"threshold_uncertainty_score":0.0117201805},"labels":[],"label_agreement":null},{"id":"W1665036618","doi":"10.1109/tsp.2015.2457400","title":"An Accurate Kernelized Energy Detection in Gaussian and non-Gaussian/Impulsive Noises","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Gaussian; Gaussian function; Detector; Gaussian noise; Higher-order statistics; Kernel (algebra); Algorithm; Mathematics; Energy (signal processing); Order statistic; Test statistic; Computer science; Statistic; Gaussian process; Nonlinear system; Signal processing; Mathematical optimization; Statistics; Statistical hypothesis testing; Telecommunications","score_opus":0.019801825678674178,"score_gpt":0.2610190452571624,"score_spread":0.24121721957848824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1665036618","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015898189,0.000107987165,0.9833461,0.000040631778,0.000016040192,0.000008451145,0.000014436401,0.00009880121,0.00046931914],"genre_scores_gemma":[0.6094875,0.00020802276,0.38829577,0.00006968693,0.000029152912,0.000029417393,0.00007465844,0.000035630168,0.0017702992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993623,0.00018724838,0.000036288715,0.00013450425,0.00022156978,0.000058037665],"domain_scores_gemma":[0.99912554,0.00041605058,0.00009976676,0.00015897879,0.00016493369,0.000034669145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008921402,0.00038271272,0.0006001802,0.00046735365,0.00024552277,0.0007542432,0.0008720833,0.000774289,0.0005923903],"category_scores_gemma":[0.003468107,0.00022085405,0.00035838914,0.00044520656,0.0006565064,0.0012496957,0.0011322616,0.00056013605,0.00024239457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007652292,0.00015229855,0.0031304997,0.0002925718,0.0001039916,0.00042789875,0.00022963063,0.31454247,0.12954542,0.13584323,0.0014030621,0.4135637],"study_design_scores_gemma":[0.000005960836,0.000036662394,0.0002320664,0.000004690831,0.000004765932,0.00014221019,0.000010144067,0.9816721,0.011465246,0.0058913208,0.0005184686,0.000016424512],"about_ca_topic_score_codex":0.0004627277,"about_ca_topic_score_gemma":0.00050608715,"teacher_disagreement_score":0.0008921402,"about_ca_system_score_codex":0.00039205916,"about_ca_system_score_gemma":0.0005810515,"threshold_uncertainty_score":0.0047181845},"labels":[],"label_agreement":null},{"id":"W1672446266","doi":"10.1109/tsp.2015.2457391","title":"Restricted Isometry Property on Banded Block Toeplitz Matrices with Application to Multi-Channel Convolutive Source Separation","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Toeplitz matrix; Restricted isometry property; Mathematics; Block (permutation group theory); Matrix (chemical analysis); Compressed sensing; Gaussian; Upper and lower bounds; Algorithm; Levinson recursion; Combinatorics; Mathematical analysis; Pure mathematics","score_opus":0.029906376913329372,"score_gpt":0.26463489888009845,"score_spread":0.23472852196676908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1672446266","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009865617,0.0003807274,0.98632205,0.00018535081,0.000040722538,0.000032500484,0.000066436114,0.00012450831,0.0029820665],"genre_scores_gemma":[0.70123005,0.0037436683,0.2873231,0.00053068285,0.00040539802,0.00032507334,0.0005001669,0.00021981302,0.0057220384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795747,0.0005284394,0.000115963194,0.00035108303,0.0008654711,0.000181514],"domain_scores_gemma":[0.9902192,0.005872317,0.0011865997,0.0010620829,0.0014454882,0.00021440703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021875363,0.0011222113,0.0007093786,0.0012084444,0.0004618336,0.0011620707,0.00074796594,0.0010919574,0.0028288648],"category_scores_gemma":[0.016085273,0.0005131872,0.00077558425,0.0014243427,0.0023029088,0.0027562536,0.001528606,0.002657262,0.00078451267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027937032,0.00013767852,0.0016030439,0.00039608157,0.000083895146,0.00094690284,0.00049991393,0.42437166,0.027591044,0.45336753,0.0035186592,0.08720422],"study_design_scores_gemma":[0.000015255845,0.000108582775,0.00044910266,0.000025252908,0.000013285069,0.00040022054,0.000050581668,0.9047937,0.0049514803,0.087539285,0.0016131273,0.000040130217],"about_ca_topic_score_codex":0.0011946156,"about_ca_topic_score_gemma":0.00069342734,"teacher_disagreement_score":0.0028288648,"about_ca_system_score_codex":0.00057280855,"about_ca_system_score_gemma":0.0008603566,"threshold_uncertainty_score":0.011568904},"labels":[],"label_agreement":null},{"id":"W1923938124","doi":"10.1109/tsp.2014.2324994","title":"An Adaptive Approach to Learn Overcomplete Dictionaries With Efficient Numbers of Elements","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Toronto Metropolitan University; University of Toronto","funders":"","keywords":"K-SVD; Sparse approximation; Computer science; Representation (politics); Pattern recognition (psychology); Artificial intelligence; Set (abstract data type); Singular value decomposition; Algorithm","score_opus":0.01785593757122973,"score_gpt":0.2277793138414049,"score_spread":0.20992337627017518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1923938124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033579136,0.00013161691,0.9958996,0.000052255873,0.000022191678,0.00001806817,0.000024767303,0.00016162654,0.0003319674],"genre_scores_gemma":[0.14194097,0.0006132776,0.85316277,0.0002892587,0.00014071692,0.00019726303,0.00037170216,0.00012239534,0.003161649],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994155,0.0001222354,0.000050230563,0.00017786064,0.00019066382,0.000043488308],"domain_scores_gemma":[0.9991405,0.0003377029,0.00010039484,0.0001706299,0.00021335126,0.000037401966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066903856,0.0007977684,0.0011109096,0.0007453071,0.00030911833,0.00049947365,0.0012321649,0.000998343,0.0014368731],"category_scores_gemma":[0.0024720244,0.00050332095,0.0007435094,0.0010125663,0.00069847296,0.001402503,0.0011513326,0.0015139319,0.00081562356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025472275,0.00015682272,0.0010791881,0.0003209717,0.00015457821,0.00012652864,0.00022113566,0.347733,0.05795113,0.026938425,0.0052421885,0.5598213],"study_design_scores_gemma":[0.000015627651,0.00007397642,0.00013475648,0.000011510728,0.000016489756,0.000080305166,0.000013525184,0.98854244,0.004911382,0.004145408,0.0020420677,0.000012541228],"about_ca_topic_score_codex":0.0018599249,"about_ca_topic_score_gemma":0.002986936,"teacher_disagreement_score":0.0018599249,"about_ca_system_score_codex":0.00033982363,"about_ca_system_score_gemma":0.0007739511,"threshold_uncertainty_score":0.004806757},"labels":[],"label_agreement":null},{"id":"W1925674193","doi":"10.1109/tsp.2015.2468681","title":"Iterative Demodulation and Channel Estimation for Asynchronous Joint Multiple Access Reception","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Demodulation; Computer science; Estimator; Channel (broadcasting); Iterative method; Convergence (economics); Asynchronous communication; Algorithm; Control theory (sociology); Electronic engineering; Mathematical optimization; Telecommunications; Mathematics; Artificial intelligence; Statistics; Engineering","score_opus":0.0657500914792896,"score_gpt":0.30571182297665717,"score_spread":0.23996173149736755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1925674193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023798458,0.0003056795,0.99535733,0.000040467945,0.000027912141,0.000014276766,0.0000060684756,0.00006945943,0.0017989657],"genre_scores_gemma":[0.39507487,0.0021661615,0.59444034,0.00017794617,0.00045210271,0.00017803155,0.00007760301,0.000107352585,0.0073256087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991836,0.00037499494,0.00002547367,0.00008805007,0.00027435378,0.000053504467],"domain_scores_gemma":[0.998667,0.0008788599,0.00012691895,0.00013524388,0.00017328419,0.000018629416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011274935,0.0007273344,0.0005022778,0.00043847362,0.00035175285,0.0009015258,0.0006956745,0.0008707618,0.002321438],"category_scores_gemma":[0.004408696,0.00028548582,0.00044069428,0.0007270087,0.0008364485,0.0009575849,0.0008082638,0.0010103139,0.0009627866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018324556,0.00007156819,0.00086534605,0.00029549442,0.00006629393,0.00037673366,0.00029412366,0.4227452,0.03736394,0.32810915,0.0020576797,0.20757125],"study_design_scores_gemma":[0.000009185617,0.00011536382,0.00020485958,0.000022767037,0.000018461185,0.00031635273,0.000023037628,0.9683253,0.0056274855,0.021014238,0.0043010926,0.000021874997],"about_ca_topic_score_codex":0.00046802795,"about_ca_topic_score_gemma":0.00061075937,"teacher_disagreement_score":0.002321438,"about_ca_system_score_codex":0.00041079373,"about_ca_system_score_gemma":0.0005486055,"threshold_uncertainty_score":0.0077660084},"labels":[],"label_agreement":null},{"id":"W1964306033","doi":"10.1109/tsp.2013.2283463","title":"L -infinity norm design of linear-phase robust broadband beamformers using constrained optimization","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Passband; Stopband; Control theory (sociology); Linear phase; Mathematics; Convex optimization; Attenuation; Sensitivity (control systems); Optimization problem; Microphone; Computer science; Filter (signal processing); Band-pass filter; Algorithm; Physics; Telecommunications; Electronic engineering; Sound pressure; Engineering; Regular polygon; Optics","score_opus":0.04944038923643297,"score_gpt":0.2769712992948512,"score_spread":0.22753091005841825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964306033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041818788,0.000029945582,0.99910057,0.000018531377,0.000005951782,0.000007653485,0.0000061108008,0.000057301546,0.00035582634],"genre_scores_gemma":[0.10235604,0.00039840973,0.89268506,0.00020081963,0.00006316491,0.00044994973,0.00017742834,0.00020886798,0.0034602226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992741,0.0002870909,0.000038192546,0.00012475126,0.0002320879,0.00004381508],"domain_scores_gemma":[0.9991603,0.000429488,0.00010826125,0.00004369405,0.00022475679,0.00003356257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011840853,0.0017455992,0.000988408,0.00048074772,0.00023270237,0.0008006781,0.0009900677,0.0010224112,0.002861225],"category_scores_gemma":[0.002423745,0.0007070643,0.00084415526,0.00051383453,0.0009024755,0.0009838856,0.0011200992,0.0011856548,0.0012111864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015139878,0.000059570866,0.00021899656,0.00028965165,0.00011725081,0.00010908974,0.00013885438,0.8090127,0.03014661,0.030707031,0.00341415,0.1256347],"study_design_scores_gemma":[0.000020233105,0.000083125444,0.000062165054,0.000016944341,0.000011423597,0.000043575536,0.000011477674,0.9893635,0.003995512,0.004034264,0.0023418474,0.00001594554],"about_ca_topic_score_codex":0.0009989452,"about_ca_topic_score_gemma":0.001056156,"teacher_disagreement_score":0.002861225,"about_ca_system_score_codex":0.00045861353,"about_ca_system_score_gemma":0.0009249996,"threshold_uncertainty_score":0.009571791},"labels":[],"label_agreement":null},{"id":"W1964499116","doi":"10.1109/tsp.2012.2187521","title":"Cooperative Multiband Joint Detection With Correlated Spectral Occupancy in Cognitive Radio Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Cognitive radio; Computer science; Wideband; Markov chain; Joint (building); Interference (communication); Markov process; Fusion center; Occupancy; Maximization; Algorithm; Mathematical optimization; Electronic engineering; Telecommunications; Mathematics; Wireless; Statistics; Engineering; Machine learning","score_opus":0.0210560181403135,"score_gpt":0.2442671118203684,"score_spread":0.2232110936800549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964499116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053941246,0.00039367971,0.9442928,0.0000851881,0.000018872961,0.000014809755,0.000011620088,0.00012369573,0.0011181539],"genre_scores_gemma":[0.9392807,0.0001499312,0.059799615,0.0000778284,0.000026271407,0.000032020103,0.00001313789,0.000014834925,0.0006055314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982476,0.0007089406,0.00005921057,0.00025263597,0.00051004364,0.0002214734],"domain_scores_gemma":[0.9981217,0.0011484765,0.0002345513,0.0002416181,0.00019714372,0.000056528424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017755091,0.00062443427,0.00085224834,0.0003235139,0.00032444976,0.00095642643,0.00092445605,0.0006255732,0.00030369553],"category_scores_gemma":[0.004128824,0.0004675085,0.00045132957,0.000609253,0.0009941232,0.0012633066,0.0014034577,0.0005977918,0.00010502138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038430534,0.00009570642,0.0011734983,0.000104023966,0.00013139256,0.00023204875,0.000289093,0.8546626,0.021170823,0.04131371,0.0004492447,0.079993635],"study_design_scores_gemma":[0.0000138370615,0.00006814577,0.00018791137,0.0000042194984,0.00002243973,0.00007020436,0.00002030331,0.9869624,0.0034064488,0.008959391,0.00027096912,0.000013662937],"about_ca_topic_score_codex":0.00096630346,"about_ca_topic_score_gemma":0.0014584457,"teacher_disagreement_score":0.0017755091,"about_ca_system_score_codex":0.0004565465,"about_ca_system_score_gemma":0.0006992102,"threshold_uncertainty_score":0.009389877},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02674836540943531,"score_gpt":0.2465436623518149,"score_spread":0.2197952969423796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966184693","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012627188,0.00021946823,0.9958488,0.00007072352,0.00006250294,0.00001572017,0.00004756946,0.0003354887,0.0021369401],"genre_scores_gemma":[0.36245987,0.0019509837,0.6200131,0.00040694283,0.00032908926,0.00018420728,0.00079171464,0.00032044528,0.013543644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988187,0.0002490113,0.00005496397,0.00028724482,0.0004884792,0.00010142419],"domain_scores_gemma":[0.9984749,0.00049170724,0.0001181538,0.0002832814,0.0005950792,0.000036722373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012920457,0.00060605834,0.0012568197,0.0004427432,0.0004379579,0.001306478,0.0011925208,0.0009702736,0.003686765],"category_scores_gemma":[0.005906325,0.00033505136,0.00062152225,0.0009015245,0.0007213452,0.0016164728,0.0011009119,0.0010598984,0.0018933095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018367222,0.00006944974,0.0016897207,0.00031905592,0.00014159284,0.0001578988,0.00018340364,0.38871607,0.014067581,0.21178184,0.012436665,0.37025297],"study_design_scores_gemma":[0.000020777443,0.00004076893,0.0003264131,0.000025164552,0.00002485556,0.00007324864,0.000018468601,0.94249773,0.0030496265,0.041109882,0.012791424,0.000021632608],"about_ca_topic_score_codex":0.0034041537,"about_ca_topic_score_gemma":0.002838412,"teacher_disagreement_score":0.003686765,"about_ca_system_score_codex":0.00060473644,"about_ca_system_score_gemma":0.0011990474,"threshold_uncertainty_score":0.012333453},"labels":[],"label_agreement":null},{"id":"W1966208803","doi":"10.1109/tsp.2014.2301137","title":"Flexible Codebook Design for Limited Feedback Systems Via Sequential Smooth Optimization on the Grassmannian Manifold","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Codebook; Grassmannian; Stiefel manifold; Beamforming; Quantization (signal processing); MIMO; Telecommunications link; Algorithm; Mathematics; Computer science; Mathematical optimization; Theoretical computer science; Topology (electrical circuits); Telecommunications; Combinatorics; Pure mathematics","score_opus":0.031601952994698916,"score_gpt":0.23690302057374657,"score_spread":0.20530106757904765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966208803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009876333,0.00015496433,0.98843867,0.00005765065,0.000020419242,0.000030784067,0.000037824626,0.00013111376,0.001252287],"genre_scores_gemma":[0.5986487,0.000353495,0.39689445,0.00010611477,0.000040959683,0.00017916135,0.00020835373,0.00008333477,0.0034853856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956685,0.00013384421,0.000026479667,0.00006081556,0.00016972047,0.000042339256],"domain_scores_gemma":[0.9992829,0.00031792562,0.000089685556,0.00008427452,0.00018270832,0.000042495725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078802253,0.0005432017,0.00054069556,0.00028624976,0.00028486727,0.0006137108,0.0006306631,0.00040930382,0.0017629947],"category_scores_gemma":[0.0024051743,0.00023647244,0.00027175064,0.0004429992,0.00056310184,0.0008219786,0.00064852525,0.00057081576,0.00058184844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018175627,0.000043385604,0.0004818798,0.00014480598,0.000031556567,0.00009063748,0.00018092048,0.73616403,0.025164196,0.076402016,0.0029959015,0.158119],"study_design_scores_gemma":[0.000018326034,0.00006694772,0.000072140894,0.0000068281465,0.0000034854977,0.00003004339,0.000014742075,0.98659676,0.0026522807,0.009127381,0.0014000417,0.000011092979],"about_ca_topic_score_codex":0.0018091016,"about_ca_topic_score_gemma":0.0025344302,"teacher_disagreement_score":0.0018091016,"about_ca_system_score_codex":0.0006470199,"about_ca_system_score_gemma":0.0009680797,"threshold_uncertainty_score":0.0058977604},"labels":[],"label_agreement":null},{"id":"W1967678562","doi":"10.1109/tsp.2014.2299512","title":"Sum-Rate Maximization in the Multicell MIMO Broadcast Channel With Interference Coordination","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"MIMO; Precoding; Computer science; Base station; Mathematical optimization; Maximization; Dirty paper coding; Optimization problem; Telecommunications link; Cellular network; Interference (communication); Algorithm; Channel (broadcasting); Mathematics; Telecommunications","score_opus":0.013448498264056634,"score_gpt":0.218956880752893,"score_spread":0.20550838248883635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967678562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03680867,0.0011109844,0.95565146,0.00023969801,0.000041996656,0.000034108576,0.00008138711,0.00013759921,0.0058941874],"genre_scores_gemma":[0.9034053,0.0013085089,0.091143355,0.00013111514,0.00011670068,0.00011698247,0.00011328517,0.00008441422,0.0035802715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878114,0.00051427283,0.00002407108,0.00013712351,0.00035086583,0.00019255458],"domain_scores_gemma":[0.9988167,0.0007936796,0.00011537803,0.000050581653,0.00018679544,0.00003684673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010727742,0.0013529526,0.0010608981,0.00042495795,0.00036363324,0.0010809225,0.0007918103,0.00081348093,0.00083853776],"category_scores_gemma":[0.0024057843,0.00038534365,0.0004736468,0.0010422112,0.0010087813,0.0010162576,0.00090203574,0.00072557904,0.0003145321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007409218,0.000036273796,0.00021676328,0.00012117459,0.000041799813,0.00010105445,0.0000669182,0.9638373,0.00479651,0.012551089,0.0007558981,0.017401066],"study_design_scores_gemma":[0.000009797527,0.000043119937,0.000105637555,0.0000052304526,0.000011633587,0.000028092949,0.000020138912,0.99442333,0.0016978342,0.0033690925,0.00027877055,0.000007364271],"about_ca_topic_score_codex":0.0039083227,"about_ca_topic_score_gemma":0.0027801434,"teacher_disagreement_score":0.0039083227,"about_ca_system_score_codex":0.0011275182,"about_ca_system_score_gemma":0.001044794,"threshold_uncertainty_score":0.008180678},"labels":[],"label_agreement":null},{"id":"W1973046481","doi":"10.1109/tsp.2011.2177261","title":"Widely Linear versus Conventional Subspace-Based Estimation of SIMO Flat-Fading Channels: Mean Squared Error Analysis","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Fading; Mean squared error; Mathematics; Subspace topology; Statistics; Signal processing; Algorithm; Computer science; Telecommunications; Mathematical analysis; Decoding methods","score_opus":0.0603004563064104,"score_gpt":0.29282574344299006,"score_spread":0.23252528713657966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973046481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24752244,0.0020684241,0.7480054,0.00023249652,0.000044955985,0.000029509549,0.000096587246,0.00027932355,0.0017209781],"genre_scores_gemma":[0.9197959,0.00083454954,0.07844142,0.000077348195,0.00004955456,0.000031212923,0.00012886911,0.00005959696,0.0005815239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998723,0.00042230648,0.00007095823,0.00013018113,0.0005358725,0.00011763532],"domain_scores_gemma":[0.9898769,0.0077059083,0.00064598635,0.00047737456,0.0012196907,0.00007416945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028631806,0.00085055147,0.0006840758,0.0007420516,0.00019114478,0.0006999763,0.0005135892,0.0008187095,0.00060041907],"category_scores_gemma":[0.016753303,0.00021886826,0.00031160857,0.00071281445,0.00074215134,0.0017553028,0.0008921581,0.00044619033,0.00017202907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004165848,0.00004189304,0.004984827,0.0001445731,0.0001384668,0.00011320682,0.000085029475,0.91212535,0.010542683,0.0076624267,0.0003503977,0.06339462],"study_design_scores_gemma":[0.000006220698,0.00008606011,0.0010546242,0.000009379646,0.000015175815,0.00006616208,0.000025645422,0.99267757,0.0046583707,0.0012728767,0.0001112517,0.00001662218],"about_ca_topic_score_codex":0.0016734974,"about_ca_topic_score_gemma":0.001758977,"teacher_disagreement_score":0.0028631806,"about_ca_system_score_codex":0.00045774094,"about_ca_system_score_gemma":0.00047279583,"threshold_uncertainty_score":0.015142143},"labels":[],"label_agreement":null},{"id":"W1973547261","doi":"10.1109/tsp.2012.2229998","title":"Estimation of Primary User Parameters in Cognitive Radio Systems via Hidden Markov Model","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Hidden Markov model; Cognitive radio; Identifiability; Estimation theory; Expectation–maximization algorithm; Channel (broadcasting); Algorithm; Computer science; Markov model; Equivalence (formal languages); Markov process; Markov chain; Mathematics; Pattern recognition (psychology); Mathematical optimization; Speech recognition; Artificial intelligence; Statistics; Maximum likelihood; Machine learning; Telecommunications; Wireless","score_opus":0.025674615795204105,"score_gpt":0.2530651670875393,"score_spread":0.22739055129233518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973547261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032188673,0.00021753993,0.9665087,0.00021084731,0.000019146406,0.00002119787,0.00004184792,0.00017130686,0.0006208236],"genre_scores_gemma":[0.94012064,0.0004370922,0.057674624,0.00007643038,0.00004182786,0.000071160546,0.00012537252,0.000037106518,0.0014157756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991301,0.00036915333,0.000039907245,0.0001690502,0.00017142028,0.000120397664],"domain_scores_gemma":[0.99540627,0.0036960023,0.00038018185,0.00021128164,0.00024651646,0.000059794318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002355083,0.0008883842,0.001270841,0.00054876524,0.0004279016,0.0009785574,0.0010752016,0.0011731829,0.00084635156],"category_scores_gemma":[0.011209122,0.00077080826,0.0006463139,0.0006311159,0.0011625899,0.0020851477,0.0010260821,0.0016714528,0.00025746014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000705336,0.000025335807,0.00089181063,0.000041224674,0.000024824001,0.00008847299,0.000078185265,0.9751849,0.0008808443,0.012473303,0.00020036836,0.01004015],"study_design_scores_gemma":[0.0000041014573,0.0000074000413,0.000105282226,0.0000028254065,0.0000038568264,0.000012424866,0.000005178403,0.9948777,0.00021009639,0.00472117,0.000044055563,0.000005930662],"about_ca_topic_score_codex":0.0076088137,"about_ca_topic_score_gemma":0.004270659,"teacher_disagreement_score":0.0076088137,"about_ca_system_score_codex":0.00090017426,"about_ca_system_score_gemma":0.0011581563,"threshold_uncertainty_score":0.01512903},"labels":[],"label_agreement":null},{"id":"W1974505551","doi":"10.1109/tsp.2013.2264812","title":"Systematic DFT Frames: Principle, Eigenvalues Structure, and Applications","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Eigenvalues and eigenvectors; Computer science; Redundancy (engineering); Coding (social sciences); Theoretical computer science; Mathematics; Algorithm; Discrete Fourier transform (general); Signal processing; Fourier transform; Digital signal processing; Fourier analysis; Short-time Fourier transform; Statistics; Mathematical analysis","score_opus":0.036969992590196385,"score_gpt":0.33185968014957223,"score_spread":0.29488968755937583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974505551","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041687332,0.0015087235,0.94449854,0.0004490581,0.00009256102,0.00003250679,0.00008201938,0.0000732948,0.011576055],"genre_scores_gemma":[0.7428222,0.0050095897,0.24403019,0.00030397376,0.00064697815,0.00023845435,0.00021608872,0.00012459542,0.006608053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947983,0.00014269694,0.000030833166,0.00010911714,0.00018966266,0.00004782813],"domain_scores_gemma":[0.9979869,0.0011547605,0.00023424202,0.00019776219,0.00031944286,0.00010690714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086039753,0.0008245827,0.0003973426,0.0012093736,0.00052886136,0.0009551006,0.00038405185,0.000886632,0.0027637451],"category_scores_gemma":[0.005383222,0.000389118,0.00032954421,0.00082659937,0.0019464466,0.0016448911,0.0013938247,0.0013204978,0.0005270379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005629769,0.000022552182,0.0005378963,0.0000735613,0.000009673467,0.000120373144,0.00020384238,0.024496075,0.008196447,0.92660195,0.0010910111,0.038590416],"study_design_scores_gemma":[0.000013521731,0.0001478091,0.00063357374,0.00007688152,0.000010946556,0.0002583736,0.00015330642,0.15549332,0.0037378105,0.8340296,0.0054081692,0.000036674115],"about_ca_topic_score_codex":0.0004282954,"about_ca_topic_score_gemma":0.00043750144,"teacher_disagreement_score":0.0027637451,"about_ca_system_score_codex":0.0004911162,"about_ca_system_score_gemma":0.0004099915,"threshold_uncertainty_score":0.009245634},"labels":[],"label_agreement":null},{"id":"W1977132383","doi":"10.1109/tsp.2005.861779","title":"Design of block transceivers with decision feedback detection","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Transmitter; Minimum mean square error; Transceiver; Block (permutation group theory); Computer science; Bit error rate; Algorithm; Mean squared error; Transmission (telecommunications); Gaussian; Block code; Gaussian noise; Mathematics; Control theory (sociology); Decoding methods; Telecommunications; Statistics; Estimator; Artificial intelligence; Wireless","score_opus":0.011750970219613478,"score_gpt":0.22226631677918487,"score_spread":0.2105153465595714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977132383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01247326,0.00017017817,0.98521554,0.00005943215,0.000036483747,0.00008055738,0.000035823225,0.00019251188,0.001736203],"genre_scores_gemma":[0.4519701,0.00044044317,0.5418053,0.00016837385,0.0001110448,0.0004210581,0.00012984409,0.00005899986,0.004894751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916875,0.00030523835,0.000055918164,0.000108115244,0.00028148477,0.000080559716],"domain_scores_gemma":[0.9991295,0.00028702003,0.0001681561,0.00008168292,0.00028321985,0.0000504823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009072752,0.0005513771,0.00055790774,0.0003038968,0.00029860713,0.00046487196,0.00080820255,0.0006488232,0.0018593054],"category_scores_gemma":[0.0019448004,0.00040709839,0.00023118683,0.00027368983,0.0003277855,0.00072712824,0.0007255974,0.00050611707,0.0011332921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085937046,0.00019121286,0.0023574803,0.0005483797,0.00029386865,0.00043064906,0.00047210683,0.35816604,0.28314856,0.0756094,0.0048887953,0.27303416],"study_design_scores_gemma":[0.00011752191,0.00070739526,0.0004063899,0.000042490854,0.00007530187,0.00033719002,0.00003677603,0.9431003,0.0368347,0.008018909,0.010282646,0.000040452745],"about_ca_topic_score_codex":0.00042541008,"about_ca_topic_score_gemma":0.00083852577,"teacher_disagreement_score":0.0018593054,"about_ca_system_score_codex":0.0003510562,"about_ca_system_score_gemma":0.00068469514,"threshold_uncertainty_score":0.006219983},"labels":[],"label_agreement":null},{"id":"W1979388768","doi":"10.1109/tsp.2004.842200","title":"Analysis of beamformer configurations for DS-CDMA systems","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Code division multiple access; Computer science; Chip; Interference (communication); Electronic engineering; Asynchronous communication; Spread spectrum; Telecommunications; Engineering","score_opus":0.043310274260766495,"score_gpt":0.31710078831214017,"score_spread":0.27379051405137367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979388768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025637774,0.0010783708,0.9648979,0.00014995853,0.000039525185,0.00004023558,0.000077186516,0.0003137451,0.0077653145],"genre_scores_gemma":[0.7615311,0.0026446802,0.2272066,0.00021907373,0.0001567312,0.0002704962,0.00044265526,0.0002282917,0.007300386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985838,0.0006083365,0.000049121805,0.00014019602,0.0004879425,0.00013059705],"domain_scores_gemma":[0.99654764,0.0019437099,0.00035609474,0.0002171203,0.0008482787,0.000087204455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015676207,0.0016727733,0.0005965974,0.0009434839,0.00034404735,0.001092512,0.00059821416,0.0011588737,0.0053430838],"category_scores_gemma":[0.0049506845,0.00071689475,0.0007188685,0.0011564752,0.0005324716,0.0009873102,0.00047536285,0.0005000922,0.001997899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006885238,0.00008127905,0.005141675,0.00045455684,0.00028436596,0.000597966,0.00031060432,0.6890892,0.0547417,0.08027992,0.0026778462,0.16565232],"study_design_scores_gemma":[0.00008877676,0.0004641254,0.003649976,0.00013329588,0.00015190935,0.0011666381,0.00014768488,0.9521116,0.018407445,0.01756655,0.006025923,0.000085985754],"about_ca_topic_score_codex":0.0006751939,"about_ca_topic_score_gemma":0.0008554551,"teacher_disagreement_score":0.0053430838,"about_ca_system_score_codex":0.00068149384,"about_ca_system_score_gemma":0.0004655835,"threshold_uncertainty_score":0.01787436},"labels":[],"label_agreement":null},{"id":"W1980254160","doi":"10.1109/tsp.2012.2187290","title":"Moving Target Parameters Estimation in Noncoherent MIMO Radar Systems","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Radar Systems and Signal Processing","field":"Engineering","cited_by":93,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Estimator; Estimation theory; Mathematics; MIMO; Algorithm; Polynomial; Control theory (sociology); Radar; Overdetermined system; Mathematical optimization; Computer science; Applied mathematics; Statistics; Beamforming; Telecommunications; Artificial intelligence","score_opus":0.017277276214219393,"score_gpt":0.23346797285165544,"score_spread":0.21619069663743604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980254160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02151958,0.0006044543,0.9773176,0.000072599185,0.000016269556,0.000008378525,0.000019147257,0.0000900797,0.0003519586],"genre_scores_gemma":[0.6708597,0.0019886622,0.3250059,0.00011869873,0.00010599301,0.00005173032,0.00018731791,0.000064361564,0.0016176831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993605,0.00022012056,0.000036883812,0.00012650869,0.00022371173,0.000032157444],"domain_scores_gemma":[0.9989691,0.0006384581,0.00016733984,0.000087650005,0.00011678762,0.000020644891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010090495,0.00056810054,0.000634483,0.0004703904,0.000236891,0.00065548357,0.0004890877,0.00070941786,0.0003654973],"category_scores_gemma":[0.0042993305,0.0005003053,0.0002935701,0.0006264383,0.00046006136,0.001189727,0.0007378317,0.00079775054,0.00020421248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014281197,0.00003749328,0.0012493929,0.00021375183,0.000076186356,0.00020722163,0.00020966628,0.81935525,0.028259734,0.018332204,0.0005253661,0.13139087],"study_design_scores_gemma":[0.0000114622535,0.000040740942,0.00059612107,0.0000102961,0.000013394215,0.00008243415,0.000019473142,0.98828775,0.004874971,0.005555874,0.00048591735,0.00002159923],"about_ca_topic_score_codex":0.0010378254,"about_ca_topic_score_gemma":0.0011448092,"teacher_disagreement_score":0.0010378254,"about_ca_system_score_codex":0.00032173272,"about_ca_system_score_gemma":0.00041932383,"threshold_uncertainty_score":0.005336404},"labels":[],"label_agreement":null},{"id":"W1980685205","doi":"10.1109/tsp.2012.2208635","title":"Sum-Rate Maximization in Two-Way AF MIMO Relaying: Polynomial Time Solutions to a Class of DC Programming Problems","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Parameterized complexity; Mathematics; Mathematical optimization; MIMO; Maximization; Linearization; Relaxation (psychology); Convex optimization; Upper and lower bounds; Polynomial; Eigenvalues and eigenvectors; Semidefinite programming; Algorithm; Regular polygon; Beamforming; Nonlinear system","score_opus":0.048258222088602844,"score_gpt":0.28673939016345396,"score_spread":0.23848116807485112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980685205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007026174,0.00025477677,0.9885069,0.0001880341,0.000020870868,0.000026521953,0.00003452602,0.000061668674,0.0038805068],"genre_scores_gemma":[0.47382566,0.0018023179,0.5140691,0.00025284666,0.00014207442,0.00030292405,0.00023544594,0.00021967143,0.009149949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995209,0.00018830033,0.00001556184,0.00007821974,0.00011921742,0.000077693534],"domain_scores_gemma":[0.99887985,0.0008564163,0.000062662635,0.00005209948,0.00011781155,0.000031236967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000942106,0.0012309683,0.0009322109,0.0003314416,0.0003430919,0.0013781427,0.00064074155,0.0010717624,0.002266219],"category_scores_gemma":[0.0029952442,0.00035985463,0.0007306447,0.0007636237,0.0007549943,0.0010273737,0.0009493043,0.0018397481,0.0005771275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077095385,0.00009786284,0.00028220282,0.0001986918,0.000023522385,0.000095033,0.00010812602,0.8668383,0.0042576035,0.07265184,0.0023132353,0.053056438],"study_design_scores_gemma":[0.000009194983,0.00001799947,0.00004002168,0.0000070299916,0.0000033139847,0.000024713496,0.000014524186,0.98716646,0.0009843484,0.011098353,0.00062998023,0.000004089845],"about_ca_topic_score_codex":0.0021504653,"about_ca_topic_score_gemma":0.0018860014,"teacher_disagreement_score":0.002266219,"about_ca_system_score_codex":0.0008942185,"about_ca_system_score_gemma":0.0012333344,"threshold_uncertainty_score":0.0075812936},"labels":[],"label_agreement":null},{"id":"W1980828944","doi":"10.1109/tsp.2002.804085","title":"Generalized S transform","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Rounding; Mathematics; Integer (computer science); S transform; Algorithm; Discrete mathematics; Applied mathematics; Arithmetic; Computer science; Wavelet transform; Artificial intelligence","score_opus":0.035387526039532956,"score_gpt":0.27622695559455174,"score_spread":0.24083942955501877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980828944","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021609735,0.0015213968,0.8951567,0.0006544082,0.0007987049,0.00011619282,0.00034097303,0.0011629997,0.07863897],"genre_scores_gemma":[0.49489477,0.0036297645,0.42372325,0.0014201665,0.00065875734,0.00026585607,0.00093957194,0.00059465715,0.07387316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964094,0.00005877459,0.000020544447,0.000089346955,0.00013952317,0.000050945757],"domain_scores_gemma":[0.99971443,0.000065637934,0.00003336459,0.00009331638,0.00007202416,0.000021246064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032872212,0.00056033867,0.0005355505,0.0007564422,0.0004888966,0.001309358,0.0006931383,0.00091995153,0.015237449],"category_scores_gemma":[0.0012656925,0.00018926337,0.00059241656,0.00082215597,0.0010026805,0.001547642,0.0011156991,0.0010650707,0.004023523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002318647,0.000035423975,0.00032939346,0.00021432572,0.000023410405,0.0003950647,0.00014209849,0.024870269,0.047529407,0.660337,0.012282934,0.25360876],"study_design_scores_gemma":[0.00009608122,0.000451433,0.00046766555,0.00011788823,0.0000473475,0.0023499785,0.00021522699,0.3102818,0.07250958,0.38803488,0.2253041,0.00012400142],"about_ca_topic_score_codex":0.00044026828,"about_ca_topic_score_gemma":0.00048602882,"teacher_disagreement_score":0.015237449,"about_ca_system_score_codex":0.00040606898,"about_ca_system_score_gemma":0.00066932815,"threshold_uncertainty_score":0.05097437},"labels":[],"label_agreement":null},{"id":"W1982754822","doi":"10.1109/tsp.2014.2345636","title":"Single-Carrier Equalization for Asynchronous Two-Way Relay Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Transceiver; Computer science; Intersymbol interference; Relay channel; Asynchronous communication; Beamforming; Equalization (audio); Transmission (telecommunications); Channel (broadcasting); Transmitter power output; Computer network; Topology (electrical circuits); Electronic engineering; Telecommunications; Power (physics); Transmitter; Wireless; Engineering; Electrical engineering","score_opus":0.044282820323172954,"score_gpt":0.28515896642854227,"score_spread":0.2408761461053693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982754822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018394679,0.00041035775,0.9784087,0.00007997946,0.000032457247,0.00003433502,0.000027582966,0.00013350525,0.002478461],"genre_scores_gemma":[0.805868,0.00080214837,0.18857011,0.00006237939,0.00004651807,0.00013053484,0.00007395059,0.000033890516,0.0044124834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997669,0.00007347812,0.000009831124,0.000049636114,0.00006593475,0.00003429659],"domain_scores_gemma":[0.99966514,0.00020534555,0.000037864058,0.000022120856,0.000057216872,0.000012347575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048519953,0.0008279707,0.00065884273,0.00027952497,0.0003087914,0.000668703,0.00070549303,0.0008043967,0.002129602],"category_scores_gemma":[0.0011928378,0.00026301254,0.0003479951,0.0004701136,0.00051394134,0.00080788694,0.00048770857,0.00064286403,0.00048225455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048472797,0.000027343938,0.00015714236,0.000065586566,0.000012653184,0.00005791495,0.000029152781,0.96401525,0.003403385,0.0059468327,0.0004076262,0.025828648],"study_design_scores_gemma":[0.00000502856,0.000016344156,0.000027573702,0.0000020234747,0.0000030623426,0.0000104265255,0.0000037263392,0.99833125,0.0004604334,0.0009815111,0.00015598984,0.0000025655488],"about_ca_topic_score_codex":0.0026444006,"about_ca_topic_score_gemma":0.002757692,"teacher_disagreement_score":0.0026444006,"about_ca_system_score_codex":0.00059499405,"about_ca_system_score_gemma":0.00062171806,"threshold_uncertainty_score":0.007124245},"labels":[],"label_agreement":null},{"id":"W1985525333","doi":"10.1109/tsp.2012.2215603","title":"Average-Consensus in a Deterministic Framework—Part I: Strong Connectivity","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Node (physics); Computer science; Algorithm; Network topology; Consensus algorithm; Order (exchange); Path (computing); Discrete mathematics; Theoretical computer science; Mathematics; Computer network; Engineering","score_opus":0.03635120828199561,"score_gpt":0.2800239288123439,"score_spread":0.24367272053034827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985525333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030495163,0.0007929099,0.9626817,0.00062626245,0.000060592465,0.000039509385,0.00008435006,0.00010802507,0.0051114834],"genre_scores_gemma":[0.94967246,0.0010737341,0.045203786,0.00014538933,0.00018032546,0.00015640704,0.00013337679,0.00003584359,0.003398712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984623,0.00045467148,0.00007431555,0.00042679795,0.0004196917,0.00016225645],"domain_scores_gemma":[0.99724907,0.0017657359,0.00043053817,0.00017704115,0.00027234256,0.00010522505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014126827,0.0006855394,0.00088545604,0.00064732175,0.00071053155,0.0011808015,0.0014224071,0.0010540913,0.0012892005],"category_scores_gemma":[0.0057044304,0.00033274762,0.00073578145,0.0008842444,0.0015387485,0.0026220693,0.0012256509,0.0011359904,0.00017435304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004502638,0.000022917575,0.0005580782,0.00012713621,0.000044055047,0.00013749942,0.00006520794,0.80800617,0.0019421303,0.17761295,0.0007947602,0.010644011],"study_design_scores_gemma":[0.000010079701,0.00003381863,0.00016888237,0.000006561833,0.000011682448,0.000036612928,0.000015877811,0.9396692,0.0004169452,0.058785047,0.0008363665,0.000009026334],"about_ca_topic_score_codex":0.0030304529,"about_ca_topic_score_gemma":0.002124201,"teacher_disagreement_score":0.0030304529,"about_ca_system_score_codex":0.001341558,"about_ca_system_score_gemma":0.0012159623,"threshold_uncertainty_score":0.009733677},"labels":[],"label_agreement":null},{"id":"W1986866934","doi":"10.1109/tsp.2014.2350966","title":"Synthesis of Linear and Planar Arrays With Minimum Element Selection","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Antenna Design and Optimization","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Beamwidth; Robustness (evolution); Planar array; Algorithm; Planar; Mathematics; Array gain; Amplitude; Iterative method; Computer science; Physics; Antenna array; Optics; Telecommunications","score_opus":0.00855476399679188,"score_gpt":0.19710849024619675,"score_spread":0.18855372624940486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986866934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006198991,0.00010960334,0.99050397,0.00003984901,0.000026382857,0.000020338563,0.000036074438,0.0003084023,0.0027563053],"genre_scores_gemma":[0.103506856,0.00015732904,0.893009,0.00006414147,0.000028503919,0.00014192837,0.00014864352,0.00007751931,0.0028661054],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960285,0.00006932912,0.000017503606,0.00007559102,0.00019940213,0.000035375157],"domain_scores_gemma":[0.99971265,0.00010584908,0.00005270421,0.000039775976,0.0000740557,0.00001499924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023620023,0.0006440142,0.00054662,0.00034532152,0.00018118024,0.00044402893,0.00067516044,0.0005491805,0.0015440998],"category_scores_gemma":[0.0008217139,0.00041088596,0.0005177492,0.00046326482,0.00033079355,0.00047292744,0.0006003321,0.00051059073,0.0007719873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001367887,0.000064177395,0.00043195506,0.00034280817,0.00008369001,0.00015388237,0.00017435111,0.35199457,0.35568735,0.033667963,0.003695647,0.2535669],"study_design_scores_gemma":[0.000028909035,0.00013088518,0.00018794335,0.00001431041,0.000022516462,0.00015935264,0.000023134486,0.91540754,0.0690141,0.0046002017,0.010379704,0.00003140357],"about_ca_topic_score_codex":0.00040799315,"about_ca_topic_score_gemma":0.0008199551,"teacher_disagreement_score":0.0015440998,"about_ca_system_score_codex":0.00035470037,"about_ca_system_score_gemma":0.0004685268,"threshold_uncertainty_score":0.0051655173},"labels":[],"label_agreement":null},{"id":"W1987131910","doi":"10.1109/tsp.2011.2169250","title":"Bit Allocation Laws for Multiantenna Channel Feedback Quantization: Multiuser Case","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Telecommunications link; Quantization (signal processing); Computer science; Base station; Channel (broadcasting); Channel state information; Algorithm; Multiplexing; Quality of service; Antenna array; Control theory (sociology); Computer network; Telecommunications; Antenna (radio); Wireless","score_opus":0.04448570350255814,"score_gpt":0.2516122295329082,"score_spread":0.20712652603035003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987131910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02763567,0.00077807886,0.95621645,0.00078376866,0.000059336027,0.000091665446,0.00010470559,0.00016805342,0.014162244],"genre_scores_gemma":[0.85137284,0.0012926519,0.13581641,0.00051090034,0.00009912915,0.00040832852,0.00009187238,0.00012030681,0.010287635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883574,0.00034073996,0.000041012732,0.00013319681,0.0004844319,0.0001650161],"domain_scores_gemma":[0.994689,0.00343256,0.0005680068,0.00032639387,0.0008584605,0.00012565365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022941793,0.00066890474,0.00082406745,0.0006357866,0.00070434087,0.0016367433,0.0013847782,0.0013776054,0.0064364523],"category_scores_gemma":[0.012772612,0.00055354263,0.0004096653,0.0008363027,0.0021509451,0.0028853498,0.0010234431,0.0013996889,0.0010602742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107734595,0.000058051755,0.0005876418,0.00014777118,0.00001932675,0.00016077993,0.0003545215,0.5486386,0.004314059,0.42255494,0.0028467523,0.020209916],"study_design_scores_gemma":[0.000013889101,0.000014463138,0.000114078626,0.000016353222,0.000003271075,0.000051101462,0.00002821383,0.9521271,0.00058830244,0.04627263,0.0007593555,0.000011308333],"about_ca_topic_score_codex":0.0034311528,"about_ca_topic_score_gemma":0.0019339344,"teacher_disagreement_score":0.0064364523,"about_ca_system_score_codex":0.0023056604,"about_ca_system_score_gemma":0.0011577173,"threshold_uncertainty_score":0.021532},"labels":[],"label_agreement":null},{"id":"W1990862516","doi":"10.1109/tsp.2015.2394488","title":"Improper Complex-Valued Multiple-Model Adaptive Estimation","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Sequence (biology); Covariance; Estimator; Filter (signal processing); Algorithm; Computer science; Mathematics; Preprocessor; Convergence (economics); Mathematical optimization; Artificial intelligence; Statistics","score_opus":0.09011457075289649,"score_gpt":0.2913712158912658,"score_spread":0.20125664513836933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990862516","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00303665,0.0000696931,0.9966355,0.000028181285,0.000007738532,0.0000036132296,0.0000048121638,0.000052942003,0.0001608622],"genre_scores_gemma":[0.5920274,0.0005807509,0.4047531,0.00018739878,0.000071444476,0.00007450669,0.00010647247,0.000053007276,0.0021458787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939966,0.00017767,0.000035901194,0.00017182062,0.0001682627,0.000046719073],"domain_scores_gemma":[0.9985555,0.000767907,0.00020434112,0.0002238861,0.00022058583,0.000027728456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009967838,0.0005494797,0.0007908978,0.0004253898,0.0002164592,0.00073128834,0.0010979599,0.00081285485,0.0006152563],"category_scores_gemma":[0.003726719,0.00034962353,0.0006185719,0.00059569965,0.00060799305,0.0011967072,0.001011685,0.0015277627,0.00021637646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009601025,0.00003796209,0.0016121293,0.000097863645,0.0001072558,0.00010629575,0.00012405754,0.776753,0.012383171,0.045936942,0.00075942255,0.16198578],"study_design_scores_gemma":[0.000002520174,0.0000106356465,0.00011950699,0.0000029072244,0.000004822226,0.000025005225,0.0000035799496,0.99536103,0.0010417091,0.0031328336,0.0002890292,0.000006429006],"about_ca_topic_score_codex":0.0017461759,"about_ca_topic_score_gemma":0.0015661578,"teacher_disagreement_score":0.0017461759,"about_ca_system_score_codex":0.00041017815,"about_ca_system_score_gemma":0.000584945,"threshold_uncertainty_score":0.005271554},"labels":[],"label_agreement":null},{"id":"W1991796013","doi":"10.1109/tsp.2014.2329276","title":"A Distributed Reflector Localization Approach to Ultrasonic Array Imaging in Non-Destructive Testing Applications","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Geophysical Methods and Applications","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Nondestructive testing; Ultrasonic testing; Ultrasonic sensor; Acoustics; Reflector (photography); Sample (material); Acoustic emission; Point (geometry); Computer science; Optics; Mathematics; Geometry; Physics","score_opus":0.014986777182578747,"score_gpt":0.2568266291297981,"score_spread":0.24183985194721935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991796013","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008850456,0.00008152092,0.9987154,0.000028349114,0.0000074954373,0.0000056396875,0.000006864661,0.00008054951,0.00018913194],"genre_scores_gemma":[0.11902298,0.0009206885,0.8754494,0.00018291383,0.00010921524,0.00009982776,0.00013422484,0.0001486346,0.003932043],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99931514,0.00022502648,0.000026092364,0.0001759738,0.00022843938,0.00002934791],"domain_scores_gemma":[0.99941564,0.0002392877,0.000071315684,0.000107636246,0.00014700742,0.00001906632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005122764,0.0010103085,0.0005692865,0.0006110679,0.00016415447,0.0006030776,0.0013184174,0.0010616042,0.001171582],"category_scores_gemma":[0.0015285821,0.0003996291,0.00078677025,0.0007503858,0.0005158812,0.00128667,0.0007890249,0.00089170306,0.0009042318],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020528668,0.00018307501,0.0009283097,0.00040235062,0.00015637164,0.00034903028,0.00026152082,0.31943446,0.1999141,0.060564734,0.0024837367,0.4151169],"study_design_scores_gemma":[0.000012917061,0.000118091375,0.00020694753,0.000011820197,0.000024915178,0.00023996126,0.000020076768,0.97059244,0.017290637,0.0077507445,0.003703161,0.000028335417],"about_ca_topic_score_codex":0.00074210286,"about_ca_topic_score_gemma":0.0009483895,"teacher_disagreement_score":0.0013184174,"about_ca_system_score_codex":0.00039716254,"about_ca_system_score_gemma":0.0004256303,"threshold_uncertainty_score":0.003919363},"labels":[],"label_agreement":null},{"id":"W1994190919","doi":"10.1109/tsp.2012.2193577","title":"Blind Channel Estimation for Amplify-and-Forward Two-Way Relay Networks Employing $M$-PSK Modulation","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Modulation (music); Channel (broadcasting); Computer science; Phase-shift keying; Electronic engineering; Telecommunications; Bit error rate; Physics; Engineering; Acoustics","score_opus":0.06523552115367368,"score_gpt":0.3175493525100683,"score_spread":0.2523138313563946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994190919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03587199,0.00039692107,0.9625951,0.00014675022,0.000019038389,0.000026507007,0.00003063936,0.00017132737,0.0007417874],"genre_scores_gemma":[0.77036536,0.0009138203,0.2269498,0.00007803654,0.000051434778,0.00009191584,0.00007578904,0.000032729997,0.0014410825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926156,0.00038752257,0.000027534015,0.00009095029,0.00017702005,0.000055389028],"domain_scores_gemma":[0.9970642,0.002306883,0.00026477588,0.00012958693,0.00019374337,0.0000408522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016252433,0.0006226191,0.0007310208,0.0004499929,0.00042003332,0.0007769727,0.00048196065,0.0009744044,0.0005572376],"category_scores_gemma":[0.0071359174,0.00036206745,0.0003645197,0.0004780509,0.00089726964,0.0011287385,0.0008895861,0.0006108336,0.00020043881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017521488,0.00003151876,0.00066541537,0.00008927415,0.00003127479,0.00009031107,0.00008377474,0.9468367,0.0063364324,0.014382043,0.0004988809,0.030779148],"study_design_scores_gemma":[0.000007365869,0.000023952198,0.00009176992,0.000003060824,0.000004524036,0.000025737792,0.00000881126,0.9949228,0.001912653,0.0028661056,0.0001238611,0.000009367541],"about_ca_topic_score_codex":0.002139809,"about_ca_topic_score_gemma":0.0017810641,"teacher_disagreement_score":0.002139809,"about_ca_system_score_codex":0.0007160256,"about_ca_system_score_gemma":0.0010568937,"threshold_uncertainty_score":0.008595169},"labels":[],"label_agreement":null},{"id":"W1995499474","doi":"10.1109/tsp.2013.2287680","title":"Biosensor Arrays for Estimating Molecular Concentration in Fluid Flows","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Biosensing Techniques and Applications","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Biosensor; Ordinary differential equation; Partial differential equation; Nonlinear system; Divergence (linguistics); Biological system; Molecular biophysics; Flow (mathematics); Signal processing; Fluid dynamics; Differential equation; Applied mathematics; Mathematics; Computer science; Algorithm; Mathematical analysis; Chemistry; Mechanics; Physics; Materials science; Digital signal processing; Nanotechnology; Geometry","score_opus":0.013087741675339739,"score_gpt":0.2754743204720493,"score_spread":0.26238657879670957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995499474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008596015,0.00042240636,0.9898929,0.00009793795,0.000033773194,0.000019453997,0.000026488564,0.00041787713,0.0004930988],"genre_scores_gemma":[0.23833334,0.0007691576,0.7591184,0.00017006208,0.0000662061,0.00013105609,0.000105180356,0.000057125064,0.0012495356],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992631,0.0001902595,0.000027254313,0.00017361414,0.00031454794,0.00003114405],"domain_scores_gemma":[0.99936324,0.00036980474,0.000073093695,0.00005603369,0.00012213965,0.000015642585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068757526,0.000478828,0.00080203085,0.0005319047,0.00023912876,0.0005430026,0.0011144477,0.0013115923,0.0005295739],"category_scores_gemma":[0.0028445767,0.00043367117,0.0004001466,0.0004505543,0.00051379413,0.0010924882,0.0005813113,0.0008819241,0.00042387669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001832234,0.00017295044,0.001598962,0.00030175492,0.00008460049,0.00011843609,0.000117224175,0.293483,0.49258927,0.040709578,0.0011622317,0.16947873],"study_design_scores_gemma":[0.000008132878,0.000042909094,0.00025247395,0.00000900595,0.000010663696,0.000049548606,0.000006963183,0.9494794,0.04460684,0.0035987562,0.0019152398,0.000020009236],"about_ca_topic_score_codex":0.00094952056,"about_ca_topic_score_gemma":0.0008369727,"teacher_disagreement_score":0.0013115923,"about_ca_system_score_codex":0.00079320325,"about_ca_system_score_gemma":0.00038030668,"threshold_uncertainty_score":0.0057551265},"labels":[],"label_agreement":null},{"id":"W1996197208","doi":"10.1109/tsp.2012.2224344","title":"Quantization and Bit Allocation for Channel State Feedback in Relay-Assisted Wireless Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantization (signal processing); Channel state information; Computer science; Relay; Wireless network; Wireless; Channel (broadcasting); Node (physics); Computer network; Algorithm; Telecommunications; Engineering","score_opus":0.0494279372898304,"score_gpt":0.28544705479551574,"score_spread":0.23601911750568533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996197208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028986016,0.0017794635,0.9670483,0.00031389276,0.000044580425,0.00003573035,0.000039053946,0.00012651332,0.0016264372],"genre_scores_gemma":[0.896364,0.0013879574,0.10064317,0.00011645753,0.00006813898,0.00009567858,0.000035345853,0.000041182957,0.0012480791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984396,0.0008670767,0.000071711285,0.00014081529,0.00037806045,0.00010284489],"domain_scores_gemma":[0.996617,0.0025541654,0.00022759133,0.00028134807,0.00027415837,0.000045607732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021008223,0.0005878673,0.0007774286,0.0004366904,0.00044938203,0.0011512701,0.0007883969,0.0006918553,0.0010881014],"category_scores_gemma":[0.008567807,0.00032377124,0.000174855,0.0008366239,0.0014814918,0.0020469353,0.0007433794,0.000732346,0.00021021995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023870285,0.00003928624,0.0003811308,0.000102566955,0.00002200241,0.0000466577,0.00012548215,0.86488664,0.006026183,0.071374305,0.00068878883,0.05606826],"study_design_scores_gemma":[0.000015280402,0.000038760518,0.0000915917,0.0000131666775,0.000007175946,0.000022644606,0.000015084904,0.97177505,0.0023462898,0.025208201,0.0004542846,0.000012420723],"about_ca_topic_score_codex":0.0012932973,"about_ca_topic_score_gemma":0.0015496992,"teacher_disagreement_score":0.0021008223,"about_ca_system_score_codex":0.0011160313,"about_ca_system_score_gemma":0.0008618281,"threshold_uncertainty_score":0.011110365},"labels":[],"label_agreement":null},{"id":"W1997594669","doi":"10.1109/tsp.2013.2274277","title":"Joint Design of Multiple Non-Regenerative MIMO Relaying Matrices With Power Constraints","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"MIMO; Coordinate descent; Mathematical optimization; Constraint (computer-aided design); Relay; Mathematics; Power (physics); Transmitter power output; Computer science; Control theory (sociology); Algorithm; Beamforming; Telecommunications; Channel (broadcasting)","score_opus":0.045428124299153556,"score_gpt":0.25727279850732593,"score_spread":0.21184467420817238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997594669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013002684,0.00017073061,0.98476034,0.00008475839,0.000019638297,0.00004512165,0.000020340793,0.000091888534,0.001804607],"genre_scores_gemma":[0.6379394,0.00060822716,0.35690346,0.00013105653,0.00007133742,0.00021680597,0.00008612111,0.000048673137,0.0039948565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890447,0.00039174643,0.000067841094,0.00018988404,0.00033856157,0.00010745426],"domain_scores_gemma":[0.9980757,0.00092737225,0.00044227266,0.00013836872,0.0003589056,0.000057308862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012516839,0.0014638864,0.00088394404,0.0003850409,0.00032061175,0.001045124,0.0010685837,0.00080051215,0.001321646],"category_scores_gemma":[0.0035435506,0.0005740594,0.00051402336,0.00049129926,0.0006830078,0.0012750324,0.00081870164,0.0007290627,0.0005671178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019937329,0.00010601782,0.00050451624,0.00028808424,0.000087487686,0.00027134322,0.00024734018,0.82200104,0.03915975,0.044507757,0.0007515699,0.09187577],"study_design_scores_gemma":[0.000034951918,0.00021706085,0.00014031901,0.000020093876,0.000029833247,0.00012800717,0.000033336855,0.98022115,0.010782442,0.0070550577,0.0013143459,0.00002347228],"about_ca_topic_score_codex":0.00072267524,"about_ca_topic_score_gemma":0.0013024544,"teacher_disagreement_score":0.0014638864,"about_ca_system_score_codex":0.00049730594,"about_ca_system_score_gemma":0.0009691598,"threshold_uncertainty_score":0.0066196322},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020089791889867592,"score_gpt":0.2756101052116265,"score_spread":0.2555203133217589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998272579","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03007621,0.0004938317,0.9642933,0.0001452371,0.000082495,0.000064142965,0.000084622625,0.0010432339,0.0037169065],"genre_scores_gemma":[0.3286946,0.0009299312,0.6641073,0.0001250418,0.000101491154,0.00021793268,0.0005698728,0.00009103528,0.0051628295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977237,0.000023910356,0.000021535036,0.000033890126,0.00010934985,0.00003884444],"domain_scores_gemma":[0.9997603,0.00006187496,0.000027668135,0.00007017862,0.000066235065,0.000013662253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034732508,0.0004771934,0.00032987335,0.00053474336,0.00027963478,0.0005826931,0.0007413809,0.0005028112,0.003695607],"category_scores_gemma":[0.0009440603,0.00034469625,0.00032124537,0.0006048437,0.0002595811,0.0010815015,0.0005856828,0.000529645,0.0012210413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044065245,0.000119960816,0.0009177659,0.00027449668,0.00003298187,0.00025925972,0.00017976198,0.07369374,0.21518615,0.084850706,0.0072805523,0.61676395],"study_design_scores_gemma":[0.00015122327,0.00036989173,0.0016470823,0.000050305298,0.000042085718,0.0005365704,0.000054487584,0.8539807,0.082625054,0.028078146,0.03240773,0.000056776425],"about_ca_topic_score_codex":0.00055893074,"about_ca_topic_score_gemma":0.0013043432,"teacher_disagreement_score":0.003695607,"about_ca_system_score_codex":0.00031655308,"about_ca_system_score_gemma":0.0004745771,"threshold_uncertainty_score":0.012363017},"labels":[],"label_agreement":null},{"id":"W1998847100","doi":"10.1109/tsp.2014.2328328","title":"Closed-Form CRLBs for SNR Estimation From Turbo-Coded BPSK-, MSK-, and Square-QAM-Modulated Signals","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Algorithm; Phase-shift keying; Quadrature amplitude modulation; QAM; Turbo code; Coding gain; Decoding methods; Computer science; Mathematics; Statistics; Bit error rate","score_opus":0.01565282904163957,"score_gpt":0.26056424046846177,"score_spread":0.2449114114268222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998847100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003964892,0.001985087,0.9893868,0.000116880365,0.000059828304,0.00003771334,0.00014409568,0.0004038555,0.003900743],"genre_scores_gemma":[0.391258,0.009657384,0.5891366,0.00060131674,0.00035301124,0.00052950985,0.0010962986,0.0007884348,0.006579404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969969,0.00087097497,0.00021271431,0.00039669513,0.0012725705,0.00025023462],"domain_scores_gemma":[0.984516,0.011156839,0.00095060363,0.001051083,0.0022124213,0.000113069225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004199094,0.002143283,0.0011616771,0.0019363888,0.0005809568,0.002803892,0.0015329958,0.0014277087,0.004771136],"category_scores_gemma":[0.034012012,0.00070808385,0.0010574093,0.0014842213,0.0017817765,0.0025762757,0.0018270339,0.0023219094,0.0028074568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017863914,0.00007952498,0.00090086675,0.0011327247,0.0001252142,0.00019966702,0.0003259423,0.7601554,0.0128186755,0.10379689,0.004397897,0.11588856],"study_design_scores_gemma":[0.00001452887,0.00009618328,0.0005971219,0.00036972755,0.00005904503,0.0003907161,0.00009057574,0.9438989,0.015577719,0.03292255,0.005898864,0.00008411702],"about_ca_topic_score_codex":0.0027820955,"about_ca_topic_score_gemma":0.003726866,"teacher_disagreement_score":0.004771136,"about_ca_system_score_codex":0.0015221025,"about_ca_system_score_gemma":0.0021864406,"threshold_uncertainty_score":0.02220714},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011917448706200894,"score_gpt":0.23806689098664538,"score_spread":0.22614944228044448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998914394","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015539315,0.00029412503,0.98368603,0.000033757304,0.000015711512,0.00000531449,0.0000240522,0.0001491974,0.0002524752],"genre_scores_gemma":[0.7890091,0.0004141036,0.20883542,0.000073194984,0.000076131364,0.000052229345,0.00014805577,0.00007192968,0.0013198949],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995983,0.00007626082,0.000027521815,0.00012726919,0.000112033624,0.00005862229],"domain_scores_gemma":[0.99890804,0.00063156494,0.00016442825,0.00015600704,0.00011378918,0.000026113095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007059493,0.0004724798,0.00062265736,0.00050324295,0.00021562597,0.00072356453,0.00085980626,0.00061013625,0.00087946217],"category_scores_gemma":[0.0037775985,0.00022782228,0.0003565542,0.00045110416,0.00049952744,0.0015154516,0.0005486902,0.00071277947,0.0001988194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065445824,0.00017770982,0.003528247,0.00039338312,0.00017737864,0.0001412854,0.00017290768,0.41853663,0.04332808,0.09444535,0.0010940871,0.43735054],"study_design_scores_gemma":[0.000012873986,0.00010517652,0.00042663148,0.000013531458,0.000019555817,0.00005575574,0.000007805028,0.9763915,0.01155925,0.010846915,0.0005431607,0.000017908736],"about_ca_topic_score_codex":0.0008221427,"about_ca_topic_score_gemma":0.0009846068,"teacher_disagreement_score":0.00087946217,"about_ca_system_score_codex":0.00045224754,"about_ca_system_score_gemma":0.0004507375,"threshold_uncertainty_score":0.0037333965},"labels":[],"label_agreement":null},{"id":"W1999104815","doi":"10.1109/tsp.2015.2422675","title":"Subspace Leakage Analysis and Improved DOA Estimation With Small Sample Size","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Subspace topology; Covariance matrix; Algorithm; Signal subspace; Mathematics; Computer science; Resampling; Noise (video); Pattern recognition (psychology); Statistics; Artificial intelligence","score_opus":0.027144516678505686,"score_gpt":0.2648219987545098,"score_spread":0.23767748207600412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999104815","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004528689,0.00017719934,0.9944441,0.000055021734,0.000017308486,0.000009767765,0.000015429674,0.00019960637,0.0005529477],"genre_scores_gemma":[0.24057806,0.0007974419,0.7560917,0.00015182211,0.00014192531,0.000091660266,0.00016903965,0.00014111324,0.0018373026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881566,0.00038160066,0.000072101466,0.00018693351,0.0004759668,0.00006772944],"domain_scores_gemma":[0.99780315,0.0012315395,0.00022649641,0.00036310812,0.0003305601,0.000045196277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013474668,0.0009877217,0.00083265215,0.00080893113,0.00032820323,0.00067010906,0.00064040185,0.00068593345,0.0013523954],"category_scores_gemma":[0.0077172555,0.00041796494,0.00076322065,0.0011204756,0.00075858796,0.001965897,0.0011768944,0.000983225,0.00057965866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059018214,0.00011884789,0.0015805945,0.0003506157,0.00014298559,0.00026511156,0.00031174978,0.38715792,0.07884674,0.05899196,0.0021778187,0.46946552],"study_design_scores_gemma":[0.00001373209,0.000079778045,0.0005226868,0.000012437279,0.000020164203,0.00016452545,0.000015092715,0.9751457,0.013810741,0.008296617,0.0018909296,0.000027591152],"about_ca_topic_score_codex":0.00069367123,"about_ca_topic_score_gemma":0.0007873988,"teacher_disagreement_score":0.0013523954,"about_ca_system_score_codex":0.00037185522,"about_ca_system_score_gemma":0.00065920927,"threshold_uncertainty_score":0.0071261525},"labels":[],"label_agreement":null},{"id":"W2000415064","doi":"10.1109/tsp.2014.2364017","title":"Maximum Likelihood SNR Estimation of Linearly-Modulated Signals Over Time-Varying Flat-Fading SIMO Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"Canada Research Chairs","keywords":"Fading; Maximum likelihood; Mathematics; Signal-to-noise ratio (imaging); Signal processing; Maximum likelihood sequence estimation; Estimation theory; Algorithm; Control theory (sociology); Statistics; Speech recognition; Computer science; Telecommunications; Artificial intelligence; Radar; Decoding methods","score_opus":0.012202412262666117,"score_gpt":0.25312778250478407,"score_spread":0.24092537024211796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000415064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019275839,0.0003248185,0.97949815,0.0000636342,0.000010069036,0.00001032335,0.000037350583,0.00014130241,0.00063859863],"genre_scores_gemma":[0.7585458,0.0011586788,0.23742637,0.0000976558,0.00009079798,0.00006122829,0.00022463565,0.000088151326,0.0023066232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994331,0.0002169263,0.000029551804,0.000117627285,0.00015106768,0.0000516579],"domain_scores_gemma":[0.9988348,0.0007735171,0.00016684698,0.00008079743,0.0001206463,0.000023524157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008359115,0.0009461692,0.0008172765,0.00045175417,0.00016649124,0.00073264196,0.00053407735,0.00053405797,0.00055901275],"category_scores_gemma":[0.0041960306,0.0003785172,0.00037740686,0.0006116267,0.0006301813,0.0010644165,0.00085430493,0.00054879923,0.0003111802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002445579,0.00003240874,0.0021671525,0.00031140578,0.00009735887,0.0003636398,0.0001853105,0.83047533,0.027530322,0.019760352,0.0005753842,0.1182568],"study_design_scores_gemma":[0.00000696619,0.0000303743,0.0004160029,0.000012520859,0.000011682905,0.00008161122,0.00001790372,0.98788226,0.006055983,0.005072022,0.0003990194,0.000013655914],"about_ca_topic_score_codex":0.00060012325,"about_ca_topic_score_gemma":0.00067762454,"teacher_disagreement_score":0.0009461692,"about_ca_system_score_codex":0.0002934201,"about_ca_system_score_gemma":0.00050136994,"threshold_uncertainty_score":0.0044207573},"labels":[],"label_agreement":null},{"id":"W2000888362","doi":"10.1109/tsp.2013.2250967","title":"Social Sparsity! Neighborhood Systems Enrich Structured Shrinkage Operators","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Austrian Science Fund; Vienna Science and Technology Fund","keywords":"Lasso (programming language); Thresholding; Shrinkage; Domain (mathematical analysis); Computer science; Regular polygon; Flexibility (engineering); Algorithm; Artificial intelligence; Mathematics; Mathematical optimization; Theoretical computer science; Machine learning; Statistics; Image (mathematics)","score_opus":0.015626702202060767,"score_gpt":0.2266834711919013,"score_spread":0.21105676898984052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000888362","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10294576,0.0004977184,0.88073415,0.0014772189,0.00010053742,0.000038000457,0.00017775339,0.00013417631,0.013894702],"genre_scores_gemma":[0.9105863,0.0006510251,0.080411926,0.000265107,0.00022109303,0.00009491887,0.0001992852,0.00007383215,0.007496498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999469,0.00021421217,0.00001829452,0.00012394895,0.000121522804,0.00005301754],"domain_scores_gemma":[0.99842656,0.0006363229,0.000325907,0.00025741835,0.00022759788,0.000126269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000791857,0.0003600605,0.00051558844,0.00050168525,0.0005280521,0.0011566393,0.00051763473,0.0008482893,0.002693151],"category_scores_gemma":[0.0032472503,0.0002782086,0.00045375695,0.00035991397,0.0014213833,0.001854651,0.0015278071,0.0011104468,0.0004094199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000443223,0.00003098022,0.0013050253,0.00009779362,0.000034898334,0.00023533638,0.0003694045,0.054051135,0.0072872234,0.9064475,0.0026820304,0.02741431],"study_design_scores_gemma":[0.000020568115,0.00006989189,0.0013335649,0.000030690215,0.000016345402,0.00027844563,0.00023443191,0.3852602,0.0020162612,0.60246795,0.008241229,0.00003038423],"about_ca_topic_score_codex":0.0007629858,"about_ca_topic_score_gemma":0.0010277648,"teacher_disagreement_score":0.002693151,"about_ca_system_score_codex":0.00041988379,"about_ca_system_score_gemma":0.00041917033,"threshold_uncertainty_score":0.0090094805},"labels":[],"label_agreement":null},{"id":"W2001113354","doi":"10.1109/tsp.2014.2300039","title":"Distributed Source-Channel Coding Based on Real-Field BCH Codes","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Distributed source coding; Computer science; Algorithm; Variable-length code; Lossy compression; BCH code; Quantization (signal processing); Theoretical computer science; Context-adaptive binary arithmetic coding; Data compression; Artificial intelligence","score_opus":0.01589005229799,"score_gpt":0.25229554290327155,"score_spread":0.23640549060528154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001113354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009260067,0.00042521686,0.98452574,0.00021875047,0.00009518081,0.00013130494,0.0001772888,0.00046292038,0.0047035227],"genre_scores_gemma":[0.53140575,0.0009028681,0.45968372,0.00022079697,0.00014610458,0.0004322393,0.00035288403,0.00007281952,0.0067827567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999065,0.0002818334,0.000036507674,0.0001206909,0.0004271303,0.00006885449],"domain_scores_gemma":[0.9988147,0.0004468809,0.00011566424,0.00023839148,0.00034693166,0.00003752906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060874166,0.0007386133,0.00077320955,0.00068395917,0.000518553,0.0006686727,0.0011001623,0.00077283976,0.0022282137],"category_scores_gemma":[0.0024349354,0.00020845214,0.00033585166,0.0010085967,0.00085969275,0.0009059311,0.0010069497,0.0011834928,0.00096012873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031662913,0.000116235766,0.0003629809,0.0002872019,0.000059650727,0.00032880428,0.0001906061,0.55550146,0.0308007,0.23299058,0.0047219438,0.1743232],"study_design_scores_gemma":[0.000055544857,0.00008245034,0.00011365696,0.000026963628,0.000010540335,0.00018815741,0.000010846955,0.9534001,0.010391356,0.03161624,0.004073235,0.000030981657],"about_ca_topic_score_codex":0.0029907238,"about_ca_topic_score_gemma":0.0037272149,"teacher_disagreement_score":0.0029907238,"about_ca_system_score_codex":0.0010518057,"about_ca_system_score_gemma":0.0016077957,"threshold_uncertainty_score":0.0076313615},"labels":[],"label_agreement":null},{"id":"W2002260266","doi":"10.1109/tsp.2013.2274279","title":"Efficient Implementation of Broadband Beamformers Using Nested Hexagonal Arrays and Frustum Filters","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Frustum; Hexagonal crystal system; Broadband; Filter (signal processing); SIGNAL (programming language); Aperture (computer memory); Computer science; Acoustics; Mathematics; Physics; Telecommunications; Geometry","score_opus":0.018916945072152278,"score_gpt":0.2668833388811491,"score_spread":0.24796639380899685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002260266","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030494945,0.00007258047,0.9959157,0.000028093444,0.000020250587,0.000015514937,0.000017492559,0.00027823838,0.0006026599],"genre_scores_gemma":[0.077913016,0.0002288437,0.92010504,0.00006360695,0.00003578649,0.000078403034,0.00008582252,0.000043455795,0.0014460449],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995028,0.00016983766,0.00003078636,0.000056789944,0.00017147623,0.00006836835],"domain_scores_gemma":[0.999416,0.00022568194,0.00008612266,0.00006833732,0.00016858685,0.000035297104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048257664,0.0007412342,0.00057277444,0.0005056423,0.00021277349,0.0005288883,0.00064712623,0.0006823091,0.0023052567],"category_scores_gemma":[0.0013960141,0.0003930664,0.0005181928,0.0005990506,0.00028528093,0.00062314386,0.00054829917,0.00042159157,0.0015254653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052769156,0.000113973285,0.001044952,0.00020586983,0.0001227838,0.00028506355,0.00024798728,0.17931736,0.23082697,0.020588731,0.003411964,0.5633066],"study_design_scores_gemma":[0.00006983513,0.0003524812,0.0008060615,0.000032253713,0.000050483693,0.0004973044,0.00005982373,0.8987445,0.08001897,0.004675388,0.01463833,0.000054597862],"about_ca_topic_score_codex":0.0014340286,"about_ca_topic_score_gemma":0.0027297318,"teacher_disagreement_score":0.0023052567,"about_ca_system_score_codex":0.00031089046,"about_ca_system_score_gemma":0.00047912323,"threshold_uncertainty_score":0.0077118874},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.027815984159796678,"score_gpt":0.2785000692497842,"score_spread":0.2506840850899875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006682223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02105074,0.00023907433,0.9781808,0.000037964277,0.000012291507,0.000007714831,0.000016026243,0.00011001505,0.00034546223],"genre_scores_gemma":[0.8698362,0.0008006526,0.12796491,0.000046006182,0.000040957162,0.000046771518,0.000081621474,0.00003337564,0.0011495302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993905,0.00017821972,0.000033097815,0.00010204737,0.00024118072,0.000054981752],"domain_scores_gemma":[0.99912316,0.0005459169,0.000117132586,0.00007498445,0.00012196029,0.000016951306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000808545,0.0006495029,0.00062403356,0.00036034486,0.00024700293,0.0006179476,0.00032039967,0.0004942276,0.00024345303],"category_scores_gemma":[0.0033221436,0.00041433587,0.00030307047,0.00038805188,0.0004235949,0.0009661894,0.00064842886,0.0005374528,0.00012761004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010851605,0.000022730195,0.0018212133,0.00006476107,0.000041668787,0.0000916366,0.000057797894,0.8980663,0.012831838,0.008225543,0.00022817038,0.07843988],"study_design_scores_gemma":[0.0000052847754,0.000031950494,0.00059027947,0.000006194033,0.0000104713135,0.00004223865,0.000009179268,0.99206114,0.0045240605,0.0024345329,0.00027092575,0.000013806417],"about_ca_topic_score_codex":0.00220065,"about_ca_topic_score_gemma":0.0026378979,"teacher_disagreement_score":0.00220065,"about_ca_system_score_codex":0.00026753815,"about_ca_system_score_gemma":0.0006047048,"threshold_uncertainty_score":0.004375696},"labels":[],"label_agreement":null},{"id":"W2006910765","doi":"10.1109/tsp.2014.2360142","title":"Syntactic Models for Trajectory Constrained Track-Before-Detect","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Trajectory; Track-before-detect; Artificial intelligence; Markov chain; Synchronous context-free grammar; Context (archaeology); Hidden Markov model; Stochastic context-free grammar; Markov model; Markov process; Generalization; Range (aeronautics); Algorithm; Rule-based machine translation; Particle filter; Context-free grammar; Machine learning; Kalman filter; Mathematics","score_opus":0.023416904233549456,"score_gpt":0.24938967773593576,"score_spread":0.22597277350238631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006910765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073112366,0.00009257988,0.990209,0.00021216698,0.00004392923,0.000032640448,0.00018067376,0.00038899994,0.0015287268],"genre_scores_gemma":[0.61886406,0.0006126219,0.36842853,0.0004683818,0.00015662954,0.00050053484,0.0015742895,0.00053402473,0.008861021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991906,0.00016237017,0.000045252782,0.00020688766,0.0002985257,0.00009639189],"domain_scores_gemma":[0.9975228,0.0014007624,0.00030000586,0.000310418,0.00039672558,0.000069281115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013215899,0.00083457207,0.0011643586,0.0010118334,0.000861957,0.0013354612,0.0019113672,0.0017480396,0.0036765523],"category_scores_gemma":[0.0053832475,0.0007393281,0.0016117946,0.00096124545,0.0013748097,0.002797082,0.0015717519,0.0019063852,0.0010848623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009776018,0.000064875116,0.0014400244,0.000114359296,0.00006240466,0.0003782485,0.00022736708,0.6444311,0.004060668,0.29769352,0.0027140551,0.048715606],"study_design_scores_gemma":[0.000006348346,0.000011921747,0.00012108003,0.000004805644,0.000008859329,0.000031381445,0.00001201218,0.94621634,0.0005223462,0.05202966,0.0010231168,0.0000120827235],"about_ca_topic_score_codex":0.008749994,"about_ca_topic_score_gemma":0.008295571,"teacher_disagreement_score":0.008749994,"about_ca_system_score_codex":0.00136825,"about_ca_system_score_gemma":0.002399052,"threshold_uncertainty_score":0.017398119},"labels":[],"label_agreement":null},{"id":"W2015368492","doi":"10.1109/tsp.2012.2188715","title":"Convergence of Iterative Water-Filling With Quantized Feedback: A Sufficient Condition","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Quantization (signal processing); Convergence (economics); Iterative method; Mathematics; Control theory (sociology); Noise (video); Applied mathematics; Interference (communication); Mathematical optimization; Algorithm; Computer science; Telecommunications","score_opus":0.018863080646340256,"score_gpt":0.24769313417739264,"score_spread":0.22883005353105237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015368492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018131288,0.00029009028,0.9725079,0.0007159503,0.00008702235,0.00016295108,0.00014929009,0.00027272364,0.007682784],"genre_scores_gemma":[0.7860757,0.00089274347,0.20483962,0.0005162789,0.00016368245,0.0008705334,0.00038602468,0.00034334173,0.0059119766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974329,0.00086848787,0.00015611037,0.00045942742,0.00062173425,0.00046129286],"domain_scores_gemma":[0.9770091,0.016469121,0.0014013684,0.0006439692,0.003906534,0.00056988123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003978389,0.0016061708,0.0020691357,0.0009946494,0.0011491916,0.0018194399,0.0016366653,0.002330699,0.0062391064],"category_scores_gemma":[0.03945121,0.0006258693,0.0007864232,0.0007533212,0.0036710016,0.0042114924,0.0028851852,0.002433928,0.0010817245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003560215,0.00011107173,0.0012709013,0.0006816249,0.00008094816,0.0008964149,0.00086910615,0.41986278,0.012048228,0.53135383,0.005734654,0.026734361],"study_design_scores_gemma":[0.00005900616,0.00010071441,0.000101320955,0.00008765939,0.000010217441,0.00016221675,0.000100010446,0.9178885,0.0041085915,0.07572149,0.0016139267,0.00004630435],"about_ca_topic_score_codex":0.0025640067,"about_ca_topic_score_gemma":0.0014814966,"teacher_disagreement_score":0.0062391064,"about_ca_system_score_codex":0.0009912527,"about_ca_system_score_gemma":0.0033184874,"threshold_uncertainty_score":0.021039963},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.03821529687570775,"score_gpt":0.2553478968050691,"score_spread":0.21713259992936135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016819565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050137628,0.0004019095,0.9454564,0.00018432249,0.00003345723,0.00003090233,0.000038958173,0.0001441357,0.0035723124],"genre_scores_gemma":[0.8841071,0.0009959739,0.11200559,0.00011289841,0.00022073762,0.00009838444,0.00013869852,0.00007527213,0.0022454455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99871945,0.00031220354,0.00005736913,0.0001427387,0.0006404131,0.00012787465],"domain_scores_gemma":[0.99482626,0.0027959386,0.0008449822,0.0007023826,0.00072730257,0.00010315403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011955115,0.00076432916,0.00078565284,0.0011988041,0.00031850778,0.0010557616,0.000534157,0.00081889244,0.0012682708],"category_scores_gemma":[0.007789534,0.0002562516,0.00045227446,0.00086080015,0.0012012556,0.0017797379,0.0011797117,0.0011170524,0.000424357],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003300832,0.000099130964,0.0011442022,0.00019674072,0.000059308622,0.00043339215,0.00016005787,0.5079937,0.18157312,0.21304893,0.00089687284,0.094064444],"study_design_scores_gemma":[0.000010075887,0.00012225291,0.00021792775,0.000009620147,0.000010732642,0.00021464612,0.000012884761,0.9481653,0.025517628,0.024502223,0.0011894816,0.000027234591],"about_ca_topic_score_codex":0.00022493585,"about_ca_topic_score_gemma":0.00016699477,"teacher_disagreement_score":0.0012682708,"about_ca_system_score_codex":0.000539145,"about_ca_system_score_gemma":0.00043451614,"threshold_uncertainty_score":0.006322503},"labels":[],"label_agreement":null},{"id":"W2017693276","doi":"10.1109/tsp.2015.2403273","title":"A New Model for Array Spatial Signature for Two-Layer Imaging With Applications to Nondestructive Testing Using Ultrasonic Arrays","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Ultrasonics and Acoustic Wave Propagation","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Research and Development; Natural Sciences and Engineering Research Council of Canada; Bruce Power","keywords":"Beamforming; Nondestructive testing; Acoustics; Ultrasonic sensor; Transducer; Signature (topology); Computer science; Ultrasonic testing; Optics; Physics; Telecommunications","score_opus":0.03611784193716605,"score_gpt":0.2690755059910673,"score_spread":0.23295766405390123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017693276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026454283,0.00010210105,0.9951357,0.00011967563,0.000030313007,0.000020097428,0.000031735544,0.00011043745,0.0018044228],"genre_scores_gemma":[0.37364125,0.0013814669,0.5925062,0.00065058825,0.00018582196,0.00041524574,0.0004606547,0.00037680892,0.03038201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994673,0.000111248155,0.000027030932,0.00009514651,0.00025106696,0.000048255035],"domain_scores_gemma":[0.9992741,0.0002476937,0.00009709293,0.000076476674,0.0002655572,0.000039138475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005763021,0.0009541529,0.000575164,0.0007111056,0.00032768238,0.00111579,0.0015875817,0.0019741228,0.001992376],"category_scores_gemma":[0.0019574994,0.00045702283,0.0006974197,0.0008362668,0.0008272637,0.0027787043,0.0008380713,0.0012780214,0.0013054332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010142397,0.00008759475,0.0011312444,0.00017534789,0.00003865505,0.00045118606,0.00022388059,0.7753491,0.05417136,0.104772136,0.0023356609,0.061162435],"study_design_scores_gemma":[0.0000037537109,0.000017881177,0.0000663254,0.0000042440624,0.0000047942426,0.00008926957,0.000008300418,0.99149513,0.0023128514,0.0046628206,0.001324269,0.00001034296],"about_ca_topic_score_codex":0.0016501303,"about_ca_topic_score_gemma":0.0014644273,"teacher_disagreement_score":0.001992376,"about_ca_system_score_codex":0.00082172523,"about_ca_system_score_gemma":0.00094022654,"threshold_uncertainty_score":0.00666517},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Narrowband; Algorithm; Field (mathematics); Multiple signal classification; Computer science; Mathematics; Telecommunications","score_opus":0.02923972409227907,"score_gpt":0.26218649138815076,"score_spread":0.2329467672958717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019492706","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063501997,0.00013525579,0.9924872,0.00006542876,0.000018353667,0.000015744754,0.000011877682,0.00018228516,0.0007337509],"genre_scores_gemma":[0.13647617,0.00038174432,0.8610093,0.00007200548,0.00010104786,0.000081512255,0.000110723944,0.0000570126,0.0017104875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926394,0.00020571741,0.00003796483,0.00012409229,0.00030800162,0.000060157403],"domain_scores_gemma":[0.998939,0.0005895501,0.0001015851,0.00012640482,0.0002061526,0.000037417998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008893272,0.00089274056,0.00092618534,0.0009074698,0.00054031354,0.00071285927,0.0008449515,0.0009889252,0.0011336203],"category_scores_gemma":[0.0039522713,0.00026015245,0.0005360076,0.0009117485,0.0006894289,0.0012413084,0.0012009992,0.0006219776,0.0008368806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057449297,0.00009596795,0.0012111281,0.00020478106,0.0001252967,0.00031144932,0.00022105755,0.20507388,0.05069996,0.03148045,0.0020857528,0.7079158],"study_design_scores_gemma":[0.000040588235,0.00008619844,0.00025678892,0.000013343426,0.000015136587,0.000277987,0.000035877143,0.97572213,0.0117087355,0.010144732,0.0016812931,0.000017117847],"about_ca_topic_score_codex":0.000676592,"about_ca_topic_score_gemma":0.0012690605,"teacher_disagreement_score":0.0011336203,"about_ca_system_score_codex":0.00029170664,"about_ca_system_score_gemma":0.0008877842,"threshold_uncertainty_score":0.0047032833},"labels":[],"label_agreement":null},{"id":"W2020043054","doi":"10.1109/tsp.2012.2231678","title":"Improved Design Method for Nearly Linear-Phase IIR Filters Using Constrained Optimization","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stopband; Passband; Control theory (sociology); Infinite impulse response; Linear phase; 2D Filters; Mathematics; Ripple; Transition band; Prototype filter; Digital filter; Chebyshev filter; Attenuation; Filter design; Convex optimization; Filter (signal processing); Computer science; Band-pass filter; Electronic engineering; Regular polygon; Engineering","score_opus":0.09439101809114468,"score_gpt":0.3641566448939329,"score_spread":0.2697656268027882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020043054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006354907,0.000031355856,0.99885917,0.000010726749,0.000004764812,0.0000087202525,0.0000054251914,0.000053297324,0.00039103962],"genre_scores_gemma":[0.07841056,0.0002041091,0.9183774,0.00006945205,0.00002423078,0.00021574591,0.00007292978,0.00011000324,0.0025156531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999713,0.00007693083,0.000012710383,0.000043220018,0.00013668429,0.00001738533],"domain_scores_gemma":[0.99974173,0.00011805183,0.000034294288,0.00002117429,0.00007641067,0.000008292619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006209056,0.00087501865,0.00069797126,0.00044531134,0.0002626154,0.00055255526,0.00062545727,0.00067062845,0.002911828],"category_scores_gemma":[0.0009187756,0.0004772553,0.0005345999,0.00048039955,0.00036363184,0.0005111853,0.00046079647,0.0006911821,0.00074460456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010698951,0.00005346153,0.00027721803,0.0002566004,0.000077707315,0.000103881684,0.00014650868,0.7116349,0.05971167,0.047258865,0.0023824756,0.17798978],"study_design_scores_gemma":[0.000012096755,0.000028904398,0.000046317546,0.000007857632,0.0000070204,0.000030107887,0.0000040778473,0.9930334,0.0027116826,0.0018383446,0.0022710164,0.000009130378],"about_ca_topic_score_codex":0.0016522573,"about_ca_topic_score_gemma":0.0017074952,"teacher_disagreement_score":0.002911828,"about_ca_system_score_codex":0.00043217928,"about_ca_system_score_gemma":0.00069790805,"threshold_uncertainty_score":0.009741068},"labels":[],"label_agreement":null},{"id":"W2020869491","doi":"10.1109/tsp.2012.2197203","title":"Performance Tradeoffs in Amplify-and-Forward Bidirectional Network Beamforming","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Beamforming; Computer science; Transceiver; Quality of service; Transmitter power output; Relay; Channel (broadcasting); Power (physics); Power control; Signal-to-noise ratio (imaging); Computer network; Mathematical optimization; Transmitter; Telecommunications; Wireless; Mathematics","score_opus":0.04019692337185633,"score_gpt":0.27211098790002874,"score_spread":0.23191406452817243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020869491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37573007,0.0011436931,0.59413385,0.00049836,0.000036567995,0.00007927296,0.00009971307,0.0003511879,0.02792728],"genre_scores_gemma":[0.96966696,0.00039401153,0.028032525,0.000055571763,0.000010577279,0.00005191153,0.000032457785,0.000024310359,0.0017316382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988274,0.0005703235,0.000030779407,0.00007553369,0.000331002,0.00016503266],"domain_scores_gemma":[0.99620664,0.0029545238,0.00025669613,0.00014611424,0.000365589,0.000070388756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018648258,0.00067139236,0.00039128665,0.00038616094,0.0002722439,0.0010908819,0.00036201396,0.0008617464,0.0016783247],"category_scores_gemma":[0.006252051,0.0002480782,0.00018853678,0.0005333992,0.0006712317,0.0010999842,0.0007739058,0.0004496158,0.00034231582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005943361,0.00014323849,0.0022716161,0.00013678696,0.000051622585,0.00016462327,0.0002136583,0.8382755,0.041942228,0.03260283,0.0005807331,0.083022766],"study_design_scores_gemma":[0.000033463257,0.00039948823,0.00055998494,0.000019216037,0.000023107368,0.000119979704,0.00012407829,0.9721519,0.015185541,0.0108154835,0.0005423685,0.000025454468],"about_ca_topic_score_codex":0.0016529119,"about_ca_topic_score_gemma":0.00202252,"teacher_disagreement_score":0.0018648258,"about_ca_system_score_codex":0.0005866373,"about_ca_system_score_gemma":0.00058789505,"threshold_uncertainty_score":0.009862244},"labels":[],"label_agreement":null},{"id":"W2023182288","doi":"10.1109/tsp.2013.2253770","title":"On MMSE Vector-Perturbation Precoding for MIMO Broadcast Channels With Per-Antenna-Group Power Constraints","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Precoding; MIMO; Mathematics; Mean squared error; Control theory (sociology); Norm (philosophy); Minimum mean square error; Zero-forcing precoding; Algorithm; Topology (electrical circuits); Mathematical optimization; Computer science; Combinatorics; Statistics; Beamforming","score_opus":0.012695630205296266,"score_gpt":0.22029336462778817,"score_spread":0.2075977344224919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023182288","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00923216,0.0003307449,0.9884975,0.00014349203,0.000027312853,0.000014913121,0.000027499833,0.00008134112,0.0016451726],"genre_scores_gemma":[0.5073914,0.0018313958,0.4849151,0.00022060912,0.0001715162,0.00014011434,0.00019938263,0.00007892368,0.005051616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992811,0.00031982415,0.000023176206,0.000072768664,0.00025790368,0.000045137698],"domain_scores_gemma":[0.99877316,0.00084862346,0.00007618697,0.00009868565,0.00018048845,0.000022848091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096267747,0.00080281496,0.000774317,0.00033541984,0.0002319764,0.00051130616,0.0004414109,0.00060740806,0.0010810745],"category_scores_gemma":[0.0043238997,0.0002998661,0.00033713452,0.00077033864,0.0010606116,0.00088656734,0.0006384864,0.0008112426,0.0004104935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014436636,0.000027636619,0.00028290073,0.000112144255,0.000028328288,0.000085141306,0.00011090139,0.8822273,0.009233053,0.051859442,0.0015812244,0.05430761],"study_design_scores_gemma":[0.000007165233,0.000042609307,0.00006118818,0.000008491819,0.0000037877,0.00003078763,0.000008739865,0.99080116,0.002130635,0.006415347,0.00048365834,0.0000064340434],"about_ca_topic_score_codex":0.002223811,"about_ca_topic_score_gemma":0.001986077,"teacher_disagreement_score":0.002223811,"about_ca_system_score_codex":0.0005270475,"about_ca_system_score_gemma":0.00082988216,"threshold_uncertainty_score":0.0050911903},"labels":[],"label_agreement":null},{"id":"W2023294530","doi":"10.1109/tsp.2011.2170980","title":"Robust Set-Membership Affine-Projection Adaptive-Filtering Algorithm","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Algorithm; Adaptive filter; Convergence (economics); Projection (relational algebra); Noise (video); Computer science; Set (abstract data type); Dykstra's projection algorithm; Mathematics; Artificial intelligence; Image (mathematics)","score_opus":0.09887827882969115,"score_gpt":0.2508650564331503,"score_spread":0.1519867776034592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023294530","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022604037,0.000050637573,0.9968436,0.000029164916,0.000014973277,0.00001377548,0.0000100261095,0.00021356861,0.0005638644],"genre_scores_gemma":[0.23508042,0.00019300409,0.7597797,0.000112429676,0.00006812425,0.00015290057,0.00014913887,0.00007283339,0.004391425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925596,0.00013240158,0.000042974094,0.00015829268,0.00034503712,0.000065190834],"domain_scores_gemma":[0.99924564,0.00025813814,0.00007056108,0.00010231175,0.00029604774,0.000027435075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008564884,0.0005922486,0.0008924098,0.00047067006,0.00040996942,0.0009335251,0.0015609754,0.0010267862,0.0024587975],"category_scores_gemma":[0.0020721268,0.0002984631,0.000516978,0.0006362364,0.00051682274,0.00089158415,0.0009229858,0.0013162281,0.0009873529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019813131,0.00007333908,0.00054848,0.00011521374,0.00008752127,0.00009105218,0.00013204421,0.343362,0.021911852,0.020384269,0.0022947814,0.61080134],"study_design_scores_gemma":[0.00001021843,0.000030152738,0.0001391142,0.00000486242,0.000007104177,0.00004991308,0.000005032065,0.99223715,0.004129813,0.001933395,0.0014412311,0.000012075614],"about_ca_topic_score_codex":0.0017529941,"about_ca_topic_score_gemma":0.001197518,"teacher_disagreement_score":0.0024587975,"about_ca_system_score_codex":0.00044769872,"about_ca_system_score_gemma":0.0008315524,"threshold_uncertainty_score":0.00822556},"labels":[],"label_agreement":null},{"id":"W2025237502","doi":"10.1109/tsp.2013.2284762","title":"Permutation Meets Parallel Compressed Sensing: How to Relax Restricted Isometry Property for 2D Sparse Signals","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Restricted isometry property; Property (philosophy); Permutation (music); Isometry (Riemannian geometry); Compressed sensing; Computer science; Mathematics; Algorithm; Pure mathematics; Physics; Acoustics","score_opus":0.033834491518760404,"score_gpt":0.2478086902965299,"score_spread":0.21397419877776952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025237502","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005449349,0.000103545215,0.99238425,0.00025399434,0.000073265284,0.000044712426,0.000060501792,0.00013993296,0.0014905777],"genre_scores_gemma":[0.20010957,0.0010511901,0.7937771,0.000434984,0.00028010702,0.00021390262,0.0004132505,0.00016860137,0.0035512652],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999268,0.00020508611,0.000050735754,0.00011553026,0.0003013866,0.000059298458],"domain_scores_gemma":[0.9987025,0.0006003542,0.00008884591,0.00036354008,0.0001926195,0.00005211041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008812786,0.00085790805,0.0006608904,0.00045696186,0.00037658383,0.00083360594,0.0007530521,0.00087749,0.0036902325],"category_scores_gemma":[0.005196743,0.00035598833,0.00045780442,0.0009971191,0.0012013917,0.00274056,0.0012870296,0.0014145405,0.0009828832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057989237,0.000110263536,0.0009765114,0.00039517423,0.000054373464,0.0006531014,0.00026280948,0.20570956,0.077234805,0.2651424,0.007490076,0.44139105],"study_design_scores_gemma":[0.000045052213,0.00019205282,0.00027528248,0.000024919971,0.000015118258,0.00058555265,0.00005339557,0.8705802,0.02373475,0.09344965,0.01099126,0.000052694082],"about_ca_topic_score_codex":0.0014406864,"about_ca_topic_score_gemma":0.0013109341,"teacher_disagreement_score":0.0036902325,"about_ca_system_score_codex":0.00032136668,"about_ca_system_score_gemma":0.0011305016,"threshold_uncertainty_score":0.012345076},"labels":[],"label_agreement":null},{"id":"W2026900765","doi":"10.1109/tsp.2009.2020021","title":"A Signal Perturbation Free Whitening-Rotation-Based Semiblind Approach for MIMO Channel Estimation","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"MIMO; Algorithm; Channel (broadcasting); Computer science; Mean squared error; Mathematics; Eigendecomposition of a matrix; Eigenvalues and eigenvectors; Statistics; Telecommunications; Physics","score_opus":0.021649581842276076,"score_gpt":0.2613303738976893,"score_spread":0.23968079205541323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026900765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017813452,0.00006585537,0.9975419,0.00002913529,0.000019715277,0.000013852051,0.0000119935075,0.0001535125,0.00038266552],"genre_scores_gemma":[0.14686008,0.0004217582,0.84810054,0.00015499776,0.00014311387,0.00011049147,0.00016428427,0.00009384518,0.0039508524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992224,0.00027520428,0.000034721816,0.000114436465,0.0003093662,0.000043900687],"domain_scores_gemma":[0.9993494,0.00025229692,0.00008657757,0.00012334538,0.00016346032,0.000024920431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000661752,0.00088605774,0.00060911826,0.00048392286,0.00036282314,0.0006473557,0.0007232891,0.00066346495,0.0021546583],"category_scores_gemma":[0.0016101119,0.00032418757,0.00053331524,0.0006355307,0.00068381574,0.0011075737,0.0009659013,0.000820862,0.001115181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046906393,0.0001864165,0.0004953507,0.0002582061,0.00013322434,0.00019560817,0.00021733753,0.3563016,0.16140765,0.03286682,0.0045056622,0.4429631],"study_design_scores_gemma":[0.000009321395,0.000076459226,0.00015830366,0.000007065933,0.000010971718,0.00011122419,0.00001012857,0.97753614,0.01784336,0.0026098394,0.0016030081,0.0000241345],"about_ca_topic_score_codex":0.00067010877,"about_ca_topic_score_gemma":0.001519535,"teacher_disagreement_score":0.0021546583,"about_ca_system_score_codex":0.00033885456,"about_ca_system_score_gemma":0.00060823996,"threshold_uncertainty_score":0.0072079897},"labels":[],"label_agreement":null},{"id":"W2028600906","doi":"10.1109/tsp.2012.2208960","title":"A Closed-Form Power Allocation and Signal Alignment for a Diagonalized MIMO Two-Way Relay Channel With Linear Receivers","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Precoding; Relay; Computer science; MIMO; Channel state information; Channel (broadcasting); Computational complexity theory; Node (physics); Relay channel; Algorithm; Power (physics); Topology (electrical circuits); Mathematics; Wireless; Telecommunications","score_opus":0.035308565902751735,"score_gpt":0.2824881752021955,"score_spread":0.24717960929944377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028600906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003472323,0.00012603158,0.99480283,0.000072499635,0.000021071855,0.000037499103,0.00004187746,0.00015802536,0.0012678872],"genre_scores_gemma":[0.45495236,0.0006564153,0.5398864,0.00019518593,0.000076861485,0.00028132694,0.00021977388,0.00006825583,0.0036633455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868864,0.0004821659,0.00005911596,0.00027748596,0.00036362276,0.00012896459],"domain_scores_gemma":[0.9989778,0.00047008423,0.00015001235,0.00013228359,0.0002397433,0.000030150735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011647663,0.0012584889,0.00088779733,0.00040012982,0.00053551554,0.0015073365,0.0010860767,0.0010006131,0.00280057],"category_scores_gemma":[0.0021387863,0.00051303214,0.0005343568,0.00094963005,0.0009630361,0.0012593229,0.0010254654,0.0012703314,0.0010960496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001701087,0.00016865217,0.0004894834,0.00032338488,0.000079801066,0.00033516122,0.00023927483,0.73695064,0.031499993,0.08708627,0.00452783,0.13812943],"study_design_scores_gemma":[0.000030292693,0.00010873575,0.00007727406,0.000013657476,0.000016972594,0.00016873381,0.000028076582,0.9875723,0.0043056076,0.0061759385,0.0014797245,0.000022674616],"about_ca_topic_score_codex":0.0017539582,"about_ca_topic_score_gemma":0.0032294593,"teacher_disagreement_score":0.00280057,"about_ca_system_score_codex":0.0008247253,"about_ca_system_score_gemma":0.0019942399,"threshold_uncertainty_score":0.0093688965},"labels":[],"label_agreement":null},{"id":"W2030053411","doi":"10.1109/tsp.2012.2212890","title":"Beamforming in Non-Regenerative MIMO Broadcast Relay Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Beamforming; Relay; MIMO; Computer science; Precoding; Linear network coding; Relay channel; Base station; Antenna (radio); Algorithm; Topology (electrical circuits); Computer network; Telecommunications; Mathematics","score_opus":0.03426371818376893,"score_gpt":0.2818749132106069,"score_spread":0.24761119502683798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030053411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023137644,0.0014103493,0.9696255,0.00022670352,0.000053453914,0.000024248955,0.00006620422,0.00018603414,0.0052698185],"genre_scores_gemma":[0.9153406,0.002804902,0.073121265,0.00018283995,0.0001359538,0.00011414727,0.00012041106,0.000044456217,0.008135311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947804,0.0002375584,0.000016082491,0.0000614006,0.00013938261,0.00006757841],"domain_scores_gemma":[0.9993254,0.00044358216,0.0000735403,0.000039832226,0.000096742704,0.00002099327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006982573,0.0005658231,0.0006259248,0.00030917316,0.00030128084,0.00068175205,0.0005577328,0.00070065906,0.0012374158],"category_scores_gemma":[0.0014135736,0.0003869488,0.0003214531,0.0007542652,0.0007753758,0.0007811811,0.00044354537,0.00048489464,0.0005220571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014914385,0.000028489829,0.00039116162,0.00022267958,0.00004043279,0.0002593016,0.0001466456,0.8764857,0.015966792,0.06886579,0.0013135521,0.03613038],"study_design_scores_gemma":[0.000019036499,0.000073595686,0.00018577556,0.000013742896,0.000017396174,0.00009059972,0.00003438948,0.9810079,0.002056754,0.0152067635,0.0012793014,0.00001480425],"about_ca_topic_score_codex":0.0020858708,"about_ca_topic_score_gemma":0.0023162246,"teacher_disagreement_score":0.0020858708,"about_ca_system_score_codex":0.0007290763,"about_ca_system_score_gemma":0.00046403919,"threshold_uncertainty_score":0.005289793},"labels":[],"label_agreement":null},{"id":"W2031198609","doi":"10.1109/tsp.2008.926687","title":"Amendments to “Performance Analysis of Estimation Algorithms of Nonstationary ARMA Processes” [Mar 06 1041-1053]","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Control Systems and Identification","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Saskatchewan","funders":"","keywords":"Emphasis (telecommunications); Signal processing; Algorithm; Mathematics; Computer science; Applied mathematics; Speech recognition; Telecommunications","score_opus":0.01770035860220715,"score_gpt":0.23933273291018392,"score_spread":0.22163237430797678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031198609","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074457396,0.0035164964,0.43768662,0.039129578,0.10768296,0.0032095376,0.020661928,0.015808094,0.36485904],"genre_scores_gemma":[0.118654266,0.0039465106,0.2930164,0.06348169,0.05621991,0.005955965,0.022628872,0.00653171,0.42956465],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9860951,0.0045304056,0.0017002895,0.001334584,0.005395713,0.00094397494],"domain_scores_gemma":[0.9557546,0.014210561,0.002082388,0.006953467,0.020430157,0.00056892895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013549869,0.0020554594,0.001430692,0.0027644208,0.003275012,0.0043588895,0.0059722965,0.009009183,0.04068842],"category_scores_gemma":[0.05761308,0.0016824972,0.0027165415,0.0021523056,0.0027746838,0.00263022,0.0022120527,0.0099307485,0.046721887],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055797497,0.00025111553,0.00039890705,0.00038281237,0.000084302534,0.00048812883,0.0003465206,0.0047373394,0.0038787785,0.090977065,0.8575745,0.040322445],"study_design_scores_gemma":[0.0002886071,0.00037099927,0.0037341334,0.00038196708,0.00015523579,0.0004076888,0.00009205709,0.015336888,0.0072703282,0.035266247,0.9364164,0.00027950198],"about_ca_topic_score_codex":0.019965755,"about_ca_topic_score_gemma":0.018368222,"teacher_disagreement_score":0.04068842,"about_ca_system_score_codex":0.004050166,"about_ca_system_score_gemma":0.0058603277,"threshold_uncertainty_score":0.13611633},"labels":[],"label_agreement":null},{"id":"W2032161112","doi":"10.1109/tsp.2013.2239992","title":"Multiscale Gossip for Efficient Decentralized Averaging in Wireless Packet Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Kempe Foundation","keywords":"Gossip; Computer science; Hierarchy; Key (lock); Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.015813264038462612,"score_gpt":0.2439209205638457,"score_spread":0.2281076565253831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032161112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016532393,0.00037226875,0.9805242,0.00019815518,0.000051914572,0.000036010075,0.00003789757,0.00041543008,0.0018317509],"genre_scores_gemma":[0.8034155,0.0005946799,0.19357677,0.00014480259,0.00015851228,0.00020196779,0.00013534787,0.00011534741,0.0016571241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992818,0.00020163819,0.00003891019,0.00009992731,0.0003120768,0.00006558588],"domain_scores_gemma":[0.9990495,0.00052102894,0.00011851722,0.00014656418,0.00011682197,0.00004761743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010882891,0.0005027796,0.00069220876,0.0006234052,0.00051889516,0.0006227835,0.0009833284,0.00056524767,0.00090320065],"category_scores_gemma":[0.0038742903,0.0002758216,0.00053085247,0.0006173404,0.0008618096,0.001300309,0.0010132544,0.00074774603,0.00022211946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011411736,0.00003571518,0.000698768,0.00014655894,0.00008188895,0.00014639579,0.00015032581,0.8030693,0.012122659,0.13188332,0.00243353,0.049117398],"study_design_scores_gemma":[0.000007865453,0.000021404818,0.000074689204,0.0000022879995,0.000006129799,0.000010869624,0.000005841135,0.9829639,0.00054664665,0.015675116,0.0006812172,0.0000040283944],"about_ca_topic_score_codex":0.0019078444,"about_ca_topic_score_gemma":0.0018832136,"teacher_disagreement_score":0.0019078444,"about_ca_system_score_codex":0.00071843294,"about_ca_system_score_gemma":0.0006844185,"threshold_uncertainty_score":0.005755484},"labels":[],"label_agreement":null},{"id":"W2032278718","doi":"10.1109/tsp.2011.2172433","title":"Joint Secure Beamforming Design at the Source and the Relay for an Amplify-and-Forward MIMO Untrusted Relay System","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":246,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Beamforming; Computer science; MIMO; Relay channel; Computer network; Secrecy; Artificial noise; Signal-to-noise ratio (imaging); Telecommunications; Computer security; Transmitter; Channel (broadcasting); Power (physics)","score_opus":0.04682904883414673,"score_gpt":0.23638887290567748,"score_spread":0.18955982407153074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032278718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02866435,0.00037189637,0.9673579,0.00023664704,0.000032211585,0.000055860073,0.000041840536,0.00008572537,0.0031535402],"genre_scores_gemma":[0.9333217,0.0007550523,0.06298275,0.00005983856,0.000041540494,0.00012811077,0.000038343638,0.000013468898,0.0026590936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990994,0.00037904552,0.000050988325,0.00011066236,0.0002636122,0.00009641452],"domain_scores_gemma":[0.99880683,0.0005084993,0.00026116587,0.000089459725,0.00028060324,0.000053508633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016862047,0.0010804979,0.00091153575,0.00035134947,0.00047361045,0.0012148254,0.00072323566,0.0011033576,0.0018684169],"category_scores_gemma":[0.0020859176,0.0005031809,0.00053280464,0.0005537735,0.0012278588,0.0011243584,0.0008949434,0.00064040365,0.00058518315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018245957,0.000029805939,0.00045304568,0.00014552023,0.00006151967,0.00034496692,0.00016073218,0.9240106,0.015550264,0.044902172,0.000449448,0.013709437],"study_design_scores_gemma":[0.00002679763,0.00008686805,0.00008227161,0.000007863679,0.000020964928,0.00004814336,0.000024205392,0.9935737,0.0017073855,0.004186505,0.00022282696,0.000012358355],"about_ca_topic_score_codex":0.0016473652,"about_ca_topic_score_gemma":0.0017261411,"teacher_disagreement_score":0.0018684169,"about_ca_system_score_codex":0.0007577004,"about_ca_system_score_gemma":0.001072603,"threshold_uncertainty_score":0.00891757},"labels":[],"label_agreement":null},{"id":"W2033599745","doi":"10.1109/tsp.2010.2094193","title":"On the Energy Efficiency of LT Codes in Proactive Wireless Sensor Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Defence Research and Development Canada","funders":"","keywords":"Frequency-shift keying; Computer science; Wireless sensor network; Keying; Code rate; Electronic engineering; Efficient energy use; Spectral efficiency; Fading; Real-time computing; Channel (broadcasting); Algorithm; Telecommunications; Computer network; Engineering; Decoding methods; Demodulation; Electrical engineering","score_opus":0.023769246292815443,"score_gpt":0.2565869090159476,"score_spread":0.23281766272313217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033599745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.160278,0.0054597566,0.8197005,0.0005370153,0.00007323687,0.000055775054,0.00008370033,0.00019147799,0.013620446],"genre_scores_gemma":[0.9590316,0.0021348803,0.035693713,0.000110443965,0.000059778282,0.000051645453,0.000067608074,0.00006984698,0.0027804894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990245,0.000345715,0.000035283818,0.000087683125,0.0003826968,0.00012420153],"domain_scores_gemma":[0.99595743,0.0032803414,0.00019145323,0.00026540173,0.00027456495,0.000030622934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001361444,0.0006439003,0.00044264953,0.00070041534,0.00038183827,0.00073856936,0.00064582593,0.00047571506,0.0011623091],"category_scores_gemma":[0.007338015,0.00022759498,0.00028198783,0.0008355646,0.0010562807,0.0018267541,0.0006874357,0.00049112836,0.0002544345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015407756,0.000048305195,0.0012083811,0.00016006213,0.00004372526,0.0000759633,0.000112384725,0.8580167,0.013160458,0.07224232,0.00046009396,0.054317642],"study_design_scores_gemma":[0.000006639829,0.00011037607,0.0006013679,0.000034594945,0.000016146538,0.00010756667,0.000048961574,0.9702931,0.007549734,0.020100988,0.0011149879,0.000015490374],"about_ca_topic_score_codex":0.0012167583,"about_ca_topic_score_gemma":0.0011346093,"teacher_disagreement_score":0.001361444,"about_ca_system_score_codex":0.0009997088,"about_ca_system_score_gemma":0.0004738593,"threshold_uncertainty_score":0.0072534084},"labels":[],"label_agreement":null},{"id":"W2035421991","doi":"10.1109/tsp.2013.2274278","title":"Tracking Performance of MIMO Radar for Accelerating Targets","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Radar Systems and Signal Processing","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; MIMO; Radar; Doppler effect; Continuous-wave radar; Low probability of intercept radar; Pulse-Doppler radar; Compensation (psychology); Doppler radar; Radar tracker; Motion compensation; Control theory (sociology); Electronic engineering; Real-time computing; Radar imaging; Algorithm; Telecommunications; Engineering; Physics; Artificial intelligence; Beamforming","score_opus":0.023136721060150214,"score_gpt":0.22950717855027816,"score_spread":0.20637045749012795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035421991","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6999181,0.0010434294,0.290848,0.00016446575,0.000083148785,0.00002416857,0.000070406866,0.000606887,0.007241354],"genre_scores_gemma":[0.9855692,0.00018146569,0.013329167,0.000032540684,0.000010975807,0.0000057203915,0.000042644806,0.000009145607,0.00081928016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961495,0.00006449169,0.00001421359,0.000054307337,0.00019180462,0.000060235605],"domain_scores_gemma":[0.9987184,0.00056229305,0.00015828571,0.00011068179,0.00040465585,0.000045617242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008017428,0.00028857397,0.0003234442,0.00026693635,0.00018636149,0.00038465476,0.00023783157,0.00040344,0.00050553295],"category_scores_gemma":[0.0022172027,0.00012653574,0.0001882038,0.0002540195,0.00013582765,0.00032492832,0.00028577284,0.00025563812,0.00026424264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095425756,0.00010540313,0.009904745,0.00014803564,0.00008544929,0.00018801361,0.0001782265,0.6141982,0.21792226,0.0040442934,0.0009023178,0.15136874],"study_design_scores_gemma":[0.000018647344,0.00041683472,0.004830012,0.00000979252,0.000027956588,0.000147029,0.000022083701,0.9526555,0.040886823,0.00053903897,0.00042374994,0.000022424581],"about_ca_topic_score_codex":0.001317405,"about_ca_topic_score_gemma":0.0010630251,"teacher_disagreement_score":0.001317405,"about_ca_system_score_codex":0.0002918989,"about_ca_system_score_gemma":0.0003821846,"threshold_uncertainty_score":0.0042400956},"labels":[],"label_agreement":null},{"id":"W2038870549","doi":"10.1109/tsp.2009.2013896","title":"Filter Banks for Prediction-Compensated Multiple Description Coding","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Filter bank; Biorthogonal system; Algorithm; Computer science; Multiple description coding; Filter (signal processing); Sub-band coding; Coding (social sciences); Filter design; Transform coding; JPEG; Coding gain; Data compression; Theoretical computer science; Mathematics; Decoding methods; Artificial intelligence; Image (mathematics); Computer vision; Discrete cosine transform; Statistics; Wavelet transform; Wavelet","score_opus":0.040095522208420345,"score_gpt":0.2783958263703622,"score_spread":0.23830030416194187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038870549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004903534,0.00044847306,0.993393,0.000094524985,0.00004097945,0.000022643673,0.000033501456,0.0001282937,0.0009350498],"genre_scores_gemma":[0.2477079,0.00097066106,0.7472191,0.00018959263,0.00010027274,0.00014057172,0.00024359295,0.000038862854,0.0033894167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963653,0.00008787702,0.000020152029,0.000055972894,0.00017035048,0.000029008517],"domain_scores_gemma":[0.9995828,0.00017273496,0.000038556533,0.00007886518,0.00011549263,0.000011481072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005446426,0.00040872867,0.0003147886,0.00039497303,0.00023660346,0.0004652687,0.0005646252,0.0007099007,0.0019837315],"category_scores_gemma":[0.0011715685,0.00020146043,0.00029783664,0.00047069023,0.00036877365,0.00081513874,0.0003738972,0.0006802804,0.0005808654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034566058,0.00007379118,0.0005839232,0.00024157178,0.000054038817,0.00023993087,0.000114640774,0.15767057,0.08272781,0.16343778,0.005513891,0.5889963],"study_design_scores_gemma":[0.000032939854,0.00010072263,0.0002615089,0.00003583244,0.000026136539,0.00022265222,0.000018905486,0.9440214,0.027061196,0.017189698,0.010998622,0.00003038636],"about_ca_topic_score_codex":0.0013181764,"about_ca_topic_score_gemma":0.0016477917,"teacher_disagreement_score":0.0019837315,"about_ca_system_score_codex":0.00053376687,"about_ca_system_score_gemma":0.00065119157,"threshold_uncertainty_score":0.006636262},"labels":[],"label_agreement":null},{"id":"W2040049609","doi":"10.1109/tsp.2015.2420536","title":"A Novel Statistical Model for Distributed Estimation in Wireless Sensor Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Fusion center; Wireless sensor network; Computer science; Estimator; Probability density function; Mathematical optimization; Scheduling (production processes); Mean squared error; Convex optimization; Quantization (signal processing); Imperfect; Wireless; Algorithm; Upper and lower bounds; Regular polygon; Mathematics; Cognitive radio; Statistics; Telecommunications","score_opus":0.0398224234741802,"score_gpt":0.27924564545023955,"score_spread":0.23942322197605936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040049609","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082590367,0.00015063905,0.9984982,0.00011107544,0.00003053308,0.000012697202,0.00003767776,0.000055451903,0.00027782068],"genre_scores_gemma":[0.5252902,0.0051212376,0.45725915,0.0008364385,0.0011610251,0.00090033386,0.00091093284,0.00028372376,0.008237052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656737,0.0010983729,0.000197079,0.0007689803,0.0011832751,0.00018487006],"domain_scores_gemma":[0.99465996,0.003308814,0.00065114995,0.0006516876,0.0006547292,0.000073527335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033598773,0.0013897669,0.0014338591,0.001208045,0.0004921927,0.0015957261,0.0028856955,0.0015623634,0.001247334],"category_scores_gemma":[0.011198879,0.0007744653,0.0011856722,0.0023931684,0.0016173819,0.0042946427,0.0015218541,0.0025074077,0.0006682064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035603432,0.000042018884,0.0007971175,0.00014966108,0.00007089784,0.00016446588,0.00009155171,0.7588247,0.0029889003,0.2006358,0.0017932724,0.034406066],"study_design_scores_gemma":[0.000004577968,0.000021317474,0.00012016843,0.000007930306,0.0000104810315,0.00006189582,0.000008147229,0.97156256,0.00038895625,0.026504632,0.0012973186,0.000012107829],"about_ca_topic_score_codex":0.0022206255,"about_ca_topic_score_gemma":0.0018508496,"teacher_disagreement_score":0.0033598773,"about_ca_system_score_codex":0.0011663873,"about_ca_system_score_gemma":0.001258788,"threshold_uncertainty_score":0.01776898},"labels":[],"label_agreement":null},{"id":"W2046339991","doi":"10.1109/78.852024","title":"An equality test for variances of two complex correlated Gaussian processes","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Covariance; Mathematics; Nuisance parameter; Gaussian; Variance (accounting); Analysis of covariance; Gaussian process; Statistics; Nuisance; Test (biology); Applied mathematics; Econometrics","score_opus":0.18025413869103102,"score_gpt":0.4507646906257258,"score_spread":0.27051055193469475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046339991","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01650987,0.00017071611,0.98026377,0.00018362317,0.00013477018,0.000077827055,0.00017388177,0.0003407805,0.0021448354],"genre_scores_gemma":[0.58411497,0.0004447597,0.4067911,0.0005954256,0.0008038664,0.00076449866,0.002358492,0.00035464377,0.0037721815],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9795815,0.009252863,0.0011561821,0.003504511,0.0056053866,0.0008995185],"domain_scores_gemma":[0.8483032,0.13341154,0.003700876,0.0047508655,0.008016073,0.0018174589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013154031,0.0012261671,0.0020631815,0.0039283126,0.0011370585,0.0021923054,0.0023304382,0.002905823,0.004781272],"category_scores_gemma":[0.09616887,0.0006568031,0.0014201372,0.0021393867,0.0037156965,0.0039867642,0.0046456656,0.0039532627,0.0019358074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028386372,0.00081015815,0.04695567,0.0005938537,0.0011219241,0.002212586,0.000705866,0.101707086,0.040742442,0.35057324,0.008325707,0.44341284],"study_design_scores_gemma":[0.00054955494,0.0021322363,0.025710128,0.00021510692,0.00027952227,0.003379244,0.0004906892,0.72213817,0.031884916,0.2008307,0.012023828,0.0003659078],"about_ca_topic_score_codex":0.00066944526,"about_ca_topic_score_gemma":0.0003652401,"teacher_disagreement_score":0.013154031,"about_ca_system_score_codex":0.0007274457,"about_ca_system_score_gemma":0.0019764542,"threshold_uncertainty_score":0.06956601},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.020545072204667482,"score_gpt":0.24106871035313104,"score_spread":0.22052363814846357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048185597","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015470765,0.000059241902,0.9978523,0.00001980098,0.0000074928316,0.000010658748,0.000010907498,0.000061529136,0.00043095456],"genre_scores_gemma":[0.18409985,0.00040903088,0.8132244,0.00015867723,0.00005769478,0.00022283354,0.00013276932,0.00008261291,0.0016120847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993272,0.00025120948,0.000032095155,0.00010512062,0.00024644556,0.000038026374],"domain_scores_gemma":[0.99928975,0.00034185918,0.000106450134,0.00009243644,0.00014385323,0.000025552565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006437638,0.0007881491,0.0006414937,0.00038347216,0.0002740541,0.0006616063,0.000557146,0.000516594,0.0017928666],"category_scores_gemma":[0.0017855588,0.0004807202,0.0005121026,0.0005774857,0.00045149738,0.0007858872,0.0008718207,0.00070263597,0.0007698253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023582204,0.00011852688,0.0007550185,0.00029395302,0.000097004966,0.000112880385,0.00018356716,0.6206774,0.055373773,0.031015087,0.0024333207,0.2887036],"study_design_scores_gemma":[0.000026695807,0.00014250782,0.00017037179,0.000016133821,0.000016040129,0.00009691091,0.000021534102,0.9837399,0.007839229,0.0045918683,0.0033216497,0.000017061573],"about_ca_topic_score_codex":0.0005224997,"about_ca_topic_score_gemma":0.0008778258,"teacher_disagreement_score":0.0017928666,"about_ca_system_score_codex":0.0002631525,"about_ca_system_score_gemma":0.0006694503,"threshold_uncertainty_score":0.005997777},"labels":[],"label_agreement":null},{"id":"W2048198391","doi":"10.1109/tsp.2012.2222402","title":"A Maximum Likelihood Time Delay Estimator in a Multipath Environment Using Importance Sampling","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Multipath propagation; Estimator; Algorithm; Computer science; Initialization; Mathematical optimization; Estimation theory; Dimension (graph theory); Iterative method; Convergence (economics); Maximization; Computational complexity theory; Mathematics; Expectation–maximization algorithm; Maximum likelihood; Statistics","score_opus":0.020923431025993595,"score_gpt":0.2396263874622118,"score_spread":0.2187029564362182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048198391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023242675,0.00005715623,0.99736077,0.00002198397,0.0000106340085,0.000006373487,0.0000063946195,0.00006520982,0.00014715876],"genre_scores_gemma":[0.14327678,0.00030614177,0.854675,0.00005474584,0.000102255486,0.00006374469,0.00012171522,0.00007585443,0.0013237804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994992,0.0001476081,0.000018849505,0.00007424926,0.00023052967,0.000029577499],"domain_scores_gemma":[0.9988431,0.00075618847,0.00008843478,0.00008490597,0.00018831789,0.00003901295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008880863,0.00053159986,0.0006555839,0.0005642347,0.00020302799,0.0005577488,0.00077573024,0.00065922126,0.0008245387],"category_scores_gemma":[0.004769465,0.00035750124,0.00041049192,0.0007611963,0.0004753411,0.0012944161,0.00088909554,0.00088871096,0.0003934216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024923787,0.00008379427,0.0023167662,0.00023631327,0.00009702856,0.0002309745,0.0001257654,0.5287093,0.04735061,0.04812973,0.0017001675,0.37077028],"study_design_scores_gemma":[0.00001581255,0.000037023572,0.00023619697,0.000008397485,0.00000880923,0.00009816667,0.0000061312344,0.9895314,0.004671706,0.0042023463,0.0011715536,0.000012424522],"about_ca_topic_score_codex":0.00090421195,"about_ca_topic_score_gemma":0.0008902484,"teacher_disagreement_score":0.00090421195,"about_ca_system_score_codex":0.00035840608,"about_ca_system_score_gemma":0.00079714,"threshold_uncertainty_score":0.004696667},"labels":[],"label_agreement":null},{"id":"W2050522994","doi":"10.1109/tsp.2014.2330344","title":"Sum-Rate Maximization for Active Channels With Unequal Subchannel Noise Powers","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Maximization; Channel (broadcasting); Mathematical optimization; Transmitter power output; Computer science; Power (physics); Constraint (computer-aided design); Mathematics; Telecommunications; Transmitter","score_opus":0.012683817159647089,"score_gpt":0.22355486107032335,"score_spread":0.21087104391067626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050522994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03943016,0.00057009276,0.9513099,0.000224847,0.000038583177,0.000042428102,0.000117354495,0.000101912505,0.008164683],"genre_scores_gemma":[0.88905877,0.0010240865,0.1041442,0.00013808803,0.00007260334,0.00016599476,0.00012288576,0.0000811629,0.0051921527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863356,0.0006231075,0.000046219404,0.00016521242,0.0003044787,0.00022735738],"domain_scores_gemma":[0.9973787,0.001997322,0.00019079802,0.00010885806,0.00026188736,0.000062348314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015981261,0.0013488092,0.0010661087,0.00046599755,0.0004180733,0.0015245127,0.0009215012,0.0007597552,0.0014927349],"category_scores_gemma":[0.0042263344,0.0004502104,0.000702774,0.0008368161,0.0014199751,0.0016275259,0.0012324032,0.0011854639,0.00037949308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025625215,0.00008309607,0.0004632555,0.000259966,0.00007549464,0.0002489308,0.00019329261,0.8649415,0.013562422,0.09896674,0.0012637933,0.01968528],"study_design_scores_gemma":[0.000017102491,0.000047439735,0.0001447902,0.0000122618985,0.00001508242,0.0000610936,0.000039803977,0.9704917,0.0031020076,0.025461785,0.0005938026,0.000013191013],"about_ca_topic_score_codex":0.0015431092,"about_ca_topic_score_gemma":0.0012564828,"teacher_disagreement_score":0.0015981261,"about_ca_system_score_codex":0.0010424883,"about_ca_system_score_gemma":0.0007840243,"threshold_uncertainty_score":0.00845176},"labels":[],"label_agreement":null},{"id":"W2050563854","doi":"10.1109/tsp.2015.2407322","title":"A Multiple-Detection Probability Hypothesis Density Filter","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; McMaster University","funders":"","keywords":"Filter (signal processing); Computer science; Probability density function; Recursion (computer science); Algorithm; Clutter; Radar tracker; Tracking (education); Finite set; Gaussian; Set (abstract data type); Matched filter; Radar; Statistical power; Multipath propagation; Mathematics; Statistics; Computer vision","score_opus":0.05900416336028731,"score_gpt":0.2445620846247452,"score_spread":0.18555792126445791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050563854","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082771055,0.00008657972,0.9983016,0.00006113999,0.0000298614,0.00002069455,0.000032608645,0.00016656544,0.00047311242],"genre_scores_gemma":[0.1989618,0.00082283985,0.7894169,0.0004131844,0.00028342137,0.00028972636,0.00051194004,0.000079781465,0.009220393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881834,0.00022298285,0.00005891482,0.00037612786,0.000438798,0.00008479139],"domain_scores_gemma":[0.998664,0.000729841,0.00007919444,0.00013286703,0.00035596607,0.00003818066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019613535,0.00065273844,0.0012381957,0.0006942476,0.00044089305,0.0010096263,0.0020950444,0.00181206,0.003953914],"category_scores_gemma":[0.0050145243,0.00054182124,0.00082630996,0.0011052786,0.00067691546,0.0020511018,0.0009644562,0.0015386876,0.0014805997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028657628,0.00013249565,0.0015840273,0.00029048408,0.00011692144,0.0002268283,0.000116763425,0.37163213,0.013590428,0.07309157,0.0052151657,0.53371656],"study_design_scores_gemma":[0.000017591963,0.00004455572,0.00021693105,0.000008906903,0.000016591908,0.000110631976,0.000005470001,0.9890099,0.0026768765,0.004965755,0.0029113083,0.000015555264],"about_ca_topic_score_codex":0.0033521897,"about_ca_topic_score_gemma":0.002295814,"teacher_disagreement_score":0.003953914,"about_ca_system_score_codex":0.00090317737,"about_ca_system_score_gemma":0.0014749462,"threshold_uncertainty_score":0.013227105},"labels":[],"label_agreement":null},{"id":"W2052620199","doi":"10.1109/tsp.2014.2339793","title":"Optimal Spectrum Leasing and Resource Sharing in Two-Way Relay Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transceiver; Relay; Computer network; Computer science; Constraint (computer-aided design); Spectral efficiency; Shared resource; Topology (electrical circuits); Resource (disambiguation); Power (physics); Mathematical optimization; Telecommunications; Mathematics; Wireless; Engineering; Electrical engineering; Channel (broadcasting)","score_opus":0.026154113380342358,"score_gpt":0.2723800059648103,"score_spread":0.24622589258446798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052620199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049662553,0.0010926267,0.9437029,0.00030884004,0.000035909587,0.00008001535,0.00006794195,0.00008628634,0.004962894],"genre_scores_gemma":[0.9406551,0.00081620447,0.054245956,0.00007583906,0.00004367936,0.00017058144,0.000042127227,0.000057745732,0.0038927519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979809,0.0011691953,0.000061754356,0.00025788593,0.00024489398,0.000285528],"domain_scores_gemma":[0.9955388,0.0034910666,0.0004521573,0.00014557593,0.00022050158,0.00015188578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031478985,0.0014698649,0.0017343393,0.00086736586,0.00051291555,0.0021212385,0.0018923979,0.0020677545,0.0019535515],"category_scores_gemma":[0.0067209867,0.0010817384,0.00075505115,0.0012746777,0.0020001782,0.0026178104,0.0015422087,0.0009224824,0.00031420033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007990864,0.000036916994,0.00021760837,0.00006598266,0.000031058542,0.00013124046,0.000069699556,0.9706699,0.0013448203,0.02181236,0.0002977481,0.0052428567],"study_design_scores_gemma":[0.000017227225,0.000042324184,0.00006620467,0.000006618633,0.0000091873,0.000034201308,0.000025480009,0.9888676,0.00033546623,0.010344263,0.00024088778,0.00001064952],"about_ca_topic_score_codex":0.0019752919,"about_ca_topic_score_gemma":0.0014119006,"teacher_disagreement_score":0.0031478985,"about_ca_system_score_codex":0.0021322516,"about_ca_system_score_gemma":0.0008685858,"threshold_uncertainty_score":0.016647875},"labels":[],"label_agreement":null},{"id":"W2054045791","doi":"10.1109/tsp.2012.2210546","title":"Shrinkage-to-Tapering Estimation of Large Covariance Matrices","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Estimator; Mathematics; Covariance; Covariance matrix; Estimation of covariance matrices; Shrinkage estimator; Applied mathematics; Tapering; Statistics; Algorithm; Combinatorics; Bias of an estimator; Computer science; Minimum-variance unbiased estimator","score_opus":0.03358121091171269,"score_gpt":0.3291282374208948,"score_spread":0.29554702650918213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054045791","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008270232,0.00018233269,0.99083346,0.000056810713,0.00002537802,0.000026981523,0.00002867466,0.00022222447,0.00035398285],"genre_scores_gemma":[0.18508671,0.00077878195,0.8100698,0.0002817803,0.0001834991,0.00020866194,0.0004944957,0.00021140206,0.002684874],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971681,0.00086733,0.00015740795,0.0006752786,0.0009547325,0.00017713521],"domain_scores_gemma":[0.991454,0.00454823,0.00077119825,0.001746577,0.0012776476,0.00020242174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051301527,0.001092892,0.0012903473,0.0008872832,0.00048097828,0.0008722404,0.0014273049,0.0011538782,0.001254463],"category_scores_gemma":[0.027210362,0.0007304212,0.0010367419,0.00084455265,0.0013905115,0.0023744814,0.0020244864,0.0025683332,0.0007100966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046617023,0.00015095268,0.0056001865,0.00055435847,0.00032685636,0.0004991832,0.0006890065,0.40052468,0.059122197,0.0704539,0.0045434874,0.45706898],"study_design_scores_gemma":[0.000031529627,0.00010805312,0.0022135305,0.000045916575,0.000046109744,0.00021956228,0.000045651712,0.95802844,0.012349909,0.023268163,0.0035802436,0.00006293199],"about_ca_topic_score_codex":0.0022710413,"about_ca_topic_score_gemma":0.0019944021,"teacher_disagreement_score":0.0051301527,"about_ca_system_score_codex":0.00043934723,"about_ca_system_score_gemma":0.0011886095,"threshold_uncertainty_score":0.0271312},"labels":[],"label_agreement":null},{"id":"W2058099721","doi":"10.1109/tsp.2012.2215606","title":"Constant Offset Autonomous Spectrum Balancing Using Multiple Reference Lines for VDSL","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Offset (computer science); Computer science; Lagrange multiplier; Constant (computer programming); Digital subscriber line; Real-time computing; Iterative method; Multiplier (economics); Line (geometry); Algorithm; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.047313965514923215,"score_gpt":0.27686055283068256,"score_spread":0.22954658731575933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058099721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028609352,0.00010155454,0.9692899,0.00005679237,0.000021233905,0.000022305847,0.000014340092,0.00034278125,0.0015417582],"genre_scores_gemma":[0.71545696,0.00007908374,0.28245682,0.000052296637,0.000024076913,0.000045694134,0.000046275814,0.00006485199,0.0017738929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996457,0.0001390622,0.000014396371,0.000051611958,0.000112338195,0.000036826317],"domain_scores_gemma":[0.9994518,0.00022895091,0.00008821408,0.00010826455,0.00009894585,0.000023866813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061078963,0.00040852203,0.00023954088,0.00030507162,0.00043204668,0.00057533896,0.0008029221,0.00033749724,0.0015957883],"category_scores_gemma":[0.0018639056,0.00016955344,0.00017024731,0.00054166355,0.000513599,0.0011768355,0.0008288757,0.00057932537,0.00034222522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044474108,0.00012470377,0.0011734029,0.000102028855,0.000037541726,0.00015173126,0.00033430816,0.4741879,0.06521562,0.05717793,0.0017608792,0.3992892],"study_design_scores_gemma":[0.000046904606,0.00015700074,0.00015298139,0.000012809158,0.000008548932,0.00008692021,0.000027440297,0.96121955,0.022541879,0.012560359,0.0031654348,0.000020173016],"about_ca_topic_score_codex":0.0010383124,"about_ca_topic_score_gemma":0.001926784,"teacher_disagreement_score":0.0015957883,"about_ca_system_score_codex":0.00044306746,"about_ca_system_score_gemma":0.0006374746,"threshold_uncertainty_score":0.00533849},"labels":[],"label_agreement":null},{"id":"W2061008968","doi":"10.1109/tsp.2015.2423265","title":"Sum-Rate Optimal Network Beamforming and Subcarrier Power Allocation for Multi-Carrier Asynchronous Two-Way Relay Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Beamforming; Subcarrier; Computer science; Transceiver; Relay channel; Multiplexing; Asynchronous communication; Orthogonal frequency-division multiplexing; Electronic engineering; Transmission (telecommunications); Channel (broadcasting); Computer network; Power (physics); Telecommunications; Engineering; Wireless","score_opus":0.0539689869439438,"score_gpt":0.29974707521170074,"score_spread":0.24577808826775693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061008968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01568115,0.0007408233,0.97828466,0.00018823471,0.000032487256,0.00004609671,0.00006839094,0.000081413535,0.004876757],"genre_scores_gemma":[0.85221875,0.0019158805,0.13860582,0.00015192598,0.00008932179,0.00030877543,0.00012012158,0.000090709975,0.0064987913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991731,0.0003744766,0.00003260961,0.00011789246,0.00019816877,0.000103603474],"domain_scores_gemma":[0.9989166,0.0007405395,0.000110379166,0.00004214832,0.00015682704,0.000033498876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011715288,0.0015215751,0.0010986851,0.00046119926,0.00037352063,0.0012389754,0.0007974796,0.0011869678,0.0021041539],"category_scores_gemma":[0.0033702417,0.00058610615,0.0004095169,0.00091019867,0.0010543836,0.0014844227,0.0010440587,0.0008808807,0.0006908298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005636604,0.000039127557,0.00015493442,0.00012518514,0.000028834733,0.000112959206,0.000071783026,0.94631165,0.0035827942,0.035126854,0.0007625074,0.013626996],"study_design_scores_gemma":[0.000010496753,0.000021528615,0.00004140104,0.000006909293,0.00000562531,0.000021616297,0.000015077819,0.9882946,0.00043142436,0.010867062,0.00027807264,0.0000063079124],"about_ca_topic_score_codex":0.0018311013,"about_ca_topic_score_gemma":0.002179038,"teacher_disagreement_score":0.0021041539,"about_ca_system_score_codex":0.0012553344,"about_ca_system_score_gemma":0.000950288,"threshold_uncertainty_score":0.009108126},"labels":[],"label_agreement":null},{"id":"W2064211981","doi":"10.1109/tsp.2014.2358953","title":"Joint Distributed Beamforming and Power Allocation in Underlay Cognitive Two-Way Relay Links Using Second-Order Channel Statistics","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Underlay; Relay; Beamforming; Computer science; Channel state information; Benchmark (surveying); Relay channel; Signal-to-noise ratio (imaging); Channel (broadcasting); Joint (building); Mathematical optimization; Cognitive radio; Computational complexity theory; Interference (communication); Algorithm; Power (physics); Telecommunications; Wireless; Mathematics; Engineering","score_opus":0.04308438526047193,"score_gpt":0.28855136396597764,"score_spread":0.2454669787055057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064211981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030116582,0.00014306584,0.9681042,0.000064800966,0.000009756853,0.000025148294,0.000025082572,0.00015289804,0.0013585651],"genre_scores_gemma":[0.73990685,0.00024841639,0.2574225,0.000053903277,0.000022280105,0.00013631789,0.00006341934,0.000026659336,0.0021195833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959344,0.00013191826,0.000017593326,0.00007851541,0.000113040405,0.000065390836],"domain_scores_gemma":[0.99936014,0.00043195637,0.000068409456,0.00004742093,0.000068506866,0.000023624547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005884871,0.0007478006,0.00062899437,0.0003089136,0.00027916304,0.0008047401,0.0006099694,0.0005198962,0.0007427563],"category_scores_gemma":[0.0017638332,0.00039186617,0.00035305115,0.00061765907,0.0005607992,0.00084511697,0.000810212,0.0005263958,0.0002441695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115105824,0.00006160995,0.00041762763,0.000049655817,0.00003672476,0.000077684876,0.000097079435,0.90642947,0.008007191,0.009848012,0.00049352087,0.07436628],"study_design_scores_gemma":[0.00001871706,0.000033587636,0.00010385885,0.0000030422264,0.0000064021197,0.000027696473,0.000017898532,0.99263257,0.0024814627,0.0044654957,0.00020155408,0.000007720663],"about_ca_topic_score_codex":0.0022248619,"about_ca_topic_score_gemma":0.004922195,"teacher_disagreement_score":0.0022248619,"about_ca_system_score_codex":0.00053944514,"about_ca_system_score_gemma":0.0010624835,"threshold_uncertainty_score":0.004423797},"labels":[],"label_agreement":null},{"id":"W2064450393","doi":"10.1109/tsp.2013.2264813","title":"Adaptive Multiset Stochastic Decoding of Non-Binary LDPC Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Rogue Research (Canada)","funders":"","keywords":"Multiset; Decoding methods; Computer science; Algorithm; Binary number; Low-density parity-check code; List decoding; Discrete mathematics; Mathematics; Arithmetic; Concatenated error correction code; Block code","score_opus":0.025940419415568666,"score_gpt":0.2750119041399348,"score_spread":0.24907148472436616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064450393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06670661,0.00015758822,0.9309473,0.000103052145,0.000039760544,0.000032749325,0.000055181095,0.00042157678,0.0015362503],"genre_scores_gemma":[0.6052223,0.0002348667,0.39082766,0.00011593416,0.00004429036,0.00008594922,0.00020931102,0.00007180689,0.0031877703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994498,0.00013173674,0.000037138783,0.00008089606,0.0002546041,0.000045767738],"domain_scores_gemma":[0.9992048,0.00033803092,0.000114782466,0.0001254357,0.00018872504,0.000028191926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004066421,0.00035587687,0.00036916195,0.0003715926,0.0003145795,0.00048729964,0.00069997663,0.0003980163,0.00073635805],"category_scores_gemma":[0.0014434947,0.00018099496,0.00036027032,0.00043823643,0.0003481053,0.0005399315,0.0004980222,0.0004894585,0.0002643351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031439477,0.00010152818,0.002679892,0.00015557288,0.0000691619,0.00024751393,0.00015419196,0.6036392,0.079058245,0.067134075,0.0012973795,0.24514887],"study_design_scores_gemma":[0.00001704589,0.000047023124,0.00022927964,0.0000059471236,0.000005344503,0.00007472134,0.000004995659,0.97756517,0.015321578,0.0058148047,0.0009055465,0.000008611983],"about_ca_topic_score_codex":0.0012526984,"about_ca_topic_score_gemma":0.002272855,"teacher_disagreement_score":0.0012526984,"about_ca_system_score_codex":0.00051497476,"about_ca_system_score_gemma":0.00092413765,"threshold_uncertainty_score":0.0037363768},"labels":[],"label_agreement":null},{"id":"W2066337887","doi":"10.1109/tsp.2014.2362886","title":"Reduced Complexity HMM Filtering With Stochastic Dominance Bounds: A Convex Optimization Approach","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Upper and lower bounds; Combinatorics; Hidden Markov model; Markov chain; Convex optimization; Matrix completion; Stochastic dominance; Mathematical optimization; Algorithm; Regular polygon; Applied mathematics; Computer science; Statistics; Artificial intelligence","score_opus":0.025221121244948682,"score_gpt":0.22485014749441157,"score_spread":0.19962902624946288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066337887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009674185,0.000075135395,0.9980945,0.00008318024,0.000011354865,0.000009028039,0.000021765432,0.000074974065,0.00066262926],"genre_scores_gemma":[0.21822336,0.001072711,0.76986784,0.00041425056,0.00031665212,0.00041361066,0.00051813823,0.00044521716,0.008728179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979109,0.00084900705,0.00008756634,0.0002961207,0.00068156165,0.00017483404],"domain_scores_gemma":[0.9926762,0.005956105,0.000278537,0.00038327993,0.0005628544,0.00014312581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037986594,0.0015653856,0.001586428,0.0012227875,0.0006177574,0.0020264073,0.0015840061,0.0015369868,0.004047801],"category_scores_gemma":[0.011878531,0.001053224,0.001315379,0.0009487722,0.001454504,0.002581621,0.0021941033,0.0029487845,0.000928979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055394303,0.000039576636,0.00021685389,0.00008236264,0.00004197563,0.000060181068,0.00007001222,0.87045413,0.0018316227,0.0945918,0.0013318791,0.031224202],"study_design_scores_gemma":[0.0000027753938,0.000007674825,0.000025855396,0.000005394406,0.0000028412321,0.000006127464,0.0000023892146,0.98613703,0.00040345386,0.013052958,0.000349194,0.0000043261516],"about_ca_topic_score_codex":0.006743712,"about_ca_topic_score_gemma":0.006235063,"teacher_disagreement_score":0.006743712,"about_ca_system_score_codex":0.0025919974,"about_ca_system_score_gemma":0.0023415445,"threshold_uncertainty_score":0.020089507},"labels":[],"label_agreement":null},{"id":"W2067014122","doi":"10.1109/tsp.2011.2166392","title":"A Generalized Multivariate Autoregressive (GmAR)-Based Approach for EEG Source Connectivity Analysis","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Autoregressive model; Electroencephalography; Computer science; Pattern recognition (psychology); Multivariate statistics; Artificial intelligence; Coherence (philosophical gambling strategy); Speech recognition; Mathematics; Machine learning; Statistics; Psychology","score_opus":0.06868470915249736,"score_gpt":0.29207444094656015,"score_spread":0.2233897317940628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067014122","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020097718,0.00023413656,0.9970393,0.000052050767,0.000016041291,0.000015592166,0.000051437884,0.0003187718,0.00026284772],"genre_scores_gemma":[0.12619092,0.0014323929,0.8695144,0.00009930694,0.00015192434,0.00018171624,0.00041974307,0.0002104085,0.0017992518],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996195,0.00018227324,0.000018723451,0.00007940346,0.00008070381,0.00001937865],"domain_scores_gemma":[0.9996669,0.0002006482,0.00004846776,0.00003654396,0.00004033514,0.0000071063473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060776796,0.0009591199,0.00065309345,0.0009458591,0.00022551997,0.00037655875,0.0007198241,0.0006994371,0.0012212651],"category_scores_gemma":[0.0019478181,0.00028514606,0.0012553098,0.0013574752,0.00032340782,0.0005882981,0.0004284173,0.0011211401,0.00057865237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104656574,0.000091116795,0.0013629155,0.0003909726,0.0004147273,0.0004906917,0.00020491077,0.4144035,0.060664266,0.05875298,0.0037402052,0.4593791],"study_design_scores_gemma":[0.000011319542,0.000078412326,0.0016410078,0.000015808688,0.00006108965,0.00026294423,0.000015869882,0.9756545,0.0038998213,0.014258901,0.004057979,0.000042338615],"about_ca_topic_score_codex":0.0020244594,"about_ca_topic_score_gemma":0.0028569892,"teacher_disagreement_score":0.0020244594,"about_ca_system_score_codex":0.00020393853,"about_ca_system_score_gemma":0.00037219163,"threshold_uncertainty_score":0.004085541},"labels":[],"label_agreement":null},{"id":"W2069065624","doi":"10.1109/tsp.2004.837413","title":"<tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Greatest common divisor; Univariate; Sylvester matrix; Mathematics; Maple; Factoring; Combinatorics; Unit circle; Polynomial; Discrete mathematics; Polynomial matrix; Matrix polynomial; Statistics; Mathematical analysis; Multivariate statistics","score_opus":0.03777352369009633,"score_gpt":0.2723385915055507,"score_spread":0.23456506781545433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069065624","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011920712,0.0001309882,0.97873527,0.00006684783,0.000043698412,0.00004864656,0.00014723497,0.0057961456,0.0031104388],"genre_scores_gemma":[0.0917364,0.00014299792,0.9019636,0.00004473729,0.000046233974,0.000071603674,0.000520703,0.00087629515,0.004597397],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994823,0.00008382702,0.0000386313,0.00014787258,0.00017782995,0.000069492795],"domain_scores_gemma":[0.9990681,0.00021404398,0.00008151791,0.00029439383,0.00028270352,0.000059278962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005990538,0.0009940222,0.0007218214,0.0009593638,0.0005674287,0.00091871206,0.00071717426,0.00034855655,0.021874202],"category_scores_gemma":[0.0031153816,0.00029738632,0.0006454665,0.0012992882,0.00079103047,0.0015523635,0.0012920691,0.00082352775,0.010198802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004645804,0.00006634127,0.002110811,0.00022386189,0.00005087217,0.00024984032,0.0003561727,0.028659256,0.030418115,0.053755082,0.01760157,0.86604357],"study_design_scores_gemma":[0.0002437804,0.0007989659,0.0013965096,0.00007900033,0.000066797744,0.0012848488,0.0003108181,0.6346047,0.16849056,0.077738814,0.11486297,0.00012226457],"about_ca_topic_score_codex":0.0021434817,"about_ca_topic_score_gemma":0.002858076,"teacher_disagreement_score":0.021874202,"about_ca_system_score_codex":0.0004981326,"about_ca_system_score_gemma":0.0008115612,"threshold_uncertainty_score":0.07317644},"labels":[],"label_agreement":null},{"id":"W2074853220","doi":"10.1109/tsp.2004.838934","title":"Wideband array signal processing using MCMC methods","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Narrowband; Wideband; Reversible-jump Markov chain Monte Carlo; Markov chain Monte Carlo; Algorithm; Maximum a posteriori estimation; Computer science; Robustness (evolution); Array processing; Signal processing; Interpolation (computer graphics); Monte Carlo method; Bayesian probability; Direction of arrival; Mathematics; Statistics; Artificial intelligence; Electronic engineering; Maximum likelihood; Telecommunications; Engineering; Radar","score_opus":0.0448059475000119,"score_gpt":0.3486716157430472,"score_spread":0.30386566824303535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074853220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010811717,0.000099508245,0.9979851,0.000048436035,0.000023434044,0.000016535907,0.0000311165,0.0002839935,0.00043052528],"genre_scores_gemma":[0.09873065,0.0004521476,0.89698946,0.00013884099,0.00013791591,0.00038584732,0.000371896,0.00021941947,0.0025738257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999129,0.00035724192,0.00003941219,0.00012339924,0.00029157512,0.000059327653],"domain_scores_gemma":[0.9971724,0.0019064718,0.0001970494,0.00027085305,0.00039702823,0.000056158544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013636637,0.0010160857,0.0010987478,0.0012506525,0.0006905948,0.0010240371,0.0016540681,0.0015219403,0.0037631532],"category_scores_gemma":[0.007615925,0.0009629531,0.0009311678,0.0016502127,0.00075393135,0.0011834466,0.0009583981,0.0021285617,0.001479809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103023405,0.000052813062,0.0008536343,0.00013236832,0.00015288233,0.00010250468,0.000085390995,0.8250768,0.0034527448,0.04409237,0.0020113923,0.12388405],"study_design_scores_gemma":[0.000010421706,0.00000763487,0.00007414688,0.0000072033768,0.0000070585224,0.000013946476,0.0000039376237,0.99225384,0.00041878372,0.006145609,0.0010489905,0.000008399191],"about_ca_topic_score_codex":0.0069965436,"about_ca_topic_score_gemma":0.007733555,"teacher_disagreement_score":0.0069965436,"about_ca_system_score_codex":0.0007870563,"about_ca_system_score_gemma":0.0013979924,"threshold_uncertainty_score":0.0139116645},"labels":[],"label_agreement":null},{"id":"W2075147842","doi":"10.1109/tsp.2011.2162956","title":"Optimal Power Allocation for Secure Multicarrier Relay Systems","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Subcarrier; Computer science; Maximization; Transmission (telecommunications); Transmitter power output; Power (physics); Signal-to-noise ratio (imaging); Mathematical optimization; Communications system; Secure transmission; Orthogonal frequency-division multiplexing; Computer network; Mathematics; Telecommunications; Transmitter","score_opus":0.05766540760355063,"score_gpt":0.28078414581734484,"score_spread":0.22311873821379422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075147842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054531273,0.0012660022,0.93702996,0.00042212752,0.000047062564,0.000059840673,0.000065812244,0.00011934802,0.006458613],"genre_scores_gemma":[0.9584386,0.0009487165,0.037950166,0.00005056717,0.000045808665,0.0000793859,0.000034230376,0.000030991137,0.002421683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990314,0.0004868525,0.000037154758,0.00011262497,0.00018780166,0.00014411165],"domain_scores_gemma":[0.99842715,0.0010698495,0.00019582153,0.00008460716,0.0001760577,0.000046644018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014424016,0.0012294463,0.001167479,0.0005400919,0.0005245036,0.0013013484,0.0007732276,0.0010583038,0.0020778864],"category_scores_gemma":[0.004063938,0.0005481105,0.00044357794,0.00077675213,0.0013047135,0.0014165537,0.0010730354,0.00085721957,0.0005231024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008656859,0.000021688906,0.00020205943,0.00007573595,0.000026255419,0.00014908865,0.00009333341,0.9523238,0.0021440384,0.036653653,0.0004574847,0.007766426],"study_design_scores_gemma":[0.000015182847,0.000021083717,0.00003065107,0.0000039892802,0.0000051155807,0.00001904657,0.000016944507,0.99125165,0.00035906723,0.008092357,0.00018004156,0.000004835922],"about_ca_topic_score_codex":0.0021378968,"about_ca_topic_score_gemma":0.0016164675,"teacher_disagreement_score":0.0021378968,"about_ca_system_score_codex":0.0012736043,"about_ca_system_score_gemma":0.00081394153,"threshold_uncertainty_score":0.009240687},"labels":[],"label_agreement":null},{"id":"W2075584011","doi":"10.1109/tsp.2014.2388437","title":"Incremental Grassmannian Feedback Schemes for Multi-User MIMO Systems","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Codebook; Vector quantization; Grassmannian; Quantization (signal processing); MIMO; Algorithm; Fading; Mathematics; Robustness (evolution); Computer science; Multiple description coding; Channel state information; Decoding methods; Theoretical computer science; Channel (broadcasting); Wireless; Telecommunications","score_opus":0.046534629454315975,"score_gpt":0.27814158554220797,"score_spread":0.231606956087892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075584011","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025666483,0.0006205753,0.970509,0.000116548385,0.00005970151,0.00004167893,0.00004928808,0.00036648722,0.0025702869],"genre_scores_gemma":[0.8758698,0.00042859124,0.12132208,0.00009056104,0.00004627426,0.000058380672,0.00005483394,0.000023896671,0.0021055762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997211,0.000067852154,0.000014465803,0.000037279326,0.00012746373,0.00003182424],"domain_scores_gemma":[0.99965715,0.00013226969,0.000050782917,0.00006777441,0.000070123744,0.000021909262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004687296,0.00038183155,0.0003304046,0.00022463687,0.0003402183,0.00038405898,0.0008557384,0.00033036523,0.00144391],"category_scores_gemma":[0.0013148849,0.00013149441,0.00018999891,0.0004121778,0.00048938644,0.0007485592,0.0005689917,0.00053978874,0.00023441638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019864009,0.00006500105,0.00038103756,0.00012279995,0.000027389504,0.00016068117,0.00024829098,0.6463986,0.024436982,0.10453512,0.0024524014,0.2209731],"study_design_scores_gemma":[0.0000143349525,0.0000931764,0.000121774356,0.000006733076,0.0000052553096,0.000043891017,0.000014169093,0.97971916,0.003418238,0.01503591,0.0015109152,0.000016497273],"about_ca_topic_score_codex":0.0024763825,"about_ca_topic_score_gemma":0.0035503306,"teacher_disagreement_score":0.0024763825,"about_ca_system_score_codex":0.0005989236,"about_ca_system_score_gemma":0.0005781788,"threshold_uncertainty_score":0.0049239397},"labels":[],"label_agreement":null},{"id":"W2075770243","doi":"10.1109/tsp.2010.2074199","title":"Noise Invalidation Denoising","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Noise reduction; Noise (video); Video denoising; Step detection; Pattern recognition (psychology); Noise measurement; Computer science; Algorithm; Value noise; Mathematics; Transformation (genetics); Artificial intelligence; Computer vision; Noise floor; Filter (signal processing)","score_opus":0.026915258698019792,"score_gpt":0.2890794216225793,"score_spread":0.2621641629245595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075770243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010671051,0.00033546297,0.9875131,0.000100676996,0.00011201657,0.000031916505,0.00004495856,0.0002990104,0.00089177274],"genre_scores_gemma":[0.28100774,0.0011483363,0.7085341,0.0003779956,0.00023225488,0.00013891724,0.00063675205,0.00034981058,0.0075741215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772066,0.00033510706,0.0001638006,0.00048235935,0.0011520806,0.00014603001],"domain_scores_gemma":[0.99721825,0.0005900838,0.00033329165,0.000729701,0.0010445789,0.00008405053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019501685,0.0008724449,0.0016339475,0.0013374883,0.00074965466,0.001383101,0.0016246245,0.0017505201,0.00096900703],"category_scores_gemma":[0.0053605423,0.00047154888,0.0011008637,0.0014244418,0.0009999026,0.0015347542,0.0018566409,0.0015573662,0.0006641064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006386345,0.00016898576,0.003395259,0.0004683134,0.0002447515,0.0007698838,0.000457001,0.08442039,0.3136775,0.032844845,0.00608708,0.5568273],"study_design_scores_gemma":[0.000032608572,0.00023037064,0.0022820893,0.00004723044,0.000116108604,0.0017276976,0.0000809312,0.8020168,0.15927085,0.013726718,0.020358613,0.00011006253],"about_ca_topic_score_codex":0.0008654098,"about_ca_topic_score_gemma":0.001036606,"teacher_disagreement_score":0.0019501685,"about_ca_system_score_codex":0.0004659098,"about_ca_system_score_gemma":0.0010093917,"threshold_uncertainty_score":0.01031363},"labels":[],"label_agreement":null},{"id":"W2076858443","doi":"10.1109/tsp.2014.2302733","title":"Design of IIR Digital Differentiators Using Constrained Optimization","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Analog and Mixed-Signal Circuit Design","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Infinite impulse response; Passband; Stopband; Differentiator; Control theory (sociology); 2D Filters; Amplitude; Transition band; Linear phase; Computer science; Digital filter; Mathematics; Low-pass filter; Filter (signal processing); Band-pass filter; Electronic engineering; Prototype filter; Physics; Engineering; Artificial intelligence","score_opus":0.01987310848128735,"score_gpt":0.2118807285691207,"score_spread":0.19200762008783337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076858443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032060698,0.00014296368,0.9947237,0.00003145021,0.000017774608,0.000027051443,0.000013398755,0.00009014595,0.0017475156],"genre_scores_gemma":[0.17813306,0.00038904423,0.8153579,0.00014601038,0.00003412454,0.0002502556,0.00008497864,0.000086946486,0.005517655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997191,0.000060541137,0.000015701446,0.00006142782,0.00012369899,0.000019435442],"domain_scores_gemma":[0.99974984,0.000113998954,0.000041899253,0.000018873194,0.000063133935,0.00001212036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005617724,0.00064936053,0.00051345385,0.00035140157,0.00027071807,0.0006139199,0.0006375174,0.0007166547,0.0023341898],"category_scores_gemma":[0.00092247326,0.00033334806,0.00035067557,0.0003500536,0.00038327972,0.0005435694,0.0004751538,0.000671545,0.00063716393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018301913,0.00009200196,0.000469653,0.0006400723,0.00009755321,0.00019762212,0.00028572796,0.535515,0.14868915,0.06165741,0.003011232,0.24916148],"study_design_scores_gemma":[0.000019478737,0.00011669579,0.00008748884,0.000019493827,0.000010373849,0.00007144404,0.000013897321,0.98038393,0.011434117,0.002160893,0.005667347,0.000014898393],"about_ca_topic_score_codex":0.00049823994,"about_ca_topic_score_gemma":0.00073654327,"teacher_disagreement_score":0.0023341898,"about_ca_system_score_codex":0.0004108039,"about_ca_system_score_gemma":0.00046304936,"threshold_uncertainty_score":0.0078086257},"labels":[],"label_agreement":null},{"id":"W2079563949","doi":"10.1109/tsp.2005.850344","title":"Offline and online identification of hidden semi-Markov models","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Hidden Markov model; Identification (biology); Computer science; Maximum-entropy Markov model; Markov chain; Markov model; Algorithm; Hidden semi-Markov model; Constant (computer programming); Markov process; Online algorithm; Forward algorithm; Estimation theory; Variable-order Markov model; Data mining; Artificial intelligence; Machine learning; Mathematics; Statistics","score_opus":0.023437475706969794,"score_gpt":0.2598130046594229,"score_spread":0.23637552895245312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079563949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039713546,0.000053660013,0.99519217,0.000046131165,0.00001716715,0.000010412075,0.00004208418,0.00018843291,0.00047858406],"genre_scores_gemma":[0.50792724,0.00038989165,0.48481464,0.0001460276,0.0001262425,0.00024105654,0.00064489775,0.0002196497,0.0054903184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985045,0.0005099241,0.00007453866,0.00036248995,0.00041950576,0.00012915125],"domain_scores_gemma":[0.995965,0.0026238477,0.00031330745,0.0006759603,0.00033375967,0.0000880839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016645312,0.0009053862,0.00085263944,0.00048706535,0.00030067997,0.0010598435,0.0017250018,0.0011419464,0.0020992744],"category_scores_gemma":[0.0082421135,0.00059528137,0.00080245134,0.00040511644,0.0006745234,0.0022089668,0.0012317377,0.002047318,0.00094618864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027480276,0.00014199122,0.0022239184,0.00015681362,0.000094602336,0.00032008407,0.0001755402,0.7075807,0.013831563,0.09398554,0.0024689534,0.17874554],"study_design_scores_gemma":[0.0000055115875,0.000012663837,0.00012704259,0.0000049466134,0.000005001353,0.000044383483,0.000004557955,0.9844148,0.0022446834,0.012633446,0.00049326767,0.00000971788],"about_ca_topic_score_codex":0.0014791271,"about_ca_topic_score_gemma":0.0017384455,"teacher_disagreement_score":0.0020992744,"about_ca_system_score_codex":0.0005501636,"about_ca_system_score_gemma":0.0011636585,"threshold_uncertainty_score":0.00880301},"labels":[],"label_agreement":null},{"id":"W2082085686","doi":"10.1109/tsp.2013.2284753","title":"Joint User Grouping and Transceiver Design in a MIMO Interfering Broadcast Channel","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; MIMO; Precoding; Beamforming; Base station; Transceiver; Channel (broadcasting); Throughput; Multi-user MIMO; Decoding methods; Convergence (economics); Interference (communication); Minimum mean square error; Computer network; Algorithm; Mathematical optimization; Wireless; Telecommunications; Mathematics","score_opus":0.023014125086880752,"score_gpt":0.21698572287515266,"score_spread":0.19397159778827192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082085686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012890751,0.000050038732,0.985741,0.00004946869,0.000010592891,0.000028751712,0.000013147573,0.00011160037,0.0011046598],"genre_scores_gemma":[0.65460026,0.00017468659,0.34196573,0.00012520583,0.00004867591,0.00021899452,0.0000656743,0.000051747982,0.002748986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988011,0.00051814516,0.0000406013,0.0001904723,0.0002911483,0.00015855189],"domain_scores_gemma":[0.9993111,0.0002727264,0.00011887215,0.00008448573,0.00016614592,0.00004665594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012425226,0.00087215146,0.00092639105,0.00035106708,0.00042681285,0.0008798682,0.001247476,0.00095336826,0.0009954514],"category_scores_gemma":[0.0019761955,0.00048249456,0.00048878504,0.00067538087,0.0008076594,0.0007191755,0.0009105344,0.0005958783,0.0005415198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011198682,0.00005672829,0.00059545244,0.0000694093,0.00004056594,0.00014667769,0.0001651345,0.93316764,0.012787881,0.012674344,0.0005298625,0.039654307],"study_design_scores_gemma":[0.000017121063,0.000107983324,0.000086537795,0.0000034392806,0.000014391652,0.000049733022,0.00002571846,0.9931265,0.0034064732,0.0027791162,0.00037461167,0.00000835846],"about_ca_topic_score_codex":0.0011405597,"about_ca_topic_score_gemma":0.0013695452,"teacher_disagreement_score":0.001247476,"about_ca_system_score_codex":0.000515274,"about_ca_system_score_gemma":0.0009490801,"threshold_uncertainty_score":0.0065711737},"labels":[],"label_agreement":null},{"id":"W2084557933","doi":"10.1109/tsp.2014.2324997","title":"Robust Shrinkage Affine-Projection Sign Adaptive-Filtering Algorithms for Impulsive Noise Environments","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Algorithm; Norm (philosophy); Affine transformation; Line search; Adaptive filter; Mathematics; Computer science; Noise reduction; Artificial intelligence","score_opus":0.0338188510088434,"score_gpt":0.2475323236942834,"score_spread":0.21371347268544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084557933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031180407,0.000050132316,0.9962191,0.00003275499,0.000015255033,0.000012137181,0.00000590125,0.00015987405,0.00038677143],"genre_scores_gemma":[0.12704664,0.00024702877,0.8690958,0.00006134448,0.00004054549,0.00013762142,0.000095129864,0.00010125981,0.0031746556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995788,0.0001030869,0.000036082973,0.00005659227,0.0001932262,0.00003210771],"domain_scores_gemma":[0.9988795,0.00044143564,0.00014988091,0.00011860514,0.00037002075,0.000040582414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010785162,0.00089065474,0.00074569666,0.00052440236,0.00030899284,0.00084133295,0.0011220953,0.0009029434,0.0015516357],"category_scores_gemma":[0.003489403,0.0003686441,0.0005668603,0.000742302,0.00057659415,0.0010746481,0.00082139956,0.0012501165,0.0007368136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002135517,0.000087966015,0.0009131917,0.00011785147,0.00007389326,0.00008909412,0.00014726617,0.24687953,0.029451156,0.021445408,0.0017510497,0.69882995],"study_design_scores_gemma":[0.00001361236,0.000054620963,0.00017790431,0.000008336907,0.000009947586,0.00008271244,0.000012537136,0.98827076,0.00785746,0.002285511,0.001209954,0.000016668511],"about_ca_topic_score_codex":0.0010916522,"about_ca_topic_score_gemma":0.0017410077,"teacher_disagreement_score":0.0015516357,"about_ca_system_score_codex":0.00033256656,"about_ca_system_score_gemma":0.0009877251,"threshold_uncertainty_score":0.005703807},"labels":[],"label_agreement":null},{"id":"W2085222535","doi":"10.1109/tsp.2012.2236831","title":"A Family of Shrinkage Adaptive-Filtering Algorithms","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":100,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Algorithm; Mathematics; Adaptive filter; Convergence (economics); Least mean squares filter; Least-squares function approximation; Statistics","score_opus":0.03429599351553563,"score_gpt":0.2607558603881369,"score_spread":0.22645986687260128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085222535","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096514315,0.00034313204,0.99726284,0.000052963158,0.000058117577,0.000027168388,0.000030199033,0.00024294954,0.0010174334],"genre_scores_gemma":[0.043716427,0.0017755779,0.9450087,0.00017087709,0.00019613907,0.00026145653,0.00043327516,0.00016316453,0.008274404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915516,0.0001883814,0.00006192267,0.00020543917,0.000337732,0.00005140502],"domain_scores_gemma":[0.99898547,0.00034657857,0.00007429466,0.00014024664,0.00041917298,0.00003413292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012003948,0.0014008539,0.0011039722,0.0010267348,0.00047509355,0.00089485047,0.0014986364,0.0013741369,0.003748452],"category_scores_gemma":[0.0031683545,0.00052104745,0.0011247869,0.0011306992,0.0006166071,0.0013056329,0.0008984314,0.0016721181,0.003437372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011776304,0.00006270042,0.00073818094,0.0002727507,0.0001412445,0.00010419008,0.0000788586,0.11934453,0.019872397,0.03799166,0.007995482,0.8132803],"study_design_scores_gemma":[0.000035859182,0.00009156544,0.0004339063,0.000048040383,0.00004103821,0.00035339367,0.000019011242,0.93635374,0.012638418,0.017949035,0.03199236,0.000043635104],"about_ca_topic_score_codex":0.0013583836,"about_ca_topic_score_gemma":0.0014616298,"teacher_disagreement_score":0.003748452,"about_ca_system_score_codex":0.00039499413,"about_ca_system_score_gemma":0.0008831233,"threshold_uncertainty_score":0.012539804},"labels":[],"label_agreement":null},{"id":"W2086164463","doi":"10.1109/tsp.2014.2304438","title":"Robust Beamforming by Linear Programming","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; McMaster University","funders":"University of Hong Kong; Defence Research and Development Canada; McMaster University; City University of Hong Kong","keywords":"Beamforming; Robustness (evolution); Linear programming; Computer science; Second-order cone programming; Ellipsoid; Mathematical optimization; Robust optimization; Algorithm; Norm (philosophy); Set (abstract data type); Gaussian; Mathematics; Convex optimization","score_opus":0.021768249924616515,"score_gpt":0.24010501136793141,"score_spread":0.2183367614433149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086164463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000285185,0.00016573428,0.99845743,0.00007741704,0.000021386773,0.000010116165,0.000013895208,0.00008368958,0.0008851512],"genre_scores_gemma":[0.122111686,0.00242342,0.8623852,0.00050557684,0.00032473414,0.00051285775,0.00040917096,0.0003096849,0.011017693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880016,0.00042618695,0.000056180033,0.0003171036,0.0003130233,0.000087342894],"domain_scores_gemma":[0.99912304,0.0005760724,0.000091185626,0.0000446613,0.00014316892,0.000021879498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013964995,0.002091164,0.0015682135,0.00068802584,0.0004283689,0.001686383,0.0010728075,0.0016187322,0.003353718],"category_scores_gemma":[0.0029129176,0.00092308345,0.0013973096,0.0011762308,0.0011185718,0.0015408642,0.0016463067,0.002241204,0.001743514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007126569,0.000026291571,0.0001369175,0.00025585634,0.00008129853,0.000077434794,0.000054024797,0.8552439,0.0044572144,0.04383328,0.0028000367,0.09296242],"study_design_scores_gemma":[0.000011867608,0.000038517297,0.000030520034,0.000020233316,0.00001372138,0.000029725707,0.000009725778,0.98150116,0.0012089028,0.014176975,0.0029446883,0.000013911726],"about_ca_topic_score_codex":0.0018025725,"about_ca_topic_score_gemma":0.0014654624,"teacher_disagreement_score":0.003353718,"about_ca_system_score_codex":0.000782966,"about_ca_system_score_gemma":0.0013420467,"threshold_uncertainty_score":0.011219323},"labels":[],"label_agreement":null},{"id":"W2086285386","doi":"10.1109/tsp.2014.2305643","title":"Scalable and Efficient Power Control Algorithms for Wireless Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Power control; Computer science; Algorithm; Initialization; Computational complexity theory; Wireless network; Mathematical optimization; Power optimization; Scalability; Wireless; Power (physics); Mathematics; Telecommunications","score_opus":0.021943501066473612,"score_gpt":0.26339682382218876,"score_spread":0.24145332275571516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086285386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018867729,0.00049875665,0.99549305,0.00011964362,0.000038636736,0.000047463986,0.000019220854,0.00035164846,0.0015448433],"genre_scores_gemma":[0.2861801,0.0022166977,0.7045639,0.00019508995,0.00020471471,0.00078027195,0.00022282392,0.00024487806,0.0053914553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908924,0.0002608529,0.00005610269,0.00015723634,0.00035785954,0.00007867963],"domain_scores_gemma":[0.9985501,0.0009556131,0.00013140544,0.0001641458,0.00017099059,0.00002769353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015280719,0.0014932945,0.001058018,0.0007078022,0.00067922863,0.0013120858,0.0013442438,0.001048273,0.0035104624],"category_scores_gemma":[0.005213563,0.0005378377,0.00046513323,0.0013783127,0.0011462348,0.002023603,0.001232432,0.002173104,0.00097451534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038961884,0.000040168008,0.00016597241,0.000096519085,0.000024045054,0.000031799944,0.000056765373,0.8328255,0.001520121,0.05007606,0.0026797042,0.11244444],"study_design_scores_gemma":[0.000018049315,0.000013407076,0.000025072237,0.000008233845,0.00000270431,0.000011033273,0.000007010734,0.97801673,0.00037306754,0.020337053,0.0011835768,0.000004022031],"about_ca_topic_score_codex":0.002960103,"about_ca_topic_score_gemma":0.0033094673,"teacher_disagreement_score":0.0035104624,"about_ca_system_score_codex":0.001095464,"about_ca_system_score_gemma":0.0014735304,"threshold_uncertainty_score":0.011743724},"labels":[],"label_agreement":null},{"id":"W2089144974","doi":"10.1109/tsp.2008.2006584","title":"Constrained Adaptive Echo Cancellation for Discrete Multitone Systems","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Digital subscriber line; Computer science; Echo (communications protocol); Robustness (evolution); Single antenna interference cancellation; Asynchronous communication; Finite impulse response; Impulse response; Adaptive filter; Electronic engineering; Algorithm; Telecommunications; Mathematics; Decoding methods; Engineering","score_opus":0.034658010747528806,"score_gpt":0.2589277264657326,"score_spread":0.22426971571820378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089144974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040629953,0.00014554913,0.994253,0.000075109565,0.000016383852,0.000012054077,0.000017101787,0.000042303156,0.0013755382],"genre_scores_gemma":[0.6046114,0.0011898738,0.3792072,0.0002681786,0.00016850153,0.000226375,0.00024374225,0.00012687883,0.013957808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996656,0.000082308135,0.000015213501,0.000055958244,0.00015390845,0.00002690445],"domain_scores_gemma":[0.9995266,0.00028965235,0.000046213467,0.000029203951,0.00009406586,0.000014249874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039019037,0.0006052892,0.00049152225,0.00022714211,0.00022874099,0.0007150856,0.00052555476,0.00069629966,0.0018748645],"category_scores_gemma":[0.0012578411,0.00024934518,0.0003144182,0.00038128757,0.0005683805,0.00075451704,0.00070498185,0.00074910873,0.000314587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065554006,0.00003626857,0.00019442636,0.00016410327,0.000031645806,0.00012876892,0.00008246627,0.8710309,0.01707356,0.04176281,0.0011604322,0.06826909],"study_design_scores_gemma":[0.000008748434,0.000018908946,0.00006935596,0.000005039475,0.00000401497,0.000025844802,0.0000074569725,0.9919031,0.001993075,0.004682445,0.00127382,0.000008180561],"about_ca_topic_score_codex":0.0025952442,"about_ca_topic_score_gemma":0.0026185787,"teacher_disagreement_score":0.0025952442,"about_ca_system_score_codex":0.00045093521,"about_ca_system_score_gemma":0.00058943854,"threshold_uncertainty_score":0.006272018},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017074051812997423,"score_gpt":0.24089011460530252,"score_spread":0.2238160627923051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092323252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005869713,0.0000719273,0.99894816,0.000019976518,0.000010828054,0.000012054871,0.000012130593,0.00012519951,0.00021279632],"genre_scores_gemma":[0.09993053,0.00081674283,0.8942259,0.00011357626,0.00008519832,0.0004537965,0.0004202875,0.00024164411,0.003712275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913317,0.00022655015,0.00005151293,0.00021833082,0.00031385955,0.00005666693],"domain_scores_gemma":[0.9974421,0.001337115,0.00027578152,0.00020421142,0.0006931765,0.00004761609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013802962,0.0013674508,0.0010100921,0.0008469562,0.0005369165,0.0012011536,0.0018196226,0.0010599046,0.0030169107],"category_scores_gemma":[0.005733837,0.0007171145,0.0010382091,0.001261163,0.0009054939,0.0016729063,0.0019586512,0.0023062264,0.0018261202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011763239,0.00007788838,0.0012326388,0.00043320394,0.00008774389,0.00009616491,0.0003335877,0.5661964,0.014416259,0.04927319,0.00435059,0.36338463],"study_design_scores_gemma":[0.000014265718,0.000038030525,0.00020024393,0.000027827387,0.000010910131,0.000055132656,0.000033821823,0.9833974,0.0028704319,0.010562081,0.0027720842,0.000017737591],"about_ca_topic_score_codex":0.0022894582,"about_ca_topic_score_gemma":0.002761613,"teacher_disagreement_score":0.0030169107,"about_ca_system_score_codex":0.0006581079,"about_ca_system_score_gemma":0.0014753683,"threshold_uncertainty_score":0.010092616},"labels":[],"label_agreement":null},{"id":"W2095599465","doi":"10.1109/tsp.2004.838957","title":"Z-transform of quantized ramp signal","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Rounding; Infinite impulse response; Mathematics; Finite impulse response; Control theory (sociology); Digital filter; Algorithm; Impulse response; Transfer function; Integer (computer science); SIGNAL (programming language); Computer science; Bandwidth (computing); Mathematical analysis; Telecommunications; Engineering","score_opus":0.03508604869970796,"score_gpt":0.2847719954793001,"score_spread":0.24968594677959213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095599465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114552766,0.0005532022,0.8388446,0.00036596684,0.0005203904,0.00008910661,0.00085428654,0.001882488,0.042337246],"genre_scores_gemma":[0.74558765,0.000789326,0.22749065,0.00018022039,0.00013692296,0.00005972407,0.0011230257,0.00028256982,0.024349801],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998661,0.000010035098,0.000004828066,0.000023755963,0.0000789973,0.000016096592],"domain_scores_gemma":[0.9998431,0.000034186378,0.000011826117,0.000026374817,0.000074394404,0.000010107651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109336106,0.00023093435,0.00018387134,0.00038454367,0.00016021839,0.00051801035,0.0002863543,0.0002837018,0.012638805],"category_scores_gemma":[0.00070456875,0.00007878857,0.00014410478,0.00039990156,0.00023589369,0.00046334343,0.00028741392,0.00041487263,0.002291522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009377057,0.000071418435,0.0013030547,0.00045679935,0.00003264935,0.0012628296,0.00036426267,0.041452605,0.46776074,0.13078663,0.009785698,0.34578556],"study_design_scores_gemma":[0.000100060344,0.00047900723,0.005129895,0.0001233293,0.00004015633,0.0028924844,0.00035313063,0.58381397,0.3148943,0.03920773,0.05285563,0.00011031333],"about_ca_topic_score_codex":0.00045883306,"about_ca_topic_score_gemma":0.0004047191,"teacher_disagreement_score":0.012638805,"about_ca_system_score_codex":0.00016398926,"about_ca_system_score_gemma":0.00021526075,"threshold_uncertainty_score":0.04228103},"labels":[],"label_agreement":null},{"id":"W2095936794","doi":"10.1109/tsp.2011.2113178","title":"Bit Allocation Law for Multiantenna Channel Feedback Quantization: Single-User Case","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Codebook; Quantization (signal processing); Transmitter; Computer science; Vector quantization; Channel (broadcasting); Base station; Algorithm; Asymptotically optimal algorithm; Topology (electrical circuits); Mathematics; Telecommunications; Combinatorics","score_opus":0.04594563913003577,"score_gpt":0.2430850905346956,"score_spread":0.19713945140465983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095936794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025053393,0.0005054196,0.96382695,0.0007931346,0.000042069547,0.00008461631,0.000115393246,0.00015944082,0.009419623],"genre_scores_gemma":[0.9079462,0.00071984663,0.08097325,0.00038477153,0.0000809135,0.00027202105,0.00008699514,0.00009111876,0.009444756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986206,0.00036190441,0.000048083337,0.00022242627,0.0005865475,0.00016040515],"domain_scores_gemma":[0.99623126,0.0024091832,0.0003425376,0.00022261898,0.00069986674,0.000094561554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018918827,0.0007103243,0.000877863,0.00036784404,0.0004568447,0.001379915,0.001076733,0.0013029564,0.00451353],"category_scores_gemma":[0.008397033,0.00049755553,0.0002511796,0.0006617712,0.0018390022,0.0021330747,0.00083186064,0.0012619236,0.0008492517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001616273,0.000050262122,0.00065544446,0.00014892175,0.000025707592,0.00015713154,0.00022109557,0.8205385,0.0061133136,0.14827512,0.0021347585,0.021518094],"study_design_scores_gemma":[0.000015849013,0.00002775523,0.00013007544,0.00001405573,0.000004569646,0.000042854088,0.00001638146,0.98222625,0.00075160357,0.01624181,0.000517371,0.000011366275],"about_ca_topic_score_codex":0.0029800863,"about_ca_topic_score_gemma":0.0020804636,"teacher_disagreement_score":0.00451353,"about_ca_system_score_codex":0.002042957,"about_ca_system_score_gemma":0.0012036299,"threshold_uncertainty_score":0.015099287},"labels":[],"label_agreement":null},{"id":"W2096029268","doi":"10.1109/tsp.2004.828936","title":"Efficient Design of Oversampled NPR GDFT Filterbanks","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Filter bank; Aliasing; Distortion (music); Filter design; Filter (signal processing); Prototype filter; Algorithm; Computer science; Adaptive filter; Control theory (sociology); Mathematics; Telecommunications; Bandwidth (computing); Artificial intelligence; Computer vision","score_opus":0.0387772456183838,"score_gpt":0.2833965363452908,"score_spread":0.24461929072690697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096029268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056290743,0.000069133086,0.9937277,0.00004253284,0.000014023315,0.000020892407,0.000018885268,0.00012830694,0.00034955662],"genre_scores_gemma":[0.13707536,0.00020609338,0.8613098,0.00007488157,0.000032390726,0.00013939817,0.0001108354,0.000057820907,0.0009935246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952126,0.000148643,0.00003011123,0.000082859566,0.00018824583,0.00002887138],"domain_scores_gemma":[0.9992489,0.0003096873,0.000107752516,0.0001375215,0.00017021899,0.000025843146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011756899,0.0005349702,0.0006897177,0.00032453082,0.00025583734,0.00060833705,0.0007847339,0.0009219816,0.001425374],"category_scores_gemma":[0.0028622604,0.00039994082,0.00042456476,0.000313912,0.00057535263,0.0010272298,0.0005874285,0.0007248382,0.0004912199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061872683,0.00008476731,0.0008225059,0.0003924523,0.00010463324,0.00029928566,0.00030908518,0.21984778,0.25578755,0.06721812,0.0024648893,0.45205015],"study_design_scores_gemma":[0.00007837147,0.00023933871,0.0004215526,0.000023575814,0.000031764568,0.0003456233,0.00003189424,0.9387374,0.044804163,0.0076751597,0.007580425,0.000030698757],"about_ca_topic_score_codex":0.0006156778,"about_ca_topic_score_gemma":0.0010618884,"teacher_disagreement_score":0.001425374,"about_ca_system_score_codex":0.00045858911,"about_ca_system_score_gemma":0.00067226856,"threshold_uncertainty_score":0.006217718},"labels":[],"label_agreement":null},{"id":"W2096352571","doi":"10.1109/tsp.2004.831128","title":"Efficient Adaptive Algorithms and Minimax Bounds for Zero-Delay Lossy Source Coding","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Minimax; Bounded function; Upper and lower bounds; Algorithm; Redundancy (engineering); Rate–distortion theory; Discrete mathematics; Distortion (music); Combinatorics; Data compression; Computer science; Mathematical optimization; Mathematical analysis","score_opus":0.024775833374553607,"score_gpt":0.2605651538793277,"score_spread":0.2357893205047741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096352571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076434896,0.00030130465,0.9897333,0.0001225515,0.000019858682,0.000050637133,0.000022222692,0.00019275388,0.001914013],"genre_scores_gemma":[0.39497015,0.0009799431,0.59880257,0.0001847841,0.00009059894,0.00046759233,0.00014624697,0.00010466711,0.004253463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987048,0.00039772503,0.000073668234,0.00025153995,0.0004575585,0.000114759605],"domain_scores_gemma":[0.9954667,0.003162707,0.0004985999,0.0004638464,0.00034596302,0.00006219984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015065015,0.0010510955,0.00078293873,0.0008119224,0.0004941049,0.0011919877,0.0019584768,0.0012012166,0.0017695711],"category_scores_gemma":[0.009837289,0.0004385564,0.0005311628,0.0011531201,0.0016388623,0.0026343097,0.0015699584,0.0020597607,0.000515473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019139069,0.00006211922,0.00047843312,0.000142249,0.000039739847,0.00006299206,0.00015412897,0.54856694,0.0096734725,0.32838422,0.0013472446,0.11089702],"study_design_scores_gemma":[0.000022720307,0.00004771512,0.0000873647,0.000018962664,0.0000071493164,0.000042519932,0.000011886297,0.9239301,0.0038185567,0.07093035,0.0010674555,0.000015224598],"about_ca_topic_score_codex":0.0008512715,"about_ca_topic_score_gemma":0.0007915281,"teacher_disagreement_score":0.0020862303,"about_ca_system_score_codex":0.0020862303,"about_ca_system_score_gemma":0.0010763023,"threshold_uncertainty_score":0.015136778},"labels":[],"label_agreement":null},{"id":"W2096575660","doi":"10.1109/tsp.2007.894379","title":"Cooperative Recurrent Neural Networks for the Constrained $L_{1}$ Estimator","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Estimator; Artificial neural network; Computer science; Convergence (economics); Artificial intelligence; Algorithm; Mathematics; Statistics","score_opus":0.028859370346108748,"score_gpt":0.2921786131692397,"score_spread":0.26331924282313096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096575660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005699498,0.00021073036,0.9925638,0.000095621544,0.000021828986,0.000021983415,0.00001946902,0.00022843346,0.001138592],"genre_scores_gemma":[0.4529314,0.0004697731,0.5365472,0.00030749236,0.000113403876,0.00026680378,0.00026177874,0.00017081444,0.008931436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891365,0.00033903867,0.00006545726,0.00032016393,0.0002835189,0.00007815626],"domain_scores_gemma":[0.9987017,0.0006101765,0.00016467986,0.00012760583,0.00035541825,0.000040488336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002142775,0.0009337675,0.0009261695,0.00048058984,0.0003894139,0.00083873316,0.0018691951,0.0011741711,0.0023835578],"category_scores_gemma":[0.005449226,0.00048673677,0.00075226533,0.0005589994,0.0006217642,0.001514485,0.0011879366,0.0012657342,0.00067445333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023627897,0.00011207367,0.0011199573,0.00019740632,0.0001549955,0.00013243062,0.000182843,0.5884729,0.009963724,0.056221176,0.0040479894,0.33915818],"study_design_scores_gemma":[0.000007677871,0.00002353382,0.00009436098,0.0000061397723,0.000013342592,0.000014350227,0.0000051435613,0.9945163,0.0010784263,0.0035277964,0.0007049791,0.000008008644],"about_ca_topic_score_codex":0.005997623,"about_ca_topic_score_gemma":0.0071097156,"teacher_disagreement_score":0.005997623,"about_ca_system_score_codex":0.0007810925,"about_ca_system_score_gemma":0.0013098483,"threshold_uncertainty_score":0.011925459},"labels":[],"label_agreement":null},{"id":"W2096949977","doi":"10.1109/tsp.2004.836538","title":"Multiresolution Modeling and Estimation of Multisensor Data","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Kalman filter; Projection (relational algebra); Multiresolution analysis; Computer science; State-space representation; Algorithm; Sensor fusion; State space; Mathematics; Control theory (sociology); Artificial intelligence; Wavelet transform; Wavelet; Discrete wavelet transform","score_opus":0.050780847339467514,"score_gpt":0.2865460256485907,"score_spread":0.2357651783091232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096949977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003537893,0.00015650199,0.9958657,0.00005423843,0.000013190425,0.0000071853383,0.000025995754,0.00010288681,0.00023639953],"genre_scores_gemma":[0.48760763,0.0013054386,0.50886005,0.000082510785,0.00012134928,0.00010341416,0.0003553762,0.00010319219,0.0014610649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861336,0.00033955937,0.00008566178,0.00030166435,0.0005673313,0.00009236032],"domain_scores_gemma":[0.9989679,0.00041064326,0.00017827879,0.00025817985,0.00015320434,0.000031852924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013405241,0.000682166,0.0011080307,0.0010426875,0.00036634516,0.0012275056,0.0011465641,0.00089243957,0.0007664432],"category_scores_gemma":[0.0050623105,0.0006995862,0.0012377771,0.0011856667,0.00062568026,0.0024407837,0.001535959,0.0013433478,0.00030993755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008527973,0.000035919948,0.001023246,0.00015486334,0.000100392426,0.00020579179,0.00023998792,0.8123765,0.012984399,0.057763405,0.000738773,0.11429153],"study_design_scores_gemma":[0.0000030725998,0.000013182595,0.00019636548,0.0000059215636,0.000010084375,0.000033560133,0.000010368373,0.98904467,0.0014697954,0.008246371,0.00095587975,0.0000108053655],"about_ca_topic_score_codex":0.0030548964,"about_ca_topic_score_gemma":0.0018969435,"teacher_disagreement_score":0.0030548964,"about_ca_system_score_codex":0.0005874346,"about_ca_system_score_gemma":0.00057254167,"threshold_uncertainty_score":0.007089436},"labels":[],"label_agreement":null},{"id":"W2097672548","doi":"10.1109/tsp.2005.855075","title":"A new information-theoretic approach to signal denoising and best basis selection","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Noise reduction; Noise (video); Basis (linear algebra); Subspace topology; Algorithm; Mathematics; Variance (accounting); Thresholding; Noise measurement; Linear subspace; Probabilistic logic; Mathematical optimization; Computer science; Pattern recognition (psychology); Statistics; Artificial intelligence","score_opus":0.018083316119496373,"score_gpt":0.26118784977596093,"score_spread":0.24310453365646456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097672548","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049374095,0.00053106004,0.99762696,0.00021669581,0.000048975522,0.00000761522,0.000015768588,0.000022742439,0.0010364065],"genre_scores_gemma":[0.09554797,0.0043606963,0.8913175,0.0006403918,0.0013390061,0.00020000282,0.00019358742,0.00016657972,0.0062341676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99805874,0.00072889106,0.00009743622,0.00031218864,0.0007206692,0.00008202973],"domain_scores_gemma":[0.99776924,0.0012961255,0.00017638135,0.00026984172,0.00041036084,0.00007804707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032441774,0.0011550757,0.002073874,0.0023228764,0.00064789417,0.0022078068,0.0023694828,0.0020033305,0.0017419526],"category_scores_gemma":[0.0060898196,0.000746322,0.0015297468,0.0019119049,0.0023473017,0.0033148385,0.0021908935,0.003194274,0.00066480803],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006738119,0.00006873303,0.00030535125,0.00033305184,0.00015481681,0.00015998796,0.0001465888,0.16340584,0.0059526837,0.72726357,0.004186789,0.097955294],"study_design_scores_gemma":[0.000015740905,0.00007580404,0.00013124134,0.000049046495,0.000038697868,0.00021977154,0.000027969765,0.62800694,0.0022765277,0.36152363,0.0075894394,0.000045180605],"about_ca_topic_score_codex":0.00063780794,"about_ca_topic_score_gemma":0.00065888866,"teacher_disagreement_score":0.0032441774,"about_ca_system_score_codex":0.0011108574,"about_ca_system_score_gemma":0.0010942077,"threshold_uncertainty_score":0.017157078},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01669496514568091,"score_gpt":0.21379491919067617,"score_spread":0.19709995404499525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098061185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038807846,0.00013542904,0.99435115,0.00007911162,0.000018902181,0.000021027407,0.000028529985,0.00009625629,0.0013887496],"genre_scores_gemma":[0.4854305,0.0008561698,0.505902,0.00028997278,0.0002609506,0.00036524073,0.00032278878,0.00010503896,0.0064674253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978333,0.0007023958,0.00011995462,0.00034966745,0.0008156089,0.00017912262],"domain_scores_gemma":[0.99772686,0.0010364318,0.00035133676,0.00025288423,0.0005683631,0.000064105894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001979129,0.0015556419,0.0014809262,0.0004817191,0.00040779292,0.0014077815,0.0012048424,0.0013544764,0.0020375785],"category_scores_gemma":[0.0054155947,0.00076815276,0.0006291464,0.0006186722,0.0007596069,0.001909348,0.0013369756,0.0009392447,0.0011444881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022240398,0.000100359146,0.00091970153,0.00039161224,0.00014965981,0.00022907049,0.00024881994,0.8311574,0.023661377,0.039145224,0.0019554973,0.10181882],"study_design_scores_gemma":[0.000035134068,0.00023999134,0.00023933238,0.000025466488,0.00004962098,0.00023217495,0.00003703494,0.980775,0.008443962,0.008201682,0.0016914856,0.000029035918],"about_ca_topic_score_codex":0.0005075384,"about_ca_topic_score_gemma":0.0007849146,"teacher_disagreement_score":0.0020375785,"about_ca_system_score_codex":0.00054137246,"about_ca_system_score_gemma":0.0011690252,"threshold_uncertainty_score":0.010466754},"labels":[],"label_agreement":null},{"id":"W2099468993","doi":"10.1109/tsp.2010.2056687","title":"MIMO Relaying Broadcast Channels With Linear Precoding and Quantized Channel State Information Feedback","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Precoding; Channel state information; MIMO; Relay; Computer science; Zero-forcing precoding; Quantization (signal processing); Transmitter power output; Channel (broadcasting); Relay channel; Control theory (sociology); Computer network; Topology (electrical circuits); Telecommunications; Wireless; Transmitter; Power (physics); Engineering; Algorithm; Electrical engineering; Physics","score_opus":0.011176086336404864,"score_gpt":0.21942843342265198,"score_spread":0.20825234708624712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099468993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09989912,0.001436723,0.88540465,0.00046677765,0.00011880143,0.00010943717,0.00032393853,0.00035695347,0.011883656],"genre_scores_gemma":[0.9648921,0.0007641951,0.031293016,0.00005808882,0.00006146272,0.00008389972,0.000088241075,0.000012235455,0.002746748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988194,0.00041213655,0.00004188222,0.00013764067,0.00035031285,0.00023857229],"domain_scores_gemma":[0.9978168,0.0012336347,0.0003049102,0.00022944582,0.00036088462,0.000054322514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013553061,0.0009639913,0.0010299535,0.00040343538,0.0005250916,0.001192024,0.0009319218,0.0010556348,0.0014072204],"category_scores_gemma":[0.0029707823,0.00041181137,0.00041623157,0.0009020391,0.0014130991,0.0011174163,0.00082768867,0.00084729283,0.0003372054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020454766,0.00003987339,0.00041721668,0.00014287818,0.00003171335,0.0003751158,0.00009283431,0.92471075,0.007800576,0.05290966,0.001068579,0.012206215],"study_design_scores_gemma":[0.000023932194,0.00006619546,0.00011029658,0.0000064197493,0.0000161306,0.00006788711,0.000015988198,0.99286497,0.0014260852,0.0050496836,0.00033690393,0.000015523125],"about_ca_topic_score_codex":0.005369427,"about_ca_topic_score_gemma":0.0044819103,"teacher_disagreement_score":0.005369427,"about_ca_system_score_codex":0.0017139178,"about_ca_system_score_gemma":0.0008291218,"threshold_uncertainty_score":0.012435377},"labels":[],"label_agreement":null},{"id":"W2099862052","doi":"10.1109/78.902109","title":"Direction-of-arrival estimation of an amplitude-distorted wavefront","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Wavefront; Array processing; Distortion (music); Direction of arrival; Estimator; Amplitude; Robustness (evolution); Algorithm; Mathematics; Estimation theory; Parameterized complexity; Signal processing; Computer science; Physics; Statistics; Optics; Telecommunications","score_opus":0.021424995449398108,"score_gpt":0.2852116709079119,"score_spread":0.26378667545851375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099862052","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00934272,0.00021145123,0.98957986,0.00007363146,0.000021955673,0.000014276042,0.000041340743,0.00023511067,0.00047967126],"genre_scores_gemma":[0.22525083,0.0010782378,0.7710542,0.00007962601,0.000085129155,0.000058228085,0.00038946207,0.000113151094,0.0018912079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995328,0.00011970256,0.000026862266,0.000092731716,0.00019655695,0.000031353342],"domain_scores_gemma":[0.9991347,0.00033836617,0.00016548522,0.00014468968,0.00019349251,0.000023231936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066591456,0.00096788094,0.0008348062,0.00061359437,0.00021205978,0.0007157756,0.00072751846,0.0010309623,0.0007440006],"category_scores_gemma":[0.0046008728,0.00054726173,0.0005661371,0.00080864667,0.0005232667,0.0010006607,0.0008676928,0.00097319233,0.001084119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054155325,0.000113701215,0.0031271088,0.00047120746,0.00018150992,0.0003076828,0.0001910078,0.3585359,0.17617357,0.03313397,0.0034052646,0.42381752],"study_design_scores_gemma":[0.00003727049,0.000073086994,0.001620046,0.00002224154,0.00004295833,0.00049738085,0.00003132342,0.9433605,0.041553322,0.009534146,0.0031742472,0.000053434575],"about_ca_topic_score_codex":0.0011983761,"about_ca_topic_score_gemma":0.0014467445,"teacher_disagreement_score":0.0011983761,"about_ca_system_score_codex":0.00029713722,"about_ca_system_score_gemma":0.00065029354,"threshold_uncertainty_score":0.0035217404},"labels":[],"label_agreement":null},{"id":"W2099901255","doi":"10.1109/tsp.2009.2016240","title":"Incremental Distributed Identification of Markov Random Field Models in Wireless Sensor Networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Western Canada Research Grid","keywords":"Wireless sensor network; Computer science; Scalability; Identification (biology); Fusion center; Markov process; Wireless network; Markov chain; Sensor fusion; Wireless; Field (mathematics); Distributed computing; Hidden Markov model; Markov random field; Distributed algorithm; Computer network; Artificial intelligence; Machine learning; Telecommunications; Mathematics; Cognitive radio","score_opus":0.012753221418826314,"score_gpt":0.23848846926327105,"score_spread":0.22573524784444474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099901255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0160459,0.000109062436,0.98324996,0.00010272265,0.000010253155,0.000014969216,0.000014190583,0.00018761348,0.00026534178],"genre_scores_gemma":[0.83104277,0.00041507356,0.16642964,0.00010572359,0.00007818114,0.0001780069,0.00017861245,0.00006939291,0.001502712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989556,0.00048482817,0.00004000147,0.00018056291,0.00025752504,0.000081397724],"domain_scores_gemma":[0.99386793,0.0048372527,0.00048038768,0.00039302834,0.0003376021,0.000083842075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020419182,0.00059350615,0.00085821183,0.00058508303,0.00039806013,0.0006168116,0.001434314,0.0008831717,0.00047409558],"category_scores_gemma":[0.01278409,0.00065831904,0.0005255981,0.0005215207,0.0011606225,0.0015813465,0.0012747075,0.0012011795,0.00018153472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003962342,0.000022434595,0.00044920915,0.000025990754,0.000018899356,0.000043100415,0.00004348301,0.9656758,0.00089644,0.014718976,0.00023171827,0.017834416],"study_design_scores_gemma":[0.0000028134268,0.000005872863,0.000042619835,0.0000011501178,0.0000018535098,0.000006153123,0.0000017566897,0.9938788,0.00014407272,0.0058593787,0.00005271959,0.0000028901497],"about_ca_topic_score_codex":0.004977716,"about_ca_topic_score_gemma":0.0045976522,"teacher_disagreement_score":0.004977716,"about_ca_system_score_codex":0.0007855263,"about_ca_system_score_gemma":0.001050557,"threshold_uncertainty_score":0.010798812},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.032189995492179324,"score_gpt":0.26641233957796084,"score_spread":0.23422234408578152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100218807","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004123929,0.0010309169,0.9909875,0.0003097029,0.0002477885,0.000058037593,0.00019294018,0.00019901065,0.0065617426],"genre_scores_gemma":[0.038668524,0.006763548,0.9246223,0.00093149365,0.0011975991,0.00062498334,0.0009771736,0.00037109494,0.02584334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943846,0.000100682075,0.00006267646,0.0001359193,0.00022475526,0.0000375318],"domain_scores_gemma":[0.9996432,0.00015274124,0.000042497715,0.000054892218,0.00009278371,0.000013832915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009047601,0.0014686162,0.0006638175,0.0012479044,0.00048363852,0.0018249891,0.0016414039,0.002248273,0.009034173],"category_scores_gemma":[0.0015808505,0.0004586238,0.0012479567,0.0021625904,0.0014358206,0.002634038,0.00084926956,0.0024556173,0.007277293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049528353,0.0000441155,0.00022946823,0.00052128703,0.000034612356,0.0005419584,0.0002591786,0.037611783,0.0195947,0.7775723,0.014624422,0.1489167],"study_design_scores_gemma":[0.000026788373,0.0002075773,0.0004122797,0.00016831634,0.000034824956,0.002648542,0.00013310957,0.23738357,0.008544211,0.47430423,0.27604747,0.000089107416],"about_ca_topic_score_codex":0.001359788,"about_ca_topic_score_gemma":0.0010196427,"teacher_disagreement_score":0.009034173,"about_ca_system_score_codex":0.00046457734,"about_ca_system_score_gemma":0.0009666,"threshold_uncertainty_score":0.030222356},"labels":[],"label_agreement":null},{"id":"W2100677453","doi":"10.1109/tsp.2006.885738","title":"Trace-Orthonormal Full-Diversity Cyclotomic Space–Time Codes","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Pairwise error probability; Orthonormal basis; Transmitter; Mathematics; Block code; Space–time code; Quadrature amplitude modulation; Diversity gain; Space–time block code; Algorithm; MIMO; Computer science; Topology (electrical circuits); Telecommunications; Bit error rate; Decoding methods; Combinatorics; Fading","score_opus":0.013001291111484369,"score_gpt":0.2406084960904453,"score_spread":0.22760720497896092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100677453","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041938912,0.0003409579,0.949287,0.00017370404,0.000038829276,0.00004306642,0.00009181589,0.00010310761,0.007982609],"genre_scores_gemma":[0.65516454,0.00070037326,0.33853075,0.00016594854,0.00007222882,0.00013830364,0.0002380422,0.000057147674,0.004932629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994692,0.00013548335,0.00003225558,0.0001006152,0.0001983211,0.00006399445],"domain_scores_gemma":[0.99926394,0.00021705181,0.00015578246,0.00011753898,0.00020578902,0.000039810824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005778455,0.00046912202,0.0003655841,0.00036726118,0.0003116579,0.00066059735,0.00047469293,0.0004973936,0.0012096836],"category_scores_gemma":[0.0017070718,0.00020065412,0.00025246025,0.0006517873,0.0007006133,0.00067570055,0.00047994894,0.00051217317,0.00042381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001630837,0.00005557713,0.0010825297,0.00021901792,0.000046605506,0.00018780166,0.00020866415,0.372457,0.03829576,0.48532048,0.0016563705,0.10030719],"study_design_scores_gemma":[0.000039615996,0.00023930495,0.0003362004,0.000046104786,0.000022395936,0.00032758559,0.000057597797,0.8579381,0.029375788,0.10155626,0.010020659,0.000040465176],"about_ca_topic_score_codex":0.00047907504,"about_ca_topic_score_gemma":0.00062488974,"teacher_disagreement_score":0.0012096836,"about_ca_system_score_codex":0.00055546593,"about_ca_system_score_gemma":0.0008309639,"threshold_uncertainty_score":0.0040467978},"labels":[],"label_agreement":null},{"id":"W2101095696","doi":"10.1109/tsp.2004.828941","title":"Spectrum Estimation Using Multirate Observations","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Simon Fraser University; University of Delaware","keywords":"Spectral density; Autocorrelation; Spectral density estimation; Algorithm; Mathematics; Computation; SIGNAL (programming language); Discrete-time signal; Sampling (signal processing); Maximum entropy spectral estimation; Entropy (arrow of time); Signal processing; Stationary process; Computer science; Principle of maximum entropy; Applied mathematics; Statistics; Signal transfer function; Fourier transform; Mathematical analysis; Digital signal processing; Analog signal; Telecommunications","score_opus":0.16491045934704734,"score_gpt":0.34432544567450646,"score_spread":0.17941498632745911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101095696","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024554476,0.00020622155,0.97446096,0.00006566134,0.000016657199,0.000012286524,0.000030178833,0.000108079,0.0005454274],"genre_scores_gemma":[0.7335686,0.0006943349,0.26394892,0.00007210091,0.000100864425,0.000055889497,0.00018909933,0.000053225158,0.0013169592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993017,0.0002743579,0.00003996255,0.00015061053,0.00018352082,0.000049877257],"domain_scores_gemma":[0.99754435,0.0015904426,0.0003582274,0.00029807593,0.00016493986,0.00004401965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001265848,0.00068872684,0.0009668469,0.0006530315,0.0002469742,0.0009985922,0.000747568,0.0009136704,0.0007870691],"category_scores_gemma":[0.007838011,0.0005308477,0.00063357153,0.00055957516,0.00072046445,0.0026408564,0.0011677453,0.0009408537,0.00028521675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004778161,0.00006757541,0.004376459,0.0002606769,0.00011347521,0.0003108709,0.00021142374,0.8152513,0.021070497,0.028360626,0.00044788126,0.12905136],"study_design_scores_gemma":[0.000008770392,0.000037157984,0.00064694113,0.000019047162,0.000012012046,0.00008249892,0.000016843162,0.98590565,0.004375192,0.008439686,0.00044192086,0.000014372685],"about_ca_topic_score_codex":0.0008893353,"about_ca_topic_score_gemma":0.0008379003,"teacher_disagreement_score":0.001265848,"about_ca_system_score_codex":0.00032175114,"about_ca_system_score_gemma":0.00032030104,"threshold_uncertainty_score":0.0066945553},"labels":[],"label_agreement":null},{"id":"W2101480027","doi":"10.1109/78.845930","title":"Blind identification of FIR systems driven by Markov-like input signals","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Finite impulse response; Algorithm; Autocorrelation; A priori and a posteriori; Mathematics; Impulse response; Blind equalization; Signal processing; System identification; Computer science; Context (archaeology); Equalization (audio); Speech recognition; Decoding methods; Statistics; Digital signal processing","score_opus":0.01865191987931289,"score_gpt":0.2705058682826039,"score_spread":0.251853948403291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101480027","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052295853,0.000049559436,0.9943223,0.000024459807,0.000014441819,0.000010574358,0.000006858768,0.00014071862,0.00020147499],"genre_scores_gemma":[0.24952938,0.00020190046,0.74722004,0.000107135,0.00006111043,0.0000944788,0.000068248424,0.000030895455,0.0026868382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996469,0.00008181974,0.000022745973,0.0000721813,0.00013132553,0.000044957465],"domain_scores_gemma":[0.9992072,0.0004262927,0.0001370498,0.00008470347,0.00011911353,0.00002560192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078574836,0.00039341598,0.0004767421,0.00036373138,0.00026661053,0.00038621892,0.00067041314,0.00068352965,0.00092996826],"category_scores_gemma":[0.0021155241,0.00032395,0.00032492244,0.00027209026,0.00056663586,0.00072288874,0.0006603254,0.0006847793,0.0003353207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034321757,0.00009865285,0.0015728676,0.0001382483,0.00008946545,0.00014184524,0.00015737941,0.51427513,0.047410913,0.053544257,0.00148276,0.3807452],"study_design_scores_gemma":[0.00001626323,0.00003112917,0.00015799399,0.0000036654492,0.0000058685255,0.00004340494,0.0000028492448,0.9884637,0.0063159005,0.0043772254,0.0005713735,0.000010560939],"about_ca_topic_score_codex":0.0012481628,"about_ca_topic_score_gemma":0.0019095023,"teacher_disagreement_score":0.0012481628,"about_ca_system_score_codex":0.0003714035,"about_ca_system_score_gemma":0.00082892354,"threshold_uncertainty_score":0.0041555166},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.014977710386906401,"score_gpt":0.2444535555597215,"score_spread":0.2294758451728151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102511552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08872573,0.0003154497,0.9092363,0.00009191822,0.000039731774,0.00004205382,0.00003668514,0.00054938486,0.0009627946],"genre_scores_gemma":[0.68703187,0.00037755928,0.31119177,0.0000642291,0.000065770815,0.00007859404,0.00006823877,0.000077765115,0.001044297],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990671,0.0002225739,0.000026430233,0.000120080265,0.000528584,0.000035294343],"domain_scores_gemma":[0.99778026,0.0013575329,0.0003200008,0.00023909971,0.00025125197,0.000051918894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065130426,0.00060332596,0.00078301487,0.0011380223,0.00021358655,0.0005390612,0.00057198206,0.00068802293,0.00072543183],"category_scores_gemma":[0.004490405,0.0004196987,0.00032570367,0.00048802336,0.0008879966,0.0013409038,0.0010325866,0.0008196345,0.00045627283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010723844,0.00011541694,0.006040957,0.00041637683,0.00014589123,0.00045121068,0.00029107634,0.04608296,0.5685583,0.020907382,0.00084945286,0.35506853],"study_design_scores_gemma":[0.000047803107,0.0005854433,0.004766638,0.000029104422,0.00005945841,0.002076589,0.000065939734,0.6259934,0.35359797,0.009889726,0.0028089671,0.00007897524],"about_ca_topic_score_codex":0.00009945746,"about_ca_topic_score_gemma":0.00013182622,"teacher_disagreement_score":0.0011380223,"about_ca_system_score_codex":0.00021339805,"about_ca_system_score_gemma":0.00020409218,"threshold_uncertainty_score":0.0034444332},"labels":[],"label_agreement":null},{"id":"W2103672432","doi":"10.1109/tsp.2011.2167617","title":"Instantaneous Erasures in Oversampled Filter Banks: Conditions for Output Perfect Reconstruction","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Erasure; Filter bank; Algorithm; Frame (networking); Robustness (evolution); Mathematics; Filter (signal processing); Signal reconstruction; Binary erasure channel; Computer science; Discrete mathematics; Channel (broadcasting); Signal processing; Telecommunications; Computer vision; Channel capacity","score_opus":0.07332649796910243,"score_gpt":0.2779547726074001,"score_spread":0.20462827463829766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103672432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08021098,0.0009579176,0.9105371,0.000622021,0.00019178222,0.00009756597,0.0006574549,0.0005662062,0.006158957],"genre_scores_gemma":[0.8647414,0.0015121312,0.12794378,0.00035043003,0.0005082482,0.00026131357,0.0010350411,0.00027817348,0.0033694243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952657,0.0008248181,0.0004612037,0.0009922541,0.0017411024,0.0007149127],"domain_scores_gemma":[0.9732683,0.01662362,0.003424277,0.0025472208,0.003389821,0.00074673456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004649967,0.0011920058,0.0017318792,0.0013575753,0.0007578419,0.0021899794,0.0012246788,0.0024951193,0.0040273527],"category_scores_gemma":[0.03214249,0.0006614305,0.0008524371,0.00084039354,0.0038134523,0.0057110875,0.0022055642,0.002298988,0.00096972426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017105095,0.00021975706,0.0039958,0.0011549849,0.00014610315,0.0040844223,0.0011814144,0.15583687,0.110222995,0.6478475,0.0038644355,0.0697352],"study_design_scores_gemma":[0.00021618976,0.00087939535,0.0035147276,0.00027858914,0.000090727786,0.002758139,0.00072263903,0.5653741,0.15483966,0.26145416,0.009648869,0.00022280052],"about_ca_topic_score_codex":0.0008182922,"about_ca_topic_score_gemma":0.0005593709,"teacher_disagreement_score":0.004649967,"about_ca_system_score_codex":0.00079626957,"about_ca_system_score_gemma":0.0013650229,"threshold_uncertainty_score":0.024591684},"labels":[],"label_agreement":null},{"id":"W2104820701","doi":"10.1109/tsp.2006.887126","title":"Matrix-Group Algorithm via Improved Whitening Process for Extracting Statistically Independent Sources From Array Signals","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Science Foundation","keywords":"Blind signal separation; Algorithm; Independent component analysis; Mathematics; Subspace topology; Orthogonality; Convergence (economics); Matrix (chemical analysis); Function (biology); Signal subspace; Noise (video); Computer science; Artificial intelligence","score_opus":0.021350499863772913,"score_gpt":0.3133550508845633,"score_spread":0.29200455102079037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104820701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035762046,0.000059496557,0.9958395,0.000023016612,0.0000129654145,0.000015573818,0.000006821694,0.00009935152,0.0003671363],"genre_scores_gemma":[0.05916843,0.00010807627,0.9388747,0.000040774667,0.000030052965,0.00009165432,0.00007228161,0.000055084158,0.0015589104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995003,0.00015089122,0.000022642265,0.00010763315,0.00018266233,0.00003585998],"domain_scores_gemma":[0.9995739,0.00018053447,0.000053576598,0.00006812815,0.00010939646,0.000014450037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079310464,0.00078314915,0.00058997556,0.00070268684,0.00032738355,0.00043268016,0.0008471758,0.0007212074,0.0019021772],"category_scores_gemma":[0.0020048162,0.0002461704,0.0005937877,0.00076072384,0.00058843044,0.0011672487,0.0007837853,0.0008977426,0.0007478473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038885386,0.000094133604,0.00044569437,0.00018038396,0.00008573718,0.00011234794,0.00024795084,0.27644384,0.065631725,0.0716406,0.0017012013,0.5830276],"study_design_scores_gemma":[0.000030945204,0.00013690484,0.00018836737,0.000008195878,0.000015945412,0.000064423104,0.000014230292,0.97487664,0.012054689,0.009550128,0.0030419573,0.000017583834],"about_ca_topic_score_codex":0.0011961317,"about_ca_topic_score_gemma":0.0015347141,"teacher_disagreement_score":0.0019021772,"about_ca_system_score_codex":0.00033402786,"about_ca_system_score_gemma":0.00068884925,"threshold_uncertainty_score":0.006363392},"labels":[],"label_agreement":null},{"id":"W2104998743","doi":"10.1109/tsp.2011.2159212","title":"Lifetime Maximization in UWB Sensor Networks for Event Detection","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Wireless sensor network; Maximization; Robustness (evolution); Convex optimization; Optimization problem; Quantization (signal processing); Real-time computing; Mathematical optimization; Computer network; Algorithm; Regular polygon","score_opus":0.02210106454303009,"score_gpt":0.23213489404223353,"score_spread":0.21003382949920343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104998743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012298149,0.0007683906,0.9853652,0.00015657574,0.00001403989,0.000015969674,0.000027432938,0.00007603165,0.0012780724],"genre_scores_gemma":[0.7812499,0.002004029,0.21366192,0.00013370381,0.00007215883,0.00015021459,0.00014993292,0.000109000954,0.002469131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992238,0.00037890152,0.000026777932,0.00012961138,0.00018697104,0.000053805972],"domain_scores_gemma":[0.9988182,0.00081924826,0.00014857783,0.00006496656,0.0001190432,0.000029836932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015870127,0.00060993823,0.0005919354,0.00036930098,0.00025481684,0.0007180831,0.00068626396,0.00055228965,0.000655497],"category_scores_gemma":[0.003983536,0.0003113449,0.00040310167,0.00065408327,0.00069789344,0.0013502904,0.0008245882,0.0007035053,0.00015915636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096896,0.000035057947,0.00050490646,0.00015970027,0.00003732846,0.00008307421,0.00013089353,0.9081417,0.008064167,0.039706025,0.0009799981,0.042060293],"study_design_scores_gemma":[0.0000068821787,0.000032100066,0.00012474769,0.000008489495,0.000008036695,0.000034258377,0.000017700107,0.98046803,0.0018960527,0.016642047,0.00075455307,0.000007223448],"about_ca_topic_score_codex":0.0006576395,"about_ca_topic_score_gemma":0.00058613345,"teacher_disagreement_score":0.0015870127,"about_ca_system_score_codex":0.0008565701,"about_ca_system_score_gemma":0.0006100121,"threshold_uncertainty_score":0.008393049},"labels":[],"label_agreement":null},{"id":"W2105693703","doi":"10.1109/tsp.2006.887568","title":"Error Analysis of a Localization Algorithm for Finite-Duration Events","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Monte Carlo method; Algorithm; Bandwidth (computing); Energy (signal processing); Variance (accounting); Computer science; Position (finance); Expression (computer science); Mathematics; Statistics; Telecommunications","score_opus":0.02555956947572719,"score_gpt":0.2936292682509715,"score_spread":0.26806969877524434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105693703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034424756,0.00016051962,0.9646204,0.00008405218,0.00002116376,0.000011470469,0.00001558165,0.0001489195,0.00051307376],"genre_scores_gemma":[0.790235,0.00019728937,0.20730211,0.00005774109,0.000054331937,0.00006954245,0.00013695008,0.00018328776,0.0017637912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976973,0.00055708404,0.00011169053,0.00035399085,0.0011472647,0.00013273323],"domain_scores_gemma":[0.9829244,0.013550811,0.0008490647,0.00080991554,0.001707747,0.0001581134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004035775,0.00054204365,0.00063853234,0.0007876337,0.0004506703,0.0011959563,0.0011772716,0.0010732414,0.0010640621],"category_scores_gemma":[0.026400834,0.00039879847,0.00046541356,0.0005849604,0.0009830513,0.0016506339,0.0012867386,0.00084780005,0.00027602023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037574506,0.000032506105,0.002268089,0.00007249099,0.00006820193,0.00009641028,0.00012867036,0.9113904,0.008826491,0.030299919,0.00027410095,0.046166934],"study_design_scores_gemma":[0.000006490769,0.000031507796,0.00041420205,0.0000056012173,0.000005362696,0.000042398333,0.000006724224,0.9944687,0.0021984295,0.0026686336,0.00014276915,0.000009207172],"about_ca_topic_score_codex":0.0018915858,"about_ca_topic_score_gemma":0.00091710634,"teacher_disagreement_score":0.004035775,"about_ca_system_score_codex":0.0010167457,"about_ca_system_score_gemma":0.0010282231,"threshold_uncertainty_score":0.02134347},"labels":[],"label_agreement":null},{"id":"W2105751676","doi":"10.1109/78.887000","title":"Design and multiplier-less implementation of a class of two-channel PR FIR filterbanks and wavelets with low system delay","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Finite impulse response; Mathematics; Group delay and phase delay; Stopband; Linear phase; Algorithm; Control theory (sociology); Parameterized complexity; Filter (signal processing); Computer science; Band-pass filter; Electronic engineering","score_opus":0.022924915260695462,"score_gpt":0.2619199050629204,"score_spread":0.23899498980222494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105751676","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011805411,0.00014249599,0.9866562,0.00004215248,0.000037672904,0.000043618016,0.000033007887,0.00024242715,0.0009969302],"genre_scores_gemma":[0.1719498,0.00027023014,0.8252039,0.000065212655,0.00006448481,0.00018865948,0.00016143643,0.00004443691,0.002051811],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980503,0.000040750972,0.000016041438,0.000052884552,0.00006436445,0.000020881873],"domain_scores_gemma":[0.99979085,0.000056140645,0.000032099513,0.000046340047,0.000059514565,0.000015171937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044634021,0.00058179407,0.00042316227,0.0003533052,0.00020096851,0.0004961352,0.0007019058,0.0006249356,0.0016325698],"category_scores_gemma":[0.00063406833,0.0003252404,0.00041872225,0.00034514215,0.00028487487,0.0005293218,0.00035019728,0.00068841904,0.0008070532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046992928,0.000128626,0.00074220845,0.00028291388,0.00008256917,0.00030599418,0.00016076317,0.043269422,0.482916,0.03344774,0.0020544499,0.43613937],"study_design_scores_gemma":[0.00014366706,0.0006691606,0.0010186068,0.000029350973,0.00006523931,0.00063906517,0.000028934006,0.8350199,0.13747042,0.004331034,0.020546548,0.000038014397],"about_ca_topic_score_codex":0.0003115049,"about_ca_topic_score_gemma":0.00048281936,"teacher_disagreement_score":0.0016325698,"about_ca_system_score_codex":0.00026718716,"about_ca_system_score_gemma":0.00041230398,"threshold_uncertainty_score":0.005461514},"labels":[],"label_agreement":null},{"id":"W2106343541","doi":"10.1109/tsp.2011.2157499","title":"DOA Estimation of Temporally and Spatially Correlated Narrowband Noncircular Sources in Spatially Correlated White Noise","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Narrowband; Subspace topology; White noise; Mathematics; Correlation; Cramér–Rao bound; Algorithm; Signal-to-noise ratio (imaging); Signal subspace; Signal processing; Estimation theory; Noise (video); Statistics; Computer science; Mathematical analysis; Telecommunications; Artificial intelligence","score_opus":0.01899203473198949,"score_gpt":0.23804827560051584,"score_spread":0.21905624086852635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106343541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0769534,0.00026640683,0.92192,0.000042898362,0.000024610532,0.000012127257,0.00005640594,0.00010539213,0.0006187874],"genre_scores_gemma":[0.69130075,0.00073868653,0.30438676,0.000051444582,0.00006819643,0.000068911795,0.0004237408,0.000057707246,0.0029037544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997415,0.000058486938,0.000013616522,0.00007364856,0.00009272481,0.000020087025],"domain_scores_gemma":[0.99965703,0.00014319041,0.000090481386,0.00003323964,0.00006250469,0.000013484136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000374509,0.000708206,0.00044784317,0.00061531353,0.00016060447,0.00048692766,0.00048004845,0.0004762568,0.00032531115],"category_scores_gemma":[0.0017105672,0.00025182634,0.0004344884,0.000568435,0.00030987666,0.00044108447,0.00047809444,0.00043807083,0.00015861882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028157415,0.000076279815,0.006096828,0.00022608961,0.00017239619,0.0003649944,0.00023932569,0.69746566,0.10217626,0.0138160465,0.00074499194,0.17833942],"study_design_scores_gemma":[0.0000071007953,0.0000307993,0.0029151796,0.000009928117,0.000020346497,0.000089021516,0.000022392293,0.98607606,0.008347937,0.0018018573,0.00066134956,0.000018098326],"about_ca_topic_score_codex":0.0020843926,"about_ca_topic_score_gemma":0.0032880346,"teacher_disagreement_score":0.0020843926,"about_ca_system_score_codex":0.00021835945,"about_ca_system_score_gemma":0.000579554,"threshold_uncertainty_score":0.0041444898},"labels":[],"label_agreement":null},{"id":"W2106483076","doi":"10.1109/tsp.2010.2045425","title":"Cooperative Spectrum Sensing in Cognitive Radios With Incomplete Likelihood Functions","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cognitive radio; Test statistic; Fusion center; Statistics; Likelihood-ratio test; Sufficient statistic; Robustness (evolution); Statistic; Channel (broadcasting); Mathematics; Detector; Statistical hypothesis testing; Algorithm; Detection theory; Computer science; Wireless; Telecommunications","score_opus":0.012764380665898861,"score_gpt":0.23329106744371145,"score_spread":0.2205266867778126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106483076","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053394355,0.00031944367,0.9447549,0.00022888687,0.000011704828,0.00002691711,0.000045357934,0.000108398606,0.0011100059],"genre_scores_gemma":[0.9348927,0.00028134792,0.06341492,0.00010476831,0.000061403145,0.00012410237,0.000082736646,0.000034189237,0.0010037818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962036,0.0018241518,0.00013864115,0.00053398876,0.00090232596,0.00039740125],"domain_scores_gemma":[0.98038906,0.0167045,0.0013551145,0.00066233356,0.00067950337,0.00020943904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076387823,0.0010408825,0.0019899104,0.0010115525,0.0004569512,0.0017824245,0.0018817812,0.0014229118,0.000606536],"category_scores_gemma":[0.029625129,0.000992947,0.00096355146,0.0010940264,0.0031183003,0.003016413,0.001995439,0.0010609516,0.00019810259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002411676,0.00005607611,0.0012999295,0.000111402034,0.0001103673,0.0003426362,0.00024505283,0.928896,0.0017433491,0.045320384,0.0002858454,0.02134773],"study_design_scores_gemma":[0.000029365125,0.000035522688,0.0002642143,0.000008686666,0.000014295743,0.0000675091,0.00002886154,0.972529,0.0006538955,0.026233407,0.00012037289,0.000014808327],"about_ca_topic_score_codex":0.002896982,"about_ca_topic_score_gemma":0.0014617925,"teacher_disagreement_score":0.0076387823,"about_ca_system_score_codex":0.0015129866,"about_ca_system_score_gemma":0.0013642261,"threshold_uncertainty_score":0.04039824},"labels":[],"label_agreement":null},{"id":"W2106820694","doi":"10.1109/tsp.2011.2135347","title":"Multiuser Downlink Beamforming in Multicell Wireless Systems: A Game Theoretical Approach","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Telecommunications link; Beamforming; Base station; Computer science; Nash equilibrium; Game theory; Transmitter power output; Non-cooperative game; Mathematical optimization; Context (archaeology); Transmitter; Telecommunications; Mathematics; Mathematical economics","score_opus":0.019019715016267025,"score_gpt":0.21941887114608521,"score_spread":0.20039915612981818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106820694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053564957,0.0013304519,0.9732492,0.0010890546,0.0000750289,0.000058239075,0.000034825327,0.00002990435,0.018776763],"genre_scores_gemma":[0.6409166,0.0074015395,0.3312734,0.0011896718,0.0005506091,0.000508671,0.00006955941,0.000051266863,0.018038753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991447,0.00048968545,0.000020538246,0.00007604745,0.00019816088,0.000070859816],"domain_scores_gemma":[0.9994686,0.00035725877,0.00003975895,0.000023235467,0.00008187976,0.000029292236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008184899,0.0008366071,0.0006692092,0.00062036555,0.000609947,0.0016109424,0.001295557,0.0015776505,0.0018365609],"category_scores_gemma":[0.0014180634,0.00041202834,0.0005648685,0.000715644,0.0015723282,0.0016004863,0.0010379223,0.0014815108,0.0002901072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020932337,0.00006398366,0.00025638507,0.00013875646,0.000028735285,0.00015255398,0.00018994177,0.35363063,0.0021981173,0.6201279,0.0014756245,0.02171636],"study_design_scores_gemma":[0.000012437595,0.000062658626,0.0001338341,0.000037420312,0.000013202856,0.000116897165,0.0001288942,0.82235295,0.0005499848,0.16862686,0.007943521,0.000021314783],"about_ca_topic_score_codex":0.0036076957,"about_ca_topic_score_gemma":0.0038270587,"teacher_disagreement_score":0.0036076957,"about_ca_system_score_codex":0.0018993593,"about_ca_system_score_gemma":0.0012721877,"threshold_uncertainty_score":0.013780892},"labels":[],"label_agreement":null},{"id":"W2106834551","doi":"10.1109/tsp.2006.874766","title":"On the Design of Minimum BER Linear Space-Time Block Codes for MIMO Systems Equipped With MMSE Receivers","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"MIMO; Block code; Mathematics; Minimum mean square error; Algorithm; Bit error rate; Rayleigh fading; QAM; Upper and lower bounds; Quadrature amplitude modulation; Control theory (sociology); Fading; Computer science; Decoding methods; Statistics; Beamforming","score_opus":0.019265575891106685,"score_gpt":0.23895142211810882,"score_spread":0.21968584622700213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106834551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01652733,0.00022446159,0.9821239,0.00007904925,0.000008488032,0.000028805101,0.000026533593,0.00006592164,0.00091557135],"genre_scores_gemma":[0.4956454,0.00079175906,0.50109535,0.000114604525,0.00007947612,0.00020804156,0.0001431045,0.000059304733,0.001862975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876666,0.0005981607,0.00005505249,0.00012498579,0.0003680894,0.00008707625],"domain_scores_gemma":[0.997127,0.0018608725,0.00035611694,0.00014661888,0.0004558621,0.000053588858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013403377,0.0007987254,0.000742849,0.00042636736,0.0002527476,0.0006181287,0.00044520316,0.00070462795,0.00073881535],"category_scores_gemma":[0.0067813355,0.00040335406,0.00023278891,0.00047317886,0.0007126358,0.0008230755,0.00060108694,0.00045799842,0.00035794135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001625337,0.000048868067,0.00082256185,0.00017058909,0.00006126407,0.00009776676,0.00016896626,0.8747976,0.019936053,0.040681116,0.0006752994,0.062377468],"study_design_scores_gemma":[0.000025130461,0.00013070782,0.00014466506,0.000017592409,0.0000129521,0.000050336737,0.000018989775,0.98530316,0.006968216,0.0065461295,0.00076884433,0.000013320542],"about_ca_topic_score_codex":0.0010719422,"about_ca_topic_score_gemma":0.0012689426,"teacher_disagreement_score":0.0013403377,"about_ca_system_score_codex":0.00046324785,"about_ca_system_score_gemma":0.0012373491,"threshold_uncertainty_score":0.0070884824},"labels":[],"label_agreement":null},{"id":"W2107521218","doi":"10.1109/tsp.2010.2046894","title":"A Dynamical Games Approach to Transmission-Rate Adaptation in Multimedia WLAN","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Nash equilibrium; Scheduling (production processes); Markov decision process; Markov process; Wireless network; Computer network; Mathematical optimization; Fading; Channel (broadcasting); Wireless; Distributed computing; Telecommunications; Mathematics","score_opus":0.011242908686378993,"score_gpt":0.22709813937608112,"score_spread":0.2158552306897021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107521218","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014153372,0.0003272173,0.9766284,0.00042717392,0.000073445946,0.000051701507,0.000040034745,0.000047023022,0.008251631],"genre_scores_gemma":[0.8675295,0.00090207014,0.11559992,0.0002534868,0.00018260878,0.00036517452,0.00007636362,0.00006167894,0.015029148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959725,0.00020260352,0.000013290961,0.000053615568,0.00008345369,0.00004980492],"domain_scores_gemma":[0.9994809,0.00035836565,0.000053787488,0.000016077644,0.000052626754,0.000038237555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065695896,0.0007880913,0.00072513736,0.000493442,0.00047257732,0.00088501064,0.0011710632,0.0009819692,0.0024070677],"category_scores_gemma":[0.0017928146,0.0004615634,0.0006745475,0.0004309482,0.0011486482,0.0010665328,0.0009360951,0.0011629714,0.00022716355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017577919,0.000028468585,0.00023043275,0.000026652457,0.00002157003,0.00007139263,0.000054455384,0.81783724,0.0006361767,0.17595431,0.00048372408,0.004637936],"study_design_scores_gemma":[0.000006117361,0.000010092453,0.000036198722,0.000002522567,0.0000028883692,0.000006846051,0.000007894182,0.97919625,0.00006726714,0.020253679,0.0004061336,0.000004165571],"about_ca_topic_score_codex":0.00816579,"about_ca_topic_score_gemma":0.006167238,"teacher_disagreement_score":0.00816579,"about_ca_system_score_codex":0.0015745155,"about_ca_system_score_gemma":0.0011053139,"threshold_uncertainty_score":0.016236484},"labels":[],"label_agreement":null},{"id":"W2107606503","doi":"10.1109/tsp.2010.2049201","title":"Coalition Formation for Bearings-Only Localization in Sensor Networks—A Cooperative Game Approach","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Node (physics); Cooperative game theory; Metric (unit); Fisher information; Mathematical optimization; Wireless sensor network; Monte Carlo method; Sleep mode; Game theory; Energy (signal processing); Performance metric; Algorithm; Mathematics; Computer network; Machine learning; Engineering","score_opus":0.0164279114751913,"score_gpt":0.2439937341758094,"score_spread":0.22756582270061812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107606503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012542426,0.00013103095,0.9849284,0.00021358326,0.000020028072,0.000056492827,0.00001434322,0.00002627436,0.0020673699],"genre_scores_gemma":[0.8363062,0.00043262972,0.15880916,0.00013445731,0.000056636043,0.00038399574,0.000048803213,0.00004126117,0.0037868253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998657,0.00075771706,0.00004222695,0.00016655942,0.00023985106,0.00013656373],"domain_scores_gemma":[0.99741155,0.0017742938,0.00025449396,0.00012985419,0.0002441325,0.00018576962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027313526,0.00096884085,0.0010706384,0.00070462085,0.00081178546,0.0011313903,0.00196708,0.0011804668,0.0013086468],"category_scores_gemma":[0.006003812,0.00050383504,0.0006804986,0.0006827124,0.0018783244,0.002277971,0.0019400109,0.0011046734,0.00020527937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067287125,0.00004866453,0.00035611438,0.00007262087,0.000044204546,0.00012328252,0.00022446524,0.8699717,0.0019389627,0.11479195,0.00057364814,0.011787048],"study_design_scores_gemma":[0.0000142368435,0.000044850432,0.000046652243,0.00000538533,0.000007446469,0.00002592068,0.00003844432,0.9729657,0.0002731785,0.026040187,0.0005313562,0.000006601152],"about_ca_topic_score_codex":0.0029146774,"about_ca_topic_score_gemma":0.0026033858,"teacher_disagreement_score":0.0029146774,"about_ca_system_score_codex":0.0014475045,"about_ca_system_score_gemma":0.0016376871,"threshold_uncertainty_score":0.014444947},"labels":[],"label_agreement":null},{"id":"W2107607005","doi":"10.1109/tsp.2005.850385","title":"Soft-input soft-output decorrelating detectors for coded multiuser systems","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Decorrelation; Detector; Multiuser detection; Computer science; Algorithm; Monte Carlo method; Interference (communication); Single antenna interference cancellation; Residual; Computational complexity theory; Control theory (sociology); Decoding methods; Mathematics; Telecommunications; Statistics; Artificial intelligence","score_opus":0.022831744687509262,"score_gpt":0.2649079604719961,"score_spread":0.24207621578448685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107607005","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011357974,0.0002772601,0.9869529,0.0000826972,0.00004039983,0.000018081679,0.000018593308,0.00017900162,0.00107303],"genre_scores_gemma":[0.4904945,0.00045649672,0.50465083,0.00031584964,0.0000980154,0.00008473939,0.00007784552,0.000051836523,0.0037699072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992532,0.00021627342,0.000039091472,0.00010315726,0.00032685162,0.00006138935],"domain_scores_gemma":[0.99867284,0.00062805426,0.0001334072,0.00020841973,0.0003115305,0.000045686123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084627897,0.00053524994,0.0005507124,0.00033789146,0.00030095474,0.0008758532,0.00069912325,0.0007914625,0.0009603236],"category_scores_gemma":[0.0027242156,0.00027431472,0.00033676284,0.00035429196,0.0006640307,0.0008035991,0.00082183094,0.00085868785,0.00056293444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006159981,0.00013935158,0.001856266,0.00042328876,0.00016132127,0.00039932498,0.0002900398,0.45404968,0.09810581,0.11082988,0.0030797764,0.33004925],"study_design_scores_gemma":[0.00003143285,0.00015569542,0.00021681181,0.000021103802,0.000027581014,0.00020289127,0.000015437943,0.9491693,0.034987047,0.011641925,0.0034942185,0.000036627596],"about_ca_topic_score_codex":0.00032864723,"about_ca_topic_score_gemma":0.0005971908,"teacher_disagreement_score":0.0009603236,"about_ca_system_score_codex":0.00040630554,"about_ca_system_score_gemma":0.00065217324,"threshold_uncertainty_score":0.0044755936},"labels":[],"label_agreement":null},{"id":"W2108777121","doi":"10.1109/tsp.2007.908949","title":"Signal Interpretation of Multifunction Radars: Modeling and Statistical Signal Processing With Stochastic Context Free Grammar","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":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Statistical signal processing; Radar; Estimator; Artificial intelligence; SIGNAL (programming language); Signal processing; Speech recognition; Algorithm; Pattern recognition (psychology); Mathematics; Statistics","score_opus":0.022229437048895087,"score_gpt":0.23732485403004236,"score_spread":0.21509541698114726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108777121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024559153,0.00021972165,0.9723831,0.00043946467,0.00002789228,0.00004321817,0.00017784271,0.0005153839,0.0016342247],"genre_scores_gemma":[0.73686343,0.00048331424,0.25753346,0.00021877329,0.0001149291,0.00023063713,0.0005697354,0.00030992407,0.0036757686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879885,0.00042742537,0.00007230793,0.00028497665,0.00031802687,0.000098495235],"domain_scores_gemma":[0.99617046,0.003050558,0.00027032066,0.00017094235,0.00028855947,0.00004919122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013434682,0.0007030743,0.0007439652,0.0010344328,0.00056628353,0.0018331227,0.0017145983,0.0016679801,0.0012551341],"category_scores_gemma":[0.0047306116,0.00058197434,0.0017143151,0.00070419157,0.0022127905,0.0017077009,0.0008907885,0.0016797418,0.00037914302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003246702,0.00004413018,0.001493008,0.000071351365,0.00003912011,0.00046799012,0.0005448599,0.7971749,0.0033153633,0.17811444,0.00081326626,0.017889112],"study_design_scores_gemma":[0.000002898055,0.0000061987,0.00012871649,0.000005206991,0.0000065290747,0.00002554345,0.00001213024,0.962632,0.00039001298,0.03630506,0.00047870798,0.000006923629],"about_ca_topic_score_codex":0.01493465,"about_ca_topic_score_gemma":0.007592352,"teacher_disagreement_score":0.01493465,"about_ca_system_score_codex":0.0017688298,"about_ca_system_score_gemma":0.0016574947,"threshold_uncertainty_score":0.029695451},"labels":[],"label_agreement":null},{"id":"W2109017782","doi":"10.1109/tsp.2006.881178","title":"Roundoff Noise Minimization for 2-D State-Space Digital Filters Using Joint Optimization of Error Feedback and Realization","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Diagonal matrix; Mathematics; Optimization problem; Realization (probability); Algorithm; Diagonal; Control theory (sociology); Mathematical optimization; Computer science","score_opus":0.048812333642212116,"score_gpt":0.27710818042675783,"score_spread":0.22829584678454573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109017782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011791918,0.00008569341,0.98703486,0.00007835597,0.0000068218105,0.000017233975,0.000010693617,0.00008764228,0.00088674115],"genre_scores_gemma":[0.67833555,0.000294794,0.3168601,0.00007452338,0.000025277006,0.0001888718,0.000076854914,0.00009473694,0.004049271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995771,0.00016819486,0.000020706786,0.000063654516,0.00013075066,0.000039598614],"domain_scores_gemma":[0.9994098,0.00043255952,0.000059794373,0.000030439254,0.00005520259,0.000012293271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009671361,0.00082923006,0.0007078241,0.00021003965,0.0002640238,0.0009534931,0.00039110892,0.0009702658,0.001310036],"category_scores_gemma":[0.0016867458,0.0004563237,0.00046410706,0.00035526112,0.00072199886,0.0008266719,0.00059469306,0.00056258653,0.0002879224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009079338,0.000028079736,0.00016828267,0.00006478026,0.000024008572,0.000026990372,0.000067968875,0.95261437,0.0067192777,0.012561497,0.0003252605,0.027308613],"study_design_scores_gemma":[0.00001189109,0.00004006352,0.00005481928,0.0000040789178,0.0000051865904,0.000008778382,0.000008077528,0.995236,0.0023799993,0.0019913812,0.0002545263,0.000005177566],"about_ca_topic_score_codex":0.0020474398,"about_ca_topic_score_gemma":0.0027435967,"teacher_disagreement_score":0.0020474398,"about_ca_system_score_codex":0.0007217172,"about_ca_system_score_gemma":0.0010186951,"threshold_uncertainty_score":0.0052365065},"labels":[],"label_agreement":null},{"id":"W2109322536","doi":"10.1109/tsp.2007.894254","title":"A New Flexible Approach to Estimate the IA and IF of Nonstationary Signals of Long-Time Duration","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Electrical Measurement Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hydro-Québec","funders":"Université Joseph Fourier; Centre National de la Recherche Scientifique","keywords":"Algorithm; Monte Carlo method; Computer science; Duration (music); Estimation theory; Ambiguity function; SIGNAL (programming language); Noise (video); Polynomial; Mathematics; Amplitude; Ambiguity; Function (biology); Mathematical optimization; Artificial intelligence; Statistics; Waveform; Telecommunications","score_opus":0.01810366178600535,"score_gpt":0.2978399569130294,"score_spread":0.279736295127024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109322536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031230336,0.00006262553,0.9965096,0.000012390534,0.000008436823,0.000007533739,0.000014342805,0.00006991048,0.00019209484],"genre_scores_gemma":[0.098298006,0.0001387143,0.90030926,0.00003830779,0.000048824753,0.00006387868,0.00014138369,0.00007620099,0.0008854589],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996356,0.000068841735,0.000022460277,0.00013328846,0.00011039247,0.000029478713],"domain_scores_gemma":[0.9993648,0.00025343397,0.0000908074,0.00016183477,0.000093352006,0.000035780075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061750686,0.000898291,0.00061494124,0.00096630584,0.0003605591,0.0006502102,0.0009166009,0.0008179858,0.0010380815],"category_scores_gemma":[0.0020635594,0.00041351275,0.00076247734,0.0007380275,0.00063338643,0.0011170843,0.00067245343,0.0011141606,0.00034645337],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002778031,0.000129589,0.0025485097,0.00027087808,0.00023556458,0.00019024186,0.00039609597,0.29435655,0.15954797,0.037586812,0.0010536491,0.5034063],"study_design_scores_gemma":[0.00001557948,0.000116927375,0.0018069879,0.000014847938,0.000051554158,0.00023335962,0.00003547238,0.9677421,0.01812246,0.008006689,0.0037920384,0.000061949715],"about_ca_topic_score_codex":0.0010657528,"about_ca_topic_score_gemma":0.0019016421,"teacher_disagreement_score":0.0010657528,"about_ca_system_score_codex":0.00029089875,"about_ca_system_score_gemma":0.0005291034,"threshold_uncertainty_score":0.0034726858},"labels":[],"label_agreement":null},{"id":"W2110395839","doi":"10.1109/tsp.2008.929664","title":"Decentralized Adaptive Filtering Algorithms for Sensor Activation in an Unattended Ground Sensor Network","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Wireless sensor network; Computer science; Transmission (telecommunications); Node (physics); Convergence (economics); Real-time computing; Algorithm; Computer network; Engineering; Telecommunications","score_opus":0.0693115511674134,"score_gpt":0.28781249831322525,"score_spread":0.21850094714581186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110395839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0093953675,0.000050014518,0.98962307,0.00007572823,0.000012071893,0.000017838142,0.000006527258,0.000059353395,0.000760147],"genre_scores_gemma":[0.81541187,0.00022535332,0.18109478,0.00009105332,0.000054205728,0.00022377583,0.000046905247,0.000030391353,0.0028216515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991679,0.00024856397,0.000038807113,0.00015240254,0.0002902016,0.000102206075],"domain_scores_gemma":[0.99799204,0.0012026948,0.00027403596,0.00012636582,0.00034832073,0.000056553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017643865,0.00060012756,0.000879942,0.00045767025,0.0005719548,0.0007357369,0.001260071,0.0009182317,0.0008852755],"category_scores_gemma":[0.004607083,0.00030904793,0.0004634751,0.0004924975,0.001221609,0.0010181231,0.0009578883,0.0009726853,0.00018755154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005252861,0.000029854182,0.00030708572,0.00002693407,0.000015614103,0.000027832148,0.00008390942,0.94800264,0.0021947944,0.025759194,0.00028113843,0.023218479],"study_design_scores_gemma":[0.0000064161486,0.000013064574,0.000029644327,0.0000016011518,0.000002156756,0.000004825966,0.0000036130407,0.99625176,0.00023536888,0.0033357393,0.000113622715,0.0000021728572],"about_ca_topic_score_codex":0.0036132499,"about_ca_topic_score_gemma":0.003341341,"teacher_disagreement_score":0.0036132499,"about_ca_system_score_codex":0.0012623986,"about_ca_system_score_gemma":0.0011414618,"threshold_uncertainty_score":0.009331107},"labels":[],"label_agreement":null},{"id":"W2110860373","doi":"10.1109/78.839988","title":"Design of orthogonal pulse shapes for communications via semidefinite programming","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Semidefinite programming; Bandwidth (computing); Convex optimization; Pulse shaping; Algorithm; Computer science; Spectral efficiency; Robustness (evolution); Mathematics; Digital filter; Matched filter; Electronic engineering; Mathematical optimization; Telecommunications; Channel (broadcasting); Regular polygon; Optics; Engineering","score_opus":0.0697757718180618,"score_gpt":0.30541781879783336,"score_spread":0.23564204697977156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110860373","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039123385,0.00007767462,0.9936139,0.00013118064,0.000016334765,0.00003670234,0.000025291483,0.00007457481,0.0021119597],"genre_scores_gemma":[0.28483593,0.0006130738,0.708587,0.00042716102,0.00006866673,0.00080871664,0.00022915997,0.00016666242,0.004263556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989354,0.0005626832,0.000042594293,0.00012983447,0.0002666605,0.00006287066],"domain_scores_gemma":[0.99800175,0.001377884,0.00021581723,0.00009548397,0.00025594712,0.000053200154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021305508,0.001328164,0.00077848905,0.00038862065,0.00027473978,0.0011712934,0.000637543,0.00100632,0.002778971],"category_scores_gemma":[0.0044362326,0.0006088124,0.0005166075,0.00065028644,0.0012297222,0.0009577282,0.0009139595,0.0017726447,0.00084681786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012417877,0.00012799166,0.00021571884,0.00026063426,0.00003735399,0.00012956376,0.00015571674,0.78804827,0.0081628505,0.13098893,0.0031047475,0.068644024],"study_design_scores_gemma":[0.000025759688,0.00008945419,0.000019630772,0.000015967438,0.000004763927,0.000028352875,0.000019502579,0.9717444,0.0015091064,0.025029829,0.0015037598,0.000009435428],"about_ca_topic_score_codex":0.00048824836,"about_ca_topic_score_gemma":0.0008084479,"teacher_disagreement_score":0.002778971,"about_ca_system_score_codex":0.0005576528,"about_ca_system_score_gemma":0.0012552979,"threshold_uncertainty_score":0.011267602},"labels":[],"label_agreement":null},{"id":"W2110935968","doi":"10.1109/tsp.2006.871973","title":"Estimation of the number of operating sensors in large-scale sensor networks with mobile access","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Molecular Communication and Nanonetworks","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Estimator; Wireless sensor network; Point estimation; Computer science; Trimmed estimator; Mathematics; Estimation theory; Algorithm; Statistics; Minimum-variance unbiased estimator; Mathematical optimization; Efficient estimator","score_opus":0.007745393523433011,"score_gpt":0.24386734153567738,"score_spread":0.23612194801224437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110935968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12600495,0.0007744673,0.8723983,0.00017402902,0.00002854182,0.000021125086,0.000039884617,0.00015688586,0.00040179602],"genre_scores_gemma":[0.8958551,0.00044725006,0.10264641,0.000043057684,0.00008922568,0.000053459364,0.000088121524,0.00002761793,0.0007497812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990853,0.00028586306,0.00005640994,0.00026680154,0.00024405157,0.00006150332],"domain_scores_gemma":[0.98872083,0.007934035,0.0016539324,0.00079115113,0.0005999757,0.0003001448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016603138,0.0008130795,0.0010911438,0.00072955334,0.00046848142,0.0007500012,0.001456199,0.0011268611,0.00034143517],"category_scores_gemma":[0.013336205,0.0004739722,0.0003287071,0.00061586825,0.0011791779,0.0027117287,0.0011319316,0.0008730765,0.00018880951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006963913,0.00012585765,0.030145643,0.00023132986,0.00013819557,0.0005186756,0.00031248585,0.7958058,0.026249563,0.025961544,0.00060147577,0.11921301],"study_design_scores_gemma":[0.00001569135,0.00009259651,0.003234828,0.000015788259,0.000016391064,0.000212638,0.000065050386,0.97140414,0.0075784586,0.016745785,0.0005944564,0.00002412837],"about_ca_topic_score_codex":0.00034758082,"about_ca_topic_score_gemma":0.00036002928,"teacher_disagreement_score":0.0016603138,"about_ca_system_score_codex":0.00034995584,"about_ca_system_score_gemma":0.00024684635,"threshold_uncertainty_score":0.008780718},"labels":[],"label_agreement":null},{"id":"W2111090287","doi":"10.1109/tsp.2006.887107","title":"Bit-Interleaved Coded OFDM With Signal Space Diversity: Subcarrier Grouping and Rotation Matrix Design","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Saskatchewan","funders":"","keywords":"Orthogonal frequency-division multiplexing; Algorithm; Fading; Vandermonde matrix; Precoding; Subcarrier; Rayleigh fading; Mathematics; Computer science; Bit error rate; Decoding methods; MIMO; Channel (broadcasting); Telecommunications; Eigenvalues and eigenvectors; Physics","score_opus":0.019205275460840287,"score_gpt":0.2513327691931878,"score_spread":0.23212749373234753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111090287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03666121,0.00038883218,0.96070796,0.00010163832,0.000017059869,0.000034855904,0.000014092745,0.0000933078,0.0019810658],"genre_scores_gemma":[0.60583186,0.0005032271,0.39238253,0.00006631708,0.000031666557,0.00009560913,0.000042940075,0.000015682961,0.001030211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991611,0.00042928668,0.00002891045,0.00006460438,0.00025354113,0.00006244615],"domain_scores_gemma":[0.9990709,0.00042379936,0.00016282611,0.00015432629,0.00016189906,0.000026279502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069560885,0.0005622847,0.0005203573,0.00030098832,0.00024227348,0.000505571,0.00052441785,0.00052404136,0.00053203735],"category_scores_gemma":[0.0027960513,0.00019398495,0.00019190628,0.00070545566,0.00067107956,0.0006065955,0.0004334081,0.0003620162,0.00028814457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003869399,0.000101081496,0.00131647,0.0001835191,0.000077827695,0.00020732587,0.00024328033,0.6570171,0.051251914,0.06606952,0.000672556,0.22247238],"study_design_scores_gemma":[0.00003182635,0.00014651644,0.00017184565,0.000016129854,0.000014136601,0.0001720746,0.000021481126,0.9779303,0.013142231,0.0070129745,0.0013263439,0.0000140202765],"about_ca_topic_score_codex":0.000656092,"about_ca_topic_score_gemma":0.0010599595,"teacher_disagreement_score":0.00069560885,"about_ca_system_score_codex":0.000331909,"about_ca_system_score_gemma":0.00060074416,"threshold_uncertainty_score":0.0036787987},"labels":[],"label_agreement":null},{"id":"W2111643434","doi":"10.1109/tsp.2004.842180","title":"A fast recursive total least squares algorithm for adaptive IIR filtering","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Algorithm; Computational complexity theory; Recursive least squares filter; Ramer–Douglas–Peucker algorithm; Rayleigh quotient; Mathematics; Adaptive filter; Least-squares function approximation; Infinite impulse response; Kalman filter; Rayleigh quotient iteration; Computer science; Computation; Mathematical optimization; Iterative method; Filter (signal processing); Digital filter; Power iteration; Eigenvalues and eigenvectors","score_opus":0.01944094912806713,"score_gpt":0.253033004509188,"score_spread":0.23359205538112085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111643434","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047183922,0.00007295611,0.9989605,0.000022990529,0.00002297192,0.000009450567,0.0000075055755,0.0002006053,0.00023108537],"genre_scores_gemma":[0.022607002,0.00021243919,0.97479624,0.000053564494,0.000056445606,0.00008929173,0.000103172664,0.00010994483,0.0019718586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993087,0.00016412832,0.00003474502,0.00012064128,0.0003348051,0.000037030768],"domain_scores_gemma":[0.9994912,0.00020579794,0.00004193038,0.00007581027,0.00016956042,0.000015616297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083937997,0.0007968036,0.0007159161,0.00057915034,0.0003655238,0.0006396037,0.0009719598,0.0009825208,0.0022856775],"category_scores_gemma":[0.002425812,0.0004232928,0.00075962936,0.0006538386,0.00051540177,0.0010924117,0.0006606313,0.0011997804,0.0018530233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009772118,0.00005627181,0.00038538215,0.00016393272,0.00009362991,0.00009595692,0.000104648825,0.26005235,0.029999126,0.04105908,0.0052430243,0.662649],"study_design_scores_gemma":[0.000021896965,0.000044914577,0.00011766378,0.0000094059815,0.0000124090775,0.00008081594,0.000006714451,0.9831161,0.0039730496,0.0050714863,0.007525177,0.000020370799],"about_ca_topic_score_codex":0.0023177024,"about_ca_topic_score_gemma":0.0030419321,"teacher_disagreement_score":0.0023177024,"about_ca_system_score_codex":0.00040889258,"about_ca_system_score_gemma":0.0009967928,"threshold_uncertainty_score":0.007646382},"labels":[],"label_agreement":null},{"id":"W2111697356","doi":"10.1109/tsp.2008.925246","title":"A Hidden Markov, Multivariate Autoregressive (HMM-mAR) Network Framework for Analysis of Surface EMG (sEMG) Data","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Muscle activation and electromyography studies","field":"Engineering","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Hidden Markov model; Autoregressive model; Multivariate statistics; Computer science; Pattern recognition (psychology); Artificial intelligence; Speech recognition; Multivariate analysis; Electromyography; Machine learning; Physical medicine and rehabilitation; Mathematics; Statistics; Medicine","score_opus":0.04437351608533818,"score_gpt":0.285465269366276,"score_spread":0.2410917532809378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111697356","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013145505,0.00026219734,0.9977264,0.000075959346,0.000025237923,0.000020071482,0.00007780413,0.00019199662,0.0003057908],"genre_scores_gemma":[0.15613487,0.0018693211,0.83640504,0.000121958066,0.00023565,0.0003199558,0.00074952614,0.00015808998,0.0040056356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999303,0.00030746922,0.000041895226,0.00017911106,0.00012566237,0.0000428044],"domain_scores_gemma":[0.9993331,0.00037543432,0.00009728636,0.00006048199,0.00010335241,0.000030257193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014450839,0.0010122417,0.000696619,0.0008922367,0.00026986763,0.00088756264,0.0010772286,0.00081323757,0.001396258],"category_scores_gemma":[0.0027729135,0.00036969443,0.0012356468,0.0008890523,0.00047468726,0.0009500631,0.00062239566,0.0012210336,0.00068311585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012547389,0.00013506597,0.0024197563,0.00035750732,0.00028380382,0.0004133582,0.00021936683,0.6470194,0.022177503,0.08349031,0.0029565874,0.24040182],"study_design_scores_gemma":[0.0000030110343,0.000037838345,0.00049893366,0.00001378282,0.000019389829,0.000058140842,0.000010597447,0.9877725,0.0005531701,0.009473715,0.0015438191,0.000015020066],"about_ca_topic_score_codex":0.0055733593,"about_ca_topic_score_gemma":0.0073592947,"teacher_disagreement_score":0.0055733593,"about_ca_system_score_codex":0.00047948206,"about_ca_system_score_gemma":0.0009461936,"threshold_uncertainty_score":0.011081815},"labels":[],"label_agreement":null},{"id":"W2112063544","doi":"10.1109/tsp.2008.926972","title":"Clipping-Noise Guided Sign-Selection for PAR Reduction in OFDM Systems","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Orthogonal frequency-division multiplexing; Subcarrier; Clipping (morphology); Algorithm; Quadrature amplitude modulation; Computer science; Phase-shift keying; Mathematics; Bit error rate; Channel (broadcasting); Telecommunications; Decoding methods","score_opus":0.03722693495761928,"score_gpt":0.26256416931323495,"score_spread":0.22533723435561567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112063544","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04887922,0.00022244392,0.948677,0.0000995346,0.000015826108,0.000034002867,0.000017448629,0.00022029395,0.0018342098],"genre_scores_gemma":[0.68955004,0.0002574966,0.30841494,0.000064151376,0.000034119865,0.00006875091,0.000057219473,0.00006348761,0.001489788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999503,0.00018362065,0.000021781227,0.000048654398,0.00019859447,0.00004431749],"domain_scores_gemma":[0.9990835,0.00055969757,0.00010324741,0.00009794818,0.00012241106,0.000033120985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007339099,0.0005732578,0.00042049904,0.00034978907,0.00031223247,0.0005065268,0.00042890437,0.00034712531,0.0009904631],"category_scores_gemma":[0.0036267515,0.0001964507,0.00022542213,0.00040305965,0.0006828425,0.00053929765,0.000530041,0.00045465125,0.00026610037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045270976,0.00010035653,0.0011305296,0.000115287665,0.000042374522,0.00020777466,0.00016639846,0.6737542,0.070042446,0.04718309,0.001471342,0.20533346],"study_design_scores_gemma":[0.000018062943,0.00007132208,0.00014638236,0.000004972253,0.000008705679,0.00006839656,0.000007986007,0.9776944,0.017464792,0.0039311917,0.0005757028,0.000008202676],"about_ca_topic_score_codex":0.0006889267,"about_ca_topic_score_gemma":0.0009249781,"teacher_disagreement_score":0.0009904631,"about_ca_system_score_codex":0.00044682558,"about_ca_system_score_gemma":0.00063494005,"threshold_uncertainty_score":0.0038813353},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02658026608565668,"score_gpt":0.21954413314986654,"score_spread":0.19296386706420987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112224082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016081702,0.00019961379,0.98126155,0.000113648566,0.000020822064,0.00002042558,0.000019586541,0.000063792126,0.002218935],"genre_scores_gemma":[0.83802694,0.0005604896,0.1558365,0.00015026864,0.00008707537,0.00012523413,0.00008807129,0.00004200262,0.0050833113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947923,0.0001695802,0.000028575263,0.00014991514,0.00012459731,0.000048085956],"domain_scores_gemma":[0.9993585,0.00042323887,0.00009953852,0.000029889821,0.000077633355,0.000011089048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009651088,0.000821157,0.0007186233,0.00022508754,0.00024724656,0.0011384739,0.00045480946,0.0010694293,0.0014559806],"category_scores_gemma":[0.001761048,0.00025223626,0.000575937,0.00030678103,0.00082654075,0.00086813734,0.000550172,0.0007386492,0.00023881593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013092138,0.00004831451,0.0005027108,0.00024406235,0.00007064134,0.0001779772,0.00012411688,0.8917786,0.017315308,0.053537693,0.00053711183,0.03553251],"study_design_scores_gemma":[0.000013236926,0.00011309381,0.00017689187,0.000007823353,0.000013835752,0.000031029576,0.000022818784,0.98346126,0.0047956677,0.010502334,0.000849511,0.000012496152],"about_ca_topic_score_codex":0.0020510012,"about_ca_topic_score_gemma":0.0013139141,"teacher_disagreement_score":0.0020510012,"about_ca_system_score_codex":0.0006725627,"about_ca_system_score_gemma":0.00063702336,"threshold_uncertainty_score":0.0051040053},"labels":[],"label_agreement":null},{"id":"W2112249885","doi":"10.1109/tsp.2005.847849","title":"Communicating over nonstationary nonflat wireless channels","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Intersymbol interference; Computer science; Algorithm; Channel (broadcasting); MIMO; Estimator; Spectral efficiency; Mathematics; Speech recognition; Decoding methods; Control theory (sociology); Telecommunications; Statistics; Artificial intelligence","score_opus":0.018673428689603408,"score_gpt":0.26983779209613723,"score_spread":0.2511643634065338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112249885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038052727,0.00037577323,0.9574915,0.00021794467,0.00011628673,0.000030591444,0.000066431356,0.00024002764,0.003408822],"genre_scores_gemma":[0.82302344,0.0011341837,0.1686401,0.00022669745,0.00027292385,0.00011981681,0.00015249255,0.00006246571,0.0063678785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993042,0.00019165012,0.000026704469,0.00015185834,0.0002225036,0.0001030634],"domain_scores_gemma":[0.9978756,0.0011550178,0.00039312776,0.00030821085,0.0002225178,0.000045475717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006325934,0.0006530691,0.00052825554,0.00039657461,0.00057861954,0.0012212587,0.0009833879,0.00090164645,0.0011947413],"category_scores_gemma":[0.0034711608,0.0002686818,0.0004090799,0.00074706983,0.0013379444,0.002839685,0.00087731396,0.0010600262,0.00039285942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001335352,0.00005904807,0.0017259321,0.00015614706,0.00006899259,0.00035182477,0.0003216505,0.71060306,0.015997637,0.17872472,0.0018542365,0.09000324],"study_design_scores_gemma":[0.0000049111372,0.000042544223,0.00030266543,0.0000063617786,0.000009950295,0.000065445245,0.00002763929,0.9750479,0.0029032086,0.019514538,0.0020605247,0.000014307233],"about_ca_topic_score_codex":0.0013905672,"about_ca_topic_score_gemma":0.0014148046,"teacher_disagreement_score":0.0013905672,"about_ca_system_score_codex":0.0004077752,"about_ca_system_score_gemma":0.00044374503,"threshold_uncertainty_score":0.003996849},"labels":[],"label_agreement":null},{"id":"W2112732068","doi":"10.1109/tsp.2009.2028947","title":"Alleviating Sensor Position Error in Source Localization Using Calibration Emitters at Inaccurate Locations","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McMaster University","keywords":"Position (finance); Calibration; Cramér–Rao bound; Computer science; Gaussian; Algorithm; Multilateration; Upper and lower bounds; Noise (video); Observational error; Artificial intelligence; Mathematics; Estimation theory; Statistics; Physics; Acoustics; Node (physics)","score_opus":0.018826759125809844,"score_gpt":0.2465502828620269,"score_spread":0.22772352373621707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112732068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036003865,0.00023907304,0.96247315,0.00010318858,0.000024285884,0.000010548094,0.000009992433,0.00017546775,0.0009604736],"genre_scores_gemma":[0.80074036,0.0008489486,0.19640654,0.00007574282,0.00006740106,0.000049101523,0.00008416306,0.00006683388,0.0016609716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879265,0.00041365548,0.000042780583,0.00014396278,0.0005104771,0.000096542055],"domain_scores_gemma":[0.9971909,0.0017745959,0.0002755178,0.00035483047,0.00037389927,0.000030282592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016999374,0.0007954418,0.0007225671,0.0005392295,0.00030328348,0.0006157468,0.0007023277,0.0010374853,0.00059315783],"category_scores_gemma":[0.009942171,0.0004549163,0.00039050574,0.00087762426,0.00071404094,0.001701935,0.0015719697,0.0006766617,0.0003567449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018496583,0.000042536176,0.0013718405,0.00012116561,0.00003973927,0.0001905921,0.0002324582,0.86121935,0.01949885,0.010984378,0.00068794616,0.1054262],"study_design_scores_gemma":[0.000008035112,0.00005112821,0.00034991573,0.000009361819,0.000013452419,0.000081741535,0.000023646393,0.98886347,0.007872959,0.002228714,0.00048663717,0.000010922085],"about_ca_topic_score_codex":0.0014437264,"about_ca_topic_score_gemma":0.0014080321,"teacher_disagreement_score":0.0016999374,"about_ca_system_score_codex":0.00040302236,"about_ca_system_score_gemma":0.0005677165,"threshold_uncertainty_score":0.008990228},"labels":[],"label_agreement":null},{"id":"W2112865923","doi":"10.1109/tsp.2008.927484","title":"Cross-Entropy-Based Sign-Selection Algorithms for Peak-to-Average Power Ratio Reduction of OFDM Systems","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Algorithm; Reduction (mathematics); Computational complexity theory; Orthogonal frequency-division multiplexing; Mathematics; Subcarrier; Entropy (arrow of time); Computer science; Estimator; Statistics","score_opus":0.023730843725535817,"score_gpt":0.2684691673306341,"score_spread":0.24473832360509826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112865923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010813792,0.00018863005,0.9878143,0.000083715975,0.000024558078,0.000033275977,0.000020311962,0.0003100241,0.00071142765],"genre_scores_gemma":[0.37135282,0.0003616352,0.6248816,0.0001884186,0.00011871609,0.00018016377,0.00020718518,0.00013415527,0.0025752618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985775,0.0005446611,0.00011158063,0.00018568727,0.00048749615,0.00009316608],"domain_scores_gemma":[0.9967429,0.0019032522,0.00028618268,0.00044870772,0.00053787755,0.00008105393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022299201,0.00084291777,0.00085849845,0.0008771114,0.00040939104,0.0008849672,0.0010715623,0.000720253,0.0015593783],"category_scores_gemma":[0.006961346,0.0003566485,0.0004560913,0.00079347123,0.0008482465,0.0016585663,0.0012771199,0.0012692327,0.0005367643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040194092,0.00015525226,0.0016755153,0.00009538916,0.000079507954,0.00010198883,0.00014514515,0.40038726,0.025462238,0.043299004,0.0025121586,0.52568454],"study_design_scores_gemma":[0.00001829618,0.00006159763,0.00026903892,0.000005247765,0.0000101505075,0.00006149526,0.0000061858027,0.9814058,0.012332898,0.005084168,0.00073216483,0.000013034902],"about_ca_topic_score_codex":0.000629206,"about_ca_topic_score_gemma":0.0008465637,"teacher_disagreement_score":0.0022299201,"about_ca_system_score_codex":0.00071745383,"about_ca_system_score_gemma":0.0010120422,"threshold_uncertainty_score":0.011793077},"labels":[],"label_agreement":null},{"id":"W2112938783","doi":"10.1109/tsp.2005.855078","title":"A new framework of LSB steganalysis of digital media","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Steganalysis; Least significant bit; Steganography; Computer science; Artificial intelligence; Cover (algebra); Digital image; Computer vision; Pattern recognition (psychology); Digital media; Image processing; Image (mathematics)","score_opus":0.015948681814601857,"score_gpt":0.260066189637035,"score_spread":0.24411750782243313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112938783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016154138,0.0002227113,0.9974469,0.00006668309,0.00003533365,0.000014498314,0.000023798024,0.00010092245,0.0004736801],"genre_scores_gemma":[0.15568775,0.0015997395,0.8371628,0.00021825939,0.00041895913,0.00018990123,0.00025853474,0.00014386537,0.004320222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992306,0.00017132069,0.000033217922,0.00016000461,0.00034249976,0.00006236706],"domain_scores_gemma":[0.9994265,0.00016668205,0.00006673067,0.00013518536,0.00016828119,0.0000367876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085137377,0.0011172871,0.0011836552,0.001456502,0.0004167731,0.0011863399,0.001257752,0.001100915,0.0010057372],"category_scores_gemma":[0.0015409163,0.00043398072,0.0011186054,0.000878347,0.0023947353,0.0016110797,0.0013176397,0.0014101054,0.00057537813],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013374686,0.000078418365,0.0010071668,0.000339345,0.00017945205,0.00061781466,0.0002498571,0.30402896,0.11219868,0.4660745,0.003094819,0.11199724],"study_design_scores_gemma":[0.000011588798,0.00010239487,0.00036039233,0.00002076726,0.000027518237,0.0003226369,0.000020874684,0.89930236,0.010988375,0.08136435,0.0074310303,0.000047657384],"about_ca_topic_score_codex":0.0014127889,"about_ca_topic_score_gemma":0.0011381952,"teacher_disagreement_score":0.001456502,"about_ca_system_score_codex":0.0006357803,"about_ca_system_score_gemma":0.00073666923,"threshold_uncertainty_score":0.004612863},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05056948937366794,"score_gpt":0.25946602533642976,"score_spread":0.2088965359627618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113168978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022233308,0.00011779733,0.9965833,0.00008012537,0.000010130085,0.000010981955,0.00001012147,0.00005431775,0.000909976],"genre_scores_gemma":[0.4618657,0.00090131897,0.5316655,0.00020522447,0.00018767508,0.00027242108,0.0002091704,0.00025745382,0.0044355383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99858886,0.00054308865,0.000058678474,0.0002136102,0.00047798757,0.00011783453],"domain_scores_gemma":[0.99833125,0.0010352206,0.0001914082,0.00011888739,0.00027771064,0.00004561596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023060038,0.0015039673,0.00090684823,0.00045392133,0.00030312277,0.0012405213,0.00088117155,0.0011198273,0.0016605043],"category_scores_gemma":[0.0056285863,0.0004752351,0.0006725973,0.0006802493,0.0010531307,0.0013452376,0.0010857474,0.0016029221,0.00043985763],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047380006,0.00003293427,0.00018689361,0.0000801981,0.000027169905,0.000060356495,0.000040731506,0.9512343,0.003424087,0.01692004,0.000812115,0.027133806],"study_design_scores_gemma":[0.0000029530247,0.00002461651,0.00003581124,0.000004703442,0.0000030033034,0.000013152703,0.000005204195,0.99527884,0.000753091,0.0035370442,0.00033803814,0.0000036532758],"about_ca_topic_score_codex":0.0015949483,"about_ca_topic_score_gemma":0.00088220864,"teacher_disagreement_score":0.0023060038,"about_ca_system_score_codex":0.0006953828,"about_ca_system_score_gemma":0.0010486706,"threshold_uncertainty_score":0.012195408},"labels":[],"label_agreement":null},{"id":"W2115170659","doi":"10.1109/tsp.2010.2048208","title":"An Efficient Low-Complexity Detector for Spatially Multiplexed MC-CDM","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multiplexing; Detector; Orthogonal frequency-division multiplexing; Computer science; Subcarrier; Single antenna interference cancellation; Bit error rate; Electronic engineering; Interference (communication); Signal-to-noise ratio (imaging); Algorithm; Diversity gain; Frequency-division multiplexing; Fading; Telecommunications; Engineering; Channel (broadcasting); Decoding methods","score_opus":0.023120143170868343,"score_gpt":0.2807089933306833,"score_spread":0.2575888501598149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115170659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007951162,0.00026906838,0.99076533,0.00008029248,0.00004445358,0.000024161594,0.000017137467,0.00013123816,0.0007171294],"genre_scores_gemma":[0.17029054,0.00025070034,0.8272971,0.000171767,0.00006773768,0.0000618734,0.000047548005,0.000015181525,0.0017975937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940956,0.000115302595,0.000019328849,0.00006949642,0.00035169817,0.000034672717],"domain_scores_gemma":[0.99952793,0.00018166499,0.00006663118,0.000072733485,0.00012958334,0.000021394275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054534443,0.0004188346,0.00044716115,0.00049503625,0.0002940359,0.000482312,0.00079584634,0.00058974477,0.0009141171],"category_scores_gemma":[0.0010697575,0.00022056409,0.00027018096,0.00043727338,0.00043760735,0.00055424636,0.00045112954,0.0006432922,0.0004017523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003053718,0.0001613462,0.001985855,0.00026508118,0.00011056938,0.00023788732,0.000119238146,0.0762416,0.3892868,0.06772857,0.002982087,0.4605756],"study_design_scores_gemma":[0.000028239903,0.00017993113,0.00041402553,0.000012432272,0.000026649937,0.00047623494,0.000011208061,0.8656597,0.12245527,0.0034969626,0.0071998816,0.00003941379],"about_ca_topic_score_codex":0.00038649593,"about_ca_topic_score_gemma":0.0010006679,"teacher_disagreement_score":0.0009141171,"about_ca_system_score_codex":0.000408269,"about_ca_system_score_gemma":0.0006903767,"threshold_uncertainty_score":0.003058076},"labels":[],"label_agreement":null},{"id":"W2115580915","doi":"10.1109/tsp.2007.893934","title":"Lossless Source Coding Using Nested Error Correcting Codes","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Variable-length code; Entropy encoding; Lossless compression; Algorithm; Turbo code; Computer science; Context-adaptive binary arithmetic coding; Data compression; Decoding methods; Tunstall coding; Distributed source coding; Arithmetic coding; Theoretical computer science; Low-density parity-check code","score_opus":0.03735929837253797,"score_gpt":0.30033248746868163,"score_spread":0.26297318909614364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115580915","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013704851,0.00017822553,0.98447,0.000090659014,0.000030108362,0.000033168886,0.00004104926,0.0003026706,0.0011491948],"genre_scores_gemma":[0.47728458,0.00042773696,0.5191395,0.00017646102,0.000043982218,0.00013720065,0.0001852352,0.000084130224,0.0025212138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992131,0.00018202895,0.000036241865,0.00008616974,0.00042808984,0.00005440372],"domain_scores_gemma":[0.99791795,0.0007484166,0.00028000484,0.00044102437,0.00054401206,0.000068548805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010339264,0.00055994623,0.0005763606,0.0006747391,0.00029502067,0.00054587045,0.0013363768,0.00062277424,0.0008811724],"category_scores_gemma":[0.004531782,0.00023935115,0.00038941304,0.00085804006,0.00073896174,0.001182513,0.00096450443,0.00086692674,0.00048431646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029545574,0.000076183205,0.00086203276,0.00019216177,0.00006443271,0.00028927313,0.00018004973,0.6341449,0.050116763,0.18673968,0.0016328635,0.12540618],"study_design_scores_gemma":[0.000018300925,0.000045770317,0.00010521898,0.00001456705,0.000009060919,0.00010025235,0.0000049965042,0.97184056,0.010304939,0.016267467,0.0012718051,0.000017004413],"about_ca_topic_score_codex":0.0010381098,"about_ca_topic_score_gemma":0.0011000596,"teacher_disagreement_score":0.0013363768,"about_ca_system_score_codex":0.00064316863,"about_ca_system_score_gemma":0.0007750545,"threshold_uncertainty_score":0.005468011},"labels":[],"label_agreement":null},{"id":"W2115826187","doi":"10.1109/tsp.2011.2166393","title":"Optimal Amplitude Weighting for Near-field Passive Source Localization","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Weighting; Estimator; Monte Carlo method; Energy (signal processing); Detector; Algorithm; Amplitude; Computer science; Bandwidth (computing); Signal-to-noise ratio (imaging); SIGNAL (programming language); Iterative method; Mathematical optimization; Mathematics; Statistics; Telecommunications; Acoustics; Physics","score_opus":0.019350427446197173,"score_gpt":0.227757555743401,"score_spread":0.20840712829720384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115826187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022073837,0.00004564424,0.9972102,0.000023758297,0.0000055496926,0.000008283185,0.0000031625718,0.00004403622,0.000451867],"genre_scores_gemma":[0.31447178,0.00041243306,0.6810195,0.00010246385,0.000083438645,0.0001376324,0.00007898908,0.00012771988,0.00356607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935895,0.00017691274,0.000032065214,0.00009483528,0.00030044233,0.00003685745],"domain_scores_gemma":[0.99947196,0.0002811929,0.000056284072,0.000036442387,0.00014074406,0.000013420745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067471823,0.00065994816,0.0003803306,0.0004943963,0.00024326303,0.00068021106,0.0006230242,0.0007093875,0.0015470057],"category_scores_gemma":[0.0031106095,0.00028374887,0.00029857922,0.0004712761,0.00043781725,0.0015848903,0.0008106927,0.00048339885,0.00081141386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019801508,0.00009726962,0.0005227302,0.00022924872,0.000045791185,0.000101482576,0.00017109734,0.36418808,0.092989385,0.09302321,0.001501509,0.4469322],"study_design_scores_gemma":[0.000016857244,0.000081832346,0.00015184865,0.000014994686,0.00001569737,0.00009115573,0.000017380642,0.9638062,0.012296663,0.02136937,0.0021248907,0.00001306962],"about_ca_topic_score_codex":0.0003248648,"about_ca_topic_score_gemma":0.0004900715,"teacher_disagreement_score":0.0015470057,"about_ca_system_score_codex":0.00038050069,"about_ca_system_score_gemma":0.00042582286,"threshold_uncertainty_score":0.005175233},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011080597289902242,"score_gpt":0.23139504022710367,"score_spread":0.22031444293720143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116066327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021358179,0.0006584958,0.9712408,0.0004168636,0.00006453736,0.000032961452,0.00006127115,0.00023732476,0.005929583],"genre_scores_gemma":[0.9232013,0.0009703919,0.065879345,0.0001985236,0.00017273641,0.0002519427,0.00018081538,0.00019367826,0.008951211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930036,0.00017082361,0.000028400204,0.00013277012,0.0002679732,0.00009976547],"domain_scores_gemma":[0.9975332,0.001568762,0.0003090235,0.00014898933,0.0003594852,0.00008043728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014758537,0.00085961,0.0009884759,0.00066432287,0.00047100373,0.000833411,0.0011918588,0.0008793972,0.002262134],"category_scores_gemma":[0.0072093685,0.0003813188,0.00047715337,0.00073014986,0.0013010883,0.0015339778,0.0009858228,0.0008297165,0.00033655262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003723831,0.000015112636,0.00030778852,0.000052201212,0.00002129204,0.000050336123,0.000036253678,0.94116,0.0012335586,0.047741465,0.00076550565,0.008579186],"study_design_scores_gemma":[0.000002755816,0.000007136109,0.00004285792,0.0000022735624,0.000002267735,0.0000041841704,0.0000028278378,0.9891031,0.00015300295,0.010511449,0.00016559742,0.0000025271863],"about_ca_topic_score_codex":0.0046418705,"about_ca_topic_score_gemma":0.0026752024,"teacher_disagreement_score":0.0046418705,"about_ca_system_score_codex":0.0012783939,"about_ca_system_score_gemma":0.0009909247,"threshold_uncertainty_score":0.009275496},"labels":[],"label_agreement":null},{"id":"W2116729232","doi":"10.1109/tsp.2011.2140110","title":"Efficient Delay-Tolerant Particle Filtering","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Particle filter; Computer science; Reduction (mathematics); Sequence (biology); Algorithm; State (computer science); Task (project management); Computational complexity theory; Identification (biology); Mathematical optimization; Selection (genetic algorithm); Optimization problem; Artificial intelligence; Mathematics; Kalman filter","score_opus":0.04129847541340363,"score_gpt":0.2419381306331685,"score_spread":0.20063965521976485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116729232","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027803218,0.00008313864,0.9965418,0.00004253833,0.000027691545,0.00001015268,0.000014296863,0.00009691752,0.0004031335],"genre_scores_gemma":[0.4627193,0.0005793103,0.53195935,0.00015336148,0.00014726719,0.00014756832,0.00022578942,0.000094988034,0.003972979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932754,0.00011245097,0.000033734454,0.00012876886,0.00032979675,0.00006777559],"domain_scores_gemma":[0.99936885,0.00030970882,0.00007820307,0.000093506,0.00012455134,0.0000252813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084028224,0.00077455357,0.0009932677,0.0004934352,0.0004748233,0.0009764127,0.0013312052,0.0010085073,0.00079059036],"category_scores_gemma":[0.002607056,0.00044752506,0.00053540454,0.0006370552,0.0005955231,0.0012939854,0.001186912,0.0010487325,0.00029639987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017436704,0.000045013276,0.00055973657,0.00010931964,0.00005441996,0.00011107433,0.000106193256,0.8411851,0.015132878,0.03970978,0.0015916893,0.1012205],"study_design_scores_gemma":[0.000010090176,0.000022226446,0.00009658458,0.0000035073663,0.0000057257903,0.00002470888,0.0000063071634,0.9909395,0.0021466762,0.005421975,0.0013141761,0.000008589873],"about_ca_topic_score_codex":0.0036683904,"about_ca_topic_score_gemma":0.002353534,"teacher_disagreement_score":0.0036683904,"about_ca_system_score_codex":0.00075654354,"about_ca_system_score_gemma":0.0010682457,"threshold_uncertainty_score":0.0072941184},"labels":[],"label_agreement":null},{"id":"W2118071128","doi":"10.1109/tsp.2008.2011832","title":"Robust NL-Means Filter With Optimal Pixel-Wise Smoothing Parameter for Statistical Image Denoising","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Smoothing; Noise reduction; Pixel; Weighting; Filter (signal processing); Computer science; Non-local means; Artificial intelligence; Mathematics; Multiplicative noise; Statistic; Algorithm; Pattern recognition (psychology); Statistics; Computer vision; Image denoising","score_opus":0.03756351195907125,"score_gpt":0.28924178918593635,"score_spread":0.2516782772268651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118071128","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015111165,0.00011671636,0.9977447,0.000044269407,0.000018000303,0.00001015451,0.000018140947,0.00029924643,0.00023767099],"genre_scores_gemma":[0.053778417,0.00028768048,0.9430339,0.00010700718,0.000057691374,0.0001315039,0.00019754858,0.00016802867,0.0022382743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988667,0.00027010372,0.00007884567,0.00030604514,0.0004251537,0.000053334894],"domain_scores_gemma":[0.99926966,0.00021369224,0.00010033986,0.0001375287,0.00025711927,0.000021733114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001633156,0.00070556795,0.0009818195,0.0009105778,0.0005117725,0.0006004488,0.0011226556,0.0016589763,0.0017973396],"category_scores_gemma":[0.0035980374,0.00045709388,0.0011941924,0.0013312383,0.000707468,0.0010119177,0.00067910337,0.0011881007,0.0015786565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030779772,0.00011288923,0.0010616342,0.0004104848,0.00015022379,0.00016071749,0.00024823533,0.28823447,0.097694844,0.029239038,0.0070533515,0.5753263],"study_design_scores_gemma":[0.00001571194,0.000034937835,0.00042772412,0.0000126518225,0.000024049963,0.00007897856,0.000011948979,0.9676732,0.02022601,0.006295352,0.005167931,0.000031571624],"about_ca_topic_score_codex":0.004534943,"about_ca_topic_score_gemma":0.005382801,"teacher_disagreement_score":0.004534943,"about_ca_system_score_codex":0.0010807604,"about_ca_system_score_gemma":0.0013872802,"threshold_uncertainty_score":0.00901705},"labels":[],"label_agreement":null},{"id":"W2118082742","doi":"10.1109/tsp.2005.861785","title":"Cross-Layer optimal connection admission control for variable bit rate multimedia traffic in packet wireless CDMA networks","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Quality of service; Call Admission Control; Network packet; Wireless network; Code division multiple access; Admission control; Markov process; Wireless; Telecommunications","score_opus":0.0242739614723515,"score_gpt":0.2958302235899355,"score_spread":0.271556262117584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118082742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22413525,0.0010337222,0.7690186,0.00055357313,0.000123706,0.00010301336,0.000038044782,0.0007611184,0.0042329407],"genre_scores_gemma":[0.9791868,0.00017265113,0.019772325,0.00005956293,0.00002975732,0.000044469252,0.00001782228,0.000024821404,0.0006917983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987846,0.0003825768,0.000047145862,0.00014591079,0.00037394153,0.0002657432],"domain_scores_gemma":[0.9980014,0.0012928688,0.0002392574,0.00008085899,0.0002822197,0.000103410464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002005763,0.0009283296,0.00086575455,0.0008527011,0.0008247367,0.0013123733,0.0011017045,0.00073886785,0.0013306609],"category_scores_gemma":[0.00519877,0.00047875932,0.00033124423,0.0008674866,0.001248626,0.0009381285,0.0014241779,0.0010124288,0.00018150425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014681839,0.00011667446,0.00045664978,0.00003582546,0.000024294664,0.000044568707,0.0000848611,0.95435405,0.0034213443,0.0071792467,0.000534788,0.033600803],"study_design_scores_gemma":[0.00000587018,0.00001112145,0.000035342448,8.6529764e-7,0.00000264115,0.0000040613177,0.0000042203446,0.99881005,0.0003329636,0.0007560152,0.000034397148,0.000002464242],"about_ca_topic_score_codex":0.012265029,"about_ca_topic_score_gemma":0.008522174,"teacher_disagreement_score":0.012265029,"about_ca_system_score_codex":0.0022101009,"about_ca_system_score_gemma":0.0018675588,"threshold_uncertainty_score":0.0243873},"labels":[],"label_agreement":null},{"id":"W2118894697","doi":"10.1109/78.890348","title":"Design of multichannel nonuniform transmultiplexers using general building blocks","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Queen's University","funders":"","keywords":"Aliasing; Computer science; Signal reconstruction; Algorithm; Distortion (music); Phase distortion; Mathematics; Signal processing; Bandwidth (computing); Filter (signal processing); Telecommunications; Transmission (telecommunications)","score_opus":0.06833419842562356,"score_gpt":0.3004952609624574,"score_spread":0.23216106253683383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118894697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08869003,0.00019472072,0.90783226,0.00007200608,0.000016203709,0.0000804732,0.000035274617,0.00027426708,0.002804722],"genre_scores_gemma":[0.57927734,0.00016697502,0.41873422,0.000047329755,0.000017859977,0.000091279224,0.000055384084,0.000035608882,0.0015739286],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971026,0.00007548395,0.000023160965,0.000065626395,0.00008698895,0.00003847597],"domain_scores_gemma":[0.9995233,0.00014106292,0.0001438524,0.000081093734,0.00009013419,0.000020638288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005725458,0.00043514188,0.00035616857,0.00021579197,0.00020091815,0.00038668365,0.00055846316,0.00039773373,0.0008762693],"category_scores_gemma":[0.000911415,0.00019115425,0.00025809894,0.00024011736,0.0003767266,0.0005848071,0.00033889673,0.0003745722,0.0002364483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043948728,0.0001083573,0.0018147324,0.00035037697,0.00007510603,0.00019428719,0.00015124395,0.36964577,0.4353239,0.052283693,0.0005677303,0.1390453],"study_design_scores_gemma":[0.00006972984,0.0006403202,0.0008691507,0.000028816303,0.000048717728,0.00031036808,0.000034476005,0.69961256,0.2856726,0.0053818463,0.007303535,0.00002791595],"about_ca_topic_score_codex":0.00020568827,"about_ca_topic_score_gemma":0.0004196809,"teacher_disagreement_score":0.0008762693,"about_ca_system_score_codex":0.00042353818,"about_ca_system_score_gemma":0.00027079086,"threshold_uncertainty_score":0.003072977},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.032191934802961994,"score_gpt":0.2694817582706109,"score_spread":0.23728982346764887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119215342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062371576,0.00021492834,0.9908325,0.00008732531,0.000015982516,0.000023005694,0.00005180904,0.000071157185,0.002466124],"genre_scores_gemma":[0.5397528,0.002193328,0.44152206,0.00019494808,0.00013954824,0.00049546437,0.00043229057,0.00014228864,0.015127392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994591,0.00018473371,0.000016897264,0.000054133052,0.00022981735,0.000055276167],"domain_scores_gemma":[0.9994861,0.00031916818,0.0000654771,0.000028765433,0.000084739724,0.000015741185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006281488,0.0007224273,0.0007314863,0.0002573681,0.0002331263,0.0007177616,0.00042464756,0.0006389843,0.0032237617],"category_scores_gemma":[0.0013803166,0.0002801271,0.00030560055,0.0006991047,0.00044392017,0.0006523056,0.00061876146,0.0007861636,0.000724417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039016988,0.000038387,0.00015008937,0.000084122126,0.00002100267,0.00006029248,0.000044932614,0.93450016,0.0039267843,0.032803144,0.0011282627,0.02720375],"study_design_scores_gemma":[0.00000960996,0.000028268714,0.000045624154,0.0000034448917,0.00000415898,0.000015914758,0.000007370531,0.99238175,0.0005333582,0.0061180587,0.0008495574,0.0000029624127],"about_ca_topic_score_codex":0.0018463281,"about_ca_topic_score_gemma":0.0022662694,"teacher_disagreement_score":0.0032237617,"about_ca_system_score_codex":0.0007048515,"about_ca_system_score_gemma":0.001248786,"threshold_uncertainty_score":0.010784507},"labels":[],"label_agreement":null},{"id":"W2119640358","doi":"10.1109/tsp.2004.828923","title":"Efficient Design of Orthonormal Wavelet Bases for Signal Representation","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Wavelet; Orthonormal basis; Mathematical optimization; Mathematics; Wavelet transform; Cascade algorithm; Representation (politics); Optimization problem; Algorithm; Legendre wavelet; Computer science; Wavelet packet decomposition; Applied mathematics; Discrete wavelet transform; Artificial intelligence","score_opus":0.0517019502556009,"score_gpt":0.31066954624460574,"score_spread":0.2589675959890049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119640358","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027059384,0.00005433537,0.9968411,0.000024908213,0.000007981988,0.0000133703625,0.000009380412,0.00003913309,0.000303838],"genre_scores_gemma":[0.105055645,0.00051820936,0.8929038,0.000054497894,0.000037509504,0.00020524164,0.00013845992,0.00008079115,0.0010057398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990426,0.00035662556,0.000054440003,0.00010917931,0.000356182,0.00008093794],"domain_scores_gemma":[0.9991037,0.00035283167,0.00011300895,0.00014236056,0.00024503135,0.000043088927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021767903,0.00077194546,0.00096699287,0.0006670862,0.00033154403,0.00074006367,0.0009309421,0.0009594136,0.0010710045],"category_scores_gemma":[0.00420384,0.000555625,0.0004759557,0.0007949705,0.0007335882,0.0010906715,0.0011194657,0.0012392186,0.0008076695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022397723,0.000116968346,0.00061517983,0.0002873319,0.00006256436,0.00014687119,0.00017366828,0.467294,0.08365534,0.15409055,0.003730564,0.28960297],"study_design_scores_gemma":[0.000019303676,0.00005552091,0.00008071406,0.00001693893,0.000008864642,0.000054132146,0.000020565103,0.9752881,0.0099332845,0.01183052,0.0026805382,0.000011584796],"about_ca_topic_score_codex":0.0003800122,"about_ca_topic_score_gemma":0.0005976696,"teacher_disagreement_score":0.0021767903,"about_ca_system_score_codex":0.00035667335,"about_ca_system_score_gemma":0.000941953,"threshold_uncertainty_score":0.011512101},"labels":[],"label_agreement":null},{"id":"W2119741378","doi":"10.1109/tsp.2008.2010376","title":"Accelerated Distributed Average Consensus via Localized Node State Prediction","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Convergence (economics); Node (physics); Rate of convergence; Mathematical optimization; Mathematics; Upper and lower bounds; Mixing (physics); Focus (optics); Computer science; Matrix (chemical analysis); State (computer science); Eigenvalues and eigenvectors; Convex optimization; Regular polygon; Algorithm; Applied mathematics","score_opus":0.03272412673507932,"score_gpt":0.2475680932402552,"score_spread":0.21484396650517587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119741378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013818351,0.00006774954,0.98451763,0.00006234504,0.000018091087,0.000015024622,0.0000070589167,0.00034499666,0.0011488319],"genre_scores_gemma":[0.8297881,0.00016343444,0.16657783,0.00008058442,0.000050818628,0.000114444345,0.000056835946,0.00006853213,0.0030994213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992482,0.00019140959,0.000024663497,0.00015027207,0.000314283,0.0000712035],"domain_scores_gemma":[0.99878174,0.00059299316,0.00015050547,0.00019924308,0.00023471065,0.00004082271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011363297,0.00057901593,0.0008496309,0.00045369833,0.00045657804,0.00051357376,0.0013906566,0.0005703513,0.00089101173],"category_scores_gemma":[0.0035016595,0.00032764894,0.00036463302,0.00046690257,0.00076391303,0.0012643003,0.0012484762,0.0010877833,0.0002899866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006909119,0.000029266963,0.00041690475,0.000045164426,0.000017626562,0.000052492425,0.00013321436,0.9234207,0.0056243534,0.01490633,0.00058598083,0.05469882],"study_design_scores_gemma":[0.0000049388,0.000019866005,0.000036346115,0.0000019566771,0.0000024399892,0.0000068173317,0.000004834087,0.99657214,0.0008990682,0.0021381518,0.00031069556,0.0000028092595],"about_ca_topic_score_codex":0.0027859411,"about_ca_topic_score_gemma":0.002251137,"teacher_disagreement_score":0.0027859411,"about_ca_system_score_codex":0.0006211619,"about_ca_system_score_gemma":0.0010073938,"threshold_uncertainty_score":0.0060095787},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028731382391388106,"score_gpt":0.28481728793480593,"score_spread":0.2560859055434178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119940423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006783879,0.00014404603,0.99177176,0.000224801,0.000023573068,0.000030094996,0.00004630279,0.00014195488,0.00083357946],"genre_scores_gemma":[0.7497326,0.0005599785,0.24609083,0.00019870943,0.00010768333,0.0003013698,0.00021838745,0.00012688644,0.0026635374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846256,0.0005892555,0.000076950026,0.00029923476,0.00033700292,0.00023508203],"domain_scores_gemma":[0.9940824,0.004488909,0.0005819479,0.00026132792,0.00034216628,0.00024325804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026849092,0.0010202914,0.0016858862,0.00076497946,0.00056016404,0.0016404134,0.0018196772,0.0014504306,0.002900909],"category_scores_gemma":[0.010807616,0.0007855772,0.00094848615,0.00091833354,0.0014886857,0.0025579955,0.0013969092,0.0021300935,0.00041780755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007037853,0.00003467056,0.00024954497,0.000046066627,0.000019583864,0.000049827104,0.00005828518,0.92095196,0.0006313287,0.06786662,0.0004014508,0.009620267],"study_design_scores_gemma":[0.0000067845217,0.000010211714,0.000022738604,0.0000034228942,0.0000024058966,0.000004712817,0.0000039398815,0.9826653,0.00010946291,0.017055443,0.00011181333,0.0000037375648],"about_ca_topic_score_codex":0.0056726346,"about_ca_topic_score_gemma":0.0034172807,"teacher_disagreement_score":0.0056726346,"about_ca_system_score_codex":0.0024427348,"about_ca_system_score_gemma":0.0025562649,"threshold_uncertainty_score":0.017723322},"labels":[],"label_agreement":null},{"id":"W2121165908","doi":"10.1109/tsp.2004.838966","title":"Maximum likelihood direction-of-arrival estimation in unknown noise fields using sparse sensor arrays","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Direction of arrival; Estimator; Algorithm; Noise (video); Mathematics; Covariance matrix; Identifiability; Sensor array; Covariance; Computer science; Statistics; Artificial intelligence; Telecommunications","score_opus":0.022860702600461316,"score_gpt":0.2763915560202189,"score_spread":0.2535308534197576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121165908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003062023,0.00007266241,0.9965249,0.000037996662,0.0000054020243,0.000005619407,0.000008666989,0.00007434634,0.00020831506],"genre_scores_gemma":[0.22497578,0.00062930194,0.7723761,0.000087390385,0.00008916603,0.00014081576,0.00022199257,0.000072547,0.001406846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994591,0.00023010156,0.000023763738,0.00008514538,0.00017283912,0.000029090517],"domain_scores_gemma":[0.9982663,0.0012791265,0.0001819845,0.0000923268,0.00015981955,0.000020479485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085402414,0.0006570247,0.000772906,0.00051694864,0.00021721075,0.0006201994,0.0006563259,0.0007745443,0.00046514857],"category_scores_gemma":[0.0059309932,0.00049499894,0.00045851563,0.0008188991,0.00064245344,0.0012688435,0.000859497,0.0006501718,0.00038800415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099532444,0.00003742543,0.00084180693,0.00017783963,0.00005297519,0.000091428046,0.000116571246,0.82296443,0.018200193,0.030163292,0.000677836,0.12657665],"study_design_scores_gemma":[0.000011167503,0.000024519433,0.0001477434,0.0000066082844,0.0000053439276,0.00002792788,0.0000071019635,0.98708516,0.002763554,0.009388591,0.00052354584,0.000008850058],"about_ca_topic_score_codex":0.0007888126,"about_ca_topic_score_gemma":0.00095050083,"teacher_disagreement_score":0.00085402414,"about_ca_system_score_codex":0.00031221015,"about_ca_system_score_gemma":0.0005519007,"threshold_uncertainty_score":0.0045166016},"labels":[],"label_agreement":null},{"id":"W2121639850","doi":"10.1109/tsp.2006.887131","title":"Time-Width Versus Frequency Band Mapping of Energy Distributions","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Time–frequency analysis; Computer science; Transformation (genetics); Signal processing; Pattern recognition (psychology); Feature extraction; Matching pursuit; Artificial intelligence; Bilinear interpolation; Parametric statistics; SIGNAL (programming language); Decomposition; Mathematics; Digital signal processing; Computer vision","score_opus":0.02813825616170755,"score_gpt":0.277586321804161,"score_spread":0.24944806564245342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121639850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023653047,0.00023437606,0.9726332,0.00007482056,0.000038184764,0.000025103918,0.00004666094,0.00018572119,0.003108971],"genre_scores_gemma":[0.54713523,0.0015159389,0.44435307,0.00010386088,0.00009639037,0.00015621503,0.00021072054,0.00034187728,0.006086719],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999801,0.00004604694,0.00001310333,0.000057998997,0.00006649878,0.000015362359],"domain_scores_gemma":[0.999653,0.00015516761,0.00004585132,0.00006361134,0.00006705606,0.000015264493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031375373,0.00044542344,0.00021915163,0.00067560654,0.00014409503,0.00052022113,0.00035018445,0.00037249847,0.002255568],"category_scores_gemma":[0.0014160324,0.00014069218,0.00028692628,0.0006455182,0.0005031051,0.0010637013,0.00040227312,0.00043635725,0.00069327967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034775684,0.00010922793,0.0013821392,0.0002492857,0.000041586267,0.00036019532,0.0002728164,0.06538813,0.27398413,0.08527728,0.0014350588,0.5711524],"study_design_scores_gemma":[0.00003189275,0.00027617117,0.0055078957,0.00006299643,0.000036109657,0.0019279047,0.00021080994,0.73470426,0.14487454,0.089661784,0.022635564,0.00007005516],"about_ca_topic_score_codex":0.00017363287,"about_ca_topic_score_gemma":0.00012225406,"teacher_disagreement_score":0.002255568,"about_ca_system_score_codex":0.00017574758,"about_ca_system_score_gemma":0.00014247668,"threshold_uncertainty_score":0.0075455904},"labels":[],"label_agreement":null},{"id":"W2121724382","doi":"10.1109/tsp.2009.2012598","title":"The Canonical Bicoherence—Part I: Definition, Multitaper Estimation, and Statistics","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Machine Fault Diagnosis Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Bicoherence; Multitaper; Mathematics; Algorithm; Applied mathematics; Computer science; Bispectrum; Artificial intelligence; Statistics; Spectral density","score_opus":0.01645214686892473,"score_gpt":0.2716772530052036,"score_spread":0.2552251061362789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121724382","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002466504,0.007769994,0.97796375,0.0009074986,0.00085542054,0.000040004776,0.00021319596,0.000117897434,0.009665681],"genre_scores_gemma":[0.22555564,0.032693364,0.7023545,0.003256134,0.0071939095,0.00073369115,0.0015191492,0.0010572934,0.025636362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968575,0.0011086602,0.00021047915,0.00067560864,0.00097080355,0.00017701554],"domain_scores_gemma":[0.9946091,0.0023767848,0.00045097322,0.0009908509,0.0014675086,0.000104685496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030353998,0.0011578376,0.0012596198,0.003284119,0.00073070626,0.0036955576,0.0011560582,0.0015993578,0.0036794718],"category_scores_gemma":[0.013024174,0.0006879158,0.0008513015,0.0047497894,0.004768076,0.004910904,0.0022526423,0.0035863654,0.0021634158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006972639,0.000026918604,0.0008859544,0.00035446777,0.000063023916,0.000119605895,0.0003296737,0.013381986,0.004532573,0.8340305,0.014283854,0.13192162],"study_design_scores_gemma":[0.000013878301,0.00021104472,0.0020035007,0.00036894996,0.00006473238,0.0012266507,0.00031137784,0.13529211,0.012291932,0.6583511,0.18963562,0.00022908405],"about_ca_topic_score_codex":0.0016754278,"about_ca_topic_score_gemma":0.0007081081,"teacher_disagreement_score":0.0036955576,"about_ca_system_score_codex":0.0012712671,"about_ca_system_score_gemma":0.0011025596,"threshold_uncertainty_score":0.016052902},"labels":[],"label_agreement":null},{"id":"W2122650444","doi":"10.1109/tsp.2005.857055","title":"A receiver-based variable-size-burst equalization strategy for spectrally efficient wireless communications","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Spectral efficiency; Equalization (audio); Variable (mathematics); Channel (broadcasting); Wireless; Block (permutation group theory); Quality of service; Communications system; Real-time computing; Electronic engineering; Telecommunications; Mathematics; Engineering","score_opus":0.034270427688773884,"score_gpt":0.2940540370123928,"score_spread":0.25978360932361894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122650444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005916663,0.00012601358,0.99339336,0.000039905342,0.000025666337,0.000017604787,0.000008040336,0.00012265248,0.00035014458],"genre_scores_gemma":[0.28466138,0.00042651038,0.7102585,0.0001280902,0.00011428947,0.0001340813,0.000083668216,0.00006987848,0.0041237017],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997178,0.00008278233,0.00002086974,0.00005622017,0.00008812033,0.00003427816],"domain_scores_gemma":[0.9995944,0.00015788035,0.00004937334,0.00008461565,0.00009003879,0.00002368265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000543385,0.00061038637,0.00073545857,0.00032712304,0.00034501796,0.0004612098,0.0010855141,0.00059056404,0.0010021223],"category_scores_gemma":[0.0009339948,0.0002822759,0.00027759394,0.00034208546,0.0005098658,0.0009101029,0.0007746897,0.0007089495,0.00047977676],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054055505,0.00032525498,0.0007615669,0.00024454232,0.000111305635,0.00024855728,0.00027433108,0.14009501,0.27675924,0.060111128,0.002961013,0.5175676],"study_design_scores_gemma":[0.000060631526,0.00027445008,0.00024184589,0.00001480531,0.000037586917,0.0002588086,0.000021109901,0.9482772,0.036659006,0.010184905,0.0039313952,0.000038246828],"about_ca_topic_score_codex":0.0003647326,"about_ca_topic_score_gemma":0.0005544035,"teacher_disagreement_score":0.0010855141,"about_ca_system_score_codex":0.00027453134,"about_ca_system_score_gemma":0.00042486476,"threshold_uncertainty_score":0.0033524632},"labels":[],"label_agreement":null},{"id":"W2123436405","doi":"10.1109/tsp.2011.2138699","title":"Stochastic Multiple Stream Decoding of Cortex Codes","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; List decoding; Block code; Algorithm; Belief propagation; Hamming code; Stochastic computing; Berlekamp–Welch algorithm; Sequential decoding; Theoretical computer science; Concatenated error correction code","score_opus":0.046209581875526914,"score_gpt":0.27024279200051676,"score_spread":0.22403321012498983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123436405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084547885,0.00024250752,0.9095526,0.00024102956,0.00005889337,0.000035128625,0.00010719722,0.00044035228,0.0047743456],"genre_scores_gemma":[0.79597473,0.00036035106,0.19726606,0.00013843624,0.000047699825,0.000068449845,0.00018036542,0.00006257562,0.0059013255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995578,0.000102464415,0.00002759084,0.000054233224,0.00020791007,0.000049963368],"domain_scores_gemma":[0.9991523,0.0003013914,0.00010473581,0.00013011183,0.00027680927,0.000034662073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048998697,0.00032730834,0.00038306753,0.00036484824,0.000247014,0.00059896155,0.00039893802,0.00041858855,0.001084732],"category_scores_gemma":[0.0024105876,0.0001364367,0.00024683413,0.00042865422,0.00033303737,0.0005212106,0.0005856245,0.00045265615,0.00038365606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006362414,0.00006682693,0.0022172788,0.0002256633,0.000069737835,0.0005695379,0.00022382564,0.4071188,0.087749094,0.23875608,0.0029489996,0.25941795],"study_design_scores_gemma":[0.000019851837,0.00006981132,0.00028679884,0.000020314646,0.000011590069,0.0001919849,0.000015512362,0.9282599,0.045333177,0.023459163,0.0023180824,0.000013792678],"about_ca_topic_score_codex":0.0011232091,"about_ca_topic_score_gemma":0.0019239206,"teacher_disagreement_score":0.0011232091,"about_ca_system_score_codex":0.00047087914,"about_ca_system_score_gemma":0.0011241275,"threshold_uncertainty_score":0.00362885},"labels":[],"label_agreement":null},{"id":"W2124201613","doi":"10.1109/tsp.2011.2177830","title":"A Semi-Closed-Form Solution to Optimal Distributed Beamforming for Two-Way Relay Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Beamforming; Transceiver; Transmitter power output; Computer science; Minification; Relay channel; Transmitter; Power (physics); Optimization problem; Mathematical optimization; Topology (electrical circuits); Control theory (sociology); Mathematics; Telecommunications; Channel (broadcasting); Algorithm; Wireless; Artificial intelligence","score_opus":0.053976609656040515,"score_gpt":0.2837499881424275,"score_spread":0.22977337848638701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124201613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011414995,0.00010380028,0.9965713,0.00009537493,0.000025355925,0.000034054265,0.000040595198,0.00008540798,0.0019026261],"genre_scores_gemma":[0.1732931,0.0007989453,0.814375,0.00026242202,0.00010402631,0.00084107934,0.00039786758,0.00015374532,0.009773915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993168,0.00023202233,0.000028536908,0.00013085804,0.00022775347,0.000063956446],"domain_scores_gemma":[0.998747,0.00071609,0.000085135034,0.000074931486,0.00033690833,0.00003985848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014857323,0.0013968506,0.0012943323,0.00042899558,0.00038397367,0.0017870358,0.0010067712,0.0018991721,0.0075271977],"category_scores_gemma":[0.0034323626,0.00061951706,0.0007376064,0.0006463299,0.0010170382,0.0014108125,0.0013457059,0.0017618656,0.002103416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041926935,0.00005989712,0.00014968048,0.00022052822,0.00002255785,0.00010983355,0.00010148221,0.90641785,0.003603925,0.043260228,0.0036541107,0.042358067],"study_design_scores_gemma":[0.000016961756,0.000044026212,0.000038228573,0.000020636027,0.000004248847,0.000046912075,0.000028515193,0.9832759,0.0006182501,0.013758783,0.0021379043,0.000009661881],"about_ca_topic_score_codex":0.0013379736,"about_ca_topic_score_gemma":0.001874413,"teacher_disagreement_score":0.0075271977,"about_ca_system_score_codex":0.00080955954,"about_ca_system_score_gemma":0.0014557061,"threshold_uncertainty_score":0.025180995},"labels":[],"label_agreement":null},{"id":"W2124470804","doi":"10.1109/tsp.2007.909013","title":"A Low-Complexity PTS-Based Radix FFT Method for PAPR Reduction in OFDM Systems","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Fast Fourier transform; Orthogonal frequency-division multiplexing; Decimation; Computational complexity theory; Reduction (mathematics); Radix (gastropod); Mathematics; Algorithm; Multiplicative function; Frequency-division multiplexing; Arithmetic; Computer science; Telecommunications; Statistics; Bandwidth (computing)","score_opus":0.055887912364986074,"score_gpt":0.29738503570212965,"score_spread":0.24149712333714357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124470804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008322241,0.00025039076,0.98977715,0.00004505493,0.000042511438,0.000022515167,0.000013542245,0.0002522567,0.0012742587],"genre_scores_gemma":[0.16326785,0.0006983171,0.8308336,0.00006472735,0.00011765269,0.00006791867,0.000088595654,0.000074284755,0.0047869906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998202,0.000035698635,0.000011250452,0.000025687592,0.00009677842,0.000010525871],"domain_scores_gemma":[0.99979275,0.00007641377,0.000028164213,0.000034649514,0.00005841557,0.000009691685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019640781,0.0005248389,0.0003011973,0.00036130234,0.0002773199,0.00033060345,0.00041261324,0.00026919876,0.0026241976],"category_scores_gemma":[0.0006906297,0.00017889641,0.00032737292,0.00044255375,0.00028388202,0.0004547193,0.00023347753,0.00045938473,0.0008472916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025953,0.000066290435,0.0003958396,0.00023421583,0.000039146173,0.00017481364,0.00014598931,0.039272685,0.28577048,0.015811527,0.001955387,0.6558741],"study_design_scores_gemma":[0.000083971994,0.0007666492,0.0011675621,0.000045977198,0.00006988103,0.0016954845,0.000051437783,0.70313567,0.2529486,0.0066471747,0.03333318,0.00005433648],"about_ca_topic_score_codex":0.00042664955,"about_ca_topic_score_gemma":0.00072240114,"teacher_disagreement_score":0.0026241976,"about_ca_system_score_codex":0.00020249381,"about_ca_system_score_gemma":0.00040930518,"threshold_uncertainty_score":0.008778751},"labels":[],"label_agreement":null},{"id":"W2124715093","doi":"10.1109/tsp.2009.2027735","title":"Monotonicity of Constrained Optimal Transmission Policies in Correlated Fading Channels With ARQ","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Markov decision process; Monotonic function; Monotone polygon; Mathematical optimization; Fading; Scheduling (production processes); Dynamic programming; Channel state information; Computer science; Channel (broadcasting); Mathematics; Markov process; Wireless; Computer network; Statistics; Telecommunications","score_opus":0.00890911092742783,"score_gpt":0.22456428881564205,"score_spread":0.21565517788821423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124715093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088996716,0.00036169594,0.90634966,0.00047456988,0.0000217993,0.00009126021,0.00011345879,0.00017516437,0.0034155874],"genre_scores_gemma":[0.8963454,0.00051657355,0.10077257,0.00018760351,0.00004169617,0.00026314842,0.00013762366,0.00010535281,0.0016300022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972818,0.0013025567,0.00011863585,0.00035919467,0.0004683716,0.00046940008],"domain_scores_gemma":[0.9859547,0.011077686,0.0013126604,0.0004521782,0.0009063677,0.0002965225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048665325,0.0009640992,0.001529787,0.0006629583,0.0004696641,0.0013509131,0.0013564639,0.0009990865,0.001665583],"category_scores_gemma":[0.020524615,0.00092282495,0.00068692194,0.0007564123,0.0018182702,0.0026586573,0.0012196068,0.0013682625,0.00021313534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010248616,0.000057256166,0.0003448694,0.000068110916,0.000033895023,0.000100779835,0.00006909192,0.94633836,0.0011533218,0.045206014,0.0002770403,0.006248755],"study_design_scores_gemma":[0.00001736103,0.000032474636,0.00009762521,0.000007743132,0.000005326312,0.000014030352,0.000007998729,0.9862851,0.00038007685,0.013030949,0.000115097006,0.000006256662],"about_ca_topic_score_codex":0.005653852,"about_ca_topic_score_gemma":0.0024679336,"teacher_disagreement_score":0.005653852,"about_ca_system_score_codex":0.0018721126,"about_ca_system_score_gemma":0.0030273844,"threshold_uncertainty_score":0.025736928},"labels":[],"label_agreement":null},{"id":"W2125350250","doi":"10.1109/tsp.2005.853149","title":"A factor-image framework to quantification of brain receptor dynamic PET studies","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Medical Imaging Techniques and Applications","field":"Medicine","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Institute of Diabetes and Digestive and Kidney Diseases; National Institute on Aging; National Institute on Alcohol Abuse and Alcoholism","keywords":"Voxel; Positron emission tomography; Radioligand; Computer science; Artificial intelligence; Pixel; Parametric statistics; Pattern recognition (psychology); Binding potential; Image resolution; Sampling (signal processing); Biological system; Mathematics; Algorithm; Computer vision; Statistics; Nuclear medicine; Chemistry; Binding site","score_opus":0.04736948100077124,"score_gpt":0.3838867596912628,"score_spread":0.33651727869049153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125350250","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007043975,0.00009536376,0.99895406,0.000016561007,0.0000050454064,0.000007564653,0.000016256481,0.00010960057,0.000090992566],"genre_scores_gemma":[0.084592566,0.00060943374,0.9134524,0.000041760988,0.000073420626,0.00010198967,0.00015176662,0.00015620717,0.00082047743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957234,0.000168891,0.00002397523,0.00008237781,0.00012418658,0.000028236014],"domain_scores_gemma":[0.99923766,0.0003837227,0.000100020705,0.000083888954,0.00016156408,0.00003319339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013201087,0.0009871855,0.0007748754,0.0009227329,0.0002366885,0.00094319636,0.0011526424,0.00083214685,0.0015682859],"category_scores_gemma":[0.0043873037,0.00038621065,0.00083806243,0.0010348033,0.0008765261,0.001451339,0.00071826007,0.0008536958,0.0006002474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017778987,0.000054656983,0.0005511285,0.00026180787,0.00006987509,0.00019392557,0.00011688279,0.6396647,0.036734074,0.11378775,0.0013941937,0.20699322],"study_design_scores_gemma":[0.0000076380375,0.000044332577,0.00017379582,0.000009204308,0.000009068975,0.00008413688,0.0000074425748,0.97645104,0.0033572048,0.017603694,0.0022296777,0.000022740573],"about_ca_topic_score_codex":0.002367768,"about_ca_topic_score_gemma":0.0012557786,"teacher_disagreement_score":0.002367768,"about_ca_system_score_codex":0.0005706167,"about_ca_system_score_gemma":0.000747961,"threshold_uncertainty_score":0.006981492},"labels":[],"label_agreement":null},{"id":"W2125592692","doi":"10.1109/tsp.2007.893950","title":"A Vector-Hydrophone's Minimal Composition for Finite Estimation-Variance in Direction-Finding Near/Without a Reflecting Boundary","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Underwater Acoustics Research","field":"Earth and Planetary Sciences","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hydrophone; Acoustics; Boundary (topology); Underwater; Underwater acoustics; Sound pressure; Geology; Mathematics; Physics; Mathematical analysis","score_opus":0.04446443621182637,"score_gpt":0.3268000907117069,"score_spread":0.2823356544998805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125592692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022825874,0.000040145256,0.9751713,0.000058967733,0.000017399174,0.000022406122,0.00005681671,0.00018060188,0.0016264776],"genre_scores_gemma":[0.4040191,0.00007787689,0.59371024,0.000042786014,0.000029367051,0.00010637821,0.00023928368,0.00012796027,0.0016469245],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909484,0.00029504564,0.000055599452,0.00018613673,0.0003001058,0.00006817705],"domain_scores_gemma":[0.9987141,0.0005678912,0.00012522258,0.00021136564,0.00028806346,0.00009328339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008459807,0.0007078747,0.0005984771,0.00035423876,0.0004842452,0.00053012033,0.00057880546,0.00047089395,0.0020534378],"category_scores_gemma":[0.0049293074,0.0004026149,0.00027414373,0.00033523058,0.0008829479,0.00088434847,0.0012015909,0.0007822296,0.0008005873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013319317,0.00014334806,0.0027125007,0.00040559526,0.000056616023,0.0005089993,0.00035159674,0.13022853,0.38635302,0.1376972,0.0033264724,0.3368841],"study_design_scores_gemma":[0.00008486034,0.00054777786,0.0021185507,0.000068170426,0.00003917757,0.0008660218,0.00011737035,0.80908555,0.114630274,0.06586518,0.006496607,0.00008046247],"about_ca_topic_score_codex":0.00079190877,"about_ca_topic_score_gemma":0.0009917406,"teacher_disagreement_score":0.0020534378,"about_ca_system_score_codex":0.00018712821,"about_ca_system_score_gemma":0.00089551235,"threshold_uncertainty_score":0.0068694353},"labels":[],"label_agreement":null},{"id":"W2125740982","doi":"10.1109/tsp.2007.911496","title":"Energy Efficient Distributed Filtering With Wireless Sensor Networks","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Wireless sensor network; Computer science; Decoding methods; Algorithm; Scalability; Sensor fusion; Distributed algorithm; Markov process; Hidden Markov model; Mathematics; Artificial intelligence; Distributed computing; Statistics","score_opus":0.013469974874539149,"score_gpt":0.2055434973310528,"score_spread":0.19207352245651363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125740982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010654133,0.00023290477,0.9877539,0.0001136993,0.00002616074,0.00001419305,0.0000198075,0.0001590968,0.001026109],"genre_scores_gemma":[0.779911,0.00083182234,0.21492921,0.00011422532,0.00011200851,0.00013827856,0.00011883819,0.000051248873,0.003793372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948347,0.00014204641,0.000022772118,0.00011782846,0.00018875446,0.00004510535],"domain_scores_gemma":[0.9991221,0.0006163244,0.000065205655,0.00009600657,0.00008508542,0.000015397616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070723676,0.0006552622,0.00073724304,0.00030136332,0.0003933089,0.00071118865,0.0009781641,0.00097157847,0.0008709253],"category_scores_gemma":[0.0023518363,0.0002772276,0.00045256902,0.00067796756,0.00067179906,0.0014434679,0.00082342187,0.00079888786,0.000242835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007729108,0.00003492244,0.0002847218,0.000053258795,0.000024853032,0.000038600105,0.00004604459,0.93966466,0.0045122355,0.014603882,0.00037574233,0.040283762],"study_design_scores_gemma":[0.000006670884,0.000016332348,0.000055128457,0.0000026697903,0.0000035092428,0.000010663468,0.0000061891715,0.99225473,0.00094337517,0.006289848,0.00040698922,0.0000038362723],"about_ca_topic_score_codex":0.0027088532,"about_ca_topic_score_gemma":0.002133308,"teacher_disagreement_score":0.0027088532,"about_ca_system_score_codex":0.00067296985,"about_ca_system_score_gemma":0.000598385,"threshold_uncertainty_score":0.0053861737},"labels":[],"label_agreement":null},{"id":"W2126094743","doi":"10.1109/78.815499","title":"On the relationship between the overlapping rounding transform and lifting frameworks for reversible subband transforms","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Rounding; Computer science; Algorithm; Mathematics; Arithmetic","score_opus":0.06100637689231692,"score_gpt":0.29398497929093237,"score_spread":0.23297860239861545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126094743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009795382,0.0010449822,0.9716106,0.00029309528,0.00012817334,0.00004113861,0.00004250355,0.00014796537,0.016896147],"genre_scores_gemma":[0.48605573,0.006844367,0.49101302,0.000568498,0.0010647501,0.00026799168,0.00024152834,0.00034510705,0.013598992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990694,0.00023306809,0.000049028567,0.00014763341,0.0003667501,0.00013413542],"domain_scores_gemma":[0.9989889,0.0004898103,0.00011096143,0.00020928092,0.00013865749,0.000062381834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017610783,0.00089036085,0.00067989476,0.0011603489,0.0008472153,0.0020442905,0.001166313,0.0011360229,0.0042856354],"category_scores_gemma":[0.0032615007,0.0004231175,0.0008371813,0.0011182214,0.002831812,0.0037756898,0.002193163,0.0028060926,0.0009107487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022459057,0.000010367324,0.000030973697,0.000036530408,0.000004329098,0.00008042084,0.000060868486,0.010273895,0.0026858794,0.9687858,0.000492145,0.017516397],"study_design_scores_gemma":[0.000020174657,0.00010240789,0.00015000407,0.000073113326,0.0000172246,0.00032739912,0.00007194432,0.18461707,0.004968061,0.7932193,0.016362714,0.00007055791],"about_ca_topic_score_codex":0.00082177494,"about_ca_topic_score_gemma":0.00078747235,"teacher_disagreement_score":0.0042856354,"about_ca_system_score_codex":0.0006066866,"about_ca_system_score_gemma":0.00064333016,"threshold_uncertainty_score":0.014336884},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Capon; Estimator; Algorithm; Mathematics; Estimation theory; Computer science; Statistics; Beamforming","score_opus":0.024488961679666566,"score_gpt":0.279672682163631,"score_spread":0.2551837204839644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126344571","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026855222,0.00023216315,0.99631184,0.00003119014,0.000026009533,0.000010213864,0.000010444457,0.000092141745,0.000600485],"genre_scores_gemma":[0.23479396,0.00097279606,0.759508,0.00024576136,0.00016931669,0.000115197014,0.00015598244,0.00010207535,0.003936977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945563,0.00016862378,0.000015170105,0.000103732054,0.00021996735,0.00003688873],"domain_scores_gemma":[0.99920064,0.00035066306,0.000071772585,0.000093901195,0.0002534948,0.000029470159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067815813,0.0007667559,0.0006754697,0.00092314096,0.00027339955,0.0006710837,0.0008138131,0.0010558743,0.0013253733],"category_scores_gemma":[0.0022101726,0.00029135897,0.00041544074,0.0008009777,0.000589995,0.0014475156,0.00090469065,0.0006549372,0.0004679004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029880094,0.000067020206,0.0016459392,0.00042809383,0.00012884106,0.00045415378,0.00025506373,0.33147883,0.07971169,0.076709636,0.004329268,0.5044927],"study_design_scores_gemma":[0.000014136422,0.00008425661,0.00046910023,0.000023495666,0.000023880513,0.0003383968,0.000023383764,0.97145027,0.013026071,0.00758571,0.0069221426,0.00003910076],"about_ca_topic_score_codex":0.0007638388,"about_ca_topic_score_gemma":0.00097213534,"teacher_disagreement_score":0.0013253733,"about_ca_system_score_codex":0.00033719157,"about_ca_system_score_gemma":0.00046190913,"threshold_uncertainty_score":0.0044338107},"labels":[],"label_agreement":null},{"id":"W2127125401","doi":"10.1109/tsp.2008.2010643","title":"A Fast Robust Recursive Least-Squares Algorithm","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Algorithm; Recursive least squares filter; Adaptive filter; Computer science; System identification; Norm (philosophy); Filtering theory; Least-squares function approximation; Constraint (computer-aided design); Mathematical optimization; Mathematics; Data modeling","score_opus":0.02841504991357172,"score_gpt":0.23530166502921288,"score_spread":0.20688661511564116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127125401","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008671593,0.00009853589,0.99793977,0.00004570443,0.000028496741,0.000017985942,0.000034340082,0.00051639264,0.00045158563],"genre_scores_gemma":[0.032596488,0.00021245265,0.96274734,0.00007738828,0.000072075214,0.00009968439,0.00026875694,0.0001805757,0.0037453286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912983,0.00019865934,0.00004528227,0.00020858711,0.0003568959,0.000060879014],"domain_scores_gemma":[0.9993285,0.00026167734,0.00005762164,0.00009798574,0.00023515557,0.00001905357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085157173,0.0010095196,0.0012358568,0.0006964221,0.0003543223,0.0009306774,0.0013166768,0.0014270092,0.0052942075],"category_scores_gemma":[0.0023824784,0.0005859282,0.000897356,0.0007944502,0.00042216867,0.0010429095,0.0009211268,0.0012835781,0.0045336494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014153663,0.000053767984,0.0003598214,0.00019843139,0.00010380807,0.00011635026,0.00007574298,0.37677035,0.02622643,0.026281912,0.008068976,0.5616029],"study_design_scores_gemma":[0.000023819443,0.000041089006,0.00012454801,0.000010338651,0.000013290277,0.000085912594,0.000007718659,0.9835934,0.0045017153,0.003307387,0.0082717445,0.000019052575],"about_ca_topic_score_codex":0.0023523755,"about_ca_topic_score_gemma":0.0029018219,"teacher_disagreement_score":0.0052942075,"about_ca_system_score_codex":0.00037769822,"about_ca_system_score_gemma":0.0011148747,"threshold_uncertainty_score":0.017710865},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.036415276357671035,"score_gpt":0.2695414694199151,"score_spread":0.23312619306224405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127695678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00545123,0.00007046898,0.9934528,0.00002186613,0.000020623731,0.000010164952,0.000026977155,0.00028283265,0.00066295767],"genre_scores_gemma":[0.089765705,0.00018224768,0.90786654,0.000024682262,0.000037767837,0.000035238056,0.00021789862,0.00007687596,0.001793046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994735,0.000088206405,0.000044052358,0.00012025222,0.0002393947,0.00003460609],"domain_scores_gemma":[0.9993612,0.00019794502,0.000077244076,0.00012577041,0.0002120115,0.000025782143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006424822,0.0010545508,0.0007238653,0.000848645,0.00029530996,0.00080277136,0.00061753637,0.0006260343,0.0026138618],"category_scores_gemma":[0.0021568052,0.0004663648,0.0005872331,0.0005543808,0.00033363514,0.0016616692,0.0009726783,0.0006249567,0.0019640743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022866247,0.000040142902,0.001448833,0.00013995919,0.000059032867,0.000089379144,0.00007742596,0.060484804,0.09789606,0.009923149,0.0012336316,0.8283788],"study_design_scores_gemma":[0.0000491131,0.00023817693,0.0020075825,0.00004127503,0.0000575235,0.00079479127,0.000081040795,0.8912033,0.08815752,0.008536491,0.008760114,0.000073031195],"about_ca_topic_score_codex":0.00063328294,"about_ca_topic_score_gemma":0.0012669173,"teacher_disagreement_score":0.0026138618,"about_ca_system_score_codex":0.00017148927,"about_ca_system_score_gemma":0.00057088427,"threshold_uncertainty_score":0.008744299},"labels":[],"label_agreement":null},{"id":"W2128089968","doi":"10.1109/tsp.2007.894395","title":"On the Maximum Number of Receiver Diversity Antennas That Can Be Usefully Deployed in a Cochannel Interference Dominated Environment","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Interference (communication); Maximal-ratio combining; Signal-to-interference ratio; Fading; Antenna (radio); Antenna diversity; Bit error rate; Computer science; Electronic engineering; Diversity gain; Diversity combining; Antenna array; MIMO; Power (physics); Mathematics; Telecommunications; Beamforming; Physics; Engineering","score_opus":0.0232720846843845,"score_gpt":0.22789626897721293,"score_spread":0.20462418429282844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128089968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30900037,0.0054410775,0.6491861,0.0018179578,0.00009782402,0.000060619142,0.00029826278,0.00028948887,0.033808354],"genre_scores_gemma":[0.93935484,0.0027965684,0.05521402,0.00019336295,0.00021060913,0.0000724594,0.00008667476,0.000066819164,0.0020046914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984067,0.00087621843,0.000048753995,0.00021308908,0.00027455456,0.00018067671],"domain_scores_gemma":[0.98334163,0.01462988,0.00061499706,0.00072196004,0.0005099341,0.00018170924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016865389,0.0011294758,0.0013061458,0.0006306127,0.0003647858,0.0008298224,0.000970932,0.00085979514,0.0022431496],"category_scores_gemma":[0.013921945,0.0005038845,0.00032924904,0.0006421057,0.0014674264,0.0022846807,0.0009823396,0.0007046611,0.0008035157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012370285,0.00012280172,0.002073143,0.0003232714,0.00009273716,0.0004348713,0.00007303903,0.8189008,0.042883303,0.036880698,0.002434401,0.09454386],"study_design_scores_gemma":[0.00014709288,0.00078925194,0.0043062796,0.00021809357,0.00012044465,0.0010083582,0.00023706706,0.9119795,0.026368935,0.05160354,0.0031333524,0.00008808088],"about_ca_topic_score_codex":0.00032546066,"about_ca_topic_score_gemma":0.00045257463,"teacher_disagreement_score":0.0022431496,"about_ca_system_score_codex":0.00040171767,"about_ca_system_score_gemma":0.00030074792,"threshold_uncertainty_score":0.008919418},"labels":[],"label_agreement":null},{"id":"W2128879995","doi":"10.1109/tsp.2011.2152395","title":"Wide-Band Collaborative Spectrum Search Strategy for Cognitive Radio Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cognitive radio; Computer science; Channel (broadcasting); Spectrum (functional analysis); Algorithm; Artificial intelligence; Wireless; Telecommunications; Physics","score_opus":0.042005135956603316,"score_gpt":0.2716710511348177,"score_spread":0.22966591517821439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128879995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08615341,0.0012234017,0.89645165,0.00074281276,0.00012319357,0.000112216316,0.00019240298,0.00023095887,0.01477008],"genre_scores_gemma":[0.96503055,0.0003905981,0.028989524,0.00014040359,0.000059109156,0.00013843633,0.0001081717,0.000025995047,0.0051172697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985631,0.00047423434,0.000048532864,0.00027224145,0.00027019886,0.00037170722],"domain_scores_gemma":[0.99704903,0.0019042344,0.0003436107,0.00014070877,0.00034301658,0.00021937094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001674593,0.0013911222,0.0016898665,0.0008762084,0.0007916583,0.0016117962,0.0026701016,0.0025147866,0.0031141243],"category_scores_gemma":[0.005549454,0.00054782064,0.00085201894,0.0011899299,0.0011268702,0.001904459,0.0018055626,0.0010392783,0.00063573784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041461582,0.00014075065,0.0006870557,0.00016026472,0.00012867678,0.00055126403,0.00018118804,0.9325073,0.0025564125,0.041161973,0.002100284,0.019410338],"study_design_scores_gemma":[0.000031285133,0.00005503577,0.00008619767,0.000007196294,0.00001618007,0.0000585955,0.000030142248,0.98983383,0.00019840323,0.009360169,0.0003111905,0.000011793118],"about_ca_topic_score_codex":0.0057800077,"about_ca_topic_score_gemma":0.0035942039,"teacher_disagreement_score":0.0057800077,"about_ca_system_score_codex":0.0012314264,"about_ca_system_score_gemma":0.0014494846,"threshold_uncertainty_score":0.011492729},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08925510916687908,"score_gpt":0.24929883237730496,"score_spread":0.16004372321042587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129114382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03219114,0.002723631,0.92496973,0.000499585,0.0011260303,0.00052693277,0.0015716702,0.020881334,0.015509942],"genre_scores_gemma":[0.29705232,0.0019874752,0.6527486,0.0012189662,0.0005371173,0.000655317,0.0028532546,0.000308282,0.042638652],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99936,0.000045863766,0.000059180646,0.0002297584,0.0002633575,0.00004180534],"domain_scores_gemma":[0.99977547,0.000030282714,0.00002655277,0.000047768506,0.000091670016,0.000028286686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002523349,0.0009160693,0.0011047655,0.0005409061,0.00035058896,0.00083665096,0.0014829612,0.0011114845,0.008854265],"category_scores_gemma":[0.00058836595,0.00041544606,0.0003265024,0.0006729657,0.00017887543,0.0010176,0.00089468766,0.00072451984,0.00973352],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004495109,0.00022555607,0.0016504774,0.00061172177,0.000077587196,0.0008875342,0.00011086498,0.0040318887,0.2837619,0.0026068797,0.021009874,0.68457615],"study_design_scores_gemma":[0.00030615675,0.0015773773,0.015728619,0.00023187017,0.00033332163,0.009580027,0.00014111088,0.52183414,0.27137133,0.003263742,0.17532074,0.00031155127],"about_ca_topic_score_codex":0.0010435763,"about_ca_topic_score_gemma":0.0017084741,"teacher_disagreement_score":0.008854265,"about_ca_system_score_codex":0.00022693038,"about_ca_system_score_gemma":0.00044618265,"threshold_uncertainty_score":0.029620469},"labels":[],"label_agreement":null},{"id":"W2129436741","doi":"10.1109/tsp.2007.896091","title":"An Information Geometric Approach to ML Estimation With Incomplete Data: Application to Semiblind MIMO Channel Identification","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"MIMO; Expectation–maximization algorithm; Algorithm; Computer science; Estimation theory; Channel (broadcasting); Maximization; Gaussian; Range (aeronautics); Identification (biology); Probability distribution; Iterative method; Mathematics; Mathematical optimization; Maximum likelihood; Statistics; Engineering","score_opus":0.02682861038915697,"score_gpt":0.28795241843256636,"score_spread":0.2611238080434094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129436741","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005888535,0.00004789283,0.99899346,0.000063339896,0.000008706857,0.0000053929916,0.000007750215,0.000057783778,0.00022672964],"genre_scores_gemma":[0.13206041,0.00064479536,0.86516976,0.00021837177,0.0001664066,0.00011895209,0.00013776936,0.00012095985,0.0013625659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814713,0.00096573605,0.000080663136,0.0002325378,0.00050222897,0.000071662864],"domain_scores_gemma":[0.99354035,0.0044874023,0.0004927411,0.0008438884,0.00054254016,0.000093058574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029142988,0.0012959853,0.0012287298,0.0013407737,0.00045708622,0.0012440747,0.0013043134,0.001191554,0.0015183063],"category_scores_gemma":[0.014070029,0.0006016796,0.000844197,0.0012307287,0.0022656207,0.0027829092,0.0023360504,0.0016108642,0.0006122625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008326005,0.000043155214,0.00038852997,0.0001482002,0.000071234164,0.0001618982,0.00016826323,0.7209036,0.004135535,0.13362274,0.0013342637,0.13893937],"study_design_scores_gemma":[0.0000097411785,0.000042684314,0.0000985898,0.0000132293035,0.0000087698745,0.00013208787,0.000015631904,0.94025195,0.0024018139,0.055290777,0.0017093391,0.000025371972],"about_ca_topic_score_codex":0.0005303576,"about_ca_topic_score_gemma":0.0005162191,"teacher_disagreement_score":0.0029142988,"about_ca_system_score_codex":0.00056691945,"about_ca_system_score_gemma":0.0009331466,"threshold_uncertainty_score":0.01541245},"labels":[],"label_agreement":null},{"id":"W2130057124","doi":"10.1109/tsp.2007.896076","title":"Multiuser Spectrum Optimization for Discrete Multitone Systems With Asynchronous Crosstalk","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Digital subscriber line; Asynchronous communication; Computer science; Orthogonal frequency-division multiplexing; Computational complexity theory; Optimization problem; Key (lock); Frequency domain; Interference (communication); Mathematical optimization; Algorithm; Telecommunications; Mathematics","score_opus":0.01248451833700025,"score_gpt":0.24766424658526012,"score_spread":0.23517972824825986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130057124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018195653,0.00016170018,0.9800798,0.00014339169,0.000010958794,0.000015244639,0.000014644976,0.00004594601,0.0013327183],"genre_scores_gemma":[0.7054564,0.00044545747,0.28823173,0.00010376905,0.000050148243,0.00015301799,0.00006693951,0.00010937736,0.005383247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996371,0.00016896478,0.000013094488,0.000050262985,0.0000952662,0.000035286906],"domain_scores_gemma":[0.9990351,0.0007382932,0.00008006965,0.000035953115,0.00007547572,0.000035150686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011587787,0.0008117437,0.00075201225,0.00044563902,0.00026394124,0.00089777634,0.00044391613,0.0006734196,0.0013625233],"category_scores_gemma":[0.0020680043,0.0004732709,0.0004151721,0.00043888928,0.00079561776,0.00087153795,0.0008296383,0.0006912018,0.00022774843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054852007,0.000029996916,0.00020902805,0.000052468644,0.00002197677,0.000035673824,0.00003813711,0.9649717,0.0025180005,0.015033667,0.00028229028,0.016752228],"study_design_scores_gemma":[0.0000044134677,0.000006819064,0.00002234201,0.0000012589952,0.0000012822824,0.0000036979266,0.0000033194788,0.99748826,0.00023962681,0.0021598153,0.000067521294,0.0000016370732],"about_ca_topic_score_codex":0.0012441748,"about_ca_topic_score_gemma":0.0011168794,"teacher_disagreement_score":0.0013625233,"about_ca_system_score_codex":0.00076502975,"about_ca_system_score_gemma":0.0006124297,"threshold_uncertainty_score":0.0061282516},"labels":[],"label_agreement":null},{"id":"W2130121545","doi":"10.1109/tsp.2008.2010596","title":"On Spatial Aliasing in Microphone Arrays","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Aliasing; Narrowband; Wideband; Microphone array; Acoustics; Computer science; Broadband; Bandlimiting; Microphone; Direction finding; Direction of arrival; Spatial filter; Algorithm; Mathematics; Fourier transform; Filter (signal processing); Telecommunications; Optics; Physics; Antenna (radio); Mathematical analysis; Loudspeaker; Computer vision; Artificial intelligence","score_opus":0.02176814778197394,"score_gpt":0.2386615811167431,"score_spread":0.21689343333476915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130121545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035715827,0.001198591,0.99008805,0.000108744745,0.00009400471,0.000012979771,0.000013456624,0.00013975878,0.004772861],"genre_scores_gemma":[0.46463835,0.012267256,0.5058447,0.0006767981,0.0011871307,0.00016640699,0.00019255228,0.00036398487,0.0146627445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981013,0.00065842015,0.00008941308,0.00018652603,0.0008733762,0.00009113982],"domain_scores_gemma":[0.99622583,0.0026248565,0.00021653372,0.0002905192,0.000600455,0.000041871863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012404362,0.0008437636,0.00053586403,0.00066635484,0.00045655872,0.0011949679,0.0006639672,0.0014104759,0.002249284],"category_scores_gemma":[0.010220451,0.0005698492,0.000595295,0.0011971707,0.0010454446,0.0021383283,0.001089073,0.0011457731,0.0011033557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003203093,0.000051884785,0.001407041,0.0005107613,0.00012384576,0.0015509079,0.0006908181,0.4402847,0.043903288,0.20948412,0.004403569,0.2972687],"study_design_scores_gemma":[0.000013670502,0.00009027016,0.00052771723,0.00006814442,0.0000275331,0.0008127631,0.0000956492,0.92293555,0.013002679,0.05068863,0.011694344,0.00004309689],"about_ca_topic_score_codex":0.0014346296,"about_ca_topic_score_gemma":0.0012766168,"teacher_disagreement_score":0.002249284,"about_ca_system_score_codex":0.00052027596,"about_ca_system_score_gemma":0.00038938667,"threshold_uncertainty_score":0.00752455},"labels":[],"label_agreement":null},{"id":"W2130498245","doi":"10.1109/tsp.2002.808112","title":"Blind constant modulus equalization via convex optimization","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Blind equalization; Constant (computer programming); Convex optimization; Modulus; Mathematics; Computer science; Mathematical optimization; Equalization (audio); Signal processing; Regular polygon; Applied mathematics; Algorithm; Digital signal processing","score_opus":0.028904986799122838,"score_gpt":0.27704478391368553,"score_spread":0.2481397971145627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130498245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014529137,0.00005477179,0.9976375,0.00005357903,0.0000090665535,0.0000075454814,0.000006807887,0.00005379648,0.00072403473],"genre_scores_gemma":[0.24073383,0.0007844951,0.75092196,0.00018182822,0.00014437326,0.00016318247,0.00016514429,0.00016633513,0.0067388504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993705,0.00023396155,0.00002403031,0.000101774465,0.0002254916,0.00004415789],"domain_scores_gemma":[0.999295,0.00047973308,0.00005643636,0.000053214255,0.00009917215,0.00001632932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009704808,0.00095024187,0.0008506467,0.00042435882,0.0002855302,0.000923306,0.00069983624,0.00066945,0.0019061855],"category_scores_gemma":[0.002747852,0.00029808376,0.00047585883,0.00066967274,0.0011241838,0.0014895195,0.0011115278,0.001230506,0.00074158824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012363901,0.000058361617,0.00018652952,0.00015749464,0.00004618999,0.00008632225,0.000058607475,0.7566218,0.008220647,0.10360808,0.002425711,0.12840666],"study_design_scores_gemma":[0.000008949786,0.000021521904,0.000029376473,0.000004488564,0.0000037572554,0.000021486056,0.0000049439377,0.98274946,0.0020107874,0.014290684,0.00085019536,0.0000044222725],"about_ca_topic_score_codex":0.0010107443,"about_ca_topic_score_gemma":0.0008464221,"teacher_disagreement_score":0.0019061855,"about_ca_system_score_codex":0.0005258319,"about_ca_system_score_gemma":0.00088461355,"threshold_uncertainty_score":0.006376803},"labels":[],"label_agreement":null},{"id":"W2130828767","doi":"10.1109/tsp.2013.2245123","title":"Distributed Particle Filter Implementation With Intermittent/Irregular Consensus Convergence","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Particle filter; Algorithm; Fisher information; Gaussian; Convergence (economics); Computer science; Estimator; Filter (signal processing); Control theory (sociology); Sensor fusion; Mathematical optimization; Mathematics; Artificial intelligence; Statistics; Computer vision; Physics; Machine learning","score_opus":0.01833047543619573,"score_gpt":0.2532243351472778,"score_spread":0.2348938597110821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130828767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038640012,0.0000241555,0.9950079,0.000052072734,0.000020383866,0.000011818504,0.000008214757,0.00024707883,0.0007644902],"genre_scores_gemma":[0.5422503,0.00009152492,0.45485243,0.000076621734,0.00005199047,0.00018070661,0.00008535806,0.00006296808,0.0023481615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992712,0.00015666679,0.000042619096,0.0001413559,0.00033115037,0.000056957277],"domain_scores_gemma":[0.99844664,0.00061227917,0.0001261263,0.00032361638,0.0004468841,0.000044428918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012922598,0.00043111073,0.00062850694,0.00036483275,0.00042136878,0.0006881272,0.0013162342,0.000985835,0.0018451737],"category_scores_gemma":[0.0045114006,0.00027704635,0.00045323686,0.000431606,0.00054538425,0.00088972086,0.0008693803,0.0011496821,0.00052710896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008622667,0.00005529374,0.00067125895,0.000064887296,0.000034694625,0.00008777301,0.00009968662,0.87064564,0.0051992433,0.030006828,0.0013451951,0.09170334],"study_design_scores_gemma":[0.000011432934,0.000019467263,0.000053813925,0.0000019560152,0.0000025593322,0.000012925902,0.0000037944574,0.9957184,0.0011370619,0.0026145377,0.00042100373,0.0000030584958],"about_ca_topic_score_codex":0.003661885,"about_ca_topic_score_gemma":0.0033764408,"teacher_disagreement_score":0.003661885,"about_ca_system_score_codex":0.00059333537,"about_ca_system_score_gemma":0.0011814451,"threshold_uncertainty_score":0.0072811246},"labels":[],"label_agreement":null},{"id":"W2130954762","doi":"10.1109/78.823960","title":"Near-optimal range and depth estimation using a vertical array in a correlated multipath environment","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Office of Naval Research","keywords":"Estimator; Range (aeronautics); Covariance matrix; Mathematics; Multipath propagation; Multilateration; Algorithm; Covariance; Weighting; Monte Carlo method; Least-squares function approximation; Statistics; Estimation theory; Acoustics; Azimuth; Geometry","score_opus":0.0128650953385839,"score_gpt":0.21929651304533665,"score_spread":0.20643141770675275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130954762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02963792,0.00011513737,0.9694117,0.000027522507,0.000012359406,0.000008410421,0.000015621876,0.00019393027,0.00057745934],"genre_scores_gemma":[0.37684107,0.00018231194,0.621706,0.000042917814,0.000023494538,0.000037591963,0.000075588425,0.000040190298,0.0010507238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996623,0.00006809943,0.000013090709,0.00008708811,0.00012452128,0.00004494834],"domain_scores_gemma":[0.99980456,0.000060554743,0.00004367155,0.000027858516,0.000051669464,0.000011741759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002755028,0.0006115218,0.00047513863,0.00038923003,0.00023199832,0.00038201778,0.0004319948,0.00044555275,0.00044454177],"category_scores_gemma":[0.001059257,0.00034354278,0.00029414947,0.00041831346,0.00032598793,0.0007162089,0.00081680546,0.00031786953,0.00025039725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030913125,0.000056350647,0.0026535674,0.00015454242,0.00007462301,0.00022974558,0.00023359689,0.40463564,0.20644173,0.012463983,0.0007617727,0.37198538],"study_design_scores_gemma":[0.000031431548,0.00020851754,0.001355098,0.000017260067,0.000031496966,0.00037653223,0.00007425385,0.9456624,0.04543658,0.004819852,0.0019380213,0.000048549722],"about_ca_topic_score_codex":0.0010398859,"about_ca_topic_score_gemma":0.001380995,"teacher_disagreement_score":0.0010398859,"about_ca_system_score_codex":0.00020988268,"about_ca_system_score_gemma":0.00061284774,"threshold_uncertainty_score":0.0020676255},"labels":[],"label_agreement":null},{"id":"W2131023055","doi":"10.1109/tsp.2010.2046593","title":"Greedy Gossip With Eavesdropping","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gossip; Eavesdropping; Computer science; Network topology; Gossip protocol; Greedy algorithm; Wireless network; Wireless sensor network; Node (physics); Wireless; Computer network; Convergence (economics); Distributed computing; Algorithm; Telecommunications","score_opus":0.014206337176002748,"score_gpt":0.2324290776428321,"score_spread":0.21822274046682935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131023055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046871595,0.00085015554,0.94121385,0.00046348068,0.00021255652,0.00016764585,0.00018789235,0.0016028566,0.008429916],"genre_scores_gemma":[0.90011275,0.00054690137,0.09477094,0.00044495086,0.00011875255,0.00022331388,0.00022608376,0.00013339389,0.003422932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981199,0.00069611275,0.000096369426,0.00025395944,0.0005919625,0.00024168173],"domain_scores_gemma":[0.9948131,0.0032615159,0.00045184733,0.00094836263,0.00035170227,0.0001734748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018041881,0.001081639,0.0011495634,0.00068524707,0.00074680755,0.0008779554,0.0014705629,0.0008889777,0.0011628158],"category_scores_gemma":[0.006882151,0.0003851288,0.00071585906,0.00066916295,0.0011833705,0.001369373,0.0015939153,0.0008533762,0.0004572782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006189828,0.00009752999,0.0009941638,0.00028343746,0.0002028741,0.00065953936,0.00021154396,0.8540795,0.01324854,0.07565396,0.006322174,0.047627795],"study_design_scores_gemma":[0.000058308484,0.00012123638,0.00012366823,0.000012068458,0.000033742628,0.00013367148,0.000028111992,0.9699625,0.004660748,0.02185868,0.0029853417,0.000021888047],"about_ca_topic_score_codex":0.0013104659,"about_ca_topic_score_gemma":0.0016682738,"teacher_disagreement_score":0.0018041881,"about_ca_system_score_codex":0.00072929903,"about_ca_system_score_gemma":0.0009456947,"threshold_uncertainty_score":0.009541571},"labels":[],"label_agreement":null},{"id":"W2131055262","doi":"10.1109/tsp.2010.2040666","title":"On the Optimal Performance in Asymmetric Gaussian Wireless Sensor Networks With Fading","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Fading; Gaussian; Transmission (telecommunications); Computer science; Algorithm; Wireless sensor network; Topology (electrical circuits); Mathematics; Telecommunications; Computer network; Combinatorics; Decoding methods; Physics","score_opus":0.010337356407340367,"score_gpt":0.21428465468857638,"score_spread":0.203947298281236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131055262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23408729,0.0021260588,0.74772406,0.001715704,0.00010088686,0.00008654744,0.00034376312,0.00023492807,0.013580687],"genre_scores_gemma":[0.98362535,0.0009545253,0.014394599,0.000109825436,0.000065755616,0.000046976886,0.000059599486,0.000035221223,0.0007081503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965249,0.0015201948,0.0001331858,0.0004787202,0.0005807909,0.0007622363],"domain_scores_gemma":[0.9786033,0.016926387,0.0015918242,0.0009891811,0.0013746772,0.0005146659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055873706,0.0017890697,0.0016468867,0.0012081831,0.0007844529,0.0019966338,0.0014346186,0.0013283696,0.001264263],"category_scores_gemma":[0.02604694,0.00074865983,0.0004142792,0.0011338206,0.003700635,0.0035331924,0.00241485,0.0014723942,0.0002652293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036593684,0.000045746096,0.0009121571,0.0001587375,0.00005557324,0.00011696613,0.00015440752,0.9042617,0.003931409,0.07931488,0.00069850736,0.009983947],"study_design_scores_gemma":[0.000022518316,0.00009262706,0.00029124157,0.000031486292,0.000017403578,0.00004623862,0.00007633186,0.96778405,0.0015450091,0.029814959,0.00025723386,0.000020905318],"about_ca_topic_score_codex":0.0028602837,"about_ca_topic_score_gemma":0.0016019006,"teacher_disagreement_score":0.0055873706,"about_ca_system_score_codex":0.002553062,"about_ca_system_score_gemma":0.0016728418,"threshold_uncertainty_score":0.029549181},"labels":[],"label_agreement":null},{"id":"W2131258459","doi":"10.1109/tsp.2003.810285","title":"A new numerical fourier transform in d-dimensions","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Discrete Fourier transform (general); Discrete-time Fourier transform; Non-uniform discrete Fourier transform; Fractional Fourier transform; Fast Fourier transform; Fourier transform; Mathematics; Algorithm; Discrete sine transform; Pseudo-spectral method; Cyclotomic fast Fourier transform; Aliasing; Prime-factor FFT algorithm; Discrete Fourier series; Split-radix FFT algorithm; Harmonic wavelet transform; Short-time Fourier transform; Mathematical analysis; Frequency domain; Fourier inversion theorem; Fourier analysis; Computer science; Wavelet transform; Filter (signal processing); Discrete wavelet transform; Artificial intelligence","score_opus":0.030887332353838805,"score_gpt":0.2774874548557719,"score_spread":0.2466001225019331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131258459","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015833173,0.00057682267,0.9877049,0.00024542658,0.00053261867,0.000041256277,0.00006208144,0.00020407888,0.009049557],"genre_scores_gemma":[0.04133285,0.0013575362,0.94750804,0.00025404696,0.00033462894,0.00016859834,0.0001375233,0.00023732637,0.008669348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989184,0.00024370936,0.00007253381,0.00013141782,0.0005915948,0.000042366093],"domain_scores_gemma":[0.9987974,0.00040659407,0.000081486345,0.00025495767,0.00039250392,0.000066989094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012328024,0.0007337955,0.0006805777,0.0013861557,0.00060586433,0.0022121726,0.0011438357,0.0012891669,0.0070382664],"category_scores_gemma":[0.004870407,0.00035299026,0.00089710555,0.0014633092,0.0013377246,0.0026183734,0.0018163449,0.002141715,0.002963453],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070252514,0.00005037051,0.0004515315,0.00035426157,0.0000372743,0.00025137453,0.0002340469,0.052530773,0.018982206,0.77175045,0.0072045606,0.14808294],"study_design_scores_gemma":[0.000034895522,0.00008265108,0.00027092235,0.00013510708,0.000024439814,0.0007525678,0.00007599926,0.7160528,0.009172106,0.15068115,0.12265281,0.00006467695],"about_ca_topic_score_codex":0.00087250676,"about_ca_topic_score_gemma":0.00066399877,"teacher_disagreement_score":0.0070382664,"about_ca_system_score_codex":0.0006580753,"about_ca_system_score_gemma":0.0011084087,"threshold_uncertainty_score":0.023545325},"labels":[],"label_agreement":null},{"id":"W2131289733","doi":"10.1109/tsp.2007.895992","title":"Biwindowed Discrete Multitone Transceiver Design","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Cyclic prefix; Intersymbol interference; Computer science; Transceiver; Transmitter; Digital subscriber line; Electronic engineering; Spectral efficiency; Narrowband; Adjacent-channel interference; Bit error rate; Orthogonal frequency-division multiplexing; Channel (broadcasting); Interference (communication); Telecommunications; Engineering; Wireless","score_opus":0.026133042388194003,"score_gpt":0.26254006929986556,"score_spread":0.23640702691167156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131289733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021540757,0.000919003,0.9714271,0.00015119284,0.00015543519,0.00010676284,0.00008418592,0.0002888651,0.0053267484],"genre_scores_gemma":[0.48499846,0.0019630059,0.4963749,0.00041395842,0.00023228649,0.00038771261,0.00039218034,0.000047594935,0.015189884],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999729,0.000050565704,0.000023792789,0.000064936685,0.000099823876,0.00003181836],"domain_scores_gemma":[0.99980766,0.000025746303,0.00003074513,0.000026276923,0.0000918734,0.000017652885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028173038,0.0004420807,0.00031988235,0.0003177153,0.0002316968,0.00062417187,0.0006452789,0.0005827892,0.002336772],"category_scores_gemma":[0.0003910323,0.0001895997,0.00021696897,0.00035274986,0.00017045993,0.00058385305,0.00042448784,0.00048951403,0.0010740628],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005452788,0.00012778558,0.0017089184,0.00058677944,0.00012017563,0.00056221476,0.000177325,0.0740559,0.4157686,0.053925976,0.004823141,0.44759792],"study_design_scores_gemma":[0.00012862746,0.001685601,0.0014625487,0.00009770234,0.00012468072,0.0032828904,0.00007794251,0.7287629,0.1805914,0.010548308,0.073137335,0.000100008125],"about_ca_topic_score_codex":0.00022611572,"about_ca_topic_score_gemma":0.00028685873,"teacher_disagreement_score":0.002336772,"about_ca_system_score_codex":0.00027407578,"about_ca_system_score_gemma":0.00033329148,"threshold_uncertainty_score":0.007817268},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016831842213606132,"score_gpt":0.2588942133858568,"score_spread":0.24206237117225066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131900983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027610597,0.0004527988,0.9930876,0.00009431459,0.000029466511,0.00001985667,0.000021610693,0.00007062706,0.003462596],"genre_scores_gemma":[0.67472714,0.0019554014,0.31557152,0.00016227698,0.00017667255,0.0002896917,0.00010524919,0.00006955293,0.0069425064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937016,0.00022223008,0.000022378526,0.00009435109,0.00021280747,0.00007813399],"domain_scores_gemma":[0.9996687,0.00018810901,0.000030706666,0.000022692258,0.0000730368,0.00001667424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009433145,0.0009467288,0.0008152335,0.00041527915,0.00037781455,0.0012449909,0.0008769939,0.0008558134,0.0020165625],"category_scores_gemma":[0.0014401034,0.00036474701,0.00046647465,0.0005367522,0.0008088239,0.0009148154,0.00096928596,0.0008554962,0.00038711965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036871057,0.000029429408,0.00011004851,0.000079770165,0.000018719193,0.000079802056,0.000059802845,0.8712981,0.0025003105,0.09273362,0.0011928002,0.031860705],"study_design_scores_gemma":[0.0000067751635,0.000022960972,0.000032545668,0.000006098645,0.000004973725,0.000023903018,0.000013756149,0.9792494,0.00028315283,0.019497694,0.0008526161,0.0000060468233],"about_ca_topic_score_codex":0.0040566646,"about_ca_topic_score_gemma":0.0033348002,"teacher_disagreement_score":0.0040566646,"about_ca_system_score_codex":0.00087700394,"about_ca_system_score_gemma":0.0015386532,"threshold_uncertainty_score":0.008066118},"labels":[],"label_agreement":null},{"id":"W2132483362","doi":"10.1109/tsp.2007.895998","title":"Underdetermined Anechoic Blind Source Separation via $\\ell^{q}$-Basis-Pursuit With $q≪1$","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia Hospital; University of British Columbia","funders":"","keywords":"Blind signal separation; Anechoic chamber; Underdetermined system; Source separation; Computer science; Basis (linear algebra); Algorithm; Matching pursuit; Speech recognition; Signal processing; Basis pursuit; Artificial intelligence; Mathematics; Compressed sensing; Telecommunications","score_opus":0.0227640615523525,"score_gpt":0.2938148370445632,"score_spread":0.2710507754922107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132483362","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00597189,0.00015226706,0.99302787,0.000075184755,0.000010889059,0.000011277955,0.000017308334,0.00012269168,0.0006106258],"genre_scores_gemma":[0.11376406,0.00042836348,0.8835833,0.000114942195,0.00006128415,0.000074395786,0.00015952757,0.000057816964,0.0017563251],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989189,0.0004298134,0.000047806392,0.00020835739,0.00033229182,0.00006302535],"domain_scores_gemma":[0.9991001,0.0005052912,0.00009981598,0.00012510862,0.00013289171,0.000036852125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012753395,0.0009923549,0.000882386,0.00062635593,0.00036571376,0.0006591584,0.000636867,0.0010055524,0.00089182117],"category_scores_gemma":[0.0031375072,0.0004161524,0.00057690445,0.00085029873,0.00091277546,0.0016397467,0.0019072046,0.0011374658,0.0007471713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005625089,0.00016363464,0.0007910942,0.00027684477,0.0001632322,0.00022241008,0.00026538494,0.35354823,0.07378608,0.09152298,0.0028317396,0.47586584],"study_design_scores_gemma":[0.000024592202,0.00006524154,0.00019007252,0.000010707318,0.000012156469,0.0001144862,0.00001912948,0.97110116,0.00924153,0.017266093,0.0019327656,0.000022106791],"about_ca_topic_score_codex":0.0014599764,"about_ca_topic_score_gemma":0.0012331728,"teacher_disagreement_score":0.0014599764,"about_ca_system_score_codex":0.0003274388,"about_ca_system_score_gemma":0.0010548156,"threshold_uncertainty_score":0.0067447424},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.014318780042420527,"score_gpt":0.2372784112188631,"score_spread":0.22295963117644257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132506160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049704905,0.001777581,0.9878179,0.00041310352,0.00012552843,0.000029045083,0.000011437393,0.00014697666,0.004707972],"genre_scores_gemma":[0.2541766,0.0040339967,0.7358066,0.00093110144,0.0008814373,0.000120893805,0.000061079314,0.00006098194,0.0039273864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986357,0.0003662638,0.000054440046,0.00015727186,0.00069734117,0.00008893389],"domain_scores_gemma":[0.9984687,0.0007823601,0.00016425345,0.00021728278,0.00030520838,0.00006219535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012644827,0.00084682344,0.0006247153,0.0004555221,0.00033157627,0.0013216126,0.00092782953,0.0012686223,0.0023384474],"category_scores_gemma":[0.002715342,0.0005126357,0.00036818156,0.0006770649,0.00064281415,0.0027475096,0.0014118698,0.0012691335,0.0014507103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047846662,0.00021246777,0.0015092064,0.0007211816,0.00015276356,0.00032211232,0.0002206237,0.085274905,0.22896254,0.19866869,0.003551775,0.47992522],"study_design_scores_gemma":[0.00020618738,0.0015883402,0.0012008795,0.00012561001,0.00015733538,0.0031288087,0.00011673155,0.76618415,0.12392716,0.06317258,0.04003079,0.00016147945],"about_ca_topic_score_codex":0.00007733806,"about_ca_topic_score_gemma":0.00017268598,"teacher_disagreement_score":0.0023384474,"about_ca_system_score_codex":0.00028587724,"about_ca_system_score_gemma":0.00031377646,"threshold_uncertainty_score":0.007822871},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020924563056966747,"score_gpt":0.21590680364175646,"score_spread":0.19498224058478972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132679193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004509229,0.00026048694,0.9944313,0.00003625469,0.000014973455,0.000009646058,0.0000133813855,0.0001125046,0.000612163],"genre_scores_gemma":[0.18796599,0.0010522656,0.8082647,0.00021584741,0.00017517435,0.00010084449,0.00012478285,0.00008806355,0.0020123622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952126,0.00015470406,0.000017385246,0.000087314234,0.00019119149,0.00002808464],"domain_scores_gemma":[0.9991339,0.00053000625,0.000108129505,0.00009689958,0.00010902696,0.000022123486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005986537,0.0010417987,0.0006124387,0.0005357305,0.00028677343,0.0004627906,0.00055489864,0.0005703943,0.0014145257],"category_scores_gemma":[0.001949148,0.00039953916,0.00052885205,0.0006989031,0.00044666397,0.0009148673,0.00085528474,0.0006035785,0.00075344363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040453023,0.00009882715,0.0011087533,0.0002966899,0.00017150547,0.00025992974,0.00027823605,0.22012296,0.10423311,0.018692045,0.0017819612,0.6525514],"study_design_scores_gemma":[0.00003470151,0.00030477118,0.0009098856,0.000033623146,0.000069446156,0.0005486282,0.000053634565,0.94420034,0.04308659,0.0064252866,0.0042846478,0.00004849112],"about_ca_topic_score_codex":0.00037157492,"about_ca_topic_score_gemma":0.0006869422,"teacher_disagreement_score":0.0014145257,"about_ca_system_score_codex":0.00020424675,"about_ca_system_score_gemma":0.00025608772,"threshold_uncertainty_score":0.0047320724},"labels":[],"label_agreement":null},{"id":"W2132879698","doi":"10.1109/tsp.2007.893745","title":"Authors' reply to \"Comments on ‘Detection of Distributed Sources Using Sensor Arrays’\"","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; SIGNAL (programming language); Detection theory; Process (computing); Signal processing; Wireless sensor network; Algorithm; Telecommunications; Computer network; Programming language","score_opus":0.029302785469734798,"score_gpt":0.280626511198082,"score_spread":0.2513237257283472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132879698","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024360971,0.0014948109,0.00050350063,0.7999377,0.19606166,0.000027358905,0.00030268118,0.00014981831,0.0012788551],"genre_scores_gemma":[0.0029526819,0.001633636,0.0006030635,0.90497893,0.07885584,0.00007205025,0.00016272506,0.00014413275,0.010596875],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9908415,0.0017676657,0.001395368,0.0010121522,0.0041522365,0.0008311465],"domain_scores_gemma":[0.9464809,0.016565979,0.0038145082,0.0011191199,0.029154055,0.002865369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007164725,0.0014869261,0.0017196735,0.0016180412,0.0035470275,0.0039221733,0.0029985355,0.023484955,0.016123217],"category_scores_gemma":[0.08195929,0.001122292,0.0021370894,0.0012821907,0.002948388,0.0031967482,0.0026130925,0.030795854,0.018128471],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003390452,0.000005639329,0.00010516546,0.00005724343,0.000010552124,0.00013225681,0.00009485226,0.00002843235,0.000109229695,0.00029856423,0.9969428,0.0021813796],"study_design_scores_gemma":[0.00003389148,0.0000373407,0.0009155219,0.00022695964,0.000035343986,0.0005590314,0.00044489224,0.00015269221,0.000809734,0.001223025,0.9954796,0.00008193925],"about_ca_topic_score_codex":0.007033812,"about_ca_topic_score_gemma":0.0065211584,"teacher_disagreement_score":0.023484955,"about_ca_system_score_codex":0.004113356,"about_ca_system_score_gemma":0.004188757,"threshold_uncertainty_score":0.053937495},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01809671378007323,"score_gpt":0.2693185609411627,"score_spread":0.2512218471610895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133575969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018509375,0.00013436825,0.98086995,0.000038153,0.000013559393,0.00000762369,0.000012996984,0.00010188835,0.00031207074],"genre_scores_gemma":[0.4480132,0.00052493665,0.5495533,0.00004260255,0.00007288983,0.000072746356,0.00010352682,0.000058416896,0.0015584303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995608,0.00016303215,0.000015141881,0.00006111491,0.00016557159,0.000034302306],"domain_scores_gemma":[0.99943405,0.00034318192,0.00005945992,0.000074775,0.00007240037,0.000016082411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000721228,0.0003443438,0.000459263,0.0002707395,0.00021982403,0.0003804856,0.00025200238,0.00046041582,0.00024477433],"category_scores_gemma":[0.0038141678,0.0003174861,0.00016408623,0.00037079147,0.0005296276,0.00066629454,0.00044616457,0.00047690075,0.00021215017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027293156,0.00008116229,0.0026277767,0.00009631938,0.00004238411,0.00013976057,0.000098790275,0.52743256,0.041160125,0.030323166,0.0009136908,0.39681137],"study_design_scores_gemma":[0.000011546336,0.000044468055,0.00074722635,0.0000068966965,0.000009477579,0.000096272925,0.000007660626,0.98066026,0.01287501,0.0046925363,0.0008342728,0.000014431116],"about_ca_topic_score_codex":0.0009485616,"about_ca_topic_score_gemma":0.0015059549,"teacher_disagreement_score":0.0009485616,"about_ca_system_score_codex":0.00020172761,"about_ca_system_score_gemma":0.0006805057,"threshold_uncertainty_score":0.00381428},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014658549931798603,"score_gpt":0.24497812202325914,"score_spread":0.23031957209146053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133598069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20303456,0.0037687952,0.76504636,0.00087804574,0.00048084318,0.00025769044,0.0011689198,0.0014686296,0.023896128],"genre_scores_gemma":[0.7019479,0.0026867855,0.27924365,0.00025985588,0.00018873355,0.00014722151,0.0013463048,0.00013971046,0.014039904],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971753,0.00003119886,0.000018473169,0.000026316482,0.00017602736,0.000030445723],"domain_scores_gemma":[0.99949193,0.00014942217,0.000052437463,0.0001598198,0.00013019628,0.000016161483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002054227,0.0003030208,0.00034569472,0.00035708942,0.00016841959,0.00041041736,0.00026704554,0.00029782212,0.0028036109],"category_scores_gemma":[0.0013256308,0.00011826727,0.00024909092,0.00047129046,0.0002701596,0.0007436448,0.00039489957,0.00032504855,0.0007268812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071398856,0.000064333995,0.0006965128,0.00065242086,0.00007573128,0.0008313263,0.00021944124,0.018184224,0.48784012,0.050426822,0.0075485297,0.43274668],"study_design_scores_gemma":[0.000072633105,0.0005545837,0.0030290606,0.00009707832,0.00005019263,0.0037933195,0.0001612961,0.24266644,0.6715121,0.02191349,0.05610704,0.000042748103],"about_ca_topic_score_codex":0.0003179753,"about_ca_topic_score_gemma":0.0005239225,"teacher_disagreement_score":0.0028036109,"about_ca_system_score_codex":0.00016151408,"about_ca_system_score_gemma":0.00022059395,"threshold_uncertainty_score":0.009379029},"labels":[],"label_agreement":null},{"id":"W2134208016","doi":"10.1109/78.845921","title":"Adaptive linear filtering using interior point optimization techniques","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Adaptive filter; Robustness (evolution); Algorithm; Mathematics; Filter (signal processing); Interior point method; Recursive least squares filter; Linear filter; Computational complexity theory; Optimization problem; Kernel adaptive filter; Signal processing; Mathematical optimization; Filter design; Computer science; Digital signal processing","score_opus":0.024574607613412913,"score_gpt":0.2604320694041506,"score_spread":0.2358574617907377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134208016","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023670246,0.00003415725,0.9994172,0.000017693106,0.000008182118,0.000004257435,0.000001957846,0.000047996837,0.00023191755],"genre_scores_gemma":[0.047555525,0.00034016345,0.9494427,0.00008049657,0.00008673063,0.0001978608,0.000053621457,0.000092135604,0.0021507768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986732,0.0005225633,0.00006637805,0.00018809525,0.00047366848,0.000076075885],"domain_scores_gemma":[0.99841857,0.00096467935,0.00015321796,0.00013502095,0.00028650608,0.000042026706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017971824,0.0011111727,0.0018290961,0.00072138885,0.00039355908,0.0011995997,0.0017349463,0.0018525515,0.0027097396],"category_scores_gemma":[0.0039696633,0.0007518611,0.0012346309,0.00093049736,0.0014715525,0.0018102273,0.0014665527,0.002837458,0.00137458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119685676,0.00009822455,0.0004010006,0.00025223324,0.000107135456,0.00012618682,0.00020170135,0.70373416,0.01440463,0.09907196,0.0025052289,0.17897786],"study_design_scores_gemma":[0.000013181181,0.00003897935,0.000025974192,0.000011090207,0.0000069848006,0.000029285842,0.0000051593493,0.98699397,0.0018785556,0.00883909,0.0021490157,0.0000086836935],"about_ca_topic_score_codex":0.0008876574,"about_ca_topic_score_gemma":0.0006102476,"teacher_disagreement_score":0.0027097396,"about_ca_system_score_codex":0.00049534516,"about_ca_system_score_gemma":0.0008340557,"threshold_uncertainty_score":0.009504557},"labels":[],"label_agreement":null},{"id":"W2134624761","doi":"10.1109/tsp.2007.907891","title":"Progressive Coding of a Gaussian Source Using Matching Pursuit","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Matching pursuit; Encoder; Bitstream; Computer science; Gaussian; Residual; Quantization (signal processing); Probabilistic logic; Algorithm; Rate–distortion theory; Coding (social sciences); Vector quantization; Decoding methods; Speech recognition; Pattern recognition (psychology); Artificial intelligence; Data compression; Mathematics; Compressed sensing; Statistics","score_opus":0.04130498768908788,"score_gpt":0.29141509919262837,"score_spread":0.2501101115035405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134624761","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01720811,0.0002259913,0.98136157,0.0000620899,0.000017793041,0.000023299775,0.000017800814,0.00008884651,0.0009945584],"genre_scores_gemma":[0.5407902,0.0009808894,0.45352346,0.0001384952,0.00006115858,0.000091832924,0.00012072511,0.000040578503,0.004252654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996799,0.00006348554,0.00001465853,0.000048834885,0.00017022227,0.000022949935],"domain_scores_gemma":[0.99949205,0.00027377758,0.00006083462,0.00006811348,0.00008907689,0.000016082518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006020043,0.00048116723,0.00039278134,0.0004630646,0.00018132282,0.00036615384,0.0006916156,0.00050214736,0.0007215164],"category_scores_gemma":[0.002173098,0.00016375034,0.00033817248,0.0007278725,0.0005862538,0.0009544902,0.0008647994,0.0005462213,0.00024549162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003806345,0.00007786956,0.00056857994,0.00023737397,0.00006130605,0.00035050666,0.00023954209,0.39562845,0.09924101,0.16705859,0.0010190229,0.3351371],"study_design_scores_gemma":[0.000020532749,0.00012615278,0.0001513227,0.000020076379,0.000012991466,0.0001614573,0.000016309687,0.95937216,0.019472264,0.01885858,0.0017711709,0.000017104374],"about_ca_topic_score_codex":0.0010692052,"about_ca_topic_score_gemma":0.0009367143,"teacher_disagreement_score":0.0010692052,"about_ca_system_score_codex":0.0003252212,"about_ca_system_score_gemma":0.00044999592,"threshold_uncertainty_score":0.003183782},"labels":[],"label_agreement":null},{"id":"W2134835659","doi":"10.1109/tsp.2005.853220","title":"Assessing the relevance of fMRI-based prior in the EEG inverse problem: a bayesian model comparison approach","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université de Montréal; McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Prior probability; Functional magnetic resonance imaging; Bayesian probability; Inverse problem; Computer science; Neuroimaging; Electroencephalography; Bayes' theorem; Relevance (law); Artificial intelligence; Inference; Bayesian inference; Magnetoencephalography; Machine learning; Bayes factor; Pattern recognition (psychology); Statistical inference; Brain activity and meditation; Psychology; Mathematics; Statistics; Neuroscience","score_opus":0.046069805557494944,"score_gpt":0.31734889615796796,"score_spread":0.271279090600473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134835659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01605062,0.00022535103,0.9821238,0.00045925862,0.000014380857,0.000052318417,0.000041078747,0.000083642546,0.0009494698],"genre_scores_gemma":[0.59042674,0.00061231834,0.4065104,0.0003833395,0.00014901036,0.00042648657,0.00023648223,0.00012046701,0.0011346991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9914158,0.0068219337,0.00018910323,0.0005248676,0.000887227,0.00016104669],"domain_scores_gemma":[0.9649799,0.031369414,0.0011189237,0.0011709654,0.0010988327,0.0002619602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019726658,0.0013812121,0.0015294775,0.0021161344,0.0007195875,0.0017555627,0.0020214482,0.002962078,0.0018909404],"category_scores_gemma":[0.062414065,0.00071241177,0.0012775924,0.0008153819,0.0021640223,0.002893857,0.0020764326,0.0019788907,0.00030105462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036680294,0.00012145795,0.001609696,0.00024033338,0.00026583564,0.00014753189,0.00018496563,0.7890085,0.003441053,0.14630184,0.00075140764,0.057560638],"study_design_scores_gemma":[0.000066284425,0.000093724266,0.00053220184,0.00003210307,0.00005086252,0.00007025148,0.00001864615,0.9084901,0.0010139723,0.08912746,0.00046701974,0.00003735974],"about_ca_topic_score_codex":0.0018589541,"about_ca_topic_score_gemma":0.0016035571,"teacher_disagreement_score":0.019726658,"about_ca_system_score_codex":0.0012816564,"about_ca_system_score_gemma":0.0018146867,"threshold_uncertainty_score":0.10432583},"labels":[],"label_agreement":null},{"id":"W2135012036","doi":"10.1109/tsp.2003.818199","title":"Stratified diagonal layered space-time architectures: signal processing and information theoretic aspects","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Telecommunications link; Diagonal; Multipath propagation; Channel (broadcasting); Transmitter; Fading; Communications system; Electronic engineering; Telecommunications; Mathematics; Engineering","score_opus":0.008756265746242364,"score_gpt":0.22750362540678676,"score_spread":0.2187473596605444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135012036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20437935,0.0003220253,0.78639466,0.00023223364,0.000023117154,0.000040524115,0.00011137486,0.0002701426,0.0082265735],"genre_scores_gemma":[0.8960268,0.00025319826,0.10172333,0.00006473718,0.00001920527,0.00004052103,0.000084192296,0.00001464317,0.0017732995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962795,0.00012664264,0.000017934168,0.000030147005,0.000112898655,0.000084498584],"domain_scores_gemma":[0.99895346,0.00037594116,0.00015917546,0.00019827906,0.00026420134,0.000048793256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036367797,0.00042981096,0.00029289746,0.00027385636,0.0002969302,0.0009369789,0.0005196319,0.00050847605,0.0010857969],"category_scores_gemma":[0.0019029467,0.0001784475,0.00020247568,0.00066683703,0.00067550864,0.0009936988,0.0004526182,0.00041721217,0.0003950911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028045944,0.0000759627,0.002763837,0.00007940441,0.00005121813,0.0003421495,0.0001950596,0.74316704,0.039187655,0.1566617,0.0010549052,0.056140505],"study_design_scores_gemma":[0.000009676783,0.000091197464,0.0004488969,0.0000058588357,0.000012727658,0.00017041781,0.000056636378,0.95863515,0.007815743,0.031801466,0.0009384952,0.000013783446],"about_ca_topic_score_codex":0.0022847522,"about_ca_topic_score_gemma":0.0027934785,"teacher_disagreement_score":0.0022847522,"about_ca_system_score_codex":0.00070091884,"about_ca_system_score_gemma":0.00057260063,"threshold_uncertainty_score":0.0050855875},"labels":[],"label_agreement":null},{"id":"W2135260820","doi":"10.1109/tsp.2010.2049108","title":"How Much Multiuser Diversity is Required for Energy Limited Multiuser Systems?","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scheduling (production processes); Computer science; Telecommunications link; Fading; Diversity gain; Bit error rate; Channel state information; Wireless; Mathematical optimization; Real-time computing; Distributed computing; Channel (broadcasting); Computer network; Telecommunications; Mathematics","score_opus":0.01830725162337541,"score_gpt":0.21961073812993348,"score_spread":0.20130348650655808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135260820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114213124,0.00398673,0.85272086,0.004621154,0.00041745475,0.00003848751,0.00026312453,0.0005342891,0.023204865],"genre_scores_gemma":[0.9684351,0.0016203044,0.027394475,0.0005962182,0.00014638934,0.000040108956,0.00006265723,0.000077894634,0.0016268361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946815,0.00011651914,0.000019647272,0.00008558952,0.00019939106,0.00011061392],"domain_scores_gemma":[0.9979588,0.001134858,0.00024499503,0.00036339308,0.00017667701,0.00012140239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005303662,0.00040366236,0.0011182241,0.000247231,0.00051434146,0.0013269521,0.0007584394,0.0011589101,0.0030081074],"category_scores_gemma":[0.005610276,0.00040126676,0.00038551763,0.0005960024,0.0010903213,0.00292942,0.0007870563,0.0009566976,0.0007852468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003204884,0.000179146,0.0033803273,0.0007628776,0.00015206041,0.00056917226,0.00023043794,0.45783532,0.07332966,0.3457531,0.0047079623,0.11277955],"study_design_scores_gemma":[0.000039834526,0.00027222867,0.002838654,0.0000964626,0.00004291043,0.0012755756,0.00025410947,0.74631655,0.016096983,0.22653303,0.0061705485,0.000063045205],"about_ca_topic_score_codex":0.00076344074,"about_ca_topic_score_gemma":0.0007902989,"teacher_disagreement_score":0.0030081074,"about_ca_system_score_codex":0.00059869786,"about_ca_system_score_gemma":0.0005904861,"threshold_uncertainty_score":0.010063112},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026438428655646364,"score_gpt":0.2727327219690952,"score_spread":0.24629429331344885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135288797","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013763349,0.00015360348,0.9827072,0.000049620397,0.00001278807,0.000024873063,0.000052773867,0.000119947406,0.0031158254],"genre_scores_gemma":[0.47035596,0.0006452177,0.5212171,0.00010028428,0.000058223864,0.00019021312,0.00022970312,0.00008262836,0.007120745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998011,0.000046175002,0.000008675719,0.000022749178,0.000099742,0.000021571646],"domain_scores_gemma":[0.9995875,0.00024654946,0.000043224733,0.000037032132,0.00007384157,0.000011815688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033878995,0.0004418007,0.00032060288,0.00015031078,0.00015864302,0.00043840904,0.00030287955,0.00043762862,0.00273095],"category_scores_gemma":[0.001570073,0.00021338402,0.0001330404,0.00021289548,0.0002888104,0.00039667275,0.0002945662,0.00033754023,0.00100781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021222439,0.00005932019,0.0007447238,0.00021819944,0.000034712477,0.0001114596,0.00010681199,0.68247384,0.06848713,0.089436896,0.0031319447,0.15498278],"study_design_scores_gemma":[0.000024890061,0.0000690083,0.00028237494,0.000023984549,0.000009483571,0.00005923169,0.000008527782,0.97186273,0.014122067,0.0112286145,0.002298027,0.0000111763175],"about_ca_topic_score_codex":0.0007093134,"about_ca_topic_score_gemma":0.0016602396,"teacher_disagreement_score":0.00273095,"about_ca_system_score_codex":0.0003569625,"about_ca_system_score_gemma":0.00070356426,"threshold_uncertainty_score":0.009135902},"labels":[],"label_agreement":null},{"id":"W2135474067","doi":"10.1109/tsp.2010.2048320","title":"Cooperative Resource Allocation Games Under Spectral Mask and Total Power Constraints","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Resource allocation; Bargaining problem; Mathematical optimization; Computer science; Nash equilibrium; Game theory; Resource management (computing); Bandwidth (computing); Multiplexing; Spectral efficiency; Computational complexity theory; Distributed computing; Mathematics; Algorithm; Computer network; Mathematical economics; Telecommunications","score_opus":0.010609112003605328,"score_gpt":0.23313373091236525,"score_spread":0.2225246189087599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135474067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04533779,0.0002050567,0.94649273,0.0002870463,0.00003634155,0.00012369938,0.0000489224,0.000047708287,0.007420555],"genre_scores_gemma":[0.929351,0.00030780348,0.06528307,0.00011588062,0.00004039968,0.000437176,0.000044474797,0.000026078445,0.004394045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731964,0.0015618565,0.00008437182,0.0002593999,0.00041084675,0.00036378668],"domain_scores_gemma":[0.9961863,0.0030129948,0.00028924627,0.00010434466,0.00023251587,0.0001745289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026761044,0.0016458381,0.0017369534,0.00063740683,0.000763337,0.0016975688,0.0015534873,0.0019053303,0.0015446933],"category_scores_gemma":[0.0058215735,0.00062404014,0.0006678438,0.0009378766,0.0021249824,0.0021791758,0.0019148854,0.0012923244,0.00021947491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013344653,0.000051648996,0.00025214464,0.00007957597,0.000042297117,0.00023425155,0.00016370104,0.8888627,0.001614216,0.100506686,0.00049472234,0.0075646285],"study_design_scores_gemma":[0.000026211661,0.000038341343,0.000054203523,0.000005223478,0.000008698639,0.00003108698,0.00003711336,0.97205365,0.00026997595,0.027178956,0.0002887902,0.000007757248],"about_ca_topic_score_codex":0.0029826276,"about_ca_topic_score_gemma":0.0022190847,"teacher_disagreement_score":0.0029826276,"about_ca_system_score_codex":0.0017446954,"about_ca_system_score_gemma":0.0015312692,"threshold_uncertainty_score":0.014152765},"labels":[],"label_agreement":null},{"id":"W2136153546","doi":"10.1109/tsp.2010.2053030","title":"On the Distortion Exponents of Layered Broadcast Transmission in Multi-Relay Cooperative Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Multiplexing; Computer science; Topology (electrical circuits); Distortion (music); Exponent; Relay channel; Transmission (telecommunications); Gaussian; Telecommunications; Bandwidth (computing); Mathematics; Computer network; Power (physics); Physics","score_opus":0.04367551960342274,"score_gpt":0.2857290448395449,"score_spread":0.24205352523612217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136153546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16604379,0.0051028,0.8133725,0.00073632435,0.00015120985,0.000071507784,0.00014222325,0.00012801855,0.014251596],"genre_scores_gemma":[0.96494883,0.0034572918,0.028327374,0.00010267113,0.00015603637,0.00005663613,0.00008036838,0.00008662977,0.0027841546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990895,0.00033368624,0.000046446017,0.00008400596,0.00033267264,0.00011367642],"domain_scores_gemma":[0.9898637,0.00759148,0.0008388498,0.00049705134,0.0010009469,0.00020785513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021796643,0.0011817951,0.0007172064,0.00074791536,0.00037053545,0.0011128278,0.0007562649,0.0006479291,0.0013542547],"category_scores_gemma":[0.013566674,0.00040122622,0.00045936593,0.00054149964,0.0014953833,0.0028253521,0.0012039783,0.001411111,0.0003308188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040558074,0.00006733142,0.0020198252,0.0003171883,0.00007556282,0.0009721422,0.0006115772,0.68864155,0.024771795,0.25523308,0.0013654704,0.025518876],"study_design_scores_gemma":[0.000016833223,0.000115128154,0.0007111229,0.000041020387,0.000028046345,0.0004497951,0.000116510455,0.9496984,0.0060146716,0.04163345,0.0011274241,0.000047640602],"about_ca_topic_score_codex":0.0008661588,"about_ca_topic_score_gemma":0.00040993895,"teacher_disagreement_score":0.0021796643,"about_ca_system_score_codex":0.0014360236,"about_ca_system_score_gemma":0.0004610678,"threshold_uncertainty_score":0.0115273},"labels":[],"label_agreement":null},{"id":"W2136245129","doi":"10.1109/tsp.2003.811242","title":"Identification of periodic signals with uncertain frequency","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Iterative Learning Control Systems","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Control theory (sociology); Ellipse; Controller (irrigation); SIGNAL (programming language); Estimator; Mathematics; Periodic function; Computer science; Internal model; Automatic frequency control; Algorithm; Artificial intelligence; Statistics; Control (management); Mathematical analysis","score_opus":0.011819594480646865,"score_gpt":0.23125980286800124,"score_spread":0.21944020838735437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136245129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0105051445,0.00006019838,0.9888889,0.000018673842,0.000015507152,0.000010236588,0.000007636771,0.00011982272,0.0003738553],"genre_scores_gemma":[0.34117568,0.00022773296,0.65610003,0.0000452288,0.0000644009,0.00007109214,0.000114786424,0.000079942634,0.002121115],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995043,0.000052219235,0.000029961482,0.00010942954,0.00027069298,0.00003341065],"domain_scores_gemma":[0.9989895,0.00043813302,0.00018863815,0.00013814191,0.00022358584,0.000022025142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057856855,0.000448165,0.00062632636,0.00076380384,0.00033542752,0.0004891768,0.0006914275,0.0006247334,0.0007749231],"category_scores_gemma":[0.0027966523,0.00030989057,0.00035700417,0.00042166837,0.00041496634,0.0007464891,0.00052750256,0.00061368564,0.00034289685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023064771,0.000045469278,0.002405241,0.00016887135,0.00006091074,0.00042797165,0.0002822156,0.22516248,0.04902664,0.019020423,0.0011191416,0.70205],"study_design_scores_gemma":[0.0000118466405,0.000070482456,0.0010901239,0.000017941386,0.000012976763,0.00031741543,0.000032837706,0.9772186,0.012186253,0.005883545,0.003137774,0.00002020304],"about_ca_topic_score_codex":0.0006728737,"about_ca_topic_score_gemma":0.0006878374,"teacher_disagreement_score":0.0007749231,"about_ca_system_score_codex":0.00020936501,"about_ca_system_score_gemma":0.0003427488,"threshold_uncertainty_score":0.0030598044},"labels":[],"label_agreement":null},{"id":"W2136762313","doi":"10.1109/tsp.2007.897859","title":"MIMO Transmission Control in Fading Channels—A Constrained Markov Decision Process Formulation With Monotone Randomized Policies","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":111,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Markov decision process; Mathematical optimization; MIMO; Fading; Markov process; Power control; Computer science; Control theory (sociology); Optimal control; Channel (broadcasting); Mathematics; Power (physics); Computer network; Statistics","score_opus":0.006940660203204731,"score_gpt":0.24240335916740624,"score_spread":0.23546269896420152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136762313","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020317057,0.0004568763,0.97305775,0.0008165458,0.00006489272,0.000058909045,0.00011539971,0.00011249418,0.0049999943],"genre_scores_gemma":[0.91331935,0.00081672065,0.078428835,0.0003052983,0.00015094593,0.00031900156,0.000113762435,0.00006856106,0.0064775706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879384,0.00055112276,0.000038550428,0.00019876914,0.00021004297,0.0002075868],"domain_scores_gemma":[0.99724907,0.0020681378,0.00030700673,0.00007247885,0.00019537515,0.000108052096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019589365,0.0009943462,0.0014636688,0.0004170386,0.00036152315,0.0011640576,0.0009910124,0.0013149562,0.0025136457],"category_scores_gemma":[0.004105433,0.0006216919,0.0006775183,0.0005587469,0.0014509195,0.0011967557,0.0009566926,0.001542048,0.00025295297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031606338,0.000024496401,0.0001152079,0.000037428257,0.000016300033,0.000052655152,0.00002477689,0.95500344,0.00054930395,0.040564556,0.00031960168,0.0032605308],"study_design_scores_gemma":[0.000013357682,0.000013508631,0.00002553528,0.0000034812285,0.0000032912492,0.000005505994,0.0000033163005,0.99214363,0.000093046845,0.007538952,0.00015284288,0.0000034429224],"about_ca_topic_score_codex":0.006222548,"about_ca_topic_score_gemma":0.004124989,"teacher_disagreement_score":0.006222548,"about_ca_system_score_codex":0.00168908,"about_ca_system_score_gemma":0.0020297775,"threshold_uncertainty_score":0.012372673},"labels":[],"label_agreement":null},{"id":"W2137554319","doi":"10.1109/tsp.2011.2150221","title":"Power Allocation Based on SEP Minimization in Two-Hop Decode-and-Forward Relay Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Rayleigh fading; Computer science; Hop (telecommunications); Mathematical optimization; Channel state information; Closed-form expression; Node (physics); Minification; Optimization problem; Power (physics); Expression (computer science); Relay channel; Convex optimization; Transmission (telecommunications); Decoding methods; Fading; Mathematics; Algorithm; Wireless; Telecommunications; Regular polygon","score_opus":0.034787257424259935,"score_gpt":0.27618729930552477,"score_spread":0.24140004188126485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137554319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024465952,0.00036503005,0.97247046,0.00016168355,0.000017157134,0.000028625085,0.000025707834,0.00008619233,0.0023791944],"genre_scores_gemma":[0.88864547,0.00073543,0.107010044,0.00007155681,0.000040197767,0.00014864307,0.000043349195,0.00005142604,0.0032540374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993667,0.00035274247,0.00002358477,0.00007630673,0.00012296991,0.00005779076],"domain_scores_gemma":[0.99918216,0.00058924645,0.00008693611,0.000037887436,0.00008177093,0.00002191981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011558529,0.0009079172,0.0011578149,0.0004437932,0.00029669135,0.0009812715,0.00070310786,0.00088272744,0.0007302712],"category_scores_gemma":[0.0020687091,0.00047822116,0.00035783197,0.0005987609,0.0008956754,0.0009018024,0.0007677817,0.00056940346,0.00022696111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006274047,0.000026843405,0.00014883273,0.00006423476,0.000021804624,0.00008756763,0.0000653907,0.96565574,0.0025530995,0.014675507,0.00040600696,0.016232288],"study_design_scores_gemma":[0.000008023727,0.000023788849,0.000035222947,0.000003653472,0.0000041265953,0.000020000225,0.000008606782,0.9931117,0.00070697814,0.0059196637,0.00015423638,0.0000040017812],"about_ca_topic_score_codex":0.0008452664,"about_ca_topic_score_gemma":0.00069663685,"teacher_disagreement_score":0.0011578149,"about_ca_system_score_codex":0.0007795714,"about_ca_system_score_gemma":0.0005329235,"threshold_uncertainty_score":0.006112814},"labels":[],"label_agreement":null},{"id":"W2137858537","doi":"10.1109/tsp.2008.917390","title":"Optimized Power Allocation for Pairwise Cooperative Multiple Access","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"University of Toronto","keywords":"Resource allocation; Computer science; Mathematical optimization; Quality of service; Channel (broadcasting); Pairwise comparison; Transmission (telecommunications); Channel state information; Computer network; Mathematics; Wireless; Telecommunications","score_opus":0.07950067114866823,"score_gpt":0.31339587861972934,"score_spread":0.23389520747106113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137858537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014289113,0.00022240798,0.98132,0.0000727123,0.00001874944,0.000038567854,0.000043829863,0.00012071659,0.0038739492],"genre_scores_gemma":[0.7809133,0.00042663846,0.21188366,0.000099645884,0.00004267428,0.00026451456,0.00013467141,0.000109178975,0.006125764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990833,0.00036169437,0.000031743362,0.0001345275,0.00026961227,0.00011905855],"domain_scores_gemma":[0.99924135,0.0004930937,0.000073573676,0.00006234388,0.000107324966,0.000022238322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011155412,0.00083824096,0.00067890994,0.00044328396,0.00031904326,0.00072348764,0.00089812983,0.0005434637,0.0027998404],"category_scores_gemma":[0.0036890337,0.00038593388,0.00027472718,0.0007909589,0.00057503197,0.00096327707,0.0010416787,0.0005669494,0.0007010945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012204728,0.000047727397,0.0002451192,0.00007503456,0.000029928717,0.00007981311,0.00008394621,0.86685914,0.004509065,0.040768605,0.0017078209,0.08547169],"study_design_scores_gemma":[0.000015496607,0.0000358996,0.00007472814,0.000004008029,0.0000061627493,0.000030997104,0.000012769891,0.98000276,0.0007521171,0.018318534,0.0007410256,0.0000055334167],"about_ca_topic_score_codex":0.0009789701,"about_ca_topic_score_gemma":0.0013308566,"teacher_disagreement_score":0.0027998404,"about_ca_system_score_codex":0.00074737176,"about_ca_system_score_gemma":0.000764732,"threshold_uncertainty_score":0.009366393},"labels":[],"label_agreement":null},{"id":"W2138662738","doi":"10.1109/78.823991","title":"Simple wavelet frames for finite functions on discrete tori","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal University Hospital; University of Saskatchewan","funders":"","keywords":"Torus; Mathematics; Wavelet; Discrete wavelet transform; Simple (philosophy); Wavelet transform; Lifting scheme; Mathematical analysis; Second-generation wavelet transform; Discrete mathematics; Pure mathematics; Algorithm; Computer science; Geometry; Artificial intelligence","score_opus":0.06118659364675311,"score_gpt":0.35022858973606374,"score_spread":0.28904199608931064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138662738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054013632,0.0010883681,0.93170214,0.00037414083,0.0004935222,0.00003818453,0.00013818414,0.00014042357,0.012011402],"genre_scores_gemma":[0.65356445,0.0024878907,0.32455137,0.00020066736,0.0007743107,0.00018326465,0.00035395465,0.00013952733,0.017744599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996811,0.00008038808,0.000023439152,0.00005051595,0.00013750726,0.000026989339],"domain_scores_gemma":[0.99966633,0.00008209239,0.00006684038,0.000048824673,0.00009070106,0.00004525166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004850962,0.0006563675,0.000520092,0.0009404343,0.00040929814,0.001465743,0.00052179716,0.00051675254,0.0016014385],"category_scores_gemma":[0.0012934394,0.00021548211,0.00046640926,0.000680199,0.0014113971,0.001750385,0.0009013853,0.0010459851,0.00048229497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018926152,0.0000064339097,0.000056166948,0.000037164787,0.000004583323,0.00006747597,0.00010013309,0.0071260342,0.005681912,0.97546834,0.0006067943,0.010826237],"study_design_scores_gemma":[0.000016570926,0.00006524855,0.00023515015,0.000026720449,0.000007844785,0.00017716107,0.00009692769,0.13651404,0.003378708,0.84782296,0.011628728,0.000029949839],"about_ca_topic_score_codex":0.00035499755,"about_ca_topic_score_gemma":0.000341194,"teacher_disagreement_score":0.0016014385,"about_ca_system_score_codex":0.000538052,"about_ca_system_score_gemma":0.0002689458,"threshold_uncertainty_score":0.005357325},"labels":[],"label_agreement":null},{"id":"W2139656913","doi":"10.1109/tsp.2009.2022915","title":"Optimal Threshold Policies for Multivariate POMDPs in Radar Resource Management","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multilinear map; Parameterized complexity; Markov decision process; Computer science; Mathematical optimization; Scheduling (production processes); Multivariate statistics; Markov process; Radar; Markov chain; Algorithm; Mathematics; Machine learning; Statistics","score_opus":0.02004058503293873,"score_gpt":0.2655551955787573,"score_spread":0.24551461054581855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139656913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03701073,0.00020857692,0.96031773,0.00043598065,0.000024317847,0.000045910732,0.00013716104,0.00020983047,0.0016098274],"genre_scores_gemma":[0.89665055,0.00034361897,0.10028644,0.000102609985,0.00003379432,0.00018653648,0.00019059927,0.00009889942,0.0021069557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894506,0.00042678855,0.000059141625,0.00021157769,0.0001634478,0.00019396492],"domain_scores_gemma":[0.9967173,0.002398803,0.00044733344,0.00009261348,0.000174954,0.00016900746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020480442,0.0009020568,0.0014460249,0.00055765786,0.0005110557,0.0018756909,0.00095204747,0.0011403951,0.0027097485],"category_scores_gemma":[0.0066838604,0.0007177332,0.00083776907,0.0007843486,0.001312272,0.0021084934,0.0012694425,0.0019639097,0.00024981634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049253777,0.000015751222,0.0002187067,0.00002218924,0.000013734504,0.000017888347,0.000026671181,0.9807792,0.0002380314,0.014664472,0.00019434931,0.0037597013],"study_design_scores_gemma":[0.000008307739,0.000008221732,0.00005430102,0.0000030662454,0.0000026827186,0.0000024370145,0.0000074704753,0.99090564,0.000105587416,0.008821874,0.00007697011,0.0000034816792],"about_ca_topic_score_codex":0.0105286585,"about_ca_topic_score_gemma":0.006986691,"teacher_disagreement_score":0.0105286585,"about_ca_system_score_codex":0.0032548157,"about_ca_system_score_gemma":0.0023778647,"threshold_uncertainty_score":0.02361548},"labels":[],"label_agreement":null},{"id":"W2139913462","doi":"10.1109/tsp.2008.929660","title":"Approximate Conditional Mean Particle Filtering for Linear/Nonlinear Dynamic State Space Models","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":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Else Kröner-Fresenius-Stiftung","keywords":"Particle filter; Algorithm; Recursion (computer science); Mathematics; Conditional expectation; Conditional probability distribution; Kalman filter; Moment (physics); Gaussian; Filter (signal processing); Computer science; Mathematical optimization; Statistics","score_opus":0.04000679858136258,"score_gpt":0.26834016062681454,"score_spread":0.22833336204545196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139913462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062255296,0.0001168087,0.99303836,0.000063062376,0.000017154782,0.000006830915,0.000016595159,0.0001057737,0.00040988246],"genre_scores_gemma":[0.654879,0.0007396293,0.34021708,0.00010906474,0.00009370745,0.000106056425,0.00023450413,0.00006184129,0.0035590942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996606,0.00009938277,0.000015955975,0.00006917277,0.00011182945,0.00004307682],"domain_scores_gemma":[0.9990088,0.0006674672,0.00009973864,0.00009208188,0.00011055423,0.00002141943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010537098,0.00050326384,0.00083137566,0.0004528873,0.0003053239,0.00066313904,0.0006781986,0.0008817078,0.0009689577],"category_scores_gemma":[0.004003205,0.00035859848,0.0005770191,0.00068220374,0.0006749594,0.00092584867,0.00060204964,0.0010139366,0.00020384714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057666464,0.000019345525,0.0006278998,0.000050847008,0.000026887486,0.00006133852,0.000047545873,0.94028157,0.00132327,0.025514768,0.00061629387,0.03137254],"study_design_scores_gemma":[0.0000018537413,0.000004281336,0.00008191444,0.0000014047259,0.000002379189,0.0000071708723,0.0000014553235,0.9965467,0.00017887152,0.003015626,0.00015592556,0.0000023407354],"about_ca_topic_score_codex":0.009332271,"about_ca_topic_score_gemma":0.006757403,"teacher_disagreement_score":0.009332271,"about_ca_system_score_codex":0.000775887,"about_ca_system_score_gemma":0.000997889,"threshold_uncertainty_score":0.01855588},"labels":[],"label_agreement":null},{"id":"W2140663201","doi":"10.1109/tsp.2010.2074197","title":"SNR Estimation Over SIMO Channels From Linearly Modulated Signals","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Cramér–Rao bound; Estimator; Mathematics; Additive white Gaussian noise; Algorithm; Upper and lower bounds; Signal-to-noise ratio (imaging); Closed-form expression; Estimation theory; Statistics; White noise; Mathematical analysis","score_opus":0.013898840618470631,"score_gpt":0.2613332308730976,"score_spread":0.247434390254627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140663201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0334892,0.00024001651,0.9645931,0.00007095214,0.000014453758,0.000015475387,0.00005112967,0.00018339652,0.0013422151],"genre_scores_gemma":[0.6793855,0.0005975821,0.3174787,0.0001329008,0.000087640736,0.000071868,0.00020568594,0.00006804572,0.0019722034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897826,0.00033382987,0.000048834365,0.00021587992,0.00034014377,0.00008306197],"domain_scores_gemma":[0.99827814,0.0011550315,0.00020321779,0.00015941456,0.00017964822,0.00002441053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010647826,0.00091784453,0.00083202,0.0004889106,0.00028819923,0.00093574554,0.00052904186,0.00044516494,0.00094388006],"category_scores_gemma":[0.0063085873,0.0003425951,0.0003562499,0.00065462705,0.0006455013,0.0013844906,0.0010584575,0.00045567387,0.0004228381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056515605,0.0000524883,0.0044588726,0.00030399096,0.00013970461,0.000331822,0.00031464972,0.66642016,0.03387159,0.027737195,0.0008165134,0.26498786],"study_design_scores_gemma":[0.000016877459,0.00006860848,0.00067053275,0.000022016407,0.000027323485,0.0002127169,0.00005137445,0.9649326,0.024194868,0.0085134115,0.0012645372,0.000025065405],"about_ca_topic_score_codex":0.00065462396,"about_ca_topic_score_gemma":0.00091414235,"teacher_disagreement_score":0.0010647826,"about_ca_system_score_codex":0.0003576698,"about_ca_system_score_gemma":0.0005595722,"threshold_uncertainty_score":0.005631149},"labels":[],"label_agreement":null},{"id":"W2141310001","doi":"10.1109/tsp.2011.2161293","title":"A Non-Data-Aided Maximum Likelihood Time Delay Estimator Using Importance Sampling","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Estimator; Mathematics; Additive white Gaussian noise; Algorithm; Estimation theory; Mathematical optimization; Gaussian noise; White noise; Convergence (economics); Sampling (signal processing); Likelihood function; Statistics; Computer science","score_opus":0.07906014994916653,"score_gpt":0.3064905066795563,"score_spread":0.22743035673038975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141310001","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023827138,0.00007995921,0.9972614,0.000025451498,0.000015242897,0.000009085099,0.0000069757984,0.00006437446,0.00015474176],"genre_scores_gemma":[0.1548542,0.00025587194,0.84295434,0.00006756257,0.00010661347,0.000078956335,0.00012155824,0.00007686942,0.0014839991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924433,0.0002616865,0.000034155964,0.00010744787,0.00030784143,0.00004452442],"domain_scores_gemma":[0.99815935,0.0012185555,0.00012961327,0.00015918382,0.0002842309,0.000049038965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012482355,0.0005507137,0.0009266249,0.00055562955,0.00023606491,0.00076019665,0.001075177,0.0007622005,0.0010064691],"category_scores_gemma":[0.0050699995,0.0004359301,0.0005372897,0.00070374773,0.0004970974,0.0014533596,0.00090269424,0.0010606125,0.00038216563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046368287,0.00019179944,0.0037777242,0.00034576587,0.00016442833,0.00027178583,0.00017011444,0.45732754,0.04549571,0.0453441,0.0021432792,0.444304],"study_design_scores_gemma":[0.000021053376,0.0000433695,0.00025968297,0.000007080618,0.000010842633,0.000097991884,0.0000046394616,0.99082726,0.005032932,0.0026395195,0.0010437256,0.0000119470915],"about_ca_topic_score_codex":0.0009548832,"about_ca_topic_score_gemma":0.001112602,"teacher_disagreement_score":0.0012482355,"about_ca_system_score_codex":0.00045516336,"about_ca_system_score_gemma":0.0008566456,"threshold_uncertainty_score":0.006601393},"labels":[],"label_agreement":null},{"id":"W2141462645","doi":"10.1109/tsp.2004.840713","title":"Image transmission over the polya channel via channel-optimized quantization","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Quantization (signal processing); Channel (broadcasting); Algorithm; Computer science; Binary symmetric channel; Binary number; Exploit; Wavelet; Transmission (telecommunications); Channel capacity; Speech recognition; Theoretical computer science; Mathematics; Telecommunications; Artificial intelligence; Arithmetic","score_opus":0.017722328269941637,"score_gpt":0.27823669259484635,"score_spread":0.2605143643249047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141462645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026294015,0.00023983647,0.9699702,0.0001100304,0.000045387806,0.00004152506,0.000037935624,0.00027818227,0.0029828283],"genre_scores_gemma":[0.55096614,0.00044387687,0.44325602,0.00010600234,0.000074168376,0.0001113859,0.00006811924,0.000092013375,0.00488229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997706,0.000051104493,0.000012046997,0.000035552235,0.00010508124,0.000025553547],"domain_scores_gemma":[0.99937063,0.00024184983,0.00007863974,0.00018142398,0.0000934214,0.000034116103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039541587,0.0003648936,0.0003401622,0.00032191313,0.0003325285,0.00068577466,0.00066047173,0.00038377772,0.0016073035],"category_scores_gemma":[0.0013070015,0.00016779284,0.0002006042,0.00030705347,0.0008495589,0.001238057,0.00091455795,0.00066375616,0.00039500804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075038336,0.00018674653,0.0009372934,0.00029902946,0.00006203842,0.0003843782,0.00050138845,0.15785731,0.16817884,0.31472644,0.003483037,0.35263318],"study_design_scores_gemma":[0.00005702159,0.00017703413,0.0002821717,0.000027458953,0.00001929673,0.00031274065,0.00003853379,0.9172779,0.05151566,0.024891362,0.005354525,0.000046405465],"about_ca_topic_score_codex":0.0005354339,"about_ca_topic_score_gemma":0.00077238143,"teacher_disagreement_score":0.0016073035,"about_ca_system_score_codex":0.00030573635,"about_ca_system_score_gemma":0.00034962784,"threshold_uncertainty_score":0.005376935},"labels":[],"label_agreement":null},{"id":"W2142134169","doi":"10.1109/tsp.2002.1011206","title":"A fractionally spaced blind equalizer based on linear programming","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Blind equalization; Baud; Quadrature amplitude modulation; QAM; Linear programming; Intersymbol interference; Convex optimization; Computer science; Piecewise linear function; Equalization (audio); Equalizer; Quadratic programming; Mathematics; Algorithm; Control theory (sociology); Mathematical optimization; Regular polygon; Transmission (telecommunications); Telecommunications; Decoding methods; Bit error rate; Artificial intelligence","score_opus":0.05052993359516259,"score_gpt":0.3000487753965221,"score_spread":0.2495188418013595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142134169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011577695,0.000035813526,0.9982008,0.000034572113,0.000008155313,0.0000061761216,0.0000041189737,0.000057197056,0.00049533456],"genre_scores_gemma":[0.1543126,0.00036100083,0.8389829,0.00010864596,0.000057041594,0.00013742718,0.00005045092,0.00007219045,0.005917794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975556,0.0000814793,0.000009530889,0.000043054744,0.000082775514,0.000027548704],"domain_scores_gemma":[0.99979967,0.00011600343,0.000021158236,0.000015722686,0.000038490933,0.000008954998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042767383,0.00059859606,0.0006360803,0.00028372477,0.00026127,0.00073777797,0.00060856494,0.0006545509,0.0018131024],"category_scores_gemma":[0.00093692617,0.00030286913,0.00038539307,0.00045514252,0.00053519354,0.00086330343,0.0005553373,0.0010556671,0.0005385897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070681606,0.00004135588,0.00009746817,0.000072213144,0.00002327258,0.000047122012,0.000047487334,0.84517086,0.013218003,0.04101349,0.0012558311,0.09894227],"study_design_scores_gemma":[0.000005069146,0.000021402702,0.000015320114,0.0000031184925,0.0000038899825,0.000017691862,0.000004236642,0.99289274,0.0019416317,0.0042505823,0.00084030366,0.000003997165],"about_ca_topic_score_codex":0.0013672288,"about_ca_topic_score_gemma":0.00119664,"teacher_disagreement_score":0.0018131024,"about_ca_system_score_codex":0.0004245787,"about_ca_system_score_gemma":0.00063417864,"threshold_uncertainty_score":0.006065488},"labels":[],"label_agreement":null},{"id":"W2142482043","doi":"10.1109/tsp.2006.879326","title":"An Efficient Parallel Architecture for Implementing LST Decoding in MIMO Systems","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; SIMD; MIMO; Digital signal processing; Coprocessor; Field-programmable gate array; Decoding methods; Throughput; Digital signal processor; Computer hardware; Embedded system; Wireless; Computer architecture; Parallel computing; Channel (broadcasting); Telecommunications","score_opus":0.01757835201055858,"score_gpt":0.27703702099875654,"score_spread":0.25945866898819797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142482043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058879342,0.0004416205,0.9230882,0.00027104997,0.00009959795,0.00012407618,0.00015374261,0.0051694005,0.011773095],"genre_scores_gemma":[0.48207098,0.00032619282,0.5102953,0.00014972084,0.00006803478,0.00015694201,0.00031577903,0.00012597207,0.0064911633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998281,0.00003483715,0.000013120717,0.000028642546,0.00007304197,0.000022244292],"domain_scores_gemma":[0.9996985,0.0000681475,0.000033167053,0.00007843811,0.00010735614,0.000014358245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026116692,0.00042704237,0.00024294292,0.00038014285,0.00036054122,0.00044986574,0.00077144284,0.0003288732,0.003258744],"category_scores_gemma":[0.00066398265,0.00022394526,0.0002307627,0.00042578432,0.00024383121,0.00073547784,0.00024103669,0.0003959526,0.0013657237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008143766,0.0002650973,0.0014770699,0.00034540403,0.00007749488,0.0005636176,0.00020460122,0.1599261,0.32502937,0.036283594,0.009439841,0.4655735],"study_design_scores_gemma":[0.00015640956,0.000649862,0.00070044305,0.00003471089,0.00005994987,0.0006158393,0.000047151192,0.7942964,0.17500365,0.010276795,0.018120453,0.000038296854],"about_ca_topic_score_codex":0.0013176993,"about_ca_topic_score_gemma":0.0024959987,"teacher_disagreement_score":0.003258744,"about_ca_system_score_codex":0.00042636556,"about_ca_system_score_gemma":0.0006844358,"threshold_uncertainty_score":0.01090157},"labels":[],"label_agreement":null},{"id":"W2143045079","doi":"10.1109/tsp.2009.2028193","title":"Asymptotic Spectral Efficiency of MIMO Ad hoc Networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Transmitter; Beamforming; Wireless ad hoc network; MIMO; Upper and lower bounds; Channel state information; Computer science; Topology (electrical circuits); Spectral efficiency; Node (physics); Algorithm; Channel (broadcasting); Mathematics; Computer network; Wireless; Telecommunications; Combinatorics; Physics; Mathematical analysis","score_opus":0.008361097275413655,"score_gpt":0.2213698325811415,"score_spread":0.21300873530572786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143045079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042657197,0.0038079035,0.9190699,0.00082335353,0.00010642906,0.000055803008,0.00015441774,0.00028391316,0.033041183],"genre_scores_gemma":[0.9460313,0.004687492,0.04084769,0.00046716785,0.00027622003,0.00022033734,0.00021451295,0.0001729159,0.0070824665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977456,0.0006976451,0.00006531192,0.00026507262,0.0008378395,0.00038859952],"domain_scores_gemma":[0.9893104,0.008157253,0.0004655762,0.0006340014,0.0012627136,0.0001700497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024346705,0.0010709796,0.0010346585,0.0016892665,0.000813417,0.0019172316,0.0016875932,0.0010861891,0.0034666145],"category_scores_gemma":[0.017255897,0.00056156574,0.0006166388,0.0014359656,0.002162604,0.0031328143,0.0017700595,0.0016535068,0.0010099958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001191535,0.00007537123,0.0013470381,0.00030507555,0.00008996819,0.0002674753,0.0002261975,0.58314306,0.006419055,0.37847093,0.0029248844,0.026611721],"study_design_scores_gemma":[0.0000068437053,0.000039994524,0.00053661177,0.000069444504,0.000020783165,0.00022289631,0.000076883014,0.88059115,0.0019693514,0.114243105,0.0022000682,0.000022820574],"about_ca_topic_score_codex":0.0015406755,"about_ca_topic_score_gemma":0.0007197257,"teacher_disagreement_score":0.0034666145,"about_ca_system_score_codex":0.0027027298,"about_ca_system_score_gemma":0.0010619779,"threshold_uncertainty_score":0.01960975},"labels":[],"label_agreement":null},{"id":"W2143755090","doi":"10.1109/tsp.2002.806996","title":"Algebraic theory of optimal filterbanks","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Water Systems and Optimization","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Algebraic number; Mathematical optimization; Applied mathematics; Discrete mathematics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.012716961829077507,"score_gpt":0.19955981582273405,"score_spread":0.18684285399365655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143755090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01775707,0.00049132603,0.9615952,0.0004724951,0.000068834524,0.000032754644,0.00019635289,0.000086275024,0.01929975],"genre_scores_gemma":[0.5806199,0.0023152798,0.3958099,0.0004979201,0.00059581804,0.00029922122,0.00077175215,0.00019129114,0.01889898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987985,0.000318021,0.00009522968,0.00017987509,0.00048755805,0.00012074319],"domain_scores_gemma":[0.9988167,0.00050634745,0.00017642866,0.000083627536,0.00034239315,0.00007438582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012073496,0.00066322944,0.0005587587,0.0012404462,0.0006132351,0.0019615402,0.0005395881,0.00066774106,0.0042919847],"category_scores_gemma":[0.0030400713,0.0003145156,0.00076659734,0.0009514259,0.0018257491,0.0021381858,0.0010973781,0.0014148153,0.00073199114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011681018,0.000009117362,0.00010280654,0.00003364536,0.000009449452,0.000027155478,0.00004077733,0.017237548,0.0011570833,0.9700558,0.00063101295,0.010683943],"study_design_scores_gemma":[0.000012072921,0.000066373526,0.00022276993,0.000028561795,0.000015195462,0.00007659206,0.000055295342,0.13874945,0.0013037692,0.8483292,0.011122696,0.000018109331],"about_ca_topic_score_codex":0.00080581027,"about_ca_topic_score_gemma":0.0009346705,"teacher_disagreement_score":0.0042919847,"about_ca_system_score_codex":0.0013774309,"about_ca_system_score_gemma":0.00073870656,"threshold_uncertainty_score":0.014358103},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03476306807681433,"score_gpt":0.2671225874347176,"score_spread":0.23235951935790328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144024329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15030129,0.0003125636,0.8270101,0.00026114247,0.00008638339,0.00012813452,0.0006587731,0.0040770513,0.017164556],"genre_scores_gemma":[0.73414665,0.0002629561,0.24979265,0.00020637005,0.00005744073,0.00015620652,0.0010404917,0.00017028429,0.014167016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995171,0.00006243523,0.00003223492,0.00010799442,0.00022765728,0.000052485764],"domain_scores_gemma":[0.99955016,0.00010807733,0.00004170799,0.00009807957,0.00017482389,0.000027162332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000234078,0.0004415584,0.00044862082,0.0004671864,0.0003907493,0.00055518537,0.0005643239,0.00044966122,0.0030407377],"category_scores_gemma":[0.00069140806,0.00026253302,0.0003411916,0.0004984197,0.0002674229,0.0006177491,0.0005166078,0.00034959553,0.0011646553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073245255,0.00019434316,0.002126076,0.00025138387,0.00012515433,0.0003905354,0.0001855035,0.38436437,0.254051,0.05709382,0.008602417,0.29188296],"study_design_scores_gemma":[0.000054175962,0.0001328663,0.0007846102,0.000014041424,0.000022073624,0.0003507144,0.00001568805,0.90337086,0.076852135,0.009684657,0.008687689,0.00003052508],"about_ca_topic_score_codex":0.002047392,"about_ca_topic_score_gemma":0.0044330857,"teacher_disagreement_score":0.0030407377,"about_ca_system_score_codex":0.0006559107,"about_ca_system_score_gemma":0.001223626,"threshold_uncertainty_score":0.010172248},"labels":[],"label_agreement":null},{"id":"W2144611931","doi":"10.1109/tsp.2008.929337","title":"Stochastic Decoding of Linear Block Codes With High-Density Parity-Check Matrices","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada); McGill University","funders":"","keywords":"Decoding methods; List decoding; Berlekamp–Welch algorithm; Algorithm; Computer science; Sequential decoding; Block (permutation group theory); Block code; Mathematics; Theoretical computer science; Concatenated error correction code; Combinatorics","score_opus":0.02652388012649342,"score_gpt":0.2598790656467982,"score_spread":0.23335518552030476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144611931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08181042,0.00026818662,0.9098159,0.00031474835,0.00006280606,0.000056276866,0.00014385117,0.00042591014,0.0071019023],"genre_scores_gemma":[0.8640634,0.00040525547,0.13020171,0.00014742037,0.0000667723,0.00008191348,0.0002787871,0.00007253791,0.0046823123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860686,0.0005201061,0.000050084444,0.00009136957,0.0006115061,0.00012004234],"domain_scores_gemma":[0.9967434,0.0019972476,0.0002987489,0.00034178313,0.00055776123,0.00006109779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011187514,0.00055063365,0.00051227596,0.00044483112,0.00040070276,0.0008877715,0.0005194403,0.0006427884,0.0014299693],"category_scores_gemma":[0.0055196034,0.00026533907,0.00033942182,0.00071584614,0.0007075611,0.0007625402,0.00077911397,0.0005503506,0.00049452594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004048859,0.000058614154,0.0013440792,0.00015317292,0.00007945013,0.0002520698,0.00015096454,0.77233064,0.02344241,0.13516776,0.0017896384,0.06482624],"study_design_scores_gemma":[0.00001442545,0.000048192393,0.00020692126,0.000012673311,0.000008610084,0.00008361451,0.000009883832,0.9728971,0.009975189,0.016125122,0.00060623436,0.000012055995],"about_ca_topic_score_codex":0.0023927914,"about_ca_topic_score_gemma":0.0039210296,"teacher_disagreement_score":0.0023927914,"about_ca_system_score_codex":0.00074951147,"about_ca_system_score_gemma":0.0013075001,"threshold_uncertainty_score":0.0059165955},"labels":[],"label_agreement":null},{"id":"W2144838075","doi":"10.1109/tsp.2006.872603","title":"Optimum space-time processors with symbol-rate sampling are bandlimited","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bandlimiting; Nyquist rate; Mathematics; Disjoint sets; Algorithm; Symbol rate; Transmitter; Bandwidth (computing); MIMO; Channel (broadcasting); Nyquist–Shannon sampling theorem; Control theory (sociology); Sampling (signal processing); Computer science; Telecommunications; Bit error rate; Discrete mathematics; Decoding methods; Fourier transform; Mathematical analysis","score_opus":0.013468219396436647,"score_gpt":0.22942258633406176,"score_spread":0.21595436693762513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144838075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043167002,0.00035283423,0.9542611,0.000107246655,0.000017042708,0.000017876691,0.000017955083,0.00007005773,0.0019889236],"genre_scores_gemma":[0.69165343,0.0010377496,0.30345833,0.00012054643,0.00013816736,0.00013878952,0.000084519,0.000078262994,0.0032901096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990134,0.00037231293,0.0000461893,0.00014928784,0.00032542285,0.00009330798],"domain_scores_gemma":[0.99756384,0.0018675578,0.00026161218,0.000105589235,0.00016444329,0.000036925947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011816234,0.00070678,0.00084185787,0.00033173154,0.0002741641,0.0009133867,0.0003110749,0.0008651319,0.0011724734],"category_scores_gemma":[0.005827856,0.0005627155,0.00032885064,0.00042407008,0.0009333832,0.0016037899,0.00052769086,0.00061100506,0.0004443031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006256888,0.000073262585,0.00092049,0.00024325468,0.00006905275,0.00011974357,0.00024292826,0.7946182,0.021013213,0.08771659,0.0007863778,0.09357112],"study_design_scores_gemma":[0.00005800579,0.00018778039,0.00032602705,0.000031101572,0.000027625616,0.00010555135,0.000039249015,0.9536008,0.008442676,0.035488024,0.0016775659,0.00001559141],"about_ca_topic_score_codex":0.00024802948,"about_ca_topic_score_gemma":0.00028552502,"teacher_disagreement_score":0.0011816234,"about_ca_system_score_codex":0.00032816446,"about_ca_system_score_gemma":0.0004840668,"threshold_uncertainty_score":0.00624907},"labels":[],"label_agreement":null},{"id":"W2144841774","doi":"10.1109/tsp.2006.872585","title":"Iterative multiuser detection and error control code decoding in random CDMA","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta Hospital; University of Alberta","funders":"","keywords":"Computer science; Minimum mean square error; Algorithm; Decoding methods; Code division multiple access; Turbo code; Single antenna interference cancellation; EXIT chart; Bit error rate; Mathematics; Concatenated error correction code; Telecommunications; Statistics; Block code","score_opus":0.012296465193312282,"score_gpt":0.2527613133988497,"score_spread":0.24046484820553743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144841774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03852277,0.00069852854,0.95607066,0.00011922296,0.000032337044,0.000033794917,0.000021168134,0.00018474985,0.004316725],"genre_scores_gemma":[0.76872784,0.00085998594,0.2221607,0.00009547256,0.00006503482,0.00012504938,0.00005733182,0.000053869662,0.007854628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989293,0.0004303753,0.000029095458,0.00010762645,0.0004087037,0.000094876086],"domain_scores_gemma":[0.99866045,0.0008606584,0.00014545117,0.00008904796,0.00022663697,0.000017654958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006662685,0.00045558118,0.00046448503,0.000331075,0.0003017572,0.00058005215,0.0006001879,0.00075431186,0.00070801604],"category_scores_gemma":[0.003287536,0.00035251136,0.00032444112,0.0006220511,0.00069396745,0.00069982855,0.0004907725,0.0005143888,0.0002791436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010830327,0.000037358393,0.0014093366,0.00013507385,0.000047958743,0.00031318006,0.00022886951,0.817538,0.012399247,0.10407005,0.0007079419,0.06300469],"study_design_scores_gemma":[0.0000053467497,0.000025532838,0.00018323747,0.0000049253276,0.0000058938954,0.000082123326,0.00000892253,0.98933345,0.0033472527,0.0064575756,0.000537974,0.000007637144],"about_ca_topic_score_codex":0.0026820658,"about_ca_topic_score_gemma":0.0031328052,"teacher_disagreement_score":0.0026820658,"about_ca_system_score_codex":0.0008963797,"about_ca_system_score_gemma":0.0008108218,"threshold_uncertainty_score":0.006503701},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01305406023016089,"score_gpt":0.2595318407802652,"score_spread":0.2464777805501043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144903371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0108499145,0.00040775782,0.9848065,0.00022520049,0.000043327196,0.0000205332,0.00003312552,0.00021404718,0.0033995814],"genre_scores_gemma":[0.7738658,0.0011959199,0.21989928,0.00013956802,0.00007163814,0.00025126722,0.00016034547,0.00011236208,0.0043037706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995402,0.0001999895,0.000023555076,0.00005669791,0.0001351716,0.00004436075],"domain_scores_gemma":[0.99634355,0.002860979,0.00017563114,0.00022980754,0.00034047652,0.00004941391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018343724,0.00044240948,0.0009842142,0.00046419556,0.0004598472,0.0009824549,0.0006976876,0.0011006434,0.0020857668],"category_scores_gemma":[0.0064971983,0.0004425605,0.0005714878,0.00073298236,0.0010208664,0.0014453166,0.0009093037,0.0013695706,0.00039070813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021061096,0.000010686384,0.0003333467,0.000030973075,0.000011093984,0.000019510975,0.000034309647,0.96569645,0.00025903527,0.024313388,0.00028876317,0.008981386],"study_design_scores_gemma":[0.0000016218396,0.000002988119,0.000029266637,0.0000023431678,9.729047e-7,0.0000038089559,0.0000018363204,0.9964014,0.000059951388,0.0032895578,0.00020421343,0.0000019111947],"about_ca_topic_score_codex":0.01229401,"about_ca_topic_score_gemma":0.005282749,"teacher_disagreement_score":0.01229401,"about_ca_system_score_codex":0.0010287752,"about_ca_system_score_gemma":0.00082986953,"threshold_uncertainty_score":0.024444938},"labels":[],"label_agreement":null},{"id":"W2146357631","doi":"10.1109/tsp.2007.894421","title":"Random Unitary Beamforming With Partial Feedback for MISO Downlink Transmission Using Multiuser Diversity","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Beamforming; Telecommunications link; Base station; Computer science; Unitary matrix; Unitary state; Algorithm; Channel (broadcasting); Wireless; Transmission (telecommunications); Mathematics; Topology (electrical circuits); Computer network; Telecommunications; Combinatorics","score_opus":0.020459429537668473,"score_gpt":0.24336063225963064,"score_spread":0.22290120272196218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146357631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02813784,0.0012347127,0.96635145,0.00059158663,0.00007301528,0.00003546464,0.00006357342,0.000108511966,0.0034038345],"genre_scores_gemma":[0.882523,0.003238427,0.104397416,0.0004402635,0.00032323564,0.00026032288,0.00018625546,0.00009015156,0.008540996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900925,0.0004671225,0.00002770103,0.00012649751,0.00022750213,0.0001418284],"domain_scores_gemma":[0.9968436,0.002387336,0.00028609915,0.00009690398,0.00028729727,0.000098659686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015313945,0.00113937,0.0013931738,0.00040107995,0.0005242167,0.0010606368,0.00073437055,0.0014057438,0.001718869],"category_scores_gemma":[0.0053212005,0.000650305,0.00065161684,0.00092341943,0.001404823,0.001736483,0.0010458292,0.0008751604,0.00041171952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001345281,0.00003514486,0.0004246083,0.00021307016,0.000050592,0.000223249,0.00013893092,0.9155789,0.004526191,0.06204121,0.0012009528,0.015432648],"study_design_scores_gemma":[0.000014323259,0.000036885907,0.00008548988,0.000012086668,0.000011009235,0.000040088027,0.00002338537,0.98871046,0.00054029335,0.010204111,0.0003070288,0.000014773842],"about_ca_topic_score_codex":0.0022035628,"about_ca_topic_score_gemma":0.001946633,"teacher_disagreement_score":0.0022035628,"about_ca_system_score_codex":0.001292405,"about_ca_system_score_gemma":0.00091523916,"threshold_uncertainty_score":0.009377122},"labels":[],"label_agreement":null},{"id":"W2146448120","doi":"10.1109/tsp.2003.820987","title":"Space-Time Coding Ambiguities in Joint Adaptive Channel Estimation and Detection","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Algorithm; Computer science; Fading; Detector; Channel (broadcasting); Propagation of uncertainty; Rayleigh fading; Minimum mean square error; Mathematics; Decoding methods; Statistics; Estimator; Telecommunications","score_opus":0.020121944687604996,"score_gpt":0.2367474615652178,"score_spread":0.2166255168776128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146448120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035601597,0.000987072,0.96232486,0.000114329894,0.000049008257,0.000012990552,0.0000070148244,0.00005387167,0.0008492498],"genre_scores_gemma":[0.78537613,0.001482372,0.21103665,0.00009191805,0.00016413425,0.00003663794,0.000025695395,0.000045083405,0.0017414086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860966,0.0004460067,0.000059016314,0.00016379138,0.0006216135,0.000099767654],"domain_scores_gemma":[0.9928698,0.0053346483,0.00065556803,0.0005358574,0.0005425924,0.00006153813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020358611,0.0006109364,0.00055120344,0.0004686454,0.000552815,0.00082351983,0.00052275026,0.0008753334,0.0003064189],"category_scores_gemma":[0.015228328,0.00033827405,0.00028703082,0.00091191096,0.0013758189,0.0023463403,0.0010443098,0.0009917704,0.00010327057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025114397,0.00005408146,0.0036164336,0.0001750489,0.00007620638,0.00039976326,0.00062047417,0.674118,0.013625736,0.13476531,0.0004888354,0.17180897],"study_design_scores_gemma":[0.000009937792,0.00010127234,0.00057738053,0.000012963797,0.000023509041,0.0002688159,0.000042671476,0.9688224,0.0136830555,0.015089959,0.0013434791,0.000024491505],"about_ca_topic_score_codex":0.0015553538,"about_ca_topic_score_gemma":0.0011915381,"teacher_disagreement_score":0.0020358611,"about_ca_system_score_codex":0.00046732827,"about_ca_system_score_gemma":0.0007027318,"threshold_uncertainty_score":0.010766745},"labels":[],"label_agreement":null},{"id":"W2147018820","doi":"10.1109/tsp.2006.889403","title":"Game Theoretic Cross-Layer Transmission Policies in Multipacket Reception Wireless Networks","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Node (physics); Computer science; Transmission (telecommunications); Aloha; Nash equilibrium; Computer network; Wireless network; Channel (broadcasting); Channel state information; Mathematical optimization; Wireless; Throughput; Mathematics; Telecommunications; Engineering","score_opus":0.024452299823127778,"score_gpt":0.30961698727308906,"score_spread":0.28516468744996126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147018820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1547085,0.0003880212,0.83971125,0.00039600415,0.000026907357,0.00011616327,0.000051527375,0.00018850162,0.004413093],"genre_scores_gemma":[0.95136386,0.0002685527,0.04564663,0.00008963234,0.000018196582,0.00013186564,0.000042610234,0.000055986482,0.0023827115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981394,0.0010560825,0.000054099637,0.00018432393,0.00025169938,0.00031436596],"domain_scores_gemma":[0.9912247,0.0065176617,0.0010873278,0.00026366036,0.0005334972,0.00037314658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003766528,0.00092682044,0.0012602684,0.0007955711,0.00067411084,0.0016378063,0.0014670674,0.0013831365,0.0018093074],"category_scores_gemma":[0.012514477,0.00078703044,0.0005400862,0.00084003125,0.002460261,0.0028435816,0.0013070331,0.0013452094,0.00030312536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000992691,0.000069255344,0.0004155634,0.000035290595,0.00002689164,0.00012481272,0.00013838097,0.93886673,0.0010216158,0.05452407,0.0003813706,0.0042966967],"study_design_scores_gemma":[0.000014836134,0.00003786412,0.00007684413,0.0000031341208,0.0000038696057,0.000019186446,0.000022245014,0.9842455,0.0002342377,0.015223122,0.000113894515,0.000005344279],"about_ca_topic_score_codex":0.003293114,"about_ca_topic_score_gemma":0.0015786994,"teacher_disagreement_score":0.003766528,"about_ca_system_score_codex":0.002120872,"about_ca_system_score_gemma":0.0014338393,"threshold_uncertainty_score":0.019919515},"labels":[],"label_agreement":null},{"id":"W2147582729","doi":"10.1109/tsp.2010.2062510","title":"On Construction and Simulation of Autoregressive Sources With Near-Laplace Marginals","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Autoregressive model; Applied mathematics; Laplace transform; Marginal distribution; Laplace distribution; Bivariate analysis; Algorithm; Monte Carlo method; STAR model; Computer science; Gaussian process; Series (stratigraphy); Gaussian; Mathematics; Time series; Autoregressive integrated moving average; Statistics; Machine learning; Random variable; Mathematical analysis","score_opus":0.010579336687258769,"score_gpt":0.2655764296107105,"score_spread":0.25499709292345174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147582729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008367378,0.000046373825,0.9907616,0.00004563741,0.000007594066,0.000014392325,0.000012686389,0.00011755444,0.0006269124],"genre_scores_gemma":[0.494204,0.00032358768,0.5026484,0.0001043899,0.000045645997,0.00019467498,0.00025453317,0.00015147631,0.002073228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991841,0.0004478337,0.00003227976,0.00008575979,0.00020256187,0.00004746967],"domain_scores_gemma":[0.9942298,0.0046690465,0.00031098328,0.00033855278,0.00033667052,0.0001148554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001868302,0.00056456117,0.0007110457,0.0007911929,0.00040668374,0.00081569236,0.0009972402,0.0009784027,0.0016985541],"category_scores_gemma":[0.010632308,0.0005551362,0.0007803325,0.00065101724,0.0012625795,0.0010484343,0.0014791476,0.0012523602,0.0004006357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045942485,0.000024443098,0.00043665324,0.000025038025,0.000011893634,0.000053758176,0.00006950174,0.91258883,0.0014067367,0.07281198,0.0001726634,0.012352542],"study_design_scores_gemma":[0.0000030445337,0.000006959802,0.000020150075,0.0000025808872,0.0000010153979,0.00000943936,0.000002250004,0.9888466,0.00038951475,0.010553778,0.00016185582,0.0000028908235],"about_ca_topic_score_codex":0.0017977982,"about_ca_topic_score_gemma":0.0011708126,"teacher_disagreement_score":0.001868302,"about_ca_system_score_codex":0.000692374,"about_ca_system_score_gemma":0.000698242,"threshold_uncertainty_score":0.009880662},"labels":[],"label_agreement":null},{"id":"W2147627977","doi":"10.1109/tsp.2007.911284","title":"Optimal Channel-Aware ALOHA Protocol for Random Access in WLANs With Multipacket Reception and Decentralized Channel State Information","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Aloha; Computer science; Channel (broadcasting); Random access; Channel state information; Protocol (science); State (computer science); Telecommunications; Throughput; Wireless; Algorithm","score_opus":0.024127991192802165,"score_gpt":0.27228050088440897,"score_spread":0.2481525096916068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147627977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01795322,0.00011533265,0.98068446,0.00009000209,0.000011408463,0.000034762626,0.000018605813,0.00009108559,0.0010010953],"genre_scores_gemma":[0.8549117,0.00025872287,0.14289598,0.0000779043,0.000025250947,0.00017910359,0.00006677038,0.000039807917,0.0015447384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819034,0.00083934487,0.0000512716,0.000245943,0.00046634578,0.00020675387],"domain_scores_gemma":[0.99642307,0.002280776,0.00054269383,0.00027770875,0.00036741796,0.00010833019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027453366,0.0007997962,0.0011588263,0.000725014,0.0007312706,0.0010105193,0.0015772742,0.000996033,0.0009093648],"category_scores_gemma":[0.008651503,0.00055951596,0.00065813895,0.0006833197,0.001906357,0.0016261503,0.0014962002,0.0011847515,0.00025211796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006993025,0.000030405574,0.0002401409,0.0000318827,0.000022807539,0.000052402866,0.00006626181,0.9652097,0.00129214,0.02649657,0.00022293584,0.0062647182],"study_design_scores_gemma":[0.000008285777,0.000014442922,0.000027551358,0.0000023736568,0.0000041381554,0.000010260158,0.0000063883704,0.99437356,0.00023523677,0.00525084,0.00006270346,0.00000418436],"about_ca_topic_score_codex":0.002721332,"about_ca_topic_score_gemma":0.0024386563,"teacher_disagreement_score":0.0027453366,"about_ca_system_score_codex":0.0017228092,"about_ca_system_score_gemma":0.0020268103,"threshold_uncertainty_score":0.014518857},"labels":[],"label_agreement":null},{"id":"W2148342136","doi":"10.1109/tsp.2011.2128314","title":"Closed-Form Expressions for the Exact Cramér–Rao Bounds of Timing Recovery Estimators From BPSK, MSK and Square-QAM Transmissions","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Phase-shift keying; Mathematics; Additive white Gaussian noise; Cramér–Rao bound; Minimum-shift keying; Estimator; Quadrature amplitude modulation; QAM; Algorithm; Nyquist–Shannon sampling theorem; White noise; Amplitude and phase-shift keying; Upper and lower bounds; Statistics; Decoding methods; Bit error rate; Mathematical analysis","score_opus":0.044429401955696717,"score_gpt":0.27129499737454993,"score_spread":0.2268655954188532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148342136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003702219,0.0030943614,0.9868401,0.00021392373,0.00008663916,0.000058230497,0.00018063076,0.00029140807,0.005532562],"genre_scores_gemma":[0.29915202,0.01620838,0.67154866,0.00069095456,0.0008128602,0.0008825344,0.0013219037,0.00090623094,0.00847648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963509,0.0009824443,0.00026934018,0.00039804212,0.001621511,0.00037778728],"domain_scores_gemma":[0.9740902,0.019893328,0.0016355715,0.0017318411,0.0024852436,0.00016383002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005840301,0.0024627903,0.00146391,0.00265799,0.0006302435,0.003316909,0.0023630937,0.0021206713,0.0078699095],"category_scores_gemma":[0.05149089,0.0008128084,0.0011130547,0.0020154573,0.0022722722,0.004387114,0.0021461137,0.0032429597,0.0036829838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019022894,0.00014234912,0.00062914385,0.0016690752,0.00012112624,0.00027545102,0.00065854815,0.49322516,0.011082948,0.32404616,0.006017285,0.16194247],"study_design_scores_gemma":[0.000029335513,0.00014075756,0.0008861376,0.00057575305,0.000075908036,0.00067742117,0.00022941243,0.85286313,0.016235964,0.11737916,0.0107762385,0.0001307058],"about_ca_topic_score_codex":0.0013352431,"about_ca_topic_score_gemma":0.0025163468,"teacher_disagreement_score":0.0078699095,"about_ca_system_score_codex":0.0018057585,"about_ca_system_score_gemma":0.002052242,"threshold_uncertainty_score":0.030886829},"labels":[],"label_agreement":null},{"id":"W2148453647","doi":"10.1109/tsp.2005.845466","title":"Theory and design of multirate sensor arrays","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multilateration; Wireless sensor network; Computer science; Filter bank; Sensor array; Sensor fusion; Channel (broadcasting); Real-time computing; Algorithm; Node (physics); Engineering; Telecommunications; Artificial intelligence","score_opus":0.026373029487060433,"score_gpt":0.2550497717149262,"score_spread":0.22867674222786577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148453647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013547562,0.00045656486,0.99525,0.00008791873,0.000045858767,0.000014764428,0.000018385617,0.00006316661,0.0027086118],"genre_scores_gemma":[0.39211735,0.0059163333,0.5899277,0.00047220426,0.00040448614,0.00048267492,0.00020105692,0.0001324958,0.010345764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909675,0.00024697566,0.000051870622,0.00014825714,0.00040068806,0.00005550028],"domain_scores_gemma":[0.9991066,0.00043477127,0.00013302242,0.00009703787,0.00019837699,0.000030117977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094967894,0.0006793031,0.00068332296,0.000487676,0.00030643027,0.0011446908,0.000919523,0.0010409098,0.0021143428],"category_scores_gemma":[0.0027875619,0.000598588,0.0005703562,0.00048736672,0.0008382237,0.0015469203,0.00097393757,0.0010414063,0.00072640344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108728134,0.00003160553,0.0005708746,0.00049195666,0.000064984684,0.00020040013,0.00023037687,0.61552274,0.028987436,0.25221217,0.001798049,0.099780716],"study_design_scores_gemma":[0.000020913913,0.000100969395,0.00020189266,0.000050259947,0.000020012438,0.00019224576,0.00004037345,0.92557067,0.0067415335,0.052855004,0.014178755,0.000027306165],"about_ca_topic_score_codex":0.00049187423,"about_ca_topic_score_gemma":0.0003706158,"teacher_disagreement_score":0.0021143428,"about_ca_system_score_codex":0.0006587724,"about_ca_system_score_gemma":0.00044119678,"threshold_uncertainty_score":0.0070732236},"labels":[],"label_agreement":null},{"id":"W2149295650","doi":"10.1109/tsp.2009.2012904","title":"Nonlinear and Linear Broadcasting With QoS Requirements: Tractable Approaches for Bounded Channel Uncertainties","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Precoding; Mathematical optimization; Bounded function; Quality of service; Telecommunications link; Transmitter; Transmitter power output; Channel (broadcasting); Transmission (telecommunications); MIMO; Mathematics; Computer network; Telecommunications","score_opus":0.04405151188264863,"score_gpt":0.25463619806029103,"score_spread":0.2105846861776424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149295650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007954987,0.0003337258,0.9867448,0.00021163112,0.000012886506,0.000024589812,0.000050731876,0.000047623565,0.0046190247],"genre_scores_gemma":[0.7974022,0.0016249721,0.19458184,0.0002107535,0.00013830452,0.00029889934,0.0001550551,0.0000847995,0.005503147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934953,0.00023788126,0.000018596194,0.00009630934,0.00022310783,0.000074540076],"domain_scores_gemma":[0.9970836,0.0021815316,0.00033195125,0.00011983329,0.0002343125,0.000048725382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014636605,0.0012890435,0.0009157316,0.0005594168,0.00044312363,0.0013428376,0.00089224614,0.0013547216,0.0028367916],"category_scores_gemma":[0.0077655166,0.00058685266,0.00070969714,0.00069599383,0.0013832215,0.001461476,0.0013295828,0.0014495034,0.00028513517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013581052,0.000012884821,0.00011532164,0.000059021542,0.000009320004,0.000059525537,0.000054697048,0.9520124,0.0008263322,0.041390114,0.00025173818,0.005195003],"study_design_scores_gemma":[0.0000056248637,0.000011675469,0.000035729692,0.000007064693,0.000003667097,0.000010556954,0.000011996927,0.9864007,0.00026400972,0.012901186,0.00034336536,0.0000044052904],"about_ca_topic_score_codex":0.004995952,"about_ca_topic_score_gemma":0.0029742336,"teacher_disagreement_score":0.004995952,"about_ca_system_score_codex":0.0016115252,"about_ca_system_score_gemma":0.0010259707,"threshold_uncertainty_score":0.011692524},"labels":[],"label_agreement":null},{"id":"W2150364251","doi":"10.1109/tsp.2008.2010011","title":"Design and Analysis of a Successively Refinable Lattice Quantizer for i.i.d. Gaussian Sources","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Gaussian; Algorithm; Independent and identically distributed random variables; Mathematics; Coding (social sciences); Computer science; Lattice (music); Applied mathematics; Theoretical computer science; Random variable; Statistics","score_opus":0.04953194908737637,"score_gpt":0.3000290351967437,"score_spread":0.25049708610936733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150364251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053925766,0.00022644238,0.9935423,0.000095185576,0.00001885612,0.000024827494,0.000031847652,0.00008109935,0.00058678724],"genre_scores_gemma":[0.39338008,0.00074825535,0.6019878,0.00018522624,0.00006644549,0.00020228467,0.00017190853,0.000049855247,0.0032080973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941206,0.00015299598,0.00003425905,0.00008809641,0.00027164628,0.000040905972],"domain_scores_gemma":[0.9989318,0.00050472777,0.00016272847,0.000111299,0.00023689705,0.000052486306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010086664,0.0005598622,0.00057101547,0.0004433993,0.0002828465,0.0006508143,0.0008975198,0.0007953035,0.0016283767],"category_scores_gemma":[0.0027820268,0.00028438884,0.0003846971,0.0006309718,0.0007398941,0.0011016882,0.00073238055,0.0011398623,0.00043838896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000414109,0.000056569796,0.0008429695,0.00016602261,0.00005604901,0.00017168261,0.00016812289,0.5317608,0.076021746,0.17112634,0.0023077196,0.21690778],"study_design_scores_gemma":[0.000015643926,0.00009561338,0.00006341883,0.0000089707155,0.0000065346867,0.00005347179,0.0000069321313,0.9880838,0.0064562433,0.0039898036,0.0012031469,0.000016443075],"about_ca_topic_score_codex":0.0017146374,"about_ca_topic_score_gemma":0.0015775062,"teacher_disagreement_score":0.0017146374,"about_ca_system_score_codex":0.000798165,"about_ca_system_score_gemma":0.0009928856,"threshold_uncertainty_score":0.0057911277},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.06330710987030926,"score_gpt":0.27389654098516714,"score_spread":0.2105894311148579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150835235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015605055,0.00010630221,0.99761754,0.000040574694,0.0000065152594,0.0000051269526,0.000012868475,0.00012063644,0.0005298844],"genre_scores_gemma":[0.29330614,0.0019098516,0.69655246,0.00018921835,0.00015755509,0.00023133866,0.00046752024,0.00018884176,0.006997082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933976,0.00024663628,0.000028395363,0.000093383416,0.00023829807,0.00005353907],"domain_scores_gemma":[0.99917406,0.0004542405,0.00011683019,0.00012550234,0.000111086614,0.000018208008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010013564,0.000974113,0.0006990103,0.00039935776,0.00020676937,0.0006856122,0.0008255423,0.00085277105,0.00214481],"category_scores_gemma":[0.0031776105,0.00043933926,0.00069282355,0.0005896619,0.0006692414,0.0012145957,0.0009067982,0.0010421178,0.0012278664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098145865,0.000039663817,0.00032631686,0.0001783321,0.00007534634,0.0001272852,0.000088644396,0.74344856,0.02402258,0.080493234,0.002612156,0.14848979],"study_design_scores_gemma":[0.000008378028,0.000021405778,0.00009941391,0.0000069123116,0.000007843364,0.000059954633,0.000008032167,0.97625536,0.0021941287,0.019563206,0.0017640024,0.000011325984],"about_ca_topic_score_codex":0.0014212095,"about_ca_topic_score_gemma":0.0019764183,"teacher_disagreement_score":0.00214481,"about_ca_system_score_codex":0.0003536843,"about_ca_system_score_gemma":0.00058709324,"threshold_uncertainty_score":0.007175088},"labels":[],"label_agreement":null},{"id":"W2151058202","doi":"10.1109/tsp.2008.2006586","title":"Resource-Scalable Joint Source-Channel MAP and MMSE Estimation of Multiple Descriptions","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Viterbi algorithm; Decoding methods; Minimum mean square error; Algorithm; Maximum a posteriori estimation; Scalability; Encoder; Theoretical computer science; Estimator; Mathematics; Maximum likelihood","score_opus":0.030690729321300004,"score_gpt":0.22101615955133536,"score_spread":0.19032543023003534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151058202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058503374,0.00011902792,0.992935,0.00006053889,0.000013721179,0.000019389901,0.00004957239,0.00031555313,0.000636795],"genre_scores_gemma":[0.43252295,0.00032473812,0.56062526,0.00012108706,0.00008108046,0.0001400934,0.0005428925,0.00014398793,0.005497809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942374,0.00016484309,0.000030977528,0.00010883085,0.00021121024,0.000060365768],"domain_scores_gemma":[0.99801,0.0011989677,0.00016435987,0.00026478508,0.00031369124,0.00004823336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009562046,0.00090962916,0.0008612473,0.00062269915,0.00036771272,0.0010100218,0.0013615323,0.00082393,0.001721237],"category_scores_gemma":[0.0052955314,0.0005495533,0.00046931702,0.00071504264,0.00064600504,0.0018986126,0.0016878367,0.0010972625,0.0005881094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031650165,0.00007241718,0.0007904392,0.00013858869,0.00008444428,0.000166957,0.00017670772,0.7012532,0.008661186,0.035455726,0.0025121137,0.25037172],"study_design_scores_gemma":[0.0000057005545,0.00001774899,0.000062807456,0.0000039137212,0.000005455274,0.000026751119,0.000009546823,0.9926375,0.002417585,0.0043965024,0.0004089234,0.0000076199312],"about_ca_topic_score_codex":0.003722285,"about_ca_topic_score_gemma":0.0040453007,"teacher_disagreement_score":0.003722285,"about_ca_system_score_codex":0.0005903609,"about_ca_system_score_gemma":0.0015896464,"threshold_uncertainty_score":0.007401228},"labels":[],"label_agreement":null},{"id":"W2152670243","doi":"10.1109/tsp.2007.907883","title":"An EM Algorithm for Nonlinear State Estimation With Model Uncertainties","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":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Extended Kalman filter; Particle filter; Expectation–maximization algorithm; State vector; Kalman filter; Estimation theory; Algorithm; Ensemble Kalman filter; Mathematics; Nonlinear system; A priori and a posteriori; Markov chain Monte Carlo; Mathematical optimization; Monte Carlo method; Computer science; Statistics","score_opus":0.02664566972613973,"score_gpt":0.2653166356978732,"score_spread":0.23867096597173348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152670243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034813042,0.00016458669,0.998607,0.000047172194,0.000021403323,0.000013877662,0.000024345281,0.00021782205,0.00055562763],"genre_scores_gemma":[0.051456925,0.0007812248,0.94181293,0.00012220854,0.00011304793,0.00030132313,0.00044596256,0.00018691513,0.0047795847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993124,0.00023340284,0.000045238576,0.00018143763,0.00018873655,0.000038792296],"domain_scores_gemma":[0.99929476,0.0004248073,0.00005635352,0.000063290696,0.00014469697,0.000016088516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012640505,0.0013976836,0.0013205884,0.000837153,0.0006109428,0.0009539706,0.0017194885,0.0016156136,0.0037278594],"category_scores_gemma":[0.0036370147,0.0007909438,0.0010604499,0.0012952515,0.0007583578,0.0016585309,0.0016404486,0.0024065513,0.0018073035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008611389,0.000042313048,0.00047003425,0.00019034528,0.00011141426,0.00013085695,0.00010712794,0.66625327,0.0022848044,0.0545126,0.0060456507,0.26976547],"study_design_scores_gemma":[0.000013353194,0.000016204509,0.00008691853,0.000016832324,0.000009135627,0.000051309922,0.000009078626,0.98018986,0.00071957323,0.013719662,0.005154217,0.000013837642],"about_ca_topic_score_codex":0.004363631,"about_ca_topic_score_gemma":0.003604699,"teacher_disagreement_score":0.004363631,"about_ca_system_score_codex":0.0006777185,"about_ca_system_score_gemma":0.0014149966,"threshold_uncertainty_score":0.012470901},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04704478796659195,"score_gpt":0.316986536329407,"score_spread":0.26994174836281504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153184506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017684797,0.00014457833,0.99753404,0.00016300287,0.000010079145,0.0000067990254,0.000014495211,0.000022894099,0.0003356223],"genre_scores_gemma":[0.38009283,0.0012332718,0.613244,0.0002922954,0.00030993315,0.00017193536,0.00017635328,0.00014038228,0.0043391013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983791,0.0009467803,0.00005989459,0.00020099817,0.00031619432,0.000096978045],"domain_scores_gemma":[0.99485236,0.00448048,0.00019987047,0.00017261982,0.00023104351,0.000063741376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040196977,0.0007108434,0.00106337,0.0007737081,0.00050524296,0.0010113482,0.0016217652,0.0012044184,0.0012914448],"category_scores_gemma":[0.010343468,0.0007966024,0.00096869137,0.0008188955,0.0021199833,0.0018167772,0.0015142146,0.0017087009,0.00019485383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057593825,0.000032803706,0.00066115806,0.00012746628,0.0001148273,0.000081607905,0.00012610541,0.67506593,0.0015958287,0.28306514,0.0007246168,0.038347006],"study_design_scores_gemma":[0.0000069146345,0.00001287049,0.00008905657,0.0000070052224,0.000006701127,0.00001720776,0.000005162476,0.94861025,0.00034111,0.050445136,0.00044950988,0.000009077457],"about_ca_topic_score_codex":0.004662978,"about_ca_topic_score_gemma":0.0036447016,"teacher_disagreement_score":0.004662978,"about_ca_system_score_codex":0.0012184294,"about_ca_system_score_gemma":0.0016704656,"threshold_uncertainty_score":0.021258414},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01365143437247462,"score_gpt":0.23140480291160861,"score_spread":0.217753368539134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153290280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015153766,0.000093392,0.9973341,0.00005329574,0.000018375635,0.000014218453,0.00002108566,0.00042107078,0.0005290806],"genre_scores_gemma":[0.08840895,0.00025028657,0.90622044,0.00008717221,0.000059551196,0.00008659766,0.0002170543,0.00023776403,0.0044322866],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931324,0.00020062063,0.000035464032,0.00013281008,0.00025578338,0.00006206041],"domain_scores_gemma":[0.9990933,0.00036246717,0.000073639705,0.00019179868,0.0002529807,0.000025842031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006720777,0.0007015046,0.000954402,0.00043663458,0.0003044298,0.00088700047,0.0012597266,0.0011025103,0.0032197682],"category_scores_gemma":[0.0031749273,0.0003844284,0.0005815771,0.00062417245,0.00057530164,0.001178191,0.000960481,0.0012577171,0.0030355123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014353915,0.00009886088,0.0008183257,0.00016711526,0.000099908095,0.00012649926,0.00011837041,0.4201665,0.015744315,0.045418154,0.0075378963,0.5095605],"study_design_scores_gemma":[0.000011008294,0.000021000993,0.00010418255,0.000004742711,0.000007949419,0.00005777667,0.000006283257,0.98821867,0.00265091,0.0047941273,0.0041125044,0.000010830104],"about_ca_topic_score_codex":0.0024186864,"about_ca_topic_score_gemma":0.002894219,"teacher_disagreement_score":0.0032197682,"about_ca_system_score_codex":0.00037757005,"about_ca_system_score_gemma":0.0010150379,"threshold_uncertainty_score":0.010771155},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02117742417983207,"score_gpt":0.2502864510795929,"score_spread":0.22910902689976084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154354807","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055835495,0.00007895641,0.9988512,0.000032122574,0.000008017796,0.0000064887067,0.000008646078,0.00006796466,0.00038821533],"genre_scores_gemma":[0.1737809,0.001268777,0.81978476,0.00022572055,0.00017938421,0.00024426306,0.00030082025,0.00016094149,0.0040545026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861133,0.00043778567,0.00008077927,0.00027806952,0.0005042704,0.00008764753],"domain_scores_gemma":[0.99894243,0.00056560664,0.00015977595,0.00013297937,0.00017428791,0.000024835586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011043525,0.0014575169,0.0011097821,0.0005690489,0.00026581812,0.0009770623,0.001230534,0.0010146154,0.0018576249],"category_scores_gemma":[0.0035830678,0.00062015245,0.0008934001,0.0010498106,0.0010336698,0.0021070915,0.0013616865,0.0014705181,0.0009116721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022933325,0.00005613767,0.00032320284,0.00036411916,0.00014511182,0.00014928031,0.00013492593,0.5585689,0.06782218,0.09444732,0.0037369425,0.27402255],"study_design_scores_gemma":[0.000020993622,0.00009180444,0.00012647983,0.000025354366,0.000025562851,0.00016359513,0.000014619825,0.9655347,0.012169725,0.018459488,0.0033271697,0.00004052559],"about_ca_topic_score_codex":0.0008338046,"about_ca_topic_score_gemma":0.0006538732,"teacher_disagreement_score":0.0018576249,"about_ca_system_score_codex":0.0004287425,"about_ca_system_score_gemma":0.0008534343,"threshold_uncertainty_score":0.00621444},"labels":[],"label_agreement":null},{"id":"W2155193865","doi":"10.1109/tsp.2008.2008563","title":"Precoder Design for Space-Time Coded Systems Over Correlated Rayleigh Fading Channels Using Convex Optimization","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Precoding; Transmitter; Mathematics; Algorithm; Convex optimization; Rayleigh fading; Channel state information; Minification; Fading; Convexity; Upper and lower bounds; Computer science; Computational complexity theory; Mathematical optimization; Wireless; Control theory (sociology); Channel (broadcasting); MIMO; Regular polygon; Telecommunications; Decoding methods","score_opus":0.04465839409575767,"score_gpt":0.26147300570510157,"score_spread":0.2168146116093439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155193865","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043597543,0.00013422318,0.99449676,0.000055294557,0.00001356673,0.000023162938,0.000030590014,0.000059088197,0.00082762126],"genre_scores_gemma":[0.4910538,0.0012739415,0.5026589,0.00019314545,0.000106849526,0.00044800102,0.00032569634,0.00007291948,0.003866757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928963,0.00028333388,0.00003156193,0.00007841643,0.00024405864,0.00007288013],"domain_scores_gemma":[0.9989687,0.0006171397,0.000112363974,0.00007632116,0.00020269773,0.00002273802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010208188,0.0012227171,0.0009253681,0.00035379274,0.00029276707,0.0009920837,0.0005431062,0.0007612515,0.001105576],"category_scores_gemma":[0.0028552779,0.00039424133,0.00041177607,0.0007235183,0.0006950668,0.00069625257,0.0006569339,0.0009841055,0.00042412625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005745485,0.00003236015,0.00020647749,0.00010485867,0.00004129672,0.00007659825,0.000078091434,0.9064142,0.005432668,0.028422877,0.0013788178,0.057754286],"study_design_scores_gemma":[0.000014222561,0.000040969044,0.000056204717,0.000009852628,0.000006645845,0.00003397172,0.00000989322,0.9939243,0.0012767595,0.004053969,0.0005664055,0.000006762745],"about_ca_topic_score_codex":0.0019312918,"about_ca_topic_score_gemma":0.002848525,"teacher_disagreement_score":0.0019312918,"about_ca_system_score_codex":0.00058475917,"about_ca_system_score_gemma":0.0015032042,"threshold_uncertainty_score":0.0053986907},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015599099106712082,"score_gpt":0.2656172499997385,"score_spread":0.2500181508930264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155835781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016925753,0.00027804106,0.9976915,0.000036376045,0.0000075778735,0.0000053614517,0.000009540291,0.00006832938,0.00021077461],"genre_scores_gemma":[0.16092964,0.0017674271,0.8338928,0.000115757306,0.0001646155,0.0001946952,0.00021307764,0.000115859795,0.0026061633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989743,0.00055183086,0.000037931466,0.0001027127,0.00028991525,0.000043292333],"domain_scores_gemma":[0.99653107,0.002824336,0.00020972609,0.00014631399,0.00026067,0.000027992932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014858844,0.0010880381,0.0010589688,0.0006513166,0.00023511924,0.0010298971,0.0009803267,0.0014110054,0.000873069],"category_scores_gemma":[0.011377123,0.0005927204,0.0003837327,0.0013591897,0.0009143301,0.0015138304,0.0011216732,0.0010260219,0.0007141563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007276304,0.000021047143,0.00036486733,0.00017188446,0.000046438137,0.00008429487,0.00009529431,0.87881565,0.0045171347,0.04215809,0.00073882786,0.07291366],"study_design_scores_gemma":[0.000006380595,0.0000154423,0.000072952505,0.000006164511,0.000004853203,0.000027878541,0.0000071605664,0.9856243,0.00078860496,0.012841814,0.00059838255,0.0000060803286],"about_ca_topic_score_codex":0.00066404656,"about_ca_topic_score_gemma":0.00064753,"teacher_disagreement_score":0.0014858844,"about_ca_system_score_codex":0.00037711608,"about_ca_system_score_gemma":0.00045495795,"threshold_uncertainty_score":0.007858217},"labels":[],"label_agreement":null},{"id":"W2158835216","doi":"10.1109/tsp.2007.893977","title":"Information Theoretic Enumeration and Tracking of Multiple Sources","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Clutter; Computer science; Algorithm; Tracking (education); A priori and a posteriori; Noise (video); Wideband; Artificial intelligence; Radar; Electronic engineering; Telecommunications","score_opus":0.013194962004283339,"score_gpt":0.2555405531673103,"score_spread":0.24234559116302695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158835216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009631647,0.0002861263,0.9872838,0.00016645348,0.000017720817,0.000011558966,0.000054288197,0.00006592149,0.0024825102],"genre_scores_gemma":[0.47745916,0.0013826546,0.51037455,0.00015756603,0.00015706943,0.00035109365,0.00077160983,0.00014132669,0.009204969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987122,0.00054546626,0.000066991546,0.00014351284,0.00044713856,0.000084661595],"domain_scores_gemma":[0.99436295,0.00411795,0.00037889055,0.00046078447,0.0005575338,0.00012203304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015434546,0.00060829066,0.0009288347,0.0014690302,0.00045603173,0.0015995413,0.0010852634,0.00091482064,0.001388058],"category_scores_gemma":[0.010977113,0.0005751744,0.0005059827,0.0018951794,0.0011281343,0.002912915,0.0018465029,0.0012839265,0.00040907017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006934906,0.000029994042,0.0004985638,0.00013415617,0.000031291267,0.00008886653,0.000103201965,0.512019,0.0018283672,0.3943094,0.0016316299,0.08925615],"study_design_scores_gemma":[0.0000055521145,0.000014355796,0.000072967494,0.000010803655,0.0000036601432,0.000032217387,0.000010370252,0.84655255,0.0005532909,0.1516453,0.0010910983,0.000007809996],"about_ca_topic_score_codex":0.0006390419,"about_ca_topic_score_gemma":0.00056944776,"teacher_disagreement_score":0.0015995413,"about_ca_system_score_codex":0.0009498622,"about_ca_system_score_gemma":0.0009447347,"threshold_uncertainty_score":0.008162618},"labels":[],"label_agreement":null},{"id":"W2160378521","doi":"10.1109/tsp.2010.2046636","title":"Adaptive Relaying in Noncoherent Cooperative Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Relay; Computer science; Cooperative diversity; Frequency-shift keying; Channel (broadcasting); Power (physics); Algorithm; Control theory (sociology); Mathematics; Computer network; Fading; Demodulation; Artificial intelligence","score_opus":0.035249549404815374,"score_gpt":0.27979846033082606,"score_spread":0.2445489109260107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160378521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1350029,0.0021374843,0.8588455,0.00023291462,0.000043236552,0.000043898086,0.000031131665,0.00008171762,0.0035812997],"genre_scores_gemma":[0.960812,0.0010459995,0.036243122,0.00006725611,0.00005250894,0.00004613315,0.000020089105,0.000007710631,0.0017052395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993395,0.0003348972,0.000021325348,0.0001013382,0.00014737087,0.000055571025],"domain_scores_gemma":[0.9988984,0.00075779436,0.00012366747,0.00007326616,0.00012410818,0.000022723609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095167477,0.0005135537,0.0004092861,0.00033126315,0.00034795434,0.00062098517,0.0007046732,0.000726256,0.00044236876],"category_scores_gemma":[0.0021609026,0.00022344918,0.00022667523,0.0005245756,0.0006471194,0.0010318672,0.0006006878,0.00031364604,0.000115764255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012940471,0.000064272244,0.0012523108,0.0001733305,0.00005520356,0.0005216253,0.000254493,0.8661135,0.0143860355,0.06638056,0.0004931251,0.050176155],"study_design_scores_gemma":[0.000014928635,0.0000966914,0.00031625346,0.0000073165984,0.000016989987,0.00010315888,0.000033030035,0.9806892,0.0016759892,0.016312543,0.00072341104,0.000010368927],"about_ca_topic_score_codex":0.0010371257,"about_ca_topic_score_gemma":0.0010200118,"teacher_disagreement_score":0.0010371257,"about_ca_system_score_codex":0.00057401316,"about_ca_system_score_gemma":0.00030157887,"threshold_uncertainty_score":0.005033016},"labels":[],"label_agreement":null},{"id":"W2160474818","doi":"10.1109/tsp.2009.2021638","title":"Optimal Precoder Design for Correlated MIMO Communication Systems Using Zero-Forcing Decision Feedback Equalization","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Transmitter; MIMO; Fading; Channel state information; Computer science; Precoding; Equalization (audio); Wireless; Channel (broadcasting); Control theory (sociology); Algorithm; Mathematics; Telecommunications; Artificial intelligence","score_opus":0.03965675741584357,"score_gpt":0.28071598437336515,"score_spread":0.24105922695752158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160474818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01046701,0.00024225465,0.9877537,0.00012639452,0.000026603133,0.000028295266,0.000036023914,0.000068364054,0.0012512825],"genre_scores_gemma":[0.6508814,0.0011678899,0.34350577,0.00025763165,0.0001500259,0.00022246344,0.00018761521,0.000044324657,0.0035827367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991278,0.00029912475,0.000044883884,0.00018528849,0.00023782485,0.000105009975],"domain_scores_gemma":[0.9990662,0.0005477326,0.00012841994,0.000062625935,0.00016812797,0.000026908787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093931716,0.00095881644,0.00090581493,0.00035374553,0.0003406407,0.000993904,0.0006111789,0.0010729561,0.0011943397],"category_scores_gemma":[0.0025493987,0.0005845822,0.00046900174,0.0005028754,0.0008738667,0.00085753406,0.00062981294,0.00068235653,0.00037350354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013555854,0.00007150597,0.00057096645,0.00023608464,0.000098088916,0.00016664082,0.00016104702,0.88844275,0.015774062,0.033928487,0.0011098232,0.059304968],"study_design_scores_gemma":[0.000038880575,0.00010379046,0.00016675882,0.000020760112,0.000025657791,0.00003966479,0.000016437907,0.9872873,0.0033814358,0.008015828,0.00088697264,0.000016506903],"about_ca_topic_score_codex":0.0016729549,"about_ca_topic_score_gemma":0.0023198526,"teacher_disagreement_score":0.0016729549,"about_ca_system_score_codex":0.00050916185,"about_ca_system_score_gemma":0.0013972285,"threshold_uncertainty_score":0.0049676895},"labels":[],"label_agreement":null},{"id":"W2160835330","doi":"10.1109/tsp.2005.845490","title":"Estimate of aliasing error for non-smooth signals prefiltered by quasi-projections into shift-invariant spaces","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Lambda; Mathematics; Aliasing; Invariant (physics); Low-pass filter; Algorithm; Mathematical analysis; Filter (signal processing); Computer science; Physics; Computer vision","score_opus":0.040863248561741644,"score_gpt":0.32201513636061313,"score_spread":0.28115188779887146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160835330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10753984,0.000389979,0.8908073,0.00007426904,0.000036598834,0.00001529489,0.000069922244,0.00029613168,0.00077083375],"genre_scores_gemma":[0.6616382,0.00045856452,0.33515114,0.000044587756,0.000040222065,0.000037812708,0.00026011022,0.00018608643,0.002183283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918455,0.00018811405,0.00005701238,0.0001179163,0.00040291811,0.000049416954],"domain_scores_gemma":[0.99163425,0.0053683026,0.00064650975,0.0007725882,0.0014301643,0.00014822712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019069649,0.00073786406,0.00041770443,0.0009183213,0.00023120028,0.00083847786,0.0006144643,0.00090771663,0.001017856],"category_scores_gemma":[0.014588705,0.00021451538,0.00032189593,0.0005014885,0.0007079408,0.0015635525,0.00068680703,0.0010465657,0.00040852907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025327941,0.00015413454,0.0109264385,0.0005788273,0.00025386777,0.00047790317,0.0005159432,0.36090925,0.27341163,0.058363784,0.0011239441,0.29075152],"study_design_scores_gemma":[0.000011806402,0.00023636503,0.004231908,0.000026033762,0.000024224146,0.00028925962,0.000047412475,0.8901956,0.09755666,0.006250922,0.0010830517,0.000046692105],"about_ca_topic_score_codex":0.0008578173,"about_ca_topic_score_gemma":0.0006127023,"teacher_disagreement_score":0.0019069649,"about_ca_system_score_codex":0.0006466407,"about_ca_system_score_gemma":0.00036147633,"threshold_uncertainty_score":0.010085106},"labels":[],"label_agreement":null},{"id":"W2161887073","doi":"10.1109/tsp.2007.909223","title":"A Two-Stage Approach to Estimate the Angles of Arrival and the Angular Spreads of Locally Scattered Sources","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Estimator; Algorithm; Channel (broadcasting); Angle of arrival; Direction of arrival; Covariance; Computer science; Preprocessor; Mathematics; Statistics; Telecommunications","score_opus":0.022200631189151578,"score_gpt":0.28254859265716037,"score_spread":0.2603479614680088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161887073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026435212,0.00007163803,0.996716,0.000021467851,0.000012373509,0.00002410861,0.00002318383,0.00013699278,0.0003508239],"genre_scores_gemma":[0.10047465,0.00029445346,0.89421153,0.00006573774,0.0001039583,0.0001922015,0.00026844497,0.00007849535,0.004310598],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934524,0.00009624778,0.000044427237,0.00019293951,0.00025534286,0.00006581713],"domain_scores_gemma":[0.999385,0.00018860235,0.00007698102,0.00013500416,0.00018274876,0.000031666008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006261978,0.0010591223,0.0010951171,0.0009686674,0.00030144377,0.00091825397,0.001381045,0.0009051735,0.0020189264],"category_scores_gemma":[0.0016430198,0.0007968818,0.00109251,0.000810126,0.0004839796,0.0014068767,0.0017741227,0.0012509682,0.0010009201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033096783,0.00020900054,0.0026901467,0.00036065746,0.00020161971,0.00025118073,0.0003374145,0.2590144,0.1651452,0.019666528,0.001708943,0.55008394],"study_design_scores_gemma":[0.000034212833,0.00019892394,0.0015425332,0.00001774385,0.00005248933,0.00023378714,0.000042589523,0.96667784,0.022431342,0.0052854237,0.0034159042,0.000067222325],"about_ca_topic_score_codex":0.0017698448,"about_ca_topic_score_gemma":0.0032326963,"teacher_disagreement_score":0.0020189264,"about_ca_system_score_codex":0.00035114106,"about_ca_system_score_gemma":0.0011404939,"threshold_uncertainty_score":0.006753981},"labels":[],"label_agreement":null},{"id":"W2161950100","doi":"10.1109/tsp.2010.2091411","title":"Segmented Compressed Sampling for Analog-to-Information Conversion: Method and Performance Analysis","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Sampling (signal processing); Compressed sensing; Signal processing; Artificial intelligence; Computer vision; Telecommunications","score_opus":0.019403708358905453,"score_gpt":0.2706925824291812,"score_spread":0.2512888740702758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161950100","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037602633,0.00031083846,0.99486864,0.00009090122,0.000024824625,0.00003519942,0.000019378607,0.00012349992,0.0007664531],"genre_scores_gemma":[0.28069007,0.0011583514,0.71570176,0.00014934607,0.00016527085,0.00023966428,0.00019485908,0.000075332915,0.0016253664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988751,0.00030103835,0.00003603691,0.0000859189,0.0006554603,0.000046313497],"domain_scores_gemma":[0.9979532,0.0011694478,0.00014147998,0.0002595689,0.00043158318,0.000044736473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012289006,0.00077807007,0.0004775337,0.00078404706,0.00027665094,0.00068771484,0.00079691486,0.0007459625,0.0016864744],"category_scores_gemma":[0.004220459,0.00022984306,0.0003651269,0.0009592336,0.00084293744,0.0010662052,0.0008197199,0.0009129186,0.0004312515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008219825,0.00015621584,0.0017752826,0.0007564136,0.00019327334,0.0003819906,0.00033463308,0.31115648,0.09010965,0.1328404,0.0044073127,0.4570664],"study_design_scores_gemma":[0.000018123648,0.000093461254,0.0002530368,0.000018744984,0.000017512182,0.00027458317,0.000013814093,0.9782839,0.014909622,0.003989266,0.0021069022,0.000021154972],"about_ca_topic_score_codex":0.0017173543,"about_ca_topic_score_gemma":0.0012727112,"teacher_disagreement_score":0.0017173543,"about_ca_system_score_codex":0.00069323374,"about_ca_system_score_gemma":0.00087985385,"threshold_uncertainty_score":0.0064991117},"labels":[],"label_agreement":null},{"id":"W2162128351","doi":"10.1109/tsp.2006.890903","title":"A Novel Signaling Scheme for Blind Unique Identification of Alamouti Space-Time Block-Coded Channel","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Algorithm; Space–time block code; Block code; Block (permutation group theory); Coprime integers; Channel (broadcasting); Mathematics; Noise (video); Relaxation (psychology); Gaussian noise; Computer science; Decoding methods; Telecommunications; Artificial intelligence; Combinatorics","score_opus":0.025513984471502684,"score_gpt":0.28017983147760944,"score_spread":0.2546658470061068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162128351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008749018,0.00008395567,0.98929626,0.000110789355,0.00006838552,0.000084569605,0.00005231547,0.0002690432,0.001285551],"genre_scores_gemma":[0.23327696,0.00013410093,0.76265156,0.00029311827,0.00009519288,0.0002691901,0.00019153956,0.000030262723,0.003058023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823606,0.0006184539,0.00012767583,0.00028985465,0.0005566677,0.00017121548],"domain_scores_gemma":[0.9984226,0.00042742497,0.00024159692,0.00046875293,0.00034345675,0.000096099146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001474826,0.0008629378,0.00081926514,0.00074030133,0.0010738259,0.00079238956,0.0014183876,0.0014235236,0.0018002146],"category_scores_gemma":[0.0029550383,0.0003564211,0.0005353007,0.00066618976,0.0010260968,0.0019683149,0.001866529,0.001341756,0.0008041522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092871225,0.00030795272,0.00063083175,0.0003335633,0.000100857884,0.00034724714,0.00061738415,0.077629045,0.18757775,0.30891153,0.004761843,0.41785327],"study_design_scores_gemma":[0.00021942225,0.00050546136,0.0002480641,0.00005431144,0.00005763548,0.0007561579,0.00009782299,0.85601974,0.07460092,0.058023375,0.0092429,0.000174308],"about_ca_topic_score_codex":0.0004828817,"about_ca_topic_score_gemma":0.0006680593,"teacher_disagreement_score":0.0018002146,"about_ca_system_score_codex":0.0005006121,"about_ca_system_score_gemma":0.0015951102,"threshold_uncertainty_score":0.0077997446},"labels":[],"label_agreement":null},{"id":"W2162541108","doi":"10.1109/tsp.2013.2263501","title":"Sum-Rate Maximization With Minimum Power Consumption for MIMO DF Two-Way Relaying— Part II: Network Optimization","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; MIMO; Computer science; Maximization; Mathematical optimization; Power (physics); Optimization problem; Regular polygon; Mathematics; Beamforming; Telecommunications","score_opus":0.036023700090631855,"score_gpt":0.263275674031382,"score_spread":0.22725197394075017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162541108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009688532,0.0011663832,0.9782833,0.00038071902,0.000051299325,0.000053220243,0.00008568339,0.00005743515,0.010233452],"genre_scores_gemma":[0.742457,0.0054518124,0.2395036,0.00042742718,0.0003094855,0.0005914876,0.00030048002,0.00018814448,0.010770527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919635,0.00034224344,0.000030849504,0.0001225916,0.00021870037,0.000089260044],"domain_scores_gemma":[0.999041,0.0006893457,0.000088233595,0.000042369476,0.000121276775,0.000017782493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012799255,0.0018076521,0.0012240292,0.00064757443,0.0004680855,0.0021201759,0.0009063308,0.0013838862,0.0019792693],"category_scores_gemma":[0.002735948,0.0006582638,0.00074175186,0.0013770078,0.00096584694,0.0016680364,0.0011859658,0.0012331406,0.00050402235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056543886,0.00005878714,0.00025858253,0.00029858504,0.000056723624,0.0001701262,0.00009237057,0.9044172,0.005248683,0.066245966,0.0021735902,0.020922896],"study_design_scores_gemma":[0.000013461687,0.00005598487,0.00016774483,0.000024161556,0.000018247982,0.00010432831,0.000028348466,0.97477573,0.0015991067,0.021840664,0.001357563,0.000014620343],"about_ca_topic_score_codex":0.0012934764,"about_ca_topic_score_gemma":0.0010493072,"teacher_disagreement_score":0.0021201759,"about_ca_system_score_codex":0.0016479415,"about_ca_system_score_gemma":0.0010554248,"threshold_uncertainty_score":0.011956632},"labels":[],"label_agreement":null},{"id":"W2163293561","doi":"10.1109/tsp.2010.2046900","title":"Minimizing Nonconvex Functions for Sparse Vector Reconstruction","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Underdetermined system; Orthant; Algorithm; Iterative method; Mathematics; Convex function; Convergence (economics); Mathematical optimization; Computer science; Function (biology); Regular polygon; Applied mathematics","score_opus":0.0202084291336054,"score_gpt":0.23537793495599832,"score_spread":0.21516950582239291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163293561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010202731,0.00008634395,0.9985556,0.00004720257,0.0000072233497,0.000008648195,0.00000704091,0.0000451403,0.00022247797],"genre_scores_gemma":[0.091215394,0.0010059973,0.90261316,0.00018723651,0.0001437299,0.00018954824,0.0002670699,0.00025360365,0.0041242624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987508,0.00046787225,0.000053574815,0.00023261453,0.00041725923,0.00007777907],"domain_scores_gemma":[0.9983493,0.0008696926,0.00020445389,0.00018414657,0.00034320788,0.000049147377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026561022,0.0017888492,0.0013720172,0.0012032293,0.0004436099,0.0010616053,0.0012460379,0.0013486885,0.0013521622],"category_scores_gemma":[0.0044595837,0.0006571919,0.0009851411,0.0009306711,0.001552561,0.0016694567,0.0013880116,0.0017035827,0.0008357267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071206596,0.000058660153,0.0004217745,0.00028677026,0.00008575412,0.000117889664,0.00015378365,0.7875812,0.0130831525,0.07658122,0.0020278296,0.11953067],"study_design_scores_gemma":[0.0000042814486,0.000032544856,0.000066116525,0.000010750778,0.0000075201406,0.000034208024,0.000010879787,0.98772615,0.0030133727,0.0074120187,0.0016729714,0.0000091630445],"about_ca_topic_score_codex":0.0019575702,"about_ca_topic_score_gemma":0.0019067453,"teacher_disagreement_score":0.0026561022,"about_ca_system_score_codex":0.00097122166,"about_ca_system_score_gemma":0.0012114893,"threshold_uncertainty_score":0.014046967},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06548811704567381,"score_gpt":0.29228271950254886,"score_spread":0.22679460245687505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163708326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014908264,0.00032185717,0.9829421,0.00012036698,0.000015456379,0.000038806593,0.000030301739,0.00007255816,0.0015502386],"genre_scores_gemma":[0.8027231,0.00097340683,0.19259933,0.00017085491,0.000080670674,0.00025972186,0.00008789021,0.000026842912,0.0030782653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990615,0.00037841644,0.000035785182,0.00015491068,0.00031005268,0.000059393275],"domain_scores_gemma":[0.9985922,0.00079662737,0.00014551809,0.00014014932,0.00029479005,0.000030736614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011444679,0.00068685936,0.0006270112,0.0002913648,0.00034243998,0.0007971605,0.0008518659,0.0010772543,0.0009891745],"category_scores_gemma":[0.0034404134,0.0003568473,0.00025358712,0.00043517898,0.0008247262,0.0010919231,0.0007989987,0.0006452408,0.000388778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018375822,0.000056618654,0.0012927162,0.00027270237,0.00010361518,0.00048860867,0.00032550233,0.76673174,0.028536705,0.10818178,0.0011025126,0.09272376],"study_design_scores_gemma":[0.000019621148,0.00009746498,0.00026362416,0.000016177315,0.000028242679,0.0003963749,0.000030981413,0.97173023,0.007733305,0.018393917,0.0012663968,0.000023712013],"about_ca_topic_score_codex":0.0009501437,"about_ca_topic_score_gemma":0.0010004686,"teacher_disagreement_score":0.0011444679,"about_ca_system_score_codex":0.00062519533,"about_ca_system_score_gemma":0.0009703846,"threshold_uncertainty_score":0.0060526133},"labels":[],"label_agreement":null},{"id":"W2165224060","doi":"10.1109/tsp.2007.906764","title":"Design and Analysis of Supervised and Decision-Directed Estimators of the MMSE/LCMV Filter in Data Limited Environments","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Estimator; Minimum mean square error; Fading; Computer science; Algorithm; Filter (signal processing); Multipath propagation; Context (archaeology); Minimum-variance unbiased estimator; Upper and lower bounds; Mean squared error; Control theory (sociology); Filter design; Mathematics; Adaptive filter; Statistics; Artificial intelligence; Decoding methods","score_opus":0.050381240299691786,"score_gpt":0.2750907678134825,"score_spread":0.22470952751379072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165224060","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010539556,0.000076043485,0.9888749,0.000036273697,0.000004733949,0.000016904765,0.000013593896,0.00006606124,0.0003719627],"genre_scores_gemma":[0.6855703,0.0003134813,0.3121646,0.00009909714,0.000044103865,0.0002039,0.00010869512,0.000049565802,0.0014461178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988907,0.00041655023,0.000048912298,0.00023016531,0.00031761633,0.00009610048],"domain_scores_gemma":[0.99285513,0.004799904,0.0007942456,0.0003993547,0.0010286412,0.0001226817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022125589,0.00070077524,0.00074274174,0.00036679127,0.00027300627,0.0008718806,0.0010914286,0.0012682641,0.00082474103],"category_scores_gemma":[0.014443942,0.000542226,0.00036213407,0.00034811505,0.0009947864,0.001148769,0.000759435,0.00061301305,0.000325282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044128805,0.00010387293,0.0027944467,0.0002431728,0.00014601498,0.00011514618,0.00020293605,0.81792724,0.021216841,0.036525697,0.0005229529,0.11976045],"study_design_scores_gemma":[0.000019183764,0.00010418823,0.0003179097,0.000012416648,0.000017220469,0.000043522963,0.000011689239,0.99061275,0.0053931014,0.0031773343,0.00027915314,0.000011445102],"about_ca_topic_score_codex":0.0014939066,"about_ca_topic_score_gemma":0.0017674841,"teacher_disagreement_score":0.0022125589,"about_ca_system_score_codex":0.00071587344,"about_ca_system_score_gemma":0.0013813154,"threshold_uncertainty_score":0.011701226},"labels":[],"label_agreement":null},{"id":"W2166317606","doi":"10.1109/tsp.2008.917354","title":"A Semiblind Channel Estimation Approach for MIMO–OFDM Systems","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Weighting; MIMO; MIMO-OFDM; Constraint (computer-aided design); Channel (broadcasting); Computer science; Algorithm; Mean squared error; Closed-form expression; Control theory (sociology); Mathematical optimization; Mathematics; Statistics; Telecommunications; Artificial intelligence","score_opus":0.05139883940876321,"score_gpt":0.2812029615370891,"score_spread":0.2298041221283259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166317606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001313748,0.00007568841,0.99803203,0.000032906635,0.000017020953,0.0000101325795,0.000010291074,0.000095241034,0.00041304668],"genre_scores_gemma":[0.24551053,0.0005468989,0.74938387,0.00018276564,0.00016744333,0.000123231,0.00012695085,0.00009398679,0.003864471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990151,0.00034812957,0.000044418197,0.00013683856,0.00039947336,0.000056008026],"domain_scores_gemma":[0.99880075,0.0005668939,0.0001373762,0.00017179102,0.00028566286,0.00003751905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007806903,0.0007058272,0.0007313288,0.00047503237,0.00046295716,0.0008679947,0.0007476417,0.00086200755,0.002086389],"category_scores_gemma":[0.0027142395,0.0003380666,0.0005209059,0.00041588864,0.00073550973,0.0013258645,0.0011262258,0.0010920485,0.0009049683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035479266,0.00016944592,0.0005843242,0.00043459493,0.00013135644,0.0001947918,0.0002504425,0.44387576,0.08769693,0.06641086,0.004257727,0.395639],"study_design_scores_gemma":[0.000012225646,0.00008093072,0.00014630947,0.000012083547,0.000011739351,0.0001327592,0.000013750685,0.9776793,0.011466897,0.007891984,0.0025212415,0.000030679366],"about_ca_topic_score_codex":0.000764881,"about_ca_topic_score_gemma":0.001040375,"teacher_disagreement_score":0.002086389,"about_ca_system_score_codex":0.00036830988,"about_ca_system_score_gemma":0.0009461553,"threshold_uncertainty_score":0.006979704},"labels":[],"label_agreement":null},{"id":"W2167639215","doi":"10.1109/tsp.2008.2011829","title":"Large-System-Based Performance Analysis and Design of Multiuser Cooperative Networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Relay; Computer science; Interference (communication); Signal-to-noise ratio (imaging); Noise (video); Channel (broadcasting); Code division multiple access; Computer network; Signal-to-interference-plus-noise ratio; Noise power; Relay channel; Channel state information; Multiuser detection; Power (physics); Telecommunications; Wireless; Artificial intelligence","score_opus":0.030638733691734713,"score_gpt":0.2673074275788639,"score_spread":0.2366686938871292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167639215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017963896,0.000452947,0.97590417,0.0001654095,0.000021506117,0.00004180644,0.000021575224,0.00015103511,0.005277685],"genre_scores_gemma":[0.94697315,0.00061977,0.050244313,0.00009238779,0.00005648899,0.00016198905,0.000049964347,0.00006062892,0.001741264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853563,0.0007707277,0.000029725605,0.00016670157,0.00039553188,0.00010160743],"domain_scores_gemma":[0.9977829,0.0014269459,0.00019392706,0.00014752518,0.00040585254,0.00004288407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025257824,0.001035693,0.00076535495,0.00041188716,0.00040286372,0.0011531009,0.0012145257,0.001014583,0.0013639755],"category_scores_gemma":[0.0073421006,0.00050742127,0.00034867553,0.0005099769,0.0010431708,0.0012129379,0.00103284,0.00083788246,0.00034236195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013039816,0.000010355331,0.00015876023,0.000034673165,0.000014374005,0.000036913054,0.000038076232,0.9819462,0.0013991421,0.010782114,0.00018211344,0.0053842035],"study_design_scores_gemma":[0.0000017714881,0.000011592065,0.00003517883,0.0000023791872,0.0000026056578,0.000008231373,0.000005140181,0.99683493,0.00022596504,0.0027212626,0.00014863293,0.0000023187292],"about_ca_topic_score_codex":0.0018948663,"about_ca_topic_score_gemma":0.0016531543,"teacher_disagreement_score":0.0025257824,"about_ca_system_score_codex":0.0014322925,"about_ca_system_score_gemma":0.0008889324,"threshold_uncertainty_score":0.0133577585},"labels":[],"label_agreement":null},{"id":"W2167692402","doi":"10.1109/tsp.2012.2189109","title":"Efficient Minimax Estimation of a Class of High-Dimensional Sparse Precision Matrices","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Estimator; Mathematics; Minimax; Mathematical optimization; Algorithm; Rate of convergence; Computer science; Applied mathematics; Statistics","score_opus":0.017750407350118253,"score_gpt":0.24693288956898543,"score_spread":0.22918248221886717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167692402","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00819603,0.00012389943,0.99110585,0.00014163206,0.000011087388,0.000015287746,0.00002843039,0.00007881749,0.00029886529],"genre_scores_gemma":[0.5266814,0.0012180848,0.46626425,0.000315118,0.00024217753,0.00031462102,0.0005871239,0.00015743005,0.004219774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983531,0.0005616622,0.00006696759,0.00040363445,0.0005095746,0.000104982006],"domain_scores_gemma":[0.9935762,0.0041454853,0.0009838927,0.0005803506,0.0005981607,0.00011587778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040969593,0.0009819154,0.0014765412,0.0009117294,0.00051260105,0.0015294317,0.0015469902,0.0016565078,0.0009168919],"category_scores_gemma":[0.021512492,0.0007069858,0.0006869828,0.0007646406,0.0019494365,0.0027159308,0.0019890394,0.0020160386,0.00033132444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018050575,0.000105163446,0.0027770326,0.0002934537,0.0001661559,0.00020693154,0.00016713695,0.6964576,0.012260692,0.15917674,0.002570504,0.12563802],"study_design_scores_gemma":[0.0000197295,0.000047858517,0.0005907329,0.000021735963,0.0000122075935,0.000084491374,0.000015980206,0.95159435,0.002289476,0.044631295,0.00067155727,0.000020524512],"about_ca_topic_score_codex":0.0008386177,"about_ca_topic_score_gemma":0.0007961011,"teacher_disagreement_score":0.0040969593,"about_ca_system_score_codex":0.0005471144,"about_ca_system_score_gemma":0.0014914868,"threshold_uncertainty_score":0.021667004},"labels":[],"label_agreement":null},{"id":"W2168085983","doi":"10.1109/tsp.2005.849192","title":"On spectral theory of cyclostationary signals in multirate systems","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cyclostationary process; Linear system; LTI system theory; Mathematics; Invariant (physics); Computer science; Algorithm; Signal processing; Transformation matrix; Control theory (sociology); Digital signal processing; Telecommunications; Artificial intelligence","score_opus":0.023741427771523334,"score_gpt":0.27828956852172093,"score_spread":0.2545481407501976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168085983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058807316,0.0026210982,0.97849476,0.0003681514,0.00018716662,0.000017395136,0.000038033548,0.000054008855,0.012338627],"genre_scores_gemma":[0.69255006,0.02258871,0.25869152,0.001110018,0.0028642435,0.00027546327,0.00034132908,0.00020019215,0.021378424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930966,0.0002051964,0.00003409187,0.00010212489,0.0002835623,0.00006542254],"domain_scores_gemma":[0.9987166,0.00079826673,0.00013734434,0.000099727244,0.00020992038,0.00003816483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010881086,0.0009276523,0.0006676933,0.0011326832,0.00042637548,0.0012410424,0.00069128023,0.00092119176,0.0030920517],"category_scores_gemma":[0.002922416,0.00030796172,0.0006637179,0.0011366237,0.0019348788,0.0022282328,0.0011075035,0.0018956991,0.0008808798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029798333,0.000018562827,0.00016892969,0.0001665405,0.000022152351,0.00015241337,0.00019722948,0.060960587,0.0032086663,0.9094869,0.0013263572,0.02426187],"study_design_scores_gemma":[0.000012533221,0.0000902249,0.0003042426,0.000102039885,0.000018923678,0.00024120972,0.000093248535,0.4404674,0.0015622954,0.5447581,0.012301221,0.00004867612],"about_ca_topic_score_codex":0.0008242673,"about_ca_topic_score_gemma":0.00043764364,"teacher_disagreement_score":0.0030920517,"about_ca_system_score_codex":0.0006811205,"about_ca_system_score_gemma":0.00038065345,"threshold_uncertainty_score":0.010343969},"labels":[],"label_agreement":null},{"id":"W2168404597","doi":"10.1109/tsp.2005.863032","title":"Combined source and channel coding with JPEG2000 and rate-compatible low-density Parity-check codes","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Algorithm; Low-density parity-check code; Computer science; Parity bit; Coding gain; Channel (broadcasting); Forward error correction; Decoding methods; Code rate; Bit error rate; Turbo code; Coding (social sciences); Viterbi decoder; Mathematics; Telecommunications; Statistics","score_opus":0.013394605727694029,"score_gpt":0.22823314156844732,"score_spread":0.2148385358407533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168404597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11946552,0.00093240134,0.8715252,0.00017853682,0.000104216415,0.000264064,0.00021053058,0.0016992124,0.0056203143],"genre_scores_gemma":[0.6480391,0.00047865516,0.34413114,0.00008832286,0.00007043641,0.00018402623,0.00037384257,0.00008484067,0.006549492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994704,0.00008524043,0.000022012977,0.00004726127,0.00033029562,0.000044774206],"domain_scores_gemma":[0.999323,0.00014364129,0.00007072271,0.00013019476,0.00029684132,0.000035529072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005955728,0.0005387684,0.00037732863,0.0009935986,0.00025367754,0.00046711936,0.0005982461,0.0004867922,0.0014733543],"category_scores_gemma":[0.0016080729,0.00020751514,0.00029041714,0.0009209356,0.00041534033,0.0005972699,0.0007338295,0.00057934964,0.00062074966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016262138,0.00028088447,0.0026395714,0.00041156707,0.00015382409,0.00048273845,0.00019471928,0.113291934,0.35920638,0.026801921,0.0041474425,0.49076277],"study_design_scores_gemma":[0.00018508981,0.0004286714,0.0016515655,0.00004976729,0.00009873669,0.0007948377,0.000039784492,0.6638751,0.32074755,0.004504323,0.0075514987,0.00007302221],"about_ca_topic_score_codex":0.0013954146,"about_ca_topic_score_gemma":0.002645514,"teacher_disagreement_score":0.0014733543,"about_ca_system_score_codex":0.00034284865,"about_ca_system_score_gemma":0.00067570346,"threshold_uncertainty_score":0.004928887},"labels":[],"label_agreement":null},{"id":"W2168673745","doi":"10.1109/tsp.2010.2077631","title":"Sidelobe Control in Collaborative Beamforming via Node Selection","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Beamforming; Selection (genetic algorithm); Computer science; Node (physics); Speech recognition; Artificial intelligence; Telecommunications; Engineering","score_opus":0.005077427243005984,"score_gpt":0.2232863009866042,"score_spread":0.21820887374359824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168673745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019892095,0.00024595158,0.9785968,0.00003883378,0.000013681482,0.000018140669,0.000009284374,0.00014680994,0.0010383498],"genre_scores_gemma":[0.6807709,0.00053055835,0.31637567,0.000082478364,0.000042037937,0.00014925888,0.000052684107,0.00003670361,0.001959799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993674,0.00020756006,0.00002268793,0.000111322785,0.00024413467,0.00004693428],"domain_scores_gemma":[0.9988877,0.0006855139,0.00015452449,0.000105359264,0.00014033461,0.000026505242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062779116,0.0005327988,0.00053347263,0.00032382988,0.00031940968,0.00036589737,0.00071145204,0.0004197485,0.0005626201],"category_scores_gemma":[0.0019449225,0.00027659477,0.00033544126,0.00062624103,0.0007505997,0.00071549765,0.00058415026,0.00042232225,0.00032325246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003560902,0.000062858904,0.001050079,0.000118825505,0.000055456072,0.0001776855,0.00018970577,0.69334716,0.10486223,0.016987555,0.0007629502,0.18202941],"study_design_scores_gemma":[0.000019418605,0.00013925346,0.00022848819,0.0000085255515,0.000011495908,0.00008958852,0.000012414403,0.9810517,0.013784242,0.0038136553,0.00082673033,0.0000144677215],"about_ca_topic_score_codex":0.0006026335,"about_ca_topic_score_gemma":0.0008498435,"teacher_disagreement_score":0.00071145204,"about_ca_system_score_codex":0.00029619987,"about_ca_system_score_gemma":0.00036519847,"threshold_uncertainty_score":0.003320098},"labels":[],"label_agreement":null},{"id":"W2169081015","doi":"10.1109/78.815500","title":"Matrix filter design using semi-infinite programming with application to DOA estimation","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; McMaster University","funders":"","keywords":"Stopband; Filter design; Passband; Elliptic filter; Convex optimization; Control theory (sociology); Filter (signal processing); Mathematics; Matrix (chemical analysis); Butterworth filter; Linear matrix inequality; Prototype filter; Computer science; Mathematical optimization; Algorithm; Electronic engineering; Band-pass filter; Regular polygon; Engineering","score_opus":0.02371013390922769,"score_gpt":0.2946813301141164,"score_spread":0.2709711962048887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169081015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041728333,0.000017800005,0.9993173,0.0000190719,0.0000036713682,0.000005989861,0.0000023456275,0.000023905945,0.00019272631],"genre_scores_gemma":[0.10603297,0.00030052743,0.89142805,0.00008782355,0.000039906074,0.00032447706,0.000045668923,0.000055924058,0.0016846361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999421,0.0002334026,0.000031494514,0.0000930948,0.00018863991,0.000032486445],"domain_scores_gemma":[0.99872965,0.00086810515,0.0001229275,0.00003666301,0.00021655315,0.000025993133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013937225,0.0009868084,0.00084620476,0.0004397138,0.0003454333,0.001002926,0.00075235456,0.001003871,0.001581348],"category_scores_gemma":[0.0025259326,0.0005382364,0.0006871557,0.00056189444,0.0007337172,0.0009274053,0.00078122166,0.0012000524,0.00048235062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004725961,0.000046881643,0.00015852475,0.0001694546,0.000038794587,0.00006786531,0.000088464774,0.8965282,0.008149831,0.032585196,0.0005705784,0.061548978],"study_design_scores_gemma":[0.000007544407,0.00004259146,0.000014373652,0.00000598246,0.0000049893406,0.000014983697,0.00000425164,0.99427766,0.0012107657,0.0036635029,0.0007474732,0.0000059669787],"about_ca_topic_score_codex":0.0016694353,"about_ca_topic_score_gemma":0.0014808176,"teacher_disagreement_score":0.0016694353,"about_ca_system_score_codex":0.0004199226,"about_ca_system_score_gemma":0.0009831659,"threshold_uncertainty_score":0.00737077},"labels":[],"label_agreement":null},{"id":"W2169393995","doi":"10.1109/tsp.2009.2027396","title":"Robust IWFA for Open-Spectrum Communications","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Narrowband; Computer science; Greedy algorithm; Wireless; Interference (communication); Noise (video); Robustness (evolution); Mathematical optimization; Algorithm; Telecommunications; Channel (broadcasting); Mathematics; Artificial intelligence","score_opus":0.06548513640399461,"score_gpt":0.29287349037828775,"score_spread":0.22738835397429313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169393995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008228325,0.00022124515,0.9893282,0.00007981318,0.000019938932,0.00001141007,0.00001061849,0.00006643224,0.0020339466],"genre_scores_gemma":[0.8180637,0.00048118838,0.17812143,0.00012888947,0.00008767647,0.00008080672,0.00004044428,0.000056926463,0.002938974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928313,0.0002753087,0.000020373971,0.000098528064,0.00023162014,0.00009109306],"domain_scores_gemma":[0.9985476,0.0009437315,0.00016222638,0.00015012747,0.00015516685,0.0000410831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097407954,0.0006768616,0.000640723,0.00031617607,0.00030784373,0.000996988,0.00091527094,0.0009783691,0.001308713],"category_scores_gemma":[0.0041500493,0.00026409302,0.00052654283,0.00038130302,0.0011307294,0.0013439314,0.0010193464,0.00082297507,0.00041115907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000936947,0.00003526435,0.000283455,0.00009046513,0.00004452988,0.00017747875,0.000093271585,0.8106994,0.00767887,0.12165162,0.0009535869,0.058198385],"study_design_scores_gemma":[0.000006362054,0.000047741578,0.00004407465,0.0000053881963,0.0000055806595,0.00006774442,0.000012181087,0.96889704,0.0010641646,0.028990204,0.000848604,0.0000108505965],"about_ca_topic_score_codex":0.00064374483,"about_ca_topic_score_gemma":0.00045017415,"teacher_disagreement_score":0.001308713,"about_ca_system_score_codex":0.0004982518,"about_ca_system_score_gemma":0.0005507654,"threshold_uncertainty_score":0.0051514506},"labels":[],"label_agreement":null},{"id":"W2169836946","doi":"10.1109/tsp.2011.2123890","title":"Multisource Transmission for Wireless Relay Networks With Linear Complexity","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Decoding methods; Computer science; Wireless; Transmission (telecommunications); Theoretical computer science; Algorithm; Single antenna interference cancellation; Space–time code; Computer network; Topology (electrical circuits); Telecommunications; Mathematics; Fading; Combinatorics","score_opus":0.09574970530837748,"score_gpt":0.2862665232509038,"score_spread":0.1905168179425263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169836946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015260337,0.0016285019,0.9704771,0.00063061155,0.000084787396,0.000085530504,0.000084269224,0.00024474433,0.011504182],"genre_scores_gemma":[0.7717587,0.0035521467,0.20654474,0.0004798932,0.00047161538,0.00044797582,0.0002013916,0.00015221928,0.016391369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998461,0.0005761735,0.000051493796,0.00020490406,0.0005444906,0.00016182262],"domain_scores_gemma":[0.9970757,0.0021231938,0.0002204405,0.0002713521,0.00026663532,0.000042681637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001415893,0.0012551934,0.0008825555,0.0006075053,0.00073898287,0.0021244325,0.0012742401,0.0011896606,0.004676093],"category_scores_gemma":[0.0057811923,0.00051172863,0.00074434205,0.000978083,0.0013386193,0.0037328056,0.0016683779,0.001827883,0.0010685262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002686367,0.00010746027,0.00046108928,0.0006489339,0.00012224991,0.0004149198,0.00034137515,0.4810062,0.011400232,0.43064588,0.0038214272,0.07076174],"study_design_scores_gemma":[0.0000428087,0.000112462614,0.00013085664,0.000042405096,0.00005076765,0.00022235766,0.00004011737,0.91268563,0.0038896855,0.07849127,0.0042587817,0.000032838165],"about_ca_topic_score_codex":0.0010713903,"about_ca_topic_score_gemma":0.0017080463,"teacher_disagreement_score":0.004676093,"about_ca_system_score_codex":0.002206301,"about_ca_system_score_gemma":0.0009994673,"threshold_uncertainty_score":0.0160079},"labels":[],"label_agreement":null},{"id":"W2170097251","doi":"10.1109/tsp.2006.877653","title":"A new DOA estimation technique based on subarray beamforming","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Huazhong University of Science and Technology; University of Victoria","keywords":"Beamforming; Interference (communication); SIGNAL (programming language); Computer science; Direction of arrival; Algorithm; Phase (matter); Computation; Antenna (radio); Electronic engineering; Telecommunications; Engineering; Physics","score_opus":0.011946119289156945,"score_gpt":0.25715204350177845,"score_spread":0.2452059242126215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170097251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008436175,0.00014032188,0.99826485,0.000029304569,0.0000425672,0.000013704903,0.000032962434,0.00024217185,0.00039046703],"genre_scores_gemma":[0.024727037,0.0005579276,0.97220606,0.00007534767,0.000121669305,0.00009000116,0.00024487893,0.00007459637,0.0019025728],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99924433,0.00011412967,0.00004510772,0.00017872464,0.00037778824,0.00003989461],"domain_scores_gemma":[0.99910116,0.00026999894,0.00012997446,0.00014359118,0.00031215014,0.000043173386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052311557,0.0013373132,0.0011809646,0.0013260203,0.00036920086,0.00093667314,0.0008687969,0.0006219889,0.0027129361],"category_scores_gemma":[0.0018373284,0.00060856756,0.00078501675,0.0014117197,0.00034204504,0.0016684994,0.00090721983,0.001175116,0.0024916253],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021445128,0.000054025422,0.0010932328,0.00025761814,0.00020566226,0.000122040066,0.00012827081,0.04197407,0.17439394,0.016626136,0.0039153714,0.7610152],"study_design_scores_gemma":[0.00008217529,0.0003236167,0.0021906414,0.000063020045,0.00017037413,0.0012758067,0.00005857276,0.8528191,0.08515926,0.010838406,0.046828426,0.00019060174],"about_ca_topic_score_codex":0.0011020788,"about_ca_topic_score_gemma":0.0022514134,"teacher_disagreement_score":0.0027129361,"about_ca_system_score_codex":0.00030084315,"about_ca_system_score_gemma":0.0006463761,"threshold_uncertainty_score":0.009075701},"labels":[],"label_agreement":null},{"id":"W2170153744","doi":"10.1109/78.840001","title":"Factorable FIR Nyquist filters with least stopband energy under sidelobe level constraints","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Stopband; Nyquist–Shannon sampling theorem; Nyquist stability criterion; Intersymbol interference; Minification; Energy (signal processing); Algorithm; Nyquist frequency; Finite impulse response; Computer science; Mathematics; Filter (signal processing); Control theory (sociology); Electronic engineering; Mathematical optimization; Band-pass filter; Statistics; Engineering; Mathematical analysis; Artificial intelligence","score_opus":0.047643151477042185,"score_gpt":0.25500499028055534,"score_spread":0.20736183880351317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170153744","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054856497,0.00010584041,0.99324775,0.00002204855,0.000009448678,0.000015427522,0.00002327783,0.00012727028,0.0009633135],"genre_scores_gemma":[0.126385,0.00040518757,0.8700291,0.000040564417,0.00005007036,0.000086943,0.00012376906,0.00007713824,0.002802246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966586,0.000070533286,0.000021491996,0.00006297451,0.00014440766,0.00003476659],"domain_scores_gemma":[0.9996351,0.0001868606,0.00006967006,0.0000377899,0.0000612886,0.0000093126955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004756117,0.001150627,0.0006228164,0.00036976405,0.00026012096,0.0006510762,0.00046193492,0.0008982778,0.00208686],"category_scores_gemma":[0.0019440269,0.00026269327,0.00036993437,0.00062660343,0.0005584171,0.00094432256,0.00036476718,0.0006003461,0.0008038442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038109435,0.000081039325,0.00066419394,0.00034768647,0.00005834534,0.00024002002,0.00022202183,0.20137185,0.22480334,0.062163286,0.0021230646,0.507544],"study_design_scores_gemma":[0.00006570823,0.00032308736,0.00062308117,0.000055873228,0.000041829953,0.0003962037,0.000066611734,0.83652306,0.11642175,0.031176917,0.014258751,0.000047103305],"about_ca_topic_score_codex":0.00091547327,"about_ca_topic_score_gemma":0.0015496336,"teacher_disagreement_score":0.00208686,"about_ca_system_score_codex":0.0003833548,"about_ca_system_score_gemma":0.0004822697,"threshold_uncertainty_score":0.006981194},"labels":[],"label_agreement":null},{"id":"W2170389424","doi":"10.1109/tsp.2007.896118","title":"Design and Performance Analysis of Bayesian, Neyman–Pearson, and Competitive Neyman–Pearson Voice Activity Detectors","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Bayesian probability; Detector; Pearson product-moment correlation coefficient; Computer science; False alarm; Detection theory; Speech recognition; Artificial intelligence; Pattern recognition (psychology); Statistics; Mathematics; Telecommunications","score_opus":0.01765592319943949,"score_gpt":0.24957173099583635,"score_spread":0.23191580779639687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170389424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076616295,0.0005017508,0.9904061,0.00007740436,0.000022007162,0.00008048941,0.000026225705,0.00019093488,0.0010335325],"genre_scores_gemma":[0.45717257,0.0006374626,0.5392064,0.00025090325,0.00009549902,0.00044998073,0.0001990976,0.000068302346,0.0019198391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99273634,0.0039759697,0.0002516937,0.0009784222,0.0017132026,0.00034431793],"domain_scores_gemma":[0.98445857,0.011151599,0.0008283052,0.00074411836,0.002504244,0.00031312887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011095555,0.00135972,0.001472742,0.001279319,0.0007299919,0.002157694,0.0029243368,0.002362317,0.0018563229],"category_scores_gemma":[0.029161174,0.0009285613,0.00068477995,0.0008412015,0.0012345308,0.0020892892,0.0017050486,0.0011674772,0.0007692266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017443589,0.00032809903,0.0062225424,0.0004282296,0.00043471326,0.0002324918,0.00027124077,0.4445105,0.017586786,0.0942114,0.002318067,0.4317116],"study_design_scores_gemma":[0.00004760254,0.00028438968,0.00060350396,0.000014447157,0.00004555337,0.0002418575,0.000019323752,0.98531175,0.005387076,0.0066286465,0.0013768113,0.000039090257],"about_ca_topic_score_codex":0.001847484,"about_ca_topic_score_gemma":0.0014437498,"teacher_disagreement_score":0.011095555,"about_ca_system_score_codex":0.002007282,"about_ca_system_score_gemma":0.00237014,"threshold_uncertainty_score":0.05867958},"labels":[],"label_agreement":null},{"id":"W2170457951","doi":"10.1109/tsp.2010.2092775","title":"Statistical Properties of the Estimator of the Rotary Coefficient","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Underwater Acoustics Research","field":"Earth and Planetary Sciences","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Clockwise; Estimator; Statistical analysis; Geodesy; Statistics; Confidence interval; Mathematics; Geology; Geometry; Rotation (mathematics)","score_opus":0.026005704651519874,"score_gpt":0.24599940679502041,"score_spread":0.21999370214350053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170457951","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1875252,0.0006480638,0.8093383,0.00019620934,0.000048760645,0.000056485387,0.0005196487,0.00038067618,0.0012867288],"genre_scores_gemma":[0.94904846,0.00060125336,0.047617234,0.0000774728,0.0001309483,0.0001320811,0.0017063793,0.00012727654,0.000558928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969555,0.0010076731,0.00022608052,0.0007687401,0.00086325424,0.00017871347],"domain_scores_gemma":[0.9014106,0.07796885,0.0065790354,0.0073238597,0.006300618,0.00041707815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00989933,0.0005093985,0.00067422393,0.001867127,0.00034639527,0.0010785968,0.0008329096,0.00068317185,0.0008918645],"category_scores_gemma":[0.089913934,0.00025732198,0.00047404383,0.0014450351,0.0016954124,0.0016076135,0.0008151287,0.0011474688,0.0005002407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008255968,0.00015495007,0.2270777,0.00053873577,0.00081359595,0.0006035045,0.0010492168,0.35011926,0.040167045,0.09974023,0.003049731,0.2758605],"study_design_scores_gemma":[0.000039286013,0.00027042796,0.092109166,0.000098033066,0.0001472778,0.0007432568,0.00019428271,0.85891247,0.013136259,0.03195832,0.0021916272,0.00019949046],"about_ca_topic_score_codex":0.0015323085,"about_ca_topic_score_gemma":0.00052868976,"teacher_disagreement_score":0.00989933,"about_ca_system_score_codex":0.00035666078,"about_ca_system_score_gemma":0.00057773205,"threshold_uncertainty_score":0.052353323},"labels":[],"label_agreement":null},{"id":"W2170621841","doi":"10.1109/tsp.2004.832011","title":"Characterization of Nonuniform Perfect-Reconstruction Filterbanks Using Unit-Step Signal","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Decimation; Signal reconstruction; Generalization; Signal processing; Filter bank; Algorithm; Applied mathematics; Mathematical analysis; Filter (signal processing); Computer science; Digital signal processing","score_opus":0.037460494186710075,"score_gpt":0.2665234116628261,"score_spread":0.22906291747611604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170621841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089857996,0.00017343755,0.90623945,0.00009903864,0.000033938923,0.000026569016,0.0000640322,0.00014554602,0.0033600305],"genre_scores_gemma":[0.818084,0.00047035736,0.17849116,0.00007787228,0.00007892701,0.000057132485,0.00016955084,0.00004178706,0.0025293063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979097,0.00003750374,0.000021426858,0.00005646949,0.00006980017,0.00002380316],"domain_scores_gemma":[0.9991679,0.00034479736,0.0001845679,0.0001397238,0.00013167046,0.000031389576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004294821,0.0003871835,0.00024336691,0.00033629427,0.00017604763,0.00070436066,0.00023831938,0.00035509994,0.0015395384],"category_scores_gemma":[0.0025991634,0.00014572577,0.00018273719,0.00030434798,0.0006147291,0.0011746314,0.00034220616,0.00043872968,0.0002154507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040642027,0.00004644682,0.002192079,0.00019031882,0.000028115915,0.0005778565,0.00031588116,0.05828588,0.17898478,0.5864211,0.00077389745,0.17177726],"study_design_scores_gemma":[0.000044992896,0.00040384277,0.002687283,0.000061887426,0.000040031406,0.0014094644,0.00017479598,0.7272378,0.11537655,0.14117582,0.011335647,0.000051890624],"about_ca_topic_score_codex":0.00024722793,"about_ca_topic_score_gemma":0.0003278108,"teacher_disagreement_score":0.0015395384,"about_ca_system_score_codex":0.00029901136,"about_ca_system_score_gemma":0.0002602125,"threshold_uncertainty_score":0.0051502585},"labels":[],"label_agreement":null},{"id":"W2171050719","doi":"10.1109/tsp.2004.839911(410)","title":"Joint watermarking and compression using scalar quantization for maximizing robustness in the presence of additive Gaussian attacks","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Digital watermarking; Quantization (signal processing); Algorithm; Dither; Robustness (evolution); Binary number; Decoding methods; Computer science; Rate–distortion theory; Mathematics; Gaussian; Data compression; Control theory (sociology); Noise shaping; Computer vision; Artificial intelligence","score_opus":0.04201208750466933,"score_gpt":0.29038117856565604,"score_spread":0.2483690910609867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171050719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07291358,0.0008343739,0.9230514,0.00025952724,0.000027796365,0.000065838154,0.000026128484,0.00022834497,0.0025930114],"genre_scores_gemma":[0.79033524,0.00047255465,0.2079915,0.00006850486,0.000042696127,0.000029241924,0.000028519567,0.000032477878,0.000999202],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998863,0.00033240984,0.00009383447,0.00017384611,0.00046721936,0.00006970061],"domain_scores_gemma":[0.998033,0.0010724493,0.00037553997,0.00022447945,0.0002505742,0.000044065495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012694721,0.00059503975,0.0005813623,0.00048853096,0.00032432392,0.0009837811,0.00045196913,0.0006910553,0.0010127535],"category_scores_gemma":[0.005315923,0.00023793001,0.00020779076,0.0007182163,0.00084689213,0.0015563753,0.00083376205,0.0005349908,0.00027682746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007686299,0.00013906407,0.0014497555,0.00043026358,0.00005044816,0.00022903935,0.00028427338,0.26150173,0.4063285,0.084625155,0.00087783975,0.2433154],"study_design_scores_gemma":[0.000062039406,0.00046253245,0.0005892487,0.00004305023,0.00004160615,0.00043249648,0.000040039,0.8081826,0.17381382,0.013782572,0.002495354,0.000054640986],"about_ca_topic_score_codex":0.0003408663,"about_ca_topic_score_gemma":0.0005090032,"teacher_disagreement_score":0.0012694721,"about_ca_system_score_codex":0.00053861184,"about_ca_system_score_gemma":0.0005877121,"threshold_uncertainty_score":0.0067136884},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.048352323945649145,"score_gpt":0.2754522703981205,"score_spread":0.22709994645247134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171060285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024944555,0.0001814041,0.97040975,0.00008998965,0.000078433266,0.0000432133,0.00013445334,0.0006096502,0.0035086127],"genre_scores_gemma":[0.5472621,0.0004980922,0.44126013,0.00015999006,0.00009093036,0.00016734624,0.0006724806,0.00014728984,0.009741714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992951,0.00015617679,0.000040584942,0.00011397731,0.0003198747,0.000074245705],"domain_scores_gemma":[0.9989617,0.0003333834,0.000094351126,0.00016559075,0.00039947065,0.0000455986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004146666,0.00047943884,0.00045565196,0.00043143507,0.00039620732,0.0007664096,0.00066451955,0.000427202,0.0014158235],"category_scores_gemma":[0.0019574882,0.00021710657,0.00033007626,0.0005083045,0.00044524367,0.00049982127,0.00056234235,0.00058385363,0.00050991663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052779436,0.00007037352,0.0011681657,0.00026418766,0.000055294575,0.00030762376,0.00012195363,0.45378673,0.12755908,0.17478524,0.0043021957,0.23705131],"study_design_scores_gemma":[0.000034465036,0.000071096285,0.00018009631,0.00001284212,0.000012311703,0.00011509676,0.000006059614,0.93166536,0.04496074,0.015249365,0.0076725464,0.00001999805],"about_ca_topic_score_codex":0.0022319676,"about_ca_topic_score_gemma":0.0027577812,"teacher_disagreement_score":0.0022319676,"about_ca_system_score_codex":0.0009702085,"about_ca_system_score_gemma":0.0017293239,"threshold_uncertainty_score":0.0070394278},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01969777579488497,"score_gpt":0.2716100576845973,"score_spread":0.2519122818897123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171656554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011811971,0.0001826444,0.99791926,0.000054673998,0.000034405886,0.000012176136,0.000026934347,0.00017141565,0.0004173488],"genre_scores_gemma":[0.21207972,0.0012776888,0.7797377,0.00026589137,0.00022630248,0.00019808397,0.00041087993,0.00014221265,0.00566157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975821,0.00080041046,0.00010841823,0.00038251452,0.0009822432,0.00014427923],"domain_scores_gemma":[0.99643,0.0019800712,0.00035871743,0.00039534556,0.000776356,0.000059567898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015738786,0.0008799914,0.0012335894,0.00059952587,0.0006346766,0.0014908896,0.00077662,0.001179906,0.0018204716],"category_scores_gemma":[0.008585794,0.00054760795,0.0004777842,0.0008557196,0.0010324671,0.0019893206,0.0012017477,0.0014248929,0.001198991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034460463,0.00011997215,0.0007068266,0.0004557507,0.00015501257,0.00020917399,0.00023099361,0.4834314,0.025935913,0.18901262,0.0076761576,0.29172158],"study_design_scores_gemma":[0.00003116908,0.000057643563,0.00013891005,0.000027318652,0.000019741208,0.00015874318,0.000021462072,0.9569602,0.008911117,0.029354183,0.00427431,0.000045244047],"about_ca_topic_score_codex":0.002162723,"about_ca_topic_score_gemma":0.0033104052,"teacher_disagreement_score":0.002162723,"about_ca_system_score_codex":0.00081287033,"about_ca_system_score_gemma":0.002254271,"threshold_uncertainty_score":0.00832355},"labels":[],"label_agreement":null},{"id":"W2171668918","doi":"10.1109/tsp.2014.2313525","title":"Reduced Mean-Square Error Quadratic Inverse Spectrum Estimator","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Multitaper; Estimator; Mathematics; Minimum-variance unbiased estimator; Mean squared error; Efficient estimator; Bias of an estimator; Minimax estimator; Minimum mean square error; Invariant estimator; Statistics; Applied mathematics","score_opus":0.027792805302288507,"score_gpt":0.28138732027543556,"score_spread":0.25359451497314706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171668918","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023602522,0.00014110957,0.9966275,0.000034926,0.000031596046,0.000012348987,0.00002081146,0.0001736699,0.0005978575],"genre_scores_gemma":[0.19846404,0.0004940762,0.7950243,0.00017453282,0.00014537218,0.000111119174,0.000335409,0.00016764292,0.005083517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982778,0.00031319243,0.000073918316,0.00026029622,0.0009901458,0.000084721585],"domain_scores_gemma":[0.997891,0.00073934015,0.00021920052,0.00027590248,0.00082708255,0.00004735117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014735395,0.0006152094,0.0008877512,0.00070007466,0.00027952524,0.0009945352,0.0014829343,0.00093326136,0.0017958713],"category_scores_gemma":[0.005839548,0.00036732855,0.0004798938,0.0006526218,0.0005044405,0.0017391002,0.001026608,0.0012328358,0.0010260463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032885565,0.0001873863,0.003042314,0.0004391678,0.00017622665,0.00022654745,0.0001608944,0.2642895,0.07319193,0.0528109,0.005849309,0.5992969],"study_design_scores_gemma":[0.000016527438,0.000064124186,0.00059799134,0.000017362367,0.00002046647,0.00020640579,0.000012455247,0.97916013,0.011653523,0.0044744406,0.0037490872,0.000027433616],"about_ca_topic_score_codex":0.0009085144,"about_ca_topic_score_gemma":0.0011830701,"teacher_disagreement_score":0.0017958713,"about_ca_system_score_codex":0.00045513018,"about_ca_system_score_gemma":0.0008760668,"threshold_uncertainty_score":0.0077929497},"labels":[],"label_agreement":null},{"id":"W2172065902","doi":"10.1109/tsp.2004.831067","title":"Stochastic correlative learning algorithms","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Algorithm; Convergence (economics); Correlative; Artificial intelligence; Basis (linear algebra); Machine learning; Mathematics","score_opus":0.021916848103083614,"score_gpt":0.27479705637676777,"score_spread":0.2528802082736842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172065902","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020095923,0.00024599623,0.99612576,0.00012333329,0.00003955669,0.000021323607,0.000021314987,0.00012699566,0.0012862524],"genre_scores_gemma":[0.3368964,0.0014270269,0.6522353,0.0006220951,0.00034025265,0.0005129956,0.00032994995,0.00015546089,0.0074804667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984041,0.0005535707,0.00009635349,0.0002794515,0.00054272363,0.00012381935],"domain_scores_gemma":[0.9943341,0.0036821545,0.0004388546,0.00052126084,0.0009121758,0.000111524416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038162684,0.000851044,0.0013959276,0.001267889,0.00063953723,0.0018279562,0.0020086295,0.0018545972,0.0023766963],"category_scores_gemma":[0.012986281,0.0005592289,0.00070704037,0.0016234963,0.0016027251,0.0020383543,0.0021801486,0.002050558,0.0008345839],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000455855,0.00005126469,0.0007638247,0.00009265829,0.000072692055,0.00004972025,0.000050277606,0.663111,0.00085614977,0.20813377,0.002002618,0.12477044],"study_design_scores_gemma":[0.0000059637127,0.0000130933995,0.000058102414,0.0000095164705,0.000004300272,0.000020218182,0.000003615988,0.967442,0.00035784513,0.030990018,0.0010883991,0.000007018639],"about_ca_topic_score_codex":0.0019435541,"about_ca_topic_score_gemma":0.0015401805,"teacher_disagreement_score":0.0038162684,"about_ca_system_score_codex":0.0011104568,"about_ca_system_score_gemma":0.001577634,"threshold_uncertainty_score":0.02018255},"labels":[],"label_agreement":null},{"id":"W2253241185","doi":"10.1109/tsp.2015.2494881","title":"Sum-Rate Maximization for Two-Way Active Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Maximization; Transceiver; Channel (broadcasting); Reciprocal; Computer science; Mathematical optimization; Constraint (computer-aided design); Transmitter power output; Topology (electrical circuits); Transmitter; Mathematics; Telecommunications; Wireless; Combinatorics","score_opus":0.08653331411629032,"score_gpt":0.3133437488915341,"score_spread":0.22681043477524376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253241185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025842661,0.0011706168,0.95897305,0.00036231658,0.000055261837,0.00007317695,0.00022136589,0.00016286282,0.013138724],"genre_scores_gemma":[0.892622,0.0023024422,0.098109454,0.00021248922,0.0001624072,0.0002650025,0.00024369122,0.0001239493,0.005958561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973894,0.0011659487,0.000097942335,0.0003182381,0.00057239615,0.00045610947],"domain_scores_gemma":[0.9946943,0.0036803829,0.00042814424,0.000314388,0.00073257426,0.0001502002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027646245,0.0022902514,0.0015351694,0.00077733456,0.0007391833,0.0025467821,0.0014912942,0.0011583837,0.0027201213],"category_scores_gemma":[0.006853202,0.00067125994,0.00094011537,0.0017346942,0.0021137402,0.0024850836,0.0020761213,0.0017197218,0.00082794105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002902874,0.00012756474,0.0004871414,0.00057290075,0.00012196946,0.00040899916,0.00022532893,0.8211479,0.011158608,0.13419119,0.0042962846,0.026971739],"study_design_scores_gemma":[0.000033779495,0.00009351444,0.00021310832,0.000025074629,0.000034690947,0.0002044038,0.00007571096,0.9464783,0.0032521694,0.048267037,0.0012925378,0.00002962289],"about_ca_topic_score_codex":0.0019886286,"about_ca_topic_score_gemma":0.0015308172,"teacher_disagreement_score":0.0027646245,"about_ca_system_score_codex":0.0016045009,"about_ca_system_score_gemma":0.0013943891,"threshold_uncertainty_score":0.0146209},"labels":[],"label_agreement":null},{"id":"W2254538408","doi":"10.1109/tsp.2015.2505685","title":"Scaled Largest Eigenvalue Detection for Stationary Time-Series","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"False alarm; Detector; Robustness (evolution); Algorithm; Test statistic; Mathematics; Covariance matrix; Eigenvalues and eigenvectors; Statistic; Statistics; Noise (video); Computer science; Statistical hypothesis testing; Artificial intelligence; Telecommunications","score_opus":0.024613071996313397,"score_gpt":0.2525728340881724,"score_spread":0.22795976209185898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254538408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035942737,0.00038580043,0.9619531,0.00011208048,0.00004176065,0.000027788361,0.000038200873,0.00027026483,0.0012282913],"genre_scores_gemma":[0.8231318,0.0005904022,0.17336495,0.00016943335,0.00013649934,0.00007672635,0.00021218734,0.00011368742,0.002204278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975375,0.0010907032,0.000103704224,0.00042086517,0.0006401983,0.00020702892],"domain_scores_gemma":[0.9805237,0.016495861,0.00091519783,0.0007200175,0.0011199153,0.00022521123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045146784,0.0011970013,0.0012010919,0.0009602389,0.0004396371,0.0012216077,0.00076940696,0.0011630612,0.0012407452],"category_scores_gemma":[0.031966973,0.0003724239,0.0006050766,0.0008427158,0.0017338663,0.0021803468,0.0010902694,0.0010965676,0.0005366706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086691143,0.00017093777,0.003840434,0.0003179509,0.0002478367,0.0005853433,0.00030071137,0.7667651,0.02717371,0.08661319,0.0017666315,0.11135121],"study_design_scores_gemma":[0.000009532614,0.00006919873,0.0003390877,0.000008658966,0.000007747743,0.00010940548,0.0000142242125,0.9856139,0.0030252624,0.010547543,0.0002400961,0.000015254705],"about_ca_topic_score_codex":0.0010746778,"about_ca_topic_score_gemma":0.00077594945,"teacher_disagreement_score":0.0045146784,"about_ca_system_score_codex":0.00068345614,"about_ca_system_score_gemma":0.00083841383,"threshold_uncertainty_score":0.02387619},"labels":[],"label_agreement":null},{"id":"W2258579675","doi":"10.1109/tsp.2015.2486742","title":"Sparse Signal Recovery Based Imaging in the Presence of Mode Conversion With Application to Non-Destructive Testing","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Ultrasonics and Acoustic Wave Propagation","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Capon; Computer science; Algorithm; Signal processing; Sparse approximation; Beamforming; Speech recognition; Artificial intelligence; Telecommunications","score_opus":0.015462880733879284,"score_gpt":0.2258838284068931,"score_spread":0.21042094767301384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2258579675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004294463,0.00011701865,0.9948774,0.00009906867,0.000015072056,0.000015962803,0.000009253323,0.000122439,0.00044936233],"genre_scores_gemma":[0.17100658,0.00073054567,0.8250469,0.00022084534,0.00011614193,0.0001295752,0.00010111615,0.00007172514,0.0025766194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999495,0.000116352494,0.00001797447,0.000062601444,0.00028114414,0.000026797798],"domain_scores_gemma":[0.99926764,0.0003386462,0.00011757529,0.00008739604,0.0001587526,0.00003000797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053307845,0.0006733249,0.00059268676,0.00055625057,0.00014573356,0.0005577421,0.00094889244,0.00091236335,0.0008600054],"category_scores_gemma":[0.0018196001,0.00035882674,0.00055445265,0.0005507205,0.00071204925,0.0011303109,0.0008720148,0.00092759705,0.0004038544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019781625,0.00012934464,0.0010775364,0.00049328274,0.000092871865,0.00075876655,0.0003062757,0.26527482,0.22242299,0.037031658,0.002011042,0.4702036],"study_design_scores_gemma":[0.000011617646,0.0000733982,0.00019567272,0.000010995003,0.000015046428,0.00026504303,0.000019017276,0.9730641,0.020414185,0.0041886657,0.0017252339,0.000016984695],"about_ca_topic_score_codex":0.00051059265,"about_ca_topic_score_gemma":0.00050292216,"teacher_disagreement_score":0.00094889244,"about_ca_system_score_codex":0.00019396092,"about_ca_system_score_gemma":0.00040595303,"threshold_uncertainty_score":0.002876997},"labels":[],"label_agreement":null},{"id":"W2275443578","doi":"10.1109/tsp.2016.2518997","title":"Coordinate Update Algorithms for Robust Power Loading for the MU-MISO Downlink With Outage Constraints","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Base station; Telecommunications link; Computer science; Coordinate descent; Mathematical optimization; Beamforming; Algorithm; Transmitter power output; Channel (broadcasting); Mathematics; Transmitter; Telecommunications","score_opus":0.018997765291161102,"score_gpt":0.2405672977692325,"score_spread":0.2215695324780714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275443578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00527798,0.00013602305,0.992765,0.00011141184,0.000023732762,0.000025488236,0.00002881873,0.00016477337,0.0014667356],"genre_scores_gemma":[0.5933078,0.00061026524,0.40012112,0.00018017521,0.00015771898,0.00042233398,0.00026616958,0.00023177089,0.004702655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949586,0.0001659782,0.000025311294,0.00009268169,0.0001455126,0.00007468663],"domain_scores_gemma":[0.99858415,0.00086516765,0.00016683534,0.000094303236,0.00023656247,0.000052939395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011515339,0.0011482998,0.001245387,0.0004075057,0.0004519239,0.0013494799,0.0010929123,0.0011228273,0.0026685277],"category_scores_gemma":[0.004960823,0.0005320431,0.00047044712,0.0007019302,0.0008902823,0.0010069755,0.0012718842,0.0012523488,0.0007701159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055361837,0.000020162672,0.00026787518,0.000034927027,0.000015702106,0.000043195272,0.00006892014,0.9531821,0.0006645879,0.019848155,0.0010066106,0.024792327],"study_design_scores_gemma":[0.000006290067,0.000013232837,0.000024680123,0.0000025121415,0.0000019464787,0.000005101854,0.000005557761,0.9973713,0.00018782499,0.0021543677,0.00022439394,0.0000027486635],"about_ca_topic_score_codex":0.0056593823,"about_ca_topic_score_gemma":0.00394563,"teacher_disagreement_score":0.0056593823,"about_ca_system_score_codex":0.00094584975,"about_ca_system_score_gemma":0.0013279269,"threshold_uncertainty_score":0.01125288},"labels":[],"label_agreement":null},{"id":"W2295703532","doi":"10.1109/tsp.2015.2454487","title":"Optimal Resource Sharing and Network Beamforming in Multi-Carrier Bidirectional Relay Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Computer science; Transceiver; Beamforming; Spectral efficiency; Computer network; Relay channel; Topology (electrical circuits); Resource allocation; Shared resource; Interference (communication); Constraint (computer-aided design); Mathematical optimization; Power (physics); Telecommunications; Mathematics; Channel (broadcasting); Wireless; Engineering; Electrical engineering","score_opus":0.06555621047340339,"score_gpt":0.2933126313010925,"score_spread":0.2277564208276891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295703532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0130316885,0.00048487025,0.9820404,0.00019068053,0.000025139543,0.00003761284,0.000032175656,0.000051445386,0.0041059223],"genre_scores_gemma":[0.8491554,0.0014320206,0.14368922,0.00013028881,0.00007183166,0.00023774529,0.00006703969,0.000068920315,0.0051475293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989806,0.00057786616,0.000028171247,0.00011106649,0.00015357666,0.0001486221],"domain_scores_gemma":[0.9987394,0.0009170162,0.00012850792,0.000054331173,0.00011339507,0.00004747009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020006895,0.0011902881,0.0010764371,0.00051121844,0.00033473907,0.0013989487,0.001118963,0.0014673085,0.002022237],"category_scores_gemma":[0.0036710436,0.00060320646,0.0005808768,0.0010391908,0.001112131,0.0017200239,0.001074981,0.00073142425,0.00038964787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030421896,0.0000227496,0.000120712626,0.000048532434,0.000016422748,0.00006673579,0.000036628717,0.9676252,0.00087323686,0.02421724,0.00032024746,0.0066217617],"study_design_scores_gemma":[0.0000060332836,0.000018618397,0.000037937323,0.0000043903538,0.0000036968368,0.000010780703,0.000014370287,0.99182713,0.0001999083,0.007681792,0.00019067198,0.0000046622536],"about_ca_topic_score_codex":0.0027632904,"about_ca_topic_score_gemma":0.0022455887,"teacher_disagreement_score":0.0027632904,"about_ca_system_score_codex":0.0013195631,"about_ca_system_score_gemma":0.00094368716,"threshold_uncertainty_score":0.010580778},"labels":[],"label_agreement":null},{"id":"W2335894546","doi":"10.1109/tsp.2017.2684743","title":"Sub-Nyquist Cyclostationary Detection for Cognitive Radio","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; Israel Science Foundation","keywords":"Cyclostationary process; Cognitive radio; Nyquist rate; Undersampling; Algorithm; Nyquist–Shannon sampling theorem; Computer science; Wideband; Oversampling; Robustness (evolution); Noise (video); Mathematics; Sampling (signal processing); Statistics; Telecommunications; Electronic engineering; Bandwidth (computing); Artificial intelligence; Engineering; Wireless; Detector; Computer vision","score_opus":0.02299816827667212,"score_gpt":0.27282761483269863,"score_spread":0.2498294465560265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2335894546","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022396257,0.0010104146,0.9737969,0.00028989278,0.000048263195,0.000025733449,0.00004135499,0.00013992187,0.0022513028],"genre_scores_gemma":[0.80134696,0.002502442,0.19380365,0.00021041601,0.00015541655,0.00011120549,0.00012528664,0.000042721786,0.0017019114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955875,0.00011769302,0.000016934262,0.000059222955,0.00020709577,0.000040253235],"domain_scores_gemma":[0.99872226,0.00087285053,0.0001420135,0.00010857891,0.00012318992,0.000031030508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073365535,0.00044039023,0.0003372271,0.00045574404,0.00023157225,0.000663257,0.00041915136,0.00063313206,0.00071943796],"category_scores_gemma":[0.004224124,0.00023638114,0.00025395633,0.00050748175,0.0006789406,0.00069872296,0.0005939201,0.0008158086,0.00024540434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031625284,0.00012904413,0.001447882,0.00042860216,0.00007421888,0.0003369404,0.00018271178,0.5049959,0.066498734,0.204858,0.0028787435,0.21785304],"study_design_scores_gemma":[0.0000054164857,0.000040437415,0.00020435317,0.000016760609,0.000005550542,0.000056414814,0.000009961151,0.97828853,0.004189436,0.016139088,0.0010355015,0.00000853714],"about_ca_topic_score_codex":0.0009777877,"about_ca_topic_score_gemma":0.0011812926,"teacher_disagreement_score":0.0009777877,"about_ca_system_score_codex":0.0005456005,"about_ca_system_score_gemma":0.0008770566,"threshold_uncertainty_score":0.0039586425},"labels":[],"label_agreement":null},{"id":"W2395397254","doi":"10.1109/tsp.2015.2441032","title":"Iterative Reweighted <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\ell_{2}/\\ell_{1}$</tex> </formula> Recovery Algorithms for Compressed Sensing of Block Sparse Signals","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Algorithm; Block (permutation group theory); Computer science; Iterative method; Minification; Mathematics; Combinatorics","score_opus":0.039773057190614906,"score_gpt":0.2679268126032404,"score_spread":0.2281537554126255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395397254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010172505,0.00031178448,0.9878341,0.00033706744,0.00017124963,0.00011159494,0.0005495851,0.0018733704,0.007793987],"genre_scores_gemma":[0.019480295,0.00085733685,0.9403115,0.00038974523,0.00012678686,0.00036777635,0.0024734018,0.0018708307,0.034122467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991233,0.00015615618,0.000055470904,0.00014403653,0.00045873135,0.000062302934],"domain_scores_gemma":[0.99864155,0.00035239026,0.00011602375,0.0002565101,0.00058635784,0.0000472228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010576355,0.0017373983,0.00092847995,0.0012151188,0.0006334822,0.0016963829,0.002177814,0.0014185592,0.049848355],"category_scores_gemma":[0.003810365,0.00068759854,0.0012303494,0.0022595474,0.00084798055,0.00189335,0.0017385655,0.0023269276,0.036053054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027583403,0.00011771342,0.000592424,0.00096949603,0.00013512446,0.00037136572,0.00026256836,0.10837262,0.042589568,0.1340875,0.13351327,0.5787125],"study_design_scores_gemma":[0.000053958833,0.00007306584,0.00035945873,0.000098378805,0.000042878175,0.00046534432,0.00006567312,0.7952386,0.038355242,0.03842024,0.1267457,0.00008131581],"about_ca_topic_score_codex":0.006732424,"about_ca_topic_score_gemma":0.015448213,"teacher_disagreement_score":0.049848355,"about_ca_system_score_codex":0.0012387825,"about_ca_system_score_gemma":0.0022123526,"threshold_uncertainty_score":0.16675931},"labels":[],"label_agreement":null},{"id":"W2461887739","doi":"10.1109/tsp.2017.2649486","title":"Cross-Layer Design for Downlink Multihop Cloud Radio Access Networks With Network Coding","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Radio access network; Telecommunications link; Multicast; Linear network coding; Beamforming; Unicast; Cloud computing; Base station; Telecommunications; Network packet","score_opus":0.1085573153800559,"score_gpt":0.3545309885053992,"score_spread":0.2459736731253433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2461887739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0079535125,0.00041633841,0.9869658,0.00012426564,0.00006680398,0.000062084815,0.00003656481,0.00018404862,0.004190611],"genre_scores_gemma":[0.82767206,0.0008354233,0.16604216,0.0002602805,0.00009256747,0.00026488732,0.00012155482,0.000088017536,0.0046229744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989794,0.00030970655,0.00003611282,0.00016193753,0.0003244487,0.00018844691],"domain_scores_gemma":[0.99903846,0.0003436773,0.00011514661,0.000074245756,0.0003804384,0.000048050268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014832244,0.0011273732,0.00058156427,0.00045459272,0.00051778724,0.0013628457,0.0012171111,0.00065382704,0.00311337],"category_scores_gemma":[0.0023736898,0.00039077408,0.00043194025,0.00049390504,0.00060727785,0.00088651665,0.0011921949,0.00096899376,0.0005724639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001133446,0.000064541106,0.00047981503,0.00011799493,0.000056175504,0.00015865329,0.00009575882,0.8998885,0.010281146,0.033187043,0.0023044797,0.053252418],"study_design_scores_gemma":[0.000007117698,0.000042502106,0.00005426473,0.000008122374,0.000009843917,0.000024240884,0.000012074266,0.9958489,0.0010607161,0.0021453083,0.0007807238,0.000006233737],"about_ca_topic_score_codex":0.0043819603,"about_ca_topic_score_gemma":0.0051380727,"teacher_disagreement_score":0.0043819603,"about_ca_system_score_codex":0.0012676832,"about_ca_system_score_gemma":0.0014908648,"threshold_uncertainty_score":0.010415196},"labels":[],"label_agreement":null},{"id":"W2464215524","doi":"10.1109/tsp.2016.2582468","title":"Optimal Network Beamforming in Collaborative Relay Networks With Centralized Energy Harvesting","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Beamforming; Transmitter; Relay; Computer science; Frame (networking); Transmitter power output; Channel state information; Energy harvesting; Channel (broadcasting); Throughput; Transceiver; Topology (electrical circuits); Energy (signal processing); Computer network; Power (physics); Real-time computing; Wireless; Telecommunications; Mathematics; Electrical engineering; Engineering","score_opus":0.006828139328475939,"score_gpt":0.1978564220819948,"score_spread":0.19102828275351885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464215524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03634994,0.00057597156,0.95879763,0.0002678188,0.000024012585,0.000040463063,0.000096020565,0.0001127832,0.0037353723],"genre_scores_gemma":[0.91525054,0.0010945555,0.07861171,0.00010669444,0.000056112818,0.00022551311,0.00012294152,0.000040026523,0.004491869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909997,0.0003797904,0.000032562846,0.00021252586,0.00013575076,0.0001394958],"domain_scores_gemma":[0.99820364,0.0012735944,0.00022690324,0.00006950835,0.00017116027,0.000055238223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016380793,0.0011354651,0.0012989573,0.0005092902,0.00036574583,0.0011171524,0.001128989,0.0014844955,0.0011960862],"category_scores_gemma":[0.003482691,0.0007132024,0.0005396054,0.0009713633,0.0012986343,0.0016160997,0.00097584823,0.0006298414,0.00035026326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055325938,0.000016114192,0.00013868991,0.000037104004,0.000015259258,0.00007458819,0.000033750184,0.9860453,0.00094416493,0.0082049435,0.00019213621,0.0042426544],"study_design_scores_gemma":[0.000014029247,0.000032615302,0.00006342523,0.000004176395,0.00000856346,0.000014564116,0.000017866072,0.9933074,0.00033144644,0.006044496,0.00015413691,0.000007309412],"about_ca_topic_score_codex":0.00382609,"about_ca_topic_score_gemma":0.0030001656,"teacher_disagreement_score":0.00382609,"about_ca_system_score_codex":0.0014536545,"about_ca_system_score_gemma":0.00084416324,"threshold_uncertainty_score":0.010547042},"labels":[],"label_agreement":null},{"id":"W2475304407","doi":"10.1109/tsp.2016.2586752","title":"A Novel Joint Multitarget Estimator for Multi-Bernoulli Models","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; McMaster University","funders":"","keywords":"Estimator; Bernoulli's principle; Computer science; Probability density function; Minimax estimator; Bernoulli process; Mathematics; Minimum-variance unbiased estimator; Mathematical optimization; Algorithm; Statistics","score_opus":0.09298359522815848,"score_gpt":0.290829429384633,"score_spread":0.19784583415647455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2475304407","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010148525,0.0000920117,0.9985807,0.000021060934,0.000015368929,0.0000073847973,0.00001380204,0.00008420374,0.00017060732],"genre_scores_gemma":[0.15243068,0.0006715752,0.84251326,0.00023610775,0.00018710626,0.000186313,0.00043828235,0.000155748,0.0031809623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990959,0.00021600192,0.000042733383,0.00021692924,0.00035384163,0.00007451903],"domain_scores_gemma":[0.998678,0.0006488033,0.00015380142,0.00015930815,0.00030176822,0.000058225258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001965375,0.0007497754,0.0012278628,0.000856973,0.00035146743,0.0009940232,0.0016514071,0.0011822877,0.0017527739],"category_scores_gemma":[0.0054845414,0.0005472283,0.00091519294,0.0008712569,0.0004957093,0.0018179526,0.0016439353,0.0015928039,0.0009461517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028359258,0.00012022022,0.004614491,0.00035141656,0.00024913036,0.00017561037,0.00016662202,0.36001253,0.03532011,0.05937259,0.0041575795,0.5351761],"study_design_scores_gemma":[0.000013617722,0.000045423414,0.0004664201,0.0000146598295,0.000027039518,0.00013580987,0.000008743054,0.98750955,0.0035304679,0.0061127967,0.0021120727,0.00002334458],"about_ca_topic_score_codex":0.0012926556,"about_ca_topic_score_gemma":0.0015318335,"teacher_disagreement_score":0.001965375,"about_ca_system_score_codex":0.0004990087,"about_ca_system_score_gemma":0.0012844409,"threshold_uncertainty_score":0.010394037},"labels":[],"label_agreement":null},{"id":"W2503670596","doi":"10.1109/tsp.2017.2703684","title":"Particle Filtering With Invertible Particle Flow","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle filter; Auxiliary particle filter; Degeneracy (biology); Flow (mathematics); Algorithm; Particle (ecology); Computer science; Mathematical optimization; Mathematics; Filter (signal processing); Applied mathematics; Ensemble Kalman filter; Kalman filter; Artificial intelligence; Extended Kalman filter; Computer vision; Geometry","score_opus":0.03414034921326445,"score_gpt":0.25887432904965574,"score_spread":0.2247339798363913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503670596","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014081463,0.000040059585,0.99785715,0.000051801173,0.00002381592,0.000019887375,0.000011269677,0.000121698125,0.0004662106],"genre_scores_gemma":[0.22968401,0.000410774,0.76509625,0.00018534734,0.00012658867,0.00027317388,0.00016400362,0.00008574752,0.003974145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908173,0.0002762778,0.000053304168,0.000198338,0.00032381108,0.00006640001],"domain_scores_gemma":[0.9984937,0.0009736227,0.000117519405,0.00017329957,0.00020983371,0.00003202016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019254744,0.00075665594,0.0006892551,0.0006398497,0.00048666575,0.0009548877,0.0008872485,0.0016200406,0.0017662536],"category_scores_gemma":[0.007467172,0.0004949216,0.00096988457,0.0007223726,0.0008897365,0.0012771562,0.0011406526,0.0017960491,0.00048065057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071589035,0.000047610236,0.0005592531,0.00011000306,0.000044223412,0.000095185016,0.00010679824,0.8103133,0.0029240376,0.06184948,0.0013871161,0.12249141],"study_design_scores_gemma":[0.000010714126,0.00001609326,0.00008666793,0.0000048962033,0.0000041088583,0.000019273622,0.000004190018,0.9899754,0.00081924145,0.007950216,0.0011026517,0.000006580844],"about_ca_topic_score_codex":0.0066133062,"about_ca_topic_score_gemma":0.0033615062,"teacher_disagreement_score":0.0066133062,"about_ca_system_score_codex":0.0006977734,"about_ca_system_score_gemma":0.0014129498,"threshold_uncertainty_score":0.013149619},"labels":[],"label_agreement":null},{"id":"W2510067730","doi":"10.1109/tsp.2018.2838541","title":"SUMMeR: Sub-Nyquist MIMO Radar","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Signal Processing","topic":"Radar Systems and Signal Processing","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"H2020 European Research Council; Azrieli Foundation; Israel Science Foundation; European Commission","keywords":"Nyquist rate; MIMO; Computer science; Electronic engineering; Nyquist–Shannon sampling theorem; Nyquist frequency; Radar; 3G MIMO; Undersampling; Antenna diversity; Bandwidth (computing); Spatial multiplexing; Sampling (signal processing); Real-time computing; Beamforming; Telecommunications; Engineering; Antenna (radio)","score_opus":0.023773035468602988,"score_gpt":0.2456327814910417,"score_spread":0.22185974602243871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2510067730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041189324,0.00087443873,0.94954026,0.00031410507,0.00016905456,0.000045357323,0.00015882116,0.0015519452,0.006156712],"genre_scores_gemma":[0.6279542,0.0009271868,0.35984358,0.00038985835,0.00034507448,0.00007351391,0.0005470011,0.00008678907,0.009832748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994791,0.00014037256,0.000014118502,0.000082913146,0.0002128455,0.000070750895],"domain_scores_gemma":[0.99959856,0.00011579012,0.000059687038,0.00008455502,0.00010256792,0.000038807364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004107955,0.0005852849,0.0006151836,0.00023935504,0.00023761217,0.0005476517,0.0005166203,0.0006500113,0.0022243445],"category_scores_gemma":[0.00071409706,0.00020598149,0.00018321838,0.0004964342,0.00034682333,0.0008080089,0.0009357821,0.0008289985,0.0011818684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014370099,0.00018366732,0.0023098884,0.00041639016,0.00010120795,0.00046993993,0.0002965005,0.203749,0.3244002,0.034826238,0.014397552,0.41741246],"study_design_scores_gemma":[0.000076533084,0.00054345024,0.0017813288,0.000026932208,0.000024655294,0.00090781477,0.00006348877,0.8996989,0.069700144,0.008880814,0.018243952,0.000051963612],"about_ca_topic_score_codex":0.00051545823,"about_ca_topic_score_gemma":0.0008984045,"teacher_disagreement_score":0.0022243445,"about_ca_system_score_codex":0.00023316653,"about_ca_system_score_gemma":0.00029257062,"threshold_uncertainty_score":0.0074412227},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Computer science; Visible light communication; Transmitter; Channel (broadcasting); Transmission (telecommunications); Mathematical optimization; Telecommunications; Mathematics; Light-emitting diode; Engineering","score_opus":0.017786755103518254,"score_gpt":0.24106133564597562,"score_spread":0.22327458054245736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512859977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023376899,0.00028919804,0.97366685,0.00013620863,0.000020597814,0.000020134103,0.000043575972,0.000099720906,0.002346859],"genre_scores_gemma":[0.86246175,0.00080378726,0.13330281,0.00009951564,0.000042823474,0.00009934192,0.000105403684,0.00004543917,0.0030391614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993992,0.00022251881,0.000021414216,0.00007408581,0.00020269323,0.00008007684],"domain_scores_gemma":[0.9990772,0.00056419894,0.00015172543,0.00005279105,0.0001209348,0.000033125012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008179316,0.0010993613,0.0007038051,0.0002858813,0.00024229959,0.00078835717,0.00033366823,0.0007149909,0.001077767],"category_scores_gemma":[0.0025248926,0.0003529968,0.00040250728,0.00048102252,0.00086939975,0.0008101464,0.0006739002,0.00052270666,0.0003941758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004774635,0.000010167762,0.00020333937,0.000042187632,0.000012927273,0.00004237562,0.000026378955,0.97860104,0.0046292003,0.007693384,0.00021601417,0.008475314],"study_design_scores_gemma":[0.0000063202096,0.00003953361,0.000098910736,0.00000650352,0.00000476472,0.000013422801,0.000015926158,0.9949078,0.0019486621,0.00273567,0.00021534336,0.0000070790347],"about_ca_topic_score_codex":0.0014831002,"about_ca_topic_score_gemma":0.0015522756,"teacher_disagreement_score":0.0014831002,"about_ca_system_score_codex":0.0006345622,"about_ca_system_score_gemma":0.0007455233,"threshold_uncertainty_score":0.004604101},"labels":[],"label_agreement":null},{"id":"W2523112045","doi":"10.1109/tsp.2017.2723348","title":"A Multisensor Multi-Bernoulli Filter","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Public Works and Government Services Canada; Defence Research and Development Canada","keywords":"Bernoulli's principle; Filter (signal processing); Computer science; Filtering theory; Control theory (sociology); Mathematics; Algorithm; Artificial intelligence; Computer vision; Engineering","score_opus":0.051469272372245224,"score_gpt":0.2957671963388285,"score_spread":0.24429792396658326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523112045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076746184,0.000061964114,0.99862504,0.000034513985,0.000026824027,0.000009215546,0.00001548763,0.00007029649,0.00038927808],"genre_scores_gemma":[0.15297,0.0005686223,0.8411276,0.00029003414,0.00014362471,0.00015790222,0.00022462409,0.00007451486,0.0044432012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882156,0.00020750625,0.00005336642,0.00030753398,0.0005333203,0.00007676143],"domain_scores_gemma":[0.9991997,0.0003524564,0.00007182223,0.0001183015,0.0002198131,0.00003793336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014356019,0.00065120554,0.0008559109,0.00065088476,0.00046159726,0.0008428507,0.0013777615,0.0014111613,0.0020538627],"category_scores_gemma":[0.0033119,0.0004462103,0.00074264617,0.00069255655,0.0006091162,0.001596749,0.0010651767,0.0013282709,0.0011546204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021641777,0.0000727391,0.0014383519,0.00023386812,0.00010716303,0.00022525113,0.00018565982,0.52723336,0.028216835,0.10208308,0.003509208,0.33647805],"study_design_scores_gemma":[0.000009468848,0.000033537726,0.00019665138,0.000012501883,0.00001216295,0.00012846298,0.0000050293274,0.98643595,0.004041562,0.0061452975,0.0029641641,0.000015202571],"about_ca_topic_score_codex":0.002342263,"about_ca_topic_score_gemma":0.0020620017,"teacher_disagreement_score":0.002342263,"about_ca_system_score_codex":0.00080999744,"about_ca_system_score_gemma":0.0012805186,"threshold_uncertainty_score":0.0075923204},"labels":[],"label_agreement":null},{"id":"W2524812397","doi":"10.1109/tsp.2016.2614487","title":"Sequential Likelihood Ratio Test for Cognitive Radios","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Detector; Cognitive radio; Robustness (evolution); Covariance matrix; Likelihood-ratio test; Detection theory; Computer science; Algorithm; Gaussian; Covariance; Gaussian noise; Signal-to-noise ratio (imaging); Speech recognition; Statistics; Mathematics; Telecommunications; Wireless; Physics","score_opus":0.0208822429058192,"score_gpt":0.2591753491070149,"score_spread":0.2382931062011957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2524812397","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012084681,0.00026437253,0.98531103,0.00024369912,0.000047826612,0.00004669791,0.00006499316,0.00035471967,0.001582079],"genre_scores_gemma":[0.66509527,0.00042736906,0.33049342,0.0003825466,0.00025976947,0.0002897518,0.00032620854,0.00012028991,0.0026054357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944945,0.0029298705,0.00020350427,0.0007596234,0.001367137,0.00024528557],"domain_scores_gemma":[0.97437817,0.020910647,0.001632826,0.0011822361,0.0015384441,0.0003576316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057858173,0.00093051646,0.0012388327,0.0015782312,0.0004326872,0.001495228,0.0014029145,0.0016318401,0.002484918],"category_scores_gemma":[0.045435727,0.00054792565,0.0008006964,0.001114762,0.0017516728,0.002300571,0.0016085797,0.0016282543,0.0008478165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011642702,0.0002386518,0.007261566,0.00038316395,0.0003686131,0.0010776743,0.00023061335,0.38890913,0.014586921,0.32572496,0.0049761133,0.2550783],"study_design_scores_gemma":[0.00007136276,0.00016864754,0.0005014644,0.000018135765,0.000025840554,0.00040729388,0.00002142952,0.9364121,0.0031286255,0.057736598,0.0014760847,0.000032438067],"about_ca_topic_score_codex":0.00092959835,"about_ca_topic_score_gemma":0.00055872486,"teacher_disagreement_score":0.0057858173,"about_ca_system_score_codex":0.0009638279,"about_ca_system_score_gemma":0.0020401739,"threshold_uncertainty_score":0.0305987},"labels":[],"label_agreement":null},{"id":"W2549776980","doi":"10.1109/tsp.2019.2929944","title":"Hardware-Based Linear Program Decoding With the Alternating Direction Method of Multipliers","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Signal Processing","topic":"Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Cisco Systems (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; CMC Microsystems; National Science Foundation","keywords":"Decoding methods; Computer science; List decoding; Belief propagation; Field-programmable gate array; Sequential decoding; Linear programming; Algorithm; Low-density parity-check code; Verilog; Parallel computing; Computer hardware; Computer engineering; Concatenated error correction code","score_opus":0.02195017892605147,"score_gpt":0.2852741907957871,"score_spread":0.26332401186973564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549776980","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029368824,0.00007952207,0.99363846,0.000103966086,0.00004804783,0.00003990423,0.000025195186,0.00086444913,0.0022635644],"genre_scores_gemma":[0.07143507,0.00010276699,0.9253791,0.000078475394,0.000034253684,0.00014026248,0.00009313168,0.000116718984,0.0026201422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943596,0.00016705153,0.00003413822,0.00007709883,0.00023698564,0.00004872924],"domain_scores_gemma":[0.99936837,0.00024558877,0.00006510136,0.000120388955,0.00017615143,0.000024403234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006452153,0.00086895865,0.000459556,0.00049610925,0.0003612903,0.0009585475,0.0011742652,0.0008430046,0.0043354067],"category_scores_gemma":[0.0019332856,0.0003105113,0.00044653536,0.0006360048,0.00056020246,0.00077350985,0.0006120612,0.0014866572,0.0017033832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002905223,0.00022401342,0.0007135479,0.00037559256,0.00012975934,0.00029678995,0.00020801502,0.33970532,0.05005419,0.11259889,0.008129959,0.48727337],"study_design_scores_gemma":[0.00004846427,0.00013323045,0.000053679247,0.000018976058,0.0000128960355,0.00009768062,0.000011715442,0.96508193,0.017205684,0.009073829,0.008246041,0.000015903868],"about_ca_topic_score_codex":0.0014769646,"about_ca_topic_score_gemma":0.002608379,"teacher_disagreement_score":0.0043354067,"about_ca_system_score_codex":0.0005261244,"about_ca_system_score_gemma":0.0013199835,"threshold_uncertainty_score":0.01450336},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.029092546310961476,"score_gpt":0.26641466642224515,"score_spread":0.23732212011128367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553591559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031210205,0.0000833539,0.9961403,0.00006562182,0.00001773509,0.0000137285415,0.000012913792,0.00015277273,0.0003924357],"genre_scores_gemma":[0.32513645,0.00053341285,0.6694621,0.00026105097,0.00012846726,0.0002506007,0.0002539633,0.000088563786,0.003885448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991202,0.00025617285,0.0000418353,0.00012972555,0.00034626882,0.00010591284],"domain_scores_gemma":[0.9985343,0.00074119214,0.00017806211,0.00017586481,0.00032703287,0.000043513446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088838924,0.0011241902,0.0011125018,0.00068063545,0.00052559533,0.00078704464,0.0010239341,0.0010668833,0.0011696445],"category_scores_gemma":[0.004145708,0.00061256805,0.00071146525,0.00092622155,0.0008445245,0.0014165423,0.0012911563,0.0013611134,0.00058130745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012275774,0.000060684994,0.0008547138,0.000103867475,0.00007509279,0.00011519317,0.00018240928,0.83108896,0.009075234,0.020789916,0.0015059002,0.13602528],"study_design_scores_gemma":[0.000009654117,0.000028553835,0.00008659958,0.000004266001,0.0000060966017,0.000030651237,0.0000066314387,0.99475163,0.0020965596,0.0024643969,0.00050460227,0.000010454331],"about_ca_topic_score_codex":0.0036470576,"about_ca_topic_score_gemma":0.003415943,"teacher_disagreement_score":0.0036470576,"about_ca_system_score_codex":0.00052659726,"about_ca_system_score_gemma":0.0014100833,"threshold_uncertainty_score":0.00725168},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01733816768298668,"score_gpt":0.24112729761747656,"score_spread":0.22378912993448988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557873547","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018116666,0.0008050615,0.9755587,0.0009682519,0.0001168259,0.000061209495,0.0002005618,0.0003100969,0.00386253],"genre_scores_gemma":[0.6496482,0.002667128,0.33934864,0.0014295011,0.00073387625,0.00060774595,0.0011408766,0.00041466104,0.0040094233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953306,0.0010275922,0.00025801646,0.0009829958,0.0018485321,0.0005522801],"domain_scores_gemma":[0.9817908,0.012264561,0.0016515154,0.002100206,0.001592581,0.0006003309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005409121,0.002222508,0.0020428337,0.0015068637,0.0008848934,0.0019460771,0.0023487795,0.003771287,0.0044573764],"category_scores_gemma":[0.046287227,0.0011679995,0.0015274172,0.001414238,0.0041167014,0.008121405,0.006483866,0.0063116183,0.0019786458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013954027,0.00017193751,0.0020721725,0.0012759541,0.0001848075,0.0015055389,0.00078425865,0.23190439,0.07562893,0.58731353,0.009699248,0.08806384],"study_design_scores_gemma":[0.00012589525,0.00039661615,0.00079193746,0.00016493318,0.00004127815,0.0006172328,0.00014715503,0.7703777,0.024827512,0.19723871,0.005175734,0.00009529101],"about_ca_topic_score_codex":0.00079669233,"about_ca_topic_score_gemma":0.00040552873,"teacher_disagreement_score":0.005409121,"about_ca_system_score_codex":0.0007909235,"about_ca_system_score_gemma":0.0017671031,"threshold_uncertainty_score":0.028606534},"labels":[],"label_agreement":null},{"id":"W2558756740","doi":"10.1109/tsp.2016.2633241","title":"Generalized Likelihood Ratio Test for Detection of Gaussian Rank-One Signals in Gaussian Noise With Unknown Statistics","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Radar Systems and Signal Processing","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Grants and Agreements; Ontario Ministry of Research, Innovation and Science","keywords":"Likelihood-ratio test; Mathematics; Constant false alarm rate; Statistics; Covariance matrix; Gaussian noise; Clutter; Algorithm; Gaussian; Covariance; Detection theory; Detector; Noise (video); Pattern recognition (psychology); Radar; Artificial intelligence; Computer science; Physics","score_opus":0.01365312440160547,"score_gpt":0.2283316581402356,"score_spread":0.21467853373863013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558756740","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023537897,0.00035141333,0.9747897,0.00013000781,0.000018461198,0.000031000956,0.000053383195,0.0003220131,0.0007661283],"genre_scores_gemma":[0.67848766,0.0004290171,0.31888986,0.00015833562,0.000112515045,0.00018193774,0.00031968876,0.0000914071,0.0013295535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948813,0.0033257892,0.0001413054,0.00049451925,0.00097509753,0.0001820521],"domain_scores_gemma":[0.9761721,0.020541428,0.0014440513,0.00074588077,0.00083756284,0.0002591231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063280733,0.001150774,0.0016775642,0.0014015838,0.00029384813,0.0012826878,0.0016020768,0.0015851432,0.0014752067],"category_scores_gemma":[0.04380902,0.0003944605,0.0006418194,0.0010604671,0.0020122468,0.0015352234,0.0010848871,0.000993167,0.00063177524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008668498,0.00011741788,0.0040588984,0.00038558926,0.00028282683,0.00096548663,0.00014584852,0.78332895,0.011612594,0.08658711,0.001469405,0.110179074],"study_design_scores_gemma":[0.000037224447,0.00015921853,0.00061312923,0.000011291516,0.000019621331,0.00022856449,0.000014484566,0.98071504,0.0026249834,0.015149197,0.00039648978,0.0000306812],"about_ca_topic_score_codex":0.0007333114,"about_ca_topic_score_gemma":0.00044538968,"teacher_disagreement_score":0.0063280733,"about_ca_system_score_codex":0.00081030856,"about_ca_system_score_gemma":0.0012084018,"threshold_uncertainty_score":0.03346646},"labels":[],"label_agreement":null},{"id":"W2562972626","doi":"10.1109/tsp.2016.2646667","title":"Utility Change Point Detection in Online Social Media: A Revealed Preference Framework","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Maximization; Dimensionality reduction; Ground truth; Change detection; Curse of dimensionality; Marketing buzz; Preference; Social media; Dimension (graph theory); Mathematical optimization; Data mining; Artificial intelligence; Algorithm; Mathematics; Statistics","score_opus":0.06813706542608179,"score_gpt":0.30005100688956776,"score_spread":0.23191394146348598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562972626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27403173,0.00059837516,0.72152406,0.000714721,0.000029049017,0.00017478647,0.0008210905,0.00034305183,0.0017631375],"genre_scores_gemma":[0.941363,0.00016898636,0.056845598,0.00008646129,0.00004879182,0.00009200754,0.0004976189,0.000023083634,0.0008744084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592376,0.002166991,0.00020613217,0.0007774115,0.00059267547,0.00033303775],"domain_scores_gemma":[0.98448306,0.010044402,0.0022911676,0.0016496768,0.0010813253,0.00045024598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059433756,0.00075602316,0.0013271715,0.0022934875,0.0005734428,0.0017928572,0.0017256284,0.0014199412,0.00081859244],"category_scores_gemma":[0.022189634,0.00043501038,0.000876628,0.002714509,0.0010942568,0.0033045323,0.00136996,0.0016989883,0.00024788006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014379552,0.0010793316,0.0776319,0.0003748546,0.0005337426,0.0011126008,0.00071763695,0.577844,0.008254045,0.085722215,0.0038688236,0.24142286],"study_design_scores_gemma":[0.000008714293,0.00007436402,0.003709982,0.0000073065576,0.0000134544225,0.00006961897,0.000059941398,0.9809512,0.0007529099,0.014066048,0.00026743885,0.000018957826],"about_ca_topic_score_codex":0.0050908313,"about_ca_topic_score_gemma":0.0054551284,"teacher_disagreement_score":0.0059433756,"about_ca_system_score_codex":0.0014278236,"about_ca_system_score_gemma":0.0007214958,"threshold_uncertainty_score":0.031431913},"labels":[],"label_agreement":null},{"id":"W2586175175","doi":"10.1109/tsp.2017.2664041","title":"Bandwidth Estimation From Multiple Level-Crossings of Stochastic Signals","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Bandwidth (computing); Estimator; Gaussian; Mathematics; Algorithm; Signal processing; Computer science; Statistics; Digital signal processing; Telecommunications","score_opus":0.05551927747556524,"score_gpt":0.31026498826877713,"score_spread":0.2547457107932119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586175175","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031792384,0.00021650824,0.9673361,0.000037846934,0.000012525487,0.000018142227,0.0000261831,0.00013471473,0.00042568706],"genre_scores_gemma":[0.7392098,0.000696827,0.258966,0.000045934918,0.0000640489,0.00006430332,0.00017782947,0.000089602145,0.000685747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993618,0.00017312271,0.00004187612,0.00012445668,0.00024025852,0.000058423255],"domain_scores_gemma":[0.9958723,0.003128734,0.00047958616,0.00025820048,0.00019802089,0.00006305951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019898582,0.0005396638,0.0006838386,0.0011292063,0.00024431315,0.00093364384,0.0006255634,0.0008053347,0.0008787593],"category_scores_gemma":[0.012172956,0.00027143344,0.0006585556,0.0008659773,0.00067413336,0.0014915541,0.0009463693,0.0011726012,0.00021450638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005105797,0.000109263136,0.0053841835,0.0005101944,0.00016211295,0.0005518816,0.00041180025,0.60061365,0.053312976,0.08823528,0.0006872799,0.24951084],"study_design_scores_gemma":[0.0000073541314,0.000063211024,0.0014521457,0.000024159352,0.00001700356,0.00024660525,0.000024196313,0.9665641,0.007981271,0.023009773,0.00058671576,0.000023448381],"about_ca_topic_score_codex":0.00042697866,"about_ca_topic_score_gemma":0.00028668976,"teacher_disagreement_score":0.0019898582,"about_ca_system_score_codex":0.00037168578,"about_ca_system_score_gemma":0.00034496843,"threshold_uncertainty_score":0.010523498},"labels":[],"label_agreement":null},{"id":"W2586495303","doi":"10.1109/tsp.2017.2664045","title":"Implementation of Sparse Superposition Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Encoder; Code word; Encoding (memory); Algorithm; Code (set theory); Superposition principle; Throughput; Error detection and correction; Set (abstract data type); Parallel computing; Computer engineering; Theoretical computer science; Mathematics; Wireless; Telecommunications; Artificial intelligence","score_opus":0.03805065613208781,"score_gpt":0.33346601522842834,"score_spread":0.29541535909634054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586495303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0595804,0.00040151272,0.9024489,0.000323249,0.00014730799,0.00015658767,0.000326996,0.0038366746,0.032778364],"genre_scores_gemma":[0.57913685,0.0003733542,0.40721503,0.0002198326,0.000064504806,0.00021158825,0.0006761383,0.00012681252,0.011975919],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994267,0.0001007094,0.000036798523,0.00006943123,0.00027357935,0.00009280733],"domain_scores_gemma":[0.99909985,0.00019601347,0.00007263449,0.00024651148,0.00035699378,0.000028085975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039953616,0.00039795865,0.0003470638,0.00046805118,0.0004584597,0.00091158383,0.000873148,0.00051788863,0.006833081],"category_scores_gemma":[0.0019712453,0.0001987034,0.00030917407,0.0006969111,0.00037842194,0.0009993664,0.0008478618,0.0005307607,0.0015644841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005069217,0.00019450035,0.0020997007,0.00041126748,0.00010822005,0.00035001483,0.00041780816,0.13599804,0.13934386,0.19184488,0.011006567,0.51771814],"study_design_scores_gemma":[0.00008375329,0.00043547232,0.0007804667,0.00008304004,0.00006870789,0.0005167368,0.00013045708,0.75310475,0.16050294,0.038248397,0.046006486,0.000038823775],"about_ca_topic_score_codex":0.0018307483,"about_ca_topic_score_gemma":0.0030331726,"teacher_disagreement_score":0.006833081,"about_ca_system_score_codex":0.0006919447,"about_ca_system_score_gemma":0.0013954,"threshold_uncertainty_score":0.022858918},"labels":[],"label_agreement":null},{"id":"W2597718168","doi":"10.1109/tsp.2017.2684747","title":"Time-Varying Mixtures of Markov Chains: An Application to Road Traffic Modeling","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Computer science; Markov process; Road traffic; Markov model; Algorithm; Mathematics; Statistics; Transport engineering; Engineering; Machine learning","score_opus":0.025900503285736624,"score_gpt":0.29939482234440695,"score_spread":0.27349431905867033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597718168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003624952,0.0002330068,0.9953625,0.0001433341,0.000021931703,0.000018871688,0.00003435523,0.00017633235,0.00038458445],"genre_scores_gemma":[0.41946897,0.0016525493,0.5744042,0.00016343301,0.00020728845,0.00020388304,0.0003607656,0.00022137826,0.003317566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923,0.0003464486,0.000035856334,0.00014576165,0.00018451706,0.000057446865],"domain_scores_gemma":[0.99683386,0.0024994675,0.00018615686,0.00016318934,0.00022777962,0.0000895185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021770897,0.0007724477,0.0010194047,0.0009469904,0.0007606325,0.0011213592,0.0015620325,0.0016553759,0.0016785812],"category_scores_gemma":[0.009343802,0.0007958046,0.0013821641,0.0017187978,0.0009792644,0.0014977811,0.0014894926,0.0025733747,0.00041496693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056847148,0.000037170714,0.0011929034,0.000056988494,0.00006177835,0.00012034919,0.0001475071,0.8855928,0.000938211,0.07620613,0.0010565822,0.034532666],"study_design_scores_gemma":[0.000002491937,0.0000038950407,0.000067223846,0.000003899148,0.000005231822,0.000017502987,0.000004145348,0.98750025,0.00010163807,0.011855698,0.0004320652,0.0000059799104],"about_ca_topic_score_codex":0.013931983,"about_ca_topic_score_gemma":0.011415718,"teacher_disagreement_score":0.013931983,"about_ca_system_score_codex":0.0010694059,"about_ca_system_score_gemma":0.0009969282,"threshold_uncertainty_score":0.027701795},"labels":[],"label_agreement":null},{"id":"W2600366014","doi":"10.1109/tsp.2017.2686323","title":"Jointly Optimal Pre- and Post-Channel Equalization and Distributed Beamforming in Asynchronous Bidirectional Relay Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Transceiver; Relay; Beamforming; Computer science; Intersymbol interference; Channel (broadcasting); Equalization (audio); Asynchronous communication; Relay channel; Electronic engineering; Computer network; Power (physics); Telecommunications; Engineering; Wireless","score_opus":0.02707992270245189,"score_gpt":0.2800713897339359,"score_spread":0.252991467031484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600366014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040784284,0.0002526393,0.95648503,0.00013266123,0.000015227601,0.000026383577,0.000050221308,0.00007630687,0.0021772587],"genre_scores_gemma":[0.91035527,0.00051212264,0.085103355,0.00005331554,0.000031580792,0.00013579652,0.00007075411,0.00003274726,0.0037050487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995022,0.00020790644,0.000019328687,0.00008970335,0.00009336101,0.00008742764],"domain_scores_gemma":[0.9992467,0.0004819906,0.00010157202,0.00003505652,0.000103937,0.000030654297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008218184,0.0010276575,0.00080997543,0.0002733954,0.0002882465,0.0007217244,0.0006367365,0.00089061743,0.0010769607],"category_scores_gemma":[0.0023756905,0.00043105008,0.00025588294,0.00045279707,0.0007183549,0.00084464165,0.0007291235,0.00047963293,0.00032047942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006592753,0.000026425476,0.0001883936,0.00004042213,0.0000115758785,0.000059979626,0.00003714682,0.9704057,0.003714999,0.010765202,0.00020029146,0.0144839045],"study_design_scores_gemma":[0.0000110997335,0.00003308192,0.000042977885,0.000002628174,0.000004812516,0.000010289481,0.000010074052,0.99523443,0.0006346536,0.0039069257,0.00010466434,0.0000043926075],"about_ca_topic_score_codex":0.0028664551,"about_ca_topic_score_gemma":0.003337979,"teacher_disagreement_score":0.0028664551,"about_ca_system_score_codex":0.0006568497,"about_ca_system_score_gemma":0.00092134625,"threshold_uncertainty_score":0.0056995153},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03388292182735758,"score_gpt":0.311307947499687,"score_spread":0.2774250256723294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601496744","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021044936,0.00055709615,0.9703537,0.00016929318,0.00007652899,0.0001187968,0.00019800932,0.0022414671,0.005240099],"genre_scores_gemma":[0.24335037,0.00082890014,0.7464195,0.00028420685,0.0001180664,0.00021871802,0.00072777283,0.00017114835,0.007881298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995158,0.00008839136,0.00003295889,0.00005277374,0.0002587695,0.000051238974],"domain_scores_gemma":[0.9991146,0.0003236859,0.00012129172,0.00014066893,0.00026941017,0.000030430261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049492915,0.00062106596,0.00040841865,0.0009062816,0.0005277422,0.0008416726,0.0009127342,0.00048251502,0.0028920854],"category_scores_gemma":[0.0017542981,0.00026273608,0.00030032845,0.0008724549,0.0005208056,0.0008594172,0.00078181666,0.0008915111,0.0017966434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007116024,0.00011621212,0.0012288924,0.00043654398,0.00006768818,0.00039009744,0.00031713155,0.13933843,0.20703466,0.0834044,0.010270982,0.55668336],"study_design_scores_gemma":[0.000118441145,0.00033630154,0.00056863675,0.00008118114,0.000041023024,0.0005972866,0.000048988688,0.7891734,0.16680324,0.015527086,0.026625352,0.00007904191],"about_ca_topic_score_codex":0.0020254597,"about_ca_topic_score_gemma":0.004290972,"teacher_disagreement_score":0.0028920854,"about_ca_system_score_codex":0.00077802705,"about_ca_system_score_gemma":0.0014137654,"threshold_uncertainty_score":0.009674966},"labels":[],"label_agreement":null},{"id":"W2608827279","doi":"10.1109/tsp.2017.2768043","title":"Low-Complexity Robust MISO Downlink Precoder Design With Per-Antenna Power Constraints","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Beamforming; Precoding; Computational complexity theory; Channel state information; Computer science; Maximization; Base station; Mathematical optimization; Robustness (evolution); Offset (computer science); Transmitter power output; Signal-to-noise ratio (imaging); MIMO; Control theory (sociology); Channel (broadcasting); Algorithm; Mathematics; Wireless; Transmitter; Telecommunications","score_opus":0.040604230707624575,"score_gpt":0.25034251034663246,"score_spread":0.20973827963900787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608827279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035417092,0.00012175385,0.9949239,0.000059355636,0.000014663429,0.000020843738,0.000030292686,0.00010160515,0.0011860401],"genre_scores_gemma":[0.4722869,0.0007169969,0.5223772,0.00021068608,0.00011948017,0.0002787907,0.00020494414,0.00007983856,0.003725232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950147,0.00015543004,0.00002626464,0.0000785311,0.00018353932,0.00005488679],"domain_scores_gemma":[0.99945587,0.00028392315,0.00008598493,0.000050671108,0.00010509065,0.000018459143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055781205,0.0012968391,0.0008902475,0.00026302133,0.0002183122,0.000950012,0.00053615985,0.0007064123,0.0016881557],"category_scores_gemma":[0.0020568771,0.00047562487,0.00038071533,0.00039565042,0.0004964766,0.000730178,0.00048415147,0.00072315714,0.0007549386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009863262,0.00003472734,0.00041935834,0.00019206676,0.000055847988,0.000094902294,0.000089357076,0.8800632,0.014378244,0.020591475,0.0013254149,0.08265677],"study_design_scores_gemma":[0.000020403779,0.00010647522,0.000116053685,0.000013478952,0.000014938377,0.000068477035,0.000021174206,0.9887523,0.005076259,0.004329762,0.0014684958,0.000012199629],"about_ca_topic_score_codex":0.0009360932,"about_ca_topic_score_gemma":0.0015437808,"teacher_disagreement_score":0.0016881557,"about_ca_system_score_codex":0.00041224915,"about_ca_system_score_gemma":0.0009794524,"threshold_uncertainty_score":0.005647421},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"MIMO; Computer science; Mathematics; Beamforming; Telecommunications","score_opus":0.011575970566100095,"score_gpt":0.219952037435914,"score_spread":0.2083760668698139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2643502490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076704025,0.0020847293,0.89474326,0.0006694121,0.0000771692,0.00011115183,0.0002901338,0.00037999626,0.024940167],"genre_scores_gemma":[0.9665423,0.0015581729,0.029562391,0.00014569332,0.00016709749,0.00018059622,0.00013919162,0.000066324705,0.0016382367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843377,0.00048995385,0.0000557938,0.00019986113,0.0006008527,0.00021971563],"domain_scores_gemma":[0.9950193,0.0034699934,0.0005801745,0.0004307258,0.00040469388,0.000095096904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010827056,0.0015359685,0.00083377236,0.0010113866,0.0004649475,0.0016770676,0.0010049045,0.0011049433,0.0018728032],"category_scores_gemma":[0.007335246,0.00033696293,0.00044762273,0.0011568575,0.0013915336,0.0024007063,0.0014682099,0.00112042,0.00050035305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014717646,0.00011697005,0.0018783655,0.00035500914,0.00005191059,0.0006380954,0.00014422098,0.7481431,0.02953235,0.18132485,0.0015228158,0.036145173],"study_design_scores_gemma":[0.0000068322224,0.00022325097,0.0011898035,0.000058986727,0.000024859946,0.00084515463,0.00007736036,0.94240415,0.011005364,0.04233403,0.001793495,0.000036677986],"about_ca_topic_score_codex":0.00047189964,"about_ca_topic_score_gemma":0.0002840989,"teacher_disagreement_score":0.0018728032,"about_ca_system_score_codex":0.0009079969,"about_ca_system_score_gemma":0.0004280864,"threshold_uncertainty_score":0.006588042},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"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","score_opus":0.014447005134116892,"score_gpt":0.23535213643466163,"score_spread":0.22090513130054473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2706056020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06472588,0.00057937216,0.92714685,0.0004269408,0.00006214283,0.000064834676,0.00008389487,0.00017221957,0.006737832],"genre_scores_gemma":[0.95432496,0.00049043196,0.043839585,0.00008551266,0.00010778241,0.000077270895,0.000048176986,0.000014621051,0.0010117049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895453,0.00043278324,0.00003163749,0.00013855331,0.0003035492,0.0001388491],"domain_scores_gemma":[0.99681336,0.0021514376,0.00034321035,0.00045420876,0.0001676593,0.00007013523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077865564,0.00097340555,0.00069188897,0.0003516258,0.000396332,0.0011309292,0.00096489454,0.00081104203,0.0010694038],"category_scores_gemma":[0.004577952,0.0003024049,0.00030314445,0.0006717137,0.0012224482,0.0019656527,0.0016246422,0.00081100303,0.00019557883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021939879,0.00014875042,0.002561557,0.00024732074,0.00005432708,0.00056739,0.00009252662,0.77325934,0.018625336,0.13757724,0.0013297151,0.06531709],"study_design_scores_gemma":[0.000007393866,0.000135421,0.00061255577,0.000015545687,0.000011632849,0.00028376863,0.000029879402,0.97567457,0.0036146461,0.01892773,0.000671755,0.000015120369],"about_ca_topic_score_codex":0.0005881414,"about_ca_topic_score_gemma":0.00053486694,"teacher_disagreement_score":0.0011309292,"about_ca_system_score_codex":0.0005943063,"about_ca_system_score_gemma":0.00039879905,"threshold_uncertainty_score":0.004311979},"labels":[],"label_agreement":null},{"id":"W2744046002","doi":"10.1109/tsp.2017.2739102","title":"Optimal Joint Remote Radio Head Selection and Beamforming Design for Limited Fronthaul C-RAN","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Mathematical optimization; Computer science; Beamforming; C-RAN; Remote radio head; Telecommunications link; Subgradient method; Optimization problem; Convex optimization; Transmitter power output; Algorithm; Radio access network; Cognitive radio; Mathematics; Wireless; Transmitter; Regular polygon; Base station","score_opus":0.038203231650885634,"score_gpt":0.266072306285456,"score_spread":0.22786907463457035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744046002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00972104,0.00026903668,0.9874992,0.000090616355,0.000020159918,0.00004304184,0.000030670777,0.0001726908,0.0021535305],"genre_scores_gemma":[0.5819446,0.0007881728,0.41315883,0.00019465065,0.00008424086,0.00029718137,0.00018692648,0.000121667865,0.0032237514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994636,0.00018881193,0.00001533332,0.00009493136,0.00013703844,0.000100211575],"domain_scores_gemma":[0.99940133,0.0003578655,0.00008073084,0.000030491583,0.00008624214,0.00004333443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007755768,0.0015818825,0.0011987089,0.00037744967,0.00037734717,0.001039575,0.0008375376,0.0009705426,0.0024583978],"category_scores_gemma":[0.0015761303,0.00059879915,0.0006646421,0.0006060029,0.00072216475,0.000751126,0.00091692543,0.0009743051,0.0005814676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006713697,0.000044619468,0.00027479677,0.000081468876,0.000023249604,0.00008918631,0.000029540872,0.9649221,0.003842316,0.0043769227,0.0007911887,0.025457563],"study_design_scores_gemma":[0.00000820954,0.000039714585,0.000049156817,0.0000041420703,0.000006326048,0.000017616352,0.00001034164,0.9978623,0.00065359595,0.0010879312,0.00025588277,0.000004835445],"about_ca_topic_score_codex":0.0035789385,"about_ca_topic_score_gemma":0.0040552756,"teacher_disagreement_score":0.0035789385,"about_ca_system_score_codex":0.0005508809,"about_ca_system_score_gemma":0.0015057299,"threshold_uncertainty_score":0.00822413},"labels":[],"label_agreement":null},{"id":"W2751804009","doi":"10.1109/tsp.2017.2745454","title":"On Linear Precoding for the Two-User MISO Broadcast Channel With Confidential Messages and Per-Antenna Constraints","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Precoding; Transmitter; Computer science; Secure transmission; Maximization; Channel (broadcasting); Optimization problem; Mathematical optimization; Artificial noise; Secrecy; Transmission (telecommunications); Multi-user; Zero-forcing precoding; Antenna (radio); MIMO; Algorithm; Computer network; Mathematics; Telecommunications","score_opus":0.027056103019477792,"score_gpt":0.2831523528942052,"score_spread":0.2560962498747274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751804009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011996405,0.0008218744,0.9825811,0.00033980704,0.000053548953,0.00004860474,0.000093314644,0.00007649415,0.003988817],"genre_scores_gemma":[0.77032477,0.0045414316,0.21427971,0.00043352315,0.00036927935,0.0003971466,0.00028750513,0.0000932372,0.009273483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989496,0.00042909838,0.000035294364,0.00014530553,0.00031369147,0.00012706814],"domain_scores_gemma":[0.99668056,0.0024844154,0.00031279307,0.00014092085,0.00032938243,0.00005189373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013317779,0.0017912477,0.0012609072,0.00053545786,0.00039682552,0.0011755236,0.00070961803,0.0013673102,0.0024751553],"category_scores_gemma":[0.0055177794,0.0005355791,0.0005610008,0.0012422506,0.0015512723,0.0012661392,0.0011563275,0.0013040204,0.0007258512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009837757,0.000039044662,0.00021743454,0.00024724548,0.000043197277,0.00018672289,0.00014071296,0.94465,0.003533745,0.033432115,0.0012003497,0.016211137],"study_design_scores_gemma":[0.000018205883,0.00007375156,0.00007079197,0.00001793907,0.000013327129,0.00004921996,0.000023549179,0.98798895,0.0010003215,0.010223758,0.000505673,0.00001449827],"about_ca_topic_score_codex":0.0030470195,"about_ca_topic_score_gemma":0.003165371,"teacher_disagreement_score":0.0030470195,"about_ca_system_score_codex":0.0011041337,"about_ca_system_score_gemma":0.0013233431,"threshold_uncertainty_score":0.008280158},"labels":[],"label_agreement":null},{"id":"W2762632680","doi":"10.1109/tsp.2014.2304431","title":"Active Learning of Multiple Source Multiple Destination Topologies","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Merge (version control); Subnetwork; Network topology; Computer science; Upper and lower bounds; Algorithm; Topology (electrical circuits); Focus (optics); Binary number; Binary logarithm; Greedy algorithm; Theoretical computer science; Mathematics; Combinatorics; Discrete mathematics; Computer network","score_opus":0.015328202565357161,"score_gpt":0.25229379681255065,"score_spread":0.2369655942471935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762632680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041736685,0.00035505305,0.95520157,0.0006023242,0.000043781878,0.000059833485,0.0002486409,0.0005056664,0.0012463582],"genre_scores_gemma":[0.78827196,0.00034091927,0.20590588,0.00027739574,0.00014387081,0.0002119256,0.0008218479,0.00011035462,0.003915832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985991,0.0005471894,0.00005337759,0.00039554285,0.00026018714,0.00014458274],"domain_scores_gemma":[0.9906392,0.007383087,0.0006627703,0.0005053131,0.0005106855,0.00029896825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028363315,0.0010017677,0.0017238919,0.0013684728,0.0007345358,0.0018731599,0.003953007,0.002406383,0.0016879926],"category_scores_gemma":[0.01087178,0.0009797096,0.0010841597,0.0015910448,0.001336963,0.004987878,0.0021974037,0.00243494,0.00038116073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022862024,0.000068610476,0.0015561327,0.000071429386,0.00005213461,0.00016503435,0.00012424627,0.9465331,0.00093746267,0.013404792,0.0009001942,0.03595824],"study_design_scores_gemma":[0.0000061938667,0.000009500718,0.00008374488,0.0000035511985,0.0000041062285,0.000012648411,0.000012903441,0.9911361,0.0003000868,0.008252238,0.00017597085,0.0000030703704],"about_ca_topic_score_codex":0.0030852978,"about_ca_topic_score_gemma":0.003230589,"teacher_disagreement_score":0.003953007,"about_ca_system_score_codex":0.0013791176,"about_ca_system_score_gemma":0.00064839364,"threshold_uncertainty_score":0.0150001645},"labels":[],"label_agreement":null},{"id":"W2763873148","doi":"10.1109/tsp.2014.2347262","title":"A Scalable Successive-Cancellation Decoder for Polar Codes","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Polar code; Scalability; Decoding methods; Field-programmable gate array; Polar; Code (set theory); Algorithm; Stratix; Turbo code; Computer engineering; Parallel computing; Computer hardware","score_opus":0.020923846957244002,"score_gpt":0.277401175074097,"score_spread":0.256477328116853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763873148","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029421227,0.00030898763,0.9612288,0.0001543472,0.00011251294,0.00008174718,0.00016901715,0.0016843979,0.006838944],"genre_scores_gemma":[0.3115918,0.0005266353,0.67680776,0.0002500902,0.00011643065,0.00011442307,0.0005984737,0.00010964394,0.009884724],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996928,0.000035449095,0.000016054284,0.00004727508,0.00017890379,0.000029501973],"domain_scores_gemma":[0.9995999,0.00010813816,0.00003137818,0.000059138023,0.0001821199,0.000019436238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029136395,0.00046024955,0.00035895145,0.00042325706,0.00034029322,0.0006048907,0.000680508,0.0003714844,0.0027063063],"category_scores_gemma":[0.000809204,0.00019886848,0.00028042076,0.00048399623,0.00029259603,0.00072274683,0.00057232205,0.0006921194,0.001138808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063382863,0.00011381449,0.00068987225,0.00028437114,0.000060777464,0.00037910676,0.00015135495,0.11821623,0.4447156,0.055647526,0.007897339,0.37121016],"study_design_scores_gemma":[0.00008073914,0.00025989593,0.000290902,0.00002780248,0.000039089762,0.00031183226,0.000027595037,0.79689914,0.1796052,0.0079452535,0.014479382,0.000033085635],"about_ca_topic_score_codex":0.0016840277,"about_ca_topic_score_gemma":0.003840918,"teacher_disagreement_score":0.0027063063,"about_ca_system_score_codex":0.00049678684,"about_ca_system_score_gemma":0.0011577096,"threshold_uncertainty_score":0.009053528},"labels":[],"label_agreement":null},{"id":"W2766826897","doi":"10.1109/tsp.2017.2768040","title":"Online Joint Power Control for Two-Hop Wireless Relay Networks With Energy Harvesting","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Fading; Power control; Relay; Computer science; Lyapunov optimization; Online algorithm; Optimization problem; Mathematical optimization; Wireless; Heuristic; Relay channel; Control theory (sociology); Computer network; Power (physics); Telecommunications; Algorithm; Mathematics; Channel (broadcasting); Control (management); Artificial intelligence","score_opus":0.016940400264516993,"score_gpt":0.2337642444111869,"score_spread":0.21682384414666991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766826897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016667966,0.00018017512,0.9818401,0.00009918194,0.00001811077,0.000022480785,0.000012584243,0.00013997623,0.0010193851],"genre_scores_gemma":[0.95107985,0.0002100125,0.046989277,0.000050993534,0.00002511995,0.0000867277,0.00002224524,0.000030937637,0.0015047161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994885,0.00014911233,0.000031136286,0.00013895829,0.00012700484,0.00006538091],"domain_scores_gemma":[0.9988612,0.00074263493,0.0001635649,0.00009347062,0.000099869525,0.000039180697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010711505,0.0010226322,0.0009499798,0.0002831673,0.00035799202,0.0009494269,0.0011239038,0.0007765771,0.0011655127],"category_scores_gemma":[0.002272736,0.0004572475,0.00043755854,0.00045419706,0.0008630974,0.0013035826,0.0011213121,0.0009107894,0.00022376685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007304325,0.000056534383,0.00021883249,0.00006954797,0.000023899294,0.00009194113,0.00008566719,0.9498714,0.0044144727,0.007596065,0.00034847448,0.037150208],"study_design_scores_gemma":[0.000006294571,0.00002320165,0.000022860226,0.0000016763439,0.0000033997621,0.000012027368,0.0000049151745,0.9975116,0.0004963216,0.001830146,0.000084868836,0.0000025634768],"about_ca_topic_score_codex":0.0013539045,"about_ca_topic_score_gemma":0.0013206053,"teacher_disagreement_score":0.0013539045,"about_ca_system_score_codex":0.0005547201,"about_ca_system_score_gemma":0.0006038262,"threshold_uncertainty_score":0.005664885},"labels":[],"label_agreement":null},{"id":"W2772656689","doi":"10.1109/tsp.2018.2847626","title":"Low-Latency Multiuser Two-Way Wireless Relaying for Spectral and Energy Efficiencies","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Electrical, Communications and Cyber Systems; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; Royal Academy of Engineering; National Science Foundation","keywords":"Computer science; Quality of service; Computer network; Spectral efficiency; Wireless; Latency (audio); Bandwidth (computing); Relay; Telecommunications; Channel (broadcasting); Power (physics)","score_opus":0.016570297716337383,"score_gpt":0.2406063897328354,"score_spread":0.22403609201649802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772656689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018552661,0.0016308939,0.9706965,0.0002443085,0.00004192772,0.000029891182,0.000024271736,0.00013147054,0.008647919],"genre_scores_gemma":[0.8518206,0.0017919481,0.1387627,0.00009359968,0.00005733574,0.00007794664,0.000030865664,0.000056163313,0.007308854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996332,0.00014332155,0.000012250182,0.00004685382,0.00011609157,0.00004822908],"domain_scores_gemma":[0.99943465,0.00037717973,0.000053573985,0.000059524067,0.000059406786,0.000015541129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005488809,0.00080472714,0.0005149976,0.00030865718,0.00038312245,0.0012204738,0.00078450073,0.00076487387,0.002068224],"category_scores_gemma":[0.001575419,0.00022515621,0.00036606082,0.0005473953,0.0005098848,0.0015703773,0.0007451113,0.00062318664,0.00049029785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011700953,0.000099418496,0.00027663328,0.00029586206,0.00003720685,0.00024974582,0.00013061389,0.6668892,0.03228574,0.22242472,0.0013055822,0.075888224],"study_design_scores_gemma":[0.000011483289,0.00009246246,0.00009565781,0.000019641688,0.000013774034,0.0001322318,0.000026774464,0.9587922,0.0054685003,0.031413656,0.0039193803,0.000014280394],"about_ca_topic_score_codex":0.0004760317,"about_ca_topic_score_gemma":0.00091479404,"teacher_disagreement_score":0.002068224,"about_ca_system_score_codex":0.0007053545,"about_ca_system_score_gemma":0.00049610046,"threshold_uncertainty_score":0.006918907},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fading; Computer science; Channel (broadcasting); Base station; False alarm; Algorithm; Compressed sensing; Wireless; Signature (topology); Mathematics; Telecommunications; Artificial intelligence","score_opus":0.027961805528940026,"score_gpt":0.25902858534250167,"score_spread":0.23106677981356163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784331297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019283673,0.00016460069,0.97914004,0.00021322923,0.000024140558,0.000023830726,0.000044966502,0.0001466676,0.000958829],"genre_scores_gemma":[0.8454943,0.00048404763,0.15134132,0.00017251287,0.00012134196,0.000101507874,0.00021152447,0.000039093888,0.002034405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995252,0.00015550373,0.000013569454,0.00008900784,0.00016617819,0.00005052214],"domain_scores_gemma":[0.9978744,0.0014995917,0.00022922308,0.00018025811,0.00015572138,0.000060798684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006092187,0.000498008,0.0005054291,0.0005296506,0.00024129974,0.0006256057,0.0006320441,0.0007135189,0.0007983225],"category_scores_gemma":[0.0054251933,0.00027332685,0.00028505066,0.0006858275,0.00082257885,0.0011318771,0.0009145601,0.0007947175,0.00018947445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014691766,0.000051408937,0.0014826221,0.000098592776,0.00003865385,0.00027524165,0.00012082767,0.8373162,0.009059177,0.045569684,0.0013828924,0.10445778],"study_design_scores_gemma":[0.0000054573534,0.000027259615,0.00025649605,0.0000042154834,0.0000035424443,0.00006191614,0.00001238638,0.9878342,0.00077881775,0.010587155,0.00042428373,0.0000042208176],"about_ca_topic_score_codex":0.0014737549,"about_ca_topic_score_gemma":0.0014301975,"teacher_disagreement_score":0.0014737549,"about_ca_system_score_codex":0.00048613234,"about_ca_system_score_gemma":0.0004738439,"threshold_uncertainty_score":0.0035271645},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012934412914709816,"score_gpt":0.24868979288348111,"score_spread":0.2357553799687713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788350651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012856526,0.004767038,0.97618425,0.00093916943,0.00030634628,0.000029409759,0.000037507478,0.00006541407,0.016385255],"genre_scores_gemma":[0.41542548,0.029294685,0.51698065,0.0016220715,0.0029164618,0.00059734937,0.00016397379,0.00023668462,0.03276258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993994,0.00026727282,0.000029827544,0.00008343949,0.00017244554,0.00004768119],"domain_scores_gemma":[0.9994223,0.00041018566,0.000054698878,0.000043683838,0.000057284586,0.000011879138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001074034,0.0010954103,0.00072427857,0.00046248297,0.0004904243,0.0016362882,0.0006440526,0.001298627,0.004075126],"category_scores_gemma":[0.002093645,0.0003116861,0.0005885047,0.0011700903,0.0014493142,0.0014936016,0.0009730009,0.002001497,0.0007066157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028395581,0.000041218947,0.00014056692,0.00037871682,0.000032640317,0.000087754626,0.000109538465,0.21892203,0.003259574,0.634674,0.008345337,0.1339801],"study_design_scores_gemma":[0.0000119565375,0.00009726036,0.00018422972,0.000130345,0.000019009403,0.000116704745,0.00004708459,0.6354703,0.0016611983,0.31947523,0.042763017,0.000023683997],"about_ca_topic_score_codex":0.0010225899,"about_ca_topic_score_gemma":0.00062540214,"teacher_disagreement_score":0.004075126,"about_ca_system_score_codex":0.0009932739,"about_ca_system_score_gemma":0.0007918473,"threshold_uncertainty_score":0.013632715},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.034111778264445676,"score_gpt":0.2986854867013103,"score_spread":0.2645737084368646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788428941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010371883,0.00039447806,0.993437,0.00026723472,0.00008101879,0.000019700847,0.000014486981,0.00003105722,0.004717884],"genre_scores_gemma":[0.26431516,0.0034329784,0.7160622,0.0005580051,0.00072145765,0.00036809396,0.00008351383,0.00018674758,0.014271844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924743,0.00034716242,0.000027231958,0.00008444587,0.00022749626,0.00006619723],"domain_scores_gemma":[0.9993311,0.00044333772,0.00006859555,0.00006960166,0.00006813864,0.000019180694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015009042,0.0007840239,0.00065147894,0.00055192626,0.00048734932,0.0015357938,0.0007425815,0.0011679356,0.0032332668],"category_scores_gemma":[0.0028511197,0.00036545968,0.00075274176,0.0009568011,0.0012396406,0.0014759846,0.0011612704,0.0020014008,0.0005472766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002382192,0.000044535478,0.00014569971,0.00013329113,0.00002351481,0.000049224167,0.00008125226,0.34560814,0.003029178,0.56786996,0.0042893817,0.078702025],"study_design_scores_gemma":[0.000006234248,0.000028240449,0.000055036697,0.000023663111,0.000005758428,0.00003067905,0.000015938547,0.86022097,0.00086123333,0.12897259,0.009771528,0.00000827553],"about_ca_topic_score_codex":0.0009403505,"about_ca_topic_score_gemma":0.000599379,"teacher_disagreement_score":0.0032332668,"about_ca_system_score_codex":0.0011866988,"about_ca_system_score_gemma":0.0009786442,"threshold_uncertainty_score":0.010816336},"labels":[],"label_agreement":null},{"id":"W2796165036","doi":"10.1109/tsp.2018.2879031","title":"Learning Tensors From Partial Binary Measurements","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Bounded function; Binary number; Matrix norm; Mathematics; Rank (graph theory); Sample complexity; Combinatorics; Context (archaeology); Matrix (chemical analysis); Low-rank approximation; Order (exchange); Norm (philosophy); Discrete mathematics; Computational complexity theory; Algorithm; Computer science; Pure mathematics; Mathematical analysis; Physics; Arithmetic; Artificial intelligence; Eigenvalues and eigenvectors","score_opus":0.09392853624470889,"score_gpt":0.3342651369320856,"score_spread":0.24033660068737672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796165036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02924134,0.0002460381,0.9672316,0.0006188037,0.00007429512,0.000041384126,0.00058980065,0.0007471046,0.0012096654],"genre_scores_gemma":[0.5160289,0.0009951227,0.47062802,0.0004951361,0.00047375166,0.00022537683,0.0038620234,0.00037428192,0.006917422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979545,0.0006380555,0.000121478995,0.00054281874,0.00048275478,0.0002604021],"domain_scores_gemma":[0.99417454,0.0024437523,0.00071323523,0.0017225571,0.00062981393,0.0003161942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001997188,0.0018926112,0.0015190844,0.0010366727,0.0006789649,0.0017949021,0.0016775419,0.0017773109,0.0033076056],"category_scores_gemma":[0.013771692,0.0007465115,0.0011011494,0.0015240134,0.0019330352,0.004700556,0.00256978,0.0031552555,0.001406519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009957782,0.0001734636,0.003281269,0.0004888319,0.00016115322,0.00037122637,0.00032099892,0.57279974,0.020902993,0.17405795,0.011504729,0.21494184],"study_design_scores_gemma":[0.000015160928,0.00005548235,0.00042088114,0.000018402463,0.0000118967155,0.000059896796,0.00003137573,0.9190534,0.00321785,0.07562823,0.001460009,0.000027479955],"about_ca_topic_score_codex":0.0054916884,"about_ca_topic_score_gemma":0.0044014063,"teacher_disagreement_score":0.0054916884,"about_ca_system_score_codex":0.0012414319,"about_ca_system_score_gemma":0.0017098702,"threshold_uncertainty_score":0.011065066},"labels":[],"label_agreement":null},{"id":"W2804575066","doi":"10.1109/tsp.2018.2847692","title":"Joint Detection and Localization of an Unknown Number of Sources Using the Algebraic Structure of the Noise Subspace","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"King Abdullah University of Science and Technology; Academy of Finland; Natural Sciences and Engineering Research Council of Canada; Technische Universiteit Delft; Massachusetts Institute of Technology","keywords":"Subspace topology; Orthogonality; Noise (video); Algorithm; Linear subspace; Greatest common divisor; Computer science; Mathematics; Signal subspace; A priori and a posteriori; Noise measurement; Pattern recognition (psychology); Artificial intelligence; Noise reduction","score_opus":0.016648775591504125,"score_gpt":0.26859820962020897,"score_spread":0.25194943402870484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804575066","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059602647,0.00010481511,0.9934416,0.0000639396,0.000016872169,0.000013745512,0.000012414837,0.000102419486,0.00028388447],"genre_scores_gemma":[0.21808723,0.00044056404,0.77979624,0.000082977196,0.000094200324,0.000098195276,0.00014099358,0.000049706076,0.0012099264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984938,0.00043455348,0.000101636324,0.00042529425,0.00043292847,0.000111810834],"domain_scores_gemma":[0.9969157,0.0018190276,0.00041290236,0.0003520093,0.00039330262,0.00010719993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013981981,0.0013686103,0.0016027053,0.0014108623,0.00058832916,0.0012057613,0.0011787361,0.001129762,0.00087893725],"category_scores_gemma":[0.0093922755,0.00045242542,0.00078955444,0.0014184152,0.00145429,0.0028192406,0.0028672554,0.0012026861,0.0006637242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055539986,0.00015312561,0.0029734736,0.00037606855,0.00011970557,0.00030294163,0.00035139633,0.2411891,0.06681999,0.057765134,0.001380156,0.6280136],"study_design_scores_gemma":[0.000058039335,0.00022783448,0.0006811112,0.000029768073,0.00003630461,0.00047467105,0.0000845165,0.94011146,0.024226138,0.031509254,0.002508408,0.00005253518],"about_ca_topic_score_codex":0.00059632934,"about_ca_topic_score_gemma":0.0009115887,"teacher_disagreement_score":0.0016027053,"about_ca_system_score_codex":0.0004183494,"about_ca_system_score_gemma":0.001111395,"threshold_uncertainty_score":0.007394433},"labels":[],"label_agreement":null},{"id":"W2809399383","doi":"10.1109/tsp.2018.2844222","title":"Joint Carrier Frequency Offset and Doubly Selective Channel Estimation for MIMO-OFDMA Uplink With Kalman and Particle Filtering","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Carrier frequency offset; Kalman filter; Computer science; Orthogonal frequency-division multiplexing; Algorithm; MIMO; Minimum mean square error; Telecommunications link; Orthogonal frequency-division multiple access; Channel (broadcasting); Cramér–Rao bound; Control theory (sociology); Frequency offset; Mathematics; Estimation theory; Telecommunications; Statistics; Artificial intelligence; Estimator","score_opus":0.023092641249490915,"score_gpt":0.2597032477863035,"score_spread":0.23661060653681257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809399383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047379406,0.00019221069,0.9945359,0.00003116957,0.000026398051,0.000008800545,0.00001140175,0.000105425475,0.00035067002],"genre_scores_gemma":[0.4648296,0.0008048831,0.5315919,0.00007580696,0.00014284892,0.000112767884,0.000152782,0.000041931908,0.0022474278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994153,0.00012958009,0.000043210937,0.00010917556,0.00024271304,0.00006002003],"domain_scores_gemma":[0.9992624,0.00035268365,0.00009495625,0.00010795516,0.00015685661,0.000025113028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008121267,0.00072729425,0.0008993637,0.0004930022,0.0004410723,0.00064974494,0.00059161364,0.0007465507,0.00050905754],"category_scores_gemma":[0.002712629,0.0004284512,0.0006682557,0.0006485157,0.00050092686,0.0010831867,0.000805591,0.00085740583,0.00029909122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002016436,0.00008617774,0.0024738796,0.0001734855,0.00013692379,0.0001291169,0.0002059,0.6106315,0.011691021,0.020812284,0.0014524198,0.35200566],"study_design_scores_gemma":[0.0000058135915,0.000024455345,0.0002330891,0.000004193539,0.000009889338,0.000024519753,0.00000775796,0.99648833,0.0014717795,0.0012554987,0.00046392693,0.000010785045],"about_ca_topic_score_codex":0.006780934,"about_ca_topic_score_gemma":0.0071991365,"teacher_disagreement_score":0.006780934,"about_ca_system_score_codex":0.0004130723,"about_ca_system_score_gemma":0.0012229827,"threshold_uncertainty_score":0.013482928},"labels":[],"label_agreement":null},{"id":"W2834583499","doi":"10.1109/tsp.2019.2905816","title":"Invertible Particle-Flow-Based Sequential MCMC With Extension to Gaussian Mixture Noise Models","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Invertible matrix; Markov chain Monte Carlo; Extension (predicate logic); Gaussian noise; Noise (video); Computer science; Flow (mathematics); Mixture model; Algorithm; Gaussian; Mathematics; Applied mathematics; Artificial intelligence; Bayesian probability; Physics","score_opus":0.0627742192309373,"score_gpt":0.3122832249035105,"score_spread":0.24950900567257323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2834583499","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023580925,0.000046689132,0.9969892,0.000041881616,0.000015474327,0.000019134684,0.000016788159,0.00018214333,0.00033065508],"genre_scores_gemma":[0.34824207,0.00031750713,0.64686584,0.00017920934,0.000108224194,0.00030809923,0.0003580666,0.00022565993,0.0033953644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991673,0.00023214101,0.000046627163,0.00018645798,0.00028739223,0.00008007276],"domain_scores_gemma":[0.997544,0.0015789195,0.00016964908,0.00023216559,0.00038814955,0.00008702674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018001246,0.0008247886,0.0012381903,0.0007720422,0.00056004204,0.00069520995,0.0018596451,0.0011422461,0.0025708533],"category_scores_gemma":[0.006828759,0.00068161334,0.0011145974,0.00090863724,0.0010130844,0.0011590094,0.001423538,0.0018758435,0.0005440911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010064477,0.000056245557,0.0008720327,0.000091204616,0.000053962223,0.000090646354,0.0001197821,0.8755828,0.0020870625,0.03712255,0.000997616,0.08282545],"study_design_scores_gemma":[0.000004001275,0.000004222547,0.000030002242,0.0000015449243,0.0000027257379,0.0000062868503,0.0000012670602,0.9968612,0.00023763272,0.0026394797,0.00020852951,0.0000031402806],"about_ca_topic_score_codex":0.0143769365,"about_ca_topic_score_gemma":0.011187758,"teacher_disagreement_score":0.0143769365,"about_ca_system_score_codex":0.00082260853,"about_ca_system_score_gemma":0.0023392953,"threshold_uncertainty_score":0.028586507},"labels":[],"label_agreement":null},{"id":"W2892367793","doi":"10.1109/tsp.2018.2870357","title":"Number of Source Signal Estimation by the Mean Squared Eigenvalue Error","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mean squared error; Eigenvalues and eigenvectors; Robustness (evolution); Mathematics; Algorithm; Statistics; Signal-to-noise ratio (imaging); Noise (video); Probabilistic logic; Applied mathematics; Mathematical optimization; Computer science; Artificial intelligence","score_opus":0.021999457757364383,"score_gpt":0.2979845168372073,"score_spread":0.2759850590798429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892367793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008573025,0.00022492932,0.99036574,0.00008139745,0.000030618652,0.000016415654,0.000029524179,0.00009126416,0.00058707164],"genre_scores_gemma":[0.45309654,0.00082771794,0.54195637,0.000119617886,0.00018310652,0.00019815666,0.0002796535,0.00013634085,0.0032024465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970126,0.00096859114,0.00022679381,0.0006282591,0.0010546243,0.00010920588],"domain_scores_gemma":[0.99318624,0.0042598485,0.00080244057,0.00074060133,0.00091482233,0.00009593452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002462022,0.0011872703,0.0013492556,0.0011191453,0.00042208497,0.0014484071,0.001281267,0.0012274507,0.0010229937],"category_scores_gemma":[0.019033646,0.00058645563,0.00064032426,0.0012064294,0.0011906095,0.0029601427,0.001608262,0.0010753307,0.00046250326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004904447,0.00006711577,0.004237984,0.00034599364,0.00020439376,0.0002462958,0.00019717224,0.7059257,0.02349865,0.041468702,0.0013281334,0.22198944],"study_design_scores_gemma":[0.000006366199,0.00003257227,0.00048736855,0.00001749334,0.000010311951,0.00010308082,0.000013213534,0.9851062,0.0037605457,0.009870443,0.000572458,0.000019972535],"about_ca_topic_score_codex":0.0009059418,"about_ca_topic_score_gemma":0.00085705623,"teacher_disagreement_score":0.002462022,"about_ca_system_score_codex":0.00056697003,"about_ca_system_score_gemma":0.0009346224,"threshold_uncertainty_score":0.013020515},"labels":[],"label_agreement":null},{"id":"W2895487882","doi":"10.1109/tsp.2018.2872832","title":"CEASE: A Collaborative Event-Triggered Average-Consensus Sampled-Data Framework With Performance Guarantees for Multi-Agent Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Convergence (economics); Rate of convergence; Event (particle physics); Multi-agent system; Consensus; Implementation; Monte Carlo method; Mathematical optimization; Distributed computing; Mathematics; Artificial intelligence; Key (lock)","score_opus":0.057446754370021356,"score_gpt":0.3064534355219056,"score_spread":0.24900668115188426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895487882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016729428,0.00007464989,0.9974668,0.0000628861,0.00001966261,0.000029503957,0.000018129167,0.00018907661,0.0004663621],"genre_scores_gemma":[0.63558763,0.0003402707,0.3614835,0.00018387668,0.0001500672,0.00044637593,0.00019482596,0.000105688814,0.0015077075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853826,0.00048650868,0.000084381114,0.00026793664,0.00051808584,0.00010487747],"domain_scores_gemma":[0.99779296,0.0012071065,0.00023239256,0.00026738862,0.0003593964,0.00014064318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024346008,0.00089048967,0.0012410661,0.0005047866,0.0005123072,0.0015550095,0.0029767784,0.0013590177,0.001702101],"category_scores_gemma":[0.005920727,0.00045021472,0.00080981146,0.00055114954,0.0011792352,0.001726658,0.002148345,0.0018190952,0.00030286424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011873907,0.00006497485,0.00039961206,0.000115268296,0.00005189998,0.00013743818,0.000098691184,0.8984103,0.00297818,0.06461957,0.0011258931,0.031879462],"study_design_scores_gemma":[0.000016878885,0.00003441283,0.000029804129,0.000003798479,0.0000044341728,0.00001390302,0.000006355337,0.98983395,0.00044754377,0.008999054,0.0006055842,0.000004391361],"about_ca_topic_score_codex":0.0024083343,"about_ca_topic_score_gemma":0.0020086858,"teacher_disagreement_score":0.0029767784,"about_ca_system_score_codex":0.00091304386,"about_ca_system_score_gemma":0.001797657,"threshold_uncertainty_score":0.012875557},"labels":[],"label_agreement":null},{"id":"W2909503871","doi":"10.1109/tsp.2018.2890066","title":"Stochastic Bit-Wise Iterative Decoding of Polar Codes","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Decoding methods; Computer science; Stochastic computing; Belief propagation; Throughput; Berlekamp–Welch algorithm; Latency (audio); Algorithm; Wireless; Sequential decoding; Convergence (economics); Low latency (capital markets); Parallel computing; Computer engineering; Computer network; Telecommunications; Computation; Block code","score_opus":0.020063870288671837,"score_gpt":0.27454883355405607,"score_spread":0.2544849632653842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909503871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014534017,0.00018622685,0.98236173,0.000099681194,0.00003600352,0.00002626238,0.00003806351,0.00018909709,0.0025289196],"genre_scores_gemma":[0.54733807,0.0007860993,0.44679004,0.00018864484,0.00006911232,0.00012258474,0.00022703367,0.000073924915,0.0044044754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907494,0.00025478177,0.00006013111,0.00012363921,0.0003829965,0.00010348182],"domain_scores_gemma":[0.99874675,0.0004807267,0.00014146966,0.00014831254,0.00044058842,0.00004204637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006453309,0.0005724432,0.0005853589,0.00046219738,0.0004110354,0.0008610053,0.00067930244,0.00053846836,0.0010615481],"category_scores_gemma":[0.0030772972,0.00024582868,0.000347664,0.000764402,0.00069619983,0.00075892743,0.0008147974,0.0008095553,0.0005183882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031456313,0.0000510151,0.00092125544,0.00019025836,0.00005313789,0.00028376706,0.00023168598,0.58933794,0.04850679,0.17148474,0.002060253,0.18656452],"study_design_scores_gemma":[0.000009538976,0.00004421682,0.00007798397,0.000012663028,0.0000060706147,0.000078936864,0.000010488581,0.97440296,0.012864669,0.011173566,0.001308584,0.000010364943],"about_ca_topic_score_codex":0.0017658032,"about_ca_topic_score_gemma":0.0021688784,"teacher_disagreement_score":0.0017658032,"about_ca_system_score_codex":0.0004501952,"about_ca_system_score_gemma":0.0014568154,"threshold_uncertainty_score":0.0035512447},"labels":[],"label_agreement":null},{"id":"W2920856460","doi":"10.1109/tsp.2019.2905833","title":"Multi-User Regularized Zero-Forcing Beamforming","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Computational Science and Technology; Queen's University; Queen's University Belfast; Royal Academy of Engineering; National Science Foundation","keywords":"Beamforming; Zero (linguistics); Computer science; Signal processing; Mathematics; Algorithm; Speech recognition; Telecommunications; Radar","score_opus":0.012046312668513756,"score_gpt":0.22890755230732557,"score_spread":0.21686123963881182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920856460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047757193,0.000086042826,0.9925444,0.00008560183,0.000019916684,0.000020289544,0.000047665504,0.00013063717,0.0022896936],"genre_scores_gemma":[0.40954736,0.00048787458,0.5829216,0.00020108615,0.0000638882,0.00018746527,0.0002576834,0.00007202047,0.00626094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996037,0.00015274437,0.000015562371,0.00006723229,0.000121829195,0.000038948343],"domain_scores_gemma":[0.99952054,0.00024674748,0.000056095178,0.00006926064,0.000087915934,0.000019426172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072103244,0.0007850051,0.00064889435,0.00022419865,0.00021456098,0.0006167408,0.0005810667,0.0008166303,0.0020936471],"category_scores_gemma":[0.001540237,0.00025843628,0.0005078045,0.000474424,0.00060820347,0.0006667544,0.00072476844,0.00076524855,0.0007275188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001699716,0.000032066022,0.00029144716,0.00012460756,0.00004200737,0.00012590457,0.00007098936,0.88176835,0.015584823,0.050813105,0.002415447,0.04856133],"study_design_scores_gemma":[0.000009714946,0.000024585133,0.0000505763,0.0000066354573,0.000004188268,0.000037033795,0.000005841291,0.9913794,0.0016653531,0.0059960973,0.00081091106,0.000009689289],"about_ca_topic_score_codex":0.0007175602,"about_ca_topic_score_gemma":0.00086035987,"teacher_disagreement_score":0.0020936471,"about_ca_system_score_codex":0.00034429968,"about_ca_system_score_gemma":0.0005856203,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2950790100","doi":"10.1109/tsp.2019.2905813","title":"Two-Timescale Hybrid Compression and Forward for Massive MIMO Aided C-RAN","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"MIMO; Computer science; Baseband; C-RAN; Telecommunications link; Spatial multiplexing; Multiplexing; Channel state information; Electronic engineering; Radio access network; Spectral efficiency; Remote radio head; Precoding; Real-time computing; Channel (broadcasting); Computer network; Transmitter; Wireless; Base station; Telecommunications; Engineering; Bandwidth (computing)","score_opus":0.009825371157694543,"score_gpt":0.2365107958113808,"score_spread":0.22668542465368624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950790100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0134051405,0.00032110416,0.9826422,0.00013988152,0.000060444436,0.000044156517,0.000026481117,0.00018263886,0.0031780205],"genre_scores_gemma":[0.7269576,0.0005246938,0.26789108,0.00018222332,0.000106286265,0.00012686382,0.00007421528,0.00003250547,0.0041046143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997471,0.000059288766,0.000008452529,0.000039166414,0.000101854,0.000044112396],"domain_scores_gemma":[0.9997054,0.00016116208,0.000030267714,0.00003351622,0.000051436025,0.00001813549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000491329,0.0008272171,0.0005390895,0.00022370966,0.00040976447,0.0006507378,0.00065608014,0.0007288696,0.0020578583],"category_scores_gemma":[0.00092159386,0.00017760282,0.00035144362,0.00045661963,0.00050932856,0.00071249116,0.00076744705,0.00075883203,0.00031616673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018949853,0.000112186615,0.0005987519,0.00012397976,0.000033936747,0.0002535797,0.000073850184,0.84007245,0.017943209,0.029543035,0.0014520319,0.10960344],"study_design_scores_gemma":[0.000005356698,0.000037235262,0.00003848952,0.0000027776775,0.00000343233,0.00003268436,0.0000050128015,0.99677074,0.0012998839,0.0014029497,0.0003967775,0.0000046573186],"about_ca_topic_score_codex":0.002472227,"about_ca_topic_score_gemma":0.0037687204,"teacher_disagreement_score":0.002472227,"about_ca_system_score_codex":0.00041691854,"about_ca_system_score_gemma":0.00088025775,"threshold_uncertainty_score":0.0068842173},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.013848562104375572,"score_gpt":0.2775742511481185,"score_spread":0.26372568904374294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962732261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010021437,0.00026934725,0.98643726,0.00010904855,0.000021624699,0.000017041348,0.000016800699,0.00010756032,0.002999917],"genre_scores_gemma":[0.5741756,0.00059938227,0.4217833,0.000108243694,0.000050956038,0.00012671587,0.00009428657,0.000054679425,0.0030068452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997907,0.000078720164,0.0000069727134,0.000024667663,0.000078652774,0.000020148833],"domain_scores_gemma":[0.9997892,0.00011153612,0.000029334793,0.000018450864,0.00003825088,0.00001332288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044664994,0.000598935,0.00038172692,0.00021187363,0.00026160976,0.0005923381,0.00032299184,0.0004420693,0.0014784103],"category_scores_gemma":[0.00060929277,0.00024940248,0.00039692072,0.000371963,0.0005304984,0.0007168739,0.0006789808,0.00074407156,0.0003331549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006689306,0.000036051355,0.00021267775,0.00008558755,0.000029756711,0.00007832219,0.000067085806,0.89018553,0.013142024,0.05741869,0.0014203935,0.037257053],"study_design_scores_gemma":[0.0000048765555,0.000022790495,0.000022231026,0.0000027608273,0.0000016806027,0.000011722494,0.0000053733042,0.99402136,0.00069258036,0.004768113,0.00044304386,0.000003355855],"about_ca_topic_score_codex":0.0011758365,"about_ca_topic_score_gemma":0.0014185619,"teacher_disagreement_score":0.0014784103,"about_ca_system_score_codex":0.00035024688,"about_ca_system_score_gemma":0.0005622636,"threshold_uncertainty_score":0.004945755},"labels":[],"label_agreement":null},{"id":"W2963026027","doi":"10.1109/tsp.2020.2978617","title":"Feature Graph Learning for 3D Point Cloud Denoising","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":109,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Science Foundation of Beijing Municipality; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Algorithm; Laplacian smoothing; Laplacian matrix; Diagonal; Graph; Discrete mathematics; Physics; Geometry","score_opus":0.021195940707353783,"score_gpt":0.2351633007428574,"score_spread":0.21396736003550362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963026027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037974224,0.00011356914,0.99475974,0.00013349211,0.000014414193,0.000016707,0.00009911847,0.0006934114,0.00037210537],"genre_scores_gemma":[0.2749948,0.0007184398,0.7181532,0.0003037908,0.00009982364,0.00021734792,0.0016224921,0.000657714,0.0032324225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994174,0.0001371592,0.000021066686,0.00016385729,0.00021147334,0.000049060614],"domain_scores_gemma":[0.9990233,0.000361523,0.000115377465,0.00020531335,0.00023884776,0.000055568704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078503654,0.000858658,0.0010924101,0.0017165019,0.00051790517,0.001023685,0.0017447583,0.0015215223,0.0019777815],"category_scores_gemma":[0.0037133836,0.0007353072,0.0011837955,0.0017864337,0.0011032547,0.0015609894,0.0016334535,0.0017507869,0.0011059406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012233942,0.00007003528,0.00085834553,0.00014268325,0.000089419606,0.00009078949,0.000120917364,0.70018065,0.011507462,0.036098372,0.0077097686,0.2430092],"study_design_scores_gemma":[0.0000039962415,0.000009380655,0.00012005178,0.0000043551813,0.000003937382,0.00001771676,0.000008850522,0.98047364,0.0012182645,0.017199455,0.00093387347,0.000006442424],"about_ca_topic_score_codex":0.006395383,"about_ca_topic_score_gemma":0.007952039,"teacher_disagreement_score":0.006395383,"about_ca_system_score_codex":0.0012800059,"about_ca_system_score_gemma":0.0011693347,"threshold_uncertainty_score":0.012716293},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; Israel Science Foundation","keywords":"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","score_opus":0.02455861300354502,"score_gpt":0.26679636270807466,"score_spread":0.24223774970452966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964011032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015628714,0.00038617436,0.9800094,0.00017470767,0.000067524576,0.00007093807,0.00009899417,0.00048232218,0.0030812458],"genre_scores_gemma":[0.48976624,0.00062620174,0.502466,0.00030606604,0.00025148096,0.00016125992,0.00053457054,0.000078487996,0.0058096633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987637,0.0002326728,0.000054202592,0.000286811,0.0005716481,0.000091034584],"domain_scores_gemma":[0.9989556,0.00042393923,0.00014269433,0.0002205097,0.00021413094,0.000043179778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066475733,0.0010051309,0.0008760076,0.000717448,0.00034707258,0.0007467417,0.001239676,0.0012710056,0.0030963907],"category_scores_gemma":[0.003777376,0.00038682047,0.00047744182,0.00091297034,0.00064204977,0.0019888717,0.0017578454,0.0009973329,0.0010264819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010243813,0.00019426951,0.0022572256,0.00031240104,0.00010461022,0.0007184484,0.00035705144,0.19442908,0.081793346,0.033282824,0.004797654,0.6807287],"study_design_scores_gemma":[0.000037229634,0.00018463704,0.000738707,0.000030443896,0.000027082993,0.0005544095,0.000040665927,0.96906954,0.017977316,0.0068486463,0.004452338,0.00003900241],"about_ca_topic_score_codex":0.0029667881,"about_ca_topic_score_gemma":0.0029461125,"teacher_disagreement_score":0.0030963907,"about_ca_system_score_codex":0.00038353616,"about_ca_system_score_gemma":0.00074901205,"threshold_uncertainty_score":0.010358512},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.025219486412952064,"score_gpt":0.2665720012858287,"score_spread":0.24135251487287662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964105372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064094495,0.0007471588,0.9893245,0.0002600382,0.000069405476,0.000011971526,0.000026141886,0.000055915112,0.0030953367],"genre_scores_gemma":[0.41546932,0.006573051,0.56791383,0.00062294747,0.0008013203,0.00020805649,0.00023886062,0.00025485025,0.007917789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951434,0.00016237042,0.000022989678,0.00012072906,0.00013987836,0.000039724117],"domain_scores_gemma":[0.99913293,0.0005452154,0.00008559289,0.00008795144,0.00011626565,0.000032069707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007797497,0.0007819728,0.00045220225,0.0009298712,0.00039775023,0.0010769685,0.00048326855,0.0009724786,0.0021317797],"category_scores_gemma":[0.002478829,0.00024178774,0.00062742183,0.0012100477,0.0021730245,0.0019569527,0.0009053624,0.0012473345,0.000585143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004852758,0.000034386074,0.00025316878,0.00012510552,0.00002258865,0.00012618442,0.00017816607,0.12327377,0.012273111,0.79199207,0.0018588273,0.06981415],"study_design_scores_gemma":[0.000007752136,0.00007761971,0.00027480235,0.000031973734,0.000015766514,0.00013395352,0.00005000296,0.52483284,0.0033308247,0.46524003,0.005967724,0.000036640136],"about_ca_topic_score_codex":0.0015024337,"about_ca_topic_score_gemma":0.0010350775,"teacher_disagreement_score":0.0021317797,"about_ca_system_score_codex":0.00057266996,"about_ca_system_score_gemma":0.00053364836,"threshold_uncertainty_score":0.0071315765},"labels":[],"label_agreement":null},{"id":"W2966165605","doi":"10.1109/tsp.2019.2932873","title":"Seamless Tracking of Apparent Point and Extended Targets Using Gaussian Process PMHT","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Clutter; Gaussian process; Computer science; Cardinality (data modeling); Algorithm; Probabilistic logic; Radar tracker; Tracking (education); Point process; Gaussian; Point target; Point (geometry); Artificial intelligence; Computer vision; Mathematics; Radar; Data mining; Synthetic aperture radar","score_opus":0.02210963207366172,"score_gpt":0.2715106041178868,"score_spread":0.24940097204422507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966165605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010631741,0.00008160497,0.9887944,0.00003461916,0.000016320964,0.00000736764,0.000016167858,0.00017240124,0.00024544602],"genre_scores_gemma":[0.6804132,0.00031016005,0.31651166,0.00015065134,0.00006044336,0.000062702915,0.00020250343,0.00006787344,0.0022208616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992767,0.00014063943,0.000029657815,0.00021566657,0.00026030134,0.000077007484],"domain_scores_gemma":[0.99874145,0.0006187667,0.00019000121,0.00019173993,0.00020507698,0.000053035463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011158702,0.00057389634,0.00081964344,0.00050288957,0.00030268324,0.00074361044,0.0011696902,0.0009581922,0.0004439276],"category_scores_gemma":[0.0033373418,0.0003936174,0.00057649746,0.0009274725,0.0007627364,0.0016888784,0.0016994696,0.0011528839,0.00024315748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026122673,0.00006155677,0.00241651,0.00010034841,0.00006866034,0.00023417508,0.00030250926,0.76898956,0.017101754,0.017842522,0.00096986623,0.1916513],"study_design_scores_gemma":[0.000005651734,0.000029113298,0.00022846616,0.0000022189697,0.0000053626527,0.000052889445,0.0000070779397,0.9954817,0.0016582011,0.002236348,0.00028615305,0.0000068402487],"about_ca_topic_score_codex":0.002538072,"about_ca_topic_score_gemma":0.002215443,"teacher_disagreement_score":0.002538072,"about_ca_system_score_codex":0.00040210865,"about_ca_system_score_gemma":0.00082191237,"threshold_uncertainty_score":0.0059013963},"labels":[],"label_agreement":null},{"id":"W2977557067","doi":"10.1109/tsp.2019.2944738","title":"Rate-Flexible Fast Polar Decoders","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Natural Sciences and Engineering Research Council of Canada; McGill University; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Computer science; Signal processing; Algorithm; Digital signal processing; Computer hardware","score_opus":0.018130204388519932,"score_gpt":0.2651004711459094,"score_spread":0.24697026675738948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977557067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023866337,0.0008233473,0.96250397,0.00018528345,0.00018006444,0.00012703476,0.0002875249,0.002159987,0.00986643],"genre_scores_gemma":[0.34223592,0.0014049592,0.63887775,0.00041526693,0.00018052306,0.00018464935,0.0008097204,0.00025099094,0.015640134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994578,0.00007500162,0.000048112994,0.00008152715,0.00026757584,0.00006997396],"domain_scores_gemma":[0.9989889,0.00028860694,0.000095338255,0.00021234261,0.00037867666,0.00003603916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005334978,0.00072666927,0.00044179964,0.000905171,0.00046680844,0.0011254858,0.0008566897,0.0005168097,0.0042788386],"category_scores_gemma":[0.0016071728,0.00032219346,0.0003145243,0.0007921288,0.0004760571,0.0013826012,0.0009710181,0.00094855117,0.0021167174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009569722,0.000103362305,0.0013359829,0.0004064586,0.000057610883,0.00048300362,0.00024331029,0.076218195,0.21609245,0.093323335,0.009302169,0.60147715],"study_design_scores_gemma":[0.00019194739,0.0005875327,0.00069421646,0.00012305574,0.00008150229,0.0016190829,0.00013702617,0.5256757,0.3786549,0.031526,0.060580444,0.00012859252],"about_ca_topic_score_codex":0.0010432702,"about_ca_topic_score_gemma":0.00216114,"teacher_disagreement_score":0.0042788386,"about_ca_system_score_codex":0.00048470518,"about_ca_system_score_gemma":0.0011629398,"threshold_uncertainty_score":0.014314115},"labels":[],"label_agreement":null},{"id":"W2988558204","doi":"10.1109/tsp.2019.2952045","title":"Robust Multi-Objective Beamforming for Integrated Satellite and High Altitude Platform Network With Imperfect Channel State Information","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Satellite Communication Systems","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; McGill University","funders":"","keywords":"Beamforming; Computer science; Mathematical optimization; Transmitter power output; Channel state information; Maximization; Computational complexity theory; Optimization problem; Channel (broadcasting); Algorithm; Mathematics; Telecommunications; Wireless","score_opus":0.02181856359248844,"score_gpt":0.22197715522166522,"score_spread":0.2001585916291768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988558204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036974743,0.00009528583,0.9953792,0.00004314023,0.000011885386,0.00001252526,0.00001524284,0.000056604807,0.0006886765],"genre_scores_gemma":[0.4871281,0.00047915205,0.5076505,0.00015182029,0.0000715609,0.00021133792,0.00019401005,0.000065042455,0.0040485035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994555,0.00017519789,0.00001993734,0.00009768114,0.00017700662,0.000074709686],"domain_scores_gemma":[0.99953485,0.00023296039,0.00008534085,0.000038980146,0.00008227093,0.00002572865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089534133,0.0013986862,0.000809894,0.0003921229,0.00031495703,0.00071158935,0.00096622575,0.00085439085,0.0015960375],"category_scores_gemma":[0.0013050386,0.00042970118,0.00053717213,0.0007116178,0.000527444,0.0012340224,0.00084404263,0.0010153416,0.0003980918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008170827,0.000029000257,0.00026486054,0.00008525479,0.00004484081,0.00006889654,0.00004214658,0.9243587,0.008183207,0.010946463,0.0007384223,0.055156484],"study_design_scores_gemma":[0.000007250332,0.000031298936,0.000049488615,0.0000037245456,0.000005067928,0.00001430879,0.0000066242947,0.9976367,0.00065205316,0.0013612583,0.00022693338,0.0000053627573],"about_ca_topic_score_codex":0.0026624291,"about_ca_topic_score_gemma":0.0030589742,"teacher_disagreement_score":0.0026624291,"about_ca_system_score_codex":0.00057981367,"about_ca_system_score_gemma":0.0008204186,"threshold_uncertainty_score":0.005339265},"labels":[],"label_agreement":null},{"id":"W2999407989","doi":"10.1109/tsp.2020.2964250","title":"Nonsmooth Optimization Algorithms for Multicast Beamforming in Content-Centric Fog Radio Access Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Australian Research Council; Queen's University Belfast; Royal Academy of Engineering; National Science Foundation","keywords":"Computer science; Beamforming; Multicast; Radio access network; Optimization problem; Baseband; Computer network; Throughput; Algorithm; Wireless; Base station; Telecommunications","score_opus":0.1220341846486069,"score_gpt":0.31493294583087256,"score_spread":0.19289876118226568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999407989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040696915,0.00026310427,0.9935929,0.00013977762,0.00003541534,0.000025553612,0.000028269846,0.00011225826,0.0017330028],"genre_scores_gemma":[0.5049527,0.0011064794,0.48478487,0.0003194264,0.00018279132,0.0005172214,0.00031864597,0.000257902,0.007559907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971145,0.00011420306,0.000011199293,0.000050749557,0.00006710393,0.000045329554],"domain_scores_gemma":[0.9991043,0.0006607899,0.00006395168,0.000023989522,0.00011210157,0.000034813827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085048995,0.0015084767,0.0010432681,0.0004914639,0.0004935495,0.00079774566,0.0010061,0.001316102,0.0022826141],"category_scores_gemma":[0.0020904078,0.00067265215,0.0006962141,0.0006354074,0.0007260017,0.0007714127,0.0011421628,0.0014626532,0.00042559704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031454765,0.00002366062,0.00015956965,0.000054668457,0.000021405778,0.000039500894,0.000033940014,0.9707509,0.0007094792,0.00887152,0.0011391788,0.018164717],"study_design_scores_gemma":[0.0000027666304,0.000006181626,0.00001615793,0.000002099407,0.000001254498,0.0000025233737,0.0000038787725,0.9977174,0.000053547974,0.002003044,0.000189662,0.0000016079957],"about_ca_topic_score_codex":0.007825516,"about_ca_topic_score_gemma":0.0062827854,"teacher_disagreement_score":0.007825516,"about_ca_system_score_codex":0.0008914597,"about_ca_system_score_gemma":0.0011686666,"threshold_uncertainty_score":0.015559971},"labels":[],"label_agreement":null},{"id":"W3004198548","doi":"10.1109/tsp.2020.2970309","title":"Energy-Optimal Multiple Access Computation Offloading: Signalling Structure and Efficient Communication Resource Allocation","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Exploit; Resource allocation; Computation offloading; Time division multiple access; Signalling; Efficient energy use; Distributed computing; Energy consumption; Computation; Wireless; Computer network; Channel allocation schemes; Embedded system; Edge computing; Algorithm; Telecommunications; Internet of Things","score_opus":0.031214474799252365,"score_gpt":0.2603558603003952,"score_spread":0.22914138550114282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004198548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041411255,0.00018331339,0.9533859,0.00017186739,0.00005028064,0.000049273618,0.000030337464,0.0001715592,0.004546243],"genre_scores_gemma":[0.8481587,0.00013272461,0.14940406,0.000078480596,0.00003282409,0.00008643098,0.000046515514,0.000028992361,0.00203123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964285,0.00010637214,0.000018432616,0.000047902675,0.00010425276,0.000080099104],"domain_scores_gemma":[0.99950826,0.00025356465,0.000051450068,0.00006775431,0.00008593443,0.000032993237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043424682,0.00047435297,0.00043880896,0.00031361287,0.00039945522,0.0007613878,0.0006531075,0.0005332314,0.0016320521],"category_scores_gemma":[0.0015666911,0.00017481665,0.00028577365,0.00051042356,0.00064851606,0.0009618995,0.0006862656,0.00067987136,0.00024558153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022222854,0.00011489409,0.00039125228,0.00010578928,0.000023863628,0.00009267867,0.000103876984,0.8113561,0.03371041,0.05830754,0.0015871928,0.09398411],"study_design_scores_gemma":[0.000009484078,0.000034145658,0.000074120086,0.0000033262666,0.000002572802,0.000022319226,0.000011202568,0.9921147,0.0019230422,0.0053668846,0.00043215216,0.000006009756],"about_ca_topic_score_codex":0.0014603526,"about_ca_topic_score_gemma":0.0019565448,"teacher_disagreement_score":0.0016320521,"about_ca_system_score_codex":0.00055003015,"about_ca_system_score_gemma":0.001272218,"threshold_uncertainty_score":0.0054597855},"labels":[],"label_agreement":null},{"id":"W3006316852","doi":"10.1109/tsp.2020.2973488","title":"New Viewpoint and Algorithms for Water-Filling Solutions in Wireless Communications","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":108,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Algorithm; Wireless; Computation; Channel (broadcasting); Analogy; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.046883573887563514,"score_gpt":0.26429884937578,"score_spread":0.21741527548821651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006316852","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005086178,0.0003867938,0.9971022,0.00015195279,0.00006808613,0.0000139777285,0.000011134488,0.000023576522,0.0017336085],"genre_scores_gemma":[0.07508496,0.0030531161,0.91604644,0.00039332866,0.0005110041,0.00024952352,0.000103209764,0.00015933253,0.004399029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989079,0.00043794495,0.00007755966,0.00021832262,0.0002845341,0.00007384911],"domain_scores_gemma":[0.9987268,0.0007969,0.000105313666,0.00011439967,0.00021481547,0.000041727486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021302507,0.0018500385,0.0010503613,0.001154595,0.0006892318,0.0019513662,0.00160135,0.0018339673,0.0027880617],"category_scores_gemma":[0.0056204307,0.0006631362,0.0013328411,0.0014420747,0.0020253246,0.003262206,0.0021093625,0.0042123944,0.000927529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004252275,0.00003443742,0.00021903234,0.00025677416,0.00003259748,0.0000722155,0.00023524325,0.17658375,0.0031971962,0.73286736,0.0045700576,0.08188876],"study_design_scores_gemma":[0.000017783148,0.00007235233,0.00004882786,0.00006473596,0.000016836828,0.000069792164,0.00003554912,0.76033884,0.0012684874,0.2253007,0.012739071,0.000027022947],"about_ca_topic_score_codex":0.0010511887,"about_ca_topic_score_gemma":0.0008475189,"teacher_disagreement_score":0.0027880617,"about_ca_system_score_codex":0.0011429731,"about_ca_system_score_gemma":0.0011110789,"threshold_uncertainty_score":0.011265993},"labels":[],"label_agreement":null},{"id":"W3007722162","doi":"10.1109/tsp.2021.3089822","title":"Safe Linear Thompson Sampling With Side Information","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Office of the President, University of California","keywords":"Frequentist inference; Regret; Thompson sampling; Set (abstract data type); Reliability (semiconductor); Linear programming; Mathematics; Computer science; Algorithm; Mathematical optimization; Sampling (signal processing); Combinatorics; Bayesian probability; Statistics; Bayesian inference","score_opus":0.14129229971825966,"score_gpt":0.41763110013686366,"score_spread":0.27633880041860404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007722162","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03118024,0.0003423942,0.96346384,0.00046164932,0.00004635534,0.00011093058,0.00011881087,0.00078735605,0.003488481],"genre_scores_gemma":[0.80132806,0.00030846207,0.18967007,0.00050341437,0.00012208891,0.00044688812,0.0004008734,0.00024245662,0.006977745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949602,0.0025513314,0.00016469484,0.0008035711,0.0009049245,0.00061510777],"domain_scores_gemma":[0.97923744,0.015492386,0.0014947079,0.00218096,0.0010091622,0.0005854019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054951813,0.001274923,0.0019483671,0.00077977503,0.0007835825,0.0018002087,0.0020526424,0.0016881501,0.0034792293],"category_scores_gemma":[0.022531291,0.0008049265,0.000996442,0.0009513298,0.0025146275,0.0024514124,0.0021138892,0.0025629764,0.0010210206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082176324,0.00011538041,0.001319591,0.00013593514,0.000085771164,0.00013253735,0.00012184044,0.854416,0.001878525,0.09458599,0.002514564,0.043872096],"study_design_scores_gemma":[0.000035165664,0.00005593088,0.00007109216,0.000009175418,0.000008657594,0.00001665553,0.000006821753,0.9660701,0.00071731344,0.032732017,0.00026967016,0.0000073513606],"about_ca_topic_score_codex":0.0031977757,"about_ca_topic_score_gemma":0.003209383,"teacher_disagreement_score":0.0054951813,"about_ca_system_score_codex":0.0022638352,"about_ca_system_score_gemma":0.0032025091,"threshold_uncertainty_score":0.029061615},"labels":[],"label_agreement":null},{"id":"W3009604719","doi":"10.1109/tsp.2021.3061575","title":"Graphon Filters: Graph Signal Processing in the Limit","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"King Abdullah University of Science and Technology; Natural Sciences and Engineering Research Council of Canada; Technische Universiteit Delft","keywords":"Adjacency matrix; Graph energy; Integral graph; Strength of a graph; Mathematics; Spectral graph theory; Graph; Voltage graph; Discrete mathematics; Computer science; Line graph; Algorithm","score_opus":0.02793251529424654,"score_gpt":0.26216168202481505,"score_spread":0.2342291667305685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009604719","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00910059,0.00028497208,0.9866763,0.00026024473,0.00007355985,0.000022840411,0.000045246186,0.00023133494,0.0033049604],"genre_scores_gemma":[0.46265155,0.0021278216,0.5108718,0.0006753824,0.00027905963,0.0002573389,0.00034606564,0.00042669283,0.022364298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995776,0.00014259608,0.00001442854,0.000100454665,0.00012495658,0.00004000207],"domain_scores_gemma":[0.9987268,0.00075926125,0.00010781234,0.00015318312,0.0001719222,0.0000809329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011851025,0.00063054566,0.0004863312,0.00089218275,0.0004341562,0.0014952524,0.0009841865,0.0014018153,0.0030739286],"category_scores_gemma":[0.0045507364,0.00028267852,0.0005907985,0.0007080812,0.0015646971,0.0025535163,0.0009618628,0.0012131032,0.0009130756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116172705,0.000057822523,0.00062634324,0.0001408301,0.000037317437,0.00015556303,0.00017418478,0.18243854,0.0097873,0.74083704,0.00443951,0.061189417],"study_design_scores_gemma":[0.000008818192,0.000028846318,0.00015280934,0.000016292963,0.000007181252,0.000071964954,0.00002150501,0.8045925,0.0025581806,0.18944825,0.0030797927,0.0000138976875],"about_ca_topic_score_codex":0.0024945482,"about_ca_topic_score_gemma":0.002185328,"teacher_disagreement_score":0.0030739286,"about_ca_system_score_codex":0.00094277086,"about_ca_system_score_gemma":0.0007482426,"threshold_uncertainty_score":0.010283351},"labels":[],"label_agreement":null},{"id":"W3011675874","doi":"10.1109/tsp.2020.2979601","title":"Subsampling Generative Adversarial Networks: Density Ratio Estimation in Feature Space With Softplus Loss","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Discriminator; MNIST database; Computer science; Artificial intelligence; Feature (linguistics); Pattern recognition (psychology); Convergence (economics); Generative grammar; Generative adversarial network; Sample (material); Density ratio; Algorithm; Deep learning; Telecommunications; Physics","score_opus":0.016894953224282565,"score_gpt":0.2284269665349876,"score_spread":0.21153201331070504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011675874","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011633127,0.00024251679,0.986257,0.00015973285,0.000022339871,0.000036831065,0.000044038865,0.0006697074,0.0009345817],"genre_scores_gemma":[0.75714844,0.00043277428,0.23667681,0.00053111336,0.00009712422,0.0002089501,0.00037828667,0.00031978986,0.004206727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925214,0.00031977557,0.000025448393,0.00015297983,0.00018926318,0.00006033848],"domain_scores_gemma":[0.9986407,0.0008519079,0.00012846911,0.00020254114,0.00011509375,0.00006128366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020448861,0.0011509648,0.0009878653,0.0005185283,0.00022923596,0.00062503264,0.0015759321,0.000915033,0.0014895989],"category_scores_gemma":[0.0045904675,0.00046858843,0.0006963325,0.00041177525,0.0010844918,0.0016304107,0.001536792,0.001919314,0.00045176648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015406885,0.00006334943,0.00092676166,0.0000694405,0.000063325024,0.000106426465,0.00006364099,0.8711038,0.0050002625,0.03138394,0.0026152509,0.08844968],"study_design_scores_gemma":[0.0000049537025,0.00001547562,0.00006910207,0.0000033369129,0.0000037935383,0.00002402598,0.0000019213203,0.994276,0.00084170303,0.0045178174,0.0002380651,0.0000037531122],"about_ca_topic_score_codex":0.0020651114,"about_ca_topic_score_gemma":0.0022060722,"teacher_disagreement_score":0.0020651114,"about_ca_system_score_codex":0.000993759,"about_ca_system_score_gemma":0.0006114184,"threshold_uncertainty_score":0.010814548},"labels":[],"label_agreement":null},{"id":"W3015418301","doi":"10.1109/tsp.2020.2985299","title":"Real-Time Embedded EMG Signal Analysis for Wrist-Hand Pose Identification","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Muscle activation and electromyography studies","field":"Engineering","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; East China Institute of Technology; Queen's University; Queen's University Belfast","keywords":"Computer science; Wearable computer; Wrist; Artificial intelligence; Signal processing; Forearm; Electromyography; SIGNAL (programming language); Computer vision; Detector; Real-time computing; Embedded system; Computer hardware; Physical medicine and rehabilitation; Digital signal processing","score_opus":0.01979608448137025,"score_gpt":0.2460944290435472,"score_spread":0.22629834456217696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015418301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07297045,0.0011809247,0.92000747,0.000123649,0.00012495201,0.00008146514,0.00022624787,0.0029503007,0.0023345288],"genre_scores_gemma":[0.5150485,0.00096880464,0.47663155,0.00017977419,0.00009278362,0.00011096541,0.00039319354,0.00028013097,0.006294253],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996123,0.00007203232,0.000018787636,0.00009503743,0.000181508,0.000020387835],"domain_scores_gemma":[0.9995492,0.00019548395,0.00006460766,0.00007511449,0.00009208408,0.000023448823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034964434,0.00060328346,0.00042010442,0.00039948453,0.00012957324,0.00051488396,0.0005510527,0.00051373115,0.004066633],"category_scores_gemma":[0.0011615775,0.00022314557,0.00020057839,0.00040478873,0.00021849023,0.0005861796,0.00041454585,0.00030366512,0.001955677],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043615737,0.00016237705,0.0018043772,0.00032583976,0.00007455932,0.00018795228,0.000088925575,0.004947474,0.5359364,0.0010330684,0.0021559473,0.4528468],"study_design_scores_gemma":[0.00009680153,0.0012411242,0.021830326,0.00011360661,0.0001506893,0.0025341038,0.00009345551,0.3657867,0.58552456,0.0024428694,0.020083131,0.00010265216],"about_ca_topic_score_codex":0.0002834547,"about_ca_topic_score_gemma":0.00094420154,"teacher_disagreement_score":0.004066633,"about_ca_system_score_codex":0.00015081427,"about_ca_system_score_gemma":0.00023600191,"threshold_uncertainty_score":0.013604283},"labels":[],"label_agreement":null},{"id":"W3037851568","doi":"10.1109/tsp.2021.3080458","title":"The Benefits of Acting Locally: Reconstruction Algorithms for Sparse in Levels Signals With Stable and Robust Recovery Guarantees","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Simon Fraser University","funders":"","keywords":"Compressed sensing; Matching pursuit; Computer science; Algorithm; Signal reconstruction; Greedy algorithm; Sparse approximation; Convex optimization; Minification; Thresholding; Mathematical optimization; Sparse matrix; Basis pursuit; Signal processing; Regular polygon; Mathematics; Radar; Artificial intelligence; Image (mathematics)","score_opus":0.04222673465321467,"score_gpt":0.241750638166161,"score_spread":0.19952390351294633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037851568","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051023145,0.0001005719,0.99263436,0.00018266881,0.000015884887,0.000016981969,0.000021318003,0.000177408,0.0017485888],"genre_scores_gemma":[0.38588423,0.00084828294,0.6060328,0.0005319492,0.00024621794,0.00018522274,0.00022930729,0.0006981067,0.0053438935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987238,0.00046803456,0.000065878274,0.00018766616,0.00046424702,0.00009042252],"domain_scores_gemma":[0.9948442,0.0027085084,0.0005523823,0.0010911432,0.0006268239,0.00017700203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020061105,0.0011542509,0.0008544693,0.0004989438,0.00044561582,0.0014896394,0.0012905132,0.0014629512,0.0039982474],"category_scores_gemma":[0.012654597,0.00045007694,0.000810845,0.0007823317,0.0016049624,0.0034542326,0.0028381676,0.002554997,0.0018247137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003091998,0.00012575963,0.0013605246,0.00034019246,0.000106460306,0.00021181411,0.0003567166,0.43369004,0.037619613,0.3161853,0.005905292,0.20378903],"study_design_scores_gemma":[0.00001599564,0.000095470205,0.00014326336,0.00001629348,0.000013342532,0.00009354501,0.000033745837,0.94118005,0.0076421923,0.048785403,0.001963841,0.000016966467],"about_ca_topic_score_codex":0.00068776886,"about_ca_topic_score_gemma":0.00085079955,"teacher_disagreement_score":0.0039982474,"about_ca_system_score_codex":0.0005682706,"about_ca_system_score_gemma":0.0008364362,"threshold_uncertainty_score":0.013375461},"labels":[],"label_agreement":null},{"id":"W3044105291","doi":"10.1109/tsp.2020.3010451","title":"Algorithms for Globally-Optimal Secure Signaling Over Gaussian MIMO Wiretap Channels Under Interference Constraints","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"MIMO; Transmitter power output; Mathematical optimization; Covariance matrix; Computer science; Covariance; Constraint (computer-aided design); Channel (broadcasting); Convergence (economics); Gaussian; Mathematics; Algorithm; Telecommunications; Transmitter","score_opus":0.040297310458064804,"score_gpt":0.2803710837485797,"score_spread":0.2400737732905149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044105291","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004152418,0.00012846098,0.99345,0.00009503932,0.00001950708,0.000033442593,0.000031362408,0.00014511557,0.0019446112],"genre_scores_gemma":[0.46337256,0.0009281539,0.52741235,0.00014445646,0.00009920037,0.0004631337,0.0003480244,0.00021819556,0.007013879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999498,0.00015480258,0.00002702212,0.00009114202,0.00012829815,0.00010060792],"domain_scores_gemma":[0.9983575,0.0011012171,0.00016016068,0.00010051344,0.00022251616,0.000057974834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011997552,0.0017119651,0.0016822648,0.0005996653,0.00054615334,0.0015170375,0.0012613307,0.0016967746,0.0035609894],"category_scores_gemma":[0.003096825,0.0006132915,0.00086071854,0.0010637373,0.0012391643,0.0013103373,0.0017644437,0.0020088358,0.00092493003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067623696,0.00002165648,0.00016561386,0.0000830904,0.00002149465,0.00006854923,0.00008406327,0.9345333,0.0014882153,0.03014456,0.00094888284,0.032373007],"study_design_scores_gemma":[0.000011181625,0.00002916538,0.000024503144,0.000009815377,0.000004482742,0.000021511765,0.000018875426,0.98908293,0.00059569936,0.009881917,0.00031317127,0.000006849415],"about_ca_topic_score_codex":0.0029483738,"about_ca_topic_score_gemma":0.003373958,"teacher_disagreement_score":0.0035609894,"about_ca_system_score_codex":0.0011124432,"about_ca_system_score_gemma":0.0024439155,"threshold_uncertainty_score":0.0119127035},"labels":[],"label_agreement":null},{"id":"W3046022049","doi":"10.1109/tsp.2020.3012284","title":"Sparse Robust Learning From Flipped Bits","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Fusion center; Computer science; Wireless sensor network; Algorithm; Binary number; Transmission (telecommunications); Sensor fusion; Wireless; Artificial intelligence; Cognitive radio; Mathematics; Telecommunications; Computer network","score_opus":0.04270473001632126,"score_gpt":0.22828090230656575,"score_spread":0.18557617229024448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046022049","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011434277,0.00019271334,0.9873598,0.00013331384,0.000023722294,0.000016385273,0.000040717092,0.00022688738,0.00057218404],"genre_scores_gemma":[0.6193158,0.0005414809,0.37586,0.00028853928,0.00013520353,0.0001079073,0.0005114693,0.00013285514,0.003106788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989674,0.00031524547,0.000054736014,0.00024649382,0.00031454576,0.00010157481],"domain_scores_gemma":[0.9968156,0.0020112467,0.0003526133,0.00035638452,0.00040373584,0.000060373313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014522225,0.0010252651,0.0013124283,0.0006848064,0.00035456478,0.00087986654,0.0012837535,0.0012760218,0.0013301559],"category_scores_gemma":[0.008408476,0.00047571462,0.0005500868,0.0010563975,0.0012045044,0.0022677418,0.0015882688,0.001753807,0.00047237196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021033807,0.000050307397,0.0004640454,0.00009496986,0.000049158712,0.00007865435,0.00010275176,0.82795423,0.0053676628,0.021015191,0.0012866269,0.14332607],"study_design_scores_gemma":[0.000005712691,0.00001781426,0.000048418595,0.000004067791,0.0000030443227,0.00001551522,0.0000048072657,0.9917983,0.0012447102,0.0066519696,0.00019948238,0.0000061783235],"about_ca_topic_score_codex":0.0023868517,"about_ca_topic_score_gemma":0.0018704997,"teacher_disagreement_score":0.0023868517,"about_ca_system_score_codex":0.00059511,"about_ca_system_score_gemma":0.00079704734,"threshold_uncertainty_score":0.0076801777},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fundamental Research Funds for the Central Universities; 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","score_opus":0.046784536910230025,"score_gpt":0.30503231201494135,"score_spread":0.2582477751047113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046897407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009359357,0.00011437245,0.9894734,0.000033765966,0.000020975982,0.000014748036,0.000031123727,0.00018392489,0.0007683606],"genre_scores_gemma":[0.22454141,0.0003211459,0.7730699,0.00009943997,0.000057745623,0.00010783592,0.00015240783,0.00006597638,0.0015841025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996338,0.00010081937,0.000020938078,0.000104008315,0.00010966343,0.000030751657],"domain_scores_gemma":[0.99942917,0.00024284792,0.00009060952,0.00014105476,0.000073989104,0.000022266293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034250936,0.0010479799,0.0005576124,0.0004335899,0.00019364677,0.0004507949,0.0006811059,0.0004949308,0.0015795301],"category_scores_gemma":[0.0018169191,0.00040496048,0.00043940058,0.0008310343,0.00046993216,0.0010776371,0.0008377883,0.00070267246,0.00060934154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047323748,0.00013203267,0.0010328268,0.00024826213,0.00010758069,0.0003517082,0.000408413,0.33996418,0.16617788,0.045309916,0.0029895655,0.44280446],"study_design_scores_gemma":[0.000029404642,0.00021815892,0.00033119903,0.00001916631,0.000028939352,0.00021077464,0.000048693804,0.9520249,0.034573194,0.007823031,0.0046628956,0.000029656498],"about_ca_topic_score_codex":0.00044560948,"about_ca_topic_score_gemma":0.0007016707,"teacher_disagreement_score":0.0015795301,"about_ca_system_score_codex":0.00015798515,"about_ca_system_score_gemma":0.000364515,"threshold_uncertainty_score":0.0052840114},"labels":[],"label_agreement":null},{"id":"W3048518979","doi":"10.1109/tsp.2020.3016571","title":"Signal-Dependent Performance Analysis of Orthogonal Matching Pursuit for Exact Sparse Recovery","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Matching pursuit; Upper and lower bounds; Combinatorics; Mathematics; Compressed sensing; Matrix (chemical analysis); Infinity; Matching (statistics); Exact solutions in general relativity; Random matrix; Algorithm; Discrete mathematics; Statistics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.03035995410803876,"score_gpt":0.24290234141169526,"score_spread":0.2125423873036565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048518979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06726864,0.0022997786,0.9163261,0.0012445173,0.000095527204,0.000079680365,0.0003212819,0.0003984759,0.011966026],"genre_scores_gemma":[0.94591117,0.0023113594,0.04609397,0.0003116906,0.00022644011,0.0001519834,0.00061617704,0.00023811973,0.004139126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953092,0.0015874662,0.00016353255,0.0006797222,0.0017549208,0.00050522824],"domain_scores_gemma":[0.97553885,0.017679555,0.0018843682,0.0015358658,0.0029847056,0.00037667295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073052673,0.0019310004,0.0014126336,0.0012974723,0.00059361703,0.0017309923,0.0014434782,0.0015992892,0.0025957797],"category_scores_gemma":[0.034637265,0.0006170474,0.0007895156,0.0013623812,0.0023999494,0.0024480915,0.0029224132,0.0022171796,0.0007766885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006791874,0.00010376465,0.0017451437,0.00030824365,0.000099700264,0.00027353186,0.00018059224,0.8944528,0.013662011,0.050549246,0.0016432662,0.036302336],"study_design_scores_gemma":[0.0000070228757,0.00009135597,0.0006457969,0.00001714236,0.000013925945,0.000066811524,0.000026787107,0.9901196,0.0024547032,0.0061964225,0.0003372146,0.000023190536],"about_ca_topic_score_codex":0.0023697533,"about_ca_topic_score_gemma":0.0010377859,"teacher_disagreement_score":0.0073052673,"about_ca_system_score_codex":0.0018488185,"about_ca_system_score_gemma":0.0021636032,"threshold_uncertainty_score":0.03863442},"labels":[],"label_agreement":null},{"id":"W3086686844","doi":"10.1109/tsp.2020.3023582","title":"Practical Dynamic SC-Flip Polar Decoders: Algorithm and Implementation","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Logarithm; Algorithm; Computational complexity theory; Approximation algorithm; Mathematics","score_opus":0.03451881863408388,"score_gpt":0.3425130294563235,"score_spread":0.3079942108222396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086686844","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011283217,0.0002591772,0.9778986,0.0001734682,0.000046050754,0.00018224512,0.0002056366,0.0026035395,0.007348038],"genre_scores_gemma":[0.19414908,0.00046799393,0.7963493,0.00016658996,0.000042909123,0.0002944954,0.0008024243,0.0001610404,0.0075661205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997198,0.000030844334,0.000020320766,0.00004347264,0.00014549456,0.000039986513],"domain_scores_gemma":[0.9996264,0.00007435487,0.000024359862,0.000066690634,0.000191837,0.000016323742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026402128,0.0006252567,0.00036489536,0.0007150866,0.00049584283,0.00080619083,0.0008114494,0.0005787252,0.008348504],"category_scores_gemma":[0.0010300104,0.000267918,0.00026715227,0.0007422291,0.00041383848,0.00082427514,0.0006405147,0.0006805235,0.0035171523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004903814,0.000101508405,0.0016544913,0.00037271646,0.000042027525,0.00029889875,0.0002560254,0.12861322,0.07906916,0.067221664,0.013857622,0.70802224],"study_design_scores_gemma":[0.00015686678,0.00019929542,0.00042760125,0.00006950944,0.00002654772,0.0007942994,0.00010533808,0.83806676,0.11419986,0.012643041,0.03325211,0.000058809223],"about_ca_topic_score_codex":0.003901088,"about_ca_topic_score_gemma":0.00659498,"teacher_disagreement_score":0.008348504,"about_ca_system_score_codex":0.0007467417,"about_ca_system_score_gemma":0.0020564299,"threshold_uncertainty_score":0.027928472},"labels":[],"label_agreement":null},{"id":"W3088513401","doi":"10.1109/tsp.2020.3026983","title":"Maximum Likelihood Detection in the Presence of Non-Gaussian Jamming","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Jamming; Maximum likelihood; Gaussian; Detection theory; Computer science; Gaussian noise; Gaussian process; Statistics; Mathematics; Algorithm; Pattern recognition (psychology); Artificial intelligence; Telecommunications; Detector; Physics","score_opus":0.016446594833696013,"score_gpt":0.23707210113210755,"score_spread":0.22062550629841154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088513401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07004526,0.00038522575,0.92607695,0.00037203447,0.000020506632,0.000029172552,0.000053399814,0.00019862682,0.002818709],"genre_scores_gemma":[0.91208607,0.00024995193,0.08601326,0.00009146712,0.000030227273,0.000040697672,0.000061225786,0.000025711406,0.001401449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998552,0.00077815924,0.000037310594,0.00014315959,0.00031153855,0.00017781938],"domain_scores_gemma":[0.9923922,0.0065371133,0.0004080406,0.00024997696,0.00033496422,0.0000777726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027266366,0.00067155075,0.0012690714,0.00048138903,0.00032980007,0.0011962621,0.0010669907,0.0012934863,0.0006398311],"category_scores_gemma":[0.014885995,0.00064569013,0.0003904475,0.00082747376,0.0018021986,0.0023366138,0.0013887461,0.0010437801,0.00021251521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009902152,0.000019184741,0.00047128837,0.000045912162,0.000018426925,0.00023988941,0.00006537337,0.9723269,0.00109462,0.020382572,0.00018648982,0.0050503383],"study_design_scores_gemma":[0.000007701826,0.00001195155,0.00007636685,0.0000028257932,0.0000025179427,0.000033546134,0.000008871801,0.9933565,0.00034357465,0.0060943407,0.000057223133,0.000004478926],"about_ca_topic_score_codex":0.0019670294,"about_ca_topic_score_gemma":0.0016320607,"teacher_disagreement_score":0.0027266366,"about_ca_system_score_codex":0.00093024556,"about_ca_system_score_gemma":0.0009678408,"threshold_uncertainty_score":0.014419973},"labels":[],"label_agreement":null},{"id":"W3091835776","doi":"10.1109/tsp.2020.3029499","title":"Distributed Coding of Quantized Random Projections","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; Mitsubishi Electric Research Laboratories","keywords":"Computer science; Decoding methods; Algorithm; Distributed source coding; Coding (social sciences); Source code; Signal processing; Rate–distortion theory; Computational complexity theory; Multispectral image; Artificial intelligence; Theoretical computer science; Pattern recognition (psychology); Mathematics; Variable-length code; Data compression; Statistics","score_opus":0.03532206475296501,"score_gpt":0.25004410482747047,"score_spread":0.21472204007450546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091835776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038734393,0.000110817244,0.9946583,0.00012346121,0.00003498518,0.00001571213,0.000035296376,0.00008335857,0.0010646651],"genre_scores_gemma":[0.51026565,0.0007597509,0.4812761,0.0003259287,0.00021230713,0.0002619981,0.0003022935,0.00009312893,0.006502849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988985,0.00036504326,0.000040179024,0.00018060065,0.00043701543,0.00007870634],"domain_scores_gemma":[0.9983323,0.0008874453,0.00014749031,0.00030577902,0.00027700074,0.000049925486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011575408,0.00061944744,0.00081214256,0.0005936012,0.00032918624,0.0009890816,0.0012202599,0.0008178529,0.0018985586],"category_scores_gemma":[0.0044339085,0.00034502518,0.00043711855,0.0007707832,0.0012746267,0.0018142357,0.0014861391,0.0015642473,0.000421791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015521143,0.00005175987,0.00032342057,0.00010859029,0.000036470137,0.00016068788,0.00013688978,0.53657866,0.011075422,0.37962517,0.0017590823,0.06998863],"study_design_scores_gemma":[0.000022152082,0.000040795196,0.000060781997,0.000012330996,0.0000064461124,0.00004991049,0.000014560049,0.9391299,0.0022365386,0.05680239,0.0016101104,0.000014143489],"about_ca_topic_score_codex":0.0008711369,"about_ca_topic_score_gemma":0.00097426755,"teacher_disagreement_score":0.0018985586,"about_ca_system_score_codex":0.0007767696,"about_ca_system_score_gemma":0.000838533,"threshold_uncertainty_score":0.006351292},"labels":[],"label_agreement":null},{"id":"W3092800917","doi":"10.1109/tsp.2021.3104981","title":"Multi-Agent Estimation and Filtering for Minimizing Team Mean-Squared Error","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minimum mean square error; Mean squared error; Kalman filter; Mathematics; Computer science; Estimation; Mathematical optimization; Algorithm; Statistics; Control theory (sociology); Estimator; Control (management); Artificial intelligence","score_opus":0.04673251531580367,"score_gpt":0.28987971798365963,"score_spread":0.24314720266785597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092800917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003506468,0.00006383183,0.9958509,0.00008008283,0.000014236356,0.000009979418,0.000012463154,0.00004715888,0.00041477344],"genre_scores_gemma":[0.60011625,0.00038793366,0.39475366,0.00016379006,0.00012426752,0.0002690944,0.00019812759,0.00011052087,0.0038763485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987463,0.0004157269,0.0000747014,0.00033427667,0.00032256616,0.000106517924],"domain_scores_gemma":[0.9969162,0.0021292847,0.0003399759,0.00016317138,0.00038357696,0.00006771265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020222717,0.0010713546,0.0014636425,0.00062713877,0.00048929435,0.0011098286,0.0010788635,0.0018004392,0.001392272],"category_scores_gemma":[0.008376333,0.00054521323,0.00079595245,0.00086571823,0.0010545825,0.0017719496,0.0012105319,0.0013058354,0.000339213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003403503,0.000014486464,0.00031357544,0.000045583707,0.000029995734,0.00002734442,0.000053969412,0.97462046,0.0009670745,0.0108588515,0.00044865932,0.012585916],"study_design_scores_gemma":[0.0000036825502,0.0000099432455,0.00004898449,0.0000033950098,0.0000030548752,0.0000041305975,0.0000041202584,0.99633956,0.00026207394,0.0032002823,0.00011735302,0.0000034946709],"about_ca_topic_score_codex":0.006401294,"about_ca_topic_score_gemma":0.0043286565,"teacher_disagreement_score":0.006401294,"about_ca_system_score_codex":0.0012640944,"about_ca_system_score_gemma":0.0015637192,"threshold_uncertainty_score":0.012728095},"labels":[],"label_agreement":null},{"id":"W3094065427","doi":"10.1109/tsp.2022.3178191","title":"Polar Deconvolution of Mixed Signals","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Deconvolution; Algorithm; Sublinear function; Mathematical optimization; Superposition principle; Mathematics; Probabilistic logic; Convex optimization; Convolution (computer science); Computational complexity theory; Noise (video); Computer science; Bounded function; Smoothing; Applied mathematics; Regular polygon; Artificial intelligence; Discrete mathematics; Mathematical analysis; Statistics","score_opus":0.018869888920824966,"score_gpt":0.23046536348162874,"score_spread":0.21159547456080377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094065427","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010485589,0.00014313754,0.98796064,0.000086832966,0.000014481562,0.000013345546,0.000021133537,0.000069507594,0.0012054201],"genre_scores_gemma":[0.35794133,0.0009390511,0.63724625,0.00014703919,0.00006225437,0.00008290816,0.00017069634,0.00010468067,0.0033057623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995111,0.00016646787,0.000016123828,0.00008919897,0.00017362909,0.000043566648],"domain_scores_gemma":[0.99922025,0.0004603361,0.00007188619,0.000098459954,0.00012219371,0.00002687626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001205701,0.0007286581,0.0006293671,0.0008158751,0.00030248478,0.00095269084,0.0005478384,0.000788504,0.0009998773],"category_scores_gemma":[0.0027086588,0.00040154325,0.0005864324,0.0006338693,0.0013273206,0.0015775949,0.0016630327,0.0009669463,0.00036409494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041521474,0.000063111554,0.0012920975,0.0002794994,0.000086485175,0.0002780308,0.0002820418,0.5467709,0.048369404,0.23807772,0.0013332795,0.16275226],"study_design_scores_gemma":[0.000009507808,0.000030894913,0.00017295267,0.000013647779,0.0000072825096,0.000093261915,0.00002762744,0.95591104,0.013383548,0.029040556,0.0012968556,0.000012792213],"about_ca_topic_score_codex":0.0006743187,"about_ca_topic_score_gemma":0.0004919204,"teacher_disagreement_score":0.001205701,"about_ca_system_score_codex":0.00043268385,"about_ca_system_score_gemma":0.00067537953,"threshold_uncertainty_score":0.0063763857},"labels":[],"label_agreement":null},{"id":"W3105450946","doi":"10.1109/tsp.2020.3038480","title":"Learning Gaussian Graphical Models With Ordered Weighted $\\ell _1$ Regularization","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graphical model; Estimator; Gaussian; Algorithm; Mathematics; Regularization (linguistics); Computer science; Artificial intelligence; Statistics","score_opus":0.067160751189908,"score_gpt":0.30682405525142326,"score_spread":0.23966330406151526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105450946","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027577395,0.000059625563,0.9965636,0.00013182656,0.000010882903,0.000013782727,0.00005515052,0.00020793453,0.00019949513],"genre_scores_gemma":[0.24281389,0.00051591074,0.74966186,0.00061805407,0.00021341175,0.00039059517,0.0013083968,0.00034285782,0.0041350853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793327,0.0010472096,0.00007124387,0.00043428512,0.0003541977,0.0001598505],"domain_scores_gemma":[0.9930339,0.004821799,0.00074319873,0.0007645326,0.0004721041,0.00016452999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043718196,0.001266734,0.0016220269,0.0014258513,0.00048628132,0.0016949284,0.0034156765,0.0022869098,0.0020791919],"category_scores_gemma":[0.017088832,0.0009065851,0.0014299476,0.0019235086,0.0018789145,0.0022535503,0.0023920916,0.0028873426,0.001002715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009579963,0.000083511644,0.0018821101,0.00012840048,0.0001276422,0.00008457562,0.00010815696,0.79518926,0.0012242488,0.10341836,0.003640275,0.094017625],"study_design_scores_gemma":[0.00000859247,0.000011111563,0.00009150088,0.000005658176,0.000005713212,0.000008215758,0.0000044557087,0.9717405,0.00017952338,0.027566822,0.00037124712,0.000006722769],"about_ca_topic_score_codex":0.0070818854,"about_ca_topic_score_gemma":0.010260541,"teacher_disagreement_score":0.0070818854,"about_ca_system_score_codex":0.0014187645,"about_ca_system_score_gemma":0.0017968016,"threshold_uncertainty_score":0.023120701},"labels":[],"label_agreement":null},{"id":"W3114071090","doi":"10.1109/tsp.2021.3105921","title":"Unambiguous Delay-Doppler Recovery From Random Phase Coded Pulses","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; Horizon 2020 Framework Programme; National Natural Science Foundation of China; Air Force Office of Scientific Research; European Commission","keywords":"Nyquist–Shannon sampling theorem; Doppler effect; Algorithm; Pulse repetition frequency; Computer science; Signal-to-noise ratio (imaging); Mathematics; Upper and lower bounds; Radar; Telecommunications; Physics","score_opus":0.022321892313621163,"score_gpt":0.2554448069034277,"score_spread":0.23312291458980652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114071090","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04032901,0.00032106898,0.9571279,0.00013504489,0.000034503224,0.000035067435,0.00007784199,0.00017410133,0.0017654805],"genre_scores_gemma":[0.56018823,0.00052283716,0.43611756,0.00010874443,0.000042074676,0.0000678226,0.0001979123,0.000037085716,0.0027176975],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995141,0.000091003305,0.00002417735,0.00005077633,0.0002784993,0.000041489013],"domain_scores_gemma":[0.9990532,0.00051444967,0.00016050969,0.00013762299,0.00010317164,0.000031123673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005354173,0.00045416263,0.00047139183,0.0004340705,0.00016827768,0.00040305313,0.00040178007,0.0006663091,0.0010997038],"category_scores_gemma":[0.0035930648,0.00017611463,0.0002139763,0.00063745846,0.00042296445,0.0009196444,0.00088512356,0.00058230443,0.00033901533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000911824,0.00012269277,0.0011420209,0.0004783016,0.000049196533,0.00043911836,0.00018525598,0.35691223,0.1354945,0.063436605,0.0017654294,0.43906292],"study_design_scores_gemma":[0.000059842612,0.0001783928,0.00051572575,0.00003712945,0.00001234504,0.00045040183,0.000037406,0.91459763,0.06470334,0.017043417,0.0023276783,0.00003665173],"about_ca_topic_score_codex":0.0005680085,"about_ca_topic_score_gemma":0.0006537947,"teacher_disagreement_score":0.0010997038,"about_ca_system_score_codex":0.00021464303,"about_ca_system_score_gemma":0.0006410827,"threshold_uncertainty_score":0.0036788583},"labels":[],"label_agreement":null},{"id":"W3114760901","doi":"10.1109/tsp.2021.3139506","title":"Learned Factor Graphs for Inference From Stationary Time Sequences","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Signal Processing","topic":"Fractal and DNA sequence analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Horizon 2020 Framework Programme; Office of Naval Research; Israel Science Foundation","keywords":"Inference; Factor graph; Computer science; Artificial intelligence; Computation; Graph; Approximate inference; Artificial neural network; Factor (programming language); Sequence (biology); Algorithm; Machine learning; Pattern recognition (psychology); Theoretical computer science; Decoding methods","score_opus":0.033374682043188324,"score_gpt":0.30106513843652927,"score_spread":0.26769045639334094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114760901","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015702898,0.00008339711,0.9975153,0.00005085139,0.000010306387,0.000012934604,0.000114103124,0.00048207407,0.00016064088],"genre_scores_gemma":[0.24564268,0.00067516865,0.74731773,0.00030392502,0.000156658,0.0002778211,0.0028343683,0.00066060043,0.0021309603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822277,0.00050198694,0.0001276208,0.00067526085,0.00035840197,0.00011401147],"domain_scores_gemma":[0.9886973,0.00831525,0.00084395695,0.0011028436,0.00085656164,0.00018396859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024566653,0.0014935213,0.0012233013,0.0027920443,0.0007548256,0.0013477132,0.0020076833,0.0014548932,0.0034582596],"category_scores_gemma":[0.022293065,0.0010767387,0.0014150558,0.0019563586,0.001594319,0.0033876318,0.0013145355,0.0032912602,0.0014114314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001509968,0.000077491866,0.002034233,0.00018307833,0.00012327479,0.00013021268,0.00014717101,0.71315646,0.0030178772,0.09095141,0.0033822225,0.18664551],"study_design_scores_gemma":[0.000007998936,0.000010515565,0.00014986203,0.000012611628,0.0000075055373,0.00002137976,0.000006740341,0.92334026,0.0008119862,0.0748016,0.000817954,0.000011648409],"about_ca_topic_score_codex":0.00816494,"about_ca_topic_score_gemma":0.0089153815,"teacher_disagreement_score":0.00816494,"about_ca_system_score_codex":0.0018248196,"about_ca_system_score_gemma":0.0018032874,"threshold_uncertainty_score":0.016234815},"labels":[],"label_agreement":null},{"id":"W3118405171","doi":"10.1109/tsp.2020.3048231","title":"Maximum Likelihood Time Synchronization for Zero-Padded OFDM","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orthogonal frequency-division multiplexing; Synchronization (alternating current); Maximum likelihood; Zero (linguistics); Computer science; Mathematics; Algorithm; Zero crossing; Time synchronization; Control theory (sociology); Statistics; Real-time computing; Topology (electrical circuits); Artificial intelligence; Physics; Power (physics); Combinatorics","score_opus":0.011873075646727349,"score_gpt":0.24372695816224607,"score_spread":0.23185388251551872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118405171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054458203,0.0001509691,0.993338,0.000052558717,0.000014623688,0.000013280259,0.000020586216,0.00011068228,0.0008534544],"genre_scores_gemma":[0.5859033,0.000643571,0.41013017,0.0000845533,0.000063293504,0.00015095294,0.00015215995,0.00007875742,0.002793301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925774,0.00027389853,0.000039032195,0.00012349707,0.00026216588,0.000043543147],"domain_scores_gemma":[0.99854505,0.001051118,0.00013706979,0.00010778316,0.00013782429,0.000021046932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009989814,0.00040300682,0.0005444592,0.00037052625,0.0003456092,0.0007364734,0.00057821075,0.0005836597,0.0018941595],"category_scores_gemma":[0.0049427836,0.00031352678,0.00037151735,0.0006077862,0.0007433323,0.0008877419,0.000730589,0.000710964,0.0004273688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021945134,0.000045505487,0.0012248326,0.00019853286,0.00003990435,0.00021890496,0.0001982309,0.7500986,0.014762521,0.1225474,0.0011851904,0.10926098],"study_design_scores_gemma":[0.000012446105,0.00002255709,0.00010198221,0.000010013982,0.0000038621774,0.000050951316,0.000006321458,0.9899211,0.0025570772,0.006643087,0.00066239596,0.0000081678445],"about_ca_topic_score_codex":0.000761492,"about_ca_topic_score_gemma":0.00084871054,"teacher_disagreement_score":0.0018941595,"about_ca_system_score_codex":0.00062920485,"about_ca_system_score_gemma":0.0012271047,"threshold_uncertainty_score":0.00633657},"labels":[],"label_agreement":null},{"id":"W3121535799","doi":"10.1109/tsp.2021.3053509","title":"The JM-Filter to Detect Specific Frequency in Monitored Signal","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Fractal and DNA sequence analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Fast Fourier transform; Algorithm; Filter (signal processing); Split-radix FFT algorithm; Computer science; SIGNAL (programming language); Signal processing; Reduction (mathematics); Digital filter; Mathematics; Digital signal processing; Multidimensional signal processing; Discrete-time signal; Filter design; Fourier transform; Analog signal; Short-time Fourier transform; Signal transfer function; Fourier analysis; Computer vision","score_opus":0.01546166708261484,"score_gpt":0.2532118747683448,"score_spread":0.23775020768572994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121535799","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019728001,0.0003245101,0.97667456,0.00009747055,0.00008899865,0.00004312494,0.000057921803,0.00082471175,0.0021607263],"genre_scores_gemma":[0.14628242,0.00041906905,0.84591144,0.00016154071,0.00007838785,0.0000890845,0.00021046247,0.00009406524,0.0067534903],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996474,0.000042859887,0.000021130494,0.00008683354,0.00017555084,0.000026325279],"domain_scores_gemma":[0.999603,0.00012327023,0.000052035073,0.000061472485,0.00014298371,0.000017207427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056270295,0.0005093082,0.0003923895,0.00062166504,0.00027998586,0.00054904964,0.0006553193,0.00087686686,0.002856738],"category_scores_gemma":[0.001159562,0.00014685161,0.0004191701,0.0005603942,0.00027029793,0.0006489355,0.00030040636,0.0004966782,0.0011526742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005357688,0.00010908674,0.0013423613,0.00028029142,0.00006110033,0.00018869055,0.00013865271,0.011265286,0.3623492,0.009377495,0.0028420677,0.61151],"study_design_scores_gemma":[0.00007025169,0.000513736,0.005803169,0.00007243909,0.00007877923,0.0016002363,0.00008129934,0.5420024,0.40891224,0.0037432895,0.037051942,0.00007017081],"about_ca_topic_score_codex":0.0010173329,"about_ca_topic_score_gemma":0.0014714635,"teacher_disagreement_score":0.002856738,"about_ca_system_score_codex":0.0004708879,"about_ca_system_score_gemma":0.00050062186,"threshold_uncertainty_score":0.009556711},"labels":[],"label_agreement":null},{"id":"W3128159412","doi":"10.1109/tsp.2022.3168363","title":"New Closed-Form Joint Localization and Synchronization Using Sequential One-Way TOAs","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Synchronization (alternating current); Joint (building); Computer science; Algorithm; Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.025941748941957436,"score_gpt":0.23054926162365708,"score_spread":0.20460751268169963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128159412","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002250698,0.0000762481,0.9966428,0.00004239449,0.000025061316,0.000012615473,0.000019953774,0.00020458245,0.0007255952],"genre_scores_gemma":[0.29703668,0.0005577313,0.6952372,0.00018003349,0.00010691482,0.00024587044,0.000328949,0.00015847436,0.006148188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895716,0.00022055127,0.000056109184,0.00028774884,0.00038483815,0.000093514194],"domain_scores_gemma":[0.999106,0.00032145684,0.00014489568,0.00011483407,0.00027116842,0.00004157987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009589677,0.0011909498,0.0010546789,0.0006225274,0.0005060985,0.001357223,0.0015101208,0.0011718392,0.0020910786],"category_scores_gemma":[0.0029468953,0.0006407147,0.0009672517,0.0012755856,0.0008194201,0.0020985703,0.0019010748,0.001081045,0.00092022464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017557562,0.00006781378,0.00151225,0.00029528968,0.00009791659,0.00026588203,0.00035171566,0.7115098,0.024143536,0.06745664,0.0042943177,0.18982926],"study_design_scores_gemma":[0.000014719072,0.00003738916,0.00008599404,0.0000094455745,0.000009307394,0.00006886724,0.000019992582,0.99033785,0.0018700946,0.0053839106,0.0021463325,0.00001621337],"about_ca_topic_score_codex":0.003671773,"about_ca_topic_score_gemma":0.0039919936,"teacher_disagreement_score":0.003671773,"about_ca_system_score_codex":0.0005563367,"about_ca_system_score_gemma":0.0017490466,"threshold_uncertainty_score":0.007300794},"labels":[],"label_agreement":null},{"id":"W3133759829","doi":"10.1109/tsp.2021.3090679","title":"Sparse Activity Detection in Multi-Cell Massive MIMO Exploiting Channel Large-Scale Fading","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Fading; Computer science; Covariance; Base station; Algorithm; Channel (broadcasting); Covariance matrix; Quantization (signal processing); Multiuser detection; Mathematics; Telecommunications; Statistics; Code division multiple access","score_opus":0.02426084269122415,"score_gpt":0.24350145096888415,"score_spread":0.21924060827766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133759829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06947755,0.0002855798,0.92897326,0.0001381797,0.000025925465,0.0000262404,0.00004151741,0.00009870174,0.00093297864],"genre_scores_gemma":[0.955772,0.00028808517,0.042973083,0.00007250867,0.00004890402,0.000032904638,0.000053168405,0.0000088322095,0.0007506687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994211,0.00020230604,0.000019292242,0.00009544002,0.00016757658,0.0000941947],"domain_scores_gemma":[0.9966282,0.0024759346,0.00036255879,0.0001983775,0.00025150122,0.00008333431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010638117,0.0005766082,0.0007041513,0.0003236296,0.00025654788,0.00069984654,0.0005861832,0.00058363244,0.00029958977],"category_scores_gemma":[0.0043510804,0.00032194413,0.00028512732,0.0005681718,0.00093107106,0.0011573171,0.00085618655,0.00067976647,0.0001120427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001460279,0.00003683828,0.0011474943,0.00007320782,0.000042065818,0.00021677981,0.000096584845,0.9479193,0.009456109,0.011882689,0.0003088081,0.0286741],"study_design_scores_gemma":[0.000005636055,0.000028894478,0.00023088517,0.0000026958223,0.000004802089,0.000034423105,0.00001325415,0.9958359,0.0011717783,0.0025884612,0.00007836728,0.000004957],"about_ca_topic_score_codex":0.0015819413,"about_ca_topic_score_gemma":0.0012620691,"teacher_disagreement_score":0.0015819413,"about_ca_system_score_codex":0.00047183418,"about_ca_system_score_gemma":0.00046789835,"threshold_uncertainty_score":0.005626023},"labels":[],"label_agreement":null},{"id":"W3161817942","doi":"10.1109/tsp.2023.3262179","title":"Multi-Signal Approaches for Repeated Sampling Schemes in Inertial Sensor Calibration","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Inertial Sensor and Navigation","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Replicate; Calibration; Computer science; Constant (computer programming); Task (project management); Sampling (signal processing); SIGNAL (programming language); Inertial frame of reference; Stochastic modelling; Inertial navigation system; Noise (video); Algorithm; Statistics; Artificial intelligence; Mathematics; Engineering; Computer vision","score_opus":0.08411182869630203,"score_gpt":0.2826700023894771,"score_spread":0.19855817369317508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161817942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024757097,0.00018009712,0.9967464,0.000051049028,0.0000392814,0.000037358026,0.000018200772,0.000111581954,0.00034032896],"genre_scores_gemma":[0.1812465,0.0006669635,0.81446755,0.00017228056,0.00017661974,0.00041063345,0.00024268661,0.0001971469,0.0024194678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9941533,0.0025145516,0.00033258463,0.0009862008,0.0017941947,0.00021919572],"domain_scores_gemma":[0.99095094,0.0044837324,0.0009996829,0.00233278,0.0010793266,0.00015345716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00771845,0.0014145694,0.0009733607,0.0014184436,0.00061478565,0.0013074043,0.0028213689,0.0023871288,0.0022004952],"category_scores_gemma":[0.02276812,0.00068934314,0.0017086985,0.0014920485,0.0015336783,0.0022765496,0.0026040634,0.0022619716,0.0010058499],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043781425,0.00026241873,0.002887745,0.00051884516,0.0003336584,0.00039250895,0.0006111537,0.5792781,0.024835737,0.1460337,0.0015173294,0.24289101],"study_design_scores_gemma":[0.000015321506,0.00011769796,0.0004894454,0.000037623475,0.00003186286,0.000102323305,0.000026302418,0.97297215,0.0047086235,0.01896454,0.0024952956,0.000038853774],"about_ca_topic_score_codex":0.0019028137,"about_ca_topic_score_gemma":0.0020399098,"teacher_disagreement_score":0.00771845,"about_ca_system_score_codex":0.00096836983,"about_ca_system_score_gemma":0.00087133335,"threshold_uncertainty_score":0.040819526},"labels":[],"label_agreement":null},{"id":"W3162124830","doi":"10.1109/tsp.2021.3078093","title":"Joint Power Allocation and Distributed Equalization Design for OFDM-Based Filter-and-Forward Two-Way Multi-Relay Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Ontario Tech University","funders":"","keywords":"Computer science; Subcarrier; Transceiver; Transmitter power output; Orthogonal frequency-division multiplexing; Equalization (audio); Gradient descent; Relay; Upper and lower bounds; Interference (communication); Channel (broadcasting); Power (physics); Electronic engineering; Mathematical optimization; Transmitter; Telecommunications; Mathematics; Wireless; Engineering; Artificial neural network","score_opus":0.07901189679679516,"score_gpt":0.3000180491362714,"score_spread":0.22100615233947624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162124830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013264169,0.0002251128,0.9846164,0.000089292895,0.000020678257,0.000026543026,0.00001877471,0.00009094425,0.0016479873],"genre_scores_gemma":[0.811075,0.00048247346,0.18378513,0.00009254156,0.00004512245,0.00018190106,0.00005085902,0.0000460175,0.0042410353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996051,0.0001390034,0.000014752794,0.00008389611,0.00009802241,0.000059196056],"domain_scores_gemma":[0.9995758,0.00021946133,0.000050250652,0.000028498962,0.00010936673,0.00001651627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007647977,0.0008548407,0.0009172051,0.00025823258,0.0002908067,0.00089566037,0.0009382483,0.0009858406,0.0018243375],"category_scores_gemma":[0.0014662043,0.00039961023,0.00042563924,0.0003505019,0.00066408614,0.00090636534,0.00065283646,0.0005734316,0.00038520887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005296634,0.000035877907,0.00017727252,0.000056152385,0.000027001706,0.00005431794,0.000043882046,0.9646529,0.0044884724,0.005547168,0.00045989,0.024404185],"study_design_scores_gemma":[0.000007889162,0.000027119551,0.00003181774,0.0000023167609,0.0000050868002,0.000012966802,0.0000056325835,0.99795306,0.00071480864,0.0010136877,0.00022229517,0.0000032455887],"about_ca_topic_score_codex":0.0019630706,"about_ca_topic_score_gemma":0.0025653143,"teacher_disagreement_score":0.0019630706,"about_ca_system_score_codex":0.00079263165,"about_ca_system_score_gemma":0.0009014266,"threshold_uncertainty_score":0.006103039},"labels":[],"label_agreement":null},{"id":"W3165395996","doi":"10.1109/tsp.2021.3083988","title":"Dilated Arrays: A Family of Sparse Arrays With Increased Uniform Degrees of Freedom and Reduced Mutual Coupling on a Moving Platform","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sparse array; Robustness (evolution); Degrees of freedom (physics and chemistry); Redundancy (engineering); Coupling (piping); Computer science; Algorithm; Sensor array; Array gain; Topology (electrical circuits); Mathematics; Antenna array; Physics; Telecommunications; Engineering; Combinatorics","score_opus":0.029255073480383788,"score_gpt":0.2506038047519542,"score_spread":0.22134873127157043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165395996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054691713,0.0002485592,0.93877006,0.000173611,0.00008595376,0.000031956733,0.00013514986,0.00033427938,0.0055286707],"genre_scores_gemma":[0.47198376,0.0006147935,0.5197039,0.00022213152,0.000110153785,0.00020891808,0.00039923436,0.00010814083,0.0066488567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961394,0.000107249034,0.000015605081,0.000107878266,0.00011998877,0.00003536772],"domain_scores_gemma":[0.9994555,0.00019722519,0.00011367589,0.00009750811,0.00010106456,0.00003507475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025417676,0.0007261446,0.0004571527,0.00031413953,0.00021669999,0.00040874895,0.0004733241,0.0004986518,0.0019818791],"category_scores_gemma":[0.0012433182,0.00034353032,0.0004416049,0.000431997,0.00053258374,0.00085171126,0.00080546015,0.00052220194,0.0006900303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042111572,0.00007950053,0.00196439,0.00026363705,0.00008711605,0.0007471181,0.00033867217,0.40498945,0.29157102,0.0757278,0.0039250352,0.21988517],"study_design_scores_gemma":[0.000060848924,0.0005543664,0.0011543997,0.000026137424,0.000029448309,0.00055272883,0.00008604979,0.922575,0.038831547,0.016491886,0.019569812,0.00006775686],"about_ca_topic_score_codex":0.00038464833,"about_ca_topic_score_gemma":0.00048632929,"teacher_disagreement_score":0.0019818791,"about_ca_system_score_codex":0.00024885,"about_ca_system_score_gemma":0.00028084326,"threshold_uncertainty_score":0.006630063},"labels":[],"label_agreement":null},{"id":"W3197013133","doi":"10.1109/tsp.2022.3171678","title":"DQLEL: Deep Q-Learning for Energy-Optimized LoS/NLoS UWB Node Selection","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Defence Research and Development Canada; Concordia University","funders":"","keywords":"Beacon; Non-line-of-sight propagation; Computer science; Multilateration; Node (physics); Real-time computing; RSS; Wireless; Artificial intelligence; Telecommunications; Engineering","score_opus":0.009969674578276248,"score_gpt":0.2189438162547185,"score_spread":0.20897414167644227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197013133","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018281337,0.00047857538,0.97842556,0.00032812005,0.00005946789,0.00004176761,0.00009755538,0.00087219407,0.001415529],"genre_scores_gemma":[0.8370986,0.00033824207,0.15571308,0.00079127745,0.000076122065,0.00018505435,0.0003654807,0.00011072949,0.005321429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946386,0.00014846573,0.00002467809,0.0001352434,0.00011409803,0.000113619506],"domain_scores_gemma":[0.99874216,0.0007398427,0.000102202765,0.00007175183,0.0002565242,0.00008752444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001395012,0.00077118154,0.0009013935,0.0004238217,0.0003268724,0.00065278227,0.0020468633,0.0011326418,0.002932904],"category_scores_gemma":[0.0032653536,0.00039040972,0.00035763285,0.000483942,0.00071489444,0.0011542537,0.0014611635,0.0013960241,0.0005194123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018946925,0.00017005939,0.0018037974,0.000112852875,0.00004657357,0.00011149917,0.000086705484,0.80814785,0.0030700548,0.006186282,0.004045815,0.17602907],"study_design_scores_gemma":[0.000011490559,0.00003831348,0.00006932569,0.0000042835327,0.000003816642,0.000011011145,0.000005900753,0.99739,0.00040221805,0.0017746828,0.0002858683,0.0000030434785],"about_ca_topic_score_codex":0.0055976696,"about_ca_topic_score_gemma":0.006373401,"teacher_disagreement_score":0.0055976696,"about_ca_system_score_codex":0.0008467972,"about_ca_system_score_gemma":0.0014784884,"threshold_uncertainty_score":0.011130214},"labels":[],"label_agreement":null},{"id":"W3216758665","doi":"10.1109/tsp.2021.3130488","title":"Signal Processing Methods to Enhance the Energy Efficiency of In-Memory Computing Architectures","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Defense Advanced Research Projects Agency; Canadian Institute for Advanced Research; Semiconductor Research Corporation","keywords":"Quantization (signal processing); Computer science; Converters; Noise reduction; Digital signal processing; Algorithm; Signal processing; Electronic engineering; Computer hardware; Artificial intelligence; Power (physics); Engineering","score_opus":0.017476936749527713,"score_gpt":0.30746658848243485,"score_spread":0.28998965173290714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216758665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042867444,0.0015005775,0.94272506,0.00047328856,0.0001982812,0.00006584061,0.00008223926,0.0012666367,0.01082059],"genre_scores_gemma":[0.50056654,0.0011416061,0.48874372,0.00038378226,0.0001925123,0.00013755361,0.00018687408,0.00024792732,0.008399435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978167,0.000025751846,0.00001710829,0.000033296074,0.00011575822,0.000026367034],"domain_scores_gemma":[0.99960405,0.00013194518,0.00004866846,0.00007598553,0.00012534171,0.000014119351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028656953,0.00085938437,0.00032182105,0.0005829928,0.0003049806,0.0008312553,0.0011624419,0.0003837128,0.00469079],"category_scores_gemma":[0.0012854156,0.00017093128,0.00018530189,0.00064528664,0.00031666114,0.0013356361,0.0004646458,0.0006823156,0.0007637773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004062978,0.00024805323,0.0010255286,0.0005856918,0.00008703195,0.00019731392,0.00013498955,0.088697754,0.2928754,0.049291614,0.005234433,0.5612159],"study_design_scores_gemma":[0.000060103273,0.0004878886,0.0009720097,0.00007458021,0.000080819664,0.00032953123,0.000080023565,0.67869294,0.2743139,0.019102067,0.025779113,0.000027027858],"about_ca_topic_score_codex":0.0007742277,"about_ca_topic_score_gemma":0.0021854953,"teacher_disagreement_score":0.00469079,"about_ca_system_score_codex":0.0005164586,"about_ca_system_score_gemma":0.00042329135,"threshold_uncertainty_score":0.015692294},"labels":[],"label_agreement":null},{"id":"W3217692928","doi":"10.1109/tsp.2021.3129599","title":"Analysis of Propagation Delay Effects on Bearings-Only Fusion of Heterogeneous Sensors","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Estimator; Cramér–Rao bound; Propagation delay; Control theory (sociology); Propagation of uncertainty; SIGNAL (programming language); Taylor series; Mean squared error; Upper and lower bounds; Degradation (telecommunications); Bearing (navigation); Signal processing; Computer science; Mathematics; Algorithm; Statistics; Telecommunications; Mathematical analysis","score_opus":0.013575112102067055,"score_gpt":0.2453257148013083,"score_spread":0.23175060269924125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217692928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17643757,0.0015374578,0.8196668,0.00020855323,0.00006864448,0.000033680717,0.00005382687,0.00024679073,0.0017466645],"genre_scores_gemma":[0.9624705,0.000697934,0.035942633,0.00005245191,0.00003206281,0.000022894883,0.000059155325,0.000033885466,0.00068849325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922407,0.00016032814,0.000034847595,0.00012501943,0.00035236604,0.00010337228],"domain_scores_gemma":[0.9967037,0.0023054618,0.00029293043,0.0001861441,0.0004736884,0.000038064165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017264105,0.00074165995,0.00045644143,0.00036095563,0.0002749712,0.00054327596,0.00043276392,0.0006374427,0.00038547206],"category_scores_gemma":[0.0073291794,0.00021884363,0.00031660803,0.0004682348,0.00054789224,0.0012428949,0.00071310933,0.00047883674,0.000114995855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037128714,0.00003682848,0.0037539154,0.00015732099,0.00006869438,0.00038765883,0.00012308385,0.901049,0.037343796,0.008876129,0.00033948588,0.0474928],"study_design_scores_gemma":[0.000007118876,0.00008309307,0.0011578473,0.000007682541,0.000022856218,0.00013520912,0.000023178543,0.98194754,0.014684826,0.0015867214,0.0003311079,0.000012858255],"about_ca_topic_score_codex":0.0021797298,"about_ca_topic_score_gemma":0.0011823227,"teacher_disagreement_score":0.0021797298,"about_ca_system_score_codex":0.0008776251,"about_ca_system_score_gemma":0.00065707474,"threshold_uncertainty_score":0.00913018},"labels":[],"label_agreement":null},{"id":"W4213458025","doi":"10.1109/tsp.2022.3154227","title":"Consensus-Based Labeled Multi-Bernoulli Filter With Event-Triggered Communication","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Divergence (linguistics); Event (particle physics); Bernoulli's principle; Filter (signal processing); Probability density function; Algorithm; Mathematics","score_opus":0.02803566748642392,"score_gpt":0.26004051529893507,"score_spread":0.23200484781251116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213458025","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003310082,0.000075524586,0.995812,0.00005905073,0.000029205394,0.000016568682,0.000013624606,0.00010620559,0.0005776826],"genre_scores_gemma":[0.6257389,0.00039694062,0.3680416,0.00039964126,0.00014191834,0.00024236555,0.00023426469,0.00008499405,0.004719421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998439,0.0003697895,0.00007346988,0.00041260928,0.00056761026,0.00013758312],"domain_scores_gemma":[0.9979772,0.0010098597,0.000233741,0.00016179991,0.00051026855,0.00010709835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020408458,0.00085257925,0.001099507,0.00059681945,0.00067160197,0.0009654978,0.001931234,0.001425704,0.0012720174],"category_scores_gemma":[0.005196428,0.00043960172,0.0006342355,0.0007820007,0.0009261064,0.001955815,0.0015368068,0.0014422622,0.0004487162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045830285,0.00009945378,0.0015526224,0.00018692718,0.000094232084,0.00016356407,0.00034200688,0.7413106,0.017792126,0.05675237,0.0022580982,0.17898966],"study_design_scores_gemma":[0.000017272469,0.00003888797,0.00008403992,0.0000056920653,0.0000074339555,0.000029223904,0.000008124974,0.99268895,0.0015135852,0.005005687,0.0005891571,0.000011805092],"about_ca_topic_score_codex":0.0035409504,"about_ca_topic_score_gemma":0.0025764988,"teacher_disagreement_score":0.0035409504,"about_ca_system_score_codex":0.0011212982,"about_ca_system_score_gemma":0.0016104041,"threshold_uncertainty_score":0.0107931495},"labels":[],"label_agreement":null},{"id":"W4221145333","doi":"10.1109/tsp.2022.3163671","title":"Deep Generative Models for Downlink Channel Estimation in FDD Massive MIMO Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Telecommunications link; Channel (broadcasting); Computer science; MIMO; Overhead (engineering); Fading; Algorithm; Path (computing); Path loss; Channel state information; Electronic engineering; Telecommunications; Computer network; Engineering; Wireless","score_opus":0.021117184073089046,"score_gpt":0.24349149587078078,"score_spread":0.22237431179769174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221145333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031027254,0.00051430584,0.9660905,0.0003278337,0.00003847807,0.000016083517,0.00020065773,0.00052704226,0.0012579319],"genre_scores_gemma":[0.93643165,0.0006011424,0.05823738,0.00026591815,0.00008620076,0.00008230881,0.0005587223,0.000103189355,0.003633499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968946,0.0001066118,0.000011403767,0.000059456455,0.000067435474,0.000065553155],"domain_scores_gemma":[0.9986488,0.0009889937,0.00011322573,0.00008072746,0.00012181617,0.00004648822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007356969,0.0007934497,0.00085228443,0.00042426857,0.0002895656,0.0006190284,0.0009381742,0.0008652746,0.0014124083],"category_scores_gemma":[0.0029963183,0.0007453052,0.000620015,0.00053345383,0.0008482933,0.00080390513,0.0010131289,0.0016581228,0.00040989928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031118867,0.000011239517,0.0004238086,0.000018047389,0.000016438762,0.000029473877,0.000022346247,0.982936,0.0005221197,0.004792599,0.00036706464,0.010829647],"study_design_scores_gemma":[0.0000014694243,0.0000031366676,0.000056357356,0.0000017915129,0.0000018925557,0.0000042089578,0.0000017564246,0.9982663,0.000095411495,0.0015083672,0.000057100417,0.0000022144563],"about_ca_topic_score_codex":0.009040266,"about_ca_topic_score_gemma":0.010689895,"teacher_disagreement_score":0.009040266,"about_ca_system_score_codex":0.0007985126,"about_ca_system_score_gemma":0.0007362668,"threshold_uncertainty_score":0.01797527},"labels":[],"label_agreement":null},{"id":"W4226375155","doi":"10.1109/tsp.2022.3160004","title":"Low-Complexity ADMM-Based Algorithm for Robust Multi-Group Multicast Beamforming in Large-Scale Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Computer science; Computational complexity theory; Beamforming; Robustness (evolution); Algorithm; Convex optimization; MIMO; Convergence (economics); Optimization problem; Multicast; Mathematics; Regular polygon; Distributed computing","score_opus":0.029428358404734983,"score_gpt":0.2536017955927676,"score_spread":0.2241734371880326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226375155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011319035,0.00010019907,0.99795985,0.00007034787,0.000019920284,0.000011333623,0.000010225744,0.00009478328,0.00060132693],"genre_scores_gemma":[0.26095316,0.0005163309,0.734662,0.00020870527,0.00012282777,0.0002931926,0.0001982335,0.000076618264,0.0029690128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995609,0.00014792157,0.000022693273,0.00006975184,0.00015566121,0.000043136155],"domain_scores_gemma":[0.99961674,0.00017174701,0.000057407586,0.00004120529,0.00009590252,0.000016870394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081156037,0.0011538496,0.0009388533,0.0003635433,0.000460262,0.00057315076,0.000953947,0.0011491944,0.0017885988],"category_scores_gemma":[0.0014704628,0.00038314913,0.0006345039,0.0007272353,0.000518533,0.00089692394,0.0008823141,0.0013767541,0.0006802055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048081205,0.000030489115,0.00020824168,0.000106954576,0.000034759974,0.00006183307,0.00004675352,0.90139043,0.0047773053,0.013802435,0.0021505202,0.077342235],"study_design_scores_gemma":[0.0000073426695,0.000018291415,0.00002073529,0.000003122358,0.000002708962,0.00001088218,0.000004072101,0.99686724,0.0004848994,0.0019829862,0.0005947226,0.000003093454],"about_ca_topic_score_codex":0.0020209095,"about_ca_topic_score_gemma":0.0018458809,"teacher_disagreement_score":0.0020209095,"about_ca_system_score_codex":0.0004983506,"about_ca_system_score_gemma":0.0009609863,"threshold_uncertainty_score":0.0059834123},"labels":[],"label_agreement":null},{"id":"W4230415846","doi":"10.1109/tsp.2018.2858370","title":"IEEE Transactions on Signal Procesing Publication Information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Queen's University Belfast; Mitsubishi Electric Research Laboratories","keywords":"Computer science; Signal processing; SIGNAL (programming language); Speech recognition; Telecommunications","score_opus":0.0270076096818361,"score_gpt":0.25415090019481534,"score_spread":0.22714329051297924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230415846","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006617737,0.005708612,0.112807676,0.009136424,0.03054709,0.0004103507,0.015620233,0.007474654,0.81167716],"genre_scores_gemma":[0.035366453,0.00535275,0.01582285,0.00088970095,0.0027162815,0.00013081955,0.01602522,0.0013937885,0.92230225],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999508,0.00004176506,0.000038319562,0.000072378185,0.00028794375,0.000051508036],"domain_scores_gemma":[0.998473,0.00023326217,0.0000655153,0.0003806742,0.0007439718,0.00010371311],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005854381,0.0012684115,0.00089962553,0.0021435071,0.0006777702,0.0024191318,0.00088081893,0.0018662163,0.5270462],"category_scores_gemma":[0.0025634407,0.0003666467,0.00033009605,0.0020024953,0.00034939597,0.0019175357,0.0009957938,0.0012963865,0.34192964],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023671992,0.00011956577,0.0002726665,0.0003361566,0.000013917486,0.00011111061,0.00003214695,0.0013983916,0.0075282403,0.013905192,0.60626525,0.36978057],"study_design_scores_gemma":[0.000050615654,0.00010054784,0.00062875735,0.00020889287,0.000033346412,0.0002473943,0.000040341507,0.011440035,0.0075109834,0.009824761,0.96988153,0.00003283622],"about_ca_topic_score_codex":0.0009886695,"about_ca_topic_score_gemma":0.0017713348,"teacher_disagreement_score":0.4729538,"about_ca_system_score_codex":0.0005162282,"about_ca_system_score_gemma":0.0009787276,"threshold_uncertainty_score":0.6746112},"labels":[],"label_agreement":null},{"id":"W4235512127","doi":"10.1109/tsp.2013.2264997","title":"IEEE Transactions on Signal Processing publication information","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sensor Technology and Measurement Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Centre National de la Recherche Scientifique; College of Engineering, Michigan State University; Akademie Věd České Republiky; McGill University; Universitat Politècnica de Catalunya; Iowa State University; McMaster University; Johns Hopkins University; State University of New York; Purdue University","keywords":"Computer science; Signal processing; Multidimensional signal processing; Speech recognition; Digital signal processing; Computer hardware","score_opus":0.028720068555521318,"score_gpt":0.24223006047189966,"score_spread":0.21350999191637834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235512127","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006831616,0.036704693,0.38899928,0.011959098,0.046583533,0.0009077005,0.011181591,0.00994588,0.48688665],"genre_scores_gemma":[0.06868667,0.037632238,0.08647368,0.0045925034,0.014278384,0.00069272454,0.034992483,0.0015554138,0.75109583],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875295,0.00012212004,0.000112767346,0.00021063494,0.0006983095,0.0001031979],"domain_scores_gemma":[0.99784184,0.000283625,0.00008302668,0.00040244975,0.0012587432,0.00013031086],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011080074,0.0015617715,0.0012500488,0.0021422938,0.00080672756,0.0035389606,0.0012484774,0.0018839128,0.23555444],"category_scores_gemma":[0.004533436,0.0003434486,0.00063814054,0.0020264343,0.00053189765,0.002319633,0.0016434174,0.0020354388,0.1800963],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021933147,0.00010592439,0.00055916345,0.0004484298,0.000057029127,0.00023625937,0.0000479701,0.0016531444,0.004342117,0.011816256,0.51552004,0.46499434],"study_design_scores_gemma":[0.00005522687,0.000119811986,0.0008485408,0.0002620443,0.00005560134,0.00056612963,0.00006555226,0.014376906,0.0025410103,0.014485484,0.9665795,0.000044246342],"about_ca_topic_score_codex":0.0011631009,"about_ca_topic_score_gemma":0.0012651827,"teacher_disagreement_score":0.76444554,"about_ca_system_score_codex":0.0005238793,"about_ca_system_score_gemma":0.0016785612,"threshold_uncertainty_score":0.7880081},"labels":[],"label_agreement":null},{"id":"W4236174831","doi":"10.1109/tsp.2018.2881554","title":"IEEE Transactions on Signal Procesing Publication Information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Santa Clara University; Queen's University Belfast; Mitsubishi Electric Research Laboratories; Carnegie Mellon University; Harvard University","keywords":"Computer science; Signal processing; SIGNAL (programming language); Speech recognition; Telecommunications; Programming language","score_opus":0.0270076096818361,"score_gpt":0.25415090019481534,"score_spread":0.22714329051297924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236174831","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006617737,0.005708612,0.112807676,0.009136424,0.03054709,0.0004103507,0.015620233,0.007474654,0.81167716],"genre_scores_gemma":[0.035366453,0.00535275,0.01582285,0.00088970095,0.0027162815,0.00013081955,0.01602522,0.0013937885,0.92230225],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999508,0.00004176506,0.000038319562,0.000072378185,0.00028794375,0.000051508036],"domain_scores_gemma":[0.998473,0.00023326217,0.0000655153,0.0003806742,0.0007439718,0.00010371311],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005854381,0.0012684115,0.00089962553,0.0021435071,0.0006777702,0.0024191318,0.00088081893,0.0018662163,0.5270462],"category_scores_gemma":[0.0025634407,0.0003666467,0.00033009605,0.0020024953,0.00034939597,0.0019175357,0.0009957938,0.0012963865,0.34192964],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023671992,0.00011956577,0.0002726665,0.0003361566,0.000013917486,0.00011111061,0.00003214695,0.0013983916,0.0075282403,0.013905192,0.60626525,0.36978057],"study_design_scores_gemma":[0.000050615654,0.00010054784,0.00062875735,0.00020889287,0.000033346412,0.0002473943,0.000040341507,0.011440035,0.0075109834,0.009824761,0.96988153,0.00003283622],"about_ca_topic_score_codex":0.0009886695,"about_ca_topic_score_gemma":0.0017713348,"teacher_disagreement_score":0.4729538,"about_ca_system_score_codex":0.0005162282,"about_ca_system_score_gemma":0.0009787276,"threshold_uncertainty_score":0.6746112},"labels":[],"label_agreement":null},{"id":"W4236878635","doi":"10.1109/tsp.2018.2858940","title":"IEEE Transactions on Signal Procesing Publication Information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Queen's University Belfast; Mitsubishi Electric Research Laboratories; Carnegie Mellon University; Harvard University","keywords":"Computer science; Signal processing; SIGNAL (programming language); Speech recognition; Digital signal processing; Computer hardware; Programming language","score_opus":0.0270076096818361,"score_gpt":0.25415090019481534,"score_spread":0.22714329051297924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236878635","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006617737,0.005708612,0.112807676,0.009136424,0.03054709,0.0004103507,0.015620233,0.007474654,0.81167716],"genre_scores_gemma":[0.035366453,0.00535275,0.01582285,0.00088970095,0.0027162815,0.00013081955,0.01602522,0.0013937885,0.92230225],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999508,0.00004176506,0.000038319562,0.000072378185,0.00028794375,0.000051508036],"domain_scores_gemma":[0.998473,0.00023326217,0.0000655153,0.0003806742,0.0007439718,0.00010371311],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005854381,0.0012684115,0.00089962553,0.0021435071,0.0006777702,0.0024191318,0.00088081893,0.0018662163,0.5270462],"category_scores_gemma":[0.0025634407,0.0003666467,0.00033009605,0.0020024953,0.00034939597,0.0019175357,0.0009957938,0.0012963865,0.34192964],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023671992,0.00011956577,0.0002726665,0.0003361566,0.000013917486,0.00011111061,0.00003214695,0.0013983916,0.0075282403,0.013905192,0.60626525,0.36978057],"study_design_scores_gemma":[0.000050615654,0.00010054784,0.00062875735,0.00020889287,0.000033346412,0.0002473943,0.000040341507,0.011440035,0.0075109834,0.009824761,0.96988153,0.00003283622],"about_ca_topic_score_codex":0.0009886695,"about_ca_topic_score_gemma":0.0017713348,"teacher_disagreement_score":0.5270462,"about_ca_system_score_codex":0.0005162282,"about_ca_system_score_gemma":0.0009787276,"threshold_uncertainty_score":0.6746112},"labels":[],"label_agreement":null},{"id":"W4237560975","doi":"10.1109/tsp.2018.2839129","title":"IEEE Transactions on Signal Procesing Publication Information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Queen's University Belfast; Mitsubishi Electric Research Laboratories","keywords":"Computer science; Signal processing; SIGNAL (programming language); Speech recognition; Telecommunications","score_opus":0.0270076096818361,"score_gpt":0.25415090019481534,"score_spread":0.22714329051297924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237560975","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006617737,0.005708612,0.112807676,0.009136424,0.03054709,0.0004103507,0.015620233,0.007474654,0.81167716],"genre_scores_gemma":[0.035366453,0.00535275,0.01582285,0.00088970095,0.0027162815,0.00013081955,0.01602522,0.0013937885,0.92230225],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999508,0.00004176506,0.000038319562,0.000072378185,0.00028794375,0.000051508036],"domain_scores_gemma":[0.998473,0.00023326217,0.0000655153,0.0003806742,0.0007439718,0.00010371311],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005854381,0.0012684115,0.00089962553,0.0021435071,0.0006777702,0.0024191318,0.00088081893,0.0018662163,0.5270462],"category_scores_gemma":[0.0025634407,0.0003666467,0.00033009605,0.0020024953,0.00034939597,0.0019175357,0.0009957938,0.0012963865,0.34192964],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023671992,0.00011956577,0.0002726665,0.0003361566,0.000013917486,0.00011111061,0.00003214695,0.0013983916,0.0075282403,0.013905192,0.60626525,0.36978057],"study_design_scores_gemma":[0.000050615654,0.00010054784,0.00062875735,0.00020889287,0.000033346412,0.0002473943,0.000040341507,0.011440035,0.0075109834,0.009824761,0.96988153,0.00003283622],"about_ca_topic_score_codex":0.0009886695,"about_ca_topic_score_gemma":0.0017713348,"teacher_disagreement_score":0.5270462,"about_ca_system_score_codex":0.0005162282,"about_ca_system_score_gemma":0.0009787276,"threshold_uncertainty_score":0.6746112},"labels":[],"label_agreement":null},{"id":"W4238056441","doi":"10.1109/tsp.2013.2274314","title":"IEEE Transactions on Signal Processing publication information","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sensor Technology and Measurement Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Signal processing; Computer science; Multidimensional signal processing; Speech recognition; Digital signal processing; Computer hardware","score_opus":0.028720068555521318,"score_gpt":0.24223006047189966,"score_spread":0.21350999191637834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238056441","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006831616,0.036704693,0.38899928,0.011959098,0.046583533,0.0009077005,0.011181591,0.00994588,0.48688665],"genre_scores_gemma":[0.06868667,0.037632238,0.08647368,0.0045925034,0.014278384,0.00069272454,0.034992483,0.0015554138,0.75109583],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875295,0.00012212004,0.000112767346,0.00021063494,0.0006983095,0.0001031979],"domain_scores_gemma":[0.99784184,0.000283625,0.00008302668,0.00040244975,0.0012587432,0.00013031086],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011080074,0.0015617715,0.0012500488,0.0021422938,0.00080672756,0.0035389606,0.0012484774,0.0018839128,0.23555444],"category_scores_gemma":[0.004533436,0.0003434486,0.00063814054,0.0020264343,0.00053189765,0.002319633,0.0016434174,0.0020354388,0.1800963],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021933147,0.00010592439,0.00055916345,0.0004484298,0.000057029127,0.00023625937,0.0000479701,0.0016531444,0.004342117,0.011816256,0.51552004,0.46499434],"study_design_scores_gemma":[0.00005522687,0.000119811986,0.0008485408,0.0002620443,0.00005560134,0.00056612963,0.00006555226,0.014376906,0.0025410103,0.014485484,0.9665795,0.000044246342],"about_ca_topic_score_codex":0.0011631009,"about_ca_topic_score_gemma":0.0012651827,"teacher_disagreement_score":0.76444554,"about_ca_system_score_codex":0.0005238793,"about_ca_system_score_gemma":0.0016785612,"threshold_uncertainty_score":0.7880081},"labels":[],"label_agreement":null},{"id":"W4238284633","doi":"10.1109/tsp.2018.2870784","title":"IEEE Transactions on Signal Procesing Publication Information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Santa Clara University; Queen's University Belfast; Mitsubishi Electric Research Laboratories; Carnegie Mellon University; Harvard University","keywords":"Computer science; Signal processing; SIGNAL (programming language); Speech recognition; Telecommunications","score_opus":0.0270076096818361,"score_gpt":0.25415090019481534,"score_spread":0.22714329051297924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238284633","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006617737,0.005708612,0.112807676,0.009136424,0.03054709,0.0004103507,0.015620233,0.007474654,0.81167716],"genre_scores_gemma":[0.035366453,0.00535275,0.01582285,0.00088970095,0.0027162815,0.00013081955,0.01602522,0.0013937885,0.92230225],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999508,0.00004176506,0.000038319562,0.000072378185,0.00028794375,0.000051508036],"domain_scores_gemma":[0.998473,0.00023326217,0.0000655153,0.0003806742,0.0007439718,0.00010371311],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005854381,0.0012684115,0.00089962553,0.0021435071,0.0006777702,0.0024191318,0.00088081893,0.0018662163,0.5270462],"category_scores_gemma":[0.0025634407,0.0003666467,0.00033009605,0.0020024953,0.00034939597,0.0019175357,0.0009957938,0.0012963865,0.34192964],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023671992,0.00011956577,0.0002726665,0.0003361566,0.000013917486,0.00011111061,0.00003214695,0.0013983916,0.0075282403,0.013905192,0.60626525,0.36978057],"study_design_scores_gemma":[0.000050615654,0.00010054784,0.00062875735,0.00020889287,0.000033346412,0.0002473943,0.000040341507,0.011440035,0.0075109834,0.009824761,0.96988153,0.00003283622],"about_ca_topic_score_codex":0.0009886695,"about_ca_topic_score_gemma":0.0017713348,"teacher_disagreement_score":0.9975809,"about_ca_system_score_codex":0.0005162282,"about_ca_system_score_gemma":0.0009787276,"threshold_uncertainty_score":0.6746112},"labels":[],"label_agreement":null},{"id":"W4239833819","doi":"10.1109/tsp.2018.2839121","title":"IEEE Transactions on Signal Procesing Publication Information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Queen's University Belfast; Mitsubishi Electric Research Laboratories","keywords":"Computer science; Signal processing; Speech recognition; Telecommunications","score_opus":0.0270076096818361,"score_gpt":0.25415090019481534,"score_spread":0.22714329051297924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239833819","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006617737,0.005708612,0.112807676,0.009136424,0.03054709,0.0004103507,0.015620233,0.007474654,0.81167716],"genre_scores_gemma":[0.035366453,0.00535275,0.01582285,0.00088970095,0.0027162815,0.00013081955,0.01602522,0.0013937885,0.92230225],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999508,0.00004176506,0.000038319562,0.000072378185,0.00028794375,0.000051508036],"domain_scores_gemma":[0.998473,0.00023326217,0.0000655153,0.0003806742,0.0007439718,0.00010371311],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005854381,0.0012684115,0.00089962553,0.0021435071,0.0006777702,0.0024191318,0.00088081893,0.0018662163,0.5270462],"category_scores_gemma":[0.0025634407,0.0003666467,0.00033009605,0.0020024953,0.00034939597,0.0019175357,0.0009957938,0.0012963865,0.34192964],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023671992,0.00011956577,0.0002726665,0.0003361566,0.000013917486,0.00011111061,0.00003214695,0.0013983916,0.0075282403,0.013905192,0.60626525,0.36978057],"study_design_scores_gemma":[0.000050615654,0.00010054784,0.00062875735,0.00020889287,0.000033346412,0.0002473943,0.000040341507,0.011440035,0.0075109834,0.009824761,0.96988153,0.00003283622],"about_ca_topic_score_codex":0.0009886695,"about_ca_topic_score_gemma":0.0017713348,"teacher_disagreement_score":0.4729538,"about_ca_system_score_codex":0.0005162282,"about_ca_system_score_gemma":0.0009787276,"threshold_uncertainty_score":0.6746112},"labels":[],"label_agreement":null},{"id":"W4240112586","doi":"10.1109/tsp.2013.2274318","title":"IEEE Transactions on Signal Processing publication information","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sensor Technology and Measurement Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Signal processing; Computer science; Multidimensional signal processing; Speech recognition; Digital signal processing; Computer hardware","score_opus":0.028720068555521318,"score_gpt":0.24223006047189966,"score_spread":0.21350999191637834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240112586","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006831616,0.036704693,0.38899928,0.011959098,0.046583533,0.0009077005,0.011181591,0.00994588,0.48688665],"genre_scores_gemma":[0.06868667,0.037632238,0.08647368,0.0045925034,0.014278384,0.00069272454,0.034992483,0.0015554138,0.75109583],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875295,0.00012212004,0.000112767346,0.00021063494,0.0006983095,0.0001031979],"domain_scores_gemma":[0.99784184,0.000283625,0.00008302668,0.00040244975,0.0012587432,0.00013031086],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011080074,0.0015617715,0.0012500488,0.0021422938,0.00080672756,0.0035389606,0.0012484774,0.0018839128,0.23555444],"category_scores_gemma":[0.004533436,0.0003434486,0.00063814054,0.0020264343,0.00053189765,0.002319633,0.0016434174,0.0020354388,0.1800963],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021933147,0.00010592439,0.00055916345,0.0004484298,0.000057029127,0.00023625937,0.0000479701,0.0016531444,0.004342117,0.011816256,0.51552004,0.46499434],"study_design_scores_gemma":[0.00005522687,0.000119811986,0.0008485408,0.0002620443,0.00005560134,0.00056612963,0.00006555226,0.014376906,0.0025410103,0.014485484,0.9665795,0.000044246342],"about_ca_topic_score_codex":0.0011631009,"about_ca_topic_score_gemma":0.0012651827,"teacher_disagreement_score":0.76444554,"about_ca_system_score_codex":0.0005238793,"about_ca_system_score_gemma":0.0016785612,"threshold_uncertainty_score":0.7880081},"labels":[],"label_agreement":null},{"id":"W4240223021","doi":"10.1109/tsp.2013.2265116","title":"IEEE Transactions on Signal Processing publication information","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sensor Technology and Measurement Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Centre National de la Recherche Scientifique; College of Engineering, Michigan State University; Akademie Věd České Republiky; McGill University; Universitat Politècnica de Catalunya; Iowa State University; McMaster University; Johns Hopkins University; State University of New York; Purdue University","keywords":"Computer science; Signal processing; Multidimensional signal processing; Speech recognition; Digital signal processing; Computer hardware","score_opus":0.028720068555521318,"score_gpt":0.24223006047189966,"score_spread":0.21350999191637834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240223021","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006831616,0.036704693,0.38899928,0.011959098,0.046583533,0.0009077005,0.011181591,0.00994588,0.48688665],"genre_scores_gemma":[0.06868667,0.037632238,0.08647368,0.0045925034,0.014278384,0.00069272454,0.034992483,0.0015554138,0.75109583],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875295,0.00012212004,0.000112767346,0.00021063494,0.0006983095,0.0001031979],"domain_scores_gemma":[0.99784184,0.000283625,0.00008302668,0.00040244975,0.0012587432,0.00013031086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011080074,0.0015617715,0.0012500488,0.0021422938,0.00080672756,0.0035389606,0.0012484774,0.0018839128,0.23555444],"category_scores_gemma":[0.004533436,0.0003434486,0.00063814054,0.0020264343,0.00053189765,0.002319633,0.0016434174,0.0020354388,0.1800963],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021933147,0.00010592439,0.00055916345,0.0004484298,0.000057029127,0.00023625937,0.0000479701,0.0016531444,0.004342117,0.011816256,0.51552004,0.46499434],"study_design_scores_gemma":[0.00005522687,0.000119811986,0.0008485408,0.0002620443,0.00005560134,0.00056612963,0.00006555226,0.014376906,0.0025410103,0.014485484,0.9665795,0.000044246342],"about_ca_topic_score_codex":0.0011631009,"about_ca_topic_score_gemma":0.0012651827,"teacher_disagreement_score":0.23555444,"about_ca_system_score_codex":0.0005238793,"about_ca_system_score_gemma":0.0016785612,"threshold_uncertainty_score":0.7880081},"labels":[],"label_agreement":null},{"id":"W4240294106","doi":"10.1109/tsp.2004.839911","title":"Joint watermarking and compression using scalar quantization for maximizing robustness in the presence of additive Gaussian attacks","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Chinese University of Hong Kong; University of Hong Kong","keywords":"Digital watermarking; Quantization (signal processing); Algorithm; Dither; Robustness (evolution); Binary number; Decoding methods; Mathematics; Computer science; Rate–distortion theory; Data compression; Gaussian; Control theory (sociology); Noise shaping; Computer vision; Artificial intelligence","score_opus":0.04201208750466933,"score_gpt":0.29038117856565604,"score_spread":0.2483690910609867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240294106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07291358,0.0008343739,0.9230514,0.00025952724,0.000027796365,0.000065838154,0.000026128484,0.00022834497,0.0025930114],"genre_scores_gemma":[0.79033524,0.00047255465,0.2079915,0.00006850486,0.000042696127,0.000029241924,0.000028519567,0.000032477878,0.000999202],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998863,0.00033240984,0.00009383447,0.00017384611,0.00046721936,0.00006970061],"domain_scores_gemma":[0.998033,0.0010724493,0.00037553997,0.00022447945,0.0002505742,0.000044065495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012694721,0.00059503975,0.0005813623,0.00048853096,0.00032432392,0.0009837811,0.00045196913,0.0006910553,0.0010127535],"category_scores_gemma":[0.005315923,0.00023793001,0.00020779076,0.0007182163,0.00084689213,0.0015563753,0.00083376205,0.0005349908,0.00027682746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007686299,0.00013906407,0.0014497555,0.00043026358,0.00005044816,0.00022903935,0.00028427338,0.26150173,0.4063285,0.084625155,0.00087783975,0.2433154],"study_design_scores_gemma":[0.000062039406,0.00046253245,0.0005892487,0.00004305023,0.00004160615,0.00043249648,0.000040039,0.8081826,0.17381382,0.013782572,0.002495354,0.000054640986],"about_ca_topic_score_codex":0.0003408663,"about_ca_topic_score_gemma":0.0005090032,"teacher_disagreement_score":0.0012694721,"about_ca_system_score_codex":0.00053861184,"about_ca_system_score_gemma":0.0005877121,"threshold_uncertainty_score":0.0067136884},"labels":[],"label_agreement":null},{"id":"W4241528080","doi":"10.1109/tsp.2018.2870764","title":"IEEE Transactions on Signal Procesing Publication Information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Queen's University Belfast; Mitsubishi Electric Research Laboratories; Carnegie Mellon University; Harvard University","keywords":"Computer science; Signal processing; SIGNAL (programming language); Speech recognition; Telecommunications","score_opus":0.0270076096818361,"score_gpt":0.25415090019481534,"score_spread":0.22714329051297924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241528080","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006617737,0.005708612,0.112807676,0.009136424,0.03054709,0.0004103507,0.015620233,0.007474654,0.81167716],"genre_scores_gemma":[0.035366453,0.00535275,0.01582285,0.00088970095,0.0027162815,0.00013081955,0.01602522,0.0013937885,0.92230225],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999508,0.00004176506,0.000038319562,0.000072378185,0.00028794375,0.000051508036],"domain_scores_gemma":[0.998473,0.00023326217,0.0000655153,0.0003806742,0.0007439718,0.00010371311],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005854381,0.0012684115,0.00089962553,0.0021435071,0.0006777702,0.0024191318,0.00088081893,0.0018662163,0.5270462],"category_scores_gemma":[0.0025634407,0.0003666467,0.00033009605,0.0020024953,0.00034939597,0.0019175357,0.0009957938,0.0012963865,0.34192964],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023671992,0.00011956577,0.0002726665,0.0003361566,0.000013917486,0.00011111061,0.00003214695,0.0013983916,0.0075282403,0.013905192,0.60626525,0.36978057],"study_design_scores_gemma":[0.000050615654,0.00010054784,0.00062875735,0.00020889287,0.000033346412,0.0002473943,0.000040341507,0.011440035,0.0075109834,0.009824761,0.96988153,0.00003283622],"about_ca_topic_score_codex":0.0009886695,"about_ca_topic_score_gemma":0.0017713348,"teacher_disagreement_score":0.4729538,"about_ca_system_score_codex":0.0005162282,"about_ca_system_score_gemma":0.0009787276,"threshold_uncertainty_score":0.6746112},"labels":[],"label_agreement":null},{"id":"W4241863838","doi":"10.1109/tsp.2018.2881566","title":"IEEE Transactions on Signal Procesing Publication Information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Santa Clara University; Queen's University Belfast; Mitsubishi Electric Research Laboratories; Carnegie Mellon University; Harvard University","keywords":"Computer science; Signal processing; SIGNAL (programming language); Speech recognition; Telecommunications","score_opus":0.0270076096818361,"score_gpt":0.25415090019481534,"score_spread":0.22714329051297924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241863838","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006617737,0.005708612,0.112807676,0.009136424,0.03054709,0.0004103507,0.015620233,0.007474654,0.81167716],"genre_scores_gemma":[0.035366453,0.00535275,0.01582285,0.00088970095,0.0027162815,0.00013081955,0.01602522,0.0013937885,0.92230225],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999508,0.00004176506,0.000038319562,0.000072378185,0.00028794375,0.000051508036],"domain_scores_gemma":[0.998473,0.00023326217,0.0000655153,0.0003806742,0.0007439718,0.00010371311],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005854381,0.0012684115,0.00089962553,0.0021435071,0.0006777702,0.0024191318,0.00088081893,0.0018662163,0.5270462],"category_scores_gemma":[0.0025634407,0.0003666467,0.00033009605,0.0020024953,0.00034939597,0.0019175357,0.0009957938,0.0012963865,0.34192964],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023671992,0.00011956577,0.0002726665,0.0003361566,0.000013917486,0.00011111061,0.00003214695,0.0013983916,0.0075282403,0.013905192,0.60626525,0.36978057],"study_design_scores_gemma":[0.000050615654,0.00010054784,0.00062875735,0.00020889287,0.000033346412,0.0002473943,0.000040341507,0.011440035,0.0075109834,0.009824761,0.96988153,0.00003283622],"about_ca_topic_score_codex":0.0009886695,"about_ca_topic_score_gemma":0.0017713348,"teacher_disagreement_score":0.4729538,"about_ca_system_score_codex":0.0005162282,"about_ca_system_score_gemma":0.0009787276,"threshold_uncertainty_score":0.6746112},"labels":[],"label_agreement":null},{"id":"W4245588493","doi":"10.1109/tsp.2018.2839123","title":"IEEE Transactions on Signal Procesing Publication Information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Queen's University Belfast; Mitsubishi Electric Research Laboratories","keywords":"Computer science; Signal processing; Speech recognition; Telecommunications","score_opus":0.0270076096818361,"score_gpt":0.25415090019481534,"score_spread":0.22714329051297924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245588493","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006617737,0.005708612,0.112807676,0.009136424,0.03054709,0.0004103507,0.015620233,0.007474654,0.81167716],"genre_scores_gemma":[0.035366453,0.00535275,0.01582285,0.00088970095,0.0027162815,0.00013081955,0.01602522,0.0013937885,0.92230225],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999508,0.00004176506,0.000038319562,0.000072378185,0.00028794375,0.000051508036],"domain_scores_gemma":[0.998473,0.00023326217,0.0000655153,0.0003806742,0.0007439718,0.00010371311],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005854381,0.0012684115,0.00089962553,0.0021435071,0.0006777702,0.0024191318,0.00088081893,0.0018662163,0.5270462],"category_scores_gemma":[0.0025634407,0.0003666467,0.00033009605,0.0020024953,0.00034939597,0.0019175357,0.0009957938,0.0012963865,0.34192964],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023671992,0.00011956577,0.0002726665,0.0003361566,0.000013917486,0.00011111061,0.00003214695,0.0013983916,0.0075282403,0.013905192,0.60626525,0.36978057],"study_design_scores_gemma":[0.000050615654,0.00010054784,0.00062875735,0.00020889287,0.000033346412,0.0002473943,0.000040341507,0.011440035,0.0075109834,0.009824761,0.96988153,0.00003283622],"about_ca_topic_score_codex":0.0009886695,"about_ca_topic_score_gemma":0.0017713348,"teacher_disagreement_score":0.4729538,"about_ca_system_score_codex":0.0005162282,"about_ca_system_score_gemma":0.0009787276,"threshold_uncertainty_score":0.6746112},"labels":[],"label_agreement":null},{"id":"W4247290662","doi":"10.1109/tsp.2015.2437811","title":"IEEE Transactions on Signal Processing publication information","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sensor Technology and Measurement Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; York University","funders":"","keywords":"Signal processing; Computer science; Multidimensional signal processing; Speech recognition; Telecommunications; Radar","score_opus":0.05079694095685897,"score_gpt":0.26313017268261535,"score_spread":0.21233323172575638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247290662","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068169134,0.03507903,0.39005685,0.0121237915,0.046179045,0.0009091489,0.011377218,0.0099343695,0.48752362],"genre_scores_gemma":[0.06943583,0.03643638,0.08561122,0.0046332353,0.014458543,0.00069103634,0.035611123,0.0015954925,0.7515272],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998728,0.00012310034,0.00011483474,0.00021393926,0.0007146539,0.000105401],"domain_scores_gemma":[0.99776113,0.00029031918,0.000086108805,0.00041431995,0.0013116566,0.00013638921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011281171,0.0015552123,0.0012394252,0.0021796247,0.00081562006,0.003574493,0.0012616436,0.001887846,0.24085817],"category_scores_gemma":[0.004667231,0.00034359322,0.00064147264,0.0020247416,0.0005343319,0.0023368916,0.0016624787,0.0020390062,0.1831294],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021808954,0.00010554321,0.00056169595,0.0004462897,0.00005642133,0.00023767295,0.000048162063,0.0016653773,0.0043661795,0.011885145,0.52174145,0.45866808],"study_design_scores_gemma":[0.00005498489,0.000119820375,0.00085437176,0.00026452617,0.000054582386,0.0005739499,0.00006680524,0.014596589,0.0025776897,0.0147031825,0.9660887,0.00004471485],"about_ca_topic_score_codex":0.00116493,"about_ca_topic_score_gemma":0.0012718012,"teacher_disagreement_score":0.24085817,"about_ca_system_score_codex":0.0005333135,"about_ca_system_score_gemma":0.0017132122,"threshold_uncertainty_score":0.80575085},"labels":[],"label_agreement":null},{"id":"W4249078251","doi":"10.1109/tsp.2012.2215604","title":"Average-Consensus in a Deterministic Framework— Part II: Central Connectivity","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Consensus algorithm; Convergence (economics); Computer science; Rate of convergence; Mathematical proof; Upper and lower bounds; Uniform consensus; Node (physics); Algorithm; Process (computing); Mathematical optimization; Consensus; Mathematics; Theoretical computer science; Artificial intelligence; Multi-agent system; Key (lock)","score_opus":0.029734754738576133,"score_gpt":0.2662125139550908,"score_spread":0.2364777592165147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249078251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014458063,0.0007279503,0.9809456,0.0005458367,0.00006888188,0.000040582723,0.00003536381,0.00007773901,0.0031000602],"genre_scores_gemma":[0.8635056,0.0011017004,0.13231385,0.00021530877,0.00025688804,0.00022734657,0.000085034015,0.000054268254,0.0022398832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735093,0.0009817585,0.000109883455,0.00064948446,0.00065695023,0.00025096073],"domain_scores_gemma":[0.9941888,0.0034871774,0.0007893921,0.0008654964,0.00051425,0.00015489847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028345843,0.00069847034,0.0013575526,0.0007326681,0.0010856444,0.0019723254,0.0025513733,0.0015060524,0.0015152632],"category_scores_gemma":[0.0099370275,0.00045940114,0.001033178,0.0011113071,0.002566493,0.0033035022,0.0020759562,0.0015474225,0.00022296056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005592808,0.000031131927,0.0007017793,0.00013494905,0.000056648678,0.00013682383,0.00008778824,0.74360263,0.0018233629,0.23028156,0.0015009019,0.021586534],"study_design_scores_gemma":[0.000014162962,0.000044151944,0.00025404224,0.000011722396,0.000018350269,0.00009801713,0.000032887816,0.9247328,0.0009068661,0.07203469,0.0018334256,0.000018890585],"about_ca_topic_score_codex":0.0025506965,"about_ca_topic_score_gemma":0.0019615083,"teacher_disagreement_score":0.0028345843,"about_ca_system_score_codex":0.0017792993,"about_ca_system_score_gemma":0.0019792004,"threshold_uncertainty_score":0.014990926},"labels":[],"label_agreement":null},{"id":"W4285028835","doi":"10.1109/tsp.2022.3189173","title":"Novel Recovery Algorithms for Block Sparse Signals With Known and Unknown Borders","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Algorithm; Block (permutation group theory); Iterated function; Bayesian probability; Covariance; Computer science; Gaussian; Mathematics; Artificial intelligence; Statistics","score_opus":0.02557308936222489,"score_gpt":0.2506342416055709,"score_spread":0.22506115224334602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285028835","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011973326,0.000061410945,0.99838424,0.00004140048,0.000007750129,0.000011344608,0.000010948599,0.00006479179,0.00022068644],"genre_scores_gemma":[0.054888364,0.00038695033,0.94207436,0.00011966769,0.000059633687,0.0001002565,0.00014225289,0.00008948773,0.0021389502],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992071,0.00015189109,0.000050788236,0.0001319016,0.00039046432,0.00006795568],"domain_scores_gemma":[0.99817026,0.00094861654,0.0002986005,0.00017675641,0.0003417818,0.00006402035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016134161,0.00074218743,0.00087018166,0.00089330436,0.00034997388,0.0008188878,0.0013802437,0.0014236458,0.001618334],"category_scores_gemma":[0.0058224876,0.00059448415,0.00074555026,0.0009303103,0.0007911941,0.0023198458,0.0018344721,0.0018487324,0.00080052787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023630855,0.000095145886,0.0007618399,0.00023290644,0.000076560435,0.00013022586,0.0002741397,0.41201365,0.021403458,0.08527365,0.0034578906,0.47604424],"study_design_scores_gemma":[0.000014419941,0.000023651804,0.000103750936,0.000011013805,0.000008363063,0.00007696671,0.000009367366,0.9883307,0.0026782062,0.0072802478,0.0014510576,0.000012343162],"about_ca_topic_score_codex":0.0015893528,"about_ca_topic_score_gemma":0.0024098584,"teacher_disagreement_score":0.001618334,"about_ca_system_score_codex":0.0006160992,"about_ca_system_score_gemma":0.0011362453,"threshold_uncertainty_score":0.008532703},"labels":[],"label_agreement":null},{"id":"W4285547440","doi":"10.1109/tsp.2020.3046152","title":"IEEE Signal Processing Society","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Human auditory perception and evaluation","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Standards Association","funders":"Chinese University of Hong Kong; Technische Universiteit Delft; Centre National de la Recherche Scientifique; King Abdullah University of Science and Technology; Stony Brook University; Ben-Gurion University of the Negev; Institut national de recherche en informatique et en automatique (INRIA); Carnegie Mellon University","keywords":"Signal processing; Computer science; Multidimensional signal processing; Digital signal processing; Speech recognition; Computer hardware","score_opus":0.03746989205493848,"score_gpt":0.27662737961945144,"score_spread":0.23915748756451297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285547440","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004738557,0.02016244,0.555752,0.009731794,0.01899129,0.0005315378,0.003456379,0.012692405,0.37394372],"genre_scores_gemma":[0.07462069,0.025945377,0.17191233,0.0055751055,0.007868851,0.00073065836,0.016347138,0.0016900634,0.69530976],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985745,0.00014814064,0.00011259075,0.00032399935,0.0007401003,0.00010070015],"domain_scores_gemma":[0.996938,0.00022835763,0.00007308619,0.0004868917,0.0021262448,0.00014742133],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011981598,0.0013750304,0.0008834002,0.0023000238,0.0008641273,0.003813347,0.001307218,0.0022507366,0.102170035],"category_scores_gemma":[0.0032423062,0.0003999065,0.00063518155,0.001965955,0.00067162403,0.001885079,0.0017069367,0.0027384027,0.1339139],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016999424,0.000066482826,0.0005409757,0.00027140428,0.000056612374,0.00026882466,0.00008529346,0.0018026327,0.012177086,0.015220616,0.30791214,0.661428],"study_design_scores_gemma":[0.000028569468,0.000093206414,0.00072519376,0.00017211561,0.00003268279,0.00065628556,0.000068565576,0.011290132,0.0046967673,0.0114018405,0.9707865,0.00004830839],"about_ca_topic_score_codex":0.001959496,"about_ca_topic_score_gemma":0.0011488841,"teacher_disagreement_score":0.89782995,"about_ca_system_score_codex":0.0006540085,"about_ca_system_score_gemma":0.0014499292,"threshold_uncertainty_score":0.34179282},"labels":[],"label_agreement":null},{"id":"W4312881501","doi":"10.1109/tsp.2022.3215651","title":"Location Estimates From Channel State Information via Binary Programming","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Binary number; Channel state information; Multipath propagation; Channel (broadcasting); Transmitter; Binary code; Binary data; Algorithm; State (computer science); Frame (networking); Real-time computing; Covariance; Mathematical optimization; Computer engineering; Theoretical computer science; Wireless; Telecommunications; Mathematics; Statistics","score_opus":0.0092684687929963,"score_gpt":0.2088184357551346,"score_spread":0.19954996696213828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312881501","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004987034,0.000034171007,0.9933863,0.00014049717,0.000009307748,0.00001458643,0.00003945791,0.00015910093,0.0012294702],"genre_scores_gemma":[0.47192657,0.0002667982,0.5215779,0.00020746012,0.000070278395,0.000244479,0.00045663866,0.0002289082,0.0050209565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915695,0.0003345178,0.000036358633,0.0001209291,0.00025445886,0.000096824966],"domain_scores_gemma":[0.9972229,0.0020073075,0.00023241423,0.00015936334,0.0003228245,0.00005513335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014141478,0.0007329509,0.00073223293,0.00060512766,0.00035493018,0.0016139038,0.0010584898,0.0009057835,0.0034267956],"category_scores_gemma":[0.0075062886,0.00062322704,0.00042822497,0.00083700306,0.00087707833,0.0022248619,0.0016283985,0.0018215793,0.0006713758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096881064,0.00003600473,0.00040675898,0.000061260944,0.000012358085,0.000027648517,0.00006064894,0.90907955,0.001443399,0.033834193,0.001044528,0.053896744],"study_design_scores_gemma":[0.0000047368053,0.000009085117,0.000030998657,0.0000049675814,0.0000014059789,0.000006003928,0.000006706763,0.9918268,0.00038726974,0.007466817,0.0002525588,0.0000026904313],"about_ca_topic_score_codex":0.0032563598,"about_ca_topic_score_gemma":0.0027168957,"teacher_disagreement_score":0.0034267956,"about_ca_system_score_codex":0.0007257734,"about_ca_system_score_gemma":0.001223936,"threshold_uncertainty_score":0.011463761},"labels":[],"label_agreement":null},{"id":"W4313535076","doi":"10.1109/tsp.2023.3234469","title":"Explicitly Solvable Continuous-Time Inference for Partially Observed Markov Processes","year":2022,"lang":"en","type":"preprint","venue":"IEEE Transactions on Signal Processing","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Science Foundation of Sri Lanka; National Institutes of Health","keywords":"Conditional probability; Mathematics; Markov process; Regular conditional probability; Discrete time and continuous time; Markov chain; Inference; Hidden Markov model; Variable-order Markov model; Markov model; Applied mathematics; Conditional probability distribution; Algorithm; Markov property; Computer science; Random variable; Probability mass function; Artificial intelligence; Statistics","score_opus":0.030677737745652106,"score_gpt":0.2727955737205421,"score_spread":0.24211783597488998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313535076","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02438681,0.00023242465,0.9732559,0.00046215687,0.000037553884,0.00003223653,0.00020855821,0.00034400064,0.0010402821],"genre_scores_gemma":[0.7091611,0.0004084362,0.28367576,0.00024904517,0.0001616735,0.00034501925,0.0011602311,0.00028683685,0.004551933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875414,0.0004931864,0.00006419675,0.00030005098,0.00023408498,0.00015432388],"domain_scores_gemma":[0.97274303,0.02474472,0.00084702374,0.00064145215,0.0006361921,0.00038768997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038650357,0.0009903952,0.0017869438,0.0008889469,0.0007956761,0.0018462325,0.0025048782,0.0022774087,0.0038594387],"category_scores_gemma":[0.0209952,0.0013726105,0.0015497605,0.0010680956,0.0021747395,0.0026849639,0.0019493558,0.0034904063,0.0003520521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058864887,0.000029092249,0.00084535405,0.000057978585,0.000030312029,0.00010369903,0.00006476898,0.9443707,0.0002706476,0.04792497,0.00032544555,0.0059182476],"study_design_scores_gemma":[0.000005825646,0.0000017786034,0.000029931301,0.0000024139667,0.0000019869724,0.0000047386475,0.0000030582055,0.98483753,0.00006478721,0.014983352,0.00006198397,0.0000026003017],"about_ca_topic_score_codex":0.014881016,"about_ca_topic_score_gemma":0.017440278,"teacher_disagreement_score":0.014881016,"about_ca_system_score_codex":0.0023137333,"about_ca_system_score_gemma":0.0031037487,"threshold_uncertainty_score":0.029588819},"labels":[],"label_agreement":null},{"id":"W4316661226","doi":"10.1109/tsp.2022.3229949","title":"A Synchro-Set-Aided Breadth-First Sphere Decoder for Polar-Coded MIMO Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Decoding methods; MIMO; Computer science; Bit error rate; Algorithm; Error detection and correction; Word error rate; Synchro; Low latency (capital markets); Sequential decoding; Real-time computing; Theoretical computer science; Channel (broadcasting); Speech recognition; Block code; Telecommunications; Engineering; Computer network","score_opus":0.029163317549461866,"score_gpt":0.2729816400387376,"score_spread":0.24381832248927574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316661226","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011209807,0.00015618138,0.9867154,0.00008492464,0.000025310073,0.000021071664,0.000058462167,0.00027844656,0.0014504825],"genre_scores_gemma":[0.34780082,0.00044379407,0.6475318,0.0001591612,0.000053175983,0.0000864344,0.00035400622,0.000051384795,0.0035194375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993747,0.0001848813,0.000037278565,0.00007770187,0.00026787582,0.000057580797],"domain_scores_gemma":[0.9993753,0.00024125986,0.000057420108,0.000105167695,0.0001832054,0.000037658494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005254811,0.00069962285,0.00054492307,0.000439123,0.00043757964,0.0007002442,0.0006032826,0.00061488966,0.0012583499],"category_scores_gemma":[0.001375327,0.00030003054,0.00036212493,0.0006473773,0.00048510035,0.0007735832,0.0009449854,0.0007674551,0.00079103047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060187286,0.00008866803,0.0011412557,0.0002042814,0.0000711205,0.00031132443,0.00034059744,0.5249872,0.10619226,0.06542478,0.003478737,0.29715785],"study_design_scores_gemma":[0.000026994518,0.00009226285,0.00011055104,0.00001458003,0.000011566688,0.00015479364,0.000019754434,0.96529424,0.026793813,0.0051373937,0.0023182174,0.0000257542],"about_ca_topic_score_codex":0.0021732594,"about_ca_topic_score_gemma":0.0027069938,"teacher_disagreement_score":0.0021732594,"about_ca_system_score_codex":0.0004942243,"about_ca_system_score_gemma":0.0015268532,"threshold_uncertainty_score":0.0043212175},"labels":[],"label_agreement":null},{"id":"W4327661951","doi":"10.1109/tsp.2023.3256044","title":"Maximum Likelihood Detection in Single-Input Double-Output Non-Gaussian Barrage-Jammed Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Detector; Gaussian; Transmitter; Algorithm; Gaussian noise; Mathematics; Computer science; Channel (broadcasting); Topology (electrical circuits); Telecommunications; Physics; Combinatorics","score_opus":0.023109665409374234,"score_gpt":0.2411987597570797,"score_spread":0.21808909434770546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327661951","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01968063,0.00031659438,0.97763455,0.00015974327,0.000015148837,0.000014567743,0.000056132732,0.00012884176,0.001993736],"genre_scores_gemma":[0.8313591,0.0007117622,0.16343525,0.00018056748,0.000076138014,0.0001311881,0.0002453508,0.0000739689,0.0037865937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989911,0.00037236107,0.00004633341,0.00014085101,0.00031534192,0.00013399118],"domain_scores_gemma":[0.9974486,0.001758428,0.00026992484,0.00017730099,0.00029079206,0.000054853466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016932946,0.0008073994,0.0008121728,0.00061788276,0.0002676637,0.0016639275,0.0009004046,0.0011367293,0.0011967164],"category_scores_gemma":[0.0071673407,0.0004466944,0.00051723723,0.000722408,0.001217644,0.0014767002,0.0015006327,0.0010714541,0.0005645644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031406374,0.00005372359,0.0017699745,0.00032567594,0.000077773184,0.00056240155,0.0005323781,0.7076423,0.008328205,0.22100797,0.001582749,0.057802718],"study_design_scores_gemma":[0.000011279771,0.000025427671,0.00019400397,0.000017161487,0.000005846925,0.00008688533,0.000023048948,0.9642366,0.0019516917,0.03287859,0.0005506798,0.000018770408],"about_ca_topic_score_codex":0.00060422946,"about_ca_topic_score_gemma":0.00044616906,"teacher_disagreement_score":0.0016932946,"about_ca_system_score_codex":0.0007555949,"about_ca_system_score_gemma":0.00060119526,"threshold_uncertainty_score":0.008955121},"labels":[],"label_agreement":null},{"id":"W4360995371","doi":"10.1109/tsp.2023.3260561","title":"Joint Optimization of Transmit Beamforming and Base Station Cache Allocation in Multi-Cell C-RAN","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Cache; Computer science; Backhaul (telecommunications); Optimization problem; Base station; Telecommunications link; Mathematical optimization; Convex optimization; Computer network; Algorithm; Telecommunications; Mathematics; Regular polygon","score_opus":0.027096382644052404,"score_gpt":0.24474101340621807,"score_spread":0.21764463076216567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360995371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03358895,0.0008612324,0.95924217,0.00038087607,0.000060555776,0.000051300765,0.00011907906,0.00016400314,0.0055318954],"genre_scores_gemma":[0.87597555,0.0013703959,0.11599251,0.00019351952,0.000102176586,0.00016142166,0.00015849949,0.00011567464,0.0059303776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993655,0.00026053065,0.000019309868,0.000100306905,0.00012655709,0.00012783844],"domain_scores_gemma":[0.9985979,0.0010000588,0.00013649772,0.00004242559,0.00016902255,0.00005395344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011802106,0.001355248,0.000995828,0.00034852882,0.00033741022,0.0011786132,0.0007630127,0.0012216485,0.0012971831],"category_scores_gemma":[0.0027164035,0.00048255225,0.0004571028,0.0009448112,0.0008921955,0.0010988734,0.0007760374,0.0008091882,0.00025597104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031866766,0.000017556174,0.00017141613,0.00003164668,0.000017675924,0.000035836216,0.000008159194,0.99053776,0.00080518343,0.0038392516,0.000281409,0.0042222347],"study_design_scores_gemma":[0.000005055727,0.000021912121,0.00007502687,0.0000031942343,0.0000071498857,0.000008739436,0.0000073148412,0.99795866,0.00038060406,0.0013786221,0.00015004438,0.000003739656],"about_ca_topic_score_codex":0.0073851827,"about_ca_topic_score_gemma":0.0062484173,"teacher_disagreement_score":0.0073851827,"about_ca_system_score_codex":0.0011222679,"about_ca_system_score_gemma":0.0017218196,"threshold_uncertainty_score":0.014684439},"labels":[],"label_agreement":null},{"id":"W4364302699","doi":"10.1109/tsp.2023.3265885","title":"Ultra-Low-Complexity Algorithms With Structurally Optimal Multi-Group Multicast Beamforming in Large-Scale Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Computer science; Initialization; Mathematical optimization; Multicast; Computational complexity theory; Mathematics","score_opus":0.020619281607015854,"score_gpt":0.25200542948635013,"score_spread":0.2313861478793343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4364302699","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011297956,0.00009707894,0.99779224,0.000066113884,0.000018286924,0.000015360865,0.0000057585235,0.000062916995,0.0008125197],"genre_scores_gemma":[0.21712177,0.00060603657,0.77797693,0.00026111037,0.00012202277,0.00033770798,0.000104960134,0.00008837686,0.0033810548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939764,0.00019506103,0.00003082413,0.00008626781,0.00023091461,0.000059293823],"domain_scores_gemma":[0.9990761,0.00050791656,0.00010667919,0.00009514793,0.0001826085,0.00003153557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011187391,0.0014218356,0.00089705124,0.00043464295,0.00055042194,0.0009221604,0.0010490633,0.0012482931,0.0029910496],"category_scores_gemma":[0.0030599367,0.000515803,0.0005816056,0.00053504336,0.00077249,0.001556244,0.0012010874,0.001685952,0.0009716835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007089354,0.000059421833,0.0002967933,0.00018011751,0.000043348664,0.00007393601,0.00012719126,0.8251874,0.007322351,0.06321563,0.0028233514,0.10059957],"study_design_scores_gemma":[0.00001153955,0.000031003692,0.00002853934,0.000007182823,0.00000344076,0.000016323549,0.000010063947,0.99017686,0.00064909755,0.008119232,0.00094153336,0.000005049209],"about_ca_topic_score_codex":0.0010400629,"about_ca_topic_score_gemma":0.0016915335,"teacher_disagreement_score":0.0029910496,"about_ca_system_score_codex":0.00065283675,"about_ca_system_score_gemma":0.0009909373,"threshold_uncertainty_score":0.01000607},"labels":[],"label_agreement":null},{"id":"W4379780949","doi":"10.1109/tsp.2023.3284364","title":"Joint Sampling and Reconstruction of Time-Varying Signals Over Directed Graphs","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Signal reconstruction; Algorithm; Vertex (graph theory); Frequency domain; Graph; Adjacency matrix; Mathematics; Compressed sensing; Computer science; Signal processing; Theoretical computer science; Digital signal processing; Computer vision","score_opus":0.034453782916287035,"score_gpt":0.27012244615681497,"score_spread":0.23566866324052793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379780949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019986311,0.000064123655,0.9792436,0.000037922215,0.000007890214,0.000012057651,0.000062831656,0.00009784704,0.00048746524],"genre_scores_gemma":[0.55252475,0.0005592069,0.44318348,0.000064109874,0.000041413765,0.00007690844,0.00058212323,0.00008125498,0.002886805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953413,0.0001590001,0.000019009098,0.000111920075,0.00012894002,0.00004701281],"domain_scores_gemma":[0.99858826,0.0008405471,0.00016315025,0.00019838492,0.00016252582,0.00004708753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056256325,0.00069833983,0.00042935478,0.0007401141,0.00021895277,0.000650842,0.00075896183,0.0006034289,0.0008040748],"category_scores_gemma":[0.0030285174,0.00031381205,0.00061422365,0.0010930346,0.0005608291,0.00086358644,0.00057086884,0.00071372633,0.00031938896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002370373,0.00005031739,0.0020745369,0.00019994854,0.00006441919,0.00040337825,0.00024119848,0.7565923,0.0323133,0.059382856,0.0010978765,0.14734289],"study_design_scores_gemma":[0.0000036702013,0.000013711461,0.00027293278,0.000004282818,0.000004876818,0.000043051255,0.000019231782,0.9873422,0.0035967326,0.008209908,0.0004822416,0.0000072582925],"about_ca_topic_score_codex":0.0032862348,"about_ca_topic_score_gemma":0.0038985335,"teacher_disagreement_score":0.0032862348,"about_ca_system_score_codex":0.00040289198,"about_ca_system_score_gemma":0.00044258262,"threshold_uncertainty_score":0.006534219},"labels":[],"label_agreement":null},{"id":"W4379780985","doi":"10.1109/tsp.2023.3284376","title":"Device Scheduling in Over-the-Air Federated Learning Via Matching Pursuit","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"C3.ai Digital Transformation Institute; National Science Foundation","keywords":"Notation; Benchmark (surveying); Algorithm; Mathematics; Computer science; Matching (statistics); Discrete mathematics; Artificial intelligence; Combinatorics; Arithmetic; Statistics","score_opus":0.03469655345730558,"score_gpt":0.29166740443259154,"score_spread":0.25697085097528594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379780985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017722249,0.00032734967,0.9777254,0.0001983508,0.00008937642,0.00006326493,0.000069427035,0.0007946746,0.0030099303],"genre_scores_gemma":[0.77970576,0.00031374136,0.21173061,0.00026851363,0.000096278774,0.00020526878,0.00024306931,0.00010477606,0.0073319282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883,0.00028797385,0.00005517588,0.00029527536,0.00024757753,0.0002840865],"domain_scores_gemma":[0.9989697,0.00040493644,0.00013543126,0.0001962567,0.00019422718,0.000099527606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014733683,0.001111504,0.0018054518,0.00051310036,0.00064074,0.0014945249,0.002040909,0.0014684869,0.0039544194],"category_scores_gemma":[0.0030897346,0.000373563,0.00057755865,0.0009637723,0.0009908661,0.0019075866,0.0021218199,0.0016021935,0.0010514365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005555281,0.00019650912,0.000606285,0.00014609781,0.000057702597,0.0001218955,0.00008661129,0.7931227,0.003752292,0.020621795,0.00460558,0.17612706],"study_design_scores_gemma":[0.000019312778,0.000058076945,0.000066358974,0.0000055453434,0.000005121888,0.000021983855,0.000016106143,0.9929397,0.0007670014,0.005331392,0.00076414377,0.0000052349865],"about_ca_topic_score_codex":0.0035002886,"about_ca_topic_score_gemma":0.0032107136,"teacher_disagreement_score":0.0039544194,"about_ca_system_score_codex":0.0009680008,"about_ca_system_score_gemma":0.0021625296,"threshold_uncertainty_score":0.013228834},"labels":[],"label_agreement":null},{"id":"W4381785374","doi":"10.1109/tsp.2023.3287671","title":"Group Testing With Side Information via Generalized Approximate Message Passing","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"SARS-CoV-2 detection and testing","field":"Medicine","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Notation; Group testing; Group (periodic table); Algorithm; Computer science; Mathematics; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.041230632927801214,"score_gpt":0.2766262780154355,"score_spread":0.23539564508763428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381785374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009053127,0.00017598504,0.9831254,0.0006485026,0.000121554425,0.00029974803,0.0001849149,0.0034362974,0.0029544823],"genre_scores_gemma":[0.40961307,0.00027051906,0.5758388,0.0010826781,0.00042779336,0.0016033954,0.0010172207,0.0009320949,0.009214513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97689146,0.012378476,0.0014383054,0.002950239,0.0041924976,0.0021490112],"domain_scores_gemma":[0.92487574,0.047705527,0.0039260117,0.016462473,0.0052829864,0.0017472088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021938093,0.0029183617,0.003932911,0.0024789823,0.002069947,0.0045198207,0.005761907,0.003792111,0.014685627],"category_scores_gemma":[0.073075525,0.0012243808,0.0023924753,0.0023607968,0.003800699,0.0088121835,0.007333587,0.0046504107,0.005466477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040897597,0.00066666363,0.005014076,0.0007444175,0.00043933344,0.00080553343,0.0012316288,0.3490692,0.0071241832,0.2126401,0.02044255,0.3977325],"study_design_scores_gemma":[0.0002786753,0.00029528307,0.00020146156,0.000052355692,0.0000829777,0.00010550915,0.000092249466,0.77866024,0.0046094637,0.21121877,0.0043523028,0.0000507055],"about_ca_topic_score_codex":0.0034797383,"about_ca_topic_score_gemma":0.0040576644,"teacher_disagreement_score":0.021938093,"about_ca_system_score_codex":0.0030105882,"about_ca_system_score_gemma":0.0061977077,"threshold_uncertainty_score":0.11602116},"labels":[],"label_agreement":null},{"id":"W4385154389","doi":"10.1109/tsp.2023.3297049","title":"Uplink to Downlink Channel Covariance Transformation in FDD Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Carleton University","funders":"","keywords":"Telecommunications link; Covariance; Computer science; Base station; Antenna array; Channel (broadcasting); Algorithm; Antenna (radio); Mathematics; Topology (electrical circuits); Transformation (genetics); Electronic engineering; Control theory (sociology); Telecommunications; Engineering; Statistics","score_opus":0.020136737431962592,"score_gpt":0.2483845864964905,"score_spread":0.2282478490645279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385154389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043874133,0.00023219499,0.9517894,0.00010879242,0.000041553358,0.000019787778,0.00007144892,0.00015099534,0.0037117838],"genre_scores_gemma":[0.93032616,0.00032496752,0.067282334,0.0000584128,0.00003226516,0.000036529327,0.00006985997,0.000022728454,0.0018467332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965525,0.000107530395,0.000012815831,0.000054009797,0.00012723907,0.000043014843],"domain_scores_gemma":[0.9994505,0.00028992182,0.000072391274,0.00009800799,0.00007473739,0.000014365858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046414003,0.00029089404,0.00026973517,0.00015966769,0.00023679865,0.00056694355,0.0002282987,0.00028529426,0.0009272135],"category_scores_gemma":[0.0020612492,0.00017378292,0.00017396362,0.00041401017,0.00050582766,0.000488524,0.0005789538,0.00044935785,0.00025316194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007067072,0.000025417621,0.00086777756,0.000055617926,0.000012964062,0.00012083622,0.00006197218,0.8784763,0.00949272,0.042583026,0.0007274462,0.06750522],"study_design_scores_gemma":[0.0000042898196,0.00001613923,0.00021418917,0.0000038163867,0.0000027994151,0.000041200947,0.0000095937285,0.9929397,0.0023382308,0.0038976478,0.0005265592,0.000005821144],"about_ca_topic_score_codex":0.0014501653,"about_ca_topic_score_gemma":0.0008860138,"teacher_disagreement_score":0.0014501653,"about_ca_system_score_codex":0.00049990637,"about_ca_system_score_gemma":0.0005444968,"threshold_uncertainty_score":0.0036270618},"labels":[],"label_agreement":null},{"id":"W4387805796","doi":"10.1109/tsp.2023.3324727","title":"High-Accuracy Positioning Services for High-Speed Vehicles in Wideband mmWave Communications","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University; University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Wideband; Bandwidth (computing); Wireless; Extremely high frequency; Cramér–Rao bound; Computational complexity theory; Channel state information; Electronic engineering; Channel (broadcasting); Link budget; Communications system; Telecommunications; Real-time computing; Algorithm; Engineering; Estimation theory","score_opus":0.019898374039279857,"score_gpt":0.2572199657679454,"score_spread":0.23732159172866557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387805796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06964171,0.0018798294,0.91236705,0.0014565969,0.0002597426,0.000036060846,0.00015060301,0.00052868266,0.013679678],"genre_scores_gemma":[0.85284865,0.0020445674,0.14077833,0.00021610377,0.00010389549,0.000079349855,0.00025311924,0.000055206,0.003620816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945706,0.00015302724,0.000014706996,0.00004781245,0.0002313507,0.000096064774],"domain_scores_gemma":[0.9994585,0.00025463908,0.00006835039,0.000077448996,0.000112865084,0.000028246883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076560554,0.0003871527,0.00045949707,0.00027616502,0.00045875192,0.0008041361,0.00043220402,0.00090506184,0.0016617412],"category_scores_gemma":[0.0024945033,0.0001988829,0.0003396586,0.00072766264,0.000454492,0.0010380722,0.0008426147,0.00088112074,0.0004757121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049202783,0.00002236105,0.0012312803,0.000108137836,0.000020161415,0.00012423132,0.000078378165,0.9250774,0.0068715033,0.03433255,0.0023022469,0.029782595],"study_design_scores_gemma":[0.0000075822086,0.000038441387,0.00044826363,0.0000123468035,0.0000047717936,0.000041148323,0.000051331175,0.9879353,0.0013450269,0.0072083073,0.0028977538,0.000009660915],"about_ca_topic_score_codex":0.00499394,"about_ca_topic_score_gemma":0.0061881435,"teacher_disagreement_score":0.00499394,"about_ca_system_score_codex":0.0005965542,"about_ca_system_score_gemma":0.0007726475,"threshold_uncertainty_score":0.009929776},"labels":[],"label_agreement":null},{"id":"W4390829580","doi":"10.1109/tsp.2024.3351478","title":"Low-Complexity Joint Antenna Selection and Robust Multi-Group Multicast Beamforming for Massive MIMO","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Multicast; Computer science; MIMO; Mathematical optimization; Computational complexity theory; Optimization problem; Antenna array; Antenna (radio); Algorithm; Mathematics; Telecommunications; Computer network","score_opus":0.039838167525921855,"score_gpt":0.2601111596410754,"score_spread":0.22027299211515355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390829580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003427859,0.000094217416,0.99511164,0.00007890876,0.000017366949,0.000014196011,0.0000144016185,0.000062458166,0.0011789803],"genre_scores_gemma":[0.5624529,0.0005668255,0.43249193,0.000197204,0.00011474922,0.00028680262,0.00013824936,0.00006931642,0.0036821957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950135,0.00018414293,0.000015783155,0.00006794653,0.00017557055,0.000055161698],"domain_scores_gemma":[0.99968696,0.00015387945,0.000046635312,0.000033174572,0.00006144822,0.000017892227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070042606,0.0010089283,0.0007032868,0.00022534457,0.0002526594,0.00070281007,0.0006510374,0.00080149336,0.0019309481],"category_scores_gemma":[0.0013490379,0.00035422252,0.0006446922,0.00042260595,0.0005206964,0.0006826945,0.00075910863,0.0008098188,0.00059967645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068297464,0.000041516978,0.00034071138,0.0001402452,0.000034786593,0.00013652805,0.00006112333,0.912279,0.01350169,0.024849055,0.0013727813,0.04717418],"study_design_scores_gemma":[0.00000541963,0.000044267046,0.000039355597,0.000004679134,0.0000037081986,0.00001994283,0.0000057809025,0.995141,0.0012051791,0.0030133144,0.0005128852,0.0000044129697],"about_ca_topic_score_codex":0.00069607777,"about_ca_topic_score_gemma":0.00082902855,"teacher_disagreement_score":0.0019309481,"about_ca_system_score_codex":0.0004129278,"about_ca_system_score_gemma":0.00061077595,"threshold_uncertainty_score":0.0064596534},"labels":[],"label_agreement":null},{"id":"W4392405395","doi":"10.1109/tsp.2024.3372252","title":"Percentile Optimization in Wireless Networks—Part II: Beamforming for Cell-Edge Throughput Maximization","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); University of Toronto","funders":"Telefonaktiebolaget LM Ericsson","keywords":"Beamforming; Mathematical optimization; Optimization problem; Mathematics; Maximization; Computer science; Statistics","score_opus":0.01627287667257278,"score_gpt":0.2407168319403647,"score_spread":0.22444395526779193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392405395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029422396,0.0008570526,0.9910676,0.00044572033,0.000117893695,0.00002321438,0.00006392853,0.00007904538,0.004403423],"genre_scores_gemma":[0.45456597,0.011867088,0.5051977,0.0011141048,0.0025828895,0.00052586274,0.0005360297,0.00039993416,0.02321032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990318,0.0003860139,0.00004595797,0.00014421549,0.00027675185,0.000115212635],"domain_scores_gemma":[0.9987935,0.0007994557,0.000103027334,0.00010177713,0.00015653516,0.000045645087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014654219,0.001246467,0.0011113378,0.00055093865,0.00056134444,0.0023693263,0.00081262673,0.0014491321,0.0029735535],"category_scores_gemma":[0.0037880929,0.00045770928,0.0007095663,0.001810798,0.001148483,0.0027222123,0.0014360626,0.0022748043,0.00085873407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009098745,0.00007422617,0.00052476936,0.00017129547,0.00004423236,0.0000720944,0.00006989468,0.5900966,0.004764136,0.2764057,0.011108634,0.116577335],"study_design_scores_gemma":[0.000006883192,0.00007697882,0.0002988111,0.000034202694,0.000011100452,0.00006584925,0.000032837153,0.8849485,0.0027383666,0.10195818,0.009804177,0.000024132996],"about_ca_topic_score_codex":0.0010782635,"about_ca_topic_score_gemma":0.0008709241,"teacher_disagreement_score":0.0029735535,"about_ca_system_score_codex":0.0013701048,"about_ca_system_score_gemma":0.0010945814,"threshold_uncertainty_score":0.009947538},"labels":[],"label_agreement":null},{"id":"W4392931697","doi":"10.1109/tsp.2024.3378001","title":"Learnable Filters for Geometric Scattering Modules","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données; Chan Zuckerberg Initiative; National Institute of General Medical Sciences; Canadian Institute for Advanced Research; National Institutes of Health; National Science Foundation; Yale University; Fonds de recherche du Québec – Nature et technologies; Alfred P. Sloan Foundation","keywords":"Wavelet; Graph; Computer science; Artificial intelligence; Pattern recognition (psychology); Range (aeronautics); Graph theory; Geometric data analysis; Algorithm; Theoretical computer science; Mathematics","score_opus":0.026235985369268754,"score_gpt":0.2713497393765992,"score_spread":0.24511375400733043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392931697","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025445575,0.00014201642,0.97189504,0.00014426028,0.00004145569,0.000025039288,0.00010340263,0.0006937634,0.0015094366],"genre_scores_gemma":[0.6225047,0.00038947022,0.36980137,0.00035619392,0.00010588483,0.00014280507,0.0009969415,0.00023606383,0.0054665357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99973303,0.0000472112,0.000011488734,0.00010221309,0.00007135964,0.000034759174],"domain_scores_gemma":[0.9995733,0.00014342878,0.000076621654,0.00007921856,0.000090687514,0.000036714944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052918534,0.00093861803,0.0005366944,0.0007123751,0.00024327553,0.0005803638,0.0012987544,0.0010253647,0.0020248091],"category_scores_gemma":[0.00201077,0.00037288113,0.00075594033,0.00062582607,0.00074661145,0.0015259323,0.0010462492,0.0013617806,0.00076472474],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114967734,0.00012439895,0.0018266594,0.00012069377,0.00009071897,0.000085815336,0.00006446117,0.690687,0.024862783,0.034317024,0.0033534155,0.24435201],"study_design_scores_gemma":[0.0000037586724,0.000022163282,0.00013226988,0.000004208012,0.000006157098,0.000016380905,0.0000047556,0.9903016,0.0020888366,0.006857623,0.00055804313,0.000004154991],"about_ca_topic_score_codex":0.0019060828,"about_ca_topic_score_gemma":0.0034139191,"teacher_disagreement_score":0.0020248091,"about_ca_system_score_codex":0.000696676,"about_ca_system_score_gemma":0.00054199767,"threshold_uncertainty_score":0.0067736506},"labels":[],"label_agreement":null},{"id":"W4392940093","doi":"10.1109/tsp.2024.3378376","title":"High Accuracy AUV-Aided Underwater Localization: Far-Field Information Fusion Perspective","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Innovation for Defence Excellence and Security","keywords":"Perspective (graphical); Computer science; Underwater; Information fusion; Sensor fusion; Artificial intelligence; Geology","score_opus":0.015085412502262847,"score_gpt":0.24431181112777842,"score_spread":0.22922639862551558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392940093","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010954912,0.0035580096,0.9778871,0.0008077788,0.00015588604,0.000019233086,0.000049963728,0.00027630443,0.006290831],"genre_scores_gemma":[0.8182503,0.006270398,0.16947927,0.0004233185,0.00043728223,0.00007694309,0.00030079056,0.000047917012,0.0047138827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999485,0.00010510534,0.000023831804,0.00010472973,0.00023361285,0.000047618243],"domain_scores_gemma":[0.99968994,0.00008082812,0.00003933797,0.00005093611,0.00012351549,0.00001557145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006541225,0.0007120886,0.00076051295,0.00063967594,0.00033578617,0.0010685007,0.0010128808,0.0012799297,0.000919873],"category_scores_gemma":[0.0011550736,0.00027381486,0.00040566176,0.00083074847,0.00068299286,0.002002829,0.0017853506,0.0009796288,0.00047439686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018592582,0.00008110276,0.0017299538,0.00040831135,0.00010750643,0.00029952155,0.00035580975,0.51562387,0.04049218,0.094531365,0.0043782876,0.3418061],"study_design_scores_gemma":[0.000009186276,0.00008615281,0.0005063761,0.00003277935,0.000021014745,0.00010127735,0.000079415004,0.9619102,0.0062908954,0.024859848,0.006070221,0.00003260584],"about_ca_topic_score_codex":0.0029733838,"about_ca_topic_score_gemma":0.0011301086,"teacher_disagreement_score":0.0029733838,"about_ca_system_score_codex":0.00047760023,"about_ca_system_score_gemma":0.00056426687,"threshold_uncertainty_score":0.005912125},"labels":[],"label_agreement":null},{"id":"W4393394735","doi":"10.1109/tsp.2024.3383284","title":"Spatial Registration of Heterogeneous Sensors on Mobile Platforms","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"National Natural Science Foundation of China","keywords":"Computer science; Artificial intelligence; Computer vision","score_opus":0.020629043937227504,"score_gpt":0.2605317007188656,"score_spread":0.2399026567816381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393394735","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10630246,0.00023180633,0.89076024,0.00012301764,0.00008241987,0.00003891517,0.00006999008,0.0003970017,0.0019941407],"genre_scores_gemma":[0.8866706,0.00016987571,0.11129363,0.00005882725,0.00004424117,0.00006947447,0.00015504638,0.00003696576,0.0015012404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906045,0.00023029094,0.000046772522,0.00027966744,0.00029591582,0.00008686188],"domain_scores_gemma":[0.9992842,0.00013430188,0.0001678767,0.00024276685,0.00014599299,0.000024830915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076167233,0.000569978,0.0005519957,0.0005719188,0.00038200137,0.0006490252,0.0007849771,0.00058382045,0.00051926327],"category_scores_gemma":[0.0031084511,0.0002925065,0.0005439148,0.0010122248,0.0005204302,0.0013071166,0.0019023826,0.0005438518,0.0003768868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004366641,0.00005807813,0.0095502725,0.00013885436,0.00011200502,0.0006499194,0.0003588316,0.61801404,0.07131368,0.023397293,0.0013881465,0.27458227],"study_design_scores_gemma":[0.000022982991,0.00020168953,0.003888207,0.000017173867,0.00003480749,0.00018848863,0.00017689215,0.95151556,0.030286528,0.008656693,0.0049751825,0.000035699188],"about_ca_topic_score_codex":0.0017048288,"about_ca_topic_score_gemma":0.0014192746,"teacher_disagreement_score":0.0017048288,"about_ca_system_score_codex":0.00038342204,"about_ca_system_score_gemma":0.00049440004,"threshold_uncertainty_score":0.0040281415},"labels":[],"label_agreement":null},{"id":"W4399526258","doi":"10.1109/tsp.2024.3411672","title":"Direct Target Localization With Low-Bit Quantization in Wireless Sensor Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; National Natural Science Foundation of China; Queen's University Belfast; European Commission","keywords":"Quantization (signal processing); Computer science; Wireless sensor network; Wireless; Wireless network; Algorithm; Computer network; Telecommunications","score_opus":0.007010781817074752,"score_gpt":0.21108874704900726,"score_spread":0.2040779652319325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399526258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064065396,0.00066021085,0.99197584,0.00009274516,0.00002858563,0.000015407884,0.000009621432,0.00011750213,0.00069363264],"genre_scores_gemma":[0.6564418,0.0020475378,0.33918443,0.0001684433,0.00007366136,0.0001291513,0.00007494083,0.00005148987,0.0018286465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992392,0.0002234716,0.00004073249,0.00012706353,0.0003352312,0.000034331486],"domain_scores_gemma":[0.99945503,0.0003106446,0.000073689,0.00005508271,0.00009383316,0.000011679302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072707736,0.00056134735,0.00046722847,0.0002638006,0.00026701856,0.0006298033,0.0006281928,0.00056315016,0.0006238433],"category_scores_gemma":[0.0025383558,0.00028067728,0.00020633884,0.0006471614,0.00079648476,0.0013751928,0.00082630134,0.00073717034,0.0001865284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116736715,0.00004292571,0.000616901,0.00029933543,0.000023916173,0.00009375659,0.000166049,0.7552892,0.02431421,0.034706276,0.0012518715,0.18307887],"study_design_scores_gemma":[0.000010515618,0.0000498223,0.00011698425,0.000014919618,0.000005000315,0.00003481502,0.000014774584,0.9874277,0.00441491,0.006861348,0.0010390417,0.000010123944],"about_ca_topic_score_codex":0.0017661158,"about_ca_topic_score_gemma":0.0014042103,"teacher_disagreement_score":0.0017661158,"about_ca_system_score_codex":0.00043909976,"about_ca_system_score_gemma":0.0005699234,"threshold_uncertainty_score":0.0038451552},"labels":[],"label_agreement":null},{"id":"W4399526409","doi":"10.1109/tsp.2024.3412071","title":"Active Sensing for Reciprocal MIMO Channels","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Computer science; Reciprocal; Telecommunications; Channel (broadcasting)","score_opus":0.019427193547916468,"score_gpt":0.2602003531930883,"score_spread":0.24077315964517185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399526409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057599572,0.00050656794,0.98739296,0.00014107928,0.000072215706,0.00003210355,0.00003176505,0.00013848732,0.005924769],"genre_scores_gemma":[0.62868273,0.0021506809,0.35873556,0.0005450062,0.00033621668,0.00020942162,0.00016294258,0.000060469156,0.0091170585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992341,0.00022888293,0.000025604171,0.00017471696,0.00025720702,0.0000795658],"domain_scores_gemma":[0.9992867,0.00042535766,0.00006890118,0.000091343834,0.000095120165,0.000032751017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007626339,0.0010306024,0.0006061999,0.00043460896,0.00038696392,0.0012453016,0.00096340507,0.0010337944,0.0020243726],"category_scores_gemma":[0.0017672847,0.0004161427,0.00067215296,0.0003882491,0.001236694,0.0011096594,0.0012525598,0.0010538598,0.0008489685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000382259,0.0001997584,0.00067663746,0.0006416871,0.00014288347,0.00031940118,0.0004551115,0.31970012,0.07405054,0.3294765,0.0045342413,0.26942092],"study_design_scores_gemma":[0.00003281382,0.0001598729,0.00016994087,0.000045572593,0.000038652255,0.00020863452,0.000054464454,0.9488749,0.01000091,0.03400785,0.0063656126,0.000040821957],"about_ca_topic_score_codex":0.0006390172,"about_ca_topic_score_gemma":0.0010878283,"teacher_disagreement_score":0.0020243726,"about_ca_system_score_codex":0.0004748769,"about_ca_system_score_gemma":0.0006860622,"threshold_uncertainty_score":0.00677222},"labels":[],"label_agreement":null},{"id":"W4401210573","doi":"10.1109/tsp.2024.3436610","title":"A Generalized Nyquist-Shannon Sampling Theorem Using the Koopman Operator","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Nyquist–Shannon sampling theorem; Mathematics; Nonuniform sampling; Applied mathematics; Sampling (signal processing); Nyquist stability criterion; Signal processing; Discrete mathematics; Computer science; Algorithm; Mathematical analysis; Statistics; Telecommunications","score_opus":0.06389955184524342,"score_gpt":0.3381376768621358,"score_spread":0.2742381250168924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401210573","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029712433,0.0004408141,0.9938047,0.00013401647,0.00008176715,0.000014466079,0.000038473197,0.00007362999,0.0024408253],"genre_scores_gemma":[0.30724537,0.0034122018,0.68036944,0.00053740526,0.00063923164,0.0001709056,0.00025155282,0.00028772803,0.0070861536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990796,0.0002555132,0.000045756107,0.00015916368,0.00039794165,0.00006202253],"domain_scores_gemma":[0.99853444,0.0008138394,0.00011807649,0.00019746821,0.00027164206,0.000064564476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021164373,0.0007328092,0.00065399345,0.001019041,0.0004768851,0.0012831202,0.0010629902,0.0011251867,0.0020821325],"category_scores_gemma":[0.0060346685,0.00029534602,0.0007193728,0.00095339323,0.0019124137,0.0025944172,0.0012648454,0.0019795038,0.00063576235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011706116,0.00002466145,0.00048428273,0.00023141665,0.000027920443,0.00020917603,0.00017013887,0.060665626,0.016384311,0.84559834,0.002545769,0.073541276],"study_design_scores_gemma":[0.000020013793,0.00008289564,0.00032634035,0.00006348874,0.000016916587,0.0004492802,0.00004666986,0.69906265,0.009512923,0.27757046,0.012787426,0.00006088871],"about_ca_topic_score_codex":0.0010993137,"about_ca_topic_score_gemma":0.00076444424,"teacher_disagreement_score":0.0021164373,"about_ca_system_score_codex":0.0007416281,"about_ca_system_score_gemma":0.0010574608,"threshold_uncertainty_score":0.011192918},"labels":[],"label_agreement":null},{"id":"W4401536852","doi":"10.1109/tsp.2024.3442712","title":"An Adversarially Robust Formulation of Linear Regression With Missing Data","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linear regression; Mathematics; Regression; Regression analysis; Statistics; Econometrics; Computer science; Applied mathematics","score_opus":0.19677400394363356,"score_gpt":0.4363676094495132,"score_spread":0.23959360550587963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401536852","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088120654,0.000072726376,0.9983223,0.00012488385,0.000018201961,0.000010473262,0.000057305744,0.00008488663,0.0004278518],"genre_scores_gemma":[0.3087526,0.00087357464,0.67752033,0.00054820057,0.00040275208,0.00042906313,0.0009252442,0.00044401956,0.010104235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869555,0.00050777564,0.00005118369,0.00030189467,0.00034192973,0.00010162933],"domain_scores_gemma":[0.997846,0.0013518633,0.00026960805,0.00023023266,0.00023053038,0.00007168512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028555684,0.001514224,0.0011366361,0.000632961,0.00030848567,0.0012266121,0.002168833,0.0017501927,0.0034694823],"category_scores_gemma":[0.0062787053,0.00077049213,0.0010992247,0.0009324561,0.0013144999,0.0014514157,0.0017209641,0.0027727557,0.00089087925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030789775,0.000016873493,0.0001732907,0.000059420705,0.00003843011,0.00008550406,0.00003107328,0.9465613,0.0014040149,0.035187583,0.0014507197,0.014960985],"study_design_scores_gemma":[0.0000029214368,0.000010784363,0.000027220804,0.0000056985305,0.0000034920135,0.00001700067,0.0000021759047,0.9919152,0.00029285115,0.0072490443,0.0004687046,0.0000048910492],"about_ca_topic_score_codex":0.0025857599,"about_ca_topic_score_gemma":0.0021652097,"teacher_disagreement_score":0.0034694823,"about_ca_system_score_codex":0.0007284751,"about_ca_system_score_gemma":0.0014577445,"threshold_uncertainty_score":0.01510185},"labels":[],"label_agreement":null},{"id":"W4401607358","doi":"10.1109/tsp.2024.3444194","title":"Multiple-Time-Slot Multiple Access Binary Computation Offloading in the $K$-User Case","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computation; Binary number; Computation offloading; Theoretical computer science; Algorithm; Mathematics; Edge computing; Operating system; Arithmetic; Cloud computing","score_opus":0.03916857953528712,"score_gpt":0.3027072774625493,"score_spread":0.26353869792726214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401607358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10595859,0.00087180024,0.8475217,0.0023069894,0.0003133228,0.00014002228,0.0004854486,0.00037764254,0.0420245],"genre_scores_gemma":[0.96436876,0.0003504508,0.027108464,0.00017581151,0.000110241526,0.000089601795,0.00008571139,0.000043153832,0.0076677147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984847,0.00042708134,0.000054619322,0.00022347135,0.00030508052,0.000505145],"domain_scores_gemma":[0.99747014,0.0015357278,0.0002240646,0.00031473517,0.00028467216,0.000170727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094898784,0.0009239664,0.0016385565,0.00042629096,0.0011706371,0.0019389588,0.0012538687,0.0016622047,0.0051846537],"category_scores_gemma":[0.0055779335,0.00045191593,0.0006022605,0.0013810779,0.0016375162,0.0020943347,0.0015994582,0.0011759481,0.0009718918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081760436,0.00015398179,0.0027935025,0.00024365583,0.00009117257,0.005430598,0.00026496028,0.74663615,0.004509362,0.19302979,0.008647664,0.037381466],"study_design_scores_gemma":[0.00002640021,0.000025688942,0.00029225225,0.000009900427,0.00000911491,0.00044839285,0.00007082379,0.9732267,0.000550921,0.02445537,0.0008663799,0.00001807746],"about_ca_topic_score_codex":0.0061158617,"about_ca_topic_score_gemma":0.0064770323,"teacher_disagreement_score":0.0061158617,"about_ca_system_score_codex":0.0010599928,"about_ca_system_score_gemma":0.0010335152,"threshold_uncertainty_score":0.017344356},"labels":[],"label_agreement":null},{"id":"W4401747735","doi":"10.1109/tsp.2024.3446453","title":"Spectral Graph Learning With Core Eigenvectors Prior via Iterative GLASSO and Projection","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eigenvalues and eigenvectors; Computer science; Graph; Spectral graph theory; Projection (relational algebra); Core (optical fiber); Iterative method; Artificial intelligence; Mathematics; Algorithm; Theoretical computer science; Voltage graph; Telecommunications; Physics; Line graph","score_opus":0.015915706547275296,"score_gpt":0.2551145788556691,"score_spread":0.23919887230839382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401747735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029105542,0.000118645774,0.99504614,0.00016198793,0.000025353316,0.000031799515,0.00007411717,0.0007853162,0.0008461828],"genre_scores_gemma":[0.14611277,0.00048318665,0.843619,0.00039562024,0.00013119465,0.00027903653,0.0013666841,0.0007389943,0.0068735313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990144,0.00028490575,0.00003777602,0.00029006932,0.00025611962,0.000116767515],"domain_scores_gemma":[0.9983767,0.0007385134,0.00011375805,0.00037286297,0.00027912925,0.00011897833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014045361,0.0017971001,0.001666737,0.0017215867,0.0007455535,0.0013153896,0.0020733115,0.0018520241,0.004823309],"category_scores_gemma":[0.005699183,0.0009615083,0.0014123564,0.0020112244,0.0019379125,0.002355475,0.0025005843,0.0028862003,0.0029407972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002497393,0.00016373742,0.00090227,0.00027230207,0.00013607398,0.0001374121,0.00021860855,0.49594206,0.0071992753,0.067380615,0.015671924,0.41172603],"study_design_scores_gemma":[0.000012994706,0.000019849853,0.00011003895,0.00001258299,0.000009035701,0.00003106554,0.000017898214,0.96829224,0.0013994923,0.02855196,0.0015296926,0.000013135738],"about_ca_topic_score_codex":0.010686748,"about_ca_topic_score_gemma":0.018319927,"teacher_disagreement_score":0.010686748,"about_ca_system_score_codex":0.0012334712,"about_ca_system_score_gemma":0.0034140118,"threshold_uncertainty_score":0.021249115},"labels":[],"label_agreement":null},{"id":"W4401990371","doi":"10.1109/tsp.2024.3435065","title":"Estimating Resonances in Low-SNR Late-Time Radar Returns With Sampling Jitter","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Jitter; Computer science; Radar; Sampling (signal processing); Algorithm; Telecommunications","score_opus":0.01784106737638014,"score_gpt":0.25738858597546993,"score_spread":0.2395475185990898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401990371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088115804,0.000077015546,0.91114545,0.00004389285,0.000009221365,0.000010301529,0.000027258968,0.0002489248,0.00032213752],"genre_scores_gemma":[0.8684736,0.0002132167,0.13000444,0.00004828788,0.000025557847,0.000021554277,0.00012820843,0.00009924106,0.0009857762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995166,0.00011804055,0.00002167609,0.00012382677,0.00016562255,0.000054216354],"domain_scores_gemma":[0.9979931,0.001266167,0.0003021024,0.00020285542,0.00018875216,0.000046962985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013746604,0.00063872134,0.00062107603,0.00056044845,0.00021183747,0.0006711042,0.00073257595,0.00079659635,0.00031657392],"category_scores_gemma":[0.006221684,0.00043641508,0.00035925768,0.00046178894,0.0006201976,0.0016160574,0.00078320364,0.0008742115,0.00024955114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003942374,0.00014343104,0.009286065,0.0001457609,0.000073164614,0.00034705084,0.0002906202,0.7761323,0.092955045,0.013188503,0.0005080542,0.10653583],"study_design_scores_gemma":[0.000004790035,0.000028732757,0.0014704677,0.000005609767,0.000008164888,0.00011073963,0.000021860229,0.98619556,0.009371259,0.0025970612,0.00017021476,0.000015554491],"about_ca_topic_score_codex":0.0015568414,"about_ca_topic_score_gemma":0.0020142088,"teacher_disagreement_score":0.0015568414,"about_ca_system_score_codex":0.00045280528,"about_ca_system_score_gemma":0.0004793429,"threshold_uncertainty_score":0.0072699785},"labels":[],"label_agreement":null},{"id":"W4402215578","doi":"10.1109/tsp.2024.3454115","title":"Revisiting High-Order Tensor Singular Value Decomposition From Basic Element Perspective","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Elasticity and Material Modeling","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Sichuan Province; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Singular value decomposition; Mathematics; Perspective (graphical); Order (exchange); Tensor (intrinsic definition); Element (criminal law); Singular value; Decomposition; Singular spectrum analysis; Value (mathematics); Applied mathematics; Mathematical optimization; Computer science; Algorithm; Pure mathematics; Geometry; Physics; Statistics; Eigenvalues and eigenvectors","score_opus":0.010991854917983844,"score_gpt":0.24776436434172464,"score_spread":0.23677250942374078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402215578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004737107,0.00060602266,0.991572,0.00025510215,0.00023933976,0.00002049292,0.00016678362,0.00030611962,0.0020969978],"genre_scores_gemma":[0.11008873,0.0037978636,0.8752261,0.0004043597,0.00086908136,0.00010675758,0.0013363336,0.0008068893,0.0073638884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980363,0.00046499714,0.00016924563,0.00041818927,0.00078406447,0.00012709672],"domain_scores_gemma":[0.99628276,0.0008319193,0.0002890903,0.0007848306,0.0015763104,0.0002351339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025873836,0.0019740334,0.0010527029,0.0021791635,0.00064234046,0.003076889,0.0017595642,0.0012238567,0.0041313777],"category_scores_gemma":[0.0067889546,0.00066306355,0.0013981096,0.002567614,0.0024439169,0.0056699486,0.0020336078,0.0030863392,0.0031813974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024814266,0.00012024236,0.0025996575,0.000968703,0.00017793903,0.0008596064,0.00084453716,0.09609411,0.042639177,0.5583057,0.015912695,0.2812294],"study_design_scores_gemma":[0.000014832339,0.0001281491,0.0010219914,0.000105453284,0.000061407845,0.0004256387,0.0001706514,0.6296809,0.014247703,0.31033468,0.0437068,0.00010180375],"about_ca_topic_score_codex":0.0024194599,"about_ca_topic_score_gemma":0.0022277716,"teacher_disagreement_score":0.0041313777,"about_ca_system_score_codex":0.0007075482,"about_ca_system_score_gemma":0.0015864733,"threshold_uncertainty_score":0.013820827},"labels":[],"label_agreement":null},{"id":"W4402473899","doi":"10.1109/tsp.2024.3459422","title":"DoA Estimation for Hybrid Receivers: Full Spatial Coverage and Successive Refinement","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Integrated Circuits and Semiconductor Failure Analysis","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Carleton University; Ciena (Canada)","funders":"Mitacs","keywords":"Computer science; Algorithm; Signal processing; Estimation; Speech recognition; Mathematics; Telecommunications; Radar; Engineering","score_opus":0.011668130953759091,"score_gpt":0.23383780816096775,"score_spread":0.22216967720720865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402473899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004127053,0.00008705068,0.995336,0.000021144722,0.0000061289256,0.000008109625,0.0000081707585,0.00006611379,0.0003403076],"genre_scores_gemma":[0.22710128,0.0002871324,0.7711081,0.00006131285,0.00004268656,0.00008168029,0.00008031448,0.000038490718,0.0011989612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995498,0.000115415925,0.000025841071,0.000066190376,0.00021046854,0.000032261963],"domain_scores_gemma":[0.9983151,0.0010799981,0.00017624187,0.00019314229,0.0001980628,0.000037453094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010124544,0.0007379776,0.00069249485,0.0006197852,0.00022015291,0.00066509604,0.0010320314,0.0007149071,0.0007672858],"category_scores_gemma":[0.0044007646,0.00042911293,0.0007092502,0.00067617174,0.0007091117,0.0010865487,0.0012800107,0.00071417645,0.0003050655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018642085,0.000042031643,0.0016286935,0.00014105413,0.00009753023,0.000094240866,0.00023995558,0.73889935,0.017557377,0.021334818,0.0004969234,0.21928164],"study_design_scores_gemma":[0.000011769831,0.00003606446,0.00017924588,0.0000073072038,0.000009377644,0.000042293254,0.000009007631,0.9936847,0.0023189296,0.0031390258,0.00055335887,0.000008964867],"about_ca_topic_score_codex":0.0022535105,"about_ca_topic_score_gemma":0.0027417082,"teacher_disagreement_score":0.0022535105,"about_ca_system_score_codex":0.00039518657,"about_ca_system_score_gemma":0.000628209,"threshold_uncertainty_score":0.005354464},"labels":[],"label_agreement":null},{"id":"W4403674456","doi":"10.1109/tsp.2024.3484908","title":"Towards Inversion-Free Sparse Bayesian Learning: A Universal Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Queen's University; Memorial University of Newfoundland","funders":"Simon Fraser University; Natural Sciences and Engineering Research Council of Canada; Innovation for Defence Excellence and Security","keywords":"Bayesian probability; Computer science; Inversion (geology); Artificial intelligence; Pattern recognition (psychology); Algorithm; Machine learning; Geology","score_opus":0.019510845679390557,"score_gpt":0.23631520874135156,"score_spread":0.216804363061961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403674456","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064656406,0.000087850596,0.9986072,0.00009577973,0.000010403808,0.000011371211,0.000010125723,0.00014759073,0.0003831074],"genre_scores_gemma":[0.09547537,0.0009748069,0.89935297,0.0004890543,0.00023882953,0.00024075389,0.00019978834,0.00042294263,0.0026053335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981939,0.0006680699,0.00009110439,0.00029021697,0.0005957989,0.00016089632],"domain_scores_gemma":[0.9952371,0.0024286252,0.0003436732,0.00092953444,0.0008092844,0.00025171007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00439735,0.0015317505,0.0015258343,0.0013336823,0.0005808812,0.0016907534,0.0025330228,0.0018164607,0.0034314087],"category_scores_gemma":[0.018582677,0.0011513688,0.0011010084,0.0012822687,0.002258192,0.0029330854,0.0061814818,0.004469449,0.0016415806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010756093,0.000111664594,0.0008714172,0.0003818971,0.00010164985,0.00018778683,0.00031383272,0.43963742,0.008670521,0.30472022,0.005333709,0.23956236],"study_design_scores_gemma":[0.0000126596005,0.000027579423,0.000060683327,0.00003404133,0.000010919504,0.000055005803,0.000014704005,0.9464517,0.0018390878,0.048928857,0.0025507943,0.000013908971],"about_ca_topic_score_codex":0.0022403384,"about_ca_topic_score_gemma":0.0032129409,"teacher_disagreement_score":0.00439735,"about_ca_system_score_codex":0.0010353739,"about_ca_system_score_gemma":0.0022093367,"threshold_uncertainty_score":0.023255646},"labels":[],"label_agreement":null},{"id":"W4405231872","doi":"10.1109/tsp.2024.3499772","title":"Corrections to “DoA Estimation for Hybrid Receivers: Full Spatial Coverage and Successive Refinement”","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Integrated Circuits and Semiconductor Failure Analysis","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Carleton University; Ciena (Canada)","funders":"","keywords":"Computer science; Algorithm; Estimation; Speech recognition; Statistics; Mathematics; Engineering","score_opus":0.011520757265449011,"score_gpt":0.23887903568928645,"score_spread":0.22735827842383743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405231872","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001111867,0.005665989,0.13775115,0.03568674,0.79226124,0.00019003035,0.0048725936,0.009226065,0.013234287],"genre_scores_gemma":[0.04055559,0.0140705155,0.24411277,0.052082337,0.16989005,0.0008835986,0.01899241,0.024186762,0.43522605],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963888,0.0010409302,0.00042806045,0.00049052754,0.0014846671,0.00016706431],"domain_scores_gemma":[0.974878,0.0052703307,0.00084329594,0.00227315,0.016218659,0.0005165646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003638468,0.0028787656,0.0016160598,0.0028724992,0.002070078,0.001859886,0.003793295,0.0043191314,0.098719954],"category_scores_gemma":[0.04919069,0.0018750856,0.002611902,0.0023757005,0.0013161973,0.0030766462,0.0023346548,0.008877507,0.06571],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095591786,0.000017618737,0.000101649945,0.00020388364,0.000026952772,0.00014140908,0.00006434288,0.00086088054,0.0009443132,0.004764467,0.9762883,0.016490621],"study_design_scores_gemma":[0.00005444513,0.00004127535,0.0009345936,0.0002340601,0.000049056096,0.00044187976,0.000057334448,0.004884565,0.0026876281,0.00842796,0.98208493,0.00010224198],"about_ca_topic_score_codex":0.017941575,"about_ca_topic_score_gemma":0.0280447,"teacher_disagreement_score":0.098719954,"about_ca_system_score_codex":0.0021669979,"about_ca_system_score_gemma":0.0027135813,"threshold_uncertainty_score":0.33025116},"labels":[],"label_agreement":null},{"id":"W4408647610","doi":"10.1109/tsp.2025.3553084","title":"Globally Optimal Max-Min Rate Joint Channel and Power Allocation for Hybrid NOMA-OMA Downlink Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Noma; Joint (building); Computer science; Channel (broadcasting); Power (physics); Mathematical optimization; Telecommunications; Computer network; Mathematics; Engineering; Physics","score_opus":0.015523211557462304,"score_gpt":0.24186563265601005,"score_spread":0.22634242109854774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408647610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016584978,0.00023204795,0.980361,0.00009509398,0.000016190932,0.000033544708,0.0000377226,0.00024512003,0.0023941942],"genre_scores_gemma":[0.6947756,0.00022067055,0.3011958,0.000113383125,0.00004794209,0.00016932328,0.00013980053,0.00013475188,0.0032027434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993892,0.0002593004,0.000023082095,0.00011288116,0.000100905214,0.00011466457],"domain_scores_gemma":[0.9994247,0.00034305308,0.00008475569,0.00004427338,0.00007046598,0.000032892585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009948873,0.0013362118,0.0014113804,0.00045427802,0.00056713866,0.0011245866,0.00082878605,0.0009449044,0.0016849458],"category_scores_gemma":[0.001870246,0.00056106894,0.0005217049,0.0007160218,0.0006933556,0.0009183673,0.0011591574,0.0008567313,0.0005074982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092917144,0.000035646324,0.00029367724,0.00004154553,0.00003253134,0.00004167613,0.00006364402,0.95681167,0.0021710892,0.007364588,0.0010225351,0.032028493],"study_design_scores_gemma":[0.000011515138,0.000022838623,0.000052992167,0.0000031458155,0.000004806985,0.000019687355,0.000020644491,0.99515486,0.00046793508,0.0039492664,0.000287211,0.0000050634553],"about_ca_topic_score_codex":0.0025240472,"about_ca_topic_score_gemma":0.0029140066,"teacher_disagreement_score":0.0025240472,"about_ca_system_score_codex":0.0007883534,"about_ca_system_score_gemma":0.001138102,"threshold_uncertainty_score":0.0057199},"labels":[],"label_agreement":null},{"id":"W4409641209","doi":"10.1109/tsp.2025.3562858","title":"Joint User Selection and Hybrid Precoder Design for Massive MIMO Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Joint (building); MIMO; Computer science; Selection (genetic algorithm); Control theory (sociology); Telecommunications; Beamforming; Artificial intelligence; Engineering","score_opus":0.01913044183002573,"score_gpt":0.239326598874165,"score_spread":0.22019615704413925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409641209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005514516,0.00025005217,0.9924332,0.000059245962,0.000016654418,0.000025413661,0.000026960703,0.00016845924,0.0015055476],"genre_scores_gemma":[0.6826002,0.0009331447,0.3108563,0.00019570859,0.00010858834,0.00024974355,0.00017417078,0.0000632369,0.0048188963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999131,0.00034395093,0.00003121781,0.0001471062,0.00024598418,0.00010073609],"domain_scores_gemma":[0.9991559,0.00048739146,0.000090570415,0.000069813934,0.00015803082,0.000038339866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008211789,0.0012173835,0.0010406639,0.00037203197,0.00033699346,0.0011291401,0.0008401193,0.00077398866,0.0018247805],"category_scores_gemma":[0.0020514072,0.00059411034,0.00052759383,0.0006917943,0.00068890577,0.00080562284,0.0009364594,0.00077688054,0.0005778719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009747238,0.0000385171,0.00037521173,0.00010258931,0.000059191127,0.00013832391,0.00008723014,0.9016151,0.0063140006,0.014947591,0.0012982828,0.07492645],"study_design_scores_gemma":[0.000011490717,0.000055847657,0.00006586747,0.00000677297,0.00001058943,0.000046486926,0.000009777868,0.9941843,0.0011689081,0.0038419315,0.00059010123,0.000007897876],"about_ca_topic_score_codex":0.002114361,"about_ca_topic_score_gemma":0.0031836242,"teacher_disagreement_score":0.002114361,"about_ca_system_score_codex":0.0005567054,"about_ca_system_score_gemma":0.0010270164,"threshold_uncertainty_score":0.0061044693},"labels":[],"label_agreement":null},{"id":"W4410985560","doi":"10.1109/tsp.2025.3575919","title":"Unlabeled Compressed Sensing From Multiple Measurement Vectors","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced MEMS and NEMS Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Computer science; Signal processing; Pattern recognition (psychology); Artificial intelligence; Algorithm; Mathematics; Telecommunications; Radar","score_opus":0.021622065795458986,"score_gpt":0.22962070740788487,"score_spread":0.20799864161242587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410985560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033315162,0.00019203426,0.99481684,0.00022976042,0.000046734607,0.00002326392,0.00008795794,0.00014533699,0.0011266172],"genre_scores_gemma":[0.35049596,0.0011483809,0.6371006,0.0006509037,0.00048362958,0.00024288546,0.0012635305,0.00016242202,0.008451648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984962,0.00047010617,0.00005750264,0.00038736258,0.00047713373,0.00011164552],"domain_scores_gemma":[0.99846435,0.0008423381,0.00015606746,0.00028075007,0.00020431526,0.000052180323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012232192,0.0010960638,0.0012196103,0.00072038616,0.0005408128,0.001261148,0.0013254598,0.0013028496,0.0021701574],"category_scores_gemma":[0.005761115,0.00057518046,0.0006502158,0.001099936,0.0013923601,0.0023419107,0.0019283189,0.0018350807,0.0006441821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034457046,0.000087691886,0.0007019985,0.00030530512,0.000081275946,0.00022708351,0.00021473227,0.52458394,0.010429,0.23175076,0.0057408586,0.22553279],"study_design_scores_gemma":[0.000016136866,0.000035733254,0.00016004899,0.000022660322,0.000010096566,0.00006929808,0.000025402183,0.9409515,0.0027507427,0.052743807,0.0031937947,0.000020767171],"about_ca_topic_score_codex":0.0038395696,"about_ca_topic_score_gemma":0.003728743,"teacher_disagreement_score":0.0038395696,"about_ca_system_score_codex":0.0008624015,"about_ca_system_score_gemma":0.0015812931,"threshold_uncertainty_score":0.007634461},"labels":[],"label_agreement":null},{"id":"W4411996076","doi":"10.1109/tsp.2025.3584665","title":"Proportionally Fair Joint Power and Channel Allocation for Hybrid NOMA-OMA Downlink Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Noma; Joint (building); Computer science; Channel (broadcasting); Power (physics); Telecommunications; Computer network; Engineering","score_opus":0.015997771673344027,"score_gpt":0.24162920545745528,"score_spread":0.22563143378411127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411996076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04485464,0.0005083353,0.9493854,0.00031933762,0.000065114466,0.000058762937,0.00007963578,0.00022857795,0.0045001125],"genre_scores_gemma":[0.94481033,0.00025264014,0.051512524,0.00008888469,0.00008223304,0.00009081757,0.000038705657,0.000042684365,0.0030811483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988009,0.0005149376,0.000032487536,0.00017378358,0.00021542823,0.0002625448],"domain_scores_gemma":[0.998917,0.0007280847,0.00011068374,0.00008085109,0.000105588166,0.000057856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017566761,0.00100174,0.001252125,0.0003937906,0.00088089705,0.0017688636,0.0012313952,0.00084306847,0.002122138],"category_scores_gemma":[0.003030597,0.0004518991,0.00043145727,0.0007432151,0.0012118978,0.0012816747,0.0013906909,0.0008034372,0.00028652116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018098298,0.000061133476,0.00039244725,0.00006099767,0.000034621014,0.00013674659,0.00008112282,0.95067865,0.0022111358,0.02714077,0.000901188,0.018120153],"study_design_scores_gemma":[0.000009900287,0.000012648719,0.000034889046,0.0000016438624,0.0000050658005,0.000015403144,0.000009899663,0.9934465,0.00024062999,0.006035334,0.00018412794,0.0000039498273],"about_ca_topic_score_codex":0.0050874413,"about_ca_topic_score_gemma":0.0051954845,"teacher_disagreement_score":0.0050874413,"about_ca_system_score_codex":0.0015614913,"about_ca_system_score_gemma":0.0012467781,"threshold_uncertainty_score":0.011329472},"labels":[],"label_agreement":null},{"id":"W4415482185","doi":"10.1109/tsp.2025.3624791","title":"Regularized Top-$ k $: A Bayesian Framework for Gradient Sparsification","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); University of Toronto","funders":"","keywords":"Scaling; Posterior probability; Convergence (economics); Rate of convergence; Bayesian probability; Prior probability; Generalization; Inverse; Inverse problem","score_opus":0.028707610141174594,"score_gpt":0.3225312797731015,"score_spread":0.29382366963192685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415482185","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012579336,0.00003844496,0.9979772,0.000062387044,0.000008724701,0.000016636599,0.000022486638,0.00013698061,0.00047914774],"genre_scores_gemma":[0.094761536,0.00022093381,0.9005242,0.0001585747,0.000071534814,0.00019695344,0.00026836546,0.00030313083,0.003494749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990288,0.00035811373,0.000057745165,0.00019637521,0.00027884555,0.00008011864],"domain_scores_gemma":[0.9973001,0.0013140616,0.00026576762,0.0005343375,0.00045912623,0.00012670428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023378336,0.0009723133,0.0011715859,0.000820027,0.0005935921,0.0014337561,0.0023842745,0.0014231368,0.003701375],"category_scores_gemma":[0.008305702,0.0009655309,0.0009535658,0.0007059618,0.0020132363,0.0024472917,0.0021279692,0.0027452216,0.0015878273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019835451,0.00005972398,0.0006931729,0.00018076907,0.00007823752,0.00016855833,0.0002067839,0.60491663,0.008967967,0.22111145,0.0038272503,0.15959111],"study_design_scores_gemma":[0.000011297406,0.000016115006,0.00007269067,0.0000134628335,0.000005470513,0.00003508651,0.0000070625524,0.9641889,0.001762652,0.032319795,0.0015545472,0.000013030458],"about_ca_topic_score_codex":0.0034288543,"about_ca_topic_score_gemma":0.004205418,"teacher_disagreement_score":0.003701375,"about_ca_system_score_codex":0.001076616,"about_ca_system_score_gemma":0.0016254259,"threshold_uncertainty_score":0.012382388},"labels":[],"label_agreement":null},{"id":"W4416010421","doi":"10.1109/tsp.2025.3630236","title":"A Novel Robust Kalman Filter Based on Normal-Bernoulli Distribution for Non-Stationary Heavy-Tailed Measurement Noise","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Kalman filter; Bernoulli distribution; Noise (video); Control theory (sociology); Gaussian noise; Filter (signal processing); Gaussian; Noise measurement; Bernoulli's principle; Invariant extended Kalman filter","score_opus":0.03769494711055527,"score_gpt":0.2612547067176327,"score_spread":0.2235597596070774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416010421","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011416998,0.00013041512,0.9982393,0.00003155926,0.000025889325,0.000007702631,0.00001566163,0.0001581897,0.00024958584],"genre_scores_gemma":[0.34033552,0.0014177085,0.65137094,0.000287432,0.00023136107,0.00025158044,0.00054943404,0.00016500449,0.0053909617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875236,0.00015741734,0.00007387127,0.0004269783,0.0004883345,0.00010106119],"domain_scores_gemma":[0.9991321,0.00033754922,0.00013767759,0.00009396328,0.00026829418,0.000030350919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014522978,0.0010026256,0.0016594202,0.00073145947,0.0005960299,0.00087149977,0.0017443325,0.0011824623,0.0011489148],"category_scores_gemma":[0.003785643,0.0006398948,0.0010654087,0.0010249526,0.0007134186,0.002339764,0.0010875982,0.0014420142,0.0006905569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025794585,0.00006380752,0.002040654,0.00029886293,0.00020844834,0.00017616006,0.00019611811,0.57081395,0.016822072,0.038992446,0.0036358112,0.36649367],"study_design_scores_gemma":[0.000018622532,0.0000372867,0.0002881209,0.000013383152,0.000024176303,0.00008301159,0.0000070581045,0.9910773,0.0019624685,0.0043823374,0.00207705,0.00002918205],"about_ca_topic_score_codex":0.011694707,"about_ca_topic_score_gemma":0.0078146905,"teacher_disagreement_score":0.011694707,"about_ca_system_score_codex":0.00085172214,"about_ca_system_score_gemma":0.0022189873,"threshold_uncertainty_score":0.023253262},"labels":[],"label_agreement":null},{"id":"W7092296138","doi":"10.1109/tsp.2025.3602387","title":"Rate-Optimal Power Allocation for MIMO Channels Under Joint Total and Per-Group Power Constraints","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Prenatal Screening and Diagnostics","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"MIMO; Channel state information; Transmitter; Fading; Covariance matrix; Constraint (computer-aided design); Control theory (sociology); Power (physics); Channel (broadcasting)","score_opus":0.02326377152668968,"score_gpt":0.28079261991831983,"score_spread":0.25752884839163015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092296138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03633425,0.00049850106,0.9550505,0.00030030665,0.000040505147,0.000103111255,0.00017440853,0.00018505608,0.0073133954],"genre_scores_gemma":[0.8604069,0.0007780978,0.13375318,0.00019783097,0.00009199266,0.00028697267,0.0001796864,0.0001250833,0.004180405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810636,0.00080518547,0.000060667946,0.00022203925,0.00032897305,0.00047667188],"domain_scores_gemma":[0.9959996,0.0029162397,0.00032583802,0.0001794388,0.00045457913,0.00012438743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024234324,0.0019383038,0.0015169255,0.0006394049,0.00053460925,0.001861185,0.0010078389,0.0011338751,0.002857182],"category_scores_gemma":[0.007453204,0.0007119811,0.00066981954,0.001285462,0.001582269,0.0015638331,0.0014736946,0.0011358925,0.00063890184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009189957,0.00003751745,0.00018063675,0.000061633706,0.00002095432,0.00007320762,0.000055954813,0.9722652,0.0018420573,0.016453847,0.0006326556,0.008284395],"study_design_scores_gemma":[0.000017754333,0.00003581511,0.000058887897,0.0000078891435,0.000007056954,0.000024133918,0.000024326868,0.990026,0.000843873,0.008768041,0.00017824289,0.000007920738],"about_ca_topic_score_codex":0.0038914129,"about_ca_topic_score_gemma":0.003502094,"teacher_disagreement_score":0.0038914129,"about_ca_system_score_codex":0.0016998014,"about_ca_system_score_gemma":0.0023973614,"threshold_uncertainty_score":0.012816489},"labels":[],"label_agreement":null},{"id":"W7101735976","doi":"10.1109/tsp.2025.3624477","title":"Optimal Adaptive Time-Frequency Representation via Differentiable Short-Time Fourier Transform","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Plant Diversity and Evolution","field":"Agricultural and Biological Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Short-time Fourier transform; Differentiable function; Representation (politics); Heuristic; Fourier transform; Discrete Fourier transform (general)","score_opus":0.020753763034225083,"score_gpt":0.22319247828441355,"score_spread":0.20243871525018847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7101735976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055340943,0.00008469461,0.9935442,0.000047304657,0.000013727516,0.0000084823905,0.00001433847,0.00012843763,0.00062461296],"genre_scores_gemma":[0.3465369,0.00041471244,0.6499822,0.00008785907,0.00006430948,0.00008952216,0.00018851995,0.00017821632,0.0024577382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977285,0.000057696598,0.000011627061,0.000044529363,0.000092387694,0.000020892836],"domain_scores_gemma":[0.999542,0.0002482907,0.000060928236,0.000045074798,0.0000859461,0.00001788334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064305984,0.00060907303,0.00054389745,0.00037809036,0.00017912529,0.00066310144,0.00055598497,0.00077167404,0.0015185702],"category_scores_gemma":[0.0024013312,0.00021723642,0.00039648483,0.0005208885,0.0004434245,0.0008910537,0.0005075906,0.0008548085,0.0006439731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009172868,0.00006100886,0.00044059544,0.00012512047,0.000029312767,0.00012519256,0.00009841257,0.7252034,0.03683701,0.026058625,0.0019191434,0.20901053],"study_design_scores_gemma":[0.0000035562946,0.000014258372,0.00007212776,0.0000031762345,0.0000022907313,0.000020450994,0.00000393048,0.99584466,0.00146144,0.0021215517,0.00044804328,0.0000044487906],"about_ca_topic_score_codex":0.0011282235,"about_ca_topic_score_gemma":0.0011265685,"teacher_disagreement_score":0.0015185702,"about_ca_system_score_codex":0.00029224585,"about_ca_system_score_gemma":0.0006127733,"threshold_uncertainty_score":0.0050801635},"labels":[],"label_agreement":null}]}