{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026204417,0.00021203897,0.96670187,0.00020446713,0.00023139511,0.00021533787,0.000008960353,0.0016611445,0.004560362],"genre_scores_gemma":[0.99466795,0.00001882568,0.0048228274,0.00012883217,0.00008339925,0.00009185879,0.0000023572495,0.000079246274,0.00010469291],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99880594,0.000048994836,0.00031054017,0.0002360792,0.00029237903,0.00030608053],"domain_scores_gemma":[0.99920326,0.00007438188,0.00005162588,0.0003645851,0.0000989518,0.00020718595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002601945,0.00025361613,0.00021108016,0.00032300997,0.00026475656,0.00014888121,0.00025536117,0.00015147579,0.000037319736],"category_scores_gemma":[0.0000035605945,0.0002698583,0.000076565106,0.0004342862,0.00005971331,0.0004078506,0.0000017287473,0.00059839414,0.00008626389],"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.000101529906,0.00035714929,0.0000024479498,0.00022382257,0.00007155539,0.00027439874,0.0072353925,0.26582158,0.005335303,0.00029396923,0.0006849718,0.7195979],"study_design_scores_gemma":[0.0012209484,0.00045272498,0.0000027995677,0.0011113711,0.00008174302,0.00079719245,0.0023115145,0.4885346,0.49517778,0.0019092791,0.0071287644,0.0012712869],"about_ca_topic_score_codex":0.000017926144,"about_ca_topic_score_gemma":0.000018527397,"teacher_disagreement_score":0.96846354,"about_ca_system_score_codex":0.00018407944,"about_ca_system_score_gemma":0.00004973852,"threshold_uncertainty_score":0.9999754},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009985966,0.00107017,0.9866633,0.000042441145,0.00074659,0.00048288863,0.000025266645,0.00047420067,0.00050921453],"genre_scores_gemma":[0.9987562,0.0000065187833,0.00038281083,0.000023745155,0.00019811386,0.0003756688,0.0000010362229,0.000059578408,0.00019635996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879766,0.000021990076,0.0003558166,0.00025769073,0.00020767045,0.00035914945],"domain_scores_gemma":[0.9994415,0.00014978726,0.00004353277,0.00016007638,0.0001096091,0.00009550228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013900393,0.00022529675,0.00026861377,0.0001343283,0.00027294568,0.00014565182,0.00013006658,0.00011249853,0.000052330564],"category_scores_gemma":[0.0000041689364,0.00023099697,0.0001073713,0.00024834834,0.00003464062,0.0002599681,3.5354046e-7,0.00020527386,0.000035748824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026612006,0.000042821306,1.6269175e-7,0.00038399338,0.000042319392,0.0000011397292,0.0004212214,0.88916713,0.032175504,0.000005313469,0.000080127225,0.077653654],"study_design_scores_gemma":[0.0005639301,0.00008053485,0.000001025072,0.00029729155,0.000047893333,0.000019242489,0.00025651918,0.98864776,0.009395835,0.000025639592,0.00038340324,0.00028092042],"about_ca_topic_score_codex":0.0000059613185,"about_ca_topic_score_gemma":0.000003855869,"teacher_disagreement_score":0.9887702,"about_ca_system_score_codex":0.000120097466,"about_ca_system_score_gemma":0.000016639831,"threshold_uncertainty_score":0.9419783},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005654925,0.00024419784,0.9970157,0.000026214797,0.00061102875,0.00040812715,0.00001135919,0.00059136044,0.0005264791],"genre_scores_gemma":[0.9657776,0.000012304786,0.033524293,0.000023842578,0.00024768812,0.00014582311,0.000007284931,0.00007561448,0.00018559916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990144,0.000018070581,0.00030049295,0.00022498591,0.00013476048,0.00030732914],"domain_scores_gemma":[0.99940634,0.000062163206,0.000054745644,0.00018767356,0.00015424326,0.00013485395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018753516,0.0001895357,0.00019109494,0.00012235726,0.00018916049,0.00008843059,0.00015150566,0.00013443184,0.00001606596],"category_scores_gemma":[0.000008008277,0.00020280201,0.000060056263,0.00024781984,0.000023046176,0.00050477404,8.843339e-7,0.00021414625,0.000012890464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048216487,0.00002171234,0.0000025753243,0.00008115427,0.00001434611,6.779314e-7,0.00022559268,0.90603864,0.0009833113,0.0000014454189,0.0001749906,0.092407316],"study_design_scores_gemma":[0.0006783424,0.000067107365,7.008851e-7,0.00015966065,0.00003211162,0.00000728514,0.00007884353,0.9786137,0.019573526,0.000116199066,0.00044310998,0.0002294592],"about_ca_topic_score_codex":0.000008234838,"about_ca_topic_score_gemma":0.000016580156,"teacher_disagreement_score":0.96521205,"about_ca_system_score_codex":0.00018268425,"about_ca_system_score_gemma":0.000049325296,"threshold_uncertainty_score":0.8270026},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014236064,0.00011609726,0.9982648,0.000022164684,0.00035321867,0.00056471425,0.000011931477,0.00036461977,0.00016011557],"genre_scores_gemma":[0.83383375,0.00000913287,0.16563964,0.000030453873,0.00007514259,0.00020220972,0.000009123529,0.00006122884,0.00013933083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990101,0.000027132994,0.00033722928,0.00022027314,0.00016124554,0.00024400416],"domain_scores_gemma":[0.9994573,0.00006285208,0.00006385685,0.000114010974,0.00018601395,0.00011596776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017249654,0.00020559547,0.00018432549,0.00014775085,0.00013124022,0.000046675792,0.000102904756,0.00010364722,0.00001801002],"category_scores_gemma":[0.0000044711205,0.00021123388,0.000051901356,0.00023951031,0.000025895511,0.0005054901,4.9801537e-7,0.00012342236,0.000022053802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009140963,0.000036076395,4.518722e-7,0.00008870084,0.000019266145,3.466932e-7,0.0005438194,0.94571215,0.006744799,0.0000015338985,0.00008653084,0.046674937],"study_design_scores_gemma":[0.00066408684,0.00013973283,1.4758444e-7,0.00012387554,0.000035865927,0.0000072750786,0.00014209781,0.8648136,0.13347785,0.0001386984,0.00024201802,0.00021469267],"about_ca_topic_score_codex":0.0000023241298,"about_ca_topic_score_gemma":0.000002456977,"teacher_disagreement_score":0.83369136,"about_ca_system_score_codex":0.00020609061,"about_ca_system_score_gemma":0.000057601763,"threshold_uncertainty_score":0.8613868},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13130493,0.00047692042,0.86670905,0.000052970227,0.00013174293,0.00009899282,0.000008103619,0.00022309797,0.0009941584],"genre_scores_gemma":[0.99863386,0.00013231061,0.0009948865,0.000046589706,0.000043496122,0.00006454626,0.0000038059638,0.00004383103,0.000036683683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990605,0.000053046646,0.0002837352,0.00022159691,0.00014028269,0.00024079853],"domain_scores_gemma":[0.99942714,0.00003512733,0.00004558354,0.00023682535,0.000064911146,0.00019042753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014939944,0.0002027497,0.00019406616,0.00030654704,0.00016016614,0.00011721043,0.00015988361,0.000111142894,0.000013829316],"category_scores_gemma":[0.000002335724,0.00020386711,0.000035652716,0.00042678046,0.000051886003,0.0006788732,0.000001498387,0.0002839337,0.000007149585],"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.00020525366,0.00026872917,0.000031491796,0.00008462875,0.00003615047,0.000014934071,0.0021508553,0.26543888,0.06481838,0.000009641233,0.000022341615,0.6669187],"study_design_scores_gemma":[0.0013556924,0.0001847007,0.00042155836,0.00016707547,0.000036897378,0.000027888082,0.00064550666,0.86125475,0.13463567,0.00030531414,0.000536509,0.00042842905],"about_ca_topic_score_codex":0.00012554973,"about_ca_topic_score_gemma":0.00054456387,"teacher_disagreement_score":0.8673289,"about_ca_system_score_codex":0.00010209645,"about_ca_system_score_gemma":0.00006106978,"threshold_uncertainty_score":0.8313459},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042634398,0.00007339222,0.9550895,0.00006458018,0.000055494223,0.00052875135,0.000006643145,0.0010804588,0.00046678813],"genre_scores_gemma":[0.99517,0.0000064648925,0.004236158,0.00011239931,0.00005864395,0.00012908506,0.000004085162,0.000057211688,0.00022594443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988603,0.000034424727,0.0002230335,0.00033062004,0.00030634226,0.00024528874],"domain_scores_gemma":[0.99930716,0.000037329537,0.00006268974,0.00019660093,0.00024341771,0.00015279265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007783721,0.000245271,0.00019825969,0.00032644186,0.00018921285,0.00009705736,0.00012623028,0.00011530169,0.000002285098],"category_scores_gemma":[0.0000032230469,0.00018617962,0.000036885194,0.0007658201,0.000033219705,0.00023188883,0.0000012319875,0.00027400788,0.000038514194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000298619,0.00016124688,0.0000039010783,0.000031260963,0.000035525467,0.0000029676396,0.0009266907,0.938478,0.022616765,0.0000013207958,0.00031459364,0.037129134],"study_design_scores_gemma":[0.0006279124,0.00043364955,0.00003945618,0.00024958278,0.000049262326,0.000015110913,0.00033040138,0.69750094,0.29980984,0.000029892546,0.000564033,0.00034992848],"about_ca_topic_score_codex":0.00004916498,"about_ca_topic_score_gemma":0.000019434785,"teacher_disagreement_score":0.9525356,"about_ca_system_score_codex":0.00016372054,"about_ca_system_score_gemma":0.00005910669,"threshold_uncertainty_score":0.75921845},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070695095,0.0000120077275,0.92535484,0.000005577884,0.000048150472,0.00014939478,0.0000066172934,0.00038790904,0.0033404168],"genre_scores_gemma":[0.96935815,0.0000010721379,0.030493196,0.000038868173,0.000026625185,0.000024696406,0.0000017987701,0.00003635449,0.000019244266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912184,0.000030860414,0.00018922355,0.00021106865,0.00025570637,0.00019130422],"domain_scores_gemma":[0.999611,0.000024669327,0.000041605843,0.00015157361,0.000091516275,0.000079598525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008794999,0.00016395413,0.0001746652,0.00014591285,0.00015980622,0.0000397996,0.000110084766,0.000046484347,0.000009694826],"category_scores_gemma":[5.876315e-7,0.00014938286,0.00003645805,0.0002545303,0.000058986618,0.0001237512,7.0109553e-7,0.0001693685,0.0000037356301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101633064,0.00012736545,0.000007871396,0.00002546028,0.000031587024,3.8923494e-7,0.00048036914,0.94414586,0.016023658,0.000056909466,0.000023584429,0.0389753],"study_design_scores_gemma":[0.00022665887,0.0004064124,0.000057021694,0.00015935539,0.00003653919,0.000007165949,0.00027331396,0.85733485,0.14100596,0.000062349594,0.00021914995,0.00021122089],"about_ca_topic_score_codex":0.000018974722,"about_ca_topic_score_gemma":0.000005731075,"teacher_disagreement_score":0.89866304,"about_ca_system_score_codex":0.000045321598,"about_ca_system_score_gemma":0.000017602826,"threshold_uncertainty_score":0.6091656},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013315801,0.00015836571,0.9852311,0.000066337,0.00007387693,0.00045051269,0.000012421529,0.00061656506,0.00007501498],"genre_scores_gemma":[0.93891656,0.000034564262,0.06063084,0.000025967041,0.000028264032,0.00029795617,0.000017521048,0.000038168815,0.000010158786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993035,0.000026910673,0.00023872945,0.00017092198,0.00012078418,0.00013916311],"domain_scores_gemma":[0.9994994,0.00006834176,0.00007133568,0.00012220684,0.00016726278,0.00007147555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014951445,0.00014952844,0.00014057536,0.00017018366,0.00020910185,0.000115473646,0.00008754965,0.00008768671,0.0000036851472],"category_scores_gemma":[0.000009327458,0.00016269757,0.000029814913,0.00017155356,0.000037984297,0.0011251493,0.0000014512559,0.00015661378,0.000002652405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024742603,0.000022657054,0.0000021856201,0.00006480182,0.0000065670015,7.8176434e-8,0.0005690349,0.63747114,0.004983017,0.000005599666,0.000013390687,0.35683677],"study_design_scores_gemma":[0.00036280573,0.00006467226,0.000037278845,0.00011142496,0.000012425128,0.0000036457532,0.00008187183,0.83408666,0.1631902,0.0018685337,0.000028976492,0.00015148267],"about_ca_topic_score_codex":0.000004188167,"about_ca_topic_score_gemma":0.0000101925225,"teacher_disagreement_score":0.92560077,"about_ca_system_score_codex":0.00017422394,"about_ca_system_score_gemma":0.000027130307,"threshold_uncertainty_score":0.6634614},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060408,0.00007918659,0.9928444,0.00008570325,0.00011784066,0.00033477982,0.000004565144,0.00017626428,0.0003164585],"genre_scores_gemma":[0.5501843,0.000006964927,0.4496343,0.00008855528,0.000025037225,0.000012885479,0.0000010123467,0.000015031135,0.000031915264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982251,0.00006663362,0.00051414873,0.00041765106,0.0003795208,0.0003969516],"domain_scores_gemma":[0.99879086,0.0001197367,0.00031048965,0.00021934275,0.0003960715,0.00016350963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027659707,0.00025793316,0.00028998347,0.00031216512,0.00060086197,0.00028091914,0.00039586282,0.00012632443,0.00014535952],"category_scores_gemma":[0.000009052165,0.00024609434,0.000094784096,0.0009559189,0.00016307978,0.002068583,0.0000035626967,0.00027938475,0.0000117815425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002626585,0.0001978395,0.0000029333191,0.00006588878,0.000016364667,0.0000021626417,0.0002491682,0.7779772,0.041159675,0.0000018995563,0.0000052653427,0.18029532],"study_design_scores_gemma":[0.00076668186,0.0001597715,0.000001404227,0.000149315,0.000026521762,0.000028380922,0.00008113844,0.7174866,0.28102115,0.00007347599,0.0000026410353,0.00020288062],"about_ca_topic_score_codex":0.000035419707,"about_ca_topic_score_gemma":9.520146e-7,"teacher_disagreement_score":0.5441435,"about_ca_system_score_codex":0.000078871504,"about_ca_system_score_gemma":0.00044141966,"threshold_uncertainty_score":0.9999991},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11664455,0.00038186138,0.8817149,0.000031773292,0.00028060836,0.00032826603,0.000001946105,0.00017047813,0.00044562103],"genre_scores_gemma":[0.99774396,0.000025915831,0.0018288858,0.00012770123,0.00016367501,0.000025089059,0.0000015959938,0.00002957275,0.000053626194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980501,0.00015497292,0.00033990413,0.00048472083,0.00028242785,0.0006879097],"domain_scores_gemma":[0.9992102,0.00017549399,0.00013227243,0.00013070572,0.00016646544,0.00018486354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029437154,0.00031693216,0.00031706732,0.0002975034,0.00050459243,0.00022809225,0.00012847087,0.00013463311,0.00002940345],"category_scores_gemma":[0.0000039357014,0.00027696934,0.000076494354,0.0012506049,0.000113094306,0.0013467778,0.0000023162017,0.00082497403,0.000010650481],"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.0006511247,0.00071188516,0.0005801942,0.00002440718,0.00010772445,0.00009723541,0.004557984,0.18095435,0.0039297924,0.00003379638,0.000006473802,0.808345],"study_design_scores_gemma":[0.0017552614,0.00041824652,0.0034715524,0.0005825628,0.00005407708,0.0002602117,0.0002884642,0.9437455,0.048899725,0.000022818458,0.000007955874,0.0004936196],"about_ca_topic_score_codex":0.00003889707,"about_ca_topic_score_gemma":0.00019964365,"teacher_disagreement_score":0.8810994,"about_ca_system_score_codex":0.00020290249,"about_ca_system_score_gemma":0.00009866068,"threshold_uncertainty_score":0.99996823},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011514293,0.00020306118,0.98579586,0.00023365144,0.0005356972,0.00009589078,0.000008260282,0.00062109955,0.0009921863],"genre_scores_gemma":[0.9733276,0.000021244728,0.025743505,0.00029669932,0.00014494231,0.000016331533,0.0000027005444,0.000025144913,0.0004218357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982364,0.00006111057,0.00030612055,0.0005481715,0.00043919834,0.00040895544],"domain_scores_gemma":[0.99912626,0.000094160176,0.00009513614,0.00042693905,0.00010200008,0.00015548238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001403357,0.00024122137,0.0002030905,0.00018999493,0.0010775883,0.00021976356,0.00062847364,0.00014430546,0.000094457864],"category_scores_gemma":[0.0000020330021,0.00022657096,0.00011573355,0.00065254135,0.00008453134,0.0008982684,0.0000047205735,0.0005818169,0.00009402137],"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.0001192108,0.00066623016,0.00009340118,0.0001622895,0.00005377796,0.00043903105,0.004562012,0.21415664,0.026210582,0.00041359288,0.004015078,0.74910814],"study_design_scores_gemma":[0.002084782,0.0006989417,0.0012020305,0.0010829885,0.000061910076,0.001835658,0.00021857604,0.7576165,0.20692621,0.0009987438,0.0249556,0.0023180507],"about_ca_topic_score_codex":0.000011499677,"about_ca_topic_score_gemma":0.0000084510675,"teacher_disagreement_score":0.96181333,"about_ca_system_score_codex":0.000042223444,"about_ca_system_score_gemma":0.00009071748,"threshold_uncertainty_score":0.9239296},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000092098875,0.000068975976,0.9964988,0.00005564551,0.00055037235,0.0012678441,0.000015786525,0.00077475305,0.00067572645],"genre_scores_gemma":[0.97321445,0.000010530702,0.025481256,0.00008694017,0.00018402269,0.0004844444,0.000013820939,0.00014795699,0.00037657842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844354,0.00012256813,0.00045327883,0.00034645834,0.00025425226,0.00037990994],"domain_scores_gemma":[0.999054,0.00028123532,0.00013322968,0.00026056336,0.00018001885,0.000090966256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039101904,0.00033310454,0.00027085858,0.00022220885,0.00056392147,0.00022754844,0.00020356254,0.00017566339,0.000026634549],"category_scores_gemma":[0.0000067284404,0.0002873977,0.000099231576,0.00035292385,0.00003752489,0.00038968486,8.185289e-7,0.00026073732,0.00002913714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088842724,0.000040007468,1.9507233e-7,0.00020239185,0.00003791504,4.936404e-7,0.00018452112,0.985296,0.0062070703,0.000088552086,0.00011793122,0.007736064],"study_design_scores_gemma":[0.00054871704,0.00016703703,3.756996e-7,0.00031190788,0.00006558924,0.000009851043,0.00009807861,0.95857227,0.039588995,0.00008888753,0.00023739705,0.00031091337],"about_ca_topic_score_codex":0.000007856392,"about_ca_topic_score_gemma":0.0000032580144,"teacher_disagreement_score":0.97312236,"about_ca_system_score_codex":0.00021210399,"about_ca_system_score_gemma":0.000037391997,"threshold_uncertainty_score":0.9999578},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007240703,0.000043635704,0.9914973,0.00005453262,0.000105310755,0.0002918312,0.0000030366477,0.00018962617,0.000574032],"genre_scores_gemma":[0.99744624,0.000009622329,0.0022478653,0.000052178606,0.000038525068,0.00008765741,0.0000059830504,0.000042561638,0.00006934678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910223,0.000091332666,0.00025165186,0.00021021276,0.00013799971,0.00020656947],"domain_scores_gemma":[0.9995682,0.000096803065,0.00006692143,0.00013532993,0.000099222,0.00003348508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025959092,0.0001853949,0.00014217883,0.00019445995,0.00015455112,0.00009896683,0.00013842068,0.00007389015,0.000011581482],"category_scores_gemma":[0.0000042193337,0.00014672989,0.000023321245,0.0005238544,0.00003618581,0.00053240365,4.6549806e-7,0.0002575109,0.00001437173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003380645,0.00004117674,0.000005468504,0.00009847864,0.0000052869436,0.0000010710248,0.001079354,0.95582896,0.0031529241,0.0000064742544,0.0000038948006,0.03974309],"study_design_scores_gemma":[0.0005234969,0.00007826768,0.000027106003,0.00027413887,0.000018050952,0.000007821512,0.0003743065,0.98275924,0.015664203,0.000040971514,0.000044591106,0.00018783372],"about_ca_topic_score_codex":0.000011760451,"about_ca_topic_score_gemma":0.000074386546,"teacher_disagreement_score":0.9902056,"about_ca_system_score_codex":0.00008492041,"about_ca_system_score_gemma":0.000015916408,"threshold_uncertainty_score":0.5983471},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029911669,0.00010223227,0.96872747,0.000017299768,0.0001028723,0.00017267733,0.000019206851,0.00065541506,0.0002911314],"genre_scores_gemma":[0.9278142,0.000011050301,0.072005115,0.000009820208,0.000013783784,0.000064709995,0.000020528869,0.00004711971,0.000013665297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987529,0.000052641994,0.0004640573,0.00022468442,0.0002912562,0.00021445863],"domain_scores_gemma":[0.999137,0.00012965627,0.00016336728,0.00030339396,0.0001893121,0.00007731021],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019303906,0.00022218516,0.00030575588,0.0006387789,0.00019269373,0.000022649027,0.0002369097,0.00012227349,0.00016911092],"category_scores_gemma":[0.0000052093837,0.00025488107,0.00020727805,0.0010796129,0.000098553704,0.00044637438,0.0000014020279,0.00028971897,0.000008689214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014902608,0.00007315636,0.0000067445026,0.00011286471,0.00018069435,9.379252e-7,0.0006240529,0.9661409,0.006320503,0.00002251395,0.000002787076,0.026365776],"study_design_scores_gemma":[0.00040286352,0.0000642982,0.000015535978,0.00010302778,0.00020932438,4.5338544e-7,0.000102367645,0.6720013,0.32681972,0.000108328866,0.000007175319,0.00016557616],"about_ca_topic_score_codex":0.000020671701,"about_ca_topic_score_gemma":0.000027891372,"teacher_disagreement_score":0.89790255,"about_ca_system_score_codex":0.00013104122,"about_ca_system_score_gemma":0.000052681946,"threshold_uncertainty_score":0.99999034},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09916734,0.00035451996,0.8995621,0.00003307579,0.00016603938,0.0002484531,0.0000039336687,0.00007247802,0.00039202505],"genre_scores_gemma":[0.96527326,0.000011802499,0.034528054,0.000077981094,0.000032075666,0.000020354177,0.0000018518792,0.000018650591,0.000035978646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998469,0.000108393986,0.00039113776,0.00030205486,0.0003423969,0.0003870207],"domain_scores_gemma":[0.9992646,0.00023771472,0.00016469038,0.00013745435,0.000090732436,0.00010481808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039407948,0.0001934241,0.00029805314,0.0003043199,0.00015291512,0.0001087315,0.00017195418,0.000093052775,0.0000028173447],"category_scores_gemma":[0.000003294234,0.00019436287,0.000080759324,0.0005860497,0.000069742084,0.0013334705,0.0000027273927,0.00028406855,0.00000428402],"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.00005504631,0.0001817456,0.00003495241,0.000076203636,0.000021208903,0.0000039422303,0.0010191875,0.319155,0.0010109195,0.000024393958,0.0000041216017,0.6784133],"study_design_scores_gemma":[0.000450658,0.00005503656,0.00020067293,0.00050051924,0.00003499135,0.00004079757,0.00007235119,0.98776335,0.010532661,0.00013276916,7.262006e-7,0.00021546298],"about_ca_topic_score_codex":0.000033774464,"about_ca_topic_score_gemma":0.000005259709,"teacher_disagreement_score":0.8661059,"about_ca_system_score_codex":0.00016866032,"about_ca_system_score_gemma":0.000110087865,"threshold_uncertainty_score":0.79258883},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01333019,0.000225216,0.98422545,0.00006657606,0.000019856177,0.0011706261,0.000011492301,0.00015933164,0.0007912578],"genre_scores_gemma":[0.93016803,0.000017795272,0.06871088,0.000084032574,0.00004353179,0.00053739577,0.0000010500733,0.0000403281,0.0003969598],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815863,0.00012315475,0.00068668,0.00035362775,0.0003934277,0.00028446168],"domain_scores_gemma":[0.9985571,0.0006352096,0.00018558656,0.0002874515,0.0001660843,0.0001685761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036772137,0.00027644157,0.0005554316,0.00017530362,0.00043869944,0.00022932864,0.00017449916,0.0001362695,0.00059377897],"category_scores_gemma":[0.00001760229,0.0002001673,0.00014564635,0.0003767132,0.00010927683,0.00031861084,0.0000015726985,0.00031112178,0.000043999822],"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.000086770226,0.0034583232,0.000060815106,0.28052577,0.0025694391,0.000012509414,0.007950006,0.0031550098,0.025797445,0.12274772,0.00011587741,0.5535203],"study_design_scores_gemma":[0.00067167997,0.00014670887,0.000031392847,0.0047394102,0.0013987187,0.00007776658,0.0009123426,0.088670984,0.04382735,0.85854274,0.00008719887,0.0008936779],"about_ca_topic_score_codex":0.0000081022345,"about_ca_topic_score_gemma":0.000005504819,"teacher_disagreement_score":0.9168378,"about_ca_system_score_codex":0.000033281583,"about_ca_system_score_gemma":0.00003900419,"threshold_uncertainty_score":0.81625855},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014723699,0.00013780102,0.9839888,0.000009270946,0.000026257869,0.00020775587,0.0000033618676,0.0005999472,0.00030308633],"genre_scores_gemma":[0.9415045,0.00004481106,0.05832738,0.0000052266414,0.000010547991,0.00004062369,6.739633e-7,0.000047000023,0.00001928263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99915683,0.000026866974,0.0002740811,0.00015686578,0.00022216365,0.00016320955],"domain_scores_gemma":[0.9995123,0.000101087324,0.000061318475,0.00019163206,0.00010029483,0.000033359647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000083557185,0.00017184831,0.00016875187,0.00021466897,0.00015317123,0.000023184399,0.0001522335,0.000089888206,0.000016263553],"category_scores_gemma":[4.138347e-7,0.00016589602,0.00004573114,0.00043689733,0.00007546849,0.00031186728,2.3292199e-7,0.00024424025,0.000004442332],"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.00007884271,0.00003900507,6.8953153e-7,0.000033201435,0.0000075665935,6.200905e-7,0.00004542424,0.63046724,0.17497317,0.0000017026124,0.000002766065,0.19434977],"study_design_scores_gemma":[0.00033709523,0.00011636845,0.000015950325,0.00019264512,0.000025908781,0.000011006867,0.000039342773,0.17104806,0.8277256,0.00028469757,0.00003633195,0.00016699954],"about_ca_topic_score_codex":0.0000080671925,"about_ca_topic_score_gemma":0.000023610291,"teacher_disagreement_score":0.92678076,"about_ca_system_score_codex":0.000089558314,"about_ca_system_score_gemma":0.000028993678,"threshold_uncertainty_score":0.6765044},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014182748,0.00024045931,0.996643,0.00059949304,0.0000559205,0.00030185675,0.000019578416,0.00010100605,0.00062042073],"genre_scores_gemma":[0.9783327,0.00002087917,0.021046408,0.000065627646,0.000036908576,0.00016639693,0.000005639673,0.000011991757,0.00031342977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852926,0.00008050996,0.00044856296,0.00028349503,0.00039800274,0.00026016237],"domain_scores_gemma":[0.99842274,0.00035417697,0.00017165822,0.00050911657,0.00045397857,0.00008831385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039800082,0.00012713335,0.00027019726,0.0006417706,0.00043532217,0.00022288162,0.0007772509,0.00007778171,0.000034560162],"category_scores_gemma":[0.000003541693,0.0001217405,0.00018075704,0.0019066584,0.000080225924,0.00075881125,0.0000030430256,0.00020039853,0.000009422476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015281881,0.00015106457,0.0000044438925,0.000035036137,0.00020056425,1.03303435e-7,0.00042610485,0.7731614,0.0036805868,0.0008457485,0.00003747588,0.22144218],"study_design_scores_gemma":[0.0002258005,0.000055502594,0.000036520752,0.000046865764,0.00013036982,0.0000018069792,0.00007461093,0.9873439,0.0101058725,0.00002546242,0.0018263517,0.00012694135],"about_ca_topic_score_codex":0.000017309616,"about_ca_topic_score_gemma":0.000035584122,"teacher_disagreement_score":0.97691447,"about_ca_system_score_codex":0.000080728685,"about_ca_system_score_gemma":0.00017157612,"threshold_uncertainty_score":0.49644336},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06835444,0.0021449476,0.92718095,0.0000127510875,0.0007630557,0.00028856276,0.000006778598,0.00033686566,0.00091164844],"genre_scores_gemma":[0.99222225,0.0000096490885,0.0074272873,0.000022122016,0.000096585485,0.000082708684,0.0000028690881,0.00007627175,0.00006028366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815965,0.00007132274,0.0005727847,0.00024062862,0.00037776204,0.0005778314],"domain_scores_gemma":[0.9994657,0.00008668143,0.000091108115,0.00014205821,0.000042134434,0.000172303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000455396,0.00030888393,0.00034441784,0.00033289217,0.00022738441,0.00019693602,0.0001377294,0.00015887409,0.000030502975],"category_scores_gemma":[0.000002851126,0.00030731334,0.000084406056,0.00047515336,0.00003574345,0.0011333395,8.2123444e-7,0.0004417745,0.000043420296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017110096,0.00007984704,0.00006140973,0.0005338722,0.00002366759,0.0000047327426,0.0009261277,0.9027411,0.0048149917,0.000004689204,0.000029869198,0.09076263],"study_design_scores_gemma":[0.00039553473,0.000036444,0.00005017648,0.0008099755,0.000027636155,0.00003592549,0.00057673675,0.97716767,0.020262623,0.000032835364,0.00018978892,0.00041468634],"about_ca_topic_score_codex":0.000062635736,"about_ca_topic_score_gemma":0.000006495594,"teacher_disagreement_score":0.92386776,"about_ca_system_score_codex":0.00030123634,"about_ca_system_score_gemma":0.000049730563,"threshold_uncertainty_score":0.9999379},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014715929,0.0002942106,0.9830531,0.0007137901,0.00013362672,0.00042526054,0.0000022259062,0.00014942049,0.0005124719],"genre_scores_gemma":[0.97907645,0.000024378938,0.020408897,0.00015343945,0.000046538386,0.00010572568,0.000002173737,0.000019994573,0.00016242925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982573,0.0002411028,0.0004759805,0.00030787406,0.00023196451,0.00048577186],"domain_scores_gemma":[0.99904686,0.00012170268,0.00015539634,0.00033413703,0.00018593906,0.00015598886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008333983,0.00018929095,0.0002240799,0.00040927329,0.000479349,0.00015737744,0.00048755374,0.00006576869,0.0000311294],"category_scores_gemma":[0.000010444209,0.00019572675,0.00007323524,0.0015524831,0.000060574683,0.0011006078,0.000015921216,0.00033492385,0.000041079533],"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.000060034552,0.0007599122,0.00017134905,0.000063649684,0.00002524612,0.0000011311461,0.0066577718,0.18700646,0.0824263,0.0003994804,0.00007412316,0.72235453],"study_design_scores_gemma":[0.0014327548,0.00024210358,0.0005587877,0.00083282747,0.00003979519,0.00002045519,0.0001817654,0.94210106,0.050627787,0.00008388488,0.0031739618,0.0007048336],"about_ca_topic_score_codex":0.000018561124,"about_ca_topic_score_gemma":0.00009075318,"teacher_disagreement_score":0.9643605,"about_ca_system_score_codex":0.00015245067,"about_ca_system_score_gemma":0.00014652185,"threshold_uncertainty_score":0.79815054},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021286317,0.000214707,0.99570936,0.00061524974,0.000109065826,0.00016481282,0.0000069447233,0.0010324898,0.0019344792],"genre_scores_gemma":[0.83387077,0.000058491674,0.16483021,0.0005010149,0.000029415869,0.00006079854,6.1833026e-7,0.00001978354,0.00062887464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855834,0.00004245314,0.00027911746,0.0004450966,0.00036330466,0.00031169446],"domain_scores_gemma":[0.9992977,0.000047864316,0.00007212919,0.00039015722,0.00007131203,0.000120858655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001020971,0.00020002198,0.00017809069,0.00020270864,0.0004064597,0.00017864066,0.00071373687,0.00008144938,0.0003032635],"category_scores_gemma":[9.781935e-7,0.00018175595,0.000093348295,0.00052582734,0.000054101434,0.001510952,0.0000023472612,0.0002982206,0.00008921291],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008250196,0.000136761,1.9902465e-7,0.000016999504,0.000005972789,0.000009116154,0.0002557475,0.0021911075,0.008367511,0.00030905285,0.0004108754,0.9882884],"study_design_scores_gemma":[0.0005029255,0.00012453223,0.0000016167928,0.0001087215,0.000010971414,0.000045064626,0.000011583759,0.50618297,0.48017928,0.004222882,0.008239258,0.00037021545],"about_ca_topic_score_codex":0.0000034302736,"about_ca_topic_score_gemma":0.0000015457549,"teacher_disagreement_score":0.9879182,"about_ca_system_score_codex":0.000052375803,"about_ca_system_score_gemma":0.00002249109,"threshold_uncertainty_score":0.7411792},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069106265,0.00024307596,0.9970713,0.00036320818,0.00030496207,0.00025152694,0.0000016481108,0.00029331943,0.0007798657],"genre_scores_gemma":[0.9746003,0.000031168383,0.02421307,0.0007073767,0.00014471922,0.00008211454,0.000003935568,0.000027008242,0.00019027044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985435,0.00018846306,0.00033550983,0.0004086547,0.00020783846,0.0003160285],"domain_scores_gemma":[0.9986916,0.00038535235,0.00014036277,0.00041030892,0.00026418726,0.00010816615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005224518,0.00019575698,0.00018905403,0.00014126157,0.0009303727,0.00036109227,0.00054805627,0.0000870933,0.000031443073],"category_scores_gemma":[0.000013334889,0.00019442178,0.00009850097,0.0005700641,0.000058273636,0.00064724305,0.000005638168,0.00024964003,0.000009999862],"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.000016297941,0.000085573185,0.000002306709,0.000013507113,0.000010406173,2.2225784e-7,0.00038025537,0.25721902,0.002741794,0.0023869786,0.0000478216,0.73709583],"study_design_scores_gemma":[0.0005885538,0.00018882501,0.0000066734033,0.00011447573,0.000017175193,0.000005810381,0.000013624903,0.98249996,0.012597419,0.00032267655,0.0033906836,0.0002540979],"about_ca_topic_score_codex":0.0000015027701,"about_ca_topic_score_gemma":0.000020691707,"teacher_disagreement_score":0.97390926,"about_ca_system_score_codex":0.00010067907,"about_ca_system_score_gemma":0.000064320426,"threshold_uncertainty_score":0.792829},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03409319,0.00013620513,0.96392566,0.00016397689,0.00075068517,0.0003068928,0.000018932365,0.0002457892,0.0003586471],"genre_scores_gemma":[0.9951348,0.0000012477799,0.0044140536,0.00013045131,0.00012426132,0.000095287716,8.420255e-7,0.000022681937,0.00007642237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770594,0.00022664484,0.00046213332,0.00047732898,0.00040755852,0.000720385],"domain_scores_gemma":[0.9986088,0.0005241102,0.0001689437,0.00038903387,0.00008164667,0.0002274549],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058622984,0.0002777921,0.00033176676,0.0002484823,0.00030211284,0.00026239932,0.00045941264,0.00016683959,0.00004233397],"category_scores_gemma":[0.000026611124,0.00028450816,0.00011166828,0.00060575746,0.000067308465,0.00075869786,0.000004169008,0.00057050126,0.00010650844],"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.00024283462,0.0028922958,0.0023555744,0.0003892609,0.00014947084,0.00019334462,0.0054576104,0.12631744,0.007264761,0.0026404965,0.00009037242,0.85200655],"study_design_scores_gemma":[0.0021867836,0.00022522299,0.002092158,0.0009452633,0.000058827776,0.00018905406,0.00027652294,0.9762011,0.015393263,0.00071103725,0.00063068763,0.001090037],"about_ca_topic_score_codex":0.000029742143,"about_ca_topic_score_gemma":0.000021155185,"teacher_disagreement_score":0.96104157,"about_ca_system_score_codex":0.00020828033,"about_ca_system_score_gemma":0.00015957984,"threshold_uncertainty_score":0.9999607},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016644362,0.000028828877,0.9828142,0.000016407734,0.00002218465,0.000076344455,0.0000027747521,0.000114731876,0.0002801701],"genre_scores_gemma":[0.98656285,0.000022065138,0.013306711,0.000017491167,0.000025339628,0.000015907548,7.26852e-7,0.000023768995,0.000025134545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994892,0.000016980794,0.00014578493,0.00011627873,0.00011629315,0.00011546978],"domain_scores_gemma":[0.99979067,0.000046704266,0.000033325654,0.000043259737,0.000046190282,0.00003985901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000082144084,0.00010767694,0.00012398578,0.00010757981,0.00011062896,0.00001778031,0.00003165698,0.000048648093,0.000020723373],"category_scores_gemma":[0.0000011003439,0.00009508645,0.000018917493,0.00016528495,0.000030072151,0.00013080299,1.0707279e-7,0.000095665135,0.0000016870962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010859322,0.000055054566,0.00003608167,0.0002309308,0.00004546243,5.05798e-7,0.0003088015,0.82976794,0.055546716,0.000010825876,0.000013536612,0.11387557],"study_design_scores_gemma":[0.00017008578,0.000114285984,0.000028354789,0.00012908908,0.000045319124,0.000006187337,0.00007381301,0.7839655,0.21531968,0.000010756835,0.00003297665,0.00010394555],"about_ca_topic_score_codex":0.0000037089965,"about_ca_topic_score_gemma":0.000008736297,"teacher_disagreement_score":0.9699185,"about_ca_system_score_codex":0.000020035342,"about_ca_system_score_gemma":0.000013055827,"threshold_uncertainty_score":0.38775128},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018979729,0.00013857534,0.99608135,0.000017974608,0.00038390892,0.0006158168,0.000028492514,0.0006033432,0.00023254952],"genre_scores_gemma":[0.96370685,0.000017989472,0.03562772,0.000036156052,0.00008126801,0.0002404164,0.000010821472,0.00010348705,0.00017530074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989086,0.000021113598,0.0003807029,0.00028963198,0.00011416778,0.0002858135],"domain_scores_gemma":[0.99937683,0.000045603498,0.00008347489,0.00016207465,0.0002405744,0.000091439484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000117547585,0.00024401075,0.0001941098,0.0001636912,0.000324311,0.000048423943,0.000093402276,0.00014369088,0.000045960296],"category_scores_gemma":[0.00000379853,0.00026271088,0.000078515506,0.00036305966,0.00003724148,0.00069398026,5.363253e-7,0.00015776188,0.000030698633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073828814,0.000113558075,0.0000020786115,0.00035864583,0.000041467087,0.000022178343,0.0023037633,0.947376,0.009717897,0.000014521364,0.000024539182,0.03995151],"study_design_scores_gemma":[0.0007111046,0.000059360085,0.000003292872,0.00016399025,0.000050082028,0.00014646741,0.00055577204,0.92335117,0.074545845,0.00005237056,0.0000558511,0.00030469018],"about_ca_topic_score_codex":0.000024327019,"about_ca_topic_score_gemma":0.0000836354,"teacher_disagreement_score":0.96180886,"about_ca_system_score_codex":0.00009378311,"about_ca_system_score_gemma":0.000026739737,"threshold_uncertainty_score":0.99998254},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013093426,0.000044994944,0.99675524,0.0001671876,0.00026574655,0.00017429364,0.000015279245,0.00051309715,0.00075483246],"genre_scores_gemma":[0.7134785,0.0000014007718,0.2860762,0.0002532898,0.00004079446,0.000019222172,0.0000043197597,0.000017610657,0.00010866945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982083,0.000079079524,0.0003272089,0.00051004195,0.000534101,0.0003413075],"domain_scores_gemma":[0.998936,0.0000823552,0.00011954574,0.0003502234,0.00028424498,0.00022763993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032620056,0.00022843061,0.00020140951,0.00016202146,0.00045000738,0.00029897364,0.0005122645,0.00011222321,0.00002007972],"category_scores_gemma":[0.0000075685193,0.00020425096,0.000076362325,0.0004537377,0.00007917291,0.0011388683,0.0000057818656,0.00036846963,0.00010142276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006250054,0.00011605936,0.0000016980756,0.0000089842,0.000008339655,0.0000043524215,0.000656034,0.76917344,0.0012718808,0.00016011314,0.00038993597,0.22814667],"study_design_scores_gemma":[0.0006744289,0.00012811123,0.000009210931,0.00006913815,0.000015721049,0.000022351216,0.00006950675,0.9913012,0.00634786,0.0009766757,0.00012096439,0.00026487204],"about_ca_topic_score_codex":0.000021884038,"about_ca_topic_score_gemma":0.0000071605837,"teacher_disagreement_score":0.7121692,"about_ca_system_score_codex":0.0000942646,"about_ca_system_score_gemma":0.00020527067,"threshold_uncertainty_score":0.83291125},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006726009,0.000012262294,0.99045324,0.000035140165,0.000030038831,0.00048509953,0.000020985317,0.0003064869,0.0019307516],"genre_scores_gemma":[0.92794,9.581631e-7,0.07109498,0.00005822355,0.0000738515,0.0007692938,0.000010719722,0.000045671066,0.000006296691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881685,0.000040645285,0.0002994007,0.00036212942,0.0001626284,0.0003183228],"domain_scores_gemma":[0.99937177,0.00016584585,0.00004571637,0.00018561038,0.00010188574,0.00012915865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016285731,0.00020999457,0.00019943339,0.00017799645,0.00026749345,0.000089574605,0.0001568613,0.000060912025,0.0000042307875],"category_scores_gemma":[0.00000996034,0.00022437845,0.000046930254,0.0015518417,0.000041589763,0.00019115071,8.3661547e-7,0.00030260885,0.000024219955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057801403,0.00012222154,0.000035604164,0.00008440743,0.0000054142843,1.0789802e-7,0.00019972606,0.5906931,0.14923185,0.000058999703,0.0000041790804,0.25955862],"study_design_scores_gemma":[0.00035820165,0.00003817264,0.001298884,0.00017712853,0.000037525897,0.0000076572915,0.00021076233,0.94218373,0.052680843,0.002258419,0.00028802763,0.00046066358],"about_ca_topic_score_codex":0.000017053468,"about_ca_topic_score_gemma":0.0000044190933,"teacher_disagreement_score":0.921214,"about_ca_system_score_codex":0.00014262793,"about_ca_system_score_gemma":0.000027484002,"threshold_uncertainty_score":0.91498876},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004497466,0.00059230917,0.9935942,0.0003316,0.0002822424,0.0003725379,0.0000018924225,0.00022045821,0.0001072658],"genre_scores_gemma":[0.9563708,0.000082737126,0.042916562,0.00025588775,0.00013952254,0.00013026722,0.0000060931975,0.000023678725,0.00007447722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986778,0.00010219959,0.000329596,0.0003157183,0.00020080364,0.0003739084],"domain_scores_gemma":[0.999032,0.00023284968,0.00014778218,0.00027742863,0.00016461399,0.00014533111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006337885,0.00019967768,0.00018203059,0.00018999657,0.0010916225,0.0002962451,0.0002881073,0.00010049119,0.000009397279],"category_scores_gemma":[0.0000074814657,0.00019869253,0.00006846195,0.00048087395,0.000046416055,0.001624371,0.000007630723,0.00031107818,0.000007753441],"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.00002842834,0.00006359086,0.000009377879,0.000017373086,0.000012312031,9.345975e-8,0.00092089747,0.44674253,0.00045101775,0.00055267796,0.000014872365,0.55118686],"study_design_scores_gemma":[0.00067907653,0.00005797002,0.00012291336,0.00011115274,0.000023908906,0.000009784379,0.000028781482,0.9964669,0.0017529625,0.00032994762,0.00018194868,0.00023470372],"about_ca_topic_score_codex":0.000002741474,"about_ca_topic_score_gemma":0.000006576243,"teacher_disagreement_score":0.9518733,"about_ca_system_score_codex":0.00007693756,"about_ca_system_score_gemma":0.00003865249,"threshold_uncertainty_score":0.83959883},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11065384,0.000046346955,0.8884119,0.00018115407,0.000037415386,0.00051641435,0.000009408013,0.0000463332,0.00009723157],"genre_scores_gemma":[0.77498984,0.0000068897807,0.22447905,0.00019853437,0.000053345557,0.00020488794,0.000017587881,0.000020991281,0.000028860302],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991672,0.0000170997,0.00022042454,0.00030418026,0.00007936455,0.00021171966],"domain_scores_gemma":[0.99962103,0.000014446974,0.00006548568,0.00013857459,0.00011099494,0.00004948055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000068109446,0.00013774852,0.00010425318,0.0000413881,0.00016239124,0.000049139806,0.00007966314,0.00010958735,0.000007476757],"category_scores_gemma":[0.0000052509718,0.00013959206,0.0000637975,0.00012739254,0.000042082625,0.000015611478,0.0000010242587,0.00008773493,0.0000049671285],"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.000019608153,0.00005585353,0.0000012691287,0.000017548675,0.000004747137,3.475033e-7,0.000019355659,0.023956947,0.8907725,0.00001460481,0.000032713284,0.08510451],"study_design_scores_gemma":[0.00027018125,0.00010487407,0.0000031963048,0.000048393147,0.0000070289548,0.0000053404005,0.000030266525,0.17461967,0.82393354,0.00047178156,0.00035289893,0.0001528018],"about_ca_topic_score_codex":0.000007473086,"about_ca_topic_score_gemma":0.000005570732,"teacher_disagreement_score":0.664336,"about_ca_system_score_codex":0.000024296975,"about_ca_system_score_gemma":0.0000460312,"threshold_uncertainty_score":0.56923985},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016860802,0.00067813374,0.98146456,0.00042341146,0.00015134156,0.00027941703,0.0000011605599,0.00009770348,0.000043488017],"genre_scores_gemma":[0.99295247,0.00035613385,0.0062676203,0.00020209668,0.000036656435,0.00008831639,0.0000037094353,0.00001559105,0.00007742765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998975,0.00010666331,0.00027279655,0.00024052041,0.00012490188,0.00028013292],"domain_scores_gemma":[0.99935895,0.00013834599,0.00010456859,0.00017949795,0.00013411167,0.00008450762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045420715,0.0001383998,0.00014132394,0.0001455373,0.00040980498,0.00016734978,0.00021660278,0.00006741434,0.00000334975],"category_scores_gemma":[0.0000028551292,0.00014115917,0.00003193829,0.0006718278,0.000039023453,0.0010198485,0.0000044601406,0.00019921474,0.0000025881493],"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.000044068598,0.00019499553,0.00007186414,0.000040505387,0.0000103187895,2.4138487e-7,0.001965819,0.0851742,0.0021565876,0.00046097016,0.000018262015,0.90986216],"study_design_scores_gemma":[0.00049280544,0.000048641657,0.0011394019,0.00016065106,0.000007866518,0.000005369222,0.000057166682,0.994029,0.00368977,0.00008802167,0.00009949785,0.00018182033],"about_ca_topic_score_codex":0.0000040241334,"about_ca_topic_score_gemma":0.000049895487,"teacher_disagreement_score":0.9760916,"about_ca_system_score_codex":0.00006891626,"about_ca_system_score_gemma":0.000045883047,"threshold_uncertainty_score":0.57563037},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010070973,0.00017923868,0.9884805,0.0002104133,0.00005374602,0.00037098437,0.0000014181678,0.00009366064,0.0005390585],"genre_scores_gemma":[0.8923219,0.000036363745,0.10735048,0.00013425652,0.000009396474,0.00006855164,3.4539548e-7,0.000013492485,0.00006522119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987222,0.00014364891,0.00032895667,0.00031471462,0.00026124882,0.00022925805],"domain_scores_gemma":[0.99880475,0.00021056291,0.00018733705,0.00030662477,0.00040071196,0.00009003077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020078447,0.00018925013,0.00022034471,0.00018919751,0.00046863942,0.00020494698,0.00042606838,0.00005742958,0.00013900231],"category_scores_gemma":[0.0000041752874,0.00015247033,0.000054122775,0.0006211943,0.00017782701,0.00090267183,0.0000057893553,0.00027450203,0.00003114441],"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.000057430872,0.00041052856,0.00003899701,0.000061672894,0.00009953498,0.0000066855564,0.00652942,0.18375222,0.27124858,0.00025531923,0.00014756306,0.5373921],"study_design_scores_gemma":[0.000752086,0.00031931553,0.00020053891,0.00045174622,0.000017641569,0.000023838671,0.00038276968,0.77489644,0.22253716,0.00006789859,0.000019985706,0.0003305919],"about_ca_topic_score_codex":0.000008223144,"about_ca_topic_score_gemma":0.0000047912395,"teacher_disagreement_score":0.8822509,"about_ca_system_score_codex":0.000046151104,"about_ca_system_score_gemma":0.00019144414,"threshold_uncertainty_score":0.62175596},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034748692,0.00012389112,0.96368396,0.0007554,0.00010891066,0.0002895453,0.000006272303,0.00020167262,0.000081666854],"genre_scores_gemma":[0.7831961,5.9563115e-7,0.21611334,0.0005791911,0.000033319913,0.000037831353,3.6040015e-7,0.000017419214,0.000021844282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862456,0.000044021013,0.00025026023,0.0004437416,0.00027747347,0.00035995914],"domain_scores_gemma":[0.9993691,0.00018652348,0.0000617503,0.00016828185,0.00009410779,0.000120247925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004204965,0.00021168872,0.00019816172,0.00023464189,0.0006085885,0.00025898387,0.00027604445,0.00007994669,0.0000039060674],"category_scores_gemma":[0.0000051987718,0.0001772595,0.000118927754,0.00036034887,0.00009266933,0.00007750609,0.0000010944069,0.00024282305,0.0000029766632],"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.00009671701,0.00012792273,2.9658034e-7,0.00009675446,0.000008995856,0.0000062926347,0.000953765,0.44192904,0.010784001,0.0000705091,0.0000010828559,0.5459246],"study_design_scores_gemma":[0.0023407585,0.00037623922,0.00001680099,0.00019749468,0.000028244825,0.000036956193,0.00002555888,0.60512197,0.38697484,0.0045161173,0.000056523764,0.00030849857],"about_ca_topic_score_codex":0.000009102811,"about_ca_topic_score_gemma":0.000003919889,"teacher_disagreement_score":0.7484474,"about_ca_system_score_codex":0.000049262773,"about_ca_system_score_gemma":0.00020026184,"threshold_uncertainty_score":0.7228433},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053439554,0.00023971808,0.94418633,0.00009535011,0.00007297337,0.00044877818,0.000043653992,0.0013028751,0.00017073838],"genre_scores_gemma":[0.9250005,0.00005194525,0.074455544,0.00007700451,0.00004377335,0.00022162808,0.000032867618,0.00008898672,0.000027754959],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870807,0.000041567422,0.00044104425,0.00031685675,0.00020634534,0.00028614138],"domain_scores_gemma":[0.99900717,0.00032581462,0.00010953021,0.00032198377,0.00013280583,0.000102682556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019104141,0.00029462436,0.00030622346,0.0002102509,0.0003688665,0.00012465927,0.0002149772,0.00019299435,0.000035444755],"category_scores_gemma":[0.000009413921,0.00031515746,0.00008164379,0.00025707163,0.00007991757,0.00063361594,0.0000021034382,0.0003305056,0.00000933496],"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.000049356408,0.000044699595,0.0000022274144,0.00013777179,0.00002839578,2.196287e-7,0.00034880397,0.34120408,0.05954254,0.000022217959,0.000020175128,0.59859955],"study_design_scores_gemma":[0.00042236896,0.000068089095,0.000033212797,0.00018839692,0.000035327397,0.0000015144701,0.000031683674,0.6366799,0.3572637,0.0048287017,0.00019902983,0.00024810553],"about_ca_topic_score_codex":0.000016030981,"about_ca_topic_score_gemma":0.00001446357,"teacher_disagreement_score":0.87156093,"about_ca_system_score_codex":0.000106414846,"about_ca_system_score_gemma":0.000023929482,"threshold_uncertainty_score":0.99993},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04606442,0.000055697103,0.9521737,0.00006224342,0.00006476401,0.0005183337,0.000032744363,0.0007633559,0.0002647478],"genre_scores_gemma":[0.9196096,0.000008224151,0.079327315,0.000029599198,0.000025838675,0.00044920508,0.0000031991856,0.00008115444,0.00046584933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989536,0.000015399424,0.0002554167,0.0002589017,0.00013655038,0.00038012656],"domain_scores_gemma":[0.99959713,0.00009401762,0.000036554287,0.00013714333,0.000054162912,0.00008100163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008190358,0.00024050598,0.00021755516,0.00020469354,0.000108967666,0.000075332704,0.0001538966,0.00007843169,0.00013844417],"category_scores_gemma":[0.0000024554304,0.0002503915,0.000074899544,0.0002134741,0.000055839642,0.00070359703,0.0000012354027,0.0002833702,0.000043767108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033687866,0.000029226112,8.1731315e-7,0.00011080551,0.000012848606,0.0000022103172,0.00027208857,0.81190157,0.11782032,9.795185e-7,0.00014253458,0.069672905],"study_design_scores_gemma":[0.00036884853,0.00011578067,0.000028475793,0.00023172252,0.000009948093,0.000004210666,0.000092966824,0.62411314,0.3741104,0.00035954904,0.00020793368,0.00035701692],"about_ca_topic_score_codex":0.000013352333,"about_ca_topic_score_gemma":0.000005424095,"teacher_disagreement_score":0.87354517,"about_ca_system_score_codex":0.00015627968,"about_ca_system_score_gemma":0.000022760778,"threshold_uncertainty_score":0.9999948},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010893156,0.00002160253,0.98815733,0.00016810317,0.000034345398,0.00016581197,0.0000051330285,0.00038740822,0.00016707924],"genre_scores_gemma":[0.5739613,0.0000015742827,0.42594305,0.00002887596,0.0000043497757,0.000019631045,5.8544254e-7,0.000007821156,0.000032776195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887073,0.000055659377,0.00026066072,0.00035576322,0.00028763217,0.00016956218],"domain_scores_gemma":[0.99884367,0.0002878437,0.00019552883,0.00024157487,0.00030131347,0.0001300588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032509328,0.00016532696,0.00023835839,0.00036213713,0.00017328134,0.00021131613,0.0002243653,0.00006617189,0.000008368012],"category_scores_gemma":[0.000030168165,0.00014729524,0.00005870955,0.001568596,0.000087495944,0.00087254884,0.0000029375688,0.00015192069,0.0000018003094],"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.00011441511,0.0002317516,0.00015946505,0.00011742047,0.00018038422,0.0000029375628,0.002197354,0.0959572,0.007930048,0.00012648135,0.000009322899,0.89297324],"study_design_scores_gemma":[0.0003085707,0.0002396622,0.00017891584,0.000054358894,0.00015389863,0.000009415297,0.00006216189,0.8354387,0.16201468,0.0013440602,0.0000115874245,0.00018394688],"about_ca_topic_score_codex":0.00024327585,"about_ca_topic_score_gemma":0.00013501439,"teacher_disagreement_score":0.8927893,"about_ca_system_score_codex":0.00006414889,"about_ca_system_score_gemma":0.00015952406,"threshold_uncertainty_score":0.6006526},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042647995,0.00015654531,0.955129,0.000027517564,0.00008695745,0.00024825733,0.000008877934,0.0011298994,0.0005649241],"genre_scores_gemma":[0.9711556,0.00003284813,0.028514724,0.000040307055,0.00004767286,0.00005355185,0.000010356375,0.00010340568,0.00004157112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983926,0.00007082894,0.0005922865,0.0002765498,0.00032162818,0.0003461365],"domain_scores_gemma":[0.999012,0.00020070346,0.00017097406,0.00036591792,0.00014932839,0.00010105777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030338546,0.0003036296,0.00037086385,0.00038558597,0.0002521031,0.0000796351,0.00029648826,0.0001922264,0.00012711892],"category_scores_gemma":[0.000009668339,0.00034043015,0.000114290735,0.00058465416,0.00006923092,0.0007510671,0.000003427398,0.00044938797,0.000035448502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014219643,0.000031444197,8.6563205e-7,0.000118211174,0.000020832296,3.5839835e-7,0.00020345298,0.58271587,0.17287004,0.0000036918398,0.0000071678787,0.24401388],"study_design_scores_gemma":[0.00020092748,0.000047843423,0.0000031182249,0.00033781808,0.000023022867,0.0000025526633,0.0000072055027,0.5597253,0.438287,0.0011393357,0.00003279736,0.00019310818],"about_ca_topic_score_codex":0.00000714007,"about_ca_topic_score_gemma":8.735824e-7,"teacher_disagreement_score":0.92850757,"about_ca_system_score_codex":0.000110716275,"about_ca_system_score_gemma":0.000031253483,"threshold_uncertainty_score":0.99990475},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1055217,0.00025992907,0.88986874,0.000037746122,0.000344501,0.00032789205,0.0000074292507,0.0014596253,0.002172435],"genre_scores_gemma":[0.99900293,0.0000100987045,0.0005455991,0.000060541202,0.00017583914,0.000052502448,0.0000020026353,0.000064087566,0.00008640075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988603,0.000037212118,0.000261311,0.0002487344,0.00025294124,0.00033952066],"domain_scores_gemma":[0.9995772,0.000024898358,0.00004270717,0.00014266073,0.00012019852,0.00009231256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00005045928,0.0002671431,0.0002538456,0.00017525074,0.00039559504,0.00030796454,0.00018415069,0.0001729602,0.00010906662],"category_scores_gemma":[6.413202e-7,0.00026166937,0.000084773215,0.0003157345,0.000047379166,0.00041730623,0.0000013872483,0.00040323683,0.000053224525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003267337,0.0001687033,0.00005660548,0.00028338633,0.00024859386,0.0000315433,0.001904363,0.39666405,0.27958775,0.00015373508,0.004188837,0.31667975],"study_design_scores_gemma":[0.0006208603,0.000108846645,0.00022793327,0.00028671758,0.000112565176,0.000063808715,0.0005347304,0.66385007,0.3317508,0.0007826041,0.00066607277,0.0009949679],"about_ca_topic_score_codex":0.000039811326,"about_ca_topic_score_gemma":0.000003732187,"teacher_disagreement_score":0.89348125,"about_ca_system_score_codex":0.00008618924,"about_ca_system_score_gemma":0.000031301865,"threshold_uncertainty_score":0.99998355},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020116167,0.00002294474,0.9939131,0.00013147059,0.000063682615,0.00014179263,0.000018243374,0.0017606077,0.001936536],"genre_scores_gemma":[0.99432474,0.000046949575,0.0052070157,0.00018339766,0.000035957375,0.00008569524,0.000011894385,0.000068563815,0.000035775593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989241,0.00005770885,0.00028500464,0.00022676562,0.00023126217,0.0002752112],"domain_scores_gemma":[0.99902594,0.00039480388,0.00006239111,0.0003494218,0.00007580157,0.00009164303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017972864,0.00023419145,0.00021918557,0.00019990897,0.00035903443,0.00007442076,0.00025336118,0.00013996892,0.000039409646],"category_scores_gemma":[0.0000091563925,0.00025010144,0.000078238845,0.0003273651,0.000046996116,0.00020355819,0.0000012410812,0.00049642357,0.00001696651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036118934,0.00006105314,0.0000027569663,0.00008644859,0.000009084453,5.832785e-7,0.00009085127,0.82749,0.0114584,0.000027675891,0.00007004105,0.16066702],"study_design_scores_gemma":[0.00019149334,0.00008456845,0.000006326203,0.0002572716,0.000012961949,0.0000013368289,0.0000405641,0.6830298,0.31559154,0.00019533628,0.00038118902,0.00020765998],"about_ca_topic_score_codex":0.000010747758,"about_ca_topic_score_gemma":0.000008663738,"teacher_disagreement_score":0.99231315,"about_ca_system_score_codex":0.000119398996,"about_ca_system_score_gemma":0.00002116076,"threshold_uncertainty_score":0.9999951},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.409591,0.00006649883,0.5899829,0.00008166371,0.00006459784,0.00013174817,0.0000026055347,0.000043416137,0.00003554486],"genre_scores_gemma":[0.9490987,0.0000035061512,0.050688207,0.00014203446,0.000022339356,0.0000160773,7.4176035e-7,0.000013548879,0.000014820975],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99860936,0.00003300814,0.0003511063,0.00035619878,0.00032854342,0.0003217968],"domain_scores_gemma":[0.99935436,0.000048329548,0.00019462468,0.00012929468,0.00015108028,0.00012233044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015184234,0.0001863154,0.00019018614,0.00024623558,0.0004081726,0.0002582197,0.00020865918,0.000057168945,0.00007228526],"category_scores_gemma":[0.0000011958606,0.00017482573,0.0000598204,0.00050793955,0.00009819166,0.00068134174,0.0000037602717,0.0001628089,0.0000048712227],"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.000014784283,0.00010742163,0.00023476826,0.00015203786,0.00002734976,0.0000019153006,0.0018309798,0.056204688,0.24654272,0.00000549969,0.000011232451,0.6948666],"study_design_scores_gemma":[0.0007437865,0.00014323826,0.00057094893,0.0002274231,0.000034636112,0.000062881,0.001333497,0.32735145,0.6690604,0.00017291293,0.000008705898,0.0002900788],"about_ca_topic_score_codex":0.00010447849,"about_ca_topic_score_gemma":0.0000068959694,"teacher_disagreement_score":0.6945765,"about_ca_system_score_codex":0.000057785626,"about_ca_system_score_gemma":0.00017776231,"threshold_uncertainty_score":0.7129187},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11178406,0.0010992929,0.8865778,0.000008993363,0.000055199154,0.00016171254,0.000006961277,0.00020466954,0.0001013168],"genre_scores_gemma":[0.9951894,0.00008963017,0.004604199,0.0000052176815,0.000012746517,0.000066058594,0.0000012338757,0.000025378518,0.0000061035626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999355,0.000023006112,0.0002815048,0.000082902065,0.00010704431,0.00015052085],"domain_scores_gemma":[0.99969345,0.000035193032,0.000057249435,0.00012553037,0.000033142605,0.000055428445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014796075,0.0001113304,0.00016556573,0.00021620958,0.00006016227,0.00001697803,0.000058505953,0.00006425545,0.000003965218],"category_scores_gemma":[0.0000018983511,0.00011802898,0.000021352671,0.00021416231,0.00003897672,0.00048216918,7.846037e-7,0.00016718125,0.000001847791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001714411,0.0001534473,0.0000057160582,0.00042990674,0.000008333458,2.8408084e-7,0.00095977023,0.7887148,0.06699778,0.000028746015,0.0000038474764,0.14268018],"study_design_scores_gemma":[0.00030436701,0.000028696853,0.000024363944,0.00031136948,0.000008927263,0.0000059511776,0.00013888297,0.75749534,0.24150003,0.000049031907,0.00001830954,0.00011469429],"about_ca_topic_score_codex":0.000008460993,"about_ca_topic_score_gemma":0.0000014155987,"teacher_disagreement_score":0.8834054,"about_ca_system_score_codex":0.00006657439,"about_ca_system_score_gemma":0.000010843556,"threshold_uncertainty_score":0.4813082},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013675406,0.00006224289,0.99622697,0.00020251659,0.0005175084,0.00028608742,0.000022418533,0.00064502703,0.0006696809],"genre_scores_gemma":[0.9153949,0.0000050629124,0.08390394,0.00032721038,0.00014681005,0.00007377669,0.0000029500445,0.0000358524,0.00010951574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979467,0.00012285319,0.0004087791,0.0006571437,0.00036476724,0.00049976545],"domain_scores_gemma":[0.9986561,0.00045240746,0.00014361902,0.00041640233,0.00015148999,0.00017998538],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005789197,0.00028639653,0.00029619475,0.00021542901,0.00070921,0.0003305938,0.0006041138,0.00016626538,0.000031298357],"category_scores_gemma":[0.000007916082,0.0002681189,0.00019431717,0.0003862982,0.00010687666,0.0010401737,0.000002291804,0.00040018157,0.000019843294],"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.00004648921,0.000110080065,4.3061013e-7,0.00007829744,0.00002043265,0.000002697902,0.00039709252,0.17661965,0.0024396724,0.00066595577,0.00008541571,0.81953377],"study_design_scores_gemma":[0.0007116052,0.0003329684,0.0000054215993,0.0001415403,0.00003770124,0.000047027537,0.000036249214,0.97261363,0.018622585,0.006482004,0.0006360227,0.0003332295],"about_ca_topic_score_codex":0.0000071366308,"about_ca_topic_score_gemma":0.000011247537,"teacher_disagreement_score":0.91402733,"about_ca_system_score_codex":0.000053663753,"about_ca_system_score_gemma":0.00012284257,"threshold_uncertainty_score":0.9999771},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3816398,0.00022131803,0.61755073,0.000013541254,0.00007898979,0.00008564913,0.000011565459,0.00009312921,0.0003052917],"genre_scores_gemma":[0.9976926,0.000031575066,0.0021408494,0.000014508663,0.00002050531,0.00003198625,0.000007794088,0.000025528812,0.000034676887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99921787,0.000031139738,0.00024704201,0.00010284583,0.00015489642,0.00024620557],"domain_scores_gemma":[0.99957573,0.00004646053,0.0000423593,0.00015797289,0.00010352757,0.000073942814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001464152,0.00014418025,0.00016330919,0.00013469486,0.00017782615,0.000027165881,0.00010739372,0.000047994094,0.00014992809],"category_scores_gemma":[6.377237e-7,0.00010965266,0.00004637352,0.00022632506,0.00007135316,0.00040409403,8.2309936e-7,0.00019483178,0.000022622717],"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.00022462476,0.00071146636,0.00013292576,0.0004008216,0.00013698547,0.0000018791543,0.011195179,0.5012327,0.46824926,0.00009362267,0.000026825624,0.017593736],"study_design_scores_gemma":[0.0004738004,0.00009326306,0.00008385452,0.00025739026,0.000053133284,0.000010829748,0.000500601,0.13261338,0.8654826,0.000011831237,0.00020336128,0.00021594517],"about_ca_topic_score_codex":0.000005079881,"about_ca_topic_score_gemma":0.000003423566,"teacher_disagreement_score":0.61605275,"about_ca_system_score_codex":0.000041263214,"about_ca_system_score_gemma":0.000021101305,"threshold_uncertainty_score":0.4471506},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055409033,0.0000144293745,0.9437041,0.00019322871,0.0000908677,0.00021723525,0.000004742407,0.00033635515,0.000029957011],"genre_scores_gemma":[0.9667189,0.00003910266,0.032889534,0.00020658372,0.0000321017,0.000028845116,0.000002591598,0.000010668348,0.00007163231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991548,0.00002315368,0.00015453485,0.00033485776,0.00009928698,0.00023333194],"domain_scores_gemma":[0.9996078,0.000035792735,0.00008077641,0.00013327705,0.00008148207,0.00006088838],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0001419675,0.00014323024,0.00012611516,0.00015637132,0.0023653584,0.000121670746,0.00024675427,0.00006950752,0.000002074532],"category_scores_gemma":[7.1592154e-7,0.00013504433,0.00005936898,0.00024840498,0.00004687076,0.001167505,0.000017740442,0.00012518994,3.8124858e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013580805,0.00010282398,0.00024364973,0.00008352571,0.00002014352,0.000005065957,0.0019759904,0.0011028883,0.047204506,0.00004286371,0.0000035125063,0.9490792],"study_design_scores_gemma":[0.0010388119,0.00035661543,0.0010354242,0.00025861507,0.00004983017,0.00007204274,0.000035205652,0.83030164,0.16202585,0.002152674,0.0020028104,0.0006704765],"about_ca_topic_score_codex":0.0000028736779,"about_ca_topic_score_gemma":0.0000018222964,"teacher_disagreement_score":0.9484087,"about_ca_system_score_codex":0.000025601355,"about_ca_system_score_gemma":0.000013359935,"threshold_uncertainty_score":0.99893343},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030583995,0.000070855975,0.9948991,0.000052032374,0.00009725965,0.0013421417,0.000098787605,0.00027266008,0.00010877238],"genre_scores_gemma":[0.61078924,2.4483214e-7,0.38860694,0.000042657426,0.00016298257,0.00029053388,0.0000067228307,0.000073146715,0.00002752147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864465,0.00000857881,0.00028003604,0.00040189814,0.00024424682,0.00042057878],"domain_scores_gemma":[0.9989313,0.000155398,0.0000821302,0.00014178787,0.00043260556,0.00025678478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001642082,0.00029629006,0.00022874633,0.000173416,0.00036222208,0.0001671144,0.00013420693,0.00007962834,0.000004058833],"category_scores_gemma":[0.00001152054,0.000289113,0.00006999803,0.00042875495,0.000027479558,0.0003723696,6.465192e-7,0.0002740387,0.000002335063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006310765,0.000019729661,0.0000016841452,0.00006413728,0.000018277173,1.8365567e-7,0.00032448221,0.63117635,0.28688896,0.000006117547,0.000011824044,0.08142517],"study_design_scores_gemma":[0.00093195867,0.000085482105,6.832818e-7,0.00016482853,0.00013166892,0.00001706928,0.00020586199,0.8294856,0.1674723,0.001149559,0.000024083072,0.0003308845],"about_ca_topic_score_codex":0.000027987522,"about_ca_topic_score_gemma":0.000033010245,"teacher_disagreement_score":0.60773087,"about_ca_system_score_codex":0.00026171122,"about_ca_system_score_gemma":0.00045176447,"threshold_uncertainty_score":0.99995613},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023507861,0.00006644481,0.9756345,0.00007727387,0.000044684846,0.00016434432,0.00000160121,0.00007722363,0.0004260722],"genre_scores_gemma":[0.9160997,0.000004360057,0.08376601,0.000088443165,0.000004555634,0.000023044813,8.0809336e-8,0.000005658254,0.000008125466],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99911624,0.00003701944,0.00030328537,0.00019742764,0.0002485115,0.00009751494],"domain_scores_gemma":[0.9991242,0.00019705099,0.00024592757,0.00022155808,0.00018079093,0.000030468926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002321436,0.00009427876,0.00014157472,0.00010170923,0.00015968582,0.00002956027,0.00031069104,0.00005957075,0.000012028207],"category_scores_gemma":[0.0000046452446,0.00007500058,0.000049494312,0.00043954924,0.00015266694,0.0001518447,0.0000047878366,0.00012578943,8.750551e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020548021,0.00017798226,0.000013228705,0.00009106645,0.000014343704,1.7740108e-7,0.0032942276,0.0062155705,0.010696595,0.00077161094,0.0000037215448,0.97870094],"study_design_scores_gemma":[0.00006973361,0.00016526441,0.00009269075,0.000071997885,0.000015362315,0.00000486172,0.00018366624,0.4270816,0.5712388,0.001006543,0.000006872079,0.000062575025],"about_ca_topic_score_codex":0.00017958821,"about_ca_topic_score_gemma":0.000006657792,"teacher_disagreement_score":0.97863835,"about_ca_system_score_codex":0.0000105913905,"about_ca_system_score_gemma":0.000060367096,"threshold_uncertainty_score":0.30584347},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018311753,0.00002473914,0.9984861,0.00008572646,0.00027845797,0.0006561752,0.000025370335,0.00020222057,0.00005808459],"genre_scores_gemma":[0.41095382,6.517206e-7,0.58867,0.00020227194,0.000056030956,0.000050294057,0.0000051232705,0.000019156021,0.000042633255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844825,0.000113334034,0.00038832944,0.00035271863,0.00022523098,0.00047212394],"domain_scores_gemma":[0.9990721,0.00022086417,0.00017348393,0.00017744211,0.0001783109,0.0001778014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005846678,0.00022604958,0.00019397095,0.00021940262,0.0004333331,0.00042238383,0.0002677448,0.000079403195,0.000031622127],"category_scores_gemma":[0.0000071377785,0.00022651085,0.000110409455,0.00046817109,0.000042116142,0.0031652208,0.0000023722373,0.00012853584,0.0000038647454],"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.00015005315,0.00035152637,6.2712337e-7,0.00005301101,0.000038206344,8.3025236e-7,0.0009976091,0.32040188,0.088244684,0.00006311809,0.000025367008,0.5896731],"study_design_scores_gemma":[0.0012912339,0.00033648201,3.5130643e-7,0.000037093192,0.000041873544,0.000020890415,0.00006616578,0.83675176,0.16109478,0.000090752364,0.00004315595,0.00022545258],"about_ca_topic_score_codex":0.000007186991,"about_ca_topic_score_gemma":3.972414e-7,"teacher_disagreement_score":0.5894476,"about_ca_system_score_codex":0.000093109935,"about_ca_system_score_gemma":0.00018978675,"threshold_uncertainty_score":0.9236844},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01757589,0.0011138464,0.9789893,0.00033137627,0.000226559,0.00011002633,5.719065e-7,0.00013238112,0.0015200514],"genre_scores_gemma":[0.98043394,0.0004658293,0.018384,0.00045854773,0.000118526536,0.00003709973,6.826696e-7,0.0000116885,0.0000896691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988119,0.00009013307,0.00026386467,0.00022474855,0.00021304532,0.0003963217],"domain_scores_gemma":[0.9994366,0.00014741081,0.000064031185,0.00018079791,0.000055600143,0.00011553126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005768577,0.00015278737,0.0001490665,0.00016243331,0.0006043694,0.000119182856,0.00028844396,0.000068894406,0.00002307954],"category_scores_gemma":[0.0000025224485,0.00014974758,0.000037876194,0.00074209087,0.000053030857,0.0015424904,0.0000067057435,0.0004045918,0.000015243782],"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.00001968699,0.0001216028,0.00045370977,0.00001853573,0.00000974209,5.414752e-7,0.0014798929,0.030655194,0.00041096422,0.00049331,0.000029373832,0.96630746],"study_design_scores_gemma":[0.0007170779,0.00013193545,0.0031621987,0.0004170572,0.000020128564,0.00011072983,0.00015020017,0.97666734,0.005168015,0.00013754699,0.012730411,0.0005873771],"about_ca_topic_score_codex":0.0000026969594,"about_ca_topic_score_gemma":0.000008078434,"teacher_disagreement_score":0.96572006,"about_ca_system_score_codex":0.000082793274,"about_ca_system_score_gemma":0.00006040027,"threshold_uncertainty_score":0.6106529},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009407636,0.00008132959,0.98795664,0.000046338202,0.00038706293,0.00100247,0.000023233486,0.000473901,0.0006214016],"genre_scores_gemma":[0.98997307,0.0000067637197,0.0090379305,0.000061356746,0.000078460755,0.00046940602,0.000010274704,0.00011172335,0.00025100328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987005,0.00002389494,0.00033349005,0.00035828177,0.00020016801,0.00038365234],"domain_scores_gemma":[0.99930435,0.00014224586,0.0000900537,0.00015110389,0.00019919008,0.00011304813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000096898555,0.00031733312,0.0002520384,0.00022453033,0.00030503026,0.00017204508,0.00010497661,0.00013558075,0.00023008932],"category_scores_gemma":[0.000005243045,0.00029023754,0.000075757205,0.00024230499,0.000071269395,0.0008478925,4.900066e-7,0.00025307637,0.000054886328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009031276,0.00008765281,0.0000016998466,0.00022612054,0.000053677373,0.0000013126049,0.0009282286,0.9005058,0.039341617,0.000032565003,0.00003721156,0.058693815],"study_design_scores_gemma":[0.001428062,0.00055756303,0.000010772954,0.0009821855,0.000058233138,0.000039878956,0.000642629,0.95700264,0.03833017,0.00021664539,0.000084060324,0.0006471676],"about_ca_topic_score_codex":0.0000043787654,"about_ca_topic_score_gemma":0.0000036683803,"teacher_disagreement_score":0.9805654,"about_ca_system_score_codex":0.00018118824,"about_ca_system_score_gemma":0.000030815092,"threshold_uncertainty_score":0.999955},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002079878,0.00007333272,0.9893665,0.0000049729274,0.00029275898,0.00024166002,0.000021656131,0.0025990806,0.00532016],"genre_scores_gemma":[0.78486896,0.00001800323,0.21462229,0.0000204618,0.000099288016,0.00010268507,0.0000018559422,0.0001068123,0.00015962594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857587,0.000034027526,0.0003304327,0.00039994734,0.00020996449,0.00044976364],"domain_scores_gemma":[0.99948025,0.000033863165,0.00006485242,0.00021436912,0.00009113422,0.000115543735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014518868,0.0003725802,0.0002520487,0.00032826033,0.00026838345,0.000058715574,0.0002147768,0.00016012965,0.00032480241],"category_scores_gemma":[0.0000014063826,0.00040699332,0.00010959442,0.00044760693,0.00008005858,0.00080090197,0.0000023797597,0.0005650376,0.000044544267],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083398736,0.00008865005,0.0000016039771,0.00012192017,0.00006022228,0.00003187732,0.0010455528,0.12839645,0.030079313,0.00002568351,0.00003689973,0.8400284],"study_design_scores_gemma":[0.00027222867,0.0002136373,0.000023473141,0.00029888423,0.000042294036,0.00005736908,0.00029912902,0.49888706,0.49852818,0.0005876379,0.0002249631,0.00056512724],"about_ca_topic_score_codex":0.00002587444,"about_ca_topic_score_gemma":0.0000143794405,"teacher_disagreement_score":0.8394633,"about_ca_system_score_codex":0.00023581764,"about_ca_system_score_gemma":0.000029543306,"threshold_uncertainty_score":0.9998382},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030729728,0.000118920005,0.965241,0.00078486785,0.00017511443,0.0012200791,0.00001498222,0.001378463,0.00033683865],"genre_scores_gemma":[0.9428537,0.000015198403,0.05614344,0.00025034905,0.0000989396,0.00017287559,0.000008337239,0.00010795089,0.00034920103],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983237,0.00005700042,0.0003648046,0.00044196978,0.00032935603,0.00048320348],"domain_scores_gemma":[0.9988914,0.000158282,0.000085260835,0.00026558188,0.0004032184,0.00019624845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000098266166,0.00036908896,0.0003583751,0.0004374621,0.00037305185,0.00038145875,0.00019180044,0.00019692344,0.00004180651],"category_scores_gemma":[0.000012529157,0.00031178028,0.00013330807,0.0006264898,0.000051348885,0.0006028546,0.0000021380367,0.00033618076,0.000041150375],"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.00008638079,0.000084144216,0.0000014398274,0.00010883756,0.000064824184,0.0000063592083,0.00043941222,0.3850688,0.45840633,0.0000026509051,0.0049375608,0.15079324],"study_design_scores_gemma":[0.0004623359,0.00019178189,0.00003705772,0.00036335416,0.0000654374,0.000017449067,0.00015898702,0.6392562,0.35719764,0.000270832,0.0015152763,0.00046368598],"about_ca_topic_score_codex":0.00004277784,"about_ca_topic_score_gemma":0.000008305384,"teacher_disagreement_score":0.912124,"about_ca_system_score_codex":0.000116615156,"about_ca_system_score_gemma":0.000052581705,"threshold_uncertainty_score":0.9999334},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008281863,0.00016183798,0.9963456,0.00018315908,0.00003670842,0.00066210295,0.000028936945,0.0012465004,0.0005069878],"genre_scores_gemma":[0.7644791,0.000008087221,0.23486862,0.00013009523,0.000037219834,0.00034285412,0.00005179543,0.000047305115,0.000034922155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873894,0.000033658085,0.0003973974,0.0002843919,0.00027127017,0.00027434685],"domain_scores_gemma":[0.9991286,0.00015331204,0.00011259753,0.00030823547,0.0002162673,0.0000809912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018678121,0.0002681042,0.0002167964,0.0004122485,0.0004091695,0.000116102354,0.00029511828,0.00016570576,0.00001611669],"category_scores_gemma":[0.000008908689,0.0002970393,0.00010730184,0.00054213626,0.00004252406,0.00063102914,6.779394e-7,0.0003285234,0.0000027295853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050954175,0.00010169893,3.548688e-7,0.00010157331,0.0000090483145,1.672576e-7,0.00026447483,0.78928334,0.009667629,0.00002113507,0.000048912018,0.20045075],"study_design_scores_gemma":[0.00056849996,0.000115945746,0.0000073137753,0.0001277248,0.00002971371,0.0000025411377,0.00007065009,0.8230438,0.17319724,0.0025496748,0.000021390148,0.00026550694],"about_ca_topic_score_codex":0.000001343974,"about_ca_topic_score_gemma":0.0000012439399,"teacher_disagreement_score":0.7636509,"about_ca_system_score_codex":0.00016389793,"about_ca_system_score_gemma":0.000061273626,"threshold_uncertainty_score":0.99994814},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010836564,0.0004887701,0.9869067,0.0008393576,0.00009885878,0.000427997,0.0000040702,0.00012376354,0.00027392365],"genre_scores_gemma":[0.968112,0.000112876,0.03086571,0.00046209543,0.000056729208,0.00017286127,0.000003257296,0.000021131635,0.00019333775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987272,0.00008648564,0.00024974797,0.00032436367,0.00026202857,0.00035015936],"domain_scores_gemma":[0.9990947,0.00017043676,0.0001245016,0.00024230237,0.0001994152,0.00016861604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004519163,0.00020934133,0.00018437124,0.00014260692,0.00070261257,0.00014291436,0.00028927566,0.00006247146,0.00003040644],"category_scores_gemma":[0.0000026631621,0.00017889867,0.00006038668,0.00039330922,0.000078249825,0.0009790597,0.000006114138,0.00021309595,0.0000075979115],"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.000654424,0.0009193556,0.000050289662,0.000115827715,0.00018134565,0.0000025844506,0.01898771,0.02552621,0.015659105,0.0021797267,0.00018299744,0.93554044],"study_design_scores_gemma":[0.0043270686,0.00088497926,0.00015692796,0.00055311894,0.00011154866,0.000048591668,0.0005433532,0.914603,0.072959684,0.00032403303,0.0045881667,0.00089953834],"about_ca_topic_score_codex":0.000004019378,"about_ca_topic_score_gemma":0.000013177702,"teacher_disagreement_score":0.95727545,"about_ca_system_score_codex":0.0000983381,"about_ca_system_score_gemma":0.00009241802,"threshold_uncertainty_score":0.72952765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007696416,0.0011807055,0.98924506,0.00022995943,0.00026653643,0.00016688142,5.927901e-7,0.00011012523,0.0011037509],"genre_scores_gemma":[0.9833826,0.00015820422,0.015655698,0.00039064535,0.000112630274,0.000054511787,0.0000010348101,0.000017419903,0.00022727158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985764,0.00013205748,0.00032957376,0.00028733586,0.00020973325,0.00046492077],"domain_scores_gemma":[0.99922216,0.00012243971,0.00009696861,0.00032356163,0.00009501947,0.00013986131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003993879,0.00020274134,0.0001919817,0.00022641334,0.0005854324,0.00018113911,0.0005168278,0.00009308644,0.000036697686],"category_scores_gemma":[0.0000024702488,0.00019542311,0.00006948423,0.0010033266,0.000054511114,0.0015404995,0.000009112644,0.0005607209,0.000028045697],"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.0000136938415,0.00020084214,0.000050395716,0.000009722772,0.0000104484625,0.0000020087282,0.0034584831,0.19812137,0.002645382,0.00025092435,0.000043334807,0.7951934],"study_design_scores_gemma":[0.00040426812,0.000055602228,0.00020968911,0.00022117987,0.00000803767,0.000017558306,0.00012509245,0.9820157,0.015778664,0.000020217303,0.0008305103,0.00031345995],"about_ca_topic_score_codex":0.0000052192736,"about_ca_topic_score_gemma":0.000027863778,"teacher_disagreement_score":0.9756862,"about_ca_system_score_codex":0.00012917448,"about_ca_system_score_gemma":0.00006804315,"threshold_uncertainty_score":0.7969123},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35633695,0.000048933285,0.64323574,0.0000071120817,0.00004898533,0.00014735316,0.000029224922,0.00005571492,0.000089959314],"genre_scores_gemma":[0.99675035,0.000038283946,0.0029972685,0.0000086628825,0.000016013848,0.00006310835,0.000019471338,0.00001933096,0.000087500564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880975,0.000015159736,0.00051882316,0.00017601087,0.0003376908,0.00014257076],"domain_scores_gemma":[0.9993722,0.00004155057,0.00013057508,0.0001283509,0.00026978782,0.00005753476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011949131,0.00013660736,0.00028172095,0.00065626146,0.00014195751,0.000017432552,0.000099694415,0.00004803505,0.000032346652],"category_scores_gemma":[0.0000029854657,0.0001451477,0.00008085305,0.0017359924,0.000033514152,0.00041912578,5.861162e-7,0.000080628975,0.00001252511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023754395,0.0000902012,0.00009527257,0.00037431426,0.0001832894,5.141927e-7,0.00081002293,0.89399046,0.029214788,3.9004172e-7,0.000022403558,0.075194575],"study_design_scores_gemma":[0.0002377117,0.00005704175,0.0028673722,0.0001581567,0.00025641534,0.00000376114,0.00007343471,0.91504806,0.08112296,0.0000035571381,0.000031090385,0.00014046433],"about_ca_topic_score_codex":0.000024894769,"about_ca_topic_score_gemma":0.0000126596615,"teacher_disagreement_score":0.6404134,"about_ca_system_score_codex":0.00007182244,"about_ca_system_score_gemma":0.000069801914,"threshold_uncertainty_score":0.59189516},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039621033,0.000118067655,0.95817244,0.00028165072,0.0004316524,0.0010537715,0.00001031225,0.00025196094,0.00005912625],"genre_scores_gemma":[0.9938248,0.000004500459,0.0053429897,0.00015860032,0.0000473434,0.00051572564,0.0000038592916,0.000029189552,0.00007298795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764377,0.000114052295,0.00054576603,0.0006192438,0.0003500441,0.0007271431],"domain_scores_gemma":[0.99892664,0.00023458824,0.00016669411,0.00031004363,0.00017627116,0.00018573787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035674797,0.00028459364,0.00034470033,0.0002142923,0.00036927988,0.00058382156,0.00058900146,0.00013315132,0.000026875436],"category_scores_gemma":[0.000004237825,0.000273795,0.0001492195,0.0006383315,0.000051824245,0.0006381576,0.000003751648,0.00030392493,0.000038067596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047206966,0.0003717837,0.000044083754,0.00007947497,0.000025515323,0.0000072494586,0.0006904145,0.5582354,0.0051051793,0.00007551279,0.00006180669,0.4352564],"study_design_scores_gemma":[0.0021560153,0.00004416238,0.000253212,0.0002584127,0.000013462573,0.000008576197,0.00008004785,0.98976743,0.0069788923,0.00005986861,0.000069623966,0.00031028676],"about_ca_topic_score_codex":0.00007783734,"about_ca_topic_score_gemma":0.000023534923,"teacher_disagreement_score":0.9542038,"about_ca_system_score_codex":0.0002053692,"about_ca_system_score_gemma":0.00009293009,"threshold_uncertainty_score":0.99997145},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016492711,0.0008200731,0.9806346,0.00011009792,0.000053300235,0.00084688945,0.000012021738,0.00072084554,0.00030941592],"genre_scores_gemma":[0.9833056,0.00010193207,0.015952798,0.000075230666,0.000027540122,0.00039405943,0.000002479318,0.0000745201,0.000065856206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987584,0.00016981467,0.00038389032,0.00024091545,0.00018113157,0.0002658892],"domain_scores_gemma":[0.998977,0.0003441305,0.000109003086,0.0003991654,0.00008415564,0.000086520966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009161966,0.00024366249,0.00026122006,0.00010678456,0.001078678,0.00012967129,0.00027528405,0.00017250192,0.000010289236],"category_scores_gemma":[0.000005262221,0.00016257488,0.00007451116,0.00018585191,0.0002523275,0.00035166324,0.000006088523,0.00049762306,0.0000029596995],"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.0022467435,0.0002787749,0.000018261186,0.0031578662,0.0006747324,0.0000051308116,0.11705654,0.41727668,0.031473458,0.0033732972,0.00041286598,0.42402565],"study_design_scores_gemma":[0.0011887574,0.00016149304,0.00001045172,0.00049751287,0.00023051928,0.00014239071,0.003712208,0.88653815,0.10527321,0.0003655991,0.0014538937,0.000425812],"about_ca_topic_score_codex":0.000040846637,"about_ca_topic_score_gemma":0.00004165235,"teacher_disagreement_score":0.96681285,"about_ca_system_score_codex":0.00011345696,"about_ca_system_score_gemma":0.000026089092,"threshold_uncertainty_score":0.8296428},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06554469,0.000054903652,0.9329083,0.0004035444,0.00012135167,0.00011882645,8.7972364e-7,0.000054646116,0.000792848],"genre_scores_gemma":[0.9983736,0.000048475773,0.0011810631,0.00026278186,0.000022183849,0.00004062203,2.8724392e-7,0.000009995093,0.00006095414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988753,0.00017019692,0.00025538326,0.00026617295,0.00022522816,0.00020767629],"domain_scores_gemma":[0.9988222,0.0005011411,0.000111004956,0.00037385945,0.00014731871,0.00004445167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037084537,0.00014276475,0.00015635368,0.00014770315,0.00038986755,0.00010093664,0.0006550746,0.000073052084,0.00002757435],"category_scores_gemma":[0.0000057942425,0.00010482047,0.0000561913,0.00085177826,0.00013713421,0.00023140994,0.0000058787127,0.0005768222,0.0000025196039],"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.000068903806,0.00061167456,0.000010045409,0.000012267492,0.000020897249,0.000003124264,0.0022211769,0.1386902,0.052964035,0.019827466,0.000023359396,0.78554684],"study_design_scores_gemma":[0.00020021202,0.00007984027,0.000055076212,0.00010111502,0.00000459726,0.000004362367,0.000049113678,0.8951669,0.10390614,0.00024566858,0.000052297986,0.00013469829],"about_ca_topic_score_codex":0.000009320205,"about_ca_topic_score_gemma":0.00014154743,"teacher_disagreement_score":0.93282896,"about_ca_system_score_codex":0.000029467274,"about_ca_system_score_gemma":0.00009917932,"threshold_uncertainty_score":0.42744547},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20774767,0.00050622976,0.79025775,0.000016545624,0.00019369701,0.00035022435,0.0000071510744,0.00020633577,0.0007143944],"genre_scores_gemma":[0.9900314,0.000012266433,0.009526203,0.000028229773,0.00011278838,0.00011275257,0.0000016833029,0.000071687195,0.00010295092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860835,0.000015923057,0.0005311414,0.00023115808,0.0002470444,0.00036638347],"domain_scores_gemma":[0.99941427,0.00008511803,0.00010709833,0.00011358351,0.00019512713,0.00008477887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001891939,0.00024392635,0.00031425423,0.00016703231,0.00037078914,0.0001508385,0.00016057907,0.000113842885,0.000093808216],"category_scores_gemma":[0.0000023289674,0.00023403768,0.000116034455,0.00025932398,0.0000435316,0.0009752232,5.887011e-7,0.00025239255,0.000012974661],"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.000023189561,0.000045676094,0.000015616737,0.0014779385,0.00003845243,5.989634e-7,0.0005993629,0.17724872,0.17791307,0.0000028677136,0.00007376258,0.6425607],"study_design_scores_gemma":[0.00033386075,0.000100273886,0.00003200671,0.00046267232,0.000023307439,0.000008715878,0.00019147464,0.6293875,0.3690489,0.000039634542,0.00012388137,0.00024781656],"about_ca_topic_score_codex":0.000012263823,"about_ca_topic_score_gemma":0.000002348127,"teacher_disagreement_score":0.7822838,"about_ca_system_score_codex":0.000056972538,"about_ca_system_score_gemma":0.00005107347,"threshold_uncertainty_score":0.954378},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007122538,0.000038675844,0.99695426,0.00026019962,0.00021399268,0.00043844339,0.000060504488,0.0011861739,0.00013546828],"genre_scores_gemma":[0.79492027,0.0000062747526,0.20441903,0.00039248142,0.0000487063,0.00008188002,0.00001077088,0.000014619475,0.000105982515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984214,0.000043842352,0.00036557254,0.0005408892,0.0002936572,0.00033469227],"domain_scores_gemma":[0.99907345,0.00014094995,0.00013545279,0.00034819762,0.00019656254,0.00010538373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001944616,0.00021994511,0.00019691067,0.00025441998,0.00063195475,0.0002819097,0.00051042205,0.000111983645,0.000021436137],"category_scores_gemma":[0.000008110593,0.00021295504,0.00009965033,0.00041204444,0.000037039717,0.00208188,0.0000028198615,0.0002774982,0.000010177549],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009405719,0.00022398565,0.000006854593,0.000033447974,0.00000984087,0.0000031973657,0.00024271496,0.010004981,0.16615632,0.00021584223,0.00052664545,0.8224821],"study_design_scores_gemma":[0.0005795091,0.00026963404,0.00014078444,0.0002073779,0.000013343928,0.000017211341,0.000013427233,0.621186,0.3736481,0.0027934536,0.00089448295,0.00023664255],"about_ca_topic_score_codex":0.0000022294932,"about_ca_topic_score_gemma":0.0000015680253,"teacher_disagreement_score":0.8222455,"about_ca_system_score_codex":0.00009783716,"about_ca_system_score_gemma":0.000060197544,"threshold_uncertainty_score":0.8684054},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037562687,0.000015307663,0.99856234,0.00016090371,0.00021627477,0.00028554004,0.00013135764,0.0002279182,0.000024757961],"genre_scores_gemma":[0.8051315,0.0000013660784,0.19459015,0.00010022838,0.000031114134,0.00006899082,0.00002526657,0.000015959658,0.00003541375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984458,0.000035571094,0.00037636678,0.00043851658,0.00031056668,0.00039317884],"domain_scores_gemma":[0.999128,0.00015185057,0.0001012541,0.00017754587,0.00023081536,0.00021057636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003093707,0.00019923957,0.00022336988,0.00014293927,0.00021426305,0.0002836276,0.00023696542,0.00013569726,0.0000024794622],"category_scores_gemma":[0.000008400828,0.00020085208,0.00006021032,0.0006577149,0.00005090866,0.00053873187,0.000002471677,0.0002985032,0.0000046017503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073921736,0.00017162284,6.028613e-7,0.000012126727,0.000006197511,0.000003166651,0.00009722423,0.8260395,0.00009611516,0.00025000254,0.00006547704,0.17318407],"study_design_scores_gemma":[0.0011885307,0.000108445856,0.0000062623926,0.000056253324,0.000013959037,0.00002348537,0.000040864095,0.9967504,0.0006149734,0.00093832833,0.000023055261,0.00023543181],"about_ca_topic_score_codex":0.000013804915,"about_ca_topic_score_gemma":0.000018433837,"teacher_disagreement_score":0.80475587,"about_ca_system_score_codex":0.00017138645,"about_ca_system_score_gemma":0.00017950861,"threshold_uncertainty_score":0.81905097},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002831841,0.000028520111,0.9953595,0.000044923654,0.000032067914,0.00037550542,0.00024903045,0.00012785498,0.0009507566],"genre_scores_gemma":[0.6360665,0.000005260397,0.36360884,0.0000450244,0.000025782168,0.000051047457,0.000003928861,0.000025730009,0.0001679048],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985358,0.00008684631,0.00051788165,0.00034435827,0.0002342178,0.00028089446],"domain_scores_gemma":[0.9977555,0.0015239946,0.00017292511,0.00017291188,0.00025572866,0.00011891414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003591268,0.00020436994,0.00037134287,0.00006411582,0.00033338793,0.00004462725,0.00015926256,0.00008089208,0.00047197973],"category_scores_gemma":[0.00005485,0.00017849401,0.00006696158,0.00031626594,0.00014742029,0.00034367584,3.708929e-7,0.00018446929,0.0000031719972],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005479907,0.0019951619,0.000005966036,0.0018861415,0.000049783634,0.0000027096041,0.0012671489,0.028477717,0.017201675,0.0036698205,0.000020283074,0.9448756],"study_design_scores_gemma":[0.0020968982,0.0011241166,0.000018652405,0.00064235233,0.00029865553,0.000017623961,0.00028912924,0.37568963,0.06381673,0.55517435,0.00023363749,0.0005982465],"about_ca_topic_score_codex":0.000011985888,"about_ca_topic_score_gemma":0.00002221763,"teacher_disagreement_score":0.94427735,"about_ca_system_score_codex":0.000027705419,"about_ca_system_score_gemma":0.00013627276,"threshold_uncertainty_score":0.7278775},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007067629,0.00021180765,0.9911795,0.00014647267,0.00016751504,0.00062469183,0.00001467054,0.00034979105,0.00023792298],"genre_scores_gemma":[0.92301726,0.0000016181586,0.07662664,0.000055235058,0.00005223882,0.00012141105,0.0000030499762,0.00008626036,0.000036258363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998132,0.00010231233,0.00047747028,0.00037606774,0.0004149674,0.0004972],"domain_scores_gemma":[0.9991594,0.00033381797,0.0000549639,0.00022515841,0.000093028546,0.00013364118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086938654,0.00031544964,0.00034323733,0.000396648,0.00033656132,0.00016633078,0.00025091157,0.00016439406,0.000024951625],"category_scores_gemma":[0.000009418168,0.00031798298,0.00012616004,0.00052332005,0.000058266098,0.00020403531,5.8275845e-7,0.00036059308,0.000010212232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000944022,0.00007576457,6.029161e-7,0.0006010575,0.000011336468,0.0000016934544,0.0003892846,0.84714156,0.008787695,0.0000064221804,0.000036372097,0.14285383],"study_design_scores_gemma":[0.0014110855,0.00013666089,0.00000477448,0.00055849215,0.000033557648,0.0000052632495,0.00008535561,0.92527205,0.07188367,0.00016167181,0.00011363741,0.00033376523],"about_ca_topic_score_codex":0.00001847695,"about_ca_topic_score_gemma":0.000019181702,"teacher_disagreement_score":0.91594964,"about_ca_system_score_codex":0.00018044717,"about_ca_system_score_gemma":0.00011658491,"threshold_uncertainty_score":0.9999272},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14728123,0.00052496465,0.85139906,0.000008149863,0.000087116474,0.00015138762,0.000008669028,0.0004420311,0.00009739175],"genre_scores_gemma":[0.9729194,0.000024056852,0.026887445,0.00002770844,0.000036623103,0.000036899193,0.0000021113212,0.000057789726,0.000007948211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987538,0.000015171774,0.00033708234,0.00019514751,0.00019377813,0.0005050341],"domain_scores_gemma":[0.9996729,0.000033587563,0.000048290807,0.00014217313,0.000015579337,0.00008748248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001616087,0.00022869547,0.00020366476,0.00024419616,0.00017970277,0.000043882716,0.000115153176,0.00015679775,0.00012851332],"category_scores_gemma":[0.000002441816,0.00023893976,0.000059664646,0.00029447096,0.000046979014,0.0004477363,0.0000015258428,0.00032228732,0.00006752074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019781493,0.00014399295,0.00060153473,0.000114544164,0.000019642255,0.000007148677,0.0005932955,0.85067755,0.03513396,0.0000033400213,0.0000042601328,0.11268092],"study_design_scores_gemma":[0.00043923946,0.000024885085,0.00011354796,0.00018498948,0.00003390088,0.0000323053,0.00020431318,0.9019232,0.09637006,0.00016159355,0.00012513688,0.0003868369],"about_ca_topic_score_codex":0.0000057015322,"about_ca_topic_score_gemma":0.0000026196803,"teacher_disagreement_score":0.8256382,"about_ca_system_score_codex":0.00026535496,"about_ca_system_score_gemma":0.000026841013,"threshold_uncertainty_score":0.97436804},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004333241,0.000025997475,0.99391335,0.00003367542,0.00033733094,0.0005357726,0.000028431416,0.00050533155,0.00028687157],"genre_scores_gemma":[0.99166995,0.0000074371496,0.007660996,0.000042807726,0.000115919116,0.0002155395,0.000019485906,0.00011826659,0.00014962112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889344,0.00003762393,0.00026775288,0.00031294065,0.00015160114,0.0003366594],"domain_scores_gemma":[0.99936676,0.000101066245,0.00009192325,0.00013716368,0.00020467167,0.000098414996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015820857,0.00027318977,0.00023932468,0.000217649,0.00028447257,0.00008319608,0.000099753684,0.00012226743,0.000016644119],"category_scores_gemma":[0.0000046570394,0.00026594635,0.000059036935,0.00038533483,0.000040054758,0.00068727153,4.3656004e-7,0.00018454988,0.000010840422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018819378,0.000034479923,7.8349797e-7,0.00017582372,0.000030142717,5.952269e-7,0.0005739724,0.95771617,0.006036586,0.0000121418225,0.000008937218,0.035222173],"study_design_scores_gemma":[0.0009063155,0.00019655439,0.0000021660446,0.00019357637,0.000050000348,0.000004589735,0.00024778294,0.8778469,0.12002417,0.000106394866,0.00009434812,0.00032721827],"about_ca_topic_score_codex":0.000004459383,"about_ca_topic_score_gemma":0.000014330537,"teacher_disagreement_score":0.9873367,"about_ca_system_score_codex":0.00013695181,"about_ca_system_score_gemma":0.000036715785,"threshold_uncertainty_score":0.99997926},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034013245,0.00003001424,0.96432936,0.0001393847,0.0004603976,0.00017471549,0.0000058218075,0.00057359436,0.0002734742],"genre_scores_gemma":[0.94491714,0.0000021962062,0.054664742,0.00020453635,0.000089842,0.000028553142,7.0428945e-7,0.000017029031,0.00007525143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981868,0.00014273047,0.00030039888,0.0005831185,0.00045633505,0.0003305767],"domain_scores_gemma":[0.9987526,0.00023123091,0.000103001985,0.00044933334,0.00024454933,0.00021931571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045955658,0.00020974032,0.00019253777,0.0001408457,0.000434885,0.00028765586,0.0004271376,0.00013359674,0.000018855606],"category_scores_gemma":[0.000024582901,0.00019150761,0.00010021107,0.00052693114,0.000075927375,0.00084751006,0.000005219801,0.0003873049,0.000098323],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011953456,0.00029490245,0.00004213428,0.000033114986,0.000014603857,0.000011650803,0.00061231246,0.04027298,0.0037755384,0.000019745592,0.00011523708,0.95468825],"study_design_scores_gemma":[0.0009729739,0.00025258417,0.00028562502,0.00011543939,0.00003295204,0.000100688216,0.00009077987,0.73136705,0.25989705,0.005445571,0.0008879591,0.00055135344],"about_ca_topic_score_codex":0.000030780633,"about_ca_topic_score_gemma":0.000034451656,"teacher_disagreement_score":0.9541369,"about_ca_system_score_codex":0.0001147443,"about_ca_system_score_gemma":0.00010838868,"threshold_uncertainty_score":0.78094536},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023752643,0.00073956884,0.9729741,0.0007184434,0.00008178997,0.00008952212,1.7319694e-7,0.00018975016,0.001453996],"genre_scores_gemma":[0.9903688,0.000075284144,0.009052466,0.00027007147,0.00006793176,0.000012231839,3.54071e-7,0.000019405727,0.00013349493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986784,0.00012230403,0.00027073373,0.00046730443,0.00016007392,0.00030120768],"domain_scores_gemma":[0.99936765,0.00013937261,0.000058440743,0.00031536233,0.000029617819,0.000089538844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060661725,0.00017056754,0.00016754291,0.00023186002,0.00046388028,0.00051227544,0.00045619308,0.000051268144,0.000011608998],"category_scores_gemma":[0.0000030350625,0.00017029517,0.000042621483,0.0006721189,0.000064094005,0.0005405916,0.000016867822,0.000605974,0.000009961219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016680731,0.00003575998,0.000033712964,0.0000146599805,0.0000058155906,0.0000036663785,0.0008099373,0.5525444,0.00044116259,0.0010219795,0.0000071525624,0.44506505],"study_design_scores_gemma":[0.0003139838,0.00005170595,0.000093946226,0.00034578855,0.000007037209,0.000025124617,0.000027570706,0.99679834,0.0013790713,0.00022426304,0.00053302944,0.00020017124],"about_ca_topic_score_codex":0.000008458653,"about_ca_topic_score_gemma":0.00007390555,"teacher_disagreement_score":0.9666161,"about_ca_system_score_codex":0.00006825205,"about_ca_system_score_gemma":0.000026220283,"threshold_uncertainty_score":0.6944435},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07916973,0.00012907707,0.91944474,0.000085346124,0.000067219145,0.00027828486,0.000018528883,0.000108929526,0.00069817173],"genre_scores_gemma":[0.9342589,0.0000089047135,0.06535346,0.00005457158,0.00006532432,0.00008675566,9.5170475e-7,0.000027609258,0.00014351509],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99888057,0.000028207012,0.00036570968,0.00016859814,0.0002617863,0.00029511692],"domain_scores_gemma":[0.99924946,0.0002187176,0.00017291255,0.00017080251,0.000076351964,0.00011176067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036938433,0.0001466661,0.00021814746,0.00016491319,0.0002842126,0.00004488069,0.00014044388,0.00006688888,0.0001387323],"category_scores_gemma":[0.00000925701,0.00013741697,0.00008059252,0.0005610993,0.000021948303,0.00041616705,0.0000015657589,0.0001508824,0.000053151347],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000531252,0.004556888,0.0001837631,0.0037847518,0.0002246962,0.000003328081,0.013912377,0.2213761,0.052461382,0.016749911,0.0006015396,0.685614],"study_design_scores_gemma":[0.0057019037,0.00040066038,0.00074970466,0.0019911937,0.0010080219,0.00008622776,0.002478094,0.41934496,0.54185855,0.019479718,0.0048733708,0.0020275842],"about_ca_topic_score_codex":0.000005675199,"about_ca_topic_score_gemma":0.000002026991,"teacher_disagreement_score":0.8550892,"about_ca_system_score_codex":0.00003782464,"about_ca_system_score_gemma":0.000032643566,"threshold_uncertainty_score":0.56037015},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06482058,0.00087573746,0.932809,0.00004419494,0.00029382517,0.000218452,0.00007364791,0.0003506846,0.0005138629],"genre_scores_gemma":[0.9839173,0.0000385648,0.015727727,0.00003934611,0.00012210419,0.000051136085,0.000008853062,0.000051307983,0.000043643377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989675,0.000021897618,0.00032134037,0.00015725264,0.00011635809,0.00041563806],"domain_scores_gemma":[0.99936265,0.00015364724,0.00005784307,0.00023764523,0.000065003325,0.00012319151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000195974,0.00020508928,0.00020303774,0.00015734647,0.00040140605,0.00006547502,0.00016683848,0.000095737356,0.00004402852],"category_scores_gemma":[0.000004606357,0.00020819371,0.00007747339,0.00023150786,0.000047521557,0.00044226175,0.0000016482736,0.0002823112,0.000013596379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001608588,0.0005860131,0.00037901857,0.0006175929,0.0001501901,0.0000023494272,0.0016789428,0.5741347,0.180978,0.00015768083,0.00016718105,0.24098743],"study_design_scores_gemma":[0.0004571992,0.000035625188,0.000042495125,0.00017952913,0.00006260476,0.000022601871,0.00015144587,0.91313124,0.08258393,0.00007618039,0.0029252958,0.0003318364],"about_ca_topic_score_codex":0.000016026012,"about_ca_topic_score_gemma":0.000027578633,"teacher_disagreement_score":0.91909677,"about_ca_system_score_codex":0.00014017517,"about_ca_system_score_gemma":0.00007248715,"threshold_uncertainty_score":0.84898937},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062048985,0.0013402076,0.9909558,0.00030481533,0.0004008486,0.000431341,0.000003281486,0.00021739773,0.00014140023],"genre_scores_gemma":[0.90034074,0.00008463766,0.09865711,0.00044989487,0.00012759835,0.00012024932,0.000004696955,0.00003439012,0.0001807139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815094,0.00017925084,0.0004159007,0.0005360399,0.00022058727,0.0004972843],"domain_scores_gemma":[0.9985171,0.00018660173,0.00017065836,0.00040133414,0.00044722023,0.0002771042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010901396,0.00028667002,0.0002642308,0.00012491753,0.001042472,0.0004591969,0.00048638048,0.00012785505,0.000011313627],"category_scores_gemma":[0.000012203181,0.00028207916,0.000087434186,0.0006002323,0.00011028261,0.0011477768,0.000015781605,0.00041894004,0.0000049010555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007470984,0.00007519898,0.00002362596,0.000011824736,0.000032314176,0.0000017419163,0.0015299143,0.7817483,0.0003758883,0.00040459033,0.0001009139,0.215621],"study_design_scores_gemma":[0.0012514541,0.00019737067,0.00003941457,0.0001254805,0.000029417457,0.000018502025,0.000112702524,0.9948679,0.0014926577,0.00007236699,0.0014382675,0.00035446967],"about_ca_topic_score_codex":0.0000057495113,"about_ca_topic_score_gemma":0.000048258866,"teacher_disagreement_score":0.89413583,"about_ca_system_score_codex":0.00013959878,"about_ca_system_score_gemma":0.00021989873,"threshold_uncertainty_score":0.99996316},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024605876,0.0001335773,0.97451663,0.00021090548,0.00009870173,0.00018297946,0.000013790944,0.00008329549,0.00015421904],"genre_scores_gemma":[0.97152275,0.000029270825,0.027981685,0.00036212898,0.00002123376,0.000015894928,0.000008103205,0.00001723215,0.000041697404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858737,0.00018477089,0.00037782046,0.0003780487,0.00020026398,0.0002717429],"domain_scores_gemma":[0.9990147,0.00024481764,0.00014691983,0.0001946307,0.00030538437,0.000093542105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049373455,0.00019481865,0.00021226438,0.00022496996,0.0005650975,0.00024756504,0.00020510716,0.000107583124,0.000029920924],"category_scores_gemma":[0.000018813666,0.00020076145,0.000028308821,0.0006690754,0.000085933134,0.0006830791,0.000010585228,0.0006012395,0.0000049344026],"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.00006667083,0.0004153178,0.000033914534,0.00011746133,0.000057729052,0.0000074919963,0.009878724,0.22283296,0.015035137,0.0019468602,0.000019713945,0.749588],"study_design_scores_gemma":[0.0007416305,0.000089431815,0.00019910836,0.0003696323,0.000015295705,0.000017174993,0.00022787023,0.99097663,0.00653566,0.0005100033,0.000051256127,0.00026629824],"about_ca_topic_score_codex":0.000009784086,"about_ca_topic_score_gemma":0.0001317446,"teacher_disagreement_score":0.9469169,"about_ca_system_score_codex":0.00011013345,"about_ca_system_score_gemma":0.00011356566,"threshold_uncertainty_score":0.8186814},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026802953,0.00004828804,0.9718499,0.000071107715,0.00016040418,0.00032900833,0.0000038825515,0.0004636353,0.0002708124],"genre_scores_gemma":[0.8664448,0.0000019047129,0.13330162,0.00006419922,0.000018898349,0.00008809909,3.281879e-7,0.000021763057,0.00005836987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847335,0.00005947652,0.0003663368,0.00043442505,0.00034426828,0.0003221354],"domain_scores_gemma":[0.99885345,0.0002642178,0.00020339449,0.00029906924,0.00027900503,0.00010087297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021822914,0.00022457803,0.0002644395,0.00031927178,0.0003144863,0.0001244437,0.0005967978,0.000099029305,0.000038456623],"category_scores_gemma":[0.0000068214467,0.00022130563,0.00010258653,0.0005735171,0.000100426376,0.0010795034,0.000006900958,0.00036263082,0.000037657526],"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.0000415765,0.00035542986,0.000015669162,0.00010962387,0.000038967813,0.000008688861,0.0031174822,0.0806927,0.112697974,0.00003761322,0.000120816345,0.80276346],"study_design_scores_gemma":[0.0001962635,0.00028131416,0.00007940712,0.000396691,0.000016926764,0.00001865377,0.00019117583,0.86776125,0.13021933,0.0006020155,0.0000014038675,0.0002355965],"about_ca_topic_score_codex":0.00012544064,"about_ca_topic_score_gemma":0.00001328402,"teacher_disagreement_score":0.83964187,"about_ca_system_score_codex":0.000087834145,"about_ca_system_score_gemma":0.0001317133,"threshold_uncertainty_score":0.9024582},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011297046,0.000045330602,0.98597926,0.000014902945,0.00007783135,0.00019532598,0.0000037148586,0.00094099366,0.0014455881],"genre_scores_gemma":[0.89798087,0.000003342951,0.10178768,0.00004148778,0.000053971977,0.00004739883,0.0000037792004,0.00005629109,0.000025196827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990005,0.0000328932,0.00021394053,0.00028183212,0.00020245941,0.0002683665],"domain_scores_gemma":[0.999551,0.000039150153,0.000059983988,0.0001915784,0.00008777824,0.0000705211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093714174,0.00023965408,0.00024789083,0.00013531238,0.00029173243,0.00013720027,0.00013244964,0.00008354017,0.000020950762],"category_scores_gemma":[0.0000015873846,0.00022843375,0.000046387504,0.00026757026,0.00012207459,0.00026908572,0.0000010406404,0.00028543148,0.0000032486682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058762445,0.00004507001,2.0610518e-7,0.00006183717,0.000020152642,0.0000011627001,0.00022005738,0.966087,0.011530812,0.000012998134,0.00001443442,0.021947538],"study_design_scores_gemma":[0.00033602375,0.0000906702,0.0000039827646,0.0003155768,0.000037519247,0.000036513153,0.000051168514,0.93168604,0.06704681,0.00009798323,0.000019251827,0.00027847424],"about_ca_topic_score_codex":0.000008477435,"about_ca_topic_score_gemma":0.0000022768438,"teacher_disagreement_score":0.8866838,"about_ca_system_score_codex":0.00006574209,"about_ca_system_score_gemma":0.000026784526,"threshold_uncertainty_score":0.9315258},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1051882,0.000018447572,0.89356554,0.00003363318,0.00011068586,0.00040758456,0.000050094088,0.0002762882,0.00034955086],"genre_scores_gemma":[0.96753037,6.631451e-7,0.031391382,0.00047998826,0.000040692954,0.00019439941,0.0000032421751,0.000040459676,0.00031881116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997836,0.00023351148,0.00034795975,0.0008356894,0.00031152825,0.00043529514],"domain_scores_gemma":[0.99884415,0.00040122372,0.0002423773,0.00025029623,0.00012368214,0.0001382612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027080937,0.000318676,0.00041815886,0.00043458832,0.000686817,0.00016267564,0.00035158853,0.00013391842,0.000098804994],"category_scores_gemma":[0.000020143127,0.00027262414,0.00038551047,0.0007617786,0.00017450021,0.000345935,0.0000023527793,0.00029350855,0.00000606213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013324347,0.0017648264,0.000059865986,0.00020997721,0.0003013968,0.000011432198,0.0043546055,0.5068486,0.38882178,0.00005122608,0.00003063131,0.09621324],"study_design_scores_gemma":[0.00073955714,0.00012167481,0.000040028506,0.00002562263,0.000228943,0.0000036867873,0.00004947058,0.5306198,0.46785745,0.000058666043,0.000041207542,0.00021387041],"about_ca_topic_score_codex":0.000075815784,"about_ca_topic_score_gemma":0.000011108668,"teacher_disagreement_score":0.8623422,"about_ca_system_score_codex":0.00006434179,"about_ca_system_score_gemma":0.00011287955,"threshold_uncertainty_score":0.9999726},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093733124,0.00021518723,0.9021416,0.001592769,0.0009238413,0.0005352229,0.00003019518,0.0004403362,0.0003877565],"genre_scores_gemma":[0.92922515,0.000013703352,0.069337234,0.00052395987,0.0002922492,0.0000457616,0.000009061168,0.00006113322,0.0004917677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99593145,0.0002006176,0.0010436167,0.0010187584,0.0009119791,0.00089358253],"domain_scores_gemma":[0.997589,0.0003473589,0.0004984012,0.00087422377,0.00031650992,0.00037452416],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079999195,0.0006071805,0.0006595125,0.0005325294,0.0011112868,0.00065029704,0.0015137955,0.00020462037,0.00006577329],"category_scores_gemma":[0.000019892052,0.0005161727,0.00032399516,0.0017862214,0.0001934171,0.00113164,0.000045235014,0.0006016319,0.0002374285],"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.00019877317,0.00062062044,0.0000070923656,0.00020912134,0.00016886955,0.0000058322157,0.010158114,0.47313783,0.18363903,0.0015321057,0.00014747442,0.33017516],"study_design_scores_gemma":[0.01780043,0.0021412447,0.0025848374,0.008667989,0.0015384505,0.0009579917,0.00046265803,0.18537875,0.57603794,0.050919563,0.14196986,0.011540291],"about_ca_topic_score_codex":0.00017201851,"about_ca_topic_score_gemma":0.00021466406,"teacher_disagreement_score":0.835492,"about_ca_system_score_codex":0.00030636662,"about_ca_system_score_gemma":0.0005007736,"threshold_uncertainty_score":0.999729},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011690829,0.00023002437,0.99596447,0.00021913214,0.00012303903,0.0002388527,0.00000283533,0.00076499424,0.001287566],"genre_scores_gemma":[0.5230333,0.0000032682865,0.47669196,0.00011372184,0.000052271724,0.000019636469,2.9469456e-7,0.00002312406,0.00006240283],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99747944,0.00019990491,0.00070424087,0.0006147687,0.0005857541,0.0004158845],"domain_scores_gemma":[0.9985614,0.00018054078,0.00039971576,0.00031200904,0.00039123523,0.0001550992],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008479481,0.0003294231,0.00038172593,0.00055813015,0.00063467637,0.000368142,0.0006343264,0.00016007914,0.00008315047],"category_scores_gemma":[0.000008395823,0.00032961796,0.00016175532,0.0013068558,0.00015715288,0.0026418506,0.000004779056,0.0004257256,0.0000115931],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018631528,0.00015548077,0.00000317916,0.00009294504,0.00001419328,0.0000013234484,0.00063808233,0.03559781,0.16381595,0.00004112729,0.000010331663,0.799611],"study_design_scores_gemma":[0.00016611104,0.00006620271,0.0000043663026,0.00026917644,0.000028419649,0.000037924485,0.0000273932,0.41654846,0.58151263,0.000791381,0.00031113808,0.00023680588],"about_ca_topic_score_codex":0.000023156095,"about_ca_topic_score_gemma":0.000004918981,"teacher_disagreement_score":0.79937416,"about_ca_system_score_codex":0.00019746994,"about_ca_system_score_gemma":0.00041225032,"threshold_uncertainty_score":0.9999156},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020167842,0.00032377336,0.9958624,0.00015057466,0.00027284393,0.00032552695,0.000002997116,0.00020023427,0.00084482005],"genre_scores_gemma":[0.9463045,0.000026051539,0.053043064,0.0001437791,0.00002624681,0.00014051356,0.0000010685753,0.000016782771,0.00029801912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989448,0.00008038748,0.00026111555,0.0003169263,0.00017413926,0.00022259439],"domain_scores_gemma":[0.99908894,0.000086574066,0.000092642265,0.00033751375,0.00030349835,0.00009081822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028329334,0.000149758,0.00013681676,0.000117748605,0.0005633547,0.00017795058,0.0005015889,0.00008121649,0.000039594466],"category_scores_gemma":[0.0000038100447,0.0001411391,0.00007401773,0.0003379047,0.000046536596,0.0006442652,0.0000037079976,0.00021575885,0.00001998771],"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.0003113933,0.0011062657,0.0000158163,0.00021163997,0.00019254754,0.000008372074,0.038045328,0.23123911,0.021721572,0.016140822,0.0006222847,0.69038486],"study_design_scores_gemma":[0.00045953772,0.00018173567,0.000021277834,0.00014511518,0.000021025053,0.000012679961,0.00024307107,0.9776961,0.019001007,0.000052657502,0.0018988354,0.0002669525],"about_ca_topic_score_codex":0.0000025337959,"about_ca_topic_score_gemma":0.0000033001488,"teacher_disagreement_score":0.9442877,"about_ca_system_score_codex":0.000057139976,"about_ca_system_score_gemma":0.00009658977,"threshold_uncertainty_score":0.5755486},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030674597,0.00050707505,0.99431014,0.000011879638,0.0006304464,0.00061733444,0.00003464667,0.0005998231,0.00022121808],"genre_scores_gemma":[0.9615732,0.000007896303,0.037346043,0.000018414368,0.0001203943,0.0002575178,0.000008676798,0.000099799436,0.00056804647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883664,0.000023474162,0.00036226356,0.0002587715,0.00020154478,0.00031729738],"domain_scores_gemma":[0.99941295,0.000029017629,0.00006859579,0.00013949796,0.0001905211,0.00015943412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017337581,0.0002478354,0.00023509453,0.00017232102,0.00019394493,0.0001221311,0.00012855802,0.000126793,0.0000073488372],"category_scores_gemma":[0.0000035182443,0.00026034412,0.00007064123,0.00025960206,0.000033828117,0.00062316307,7.442204e-7,0.0001813127,0.0000345762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042669544,0.00006716806,0.000011608832,0.00033572767,0.00004286366,0.0000014816836,0.00035189223,0.97654986,0.008193876,0.000012803457,0.00019377611,0.014196283],"study_design_scores_gemma":[0.0016077162,0.00008217991,0.0000021112442,0.00028528442,0.000047395617,0.000016310883,0.0010058676,0.9423864,0.051361937,0.000010577896,0.0028170855,0.00037716748],"about_ca_topic_score_codex":0.000013778266,"about_ca_topic_score_gemma":0.00001660543,"teacher_disagreement_score":0.95850575,"about_ca_system_score_codex":0.00026546317,"about_ca_system_score_gemma":0.000055172757,"threshold_uncertainty_score":0.99998486},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021083789,0.000028096203,0.9762464,0.00031456977,0.0005870235,0.00011467398,0.0000011881625,0.00033353845,0.0012907067],"genre_scores_gemma":[0.86590296,0.0000019752158,0.13319495,0.000460509,0.000104182414,0.000013114741,5.811143e-7,0.000020189118,0.00030150433],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984033,0.00010715576,0.00029239655,0.0004555465,0.00041217316,0.00032939177],"domain_scores_gemma":[0.99908173,0.0001465703,0.000107108965,0.00035497194,0.00017691693,0.00013271983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006346713,0.00020047459,0.00017062589,0.0002798582,0.0006517852,0.00066557137,0.00056582614,0.00012458627,0.00007594265],"category_scores_gemma":[0.000009193409,0.00019333226,0.000098190096,0.0006605535,0.00007312361,0.0015289206,0.0000032221255,0.0006506859,0.000104550374],"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.000018699451,0.000078733174,0.0000032500177,0.000017521095,0.0000059140557,0.000011814858,0.00037469453,0.0018228905,0.39087456,0.00016602567,0.000021132266,0.60660475],"study_design_scores_gemma":[0.0005907361,0.00008233943,0.00006004376,0.000072342846,0.00002324002,0.00009260978,0.000023582581,0.12091158,0.87437475,0.002817206,0.0005999715,0.00035160384],"about_ca_topic_score_codex":0.000013532191,"about_ca_topic_score_gemma":0.000007974862,"teacher_disagreement_score":0.8448192,"about_ca_system_score_codex":0.00003355739,"about_ca_system_score_gemma":0.00016419736,"threshold_uncertainty_score":0.7883861},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005117576,0.000060541974,0.99380714,0.0000012229605,0.00011749528,0.00014988457,0.000011742798,0.00025746803,0.00047694365],"genre_scores_gemma":[0.9970527,0.000005829676,0.002795871,0.000014060341,0.00003953983,0.000008569073,0.0000036921936,0.000053331027,0.000026363372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998921,0.000047468806,0.00035055948,0.0002002801,0.00022592071,0.00025477956],"domain_scores_gemma":[0.9995242,0.000108227556,0.00007659886,0.00010918325,0.000087819455,0.00009401398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001355611,0.00022432795,0.00026457786,0.00021790726,0.00016384738,0.000088479246,0.00011372787,0.000116919386,0.00008566101],"category_scores_gemma":[0.0000031987101,0.0002280184,0.00008779482,0.00029943633,0.000097248776,0.00039256195,4.4951486e-7,0.00019315886,0.0000067153255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019303094,0.00004986445,0.0000035509163,0.00008697105,0.00003906988,0.0000010092995,0.000118533026,0.9238687,0.025388049,0.000033189728,0.0000043705822,0.05038735],"study_design_scores_gemma":[0.0003957937,0.00008933319,0.0000021010449,0.00014406304,0.00007699678,0.00001314907,0.000064104344,0.9402712,0.058411334,0.0002862498,0.000005328199,0.00024033603],"about_ca_topic_score_codex":0.0000018916645,"about_ca_topic_score_gemma":2.360366e-7,"teacher_disagreement_score":0.9919352,"about_ca_system_score_codex":0.000055909764,"about_ca_system_score_gemma":0.000053473428,"threshold_uncertainty_score":0.92983204},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019818135,0.00030717763,0.9789929,0.0004177504,0.0001026893,0.00008191445,0.000030097943,0.00014265902,0.000106672676],"genre_scores_gemma":[0.9428437,0.000077644785,0.056674596,0.00013421907,0.00007610769,0.000005155504,0.0000056120925,0.000011955275,0.00017103791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998717,0.00004036119,0.00042531616,0.0003537404,0.00028705064,0.00017651904],"domain_scores_gemma":[0.9992723,0.00008561021,0.00016034051,0.00026883782,0.00013590392,0.00007702882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022306076,0.0001340325,0.0001606881,0.00015843008,0.00021171886,0.000116858784,0.00031281833,0.00008155911,0.000016354556],"category_scores_gemma":[0.0000020035222,0.00012839094,0.00004661831,0.00035003907,0.00006432584,0.0009910191,0.00000393501,0.00021970435,0.000005384198],"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.000019711702,0.00020334694,0.0000024992019,0.000036436755,0.000009169416,0.000001122718,0.00042199763,0.13850221,0.012861819,0.00011649248,0.00006507766,0.84776014],"study_design_scores_gemma":[0.00025212983,0.00003793666,0.00003562453,0.000095184194,0.00001707371,0.000017817416,0.000034761317,0.9580823,0.04039466,0.0007071035,0.00018450439,0.00014089102],"about_ca_topic_score_codex":0.000007899586,"about_ca_topic_score_gemma":0.000009018172,"teacher_disagreement_score":0.92302555,"about_ca_system_score_codex":0.000022545977,"about_ca_system_score_gemma":0.000046322377,"threshold_uncertainty_score":0.523563},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01642755,0.00033702684,0.9822163,0.00002378272,0.00011922582,0.0004416954,0.0000018981317,0.00027684213,0.00015568148],"genre_scores_gemma":[0.99006176,0.00004740813,0.00954847,0.00002849133,0.000030977088,0.00015693705,6.5565183e-7,0.0000700717,0.00005521754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989296,0.000036900958,0.0003499834,0.00026418042,0.000109239045,0.00031008542],"domain_scores_gemma":[0.9996957,0.00004138487,0.00003748768,0.00009227712,0.00004822675,0.00008490584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011764621,0.00023432741,0.00023017838,0.00031304726,0.000119972545,0.00011158589,0.000070984504,0.0001045175,0.000050287188],"category_scores_gemma":[0.0000014082458,0.0002507621,0.000040705447,0.0003030222,0.000036835023,0.0009935459,6.67335e-7,0.00030707836,0.00002095272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013162241,0.000025018411,0.000002339414,0.00018969108,0.000012428492,0.0000033102244,0.0016357037,0.8817443,0.04859541,7.911976e-7,0.000005132871,0.06777268],"study_design_scores_gemma":[0.0005775064,0.0000550325,0.000043854656,0.0007414853,0.000015350488,0.000028932185,0.00045901627,0.9339669,0.06370682,0.000070778035,0.000010456108,0.0003239135],"about_ca_topic_score_codex":0.000028337907,"about_ca_topic_score_gemma":0.000013523558,"teacher_disagreement_score":0.97363424,"about_ca_system_score_codex":0.00012151369,"about_ca_system_score_gemma":0.000014183496,"threshold_uncertainty_score":0.99999446},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002482464,0.00003852038,0.9950737,0.000012119008,0.00025317929,0.0005710846,0.000042341373,0.0010570799,0.00046951172],"genre_scores_gemma":[0.8347188,0.000018863364,0.16433002,0.00002813492,0.00018587988,0.00037368544,0.0000057391676,0.0001348635,0.00020400701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839616,0.000035865138,0.00035998924,0.00048152733,0.00024750843,0.00047893415],"domain_scores_gemma":[0.999422,0.000108381624,0.000088444074,0.000220433,0.000046863588,0.00011384853],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018505198,0.00040476193,0.00030415208,0.0002582292,0.0003538536,0.00007899783,0.00020628612,0.00015702755,0.000041589705],"category_scores_gemma":[0.000004105069,0.00044526267,0.00014122203,0.00022241003,0.00007265039,0.0006132311,0.000002980485,0.0003829923,0.000019270907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057779827,0.00004819438,4.9550715e-7,0.000076484124,0.000027645407,0.0000015599254,0.000120179095,0.43840498,0.1990487,0.000007872888,0.000014641248,0.36219147],"study_design_scores_gemma":[0.00043434332,0.0002848828,0.000016022192,0.00016430022,0.00003623819,0.000010423892,0.000056095952,0.5913144,0.4061822,0.00024441472,0.00086199254,0.0003946924],"about_ca_topic_score_codex":0.000004948513,"about_ca_topic_score_gemma":0.000002997815,"teacher_disagreement_score":0.83223635,"about_ca_system_score_codex":0.00029010864,"about_ca_system_score_gemma":0.000016811111,"threshold_uncertainty_score":0.9997999},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0227923,0.00043071603,0.9739739,0.0000028536701,0.00018379635,0.00014467414,0.000022362294,0.0008684437,0.0015810049],"genre_scores_gemma":[0.91465765,0.000027001228,0.08505324,0.000017012404,0.00007892758,0.00005063743,7.2734514e-7,0.000072589835,0.00004218828],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99887055,0.00001991261,0.00030590655,0.00017334969,0.00022777278,0.00040253633],"domain_scores_gemma":[0.99956155,0.0000457192,0.000057715206,0.00016553405,0.000057865225,0.0001116282],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013524498,0.0002454757,0.00024734228,0.0002088148,0.00010638101,0.000019428688,0.0001582378,0.00009397682,0.00004108426],"category_scores_gemma":[0.000001046189,0.00026033763,0.00009232535,0.00028985646,0.00007190304,0.0006706913,0.000001912005,0.00032689836,0.000015288075],"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.00003705742,0.000114826435,0.000009214175,0.00017785908,0.000045504374,0.0000034740658,0.00050463766,0.103791334,0.51454127,0.000032611424,0.000015282514,0.3807269],"study_design_scores_gemma":[0.00023082909,0.00012287182,0.00017606492,0.00036390644,0.000032607044,0.000017589407,0.00014628377,0.09773761,0.9002332,0.00014041565,0.0004045391,0.00039404756],"about_ca_topic_score_codex":0.000004893596,"about_ca_topic_score_gemma":6.0559677e-7,"teacher_disagreement_score":0.8918654,"about_ca_system_score_codex":0.00010231806,"about_ca_system_score_gemma":0.00001613731,"threshold_uncertainty_score":0.99998486},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020996507,0.0001439696,0.9957523,0.00036923206,0.00017668764,0.00013020585,0.0000014956266,0.00058683683,0.00073966186],"genre_scores_gemma":[0.745938,0.0000040733594,0.25316173,0.00046236019,0.0000997735,0.000027915443,0.0000011699742,0.000027178388,0.0002777962],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99804866,0.00004830208,0.00034063388,0.0005773733,0.00043041987,0.0005545804],"domain_scores_gemma":[0.9991831,0.00008385342,0.00014992327,0.0002708317,0.00012335158,0.00018892242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000406346,0.00026441793,0.00022620724,0.00018626005,0.00086542155,0.0005169874,0.0006195087,0.000112683876,0.0000203846],"category_scores_gemma":[0.0000061937985,0.00024955682,0.00010329858,0.00072073936,0.000072847215,0.0014058236,0.0000041465555,0.00042014167,0.000054038144],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008703669,0.00011251431,0.0000050484064,0.00006026155,0.000008815947,0.0000024078945,0.0002606755,0.013215335,0.013510955,0.000011734942,0.0000553157,0.9727482],"study_design_scores_gemma":[0.00047037078,0.00019599234,0.0000017843267,0.00025373616,0.00002055318,0.00004348754,0.00006658071,0.32882884,0.6629549,0.0002715315,0.006432057,0.00046010173],"about_ca_topic_score_codex":0.0000068169734,"about_ca_topic_score_gemma":0.0000031338566,"teacher_disagreement_score":0.97228813,"about_ca_system_score_codex":0.00006243735,"about_ca_system_score_gemma":0.00010916979,"threshold_uncertainty_score":0.99999565},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013558506,0.00030680737,0.99709994,0.00048972893,0.00015491892,0.00023430471,0.0000014570708,0.0001366712,0.0002203234],"genre_scores_gemma":[0.98922807,0.00003109335,0.009949833,0.0006077458,0.000040257946,0.000044418623,4.2091762e-7,0.000013319232,0.00008484706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899143,0.00009084027,0.00020154697,0.00031875633,0.00014348034,0.00025392993],"domain_scores_gemma":[0.9991481,0.00027798067,0.00006835377,0.00023955855,0.00016744673,0.000098580436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043625463,0.00014311011,0.00016555033,0.00008554199,0.00073101505,0.00027637443,0.00032651974,0.00006072911,0.000010400428],"category_scores_gemma":[0.0000027963322,0.00013154083,0.000053591633,0.00028798298,0.00006598149,0.00021602839,0.0000037873083,0.000194483,0.0000036601161],"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.000022781212,0.00008702473,0.000002461231,0.000012420037,0.000011604182,2.4381836e-7,0.00032354044,0.15693666,0.0008256414,0.0007149116,0.000032031156,0.84103066],"study_design_scores_gemma":[0.0007624839,0.00011698915,0.000020947371,0.000077052886,0.0000109577095,0.0000052257346,0.000015830574,0.996175,0.0018003603,0.00008629081,0.0007646798,0.00016416525],"about_ca_topic_score_codex":8.6407914e-7,"about_ca_topic_score_gemma":0.0000026677712,"teacher_disagreement_score":0.98787224,"about_ca_system_score_codex":0.000029671648,"about_ca_system_score_gemma":0.00003754394,"threshold_uncertainty_score":0.5622451},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003239421,0.00017276673,0.9940031,0.000008427426,0.00021345052,0.00052388926,0.00009307944,0.0010708978,0.0006749375],"genre_scores_gemma":[0.9610352,0.000029481344,0.038310755,0.00000994146,0.000092138944,0.00025592692,0.0000039745273,0.000065627406,0.00019698046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905443,0.000015898193,0.00026367584,0.00023735323,0.00015965808,0.00026897248],"domain_scores_gemma":[0.999562,0.00008150784,0.000057780053,0.00011156651,0.00011089122,0.00007625452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006690771,0.00022099706,0.0002170372,0.00013487622,0.00031433962,0.000028950699,0.00009168134,0.00010442723,0.000010883751],"category_scores_gemma":[0.0000018221208,0.00023196756,0.00007401408,0.0001738032,0.00010296971,0.00033432595,4.8485225e-7,0.00022722244,0.000005557642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008137225,0.000022558192,0.0000010959445,0.00012797875,0.00003247737,0.000005273944,0.0004035519,0.91135824,0.0621452,0.000022050357,0.00004453312,0.025755689],"study_design_scores_gemma":[0.0004154899,0.0001306747,0.000005897831,0.00025277064,0.000022277105,0.000031352218,0.00010953975,0.79422325,0.2040461,0.00013497684,0.00032406976,0.00030361992],"about_ca_topic_score_codex":0.000010911101,"about_ca_topic_score_gemma":0.0000058627134,"teacher_disagreement_score":0.95779574,"about_ca_system_score_codex":0.00018667818,"about_ca_system_score_gemma":0.00004449142,"threshold_uncertainty_score":0.94593626},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010915422,0.000048119316,0.9875071,0.000010391692,0.00019720626,0.00027778043,0.000031487412,0.0008692369,0.00014324392],"genre_scores_gemma":[0.94072974,0.0000040563937,0.059078418,0.000041467214,0.00004256008,0.00003244213,0.000006379618,0.000055792963,0.000009137635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885327,0.000024984174,0.00038881422,0.00022339384,0.00023034167,0.00027917608],"domain_scores_gemma":[0.99939066,0.00012855922,0.00008521865,0.00015261295,0.00019713391,0.000045813806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023468993,0.00021766743,0.0002491344,0.00030341087,0.00029741894,0.000046427853,0.00012402753,0.0001923458,0.000019128898],"category_scores_gemma":[0.000008735938,0.00021570644,0.00010126861,0.00046178428,0.00006602727,0.00010579116,8.604943e-7,0.00014437767,0.0000023008556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023993654,0.00008413024,0.000008909624,0.00051444175,0.000023099235,2.7555973e-7,0.00015561638,0.94623935,0.009672138,0.000035100038,0.000005335183,0.043237593],"study_design_scores_gemma":[0.00043578784,0.00004773695,0.0000022428853,0.0001341947,0.00006151755,0.0000020185248,0.00009493976,0.6995079,0.29933283,0.000108160544,0.00010284256,0.00016984895],"about_ca_topic_score_codex":0.0000070376695,"about_ca_topic_score_gemma":0.0000014251962,"teacher_disagreement_score":0.92981434,"about_ca_system_score_codex":0.000112098765,"about_ca_system_score_gemma":0.00006373855,"threshold_uncertainty_score":0.8796253},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057252934,0.00003064016,0.9920223,0.00028462376,0.00010189829,0.00019309485,0.000008362122,0.00015274309,0.0014810615],"genre_scores_gemma":[0.9775239,0.000004957002,0.022162262,0.00018060864,0.000016899447,0.00001773037,0.0000016868476,0.000013417019,0.00007850887],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986263,0.000024432285,0.00038434332,0.00029679286,0.0004067965,0.0002613596],"domain_scores_gemma":[0.9994875,0.000043569173,0.00010749146,0.00016224904,0.00011042786,0.000088714085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001704977,0.00016443233,0.00018473627,0.0002143821,0.00018074959,0.00019406193,0.00037864645,0.000052627798,0.000049011207],"category_scores_gemma":[7.074108e-7,0.00015598546,0.00011894383,0.0005566252,0.0000618223,0.0015416424,0.0000013130376,0.00014660509,0.000029229273],"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.000090805675,0.0003983787,0.000002003149,0.000097587545,0.00003244727,0.00000764852,0.0015115609,0.013947525,0.103479914,0.0019898252,0.000014074516,0.8784282],"study_design_scores_gemma":[0.0016365579,0.00047711714,0.000019348718,0.00016843961,0.000021512493,0.000023886618,0.00010391969,0.016594972,0.97038877,0.010194603,0.000107541164,0.00026334738],"about_ca_topic_score_codex":0.00002042262,"about_ca_topic_score_gemma":0.0000066210805,"teacher_disagreement_score":0.97179866,"about_ca_system_score_codex":0.000061449464,"about_ca_system_score_gemma":0.00020648964,"threshold_uncertainty_score":0.6360902},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010990718,0.00013893202,0.99645054,0.000020506272,0.00039143182,0.00054862443,0.000024227458,0.00062268507,0.0007039623],"genre_scores_gemma":[0.9711509,0.0000070013775,0.02822374,0.000068892085,0.00008768737,0.00017780578,0.000011061826,0.00010884947,0.00016409344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988911,0.000021050191,0.00038541594,0.00029109482,0.00011933203,0.00029197385],"domain_scores_gemma":[0.9993738,0.000044503147,0.000085636915,0.00016357249,0.0002416636,0.000090825444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000106200714,0.00024681428,0.00019545403,0.00013440785,0.00035967721,0.00006434505,0.00009327922,0.0001450471,0.000040296833],"category_scores_gemma":[0.0000026350178,0.0002701679,0.00007770354,0.0003513626,0.000052170075,0.00079519476,5.636078e-7,0.00015015606,0.000024668263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008214888,0.00017247512,7.3708526e-7,0.0004058764,0.00004640831,0.000024758981,0.0020395527,0.9503893,0.022085613,0.000113621616,0.000021400014,0.024618063],"study_design_scores_gemma":[0.0007373327,0.000111979716,8.839257e-7,0.00023777293,0.000068350695,0.00022212419,0.00057301164,0.7913583,0.20603307,0.00013705628,0.0001336609,0.00038650565],"about_ca_topic_score_codex":0.000029898792,"about_ca_topic_score_gemma":0.00013464109,"teacher_disagreement_score":0.9700518,"about_ca_system_score_codex":0.00011420811,"about_ca_system_score_gemma":0.000021207483,"threshold_uncertainty_score":0.999975},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002636425,0.00011546413,0.9962676,0.0001425619,0.00019822131,0.00018765073,0.0000032815594,0.00016638734,0.00028240617],"genre_scores_gemma":[0.7128901,0.0000020801958,0.28682503,0.0001672003,0.00002194933,0.000010457477,2.0130673e-7,0.000013775366,0.00006922112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982346,0.00014509809,0.00037215132,0.00042320983,0.00048420814,0.00034069916],"domain_scores_gemma":[0.9990563,0.00021115954,0.00014468469,0.00031609403,0.00016984993,0.00010195488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056774495,0.00021069222,0.0002573658,0.0002614832,0.00031887053,0.00015294812,0.0005226867,0.000092383016,0.000034745426],"category_scores_gemma":[0.0000073476454,0.00019595068,0.00013226118,0.000727478,0.00009602988,0.0002969054,0.0000034030506,0.0002781875,0.000025959886],"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.00007896938,0.0002396306,2.7397812e-7,0.000042234893,0.0000164325,0.000017299813,0.00097263814,0.7825081,0.077672504,0.0001449173,0.000006892015,0.13830012],"study_design_scores_gemma":[0.0015420042,0.0003318932,0.000013163395,0.0002513106,0.000034936864,0.000043911557,0.000037125606,0.38456652,0.6098366,0.0030118786,0.000028451983,0.0003022432],"about_ca_topic_score_codex":0.000025402645,"about_ca_topic_score_gemma":7.623621e-7,"teacher_disagreement_score":0.71025366,"about_ca_system_score_codex":0.00009359671,"about_ca_system_score_gemma":0.00028605945,"threshold_uncertainty_score":0.7990636},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041416497,0.00024546852,0.9946473,0.00016690939,0.00020876185,0.00027461082,0.0000244656,0.00019689724,0.000093909315],"genre_scores_gemma":[0.8291619,0.000005692985,0.17041095,0.00019347864,0.0000586962,0.000046631554,0.0000015939322,0.000020800853,0.000100268444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835676,0.000025700314,0.00027881408,0.0006071028,0.00034654222,0.00038509973],"domain_scores_gemma":[0.9992383,0.000117945485,0.00011502093,0.00022967748,0.000138304,0.00016073257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023951239,0.00023816865,0.0002149803,0.00017499056,0.001005958,0.00040532617,0.0003561498,0.000099060955,0.000004458989],"category_scores_gemma":[0.0000024968065,0.00021519486,0.00008564706,0.000344589,0.00011383947,0.00046337748,0.0000089284285,0.0002421957,0.000007538505],"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.00009097062,0.0002979949,5.169418e-7,0.00006637411,0.000027377646,0.00001231141,0.00175655,0.32691386,0.0035364882,0.0005391014,0.000035252666,0.6667232],"study_design_scores_gemma":[0.0011137433,0.0003438825,0.000005856682,0.00026160112,0.00002625668,0.00006756638,0.00012682483,0.97703075,0.01877024,0.0014643904,0.00048009056,0.00030879438],"about_ca_topic_score_codex":0.000023112236,"about_ca_topic_score_gemma":0.0000022973254,"teacher_disagreement_score":0.82502025,"about_ca_system_score_codex":0.00010298549,"about_ca_system_score_gemma":0.0001606323,"threshold_uncertainty_score":0.87753916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046677043,0.00019207939,0.99676883,0.0014237122,0.0003414751,0.0005258811,0.000006099433,0.00016928132,0.000105857915],"genre_scores_gemma":[0.9873064,0.000008436361,0.011685988,0.00062640954,0.00015810618,0.00012590183,0.0000011973713,0.00001431954,0.000073199095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879634,0.00002440666,0.00028263393,0.0003493953,0.0001791645,0.00036806692],"domain_scores_gemma":[0.9988088,0.0006165158,0.00009009259,0.00021694614,0.00016074617,0.00010692039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003255116,0.0001757415,0.0001362853,0.000054740056,0.0012186368,0.00027423387,0.0004562178,0.000060704602,0.000011655717],"category_scores_gemma":[0.0000023668863,0.00012374541,0.00009958114,0.00052602804,0.00013160729,0.0003262437,0.0000025421482,0.00031925223,0.000004092593],"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.000028679166,0.00006754886,9.374619e-7,0.000006765135,0.000011823767,0.0000015807944,0.000097788565,0.28655002,0.0002878789,0.0011018739,0.00013683505,0.7117083],"study_design_scores_gemma":[0.0002896902,0.000111030866,0.000013538314,0.000032178516,0.000021197184,0.000021173148,0.000051825573,0.99419886,0.0042581325,0.00018217856,0.0006601044,0.00016009201],"about_ca_topic_score_codex":0.000002626813,"about_ca_topic_score_gemma":0.000012672315,"teacher_disagreement_score":0.98683965,"about_ca_system_score_codex":0.000033388715,"about_ca_system_score_gemma":0.000062201194,"threshold_uncertainty_score":0.9372892},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017089913,0.00015252855,0.98222727,0.00012264003,0.00011567774,0.00009338417,0.000020867361,0.0001535301,0.000024195859],"genre_scores_gemma":[0.7646189,0.0000219071,0.23528917,0.000031448897,0.00001715242,0.0000027819738,0.000006235218,0.000007902114,0.000004508507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988653,0.00002831848,0.000278279,0.00040816003,0.0002504734,0.00016948175],"domain_scores_gemma":[0.9992992,0.000055284127,0.00008925994,0.0004159437,0.00007501771,0.0000652927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020158882,0.000121054356,0.00013321488,0.00012729052,0.00029287772,0.00010459897,0.0003926621,0.00007260101,0.0000031473178],"category_scores_gemma":[0.0000055919477,0.000117544434,0.000023999502,0.00026298416,0.00005229165,0.0010847705,0.000008110486,0.0001848093,0.0000045406205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010628473,0.000057034627,5.3679713e-7,0.00002445473,0.0000035814705,0.0000014230855,0.000206119,0.6782988,0.001515169,0.000059725844,0.0000019667893,0.3198206],"study_design_scores_gemma":[0.00045994134,0.000039549246,0.000007701119,0.0001993426,0.000014204965,0.000020391397,0.000031209158,0.9893139,0.0092419535,0.00054107193,0.0000079890315,0.00012275076],"about_ca_topic_score_codex":0.00006272725,"about_ca_topic_score_gemma":0.000007973499,"teacher_disagreement_score":0.747529,"about_ca_system_score_codex":0.000025819321,"about_ca_system_score_gemma":0.000059699138,"threshold_uncertainty_score":0.4793323},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020732654,0.00008728688,0.9946277,0.0004777645,0.00007187322,0.0002215107,0.0000016062995,0.00021784785,0.0022211075],"genre_scores_gemma":[0.6130083,0.000004403193,0.38596296,0.0006552329,0.00009351576,0.000015332073,5.1253505e-7,0.000012878126,0.00024682315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998271,0.00011493653,0.00038261223,0.00040097893,0.0004447586,0.00038570786],"domain_scores_gemma":[0.9991708,0.00010935937,0.000100136895,0.00017158345,0.00017135016,0.00027676835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048542337,0.00025127459,0.00021590295,0.00049990875,0.0006837662,0.0009498608,0.00034983168,0.00010850836,0.00003882168],"category_scores_gemma":[0.0000063611187,0.00024734254,0.000073844174,0.0010489376,0.000045997673,0.0029617352,0.0000055123965,0.00034363993,0.00008856735],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005126611,0.00009172546,0.0000017369683,0.00004279983,0.000012688325,8.320766e-7,0.0021788992,0.055195678,0.0046082437,0.00028186035,0.000092264825,0.937442],"study_design_scores_gemma":[0.0011748283,0.00043954555,0.000029321818,0.00022861426,0.00008275073,0.00027002528,0.00017941001,0.8006946,0.192485,0.0015290674,0.0021869147,0.0006999462],"about_ca_topic_score_codex":0.000034166616,"about_ca_topic_score_gemma":0.000003927774,"teacher_disagreement_score":0.93674207,"about_ca_system_score_codex":0.000115256364,"about_ca_system_score_gemma":0.00023464845,"threshold_uncertainty_score":0.99999785},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033905454,0.00031101904,0.96386546,0.000011105635,0.00014323962,0.0003435228,0.000014079107,0.00062708935,0.0007790582],"genre_scores_gemma":[0.9846436,0.00004423875,0.014158915,0.00002257096,0.00006883271,0.00009143028,0.0000038053095,0.00012616083,0.00084044185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985695,0.00004819828,0.00032360802,0.0003616762,0.000277843,0.0004191592],"domain_scores_gemma":[0.9994629,0.00008036343,0.000057450696,0.00018084292,0.0000753335,0.00014309048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008929072,0.00035750173,0.0002943748,0.00020930819,0.0004958625,0.000038393708,0.0001119107,0.00014487507,0.0001302522],"category_scores_gemma":[9.146393e-7,0.00033600492,0.00009565356,0.00044776904,0.00010153579,0.00063684944,4.467004e-7,0.0003002842,0.000041692623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018395264,0.000058231686,0.000005766007,0.00010975183,0.000048410395,0.00003820811,0.0012867022,0.93031234,0.058193848,3.321404e-7,0.000058555746,0.009703881],"study_design_scores_gemma":[0.0018862032,0.00044432873,0.000034549852,0.00032980775,0.00012385365,0.0008232,0.00015075682,0.6102933,0.38496205,0.000006885618,0.00011137042,0.00083365844],"about_ca_topic_score_codex":0.0000050967674,"about_ca_topic_score_gemma":0.000009935758,"teacher_disagreement_score":0.95073813,"about_ca_system_score_codex":0.0002562458,"about_ca_system_score_gemma":0.00007685395,"threshold_uncertainty_score":0.9999092},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056824856,0.000055636967,0.9416789,0.000020782394,0.00034438042,0.00032439636,0.000012698485,0.00047469177,0.00026370512],"genre_scores_gemma":[0.9858336,0.000036876674,0.013867022,0.000023518374,0.00006150807,0.000055922254,0.000006257012,0.00005758758,0.00005770172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897796,0.000015471176,0.00034977676,0.00019159478,0.00017351915,0.00029168391],"domain_scores_gemma":[0.9994913,0.000045043045,0.000104725215,0.00012110025,0.00013083674,0.00010699792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015360554,0.00024492308,0.00020995957,0.0002611547,0.0003262722,0.00016761095,0.0000771528,0.000113667054,0.000015772432],"category_scores_gemma":[0.0000033726747,0.00023438354,0.000030739073,0.00034166532,0.00004986691,0.0020147995,0.000001013501,0.0004985222,0.000019124544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006924676,0.000014276046,0.0000037566952,0.00025456044,0.00002080707,0.0000012638478,0.0017848737,0.91391325,0.011530926,0.0000016810924,0.0000030724027,0.072402276],"study_design_scores_gemma":[0.0008762547,0.00007099711,0.000006340831,0.0003264148,0.000027471624,0.000055134762,0.00035388191,0.94143313,0.056361534,0.000025531768,0.00013005844,0.00033325923],"about_ca_topic_score_codex":0.00000894086,"about_ca_topic_score_gemma":0.000015905836,"teacher_disagreement_score":0.9290087,"about_ca_system_score_codex":0.00004244874,"about_ca_system_score_gemma":0.000035373025,"threshold_uncertainty_score":0.9557883},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043795925,0.000035215293,0.9545343,0.000039870072,0.00019539444,0.00020562444,0.0000062949593,0.00037469104,0.0008127201],"genre_scores_gemma":[0.86675805,0.000007591688,0.1331128,0.000014028339,0.000013852509,0.000027149921,0.0000019917736,0.000016585014,0.000047926653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981571,0.00009057375,0.00068602414,0.00035544366,0.0005250806,0.00018579133],"domain_scores_gemma":[0.99858576,0.00010246059,0.0004623896,0.00037359915,0.00038529406,0.00009050875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003457236,0.00018842508,0.00031917458,0.00047037596,0.00017755345,0.00005210845,0.00042601745,0.000103767765,0.00004306072],"category_scores_gemma":[0.000012939387,0.00019598842,0.00012002023,0.0009694904,0.00013541587,0.0013986484,0.0000031517936,0.00016967481,0.0000033647007],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006916237,0.0005839034,0.000021452503,0.00013427198,0.000029165547,0.0000019239951,0.0007675723,0.08118624,0.037109263,0.000323446,0.0000073418933,0.8797662],"study_design_scores_gemma":[0.00023229778,0.00030071172,0.00044886113,0.0001970578,0.00003036993,0.000023805718,0.000030796764,0.54890776,0.44772327,0.0018987957,0.00003424625,0.00017206265],"about_ca_topic_score_codex":0.0001354988,"about_ca_topic_score_gemma":0.000014211313,"teacher_disagreement_score":0.8795942,"about_ca_system_score_codex":0.000094763054,"about_ca_system_score_gemma":0.00016940536,"threshold_uncertainty_score":0.7992176},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010887327,0.00005595152,0.9882228,0.00021716191,0.00017831607,0.00020124739,0.000016383656,0.00012568929,0.000095168914],"genre_scores_gemma":[0.99729645,0.000025743238,0.0024358586,0.00015618054,0.00003511642,0.000012869947,0.0000070048063,0.00000797711,0.000022825876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983744,0.00006877812,0.00058424735,0.00037061342,0.00032139145,0.00028056267],"domain_scores_gemma":[0.99925596,0.00010765597,0.00020176383,0.00022903633,0.00012622868,0.00007938748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031883855,0.00017461684,0.00024784444,0.00019217524,0.00018939989,0.00016433289,0.00030898274,0.00012898813,0.000011776417],"category_scores_gemma":[0.000002268945,0.00017797854,0.00010181627,0.000950676,0.00003258606,0.00069530983,0.0000020441148,0.00032309824,0.0000021770861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001628379,0.00021365183,0.000002882563,0.000010862626,0.000009039915,0.0000065170766,0.00007613657,0.5650076,0.004805495,0.000056436584,0.000024308592,0.4296242],"study_design_scores_gemma":[0.0009601981,0.00012004734,0.00008093852,0.00008578256,0.000011741243,0.000011958612,0.00004725565,0.9365787,0.061447665,0.00048088987,0.0000048484058,0.00016998926],"about_ca_topic_score_codex":0.000019863584,"about_ca_topic_score_gemma":0.000008459215,"teacher_disagreement_score":0.98640907,"about_ca_system_score_codex":0.00007471039,"about_ca_system_score_gemma":0.000042923697,"threshold_uncertainty_score":0.7257754},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068067595,0.00024874543,0.92964107,0.0008220585,0.0000615729,0.00040479467,0.000014075906,0.00008417304,0.000655914],"genre_scores_gemma":[0.9569833,0.000059201066,0.042589974,0.00016296483,0.00003447289,0.000010090039,0.0000025512138,0.000016713977,0.00014071034],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99813676,0.00009609498,0.0005723566,0.00035485975,0.00048164953,0.00035829807],"domain_scores_gemma":[0.999261,0.00010235173,0.00017888052,0.00023432208,0.00013720103,0.00008619812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064462953,0.0002750688,0.00041051683,0.00028219877,0.0004205712,0.00014134732,0.00039049564,0.00012558236,0.000017738228],"category_scores_gemma":[0.0000025254135,0.00019696943,0.00020024055,0.00061519584,0.00014127644,0.0015962884,0.0000011310859,0.00029297135,0.0000017401327],"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.00026182234,0.00021173239,0.0000122671545,0.0001285453,0.000038066002,0.0000035065484,0.0055022836,0.0024335696,0.30158576,0.00041140843,0.0000038702306,0.68940717],"study_design_scores_gemma":[0.0013031224,0.0009178515,0.00035490125,0.00025193355,0.00009322492,0.00007195478,0.00013060302,0.20087166,0.7753487,0.020347165,0.000025280055,0.00028355705],"about_ca_topic_score_codex":0.00009322171,"about_ca_topic_score_gemma":0.00002836253,"teacher_disagreement_score":0.8889157,"about_ca_system_score_codex":0.0000468199,"about_ca_system_score_gemma":0.00015263565,"threshold_uncertainty_score":0.803218},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117436804,0.00018048953,0.8787495,0.00002753061,0.00005586682,0.0001634084,0.000012175088,0.0016029134,0.0017713023],"genre_scores_gemma":[0.9794811,0.00006648283,0.020173388,0.00002992912,0.000033330085,0.000014753225,0.0000025464851,0.000050084836,0.00014840638],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989064,0.000023903638,0.00028560538,0.00020524794,0.00023296238,0.0003459098],"domain_scores_gemma":[0.99938965,0.00010532458,0.000059708746,0.000253157,0.00007557035,0.00011657754],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026105205,0.00022633986,0.00020547374,0.00025024178,0.0005706077,0.00004594597,0.00029502824,0.00013999469,0.0001167324],"category_scores_gemma":[0.0000013682649,0.00025900148,0.00009266381,0.0003539325,0.00009487003,0.0005463454,0.0000041305793,0.00050030224,0.000072929106],"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.0001519225,0.00014698906,0.000036983278,0.00011149824,0.000050964623,0.000013563651,0.00090426556,0.33949685,0.19975077,0.00001905642,0.000070726135,0.4592464],"study_design_scores_gemma":[0.0004837983,0.000094480274,0.00019488802,0.0001648753,0.000052515057,0.000041891966,0.0002168855,0.1923247,0.80470127,0.0002022745,0.0009208741,0.00060156645],"about_ca_topic_score_codex":0.000008539997,"about_ca_topic_score_gemma":0.000027982227,"teacher_disagreement_score":0.8620443,"about_ca_system_score_codex":0.0001846394,"about_ca_system_score_gemma":0.000024488929,"threshold_uncertainty_score":0.99998623},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034899756,0.000042844953,0.9639178,0.00036304246,0.00027956985,0.00018089035,0.000009843796,0.00018298204,0.00012327037],"genre_scores_gemma":[0.9054782,0.0000015433687,0.0941334,0.000105511484,0.000052168587,0.0000132799305,9.871046e-7,0.00002310474,0.0001918522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978017,0.000053443702,0.00057288754,0.0004500407,0.00081863155,0.00030327798],"domain_scores_gemma":[0.9989729,0.00026563206,0.0001615473,0.00027629128,0.00019877867,0.00012483966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007467868,0.00020358458,0.0002252926,0.00035894077,0.0006710679,0.00033079126,0.00032529744,0.000104206265,0.0001033157],"category_scores_gemma":[0.00006860754,0.00016899328,0.00011159713,0.0012265369,0.00009909976,0.00079634454,0.0000015335986,0.00027728692,0.00013238155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018156237,0.000095184405,0.0000061587284,0.000009977525,0.000007334742,0.0000047046524,0.00024673692,0.9625368,0.005026021,0.00021477551,0.00000664847,0.031827495],"study_design_scores_gemma":[0.00049170776,0.00006449181,0.00015117727,0.00012079106,0.000034434735,0.000025565927,0.00011771564,0.9507159,0.020128557,0.027862983,0.00004274006,0.00024394658],"about_ca_topic_score_codex":0.000025368054,"about_ca_topic_score_gemma":0.00001282966,"teacher_disagreement_score":0.8705784,"about_ca_system_score_codex":0.00020259288,"about_ca_system_score_gemma":0.00029162888,"threshold_uncertainty_score":0.6891346},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016402569,0.00017276806,0.9817834,0.00023231865,0.00009436394,0.00032289446,0.000017441509,0.00035092048,0.0006233499],"genre_scores_gemma":[0.9941295,0.00003187332,0.0040628286,0.00017515488,0.00002058389,0.00007325179,0.00000415787,0.000019974224,0.0014827123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980599,0.00016537953,0.0006326305,0.00043249532,0.0004921388,0.00021741397],"domain_scores_gemma":[0.9990279,0.00008127538,0.00025646942,0.0003535212,0.00019764561,0.00008316544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004826178,0.00018571872,0.00023005872,0.00024837322,0.0002539141,0.00034374805,0.0005667459,0.00013616538,0.000099592515],"category_scores_gemma":[0.0000015408922,0.00018985236,0.00009137051,0.0007081867,0.000089989764,0.0011045925,0.0000017929418,0.00025230186,0.00004829287],"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.000111669906,0.00070432754,0.000009267217,0.0002053001,0.000062312836,0.000003887616,0.0024729385,0.113241136,0.2657622,0.00014367748,0.0013768137,0.6159065],"study_design_scores_gemma":[0.00053256954,0.0001831726,0.000027481576,0.00021689381,0.000030395495,0.000019273906,0.00007036933,0.5288851,0.46788302,0.00033246912,0.0014569991,0.00036223122],"about_ca_topic_score_codex":0.000021255017,"about_ca_topic_score_gemma":0.0000021753367,"teacher_disagreement_score":0.9777269,"about_ca_system_score_codex":0.000054396736,"about_ca_system_score_gemma":0.000120897326,"threshold_uncertainty_score":0.7741955},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071541225,0.00008667744,0.99203336,0.000016879378,0.00007720479,0.000113128524,0.000004995578,0.00037949526,0.00013414623],"genre_scores_gemma":[0.90571177,0.000008523086,0.09418219,0.00004448338,0.0000075276016,0.000025550258,5.934773e-7,0.000010660489,0.000008706202],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985943,0.00012126991,0.00033974496,0.00038486626,0.00030244197,0.00025739195],"domain_scores_gemma":[0.999165,0.00011783352,0.000174396,0.00032933147,0.0001397828,0.000073653464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028363246,0.00018662268,0.00025551204,0.0009925284,0.00036450897,0.0000794151,0.00031860248,0.00009404573,0.000011264141],"category_scores_gemma":[0.000002553842,0.00017722961,0.00033817417,0.0034893774,0.00008626413,0.00070042163,0.0000013836494,0.00022192908,0.0000011218253],"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.00006222012,0.00045419284,0.0005034861,0.00011374746,0.00042085946,0.00000528348,0.0010404658,0.027634615,0.07482763,0.0003874805,0.0000025873874,0.89454746],"study_design_scores_gemma":[0.00018864342,0.00020344766,0.000104500425,0.000042813113,0.00017195017,0.000008095868,0.000037604266,0.04719997,0.94313896,0.008378273,0.00025883058,0.00026693914],"about_ca_topic_score_codex":0.000019785864,"about_ca_topic_score_gemma":0.000017193479,"teacher_disagreement_score":0.89855766,"about_ca_system_score_codex":0.00002510847,"about_ca_system_score_gemma":0.000033056673,"threshold_uncertainty_score":0.72272134},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020427125,0.000015607393,0.97670525,0.000049917046,0.00028545494,0.00039313908,0.000046591125,0.00014921211,0.0019277077],"genre_scores_gemma":[0.9802734,0.000003787985,0.019180952,0.00022137705,0.000025083398,0.00012725788,0.000006320497,0.0000164031,0.00014537574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987261,0.000050519633,0.00034735206,0.00039010265,0.00019266717,0.00029322912],"domain_scores_gemma":[0.999451,0.000108883636,0.00009999767,0.00016292185,0.00010528371,0.00007191421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001733176,0.00017496399,0.00016292541,0.00034339103,0.000261655,0.00022688837,0.00024146694,0.00006592358,0.00010594397],"category_scores_gemma":[0.000004154785,0.00017804916,0.000095165575,0.00037040302,0.000052884498,0.0016962339,0.0000016875609,0.00014904872,0.00001747869],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018086142,0.0003076695,0.00006618265,0.00007614575,0.00003390767,0.000015021705,0.0032666745,0.0009800171,0.008907773,0.00065995584,0.000115511386,0.9853903],"study_design_scores_gemma":[0.008290948,0.0036197284,0.0028006996,0.001091349,0.00017074651,0.0009883863,0.0017046045,0.46733153,0.4660988,0.044209626,0.0012506125,0.0024429918],"about_ca_topic_score_codex":0.000032177442,"about_ca_topic_score_gemma":0.000057554113,"teacher_disagreement_score":0.9829473,"about_ca_system_score_codex":0.000105087,"about_ca_system_score_gemma":0.00011955105,"threshold_uncertainty_score":0.72606343},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003905941,0.00010146755,0.9939163,0.0001677302,0.0001749576,0.0006870173,0.000036486214,0.0008848342,0.0001252668],"genre_scores_gemma":[0.59948725,0.0000016642396,0.39996803,0.00025573702,0.00009539948,0.00009206002,0.000006349705,0.0000390483,0.00005448652],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99679863,0.00009793725,0.0008313779,0.00089486263,0.0007066147,0.0006705759],"domain_scores_gemma":[0.9976912,0.00086007273,0.00046160037,0.00030413544,0.00043990582,0.00024306843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015392595,0.0003951557,0.00037780273,0.00040858105,0.0008029234,0.00073353044,0.0007182757,0.0002523955,0.000038461443],"category_scores_gemma":[0.000017173053,0.00039735454,0.00015837779,0.0006265111,0.000080175574,0.0016459591,0.0000047426247,0.00068323076,0.0000098119235],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011626931,0.0003031085,0.00000749722,0.000071628536,0.00005072082,0.000010140277,0.0033002824,0.0035583472,0.19426362,0.00006144692,0.000005404272,0.7982515],"study_design_scores_gemma":[0.0007097737,0.00034008594,0.00003334344,0.00017428132,0.000051190782,0.000024567982,0.0005993922,0.45850033,0.53278756,0.0061171954,0.00010767065,0.00055458705],"about_ca_topic_score_codex":0.000044065164,"about_ca_topic_score_gemma":0.00003656932,"teacher_disagreement_score":0.79769695,"about_ca_system_score_codex":0.0001228254,"about_ca_system_score_gemma":0.00020826091,"threshold_uncertainty_score":0.9998478},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048683323,0.00006685288,0.9938139,0.000046058336,0.00043641686,0.0003122292,0.0000011333573,0.00026631873,0.0001887921],"genre_scores_gemma":[0.95601803,0.000012022156,0.0435306,0.00012801655,0.000076653865,0.00009539403,0.0000011760102,0.00003115551,0.00010698018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983616,0.00008430881,0.00038894758,0.0005142354,0.00023523353,0.0004157037],"domain_scores_gemma":[0.99928886,0.000100696605,0.00014593067,0.00024033053,0.00013145141,0.000092737304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029655328,0.00021197021,0.00019034267,0.00030921504,0.00030947805,0.000106540596,0.0003241651,0.00016907392,0.000016425805],"category_scores_gemma":[0.0000029162657,0.00022083981,0.0001037187,0.00081456784,0.00004057874,0.00052179734,0.0000024681128,0.00028880662,0.000007986928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062320294,0.00015192576,0.0000063689176,0.0000146883085,0.000006246009,0.0000032705616,0.00032384574,0.73126215,0.00073333865,0.000030819614,0.0000022452136,0.26740277],"study_design_scores_gemma":[0.00048344868,0.00015562799,0.00007546391,0.00010689287,0.000013368153,0.000013340689,0.000031193853,0.9525497,0.046183757,0.00011119608,0.000038203358,0.00023782224],"about_ca_topic_score_codex":0.000022419592,"about_ca_topic_score_gemma":0.00005618923,"teacher_disagreement_score":0.95114964,"about_ca_system_score_codex":0.000119230215,"about_ca_system_score_gemma":0.00005085402,"threshold_uncertainty_score":0.9005586},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011528527,0.000054239896,0.99827415,0.000052128817,0.00010848997,0.00016648855,0.0000120868735,0.00010716407,0.00007241502],"genre_scores_gemma":[0.8276453,0.0000023468776,0.17208445,0.00015027005,0.000027615257,0.000014926722,0.000008150487,0.000010605359,0.000056302128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985896,0.000024587578,0.00046315783,0.00033523527,0.0003283983,0.00025901612],"domain_scores_gemma":[0.99903613,0.00017839637,0.00025928058,0.00015775346,0.00029184145,0.00007661829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005351204,0.00014290767,0.00022667674,0.0007073558,0.00033947092,0.00008284259,0.0002579346,0.00009531899,0.000014353385],"category_scores_gemma":[0.0000074247473,0.00014061513,0.00014943868,0.0022764392,0.00003168384,0.0007297699,0.000001319044,0.00011088305,0.0000026175871],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024869343,0.00014132244,0.000023286724,0.000041227533,0.00010261348,0.0000011178079,0.0004199338,0.08128878,0.0042450167,0.000009350395,0.0000033870804,0.9136991],"study_design_scores_gemma":[0.00025251956,0.00007815205,0.00004763692,0.0000474791,0.00017009114,0.0000014095806,0.0000562739,0.6962203,0.3026878,0.00028962604,0.000031342293,0.00011743517],"about_ca_topic_score_codex":0.000006203666,"about_ca_topic_score_gemma":0.000021073094,"teacher_disagreement_score":0.91358167,"about_ca_system_score_codex":0.00005948852,"about_ca_system_score_gemma":0.00010746108,"threshold_uncertainty_score":0.5734119},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16773939,0.00003762138,0.8317209,0.000024659297,0.000018310642,0.00033574514,0.000013836965,0.00004417084,0.00006537422],"genre_scores_gemma":[0.9778481,0.000007295234,0.022020923,0.00003524024,0.000007218011,0.000039248273,0.0000020752168,0.000013548734,0.000026338155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987726,0.00006810732,0.00037701457,0.0003158072,0.00027175143,0.0001946784],"domain_scores_gemma":[0.9994419,0.00008234163,0.00016790538,0.00012879154,0.00010627108,0.00007279226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019038617,0.00016653104,0.00021143745,0.00015430966,0.00014468926,0.00013575873,0.00013111286,0.000037125723,0.000011804955],"category_scores_gemma":[2.6398774e-7,0.00014607022,0.000027747386,0.00027911496,0.00007277042,0.0010101985,0.0000021759554,0.000081404505,9.946014e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015475803,0.00011489715,0.000025169582,0.0004999076,0.000047950143,0.0000068873464,0.0035108207,0.01462962,0.018784637,0.00006889957,0.000005648873,0.9621508],"study_design_scores_gemma":[0.002773651,0.001015971,0.00028235454,0.0006283779,0.00006187468,0.00011244534,0.0009935006,0.5754556,0.4181827,0.00017205322,0.0000071947056,0.0003142781],"about_ca_topic_score_codex":0.000042872096,"about_ca_topic_score_gemma":0.000014028416,"teacher_disagreement_score":0.9618365,"about_ca_system_score_codex":0.000032829943,"about_ca_system_score_gemma":0.00008227002,"threshold_uncertainty_score":0.59565705},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14883517,0.000058347498,0.85000014,0.000034054912,0.000111347355,0.00028865327,0.000004058337,0.00023009187,0.000438153],"genre_scores_gemma":[0.9194601,0.000010166309,0.08042727,0.000025629775,0.000004729336,0.00002363718,0.0000022075762,0.000020924956,0.000025299352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812007,0.000109289365,0.00075420935,0.00040461525,0.0004042471,0.00020758685],"domain_scores_gemma":[0.99878585,0.00009323427,0.0004899915,0.00024638503,0.00029719013,0.00008733069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042756528,0.00023187135,0.00034257307,0.0006022328,0.00014748955,0.000072947594,0.00033461937,0.00017916126,0.000040494604],"category_scores_gemma":[0.000019569077,0.00023923111,0.00007124043,0.00094981166,0.00016245796,0.0011319804,0.000005528448,0.00028646458,0.00000407035],"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.00036740367,0.0010766309,0.0031997699,0.0006430969,0.00008607698,0.00003085645,0.019045517,0.4183802,0.039849892,0.00020292719,0.00001000718,0.5171076],"study_design_scores_gemma":[0.00057180645,0.0003020769,0.0019536125,0.0006657062,0.000035591584,0.000024305797,0.00003870331,0.77881545,0.21632493,0.0010231221,0.0000016849526,0.00024302649],"about_ca_topic_score_codex":0.00033663513,"about_ca_topic_score_gemma":0.00008299748,"teacher_disagreement_score":0.770625,"about_ca_system_score_codex":0.000055691897,"about_ca_system_score_gemma":0.00027747202,"threshold_uncertainty_score":0.9755562},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023666294,0.000015691192,0.9741382,0.00032939558,0.00040443035,0.00024481743,0.000018257591,0.00027406498,0.00090887217],"genre_scores_gemma":[0.9900554,0.0000025502654,0.00943724,0.00024538743,0.00010601684,0.000017057704,0.0000034239192,0.000022706117,0.00011025084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982963,0.00007216364,0.00029190377,0.0005665318,0.0003259475,0.00044710605],"domain_scores_gemma":[0.9991703,0.00015221612,0.00010223778,0.00020276637,0.00020654025,0.00016594815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000193724,0.00025974808,0.00023765783,0.00032048734,0.00063831283,0.00041427655,0.00020284999,0.00011444514,0.00006775179],"category_scores_gemma":[0.0000036257104,0.00023114156,0.00006497479,0.0014574341,0.00013217976,0.0007784528,0.0000028474337,0.0010293322,0.000041349293],"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.0002459068,0.00048113812,0.000028686547,0.000021419843,0.000073610885,0.00015004468,0.0011670832,0.05861915,0.008178352,0.00008464569,0.000040500217,0.93090945],"study_design_scores_gemma":[0.0018159822,0.0005341334,0.00023373797,0.0002529259,0.000039438866,0.00041540916,0.000523331,0.9619583,0.032950502,0.00036438683,0.0003115193,0.0006003441],"about_ca_topic_score_codex":0.000043868436,"about_ca_topic_score_gemma":0.00061486167,"teacher_disagreement_score":0.96638906,"about_ca_system_score_codex":0.00006497469,"about_ca_system_score_gemma":0.00020898819,"threshold_uncertainty_score":0.94256794},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01593957,0.00018016722,0.97989434,0.0000015872788,0.00021585327,0.00048004914,0.000007684739,0.00048065942,0.0028000749],"genre_scores_gemma":[0.97758585,0.000017583467,0.02200395,0.000011113845,0.000046361725,0.0001815103,0.0000030707197,0.00009419181,0.00005636746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845177,0.000055659493,0.00052630703,0.00034214059,0.00020265272,0.0004214804],"domain_scores_gemma":[0.99948835,0.0000621283,0.00006862973,0.00019373334,0.00007597236,0.00011117372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000220474,0.00029658573,0.00032842823,0.00031199,0.00010530798,0.000059703092,0.00017231476,0.00020463768,0.000038103553],"category_scores_gemma":[0.0000023575712,0.00029241855,0.00006760359,0.00045013346,0.000104972416,0.0005708585,0.0000011562305,0.00048391978,0.000034902703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050892493,0.00016240991,0.0000074285567,0.00045088903,0.000018402094,0.000007509192,0.0029109265,0.97584033,0.004513902,0.00014982623,7.792729e-7,0.0158867],"study_design_scores_gemma":[0.0006426018,0.000032015552,0.0000036160284,0.00038144208,0.000028237075,0.00001942256,0.00082121236,0.9773236,0.02035656,0.000042352232,0.000012361227,0.00033656898],"about_ca_topic_score_codex":0.000018163848,"about_ca_topic_score_gemma":0.0000061217006,"teacher_disagreement_score":0.96164626,"about_ca_system_score_codex":0.00018430332,"about_ca_system_score_gemma":0.000030854015,"threshold_uncertainty_score":0.9999528},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009985261,0.00016288024,0.98821485,0.000084971354,0.000031041785,0.00069385226,0.000028851526,0.0004423883,0.0003559171],"genre_scores_gemma":[0.9734273,0.000023251205,0.025935918,0.00001524199,0.000025200568,0.00023715624,0.0000030377332,0.000068342124,0.00026456904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990434,0.000062662264,0.00029394572,0.00017508396,0.00020773943,0.00021713461],"domain_scores_gemma":[0.99881464,0.0005958994,0.00011247682,0.00029050783,0.00015242472,0.00003404787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019619649,0.00021220605,0.00023978692,0.00014109198,0.00024015851,0.000038241615,0.0002324454,0.00009515004,0.000012133184],"category_scores_gemma":[0.0000033922393,0.000162216,0.00006056018,0.00028269595,0.00010924929,0.00016635997,8.245288e-7,0.0002327809,0.0000061538376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014442112,0.00006793836,3.520602e-7,0.00012310775,0.000031975746,5.127305e-7,0.00009677711,0.9165413,0.08060229,0.00004490767,0.0001737691,0.0021726694],"study_design_scores_gemma":[0.00030303383,0.00018736796,5.6926854e-7,0.00042581014,0.000043231405,0.000004049712,0.00009673585,0.5901409,0.40828747,0.00018559855,0.00014427172,0.00018098451],"about_ca_topic_score_codex":0.000012468748,"about_ca_topic_score_gemma":0.0000034904663,"teacher_disagreement_score":0.963442,"about_ca_system_score_codex":0.000084836975,"about_ca_system_score_gemma":0.000041436288,"threshold_uncertainty_score":0.66149765},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023599906,0.00003121391,0.97504646,0.000035753812,0.0001648865,0.00028357294,0.0000053474964,0.00035839615,0.00047448036],"genre_scores_gemma":[0.8666462,0.000011993558,0.13305257,0.000035436613,0.000049878257,0.00010326178,0.000008687049,0.000058259804,0.00003372829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989002,0.000028939696,0.00029716772,0.00029061784,0.00018162036,0.00030148876],"domain_scores_gemma":[0.9995912,0.00006941688,0.000028175671,0.00011451887,0.000047769612,0.00014893757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001301881,0.0002129558,0.00018523683,0.00028590398,0.0001088085,0.00005331742,0.00011753764,0.00015875736,0.000037180147],"category_scores_gemma":[0.000002639975,0.00022177723,0.000045966506,0.000626835,0.000034128956,0.0003576119,4.367448e-7,0.0006177276,0.000015794363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031247513,0.000065866414,0.0000019003058,0.000036592028,0.000003993247,0.0000011713333,0.0007979655,0.6675812,0.029353365,0.0000026345067,0.0000023840173,0.30212167],"study_design_scores_gemma":[0.00039742197,0.000023914135,0.00007783105,0.00009090183,0.000011064372,0.0000050213075,0.00012951186,0.9905516,0.008335883,0.00005751378,0.00006837177,0.00025097845],"about_ca_topic_score_codex":0.0000054336483,"about_ca_topic_score_gemma":0.000044698812,"teacher_disagreement_score":0.84304625,"about_ca_system_score_codex":0.00007022972,"about_ca_system_score_gemma":0.000036481135,"threshold_uncertainty_score":0.9043813},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014340659,0.000015362706,0.9971826,0.0001075031,0.00035562622,0.0004696137,0.000012087835,0.0002243021,0.00019880688],"genre_scores_gemma":[0.9656312,0.0000058317246,0.033785228,0.00024413488,0.0001121399,0.00010160322,0.000027871396,0.000018415687,0.000073597985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860275,0.000059755675,0.00037613342,0.00040191045,0.00023735459,0.00032209972],"domain_scores_gemma":[0.9992386,0.00008308898,0.00013517827,0.00017380016,0.00027717947,0.00009216274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032000252,0.0001900458,0.00018198346,0.00021774521,0.00039465204,0.00041519423,0.00020734074,0.00017797452,0.000010174256],"category_scores_gemma":[0.00000529168,0.00019032902,0.00007440713,0.0008389724,0.000051373605,0.0012682299,0.000002011775,0.00044212383,0.0000055942055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048057773,0.0001588647,0.0000032864625,0.000032089607,0.000005749115,0.0000011263342,0.0003104348,0.86268556,0.00083855836,0.00031198596,0.000048268736,0.13555601],"study_design_scores_gemma":[0.0006734167,0.000109352586,0.000019151996,0.000044299057,0.000009960606,0.000043489443,0.000115581664,0.99125963,0.006806151,0.00017085714,0.00052581093,0.00022231253],"about_ca_topic_score_codex":0.00000990802,"about_ca_topic_score_gemma":0.000036816793,"teacher_disagreement_score":0.9641971,"about_ca_system_score_codex":0.000073688025,"about_ca_system_score_gemma":0.000079414196,"threshold_uncertainty_score":0.77613926},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006743453,0.0007354831,0.98936254,0.000031261774,0.00018388128,0.0005433493,0.00002230826,0.002201227,0.00017652693],"genre_scores_gemma":[0.93962765,0.00002694045,0.059424553,0.000046137055,0.00010468602,0.00044836363,0.000004418279,0.00013028519,0.00018698134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985489,0.000034550954,0.00052034477,0.00028453796,0.0002173456,0.0003943214],"domain_scores_gemma":[0.9989961,0.0003114024,0.00011406604,0.00031827067,0.00015154907,0.00010861665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019128516,0.00030285472,0.00028660684,0.00023529996,0.0004736998,0.00011849496,0.0002958301,0.0001888406,0.000016992488],"category_scores_gemma":[0.000008449462,0.00032911662,0.00012263318,0.00028139827,0.000054664644,0.0006301372,0.000001776135,0.00046827726,0.000025992746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017067236,0.000032515552,0.00000391661,0.0001273569,0.000019108264,2.8368464e-7,0.00024582737,0.61787117,0.010044741,0.0000046720734,0.000026150976,0.3716072],"study_design_scores_gemma":[0.0003961662,0.00003869232,0.0000034758332,0.00026865024,0.000031356984,0.000008084428,0.0001305072,0.8409341,0.15605216,0.00004299339,0.0017605295,0.00033328886],"about_ca_topic_score_codex":0.0000064653577,"about_ca_topic_score_gemma":0.000021828717,"teacher_disagreement_score":0.93288416,"about_ca_system_score_codex":0.00026507172,"about_ca_system_score_gemma":0.00004209628,"threshold_uncertainty_score":0.9999161},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017293314,0.00025780857,0.9817825,0.00005428814,0.000092798844,0.00023284351,0.00003032844,0.0002241267,0.000032005],"genre_scores_gemma":[0.91414154,0.000009746248,0.08563894,0.000076657816,0.000053772394,0.000022601127,0.000008173149,0.000032105145,0.000016445592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758154,0.00011053365,0.0005765143,0.0006704578,0.00067728193,0.00038366855],"domain_scores_gemma":[0.99867463,0.00028567025,0.0002390142,0.00026153267,0.000363156,0.00017600234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025903631,0.0003223931,0.0003680363,0.00027545178,0.00074445043,0.00019851704,0.00037188135,0.0001367516,0.00003105293],"category_scores_gemma":[0.000007455395,0.00028345216,0.000060028444,0.00048294896,0.00028570247,0.0012253103,0.000008916776,0.00052923104,0.0000037012655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037595356,0.00017082556,0.000005688692,0.000091089525,0.000021293312,0.000016515267,0.0016224395,0.5244349,0.0012326249,0.000047932674,0.000013576042,0.47196713],"study_design_scores_gemma":[0.0010752559,0.00049260963,0.000012567654,0.0005822073,0.000057593345,0.00019814906,0.00031407276,0.99390066,0.0025563373,0.00047734953,0.0000066134567,0.00032658235],"about_ca_topic_score_codex":0.000059737555,"about_ca_topic_score_gemma":0.000022400389,"teacher_disagreement_score":0.89684826,"about_ca_system_score_codex":0.00005922764,"about_ca_system_score_gemma":0.00023930114,"threshold_uncertainty_score":0.9999618},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074036573,0.000017919565,0.99174994,0.000081850674,0.00008338724,0.0003875914,0.00005254443,0.00008676581,0.00013633705],"genre_scores_gemma":[0.89768195,0.0000034162026,0.10204993,0.00003805146,0.000019383433,0.000018231583,0.000032747346,0.000020871114,0.0001354239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878526,0.000026707348,0.00041979694,0.00032515326,0.00024468926,0.00019839754],"domain_scores_gemma":[0.99927986,0.00005914528,0.00025587273,0.00011856946,0.0002350104,0.000051542615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010370525,0.00016460047,0.00016516428,0.00024487026,0.00021524378,0.0005691399,0.00011481287,0.000047141126,0.0000050495005],"category_scores_gemma":[0.0000043924074,0.00017298138,0.00005654659,0.00043592753,0.000050429684,0.002859272,0.0000026789262,0.000047615107,6.441197e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006026484,0.00012025535,0.000016184506,0.00011224648,0.000008806415,4.6164436e-7,0.00038409984,0.93379945,0.009912039,0.0001216227,0.00003934802,0.055425223],"study_design_scores_gemma":[0.00071586476,0.00016412848,0.00003399307,0.00010260424,0.000021770114,0.0000075736757,0.00007525199,0.93978614,0.05782185,0.0010637495,0.000023480714,0.00018357823],"about_ca_topic_score_codex":0.00002519981,"about_ca_topic_score_gemma":0.000004761575,"teacher_disagreement_score":0.8902783,"about_ca_system_score_codex":0.00007628609,"about_ca_system_score_gemma":0.00008921282,"threshold_uncertainty_score":0.7053976},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00854055,0.00017555735,0.98979175,0.000029883246,0.000014287232,0.00029464782,0.0000029242015,0.00020465795,0.0009457307],"genre_scores_gemma":[0.9256871,0.000005126176,0.074183494,0.000017392551,0.000013732237,0.000015205602,0.0000010405632,0.000021658812,0.000055302862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991013,0.0000139853,0.00033318877,0.00013446891,0.0002519023,0.0001651544],"domain_scores_gemma":[0.99959207,0.00009727533,0.000063830164,0.00008501754,0.000094717965,0.00006708556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002649637,0.00012342895,0.00015500336,0.00017927392,0.00008678843,0.000016069873,0.0000849554,0.00005386461,0.000012467539],"category_scores_gemma":[0.0000049506393,0.00010461338,0.000033282835,0.0005298003,0.000036079327,0.00021702521,6.79753e-7,0.00014330738,0.000001880759],"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.00006614999,0.000054045147,0.000008533687,0.00013214319,0.000020044869,4.7274085e-7,0.00028206134,0.35734123,0.35414848,0.00001726674,0.000030174479,0.28789943],"study_design_scores_gemma":[0.0001467101,0.00011036897,0.00023891793,0.0001280299,0.000032693177,0.000008763526,0.000024403365,0.092320934,0.9063874,0.00047439817,0.000008874594,0.00011850877],"about_ca_topic_score_codex":0.0000046633436,"about_ca_topic_score_gemma":0.0000015358298,"teacher_disagreement_score":0.9171465,"about_ca_system_score_codex":0.000045251014,"about_ca_system_score_gemma":0.00003777053,"threshold_uncertainty_score":0.42660096},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043597117,0.000030096839,0.9548502,0.00015954014,0.00031344587,0.0007226121,0.000019122837,0.000282554,0.00002531526],"genre_scores_gemma":[0.93349123,0.000004499495,0.06596352,0.00013838391,0.0001276324,0.00017807884,0.000008851629,0.00003266635,0.000055154425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975907,0.00017360636,0.0005111242,0.00068343844,0.00040088972,0.00064020057],"domain_scores_gemma":[0.9988878,0.00021996391,0.00021115462,0.0002939061,0.00022767094,0.00015954103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031259586,0.0003014305,0.0003553782,0.00021719176,0.0006109441,0.00022836191,0.00040890163,0.00014409823,0.000009465609],"category_scores_gemma":[0.000005632955,0.0003147293,0.00012359914,0.00072526466,0.000057265283,0.0016716385,0.0000027015149,0.00028692395,0.000008253004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009227034,0.0009035954,0.00008377638,0.00013071942,0.00012852144,0.0000786267,0.0042267083,0.6571122,0.064437866,0.00018630236,0.000052869458,0.27173615],"study_design_scores_gemma":[0.0024870087,0.00023845116,0.00044406607,0.00021540388,0.000019936631,0.00004632733,0.00030888166,0.9739112,0.021626065,0.00019545128,0.00007841855,0.0004287736],"about_ca_topic_score_codex":0.00006731243,"about_ca_topic_score_gemma":0.000028274584,"teacher_disagreement_score":0.88989407,"about_ca_system_score_codex":0.00027123402,"about_ca_system_score_gemma":0.0001583705,"threshold_uncertainty_score":0.9999305},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003504545,0.00007079703,0.99831873,0.00017589782,0.000027533702,0.00046394486,0.000014159118,0.00013171218,0.00044675812],"genre_scores_gemma":[0.7629276,0.00001245107,0.23663026,0.00013252009,0.000010041539,0.00014369123,0.000005483727,0.000013187394,0.0001247562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878824,0.000066371314,0.0003917384,0.0002693619,0.00023604621,0.00024821912],"domain_scores_gemma":[0.9991685,0.00023216396,0.00011326475,0.00027252137,0.00014466308,0.00006887808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002769028,0.00014811422,0.00015603671,0.000149625,0.00035184194,0.00022468255,0.00061576604,0.000046478373,0.00007368548],"category_scores_gemma":[0.0000015667364,0.00014888636,0.000088422996,0.00046809696,0.00007764619,0.0011782649,0.0000025649833,0.000115740186,0.00001497743],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051520452,0.00020386407,0.0000012836176,0.00004136111,0.000018209927,4.42556e-7,0.0004956836,0.007355359,0.006726946,0.00015714215,0.000011102781,0.9849371],"study_design_scores_gemma":[0.00090101204,0.0006498264,0.000027443244,0.00018427115,0.00005237862,0.000027390184,0.00006254889,0.9373448,0.055124667,0.0038743126,0.0013807754,0.0003705938],"about_ca_topic_score_codex":0.000005182274,"about_ca_topic_score_gemma":0.0000030034457,"teacher_disagreement_score":0.9845665,"about_ca_system_score_codex":0.000030562092,"about_ca_system_score_gemma":0.00011451795,"threshold_uncertainty_score":0.60714096},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3534677,0.00006711175,0.64572376,0.0000063841435,0.000022795719,0.00013074958,0.0000025939148,0.000033486256,0.0005453838],"genre_scores_gemma":[0.99488765,0.000009653433,0.004990841,0.000011807963,0.000011186116,0.00003085125,0.000002208336,0.000024616145,0.000031168038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925655,0.000053111253,0.0002987417,0.00009981043,0.00014908313,0.00014268844],"domain_scores_gemma":[0.9996315,0.00004432659,0.000074617106,0.0001808464,0.00005133782,0.000017347455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120599645,0.000108639935,0.00014944344,0.00005827915,0.00009890165,0.00002933657,0.00015241721,0.0000716743,0.000033256925],"category_scores_gemma":[5.5021644e-7,0.000085796244,0.000044979435,0.0005239516,0.000043798038,0.00015396927,0.0000017120962,0.0002468142,8.070718e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011790551,0.000066218956,0.0004530938,0.000059418293,0.0000068334766,4.289797e-7,0.00014778366,0.9861842,0.0018340264,0.0000018577998,0.0000033084352,0.01123105],"study_design_scores_gemma":[0.00030200815,0.000010073385,0.0004842795,0.0002635647,0.000016126924,0.000006169668,0.000082034516,0.9380152,0.060715612,0.0000056433796,0.000008182422,0.00009108884],"about_ca_topic_score_codex":0.000027852175,"about_ca_topic_score_gemma":0.00008095908,"teacher_disagreement_score":0.64141995,"about_ca_system_score_codex":0.000028217792,"about_ca_system_score_gemma":0.000021816524,"threshold_uncertainty_score":0.34986696},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03593306,0.00022115806,0.96247965,0.000033376487,0.000027749975,0.00029614114,0.0000041018534,0.00083597464,0.00016880491],"genre_scores_gemma":[0.9307866,0.00004430156,0.06899601,0.00003157186,0.000018840541,0.000022788585,0.0000021019252,0.000055729364,0.000042018317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99890864,0.000043681423,0.00025323653,0.00024102358,0.00026085146,0.0002925889],"domain_scores_gemma":[0.99935716,0.00016334202,0.0000805964,0.00017484014,0.00011435791,0.00010970443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029752773,0.00023737932,0.00020249482,0.0003058168,0.00054467225,0.00008363539,0.00016912576,0.0001097787,0.000023521006],"category_scores_gemma":[0.0000014023848,0.00024323408,0.000038474052,0.00042379933,0.000107925654,0.0006370133,0.000004406759,0.0004016369,0.00000418014],"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.0005652267,0.000095462594,0.00012765017,0.00028227034,0.00009990664,0.000024745686,0.002972257,0.48242953,0.13555242,0.00007392004,0.000017149587,0.37775946],"study_design_scores_gemma":[0.00081562536,0.00023391604,0.00011971434,0.0004723718,0.000080681115,0.000040443276,0.0010459231,0.31807965,0.6778715,0.0006638641,0.00004037077,0.00053593],"about_ca_topic_score_codex":0.000012807178,"about_ca_topic_score_gemma":0.000029716455,"teacher_disagreement_score":0.8948536,"about_ca_system_score_codex":0.00015345062,"about_ca_system_score_gemma":0.0000252255,"threshold_uncertainty_score":0.9918798},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014817779,0.00017257818,0.9958801,0.000036177433,0.00015233963,0.0004250816,0.00015639975,0.001283923,0.000411609],"genre_scores_gemma":[0.68392533,0.000010209773,0.31532308,0.00002876686,0.0001985293,0.0002556778,0.0000035768594,0.000088821434,0.00016599779],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986598,0.000016228685,0.00030731675,0.00036074113,0.00020339976,0.00045253694],"domain_scores_gemma":[0.9994709,0.00007960391,0.000060753802,0.00015315137,0.00012468499,0.00011092127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000081376966,0.00034060274,0.00026734272,0.00021549506,0.00029649085,0.000076358345,0.00016465652,0.00012189445,0.000053941607],"category_scores_gemma":[0.0000018919732,0.00037553924,0.0001417234,0.00022647543,0.000074379015,0.0007015027,0.0000019567851,0.00037403588,0.000018789447],"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.00004200583,0.000044019373,6.93444e-8,0.000044419743,0.000030246138,0.000002703528,0.00034196526,0.305438,0.01723386,0.000009211361,0.000038517308,0.676775],"study_design_scores_gemma":[0.00040921985,0.000264841,0.0000040178247,0.00034871543,0.000033144028,0.00003840217,0.0002483928,0.64524364,0.3518755,0.00026244493,0.0008282935,0.0004433919],"about_ca_topic_score_codex":0.0000026884152,"about_ca_topic_score_gemma":0.000006606961,"teacher_disagreement_score":0.68244356,"about_ca_system_score_codex":0.00026934847,"about_ca_system_score_gemma":0.00003269018,"threshold_uncertainty_score":0.99986964},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026796741,0.00058324775,0.9715787,0.000062059946,0.00016906289,0.0002543681,0.0001503469,0.00026251786,0.00014291602],"genre_scores_gemma":[0.94127554,0.00013668751,0.058296178,0.000045031313,0.00008227154,0.000038161117,0.00003297687,0.000045640012,0.00004753689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984855,0.00003959978,0.00042003093,0.0003828146,0.00027400928,0.00039805777],"domain_scores_gemma":[0.9988435,0.00038267765,0.00014480007,0.00039442396,0.00015345709,0.000081140184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017744266,0.00026507408,0.000493607,0.00030429324,0.0004854737,0.00003532124,0.0003171709,0.00014770274,0.0000701625],"category_scores_gemma":[0.000011378712,0.00026092282,0.0002210168,0.0016133391,0.000095033916,0.00034580944,0.0000032777186,0.0003170469,9.34523e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023144984,0.0001808631,0.0002921323,0.00024052424,0.0038290864,0.0000053938966,0.0015855418,0.7975609,0.0029871173,0.000027600163,0.0010447004,0.19201474],"study_design_scores_gemma":[0.0005531016,0.00008982277,0.003664626,0.00023878469,0.0012758446,0.000004361876,0.000158886,0.9853435,0.0076067094,0.00020508334,0.00038495573,0.00047430967],"about_ca_topic_score_codex":0.000020424666,"about_ca_topic_score_gemma":0.000020837902,"teacher_disagreement_score":0.9144788,"about_ca_system_score_codex":0.00004974378,"about_ca_system_score_gemma":0.000053257198,"threshold_uncertainty_score":0.9999843},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1617356,0.0002702226,0.83489734,0.000042156673,0.0012593609,0.0005789701,0.000008965952,0.00068153127,0.00052585],"genre_scores_gemma":[0.9969942,0.000069970956,0.0016461482,0.000012617079,0.00034186526,0.00044680096,0.0000042385227,0.00008649102,0.0003976785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982978,0.000049096387,0.00059430365,0.00037114092,0.0002729793,0.0004146611],"domain_scores_gemma":[0.9994644,0.00005096042,0.00008996792,0.00014099562,0.0001526897,0.000100988094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023386424,0.0002766115,0.00029467055,0.0005295878,0.00045915114,0.0000659753,0.000120124736,0.00020212813,0.000032508473],"category_scores_gemma":[0.00000509662,0.00031883386,0.00011701546,0.0007611524,0.000077759134,0.0005897514,4.5410496e-7,0.0003891878,0.00002678385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006587852,0.00009147614,0.000018978202,0.00024490542,0.000029161534,0.0000019954502,0.00047580738,0.87557733,0.10677337,0.0000052128944,0.0005800355,0.016135858],"study_design_scores_gemma":[0.0014259644,0.00017873626,0.000116738,0.00042061452,0.00006198658,0.0005780838,0.00043757044,0.7010702,0.29307505,0.000105919,0.0018592218,0.00066990126],"about_ca_topic_score_codex":0.00003896559,"about_ca_topic_score_gemma":0.0000069454313,"teacher_disagreement_score":0.8352586,"about_ca_system_score_codex":0.00042210578,"about_ca_system_score_gemma":0.0000991102,"threshold_uncertainty_score":0.9999264},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04430965,0.00026245345,0.9532292,0.000031105195,0.00025992497,0.00060596643,0.00006605514,0.000465722,0.0007699584],"genre_scores_gemma":[0.9973952,0.000011124424,0.0018540816,0.0000363714,0.00017948792,0.00032638805,0.0000030775275,0.00007091338,0.000123342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985461,0.000033014116,0.00039900915,0.00034762805,0.0002479991,0.0004262244],"domain_scores_gemma":[0.9993991,0.00013138048,0.000051578096,0.00018967384,0.00010650643,0.00012175102],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020892828,0.0002939178,0.00035158702,0.00009483925,0.0003145565,0.00013799807,0.00015257367,0.00013619673,0.00007623404],"category_scores_gemma":[0.0000015555927,0.00027374085,0.000101618,0.00024893487,0.000110878114,0.00035226272,2.719022e-7,0.00026857734,0.000029777379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019293504,0.00004512807,0.000002046034,0.0004972821,0.00006749536,0.000005501225,0.00025341217,0.86036724,0.014047634,0.0000037866214,0.000012936556,0.12450462],"study_design_scores_gemma":[0.0013294552,0.00018558335,0.000010570214,0.0008140265,0.0000811672,0.00007279316,0.00030363063,0.970213,0.02583525,0.00001268937,0.0006933499,0.00044848796],"about_ca_topic_score_codex":0.000009420301,"about_ca_topic_score_gemma":0.000015327305,"teacher_disagreement_score":0.95308554,"about_ca_system_score_codex":0.000113468064,"about_ca_system_score_gemma":0.00007643444,"threshold_uncertainty_score":0.99997145},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019128546,0.00044644796,0.97562647,0.0001612924,0.00006546087,0.00019560184,0.000011329767,0.0015125673,0.002852296],"genre_scores_gemma":[0.96575856,0.00020985228,0.033440124,0.00017597114,0.0000634623,0.0001320534,0.0000068722093,0.00008302603,0.00013006356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884415,0.0000462938,0.0003888066,0.00019829934,0.00023914817,0.00028330018],"domain_scores_gemma":[0.9991468,0.00015452858,0.00007711973,0.00044811756,0.00008791958,0.000085510976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013949134,0.00023948973,0.00020262317,0.00021221103,0.00043916472,0.00007780986,0.0004217711,0.00011716291,0.00012638627],"category_scores_gemma":[0.0000011282895,0.00027164601,0.00007700714,0.0003660426,0.00009704386,0.0007766721,0.00000334098,0.0005977268,0.000051569685],"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.000010630427,0.00007178507,0.0000024427472,0.000050213275,0.00001723135,0.0000010108574,0.00058880635,0.36728755,0.01783384,0.000069031346,0.000053617325,0.61401385],"study_design_scores_gemma":[0.00028345874,0.000026710148,0.000009893165,0.00026186835,0.000015927722,0.00001535581,0.00012069869,0.75918883,0.23651098,0.00021629165,0.0029845785,0.00036540796],"about_ca_topic_score_codex":0.000004371545,"about_ca_topic_score_gemma":0.000011257424,"teacher_disagreement_score":0.94663,"about_ca_system_score_codex":0.00018153166,"about_ca_system_score_gemma":0.000033006105,"threshold_uncertainty_score":0.9999736},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099282585,0.00006958513,0.8993663,0.000114402545,0.0000871043,0.00021665142,0.000005612173,0.0007221628,0.00013558195],"genre_scores_gemma":[0.9974898,0.000015799946,0.0020735567,0.00026509442,0.000035016452,0.000017338338,0.000018988168,0.000040883788,0.000043504042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871755,0.000045574336,0.0004484202,0.00026088118,0.00022379645,0.0003037564],"domain_scores_gemma":[0.9996212,0.000031742708,0.000086877604,0.00013318597,0.00007537039,0.000051597308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000114771174,0.00023170341,0.00018571543,0.00043771006,0.00043267154,0.00010360614,0.000100701145,0.00019506436,0.000030285468],"category_scores_gemma":[0.0000048911033,0.00025933966,0.000056548004,0.00078592665,0.000045149376,0.00063850405,0.0000010484764,0.0002636336,0.000010339566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020715177,0.000040713727,0.00005554303,0.000052373864,0.0000065252925,0.0000030638973,0.0006948116,0.93024045,0.035439428,0.000012242723,0.00001418404,0.033419978],"study_design_scores_gemma":[0.00030694882,0.000037695234,0.000055541026,0.0001806941,0.000021896232,0.000016449667,0.00043676214,0.83632225,0.16225897,0.00008827415,0.000032549433,0.00024199825],"about_ca_topic_score_codex":0.000014092763,"about_ca_topic_score_gemma":0.000026586236,"teacher_disagreement_score":0.89820725,"about_ca_system_score_codex":0.00045985595,"about_ca_system_score_gemma":0.000037702448,"threshold_uncertainty_score":0.9999859},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0797193,0.00011071529,0.9174204,0.000029219042,0.0013389785,0.0006668692,0.00004482405,0.0004935087,0.00017620626],"genre_scores_gemma":[0.99469244,0.000008869871,0.0041161175,0.000016371787,0.00023882903,0.00029670435,0.000007969546,0.0000960646,0.0005266277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998202,0.000043291653,0.0006001948,0.00037637728,0.0004076134,0.00037047762],"domain_scores_gemma":[0.9990897,0.00006106746,0.00013020002,0.00017568003,0.00040242032,0.00014091276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019568716,0.00029415474,0.00032287056,0.0004725202,0.0005332007,0.00009324106,0.00013983416,0.00017681887,0.00008916364],"category_scores_gemma":[0.0000062968124,0.00032678674,0.00016916204,0.0007120337,0.00010174681,0.00049714465,5.6651663e-7,0.0002919623,0.000021478614],"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.00012587014,0.00010099033,0.0000053366634,0.0002104278,0.00004044218,0.0000011712334,0.00032482366,0.79333246,0.19969168,0.000004915065,0.00013490324,0.0060269632],"study_design_scores_gemma":[0.00079608656,0.00027504034,0.000054666747,0.00014892084,0.0000387835,0.00008854645,0.00009918045,0.44463763,0.5529067,0.000010985613,0.0006230111,0.00032043498],"about_ca_topic_score_codex":0.000017664743,"about_ca_topic_score_gemma":9.9102e-7,"teacher_disagreement_score":0.91497314,"about_ca_system_score_codex":0.00030737038,"about_ca_system_score_gemma":0.00015153066,"threshold_uncertainty_score":0.9999184},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026512404,0.00013990472,0.99653065,0.00014097415,0.000038465452,0.00005684334,0.0000065216527,0.0001660988,0.00026929585],"genre_scores_gemma":[0.74122256,0.000009058806,0.25867853,0.000026155998,0.0000275015,0.0000028077352,3.7136581e-7,0.0000073434226,0.000025660942],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99886185,0.000020215068,0.00036073488,0.0002459187,0.00033536984,0.00017593027],"domain_scores_gemma":[0.9992506,0.00013987978,0.00018395574,0.00026642796,0.00007954484,0.000079575766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009879864,0.00013891268,0.00023729737,0.0003315198,0.000094075906,0.00007302206,0.00048014242,0.000088920926,0.000014853578],"category_scores_gemma":[0.0000036025676,0.00012546955,0.00017458263,0.00094929466,0.000071283925,0.0010739209,0.0000029468774,0.00021404936,0.0000020921539],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027445021,0.00011188606,0.000024150784,0.000026314525,0.000033761018,0.0000013590359,0.0012471438,0.005068953,0.0018089658,0.00034446167,0.00000970474,0.9912959],"study_design_scores_gemma":[0.00034994344,0.0002212395,0.00004269154,0.0005806465,0.0000877691,0.000013378473,0.00008400889,0.040086523,0.92320335,0.034568474,0.00037400392,0.00038797344],"about_ca_topic_score_codex":0.0000047124313,"about_ca_topic_score_gemma":0.0000029054106,"teacher_disagreement_score":0.9909079,"about_ca_system_score_codex":0.000018484669,"about_ca_system_score_gemma":0.00008223234,"threshold_uncertainty_score":0.51165},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002272981,0.000034020573,0.9955979,0.00014579862,0.00013352624,0.0005248845,0.000003071586,0.0003135703,0.0009742239],"genre_scores_gemma":[0.5556334,0.0000023260259,0.44417572,0.00006639786,0.000015964788,0.000053354335,2.4896477e-7,0.00001460421,0.000037950813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981766,0.00012579911,0.00048766992,0.00042479162,0.00045265222,0.000332514],"domain_scores_gemma":[0.99887604,0.00009351068,0.00025249136,0.00027569558,0.0003923267,0.000109962726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063281716,0.00023776003,0.00020536743,0.00032909898,0.001090385,0.00022512407,0.0003738783,0.000093394345,0.000038887407],"category_scores_gemma":[0.000006280553,0.00020612532,0.00008822486,0.0015488466,0.00007721341,0.0015930762,0.0000053222902,0.00028955945,0.000007630157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020006282,0.0000852471,0.0000016698392,0.00004323177,0.0000122826095,0.000005539049,0.000994783,0.9017516,0.0008110519,0.00008810404,0.000015237014,0.0961713],"study_design_scores_gemma":[0.00015229482,0.00017195138,8.1568606e-7,0.0002944908,0.000027635333,0.00045630467,0.00014166618,0.906196,0.092176944,0.00009010708,0.00006997997,0.00022181163],"about_ca_topic_score_codex":0.000035741272,"about_ca_topic_score_gemma":0.000009899383,"teacher_disagreement_score":0.55336046,"about_ca_system_score_codex":0.00019233754,"about_ca_system_score_gemma":0.0002860244,"threshold_uncertainty_score":0.84055465},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119753554,0.000021416621,0.878023,0.000023225944,0.00017346912,0.00042132815,0.000039125054,0.0014612947,0.00008355813],"genre_scores_gemma":[0.8625735,0.0000037983446,0.13699955,0.000037182308,0.000056681118,0.00023835868,0.00000631158,0.00007546656,0.000009171709],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989195,0.000024330111,0.00031434264,0.00026292642,0.00018282118,0.00029610246],"domain_scores_gemma":[0.99911803,0.00011313512,0.000064052496,0.00042938604,0.00015172675,0.00012364854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015462395,0.0002325729,0.00019794462,0.0001711581,0.00040257673,0.000084285035,0.00036436963,0.00014262387,0.0000643878],"category_scores_gemma":[0.0000050175668,0.00024817357,0.000088978704,0.00021127757,0.000114154616,0.00027236098,0.0000011264405,0.00054276583,0.000009193763],"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.00003106451,0.000105909974,8.5617944e-7,0.000079807505,0.000005578247,2.764926e-7,0.00014961204,0.32258952,0.5093481,0.000017687995,0.000002366734,0.1676692],"study_design_scores_gemma":[0.00023355831,0.000044774213,0.000017175144,0.000036793866,0.00000928505,0.0000020674297,0.000017129805,0.49675995,0.5024321,0.00016296838,0.00010359162,0.00018061175],"about_ca_topic_score_codex":0.000008518148,"about_ca_topic_score_gemma":0.00013491588,"teacher_disagreement_score":0.7428199,"about_ca_system_score_codex":0.0000694208,"about_ca_system_score_gemma":0.00004374952,"threshold_uncertainty_score":0.9999971},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10432674,0.00018898805,0.8929319,0.000009512593,0.00015064518,0.00016585321,0.0000033986314,0.0017579733,0.00046501815],"genre_scores_gemma":[0.9689675,0.000017791988,0.030735267,0.000048222406,0.000054911347,0.000015614205,0.0000018113222,0.000104633764,0.00005426442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985882,0.000035699857,0.0004545895,0.00024401523,0.00024987862,0.00042758777],"domain_scores_gemma":[0.9991642,0.00023429323,0.00010856233,0.00026157108,0.00012251287,0.00010880807],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037286486,0.00026860848,0.00025244878,0.00033032178,0.0005913719,0.000094839634,0.00026049366,0.00014817069,0.00002852946],"category_scores_gemma":[0.000004739781,0.00030942642,0.00008034825,0.0006425076,0.00009374376,0.00049381616,0.000002274934,0.00062451075,0.000008440136],"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.000023354194,0.000042461084,0.000019262443,0.00009527656,0.000016054137,0.00000397517,0.0005529963,0.5292537,0.0964941,0.0000043641085,0.0000030822337,0.37349132],"study_design_scores_gemma":[0.00015680095,0.000019539988,0.000011759735,0.00035176103,0.000023793811,0.000049490198,0.000706586,0.47890294,0.5193431,0.0000385278,0.00010663655,0.0002891045],"about_ca_topic_score_codex":0.000015791768,"about_ca_topic_score_gemma":0.000027729204,"teacher_disagreement_score":0.8646407,"about_ca_system_score_codex":0.00026909972,"about_ca_system_score_gemma":0.000035114354,"threshold_uncertainty_score":0.9999358},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051420494,0.00007121965,0.99256176,0.000021030479,0.00017282867,0.00022213688,0.000006364424,0.0011079784,0.00069463666],"genre_scores_gemma":[0.98289764,0.000010411883,0.016690336,0.00012624059,0.00004263619,0.00009829586,0.0000032450928,0.00005699546,0.000074223295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990599,0.000010740547,0.00027108903,0.00021603053,0.0001422846,0.00029991768],"domain_scores_gemma":[0.9995993,0.00006642979,0.00005084291,0.000119649936,0.00011144497,0.000052366067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007114615,0.00019257063,0.00016080844,0.00013493288,0.00045337982,0.00009539043,0.00014667015,0.00018423029,0.00010597033],"category_scores_gemma":[0.0000066073935,0.00019406724,0.00008571642,0.0002920042,0.000059222937,0.00027094383,9.956859e-7,0.00021626461,0.00001641964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006210898,0.0000524152,0.000014586856,0.00016587728,0.000035295583,0.0000018285585,0.0018097466,0.6874732,0.0016338596,0.000071159186,0.000121685305,0.3085583],"study_design_scores_gemma":[0.00026312983,0.00009896729,0.0000031054944,0.000077211254,0.00003418455,0.0000047367744,0.00048185152,0.60074836,0.3969477,0.00018701763,0.0009399522,0.00021376074],"about_ca_topic_score_codex":0.000008133783,"about_ca_topic_score_gemma":0.000004919024,"teacher_disagreement_score":0.97775555,"about_ca_system_score_codex":0.000055630244,"about_ca_system_score_gemma":0.00003270377,"threshold_uncertainty_score":0.7913832},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022865929,0.000020719117,0.97653437,0.00008706362,0.000082434024,0.00014461453,0.000049887585,0.0001307512,0.000084237836],"genre_scores_gemma":[0.9759953,0.0000016908467,0.023895936,0.00003280908,0.000012325666,0.000020428395,0.000016105378,0.000011119581,0.000014281436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986779,0.000043073727,0.00031277988,0.00039664083,0.00035634375,0.00021322367],"domain_scores_gemma":[0.9991791,0.00007612291,0.00013161026,0.00029141633,0.00021816912,0.00010354844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023271852,0.0001713278,0.0003019145,0.00038418453,0.00023702203,0.00020019586,0.00028866247,0.00007600226,0.000018237348],"category_scores_gemma":[0.0000028555705,0.00015063715,0.00007750744,0.0014747703,0.00007899703,0.00065407023,0.0000024508668,0.00024905676,9.2432055e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025055091,0.0000994328,0.000265969,0.000031991913,0.00025255638,0.000004948415,0.00026580392,0.94328994,0.013822304,0.000016083788,0.0000014837915,0.041924447],"study_design_scores_gemma":[0.00034894905,0.00003646217,0.00042213083,0.000045841338,0.00036278818,0.00001095228,0.000048883714,0.9769571,0.02158549,0.000005079319,0.000006758477,0.00016955455],"about_ca_topic_score_codex":0.000023748871,"about_ca_topic_score_gemma":0.000029541035,"teacher_disagreement_score":0.95312935,"about_ca_system_score_codex":0.000029829565,"about_ca_system_score_gemma":0.00008195131,"threshold_uncertainty_score":0.61428046},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046138417,0.000077825774,0.9520846,0.000047424935,0.00037403448,0.000084070365,0.0000037546226,0.00041692925,0.00077291386],"genre_scores_gemma":[0.9556341,0.000003337094,0.044015117,0.0002026445,0.000040894178,0.00001718199,3.7430422e-7,0.00001679731,0.000069530746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985323,0.00005084216,0.00028869972,0.00043393308,0.00030242276,0.0003918241],"domain_scores_gemma":[0.9993057,0.000053963,0.00007340699,0.00034476156,0.0000750023,0.00014713116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020622091,0.00017430232,0.00014596747,0.000089729234,0.0004919744,0.00016620307,0.00047638043,0.000069635855,0.00015852397],"category_scores_gemma":[0.00000112192,0.00015891137,0.00008054438,0.0004274706,0.000056322297,0.00027050934,0.0000049641353,0.00027647425,0.00012031104],"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.00008042377,0.00056557247,0.000015509828,0.000037845693,0.000021625723,0.000087338114,0.004150616,0.3140005,0.009394495,0.00037884916,0.000063021216,0.6712042],"study_design_scores_gemma":[0.00026959446,0.000093935625,0.000050906343,0.0001012895,0.000012201327,0.000054646818,0.0000544148,0.9068907,0.091920465,0.0001490645,0.00017069597,0.00023206738],"about_ca_topic_score_codex":0.000016310196,"about_ca_topic_score_gemma":0.0000028407903,"teacher_disagreement_score":0.9094957,"about_ca_system_score_codex":0.000029966961,"about_ca_system_score_gemma":0.000044526383,"threshold_uncertainty_score":0.64802176},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022252887,0.000063480344,0.996124,0.00045354618,0.00014734255,0.00034246943,0.00001657368,0.0003021523,0.00032512442],"genre_scores_gemma":[0.4397042,0.0000016746252,0.5594429,0.00062077836,0.000068433,0.000021963266,0.000001933046,0.000026131465,0.00011196774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973804,0.0001538353,0.00044551498,0.0007934377,0.0005277822,0.00069902494],"domain_scores_gemma":[0.9983862,0.00061962,0.00014249499,0.00036548122,0.00027521522,0.00021096636],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00062774005,0.00038423773,0.00037771973,0.00027089403,0.0008549652,0.001130506,0.00055279775,0.00012790559,0.00003252145],"category_scores_gemma":[0.000019021089,0.00032907224,0.00014160499,0.00051018095,0.00013468311,0.0017745191,0.0000032139474,0.0005197008,0.000014950406],"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.0006421318,0.0004233727,0.0000016979513,0.000115471456,0.000050388815,0.000119139666,0.0015536043,0.09865435,0.04568829,0.0003251699,0.00016347686,0.8522629],"study_design_scores_gemma":[0.0024902564,0.0016148388,0.000051498664,0.00046912878,0.00016980432,0.00023187233,0.00011837951,0.8485812,0.1417127,0.0032199048,0.00034620904,0.0009942326],"about_ca_topic_score_codex":0.000006115441,"about_ca_topic_score_gemma":0.0000022364618,"teacher_disagreement_score":0.85126865,"about_ca_system_score_codex":0.000101333484,"about_ca_system_score_gemma":0.00020411424,"threshold_uncertainty_score":0.99991614},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046248958,0.00019906441,0.9518644,0.00032615618,0.00024674562,0.0007325565,0.000010546521,0.00028747504,0.000084079606],"genre_scores_gemma":[0.97856116,0.00002241357,0.02045528,0.0001245036,0.0001589812,0.00032395532,0.000012283896,0.000047082016,0.0002943303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972335,0.00033538326,0.00064839836,0.00068563496,0.0003582578,0.00073878875],"domain_scores_gemma":[0.99774516,0.0009865903,0.00020604611,0.0005012366,0.00038595294,0.00017504195],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012362862,0.00030904516,0.00036191198,0.00038955483,0.0007994666,0.0006907987,0.0008694088,0.0002818461,0.00005634065],"category_scores_gemma":[0.000011323733,0.00030878573,0.00012526801,0.0013070172,0.0001300348,0.0012173592,0.000007570317,0.0007440455,0.0000114970235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002649942,0.000322743,0.00002696501,0.000038497703,0.000012224527,0.0000037485447,0.00008795444,0.83468974,0.0043612253,0.000092547794,0.00006418398,0.16003518],"study_design_scores_gemma":[0.002762704,0.00014589635,0.00019330763,0.00020035097,0.000013109414,0.000010103466,0.000022140768,0.98760176,0.008350268,0.00013709281,0.00023072853,0.00033256877],"about_ca_topic_score_codex":0.00006349386,"about_ca_topic_score_gemma":0.000074831216,"teacher_disagreement_score":0.9323122,"about_ca_system_score_codex":0.0002159566,"about_ca_system_score_gemma":0.00032053576,"threshold_uncertainty_score":0.9999364},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03308705,0.00003318258,0.96619964,0.00004205088,0.0001360552,0.00027089322,0.0000047715002,0.00012926459,0.0000970946],"genre_scores_gemma":[0.77949786,0.0000066015546,0.22028951,0.000081844955,0.000026166541,0.000012254272,6.975851e-7,0.000017325072,0.0000677223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983845,0.000054012526,0.00043605483,0.00036961024,0.00038540916,0.00037044953],"domain_scores_gemma":[0.99933565,0.000077856545,0.00014776428,0.00018849372,0.0001409851,0.000109280074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024371114,0.00021771352,0.00021209603,0.00033049594,0.0003001287,0.00020749166,0.00041069233,0.00006852098,0.000027839587],"category_scores_gemma":[0.0000013972207,0.00021725551,0.000099601646,0.0006846104,0.00005714706,0.0015913917,0.0000022254121,0.0001533185,0.000003631931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006100097,0.00014725405,0.000006384877,0.000027447084,0.000021227737,0.000008595178,0.00088985293,0.48577392,0.20870657,0.000031533622,0.000002683733,0.30432352],"study_design_scores_gemma":[0.00058948447,0.00014874335,0.000004552878,0.00008457754,0.000020987945,0.00004147802,0.00007415642,0.7546751,0.24393877,0.00021083685,0.000020365562,0.00019095578],"about_ca_topic_score_codex":0.000043307246,"about_ca_topic_score_gemma":0.0000025889096,"teacher_disagreement_score":0.74641085,"about_ca_system_score_codex":0.00008379078,"about_ca_system_score_gemma":0.00012530768,"threshold_uncertainty_score":0.8859422},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077794766,0.00011651962,0.99684656,0.00008834047,0.0004035999,0.0007887656,0.000044469703,0.0007328569,0.00020096664],"genre_scores_gemma":[0.9207955,0.000014280112,0.07855194,0.0000987222,0.000085051186,0.00029231104,0.000017834042,0.00011008943,0.00003424057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877477,0.0000148053705,0.00036193646,0.0003264242,0.00018228158,0.000339775],"domain_scores_gemma":[0.9994714,0.000071611394,0.00007037849,0.00014683323,0.0001665692,0.00007318014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000074962205,0.00028385775,0.00023724104,0.00017331819,0.00040040925,0.00014372762,0.00017971233,0.0001604485,0.00003528936],"category_scores_gemma":[0.0000031939617,0.00031081226,0.0001211677,0.00045941517,0.000041731346,0.0012038421,3.4200085e-7,0.00018795041,0.000006602761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006852922,0.00008766961,7.720932e-7,0.0002815631,0.000023634755,0.0000012296387,0.00041914108,0.9888361,0.002766144,0.0000054663906,0.000005541791,0.007504184],"study_design_scores_gemma":[0.0017749253,0.00006202019,4.309776e-7,0.00024936692,0.000043116677,0.0000040471077,0.00004926855,0.79903334,0.1982963,0.000090394504,0.00010348246,0.00029330142],"about_ca_topic_score_codex":0.0000077823215,"about_ca_topic_score_gemma":0.00001534707,"teacher_disagreement_score":0.9200176,"about_ca_system_score_codex":0.00021445304,"about_ca_system_score_gemma":0.00006443773,"threshold_uncertainty_score":0.9999344},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003407048,0.000062641455,0.99556965,0.00017276044,0.00015499126,0.00040391687,0.0000074942554,0.0001306738,0.00009083454],"genre_scores_gemma":[0.6305958,0.0000015445847,0.3691502,0.00012267292,0.00003332028,0.00003913321,8.089301e-7,0.000013527611,0.000043017728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99821126,0.0001455501,0.0004413177,0.00045023102,0.00041930247,0.0003323626],"domain_scores_gemma":[0.9988071,0.00038012152,0.00018866437,0.00023988452,0.00029319915,0.000091083435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006963721,0.00019930914,0.00025327865,0.00027986264,0.00040679018,0.00014769178,0.00037293916,0.000082493825,0.000018729726],"category_scores_gemma":[0.000010904473,0.00018898663,0.00015981574,0.00065045775,0.00008573565,0.00041030705,0.0000027480348,0.00017675178,0.000006685854],"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.00017931829,0.00021215336,4.2993022e-7,0.000054428663,0.000014532459,0.0000067112373,0.00053462834,0.6985289,0.069744304,0.00012383719,0.000006474546,0.23059429],"study_design_scores_gemma":[0.0010789629,0.00030386544,0.000008213056,0.000112505004,0.000028449324,0.000022460528,0.000039019586,0.4451635,0.55170035,0.0013682545,0.000010889482,0.0001635652],"about_ca_topic_score_codex":0.000019586081,"about_ca_topic_score_gemma":9.850476e-7,"teacher_disagreement_score":0.62718874,"about_ca_system_score_codex":0.00007249044,"about_ca_system_score_gemma":0.00033085464,"threshold_uncertainty_score":0.7706651},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017378632,0.00007913927,0.9798226,0.00025571042,0.0005003758,0.000461403,0.00029923618,0.0010476846,0.00015523854],"genre_scores_gemma":[0.99627,0.000010448615,0.003108978,0.00018355504,0.00005111652,0.00008411079,0.000038078804,0.000035074445,0.0002186644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695426,0.00022320259,0.0007370659,0.0007571488,0.00070675754,0.00062156917],"domain_scores_gemma":[0.9984465,0.00013536564,0.00027517832,0.00046578917,0.0004056161,0.00027154424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028529362,0.00039203206,0.00041431826,0.00024788664,0.00097603374,0.0002965308,0.000595868,0.00016139237,0.000047564416],"category_scores_gemma":[0.0000071079803,0.0003894585,0.00016132479,0.0011483338,0.00014903204,0.00073969114,0.000004663565,0.00048386175,0.00013246559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053422665,0.001126486,0.00015769164,0.00015842164,0.00027859083,0.00053097337,0.0015511479,0.7395652,0.05176733,0.000024039979,0.0007515591,0.20355433],"study_design_scores_gemma":[0.0024937033,0.00012687666,0.00022603813,0.000114789706,0.000031664254,0.0002770275,0.000018133947,0.9546586,0.04085434,0.000082415725,0.0007130947,0.00040328782],"about_ca_topic_score_codex":0.00007759582,"about_ca_topic_score_gemma":0.0000074221225,"teacher_disagreement_score":0.9788913,"about_ca_system_score_codex":0.00026701554,"about_ca_system_score_gemma":0.00031442073,"threshold_uncertainty_score":0.99985576},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030941509,0.00011338522,0.9671553,0.000111031426,0.00048856356,0.00051707943,0.000027530938,0.0004890626,0.00015655124],"genre_scores_gemma":[0.816572,0.000005721356,0.18292701,0.00021092776,0.00010837948,0.00004413422,0.00000699136,0.000035807563,0.00008899931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972628,0.000031336185,0.0006034886,0.00076750416,0.00060752,0.0007273958],"domain_scores_gemma":[0.99853486,0.00020402911,0.00021880728,0.0003756201,0.0004202882,0.000246422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058806984,0.00036627817,0.00033424352,0.00030103303,0.0009038408,0.00057034026,0.0006222765,0.00024433364,0.000011389766],"category_scores_gemma":[0.000009967682,0.0003356685,0.00021235907,0.001146351,0.00009496081,0.0007218517,0.0000045712677,0.00044380227,0.000005530431],"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.0003595882,0.0002384718,0.0000075217085,0.000103541104,0.000040689058,0.000007211885,0.00043997873,0.43670604,0.0033340883,0.00006994986,0.00001361518,0.5586793],"study_design_scores_gemma":[0.00093710766,0.00018573331,0.00012557684,0.000098523866,0.000036315243,0.000055623837,0.0002742813,0.9694114,0.026831975,0.0014810011,0.00012838902,0.00043411006],"about_ca_topic_score_codex":0.000005489692,"about_ca_topic_score_gemma":0.000032843815,"teacher_disagreement_score":0.7856305,"about_ca_system_score_codex":0.00012064315,"about_ca_system_score_gemma":0.00015667599,"threshold_uncertainty_score":0.9999095},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05734338,0.00003376206,0.9412546,0.00013657649,0.00028306304,0.0002642753,0.00000389335,0.0003181631,0.00036225907],"genre_scores_gemma":[0.7402826,0.0000066611096,0.25961548,0.000031678035,0.000015836818,0.000020465082,7.127362e-7,0.00001778397,0.000008770389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99803674,0.00007531564,0.000694939,0.00043126292,0.0004669935,0.00029473295],"domain_scores_gemma":[0.9989108,0.00009598988,0.00033753988,0.00031194248,0.00025140433,0.000092341696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003463918,0.00024183201,0.0003321607,0.0006972953,0.00020344571,0.00009347207,0.0003508805,0.00016746623,0.000017661145],"category_scores_gemma":[0.000017479937,0.00026127254,0.00012929906,0.00138405,0.0000992198,0.001265958,0.0000047516296,0.00033291924,0.000006241378],"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.000038431404,0.00040235528,0.000019695168,0.00014278981,0.000015719539,0.000005731133,0.0009647764,0.6874492,0.032407705,0.00018922193,0.0000016978536,0.27836266],"study_design_scores_gemma":[0.0004508638,0.0001361163,0.000064050655,0.0005157239,0.000022158396,0.000028845672,0.000031832053,0.4569517,0.53238875,0.009186428,0.000006534573,0.00021699099],"about_ca_topic_score_codex":0.00023349407,"about_ca_topic_score_gemma":0.00004335464,"teacher_disagreement_score":0.68293923,"about_ca_system_score_codex":0.00021683358,"about_ca_system_score_gemma":0.0003473914,"threshold_uncertainty_score":0.99998397},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025947355,0.0001895413,0.9933926,0.00008748281,0.0002958999,0.0000571326,0.000008012802,0.00015203156,0.0032225915],"genre_scores_gemma":[0.9017943,0.00000562307,0.09782329,0.000070399736,0.000055709428,0.000004975486,0.0000021855567,0.000013352718,0.00023015394],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99836713,0.00008931917,0.00042120932,0.00035874307,0.0003793661,0.0003842162],"domain_scores_gemma":[0.99890137,0.0003420013,0.0001500293,0.0002719535,0.00021240299,0.00012221871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006774705,0.00018703862,0.00022418263,0.00030087924,0.00043894586,0.00011365015,0.00044732096,0.00010239363,0.000052186573],"category_scores_gemma":[0.000008765823,0.0001851905,0.00013371273,0.0010309048,0.00013359301,0.0006643329,0.0000026373605,0.0002298054,0.000017499382],"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.00013705493,0.00023898277,0.000004128325,0.00004749714,0.00004865147,0.00003639635,0.00049060787,0.0019323564,0.17731051,0.00070480973,0.000043605727,0.81900537],"study_design_scores_gemma":[0.0016172413,0.00031553442,0.00010100395,0.00022662032,0.00005039955,0.00003627823,0.000059125843,0.027628757,0.964926,0.0041190526,0.00047163607,0.00044833208],"about_ca_topic_score_codex":0.000022001805,"about_ca_topic_score_gemma":0.000007116027,"teacher_disagreement_score":0.89919955,"about_ca_system_score_codex":0.0000888589,"about_ca_system_score_gemma":0.00016299497,"threshold_uncertainty_score":0.75518495},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027756663,0.00026879567,0.9951432,0.00021574154,0.00008040725,0.0001514952,0.000027989478,0.00046329512,0.0008734507],"genre_scores_gemma":[0.96163094,0.00016784688,0.03790834,0.00014828653,0.000029715195,0.00005563736,0.0000040337004,0.000020301315,0.0000349094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992035,0.000023326616,0.0002459349,0.00015211791,0.000175219,0.00019991005],"domain_scores_gemma":[0.9995183,0.00019870824,0.000030029221,0.00010989602,0.000070914786,0.000072147835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012145922,0.00015414676,0.000113052825,0.00006448578,0.0004230786,0.0001592973,0.00009200983,0.0000734848,0.00003985806],"category_scores_gemma":[0.000008569398,0.00012507915,0.000024433735,0.00015592911,0.00007337556,0.00019060262,3.906734e-7,0.00028147254,0.000012047875],"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.000012154957,0.00006683359,0.000009923222,0.000039254282,0.000013568559,0.0000030292726,0.00013712724,0.038199965,0.001014939,0.000376525,0.0019298178,0.9581969],"study_design_scores_gemma":[0.0003656277,0.00017917107,0.00040823148,0.00020637484,0.000061623476,0.00002891578,0.000040885127,0.9664753,0.020906597,0.008130254,0.0028034362,0.0003935708],"about_ca_topic_score_codex":0.000007675311,"about_ca_topic_score_gemma":0.000039894556,"teacher_disagreement_score":0.9588553,"about_ca_system_score_codex":0.000048898208,"about_ca_system_score_gemma":0.000040592848,"threshold_uncertainty_score":0.510058},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014891607,0.00029132678,0.994615,0.00025275428,0.000048573467,0.00059210794,0.000060514878,0.0014108683,0.0012396654],"genre_scores_gemma":[0.8653052,0.00008710984,0.13388948,0.00012663263,0.00003700355,0.00038575503,0.000024483552,0.00008318013,0.00006117409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986298,0.000066741806,0.00048359422,0.0002603343,0.00022740709,0.00033209432],"domain_scores_gemma":[0.9984909,0.00040633327,0.00011433385,0.0006830614,0.00022498248,0.00008034772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024009596,0.0002676209,0.00023909174,0.00020096758,0.00055674877,0.000113008806,0.0005863112,0.00015008356,0.0000605918],"category_scores_gemma":[0.0000055294895,0.00030813867,0.00009336636,0.00057248416,0.00011460814,0.0003241176,0.0000022489003,0.00038869723,0.000011339261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004386392,0.0001964919,3.472716e-7,0.00010147777,0.00001725231,1.3500822e-7,0.00012316355,0.83004034,0.02030719,0.00038281013,0.000030445339,0.14875647],"study_design_scores_gemma":[0.00048380587,0.00006810904,0.000002344679,0.00019828437,0.00003600708,0.0000021403819,0.00006430306,0.8190405,0.17807014,0.00027542072,0.0014657278,0.0002932406],"about_ca_topic_score_codex":0.0000050201334,"about_ca_topic_score_gemma":0.000025721032,"teacher_disagreement_score":0.863816,"about_ca_system_score_codex":0.0003295521,"about_ca_system_score_gemma":0.00012852624,"threshold_uncertainty_score":0.99993706},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028009124,0.000039855586,0.97037464,0.000010652739,0.00016280192,0.0001496436,0.0000035477,0.0006072139,0.00064254674],"genre_scores_gemma":[0.8971644,0.0000019097188,0.10271267,0.00003314594,0.00001220735,0.000023258712,2.1816203e-7,0.000018786019,0.000033425316],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986907,0.000047457885,0.00033873308,0.0003756798,0.00028085656,0.00026653416],"domain_scores_gemma":[0.9990728,0.00018348313,0.00019122964,0.00029986605,0.00017031722,0.00008231707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023147081,0.00018341148,0.00021892309,0.00026720483,0.00024159154,0.000054197502,0.0005651588,0.00008070233,0.000032997883],"category_scores_gemma":[0.000009743182,0.00018299876,0.00009232592,0.0004814685,0.00008471276,0.0005712132,0.000004362488,0.0002667286,0.0000097551],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097519885,0.0007017454,0.00016989214,0.00014024807,0.000047714344,0.000014942315,0.0069146333,0.007170413,0.06840327,0.0002085464,0.000020119036,0.91611093],"study_design_scores_gemma":[0.00027767612,0.00030434324,0.00019715299,0.00035239087,0.000030914052,0.00003402118,0.00018169047,0.4812294,0.51592386,0.0011703253,0.0000031968593,0.00029502425],"about_ca_topic_score_codex":0.00007797513,"about_ca_topic_score_gemma":0.000048522117,"teacher_disagreement_score":0.91581595,"about_ca_system_score_codex":0.000051946325,"about_ca_system_score_gemma":0.00011126082,"threshold_uncertainty_score":0.7462473},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023175688,0.00012005844,0.99596566,0.00027443108,0.00022395744,0.0004438208,0.000008970936,0.00030819702,0.00033733834],"genre_scores_gemma":[0.8899772,0.000021333995,0.10928156,0.00033793427,0.00006783944,0.00017125954,0.0000064942187,0.000021423271,0.000114926115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984425,0.00006119209,0.00038200297,0.00043944494,0.00020832625,0.0004665609],"domain_scores_gemma":[0.9989119,0.00011206381,0.00012286667,0.00039535182,0.00027078125,0.00018699172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044573375,0.00023050678,0.000207836,0.0001777737,0.0011554078,0.00020094459,0.00070271135,0.00009148384,0.000031144296],"category_scores_gemma":[0.0000058645323,0.00022759815,0.00012442196,0.0008282505,0.000048108355,0.000915898,0.00001362291,0.00034507294,0.000015754687],"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.00012481834,0.00019779013,0.000002678198,0.00002073824,0.000029635921,0.000001898868,0.003494571,0.29399398,0.0029802083,0.00052185886,0.00014699093,0.69848484],"study_design_scores_gemma":[0.000536548,0.00022947366,0.000018929075,0.00017214222,0.000022988992,0.000013741188,0.00007568473,0.97780186,0.019793749,0.0000955567,0.00092558214,0.0003137681],"about_ca_topic_score_codex":0.0000071245704,"about_ca_topic_score_gemma":0.00003653528,"teacher_disagreement_score":0.88765967,"about_ca_system_score_codex":0.00015982422,"about_ca_system_score_gemma":0.000098838376,"threshold_uncertainty_score":0.9281183},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028738493,0.00023714991,0.9684299,0.000074061514,0.000993537,0.00058956724,0.000030169505,0.0005914197,0.00031566655],"genre_scores_gemma":[0.96755356,0.000015139363,0.031530146,0.000021053496,0.00021099906,0.00040255397,0.000006349007,0.0000839168,0.00017629712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982735,0.0000875255,0.0005311063,0.00038938734,0.00030094854,0.00041751307],"domain_scores_gemma":[0.99936926,0.00010688563,0.00008439992,0.00020491438,0.00011736032,0.00011717261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033825988,0.0002928378,0.00035247422,0.00046931874,0.000384068,0.0000612653,0.00015214358,0.00018030747,0.000043414748],"category_scores_gemma":[0.000004927994,0.00032784021,0.00014511349,0.0006553528,0.00011108032,0.00039637554,4.3906977e-7,0.0004263803,0.000018403296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110858535,0.00015330546,0.00000220303,0.0005686623,0.000023947972,0.0000051374236,0.00042450175,0.9053776,0.07094116,0.000011440942,0.00015252155,0.022228632],"study_design_scores_gemma":[0.0011175267,0.00008124946,0.000021096726,0.000309286,0.00003691302,0.0001454252,0.00022874656,0.8151827,0.18180309,0.00011740376,0.0005787552,0.00037784755],"about_ca_topic_score_codex":0.000051214985,"about_ca_topic_score_gemma":0.000009733852,"teacher_disagreement_score":0.93881506,"about_ca_system_score_codex":0.00040880425,"about_ca_system_score_gemma":0.00014152731,"threshold_uncertainty_score":0.9999174},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18169644,0.00009236515,0.81748873,0.00003452302,0.000034895493,0.00018775377,0.0000034423313,0.00021196023,0.00024986832],"genre_scores_gemma":[0.98688644,0.00005753773,0.012954718,0.000021016327,0.000015636148,0.000012523005,0.0000029625455,0.000033725348,0.000015423326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989676,0.00002040363,0.0003474073,0.00019377138,0.00017843043,0.00029240854],"domain_scores_gemma":[0.99968046,0.000042495773,0.00006709798,0.00008207925,0.000058303056,0.000069569614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000072727365,0.00021713974,0.00027051268,0.0002804262,0.000103051316,0.000025734176,0.00008692844,0.00012261982,0.00002139597],"category_scores_gemma":[6.453487e-7,0.00020979723,0.000044903543,0.00070447405,0.00006712544,0.00037212975,2.1899082e-7,0.00034052494,9.832938e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011536467,0.000067412744,0.000004960638,0.000046590216,0.000010566594,0.00000458182,0.0009037179,0.8830137,0.02543915,0.0000051885586,8.74813e-7,0.09038789],"study_design_scores_gemma":[0.000714832,0.00015617412,0.000044410055,0.00053043175,0.00001958609,0.000012841062,0.00011830134,0.85947144,0.13869566,0.000029456154,0.000005185587,0.00020166521],"about_ca_topic_score_codex":0.0000044646904,"about_ca_topic_score_gemma":0.0000028217594,"teacher_disagreement_score":0.80519,"about_ca_system_score_codex":0.00008950223,"about_ca_system_score_gemma":0.000042310163,"threshold_uncertainty_score":0.8555283},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05383902,0.00010978623,0.9222226,0.023089724,0.000040934578,0.00039523342,0.000024642897,0.00020412274,0.00007391757],"genre_scores_gemma":[0.80884725,0.00004397002,0.18960619,0.00095115515,0.0000476966,0.0001015794,0.0000040629916,0.000023018238,0.00037509634],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988136,0.000027833317,0.00037334656,0.00029417503,0.0003047831,0.00018621914],"domain_scores_gemma":[0.999094,0.00017372177,0.0001051473,0.0002398724,0.00024067564,0.00014655753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001806126,0.0001482664,0.0002731539,0.00018541835,0.00016225295,0.000022339289,0.00010549369,0.00006394861,0.00024129909],"category_scores_gemma":[0.000046106645,0.00012984413,0.00008783003,0.00045777537,0.0001321244,0.00012426924,0.0000014155422,0.0003439447,0.00007585679],"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.00011981738,0.00053805654,0.0000058595265,0.00032760832,0.00005797916,0.0000024504895,0.0011762971,0.000313632,0.6308327,0.00006916395,0.001841643,0.36471483],"study_design_scores_gemma":[0.00082950277,0.0006488048,0.00017598814,0.0033652796,0.00023763812,0.00007735697,0.0012195461,0.048698593,0.9298326,0.0007850706,0.013596654,0.0005329706],"about_ca_topic_score_codex":0.000004256615,"about_ca_topic_score_gemma":0.000003368193,"teacher_disagreement_score":0.7550082,"about_ca_system_score_codex":0.000108944514,"about_ca_system_score_gemma":0.00008676073,"threshold_uncertainty_score":0.52948904},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10096753,0.00006665523,0.8976582,0.00007360123,0.00021699279,0.0003601088,0.000032673528,0.000097671305,0.0005265288],"genre_scores_gemma":[0.94673353,0.000003814979,0.052951526,0.0000703846,0.000091082686,0.00001342836,0.000025133551,0.00001619629,0.00009489808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980863,0.000068975634,0.0004281345,0.00041786325,0.00042511127,0.00057367026],"domain_scores_gemma":[0.998799,0.000743566,0.00011278188,0.00010001617,0.00011180752,0.00013278497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092204934,0.00019826005,0.00021175206,0.0004118713,0.0011953819,0.00043977762,0.0001439519,0.00012361706,0.0001710859],"category_scores_gemma":[0.00001614454,0.00020254988,0.000072535324,0.0008044069,0.00012274666,0.0005993866,6.960994e-7,0.00046095118,0.000039294726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005470374,0.00007669094,0.0011314844,0.00011968493,0.000014758131,0.000014692346,0.0009238219,0.79283226,0.012245428,2.5490306e-7,0.0000030703961,0.19209084],"study_design_scores_gemma":[0.00065314653,0.0002242244,0.0026536454,0.00022554692,0.000020772368,0.000029840798,0.00012532745,0.9751624,0.020397017,0.00021247109,0.00005556374,0.00024006024],"about_ca_topic_score_codex":0.0004641283,"about_ca_topic_score_gemma":0.0013647593,"teacher_disagreement_score":0.845766,"about_ca_system_score_codex":0.00009178485,"about_ca_system_score_gemma":0.00025762487,"threshold_uncertainty_score":0.9194032},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007547685,0.00006390611,0.9912051,0.00008666974,0.00026856863,0.0000922641,0.000016636217,0.000553296,0.00016585055],"genre_scores_gemma":[0.99173194,0.000020943997,0.0077677425,0.00017576604,0.00010128926,0.000029521267,0.0000065053173,0.000028343033,0.00013796097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980682,0.00006296861,0.00031411852,0.0005783694,0.0004573035,0.00051904604],"domain_scores_gemma":[0.99906874,0.000077897166,0.00013329367,0.00031833292,0.00018694122,0.0002148248],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009399006,0.00029586154,0.00025659957,0.00014940106,0.001001411,0.00023147918,0.0003627239,0.000118832264,0.000024119365],"category_scores_gemma":[5.3399117e-7,0.000255689,0.000103003265,0.0011608796,0.0001238605,0.00031544958,0.000004078131,0.00036045795,0.000009840231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056352754,0.00014561781,0.0000019939534,0.000007720834,0.000022201215,0.000099991565,0.00007688947,0.8554407,0.00034397212,0.000025442974,0.00004066907,0.14373845],"study_design_scores_gemma":[0.0005039256,0.00017455837,0.0000223011,0.00009109453,0.000014755412,0.00042584905,0.00003349895,0.9827686,0.015105524,0.000008300546,0.00050376187,0.00034781895],"about_ca_topic_score_codex":0.000021276173,"about_ca_topic_score_gemma":0.0000060011366,"teacher_disagreement_score":0.98418427,"about_ca_system_score_codex":0.00009690062,"about_ca_system_score_gemma":0.00009261351,"threshold_uncertainty_score":0.9999895},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048562843,0.00003741988,0.94622153,0.00323418,0.00005908094,0.0005458305,0.000011774592,0.000093132316,0.0012342209],"genre_scores_gemma":[0.99673086,0.000007863414,0.0021027091,0.0007148764,0.00005631312,0.000074242336,0.0000025361078,0.00001741675,0.0002932048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872476,0.000052680814,0.00030632803,0.00031526765,0.00028969147,0.00031126852],"domain_scores_gemma":[0.9978691,0.0017904942,0.000064709195,0.00017210066,0.000039162962,0.00006447669],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00058301573,0.00017908157,0.00013622458,0.00010145449,0.0016102559,0.00082475075,0.00033668216,0.00010685142,0.000032000957],"category_scores_gemma":[0.000009280451,0.00011533044,0.00009732019,0.0004814064,0.00006727191,0.0014666286,8.2835913e-7,0.0005008075,0.000007519544],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051981733,0.00003838034,0.0001167804,0.000064468855,0.000028840805,4.7857804e-7,0.004123874,0.0020589342,0.00018592426,0.0033998552,0.0000591233,0.9898714],"study_design_scores_gemma":[0.0063155373,0.0027977158,0.008187221,0.0037393582,0.000509541,0.000092062786,0.0041813194,0.4770714,0.054353558,0.43490222,0.005130765,0.0027193248],"about_ca_topic_score_codex":0.00000642149,"about_ca_topic_score_gemma":0.000004365617,"teacher_disagreement_score":0.98715204,"about_ca_system_score_codex":0.00005812338,"about_ca_system_score_gemma":0.000055302127,"threshold_uncertainty_score":0.9996895},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072785774,0.000046240315,0.9917964,0.000070622234,0.0000999415,0.0003312673,0.000011691333,0.00030939924,0.000055913584],"genre_scores_gemma":[0.7265551,0.0000028042912,0.2733033,0.000031810923,0.000010242547,0.00006382533,0.0000014198959,0.000012993383,0.000018522267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988729,0.000028509028,0.00040836414,0.000264741,0.00027118772,0.00015431765],"domain_scores_gemma":[0.9990938,0.000103842845,0.00025823197,0.00018392214,0.00030657256,0.000053674416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018219219,0.0001402453,0.00021541172,0.00026187938,0.0002086234,0.000060309136,0.0002770262,0.00007896691,0.000006286546],"category_scores_gemma":[0.000016455297,0.00014004663,0.000103778824,0.00048344626,0.000078320605,0.0006215373,0.0000018140674,0.00007506035,0.0000017560188],"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.00008297922,0.00038972782,0.000017057662,0.0003324778,0.000025208265,6.2336983e-7,0.001003654,0.73474896,0.057994187,0.0013373255,0.000009801995,0.20405799],"study_design_scores_gemma":[0.00043588734,0.00011186667,0.000004481763,0.00015430889,0.000013866831,0.000003601715,0.000013268867,0.40875134,0.5876244,0.002765612,0.000032165924,0.0000892057],"about_ca_topic_score_codex":0.000091951566,"about_ca_topic_score_gemma":0.000013238806,"teacher_disagreement_score":0.7192765,"about_ca_system_score_codex":0.00006359459,"about_ca_system_score_gemma":0.000171954,"threshold_uncertainty_score":0.57109356},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028832112,0.00019545412,0.99403566,0.000019986026,0.00014361217,0.00016650328,0.00003302754,0.0016273543,0.000895215],"genre_scores_gemma":[0.85905236,0.000067061264,0.14035653,0.00003444987,0.00008595936,0.00007428632,0.000002295331,0.00008186974,0.00024517582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99888116,0.000019628656,0.00023865252,0.00027963924,0.00023962496,0.00034130822],"domain_scores_gemma":[0.99956495,0.00003928707,0.000040848852,0.00015849026,0.00009489285,0.00010155217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00004950171,0.00026926558,0.00021444388,0.00020659313,0.00035084994,0.000033717406,0.00016552024,0.00010732531,0.00007957399],"category_scores_gemma":[0.0000013833182,0.00028891698,0.000089859204,0.00033156294,0.00011884418,0.00047230077,0.0000010541178,0.00045312193,0.00004209586],"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.000020157477,0.0000598055,0.0000014877038,0.000055950753,0.00002569492,0.000044405322,0.00050878833,0.5291421,0.008856058,0.000004414577,0.000102383136,0.4611788],"study_design_scores_gemma":[0.00057547644,0.00030226968,0.000055628014,0.0005714316,0.00004583066,0.00035117427,0.00031263698,0.48487583,0.50971496,0.00062854483,0.0015988469,0.0009673785],"about_ca_topic_score_codex":0.0000049966143,"about_ca_topic_score_gemma":0.0000030190993,"teacher_disagreement_score":0.85616916,"about_ca_system_score_codex":0.00015194429,"about_ca_system_score_gemma":0.0000374563,"threshold_uncertainty_score":0.9999563},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32788134,0.0000794397,0.6713462,0.00014105474,0.00006979154,0.000118065414,0.0000061465357,0.000054992208,0.0003029717],"genre_scores_gemma":[0.9894438,0.000021491438,0.010127094,0.00023404931,0.00005964924,0.0000021262606,0.0000075802664,0.000010784556,0.000093437266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863917,0.000058264173,0.0002338014,0.00031738137,0.00040546313,0.0003459335],"domain_scores_gemma":[0.99937546,0.00022214213,0.00006826989,0.00010796909,0.000088662804,0.0001375177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020210988,0.00016250313,0.00014674093,0.0001836707,0.0006629016,0.00037616535,0.00010229664,0.00011591019,0.00079910416],"category_scores_gemma":[0.000012580305,0.00015394454,0.00003649274,0.000513095,0.00006925859,0.00061201246,8.724212e-7,0.00029772235,0.00003927232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017136715,0.00006979839,0.0007514436,0.000050103416,0.00001263999,0.000016757609,0.00036896416,0.5296568,0.020793103,1.734032e-7,0.000008429135,0.4481004],"study_design_scores_gemma":[0.00028391095,0.00040789973,0.00035386917,0.00007239915,0.0000294358,0.000065027656,0.00008839057,0.9602457,0.03801087,0.00020706849,0.000055202087,0.00018018614],"about_ca_topic_score_codex":0.00081373553,"about_ca_topic_score_gemma":0.00036570284,"teacher_disagreement_score":0.66156244,"about_ca_system_score_codex":0.000026176967,"about_ca_system_score_gemma":0.00011651826,"threshold_uncertainty_score":0.874963},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21700323,0.000017848857,0.7823867,0.000033131197,0.000079487356,0.00020088114,0.000013408475,0.00007252331,0.00019280206],"genre_scores_gemma":[0.999091,0.000023032184,0.00074120704,0.000043011456,0.000007740345,0.000013433164,0.000001754823,0.00003088659,0.000047923393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99906904,0.000036174282,0.00025386125,0.00020013271,0.00020157648,0.00023920505],"domain_scores_gemma":[0.99956053,0.0001379255,0.000076302014,0.00013875423,0.00003670472,0.000049789698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023136454,0.00017936202,0.00017891462,0.00014096597,0.00017008226,0.000016759805,0.00015227956,0.000090972346,0.00007535032],"category_scores_gemma":[0.000003131182,0.00015567144,0.000047402937,0.00025979153,0.00007216722,0.0001898279,0.0000032792111,0.00029905335,0.0000071943136],"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.00031462777,0.00015660656,0.00026608232,0.00011508649,0.00004165867,0.000016995098,0.004052518,0.9611602,0.019236585,0.000013597401,0.000011878441,0.014614179],"study_design_scores_gemma":[0.0023702583,0.00021777551,0.00079623534,0.0015520327,0.00010007208,0.00003799828,0.0045260293,0.32330003,0.6654929,0.0007502972,0.000022810133,0.0008335514],"about_ca_topic_score_codex":0.00006307861,"about_ca_topic_score_gemma":0.00014619832,"teacher_disagreement_score":0.7820878,"about_ca_system_score_codex":0.00024706652,"about_ca_system_score_gemma":0.000013768941,"threshold_uncertainty_score":0.63480973},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040202066,0.00039562755,0.990551,0.00013336283,0.00024894264,0.0006313126,0.000016585567,0.0002181393,0.0037847995],"genre_scores_gemma":[0.993792,0.000046670055,0.0054992167,0.00022770575,0.0001713488,0.00005130439,0.0000028088757,0.00004004021,0.00016887888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997781,0.0001358378,0.00035436187,0.0007161318,0.00031824177,0.00069443975],"domain_scores_gemma":[0.99861246,0.0004742407,0.00012594818,0.00018484189,0.00039868607,0.00020382213],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037195388,0.0003281476,0.00033636493,0.00024006735,0.00089230755,0.00039799724,0.00033171498,0.00014114109,0.000066144305],"category_scores_gemma":[0.000004292902,0.00032120684,0.00014652187,0.0011078551,0.00017795665,0.00086669927,0.0000026030555,0.00049280986,0.000011187145],"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.0009917909,0.0006074618,0.000040864546,0.00007581654,0.00025469082,0.0001093933,0.006034924,0.06411075,0.0006664672,0.0010884571,0.0001274468,0.92589194],"study_design_scores_gemma":[0.0019724213,0.0014160618,0.00026670352,0.00043958708,0.00011401186,0.00007522705,0.0011169034,0.8678679,0.12317169,0.0027068106,0.000058934806,0.0007937603],"about_ca_topic_score_codex":0.000020361906,"about_ca_topic_score_gemma":0.000065910295,"teacher_disagreement_score":0.98977184,"about_ca_system_score_codex":0.000103263184,"about_ca_system_score_gemma":0.00034802812,"threshold_uncertainty_score":0.999924},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040421374,0.00004198042,0.99132097,0.00006474099,0.0004754964,0.00030847813,0.000019623907,0.0007554912,0.0029710762],"genre_scores_gemma":[0.95041984,0.0000011219862,0.049038284,0.0002345235,0.000078000245,0.00013584555,0.0000025198485,0.000029026069,0.000060847444],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99807835,0.0000989371,0.00042320645,0.00057932426,0.00045758096,0.00036257753],"domain_scores_gemma":[0.99892694,0.00008440146,0.00020252677,0.00031657369,0.00029324603,0.00017631466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003512502,0.00027683433,0.00026807564,0.0004162716,0.00040082406,0.00025651068,0.00049668306,0.00018780281,0.000063446845],"category_scores_gemma":[0.0000021608032,0.00025199773,0.00015038402,0.00087388774,0.000044902106,0.00090420106,0.0000019944057,0.00036498514,0.00026362605],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008155518,0.00068016537,0.000007681536,0.0004416187,0.0000540643,0.00003568875,0.0017039211,0.00056991936,0.020753916,0.000031452753,0.0000271055,0.97561294],"study_design_scores_gemma":[0.0034191883,0.0009141916,0.0003037203,0.0030838614,0.0001746277,0.0006908013,0.0007959925,0.15281525,0.83535475,0.00031536078,0.000502088,0.00163017],"about_ca_topic_score_codex":0.000025982345,"about_ca_topic_score_gemma":0.000009495233,"teacher_disagreement_score":0.97398275,"about_ca_system_score_codex":0.00011370155,"about_ca_system_score_gemma":0.00016766106,"threshold_uncertainty_score":0.9999932},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050513493,0.000022711161,0.9924916,0.000048248992,0.00003760262,0.0009077782,0.000045273136,0.0010432028,0.0003522292],"genre_scores_gemma":[0.81831795,0.0000069319353,0.18101114,0.00011425274,0.000028247277,0.00024702016,0.00022725455,0.000041768828,0.0000054263446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841565,0.000023786726,0.00054329116,0.0003309293,0.00040759545,0.00027875617],"domain_scores_gemma":[0.9984969,0.00005669405,0.00013184495,0.00087261386,0.00025583888,0.00018610906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006394267,0.00022816824,0.00017582318,0.0014543734,0.0003254172,0.00020510837,0.0006273429,0.00010873542,0.0000026799225],"category_scores_gemma":[0.0000065480435,0.0002436342,0.000019931573,0.0028219952,0.000028951123,0.003211895,0.0000048395686,0.00028729066,0.00005008367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003478751,0.00006229314,0.0000012696689,0.000064755084,0.000006327509,5.8802264e-8,0.00038368264,0.5820076,0.0069118864,0.000008635202,0.000017846702,0.41050088],"study_design_scores_gemma":[0.00018324959,0.00008478307,0.00022715969,0.00006900711,0.000022075294,0.000007621071,0.000251826,0.8878804,0.1105111,0.000072911265,0.000378573,0.00031129358],"about_ca_topic_score_codex":0.000016860917,"about_ca_topic_score_gemma":0.000020292095,"teacher_disagreement_score":0.8132666,"about_ca_system_score_codex":0.00022716659,"about_ca_system_score_gemma":0.000031740998,"threshold_uncertainty_score":0.99351144},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00836974,0.0004196042,0.9896539,0.000028063658,0.0001825196,0.0004266072,0.000032227956,0.00039991646,0.00048746355],"genre_scores_gemma":[0.96821934,0.000029037976,0.031380955,0.000012694826,0.00007521309,0.000087029846,0.0000101728165,0.000072423485,0.000113113354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990309,0.000012110065,0.00029051313,0.00019240504,0.0001506396,0.00032343584],"domain_scores_gemma":[0.9994293,0.00009241858,0.000054848606,0.00023471407,0.000089472975,0.00009926725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016629664,0.00019998719,0.00017194367,0.00017011412,0.00038538474,0.00013613666,0.0001482375,0.000092829934,0.000023789322],"category_scores_gemma":[0.0000013328905,0.00018070398,0.000056783956,0.00028473543,0.000057612313,0.00034867722,7.397266e-7,0.00022451664,0.0000061861606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009868041,0.00007043648,0.000004291475,0.00012637248,0.00003426546,0.000001925953,0.00024853548,0.98354656,0.0021273391,0.000005215784,0.00000928444,0.01372708],"study_design_scores_gemma":[0.00078475394,0.00011280448,0.00002430376,0.00017654186,0.00004608142,0.000014772063,0.00014975441,0.9699837,0.028038517,0.000006700406,0.0003952149,0.00026688736],"about_ca_topic_score_codex":0.000018759793,"about_ca_topic_score_gemma":0.000064926266,"teacher_disagreement_score":0.9598496,"about_ca_system_score_codex":0.00012549663,"about_ca_system_score_gemma":0.000038323393,"threshold_uncertainty_score":0.7368894},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08626449,0.00009381184,0.9121245,0.0002818136,0.0002446982,0.000101555815,0.00000148326,0.00019669179,0.0006909563],"genre_scores_gemma":[0.9638624,0.000012964781,0.035239194,0.0006454769,0.00007135151,0.0000147606515,4.5682773e-7,0.000023106599,0.00013024047],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99819505,0.000055704968,0.00033945407,0.0005553859,0.00040161697,0.0004528045],"domain_scores_gemma":[0.99937314,0.00008741459,0.000109654684,0.00023892144,0.00007246073,0.00011839387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017315106,0.00024426685,0.00023429217,0.00039766388,0.00061591883,0.00017556957,0.0004391735,0.00010212554,0.000038141276],"category_scores_gemma":[0.0000043654104,0.00024042229,0.000086026645,0.0008658836,0.00009043788,0.00071737805,0.000002487928,0.0004751965,0.000089177665],"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.00011575412,0.0005260961,0.00004089175,0.00005816031,0.000011675917,0.00024397991,0.0022007122,0.03745365,0.17836289,0.0000087007165,0.00006347165,0.780914],"study_design_scores_gemma":[0.0007985145,0.0001693704,0.00010894647,0.00033624246,0.000005372834,0.00015114066,0.000039868002,0.028676752,0.9686298,0.00066714647,0.000060760394,0.0003560849],"about_ca_topic_score_codex":0.000046371908,"about_ca_topic_score_gemma":0.000026249558,"teacher_disagreement_score":0.8775979,"about_ca_system_score_codex":0.0001255331,"about_ca_system_score_gemma":0.00024446804,"threshold_uncertainty_score":0.9804136},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019999233,0.000054061617,0.9957232,0.00019470521,0.00016036468,0.00026580942,0.0000018981281,0.0005889559,0.0028109963],"genre_scores_gemma":[0.862374,0.000011149737,0.13680533,0.00058017916,0.000010886694,0.000037301757,0.000002071532,0.00001917768,0.0001599317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841535,0.00020357894,0.00036324994,0.00040558702,0.00037964055,0.00023260448],"domain_scores_gemma":[0.99917847,0.00005952333,0.00016260105,0.00024953458,0.00025480887,0.00009507202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044736784,0.00018655603,0.00016854913,0.00028810473,0.00038865936,0.00033876995,0.0002574039,0.00012731174,0.00009671276],"category_scores_gemma":[0.000006194462,0.0001923389,0.00006220531,0.00081803923,0.0000666746,0.0011798987,0.0000013470626,0.0002290018,0.000022882154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031615542,0.0002654803,0.0000026567502,0.000032124266,0.000017935155,0.000004638211,0.0013419382,0.8903536,0.006024852,0.010320772,0.000039366503,0.09156498],"study_design_scores_gemma":[0.0004533812,0.00009388717,7.0414393e-7,0.00004295939,0.000011652664,0.000024241635,0.000035480083,0.82426316,0.17209262,0.0025241373,0.00023177697,0.00022602247],"about_ca_topic_score_codex":0.0000045139327,"about_ca_topic_score_gemma":0.0000031209754,"teacher_disagreement_score":0.862174,"about_ca_system_score_codex":0.00007789457,"about_ca_system_score_gemma":0.00021463973,"threshold_uncertainty_score":0.7843353},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09879874,0.000027547025,0.89985603,0.0006383681,0.00017082048,0.00020869207,0.000021486612,0.0002461953,0.00003210489],"genre_scores_gemma":[0.9867263,0.0000034101195,0.012758823,0.00032013454,0.000029460954,0.000064375294,0.000009892329,0.00001463841,0.00007300577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852806,0.000068567395,0.00030088675,0.00042147207,0.000319508,0.00036150214],"domain_scores_gemma":[0.9991728,0.00008272184,0.00011266357,0.0002991814,0.00019179325,0.00014086257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011078108,0.0001836279,0.00014543455,0.00006245148,0.00038669189,0.00036860714,0.00033664858,0.000053710653,0.00047425088],"category_scores_gemma":[0.0000010826593,0.00015133638,0.000049563798,0.00042903677,0.00009716165,0.00064335525,0.000004119737,0.000213107,0.00013670998],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006523332,0.00025827976,0.00043903085,0.00004898978,0.000055824148,0.000036252153,0.0008445399,0.025878614,0.014768169,0.00018208007,0.0023231928,0.9550998],"study_design_scores_gemma":[0.0014659049,0.00040171435,0.002510088,0.00020494581,0.00004983697,0.00013846374,0.0007284754,0.7578345,0.23471802,0.00049494323,0.0008036767,0.0006494596],"about_ca_topic_score_codex":0.00005489279,"about_ca_topic_score_gemma":0.000013600459,"teacher_disagreement_score":0.9544503,"about_ca_system_score_codex":0.00003925798,"about_ca_system_score_gemma":0.000060514452,"threshold_uncertainty_score":0.6171318},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4141549,0.000095605115,0.5853673,0.000008097296,0.000018928888,0.00009051827,0.0000018237698,0.00019239796,0.00007044748],"genre_scores_gemma":[0.9899219,0.00004250644,0.009948327,0.000019160818,0.000006466358,0.00001894447,0.0000015176823,0.000028055718,0.000013083456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992229,0.000017881124,0.00022504991,0.00017950025,0.00013644151,0.00021824535],"domain_scores_gemma":[0.9998337,0.000026147296,0.00001156368,0.00007417612,0.000008808012,0.000045630448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006414936,0.00015443254,0.00014250448,0.00011780993,0.00016260146,0.000065356806,0.00005116191,0.00014073923,0.00014385127],"category_scores_gemma":[0.0000015007789,0.00015921594,0.000028044762,0.00021304398,0.0000908636,0.00024437616,4.0409964e-7,0.00026993212,0.00002240286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036996214,0.000037804028,0.000056096593,0.000030472513,0.0000061343176,0.0000050400727,0.00046881253,0.7987674,0.0038684376,5.5868253e-7,6.2133364e-7,0.19672164],"study_design_scores_gemma":[0.0005881276,0.00003645941,0.00021320405,0.00010182306,0.000023752247,0.000018108849,0.000082356295,0.95794666,0.040777564,0.000017976185,0.00002482207,0.00016916334],"about_ca_topic_score_codex":0.000010810366,"about_ca_topic_score_gemma":0.0000058833266,"teacher_disagreement_score":0.57576704,"about_ca_system_score_codex":0.000112416725,"about_ca_system_score_gemma":0.000017629462,"threshold_uncertainty_score":0.64926374},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012909557,0.000024937191,0.98429316,0.0003500652,0.0004459693,0.00022347072,0.000006558893,0.00046315242,0.0012831213],"genre_scores_gemma":[0.98699665,5.703334e-7,0.012355,0.00016593972,0.000094504016,0.000052539322,9.0168123e-7,0.000024574645,0.00030933614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818736,0.000046618425,0.00029748166,0.00054453884,0.0004955879,0.00042842224],"domain_scores_gemma":[0.9989757,0.00007255468,0.00014594178,0.0004473251,0.00017355269,0.00018494304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002606056,0.00024963162,0.00022349921,0.00019232833,0.000532406,0.00056074024,0.0007150739,0.0001105999,0.000038866907],"category_scores_gemma":[0.0000025307274,0.0002089153,0.000081726816,0.0006431897,0.0000921808,0.0010924704,0.0000023662803,0.0006179849,0.00010232209],"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.00008769246,0.00043327795,0.00008063718,0.00011616199,0.00009646605,0.000093505,0.0010775318,0.015412564,0.18545048,0.0007449684,0.00006182902,0.7963449],"study_design_scores_gemma":[0.0026895904,0.00041125045,0.0004651115,0.00044519277,0.00008107902,0.0003966902,0.00017304032,0.8579031,0.13361199,0.00036757492,0.0023353864,0.001119935],"about_ca_topic_score_codex":0.000031842657,"about_ca_topic_score_gemma":0.00005989537,"teacher_disagreement_score":0.97408706,"about_ca_system_score_codex":0.000048789,"about_ca_system_score_gemma":0.000204159,"threshold_uncertainty_score":0.85193187},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105487674,0.000010889586,0.89273715,0.0002713939,0.00031515994,0.00016359403,0.0000017339322,0.0001584971,0.0008539012],"genre_scores_gemma":[0.9939322,0.000007756535,0.0055638338,0.00025761273,0.00008703732,0.000034156747,5.8528315e-7,0.000022078317,0.000094769086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983916,0.00005923305,0.00025783392,0.00044905138,0.00039025542,0.00045197672],"domain_scores_gemma":[0.99915075,0.00022748976,0.00011153457,0.00031147434,0.00008602078,0.00011273239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033614796,0.0002370155,0.00018046798,0.0003096436,0.00066649506,0.0004306136,0.0004566681,0.00012742821,0.000027239377],"category_scores_gemma":[0.000002314713,0.00016104124,0.000059981117,0.002088604,0.00009415168,0.0005006784,0.000002765199,0.0012611648,0.000018875931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005410556,0.00009754841,0.000015197478,0.00000731616,0.000008657123,0.000013912826,0.000105269035,0.65651715,0.00016072918,0.00016086694,0.000008739067,0.34285054],"study_design_scores_gemma":[0.00036864122,0.00022484345,0.0002079513,0.000112123395,0.00000782843,0.00006826668,0.00006275243,0.9920982,0.0064923,0.000019329744,0.000096972144,0.00024077756],"about_ca_topic_score_codex":0.000008147444,"about_ca_topic_score_gemma":0.000022346341,"teacher_disagreement_score":0.8884445,"about_ca_system_score_codex":0.00005276592,"about_ca_system_score_gemma":0.00006932097,"threshold_uncertainty_score":0.6567071},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005751958,0.000036426594,0.9943029,0.0003446058,0.00012145823,0.00016427945,0.0000015531637,0.000108450535,0.0043451153],"genre_scores_gemma":[0.92258215,0.0000028936424,0.076526664,0.00037892256,0.000010599015,0.000018510316,4.9259774e-7,0.00001206013,0.0004677076],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987708,0.000048073292,0.00027541688,0.0003174128,0.0002871713,0.00030117162],"domain_scores_gemma":[0.99958134,0.000050721024,0.000039276827,0.00014964503,0.00003374543,0.00014527996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014667594,0.000148349,0.00013498335,0.00021808343,0.00015353755,0.00022453496,0.00020730242,0.000047971054,0.00010793227],"category_scores_gemma":[0.0000017305279,0.0001431515,0.000069175774,0.0007693793,0.000015555579,0.0013101597,6.2138685e-7,0.00018888988,0.000050043345],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016283386,0.00014768729,0.000005957557,0.000010449286,0.0000064963847,0.000011517312,0.00084561587,0.0024593635,0.0018437174,0.001243639,0.0001342229,0.99327505],"study_design_scores_gemma":[0.0058310977,0.0012804595,0.00016139158,0.00043739314,0.00006127833,0.0002680926,0.000502873,0.44316086,0.4763603,0.04972434,0.020445392,0.0017665037],"about_ca_topic_score_codex":0.000017560875,"about_ca_topic_score_gemma":0.0000115105,"teacher_disagreement_score":0.99150854,"about_ca_system_score_codex":0.00006834847,"about_ca_system_score_gemma":0.00024766687,"threshold_uncertainty_score":0.58375484},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00840014,0.0004345804,0.988377,0.00004505287,0.00016070284,0.00018695074,0.000009389778,0.0004992278,0.0018869855],"genre_scores_gemma":[0.9860606,0.00006052491,0.013524706,0.0000484657,0.000048920905,0.000022777407,0.0000021178682,0.00005421375,0.00017764539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989565,0.000031042095,0.00030385592,0.00018025044,0.0001885462,0.00033982965],"domain_scores_gemma":[0.99940604,0.00012830336,0.000028678323,0.00024615575,0.000056069883,0.00013475251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032555935,0.00020512269,0.00016329832,0.00023200868,0.00029009208,0.00005701612,0.00022427658,0.000109922905,0.00012374444],"category_scores_gemma":[0.0000011871039,0.00020278963,0.0000960327,0.0004145593,0.00006531848,0.00031258498,4.6420033e-7,0.00041756488,0.00006318361],"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.00015299769,0.00018263541,0.0000053708636,0.00008281106,0.00007009413,0.00001382589,0.0013841817,0.45057434,0.12497473,0.000007050413,0.00010290223,0.42244908],"study_design_scores_gemma":[0.001306158,0.00012774949,0.00020749508,0.00024332147,0.000107651365,0.00002493482,0.00022214951,0.34333137,0.6509343,0.00014771496,0.0026438935,0.00070329866],"about_ca_topic_score_codex":0.0000057030757,"about_ca_topic_score_gemma":0.0000142229865,"teacher_disagreement_score":0.9776605,"about_ca_system_score_codex":0.00007195894,"about_ca_system_score_gemma":0.000031125885,"threshold_uncertainty_score":0.8269521},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018938182,0.00016250502,0.97787786,0.0004253382,0.0014585607,0.0004981326,0.000012264021,0.00034020402,0.00028696848],"genre_scores_gemma":[0.90921015,0.0000075280495,0.08989755,0.00017691268,0.0005709088,0.00001570385,0.0000015542207,0.000045537974,0.00007414081],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978065,0.000067338086,0.0003824215,0.00072921213,0.00036559987,0.00064895884],"domain_scores_gemma":[0.99825567,0.0008807939,0.00017683017,0.0002510613,0.00023146423,0.00020419125],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038708752,0.00033717704,0.0003632659,0.0002504126,0.0010339784,0.00089476974,0.00028718912,0.00022124077,0.000014277462],"category_scores_gemma":[0.000017495424,0.0003343238,0.00018836254,0.0005963451,0.00013890605,0.00068627734,0.0000031577715,0.0009626975,0.000014083808],"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.00032300813,0.00027377988,0.000008583236,0.00016023192,0.00017041643,0.00010162854,0.001955163,0.048133776,0.015181127,0.0044838297,0.00004813427,0.9291603],"study_design_scores_gemma":[0.0007389183,0.00024259339,0.000015113843,0.0006333864,0.00007957076,0.00035573228,0.00021179352,0.9409856,0.052930553,0.0030687733,0.0001902692,0.00054766086],"about_ca_topic_score_codex":0.000017515562,"about_ca_topic_score_gemma":0.00002489135,"teacher_disagreement_score":0.92861265,"about_ca_system_score_codex":0.00006364853,"about_ca_system_score_gemma":0.0001847596,"threshold_uncertainty_score":0.9999109},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011473587,0.000035106634,0.98531383,0.0004509444,0.00007498014,0.00035061664,0.0000011490615,0.00095246,0.0013473153],"genre_scores_gemma":[0.95171463,0.0000028824027,0.046667602,0.00084498123,0.000055657965,0.000034498607,0.0000022072286,0.00003682093,0.00064068846],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977492,0.000085807245,0.00043680347,0.00060022314,0.00069158466,0.00043638644],"domain_scores_gemma":[0.9988209,0.00016457535,0.00021945838,0.00039731016,0.00022720825,0.00017056004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076979504,0.00030276141,0.00023999307,0.00050235883,0.0005364943,0.0005106937,0.000575256,0.00017718131,0.0000329385],"category_scores_gemma":[0.0000021439864,0.00027681066,0.0000891347,0.0010915456,0.00010134919,0.0013764922,0.0000035080348,0.00046546574,0.00004509789],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041504894,0.0005090798,0.000020705067,0.000066179855,0.00004733084,0.000033016262,0.0030215282,0.0366379,0.0376759,0.00024458778,0.00007148087,0.92125726],"study_design_scores_gemma":[0.0015090136,0.0009134137,0.00008427435,0.00017275415,0.00005383329,0.00019647354,0.00014268882,0.25083086,0.7428129,0.0012504541,0.0012740019,0.00075938937],"about_ca_topic_score_codex":0.000015928419,"about_ca_topic_score_gemma":0.000085494394,"teacher_disagreement_score":0.9402411,"about_ca_system_score_codex":0.00012671262,"about_ca_system_score_gemma":0.00020377606,"threshold_uncertainty_score":0.9999684},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11392177,0.0009442098,0.8808537,0.000118623255,0.0004984508,0.00027151188,0.00004823188,0.00063714175,0.0027063384],"genre_scores_gemma":[0.9945435,0.00001950714,0.0046452866,0.000055356984,0.0004184842,0.00003131892,0.0000039830506,0.00013306236,0.0001494915],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99770844,0.000045109406,0.00062208355,0.0005295813,0.00048339478,0.00061138894],"domain_scores_gemma":[0.9990797,0.00014386208,0.000105808926,0.00024323245,0.00007799688,0.00034940735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003621231,0.00050230045,0.0005246926,0.00034243954,0.0006854018,0.000374175,0.00025488823,0.00030971484,0.00013785172],"category_scores_gemma":[0.0000035776593,0.0004932411,0.0001515719,0.0004972188,0.00018205162,0.0008085953,5.219123e-7,0.0012035504,0.000023381013],"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.00003303497,0.00009412855,0.00002017088,0.00035015418,0.0000702629,0.000008616299,0.00055290945,0.000984049,0.6385317,0.000004115707,0.00006303528,0.35928783],"study_design_scores_gemma":[0.0023551136,0.0002773412,0.00007095281,0.0005705957,0.00024937265,0.00020186597,0.00041136384,0.010274994,0.9657323,0.00024769644,0.018296042,0.0013123901],"about_ca_topic_score_codex":0.000024617933,"about_ca_topic_score_gemma":0.000028589053,"teacher_disagreement_score":0.88062173,"about_ca_system_score_codex":0.00006163011,"about_ca_system_score_gemma":0.00011946742,"threshold_uncertainty_score":0.9997519},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016579675,0.0003656625,0.9815683,0.00002008236,0.00011573498,0.0002720534,0.00000896799,0.00033143337,0.00073808816],"genre_scores_gemma":[0.9789239,0.000009777502,0.020736441,0.00003687381,0.000034754077,0.00011022842,0.000003447451,0.00009317994,0.000051365125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855065,0.000029221976,0.00045588275,0.00032284955,0.00022785107,0.00041351654],"domain_scores_gemma":[0.9995678,0.000054323114,0.00007482462,0.00011574293,0.00009165941,0.000095623254],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001906239,0.00030357015,0.00032820922,0.00034126046,0.00026936445,0.000095443,0.00013369857,0.00015042574,0.000028024877],"category_scores_gemma":[0.0000010669847,0.00027728526,0.00007638105,0.0005669199,0.0000623704,0.0006346056,3.2693717e-7,0.0002362897,0.0000026980244],"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.00060670055,0.00021797138,0.000009985536,0.00089229824,0.00009034453,0.0000333827,0.002994663,0.36255303,0.031798698,0.000035688343,0.000018303639,0.60074896],"study_design_scores_gemma":[0.0012675637,0.00023667006,0.000022315457,0.00092515646,0.00006727664,0.000045929235,0.00031792687,0.809707,0.18653758,0.00029180848,0.00011616935,0.0004646314],"about_ca_topic_score_codex":0.00009686205,"about_ca_topic_score_gemma":0.00016898192,"teacher_disagreement_score":0.9623442,"about_ca_system_score_codex":0.000124854,"about_ca_system_score_gemma":0.00009521654,"threshold_uncertainty_score":0.99996793},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081576765,0.00001710592,0.91712713,0.00021109168,0.00055971835,0.00016114964,0.000026773088,0.00024698605,0.000073265284],"genre_scores_gemma":[0.9661939,0.000001656098,0.03308588,0.0005421796,0.00010619531,0.000004352022,0.0000028095453,0.000021556572,0.000041436764],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978897,0.00008085154,0.00052089326,0.0005445403,0.0005407032,0.0004233142],"domain_scores_gemma":[0.99879426,0.00020197131,0.00021460268,0.00041008953,0.00017454657,0.0002045275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006221587,0.00023076417,0.00023788719,0.0003774085,0.0005853465,0.00016458343,0.00040506857,0.00012173952,0.00001484858],"category_scores_gemma":[0.00001087118,0.00022304099,0.000106256026,0.0010986681,0.000052176067,0.00038264837,0.000005282465,0.00040372688,0.000016494301],"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.0003257605,0.00041991196,0.000025420051,0.00005657406,0.00003422301,0.0000201118,0.0011403392,0.39225763,0.17163698,0.000027181,0.00008919277,0.4339667],"study_design_scores_gemma":[0.00043474062,0.0003775394,0.00013719675,0.00039542426,0.000030569856,0.000037197686,0.00022731061,0.19886003,0.7971296,0.00011199972,0.0018834613,0.00037496202],"about_ca_topic_score_codex":0.00004998618,"about_ca_topic_score_gemma":0.0000064010123,"teacher_disagreement_score":0.88461715,"about_ca_system_score_codex":0.000105053434,"about_ca_system_score_gemma":0.000042020903,"threshold_uncertainty_score":0.90953475},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19590317,0.0003144239,0.8032046,0.00003895323,0.000015232569,0.0001311632,0.000011413021,0.00022375066,0.00015727858],"genre_scores_gemma":[0.9826312,0.000044165707,0.017209336,0.000008863464,0.0000064176056,0.000056527526,0.0000029256835,0.000027123775,0.00001344637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992233,0.000042183754,0.00035876702,0.00012710756,0.00012049979,0.0001281656],"domain_scores_gemma":[0.99964064,0.00006662945,0.00006597578,0.00015134481,0.000047428748,0.00002795744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017782136,0.0001269219,0.00016546919,0.0003363773,0.00007517542,0.000017460847,0.00007850962,0.00007271864,0.000009478931],"category_scores_gemma":[0.0000040815858,0.00014245814,0.000027872742,0.00032701838,0.00006415946,0.00035308397,7.7743454e-7,0.00021167043,0.0000013723316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009163706,0.00016042117,0.0000028203299,0.00013320758,0.0000039205684,0.0000017378566,0.00024431368,0.60488623,0.2617041,0.000022884185,0.0000064284473,0.13274233],"study_design_scores_gemma":[0.00039466092,0.000060053524,0.000120244935,0.00028158945,0.000007134236,0.000005170231,0.00003825297,0.5196347,0.47780246,0.001526972,0.0000046549067,0.00012408159],"about_ca_topic_score_codex":0.000028689163,"about_ca_topic_score_gemma":0.000023539427,"teacher_disagreement_score":0.786728,"about_ca_system_score_codex":0.00008039593,"about_ca_system_score_gemma":0.000025751664,"threshold_uncertainty_score":0.58092743},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043056868,0.0001289832,0.9558059,0.00020631195,0.00006390906,0.00015151777,0.0000072717175,0.0001772254,0.0004020291],"genre_scores_gemma":[0.98677176,0.000032416545,0.012879031,0.00012957481,0.00003963559,0.000020725403,0.0000010653201,0.000014143535,0.00011163754],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99857736,0.00008735432,0.0003363485,0.00040045468,0.00036105138,0.00023745585],"domain_scores_gemma":[0.9993718,0.00010266121,0.000106621206,0.00021312342,0.00010582089,0.00009996177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002079445,0.00018103872,0.00020319961,0.00017088167,0.00025487068,0.00015629332,0.00026546378,0.00007236395,0.00024358963],"category_scores_gemma":[0.0000018731829,0.00018030441,0.00007211438,0.00040020177,0.00014099787,0.0011898138,0.000001975968,0.0002187454,0.0000319208],"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.00009635166,0.00017622855,0.000004992395,0.00007660805,0.000012067104,0.000005700807,0.00042966128,0.024453297,0.2361904,0.000039900384,0.00002478736,0.73849],"study_design_scores_gemma":[0.000707559,0.00021661392,0.00016411996,0.00016514352,0.000028754672,0.000029006409,0.000023339664,0.35150564,0.6461018,0.00065998104,0.00016472868,0.00023334973],"about_ca_topic_score_codex":0.0000329773,"about_ca_topic_score_gemma":0.0000021869175,"teacher_disagreement_score":0.9437149,"about_ca_system_score_codex":0.000035881694,"about_ca_system_score_gemma":0.00008094248,"threshold_uncertainty_score":0.73526007},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054796613,0.000066447654,0.99047136,0.000009628428,0.00007138027,0.00026614897,0.000020117233,0.0025218923,0.0010933417],"genre_scores_gemma":[0.64432776,0.0000424682,0.35532123,0.000035123896,0.00006672599,0.000048789054,0.0000016620311,0.00008721861,0.00006901376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875724,0.000028409891,0.00036259773,0.00032013035,0.00019190607,0.0003396986],"domain_scores_gemma":[0.9995754,0.000026785507,0.00004998403,0.00018457904,0.00007670404,0.00008659501],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009645548,0.00032483164,0.0002505222,0.00024359084,0.00023674978,0.0000708282,0.00017538191,0.00013354333,0.00058124907],"category_scores_gemma":[0.0000010947393,0.00035661092,0.00009426391,0.00034029278,0.00007463984,0.00080814766,0.0000017353987,0.00040775398,0.000016401713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047623227,0.000019173383,1.2507775e-7,0.000038419927,0.000014328549,0.0000060906973,0.00013095138,0.7014478,0.05464427,8.737223e-7,0.0000042270503,0.24364613],"study_design_scores_gemma":[0.000081632876,0.00008508924,4.6802808e-7,0.00037743495,0.000014709734,0.000027427055,0.000034753808,0.59796745,0.40096766,0.000048924187,0.00014293674,0.00025153367],"about_ca_topic_score_codex":0.00000729587,"about_ca_topic_score_gemma":0.0000016150792,"teacher_disagreement_score":0.6388481,"about_ca_system_score_codex":0.0002595274,"about_ca_system_score_gemma":0.000025867483,"threshold_uncertainty_score":0.9998886},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053419035,0.00008830511,0.9453323,0.00013655619,0.00005467946,0.0001965569,0.0000021889355,0.00041907615,0.0003513077],"genre_scores_gemma":[0.89051473,0.0000048314896,0.10918051,0.00015481925,0.000024538083,0.000018358596,3.1393694e-7,0.000022624401,0.000079258374],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99832374,0.00010230915,0.00039479003,0.00037563784,0.00052260864,0.00028093095],"domain_scores_gemma":[0.99913734,0.00007471192,0.00028246714,0.000255662,0.00015728659,0.00009255252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030662632,0.00019635433,0.00024166479,0.0003416559,0.0006049097,0.00015884485,0.00052917714,0.00010120812,0.000020162446],"category_scores_gemma":[0.0000019541565,0.0001939983,0.00011014961,0.00068463845,0.00013237,0.0010924186,0.0000056135664,0.00034852978,0.000005297385],"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.00014190501,0.0011377563,0.00006356638,0.00044078162,0.00015579317,0.00017267183,0.046889067,0.21356812,0.27609617,0.0021259265,0.00004623996,0.459162],"study_design_scores_gemma":[0.0004288493,0.00019238205,0.000031620497,0.00060125726,0.00003238638,0.0005097959,0.0003052379,0.3899155,0.60624003,0.001246453,0.00007144038,0.00042503947],"about_ca_topic_score_codex":0.000017698203,"about_ca_topic_score_gemma":0.0000019207218,"teacher_disagreement_score":0.83709574,"about_ca_system_score_codex":0.000070003865,"about_ca_system_score_gemma":0.00025556673,"threshold_uncertainty_score":0.7911021},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044310335,0.00005467095,0.9912916,0.0022435938,0.000013308387,0.00045342208,0.0000010654168,0.00017126591,0.0013400549],"genre_scores_gemma":[0.7126767,0.0000018496719,0.28638935,0.0008085923,0.000007946071,0.00008505642,4.710564e-7,0.000011278124,0.000018729568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980533,0.00029806953,0.00050080946,0.000361446,0.0005341658,0.00025220518],"domain_scores_gemma":[0.99894434,0.00023221999,0.00025946816,0.00041222083,0.000112755064,0.00003901512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011911145,0.00018724527,0.0002135838,0.00021189211,0.00040312568,0.00040542494,0.00090715796,0.000095451345,0.0000027563583],"category_scores_gemma":[0.00000503091,0.0001255229,0.00008889022,0.00094992673,0.00013648873,0.0013296608,0.000003343486,0.0006225613,0.0000021663247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012533964,0.0004196932,0.000009613419,0.000053182408,0.0000042265797,4.796999e-7,0.0062174583,0.8516067,0.0018164758,0.00033649016,0.000042053023,0.13948107],"study_design_scores_gemma":[0.00028165904,0.000047725203,0.000032145344,0.00011938326,0.0000124442495,0.0000050870576,0.00039462716,0.9774908,0.020629458,0.0007673184,0.00007560522,0.00014375143],"about_ca_topic_score_codex":0.000013448496,"about_ca_topic_score_gemma":0.000046869034,"teacher_disagreement_score":0.7082457,"about_ca_system_score_codex":0.000077859215,"about_ca_system_score_gemma":0.00035922616,"threshold_uncertainty_score":0.5118676},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013939255,0.00042157058,0.9779801,0.00005447292,0.000025683674,0.000310224,0.000013441207,0.00092946616,0.0063258177],"genre_scores_gemma":[0.98513645,0.00006302145,0.014527648,0.0000716748,0.000019064171,0.00009464947,0.0000057531292,0.000051872878,0.000029838193],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99868256,0.00008052764,0.0003999965,0.00021021765,0.00030135838,0.00032531488],"domain_scores_gemma":[0.99932504,0.00013522549,0.000106824875,0.00020441653,0.000106784355,0.00012172574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020241523,0.00030873617,0.00024220963,0.0003117274,0.00042014796,0.00022440737,0.00017780425,0.0001443259,0.00014720007],"category_scores_gemma":[0.0000062265676,0.00031124736,0.000057067205,0.0004084726,0.0001626528,0.0010340158,0.0000016998052,0.00057273445,0.000019202354],"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.000058949343,0.00007575327,0.0000031660254,0.00042740122,0.000033963785,0.000002690807,0.0016238383,0.36645326,0.0362168,0.001059628,0.0000144669675,0.5940301],"study_design_scores_gemma":[0.00075179926,0.00014709048,0.000033644523,0.0005376553,0.000054175372,0.00007759334,0.00037710788,0.43516642,0.5513629,0.010087809,0.00064169324,0.0007621419],"about_ca_topic_score_codex":0.000001626982,"about_ca_topic_score_gemma":0.0000031484497,"teacher_disagreement_score":0.97119725,"about_ca_system_score_codex":0.00009663599,"about_ca_system_score_gemma":0.00010490979,"threshold_uncertainty_score":0.99993396},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015430425,0.00012324171,0.9824538,0.00007971402,0.0008108532,0.0002962735,0.000049731785,0.00068579416,0.00007012091],"genre_scores_gemma":[0.98449934,0.000030185627,0.014428549,0.00007106779,0.00018543571,0.000114125905,0.000012516136,0.00009888646,0.00055988727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874175,0.000019549478,0.0002411348,0.00035512954,0.00024822218,0.00039421738],"domain_scores_gemma":[0.99922115,0.000110935325,0.00008247397,0.00022095736,0.00023394977,0.00013051742],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000084790634,0.00029094287,0.0002515309,0.00020021683,0.00067118305,0.00017802803,0.00019467823,0.00025830197,0.000020948062],"category_scores_gemma":[0.0000039663187,0.0003111691,0.00011036595,0.00036704438,0.000057047946,0.0008631294,0.0000028243098,0.00034622723,0.0000045205716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007249637,0.00006844222,0.000012428422,0.00017165378,0.00005576755,0.0000022876457,0.00043104534,0.9034111,0.03803222,0.000017834538,0.00020847899,0.057516236],"study_design_scores_gemma":[0.00079194375,0.000034337998,0.0000067485344,0.00008879148,0.00005726124,0.0000052336236,0.00015425903,0.9124949,0.08445794,0.000042539163,0.0015151387,0.00035092968],"about_ca_topic_score_codex":0.0000138848345,"about_ca_topic_score_gemma":0.000053068725,"teacher_disagreement_score":0.96906894,"about_ca_system_score_codex":0.00008948667,"about_ca_system_score_gemma":0.000023980401,"threshold_uncertainty_score":0.999934},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00237109,0.00022315676,0.9946887,0.000021108259,0.00010144859,0.00035750368,0.00000853568,0.0008972034,0.0013312638],"genre_scores_gemma":[0.9527243,0.00005305533,0.046668626,0.000054678563,0.000013891636,0.00023421925,0.0000039857487,0.00007812314,0.00016913586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99907595,0.00003269961,0.00030823456,0.00019318014,0.00013965816,0.00025028296],"domain_scores_gemma":[0.99944746,0.000122042606,0.000060050934,0.00020945254,0.000101292346,0.000059685513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014819995,0.0001875541,0.0001613531,0.00016730104,0.00030032857,0.00005742517,0.00013971645,0.00011221325,0.000026670888],"category_scores_gemma":[0.0000057045236,0.00021321913,0.000074888885,0.00027986194,0.00003647371,0.00039599926,4.6605697e-7,0.00020173502,0.0000063609314],"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.000017238857,0.000055419932,0.0000018004844,0.00019605154,0.000024597342,2.415506e-7,0.00045678625,0.84307337,0.043699685,0.00016231334,0.0000997007,0.11221281],"study_design_scores_gemma":[0.00034862227,0.000048042173,7.751399e-7,0.00015937211,0.000030359377,0.000005567516,0.000117312025,0.2887047,0.7064717,0.001781938,0.002034727,0.00029691236],"about_ca_topic_score_codex":0.0000010125641,"about_ca_topic_score_gemma":0.0000040660143,"teacher_disagreement_score":0.9503532,"about_ca_system_score_codex":0.00011083945,"about_ca_system_score_gemma":0.000034216875,"threshold_uncertainty_score":0.8694824},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33996138,0.00017112702,0.65398103,0.000254234,0.0001273534,0.00013129345,0.000015241888,0.00023984489,0.005118504],"genre_scores_gemma":[0.99775225,0.000017848093,0.0018975644,0.000070682734,0.00003156219,0.000020159752,0.0000033615165,0.000029953339,0.00017662969],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993202,0.000022654278,0.00018598187,0.00017105721,0.00011394675,0.00018614698],"domain_scores_gemma":[0.9995872,0.00006312417,0.000024998935,0.00017872105,0.000054317476,0.00009164535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010485504,0.00015918858,0.00012361347,0.000110437264,0.00024282906,0.00010672144,0.00010020979,0.0000927931,0.00025209956],"category_scores_gemma":[0.0000020155933,0.00015872225,0.000036068697,0.0001760458,0.00019534565,0.00025849682,0.000001209832,0.00052699936,0.000016699261],"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.00008734455,0.000344664,0.000022711389,0.00009644611,0.00014389027,0.0000069968346,0.0039324015,0.1834076,0.5326538,0.000931933,0.00023917737,0.278133],"study_design_scores_gemma":[0.0026997377,0.0003828654,0.0022261732,0.0004215448,0.0001969499,0.00044233896,0.0042214105,0.48776639,0.49426103,0.00088261045,0.0046405084,0.0018584583],"about_ca_topic_score_codex":0.0000027974297,"about_ca_topic_score_gemma":0.000021848786,"teacher_disagreement_score":0.65779084,"about_ca_system_score_codex":0.000027590251,"about_ca_system_score_gemma":0.000045980207,"threshold_uncertainty_score":0.6472506},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03898826,0.00015938115,0.9598027,0.00044011595,0.00016536126,0.00023864924,0.000001283114,0.00005597708,0.00014831287],"genre_scores_gemma":[0.9968429,0.0001058946,0.0027128314,0.00019171406,0.00001441828,0.00003104461,0.0000010945802,0.00001262561,0.000087455184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870837,0.00021762807,0.00034879518,0.00029161712,0.0002356671,0.00019792434],"domain_scores_gemma":[0.99905926,0.00026403714,0.00011916496,0.00034986218,0.0001422577,0.00006541747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040253444,0.00016824863,0.00016772146,0.00014279642,0.00048271683,0.000096742704,0.00056714274,0.00009428488,0.00007269996],"category_scores_gemma":[0.000006982965,0.0001230676,0.00006949724,0.0006871266,0.0000981376,0.00037247315,0.0000044145736,0.00078918063,0.0000066986227],"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.00006858799,0.0004624005,0.000010915377,0.000008943589,0.000010253359,0.0000016849547,0.002024345,0.3039404,0.041344028,0.00053025485,0.000016941538,0.6515812],"study_design_scores_gemma":[0.0005670915,0.00009890662,0.00019252452,0.0002283355,0.000005463475,0.000003025233,0.000049959242,0.95789564,0.040605117,0.000033047974,0.00016601973,0.00015490141],"about_ca_topic_score_codex":0.000006623694,"about_ca_topic_score_gemma":0.000053872318,"teacher_disagreement_score":0.9578547,"about_ca_system_score_codex":0.00004370197,"about_ca_system_score_gemma":0.00007490371,"threshold_uncertainty_score":0.5018551},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07562364,0.00030359195,0.9225234,0.000011598192,0.00008701283,0.00018527107,0.0000063862335,0.00016858804,0.0010905449],"genre_scores_gemma":[0.99892175,0.0000029385526,0.00077185576,0.000012326877,0.000018863839,0.000055258017,8.949184e-7,0.000040315103,0.00017579902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989121,0.00009023728,0.00036532662,0.00018647232,0.00025161257,0.00019424333],"domain_scores_gemma":[0.9995328,0.000053814707,0.000097239776,0.00012945686,0.00013803424,0.000048617294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002452345,0.00016947507,0.00020671266,0.00017401383,0.00016387859,0.00007905031,0.00008487163,0.00006835007,0.000093409755],"category_scores_gemma":[0.0000034657762,0.00015307416,0.000052001178,0.00038077976,0.00006181915,0.0002778727,9.362736e-8,0.00022841473,0.00002193033],"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.000015492884,0.000037678838,0.000046218876,0.00018886357,0.00004211593,0.0000032063142,0.0009680768,0.60869527,0.380064,0.00003391029,0.000004071713,0.009901061],"study_design_scores_gemma":[0.0009619829,0.00025019175,0.000101646845,0.0005456683,0.000093618786,0.000044732664,0.00061359507,0.19990501,0.79664165,0.00019302456,0.00016380804,0.00048507322],"about_ca_topic_score_codex":0.0000059038916,"about_ca_topic_score_gemma":0.000004537577,"teacher_disagreement_score":0.9232981,"about_ca_system_score_codex":0.0000789673,"about_ca_system_score_gemma":0.000067388,"threshold_uncertainty_score":0.6242183},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065149434,0.00019761972,0.932851,0.000032456246,0.00009858393,0.00096227945,0.000004133374,0.00038853052,0.000315928],"genre_scores_gemma":[0.98531127,0.000057525718,0.014298784,0.000050456176,0.000060083665,0.00011181206,0.0000064129613,0.00008762766,0.000016032602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980313,0.000046587465,0.00069146947,0.00032527413,0.00038708042,0.00051826116],"domain_scores_gemma":[0.9990257,0.00047059936,0.00012317627,0.00011050107,0.00013751537,0.00013252426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060558884,0.000360626,0.0005580169,0.00059815997,0.00025031198,0.00007867124,0.000113564725,0.00019006741,0.00003032309],"category_scores_gemma":[0.000005327587,0.0003165854,0.00009480259,0.0009193429,0.00009416697,0.0007815815,3.801292e-7,0.00039949146,0.0000022710933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011484736,0.000053322306,0.000008088029,0.00010086876,0.000024002024,0.0000070721317,0.0009683198,0.7826972,0.0033931232,0.000006162305,6.412515e-7,0.20125644],"study_design_scores_gemma":[0.03689453,0.00006487649,0.000014784095,0.00083178893,0.000056446097,0.00001915784,0.00020601174,0.9312594,0.029995602,0.00028683335,0.0000083487275,0.00036223585],"about_ca_topic_score_codex":0.000006626705,"about_ca_topic_score_gemma":0.000024560177,"teacher_disagreement_score":0.92016184,"about_ca_system_score_codex":0.00017943588,"about_ca_system_score_gemma":0.000051137977,"threshold_uncertainty_score":0.9999286},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014694871,0.00010131134,0.9953162,0.00021836173,0.00010009849,0.00012324982,3.646901e-7,0.0001360062,0.0025348964],"genre_scores_gemma":[0.98382735,0.00004468638,0.015298579,0.00070502603,0.000012376501,0.000036777317,0.0000016433361,0.000012594172,0.000060946837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990882,0.00010797117,0.00021881986,0.00027462866,0.00014985364,0.00016050524],"domain_scores_gemma":[0.9994443,0.00008830514,0.00007116519,0.0002492545,0.000090356974,0.000056615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024642627,0.00012512667,0.00010939601,0.0002216032,0.00023797133,0.00008523412,0.00026115665,0.0000527212,0.000055116758],"category_scores_gemma":[0.0000037260138,0.000120925746,0.000033071992,0.00054820743,0.00003271451,0.00039780064,0.0000032062087,0.00025960553,0.0000076123692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006665504,0.00022088189,0.000076594566,0.000009748965,0.0000070487467,0.0000030230874,0.0015805415,0.5251096,0.00024167057,0.00063999963,0.00007037857,0.47197384],"study_design_scores_gemma":[0.00036856308,0.00006556129,0.00019247958,0.00010688578,0.0000042519628,0.0000022429333,0.00001950945,0.9969051,0.0019320111,0.0001000711,0.00015584023,0.00014750141],"about_ca_topic_score_codex":0.000003821551,"about_ca_topic_score_gemma":0.000045620647,"teacher_disagreement_score":0.98235786,"about_ca_system_score_codex":0.000054420245,"about_ca_system_score_gemma":0.00006018503,"threshold_uncertainty_score":0.49312088},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022686468,0.00019415628,0.9954288,0.00083253183,0.00014951715,0.0004695309,0.000004261823,0.00026138392,0.00039117603],"genre_scores_gemma":[0.9552357,0.00014488368,0.043322895,0.0006501756,0.000027577402,0.00023879002,0.000003397292,0.000018417795,0.00035812616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872845,0.00011806338,0.00029696687,0.00039364124,0.00021448378,0.00024839144],"domain_scores_gemma":[0.99865717,0.00030084647,0.00010509787,0.00034419366,0.00049468526,0.000098030454],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002314638,0.00019034265,0.00019597146,0.0001556045,0.0013460111,0.0002616797,0.00076868234,0.00006881265,0.000053748965],"category_scores_gemma":[0.000012799759,0.00018000448,0.000098226716,0.00060678605,0.000088207074,0.0013997633,0.000007733469,0.00022479898,0.000016471386],"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.0003596269,0.00088641414,0.000022075923,0.00004865805,0.00008666687,0.000007460283,0.006916267,0.45653883,0.012926099,0.00065609405,0.0011061779,0.52044564],"study_design_scores_gemma":[0.0014593393,0.0001526403,0.000053309865,0.00008217404,0.00001087669,0.00001674023,0.00004783367,0.93863547,0.057873104,0.00006142172,0.0013001688,0.00030694704],"about_ca_topic_score_codex":0.0000024154126,"about_ca_topic_score_gemma":0.0000082759525,"teacher_disagreement_score":0.9529671,"about_ca_system_score_codex":0.00008084155,"about_ca_system_score_gemma":0.00022222965,"threshold_uncertainty_score":0.9999541},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043006865,0.000019778636,0.98888934,0.00039477352,0.000060332535,0.00036318053,0.00010249939,0.00017765805,0.0056917267],"genre_scores_gemma":[0.9503533,0.000014714939,0.04280523,0.0002993712,0.00014333558,0.00021603426,0.000009313331,0.00006383173,0.0060948697],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824524,0.00007299794,0.0005284528,0.00040048637,0.0003672202,0.00038562377],"domain_scores_gemma":[0.99803716,0.0013721643,0.000085963096,0.00026163727,0.00009825407,0.00014481328],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044124774,0.00028976754,0.00042332546,0.0001463289,0.00068118685,0.00013136603,0.00015333906,0.00014477805,0.0034326804],"category_scores_gemma":[0.000024440686,0.00022625033,0.00038878032,0.00037514407,0.00006842142,0.00021404134,4.2587817e-7,0.00034038545,0.000087666784],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041278318,0.0009323358,0.000001024306,0.0006122,0.00021763568,0.0000032377231,0.00072614214,0.009979718,0.0005054119,0.003058966,0.00046244252,0.9830881],"study_design_scores_gemma":[0.0022251657,0.001189493,0.0000073634515,0.0006606038,0.0012456456,0.000013518871,0.00052566547,0.31372273,0.04208253,0.61100656,0.026118174,0.0012025323],"about_ca_topic_score_codex":0.000005521924,"about_ca_topic_score_gemma":0.000012455882,"teacher_disagreement_score":0.98188555,"about_ca_system_score_codex":0.000045259683,"about_ca_system_score_gemma":0.000048613747,"threshold_uncertainty_score":0.9974783},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014987033,0.00006065104,0.995837,0.000634264,0.000114056274,0.000309951,0.0000070740607,0.00031591838,0.0012224164],"genre_scores_gemma":[0.90512604,0.000007626927,0.093997695,0.0005395473,0.000055857792,0.000031712716,0.0000014868015,0.000011917612,0.0002280951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986018,0.000027224243,0.00029550362,0.00041794113,0.00025839527,0.00039913534],"domain_scores_gemma":[0.99952275,0.00004514574,0.00007607222,0.0002132229,0.000052685573,0.00009013489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020757751,0.00018803845,0.00017445063,0.00027337344,0.00035183658,0.00029015073,0.0003610599,0.00008104794,0.0000055419623],"category_scores_gemma":[6.277155e-7,0.00018481746,0.000098271485,0.00069531857,0.000023554412,0.00041942068,0.0000022835777,0.0002266667,0.000006236676],"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.00010627344,0.00039120752,5.3246947e-7,0.000027653916,0.000021027054,0.000018863338,0.00053601136,0.3856851,0.0005660364,0.0008734885,0.00014119901,0.61163265],"study_design_scores_gemma":[0.001346983,0.00031280256,0.000117607175,0.00012496485,0.00002082033,0.000018808056,0.00018149281,0.9837844,0.009101802,0.0010467404,0.0036026016,0.00034097407],"about_ca_topic_score_codex":0.0000072505277,"about_ca_topic_score_gemma":0.0000025869792,"teacher_disagreement_score":0.90362734,"about_ca_system_score_codex":0.00009089856,"about_ca_system_score_gemma":0.000028179915,"threshold_uncertainty_score":0.7536637},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016563697,0.00006870202,0.98212117,0.0002186227,0.00020003555,0.000225974,0.00011862981,0.00043281927,0.00005038046],"genre_scores_gemma":[0.7970269,0.000024729306,0.20241426,0.00015569222,0.00004478359,0.00005007788,0.000016784237,0.000027201713,0.00023961984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982548,0.000043073665,0.00034931282,0.000532082,0.00036596216,0.00045480486],"domain_scores_gemma":[0.9991166,0.0001535897,0.000113430986,0.0002941897,0.0001695852,0.00015257804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020162312,0.00022372192,0.0002102608,0.00010575551,0.00092306326,0.0001454039,0.00039634443,0.00007522236,0.000021733918],"category_scores_gemma":[0.0000021884002,0.00022080535,0.00011659462,0.0003434464,0.00010487325,0.0010789995,0.000005389174,0.00028062882,0.00002002209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007847577,0.00020044578,0.0000015258006,0.00005702613,0.000020298245,0.00001860412,0.0009803243,0.95407593,0.0058278106,0.00017557258,0.00006548734,0.038498487],"study_design_scores_gemma":[0.0005645033,0.00010041316,0.000004445797,0.000071515926,0.000011106214,0.000076007935,0.000029760935,0.95912004,0.037146848,0.002401162,0.00021299388,0.00026122291],"about_ca_topic_score_codex":0.0000061568257,"about_ca_topic_score_gemma":0.0000061020596,"teacher_disagreement_score":0.78046316,"about_ca_system_score_codex":0.0000514792,"about_ca_system_score_gemma":0.0001110126,"threshold_uncertainty_score":0.9004181},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1392614,0.000083537714,0.85849464,0.000040737013,0.00020332648,0.00018372897,0.000026126703,0.0015019486,0.00020458258],"genre_scores_gemma":[0.9622378,0.00002504407,0.037366573,0.00006295485,0.00007539368,0.00008281704,0.000017181914,0.00008287295,0.00004939646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988732,0.000026971162,0.0003576852,0.00025131291,0.00024630007,0.0002445582],"domain_scores_gemma":[0.99922633,0.00012573907,0.00007691462,0.0003644045,0.00010833979,0.00009828404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010789101,0.00024930626,0.0002134574,0.00020747966,0.00024369782,0.00013347605,0.00027606526,0.00021527662,0.0003188191],"category_scores_gemma":[0.0000044119124,0.00027195492,0.000074666765,0.00036636274,0.00006651555,0.00075201486,0.0000016306003,0.0007946893,0.000050188366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009940228,0.0000395229,0.0000011459712,0.000018387243,0.00001479755,8.9011746e-7,0.00016833835,0.51296604,0.2843913,0.0000037194868,0.000015063783,0.20237084],"study_design_scores_gemma":[0.0001417733,0.000017253862,0.000017064016,0.00007061912,0.000013899929,0.0000014265715,0.000010530659,0.5735861,0.42494744,0.00089976017,0.00011252923,0.00018160096],"about_ca_topic_score_codex":0.00002695464,"about_ca_topic_score_gemma":0.00001540529,"teacher_disagreement_score":0.82297635,"about_ca_system_score_codex":0.00005795575,"about_ca_system_score_gemma":0.00002987089,"threshold_uncertainty_score":0.99997324},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008521342,0.00004849788,0.98962164,0.000026840933,0.00015684192,0.00025818506,0.000015905298,0.0006286548,0.0007220962],"genre_scores_gemma":[0.5524081,0.0000021239027,0.4474717,0.000048606533,0.000016583896,0.000015475378,0.0000016836793,0.000024261934,0.000011432713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780166,0.0000424868,0.0006502843,0.00067186146,0.0004525976,0.0003810993],"domain_scores_gemma":[0.99832684,0.00007816858,0.00038925454,0.000777833,0.00027919014,0.00014870417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051319425,0.0002793563,0.00033745088,0.00036297177,0.00040639506,0.00015990146,0.0011351726,0.00012747994,0.000107471904],"category_scores_gemma":[0.000010096561,0.00028783127,0.000102370446,0.00089439075,0.00010000343,0.002316297,0.000015338026,0.00029622397,0.000043324617],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012674031,0.0009964973,0.00014501934,0.00039148214,0.00014790276,0.00004208128,0.0024459988,0.009389522,0.09736964,0.0001405739,0.00009868878,0.88870585],"study_design_scores_gemma":[0.000219772,0.000104748506,0.000044609813,0.00030878247,0.000054600292,0.00007295134,0.000020428182,0.7659769,0.22800095,0.00485429,0.000017044391,0.0003249079],"about_ca_topic_score_codex":0.000068042566,"about_ca_topic_score_gemma":0.0000054341913,"teacher_disagreement_score":0.88838094,"about_ca_system_score_codex":0.000098873454,"about_ca_system_score_gemma":0.00035887756,"threshold_uncertainty_score":0.9999574},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013803417,0.0002350389,0.99644536,0.001668741,0.00012594328,0.00035712193,0.000008306481,0.0008483395,0.0001731109],"genre_scores_gemma":[0.7979292,0.00007100001,0.20088707,0.00076779746,0.00009557287,0.0000830235,0.000003733381,0.000036694997,0.00012589312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793994,0.00012657419,0.00041652803,0.0005818589,0.00053448573,0.0004006091],"domain_scores_gemma":[0.998914,0.0001153529,0.00018753346,0.00051285175,0.00013787558,0.00013240648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031042425,0.00029968726,0.0002309232,0.00024852256,0.00088176294,0.0002891816,0.00093447557,0.00012393811,0.000107331136],"category_scores_gemma":[0.0000022959834,0.00022024344,0.00012965113,0.0006374519,0.000102029546,0.0025237673,0.000008038632,0.00045309865,0.00004603993],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092570954,0.00026516934,1.09354424e-7,0.00003681545,0.000013757753,0.0000046302575,0.0008905873,0.057836432,0.052159663,0.000051514115,0.00027221025,0.88837653],"study_design_scores_gemma":[0.00043280955,0.00006304902,0.000005309859,0.00012417803,0.000014384096,0.000020131849,0.000020111424,0.75212747,0.24492483,0.0009998276,0.001024197,0.00024372381],"about_ca_topic_score_codex":0.000010598663,"about_ca_topic_score_gemma":0.0000022703102,"teacher_disagreement_score":0.8881328,"about_ca_system_score_codex":0.000079373785,"about_ca_system_score_gemma":0.00008202771,"threshold_uncertainty_score":0.89812666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006341937,0.0000381094,0.9939263,0.0020652472,0.000099955636,0.0003092068,0.0000024797273,0.0009432993,0.001981247],"genre_scores_gemma":[0.8583605,0.0000039543947,0.13899118,0.0019309318,0.000055066677,0.00009806693,0.0000011915613,0.000028108441,0.00053099304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798363,0.00013387369,0.000335304,0.0005315606,0.00068712817,0.0003284932],"domain_scores_gemma":[0.9989816,0.0001919333,0.00015918519,0.00034080373,0.00019171831,0.00013476911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038566353,0.0002471072,0.0001894358,0.0004445578,0.0004560841,0.00035867494,0.0004083333,0.0001525406,0.00020986189],"category_scores_gemma":[0.0000074061654,0.00024067123,0.00013507227,0.0009466736,0.00005728577,0.00086710625,0.0000019752183,0.0005638151,0.00015172557],"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.00009868932,0.0010883656,0.0000026951052,0.000045927274,0.000021840902,0.000016766839,0.001302861,0.109690495,0.0022458688,0.00046449702,0.00017963565,0.88484234],"study_design_scores_gemma":[0.00072064245,0.00036427536,0.000006510386,0.00013637579,0.000013433923,0.000010828497,0.000029438575,0.9490943,0.04510322,0.00022748373,0.0039755763,0.00031793836],"about_ca_topic_score_codex":0.000005396449,"about_ca_topic_score_gemma":0.0000055837113,"teacher_disagreement_score":0.8845244,"about_ca_system_score_codex":0.000087166954,"about_ca_system_score_gemma":0.0001050697,"threshold_uncertainty_score":0.9814288},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03577929,0.00033609636,0.96242404,0.000017810338,0.000054904875,0.00043946956,0.000016593202,0.0006929873,0.00023878652],"genre_scores_gemma":[0.94790566,0.000008612791,0.051612943,0.000010772674,0.000042679778,0.00034070076,0.000009152987,0.00005818888,0.000011299578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988439,0.00003289425,0.0004022122,0.00021825879,0.0001405312,0.00036218835],"domain_scores_gemma":[0.99953437,0.000092362985,0.000065504435,0.00021316044,0.000051194165,0.00004342221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021636765,0.00018840135,0.0001876692,0.00028221536,0.00027506016,0.0001005634,0.0002110997,0.00007998858,0.000005394407],"category_scores_gemma":[8.692382e-7,0.00020459454,0.000056232122,0.00027993886,0.000026701488,0.00017942784,9.65096e-7,0.0002787074,0.0000013352195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013779714,0.00006309723,0.000008217132,0.00014932406,0.0000044825615,7.092208e-7,0.00016680366,0.9001786,0.02453911,0.00006032548,0.0000056969398,0.07480982],"study_design_scores_gemma":[0.0003583703,0.000035376852,0.000015946547,0.00023253344,0.000010416362,0.000005559571,0.00021848192,0.9364895,0.061780356,0.000267546,0.00034113176,0.00024478088],"about_ca_topic_score_codex":0.000033945864,"about_ca_topic_score_gemma":0.000112939284,"teacher_disagreement_score":0.91212636,"about_ca_system_score_codex":0.00014417717,"about_ca_system_score_gemma":0.000020284284,"threshold_uncertainty_score":0.8343123},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007624322,0.0015093219,0.98925066,0.000014558985,0.00019440443,0.00016948962,0.0000030358615,0.00034800573,0.000886172],"genre_scores_gemma":[0.99345046,0.00008453106,0.006288151,0.000021066653,0.00004989535,0.0000075532807,0.0000014720888,0.000033498236,0.000063364205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900943,0.000016978924,0.00034438208,0.00019093687,0.00015936479,0.00027890172],"domain_scores_gemma":[0.9996398,0.00003208864,0.00006516499,0.00013115762,0.000063571504,0.000068202826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008108427,0.00018673841,0.00021502799,0.00016403271,0.00011873037,0.000029751933,0.0001130383,0.00009989099,0.000034912395],"category_scores_gemma":[0.0000012083074,0.0001967068,0.00007675547,0.00048962847,0.000034546425,0.0002944636,2.1647271e-7,0.0002442328,0.000007989696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017948927,0.00005496295,8.918621e-7,0.00004949721,0.000008205059,0.0000017966308,0.00016032296,0.86639476,0.008872279,0.0000037077089,0.000006073309,0.12442953],"study_design_scores_gemma":[0.0003488626,0.00017267239,0.000022877492,0.00024488257,0.00003372901,0.000014538753,0.000060904575,0.94490165,0.05387732,0.00006973991,0.000023024664,0.00022981674],"about_ca_topic_score_codex":4.638577e-7,"about_ca_topic_score_gemma":0.000002217879,"teacher_disagreement_score":0.98582613,"about_ca_system_score_codex":0.00008743717,"about_ca_system_score_gemma":0.000025845355,"threshold_uncertainty_score":0.80214703},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015859453,0.00020366542,0.9791965,0.0000033161507,0.000176225,0.00008301721,0.0000051631446,0.00014404133,0.0043286225],"genre_scores_gemma":[0.9965106,0.000005819208,0.0029384298,0.000012440481,0.000018923452,0.000014514477,8.6857654e-7,0.00003096231,0.00046742617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99935293,0.000036320205,0.00022150068,0.00011625151,0.00012244187,0.00015056085],"domain_scores_gemma":[0.9997664,0.00002871436,0.000031442818,0.00008992986,0.00004251188,0.00004101956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014109393,0.00012036934,0.00013550771,0.00010904186,0.00007990063,0.000030122015,0.000061921644,0.000071070644,0.00017717463],"category_scores_gemma":[9.4885826e-7,0.00011403934,0.000055997578,0.00018869052,0.000027700564,0.00019861659,1.5163499e-7,0.00012923068,0.000012957509],"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.000011998921,0.000033088738,0.000002453308,0.00013750738,0.000024054847,0.0000013993352,0.0005509667,0.9754202,0.004135075,0.000111653564,0.000051832176,0.019519785],"study_design_scores_gemma":[0.00055982976,0.00010374642,0.000015678936,0.0002689739,0.000058835205,0.000028831508,0.00029497233,0.2404584,0.75682443,0.00041921582,0.0006121394,0.00035491513],"about_ca_topic_score_codex":0.0000011710061,"about_ca_topic_score_gemma":0.0000022088593,"teacher_disagreement_score":0.98065114,"about_ca_system_score_codex":0.00002530939,"about_ca_system_score_gemma":0.000021165348,"threshold_uncertainty_score":0.46503896},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055663446,0.00008473365,0.9915931,0.000257051,0.00023944733,0.00017944995,0.0000011513421,0.0014447235,0.0006339467],"genre_scores_gemma":[0.8951853,0.000006113997,0.104103506,0.000321306,0.000035440684,0.00005179445,2.6797431e-7,0.000026505084,0.0002697525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998254,0.000059447626,0.00030515707,0.0005325058,0.00044089346,0.0004079884],"domain_scores_gemma":[0.9991075,0.00013267924,0.00011726653,0.0003617252,0.00014435763,0.00013648729],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019601303,0.00024304776,0.00020844597,0.0002848908,0.0007823708,0.00012247646,0.00069600437,0.00010635923,0.000027568918],"category_scores_gemma":[0.0000057077373,0.0002466046,0.00011761674,0.0006466937,0.0001117839,0.0008145242,0.0000038219923,0.0004583736,0.00007324738],"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.00010889181,0.0005867411,0.000023209612,0.00008182434,0.000051559808,0.00014168318,0.005708339,0.2996517,0.007839043,0.00019486572,0.00063235726,0.68497974],"study_design_scores_gemma":[0.00068397395,0.00045370814,0.00007805769,0.00027622073,0.000033664262,0.0007318467,0.00012212913,0.9524975,0.04161448,0.002466085,0.00016581596,0.0008765592],"about_ca_topic_score_codex":0.000021570071,"about_ca_topic_score_gemma":0.000015505751,"teacher_disagreement_score":0.889619,"about_ca_system_score_codex":0.00010495097,"about_ca_system_score_gemma":0.00024944326,"threshold_uncertainty_score":0.9999986},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2444462,0.000051227664,0.75466144,0.00005882178,0.00007515971,0.00012824671,0.0000021142432,0.0005229255,0.00005386747],"genre_scores_gemma":[0.85825795,0.000008775489,0.14158165,0.000046099187,0.00002864778,0.000014505657,2.8124342e-7,0.000021008054,0.000041050127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99834555,0.000063837935,0.00034476805,0.00045822238,0.00048610315,0.00030153454],"domain_scores_gemma":[0.9988387,0.00021524711,0.00024205416,0.00031843668,0.00029088132,0.000094672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025380313,0.00023254428,0.00031723478,0.00029461877,0.0006551344,0.000062280415,0.0005095737,0.0000993922,0.0000061236788],"category_scores_gemma":[0.000007059643,0.00020956663,0.00007568312,0.000833389,0.0001498546,0.00060429616,0.0000057683983,0.00041937895,0.0000074186755],"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.00080796226,0.0024702903,0.00083397364,0.0010563651,0.00030611645,0.00033415665,0.014220663,0.53752404,0.094698615,0.0003712852,0.0001584736,0.34721807],"study_design_scores_gemma":[0.00054936233,0.00062865607,0.00030106455,0.000664965,0.00007789046,0.00050172955,0.000117497904,0.3359692,0.6601796,0.00044331857,0.000006430771,0.0005602524],"about_ca_topic_score_codex":0.00014199906,"about_ca_topic_score_gemma":0.00005870837,"teacher_disagreement_score":0.6138118,"about_ca_system_score_codex":0.00006749228,"about_ca_system_score_gemma":0.0002120991,"threshold_uncertainty_score":0.8545879},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03586381,0.0002497392,0.9599623,0.00009330638,0.000027537923,0.0002607963,0.000017928303,0.002263359,0.0012611948],"genre_scores_gemma":[0.9696839,0.00003983761,0.029683417,0.000036945126,0.000042099913,0.00013880887,0.000009409005,0.0001226155,0.00024300629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987096,0.0000341084,0.00033660728,0.00030454915,0.00024207743,0.0003730657],"domain_scores_gemma":[0.99922055,0.00010137857,0.000118666874,0.00031027498,0.00017011365,0.00007903929],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012393881,0.0003341783,0.00029451182,0.0002852079,0.0003811057,0.0001309606,0.00025748965,0.00013279764,0.000056087818],"category_scores_gemma":[0.0000015875335,0.00032133152,0.000061899416,0.00071310374,0.00009514586,0.0005903738,0.000001433659,0.0004996295,0.000026911817],"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.00005348236,0.000091566675,0.00001586546,0.00017158147,0.000025188807,0.0000041956177,0.00010402102,0.9405059,0.03675492,0.0000085942165,0.00003568963,0.022228977],"study_design_scores_gemma":[0.00062615064,0.00010448669,0.00014054973,0.0010340974,0.00007431657,0.000027044262,0.00019614029,0.41137943,0.58460796,0.00047729313,0.0005061195,0.00082638283],"about_ca_topic_score_codex":0.000006674321,"about_ca_topic_score_gemma":0.000012286351,"teacher_disagreement_score":0.93382007,"about_ca_system_score_codex":0.0001416445,"about_ca_system_score_gemma":0.000043784796,"threshold_uncertainty_score":0.9999239},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07290154,0.00030445703,0.9257743,0.000024989824,0.000035188325,0.0002421742,0.000008025977,0.00047626614,0.00023309242],"genre_scores_gemma":[0.9931558,0.000037214046,0.0065524965,0.00002619384,0.000019312467,0.00014720441,0.0000010362133,0.00003786239,0.000022903441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992089,0.000049230814,0.00028993678,0.00017103874,0.000102103695,0.00017877229],"domain_scores_gemma":[0.99961853,0.00014415137,0.00004603811,0.000111215704,0.00004727111,0.000032820477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012289842,0.00016411973,0.00018922977,0.00023451044,0.00018438045,0.00006164495,0.00007779449,0.00008901748,0.000010487049],"category_scores_gemma":[0.0000021162843,0.00017543363,0.00003492387,0.00023465154,0.000050357226,0.000459199,6.056047e-7,0.00033126466,0.0000026026905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012464725,0.000054562595,0.000034937195,0.000059476144,0.000010803549,0.0000026507894,0.00035027575,0.6035169,0.16917862,0.000006756226,0.000002251241,0.22665814],"study_design_scores_gemma":[0.0015221774,0.000023025557,0.000108130866,0.0001333304,0.000011761235,0.0000067560873,0.00007418746,0.6749639,0.32269582,0.00021237829,0.000071019786,0.00017753284],"about_ca_topic_score_codex":0.000021505435,"about_ca_topic_score_gemma":0.00032861822,"teacher_disagreement_score":0.92025423,"about_ca_system_score_codex":0.00011255848,"about_ca_system_score_gemma":0.000011990175,"threshold_uncertainty_score":0.7153976},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00905322,0.00015466861,0.9891489,0.00011309599,0.00077625515,0.0002568959,0.000059134196,0.00029372552,0.00014408205],"genre_scores_gemma":[0.972704,0.000004946844,0.02669856,0.000119992044,0.00015853741,0.000033921202,0.0000051959546,0.000022298875,0.0002525274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988002,0.00006230621,0.00025373013,0.0004241726,0.00018091635,0.00027865585],"domain_scores_gemma":[0.9988474,0.0005249217,0.00009788504,0.0002936784,0.00012407578,0.000111990645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036944397,0.0001808387,0.00018405463,0.00013223935,0.0007701145,0.0005167517,0.00031881905,0.0001463349,0.000019579715],"category_scores_gemma":[0.000009693739,0.00016270656,0.00006059013,0.00021369805,0.000075887605,0.0006335393,0.000004088209,0.0004585113,0.0000037412485],"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.0002406192,0.00021208951,0.00003730326,0.0004067691,0.00008241182,0.000013862112,0.0025095153,0.2940076,0.10389167,0.016660772,0.0004967863,0.5814406],"study_design_scores_gemma":[0.0005691162,0.000106022184,0.000021918948,0.00021541011,0.00003950126,0.000060168353,0.00013529419,0.9797989,0.011518959,0.002391864,0.0047696196,0.0003732119],"about_ca_topic_score_codex":0.0000038716908,"about_ca_topic_score_gemma":0.000008618893,"teacher_disagreement_score":0.9636508,"about_ca_system_score_codex":0.000010634503,"about_ca_system_score_gemma":0.000040735427,"threshold_uncertainty_score":0.6634981},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035429087,0.00012646362,0.96323293,0.000009208118,0.00015653307,0.00058143266,0.000015863781,0.00036966597,0.000078783545],"genre_scores_gemma":[0.87473255,0.000008679408,0.12502578,0.000020650003,0.000087012486,0.000015180807,0.0000071495115,0.00006635899,0.000036619957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987036,0.000017399572,0.00035472223,0.00027811775,0.00022342536,0.00042275447],"domain_scores_gemma":[0.99941427,0.000120063596,0.00007168927,0.00011372225,0.00013477253,0.00014551067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027408122,0.00027361835,0.00026231082,0.0002116036,0.00086514035,0.000043126205,0.000112841284,0.00015023963,0.000020444471],"category_scores_gemma":[0.0000014424324,0.0002557737,0.00009538745,0.00035964188,0.00005243085,0.0007145257,0.0000011785418,0.0002629825,0.000002479548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075956766,0.000049088147,0.000013048753,0.00024185484,0.000039548777,0.0000053917834,0.0009965784,0.89795494,0.020177314,4.4316246e-7,0.0000021228896,0.07976011],"study_design_scores_gemma":[0.003261928,0.00009064758,0.000003734941,0.00040427598,0.00013223581,0.00002698613,0.00043009006,0.8420629,0.15301654,0.000012875566,0.00019223586,0.00036554594],"about_ca_topic_score_codex":0.000017590337,"about_ca_topic_score_gemma":0.00002361151,"teacher_disagreement_score":0.8393035,"about_ca_system_score_codex":0.00018497244,"about_ca_system_score_gemma":0.00004205941,"threshold_uncertainty_score":0.99998945},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029011337,0.00015640727,0.96971124,0.000049384515,0.000031851676,0.00017139605,0.0000031833654,0.0006288083,0.00023640886],"genre_scores_gemma":[0.9847774,0.000101112455,0.014960769,0.0000145956665,0.0000116211395,0.0000849205,9.60135e-7,0.000035196426,0.000013423999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932754,0.000021010394,0.00021997189,0.00015160679,0.00011657337,0.00016330191],"domain_scores_gemma":[0.9997395,0.000032916243,0.00004456983,0.0001047728,0.00003861691,0.00003961551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011030007,0.00015213607,0.00015241162,0.0003036327,0.00017856953,0.000048393376,0.000060878672,0.00008267047,0.0000053068543],"category_scores_gemma":[0.0000023397326,0.00017674187,0.000026673517,0.00027359824,0.000061723345,0.0005559,0.0000011364141,0.00030683607,0.0000070117553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001335168,0.000022591696,1.09148424e-7,0.000050298597,0.0000051521274,0.0000010167461,0.0006676906,0.75990963,0.06021071,0.000023881752,3.3421318e-7,0.17909525],"study_design_scores_gemma":[0.00021446194,0.00004396917,0.000015519287,0.00028061256,0.000006039019,0.000008313198,0.00017781998,0.52124363,0.47590613,0.0019700467,0.0000020785487,0.00013134735],"about_ca_topic_score_codex":0.000020861367,"about_ca_topic_score_gemma":0.00003165865,"teacher_disagreement_score":0.9557661,"about_ca_system_score_codex":0.00025008604,"about_ca_system_score_gemma":0.00001832309,"threshold_uncertainty_score":0.72073245},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04540911,0.00012918546,0.95231867,0.00014007179,0.00017173261,0.0012110388,0.0000013098462,0.00023892029,0.00037997053],"genre_scores_gemma":[0.9950461,0.000052567837,0.004068191,0.00028659892,0.00014184308,0.0002697587,0.0000014627543,0.00003464746,0.00009882832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760205,0.00012844669,0.0005814582,0.00056258374,0.00041982144,0.0007056261],"domain_scores_gemma":[0.9990393,0.00021808258,0.00014920278,0.00029109462,0.000115870935,0.00018644765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010486654,0.00030476457,0.00028230483,0.00032824886,0.00038266,0.00043096932,0.00055536535,0.0002706876,0.00005346144],"category_scores_gemma":[0.0000011455076,0.00027518132,0.00012706406,0.0011191963,0.00016125603,0.0009314843,0.00000356531,0.0006847176,0.000014998914],"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.00018466145,0.00018442968,0.00011134919,0.00006231633,0.0000057505918,0.00001441552,0.0013001398,0.22526525,0.0025111951,0.00024415445,0.000006528547,0.77010983],"study_design_scores_gemma":[0.0011031677,0.00019108091,0.0013885729,0.0007628147,0.000009060619,0.000025594347,0.000063772684,0.95751673,0.03686089,0.001264767,0.00034787724,0.00046567238],"about_ca_topic_score_codex":0.00003712161,"about_ca_topic_score_gemma":0.00004044954,"teacher_disagreement_score":0.949637,"about_ca_system_score_codex":0.00012483314,"about_ca_system_score_gemma":0.0000879938,"threshold_uncertainty_score":0.99997},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07744989,0.000017296228,0.9219154,0.00007601666,0.00006952452,0.00014683357,0.0000073454135,0.00021756625,0.00010012401],"genre_scores_gemma":[0.79822195,0.0000021695487,0.20167756,0.00004055185,0.0000112557145,0.0000132339555,6.2412573e-7,0.000010541469,0.000022095055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998937,0.000037736467,0.00020363266,0.00035745872,0.00031292418,0.00015123193],"domain_scores_gemma":[0.99905723,0.00022919515,0.00022529297,0.0002629752,0.00015418202,0.00007110425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010221306,0.0001606153,0.00016642206,0.00015941777,0.00033867324,0.00014732264,0.00023533544,0.00008347992,0.000022626926],"category_scores_gemma":[0.000005824316,0.00012865358,0.000025964246,0.00024442578,0.0002567159,0.0009214316,0.0000036736164,0.00035640915,0.000002077969],"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.00017736999,0.00010489394,0.000029664936,0.00005759082,0.000012262737,0.0000043322743,0.0004885169,0.20805085,0.027303165,0.00044640497,0.00000800867,0.7633169],"study_design_scores_gemma":[0.00038509496,0.00032466403,0.000059773916,0.00029401944,0.000014247462,0.000036886307,0.00004063014,0.60228187,0.39374548,0.0024327084,0.00018234312,0.00020226643],"about_ca_topic_score_codex":0.0000045458114,"about_ca_topic_score_gemma":0.0000037342757,"teacher_disagreement_score":0.7631147,"about_ca_system_score_codex":0.000015023596,"about_ca_system_score_gemma":0.00008089743,"threshold_uncertainty_score":0.5246341},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076938057,0.000008982105,0.96664965,0.000022778775,0.000043909567,0.025255563,0.000030297473,0.0002802142,0.000014820133],"genre_scores_gemma":[0.9299351,0.000055530454,0.0065805106,0.000032059157,0.000028522483,0.06326761,0.000031844982,0.00005672566,0.000012064968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988326,0.000027882224,0.00038631549,0.00020744749,0.00019451507,0.00035124924],"domain_scores_gemma":[0.99952567,0.000060094735,0.00010626174,0.0000826596,0.00013807298,0.00008721987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000109030494,0.00025931318,0.00025276744,0.00027829423,0.00027430986,0.00010261917,0.00009198401,0.000102085905,0.000012128131],"category_scores_gemma":[0.0000022320157,0.00024561913,0.000035522455,0.00043278688,0.000058795904,0.0024257333,0.0000011072501,0.00022495376,0.0000019788022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001634622,0.000048982496,0.000010128285,0.0003363963,0.000015061649,0.0000018891759,0.0014118379,0.9728924,0.00008815147,1.1944226e-7,0.000017281423,0.023543099],"study_design_scores_gemma":[0.00818898,0.00012103045,0.000050662187,0.00038577378,0.000012808312,0.000021245469,0.000110948895,0.9804307,0.010256455,0.000018609724,0.000098403645,0.00030437423],"about_ca_topic_score_codex":0.0000061312594,"about_ca_topic_score_gemma":0.000031890788,"teacher_disagreement_score":0.9600691,"about_ca_system_score_codex":0.00011982396,"about_ca_system_score_gemma":0.000050003986,"threshold_uncertainty_score":0.9999996},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020497553,0.0008557235,0.9771427,0.00004480875,0.000089624205,0.00040214372,0.00008315959,0.00047660773,0.0004076775],"genre_scores_gemma":[0.9269277,0.0003292171,0.07234821,0.000026475043,0.000019961864,0.00023897107,0.0000051774223,0.00007208972,0.00003219918],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998876,0.000029534125,0.00044016872,0.00023366563,0.00017508083,0.0002455737],"domain_scores_gemma":[0.9987604,0.00056562066,0.00010822376,0.0003830861,0.000083731626,0.000098911936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014645736,0.00024951118,0.0002663685,0.00016368227,0.0006058121,0.000050319595,0.0003193629,0.0001495887,0.00007872869],"category_scores_gemma":[0.000007196014,0.00020463885,0.00012959121,0.00023288961,0.0001552079,0.00054312544,0.0000029119333,0.00039498997,0.0000015149029],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015879612,0.00018022011,0.000016717386,0.00027069703,0.000107615044,9.556271e-7,0.0040155016,0.044257186,0.07735581,0.000050323444,0.000054228294,0.87353194],"study_design_scores_gemma":[0.0005779595,0.00016622024,0.00022036467,0.0010969136,0.00017608952,0.0000056512727,0.0010185483,0.25229675,0.73820096,0.005058494,0.00071017863,0.00047183916],"about_ca_topic_score_codex":0.000047669404,"about_ca_topic_score_gemma":0.000017305936,"teacher_disagreement_score":0.9064301,"about_ca_system_score_codex":0.00005495284,"about_ca_system_score_gemma":0.00005112723,"threshold_uncertainty_score":0.83449304},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002393244,0.00020634964,0.9967767,0.00012237087,0.00009682725,0.000105462466,0.000005302705,0.00016070402,0.000133051],"genre_scores_gemma":[0.8078773,0.00002976572,0.19175477,0.00016547737,0.0000445552,0.0000060726866,3.0091402e-7,0.0000111315985,0.00011062112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998815,0.00016453996,0.00026098755,0.00032858088,0.00021520776,0.00021568115],"domain_scores_gemma":[0.99914753,0.00036183937,0.00010074538,0.00022318399,0.00008290132,0.0000838037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005049749,0.00014782383,0.00016247178,0.00012947853,0.00027298744,0.000108853135,0.00025817254,0.00007716215,0.0000333545],"category_scores_gemma":[0.0000039625056,0.0001311806,0.000042460637,0.00026862108,0.00009618526,0.0005330681,0.0000024454025,0.00022599324,0.000015334006],"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.00007743822,0.00010754981,0.0000018528393,0.000024981357,0.000011917257,0.0000036058154,0.00079424295,0.28934285,0.022064876,0.00028960293,0.00003617713,0.6872449],"study_design_scores_gemma":[0.00048331983,0.00011960918,0.000014376092,0.00014298917,0.00002236208,0.00004183083,0.00009565477,0.8178144,0.17976083,0.0009040208,0.0003528895,0.00024767814],"about_ca_topic_score_codex":0.0000022547147,"about_ca_topic_score_gemma":7.8394106e-7,"teacher_disagreement_score":0.80548406,"about_ca_system_score_codex":0.00001543703,"about_ca_system_score_gemma":0.000044987002,"threshold_uncertainty_score":0.53493893},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004905421,0.000296663,0.9935768,0.000043170665,0.000085159605,0.0004622496,0.000013849648,0.00035531024,0.00026136352],"genre_scores_gemma":[0.9289945,0.000016651173,0.070559874,0.000032938737,0.00013661015,0.000075113734,0.000007761306,0.000054150398,0.0001223983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899644,0.000011497888,0.0002728,0.00026995337,0.00014215284,0.00030718328],"domain_scores_gemma":[0.99962807,0.000043238055,0.00006966996,0.00009624693,0.000091094626,0.00007166182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012080831,0.00023461533,0.00022217832,0.00013873423,0.00035887203,0.000104567516,0.00006651983,0.00008847741,0.000003757826],"category_scores_gemma":[0.0000028375832,0.00022059002,0.000036027188,0.00024184801,0.000043728898,0.0007182435,3.396159e-7,0.00017890854,0.0000011350758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009348353,0.000058453425,7.2240596e-7,0.00024054354,0.000025630427,0.0000010019647,0.0005955495,0.9189469,0.0027392104,0.0000040647565,0.0000042044235,0.07729023],"study_design_scores_gemma":[0.0007545652,0.000257941,0.0000011732819,0.00032686477,0.000049839753,0.000018485214,0.0006636366,0.9637747,0.0336882,0.000097942866,0.00009155666,0.0002751105],"about_ca_topic_score_codex":0.000002960277,"about_ca_topic_score_gemma":0.000006404059,"teacher_disagreement_score":0.9240891,"about_ca_system_score_codex":0.0000833213,"about_ca_system_score_gemma":0.000035471927,"threshold_uncertainty_score":0.89954},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005147808,0.00022883904,0.99397117,0.00010823506,0.000023440823,0.00024384691,0.000016406824,0.0002208351,0.00003942325],"genre_scores_gemma":[0.609251,0.000031568692,0.39049825,0.00006327151,0.0000050271697,0.000053192052,0.0000012731825,0.000010462608,0.000085912114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998537,0.00007874439,0.00035935958,0.0004850026,0.00028211065,0.00025776806],"domain_scores_gemma":[0.99878186,0.00037581476,0.0002490233,0.00031278183,0.0001916371,0.00008885794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027058093,0.0001841469,0.00036519286,0.0006020241,0.0005525895,0.00008067928,0.00046832446,0.000080906895,0.000010880884],"category_scores_gemma":[0.0000067473993,0.00016384736,0.000106539635,0.0013284518,0.00014312043,0.001101151,0.0000061444257,0.00015209666,9.675032e-7],"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.0007330767,0.0010631998,0.0002063639,0.00053228706,0.00092583353,0.00004971565,0.0054368176,0.23500818,0.09761566,0.0016466978,0.0002711178,0.65651107],"study_design_scores_gemma":[0.0003711184,0.00022562791,0.00015184008,0.000113225215,0.00024562006,0.000020478617,0.000042069325,0.6717945,0.3254227,0.0011378711,0.00020883813,0.0002661107],"about_ca_topic_score_codex":0.000015385403,"about_ca_topic_score_gemma":0.0000018897628,"teacher_disagreement_score":0.65624493,"about_ca_system_score_codex":0.000025213421,"about_ca_system_score_gemma":0.000104297054,"threshold_uncertainty_score":0.6681502},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046393467,0.00005507816,0.99658996,0.000051251078,0.00014162001,0.00039565362,0.000009668215,0.00041278772,0.0018800718],"genre_scores_gemma":[0.54442567,0.0000033448061,0.4552523,0.000062983745,0.000015678652,0.000101262776,4.9350507e-7,0.00001726625,0.00012099194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983812,0.000062271916,0.00043433649,0.000440117,0.00037100632,0.00031107356],"domain_scores_gemma":[0.99896497,0.0001532767,0.00020724541,0.00022199634,0.00035461003,0.00009792173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039763213,0.0002235745,0.00025140733,0.00032237885,0.00043664355,0.00013584702,0.0003709348,0.00010898699,0.000025000827],"category_scores_gemma":[0.0000051300317,0.00022791073,0.0001584727,0.0006098363,0.00007182741,0.0017136219,0.000001821008,0.00019996995,0.0000037377295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035709247,0.00016717565,3.843037e-7,0.00006681985,0.000026131278,9.98511e-7,0.00046671278,0.7180094,0.007787767,0.009076317,0.00003612298,0.26432648],"study_design_scores_gemma":[0.00021538178,0.00015515689,3.7171324e-7,0.000091598944,0.000017806635,0.000011380519,0.000027256603,0.6369011,0.34727177,0.015066256,0.00006908797,0.00017286371],"about_ca_topic_score_codex":0.000013891186,"about_ca_topic_score_gemma":0.0000031579964,"teacher_disagreement_score":0.54396176,"about_ca_system_score_codex":0.00010213184,"about_ca_system_score_gemma":0.00024864537,"threshold_uncertainty_score":0.929393},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012719196,0.00013078112,0.98644567,0.00015065756,0.00012434361,0.00013242623,0.000009251155,0.0001958101,0.00009187871],"genre_scores_gemma":[0.9713239,0.000014952047,0.028203597,0.00007708474,0.000032632677,0.000017343078,0.0000024418625,0.000015182138,0.00031284604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987527,0.000051318395,0.00032982085,0.00033949263,0.0002900875,0.00023654381],"domain_scores_gemma":[0.99935496,0.00006323067,0.00013111783,0.00020179086,0.00012105783,0.00012786627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015372528,0.00016023534,0.00019164328,0.00020931229,0.0006822125,0.00010185373,0.00015315658,0.0000909326,0.000012368685],"category_scores_gemma":[0.0000052141936,0.00016108024,0.00007785097,0.00047621914,0.00012881255,0.00041951446,0.0000039753813,0.00022394708,0.000011446671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028686318,0.00016384326,0.0000069895646,0.000040410803,0.000015009383,0.0000047741446,0.0006302043,0.79869646,0.0012260026,0.000008608197,0.00015648927,0.19902255],"study_design_scores_gemma":[0.00042520228,0.00012962848,0.000066209075,0.00008299261,0.000012048353,0.000101289384,0.00008648212,0.98025584,0.018058557,0.00018464854,0.0004284845,0.00016862394],"about_ca_topic_score_codex":0.000028725204,"about_ca_topic_score_gemma":0.000005153564,"teacher_disagreement_score":0.95860475,"about_ca_system_score_codex":0.000037991995,"about_ca_system_score_gemma":0.00005684361,"threshold_uncertainty_score":0.6568662},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003427399,0.000018315748,0.99559385,0.00025180922,0.00007658331,0.00017852896,0.00004289088,0.00039825324,0.00001237585],"genre_scores_gemma":[0.40851754,0.0000046269734,0.59077114,0.0005514227,0.000032586868,0.000028863658,0.0000094317265,0.000016977572,0.000067448666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998692,0.000029209932,0.00022601205,0.000426408,0.0003286295,0.00029779115],"domain_scores_gemma":[0.99925065,0.00007224331,0.00009188366,0.00027509115,0.0002168066,0.000093298586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012664752,0.000184213,0.00015597593,0.0001307436,0.000845854,0.00021779483,0.00035041574,0.00007234636,0.0000039109786],"category_scores_gemma":[8.0142036e-7,0.00015661432,0.00004883149,0.0003189325,0.0000745565,0.0012382588,0.0000011612217,0.0002565417,0.000005020002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018999885,0.00006528419,3.5320346e-7,0.000009502852,0.000005000766,0.000005677715,0.00067334186,0.5819027,0.00008277816,0.0000029619007,0.00005725454,0.41717616],"study_design_scores_gemma":[0.000383635,0.0002678885,0.0000017970432,0.000053263255,0.0000117699465,0.000057106507,0.000051493116,0.9899575,0.008300027,0.0006107404,0.00007954861,0.00022523287],"about_ca_topic_score_codex":0.000007286279,"about_ca_topic_score_gemma":0.0000050803314,"teacher_disagreement_score":0.41695094,"about_ca_system_score_codex":0.000033917928,"about_ca_system_score_gemma":0.00016867016,"threshold_uncertainty_score":0.65057105},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063313837,0.000092525195,0.99270666,0.000039475664,0.000033738073,0.0002388,0.000008662416,0.00025789966,0.00029085032],"genre_scores_gemma":[0.93524987,0.00003870026,0.064588755,0.000023483086,0.000011684492,0.000056397465,0.0000067316428,0.00001874914,0.0000056066287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991748,0.000024515366,0.00029123476,0.00018591937,0.00016315494,0.00016041187],"domain_scores_gemma":[0.9993841,0.00016295306,0.000043495296,0.00030381168,0.000051782456,0.00005383336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005106531,0.00011488554,0.00009265013,0.00019154482,0.0002762139,0.000080567275,0.0002115603,0.00005929537,0.0000020628356],"category_scores_gemma":[0.000014288088,0.000106245876,0.000011595672,0.00039604894,0.0000397451,0.00053796265,0.0000040392188,0.00029313247,0.0000024557644],"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.000026087084,0.000060804778,8.112427e-7,0.00002332575,0.0000039613974,1.7745748e-7,0.00021461034,0.31909192,0.023407739,0.00003079894,0.000001509498,0.6571383],"study_design_scores_gemma":[0.00023423682,0.000026780668,0.00012882541,0.000051978874,0.0000064566034,0.000004608037,0.00007720486,0.91353375,0.08532451,0.00041948538,0.000076570446,0.0001155684],"about_ca_topic_score_codex":0.000009693327,"about_ca_topic_score_gemma":0.00004898073,"teacher_disagreement_score":0.9289185,"about_ca_system_score_codex":0.000105667335,"about_ca_system_score_gemma":0.000023857281,"threshold_uncertainty_score":0.4332581},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032055073,0.0006641856,0.9936315,0.00014632852,0.00023810581,0.00012775938,0.00000562938,0.0008804498,0.00110054],"genre_scores_gemma":[0.99261636,0.00010930832,0.0069488157,0.00007650346,0.00009054563,0.00002967069,7.1011897e-7,0.00004561397,0.000082459075],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991262,0.000017619757,0.00018518673,0.00017896145,0.0002104598,0.00028156568],"domain_scores_gemma":[0.9996026,0.000053770033,0.000032770913,0.00016481776,0.000082942606,0.00006307347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007397842,0.00018522708,0.00012452519,0.00008047733,0.0005306419,0.00014328622,0.00017299585,0.00008329709,0.0000118930475],"category_scores_gemma":[0.0000011804781,0.00014827342,0.000082919556,0.00022305179,0.00009250518,0.0001880723,7.410675e-7,0.00035755977,0.00003365343],"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.000015241724,0.0000351354,2.1694127e-7,0.000011183199,0.000031912496,0.000011836515,0.000303033,0.23126577,0.0049441177,0.000035061268,0.00012790321,0.7632186],"study_design_scores_gemma":[0.00054990104,0.00016075281,0.000015944026,0.0005086469,0.000065877524,0.00007845521,0.0005058523,0.121870734,0.86225027,0.0104508,0.0030245413,0.0005182442],"about_ca_topic_score_codex":0.000017006114,"about_ca_topic_score_gemma":0.000012589393,"teacher_disagreement_score":0.9894109,"about_ca_system_score_codex":0.00009901348,"about_ca_system_score_gemma":0.00004455133,"threshold_uncertainty_score":0.60464144},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054931785,0.000012711929,0.990671,0.0000830216,0.00013401452,0.00034330194,0.0000036523918,0.0005250473,0.002734106],"genre_scores_gemma":[0.74258894,8.197666e-7,0.25717908,0.00010474716,0.000016629938,0.00006443533,0.0000020807138,0.000014149486,0.000029133818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984987,0.000042961965,0.00037153356,0.00021067983,0.0005905929,0.00028554525],"domain_scores_gemma":[0.9989637,0.00013392419,0.00029219038,0.00023741774,0.00025118253,0.00012158025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033604063,0.00021360362,0.0001830028,0.00048585475,0.0003819646,0.0002075982,0.00025608105,0.00009021543,0.000032500546],"category_scores_gemma":[0.00001576471,0.00019568988,0.000060344995,0.0008035714,0.00005184308,0.0054254103,0.0000027418046,0.00024246659,0.000055450313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011971466,0.00017775755,0.000011057369,0.00012251362,0.0000130580265,5.4612593e-7,0.0013257215,0.5243687,0.00068488263,0.00038904473,0.0000047752933,0.4727822],"study_design_scores_gemma":[0.0002564448,0.00047202047,0.00008937141,0.0004300531,0.000018500905,0.00001519134,0.00006918715,0.71829957,0.28000444,0.00013383376,0.000022795291,0.00018863379],"about_ca_topic_score_codex":0.000056354573,"about_ca_topic_score_gemma":0.0000017092233,"teacher_disagreement_score":0.7370957,"about_ca_system_score_codex":0.00019604349,"about_ca_system_score_gemma":0.00027096592,"threshold_uncertainty_score":0.79800016},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034033156,0.00040668144,0.9933715,0.000009412099,0.00024445757,0.0009855046,0.000018613497,0.0014600572,0.0001004782],"genre_scores_gemma":[0.8758154,0.00010545039,0.12344444,0.000016133077,0.000044062515,0.00022757349,0.00001027129,0.00013190636,0.00020477634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998592,0.00008013105,0.00046415068,0.00028942587,0.00022135826,0.00035288557],"domain_scores_gemma":[0.99905485,0.00023797344,0.00014719056,0.00025399824,0.00021271115,0.000093279516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018992597,0.00031096017,0.0003602099,0.0003081301,0.00063621724,0.0000881866,0.00020582743,0.0002295425,0.00006199657],"category_scores_gemma":[0.0000051851794,0.00035147413,0.00009128769,0.0004530106,0.00008106017,0.00074273435,0.0000015727112,0.0003282107,0.000008068315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005867149,0.000043893644,8.664999e-7,0.00011569499,0.00004428634,0.0000015371655,0.0004217794,0.96306986,0.03422503,0.000003296743,0.000052405303,0.001962689],"study_design_scores_gemma":[0.00048366422,0.000049543327,3.633719e-7,0.00031932112,0.000043614695,0.000034260273,0.00003375979,0.83058083,0.168052,0.000027177815,0.00005247918,0.0003229928],"about_ca_topic_score_codex":0.000006268806,"about_ca_topic_score_gemma":2.2396036e-7,"teacher_disagreement_score":0.8724121,"about_ca_system_score_codex":0.00028542726,"about_ca_system_score_gemma":0.0000703915,"threshold_uncertainty_score":0.9998937},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061746184,0.000056463356,0.9921187,0.00010874041,0.00004490809,0.00065696886,0.000010402917,0.00032965597,0.00049950735],"genre_scores_gemma":[0.7403074,0.000009076905,0.25917575,0.000059924034,0.000010708376,0.0003491511,0.0000013291047,0.000026936805,0.000059723745],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980844,0.000051015508,0.00054611906,0.0005875981,0.00035520087,0.00037561313],"domain_scores_gemma":[0.99924207,0.00008044167,0.00022258708,0.00028063153,0.00007027137,0.00010398604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003095171,0.0002656054,0.00029264425,0.00033865977,0.00028820772,0.0001396849,0.0004984829,0.000116904506,0.000035164016],"category_scores_gemma":[0.0000055151077,0.00027324856,0.000102014295,0.00070365274,0.000113145215,0.0013148066,0.0000022303443,0.00023689473,0.000015958494],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006222268,0.00038998754,0.000018052568,0.00014373059,0.00000709846,0.0000010417244,0.0011390069,0.013147531,0.02686478,0.000013552698,0.000003912014,0.9582091],"study_design_scores_gemma":[0.0005592345,0.0001291866,0.00009704385,0.00034095006,0.000015928388,0.000008013977,0.000037027832,0.45230195,0.54167575,0.004441488,0.0001103215,0.00028313635],"about_ca_topic_score_codex":0.000014318412,"about_ca_topic_score_gemma":0.0000031913853,"teacher_disagreement_score":0.957926,"about_ca_system_score_codex":0.00014243927,"about_ca_system_score_gemma":0.00013087342,"threshold_uncertainty_score":0.999972},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057947747,0.00002653876,0.94134074,0.000030322513,0.000051017007,0.00011373024,0.0000015832536,0.00014442837,0.000343861],"genre_scores_gemma":[0.95746535,0.0000052851715,0.04247678,0.000030131858,0.0000070971305,0.0000057036914,5.7310484e-7,0.000004613416,0.0000044570943],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991609,0.000025197547,0.00036989822,0.00009880857,0.00024009428,0.00010513937],"domain_scores_gemma":[0.99927974,0.00015949807,0.00022606358,0.00010006908,0.00019927928,0.000035366487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004612252,0.00008666988,0.00011228398,0.00030441093,0.00014784026,0.00008634371,0.00013515569,0.000055397344,0.00000602462],"category_scores_gemma":[0.000012892779,0.00008469458,0.000034375927,0.00036867577,0.00008183388,0.0018293043,0.0000014800133,0.00010024096,0.0000013864867],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024737614,0.000050953913,0.00006689121,0.00012162432,0.0000061323994,1.7253635e-7,0.003644893,0.0041684275,0.017365595,0.0009779441,0.0000011650003,0.9735715],"study_design_scores_gemma":[0.00016092438,0.000087875116,0.00036078732,0.0001242408,0.000008872104,0.0000075194703,0.0001507878,0.16434106,0.833074,0.0015764984,0.000021244532,0.00008623909],"about_ca_topic_score_codex":0.000016218268,"about_ca_topic_score_gemma":0.0000041922426,"teacher_disagreement_score":0.97348523,"about_ca_system_score_codex":0.00002155356,"about_ca_system_score_gemma":0.000040150622,"threshold_uncertainty_score":0.34537446},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051531964,0.00016423107,0.9917717,0.00033598597,0.00029127486,0.00020390365,6.633202e-7,0.0001481051,0.0019309508],"genre_scores_gemma":[0.9888569,0.000065340275,0.0104539,0.00035666834,0.00005114997,0.00006841769,5.41978e-7,0.0000150760025,0.00013200588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986709,0.00014069607,0.00030465197,0.00038910427,0.00020112954,0.0002935334],"domain_scores_gemma":[0.9991254,0.00017373862,0.00008499451,0.00034277624,0.00017456416,0.000098494995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035447223,0.00019063786,0.00018424456,0.00019156303,0.00054633676,0.00023640716,0.0006127786,0.00010481305,0.00007818243],"category_scores_gemma":[0.000003817928,0.00018127575,0.00005769461,0.0009364273,0.00008063693,0.0007578402,0.000008290744,0.0011781332,0.00002372913],"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.000030766172,0.00019065708,0.000020984384,0.000004455396,0.000010541331,0.0000082545685,0.0012726542,0.20322677,0.004734201,0.0014227265,0.000025615562,0.78905237],"study_design_scores_gemma":[0.00043240425,0.000095061696,0.00011500993,0.00012423092,0.0000046552004,0.000011337394,0.00008860611,0.99219954,0.0063320287,0.00009658067,0.00025549292,0.00024506362],"about_ca_topic_score_codex":0.0000061602427,"about_ca_topic_score_gemma":0.0003068143,"teacher_disagreement_score":0.98370373,"about_ca_system_score_codex":0.000071489296,"about_ca_system_score_gemma":0.00014479534,"threshold_uncertainty_score":0.7392211},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037809117,0.00083155214,0.9931362,0.000008018261,0.00036018342,0.0011394989,0.000012544201,0.0006453444,0.0000857259],"genre_scores_gemma":[0.7979737,0.000040695442,0.20170388,0.000016498338,0.000037800743,0.000066528526,0.000019032414,0.00008172428,0.000060128525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982736,0.00009258112,0.00069976033,0.00032701227,0.00024085322,0.0003661703],"domain_scores_gemma":[0.99887717,0.00025164883,0.00019541998,0.0002745012,0.00030598856,0.00009529493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039588776,0.0003193883,0.00032301433,0.0003155687,0.0005991141,0.00022400204,0.00019379397,0.00025345312,0.000010361831],"category_scores_gemma":[0.000010453311,0.0003530043,0.00008773031,0.0005801625,0.000028739343,0.0010797292,9.453765e-7,0.00026383807,0.000008400764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012920095,0.00004896686,5.703826e-7,0.00010185283,0.000022739674,4.7998446e-7,0.0004419604,0.94295126,0.017131835,0.000012938004,0.000038014306,0.03912017],"study_design_scores_gemma":[0.0008254993,0.0001139459,0.0000013928754,0.0010231666,0.00008396705,0.00002312354,0.00016515916,0.97241837,0.024801394,0.00015103312,0.0000317785,0.00036118572],"about_ca_topic_score_codex":0.000006129558,"about_ca_topic_score_gemma":0.0000014809125,"teacher_disagreement_score":0.7941928,"about_ca_system_score_codex":0.00038612264,"about_ca_system_score_gemma":0.000060556304,"threshold_uncertainty_score":0.9998922},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005819704,0.00005772901,0.9921986,0.0006866864,0.00014382189,0.00054192473,0.00006253644,0.00017636179,0.0003126638],"genre_scores_gemma":[0.8727408,0.000002388011,0.12669866,0.00018136925,0.00004605056,0.00012364668,0.000009008672,0.000028008331,0.00017006048],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980962,0.000053693864,0.0005733947,0.00051421626,0.00037248948,0.00038998254],"domain_scores_gemma":[0.99904376,0.00015132573,0.00027302967,0.00025090002,0.00015798888,0.00012300459],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032421868,0.00026696603,0.00028553003,0.00030166015,0.00045093158,0.000518434,0.00043846254,0.00008128116,0.000027459662],"category_scores_gemma":[0.000004668661,0.0002612554,0.00014620792,0.0005577441,0.000073429386,0.0024088414,0.0000044881626,0.00014400829,0.0000124671915],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015069186,0.0009239656,0.000006987347,0.00032757784,0.0000835428,0.0000016298795,0.0048949,0.01542118,0.19235289,0.0003347939,0.00085427315,0.7846476],"study_design_scores_gemma":[0.00094550237,0.00070961216,0.000015110151,0.0002594865,0.00005765304,0.000008349217,0.00025384745,0.47013146,0.5244827,0.0020808666,0.0006722654,0.0003831129],"about_ca_topic_score_codex":0.000061780396,"about_ca_topic_score_gemma":0.0000609269,"teacher_disagreement_score":0.8669211,"about_ca_system_score_codex":0.00010468064,"about_ca_system_score_gemma":0.00019656426,"threshold_uncertainty_score":0.99998397},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068867564,0.000103758524,0.92984474,0.00016041171,0.000028169852,0.0002973522,0.0000054154993,0.000098466364,0.0005941079],"genre_scores_gemma":[0.89631766,0.000005061511,0.103524566,0.000060073708,0.000008441484,0.00003724778,2.3950005e-7,0.000010531757,0.000036162783],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987129,0.000114003364,0.00039384866,0.00024531313,0.00038797458,0.00014595884],"domain_scores_gemma":[0.999017,0.00018685758,0.00024472384,0.00031134326,0.00019146672,0.000048626116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004624457,0.0001443754,0.00026289374,0.00017451684,0.0002902668,0.000052785264,0.00053971465,0.00004115541,0.000003520738],"category_scores_gemma":[0.000011326142,0.00009209243,0.00008900031,0.00062140386,0.0005911219,0.00033859388,0.000008669303,0.00014158196,6.483353e-7],"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.00058877235,0.0010198199,0.00022940863,0.0009043688,0.0001917202,0.00000515679,0.038134407,0.3967344,0.08422467,0.0048725563,0.00004264926,0.47305208],"study_design_scores_gemma":[0.0006600161,0.00015635263,0.00033931923,0.00022336103,0.00004157962,0.00005668416,0.0002609011,0.39083624,0.60620433,0.0010430786,0.000015932392,0.00016220822],"about_ca_topic_score_codex":0.00009833819,"about_ca_topic_score_gemma":0.0000043685845,"teacher_disagreement_score":0.8274501,"about_ca_system_score_codex":0.000014357812,"about_ca_system_score_gemma":0.0000980384,"threshold_uncertainty_score":0.375542},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10452317,0.000013158609,0.89461344,0.000027957962,0.00010530956,0.00020055908,0.000016278318,0.00038741433,0.00011269157],"genre_scores_gemma":[0.91096884,0.000007630574,0.08882125,0.00011190078,0.000025039213,0.000034063472,0.00000820313,0.000015095792,0.000007955431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930817,0.000010602873,0.00021523774,0.00015129232,0.00013015397,0.0001845491],"domain_scores_gemma":[0.99954146,0.00008191509,0.000042777367,0.00012146439,0.00012728466,0.00008510084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014545376,0.00015272484,0.00019898338,0.0004127243,0.000273292,0.000111976165,0.00008629079,0.00008733403,0.000023313418],"category_scores_gemma":[0.0000016691853,0.00015513168,0.00007309837,0.0004756435,0.00002358779,0.00043531004,0.0000011176634,0.00023322193,0.0000036972096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009371764,0.000020302836,0.000038287533,0.00012564125,0.00018024596,3.23921e-7,0.00039169035,0.58606446,0.09761732,0.000004548629,0.000051841547,0.31541163],"study_design_scores_gemma":[0.00018289713,0.000049906386,0.00015618016,0.000040769002,0.00017868966,0.0000037131667,0.000038486614,0.7266169,0.27209735,0.000020931358,0.00046598134,0.00014817923],"about_ca_topic_score_codex":0.000006358116,"about_ca_topic_score_gemma":0.0000058343635,"teacher_disagreement_score":0.8064457,"about_ca_system_score_codex":0.000021802793,"about_ca_system_score_gemma":0.000014009746,"threshold_uncertainty_score":0.63260865},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02306135,0.00014511346,0.97531456,0.000043724307,0.00005403629,0.000536576,0.000034366774,0.0006930662,0.00011718556],"genre_scores_gemma":[0.9191407,0.000020099544,0.08048072,0.000017402099,0.000034619246,0.000117534895,0.00000876888,0.00008009792,0.000100090365],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985253,0.000015808779,0.0006703042,0.00024973703,0.00023208288,0.0003067659],"domain_scores_gemma":[0.99888766,0.00020797747,0.0002076055,0.0003132128,0.00030432278,0.0000791967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057997095,0.00023586622,0.00026870347,0.00039458481,0.00022797594,0.000041979765,0.00028071692,0.0001805443,0.000011604024],"category_scores_gemma":[0.000008093922,0.00027541924,0.00011899712,0.0005218851,0.00008369534,0.00038148434,0.0000017875267,0.0003186127,0.000004980699],"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.000077403725,0.000102781545,2.8839918e-7,0.00016127572,0.00002765559,2.1901413e-7,0.00029112742,0.2074073,0.77444816,0.00002607694,0.000004759315,0.017452989],"study_design_scores_gemma":[0.0004022148,0.000034811972,0.0000027186115,0.00016623191,0.000025150324,0.000004410348,0.00008696245,0.31225285,0.68656105,0.00023723269,0.00003891682,0.00018749137],"about_ca_topic_score_codex":0.000003822123,"about_ca_topic_score_gemma":0.0000047868803,"teacher_disagreement_score":0.8960793,"about_ca_system_score_codex":0.00012664581,"about_ca_system_score_gemma":0.00004630392,"threshold_uncertainty_score":0.9999698},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005488106,0.00022103268,0.9917585,0.00090383523,0.00025137095,0.0007196674,0.0000027257997,0.00029499742,0.0003597185],"genre_scores_gemma":[0.90621984,0.000117721305,0.09210956,0.0006425592,0.0000732084,0.00031470374,0.000012939472,0.00003405096,0.0004754438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831176,0.00017257138,0.00040632652,0.00048866915,0.00023388781,0.00038680912],"domain_scores_gemma":[0.99849653,0.00019766473,0.00023128117,0.0004002126,0.00055374426,0.00012055056],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00039332412,0.00025743985,0.00021672735,0.0001509884,0.0015977204,0.0005003196,0.0004248389,0.000095119154,0.00023323378],"category_scores_gemma":[0.000005666817,0.000234084,0.00007182777,0.0006863197,0.00008451818,0.0015279539,0.0000084265375,0.00025920858,0.000032997003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005834051,0.00011969065,0.000027354676,0.000023232613,0.000026353262,5.4716196e-7,0.00047809217,0.9297579,0.0006885177,0.0003350113,0.00045783125,0.068027124],"study_design_scores_gemma":[0.0009848243,0.00027162698,0.000051919225,0.00027949872,0.000031277,0.000009364257,0.000033282482,0.9943703,0.0026632657,0.00019469488,0.0007590568,0.00035092715],"about_ca_topic_score_codex":0.0000031751267,"about_ca_topic_score_gemma":0.000017787095,"teacher_disagreement_score":0.9007317,"about_ca_system_score_codex":0.00008729329,"about_ca_system_score_gemma":0.0001084663,"threshold_uncertainty_score":0.99970204},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05448085,0.00004594095,0.94124174,0.00004906975,0.0013675584,0.00023734476,0.000018036762,0.0011697838,0.0013896892],"genre_scores_gemma":[0.9788583,0.000006920256,0.020532472,0.0000474533,0.0002631775,0.00009973937,0.0000028019547,0.00006143091,0.00012774103],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990985,0.000010999213,0.0002529793,0.0002465477,0.0001233577,0.00026766022],"domain_scores_gemma":[0.9994913,0.00008532189,0.000047751248,0.00017034145,0.00012001979,0.00008527557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009415153,0.0002043491,0.00017770701,0.0002010523,0.00036663515,0.00010319358,0.000099711695,0.0001634958,0.00010564171],"category_scores_gemma":[0.0000030315173,0.00021770672,0.000120939745,0.00021322712,0.000069958485,0.00031043292,5.164394e-7,0.00046687239,0.000022909375],"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.000046995574,0.000048421316,0.000004831179,0.000049335216,0.000044969296,0.000001793277,0.00012697348,0.018613292,0.43077067,0.000015383057,0.00039121148,0.5498861],"study_design_scores_gemma":[0.00039935185,0.00008945985,0.000022268063,0.00016079134,0.00009796613,0.00009311852,0.00011753325,0.32782605,0.66703296,0.000352236,0.0034318336,0.0003764225],"about_ca_topic_score_codex":0.000005353792,"about_ca_topic_score_gemma":0.00003074109,"teacher_disagreement_score":0.9243774,"about_ca_system_score_codex":0.000041062198,"about_ca_system_score_gemma":0.000043709217,"threshold_uncertainty_score":0.8877823},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032738338,0.00097019016,0.9939073,0.000707027,0.00009522216,0.0005175764,0.0000012338709,0.00021948587,0.0003081736],"genre_scores_gemma":[0.97695655,0.00012844821,0.022473937,0.00015813741,0.00002496187,0.00006908761,3.4967962e-7,0.000013318461,0.0001751938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983087,0.00033655678,0.0003650394,0.00042993776,0.00023655377,0.0003231886],"domain_scores_gemma":[0.998376,0.0007468149,0.00010645685,0.0003647731,0.00026079675,0.00014513821],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017675495,0.00020810076,0.00018777947,0.00008202962,0.0020520797,0.0005354795,0.00041786992,0.000080598686,0.00000797393],"category_scores_gemma":[0.0000125608485,0.00014970906,0.000039802308,0.00044195002,0.00023571649,0.0005735105,0.000012735117,0.00039268995,0.000006267195],"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.0001273904,0.00011936517,0.000016809117,0.00009345807,0.00004316865,0.0000036224503,0.0038306848,0.0138288755,0.0020711196,0.0030367698,0.000053476924,0.9767753],"study_design_scores_gemma":[0.000617825,0.00024612705,0.00019401277,0.00027468894,0.00003570224,0.00006380954,0.0006631821,0.98189616,0.013772948,0.00029349708,0.0015348267,0.00040723372],"about_ca_topic_score_codex":0.000006159103,"about_ca_topic_score_gemma":0.000088201756,"teacher_disagreement_score":0.976368,"about_ca_system_score_codex":0.000103766455,"about_ca_system_score_gemma":0.00013224444,"threshold_uncertainty_score":0.99924713},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18026519,0.000054651402,0.8194454,0.00002053408,0.000017949682,0.00013856131,0.000011085121,0.000038277267,0.000008391386],"genre_scores_gemma":[0.78835565,0.000034501663,0.21157654,0.000013604625,9.050037e-7,0.000006980139,0.0000012234507,0.000005931158,0.000004656064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873585,0.00009714208,0.00042379857,0.00031475187,0.00032550315,0.00010293173],"domain_scores_gemma":[0.99890375,0.00037591567,0.00019004519,0.0004382416,0.00005297906,0.000039090763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030142895,0.00011785477,0.0002768463,0.0005339255,0.000118004245,0.000021882586,0.0004591639,0.000060192586,0.000010472577],"category_scores_gemma":[0.000019105835,0.000095781645,0.00004276301,0.0016044305,0.00019417201,0.00059376116,0.000015493328,0.000109677785,1.9457613e-7],"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.00017451437,0.0007572589,0.004483493,0.00013710423,0.00033277358,0.0000052139935,0.0033336538,0.1648654,0.06705255,0.000013486117,0.000028208688,0.75881636],"study_design_scores_gemma":[0.00021198468,0.000038658734,0.008994947,0.00012274276,0.00009505946,0.000005671581,0.0000100155485,0.84765226,0.14261402,0.00017334231,0.0000017861277,0.00007953423],"about_ca_topic_score_codex":0.000034805285,"about_ca_topic_score_gemma":0.000006982791,"teacher_disagreement_score":0.7587368,"about_ca_system_score_codex":0.000020343221,"about_ca_system_score_gemma":0.00006435709,"threshold_uncertainty_score":0.39058623},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008206149,0.000101737736,0.9968488,0.00012303385,0.000110453555,0.00061109045,0.000006378722,0.000692977,0.0006849183],"genre_scores_gemma":[0.81512356,0.000006701283,0.18400435,0.00017301393,0.000041265732,0.00032532268,0.00000415625,0.000019909769,0.00030172465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856794,0.00006815042,0.0003282949,0.00043415136,0.00034440096,0.0002570913],"domain_scores_gemma":[0.9992145,0.00009156905,0.00014821842,0.00024391824,0.0002131269,0.000088686975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037456458,0.00018923824,0.00020066497,0.00035607966,0.0006520721,0.0002575792,0.00037598985,0.00013317699,0.000002076221],"category_scores_gemma":[0.0000036105369,0.00018561035,0.000096461794,0.0006333624,0.000055285123,0.0011111544,0.0000017336318,0.00022478668,0.0000082943725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064223466,0.0005468111,0.0000012820896,0.00028816477,0.00003340003,0.0000042758593,0.0058155763,0.8993767,0.0026752823,0.00086720655,0.00039266847,0.0899344],"study_design_scores_gemma":[0.00033900654,0.00013195456,0.0000021775902,0.000061854946,0.000010686705,0.000081408776,0.00008058721,0.965382,0.03326436,0.00030834213,0.00012786884,0.0002097576],"about_ca_topic_score_codex":0.000009535441,"about_ca_topic_score_gemma":6.030035e-7,"teacher_disagreement_score":0.8143029,"about_ca_system_score_codex":0.000064793705,"about_ca_system_score_gemma":0.00017600946,"threshold_uncertainty_score":0.75689703},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004893234,0.00031121806,0.99429005,0.00011279176,0.000028979419,0.00016533877,0.0000014080446,0.00011258311,0.0000843736],"genre_scores_gemma":[0.97925425,0.000086335305,0.020389087,0.00020795634,0.000011148952,0.00001483733,9.72685e-7,0.00000602662,0.000029380793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988276,0.00019571856,0.00029439531,0.00028895916,0.00018730822,0.0002060514],"domain_scores_gemma":[0.9991202,0.00013903104,0.0001224666,0.00028903797,0.0002560639,0.00007321635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041571172,0.0001578703,0.0002581114,0.00028800793,0.00053795276,0.00012755579,0.00033748805,0.0000609229,0.000012432265],"category_scores_gemma":[0.0000017999183,0.00014208083,0.000067961664,0.0016175315,0.000049274135,0.0004565394,0.0000026296107,0.00022156748,0.000001704742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000347789,0.00010701615,0.00002628944,0.000013769862,0.00004322191,8.769709e-7,0.00043560626,0.83960515,0.0012761289,0.0000952895,0.0000034584373,0.15835841],"study_design_scores_gemma":[0.00041461052,0.0001804965,0.00036391287,0.00011877169,0.000072286595,0.0000018173378,0.000042696553,0.981191,0.017448582,0.0000026486782,0.000012766447,0.00015042257],"about_ca_topic_score_codex":0.0000010093988,"about_ca_topic_score_gemma":0.0000056672675,"teacher_disagreement_score":0.974361,"about_ca_system_score_codex":0.000042102558,"about_ca_system_score_gemma":0.00008019404,"threshold_uncertainty_score":0.5793888},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44086123,0.00028145473,0.5584101,0.000004790369,0.00009007831,0.00007997415,0.000006893623,0.00012954518,0.00013591886],"genre_scores_gemma":[0.980239,0.000007412872,0.019674785,0.00000740867,0.000027565515,0.0000087483395,0.0000016130259,0.000025304364,0.000008201059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902475,0.000025222673,0.0003388894,0.00011945097,0.00030432176,0.00018735799],"domain_scores_gemma":[0.999521,0.00009086228,0.000107028995,0.0001271055,0.000097576274,0.000056405628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014087073,0.00014630484,0.00021583219,0.00023799231,0.0000686284,0.000011829673,0.000081569044,0.00008878556,0.00003557712],"category_scores_gemma":[0.0000023788186,0.00013791303,0.0000714185,0.00028657512,0.000053244563,0.00013555172,0.0000012618174,0.00014091976,0.0000064200412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046386827,0.00014538375,0.00000304018,0.0000776954,0.000017062433,4.600195e-7,0.00015328705,0.81108105,0.06655229,0.000011350194,0.0000313658,0.12188062],"study_design_scores_gemma":[0.000117799565,0.000041646803,0.000058121772,0.00027232338,0.000036092806,0.000006051195,0.000019367146,0.51407737,0.48522794,0.000051615556,0.00000823968,0.000083433166],"about_ca_topic_score_codex":0.000015113665,"about_ca_topic_score_gemma":7.9737987e-7,"teacher_disagreement_score":0.53937775,"about_ca_system_score_codex":0.00003845145,"about_ca_system_score_gemma":0.00002306262,"threshold_uncertainty_score":0.562393},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037036836,0.00010372541,0.96084815,0.0002473514,0.000052953103,0.00022929988,0.000005020511,0.00020092758,0.0012757491],"genre_scores_gemma":[0.9854747,0.000007660411,0.013981751,0.00031321796,0.000023528224,0.00003978517,7.4179013e-7,0.0000141890105,0.00014441206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985277,0.00021886808,0.00041272832,0.00030335502,0.00034238616,0.00019497093],"domain_scores_gemma":[0.99923384,0.00027479578,0.00015332457,0.00019160155,0.00009489255,0.00005152135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060459547,0.00015210296,0.00018598983,0.00042898871,0.00010886723,0.000101625716,0.00031459928,0.000081068894,0.000022368613],"category_scores_gemma":[0.0000036076058,0.00014622857,0.000062760635,0.0005039326,0.000051345985,0.0007717875,0.0000013993458,0.00028319025,0.000022617056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095874304,0.0004864592,0.000004965224,0.000050862687,0.000012560716,0.0000062251643,0.0026788418,0.7693812,0.012941486,0.011868765,0.000023396597,0.20244935],"study_design_scores_gemma":[0.000572477,0.00030016675,0.00010155323,0.0003626857,0.000008126363,0.000009886422,0.00018722145,0.66812444,0.32033423,0.009629184,0.00007507074,0.0002949541],"about_ca_topic_score_codex":0.0000093309,"about_ca_topic_score_gemma":0.0000073128535,"teacher_disagreement_score":0.94843787,"about_ca_system_score_codex":0.00008350975,"about_ca_system_score_gemma":0.00012415645,"threshold_uncertainty_score":0.5963028},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25420693,0.000059356884,0.7446657,0.00017071534,0.000039882645,0.00015432574,0.0000012922776,0.0005734469,0.00012835916],"genre_scores_gemma":[0.98471236,0.000009317332,0.014935051,0.00015449419,0.000024328685,0.000020827885,7.446354e-7,0.000024542143,0.00011831467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985771,0.00008809585,0.00024133627,0.0005299167,0.00024312492,0.00032040055],"domain_scores_gemma":[0.99927336,0.00016517167,0.00012990322,0.00020576511,0.0001303617,0.000095424635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035696864,0.00025110965,0.00027320415,0.00019931461,0.0008941442,0.0005342469,0.00021976414,0.000091302994,0.0000028546422],"category_scores_gemma":[0.0000025527243,0.00023276803,0.000031593598,0.00044666664,0.00018802016,0.0006693414,0.000006736233,0.00036790088,0.000002325002],"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.0017570326,0.0033130147,0.007390935,0.0026109759,0.00026319548,0.00027399673,0.01964737,0.096047305,0.23089787,0.0018594521,0.00059773517,0.6353411],"study_design_scores_gemma":[0.000954479,0.00046021192,0.0013253787,0.00064115104,0.00004810072,0.00012368486,0.00017126581,0.5935544,0.39997327,0.0021044319,0.000027127122,0.0006165397],"about_ca_topic_score_codex":0.0002953589,"about_ca_topic_score_gemma":0.00016736778,"teacher_disagreement_score":0.73050547,"about_ca_system_score_codex":0.000048442824,"about_ca_system_score_gemma":0.0000863815,"threshold_uncertainty_score":0.94920045},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012193397,0.000042896576,0.9861824,0.000024325507,0.00032546738,0.00031440074,0.000008900761,0.00037603322,0.0005322083],"genre_scores_gemma":[0.9841058,0.0000045492934,0.015572175,0.000047517744,0.00007183826,0.00010467074,0.0000018911962,0.000055173998,0.00003635517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990105,0.000023250073,0.0003347173,0.0002165649,0.00014466247,0.00027032464],"domain_scores_gemma":[0.9995895,0.00005824652,0.000061061255,0.00008383246,0.00014175914,0.00006560166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013736513,0.00019866337,0.0002023214,0.00027611837,0.00018859963,0.000057829668,0.0000744715,0.00015269188,0.000045720873],"category_scores_gemma":[0.0000033085958,0.00021903831,0.000036044246,0.0007744822,0.000031299984,0.0007180261,2.5609216e-7,0.0005613714,0.00001766559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024811307,0.000026875148,0.000018918246,0.00004089021,0.000009183394,0.0000014023595,0.00028837644,0.7569279,0.21147175,0.000002684962,0.0000031283055,0.031184083],"study_design_scores_gemma":[0.00067835336,0.00003012594,0.000010856762,0.00007887322,0.000015772337,0.000016618766,0.0001280277,0.87581545,0.12285998,0.00006075599,0.0000860846,0.00021912181],"about_ca_topic_score_codex":0.000014696706,"about_ca_topic_score_gemma":0.00032000555,"teacher_disagreement_score":0.97191244,"about_ca_system_score_codex":0.00014754075,"about_ca_system_score_gemma":0.000062745115,"threshold_uncertainty_score":0.8932123},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037710627,0.000012135624,0.9946133,0.00009879432,0.000029274026,0.0006711335,0.0000022378279,0.000650438,0.00015165728],"genre_scores_gemma":[0.51864815,9.718883e-7,0.48113054,0.000047274578,0.000009906813,0.00010094332,7.1325127e-7,0.000015548258,0.000045929573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984199,0.00006833827,0.00039114492,0.0004350793,0.00043358497,0.00025195006],"domain_scores_gemma":[0.99912614,0.000088664034,0.00016637974,0.00030217564,0.0002101001,0.00010656757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030574278,0.00021011144,0.00019571935,0.0003600818,0.00033123823,0.00024873536,0.00033988542,0.00008185487,0.000045460598],"category_scores_gemma":[0.000002891873,0.00019978707,0.00005273172,0.0013405619,0.000051124993,0.0012321527,0.0000019079969,0.00017103525,0.00003387626],"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.000035634373,0.000063547915,0.0000013432145,0.000033056134,0.0000060746956,7.126605e-7,0.000328715,0.4546101,0.005114322,0.00001839571,0.0000031808602,0.5397849],"study_design_scores_gemma":[0.00014520095,0.00018849972,0.00000782956,0.00023049995,0.000022972687,0.000029359506,0.000009567212,0.78494805,0.21376798,0.0003341192,0.00011669516,0.00019922035],"about_ca_topic_score_codex":0.00003608139,"about_ca_topic_score_gemma":0.000002536399,"teacher_disagreement_score":0.53958565,"about_ca_system_score_codex":0.000113951966,"about_ca_system_score_gemma":0.0001453198,"threshold_uncertainty_score":0.81470805},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048971473,0.0009738975,0.9900137,0.0015588516,0.00008228703,0.00039046607,0.000032207558,0.000380938,0.006077912],"genre_scores_gemma":[0.9706278,0.0002200713,0.02847989,0.00023158136,0.000031683387,0.00013210672,0.000011478134,0.000035088175,0.00023031671],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991869,0.000024824672,0.00027805008,0.0001680574,0.000094699004,0.00024747162],"domain_scores_gemma":[0.9990014,0.00009722725,0.000039675044,0.0007121004,0.00006530559,0.0000843001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016992837,0.00016795391,0.00017437455,0.00013885228,0.0006270862,0.00020426567,0.0010428465,0.00007540813,0.000047648777],"category_scores_gemma":[0.0000015735696,0.00017834085,0.00008118956,0.00034270968,0.000048695318,0.0004531238,0.0000032986377,0.0003103913,0.000021200694],"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.00007226963,0.0006286501,0.0000019852355,0.000065498854,0.00005546214,8.253391e-7,0.0005135711,0.32857051,0.0067541157,0.000884308,0.0013122113,0.66114056],"study_design_scores_gemma":[0.0011840705,0.0002429961,0.000074965355,0.00023684622,0.00008532369,0.000014694283,0.00015003385,0.9368745,0.03221842,0.0033228176,0.025007712,0.00058761484],"about_ca_topic_score_codex":0.0000052367354,"about_ca_topic_score_gemma":0.000035761375,"teacher_disagreement_score":0.9701381,"about_ca_system_score_codex":0.000077900055,"about_ca_system_score_gemma":0.000051853665,"threshold_uncertainty_score":0.7272529},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018084771,0.0001752519,0.9967745,0.00018394915,0.000062673615,0.00031893383,0.0000016844541,0.00027173682,0.00040279297],"genre_scores_gemma":[0.8267665,0.000060455244,0.17270435,0.00022017931,0.000028957058,0.00006191659,0.000001465757,0.00002119896,0.00013496431],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878174,0.00009712561,0.00025888588,0.00038733953,0.0001842172,0.0002907027],"domain_scores_gemma":[0.9991103,0.000110900226,0.00010172306,0.00033645166,0.0002107198,0.00012994894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024273271,0.00020134692,0.00019483683,0.00010102245,0.00091947493,0.0000943577,0.00059930945,0.00008309199,0.000040901985],"category_scores_gemma":[7.4804296e-7,0.0001668709,0.0000820931,0.0004845443,0.000118967764,0.00047879622,0.0000034495426,0.00035443658,0.0000050982912],"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.0001992747,0.00026902807,0.000008796401,0.000032186155,0.000023436874,0.0000024661501,0.00260505,0.044294536,0.0007811358,0.00044049034,0.000019655776,0.9513239],"study_design_scores_gemma":[0.000700968,0.00026429544,0.000052630236,0.00021789264,0.000018770348,0.000012706434,0.00004402822,0.98440933,0.0131679615,0.00007270798,0.00078391377,0.00025476704],"about_ca_topic_score_codex":0.00000629513,"about_ca_topic_score_gemma":0.000024595805,"teacher_disagreement_score":0.9510692,"about_ca_system_score_codex":0.00003955901,"about_ca_system_score_gemma":0.000076086915,"threshold_uncertainty_score":0.7071951},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017968885,0.0000094829165,0.9958158,0.00022873639,0.00010059143,0.00035741628,0.0000027197154,0.0009763031,0.002329242],"genre_scores_gemma":[0.56862205,2.8711852e-7,0.43113726,0.00006507422,0.000018668614,0.00006004583,0.0000011952252,0.000014322721,0.00008107349],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983744,0.000050180275,0.00044458252,0.0003870228,0.0005107103,0.00023309105],"domain_scores_gemma":[0.9990968,0.00012837033,0.00023189094,0.00031161835,0.00015172071,0.00007956061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031452562,0.00021914755,0.0002035056,0.00058816496,0.0002972942,0.00017567346,0.0003934491,0.000121928584,0.000038348782],"category_scores_gemma":[0.0000063815946,0.00022145489,0.000109400295,0.0009852198,0.00004520747,0.001014149,0.0000016742745,0.00025655163,0.000014129308],"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.000027813687,0.00017983808,0.0000031445898,0.000076057484,0.0000039297947,0.000002140023,0.00008132974,0.365243,0.032695774,0.000596777,0.000096251264,0.60099393],"study_design_scores_gemma":[0.00013432544,0.00011803849,0.000010407251,0.00021650745,0.000007919768,0.000006794568,0.0000024557914,0.48034367,0.51568633,0.0032849468,0.00005204325,0.00013656446],"about_ca_topic_score_codex":0.00012079466,"about_ca_topic_score_gemma":0.0000065519985,"teacher_disagreement_score":0.6008574,"about_ca_system_score_codex":0.00014202943,"about_ca_system_score_gemma":0.00030547843,"threshold_uncertainty_score":0.9030668},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028917755,0.000020937092,0.9869328,0.00023074621,0.00007156184,0.00010259687,0.000034416,0.0001722412,0.009542937],"genre_scores_gemma":[0.99019843,0.0000051554453,0.006386862,0.0008503947,0.000024303456,0.000022241622,0.000006106538,0.000017707538,0.0024888085],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984612,0.000042960546,0.00026971375,0.00045270476,0.000400752,0.00037266983],"domain_scores_gemma":[0.99942243,0.000053223863,0.00007434884,0.00020846304,0.00009612986,0.00014538033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008172595,0.00023800366,0.00017276418,0.00013873013,0.00039063243,0.0006841312,0.00033645504,0.000054688717,0.00059508334],"category_scores_gemma":[4.0507342e-7,0.00020976563,0.00006171868,0.00042141162,0.00015032629,0.0018893474,0.0000010790536,0.00014911586,0.00004096807],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006376748,0.00014486135,0.0000039372435,0.000019405139,0.000031681677,0.000013064209,0.0003425246,0.018892772,0.0027591037,0.0002680488,0.00015641343,0.9773044],"study_design_scores_gemma":[0.01186407,0.0042557186,0.0015192177,0.0016665659,0.0002605963,0.0010897021,0.002226581,0.36533684,0.5833547,0.009941623,0.013330064,0.0051543233],"about_ca_topic_score_codex":0.000063757834,"about_ca_topic_score_gemma":0.00004893267,"teacher_disagreement_score":0.98730665,"about_ca_system_score_codex":0.00008417539,"about_ca_system_score_gemma":0.00021449111,"threshold_uncertainty_score":0.8553994},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32302263,0.00018384677,0.6763639,0.00005415854,0.0000409589,0.000118944816,0.0000019418937,0.000088834015,0.00012476592],"genre_scores_gemma":[0.9461266,0.000049872215,0.05363606,0.00009792434,0.000022540517,0.0000068713375,3.9827376e-7,0.00001781761,0.000041957257],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99806994,0.00009104175,0.0003609908,0.0006170647,0.00041097277,0.00044997712],"domain_scores_gemma":[0.99880326,0.00032678663,0.00026314482,0.00022233809,0.00018535332,0.00019913861],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081606157,0.0002872884,0.00043249276,0.0007607507,0.0005747074,0.00024390763,0.00029234364,0.00012297546,0.000012458421],"category_scores_gemma":[0.0000060240477,0.0002800577,0.00009321644,0.0019888408,0.00020942501,0.0013231896,0.000007876236,0.00037244504,0.0000020274997],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002486789,0.00017187098,0.0010215403,0.00018000622,0.0002348482,0.000015422913,0.0019568948,0.008718152,0.062452268,0.0000065028485,0.000001906901,0.9249919],"study_design_scores_gemma":[0.000418674,0.00031778836,0.007544581,0.00019051686,0.0002880975,0.000027358261,0.00014242213,0.29371724,0.69695246,0.00005314305,0.000014867641,0.00033285163],"about_ca_topic_score_codex":0.000024222638,"about_ca_topic_score_gemma":0.000030338439,"teacher_disagreement_score":0.9246591,"about_ca_system_score_codex":0.00006426137,"about_ca_system_score_gemma":0.00011711697,"threshold_uncertainty_score":0.99996513},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3786684,0.000029453297,0.62031376,0.00016363608,0.00021253798,0.00021307955,0.000088508925,0.0000124770695,0.00029816665],"genre_scores_gemma":[0.99838084,9.448369e-7,0.0014840834,0.000030471734,0.000015115806,0.0000018034696,5.4378506e-7,0.0000041069898,0.000082068866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988905,0.000066272434,0.00020630486,0.0001328546,0.00052512233,0.0001789299],"domain_scores_gemma":[0.9995169,0.00009877012,0.000063972715,0.0001650842,0.00010477002,0.00005051551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002076107,0.00008417236,0.00010442465,0.000046095993,0.0003439883,0.00003599524,0.0003294365,0.000046887464,0.00046676255],"category_scores_gemma":[0.000011217813,0.00004109002,0.00005063082,0.00025497875,0.000546934,0.00007968962,0.0000014294641,0.0004038165,0.000009139623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013342395,0.00018547507,0.0035594548,0.00029944582,0.000023869376,0.0000013512243,0.0007014058,0.7049595,0.17666185,0.0000060309503,0.000025434423,0.11344273],"study_design_scores_gemma":[0.00012883442,0.00006058139,0.00482805,0.00009804961,0.000026070145,0.0000108949025,0.00010395727,0.60634357,0.38818848,0.00011502838,0.000025846786,0.000070627604],"about_ca_topic_score_codex":0.00027768343,"about_ca_topic_score_gemma":0.0003983595,"teacher_disagreement_score":0.6197125,"about_ca_system_score_codex":0.0000036422962,"about_ca_system_score_gemma":0.00025594173,"threshold_uncertainty_score":0.5110723},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22905596,0.000005661546,0.77018315,0.000040162093,0.00017321936,0.00017292766,0.000016585855,0.000099336896,0.00025300088],"genre_scores_gemma":[0.9754549,0.000003284788,0.02431421,0.0001030309,0.00004251423,0.000011930797,0.000009010644,0.000018478073,0.000042596625],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99854374,0.000040165065,0.00044973506,0.0003406305,0.0003582284,0.00026752317],"domain_scores_gemma":[0.99927163,0.000025152276,0.00024392601,0.00017841859,0.00019267014,0.00008820081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015155727,0.00020269582,0.00019313376,0.00034958954,0.00029779552,0.00026612374,0.00028331537,0.000079194695,0.000059352486],"category_scores_gemma":[8.944303e-7,0.00020875283,0.00009464687,0.00069111754,0.00006989088,0.0028074256,0.0000030780736,0.00017462604,0.000013266128],"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.00003064528,0.00012738776,0.000013311058,0.00006083172,0.00001707016,0.0000024909837,0.0005271915,0.007784042,0.5204088,0.00019678399,4.1491478e-7,0.47083104],"study_design_scores_gemma":[0.0008296084,0.00030971767,0.00013365076,0.00027756777,0.000029771647,0.00011231696,0.00009517493,0.16326676,0.8340528,0.00058813335,0.000025703705,0.00027879418],"about_ca_topic_score_codex":0.000031975094,"about_ca_topic_score_gemma":0.000007767351,"teacher_disagreement_score":0.746399,"about_ca_system_score_codex":0.00012526236,"about_ca_system_score_gemma":0.00024944608,"threshold_uncertainty_score":0.85126936},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036777806,0.0000921262,0.96244437,0.00020566168,0.000041302883,0.00033318484,0.0000055841974,0.0000739675,0.00002599728],"genre_scores_gemma":[0.8552417,0.00001909021,0.14461307,0.000053717587,0.000023038423,0.000036123605,0.0000011747715,0.000009933212,0.0000021098008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878764,0.00011627934,0.00032889878,0.0003114381,0.0002218303,0.00023393925],"domain_scores_gemma":[0.9993972,0.00014252435,0.00016973319,0.00016972239,0.00008912091,0.000031694704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004191511,0.00015349832,0.00018177995,0.0002481998,0.0004289347,0.00013245565,0.00030712367,0.00007263122,0.000001315017],"category_scores_gemma":[0.0000030912233,0.00011535063,0.000061182924,0.00036703836,0.00010244688,0.0011105458,0.0000056265717,0.00019784716,6.94868e-8],"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.00011185124,0.00020982207,0.000067311936,0.00023995573,0.000013169095,0.000004729675,0.0047241086,0.29048678,0.039270174,0.00023043889,0.000005412244,0.66463625],"study_design_scores_gemma":[0.00026917175,0.000055743967,0.00008805364,0.00073103874,0.000011689193,0.000020064186,0.00013875804,0.79382557,0.2042236,0.00045572233,0.00004367811,0.00013693208],"about_ca_topic_score_codex":0.0000067375886,"about_ca_topic_score_gemma":0.0000052668283,"teacher_disagreement_score":0.8184639,"about_ca_system_score_codex":0.000028890066,"about_ca_system_score_gemma":0.000029632443,"threshold_uncertainty_score":0.47038624},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013022044,0.000052902244,0.98503596,0.000018607534,0.00016230148,0.00012612222,0.0000021440574,0.00060724793,0.0009726515],"genre_scores_gemma":[0.8662999,0.0000018556659,0.13356361,0.000050281753,0.0000116773645,0.000020614774,1.2907165e-7,0.000017254732,0.00003466876],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99872667,0.000052016665,0.0003349173,0.00034626387,0.0002795428,0.00026058432],"domain_scores_gemma":[0.99917215,0.00012039365,0.00017547629,0.0002839697,0.00017083122,0.000077150355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029302688,0.00017235249,0.00020447078,0.00028438153,0.0002394108,0.000054266144,0.0005941327,0.000081210455,0.00003372348],"category_scores_gemma":[0.0000057205634,0.00017153843,0.000090695576,0.0005444851,0.000076356606,0.0005894314,0.000003976596,0.00027168778,0.000011213061],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013547385,0.00051784737,0.000024767613,0.0001243736,0.00006315096,0.000017062235,0.009331552,0.009982212,0.051452283,0.00063100475,0.000031388197,0.9276889],"study_design_scores_gemma":[0.00023205738,0.00038653272,0.00003146292,0.00032568432,0.00004013571,0.00005153542,0.00014628086,0.36466703,0.63062245,0.0031665158,0.0000042481934,0.00032604754],"about_ca_topic_score_codex":0.000056022312,"about_ca_topic_score_gemma":0.000023176259,"teacher_disagreement_score":0.92736286,"about_ca_system_score_codex":0.000051487983,"about_ca_system_score_gemma":0.00011499362,"threshold_uncertainty_score":0.69951344},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010799209,0.00020879613,0.98664445,0.0002767098,0.000044530407,0.0004288368,0.00004183125,0.0011724865,0.0003831763],"genre_scores_gemma":[0.9175379,0.000048155824,0.08173109,0.000054506767,0.00007531052,0.00026181835,0.000014461225,0.000074385556,0.0002023324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989257,0.000015799147,0.0003482812,0.00021719313,0.00020256979,0.0002904422],"domain_scores_gemma":[0.9993762,0.0001034398,0.00008042968,0.00022834596,0.00012800375,0.000083620165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014174935,0.00024321082,0.00022028912,0.00023901823,0.0003466281,0.000073514406,0.00021000102,0.0001434609,0.000042387688],"category_scores_gemma":[0.0000032602268,0.0002670262,0.00010050609,0.0002694599,0.000059901507,0.0006283879,0.0000012771022,0.00030870407,0.000043977554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000483329,0.000066234126,1.2799805e-7,0.00008155165,0.000018977018,2.0273063e-7,0.00020475707,0.6602604,0.013824067,0.000018223513,0.00005092719,0.32542622],"study_design_scores_gemma":[0.00040888923,0.00004929798,0.0000024444535,0.00012424935,0.000027177604,0.000006362274,0.000025320225,0.7448723,0.25295386,0.0005728922,0.0007241774,0.0002330725],"about_ca_topic_score_codex":0.0000012856302,"about_ca_topic_score_gemma":0.000009674393,"teacher_disagreement_score":0.90673876,"about_ca_system_score_codex":0.00015283536,"about_ca_system_score_gemma":0.000044256998,"threshold_uncertainty_score":0.9999782},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007206473,0.000012768136,0.98856777,0.0014506542,0.00015253878,0.00020904874,0.000001556533,0.0010214547,0.001377758],"genre_scores_gemma":[0.92229277,0.0000013596081,0.07671596,0.000653088,0.000043007556,0.000045138942,8.4109274e-7,0.000025497127,0.00022236463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982628,0.0001685005,0.00034597112,0.00049370836,0.00041954475,0.00030943612],"domain_scores_gemma":[0.99909395,0.00010414596,0.00014667107,0.0004100152,0.00009769464,0.00014751185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004426009,0.0002326989,0.000222881,0.00029275008,0.00048142608,0.00037768218,0.0005310248,0.00011445477,0.000051172887],"category_scores_gemma":[0.0000055079954,0.00022727442,0.000104835,0.00062104536,0.00007428705,0.0010754579,0.0000031941206,0.00038190247,0.00012282259],"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.00013705902,0.0012191796,0.000014181826,0.00043124697,0.0000909246,0.000028883298,0.016308727,0.117796496,0.058612257,0.012738593,0.0012615311,0.7913609],"study_design_scores_gemma":[0.0003165657,0.00022397087,0.000012388653,0.00014754172,0.000018428305,0.00003483287,0.0000987219,0.7517646,0.2414698,0.005274463,0.00030081585,0.00033785804],"about_ca_topic_score_codex":0.00001548868,"about_ca_topic_score_gemma":0.0000398437,"teacher_disagreement_score":0.91508627,"about_ca_system_score_codex":0.00008066353,"about_ca_system_score_gemma":0.00018755851,"threshold_uncertainty_score":0.92679816},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008619481,0.000036416248,0.99689406,0.00038771293,0.000098233984,0.0001457688,8.032211e-7,0.0008470038,0.00072805176],"genre_scores_gemma":[0.9321464,0.0000019672311,0.06725522,0.0002895289,0.000023706214,0.000032786447,5.256347e-7,0.000016434822,0.00023346397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880916,0.00006605922,0.00021692153,0.00035246127,0.00032849459,0.00022691982],"domain_scores_gemma":[0.9994633,0.000077599434,0.000102872706,0.00014709406,0.0001237124,0.00008539874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023327011,0.00016215332,0.0001378366,0.00021968296,0.0004805675,0.00023994893,0.00030889374,0.00008736645,0.000017444021],"category_scores_gemma":[0.000003839543,0.00016138585,0.00006913216,0.0005639746,0.000060464237,0.00095527846,0.0000021858698,0.0005863247,0.00007332001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009237998,0.00011018708,3.521277e-7,0.00000730302,0.000009712221,0.0000054179905,0.0035088887,0.7077724,0.0010315989,0.0010350671,0.0000035615458,0.28650627],"study_design_scores_gemma":[0.0009578902,0.00058089086,0.000020826395,0.00028944353,0.000024643827,0.00007911424,0.00031972604,0.8715426,0.112041965,0.01342777,0.00015411948,0.00056106463],"about_ca_topic_score_codex":0.00001129633,"about_ca_topic_score_gemma":0.0000030167932,"teacher_disagreement_score":0.9312844,"about_ca_system_score_codex":0.00010681264,"about_ca_system_score_gemma":0.00020070182,"threshold_uncertainty_score":0.6581124},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094684766,0.000122984,0.996453,0.0008738793,0.00032546613,0.0002873588,0.0000037845084,0.00021322585,0.00077346317],"genre_scores_gemma":[0.9857289,0.000023408595,0.013093979,0.00044343894,0.000080018166,0.00011463268,0.0000033473773,0.00001739741,0.0004948848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891794,0.0001268544,0.00021501664,0.00032139654,0.00018331187,0.00023548013],"domain_scores_gemma":[0.99889845,0.00012952399,0.00010204218,0.00026891162,0.00046835202,0.0001327352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000404383,0.00015620339,0.00014837066,0.0001552431,0.0005173287,0.0002920911,0.00046977962,0.00005189312,0.000014799383],"category_scores_gemma":[0.0000086323735,0.00015215945,0.00006336099,0.0005776222,0.000041056857,0.0009790527,0.0000049348996,0.00018719178,0.000022687916],"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.000081765094,0.00013344052,8.6379106e-7,0.000015082774,0.000019132396,0.0000010274711,0.002339376,0.113834605,0.0031913517,0.0013646553,0.00015653683,0.87886214],"study_design_scores_gemma":[0.0010078351,0.00015416172,0.000005225818,0.00008192243,0.000014178498,0.000006032784,0.00011726088,0.91325843,0.08162637,0.0014890443,0.0019916806,0.00024788096],"about_ca_topic_score_codex":0.000002660162,"about_ca_topic_score_gemma":0.0000142618455,"teacher_disagreement_score":0.98478204,"about_ca_system_score_codex":0.00010710793,"about_ca_system_score_gemma":0.00017059759,"threshold_uncertainty_score":0.6204883},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003910377,0.000121679885,0.994506,0.00030316648,0.0002633967,0.00023649313,0.0000076484985,0.00025307309,0.0003981826],"genre_scores_gemma":[0.96770954,0.000004675716,0.031541288,0.0001487262,0.00014729588,0.00003314275,0.0000024789686,0.000020869207,0.0003919685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881583,0.000058115882,0.00021570733,0.00035687268,0.00027355738,0.00027991313],"domain_scores_gemma":[0.9992612,0.000112578346,0.00008060077,0.00013175873,0.00028104294,0.00013281684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029557865,0.00015943538,0.00015558035,0.00015300163,0.00051586266,0.00023811588,0.00016146201,0.000070258226,0.0000102727245],"category_scores_gemma":[0.000005787811,0.00016019915,0.00008195936,0.00042065023,0.00005007104,0.000990597,0.0000015798073,0.00016127071,0.000031744734],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019345294,0.0001314212,0.000002932105,0.000027939694,0.000026129175,0.0000087744165,0.00060278445,0.035618767,0.008147029,0.000100548765,0.00008944943,0.95505077],"study_design_scores_gemma":[0.00077429065,0.0004196218,0.000029829669,0.00007709768,0.00002919946,0.000076028125,0.00009113512,0.90076447,0.09318215,0.0034295418,0.000829535,0.00029709443],"about_ca_topic_score_codex":0.000006367433,"about_ca_topic_score_gemma":0.000020479516,"teacher_disagreement_score":0.9637992,"about_ca_system_score_codex":0.00010733091,"about_ca_system_score_gemma":0.0001747353,"threshold_uncertainty_score":0.65327317},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16935626,0.000012519759,0.83001906,0.000037733716,0.000026902082,0.0002617969,0.0000075299035,0.000042544958,0.00023565923],"genre_scores_gemma":[0.9881671,6.158406e-7,0.011685194,0.000043967848,0.000020823787,0.000057248606,0.0000021234878,0.000020703053,0.0000022329887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991684,0.000026724487,0.0001932548,0.00017659488,0.0002727648,0.00016224466],"domain_scores_gemma":[0.99946225,0.00016492137,0.000057425972,0.000103772174,0.00015631344,0.00005529743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024526878,0.00012547057,0.000111900525,0.0001421507,0.00008017129,0.000043560813,0.0001227436,0.000033623768,0.0000028727993],"category_scores_gemma":[0.0000067386636,0.00010126632,0.000020092986,0.00052691443,0.00003663417,0.00027805648,6.1945155e-7,0.00019301259,0.0000031557709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006988832,0.000036701167,0.0000822365,0.000061035113,0.0000030292779,0.000001555363,0.0005313069,0.8674726,0.079841524,7.976201e-7,0.0000046208893,0.0518947],"study_design_scores_gemma":[0.0003333263,0.00009534465,0.00010993159,0.00024257548,0.00002068604,0.000006771482,0.00057716883,0.8927577,0.105592445,0.00014244822,0.0000026729465,0.00011892422],"about_ca_topic_score_codex":0.000063183084,"about_ca_topic_score_gemma":0.000010645621,"teacher_disagreement_score":0.8188108,"about_ca_system_score_codex":0.0000961602,"about_ca_system_score_gemma":0.00010983453,"threshold_uncertainty_score":0.41295207},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014294244,0.00013550722,0.99754095,0.00021778043,0.00030268077,0.0009540082,0.0001680723,0.0003693412,0.00016872484],"genre_scores_gemma":[0.9450342,0.000016390208,0.054129817,0.00004947846,0.00007458097,0.00039417334,0.0000037499801,0.00010002911,0.00019757228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885124,0.000013537148,0.00030832947,0.00029915376,0.00013695139,0.00039078493],"domain_scores_gemma":[0.9991664,0.00030258534,0.00009039224,0.0001673931,0.00019594167,0.00007728677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020171252,0.00026289618,0.00022347838,0.00011080409,0.00043638065,0.00009276464,0.00015449393,0.00010316524,0.0000530154],"category_scores_gemma":[0.000005337154,0.00016265185,0.000090412344,0.00019438176,0.00013279344,0.0004982409,6.585912e-7,0.00014389482,0.000009829913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099298966,0.000022104448,0.0000012312886,0.0001229805,0.0000778907,0.0000012865579,0.00015729512,0.7918613,0.006055378,0.000016055197,0.00004268143,0.20154253],"study_design_scores_gemma":[0.0029937776,0.00020434415,0.000002081147,0.00074715406,0.00016391742,0.000043100314,0.0005180767,0.92355925,0.06979068,0.00012447749,0.0012632974,0.00058982184],"about_ca_topic_score_codex":8.892905e-7,"about_ca_topic_score_gemma":0.0000062507584,"teacher_disagreement_score":0.9448913,"about_ca_system_score_codex":0.00012549464,"about_ca_system_score_gemma":0.000049191334,"threshold_uncertainty_score":0.663275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010227276,0.001346714,0.9873735,0.00021346299,0.000150668,0.00013272116,5.2708265e-7,0.0001663734,0.00038876195],"genre_scores_gemma":[0.95492816,0.000091929105,0.044302877,0.00025539016,0.00008544987,0.000034847322,0.000001138681,0.000018995543,0.00028121404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985249,0.00011308228,0.0003255312,0.00044643605,0.00023117264,0.00035888684],"domain_scores_gemma":[0.9992516,0.00010018817,0.00008845419,0.000268857,0.00010887292,0.00018201402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007876288,0.00018720144,0.00019244097,0.00018186409,0.00056588947,0.00029953994,0.00044452,0.00009913668,0.000008860282],"category_scores_gemma":[0.000006504894,0.00019180175,0.000044431883,0.0009092226,0.000069904956,0.00077933766,0.000022660515,0.00058395776,0.0000034728678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002595401,0.000050457034,0.00021718093,0.0000047883377,0.000007852177,0.0000039241095,0.0009321367,0.8620782,0.00004654756,0.000084246676,0.000041215808,0.13650754],"study_design_scores_gemma":[0.0006005908,0.000051596864,0.000113788,0.00019756121,0.0000064144992,0.000031054376,0.00010942918,0.9968015,0.00022891368,0.00003943841,0.0015966517,0.00022309202],"about_ca_topic_score_codex":0.000006969055,"about_ca_topic_score_gemma":0.000053735275,"teacher_disagreement_score":0.9447009,"about_ca_system_score_codex":0.00012516406,"about_ca_system_score_gemma":0.00010069917,"threshold_uncertainty_score":0.78214484},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016537452,0.00007865906,0.9814937,0.00033426087,0.00042271437,0.00032476406,0.000013273021,0.00016659853,0.00062858657],"genre_scores_gemma":[0.99500924,0.000017457887,0.004415321,0.00015792175,0.00023840174,0.000047547735,0.0000019457495,0.000023828705,0.000088307395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986917,0.00004039768,0.00022060644,0.00048160928,0.00024103548,0.0003246522],"domain_scores_gemma":[0.9989414,0.00025382888,0.00020089702,0.0002302846,0.0002744457,0.0000991167],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00021603935,0.00019275497,0.00018397538,0.0001479157,0.0027325936,0.00076161895,0.00031204574,0.00008140492,0.0000058404958],"category_scores_gemma":[0.000013105485,0.00020096704,0.00013352255,0.00014567352,0.00012634168,0.0011535556,0.000002592733,0.00023384322,0.000012221596],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115868934,0.00009514439,0.0000059195854,0.000027588927,0.000030155501,0.000012471784,0.00025649308,0.0011383895,0.007077626,0.00006951427,0.000010245025,0.9911606],"study_design_scores_gemma":[0.0013873731,0.00033648044,0.00091472396,0.00031903657,0.00007118494,0.000091446054,0.00009386678,0.73324335,0.260084,0.0028477323,0.00014894994,0.0004618495],"about_ca_topic_score_codex":0.0000118940325,"about_ca_topic_score_gemma":0.000053751362,"teacher_disagreement_score":0.99069875,"about_ca_system_score_codex":0.00008401088,"about_ca_system_score_gemma":0.00010678524,"threshold_uncertainty_score":0.99856573},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058421507,0.0012595296,0.93434405,0.000089180765,0.00076123385,0.0015263486,0.00024670816,0.0013831437,0.0019683212],"genre_scores_gemma":[0.93757355,0.00012024607,0.060785774,0.00017927706,0.00040452645,0.00008355971,0.00011594905,0.00029830798,0.0004388373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947912,0.00016613005,0.0017397933,0.0010310179,0.0011078989,0.001163948],"domain_scores_gemma":[0.9958602,0.00061066577,0.0006393987,0.0007476237,0.0016827828,0.00045930163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000688724,0.0011220503,0.001342479,0.00093205407,0.00071723544,0.00038800438,0.0005219405,0.0006469293,0.000051893734],"category_scores_gemma":[0.00004593779,0.0011442582,0.0005700394,0.0011660936,0.00023846226,0.0014803117,0.000016883878,0.0007921285,0.000037698414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007125363,0.00036207755,0.0000016805394,0.00035292376,0.00041188998,0.0000380708,0.0017230812,0.47820413,0.42829394,0.00008174149,0.0013286404,0.08848928],"study_design_scores_gemma":[0.0015797439,0.00044883648,0.0000055325595,0.0009846429,0.00026724278,0.00006066542,0.00010941677,0.56381154,0.42721826,0.0012476358,0.0034215713,0.0008449414],"about_ca_topic_score_codex":0.000024482195,"about_ca_topic_score_gemma":0.00006941659,"teacher_disagreement_score":0.879152,"about_ca_system_score_codex":0.00042489835,"about_ca_system_score_gemma":0.00035436286,"threshold_uncertainty_score":0.99910074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006143514,0.00036495778,0.99675477,0.0005225438,0.00054792047,0.0006169464,0.0000024192086,0.0002685164,0.000307553],"genre_scores_gemma":[0.9238352,0.00018412533,0.074670054,0.00038162209,0.00040199325,0.00018453451,0.000001585904,0.000038570033,0.00030232666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979761,0.00014249285,0.00038342678,0.0006251604,0.00028012166,0.0005926971],"domain_scores_gemma":[0.9975948,0.0004504528,0.00036267174,0.0010093639,0.00041274284,0.00017000544],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008295738,0.00032303506,0.00031993192,0.000099677585,0.005349901,0.0035695347,0.0024100926,0.00013647626,0.000030913507],"category_scores_gemma":[0.000010994963,0.00028029527,0.00012018264,0.00035594273,0.0002137657,0.002269275,0.000025582573,0.0005192513,0.000006679083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016344007,0.00006853928,0.00006684786,0.000020633177,0.000037863785,0.0000037377376,0.00020707298,0.6939834,0.00019324593,0.00022107562,0.00016045045,0.3048737],"study_design_scores_gemma":[0.0012336397,0.00016325644,0.00026574996,0.00035757004,0.000031998963,0.000015872753,0.0000075493404,0.9913747,0.005071041,0.0001596354,0.00089602475,0.00042298035],"about_ca_topic_score_codex":0.000005090744,"about_ca_topic_score_gemma":0.00003097264,"teacher_disagreement_score":0.9232208,"about_ca_system_score_codex":0.00009610526,"about_ca_system_score_gemma":0.00019236059,"threshold_uncertainty_score":0.9999649},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02607903,0.0004855201,0.9714764,0.00003871362,0.00026893383,0.00013286628,0.000005148163,0.0006466502,0.0008667575],"genre_scores_gemma":[0.97083503,0.00014277102,0.028116228,0.000060498114,0.00026791645,0.00011427657,0.0000028471597,0.00014411248,0.00031631076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977036,0.000095655014,0.00052998617,0.00044758833,0.00030498378,0.0009181966],"domain_scores_gemma":[0.99898946,0.00039116517,0.00012332415,0.000200039,0.000112795744,0.00018321098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002681419,0.00043385077,0.0003996982,0.00018546105,0.00033531064,0.00013620523,0.00021584568,0.00023634089,0.00004085689],"category_scores_gemma":[0.0000044562303,0.0003375702,0.000062992476,0.0012933349,0.00013798426,0.0007736295,0.000002098621,0.00049239513,0.0000036956274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012864824,0.000033336153,0.000094075614,0.000027642589,0.000042553813,0.00003309153,0.0001334169,0.87543756,0.0008797811,0.000034273173,0.000034548662,0.123121105],"study_design_scores_gemma":[0.0014606161,0.0001376683,0.00005715571,0.0027973629,0.00004412029,0.000037846083,0.00008007508,0.9841612,0.009746289,0.000022497561,0.00078512484,0.0006700478],"about_ca_topic_score_codex":0.000026121526,"about_ca_topic_score_gemma":0.00030145227,"teacher_disagreement_score":0.94475603,"about_ca_system_score_codex":0.00027890565,"about_ca_system_score_gemma":0.000106734624,"threshold_uncertainty_score":0.9999076},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028181385,0.00008504602,0.99763733,0.00053104525,0.0005182669,0.00029233616,0.000102732956,0.00049881707,0.000052602136],"genre_scores_gemma":[0.53760237,0.00000781355,0.46184728,0.00016446358,0.00005518945,0.00007042643,0.0000013110559,0.000025272868,0.00022587727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808943,0.000028106082,0.00040330342,0.0006687264,0.0003291932,0.00048125072],"domain_scores_gemma":[0.99886423,0.00020665211,0.00013471901,0.0003941101,0.00021733964,0.00018296814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026987694,0.0002658167,0.00024950574,0.00017638724,0.00061874994,0.00021403212,0.0005317064,0.00013987412,0.000025621497],"category_scores_gemma":[0.000007842621,0.00019234013,0.00016353812,0.00027015916,0.00007884425,0.0012472371,0.000005192745,0.00019590676,0.00004051214],"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.00009008861,0.0008001557,0.0000022157037,0.00008844259,0.00004056115,0.000006787767,0.0004849517,0.18308936,0.09557018,0.0012166604,0.00051228335,0.7180983],"study_design_scores_gemma":[0.00142287,0.00009473212,0.000006827816,0.00028979572,0.00001693861,0.000027013864,0.000016737342,0.9498351,0.046521813,0.00090969476,0.0005312159,0.000327239],"about_ca_topic_score_codex":0.000012099621,"about_ca_topic_score_gemma":0.0000061268115,"teacher_disagreement_score":0.76674575,"about_ca_system_score_codex":0.000068970716,"about_ca_system_score_gemma":0.00011599913,"threshold_uncertainty_score":0.78434026},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049697064,0.000046974583,0.9488788,0.00047953796,0.0001932262,0.000078760146,0.0000037477198,0.00028812687,0.0003337072],"genre_scores_gemma":[0.96800405,0.0000075555326,0.031452335,0.00022322794,0.00005896927,0.000019697447,4.3098635e-7,0.000017910654,0.00021585207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998639,0.000033870798,0.0001995884,0.0004220803,0.00031567283,0.0003898077],"domain_scores_gemma":[0.9989042,0.000040911822,0.00011072044,0.0007081915,0.0000781352,0.00015782753],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0001765263,0.00016488605,0.00014769346,0.000035527424,0.0016675312,0.0010533588,0.0007315818,0.000055611352,0.00006423982],"category_scores_gemma":[0.0000033549538,0.00013727866,0.000048292623,0.00016929422,0.000112942034,0.0015880256,0.000007916067,0.00025013118,0.000075826014],"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.00009183369,0.00019967437,0.00025881434,0.000034353227,0.000021669995,0.00005303245,0.00068944006,0.123527385,0.012162486,0.000107333515,0.000084449435,0.86276954],"study_design_scores_gemma":[0.00047048926,0.0001293992,0.00028847723,0.00014180868,0.000010816852,0.000028161992,0.000027655013,0.77947813,0.21877028,0.00013986698,0.0002991285,0.00021580102],"about_ca_topic_score_codex":0.000028557904,"about_ca_topic_score_gemma":0.000024733774,"teacher_disagreement_score":0.91830695,"about_ca_system_score_codex":0.000024945293,"about_ca_system_score_gemma":0.00005758692,"threshold_uncertainty_score":0.99998367},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027747115,0.0032814462,0.9593283,0.000050279916,0.0024812848,0.0004757706,0.00010742795,0.0014231779,0.0051052063],"genre_scores_gemma":[0.99596137,0.00012708126,0.0020809376,0.000094027426,0.0010014484,0.000106419946,0.000018922452,0.00028707556,0.00032273383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653083,0.000084926294,0.0009529106,0.0008984366,0.0007538486,0.0007790716],"domain_scores_gemma":[0.9986055,0.000077732824,0.00022898019,0.0005304986,0.00026716822,0.00029012247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041844897,0.0008977272,0.00084241695,0.0004934916,0.0006628501,0.00063999137,0.0005899058,0.00075617887,0.00020017807],"category_scores_gemma":[0.0000027401798,0.0009307221,0.0003896787,0.00043899697,0.00021687616,0.0003893501,0.0000073214915,0.0018452696,0.00020745506],"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.00017466057,0.00030455532,0.000012494207,0.007975413,0.00055285223,0.000116232455,0.0017163056,0.3812908,0.031277675,0.0000061785977,0.0046855025,0.5718873],"study_design_scores_gemma":[0.0012456401,0.000256362,0.000020459769,0.0073021166,0.00053833623,0.0001389377,0.00035536735,0.6201514,0.35723323,0.0012365709,0.008079657,0.0034419075],"about_ca_topic_score_codex":0.00004226794,"about_ca_topic_score_gemma":0.00003691533,"teacher_disagreement_score":0.9682142,"about_ca_system_score_codex":0.00035318287,"about_ca_system_score_gemma":0.00031801718,"threshold_uncertainty_score":0.9993143},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026333176,0.0013299673,0.9700141,0.001334894,0.00002255404,0.00026373693,0.000008003469,0.0004921512,0.0002014444],"genre_scores_gemma":[0.9176297,0.00083482766,0.08130724,0.00001985859,0.0000077458835,0.0001226903,0.0000016987622,0.00004071861,0.0000355241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908626,0.000024333658,0.00032407045,0.00019711781,0.00011880287,0.00024942978],"domain_scores_gemma":[0.9993276,0.00024418984,0.000040541454,0.00027006358,0.000057229296,0.000060400384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017926317,0.00018197653,0.00019017363,0.00023823297,0.00023796427,0.00006049865,0.00027160946,0.00030277044,0.00001824891],"category_scores_gemma":[0.0000049973323,0.0001473624,0.000049825634,0.0002605659,0.00009100452,0.00046567296,0.0000026160842,0.00045489607,0.0000034134466],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004698097,0.000062409774,0.000004197648,0.00014873827,0.000013801876,4.1117252e-7,0.0004609526,0.13711609,0.04421115,0.00007260064,0.000011780245,0.8178509],"study_design_scores_gemma":[0.0013520278,0.00012129973,0.00002244626,0.0013746499,0.000029319188,0.000009077141,0.00039992086,0.5967055,0.39702898,0.0006865529,0.0018561586,0.0004140755],"about_ca_topic_score_codex":0.0000019234249,"about_ca_topic_score_gemma":0.000009478679,"teacher_disagreement_score":0.8912965,"about_ca_system_score_codex":0.00009534632,"about_ca_system_score_gemma":0.000023324566,"threshold_uncertainty_score":0.6009264},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002410828,0.000061631334,0.9952434,0.00040659585,0.00068862666,0.00012953373,0.000017201875,0.0003691296,0.00067308726],"genre_scores_gemma":[0.8861948,0.000015572228,0.11238055,0.0002948305,0.00010540699,0.000020038555,0.0000011634498,0.000023346727,0.0009642403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983086,0.000050405517,0.00028286476,0.0005958321,0.00035362152,0.00040869796],"domain_scores_gemma":[0.9984765,0.00008803621,0.00019725757,0.0009519691,0.00012286025,0.00016339077],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00019231312,0.0002363671,0.00020582318,0.000121732126,0.0020960032,0.001163167,0.0012599141,0.000132127,0.00009272435],"category_scores_gemma":[0.000007334664,0.00021530125,0.00012335916,0.00012125231,0.0001346546,0.001254285,0.000009308356,0.00044788147,0.00021249417],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034343557,0.0002496634,0.000042213404,0.0000350003,0.000022235075,0.00006447288,0.00056503573,0.021017868,0.004758192,0.00006666041,0.00038666057,0.97275764],"study_design_scores_gemma":[0.0011756545,0.00008855894,0.00052904827,0.00026493223,0.000023914925,0.000064243395,0.000036046527,0.9418029,0.051505852,0.00016414968,0.0038104472,0.00053423055],"about_ca_topic_score_codex":0.00004592899,"about_ca_topic_score_gemma":0.000020111547,"teacher_disagreement_score":0.9722234,"about_ca_system_score_codex":0.000045596003,"about_ca_system_score_gemma":0.00007329101,"threshold_uncertainty_score":0.9998737},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002008102,0.000083995285,0.995806,0.0008069565,0.00027488335,0.00035938388,0.00003317403,0.00024404934,0.00038348677],"genre_scores_gemma":[0.991952,0.00001540425,0.007132681,0.00033977852,0.00027206188,0.000051058265,0.0000010127319,0.000027500499,0.00020851035],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983981,0.00004934962,0.00027883917,0.0005425487,0.00026432073,0.00046681325],"domain_scores_gemma":[0.99854004,0.00079763477,0.00010884977,0.0001444849,0.0002709845,0.00013803015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022148824,0.00022457683,0.0002085614,0.00016550146,0.0006041888,0.000278468,0.00023321825,0.00008609776,0.00003444192],"category_scores_gemma":[0.000014202224,0.00017310004,0.00015200801,0.00036771217,0.00009139589,0.0008519942,0.0000020855546,0.00015769205,0.000030138523],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060953305,0.00013965355,0.0000051760007,0.000018013892,0.00002974253,0.000010914477,0.00022611099,0.00016719582,0.032691423,0.0001101689,0.000042135234,0.9664985],"study_design_scores_gemma":[0.003965211,0.00096279563,0.00006298444,0.0011652556,0.00013631528,0.00016064347,0.00011680331,0.38294917,0.6051297,0.004072237,0.00039798816,0.0008808658],"about_ca_topic_score_codex":0.0000029864277,"about_ca_topic_score_gemma":0.000014693194,"teacher_disagreement_score":0.98994386,"about_ca_system_score_codex":0.0000988054,"about_ca_system_score_gemma":0.00021585399,"threshold_uncertainty_score":0.7058815},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021911414,0.00018908404,0.9744633,0.000095394964,0.00032999297,0.00084080384,0.000016089964,0.0017469602,0.00040699146],"genre_scores_gemma":[0.7218163,0.00001765576,0.2777754,0.000013652331,0.000053063653,0.00021613913,0.0000032269043,0.000084595245,0.000019973468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983379,0.00005883545,0.000401222,0.0004364791,0.00039814005,0.00036737855],"domain_scores_gemma":[0.9988816,0.0003432013,0.00019214154,0.00037555923,0.00015716408,0.00005032725],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034008196,0.00040870887,0.00044252252,0.00026210467,0.00019899152,0.000121812074,0.0003977399,0.0003595706,0.000012044166],"category_scores_gemma":[0.0000068140644,0.0003053202,0.00017195042,0.0004313854,0.00013641093,0.00012499918,0.0000062274935,0.0016467985,0.000004925107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003455583,0.00004532248,0.00000823341,0.0005357158,0.00007927388,0.0000013657316,0.000081082355,0.6292069,0.0010819401,0.0000014266641,0.000004514037,0.36891967],"study_design_scores_gemma":[0.00028077525,0.00011994878,0.000008445926,0.0011154396,0.00014349027,0.000004051368,0.00013500189,0.89432734,0.10343695,0.000027438931,0.00008978601,0.00031133054],"about_ca_topic_score_codex":0.000015178493,"about_ca_topic_score_gemma":0.000014377668,"teacher_disagreement_score":0.69990486,"about_ca_system_score_codex":0.00016968595,"about_ca_system_score_gemma":0.0000986724,"threshold_uncertainty_score":0.9999399},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075692656,0.0003126875,0.99057025,0.000011205262,0.00047189908,0.0005778247,0.000030469693,0.0003171375,0.00013928511],"genre_scores_gemma":[0.9641898,0.000006798003,0.035364516,0.000015154943,0.0001859347,0.00009732383,0.0000054486977,0.00007914,0.000055832574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888134,0.000034283807,0.00036081427,0.00029567885,0.00013938428,0.00028851142],"domain_scores_gemma":[0.9994113,0.00007793321,0.00010713387,0.00011246229,0.0002057591,0.000085414424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016606435,0.00025285993,0.000250992,0.00022424241,0.0005475094,0.0002240574,0.000058486316,0.00012663171,0.0000058065266],"category_scores_gemma":[0.0000047668195,0.00026682852,0.000043208714,0.0002762625,0.00008338239,0.00091458583,7.958015e-7,0.00014598477,0.0000040490454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000345909,0.000019250741,5.563972e-7,0.00038130442,0.000027843784,0.0000012506619,0.0012898444,0.9576596,0.019469008,0.0000075984008,0.000006341127,0.021102833],"study_design_scores_gemma":[0.00044457283,0.00007932486,0.000001123391,0.0006981931,0.00006159206,0.000032274158,0.00040365598,0.947856,0.050044496,0.00008574658,0.00002532672,0.00026768656],"about_ca_topic_score_codex":0.0000074746235,"about_ca_topic_score_gemma":0.0000062444433,"teacher_disagreement_score":0.9566206,"about_ca_system_score_codex":0.00016785279,"about_ca_system_score_gemma":0.000035545258,"threshold_uncertainty_score":0.99997836},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050321836,0.000026507489,0.94772375,0.0000789296,0.00010820196,0.00022720256,0.000058478247,0.00079821335,0.0006568849],"genre_scores_gemma":[0.9941139,0.000014473803,0.005323308,0.00008938967,0.00008170312,0.00010219048,0.000005945869,0.000068474685,0.00020056318],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990441,0.000013259161,0.00020599735,0.00024499767,0.00020844159,0.00028320047],"domain_scores_gemma":[0.99956,0.00010538554,0.000052002426,0.0001244774,0.00008822467,0.0000698975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010539736,0.00020614044,0.00018056345,0.00015605467,0.00019897195,0.00009542147,0.000110391455,0.00009024335,0.00016077765],"category_scores_gemma":[0.0000010146201,0.00015211469,0.0000853372,0.00012559397,0.00004443894,0.00050626544,5.939091e-7,0.00014434881,0.00001693473],"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.00038142168,0.00008744674,0.000006498664,0.00012573418,0.00011744278,0.0000206296,0.00017408666,0.05034735,0.2723542,0.000034965193,0.00079018075,0.67556006],"study_design_scores_gemma":[0.0012847717,0.00069407496,0.00006514916,0.0014860586,0.00014022295,0.00014651741,0.000075953845,0.018257365,0.9716278,0.0035339992,0.0019501201,0.0007380057],"about_ca_topic_score_codex":0.0000023147484,"about_ca_topic_score_gemma":0.000009696387,"teacher_disagreement_score":0.9437921,"about_ca_system_score_codex":0.000082607105,"about_ca_system_score_gemma":0.00005638707,"threshold_uncertainty_score":0.6203057},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023554876,0.0002669645,0.9750274,0.00005485434,0.000116533,0.0005246042,0.00013525909,0.00017257125,0.00014697488],"genre_scores_gemma":[0.99058133,0.000028236353,0.00887703,0.000019933177,0.00010027856,0.0001629759,0.0000034172574,0.000102940874,0.00012384926],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99803925,0.000048935664,0.0007267522,0.0003602995,0.00036026162,0.0004644908],"domain_scores_gemma":[0.9990432,0.00027703823,0.00017994644,0.00016821169,0.0001930365,0.00013852213],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031244522,0.00033971464,0.000488323,0.0003807259,0.00021770454,0.000090220376,0.00014161815,0.00016171794,0.000045376644],"category_scores_gemma":[0.000009910014,0.00025646706,0.00008249824,0.00051429216,0.000089252695,0.00051068625,7.4146703e-7,0.00020976327,0.0000056239573],"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.00026017157,0.00015796143,0.000020063686,0.00071409676,0.000050234346,0.000005067949,0.00031859978,0.052715793,0.66540956,0.000012209225,0.000009683467,0.28032655],"study_design_scores_gemma":[0.0032932572,0.00052642485,0.000072178525,0.0017667279,0.0001079946,0.000019202864,0.00012764438,0.19883914,0.7942017,0.0004135486,0.00010320847,0.00052896404],"about_ca_topic_score_codex":0.000028855146,"about_ca_topic_score_gemma":0.00025542467,"teacher_disagreement_score":0.9670265,"about_ca_system_score_codex":0.00015930405,"about_ca_system_score_gemma":0.0001480648,"threshold_uncertainty_score":0.99998873},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12993254,0.000019857127,0.8693127,0.00023597397,0.0000485827,0.0001722044,0.000035648318,0.00011973888,0.00012271995],"genre_scores_gemma":[0.9979814,0.0000044982094,0.0014000504,0.000041034975,0.0004100626,0.00011483686,0.000003289695,0.000021075757,0.000023746186],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987001,0.00010312726,0.00033405423,0.00035879452,0.0002184865,0.00028546283],"domain_scores_gemma":[0.99938184,0.00019299301,0.00013070651,0.00014435223,0.00008984877,0.000060270486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018802549,0.00019050943,0.00026106596,0.00018655659,0.00025183673,0.00003962808,0.00014477267,0.000097774995,0.00054103375],"category_scores_gemma":[0.0000029454634,0.00015325533,0.00013108733,0.00054167875,0.00007735387,0.00031991617,0.0000023942607,0.00039250724,0.0000104596775],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007451532,0.00029751685,0.00047383356,0.000014017157,0.000019245357,0.0000010351387,0.0006538314,0.000010485412,0.0022617665,0.000042664513,0.0000060634043,0.996145],"study_design_scores_gemma":[0.0069373487,0.0007602382,0.097439125,0.00735193,0.00095155387,0.00001196587,0.0037933362,0.09400856,0.40740988,0.3755391,0.0011793497,0.004617621],"about_ca_topic_score_codex":0.00007025232,"about_ca_topic_score_gemma":0.00030830302,"teacher_disagreement_score":0.9915274,"about_ca_system_score_codex":0.00007020617,"about_ca_system_score_gemma":0.000045838322,"threshold_uncertainty_score":0.6249571},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021428825,0.000029976185,0.9775193,0.00030162313,0.00010004127,0.00018002708,0.000023607296,0.0002486585,0.00016797984],"genre_scores_gemma":[0.8979577,7.954914e-7,0.10178721,0.000096632124,0.00002076638,0.00002438811,0.0000018501936,0.000015711475,0.000094947034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985784,0.000057506066,0.00036611388,0.000384761,0.00041601495,0.00019717657],"domain_scores_gemma":[0.9985692,0.00020611568,0.00043083262,0.0005271726,0.00018822121,0.00007844221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003334221,0.0001808243,0.00023626797,0.0001689337,0.00093204086,0.00079741987,0.00077151007,0.00010916365,0.000027237407],"category_scores_gemma":[0.00002217716,0.00017872534,0.000093123854,0.00014579087,0.00016710893,0.0018357172,0.000005971272,0.00024335555,0.000016167265],"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.000060223934,0.00029014723,0.000022562355,0.000047067624,0.000034835473,0.0000034750885,0.004711582,0.13938183,0.073119074,0.00015240745,0.00003927043,0.7821375],"study_design_scores_gemma":[0.0003764605,0.00007293346,0.00021815351,0.00019579158,0.000015263064,0.000002754839,0.000021731794,0.659529,0.3359719,0.0034147783,0.0000116209,0.00016963166],"about_ca_topic_score_codex":0.00015074557,"about_ca_topic_score_gemma":0.000033389144,"teacher_disagreement_score":0.87652886,"about_ca_system_score_codex":0.000041633506,"about_ca_system_score_gemma":0.00017872588,"threshold_uncertainty_score":0.7689538},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05471276,0.000016455526,0.9441751,0.00018753193,0.00013490237,0.00012915803,0.0000036823078,0.00024047396,0.000399938],"genre_scores_gemma":[0.9659776,0.0000057982834,0.03389108,0.00004629273,0.000019465013,0.00002334244,4.539319e-7,0.000010452732,0.000025522755],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990638,0.000037035006,0.00023043493,0.00025486483,0.00025151286,0.0001623379],"domain_scores_gemma":[0.99915594,0.000037389,0.00022889423,0.00039309464,0.00014297423,0.00004168199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024423428,0.00011310363,0.00013125873,0.00014008147,0.00067322265,0.00024850777,0.00057259406,0.000050094633,0.000022564845],"category_scores_gemma":[0.000002076403,0.00011611988,0.00006351357,0.000110317145,0.00006891632,0.0012184496,0.000003704301,0.00014549533,0.000006401413],"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.000015740614,0.00009637292,0.00025612142,0.00005228055,0.000012884072,0.0000040393816,0.001095903,0.0005401864,0.073132955,0.00024233089,0.000027818822,0.92452335],"study_design_scores_gemma":[0.00023212399,0.00017265404,0.0008899696,0.00014049973,0.000018299346,0.000015047784,0.00014205287,0.037005335,0.9601061,0.0011031374,0.000018887316,0.0001559029],"about_ca_topic_score_codex":0.00018196461,"about_ca_topic_score_gemma":0.000108662214,"teacher_disagreement_score":0.9243675,"about_ca_system_score_codex":0.000047996,"about_ca_system_score_gemma":0.000090075686,"threshold_uncertainty_score":0.51779526},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0148931965,0.00006720985,0.9838645,0.0002932422,0.0000879269,0.00025350708,0.0000038002265,0.00014192978,0.000394706],"genre_scores_gemma":[0.7367366,0.0000035131527,0.2629573,0.0001291802,0.00005102633,0.000034515364,5.2112233e-7,0.000016826476,0.000070510534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984897,0.00007746309,0.00031565595,0.0005359181,0.00030741794,0.0002738798],"domain_scores_gemma":[0.99877435,0.000026131247,0.00017767474,0.00070992927,0.00014936358,0.00016255413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005096928,0.00019663642,0.00024721381,0.00019534225,0.0008451035,0.00031159437,0.0009767631,0.0001095226,0.0000070846786],"category_scores_gemma":[0.000004320574,0.000188511,0.00009190481,0.00019291832,0.000054038483,0.0010917637,0.0000056004988,0.00022369214,0.000009343665],"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.00002449117,0.000087239045,1.0459097e-7,0.000030784606,0.0000074871805,0.0000010974501,0.00079049217,0.18838641,0.03261488,0.000051857824,0.0000019310191,0.7780032],"study_design_scores_gemma":[0.00019898528,0.000092998045,0.000003951568,0.00012218767,0.000016918319,0.0000073787414,0.000011329979,0.95558643,0.04296732,0.00077912176,0.00000728807,0.00020607252],"about_ca_topic_score_codex":0.000024965113,"about_ca_topic_score_gemma":0.0000058935084,"teacher_disagreement_score":0.77779716,"about_ca_system_score_codex":0.00003411614,"about_ca_system_score_gemma":0.00009908548,"threshold_uncertainty_score":0.7687256},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04000893,0.0005244901,0.9586335,0.00042276486,0.00010435652,0.0001396625,0.0000039181614,0.00007972518,0.00008267755],"genre_scores_gemma":[0.99410725,0.00034400102,0.005333719,0.000097026765,0.000033646982,0.000025582993,0.0000042659267,0.000011025677,0.000043473752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989912,0.00007569979,0.00024776236,0.00033040496,0.00014474856,0.00021020514],"domain_scores_gemma":[0.9992878,0.000094239214,0.0001445661,0.00026376653,0.000126518,0.00008314034],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00032890914,0.00015061202,0.00015303759,0.0001400526,0.0015118641,0.0006164373,0.0002988896,0.0000827091,0.000005720544],"category_scores_gemma":[0.000011860122,0.00015321004,0.000027660291,0.00019412323,0.00010938842,0.0012202774,0.000018487004,0.0003024084,9.41974e-7],"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.000061627754,0.00011665101,0.00013314659,0.000030141464,0.000017747756,0.0000045649767,0.0016355634,0.42154208,0.0022513582,0.00037565254,0.0000058055616,0.57382566],"study_design_scores_gemma":[0.00042960903,0.00009336328,0.0040372,0.0002071777,0.000008484589,0.000032229567,0.00005230824,0.99346966,0.001363229,0.00007503591,0.00003981619,0.00019189272],"about_ca_topic_score_codex":0.000020272226,"about_ca_topic_score_gemma":0.00007064604,"teacher_disagreement_score":0.95409834,"about_ca_system_score_codex":0.000065526656,"about_ca_system_score_gemma":0.00007085407,"threshold_uncertainty_score":0.99978805},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039863884,0.000102301485,0.9937209,0.00059876847,0.00022314966,0.00025638848,0.00001186275,0.00047134233,0.00062891626],"genre_scores_gemma":[0.9309876,0.000011847527,0.068465754,0.00010884439,0.000047345995,0.0000534244,9.162031e-7,0.00002080768,0.0003034382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883723,0.00002816796,0.00020967833,0.00045376254,0.00020246324,0.00026871057],"domain_scores_gemma":[0.9989699,0.00015068776,0.00024096588,0.000379886,0.00017235985,0.00008621555],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00028402248,0.00017945272,0.00017704371,0.0001534265,0.0019656383,0.00097029033,0.0005994313,0.000091237824,0.0000053872895],"category_scores_gemma":[0.000014560898,0.00018301238,0.00006461214,0.00011652237,0.0001287181,0.0014551631,0.0000056394983,0.000200618,0.0000025150875],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059944457,0.00007618416,0.00020294126,0.00014040273,0.000018504372,0.0000027807419,0.0010080328,0.0033787964,0.01661724,0.00027296325,0.00007355894,0.97814864],"study_design_scores_gemma":[0.0004785861,0.00020260281,0.00016714228,0.00027829196,0.000031074866,0.000016973794,0.00008640621,0.63868773,0.35632432,0.003055464,0.00029035966,0.0003810189],"about_ca_topic_score_codex":0.00012070079,"about_ca_topic_score_gemma":0.00014949124,"teacher_disagreement_score":0.97776765,"about_ca_system_score_codex":0.000063164836,"about_ca_system_score_gemma":0.000110034984,"threshold_uncertainty_score":0.9993337},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018323646,0.00006564212,0.9950231,0.000044971814,0.00023412194,0.00043519275,0.000025403684,0.00048119805,0.0018580473],"genre_scores_gemma":[0.92834884,0.000009530947,0.07123448,0.00002519563,0.000046584533,0.00005616172,0.000002555451,0.00008642479,0.00019022514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862593,0.000038017864,0.00032793678,0.00037546217,0.0002330593,0.00039961294],"domain_scores_gemma":[0.99909276,0.00005024987,0.00014331909,0.00039386924,0.00018314944,0.00013662966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016510482,0.0003337783,0.00029764947,0.0001299934,0.00089458725,0.00030921577,0.00028109393,0.0001449043,0.0003503778],"category_scores_gemma":[0.000004465377,0.00030784015,0.00006866358,0.000104929495,0.00034414715,0.00096949685,0.000001203132,0.00040181555,0.000055956898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085094165,0.00007652811,0.0000079056135,0.0001592939,0.000045357927,0.000010501033,0.000415572,0.96266454,0.009901944,0.0000036201593,0.000015543119,0.026614074],"study_design_scores_gemma":[0.0014553813,0.00017296211,0.0000709772,0.0009384422,0.000091732036,0.000118319665,0.00031827984,0.92716455,0.068709545,0.00011584136,0.00003868602,0.00080530497],"about_ca_topic_score_codex":0.0000061829064,"about_ca_topic_score_gemma":0.000021806602,"teacher_disagreement_score":0.9265165,"about_ca_system_score_codex":0.00012899212,"about_ca_system_score_gemma":0.000086496715,"threshold_uncertainty_score":0.99993736},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06393057,0.000019989415,0.9337775,0.00006264415,0.00035104906,0.00036598326,0.000032197448,0.0005676993,0.0008923332],"genre_scores_gemma":[0.996112,0.000011629592,0.0028862562,0.00006113716,0.00021941325,0.000107121545,0.000020224945,0.000093960225,0.0004882834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987622,0.00005567859,0.0002907221,0.00036033604,0.00018135393,0.00034970383],"domain_scores_gemma":[0.9992599,0.000047077214,0.00012863752,0.00018750012,0.00027548583,0.00010138516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012743576,0.00029513426,0.00025622995,0.00018765853,0.00066594663,0.0000992846,0.000106103726,0.00012880177,0.00015855367],"category_scores_gemma":[0.0000033258896,0.00028227284,0.00004452574,0.0005493674,0.00011194242,0.0010666781,0.0000012025401,0.00027021085,0.00005570088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017729025,0.00008618832,0.000009290548,0.00014248933,0.0000647282,0.0000064050805,0.0008825161,0.79708076,0.17545372,0.000012914907,0.000023324039,0.026060363],"study_design_scores_gemma":[0.000779214,0.00038090663,0.000038849084,0.00043873745,0.00006905394,0.000015896241,0.00018570203,0.5308309,0.46620992,0.00003788227,0.0005287052,0.00048419577],"about_ca_topic_score_codex":0.0000036043414,"about_ca_topic_score_gemma":0.000020057181,"teacher_disagreement_score":0.9321814,"about_ca_system_score_codex":0.00017343368,"about_ca_system_score_gemma":0.00006891793,"threshold_uncertainty_score":0.9999629},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06770187,0.000035388694,0.93086225,0.000030896485,0.0002124723,0.00035001477,0.000011086588,0.00044368574,0.00035236008],"genre_scores_gemma":[0.99553156,0.000007010085,0.004124931,0.000018801435,0.00011290478,0.000106532396,0.0000015179569,0.00006144509,0.000035322126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898493,0.000046555462,0.00018773874,0.00034185607,0.00017763276,0.00026127603],"domain_scores_gemma":[0.99938375,0.00007949498,0.00010683467,0.00013073732,0.00020410558,0.000095073694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000107358406,0.00025956114,0.00021514721,0.0001860303,0.00046920494,0.00009161468,0.000054198492,0.00013156662,0.00001900274],"category_scores_gemma":[0.000005039037,0.0002551705,0.000029365352,0.0004217892,0.00011774558,0.0010683277,7.363595e-7,0.00026530446,0.000015150568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014070474,0.00003948818,0.0000024059113,0.00017103936,0.00003753893,0.0000025896702,0.0005178019,0.80673987,0.03047864,0.0000017029405,0.0000027034907,0.16186553],"study_design_scores_gemma":[0.00038610966,0.00018229468,0.000032362543,0.00020094418,0.000045008455,0.000021911852,0.00016798495,0.69698066,0.30170423,0.000038207698,0.000011428869,0.00022887667],"about_ca_topic_score_codex":0.0000147684905,"about_ca_topic_score_gemma":0.00014657286,"teacher_disagreement_score":0.9278297,"about_ca_system_score_codex":0.00018605727,"about_ca_system_score_gemma":0.000037263246,"threshold_uncertainty_score":0.99999005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070163067,0.00019360999,0.9914175,0.00003739221,0.0002450083,0.0005873984,0.000009057109,0.00040007208,0.00009364425],"genre_scores_gemma":[0.75544924,0.000028105787,0.24421524,0.000008752739,0.00009223298,0.000044270375,0.0000021975252,0.00006805931,0.00009191868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989252,0.000021304526,0.00031539833,0.00029727013,0.00012514784,0.0003156892],"domain_scores_gemma":[0.99942815,0.000064860185,0.0001255332,0.00017503668,0.00010802117,0.000098410914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022042953,0.00024293087,0.0002576805,0.00017811316,0.0011489439,0.00024817834,0.00010709584,0.00014392372,0.000007771979],"category_scores_gemma":[0.000011836255,0.00026491,0.00006684788,0.00009473675,0.00004658233,0.000973641,8.894993e-7,0.0002350368,0.0000031080165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000774239,0.000014270982,0.0000011728581,0.00015626667,0.000027197599,9.115969e-7,0.00028401043,0.8311475,0.026308103,9.033523e-7,0.000010235623,0.14197202],"study_design_scores_gemma":[0.0007499048,0.00012204951,0.00000943264,0.00028420248,0.00005327689,0.000036690162,0.00007665307,0.89185685,0.106423005,0.000048362203,0.00007952,0.00026003018],"about_ca_topic_score_codex":0.00001555764,"about_ca_topic_score_gemma":0.000022772845,"teacher_disagreement_score":0.74843293,"about_ca_system_score_codex":0.00015958602,"about_ca_system_score_gemma":0.000038376525,"threshold_uncertainty_score":0.99998033},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020189272,0.00023535764,0.97786665,0.00035986133,0.00008793551,0.0004464094,0.00003193108,0.0003214856,0.00046110168],"genre_scores_gemma":[0.996823,0.0001335454,0.0026339733,0.00005824087,0.000054643413,0.00015779756,0.00000151245,0.00005389137,0.00008337579],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991611,0.000024146864,0.00019846183,0.00021539886,0.00017619204,0.00022467738],"domain_scores_gemma":[0.9990716,0.0002708666,0.000094718875,0.0003896563,0.00011175291,0.00006142366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021328073,0.00020869555,0.00018914073,0.00009168532,0.0012506184,0.00038073538,0.0003709603,0.00008071164,0.000035580404],"category_scores_gemma":[0.0000069553034,0.00016282803,0.000056724122,0.000045794808,0.0003533158,0.00037185705,0.0000029833507,0.00037933994,0.0000037071295],"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.00067939586,0.00030822042,0.000025354995,0.0008116054,0.00051391934,0.00000960172,0.006935396,0.07908509,0.061429646,0.0005990242,0.0001754225,0.84942734],"study_design_scores_gemma":[0.0022193303,0.00027897896,0.00007302225,0.0012705501,0.00020530136,0.000086357155,0.0011307864,0.77708286,0.21574403,0.0003893272,0.0008355777,0.0006838472],"about_ca_topic_score_codex":0.00001618236,"about_ca_topic_score_gemma":0.00004114766,"teacher_disagreement_score":0.9766337,"about_ca_system_score_codex":0.000030448673,"about_ca_system_score_gemma":0.000030257179,"threshold_uncertainty_score":0.9618872},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03661363,0.000018067634,0.9623416,0.00014186984,0.00010633038,0.0000758421,7.870595e-7,0.00033088378,0.00037098653],"genre_scores_gemma":[0.96330714,0.000001937487,0.03628864,0.00004187885,0.000041246654,0.000013013571,8.4640334e-7,0.000013674868,0.00029162897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878645,0.00017230008,0.00022268039,0.00032310418,0.00027117156,0.00022427432],"domain_scores_gemma":[0.9989041,0.0005674572,0.00018232276,0.00015257577,0.00013707104,0.000056444114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030245597,0.00014988372,0.00017700988,0.00017912834,0.00046295888,0.00009093176,0.0003201518,0.00007193588,0.000012301102],"category_scores_gemma":[0.00007667998,0.00014011383,0.000074474345,0.00035769312,0.00007855044,0.00044410353,0.0000042046063,0.00042684303,0.00001222312],"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.000016586706,0.00006548663,0.00017884564,0.000028797622,0.000006538226,4.4568156e-7,0.00091252924,0.27284923,0.0049958504,0.000028602999,0.0000014393787,0.7209157],"study_design_scores_gemma":[0.00040218083,0.00019719938,0.00036361322,0.000074539894,0.000008283296,0.0000071309373,0.00017024639,0.8964004,0.10178994,0.00016170635,0.00027792918,0.00014684226],"about_ca_topic_score_codex":0.00006553581,"about_ca_topic_score_gemma":0.0000066856173,"teacher_disagreement_score":0.9266935,"about_ca_system_score_codex":0.000031742646,"about_ca_system_score_gemma":0.00004531134,"threshold_uncertainty_score":0.5713676},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002025412,0.000058185804,0.9954788,0.00036251327,0.00023876817,0.00027829237,0.0000048557254,0.0008222145,0.00073093554],"genre_scores_gemma":[0.8635565,0.0000024782034,0.1357214,0.00027590408,0.000062869745,0.0000910003,0.0000011041078,0.000025383872,0.0002633317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985394,0.00007364681,0.00027976534,0.00048801993,0.00027722042,0.00034197074],"domain_scores_gemma":[0.99886817,0.00035199308,0.0001565581,0.0002856697,0.0002489386,0.00008864999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047799308,0.00019714567,0.00020208253,0.0002177946,0.0006251104,0.00030089976,0.00049312174,0.00010689495,0.000015230992],"category_scores_gemma":[0.00001492761,0.00019651811,0.000099801946,0.00045745735,0.000049062663,0.0008695829,0.0000026184332,0.00022368356,0.000015268884],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060200746,0.00016801084,0.00005096156,0.00015681754,0.000019361054,0.000001038388,0.00077117677,0.024286808,0.023233432,0.0006701938,0.00026086296,0.95032114],"study_design_scores_gemma":[0.00027871164,0.00017561954,0.000013597015,0.00015358279,0.000017801283,0.000007439895,0.000017981292,0.7699801,0.22475058,0.0034730884,0.00088111707,0.00025038494],"about_ca_topic_score_codex":0.000037354897,"about_ca_topic_score_gemma":0.000058090005,"teacher_disagreement_score":0.95007074,"about_ca_system_score_codex":0.00009258077,"about_ca_system_score_gemma":0.00011501408,"threshold_uncertainty_score":0.8013776},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02507699,0.00021633528,0.9724591,0.00007752617,0.00051073683,0.00021121577,0.000029856974,0.00073678844,0.00068147894],"genre_scores_gemma":[0.98993826,0.000018988523,0.00868424,0.00016514322,0.00043453588,0.00011741131,0.000009876276,0.00022578618,0.00040578324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979245,0.000042380554,0.00050838426,0.00050244643,0.00030168955,0.00072061986],"domain_scores_gemma":[0.99854565,0.00025242346,0.00026080475,0.00051200064,0.00021478193,0.00021432406],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00026456724,0.00048458832,0.0004952939,0.00014493224,0.0013785351,0.000515154,0.00041189493,0.00022911736,0.000020611436],"category_scores_gemma":[0.000009164053,0.00045188912,0.0001496772,0.00016323691,0.0002007036,0.0006964295,0.000002393158,0.0006683265,0.0000021643505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010323203,0.000092433496,0.000014599299,0.00007042645,0.000099773264,0.000016222251,0.000060047296,0.86292976,0.0024181684,0.000035700155,0.000033355547,0.1341263],"study_design_scores_gemma":[0.0020694651,0.00017813634,0.00008479923,0.0010301803,0.00011723397,0.000040065435,0.00004117377,0.9869681,0.008619852,0.000025173687,0.00023929549,0.0005865305],"about_ca_topic_score_codex":0.00006553083,"about_ca_topic_score_gemma":0.00035374082,"teacher_disagreement_score":0.9648613,"about_ca_system_score_codex":0.00012766183,"about_ca_system_score_gemma":0.000079138095,"threshold_uncertainty_score":0.99992156},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37667733,0.00017257589,0.62223446,0.00004013314,0.00014228036,0.00008898628,0.0000109106495,0.00033441404,0.00029892303],"genre_scores_gemma":[0.993001,0.000056582463,0.0064128954,0.000053464075,0.000118524906,0.00010606597,0.0000028032823,0.00007801824,0.00017067547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880284,0.000025728486,0.00031325608,0.00028896052,0.00017126347,0.00039793685],"domain_scores_gemma":[0.99926984,0.00017757952,0.000049922757,0.0002608276,0.00013614693,0.00010566476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012939757,0.00024854508,0.00021262198,0.00020296696,0.0007556577,0.00012636345,0.0002380551,0.00010598039,0.00003538423],"category_scores_gemma":[0.0000031617171,0.00025706654,0.00007713619,0.0003602172,0.00022849298,0.0003691806,0.000002430603,0.00025845182,0.0000111307245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053264288,0.00013390576,0.000008038056,0.00017607307,0.000047820933,0.0000016321859,0.0016653873,0.5385784,0.21776612,0.00016711609,0.000028731956,0.24137351],"study_design_scores_gemma":[0.0004883733,0.00008104807,0.000026909009,0.0001637151,0.00003191167,0.0000121543235,0.00020161601,0.7644361,0.2341028,0.000026683643,0.0001657406,0.0002629444],"about_ca_topic_score_codex":0.0000277124,"about_ca_topic_score_gemma":0.00012780327,"teacher_disagreement_score":0.61632365,"about_ca_system_score_codex":0.00009392257,"about_ca_system_score_gemma":0.000043598913,"threshold_uncertainty_score":0.99998814},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15014336,0.000021019503,0.84766835,0.000022483777,0.00030982573,0.0002425166,0.000010339605,0.0009687841,0.0006133298],"genre_scores_gemma":[0.9972408,0.0000040029718,0.0023220794,0.00004432102,0.00021527028,0.00008198505,4.7221693e-7,0.000051661114,0.000039447583],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99917346,0.000025520474,0.00013824213,0.0002571933,0.00013486849,0.00027068786],"domain_scores_gemma":[0.99948996,0.00009004422,0.000045621717,0.00014974539,0.0001597115,0.00006489297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009738021,0.00019937514,0.00017906206,0.00015004439,0.00039498453,0.00007436103,0.00008718623,0.00012773919,0.000030123365],"category_scores_gemma":[0.000003111801,0.00020932555,0.00009576031,0.00022287173,0.0000930396,0.00031044145,5.156921e-7,0.00022839232,0.000017444601],"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.000131086,0.000064294436,0.0000013366091,0.000038519047,0.00003655528,0.0000017355184,0.00014931952,0.017947733,0.4265722,0.000003609995,0.00008023896,0.55497336],"study_design_scores_gemma":[0.00019399168,0.000172562,0.000025395106,0.00006570028,0.00003067443,0.000006863753,0.000024398068,0.29570043,0.70302296,0.0002703589,0.0003090745,0.00017760361],"about_ca_topic_score_codex":0.000011212672,"about_ca_topic_score_gemma":0.000052130654,"teacher_disagreement_score":0.8470974,"about_ca_system_score_codex":0.000102622944,"about_ca_system_score_gemma":0.000027016207,"threshold_uncertainty_score":0.8536048},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011872787,0.0005045412,0.99663275,0.000028143948,0.00030840046,0.0006219601,0.000021477957,0.00037597836,0.00031949172],"genre_scores_gemma":[0.9777318,0.000014595702,0.021744873,0.00002815808,0.00012356078,0.0002146445,0.0000059900617,0.000055106233,0.00008123736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909484,0.000024685849,0.00032007557,0.00019389266,0.0001311034,0.00023542116],"domain_scores_gemma":[0.99936163,0.00012301798,0.00008665314,0.00013911213,0.00022075254,0.00006880097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020786103,0.00017182057,0.0001803178,0.00013797099,0.00055309554,0.00013226792,0.00007976763,0.00010493717,0.000012664461],"category_scores_gemma":[0.000004209034,0.00018291642,0.000040567422,0.00017372979,0.000081611484,0.00065316854,5.6933214e-7,0.0001701012,0.000007240044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010183784,0.000052120384,0.000006526617,0.00026050775,0.00006946444,3.5560922e-7,0.0006849422,0.9052906,0.0041557355,0.00008173074,0.0000646895,0.08923148],"study_design_scores_gemma":[0.00091145816,0.00013662945,0.0000035491069,0.00039911785,0.000055030127,0.00003116863,0.000538739,0.9883136,0.0038790246,0.00005518324,0.0054006698,0.0002758369],"about_ca_topic_score_codex":0.000004548155,"about_ca_topic_score_gemma":0.0000070374763,"teacher_disagreement_score":0.97654456,"about_ca_system_score_codex":0.00010519028,"about_ca_system_score_gemma":0.000026926537,"threshold_uncertainty_score":0.74591154},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025076631,0.00043623848,0.97182864,0.000060652386,0.00073826854,0.00069290015,0.00001121633,0.0007341025,0.000421343],"genre_scores_gemma":[0.9785184,0.0000096346475,0.019989882,0.000019529576,0.00058020465,0.0005377744,0.000011907158,0.00010484687,0.0002277764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816376,0.0000672868,0.0005151497,0.00032605088,0.00042601803,0.0005017081],"domain_scores_gemma":[0.99884903,0.0002325673,0.00012808072,0.00030805686,0.00035894912,0.00012332831],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007350601,0.00025667227,0.00026255788,0.0003164879,0.0016601784,0.0003103933,0.00028858584,0.00018372906,0.000046767535],"category_scores_gemma":[0.000007567814,0.00027923245,0.00010907809,0.00044340195,0.00010926192,0.00055922277,0.0000030970348,0.00054603105,0.000065967106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011373224,0.00015556891,0.000015044772,0.0008538085,0.00016721139,0.0000016231874,0.001420855,0.68692535,0.019975333,0.000068680885,0.00017237091,0.2901304],"study_design_scores_gemma":[0.0004909725,0.00014657115,0.0000058958663,0.00097060547,0.000043612174,0.000045009627,0.00035255434,0.9672015,0.019853905,0.00012607717,0.010390679,0.0003726361],"about_ca_topic_score_codex":0.000043432305,"about_ca_topic_score_gemma":0.000021598773,"teacher_disagreement_score":0.9534418,"about_ca_system_score_codex":0.00027033905,"about_ca_system_score_gemma":0.00008728895,"threshold_uncertainty_score":0.99996597},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22680405,0.000016697371,0.7709214,0.0005065757,0.00008825476,0.00017533102,0.000008751842,0.00026199355,0.001216927],"genre_scores_gemma":[0.99456453,0.000001530902,0.0044071837,0.00024219968,0.00021405147,0.000061827704,0.0000021555559,0.00003029092,0.00047623404],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99884975,0.00008825924,0.00026402637,0.000259353,0.00033008895,0.00020849954],"domain_scores_gemma":[0.9993185,0.00015796251,0.000110161636,0.00017256335,0.00016595087,0.00007489991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001780944,0.00014713535,0.00013365969,0.000068000256,0.0011131333,0.000098822675,0.00016263631,0.0000671139,0.0006353267],"category_scores_gemma":[0.0000065409567,0.00011700117,0.000082436716,0.00026374112,0.00014587921,0.0001470325,0.0000011073653,0.0003138301,0.00027772668],"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.00068886095,0.0024939284,0.0002901662,0.0001277491,0.00043226162,0.000012707849,0.011388667,0.013063488,0.38093668,0.0006183125,0.0037013688,0.58624583],"study_design_scores_gemma":[0.002692168,0.0009399653,0.000704348,0.0006484226,0.00071034336,0.000041967825,0.0030054606,0.16376916,0.7892778,0.026192984,0.010687939,0.0013294747],"about_ca_topic_score_codex":0.000015195949,"about_ca_topic_score_gemma":0.00001123729,"teacher_disagreement_score":0.76776046,"about_ca_system_score_codex":0.000043850556,"about_ca_system_score_gemma":0.000041171195,"threshold_uncertainty_score":0.85614336},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39225793,0.000011865089,0.6075134,0.000014559746,0.000056836376,0.000093801034,0.0000021929686,0.000028363556,0.000021043612],"genre_scores_gemma":[0.9865303,0.0000019123247,0.013420151,0.00001574313,0.000015412345,0.0000020885072,1.16142765e-7,0.00000930341,0.000004974726],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990017,0.00011047085,0.00033313563,0.00017206935,0.00029652196,0.000086112865],"domain_scores_gemma":[0.9988584,0.000047427468,0.00043303162,0.0002356306,0.00040133958,0.000024185545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018906218,0.00010241815,0.00015578742,0.00011272804,0.00024279169,0.000034075805,0.00023612706,0.00006818527,0.000010125543],"category_scores_gemma":[0.000009105047,0.00006952397,0.000051440704,0.0007487511,0.00037334807,0.00051057467,0.0000050683757,0.0001071326,1.0559745e-7],"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.00004116761,0.00011129688,0.00017895465,0.00024988744,0.000026364522,7.5416814e-8,0.004386145,0.040048495,0.774259,0.00022246223,9.2399273e-7,0.18047523],"study_design_scores_gemma":[0.00006935034,0.00006599039,0.0002026495,0.00013411426,0.00002222484,0.000010996087,0.00007220909,0.3223801,0.67565084,0.0013436672,0.0000022561358,0.000045594104],"about_ca_topic_score_codex":0.000114710034,"about_ca_topic_score_gemma":0.000061756225,"teacher_disagreement_score":0.5942724,"about_ca_system_score_codex":0.000022745402,"about_ca_system_score_gemma":0.0000830007,"threshold_uncertainty_score":0.2835105},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08894888,0.00019128877,0.91001207,0.000091625436,0.000027600801,0.0002884651,0.000016816333,0.0003791223,0.000044151406],"genre_scores_gemma":[0.952239,0.00004380393,0.047331914,0.000029822706,0.000028813072,0.0002725221,0.000002119132,0.000041933217,0.000010118429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993401,0.000012494547,0.00018131216,0.00019843031,0.00008272046,0.00018494173],"domain_scores_gemma":[0.9995886,0.000042464195,0.000047986552,0.000122656,0.00013076274,0.000067505214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008381459,0.00015655233,0.00014461167,0.00008609281,0.00036230797,0.000063812775,0.00005983594,0.00006390682,0.0000060931634],"category_scores_gemma":[0.000002597114,0.00015094574,0.000018639861,0.0001750625,0.00010409282,0.00048814577,0.0000014283835,0.00015870269,6.8592095e-7],"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.00021058023,0.000094577386,0.000040618917,0.00061875046,0.000108507506,0.0000014635632,0.0051954337,0.17519933,0.2755208,0.000093179835,0.000029885236,0.54288685],"study_design_scores_gemma":[0.00023774644,0.00015932223,0.000041539053,0.00019719343,0.00002360844,0.000007214432,0.0000607455,0.54952127,0.44888872,0.0007072572,0.000008854123,0.00014652734],"about_ca_topic_score_codex":0.000007908255,"about_ca_topic_score_gemma":0.00002966048,"teacher_disagreement_score":0.8632901,"about_ca_system_score_codex":0.00005399674,"about_ca_system_score_gemma":0.000020164287,"threshold_uncertainty_score":0.61553884},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1836848,0.000027153646,0.8144884,0.0003192941,0.0001201637,0.00047328416,0.000011917443,0.00016326956,0.0007116989],"genre_scores_gemma":[0.89750004,0.0000014628483,0.10065579,0.00072240643,0.00005001353,0.00005983506,0.0000017415421,0.00007157361,0.0009371529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808145,0.00013190217,0.0003376886,0.00052632025,0.00048942195,0.000433244],"domain_scores_gemma":[0.99892664,0.000119584285,0.00010516621,0.0003873604,0.0002001746,0.0002610989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041830915,0.00030654602,0.00035533056,0.00016468937,0.00025649817,0.000113217226,0.00016237766,0.00014651057,0.00012821658],"category_scores_gemma":[0.000006225185,0.00024186756,0.00012882882,0.0004763766,0.000045892888,0.00033801008,0.000002090813,0.0003554075,0.000004177299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002044086,0.00080203335,0.000024774796,0.00087962294,0.00008339002,0.000049450548,0.0021327531,0.59593576,0.26359007,0.0002449323,0.0002433847,0.13396974],"study_design_scores_gemma":[0.0012611187,0.0004343431,0.0000026504165,0.00064906105,0.00010656719,0.000016758988,0.00021979085,0.71544737,0.28047183,0.00082630775,0.00014212192,0.0004220395],"about_ca_topic_score_codex":0.000022583105,"about_ca_topic_score_gemma":0.000049605722,"teacher_disagreement_score":0.7138326,"about_ca_system_score_codex":0.00009602883,"about_ca_system_score_gemma":0.00019259981,"threshold_uncertainty_score":0.98630726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010994647,0.00001992081,0.98713815,0.00017660735,0.00011408378,0.00021575556,0.000007329119,0.00031468584,0.0010188328],"genre_scores_gemma":[0.9256237,0.0000011005383,0.074042365,0.00008255456,0.000026840207,0.000032406362,0.000001094962,0.000018562292,0.00017135726],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99834585,0.00011810875,0.00047429133,0.00031302994,0.0005465403,0.00020217511],"domain_scores_gemma":[0.99873453,0.00015802485,0.0003333321,0.00031777905,0.00039548954,0.000060852628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004479049,0.00017647941,0.00020099168,0.00014058505,0.00040473635,0.000106020634,0.00057456316,0.00008955568,0.0001359021],"category_scores_gemma":[0.000007827608,0.00014541364,0.00010185676,0.000790477,0.00029503825,0.000790248,0.000004358032,0.00019160582,0.00003265295],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005089037,0.0002897505,0.00001710106,0.000100006284,0.000036761863,4.190374e-7,0.0036106776,0.016609574,0.031875942,0.0003150771,0.0003862279,0.94670755],"study_design_scores_gemma":[0.00012475396,0.000116752744,0.00001268082,0.000105898514,0.000019942541,0.000013821962,0.000055838234,0.46354988,0.53438264,0.001435628,0.00007026016,0.00011187582],"about_ca_topic_score_codex":0.00007450586,"about_ca_topic_score_gemma":0.000006701717,"teacher_disagreement_score":0.94659567,"about_ca_system_score_codex":0.000057053432,"about_ca_system_score_gemma":0.0001408659,"threshold_uncertainty_score":0.5929796},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009161189,0.00049006706,0.98636687,0.00022443764,0.00087486004,0.0017699932,0.0006759495,0.00040877474,0.000027834349],"genre_scores_gemma":[0.9398617,0.000009239568,0.05910871,0.00012555854,0.00022849737,0.00039624522,0.000021473188,0.000050123057,0.00019842671],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648416,0.00020886488,0.0007100919,0.0011659018,0.00070587767,0.00072508736],"domain_scores_gemma":[0.9967188,0.0004041874,0.00045624963,0.0011290461,0.001069646,0.00022206585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006933662,0.0004834036,0.00054562,0.00025589153,0.0011990272,0.00081318105,0.0014647108,0.0001981627,0.000015279373],"category_scores_gemma":[0.000030588762,0.0004072797,0.00009581005,0.0012424232,0.00021235397,0.001011457,0.000011769282,0.00036837213,0.00006582806],"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.0066129547,0.004614625,0.00028127249,0.0036514988,0.0023596205,0.00018547801,0.014136497,0.44724274,0.014503159,0.0011043446,0.002227553,0.50308025],"study_design_scores_gemma":[0.002758573,0.0006826556,0.000035867874,0.0011622842,0.00009737235,0.000047227113,0.0003779076,0.98527527,0.007538616,0.000025331663,0.0014425882,0.00055632193],"about_ca_topic_score_codex":0.00004225663,"about_ca_topic_score_gemma":0.000044107215,"teacher_disagreement_score":0.93070054,"about_ca_system_score_codex":0.00020576791,"about_ca_system_score_gemma":0.0007108946,"threshold_uncertainty_score":0.99983793},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052736983,0.00008044357,0.945832,0.00005701275,0.00021185276,0.00021427391,0.000004696865,0.00041887182,0.00044383755],"genre_scores_gemma":[0.95477206,0.000001343891,0.04496754,0.000109682966,0.000016467951,0.000016926075,3.084741e-7,0.000019805668,0.00009587859],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985991,0.00007193018,0.0003202013,0.00040820855,0.0003395121,0.0002610472],"domain_scores_gemma":[0.99902755,0.00022911256,0.00018362392,0.00029936622,0.00019732874,0.00006301268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028203338,0.00019292225,0.00025295743,0.00034056412,0.00019971478,0.000133665,0.00050453824,0.00008131571,0.000031088097],"category_scores_gemma":[0.0000061969695,0.00018793035,0.0000982144,0.0006355821,0.00005480985,0.0008447981,0.0000046473665,0.00033077618,0.000032209406],"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.00013060105,0.0005640128,0.00023386662,0.00039332415,0.000085955275,0.000013950875,0.0103143025,0.084532335,0.33633482,0.00074882695,0.000038548096,0.56660944],"study_design_scores_gemma":[0.00030142508,0.00034866293,0.000028837207,0.0006109319,0.000019603076,0.00003121995,0.00015666852,0.5838427,0.41326404,0.0010504234,0.00001566842,0.000329867],"about_ca_topic_score_codex":0.0000201499,"about_ca_topic_score_gemma":0.000008689113,"teacher_disagreement_score":0.90203506,"about_ca_system_score_codex":0.000075760494,"about_ca_system_score_gemma":0.00013806368,"threshold_uncertainty_score":0.7663577},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010476139,0.0001109572,0.9872913,0.000008117214,0.0004115573,0.00036437775,0.0000050971194,0.000744767,0.0005876941],"genre_scores_gemma":[0.9209053,0.000009398543,0.077023156,0.000030649284,0.000036916113,0.000041039006,0.0000032008859,0.0000989013,0.0018514185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881023,0.000018778912,0.00035480916,0.00028093022,0.00019265905,0.00034260814],"domain_scores_gemma":[0.99953324,0.00004101237,0.0000667498,0.00020043497,0.000076045224,0.00008251442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013113022,0.0002468574,0.00025067478,0.00021283988,0.00020038249,0.00008051785,0.000127695,0.00013892307,0.00009440334],"category_scores_gemma":[0.0000015205562,0.0002605938,0.000086357504,0.0003607664,0.000022029819,0.00083491404,8.232162e-7,0.0003258162,0.00013807813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017014574,0.0000220565,0.000007751845,0.00017696866,0.000019281972,0.0000013851434,0.00028515147,0.83516663,0.13980578,0.0000043204464,0.0000052313067,0.024488427],"study_design_scores_gemma":[0.0008931498,0.000030923235,0.000004465552,0.00036043618,0.000026868489,0.0000158106,0.00016212517,0.8640694,0.13378537,0.000022865814,0.0002991708,0.0003293892],"about_ca_topic_score_codex":0.000004653089,"about_ca_topic_score_gemma":0.0000044230837,"teacher_disagreement_score":0.9104292,"about_ca_system_score_codex":0.00016734269,"about_ca_system_score_gemma":0.00003164493,"threshold_uncertainty_score":0.9999846},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024197832,0.00025219246,0.9737762,0.000023639857,0.0002722424,0.0006287811,0.000033230415,0.00031995997,0.000495915],"genre_scores_gemma":[0.98194736,0.000011719331,0.017513167,0.000029464154,0.0000523275,0.000079752834,0.000008353396,0.00007215794,0.0002856997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990574,0.000017604429,0.00026479986,0.00027602958,0.00012803779,0.00025610693],"domain_scores_gemma":[0.99954665,0.000102264916,0.000052480755,0.00012851425,0.0000829205,0.000087174936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000771312,0.00021034961,0.0002442838,0.00013719096,0.00018486916,0.000064912776,0.000079068406,0.00006733604,0.00004271075],"category_scores_gemma":[0.0000012944306,0.00021261054,0.00006533022,0.00012975612,0.000029161822,0.00048775418,8.68178e-7,0.00017575605,0.000020612215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005208099,0.00002106529,0.000006556583,0.00031988265,0.000020246516,8.700696e-7,0.0001970874,0.90724516,0.05286269,0.0000046786495,0.000029760366,0.039239913],"study_design_scores_gemma":[0.0011930959,0.00007285265,0.0000031987834,0.0003144669,0.000034165987,0.0000112471325,0.00019623767,0.78252876,0.21519724,0.00009815379,0.00010954704,0.00024106306],"about_ca_topic_score_codex":0.000003186502,"about_ca_topic_score_gemma":0.0000024487163,"teacher_disagreement_score":0.95774955,"about_ca_system_score_codex":0.00007204391,"about_ca_system_score_gemma":0.000021102811,"threshold_uncertainty_score":0.86700064},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070609637,0.00049638894,0.9900364,0.00004128786,0.00064013764,0.0008218995,0.000044005683,0.000609254,0.00024965237],"genre_scores_gemma":[0.96368796,0.000011349893,0.035401274,0.000010911016,0.00021465594,0.00034432893,0.000012883744,0.0001376247,0.00017903603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836856,0.000025536654,0.0004989712,0.00041004666,0.00023749843,0.00045938342],"domain_scores_gemma":[0.9989517,0.00005409501,0.0002810646,0.00031430222,0.00026612476,0.0001327644],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00017488592,0.00035485745,0.0003575764,0.00015681893,0.001921673,0.0009166281,0.0002848431,0.00014530828,0.000011489583],"category_scores_gemma":[0.0000044084845,0.00038638536,0.00012247922,0.0001131803,0.00009815016,0.0015575482,0.0000016938909,0.00028639485,0.000021556132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073572344,0.00004044102,0.0000030930366,0.00076721946,0.00003186931,0.000006314141,0.00017184435,0.9144832,0.015453725,0.0000030276922,0.000030207797,0.06893551],"study_design_scores_gemma":[0.0007336486,0.0000816952,0.000005166417,0.00062826014,0.00008596026,0.000059648748,0.00010243693,0.9464952,0.051186476,0.00004099057,0.00016874721,0.00041182226],"about_ca_topic_score_codex":0.000012103618,"about_ca_topic_score_gemma":0.0000036038032,"teacher_disagreement_score":0.95662695,"about_ca_system_score_codex":0.00025213498,"about_ca_system_score_gemma":0.00008195152,"threshold_uncertainty_score":0.9998588},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059376457,0.0003723305,0.9909188,0.00041690993,0.0001543053,0.00020134031,0.0000043053874,0.0016254989,0.00036886797],"genre_scores_gemma":[0.97926146,0.000023386132,0.019997435,0.00033872062,0.00022738925,0.000026113265,0.0000026448906,0.00007853243,0.000044313834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991133,0.000022399745,0.00016175587,0.00025884155,0.00015940257,0.00028430292],"domain_scores_gemma":[0.9996205,0.00006318264,0.000042203093,0.000085216205,0.00007959116,0.0001093288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000068290756,0.00022223189,0.00021021473,0.00010626828,0.00034590747,0.0001223312,0.000118378855,0.00012695752,0.000017867966],"category_scores_gemma":[0.000003687546,0.00023135677,0.00012885987,0.00030058078,0.00003316017,0.00021757104,8.8943483e-7,0.00053468475,0.00000859288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000919203,0.00002509335,0.0000028000845,0.0001610453,0.00005724023,0.000009921945,0.00084121205,0.6365547,0.11384796,0.000006678826,0.0013554017,0.247046],"study_design_scores_gemma":[0.00032472,0.0001617339,0.0000028356985,0.0002627335,0.00007036431,0.000015433885,0.00017222288,0.589714,0.403816,0.00022103325,0.0048934314,0.0003454745],"about_ca_topic_score_codex":0.0000016145025,"about_ca_topic_score_gemma":0.0000013916358,"teacher_disagreement_score":0.9733238,"about_ca_system_score_codex":0.00003893034,"about_ca_system_score_gemma":0.000022959646,"threshold_uncertainty_score":0.94344556},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063515455,0.00015049295,0.93412113,0.00004944189,0.00012092903,0.000095642594,0.0000073152623,0.00050524354,0.0014343378],"genre_scores_gemma":[0.9957812,0.000025385425,0.004026482,0.000034113866,0.000037084945,0.000013600506,7.551643e-7,0.000029923902,0.00005148251],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994174,0.000010578421,0.0001306755,0.00015988818,0.00012523771,0.0001561677],"domain_scores_gemma":[0.99961793,0.000023267623,0.000044763932,0.00020916678,0.000042785654,0.000062064624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000050285867,0.00014398314,0.00013541742,0.00007703258,0.0006524855,0.00027403477,0.0001220068,0.00008372603,0.000017760123],"category_scores_gemma":[0.0000016167372,0.0001451593,0.000032877764,0.000038195893,0.00009198202,0.00038580346,0.0000011325602,0.00021360164,0.0000046409486],"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.000026392123,0.000028663133,0.000011401597,0.00008427686,0.000037905702,0.0000153061,0.0003824511,0.26239154,0.05953551,0.000013099198,0.00021606204,0.6772574],"study_design_scores_gemma":[0.0001690301,0.000019902142,0.00013080509,0.00016190873,0.00002788403,0.000018054872,0.000018205525,0.6773648,0.32144016,0.0003069632,0.00018675112,0.00015552859],"about_ca_topic_score_codex":0.000022478833,"about_ca_topic_score_gemma":0.000008042909,"teacher_disagreement_score":0.9322657,"about_ca_system_score_codex":0.000024660028,"about_ca_system_score_gemma":0.000013292954,"threshold_uncertainty_score":0.5919425},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12237931,0.00025202765,0.8757675,0.00080745603,0.00013028643,0.0002656698,0.000003786646,0.00015185199,0.0002421097],"genre_scores_gemma":[0.98700225,0.000023391169,0.012325776,0.00046274424,0.000051769002,0.000080548125,3.6427562e-7,0.00003459322,0.00001857181],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976649,0.0001000951,0.00039536288,0.0007979823,0.00045414397,0.0005874761],"domain_scores_gemma":[0.9987877,0.00019445167,0.00023659441,0.0005516753,0.00007964365,0.00014993752],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003917146,0.00038242748,0.00028850808,0.00032283305,0.0024494817,0.0014123882,0.0012394866,0.0001336377,0.000018757599],"category_scores_gemma":[0.0000062283443,0.00029807884,0.00010568251,0.0005606972,0.00036725984,0.0023451038,0.000016871189,0.0009141908,0.0000054015554],"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.0001595428,0.0003303059,0.0003142688,0.00015515485,0.000039025235,0.00017673262,0.0026509115,0.19348414,0.015973277,0.00196506,0.000018481103,0.7847331],"study_design_scores_gemma":[0.002470583,0.00095948426,0.0039386493,0.0030417251,0.00006523603,0.00017419235,0.00030387644,0.84356165,0.07815627,0.06519718,0.00004207994,0.0020890892],"about_ca_topic_score_codex":0.000026551334,"about_ca_topic_score_gemma":0.000051344723,"teacher_disagreement_score":0.86462295,"about_ca_system_score_codex":0.000047708963,"about_ca_system_score_gemma":0.0001070586,"threshold_uncertainty_score":0.99994713},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116119124,0.0003001455,0.88253874,0.000071521514,0.00031303513,0.00022842563,0.000010324279,0.00016277385,0.0002559441],"genre_scores_gemma":[0.9814532,0.000017272201,0.018315025,0.00009196368,0.000044542754,0.000008973875,0.0000016471063,0.000029436565,0.000037949416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978428,0.000077042496,0.00048655336,0.0006646997,0.000511311,0.000417601],"domain_scores_gemma":[0.99894243,0.00009955875,0.00024355999,0.0003687656,0.00019198174,0.00015368738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003227989,0.00027809295,0.0003598863,0.000259442,0.00034739968,0.000244449,0.00047673643,0.00013208562,0.00005739282],"category_scores_gemma":[0.000002641264,0.00025690024,0.000090740905,0.0005735097,0.000091719005,0.0011335853,0.000007818923,0.00040479453,0.000008847232],"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.00018297878,0.00068891514,0.00038314654,0.0010544328,0.00007757735,0.000031849304,0.004839034,0.24514282,0.058026705,0.0003885704,0.000020970492,0.689163],"study_design_scores_gemma":[0.00091276795,0.00022308421,0.00038614986,0.0010284715,0.000049411974,0.00013079612,0.00059541623,0.85139346,0.14357479,0.0010651576,0.000057964735,0.0005824995],"about_ca_topic_score_codex":0.000016165965,"about_ca_topic_score_gemma":0.0000037628581,"teacher_disagreement_score":0.8653341,"about_ca_system_score_codex":0.00004433829,"about_ca_system_score_gemma":0.00013357388,"threshold_uncertainty_score":0.9999883},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017276566,0.000058974292,0.97751284,0.00025939234,0.0003969089,0.00021619456,0.0000022091563,0.0014887508,0.0027881807],"genre_scores_gemma":[0.96389544,0.0000033670772,0.03446905,0.00048672064,0.000025645342,0.000022698021,4.5327383e-7,0.000030507443,0.0010661227],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99844533,0.00008215465,0.00026329103,0.0005495938,0.0002717545,0.0003878467],"domain_scores_gemma":[0.9991179,0.000115146264,0.00011100422,0.00042427125,0.00012709195,0.000104580104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037500937,0.00022372302,0.00020064827,0.00029876438,0.00032359554,0.00030201356,0.00071204244,0.000109460765,0.00009134385],"category_scores_gemma":[0.000002641295,0.00022429087,0.00010861603,0.0007475628,0.000040837338,0.0011348731,0.000004377174,0.00045078085,0.0003123354],"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.000192847,0.00045835276,0.00021713917,0.00021943368,0.00005630835,0.000024835683,0.0026000163,0.03592443,0.12089705,0.0004859844,0.00034573855,0.83857787],"study_design_scores_gemma":[0.0004946998,0.00059192866,0.00006994952,0.00033812405,0.000022110919,0.000059101036,0.00020300414,0.25098923,0.7434509,0.0022483955,0.00085330586,0.00067924795],"about_ca_topic_score_codex":0.000053605898,"about_ca_topic_score_gemma":0.000017992106,"teacher_disagreement_score":0.94661885,"about_ca_system_score_codex":0.00010724308,"about_ca_system_score_gemma":0.00018001568,"threshold_uncertainty_score":0.9146316},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062807545,0.00054521306,0.9350272,0.000008369522,0.00018150616,0.00089641084,0.000033988697,0.00035549584,0.00014427422],"genre_scores_gemma":[0.9851602,0.0002432672,0.014217234,0.000039467275,0.000029233639,0.00017113303,0.00003196365,0.000056806686,0.00005072229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988538,0.000021443448,0.00040196863,0.00019236843,0.00017787743,0.00035251232],"domain_scores_gemma":[0.99924004,0.00015107154,0.00011785065,0.0002037954,0.00020137374,0.000085857486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002763605,0.00027741792,0.0002797345,0.00021176618,0.00027341177,0.00019389858,0.00014037848,0.000109792796,0.000009548684],"category_scores_gemma":[0.0000015729395,0.00024276013,0.000048063117,0.00041609738,0.00004170969,0.001542282,0.0000017059914,0.00033453124,0.000022399148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016749887,0.000018440955,0.000042606425,0.00033434472,0.00007900407,2.4772297e-7,0.0021508483,0.84660274,0.0007522658,0.0000035675494,0.0000015941766,0.14984682],"study_design_scores_gemma":[0.0017570417,0.00024061516,0.0002314916,0.00074673357,0.00004736886,0.000025491936,0.0013657106,0.9799637,0.014332398,0.00003510806,0.0007816161,0.00047270313],"about_ca_topic_score_codex":0.000040523148,"about_ca_topic_score_gemma":0.00007556839,"teacher_disagreement_score":0.9223526,"about_ca_system_score_codex":0.00017310979,"about_ca_system_score_gemma":0.0000576701,"threshold_uncertainty_score":0.9899471},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020040588,0.00037479808,0.99707884,0.0014487824,0.0001438221,0.0005116766,0.0000028484267,0.0001708911,0.0000679402],"genre_scores_gemma":[0.8991467,0.00019986038,0.09947539,0.00094798615,0.00007647059,0.000105167135,0.000004238498,0.000021469334,0.000022729133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985623,0.00008560362,0.00040126735,0.00042607196,0.00018981642,0.0003349876],"domain_scores_gemma":[0.99912304,0.00020329379,0.00012939185,0.00020325246,0.00019631519,0.00014469831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023353932,0.00019348068,0.00022841655,0.00018402317,0.000501624,0.0004566055,0.00078923756,0.000079398036,0.000020619085],"category_scores_gemma":[0.000011887798,0.00019508808,0.00008550387,0.0012438964,0.000041006802,0.0013466025,0.0000120506475,0.00033539094,0.0000026579262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029278328,0.000068168956,0.000009861004,0.000016778395,0.000007039318,0.0000013376674,0.0004578277,0.6462979,0.00015004244,0.000036178266,0.000010733209,0.3529149],"study_design_scores_gemma":[0.0010855424,0.0000854945,0.000017353585,0.00012298088,0.000012345425,0.0000040121527,0.000058040034,0.99617684,0.0020088465,0.000009978346,0.00019610442,0.00022245853],"about_ca_topic_score_codex":0.000003395082,"about_ca_topic_score_gemma":0.000009815123,"teacher_disagreement_score":0.8989463,"about_ca_system_score_codex":0.000100099525,"about_ca_system_score_gemma":0.00010397975,"threshold_uncertainty_score":0.7955461},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062035438,0.00018974532,0.93606824,0.0009947234,0.00021670086,0.00013024033,9.1453404e-7,0.00029474145,0.000069269925],"genre_scores_gemma":[0.9766836,0.00000509755,0.022440365,0.00061618997,0.00021048464,0.000007666249,0.000007697127,0.000022199038,0.000006664651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983799,0.00012675751,0.0003560539,0.0005123637,0.0003499983,0.00027495026],"domain_scores_gemma":[0.9991071,0.00021450188,0.00019647769,0.00016664444,0.00015589016,0.00015937444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001827889,0.00022311798,0.00019366536,0.00016132576,0.0008901501,0.0007039494,0.00058410084,0.00010371068,0.0000026541259],"category_scores_gemma":[0.0000056447484,0.00023216827,0.000054912856,0.0006743223,0.00006739181,0.0007029254,0.000019859865,0.0003487952,0.0000029757316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038285656,0.000048382673,0.000013655942,0.000057950216,0.000014488319,0.0000017604838,0.0028645657,0.6821573,0.011111944,0.000024799432,0.00006406878,0.30360278],"study_design_scores_gemma":[0.000383092,0.00007020486,0.00003815367,0.00011610299,0.000018735296,0.000009810494,0.0000642776,0.94144833,0.057267945,0.00010842017,0.00023749964,0.00023744497],"about_ca_topic_score_codex":0.000017395887,"about_ca_topic_score_gemma":0.0000017096821,"teacher_disagreement_score":0.9146482,"about_ca_system_score_codex":0.00006414631,"about_ca_system_score_gemma":0.00008216524,"threshold_uncertainty_score":0.94675475},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042623442,0.00047326318,0.9974492,0.0008475046,0.00006452381,0.000359361,0.000013836655,0.00026445097,0.00010161234],"genre_scores_gemma":[0.93284017,0.0001698559,0.066687465,0.00008043278,0.000047283727,0.00010014146,0.0000087604,0.000045618555,0.00002024709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991633,0.000021532465,0.00030768223,0.00019169375,0.0000732926,0.00024249214],"domain_scores_gemma":[0.99961656,0.000063707485,0.000027621043,0.00013146039,0.000048086098,0.000112547306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001010728,0.0001481983,0.00018662678,0.00010237201,0.0002578587,0.00005422281,0.00012986851,0.000074822594,0.000008488779],"category_scores_gemma":[0.0000018568436,0.00014757029,0.000039854207,0.00023159065,0.000031066047,0.00035336663,0.0000020035714,0.00022796975,0.00000591488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011213436,0.000016962884,8.858751e-7,0.00018752598,0.000010543175,4.140652e-7,0.0013170847,0.80479944,0.019843705,0.000021738271,0.00001377179,0.17377673],"study_design_scores_gemma":[0.00046313446,0.000034191682,0.0000013748634,0.00016644715,0.000021294156,0.000004123633,0.00018450891,0.9591334,0.039397907,0.00014551931,0.00027170367,0.00017638765],"about_ca_topic_score_codex":0.0000093987655,"about_ca_topic_score_gemma":0.000034130662,"teacher_disagreement_score":0.93241394,"about_ca_system_score_codex":0.00007089604,"about_ca_system_score_gemma":0.000030153526,"threshold_uncertainty_score":0.6017742},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052666105,0.00018544658,0.9919874,0.00041388843,0.00044581477,0.0005049622,0.00007977417,0.0001720861,0.0009440063],"genre_scores_gemma":[0.91700923,0.000042547497,0.08169092,0.00020187446,0.00021543898,0.000119826625,0.000036066765,0.000054117896,0.00062996364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99314845,0.00024494337,0.0012253663,0.0010014103,0.0037654229,0.0006144333],"domain_scores_gemma":[0.9952439,0.000998915,0.00065858883,0.0008145927,0.002020287,0.00026369555],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0016841472,0.000517416,0.0007027382,0.0010839086,0.00086167344,0.0020708058,0.0009979906,0.00042554157,0.0006525006],"category_scores_gemma":[0.00014037036,0.0004020096,0.00026336164,0.0015925091,0.00022397947,0.002514508,0.000027096077,0.0024371939,0.00022360033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013873851,0.00006062032,0.0000035616104,0.00008122515,0.000026437336,0.000012531832,0.0007439232,0.5628438,0.00016228513,5.7469987e-7,0.00000972403,0.43591657],"study_design_scores_gemma":[0.0015857145,0.00042357176,0.00020278107,0.0025135505,0.00015326207,0.0001467133,0.006140043,0.91642714,0.06202101,0.0032058584,0.0054838806,0.0016965029],"about_ca_topic_score_codex":0.000040585215,"about_ca_topic_score_gemma":0.00007476027,"teacher_disagreement_score":0.9117426,"about_ca_system_score_codex":0.00030841044,"about_ca_system_score_gemma":0.0014360263,"threshold_uncertainty_score":0.9998642},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005332269,0.00082304375,0.9917353,0.0010540433,0.00016421007,0.00020672967,0.0000030182603,0.0002346927,0.00044673297],"genre_scores_gemma":[0.9820946,0.000060075356,0.015916273,0.00168643,0.00007396405,0.00007597035,0.0000019302204,0.000029389732,0.00006139687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972039,0.00023432268,0.00046743982,0.00079685915,0.00067519955,0.00062230235],"domain_scores_gemma":[0.9989113,0.0002093861,0.00016182387,0.00042346976,0.00018312156,0.0001108914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035538245,0.00033963533,0.00027447855,0.0003668455,0.0007280254,0.00061822723,0.0009574781,0.00013565905,0.000025312094],"category_scores_gemma":[0.000002980536,0.00027771154,0.00020195189,0.0034680793,0.00014654714,0.0016345468,0.0000068692043,0.0009417033,0.000012056791],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040582614,0.0003515149,0.000024967872,0.000083919585,0.000011619657,0.00023172937,0.0019602033,0.08057478,0.0072141234,0.00013363769,0.000059479025,0.90931344],"study_design_scores_gemma":[0.0024111432,0.00059614,0.00070507044,0.001843971,0.000115481496,0.00092509255,0.002058325,0.8066639,0.14993982,0.031370156,0.0014081215,0.0019628194],"about_ca_topic_score_codex":0.0000059882764,"about_ca_topic_score_gemma":0.00004905455,"teacher_disagreement_score":0.9767623,"about_ca_system_score_codex":0.000052314,"about_ca_system_score_gemma":0.00020907196,"threshold_uncertainty_score":0.9999675},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016203137,0.00009958772,0.9949815,0.0026469294,0.00016674018,0.0002763802,0.0000025493346,0.00015040862,0.000055562723],"genre_scores_gemma":[0.8680502,0.0000077704135,0.13107114,0.00061174884,0.00019098342,0.000019736262,0.0000023410016,0.000019912304,0.000026135634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830383,0.00014577994,0.00024274562,0.0006213943,0.0003348351,0.00035141318],"domain_scores_gemma":[0.9992509,0.000120732526,0.00014146217,0.00016993358,0.00016406381,0.00015293203],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018395986,0.00028427335,0.000291408,0.00010529872,0.00048847427,0.00038535646,0.00030167095,0.00012367425,0.000014466228],"category_scores_gemma":[0.000008369432,0.0002508859,0.00007168182,0.0009691852,0.00007861963,0.0013045846,0.0000048822067,0.00050259393,0.000007828148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017641859,0.000049895614,0.000020221873,0.000014836594,0.000022983158,0.000030459101,0.0014192929,0.9473442,0.0012046029,0.00006878525,0.000043277294,0.049605068],"study_design_scores_gemma":[0.000700521,0.00017357765,0.00005307397,0.00009926127,0.000026595459,0.0000117362,0.00009391463,0.9601005,0.038343634,0.000076953715,0.000030811145,0.00028945628],"about_ca_topic_score_codex":0.000023658387,"about_ca_topic_score_gemma":0.00008992055,"teacher_disagreement_score":0.8664299,"about_ca_system_score_codex":0.0001013697,"about_ca_system_score_gemma":0.00020592735,"threshold_uncertainty_score":0.99999434},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038309198,0.000072307936,0.960229,0.0002183387,0.00005191275,0.00024955533,0.00004026929,0.00043325595,0.00039615322],"genre_scores_gemma":[0.9983018,0.000035146913,0.0011981365,0.00009161083,0.00010134912,0.00011051195,0.000021314092,0.000040260886,0.000099894925],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988142,0.000024054518,0.000360508,0.00031044113,0.00022198047,0.00026876264],"domain_scores_gemma":[0.99947613,0.00008324538,0.00007542495,0.00010607698,0.00014208381,0.0001170235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010625887,0.00021138453,0.00028526617,0.00031950313,0.00045625286,0.00017076368,0.00011663938,0.000080919,0.00018504995],"category_scores_gemma":[0.000002806146,0.0002245263,0.00025375374,0.0013619979,0.000048391903,0.00031165162,5.559347e-7,0.00016821516,0.000011870031],"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.00015046854,0.000085125386,0.000015058761,0.00021635208,0.0009438812,0.000001248095,0.0018333991,0.2268614,0.63571495,0.0000046348728,0.000539922,0.13363358],"study_design_scores_gemma":[0.0005835197,0.00014317964,0.0005753765,0.000031189993,0.0007764624,0.0000012001611,0.0002959695,0.6293567,0.36747366,0.000078305435,0.0002798067,0.0004046277],"about_ca_topic_score_codex":0.0000050157305,"about_ca_topic_score_gemma":0.0000047471326,"teacher_disagreement_score":0.9599926,"about_ca_system_score_codex":0.000050822004,"about_ca_system_score_gemma":0.000028445897,"threshold_uncertainty_score":0.9155917},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13841808,0.0008510879,0.8601931,0.000031623636,0.00009500744,0.0001666904,0.000016195208,0.00011434644,0.00011387132],"genre_scores_gemma":[0.9762227,0.00021325369,0.023423465,0.000015292515,0.0000306547,0.000032179618,8.7736214e-7,0.00003364873,0.00002792739],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991276,0.000028075527,0.00028343353,0.00020818929,0.00013097058,0.00022167599],"domain_scores_gemma":[0.9993728,0.0002423396,0.00007298985,0.00011005603,0.00017174555,0.000030103301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018179005,0.00015526738,0.00021052669,0.00010236153,0.00022692163,0.00009708634,0.000062132945,0.00007985133,0.000006502268],"category_scores_gemma":[0.0000048467255,0.0001289747,0.000042398227,0.00027845107,0.0000669288,0.0002977374,0.0000010831881,0.00020632052,2.1264131e-7],"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.000064731816,0.000018246214,0.000007027166,0.000059613103,0.000028611163,0.0000021449669,0.000102398284,0.4862771,0.020972285,0.000003240924,0.0000034502577,0.49246114],"study_design_scores_gemma":[0.00036926763,0.000085929896,0.000050562052,0.0011839082,0.00003755057,0.000054852288,0.0005934334,0.25373924,0.74333584,0.00033586455,0.000032537766,0.00018103313],"about_ca_topic_score_codex":0.000014989141,"about_ca_topic_score_gemma":0.00014027146,"teacher_disagreement_score":0.8378046,"about_ca_system_score_codex":0.000042383905,"about_ca_system_score_gemma":0.000070354334,"threshold_uncertainty_score":0.5259436},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007457117,0.00024841665,0.9894921,0.0005468063,0.00013376318,0.00043842822,0.00007362342,0.0012278063,0.0003819439],"genre_scores_gemma":[0.97776246,0.000030955856,0.021291563,0.00055908255,0.00011241405,0.00013317888,0.000011171513,0.00008608482,0.000013117032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840045,0.000045370263,0.00045976372,0.00038900625,0.00029286195,0.00041257206],"domain_scores_gemma":[0.9992199,0.00011465953,0.000089294386,0.00022153545,0.00013871858,0.00021587008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015646483,0.00035766495,0.0003400504,0.0001295505,0.00028208332,0.00024400662,0.0005011786,0.0002183638,0.00022658023],"category_scores_gemma":[0.0000037924249,0.00039410757,0.00016306713,0.00038852534,0.00017304717,0.0004858547,0.0000045990178,0.00059906865,0.00001634427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016765221,0.00017815453,0.0000032440735,0.0007535036,0.00022870662,0.000008996129,0.005842869,0.6340407,0.08654919,0.0002447078,0.00035681424,0.27162546],"study_design_scores_gemma":[0.00055736623,0.00015533154,0.0000036085598,0.00040647024,0.000059219772,0.000012551434,0.0006020137,0.7701434,0.22691813,0.0003365159,0.00030788258,0.00049750524],"about_ca_topic_score_codex":0.000004523917,"about_ca_topic_score_gemma":0.0000042068073,"teacher_disagreement_score":0.9703053,"about_ca_system_score_codex":0.00012765275,"about_ca_system_score_gemma":0.0000844704,"threshold_uncertainty_score":0.9998511},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022895397,0.00009578658,0.99524647,0.0008822986,0.00026622668,0.00008970858,0.000007433705,0.0006922035,0.00043034775],"genre_scores_gemma":[0.9820281,0.000011206724,0.016770026,0.000840602,0.00019460903,0.00000963056,0.0000034167663,0.00002097281,0.00012142132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845713,0.000076305514,0.0002692491,0.0005361812,0.00035502767,0.00030607756],"domain_scores_gemma":[0.99931574,0.00008074442,0.0001058048,0.00015118664,0.000100110585,0.00024644344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008374781,0.00020082331,0.00019717425,0.0000806411,0.00052556867,0.00043695103,0.00037444936,0.00010142995,0.00014725537],"category_scores_gemma":[0.0000043820014,0.00020137301,0.00010504958,0.0008641742,0.000038068953,0.0006194553,0.000003606255,0.00059265754,0.00018762785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027065807,0.000049738857,0.0000032012706,0.000008425106,0.00001705839,0.000018332748,0.00037510946,0.6119213,0.0019671605,0.000009293015,0.0000937804,0.38550952],"study_design_scores_gemma":[0.0003885427,0.00014256203,0.0000148313275,0.000047455567,0.000017395267,0.0000073616084,0.00009484977,0.9763995,0.020346044,0.00007861088,0.0022166201,0.00024622792],"about_ca_topic_score_codex":0.000018191187,"about_ca_topic_score_gemma":0.0000035454416,"teacher_disagreement_score":0.9797386,"about_ca_system_score_codex":0.000036813184,"about_ca_system_score_gemma":0.00007048111,"threshold_uncertainty_score":0.82117534},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021458603,0.000031786796,0.99601686,0.0006798352,0.00007718692,0.00036582872,0.000007548876,0.00052191893,0.00015318574],"genre_scores_gemma":[0.6526297,0.0000033684157,0.34715155,0.000101000915,0.000025137739,0.00006889909,0.0000021456624,0.000011690337,0.000006510878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884254,0.000037089656,0.0003796948,0.00039218922,0.00018665499,0.00016182166],"domain_scores_gemma":[0.99912757,0.00019544149,0.0002346329,0.00013496824,0.00022357849,0.000083804734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017878984,0.00015132432,0.00019821001,0.00012452599,0.0003320383,0.0003503813,0.00020383982,0.00006496341,0.0000072474404],"category_scores_gemma":[0.000023388302,0.00016116102,0.00006575405,0.00045914282,0.000061323466,0.0018675763,0.0000030937995,0.00013955713,0.0000016858021],"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.00006173207,0.000060958755,0.0000011926537,0.00028645035,0.00002309576,8.518156e-7,0.002889455,0.14737049,0.17052677,0.0006427415,0.000027626671,0.67810863],"study_design_scores_gemma":[0.00019875966,0.00011191555,0.0000023803955,0.00007616956,0.000012470432,0.000002397471,0.000237078,0.60628086,0.39063424,0.0023308755,0.000010501847,0.00010234388],"about_ca_topic_score_codex":0.000009320765,"about_ca_topic_score_gemma":0.0000011052415,"teacher_disagreement_score":0.6780063,"about_ca_system_score_codex":0.000026744605,"about_ca_system_score_gemma":0.00012220645,"threshold_uncertainty_score":0.65719557},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2407602,0.00009677588,0.7582847,0.000035965586,0.00005460658,0.00015674383,0.000043128282,0.00035260446,0.00021527408],"genre_scores_gemma":[0.9951355,0.000047042995,0.004505352,0.00013447322,0.00006135179,0.000034276527,0.000008365656,0.00004969618,0.000023928185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871016,0.000021494545,0.00040119028,0.0002874645,0.000315343,0.0002643251],"domain_scores_gemma":[0.9994506,0.000100257515,0.00010253577,0.00013328313,0.000113319744,0.00009995869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001388766,0.00023218596,0.00040285845,0.00031416395,0.000162535,0.00007311967,0.0001983596,0.000101531485,0.000101891244],"category_scores_gemma":[0.0000016621112,0.00024043523,0.0002656611,0.0006877401,0.000034908764,0.00032736958,0.0000016792688,0.0002697589,0.0000046703717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013583987,0.00003924018,0.000014955339,0.00012714877,0.00038477225,0.000002615175,0.00030498402,0.7966441,0.082793005,0.000002046552,0.000034633653,0.11951667],"study_design_scores_gemma":[0.00018729354,0.00014491,0.00005992753,0.00012560318,0.0005509463,0.0000025903632,0.000071295864,0.6146124,0.3839074,0.000061431194,0.0000579143,0.00021826176],"about_ca_topic_score_codex":0.0000056786416,"about_ca_topic_score_gemma":0.0000069738744,"teacher_disagreement_score":0.75437534,"about_ca_system_score_codex":0.000050992985,"about_ca_system_score_gemma":0.000043356547,"threshold_uncertainty_score":0.98046637},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018654027,0.00006213741,0.99312294,0.0038647887,0.000086948814,0.00020380186,0.0000052879655,0.0007302124,0.000058470792],"genre_scores_gemma":[0.66049445,0.000010214612,0.33869934,0.0007333424,0.000021267027,0.000018432112,8.4863444e-7,0.000015534351,0.0000065957984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985758,0.00007789465,0.0002627448,0.000496878,0.00031789282,0.0002687899],"domain_scores_gemma":[0.99938107,0.00010250996,0.000112249734,0.00014638554,0.00009550038,0.00016230176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021853237,0.0001802755,0.0001541408,0.00012733442,0.0003713514,0.00032176147,0.00024052184,0.00007513068,0.000025132635],"category_scores_gemma":[0.000006132338,0.00018888328,0.000051195155,0.00047573348,0.000049809445,0.0012957057,0.0000057146776,0.00039298576,0.00001543163],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000123932305,0.00005215972,0.000010413383,0.000027895268,0.000013164681,0.000014751652,0.0015402144,0.00018134617,0.0045972667,0.000035726764,0.000060395832,0.9934543],"study_design_scores_gemma":[0.00034913537,0.00034960054,0.000045608427,0.000058700123,0.00003255275,0.000093991686,0.00046519376,0.93938047,0.058241542,0.0004801825,0.00020078362,0.00030222203],"about_ca_topic_score_codex":0.000025050309,"about_ca_topic_score_gemma":0.000015815913,"teacher_disagreement_score":0.993152,"about_ca_system_score_codex":0.0000738093,"about_ca_system_score_gemma":0.0001617719,"threshold_uncertainty_score":0.77024364},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038533832,0.00003734928,0.99457806,0.00080628175,0.00015153326,0.00017016428,0.0000031951895,0.0000893448,0.0003107035],"genre_scores_gemma":[0.9954042,0.000007028809,0.004106014,0.00038353668,0.00006325096,0.00002113188,4.0536324e-7,0.000009272835,0.0000051797433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986364,0.00008336749,0.00031412404,0.00033603385,0.0003716598,0.00025837304],"domain_scores_gemma":[0.9994395,0.00009637673,0.000119252625,0.00018669663,0.00007324008,0.00008494784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002416252,0.00014286625,0.00015584345,0.00011316734,0.00024139194,0.00017371806,0.0005059289,0.0000763649,0.000009471503],"category_scores_gemma":[0.0000045427123,0.00011472441,0.00008238469,0.0013781491,0.000048213293,0.0005249624,0.000002901052,0.00041516213,0.000009619682],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033989294,0.00008970562,0.0000020711739,0.000038080143,0.0000065769873,0.0000108155145,0.0019696862,0.03272527,0.0066924077,0.0000055974633,0.0000115177445,0.95841426],"study_design_scores_gemma":[0.00034985735,0.00029916136,0.000069368994,0.000079022044,0.0000106584785,0.000020613004,0.0005295129,0.905271,0.09267777,0.00032369792,0.00021524563,0.00015409943],"about_ca_topic_score_codex":0.000021996451,"about_ca_topic_score_gemma":0.000018240635,"teacher_disagreement_score":0.9915508,"about_ca_system_score_codex":0.000027291111,"about_ca_system_score_gemma":0.000059910617,"threshold_uncertainty_score":0.46783257},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014496242,0.000102153484,0.98357004,0.000088413515,0.00007556199,0.00017196519,0.000029103297,0.00097536435,0.0004911612],"genre_scores_gemma":[0.99764013,0.000029562825,0.0021799982,0.00005135654,0.000039707535,0.000018201443,0.0000032987848,0.0000312861,0.000006434762],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922746,0.000025111383,0.00026672892,0.00016032983,0.00015617964,0.00016420413],"domain_scores_gemma":[0.99965847,0.000056809993,0.000049372695,0.000086504435,0.00008022398,0.000068640424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005234479,0.00014958766,0.0002373104,0.000092357506,0.00014048374,0.00003765531,0.0000985609,0.00006944911,0.00003654336],"category_scores_gemma":[0.0000034772704,0.00014957314,0.00009998415,0.000438675,0.000047336944,0.0001507841,6.7460087e-7,0.0002441452,0.0000060265897],"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.00032330662,0.00009699968,0.0000074164786,0.0002393073,0.00011085262,0.000009429342,0.0008839124,0.40643615,0.5282367,0.000021567226,0.0004953996,0.063139],"study_design_scores_gemma":[0.0005426391,0.000056293728,0.000004565491,0.00015638505,0.000044434713,0.0000051809466,0.00008995117,0.42214805,0.5765732,0.00004269813,0.00020279888,0.00013384312],"about_ca_topic_score_codex":0.0000060645443,"about_ca_topic_score_gemma":0.0000016433713,"teacher_disagreement_score":0.9831439,"about_ca_system_score_codex":0.000025282721,"about_ca_system_score_gemma":0.000030025618,"threshold_uncertainty_score":0.60994154},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038212175,0.0002346646,0.99459517,0.00027572358,0.00035624288,0.0003886676,0.000031133375,0.0002568189,0.000040335046],"genre_scores_gemma":[0.80598617,0.0000029256269,0.1935707,0.00010059979,0.000031650467,0.00013334102,0.0000059838194,0.000020134079,0.00014850206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982806,0.00007523531,0.00040777706,0.0005980076,0.00028760414,0.00035078722],"domain_scores_gemma":[0.99906784,0.00016003373,0.00014990986,0.00026649513,0.00022262958,0.00013307248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027156685,0.00022725221,0.00026079256,0.00013881882,0.0005306824,0.00052679126,0.00026079215,0.00009190346,0.000007635123],"category_scores_gemma":[0.000014489913,0.0002401964,0.00010993791,0.00033527648,0.00003346725,0.00084725826,0.0000049614773,0.00016293999,0.000009659045],"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.00005335668,0.00036414887,0.000007096343,0.00045924573,0.0000840149,0.000022976234,0.002861717,0.1301844,0.15981261,0.000044623517,0.000051955616,0.70605385],"study_design_scores_gemma":[0.0012663268,0.000057980174,0.000030155219,0.00026647534,0.00003855261,0.000042114985,0.00028526923,0.9182182,0.07930088,0.000046300753,0.00020168263,0.00024608057],"about_ca_topic_score_codex":0.000008506702,"about_ca_topic_score_gemma":0.000016632195,"teacher_disagreement_score":0.802165,"about_ca_system_score_codex":0.00011105981,"about_ca_system_score_gemma":0.0001490419,"threshold_uncertainty_score":0.9794925},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12327545,0.00035613374,0.8750137,0.000016249665,0.00017438715,0.00009950935,0.000021866648,0.00049373263,0.0005489452],"genre_scores_gemma":[0.99846023,0.000010320036,0.0013648211,0.000034258952,0.000022761282,0.00003250916,0.0000022163163,0.000033483186,0.000039373448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991725,0.000046005942,0.00022907932,0.00014551029,0.00023420791,0.00017269987],"domain_scores_gemma":[0.9997031,0.00003765073,0.00005101469,0.00011959785,0.000049823022,0.00003879337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011908073,0.0001264989,0.00015951658,0.00020340526,0.00026704973,0.000018489,0.00012717191,0.00004089973,0.00021882184],"category_scores_gemma":[5.9929295e-7,0.00014559648,0.000082979655,0.0003092116,0.000034845278,0.00013128246,0.0000013612689,0.00028224383,0.000004450491],"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.000033289525,0.000079538215,0.0000060111,0.000036065445,0.0000321961,0.00000463323,0.00017189402,0.6324508,0.27264944,0.000009301405,0.00029394726,0.09423287],"study_design_scores_gemma":[0.00017782384,0.00011792633,0.00002649021,0.000061447405,0.000034806366,0.000021254955,0.00013779779,0.19892362,0.79925925,0.00043415223,0.00062031875,0.00018514728],"about_ca_topic_score_codex":0.0000137507195,"about_ca_topic_score_gemma":0.0000027463705,"teacher_disagreement_score":0.87518483,"about_ca_system_score_codex":0.000080853075,"about_ca_system_score_gemma":0.000033675155,"threshold_uncertainty_score":0.5937252},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033763873,0.000013547049,0.99382585,0.0006238149,0.000023381022,0.00018715551,0.000007493832,0.0002535154,0.0016888478],"genre_scores_gemma":[0.7454135,0.0000046641935,0.25421727,0.00017315992,0.00003472425,0.000018733908,0.0000015668469,0.00003770854,0.00009868726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847883,0.00016115535,0.0003269481,0.0003829977,0.00038431693,0.0002657321],"domain_scores_gemma":[0.9990376,0.00037177632,0.00012641393,0.000104847255,0.00016271512,0.00019664789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001659007,0.00021885532,0.00028164018,0.000092018054,0.00038745423,0.00011053346,0.00012046692,0.00012482954,0.0002220396],"category_scores_gemma":[0.000035965768,0.00017485548,0.000058944373,0.0006611488,0.00010810391,0.00023875761,0.0000011515301,0.0005858128,0.000009407976],"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.0018159264,0.0009766042,0.00004437556,0.0014785768,0.00024721253,0.00008156338,0.007500436,0.07991034,0.018872181,0.0849791,0.00009252398,0.80400115],"study_design_scores_gemma":[0.0006256274,0.0005620035,0.000006822914,0.00024115443,0.0001168159,0.000011233433,0.00027124918,0.8165933,0.011740895,0.16949332,0.000031603442,0.0003059597],"about_ca_topic_score_codex":0.000003834422,"about_ca_topic_score_gemma":0.0000024540332,"teacher_disagreement_score":0.8036952,"about_ca_system_score_codex":0.000024247533,"about_ca_system_score_gemma":0.00009957402,"threshold_uncertainty_score":0.71303993},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07177803,0.0010401859,0.92457616,0.00004953291,0.00032077543,0.000107611115,0.000057939946,0.0010169896,0.0010528008],"genre_scores_gemma":[0.99320966,0.00015823673,0.006069714,0.00018392301,0.00011078504,0.000029233164,0.000018994973,0.0000689193,0.00015051918],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99882084,0.000050055995,0.00030242247,0.00031740635,0.00022726753,0.00028197755],"domain_scores_gemma":[0.9993976,0.00011209775,0.000042572483,0.0002271368,0.00012717237,0.00009346769],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000061668594,0.00025137354,0.00029894023,0.00011887914,0.00022577713,0.00016501882,0.00011708767,0.00013494647,0.00035709154],"category_scores_gemma":[0.000003126429,0.00026699487,0.00014438947,0.00029757028,0.000042276417,0.00029394854,0.0000012189929,0.000368802,0.000034775017],"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.00032486374,0.00028858334,0.0000010830842,0.000037167607,0.00018216476,0.0002280694,0.00023331276,0.20122287,0.32183236,0.0000021258052,0.0010832796,0.47456414],"study_design_scores_gemma":[0.0016754051,0.00005903942,0.000002619339,0.00026831668,0.00010866361,0.00006605481,0.000060964372,0.16581742,0.8299821,0.0010078262,0.00062462944,0.00032693028],"about_ca_topic_score_codex":0.00003638625,"about_ca_topic_score_gemma":0.000030336492,"teacher_disagreement_score":0.92143166,"about_ca_system_score_codex":0.00007061334,"about_ca_system_score_gemma":0.00007429531,"threshold_uncertainty_score":0.99997824},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33542883,0.00081545446,0.662693,0.00012608808,0.00010992851,0.00018688604,0.0005399731,0.000033917066,0.000065870765],"genre_scores_gemma":[0.9931683,0.00023651117,0.004474471,0.00023761335,0.00011615345,0.00014070337,0.0010254803,0.000035125195,0.00056567765],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983204,0.00006772038,0.0003351012,0.00078180037,0.00025069193,0.00024431208],"domain_scores_gemma":[0.999048,0.00007156047,0.00020465882,0.00026509704,0.00031399608,0.000096719166],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007851023,0.0003178784,0.00031703367,0.0001142829,0.0002619966,0.0002087729,0.000260378,0.00039644606,0.0002854795],"category_scores_gemma":[0.000013057235,0.0003125835,0.00034461552,0.0001508055,0.00011526334,0.000024002875,0.000007841583,0.00036681167,0.000012252945],"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.00018253316,0.00016599431,0.00003178912,0.00015528273,0.00032657903,0.0000070417473,0.00023553632,0.04725452,0.8356369,0.0000010238955,0.00003490882,0.11596787],"study_design_scores_gemma":[0.00044284193,0.0003000219,0.00009241543,0.000416385,0.00031734546,0.0000037667794,0.00036769273,0.02255953,0.9711466,0.003137767,0.00037834124,0.00083728443],"about_ca_topic_score_codex":0.00013896234,"about_ca_topic_score_gemma":0.000076768076,"teacher_disagreement_score":0.65821856,"about_ca_system_score_codex":0.000033874127,"about_ca_system_score_gemma":0.00059767824,"threshold_uncertainty_score":0.99993265},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062814896,0.00046282925,0.9965936,0.00008952538,0.000073638905,0.00022965828,0.000025738542,0.0011899051,0.0007069826],"genre_scores_gemma":[0.93541634,0.000077760815,0.06392693,0.0000802855,0.0000334121,0.00016951584,0.000025763762,0.00008268929,0.00018731628],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990768,0.000026466536,0.00027826492,0.00021810684,0.00015300156,0.00024734804],"domain_scores_gemma":[0.999306,0.00009129527,0.00004838461,0.0002707833,0.00021793882,0.00006557152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008407621,0.0001818263,0.00018379913,0.00011807112,0.000261935,0.00007597166,0.0001614763,0.0001178171,0.00012480984],"category_scores_gemma":[0.000004097102,0.00021514452,0.00008259249,0.00038571053,0.000034104505,0.0003765157,0.0000013284481,0.00023313738,0.00003581052],"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.000016344866,0.00008993943,5.381437e-7,0.00018522497,0.00003078196,0.0000018019477,0.0001499949,0.15077296,0.12051609,0.000014418425,0.00017996655,0.72804195],"study_design_scores_gemma":[0.00028551611,0.00003527466,0.0000012849579,0.0001612446,0.000029900262,0.000008104117,0.000033761422,0.37424392,0.6210962,0.0028895366,0.0009868813,0.00022837584],"about_ca_topic_score_codex":5.6866725e-7,"about_ca_topic_score_gemma":0.0000028318102,"teacher_disagreement_score":0.93478817,"about_ca_system_score_codex":0.00014028439,"about_ca_system_score_gemma":0.00008116036,"threshold_uncertainty_score":0.8773339},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33005962,0.0021540036,0.6662941,0.0005283329,0.0001284185,0.00012527312,0.000012106331,0.000020704852,0.0006774804],"genre_scores_gemma":[0.99761856,0.00016896242,0.0011985552,0.00028671784,0.0001375434,0.00004182228,0.0000061596306,0.000019805953,0.00052186084],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99880713,0.00007007198,0.0002494229,0.00038662957,0.00019778736,0.0002889331],"domain_scores_gemma":[0.99950117,0.000027961625,0.00004428406,0.00021201507,0.00012368613,0.00009086485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001376219,0.0001590732,0.00013020367,0.000075315205,0.00031863205,0.00012395244,0.0001714542,0.000105178005,0.00006904498],"category_scores_gemma":[0.00000466466,0.00012722827,0.0001276305,0.0004504253,0.00006542018,0.000015018183,0.0000027098038,0.00020449967,0.000037574915],"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.00007718713,0.000047590183,0.00004225292,0.000009144036,0.000023016946,0.000026060012,0.000054220884,0.0069612344,0.8317189,0.0000010962804,0.00004011281,0.16099916],"study_design_scores_gemma":[0.00021880904,0.0001348483,0.000168079,0.000055334203,0.000018944154,0.000019081484,0.000224103,0.0005147933,0.99615866,0.00022389568,0.0020590334,0.00020442766],"about_ca_topic_score_codex":0.000021752727,"about_ca_topic_score_gemma":0.00015403879,"teacher_disagreement_score":0.66755897,"about_ca_system_score_codex":0.000038152953,"about_ca_system_score_gemma":0.0001381706,"threshold_uncertainty_score":0.5188218},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0095553985,0.0002869952,0.98867345,0.000036656806,0.00026646594,0.00019136998,0.000012926672,0.00076635514,0.00021036796],"genre_scores_gemma":[0.99672025,0.00003671496,0.00295087,0.00007249813,0.00006094213,0.000020978057,0.0000114348395,0.00005541354,0.0000709117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888885,0.000028288652,0.00029860728,0.00023090404,0.00031119506,0.00024215908],"domain_scores_gemma":[0.9996992,0.000013017326,0.00005873306,0.00010984822,0.000054939355,0.00006426846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011150254,0.00018375843,0.00016744036,0.00030654945,0.00076904,0.000114098715,0.00009627786,0.00009705715,0.0003398615],"category_scores_gemma":[0.0000019549125,0.0002165821,0.000046751396,0.00060745707,0.000044309483,0.000377478,0.0000039229717,0.00031140255,0.0000044564003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013832136,0.000023556046,0.00000871125,0.00008688682,0.000019236148,0.000002369495,0.0004219646,0.80465806,0.00644046,0.0000532644,0.00004130505,0.18823034],"study_design_scores_gemma":[0.00040322632,0.000070846385,0.000006858352,0.000061045626,0.000055017517,0.000030338573,0.0003848956,0.86691856,0.1309757,0.0005040255,0.00033398258,0.0002555034],"about_ca_topic_score_codex":0.000031884294,"about_ca_topic_score_gemma":0.000010315754,"teacher_disagreement_score":0.98716486,"about_ca_system_score_codex":0.00033750504,"about_ca_system_score_gemma":0.00009420373,"threshold_uncertainty_score":0.8831962},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051709794,0.00020138604,0.94685346,0.000011377538,0.0003294654,0.00020785183,0.000013252848,0.00038563123,0.00028776977],"genre_scores_gemma":[0.99168915,0.000026408243,0.007876004,0.000015917643,0.00005887847,0.00010396071,0.0000032001371,0.0000874729,0.00013902226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986045,0.000066721936,0.00033076387,0.00039267965,0.00017303761,0.0004323483],"domain_scores_gemma":[0.9995033,0.00006111675,0.00008661079,0.00014729524,0.000113042865,0.000088631496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015158142,0.00026018362,0.0002633259,0.00026783292,0.000282798,0.00008060373,0.00007531698,0.00016729275,0.000028948725],"category_scores_gemma":[0.000005075737,0.00032282027,0.00008346368,0.00071662554,0.00001851726,0.0008531798,0.000001332546,0.0005147007,0.00001978293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015567777,0.00013201086,0.0000038760954,0.0001870615,0.0000076272586,0.000018515726,0.0011840727,0.76299393,0.2027572,9.0824656e-8,5.927666e-7,0.03269944],"study_design_scores_gemma":[0.0005435619,0.000011758222,0.000007311485,0.00018817127,0.000011918507,0.00000951305,0.0013028361,0.5415708,0.45615953,0.00000478615,0.0000074592936,0.00018239625],"about_ca_topic_score_codex":0.000009443773,"about_ca_topic_score_gemma":0.00026787704,"teacher_disagreement_score":0.9399793,"about_ca_system_score_codex":0.00032743168,"about_ca_system_score_gemma":0.00004707069,"threshold_uncertainty_score":0.9999224},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17393677,0.00003387402,0.8249081,0.000042737807,0.00012703231,0.0002965463,0.000019845129,0.00060738105,0.0000277613],"genre_scores_gemma":[0.991651,0.000006914801,0.007891258,0.000019621055,0.00012310522,0.00012022184,0.000046127247,0.000059966078,0.00008179091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887335,0.00002642133,0.00035611002,0.00025919563,0.00016835949,0.00031658766],"domain_scores_gemma":[0.99969774,0.00008068121,0.000037668415,0.000079461315,0.000048488728,0.0000559799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018240644,0.00019018755,0.00017957146,0.00031819718,0.00020780244,0.000078757825,0.00006926502,0.00015016347,0.000017007664],"category_scores_gemma":[0.0000046328273,0.00019865227,0.00007966815,0.000713724,0.000027381231,0.00034963095,5.6982935e-7,0.00025105404,0.000011255668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007395954,0.000036202964,0.000009852888,0.00013018784,0.0000124919825,0.0000019015444,0.00039658736,0.7267919,0.20885697,0.0000026871926,0.000007581964,0.06367968],"study_design_scores_gemma":[0.000550068,0.00002748833,0.000050316165,0.000089190544,0.000015589632,0.0000023163652,0.00014489022,0.7299614,0.26891354,0.00002156382,0.000049894676,0.00017374256],"about_ca_topic_score_codex":0.000017255725,"about_ca_topic_score_gemma":0.00003082032,"teacher_disagreement_score":0.8177142,"about_ca_system_score_codex":0.00008571772,"about_ca_system_score_gemma":0.000029029006,"threshold_uncertainty_score":0.8100804},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054758316,0.0007688643,0.9972802,0.0008407098,0.000105246865,0.0003038541,0.000008298782,0.00013340997,0.000011847716],"genre_scores_gemma":[0.8959506,0.00010356507,0.103302754,0.0004623481,0.000017941074,0.00008399793,0.000017138285,0.00001597837,0.00004568362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986533,0.00024089526,0.00031777035,0.00041006185,0.00015516877,0.00022283198],"domain_scores_gemma":[0.9988273,0.00030085808,0.00011908312,0.0002566167,0.00039363987,0.000102532875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045147404,0.0001796359,0.000184626,0.00010005012,0.00071354513,0.00037417657,0.00017608001,0.00007935768,0.000018901937],"category_scores_gemma":[0.000017624077,0.00018093738,0.000056608544,0.0005006932,0.0000595551,0.00046358322,0.0000073827932,0.00019372437,0.0000013771183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037692127,0.00016221667,0.0000055594783,0.00003613959,0.000026061554,0.0000017487939,0.0005093022,0.7260354,0.009797286,0.00048538254,0.000039154344,0.26286405],"study_design_scores_gemma":[0.0009798802,0.00009043986,0.000071823975,0.00016290386,0.000026914466,0.0000074304853,0.000041455663,0.96450573,0.03368398,0.000079401245,0.00014095819,0.00020908262],"about_ca_topic_score_codex":0.0000012311205,"about_ca_topic_score_gemma":0.000013831245,"teacher_disagreement_score":0.895403,"about_ca_system_score_codex":0.00006253867,"about_ca_system_score_gemma":0.00013856156,"threshold_uncertainty_score":0.73784125},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3536979,0.000031286323,0.64576066,0.000013271385,0.00003484097,0.00011447444,0.000008703204,0.00011678425,0.0002220852],"genre_scores_gemma":[0.86683416,0.000012769627,0.13308829,0.0000130973785,0.000008908937,0.000014920912,0.0000019590125,0.000017516948,0.000008354429],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984437,0.00002475591,0.0005114883,0.00036043074,0.00046992445,0.00018969923],"domain_scores_gemma":[0.9985997,0.00020418066,0.00038108687,0.00026936136,0.0004609874,0.00008470174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025910485,0.00020530583,0.00036199339,0.0003525602,0.00017378211,0.00007044784,0.00024107205,0.000096328156,0.0000071865343],"category_scores_gemma":[0.000016694126,0.00018896826,0.00006848445,0.00096633995,0.0001715499,0.00075032626,0.0000049050236,0.00023678836,5.641593e-7],"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.0003005702,0.00047781918,0.000042670858,0.00035171123,0.00009222702,0.000012948333,0.0018155453,0.34808525,0.5782634,0.00037066595,0.0000032854518,0.07018387],"study_design_scores_gemma":[0.00036932397,0.00028861107,0.00014542227,0.00084148796,0.00003027731,0.000018373657,0.00022133262,0.4611859,0.5366369,0.00013345227,0.0000012934562,0.00012759528],"about_ca_topic_score_codex":0.00014902651,"about_ca_topic_score_gemma":0.000032903743,"teacher_disagreement_score":0.51313627,"about_ca_system_score_codex":0.000056633606,"about_ca_system_score_gemma":0.00039633134,"threshold_uncertainty_score":0.77059025},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012035994,0.00020183611,0.9957008,0.00004073829,0.00025318458,0.00016976614,0.000011712316,0.0018239098,0.00059445767],"genre_scores_gemma":[0.99365973,0.000022461587,0.005269322,0.00010049066,0.000052550433,0.00043934849,0.000013221875,0.00008414033,0.0003587428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988392,0.00004024058,0.00027669745,0.000259108,0.000249664,0.00033509388],"domain_scores_gemma":[0.9996489,0.000075282405,0.00005828378,0.00008808572,0.000083230305,0.000046177844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013809057,0.00020865454,0.00020027318,0.00033476466,0.0011198967,0.00007757022,0.00015979285,0.00010781038,0.0003021563],"category_scores_gemma":[0.0000041287008,0.00023823923,0.0001224154,0.00062253984,0.00003444075,0.00021303927,0.0000018641075,0.0004776066,0.0000046452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007505084,0.000040790295,0.000004052309,0.00006551863,0.000029558878,0.0000011586515,0.00015478613,0.84720665,0.0043785702,0.000035195884,0.00007529994,0.14793335],"study_design_scores_gemma":[0.00064612017,0.00011019805,0.0000013638654,0.000020571297,0.000045998593,0.000015357431,0.0004064165,0.8418716,0.15279019,0.00021092873,0.0036263103,0.0002549044],"about_ca_topic_score_codex":0.0000065635245,"about_ca_topic_score_gemma":0.0000073136107,"teacher_disagreement_score":0.99245614,"about_ca_system_score_codex":0.00023414,"about_ca_system_score_gemma":0.00003704609,"threshold_uncertainty_score":0.97151136},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15859039,0.00097382715,0.8397162,0.000043028525,0.00011383771,0.000089677524,0.0000016588903,0.00014918909,0.00032220874],"genre_scores_gemma":[0.971657,0.000005911845,0.027960923,0.00019552986,0.00008279335,0.000011964038,4.7119525e-7,0.000042722244,0.000042704312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99831736,0.0001538737,0.0004917049,0.000370456,0.00025552904,0.00041106791],"domain_scores_gemma":[0.9991561,0.0004086101,0.000086451226,0.00016034782,0.00010548848,0.00008298249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036679846,0.00025390528,0.0003126233,0.00020069818,0.00035761017,0.000057693564,0.00023450825,0.000074168944,0.000023199113],"category_scores_gemma":[0.000008844439,0.0002193472,0.000098258,0.0011563981,0.00007639053,0.00011702924,0.0000052533037,0.00054286316,0.0000015945167],"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.000012311662,0.000024213872,5.703663e-7,0.000091936534,0.0000039333754,0.000006145057,0.0006410688,0.420457,0.20127662,9.815221e-7,5.4379797e-7,0.37748468],"study_design_scores_gemma":[0.000095064184,0.0000350622,0.000011412585,0.00040556412,0.000012343949,0.000028761813,0.00026151887,0.30771527,0.6911222,0.00010681521,0.000033019172,0.00017298863],"about_ca_topic_score_codex":0.0000046145983,"about_ca_topic_score_gemma":0.000014660656,"teacher_disagreement_score":0.8130666,"about_ca_system_score_codex":0.00006125671,"about_ca_system_score_gemma":0.000102270395,"threshold_uncertainty_score":0.8944719},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28990436,0.00006898533,0.7095985,0.000038267095,0.00014822546,0.00007570975,0.000009951332,0.0000713934,0.000084666724],"genre_scores_gemma":[0.9910791,0.000020083118,0.008714737,0.000079895435,0.00002530389,0.000005770092,0.00000869358,0.000013879076,0.00005252372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981989,0.0001463413,0.00043788238,0.00047552612,0.0005271138,0.00021422986],"domain_scores_gemma":[0.9986518,0.00030680513,0.00024779714,0.00041002873,0.00030564048,0.00007793038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020785035,0.000176167,0.00035767152,0.00045130216,0.00021879312,0.00007591735,0.0002742608,0.00011365899,0.000031887535],"category_scores_gemma":[0.0000094427805,0.0001657426,0.00022445104,0.0019207663,0.000047903173,0.00024554413,0.000005511204,0.00023773237,0.000005199919],"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.000054031905,0.00026250418,0.00006819081,0.00012418373,0.00016526473,0.000038124697,0.0004263345,0.5966593,0.049407586,0.000038324135,0.000006226898,0.35274994],"study_design_scores_gemma":[0.0002158224,0.0001686598,0.00021748061,0.0002449481,0.00023034327,0.00002566884,0.0000176878,0.41970763,0.57896996,0.000036697773,0.00002329252,0.00014182695],"about_ca_topic_score_codex":0.000013738963,"about_ca_topic_score_gemma":0.000012023388,"teacher_disagreement_score":0.7011748,"about_ca_system_score_codex":0.0000350543,"about_ca_system_score_gemma":0.00011303481,"threshold_uncertainty_score":0.6758787},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008330855,0.00016907325,0.9897029,0.0008827528,0.00015473785,0.00022832565,0.000042575462,0.00040318602,0.00008558921],"genre_scores_gemma":[0.9195783,0.0000046925825,0.079161786,0.0008196713,0.000015249495,0.00010558041,0.000016527181,0.000026816158,0.0002713451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980099,0.00031360614,0.00033208594,0.00047828126,0.00053878117,0.00032734193],"domain_scores_gemma":[0.99864876,0.00026348617,0.00018814107,0.0006481445,0.00014689023,0.00010460151],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003714334,0.00021556708,0.00019933861,0.00019781016,0.0016942059,0.00022613133,0.00080493424,0.00005919111,0.00023086817],"category_scores_gemma":[0.0000021307465,0.0002003441,0.00007814248,0.0007785356,0.00009870665,0.0002523974,0.000009997511,0.0006878383,0.000021718099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026239542,0.00087688194,0.00005181625,0.00003884502,0.00003646072,0.000035720946,0.00071203546,0.8651854,0.0033309641,0.000062227606,0.0007211189,0.12868616],"study_design_scores_gemma":[0.001900843,0.00029361653,0.000039547096,0.00012430841,0.000033148863,0.000041686293,0.0001497885,0.9779491,0.016642611,0.00009490806,0.0023162372,0.00041420752],"about_ca_topic_score_codex":0.00002993825,"about_ca_topic_score_gemma":0.000017351207,"teacher_disagreement_score":0.9112475,"about_ca_system_score_codex":0.0000994998,"about_ca_system_score_gemma":0.00022000735,"threshold_uncertainty_score":0.9996055},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004201893,0.0005099154,0.99720734,0.0000301033,0.00045390034,0.0008984878,0.00005825474,0.0002741975,0.00014761028],"genre_scores_gemma":[0.9810699,0.000009513873,0.016880296,0.000022644415,0.000049058344,0.0017880913,0.00002898005,0.00007114551,0.000080342244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987796,0.00005564411,0.00040193702,0.00028330387,0.00020237746,0.0002771369],"domain_scores_gemma":[0.9995789,0.00007219966,0.000092066155,0.00010952962,0.00009425015,0.000053081658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001726989,0.00021069932,0.00023710575,0.0003274609,0.00042085905,0.00006625605,0.000110719026,0.0000756323,0.000014390026],"category_scores_gemma":[0.0000018550282,0.00024609044,0.00005907179,0.0004523605,0.000017619515,0.00062538695,0.0000011298685,0.00028956114,0.0000029105547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040846877,0.00004571618,1.3063982e-7,0.0002040896,0.000018962997,0.0000024163526,0.001477159,0.9845174,0.0016981659,0.000034699046,0.000010839533,0.011949555],"study_design_scores_gemma":[0.0006087613,0.00007434388,1.9088104e-7,0.00009588407,0.000022228276,0.000010650047,0.0010866898,0.99254555,0.004731455,0.00055873994,0.000013608959,0.00025192366],"about_ca_topic_score_codex":0.000010760717,"about_ca_topic_score_gemma":0.000013772591,"teacher_disagreement_score":0.9806497,"about_ca_system_score_codex":0.00051336706,"about_ca_system_score_gemma":0.000049892675,"threshold_uncertainty_score":0.9999991},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084816583,0.00023905204,0.9965451,0.000007911742,0.0005294286,0.0010224594,0.00029936348,0.00048379911,0.000024748913],"genre_scores_gemma":[0.71664023,0.0000021410517,0.2821626,0.000021796113,0.000050416304,0.0009398782,0.000038044287,0.00009861231,0.00004626498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982294,0.00006185526,0.00054473465,0.0003885772,0.0002636064,0.0005118577],"domain_scores_gemma":[0.99945056,0.00009824324,0.00009920033,0.00017370463,0.00008096102,0.00009735139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036121503,0.00028419148,0.000333681,0.00036817003,0.00065668725,0.000076381126,0.00017865084,0.00009287567,0.000037308568],"category_scores_gemma":[0.0000020775576,0.00034085746,0.00010613667,0.0005815186,0.00003602784,0.00041946844,0.000002164597,0.0004650955,0.0000039284732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003709066,0.00029437116,0.0000033301426,0.0004313333,0.000010495028,0.0000039797046,0.0003923966,0.933823,0.0022089696,0.0000011606096,0.0000033639103,0.0627905],"study_design_scores_gemma":[0.002054831,0.000089052184,0.0000028102465,0.0002171943,0.000023961602,0.000011792597,0.0014641518,0.99067485,0.0049782526,0.0000037021316,0.00011980252,0.00035958932],"about_ca_topic_score_codex":0.000019105946,"about_ca_topic_score_gemma":0.00008276461,"teacher_disagreement_score":0.71579206,"about_ca_system_score_codex":0.000576908,"about_ca_system_score_gemma":0.00005548178,"threshold_uncertainty_score":0.99990433},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022722343,0.000017877104,0.9929884,0.00055296574,0.00034259172,0.0002744025,0.000008998065,0.000746734,0.0027958076],"genre_scores_gemma":[0.9944626,0.000003651187,0.003877389,0.0011996942,0.0001696591,0.00006892009,0.0000033128433,0.000025841493,0.00018893907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975208,0.00007953173,0.0006146389,0.0005330068,0.00070439995,0.0005476276],"domain_scores_gemma":[0.99829453,0.00013100891,0.0002986073,0.00033993466,0.0007294452,0.00020647055],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00045604075,0.00032984227,0.00023217993,0.00064493483,0.0016655085,0.0010261815,0.0006353203,0.00017186913,0.00012963105],"category_scores_gemma":[0.0000072579337,0.00032937643,0.00013734713,0.0015837969,0.00014317263,0.005104033,8.5629625e-7,0.000554257,0.00039478907],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008151788,0.00018219226,0.000002761153,0.00006772934,0.00001842447,0.0000016491962,0.0015929013,0.009789669,0.0044239336,0.00005505784,0.00006755529,0.98379],"study_design_scores_gemma":[0.0006782868,0.0005923974,0.000037158192,0.00041688894,0.000051352803,0.00008277522,0.000195239,0.7359191,0.26003787,0.0005740895,0.00077193667,0.0006429023],"about_ca_topic_score_codex":0.000019306051,"about_ca_topic_score_gemma":0.000011220905,"teacher_disagreement_score":0.99219036,"about_ca_system_score_codex":0.0001815849,"about_ca_system_score_gemma":0.00038454155,"threshold_uncertainty_score":0.99991584},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031857349,0.000053805026,0.99176645,0.0015245402,0.00034870213,0.00068380614,0.000005385444,0.001088144,0.0013434226],"genre_scores_gemma":[0.9936097,0.0000076125293,0.004665966,0.00092281395,0.000053384403,0.00037307106,0.000003093734,0.000025200407,0.0003391308],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99734026,0.00010475464,0.00069804455,0.00052812754,0.0007901495,0.00053865154],"domain_scores_gemma":[0.998298,0.00007392417,0.00035097537,0.00041519784,0.00068497856,0.00017692384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041797888,0.00035732705,0.0002728704,0.00080651673,0.0011585235,0.0008696784,0.00069642824,0.0003236457,0.00016903965],"category_scores_gemma":[0.0000036847225,0.0003417242,0.00013912054,0.0012549298,0.00011533489,0.0060903565,4.6733007e-7,0.0007249876,0.0007057862],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025583186,0.0002604772,0.0000036209412,0.00011185882,0.000027677046,0.0000010987397,0.00097276544,0.011504613,0.017757293,0.00006125774,0.00021896277,0.9690548],"study_design_scores_gemma":[0.001035728,0.00037079933,0.00007383878,0.00043069027,0.00005780318,0.00006182725,0.00042981526,0.452462,0.54222035,0.0005786888,0.0015596877,0.0007187868],"about_ca_topic_score_codex":0.000035676276,"about_ca_topic_score_gemma":0.0000072501375,"teacher_disagreement_score":0.990424,"about_ca_system_score_codex":0.00021455815,"about_ca_system_score_gemma":0.0002494422,"threshold_uncertainty_score":0.9999035},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022722343,0.000017877104,0.9929884,0.00055296574,0.00034259172,0.0002744025,0.000008998065,0.000746734,0.0027958076],"genre_scores_gemma":[0.9944626,0.000003651187,0.003877389,0.0011996942,0.0001696591,0.00006892009,0.0000033128433,0.000025841493,0.00018893907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975208,0.00007953173,0.0006146389,0.0005330068,0.00070439995,0.0005476276],"domain_scores_gemma":[0.99829453,0.00013100891,0.0002986073,0.00033993466,0.0007294452,0.00020647055],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00045604075,0.00032984227,0.00023217993,0.00064493483,0.0016655085,0.0010261815,0.0006353203,0.00017186913,0.00012963105],"category_scores_gemma":[0.0000072579337,0.00032937643,0.00013734713,0.0015837969,0.00014317263,0.005104033,8.5629625e-7,0.000554257,0.00039478907],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008151788,0.00018219226,0.000002761153,0.00006772934,0.00001842447,0.0000016491962,0.0015929013,0.009789669,0.0044239336,0.00005505784,0.00006755529,0.98379],"study_design_scores_gemma":[0.0006782868,0.0005923974,0.000037158192,0.00041688894,0.000051352803,0.00008277522,0.000195239,0.7359191,0.26003787,0.0005740895,0.00077193667,0.0006429023],"about_ca_topic_score_codex":0.000019306051,"about_ca_topic_score_gemma":0.000011220905,"teacher_disagreement_score":0.99219036,"about_ca_system_score_codex":0.0001815849,"about_ca_system_score_gemma":0.00038454155,"threshold_uncertainty_score":0.99991584},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022722343,0.000017877104,0.9929884,0.00055296574,0.00034259172,0.0002744025,0.000008998065,0.000746734,0.0027958076],"genre_scores_gemma":[0.9944626,0.000003651187,0.003877389,0.0011996942,0.0001696591,0.00006892009,0.0000033128433,0.000025841493,0.00018893907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975208,0.00007953173,0.0006146389,0.0005330068,0.00070439995,0.0005476276],"domain_scores_gemma":[0.99829453,0.00013100891,0.0002986073,0.00033993466,0.0007294452,0.00020647055],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00045604075,0.00032984227,0.00023217993,0.00064493483,0.0016655085,0.0010261815,0.0006353203,0.00017186913,0.00012963105],"category_scores_gemma":[0.0000072579337,0.00032937643,0.00013734713,0.0015837969,0.00014317263,0.005104033,8.5629625e-7,0.000554257,0.00039478907],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008151788,0.00018219226,0.000002761153,0.00006772934,0.00001842447,0.0000016491962,0.0015929013,0.009789669,0.0044239336,0.00005505784,0.00006755529,0.98379],"study_design_scores_gemma":[0.0006782868,0.0005923974,0.000037158192,0.00041688894,0.000051352803,0.00008277522,0.000195239,0.7359191,0.26003787,0.0005740895,0.00077193667,0.0006429023],"about_ca_topic_score_codex":0.000019306051,"about_ca_topic_score_gemma":0.000011220905,"teacher_disagreement_score":0.99219036,"about_ca_system_score_codex":0.0001815849,"about_ca_system_score_gemma":0.00038454155,"threshold_uncertainty_score":0.99991584},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022722343,0.000017877104,0.9929884,0.00055296574,0.00034259172,0.0002744025,0.000008998065,0.000746734,0.0027958076],"genre_scores_gemma":[0.9944626,0.000003651187,0.003877389,0.0011996942,0.0001696591,0.00006892009,0.0000033128433,0.000025841493,0.00018893907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975208,0.00007953173,0.0006146389,0.0005330068,0.00070439995,0.0005476276],"domain_scores_gemma":[0.99829453,0.00013100891,0.0002986073,0.00033993466,0.0007294452,0.00020647055],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00045604075,0.00032984227,0.00023217993,0.00064493483,0.0016655085,0.0010261815,0.0006353203,0.00017186913,0.00012963105],"category_scores_gemma":[0.0000072579337,0.00032937643,0.00013734713,0.0015837969,0.00014317263,0.005104033,8.5629625e-7,0.000554257,0.00039478907],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008151788,0.00018219226,0.000002761153,0.00006772934,0.00001842447,0.0000016491962,0.0015929013,0.009789669,0.0044239336,0.00005505784,0.00006755529,0.98379],"study_design_scores_gemma":[0.0006782868,0.0005923974,0.000037158192,0.00041688894,0.000051352803,0.00008277522,0.000195239,0.7359191,0.26003787,0.0005740895,0.00077193667,0.0006429023],"about_ca_topic_score_codex":0.000019306051,"about_ca_topic_score_gemma":0.000011220905,"teacher_disagreement_score":0.99219036,"about_ca_system_score_codex":0.0001815849,"about_ca_system_score_gemma":0.00038454155,"threshold_uncertainty_score":0.99991584},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031857349,0.000053805026,0.99176645,0.0015245402,0.00034870213,0.00068380614,0.000005385444,0.001088144,0.0013434226],"genre_scores_gemma":[0.9936097,0.0000076125293,0.004665966,0.00092281395,0.000053384403,0.00037307106,0.000003093734,0.000025200407,0.0003391308],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99734026,0.00010475464,0.00069804455,0.00052812754,0.0007901495,0.00053865154],"domain_scores_gemma":[0.998298,0.00007392417,0.00035097537,0.00041519784,0.00068497856,0.00017692384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041797888,0.00035732705,0.0002728704,0.00080651673,0.0011585235,0.0008696784,0.00069642824,0.0003236457,0.00016903965],"category_scores_gemma":[0.0000036847225,0.0003417242,0.00013912054,0.0012549298,0.00011533489,0.0060903565,4.6733007e-7,0.0007249876,0.0007057862],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025583186,0.0002604772,0.0000036209412,0.00011185882,0.000027677046,0.0000010987397,0.00097276544,0.011504613,0.017757293,0.00006125774,0.00021896277,0.9690548],"study_design_scores_gemma":[0.001035728,0.00037079933,0.00007383878,0.00043069027,0.00005780318,0.00006182725,0.00042981526,0.452462,0.54222035,0.0005786888,0.0015596877,0.0007187868],"about_ca_topic_score_codex":0.000035676276,"about_ca_topic_score_gemma":0.0000072501375,"teacher_disagreement_score":0.990424,"about_ca_system_score_codex":0.00021455815,"about_ca_system_score_gemma":0.0002494422,"threshold_uncertainty_score":0.9999035},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022722343,0.000017877104,0.9929884,0.00055296574,0.00034259172,0.0002744025,0.000008998065,0.000746734,0.0027958076],"genre_scores_gemma":[0.9944626,0.000003651187,0.003877389,0.0011996942,0.0001696591,0.00006892009,0.0000033128433,0.000025841493,0.00018893907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975208,0.00007953173,0.0006146389,0.0005330068,0.00070439995,0.0005476276],"domain_scores_gemma":[0.99829453,0.00013100891,0.0002986073,0.00033993466,0.0007294452,0.00020647055],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00045604075,0.00032984227,0.00023217993,0.00064493483,0.0016655085,0.0010261815,0.0006353203,0.00017186913,0.00012963105],"category_scores_gemma":[0.0000072579337,0.00032937643,0.00013734713,0.0015837969,0.00014317263,0.005104033,8.5629625e-7,0.000554257,0.00039478907],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008151788,0.00018219226,0.000002761153,0.00006772934,0.00001842447,0.0000016491962,0.0015929013,0.009789669,0.0044239336,0.00005505784,0.00006755529,0.98379],"study_design_scores_gemma":[0.0006782868,0.0005923974,0.000037158192,0.00041688894,0.000051352803,0.00008277522,0.000195239,0.7359191,0.26003787,0.0005740895,0.00077193667,0.0006429023],"about_ca_topic_score_codex":0.000019306051,"about_ca_topic_score_gemma":0.000011220905,"teacher_disagreement_score":0.99219036,"about_ca_system_score_codex":0.0001815849,"about_ca_system_score_gemma":0.00038454155,"threshold_uncertainty_score":0.99991584},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022722343,0.000017877104,0.9929884,0.00055296574,0.00034259172,0.0002744025,0.000008998065,0.000746734,0.0027958076],"genre_scores_gemma":[0.9944626,0.000003651187,0.003877389,0.0011996942,0.0001696591,0.00006892009,0.0000033128433,0.000025841493,0.00018893907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975208,0.00007953173,0.0006146389,0.0005330068,0.00070439995,0.0005476276],"domain_scores_gemma":[0.99829453,0.00013100891,0.0002986073,0.00033993466,0.0007294452,0.00020647055],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00045604075,0.00032984227,0.00023217993,0.00064493483,0.0016655085,0.0010261815,0.0006353203,0.00017186913,0.00012963105],"category_scores_gemma":[0.0000072579337,0.00032937643,0.00013734713,0.0015837969,0.00014317263,0.005104033,8.5629625e-7,0.000554257,0.00039478907],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008151788,0.00018219226,0.000002761153,0.00006772934,0.00001842447,0.0000016491962,0.0015929013,0.009789669,0.0044239336,0.00005505784,0.00006755529,0.98379],"study_design_scores_gemma":[0.0006782868,0.0005923974,0.000037158192,0.00041688894,0.000051352803,0.00008277522,0.000195239,0.7359191,0.26003787,0.0005740895,0.00077193667,0.0006429023],"about_ca_topic_score_codex":0.000019306051,"about_ca_topic_score_gemma":0.000011220905,"teacher_disagreement_score":0.99219036,"about_ca_system_score_codex":0.0001815849,"about_ca_system_score_gemma":0.00038454155,"threshold_uncertainty_score":0.99991584},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031857349,0.000053805026,0.99176645,0.0015245402,0.00034870213,0.00068380614,0.000005385444,0.001088144,0.0013434226],"genre_scores_gemma":[0.9936097,0.0000076125293,0.004665966,0.00092281395,0.000053384403,0.00037307106,0.000003093734,0.000025200407,0.0003391308],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99734026,0.00010475464,0.00069804455,0.00052812754,0.0007901495,0.00053865154],"domain_scores_gemma":[0.998298,0.00007392417,0.00035097537,0.00041519784,0.00068497856,0.00017692384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041797888,0.00035732705,0.0002728704,0.00080651673,0.0011585235,0.0008696784,0.00069642824,0.0003236457,0.00016903965],"category_scores_gemma":[0.0000036847225,0.0003417242,0.00013912054,0.0012549298,0.00011533489,0.0060903565,4.6733007e-7,0.0007249876,0.0007057862],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025583186,0.0002604772,0.0000036209412,0.00011185882,0.000027677046,0.0000010987397,0.00097276544,0.011504613,0.017757293,0.00006125774,0.00021896277,0.9690548],"study_design_scores_gemma":[0.001035728,0.00037079933,0.00007383878,0.00043069027,0.00005780318,0.00006182725,0.00042981526,0.452462,0.54222035,0.0005786888,0.0015596877,0.0007187868],"about_ca_topic_score_codex":0.000035676276,"about_ca_topic_score_gemma":0.0000072501375,"teacher_disagreement_score":0.990424,"about_ca_system_score_codex":0.00021455815,"about_ca_system_score_gemma":0.0002494422,"threshold_uncertainty_score":0.9999035},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031857349,0.000053805026,0.99176645,0.0015245402,0.00034870213,0.00068380614,0.000005385444,0.001088144,0.0013434226],"genre_scores_gemma":[0.9936097,0.0000076125293,0.004665966,0.00092281395,0.000053384403,0.00037307106,0.000003093734,0.000025200407,0.0003391308],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99734026,0.00010475464,0.00069804455,0.00052812754,0.0007901495,0.00053865154],"domain_scores_gemma":[0.998298,0.00007392417,0.00035097537,0.00041519784,0.00068497856,0.00017692384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041797888,0.00035732705,0.0002728704,0.00080651673,0.0011585235,0.0008696784,0.00069642824,0.0003236457,0.00016903965],"category_scores_gemma":[0.0000036847225,0.0003417242,0.00013912054,0.0012549298,0.00011533489,0.0060903565,4.6733007e-7,0.0007249876,0.0007057862],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025583186,0.0002604772,0.0000036209412,0.00011185882,0.000027677046,0.0000010987397,0.00097276544,0.011504613,0.017757293,0.00006125774,0.00021896277,0.9690548],"study_design_scores_gemma":[0.001035728,0.00037079933,0.00007383878,0.00043069027,0.00005780318,0.00006182725,0.00042981526,0.452462,0.54222035,0.0005786888,0.0015596877,0.0007187868],"about_ca_topic_score_codex":0.000035676276,"about_ca_topic_score_gemma":0.0000072501375,"teacher_disagreement_score":0.990424,"about_ca_system_score_codex":0.00021455815,"about_ca_system_score_gemma":0.0002494422,"threshold_uncertainty_score":0.9999035},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036777806,0.0000921262,0.96244437,0.00020566168,0.000041302883,0.00033318484,0.0000055841974,0.0000739675,0.00002599728],"genre_scores_gemma":[0.8552417,0.00001909021,0.14461307,0.000053717587,0.000023038423,0.000036123605,0.0000011747715,0.000009933212,0.0000021098008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878764,0.00011627934,0.00032889878,0.0003114381,0.0002218303,0.00023393925],"domain_scores_gemma":[0.9993972,0.00014252435,0.00016973319,0.00016972239,0.00008912091,0.000031694704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004191511,0.00015349832,0.00018177995,0.0002481998,0.0004289347,0.00013245565,0.00030712367,0.00007263122,0.000001315017],"category_scores_gemma":[0.0000030912233,0.00011535063,0.000061182924,0.00036703836,0.00010244688,0.0011105458,0.0000056265717,0.00019784716,6.94868e-8],"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.00011185124,0.00020982207,0.000067311936,0.00023995573,0.000013169095,0.000004729675,0.0047241086,0.29048678,0.039270174,0.00023043889,0.000005412244,0.66463625],"study_design_scores_gemma":[0.00026917175,0.000055743967,0.00008805364,0.00073103874,0.000011689193,0.000020064186,0.00013875804,0.79382557,0.2042236,0.00045572233,0.00004367811,0.00013693208],"about_ca_topic_score_codex":0.0000067375886,"about_ca_topic_score_gemma":0.0000052668283,"teacher_disagreement_score":0.8184639,"about_ca_system_score_codex":0.000028890066,"about_ca_system_score_gemma":0.000029632443,"threshold_uncertainty_score":0.47038624},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022722343,0.000017877104,0.9929884,0.00055296574,0.00034259172,0.0002744025,0.000008998065,0.000746734,0.0027958076],"genre_scores_gemma":[0.9944626,0.000003651187,0.003877389,0.0011996942,0.0001696591,0.00006892009,0.0000033128433,0.000025841493,0.00018893907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975208,0.00007953173,0.0006146389,0.0005330068,0.00070439995,0.0005476276],"domain_scores_gemma":[0.99829453,0.00013100891,0.0002986073,0.00033993466,0.0007294452,0.00020647055],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00045604075,0.00032984227,0.00023217993,0.00064493483,0.0016655085,0.0010261815,0.0006353203,0.00017186913,0.00012963105],"category_scores_gemma":[0.0000072579337,0.00032937643,0.00013734713,0.0015837969,0.00014317263,0.005104033,8.5629625e-7,0.000554257,0.00039478907],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008151788,0.00018219226,0.000002761153,0.00006772934,0.00001842447,0.0000016491962,0.0015929013,0.009789669,0.0044239336,0.00005505784,0.00006755529,0.98379],"study_design_scores_gemma":[0.0006782868,0.0005923974,0.000037158192,0.00041688894,0.000051352803,0.00008277522,0.000195239,0.7359191,0.26003787,0.0005740895,0.00077193667,0.0006429023],"about_ca_topic_score_codex":0.000019306051,"about_ca_topic_score_gemma":0.000011220905,"teacher_disagreement_score":0.99219036,"about_ca_system_score_codex":0.0001815849,"about_ca_system_score_gemma":0.00038454155,"threshold_uncertainty_score":0.99991584},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022722343,0.000017877104,0.9929884,0.00055296574,0.00034259172,0.0002744025,0.000008998065,0.000746734,0.0027958076],"genre_scores_gemma":[0.9944626,0.000003651187,0.003877389,0.0011996942,0.0001696591,0.00006892009,0.0000033128433,0.000025841493,0.00018893907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975208,0.00007953173,0.0006146389,0.0005330068,0.00070439995,0.0005476276],"domain_scores_gemma":[0.99829453,0.00013100891,0.0002986073,0.00033993466,0.0007294452,0.00020647055],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00045604075,0.00032984227,0.00023217993,0.00064493483,0.0016655085,0.0010261815,0.0006353203,0.00017186913,0.00012963105],"category_scores_gemma":[0.0000072579337,0.00032937643,0.00013734713,0.0015837969,0.00014317263,0.005104033,8.5629625e-7,0.000554257,0.00039478907],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008151788,0.00018219226,0.000002761153,0.00006772934,0.00001842447,0.0000016491962,0.0015929013,0.009789669,0.0044239336,0.00005505784,0.00006755529,0.98379],"study_design_scores_gemma":[0.0006782868,0.0005923974,0.000037158192,0.00041688894,0.000051352803,0.00008277522,0.000195239,0.7359191,0.26003787,0.0005740895,0.00077193667,0.0006429023],"about_ca_topic_score_codex":0.000019306051,"about_ca_topic_score_gemma":0.000011220905,"teacher_disagreement_score":0.99219036,"about_ca_system_score_codex":0.0001815849,"about_ca_system_score_gemma":0.00038454155,"threshold_uncertainty_score":0.99991584},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022722343,0.000017877104,0.9929884,0.00055296574,0.00034259172,0.0002744025,0.000008998065,0.000746734,0.0027958076],"genre_scores_gemma":[0.9944626,0.000003651187,0.003877389,0.0011996942,0.0001696591,0.00006892009,0.0000033128433,0.000025841493,0.00018893907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975208,0.00007953173,0.0006146389,0.0005330068,0.00070439995,0.0005476276],"domain_scores_gemma":[0.99829453,0.00013100891,0.0002986073,0.00033993466,0.0007294452,0.00020647055],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00045604075,0.00032984227,0.00023217993,0.00064493483,0.0016655085,0.0010261815,0.0006353203,0.00017186913,0.00012963105],"category_scores_gemma":[0.0000072579337,0.00032937643,0.00013734713,0.0015837969,0.00014317263,0.005104033,8.5629625e-7,0.000554257,0.00039478907],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008151788,0.00018219226,0.000002761153,0.00006772934,0.00001842447,0.0000016491962,0.0015929013,0.009789669,0.0044239336,0.00005505784,0.00006755529,0.98379],"study_design_scores_gemma":[0.0006782868,0.0005923974,0.000037158192,0.00041688894,0.000051352803,0.00008277522,0.000195239,0.7359191,0.26003787,0.0005740895,0.00077193667,0.0006429023],"about_ca_topic_score_codex":0.000019306051,"about_ca_topic_score_gemma":0.000011220905,"teacher_disagreement_score":0.99219036,"about_ca_system_score_codex":0.0001815849,"about_ca_system_score_gemma":0.00038454155,"threshold_uncertainty_score":0.99991584},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017371677,0.00007862004,0.9932627,0.0011870025,0.00048130302,0.0004475241,0.00000740776,0.0011029452,0.0016952996],"genre_scores_gemma":[0.9939271,0.0000052098685,0.004803064,0.0007325818,0.00006494538,0.00015976012,0.0000036162037,0.00002437391,0.0002793305],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972349,0.00012286316,0.0006643327,0.0005133122,0.00096773874,0.0004968428],"domain_scores_gemma":[0.9981542,0.000057976227,0.00034791324,0.00040564602,0.00078648014,0.00024777616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074910145,0.0003432653,0.00027613065,0.00080804346,0.00085394946,0.00062112906,0.00068368064,0.00031744558,0.000031745767],"category_scores_gemma":[0.000006253164,0.0003345322,0.0001222513,0.00136272,0.000112579335,0.0046109413,4.9430923e-7,0.00069771445,0.0002957645],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009093006,0.000332055,0.000004370185,0.00009887024,0.000030872132,0.0000030523047,0.002069136,0.03160338,0.00570066,0.000090712376,0.00028145255,0.9596945],"study_design_scores_gemma":[0.0018631077,0.0006217936,0.000021117889,0.0004637118,0.000082464874,0.000107017266,0.00081395596,0.46905318,0.5211601,0.00066710403,0.004321038,0.0008253971],"about_ca_topic_score_codex":0.000017727047,"about_ca_topic_score_gemma":0.00000944734,"teacher_disagreement_score":0.99218994,"about_ca_system_score_codex":0.00031024066,"about_ca_system_score_gemma":0.0004919675,"threshold_uncertainty_score":0.99991065},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08111904,0.00012746423,0.9168046,0.00023868876,0.0009427479,0.00030391396,0.00002118278,0.00024071641,0.00020164067],"genre_scores_gemma":[0.9960252,0.0000018949347,0.0034319344,0.00019700412,0.00014906174,0.00008467789,0.0000010355402,0.000021745787,0.00008743384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975161,0.00021521011,0.0004691743,0.00048356992,0.00040466018,0.00091128756],"domain_scores_gemma":[0.9987079,0.00040025602,0.00016362032,0.00036925395,0.00007360938,0.00028536445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047671772,0.0002852556,0.00033467318,0.00020905404,0.00045929186,0.00022058997,0.0004538434,0.00017673604,0.000047449543],"category_scores_gemma":[0.000028467177,0.00028922234,0.00012311984,0.0006069701,0.00007201545,0.0007023777,0.000005507682,0.00055966515,0.000060034654],"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.0003424492,0.0047817826,0.0041943155,0.00042332106,0.0001773438,0.00026001094,0.012433535,0.11222829,0.006685472,0.0024440775,0.00016737558,0.855862],"study_design_scores_gemma":[0.0029028798,0.0003668298,0.0055646,0.0011456226,0.00007792026,0.000269589,0.00025490744,0.9634903,0.022093827,0.0011213829,0.0012945635,0.0014175803],"about_ca_topic_score_codex":0.000032097218,"about_ca_topic_score_gemma":0.000021830365,"teacher_disagreement_score":0.91490614,"about_ca_system_score_codex":0.00022605144,"about_ca_system_score_gemma":0.00018172762,"threshold_uncertainty_score":0.999956},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016561761,0.0003705804,0.9814814,0.00007068534,0.00013145726,0.00034403516,0.00004997594,0.00061658013,0.00037357322],"genre_scores_gemma":[0.98075616,0.000028564114,0.01860927,0.00013437291,0.00005070861,0.00020071458,0.000003695075,0.000076698896,0.00013980325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896705,0.000018426861,0.0002034391,0.0002997179,0.00022058917,0.00029080082],"domain_scores_gemma":[0.9995787,0.00009393854,0.00005041406,0.00012993562,0.00007319193,0.00007377999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121755045,0.00023065529,0.000217695,0.000197881,0.00055599504,0.00008935609,0.00011307593,0.00005658246,0.000038872327],"category_scores_gemma":[9.241375e-7,0.00023108472,0.00006487081,0.00029170178,0.000057466,0.00019751808,0.0000021522035,0.00032692577,9.473463e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015062776,0.00010970938,6.6479566e-7,0.000058184305,0.00007701772,0.0000063171747,0.00019622763,0.735005,0.054957233,0.000005719716,0.0002773179,0.20915599],"study_design_scores_gemma":[0.0012985421,0.0009195438,0.0000059580857,0.00024895987,0.00017047637,0.00021189306,0.00034466328,0.7458091,0.23743045,0.00036849637,0.012451509,0.00074041134],"about_ca_topic_score_codex":0.000013726343,"about_ca_topic_score_gemma":0.000011264236,"teacher_disagreement_score":0.9641944,"about_ca_system_score_codex":0.00007574055,"about_ca_system_score_gemma":0.00006320437,"threshold_uncertainty_score":0.94233614},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03103668,0.000256586,0.96501076,0.00008169112,0.00043034967,0.000114885916,0.000009726055,0.0007367138,0.0023226147],"genre_scores_gemma":[0.9949748,0.000042175812,0.0026517243,0.00029450268,0.00047464162,0.00004417335,0.000008418456,0.00007743137,0.0014321445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983509,0.000051894644,0.00036948815,0.00036245573,0.00049446785,0.00037078408],"domain_scores_gemma":[0.9994081,0.000034603843,0.000055188768,0.00013966385,0.00022437083,0.00013807346],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002235742,0.00027410468,0.0002252106,0.00010118304,0.0005909757,0.00024764834,0.00011602567,0.00018077077,0.007923808],"category_scores_gemma":[9.382113e-7,0.0003029805,0.00020079577,0.0004688936,0.00007396683,0.0005843689,7.301581e-7,0.0005318434,0.00089916884],"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.000012523242,0.00010104539,0.000002440499,0.00029420765,0.00003566994,0.0000072514185,0.0017823114,0.3800788,0.15370807,3.6832574e-7,0.002434665,0.46154264],"study_design_scores_gemma":[0.0006163098,0.000043698987,0.000078892765,0.00031339165,0.000097258635,0.000040243067,0.0009181476,0.8352589,0.15822138,0.000092918184,0.0037948918,0.0005239552],"about_ca_topic_score_codex":4.1108584e-7,"about_ca_topic_score_gemma":0.000008983788,"teacher_disagreement_score":0.9639381,"about_ca_system_score_codex":0.00021878343,"about_ca_system_score_gemma":0.00021215135,"threshold_uncertainty_score":0.99994224},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013821375,0.00021036483,0.9838992,0.000040182847,0.00024574084,0.00020404543,0.000027109281,0.0014717625,0.00008024489],"genre_scores_gemma":[0.9975118,0.000010536237,0.0020974907,0.00006713012,0.000015258024,0.00021129858,0.00004333308,0.00002852327,0.000014611917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990979,0.000015668027,0.00027528143,0.00013082477,0.00025839172,0.00022196404],"domain_scores_gemma":[0.9996937,0.00003072449,0.00005905999,0.00010711132,0.00007371848,0.00003568413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009075085,0.00016013582,0.00012091305,0.0002905782,0.00057695556,0.00010374308,0.00014386626,0.00005409676,0.0000955817],"category_scores_gemma":[0.0000018113435,0.00017821649,0.000038636535,0.0006436638,0.000036552618,0.0007816962,0.0000023610953,0.00032370153,0.000030501387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016680298,0.000025196996,0.0000031021377,0.000065818596,0.000012631672,0.0000012634846,0.0007415929,0.6883856,0.001080038,0.0000015967765,0.000019942549,0.30964652],"study_design_scores_gemma":[0.000249567,0.000082117505,0.00002177088,0.000047503978,0.000022247368,0.0000061506366,0.0008692944,0.9153984,0.082023405,0.0004681559,0.00058771984,0.00022364069],"about_ca_topic_score_codex":0.000030139472,"about_ca_topic_score_gemma":0.000003531358,"teacher_disagreement_score":0.98369044,"about_ca_system_score_codex":0.00016521002,"about_ca_system_score_gemma":0.000036003516,"threshold_uncertainty_score":0.7267457},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10063473,0.0016692524,0.89592445,0.00011686081,0.00022604218,0.00086927204,0.00021104296,0.00010989147,0.00023843237],"genre_scores_gemma":[0.9900797,0.00016107809,0.0039403993,0.00019855214,0.00031293777,0.0013067732,0.00032024842,0.00012163806,0.0035586457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99722177,0.00012550956,0.00058950594,0.0011303695,0.0003883132,0.0005445593],"domain_scores_gemma":[0.99831724,0.00007502609,0.00041224557,0.000558179,0.00048631357,0.0001509852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039021988,0.0005323049,0.00058078393,0.00015385204,0.0006254219,0.00020927834,0.00059610826,0.00043013075,0.00044947892],"category_scores_gemma":[0.000021720038,0.00058453984,0.0004189806,0.00029235551,0.0000982825,0.000015204468,0.000030141873,0.00051135477,0.000010918807],"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.00075067166,0.00049522205,0.00009035571,0.0014610917,0.0006501141,0.0000053513418,0.00018073227,0.74437165,0.20188777,0.0000010363552,0.0008925673,0.049213417],"study_design_scores_gemma":[0.001784295,0.0012060486,0.000053867654,0.0006693253,0.001466378,0.000015643327,0.00034807858,0.08921512,0.88389736,0.0005629422,0.01836522,0.0024157495],"about_ca_topic_score_codex":0.000016205448,"about_ca_topic_score_gemma":0.000066459,"teacher_disagreement_score":0.89198405,"about_ca_system_score_codex":0.00008066431,"about_ca_system_score_gemma":0.0012879028,"threshold_uncertainty_score":0.9996606},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004299567,0.00038396145,0.99132496,0.00041768397,0.00090180215,0.0008258126,0.000053747048,0.0015453483,0.00024713305],"genre_scores_gemma":[0.96143967,0.0000034378768,0.036685713,0.00030581973,0.00007452794,0.00090692926,0.0000037937496,0.000069070644,0.0005110588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972487,0.00015945618,0.0005238303,0.0008249476,0.00065177074,0.00059127546],"domain_scores_gemma":[0.99848765,0.00033039314,0.00026914856,0.0005442363,0.00022331456,0.00014528378],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006746768,0.00034575546,0.0003670457,0.00031331726,0.0020601912,0.00044144195,0.001166238,0.00011067873,0.00006119959],"category_scores_gemma":[0.0000083957175,0.00037579355,0.00021854395,0.00096824975,0.000055341734,0.00078129454,0.0000152042285,0.0006186847,0.000011380671],"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.00064149906,0.0018585359,0.00012523645,0.0015537112,0.00032253182,0.00013080159,0.013166628,0.41862935,0.038377266,0.0014620642,0.0057090507,0.5180233],"study_design_scores_gemma":[0.0009460905,0.0007003939,0.000012986376,0.00033708414,0.00008017162,0.00037088373,0.0009734924,0.94981956,0.04106017,0.000854353,0.0040021003,0.00084269966],"about_ca_topic_score_codex":0.00033192334,"about_ca_topic_score_gemma":0.00015400615,"teacher_disagreement_score":0.9571401,"about_ca_system_score_codex":0.00041910505,"about_ca_system_score_gemma":0.0003470889,"threshold_uncertainty_score":0.9998694},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007814273,0.00006977691,0.98797274,0.00022692043,0.0016942446,0.00039882096,0.000008841396,0.0010649406,0.000749426],"genre_scores_gemma":[0.9983216,0.000015316658,0.0008919217,0.000086216816,0.00018298921,0.00012389655,0.0000043710675,0.000044927485,0.00032876735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997091,0.000099005905,0.00060833443,0.00079617824,0.00061218586,0.0007933254],"domain_scores_gemma":[0.9989324,0.00008833564,0.00017581071,0.00039821543,0.0001514227,0.0002537809],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049240625,0.0003519773,0.0003481227,0.0008635094,0.00058959395,0.00083182554,0.0005031366,0.00025256566,0.000012615255],"category_scores_gemma":[0.0000025379825,0.00035732397,0.00015089373,0.003492326,0.00005536073,0.000983544,0.000006974262,0.00065275776,0.00021806962],"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.00009705636,0.00020372638,0.0000028932707,0.000088114815,0.000024244247,0.000089304645,0.00048442368,0.15381257,0.0063588917,0.0000071586946,0.000056013654,0.8387756],"study_design_scores_gemma":[0.0015251045,0.000254131,0.000077058925,0.00028077987,0.000018549885,0.00008564486,0.00030641173,0.9547466,0.04126516,0.00028224502,0.00068695843,0.00047137623],"about_ca_topic_score_codex":0.00011663568,"about_ca_topic_score_gemma":0.00009841586,"teacher_disagreement_score":0.9905073,"about_ca_system_score_codex":0.0002862349,"about_ca_system_score_gemma":0.00012468031,"threshold_uncertainty_score":0.9998879},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022958437,0.000114086935,0.9761414,0.000016311424,0.00006298901,0.00037189995,0.000014072586,0.0002703994,0.000050422022],"genre_scores_gemma":[0.963309,0.00009010607,0.036393665,0.000006367888,0.000009221306,0.000081631304,0.000023733877,0.0000493168,0.000036973524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901116,0.000031167936,0.00042771763,0.0002003107,0.00014379728,0.00018585948],"domain_scores_gemma":[0.99966776,0.000047856673,0.00007746137,0.00008263586,0.00007595877,0.00004832568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019700175,0.00015767738,0.00017924202,0.00048622614,0.0000936376,0.00002660144,0.000044472374,0.0000955932,0.000010536194],"category_scores_gemma":[0.0000029651862,0.00018065325,0.000031556512,0.0007592408,0.000027641208,0.0005922168,4.5850365e-7,0.00016277377,0.0000032811063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014923608,0.000047856116,0.000007403115,0.00046514766,0.000005177633,0.0000011076157,0.0019292849,0.9208757,0.043548368,7.5643095e-7,0.0000011533141,0.0331031],"study_design_scores_gemma":[0.00074762246,0.000031052354,0.000026317273,0.00023345456,0.000015874135,0.0000021544215,0.00071209937,0.89919114,0.098881625,0.000008102992,0.0000018932282,0.00014867465],"about_ca_topic_score_codex":0.000017867202,"about_ca_topic_score_gemma":0.000036554782,"teacher_disagreement_score":0.94035053,"about_ca_system_score_codex":0.00009542611,"about_ca_system_score_gemma":0.000030663432,"threshold_uncertainty_score":0.7366826},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057132248,0.000074059935,0.940787,0.000006589827,0.00028319765,0.0005407511,0.00006955611,0.001043003,0.0000636058],"genre_scores_gemma":[0.9367661,0.000012644059,0.06279633,0.00000742481,0.000061789695,0.00014319354,0.000025430214,0.000114349255,0.00007272731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980809,0.000040780888,0.0005171857,0.00042283468,0.00030553603,0.0006327742],"domain_scores_gemma":[0.9994373,0.000064320884,0.00008441672,0.0001894509,0.00009541454,0.0001291172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021723099,0.00035748666,0.00036708338,0.00042364397,0.00031427795,0.00013421511,0.00017071638,0.00015042341,0.0000150638925],"category_scores_gemma":[0.0000021923795,0.0003411887,0.0000607934,0.0011034618,0.000070726455,0.0008474123,0.0000012828983,0.00047555403,0.00002825512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038658596,0.00006009075,0.000027260481,0.00045268537,0.00001958478,0.00002027815,0.0014491742,0.9754997,0.012802001,0.0000019063962,0.0000013927073,0.009627298],"study_design_scores_gemma":[0.0013437642,0.000057245557,0.00010294644,0.0006123386,0.000021523176,0.000044520748,0.0023610455,0.98537904,0.009647348,0.0000032415358,0.00001255835,0.0004144094],"about_ca_topic_score_codex":0.000031557087,"about_ca_topic_score_gemma":0.00015089363,"teacher_disagreement_score":0.87963384,"about_ca_system_score_codex":0.00024469718,"about_ca_system_score_gemma":0.00003585404,"threshold_uncertainty_score":0.99990404},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10628585,0.000110729,0.8925084,0.000064941654,0.00016498694,0.00013791119,0.000004215137,0.000639162,0.00008382462],"genre_scores_gemma":[0.97740114,0.00006542534,0.02236386,0.000058694237,0.000022664502,0.000016421844,9.99261e-7,0.000021210259,0.000049610557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852246,0.000063368825,0.00037494604,0.0004539686,0.00028214575,0.00030312434],"domain_scores_gemma":[0.99922323,0.0002099573,0.0001830845,0.0001850831,0.00010655383,0.00009206347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022434653,0.00018781806,0.0002507212,0.000501209,0.0003745576,0.0001034826,0.00018651268,0.00008755494,0.000022482154],"category_scores_gemma":[0.0000046454575,0.00018680716,0.000094808674,0.0017847631,0.000110928224,0.0008984359,0.000005161902,0.00028113832,0.000008986767],"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.000027911017,0.000033524015,0.000038918202,0.00006915091,0.000026052801,0.0000053254685,0.00028320338,0.113598295,0.20256935,0.000035271903,0.000010006956,0.683303],"study_design_scores_gemma":[0.0004056146,0.00010820656,0.0004147532,0.0004797,0.0000253913,0.00005998755,0.000027984348,0.84156597,0.1479372,0.008654544,0.000011011368,0.00030962718],"about_ca_topic_score_codex":0.0000069821135,"about_ca_topic_score_gemma":0.0000014828038,"teacher_disagreement_score":0.87111527,"about_ca_system_score_codex":0.000023838906,"about_ca_system_score_gemma":0.000040900562,"threshold_uncertainty_score":0.7617775},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10866235,0.00007978808,0.88319707,0.0055449693,0.00019239656,0.00016706812,0.0000018755611,0.0020486242,0.00010584416],"genre_scores_gemma":[0.96536356,0.000018985325,0.03417283,0.0002721653,0.00002673282,0.000053993266,0.0000023827781,0.00003237851,0.000056952584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976784,0.00014559543,0.00039303178,0.0006364882,0.00055262976,0.0005938353],"domain_scores_gemma":[0.9981279,0.0003892549,0.00014229366,0.0012038082,0.00007501332,0.0000617332],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.000999774,0.0002460085,0.0002149911,0.0005147447,0.0011305116,0.0006258078,0.0073971455,0.00016127809,0.000016841108],"category_scores_gemma":[0.0002513004,0.00022334236,0.000068058114,0.0030832428,0.00008509214,0.0014273037,0.0005081895,0.0013031333,0.00013259547],"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.000022864628,0.00008731766,0.00007730148,0.00010516686,0.000027374315,0.000074867094,0.0006853854,0.37359783,0.022141626,0.000030261328,0.00027347505,0.60287654],"study_design_scores_gemma":[0.00028702465,0.000037445436,0.00023321387,0.00029500088,0.000007731391,0.000022253076,0.0002615453,0.963896,0.021643892,0.012925369,0.00011686811,0.00027366047],"about_ca_topic_score_codex":0.00008785947,"about_ca_topic_score_gemma":0.00006922389,"teacher_disagreement_score":0.85670125,"about_ca_system_score_codex":0.00015988434,"about_ca_system_score_gemma":0.00013963091,"threshold_uncertainty_score":0.9979733},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2698684,0.000015728061,0.7271066,0.00010191966,0.000085796724,0.00027058754,0.0000031183363,0.0010665918,0.0014812875],"genre_scores_gemma":[0.9820968,0.0000014374822,0.016738096,0.0008838242,0.000085802916,0.00008445032,0.00000920441,0.00005149926,0.000048920003],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99835116,0.000045494748,0.00044053548,0.00028122572,0.00047341798,0.00040814176],"domain_scores_gemma":[0.9991724,0.00015373994,0.00020052484,0.00015771754,0.0002205702,0.000095085044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033898756,0.00025698528,0.00028515776,0.0005251227,0.0006979199,0.00018723811,0.00006966014,0.00011040347,0.000019898342],"category_scores_gemma":[0.000024466231,0.00021870335,0.00007872927,0.0017555775,0.00007695612,0.00089374883,0.0000016246986,0.0004426006,0.00008179473],"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.00026829142,0.00007785591,0.00008617601,0.00035171336,0.00004459963,0.000044028824,0.00051385583,0.0054932823,0.50181824,0.000002960383,0.000010213419,0.49128875],"study_design_scores_gemma":[0.0021942027,0.00033088317,0.00019507945,0.00084940303,0.00016121844,0.00044420865,0.000401375,0.4652668,0.52951634,0.000105556755,0.00020116434,0.0003337824],"about_ca_topic_score_codex":0.000048426915,"about_ca_topic_score_gemma":0.0000095144505,"teacher_disagreement_score":0.71222836,"about_ca_system_score_codex":0.00011165565,"about_ca_system_score_gemma":0.00012546442,"threshold_uncertainty_score":0.8918464},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033264994,0.000100607744,0.99395764,0.00008450113,0.0005449135,0.0005740453,0.000019064862,0.001015452,0.00037726064],"genre_scores_gemma":[0.998073,0.00003752503,0.0013130903,0.000030570365,0.00006687557,0.00028126416,0.000011155196,0.00006258238,0.0001239512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987424,0.000025597485,0.00045494142,0.0002383617,0.00018737142,0.00035131272],"domain_scores_gemma":[0.99963254,0.00004149154,0.00003299583,0.00012912237,0.00007015436,0.000093718554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023564494,0.00020608587,0.00022618442,0.0005720301,0.0001492797,0.000080925376,0.00011744079,0.00013037388,0.000009474397],"category_scores_gemma":[0.000002065373,0.00023067258,0.00004305662,0.0015792188,0.0000131820725,0.0006276648,4.456345e-7,0.00026240747,0.00020769461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020794681,0.000016350183,5.1711964e-7,0.0003195113,0.000007788226,0.000004233121,0.0015469242,0.97137743,0.0054498776,0.000010780996,0.000021782878,0.021224031],"study_design_scores_gemma":[0.00038921618,0.000033072705,0.000009107989,0.0004960431,0.000008957788,0.000010280983,0.00041234263,0.9887029,0.009560013,0.00003494038,0.00009214633,0.00025100965],"about_ca_topic_score_codex":0.000018294653,"about_ca_topic_score_gemma":0.00002384697,"teacher_disagreement_score":0.9947465,"about_ca_system_score_codex":0.00020708061,"about_ca_system_score_gemma":0.000031660675,"threshold_uncertainty_score":0.94065547},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11126597,0.00020535364,0.8854485,0.00049981155,0.00018747913,0.00034920327,0.00006420278,0.0018469384,0.00013254433],"genre_scores_gemma":[0.99653,0.00013621493,0.0029612407,0.00007739464,0.000028099083,0.00011876669,0.000050549745,0.00004987602,0.00004784181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990317,0.000021703805,0.00032509235,0.00019078447,0.00014067914,0.0002900145],"domain_scores_gemma":[0.99934185,0.00023770511,0.000049206817,0.0002497561,0.000085414635,0.000036091245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014028137,0.00017412307,0.0001907847,0.00043431923,0.00043947704,0.00012727687,0.00029672027,0.00014164844,0.000016270205],"category_scores_gemma":[0.000004414296,0.00018760949,0.000052459924,0.0009086523,0.000068946516,0.0004226672,0.000002919026,0.00025990457,0.000029458537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045699675,0.000066811794,0.000030080164,0.0004504702,0.000040494575,0.000003982987,0.0011419492,0.8152399,0.040536102,0.00041689354,0.0000733651,0.14195424],"study_design_scores_gemma":[0.0009198061,0.00006027853,0.00020674895,0.00043194153,0.00004001349,0.0000040698355,0.0011721198,0.629271,0.3638933,0.0033897264,0.0002517401,0.0003592952],"about_ca_topic_score_codex":0.00005259167,"about_ca_topic_score_gemma":0.00010229555,"teacher_disagreement_score":0.88526404,"about_ca_system_score_codex":0.000089190966,"about_ca_system_score_gemma":0.0000262915,"threshold_uncertainty_score":0.7650493},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002893767,0.0003609618,0.9948953,0.000027828119,0.00037030797,0.00055014226,0.000040431692,0.00083177665,0.000029500312],"genre_scores_gemma":[0.8496551,0.000024401526,0.14991197,0.000011847964,0.00009349895,0.00014461752,0.000007367987,0.000086351545,0.00006483693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883485,0.000016779417,0.0003481395,0.00036396913,0.000119714794,0.00031656312],"domain_scores_gemma":[0.99962014,0.000070693364,0.00004183025,0.00007586766,0.00009967106,0.0000918241],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013344876,0.00025755982,0.00022409316,0.0002689442,0.0003563869,0.00018758267,0.000052497086,0.00012251582,0.000015756956],"category_scores_gemma":[0.0000042196443,0.00026510662,0.00008189851,0.0003530614,0.000053848606,0.00076100795,9.0114736e-7,0.00029808874,0.0000070001242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023461238,0.000043575234,6.988841e-7,0.0011678506,0.000032051932,0.0000024921353,0.00045090617,0.8365147,0.10061633,0.00001257757,0.000004676087,0.0611307],"study_design_scores_gemma":[0.000437984,0.00006442881,0.0000039657057,0.00073223584,0.000056734585,0.000034307697,0.00026505435,0.94993544,0.0481038,0.000053618158,0.000038196707,0.00027425704],"about_ca_topic_score_codex":0.0000074924933,"about_ca_topic_score_gemma":0.00005049305,"teacher_disagreement_score":0.84676135,"about_ca_system_score_codex":0.00020613376,"about_ca_system_score_gemma":0.000028561088,"threshold_uncertainty_score":0.9999801},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004916348,0.0008483142,0.992275,0.000056563516,0.00045886272,0.00030555847,0.000017624345,0.00044126002,0.00068046176],"genre_scores_gemma":[0.9864645,0.0005155417,0.012420554,0.000028463062,0.0000958786,0.000165858,0.000041095318,0.00007318812,0.00019491259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990572,0.00001802728,0.00033241248,0.00022502373,0.00010702095,0.00026032815],"domain_scores_gemma":[0.9996399,0.000066307315,0.000026047204,0.00016714085,0.00005228777,0.000048265392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001533562,0.00018246892,0.00015362268,0.00024540414,0.00033096195,0.00015552093,0.00014784883,0.000111164794,0.00005715037],"category_scores_gemma":[7.795835e-7,0.00019733892,0.000079854944,0.00054369675,0.000025411211,0.00062387757,0.0000019895506,0.0002797042,0.000004778034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013817558,0.000072584226,0.0000011563236,0.00020577107,0.000009538132,8.4524373e-7,0.00043660498,0.92221254,0.0006471537,0.000011523533,0.00009551752,0.07629296],"study_design_scores_gemma":[0.0002623606,0.000039477207,0.0000015159832,0.00042506354,0.00003448,0.00000364128,0.00008643582,0.9911694,0.006081375,0.000029991072,0.0016554277,0.0002108416],"about_ca_topic_score_codex":0.0000036554734,"about_ca_topic_score_gemma":0.000013832278,"teacher_disagreement_score":0.9815482,"about_ca_system_score_codex":0.00013816662,"about_ca_system_score_gemma":0.000047340454,"threshold_uncertainty_score":0.80472475},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001497158,0.000779125,0.99583334,0.00045651876,0.0005279723,0.00018962797,0.000005191831,0.00060874486,0.00010231872],"genre_scores_gemma":[0.9420366,0.000021661952,0.05707891,0.00019974224,0.00008297193,0.00008013513,6.726808e-7,0.000030381298,0.00046891364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864274,0.000018175057,0.00020933386,0.00052012777,0.00022734782,0.00038225472],"domain_scores_gemma":[0.9994204,0.00020530829,0.000038697373,0.00019144193,0.000057725247,0.000086397515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014513984,0.00017917746,0.00014377077,0.00055635325,0.00039858965,0.00052247,0.00039990275,0.00006201214,0.000014458261],"category_scores_gemma":[0.0000018480375,0.00016988911,0.00013442182,0.0016586377,0.00004714046,0.001296836,0.0000028318107,0.00028818884,0.000025271243],"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.0000095760015,0.000023753606,4.8816895e-7,0.00012571218,0.000013641244,0.000008355156,0.00008869839,0.257821,0.004615154,0.0001037641,0.0001109998,0.73707885],"study_design_scores_gemma":[0.00015730721,0.0001236719,0.0000053811823,0.00026151282,0.000016887174,0.00003227311,0.00001781739,0.94537795,0.049260322,0.0027558964,0.0017385638,0.00025242873],"about_ca_topic_score_codex":0.000002510896,"about_ca_topic_score_gemma":0.000001333803,"teacher_disagreement_score":0.9405395,"about_ca_system_score_codex":0.00006384385,"about_ca_system_score_gemma":0.000045873152,"threshold_uncertainty_score":0.6927877},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025006582,0.0004163366,0.99389493,0.00052552606,0.0002396191,0.00018569572,0.0000085586435,0.00087570044,0.001352986],"genre_scores_gemma":[0.998515,0.000109602246,0.00078302843,0.0002758117,0.00007347596,0.000052909316,0.0000097133025,0.000034689456,0.00014575197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989832,0.00003695633,0.00036431744,0.00016403162,0.00025033965,0.00020117046],"domain_scores_gemma":[0.99949324,0.000094018855,0.000034482677,0.00017229763,0.00014015396,0.00006577596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118049815,0.00019159845,0.00014633646,0.00025328176,0.00030544063,0.0005127386,0.00016641148,0.00012725998,0.00022507901],"category_scores_gemma":[8.222648e-7,0.00017487378,0.000079066886,0.00045663922,0.000025732195,0.0014689928,0.0000020798168,0.00034144925,0.00022412695],"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.000050152215,0.00005847701,0.0000020650148,0.0005353825,0.000107024694,0.0000046388996,0.007908738,0.42044982,0.013851086,0.00033542552,0.0003172377,0.55638],"study_design_scores_gemma":[0.00035985486,0.00009732946,0.0000056886374,0.0005669817,0.000060414,0.00003389237,0.002754118,0.72643656,0.2452891,0.0014329088,0.02254506,0.0004180926],"about_ca_topic_score_codex":0.00007807603,"about_ca_topic_score_gemma":0.000019646912,"teacher_disagreement_score":0.99601436,"about_ca_system_score_codex":0.00022266115,"about_ca_system_score_gemma":0.000054388976,"threshold_uncertainty_score":0.71311456},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01436836,0.00006403919,0.9840724,0.00006642362,0.00037194559,0.0001491886,0.000013285421,0.00022796684,0.0006663765],"genre_scores_gemma":[0.99665064,0.0000113067335,0.002745582,0.000048114314,0.000058594174,0.000021329492,0.0000035596222,0.000012177905,0.000448692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988944,0.000011402585,0.00023847833,0.00034137047,0.00035110323,0.00016324728],"domain_scores_gemma":[0.99960196,0.000049728184,0.000058573896,0.00021131194,0.000035290013,0.000043165353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015230288,0.00013121453,0.0001112483,0.00020971084,0.00014017131,0.00029519756,0.00028238166,0.000046008154,0.000032549182],"category_scores_gemma":[7.436576e-7,0.000112609465,0.00007594164,0.00035973985,0.000038041955,0.00080157304,0.0000021971014,0.00015880706,0.000047130783],"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.000020577181,0.00010696019,3.3508695e-7,0.00013035712,0.000024375855,0.00003462445,0.00030113154,0.07120592,0.0016624117,0.00027830186,0.00006179943,0.9261732],"study_design_scores_gemma":[0.00014705553,0.0003997565,0.0000028293246,0.00024250256,0.000019894947,0.000017327025,0.000031666477,0.8581593,0.13932908,0.00071052334,0.0007689826,0.00017110183],"about_ca_topic_score_codex":0.000016278052,"about_ca_topic_score_gemma":0.0000064804344,"teacher_disagreement_score":0.9822823,"about_ca_system_score_codex":0.000034164066,"about_ca_system_score_gemma":0.000051008992,"threshold_uncertainty_score":0.45920807},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006749689,0.00042499977,0.9900053,0.000027415366,0.00023153453,0.00018158946,0.0000068165223,0.0017658831,0.0006067334],"genre_scores_gemma":[0.9988639,0.00010612681,0.00074566377,0.00003706186,0.0000450822,0.000043467695,0.000012975466,0.00007593075,0.00006983676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998966,0.00002514234,0.000270462,0.0002685001,0.00019850829,0.00027140827],"domain_scores_gemma":[0.999733,0.000046667905,0.000022424907,0.00010296535,0.000057348887,0.000037600243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105082705,0.00021537495,0.00018364743,0.00040165172,0.00014115234,0.00017141608,0.00008687348,0.00017768721,0.000048335332],"category_scores_gemma":[0.0000012461628,0.00019501185,0.000040470557,0.0013246671,0.00005979556,0.00039582475,5.761812e-7,0.00031656845,0.000015849333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023939278,0.000028068827,0.00004894753,0.00027969084,0.000018084404,0.00002026735,0.00021313582,0.95550096,0.0008973686,0.0000421874,0.000027575694,0.04289978],"study_design_scores_gemma":[0.0001775151,0.000036827558,0.000008694481,0.0006420652,0.000019657282,0.000008473138,0.00013627892,0.8955948,0.1029262,0.00003199639,0.00018454263,0.00023296029],"about_ca_topic_score_codex":0.00000775479,"about_ca_topic_score_gemma":0.00003225171,"teacher_disagreement_score":0.9921142,"about_ca_system_score_codex":0.00012908998,"about_ca_system_score_gemma":0.000042955475,"threshold_uncertainty_score":0.7952352},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059846113,0.00040918746,0.99580663,0.000044713808,0.0010527646,0.00038453026,0.000027731936,0.0011103554,0.0005656095],"genre_scores_gemma":[0.9832701,0.000014586191,0.015880076,0.000025259065,0.00025189726,0.00006963903,0.000005184066,0.0001088941,0.00037436667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905276,0.000013758868,0.00024216772,0.00028740775,0.00012326968,0.0002806337],"domain_scores_gemma":[0.99962276,0.00011628259,0.000022018801,0.00008730601,0.00008347946,0.00006814048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009409305,0.00020736028,0.00017533213,0.00022156823,0.00020727635,0.00014608004,0.00005930261,0.00011966017,0.000019023571],"category_scores_gemma":[0.000002251625,0.00021611704,0.00009339102,0.00038129126,0.000027818696,0.00056419254,3.3949001e-7,0.00025720696,0.000026146581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025613823,0.0000084064795,1.33022615e-8,0.0003397364,0.000028998384,0.0000035475439,0.000505519,0.61998147,0.012673001,0.000010012782,0.000041806295,0.36638188],"study_design_scores_gemma":[0.00016277036,0.000042323732,7.634494e-8,0.00052744895,0.000038550323,0.000023990604,0.00017033005,0.81389076,0.18359396,0.0002597593,0.0010787947,0.00021121277],"about_ca_topic_score_codex":0.000001731007,"about_ca_topic_score_gemma":0.0000033638835,"teacher_disagreement_score":0.9826716,"about_ca_system_score_codex":0.00018981585,"about_ca_system_score_gemma":0.000047281417,"threshold_uncertainty_score":0.88129973},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081407325,0.0014420875,0.98815984,0.00044825286,0.00078754785,0.00019562725,0.000004639622,0.00047232507,0.00034896712],"genre_scores_gemma":[0.8682667,0.000011987394,0.13029996,0.0007110298,0.0002438101,0.000023883282,5.70288e-7,0.000041995117,0.00040008783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978395,0.00029781926,0.00036094364,0.00060674973,0.000458275,0.00043672253],"domain_scores_gemma":[0.9990534,0.00026976818,0.000058065296,0.00037827055,0.00013873007,0.00010174917],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010469485,0.0002846687,0.00023022496,0.0002561826,0.0011491873,0.0019747482,0.0007414179,0.00010043997,0.000060903967],"category_scores_gemma":[0.0000052470346,0.00019756229,0.00018847059,0.0011091032,0.00011884238,0.0010188896,0.0000070967285,0.0005399749,0.00003652335],"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.000057118043,0.00007981685,5.473163e-7,0.00013758116,0.00006924997,0.00007929577,0.0031341505,0.04833623,0.2558426,0.0024411222,0.000046790155,0.6897755],"study_design_scores_gemma":[0.00031024197,0.000078862606,0.0000015294853,0.00039783667,0.000064487205,0.00016395605,0.0000885482,0.84047836,0.15312493,0.0036783116,0.0012719037,0.00034105117],"about_ca_topic_score_codex":0.000026829051,"about_ca_topic_score_gemma":0.000002618644,"teacher_disagreement_score":0.86012596,"about_ca_system_score_codex":0.000110494715,"about_ca_system_score_gemma":0.00032748387,"threshold_uncertainty_score":0.9990613},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001144838,0.00007699112,0.99812853,0.000058695627,0.00007554746,0.00015463465,0.00007382621,0.00014380246,0.0001431255],"genre_scores_gemma":[0.5207334,0.0000032350295,0.47914258,0.000008823519,0.000038771508,0.0000031798331,0.0000071203785,0.000025517302,0.000037328256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987665,0.00006886993,0.00031587871,0.0003765849,0.00030568097,0.00016652186],"domain_scores_gemma":[0.99897796,0.0004257634,0.00009518296,0.00031584897,0.000102843296,0.00008240628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038294948,0.00015861436,0.00021508422,0.00011591682,0.00022264915,0.00006313633,0.00016730059,0.000080209196,0.000044146524],"category_scores_gemma":[0.000018069619,0.00011349322,0.000032135962,0.00024757313,0.00005300584,0.0009118275,0.000001626633,0.00024997254,9.553489e-7],"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.0003383675,0.00022353142,5.598031e-7,0.0008572538,0.00003955646,0.000017251179,0.000700658,0.09435318,0.019240016,0.0015447007,0.00001291901,0.882672],"study_design_scores_gemma":[0.0002473135,0.0002062449,7.418204e-7,0.0014036578,0.0001452579,0.000012552041,0.00011257558,0.9444445,0.02278009,0.030450663,0.000042293454,0.00015410253],"about_ca_topic_score_codex":0.0000052185874,"about_ca_topic_score_gemma":0.000007617303,"teacher_disagreement_score":0.88251793,"about_ca_system_score_codex":0.000032586366,"about_ca_system_score_gemma":0.00014947871,"threshold_uncertainty_score":0.46281192},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102157004,0.0002188875,0.8943761,0.00045835474,0.0018504214,0.00026948913,0.0000011230364,0.00043817135,0.00023044883],"genre_scores_gemma":[0.9938659,0.0000028323288,0.0053232387,0.00026902978,0.00040274786,0.00003545961,0.0000019294819,0.000029033481,0.00006981193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980271,0.00017552605,0.00040464028,0.0005853755,0.00037574722,0.0004316425],"domain_scores_gemma":[0.9986364,0.00092156336,0.00007061539,0.00021866955,0.00007959461,0.00007311953],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006550232,0.00025644284,0.00019504798,0.0004989665,0.00076061895,0.0015262575,0.0006991226,0.000098291726,0.000006004608],"category_scores_gemma":[0.000007974176,0.00020668516,0.00011619024,0.0016239175,0.000057647296,0.0019007906,0.000011657122,0.0006016297,0.000081425125],"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.000041008658,0.00030255457,0.00007672038,0.0002884701,0.000033801276,0.0020821234,0.008897093,0.20755467,0.005949142,0.000017717757,0.00059861224,0.77415806],"study_design_scores_gemma":[0.0003411557,0.000067720815,0.00007542912,0.0003789841,0.000018401963,0.00072462665,0.000119283024,0.9926521,0.004794826,0.00015670244,0.00040517547,0.00026556355],"about_ca_topic_score_codex":0.00008750335,"about_ca_topic_score_gemma":0.00001835889,"teacher_disagreement_score":0.8917089,"about_ca_system_score_codex":0.00011557004,"about_ca_system_score_gemma":0.0001535815,"threshold_uncertainty_score":0.9995102},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061664157,0.0003574626,0.9367283,0.00011386388,0.0002071055,0.0002321016,0.0000011669167,0.0006018938,0.000093930474],"genre_scores_gemma":[0.98418236,0.000024437411,0.015432978,0.000056879297,0.0000669554,0.000036637706,7.6197836e-7,0.000029261888,0.00016974944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985305,0.000051175997,0.00019168819,0.0006203484,0.00028419986,0.00032210775],"domain_scores_gemma":[0.9995395,0.000115359224,0.000063565545,0.00011449736,0.00007005084,0.00009702829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109310655,0.00024530222,0.00016537977,0.00032643462,0.0006276771,0.00047176273,0.00015604327,0.000073436175,0.000008041287],"category_scores_gemma":[0.0000010433921,0.00019687421,0.000063047664,0.0012920266,0.00011556637,0.0013990161,0.0000023174919,0.00071635394,0.0000053265026],"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.000114916824,0.000075945754,0.00010277113,0.00015400055,0.00007175518,0.000104473795,0.003384237,0.118313506,0.013032301,0.0002479675,0.000008343532,0.8643898],"study_design_scores_gemma":[0.0003178451,0.0008169691,0.00016922918,0.00050785585,0.000045249686,0.0003285546,0.00011264278,0.96506685,0.03013356,0.0019578796,0.00012324208,0.00042013667],"about_ca_topic_score_codex":0.00000690534,"about_ca_topic_score_gemma":0.00002321534,"teacher_disagreement_score":0.9225182,"about_ca_system_score_codex":0.00007137582,"about_ca_system_score_gemma":0.00008640908,"threshold_uncertainty_score":0.80282974},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022799801,0.00044019712,0.97503865,0.0003971982,0.00038009553,0.00011641027,0.000008340715,0.00057040015,0.00024888673],"genre_scores_gemma":[0.8220526,0.000008532615,0.17743804,0.00017366424,0.00010156305,0.000016021066,0.0000024967962,0.000029290331,0.00017780895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980963,0.00006115959,0.0003564649,0.00066627807,0.00040608205,0.00041370763],"domain_scores_gemma":[0.9992582,0.0002644965,0.00006596881,0.00027057168,0.00005466774,0.000086055545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035190227,0.00023934561,0.00022033889,0.00028721345,0.00035542593,0.0007828909,0.00042442183,0.00010527413,0.000059124242],"category_scores_gemma":[0.0000026819696,0.00019583816,0.000060966988,0.0010487977,0.00006973161,0.0011715544,0.0000045150377,0.00067295705,0.00006753508],"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.000055486613,0.000095847834,0.000013229177,0.00023857661,0.0000214765,0.00016675718,0.0020068944,0.4849813,0.0041601406,0.00004619891,0.00011341559,0.5081007],"study_design_scores_gemma":[0.00022051806,0.000077402794,0.000028095981,0.0028946772,0.000013885792,0.000050737483,0.000033321256,0.9888206,0.0066701295,0.00046839524,0.00041455482,0.0003076967],"about_ca_topic_score_codex":0.000017248734,"about_ca_topic_score_gemma":0.00001332582,"teacher_disagreement_score":0.7992528,"about_ca_system_score_codex":0.00006707034,"about_ca_system_score_gemma":0.0001339669,"threshold_uncertainty_score":0.79860485},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10741129,0.0008349256,0.8899046,0.00013514602,0.000541926,0.00012590045,0.00004087901,0.00072865677,0.00027663735],"genre_scores_gemma":[0.98778576,0.00003566606,0.011592355,0.000065339664,0.00039679316,0.000024695351,0.000009764294,0.00006900096,0.00002061407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988614,0.00003328493,0.0002873873,0.00033535375,0.00021589056,0.00026669726],"domain_scores_gemma":[0.9996283,0.00008837624,0.00002301984,0.00009083137,0.0001005337,0.00006893298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011471534,0.00022344408,0.00019536303,0.00016659152,0.00028232456,0.00031126276,0.000078648576,0.00009512908,0.00020083443],"category_scores_gemma":[0.000002040684,0.00023179722,0.000075890806,0.0002692857,0.000025914478,0.00039753068,0.0000010150314,0.0003315596,0.0000695642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024905423,0.000026241787,1.9953646e-7,0.00020237984,0.000079754696,0.000018143544,0.0007602011,0.7725526,0.17208466,0.00019746496,0.0000064352867,0.054046977],"study_design_scores_gemma":[0.0002017231,0.000047931437,0.0000050351305,0.0013291846,0.00015930347,0.000007813523,0.00031000545,0.8077865,0.18792541,0.0018384125,0.000093397306,0.00029528353],"about_ca_topic_score_codex":0.00009774804,"about_ca_topic_score_gemma":0.0000048949296,"teacher_disagreement_score":0.8803745,"about_ca_system_score_codex":0.0002802993,"about_ca_system_score_gemma":0.000045696313,"threshold_uncertainty_score":0.9452417},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017433058,0.00050499727,0.9808609,0.00008967014,0.00026234178,0.00016281675,0.000070589325,0.00027534252,0.00034032072],"genre_scores_gemma":[0.9987697,0.00006327084,0.0007985693,0.00003768433,0.00007876152,0.000058540372,0.000020980335,0.000036030826,0.0001364575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991997,0.000011134371,0.00021728732,0.00024373193,0.00014244593,0.00018568564],"domain_scores_gemma":[0.9997003,0.0000784758,0.000023257304,0.00006940267,0.00007260848,0.000055936038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000089357934,0.00017612154,0.00015960982,0.00021585911,0.00018751931,0.00026437547,0.00005725621,0.00006348089,0.00014789702],"category_scores_gemma":[0.0000020154205,0.00016177565,0.00008319497,0.00019950143,0.000026777883,0.00038303976,3.0814834e-7,0.00021949517,0.000012276718],"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.00003329169,0.000019869154,2.2145474e-7,0.0003828255,0.00013563456,0.00000952518,0.00039756426,0.29727435,0.040604156,0.000026230293,0.0002440078,0.66087234],"study_design_scores_gemma":[0.00022000026,0.00008554478,5.330838e-7,0.0002726051,0.00018859736,0.000012371542,0.000090039524,0.90417266,0.0932963,0.0002975236,0.0011657572,0.00019807383],"about_ca_topic_score_codex":0.000032137836,"about_ca_topic_score_gemma":0.000036248854,"teacher_disagreement_score":0.98133665,"about_ca_system_score_codex":0.00010722788,"about_ca_system_score_gemma":0.00004397908,"threshold_uncertainty_score":0.65970194},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024623802,0.00026690398,0.9827267,0.0010802835,0.00027215452,0.00012871418,0.0000046576056,0.00086681644,0.014407525],"genre_scores_gemma":[0.9542705,0.000027091752,0.044265356,0.00016590292,0.00007346729,0.000018175571,0.0000014392666,0.00002934055,0.0011487188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791914,0.00006728161,0.00027125163,0.00076426007,0.00053132034,0.00044676743],"domain_scores_gemma":[0.9991913,0.000058930345,0.0000647228,0.0003683603,0.00010194572,0.00021477869],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023082248,0.0002957314,0.00021869886,0.00042343888,0.00055254536,0.00096053805,0.0010784378,0.00014879172,0.00012940918],"category_scores_gemma":[0.0000045313714,0.00026796205,0.00015000363,0.0014453204,0.0001134793,0.0015715741,0.000013531259,0.00078111136,0.00008453996],"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.000038207614,0.00023920664,0.000004078311,0.0005185941,0.000060532846,0.00014841964,0.002863411,0.01660139,0.00089329685,0.00662736,0.0008057225,0.9711998],"study_design_scores_gemma":[0.0003310834,0.0002102261,0.000006993742,0.00035123207,0.000042973246,0.00009941711,0.000309473,0.9829563,0.0065379445,0.006055287,0.0026630035,0.00043606243],"about_ca_topic_score_codex":0.000021901673,"about_ca_topic_score_gemma":0.0000029652153,"teacher_disagreement_score":0.97076374,"about_ca_system_score_codex":0.00012701526,"about_ca_system_score_gemma":0.00062350143,"threshold_uncertainty_score":0.99997723},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020343151,0.00019949388,0.977717,0.00012828135,0.0005170891,0.00023176665,0.00010353625,0.0003494317,0.00041025758],"genre_scores_gemma":[0.99829435,0.000030131216,0.0010511125,0.0000669592,0.000093078794,0.00010481175,0.000020447862,0.000040763145,0.00029831353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913913,0.000012205175,0.00022643546,0.00027802467,0.00013847854,0.00020574126],"domain_scores_gemma":[0.99961793,0.00009672946,0.000020847196,0.00007821599,0.00009893667,0.00008730822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008455272,0.00018519974,0.00016663612,0.00033718513,0.00027463285,0.000291928,0.000062384024,0.0000636637,0.00016496162],"category_scores_gemma":[0.0000043221953,0.00017959284,0.00008486318,0.0003701095,0.000021473268,0.00037137748,4.402254e-7,0.00023075727,0.000025264779],"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.000032838565,0.000020045672,4.0574986e-7,0.00018415829,0.000107474094,0.000005104429,0.00048391233,0.41648847,0.03736131,0.000015553946,0.0005080513,0.54479265],"study_design_scores_gemma":[0.00019020021,0.00013474528,0.0000012767804,0.00030001035,0.0002098103,0.000012650373,0.0001700859,0.92006886,0.076223314,0.00016962754,0.0022747454,0.00024469747],"about_ca_topic_score_codex":0.00005900563,"about_ca_topic_score_gemma":0.00011276128,"teacher_disagreement_score":0.9779512,"about_ca_system_score_codex":0.00013554427,"about_ca_system_score_gemma":0.000049066963,"threshold_uncertainty_score":0.73235834},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015949095,0.0016217702,0.98010087,0.00038156746,0.00021377542,0.00046176126,0.000034442146,0.00091571145,0.00032097969],"genre_scores_gemma":[0.9920101,0.00015055375,0.0073083686,0.000058668764,0.000011390806,0.00031023732,0.00000634898,0.000033588785,0.000110730936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901825,0.000022288867,0.0003476142,0.00025578152,0.00010819928,0.00024789333],"domain_scores_gemma":[0.99940455,0.000087668246,0.00006735711,0.00026082687,0.00013814121,0.000041429485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017215013,0.00021721896,0.00023156812,0.0002474861,0.00030237358,0.00013994065,0.00022370271,0.00011340959,0.0000051136176],"category_scores_gemma":[0.0000069706107,0.0002306552,0.000054472817,0.0002846402,0.00008444742,0.00033923186,0.0000037248024,0.00025647893,0.0000051298694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042920663,0.00004504019,3.9306366e-7,0.0003265014,0.000050402472,0.0000011942277,0.00009760686,0.8781495,0.02720121,0.00025781585,0.00008999862,0.093737416],"study_design_scores_gemma":[0.00054028723,0.00006913358,0.000018338453,0.00041962333,0.00003190267,0.0000123910295,0.0005023936,0.817879,0.17904004,0.0005914622,0.00062270387,0.00027267376],"about_ca_topic_score_codex":0.0000037455443,"about_ca_topic_score_gemma":0.00000279266,"teacher_disagreement_score":0.97606105,"about_ca_system_score_codex":0.00014543443,"about_ca_system_score_gemma":0.000047647944,"threshold_uncertainty_score":0.9405846},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076672446,0.0005070114,0.9968206,0.000024268113,0.00041714538,0.00086834596,0.000013475116,0.0004135604,0.00016884746],"genre_scores_gemma":[0.9743525,0.000026359801,0.024358401,0.000018556839,0.000047960406,0.00043133664,0.0000024263302,0.000050779854,0.0007117294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908376,0.000035624766,0.00030796207,0.0002601227,0.00008771209,0.00022484493],"domain_scores_gemma":[0.99957514,0.00009380614,0.000055677057,0.00007816677,0.00014780955,0.000049378843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014110623,0.00019638774,0.00021420889,0.00024659533,0.0002804424,0.00012403881,0.0000485229,0.00008910184,0.0000076095175],"category_scores_gemma":[0.000003767127,0.00020777732,0.000044800752,0.00025914732,0.000020163843,0.00040596095,4.5164015e-7,0.00016334356,0.0000029214004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039368864,0.000019886469,0.0000012905152,0.0005547004,0.000047068523,4.598494e-7,0.0000865404,0.96501493,0.014654277,0.0000127189,0.00016363437,0.019405093],"study_design_scores_gemma":[0.0004184812,0.00004796111,0.0000016168201,0.000378936,0.000060943643,0.0000109218145,0.00009458893,0.8597274,0.13873237,0.00010007212,0.0002520646,0.00017464954],"about_ca_topic_score_codex":0.0000044341737,"about_ca_topic_score_gemma":0.0000037101313,"teacher_disagreement_score":0.9735857,"about_ca_system_score_codex":0.00017181062,"about_ca_system_score_gemma":0.000053872962,"threshold_uncertainty_score":0.8472913},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0851389,0.00057261676,0.9121667,0.000057170862,0.00030931507,0.00013639533,0.000009439947,0.0012372915,0.0003721412],"genre_scores_gemma":[0.9915413,0.000030987445,0.008280784,0.000044211873,0.000021719892,0.0000138735195,0.0000012387326,0.00002952557,0.00003631507],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990829,0.000007550859,0.00022375888,0.00022947669,0.00021357309,0.00024270632],"domain_scores_gemma":[0.9996138,0.000076299475,0.000027902748,0.00016075667,0.0000839953,0.00003720834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000064072505,0.00019939602,0.00020437103,0.00018089458,0.00023994819,0.000053918342,0.000111483285,0.00011585895,0.000016377655],"category_scores_gemma":[0.0000050803164,0.00020089028,0.000060578437,0.0003548261,0.000070754744,0.0001624997,0.0000010706806,0.00034497018,0.000008987765],"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.000022830343,0.000030308254,0.000002444415,0.000053045867,0.00004896324,0.0000029423536,0.000062855404,0.15795152,0.5792323,0.0000016820338,0.000037906055,0.26255322],"study_design_scores_gemma":[0.00049151503,0.000015843134,0.000029455477,0.00036295067,0.00003908006,6.508336e-7,0.00018193378,0.14021264,0.8574966,0.00036913282,0.0006111826,0.00018899387],"about_ca_topic_score_codex":0.000041476025,"about_ca_topic_score_gemma":0.000098444594,"teacher_disagreement_score":0.90640247,"about_ca_system_score_codex":0.00016685357,"about_ca_system_score_gemma":0.000036304107,"threshold_uncertainty_score":0.8192068},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008301971,0.0011842466,0.98803395,0.00045343422,0.00017810706,0.0005270691,0.000023668454,0.00096677593,0.00033076084],"genre_scores_gemma":[0.9948382,0.00009670411,0.0043422747,0.00004680348,0.00001157634,0.00049938814,0.000008177173,0.000031019008,0.00012587316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990972,0.000012879105,0.00034557737,0.00022621154,0.00012378812,0.00019430148],"domain_scores_gemma":[0.99944884,0.00006474534,0.000068656525,0.00021939888,0.00016441269,0.00003395924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012001794,0.00017948124,0.00019057949,0.0002776536,0.00030277972,0.0000842116,0.00015473491,0.00009494767,0.0000058903606],"category_scores_gemma":[0.0000060624548,0.00018477661,0.00005043242,0.00024247184,0.000082635175,0.00031272453,0.000002279224,0.00023881462,0.0000038770127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037659083,0.00008784936,0.0000016159157,0.00063338596,0.000071628856,0.0000010815916,0.00014039544,0.80349094,0.025870735,0.0007972634,0.00018051677,0.16868694],"study_design_scores_gemma":[0.0005874083,0.000085481435,0.00005052436,0.0005652005,0.000035277164,0.000017126436,0.00058606226,0.78382343,0.20995115,0.002926305,0.0010231733,0.00034888298],"about_ca_topic_score_codex":0.000002102893,"about_ca_topic_score_gemma":0.0000025687518,"teacher_disagreement_score":0.9865362,"about_ca_system_score_codex":0.000118469274,"about_ca_system_score_gemma":0.00005523879,"threshold_uncertainty_score":0.7534971},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006782868,0.00034508997,0.9923266,0.0037893238,0.0010794022,0.0016068586,0.000020359576,0.00048249806,0.00028199703],"genre_scores_gemma":[0.5050623,0.000050141236,0.49184382,0.0015428138,0.00007695707,0.00043172797,0.0000034758139,0.000027402843,0.0009614051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961289,0.00022831309,0.0010467299,0.0012132283,0.00070263445,0.00068015896],"domain_scores_gemma":[0.9975219,0.00056279317,0.00040355555,0.0007208488,0.0005117601,0.00027915795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008872173,0.00046435956,0.0004916725,0.00072830275,0.001253732,0.0008907198,0.0009741602,0.000434452,0.00019451293],"category_scores_gemma":[0.000052301017,0.0005018995,0.00032742592,0.0019467124,0.0003171769,0.0009692911,0.0000059215495,0.0008105178,0.000019953863],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020732966,0.00060638937,0.0000012249156,0.0005328947,0.000076303564,0.000003866636,0.0012580381,0.0009091193,0.008170728,0.0029935075,0.00028399736,0.9849566],"study_design_scores_gemma":[0.00088767207,0.00031394826,0.000008677928,0.0020117587,0.00018086356,0.000006035114,0.00018236222,0.4853877,0.47193694,0.038356025,0.00030381692,0.00042419255],"about_ca_topic_score_codex":0.000012033771,"about_ca_topic_score_gemma":0.0000031539723,"teacher_disagreement_score":0.9845324,"about_ca_system_score_codex":0.0003650851,"about_ca_system_score_gemma":0.0007651521,"threshold_uncertainty_score":0.9997433},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002861505,0.00016500562,0.9922137,0.002164407,0.0021946852,0.0013156796,0.000988027,0.00026580156,0.00040652134],"genre_scores_gemma":[0.9645563,0.000022491013,0.032423574,0.0016585268,0.00024598173,0.00038660568,0.00018183533,0.000059513754,0.00046518198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99453884,0.00016433845,0.0012246773,0.0015921516,0.0014431186,0.0010368809],"domain_scores_gemma":[0.9965657,0.0005644863,0.00043297472,0.00083865155,0.0012886474,0.0003095433],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012369459,0.00077642075,0.0006035951,0.00053910946,0.0026691414,0.0009421251,0.00092295965,0.0004200106,0.0001476004],"category_scores_gemma":[0.000027462997,0.000810667,0.0004679135,0.0016144471,0.00020227164,0.0010442103,0.00001007269,0.0009996652,0.000043222717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001398012,0.0019673938,0.000009699871,0.0005231011,0.00007894477,0.000006897354,0.00022289474,0.76858807,0.002718064,0.000068825815,0.002391122,0.22202696],"study_design_scores_gemma":[0.0033594472,0.000640775,0.00016171168,0.003116435,0.00023229346,0.000008072574,0.00006910909,0.96297044,0.025926987,0.00010229264,0.0026496954,0.0007627178],"about_ca_topic_score_codex":0.00003453985,"about_ca_topic_score_gemma":0.00003116566,"teacher_disagreement_score":0.9642701,"about_ca_system_score_codex":0.0007322927,"about_ca_system_score_gemma":0.0012079979,"threshold_uncertainty_score":0.9994344},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060806938,0.0018538022,0.9317558,0.0020182037,0.0010607543,0.0011271284,0.00012786439,0.00013157217,0.0011179488],"genre_scores_gemma":[0.9942215,0.000076091885,0.0028958195,0.0012122792,0.00012547405,0.00013972474,0.000023196651,0.00006326814,0.0012426418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971261,0.000114723065,0.0007775544,0.00087358267,0.00037278834,0.000735234],"domain_scores_gemma":[0.9980849,0.00067269104,0.00020368923,0.00024963674,0.00042613395,0.00036296944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062033156,0.0005570595,0.0006350532,0.00044062285,0.00090031134,0.0003272786,0.00012177831,0.00045403946,0.0004887946],"category_scores_gemma":[0.0000634067,0.0005588553,0.00025000653,0.0004327296,0.0006368965,0.00044747067,0.0000052738537,0.00074135954,0.000026958016],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009815642,0.005866709,0.000085366555,0.0041727633,0.0022092965,0.000100562014,0.007603022,0.12178912,0.13506903,0.0018649494,0.0012554671,0.71016806],"study_design_scores_gemma":[0.037129983,0.012593316,0.004341358,0.026677748,0.0068148174,0.0006893172,0.026580825,0.48774725,0.38881093,0.0025238385,0.0014812109,0.0046093906],"about_ca_topic_score_codex":0.000022009135,"about_ca_topic_score_gemma":0.000005234219,"teacher_disagreement_score":0.9334146,"about_ca_system_score_codex":0.00020814777,"about_ca_system_score_gemma":0.00061836967,"threshold_uncertainty_score":0.9996863},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38181466,0.00007456019,0.61169446,0.00059713674,0.00009187773,0.00030712338,0.00010640496,0.00021200131,0.0051017655],"genre_scores_gemma":[0.9959811,0.000010698082,0.000820254,0.00007905948,0.000044545457,0.000014618674,0.00004063635,0.0000012089412,0.0030078914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989515,0.000049971317,0.00018947427,0.00031784095,0.00023195927,0.00025926268],"domain_scores_gemma":[0.9996919,0.000084532076,0.000037946123,0.000038093676,0.00008025615,0.00006729313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010271463,0.0001559623,0.00016823788,0.00004906338,0.0007258952,0.00008530794,0.00015528183,0.00012906191,0.00086715014],"category_scores_gemma":[0.0000011793187,0.000081764425,0.0001194623,0.00048454016,0.00006386652,0.0005069891,0.000001440823,0.0002025206,0.00011682609],"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.00031167804,0.0002507013,0.000045825498,0.00001638166,0.000053973898,0.000005277633,0.00011937776,0.0043431525,0.41249946,0.0000055527516,0.00032905908,0.58201957],"study_design_scores_gemma":[0.00084349414,0.0008635397,0.003273028,0.00047926718,0.00044588104,0.000029711626,0.0006726273,0.66027445,0.32871005,0.002601122,0.00083707727,0.00096978253],"about_ca_topic_score_codex":0.000091645605,"about_ca_topic_score_gemma":0.000051119543,"teacher_disagreement_score":0.6559313,"about_ca_system_score_codex":0.000070545284,"about_ca_system_score_gemma":0.000022716078,"threshold_uncertainty_score":0.9494686},"labels":[],"label_agreement":null}]}