{"meta":{"query_hash":"b2df22d3ac47","filters":{"topic":"Blind Source Separation Techniques"},"cohort_total":744,"direct_labels_cover":1,"predictions_cover":744,"exported":744,"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/b2df22d3ac47","api":"https://metacan.xera.ac/api/v1/cohort?topic=Blind+Source+Separation+Techniques"},"results":[{"id":"W110813552","doi":"","title":"THE CO-INFORMATION LATTICE","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":168,"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":"Mutual information; Mathematics; Lattice (music); Information theory; Subspace topology; Partially ordered set; Combinatorics; Theoretical computer science; Discrete mathematics; Computer science; Artificial intelligence; Statistics","score_opus":0.011641275413001714,"score_gpt":0.26693284333783357,"score_spread":0.2552915679248319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110813552","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.0001910211,0.0000054879474,0.67548215,0.0011646507,0.00003572967,0.00004494519,4.7193534e-8,0.00019319804,0.32288274],"genre_scores_gemma":[0.7050444,0.000029682684,0.28092626,0.009250785,0.000012071557,0.000027782819,0.0000014159523,0.0000035065075,0.004704112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999648,0.000049452545,0.00008550805,0.000039955525,0.000106653744,0.00007046056],"domain_scores_gemma":[0.9996032,0.0000755081,0.00002799254,0.00023395222,0.000041670883,0.000017656006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045402066,0.000028651293,0.00002086885,0.000019145456,0.00012653295,0.00027056967,0.00025306482,0.000016513568,0.000011736648],"category_scores_gemma":[0.00005522195,0.000017587894,0.000012494901,0.000107554035,0.000011806347,0.00086662546,0.000015490617,0.000040820058,0.0002698043],"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":[1.1648137e-7,0.000001630647,0.0000141467835,2.2311497e-7,6.379453e-7,3.29943e-8,0.00019617437,0.000001906248,0.0000060439797,0.98580366,0.0075824005,0.0063930145],"study_design_scores_gemma":[0.000049726343,0.000014076149,0.00017934814,5.8570566e-7,3.4523794e-7,0.000004289424,0.000046315447,0.0051896917,0.0139307445,0.024927082,0.95561075,0.0000470268],"about_ca_topic_score_codex":0.0000027077215,"about_ca_topic_score_gemma":0.0000018048182,"teacher_disagreement_score":0.9608766,"about_ca_system_score_codex":0.000007691412,"about_ca_system_score_gemma":0.000025967835,"threshold_uncertainty_score":0.3467878},"labels":[],"label_agreement":null},{"id":"W1446018543","doi":"10.3997/2214-4609-pdb.160.sbgf288","title":"Noise suppression in seismic data with sparse coding","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of British Columbia","funders":"","keywords":"Principal component analysis; Series (stratigraphy); Pattern recognition (psychology); Sparse approximation; Computer science; Noise (video); Algorithm; Representation (politics); Filter (signal processing); Time series; Mathematics; Neural coding; Artificial intelligence; Statistics; Computer vision","score_opus":0.04025531532008953,"score_gpt":0.2940505800236017,"score_spread":0.25379526470351216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1446018543","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.024641138,0.000012623207,0.9611913,0.0040763584,0.000020024454,0.000115171766,0.00000119895,0.00033023936,0.009611967],"genre_scores_gemma":[0.76590604,0.0000071827844,0.23243083,0.0012057797,0.000016433827,0.0000036753406,0.000006219384,0.0000037813425,0.00042008862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926364,0.000041907682,0.00012306054,0.00028862228,0.00015232232,0.0001304511],"domain_scores_gemma":[0.99899006,0.000033045373,0.000033999026,0.00088681956,0.000018139343,0.00003793404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030179572,0.00006767399,0.00007329456,0.00009655913,0.000029407583,0.0001011141,0.00097284734,0.000032063443,0.000024529754],"category_scores_gemma":[0.000010931016,0.000050463153,0.0000063052257,0.00021944584,0.000014482477,0.0012820911,0.0004207726,0.000099118275,0.000043645985],"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.000088013,0.00096270995,0.013842464,0.000041108677,0.000025666972,0.00010600857,0.009346971,0.018692983,0.016380785,0.28169933,0.18467526,0.4741387],"study_design_scores_gemma":[0.0002552275,0.000028318902,0.0009120011,0.000029864155,9.048695e-7,0.000011654202,0.000018182707,0.9463596,0.021576757,0.00031693585,0.030367173,0.00012343047],"about_ca_topic_score_codex":0.00004717974,"about_ca_topic_score_gemma":0.00014932829,"teacher_disagreement_score":0.92766654,"about_ca_system_score_codex":0.000019695768,"about_ca_system_score_gemma":0.000041148887,"threshold_uncertainty_score":0.20578277},"labels":[],"label_agreement":null},{"id":"W1487785239","doi":"10.1109/icsmc.2005.1571586","title":"Chaos based Semi-blind System Identification using an EM-UKS Estimator","year":2006,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Calgary","funders":"","keywords":"Estimator; Chaotic; Kalman filter; Computer science; Nonlinear system; Identification (biology); Expectation–maximization algorithm; Estimation theory; SIGNAL (programming language); Maximization; System identification; Control theory (sociology); Algorithm; Maximum likelihood; Mathematics; Mathematical optimization; Artificial intelligence; Data modeling; Statistics","score_opus":0.031663726618567097,"score_gpt":0.2922710458389315,"score_spread":0.2606073192203644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487785239","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.09788306,0.000009433424,0.89867693,0.00014323878,0.00011013665,0.0002493158,0.0000013807218,0.0012626512,0.0016638493],"genre_scores_gemma":[0.79773766,7.195932e-8,0.20184883,0.00013255075,0.000050722232,0.000016655378,0.000011536844,0.000009913601,0.00019203236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987226,0.00011198092,0.0003337583,0.00036790862,0.0002941287,0.00016962347],"domain_scores_gemma":[0.9989224,0.000029850116,0.0001521833,0.0006857907,0.00014775347,0.00006199547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005509703,0.000119027485,0.00011902111,0.0001945984,0.00016053807,0.0005495443,0.0005192227,0.000087521694,0.000010067307],"category_scores_gemma":[0.000010104976,0.00011525376,0.000041466235,0.00038076675,0.000018377616,0.0009294506,0.000050997874,0.00007541091,0.00004498891],"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.000018952795,0.00057308876,0.001346512,0.00014240532,0.000014800613,0.000021108748,0.0008263112,0.030069241,0.08751891,0.8711298,0.0026862635,0.0056525986],"study_design_scores_gemma":[0.0001911091,0.000017626748,0.00076929847,0.000019108915,0.0000038478024,0.000010426926,0.000043894655,0.9158904,0.08213587,0.0006159586,0.00016005155,0.0001424149],"about_ca_topic_score_codex":0.00016587143,"about_ca_topic_score_gemma":0.00003452047,"teacher_disagreement_score":0.88582116,"about_ca_system_score_codex":0.00007070057,"about_ca_system_score_gemma":0.00008915257,"threshold_uncertainty_score":0.52992684},"labels":[],"label_agreement":null},{"id":"W1488876622","doi":"10.1109/icdsp.2015.7251320","title":"Adaptive blind widely linear CCM reduced-rank beamforming for large-scale antenna arrays","year":2015,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Adaptive beamformer; Computational complexity theory; Algorithm; Rank (graph theory); Beamforming; Covariance matrix; Computer science; Krylov subspace; Convergence (economics); Signal-to-noise ratio (imaging); Subspace topology; Signal processing; Interference (communication); Mathematics; Iterative method; Digital signal processing; Telecommunications; Artificial intelligence","score_opus":0.0628263210176234,"score_gpt":0.30989767840173527,"score_spread":0.24707135738411187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488876622","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.0034476244,0.00003899672,0.98507947,0.002048691,0.00022070268,0.0005685973,0.000008426673,0.00075206807,0.007835408],"genre_scores_gemma":[0.17004067,0.0000049594146,0.82632065,0.0014396168,0.00015070461,0.000077877376,0.000009463304,0.000020036665,0.001936051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839616,0.000056357134,0.00034053889,0.00046657052,0.0003334623,0.0004069132],"domain_scores_gemma":[0.9985178,0.00009879077,0.00013020249,0.0005808762,0.00045531403,0.00021698544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011188538,0.00018639045,0.00022984619,0.00016485841,0.00013992659,0.00014529472,0.0007754704,0.00012594419,0.0000081160815],"category_scores_gemma":[0.00011905831,0.00016430058,0.00011089268,0.00038434088,0.000032708507,0.0010362979,0.00021560892,0.00016786695,0.000057766913],"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.00073745905,0.0013991174,0.00022510477,0.000060881892,0.00019095118,0.000022325365,0.057955705,0.0019523996,0.019434812,0.78336823,0.104007244,0.030645758],"study_design_scores_gemma":[0.0017264275,0.0005997369,0.000015791251,0.000029814557,0.00001065721,0.000018993494,0.0010549873,0.8865886,0.045308404,0.020543395,0.04367228,0.00043093556],"about_ca_topic_score_codex":0.000025076008,"about_ca_topic_score_gemma":0.000043573444,"teacher_disagreement_score":0.88463616,"about_ca_system_score_codex":0.000057353216,"about_ca_system_score_gemma":0.00021161536,"threshold_uncertainty_score":0.6699983},"labels":[],"label_agreement":null},{"id":"W1490106680","doi":"10.1109/iscas.1992.230002","title":"A binary logic synthesis approach to the bit-level implementation of generalized rank-order filters","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Concordia University","funders":"","keywords":"Rank (graph theory); Binary number; Computer science; Realization (probability); Very-large-scale integration; Algorithm; Filter (signal processing); Theoretical computer science; Modular design; Arithmetic; Mathematics; Embedded system; Programming language","score_opus":0.06101927088543681,"score_gpt":0.31155936187300143,"score_spread":0.25054009098756463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490106680","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.009361384,0.000018470822,0.9769885,0.002543599,0.00004211425,0.00044113406,0.0000038255666,0.0001387041,0.010462258],"genre_scores_gemma":[0.44356412,0.0000059481786,0.55367136,0.002327181,0.0000062237655,0.00013660685,0.0000020754828,0.000005655299,0.000280812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988178,0.0002893261,0.00024884735,0.0002479991,0.0002339668,0.00016207881],"domain_scores_gemma":[0.9992001,0.00009411122,0.000083150546,0.00048213438,0.00009831427,0.000042193267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007199483,0.0001041059,0.00013052588,0.00013341193,0.00007902621,0.00006853336,0.0005392708,0.000037136888,0.000097088996],"category_scores_gemma":[0.000057256115,0.00006804542,0.000055552377,0.00064369687,0.00002248558,0.00019720673,0.00008873045,0.000049728802,0.000015657146],"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.00000785791,0.00015149712,0.00019136477,0.000013364252,0.000039383307,6.2353405e-7,0.0036454108,0.0012265282,0.006387551,0.9497262,0.021981463,0.016628733],"study_design_scores_gemma":[0.0017995335,0.00051960035,0.007493572,0.000026905487,0.000060696795,0.000044263503,0.0039043187,0.055551745,0.8638247,0.022541817,0.04305657,0.0011762545],"about_ca_topic_score_codex":0.00013962219,"about_ca_topic_score_gemma":0.000019428295,"teacher_disagreement_score":0.9271844,"about_ca_system_score_codex":0.000019801573,"about_ca_system_score_gemma":0.00006638328,"threshold_uncertainty_score":0.27748117},"labels":[],"label_agreement":null},{"id":"W1491285536","doi":"10.1007/978-3-540-27824-5_77","title":"Detection of Equalization Errors in Time-Varying Channels","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"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; Robustness (evolution); Equalization (audio); Channel (broadcasting); Algorithm; Computational complexity theory; Adaptive equalizer; Blind equalization; Telecommunications","score_opus":0.020511913197482703,"score_gpt":0.26584284384311957,"score_spread":0.24533093064563688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491285536","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.0005450252,0.00010039431,0.9968373,0.00022288044,0.00051209977,0.00040251578,0.0000011386632,0.00019877037,0.0011798627],"genre_scores_gemma":[0.8251587,0.000021716263,0.17404325,0.00054461684,0.000098363074,0.000010201704,0.000004283602,0.000026253261,0.00009258633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971807,0.000058971207,0.0006222993,0.0009183638,0.00086723914,0.00035242594],"domain_scores_gemma":[0.9983741,0.00018637882,0.0004029618,0.00077026535,0.00019791965,0.00006834882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001244191,0.00032669623,0.00041794288,0.0016334942,0.000087137014,0.0002308229,0.0018883116,0.00034573348,0.000012080646],"category_scores_gemma":[0.00008874899,0.00033782568,0.00008408975,0.001062861,0.00027892526,0.0007764198,0.00062885776,0.0005219589,0.00001617854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013259246,0.000086115506,0.00004416341,0.000096293734,0.000009076578,0.00003452269,0.005832274,0.5170961,0.011656717,0.0529669,0.0000022291763,0.41216233],"study_design_scores_gemma":[0.0003022634,0.00020999786,0.00005618913,0.0007112551,0.0000032256112,0.000020092039,1.2151476e-7,0.54935926,0.11600161,0.33275014,0.00008190071,0.0005039119],"about_ca_topic_score_codex":0.000054183794,"about_ca_topic_score_gemma":0.00005090702,"teacher_disagreement_score":0.8246137,"about_ca_system_score_codex":0.0003860495,"about_ca_system_score_gemma":0.00040288485,"threshold_uncertainty_score":0.9999074},"labels":[],"label_agreement":null},{"id":"W1492075737","doi":"10.1109/vtcspring.2015.7146017","title":"Pilot Insertion Rate for SC-FDE Systems Employing Subspace-Based Channel Estimation","year":2015,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Université du Québec à Trois-Rivières; University of Ottawa","funders":"","keywords":"Channel (broadcasting); Subspace topology; Algorithm; Computer science; Ambiguity; Block (permutation group theory); Bit error rate; Monte Carlo method; SC-FDE; Mathematics; Equalization (audio); Statistics; Telecommunications; Artificial intelligence; Combinatorics","score_opus":0.11456886866384959,"score_gpt":0.3143890090288868,"score_spread":0.1998201403650372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492075737","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.011319264,0.000031463267,0.9838014,0.001986757,0.00034706958,0.0006850424,0.0000012077055,0.0011295945,0.000698161],"genre_scores_gemma":[0.8692226,6.715179e-7,0.12956032,0.00061242364,0.000040886145,0.00020971545,0.000013400021,0.000012371669,0.00032759737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989562,0.00013671341,0.00023474928,0.0002702479,0.00021313378,0.00018897602],"domain_scores_gemma":[0.99898005,0.00012201454,0.00012654033,0.0003562932,0.00030854362,0.000106578125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012867482,0.00011864936,0.00013115228,0.0001764896,0.00009711312,0.00035418913,0.00032441085,0.0000451485,8.4729726e-7],"category_scores_gemma":[0.00017232717,0.00010839082,0.00003494924,0.00028353563,0.000014858821,0.0007951576,0.000043237946,0.00006124801,0.00003379773],"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.00024897757,0.00053537934,0.000532275,0.00022346342,0.000043365573,0.00000482228,0.0037507038,0.29626095,0.01212312,0.6290621,0.04908587,0.008128916],"study_design_scores_gemma":[0.0005374043,0.00036765775,0.00015615673,0.000033385666,0.0000031678624,0.0000019451672,0.000026769205,0.9747889,0.018055517,0.005289434,0.00059107644,0.00014859498],"about_ca_topic_score_codex":0.00017147254,"about_ca_topic_score_gemma":0.000030776875,"teacher_disagreement_score":0.85790336,"about_ca_system_score_codex":0.00009229043,"about_ca_system_score_gemma":0.00016012194,"threshold_uncertainty_score":0.44200495},"labels":[],"label_agreement":null},{"id":"W1496521647","doi":"10.1109/iscas.2001.922243","title":"A VLSI architecture of a piecewise RBF decision feedback channel equalizer","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Very-large-scale integration; Adaptive equalizer; Computer science; Piecewise; Radial basis function; Channel (broadcasting); Equalization (audio); CMOS; Equalizer; Electronic engineering; Gaussian; Algorithm; Control theory (sociology); Engineering; Artificial intelligence; Mathematics; Artificial neural network; Telecommunications; Embedded system","score_opus":0.026850199942459668,"score_gpt":0.25839755496918987,"score_spread":0.2315473550267302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496521647","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.0069067627,0.000119599456,0.9678565,0.0016284663,0.00006401567,0.00016579057,0.0000012148976,0.00036669523,0.022890912],"genre_scores_gemma":[0.7590072,0.0000249872,0.23803571,0.0012406637,0.00002246488,0.000008306118,6.327281e-7,0.000008963686,0.0016510236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988337,0.00006914561,0.00027632574,0.00028828977,0.00034402809,0.00018851893],"domain_scores_gemma":[0.9989797,0.00013654031,0.000095213785,0.0006219731,0.00008765346,0.0000789413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026326656,0.0001235244,0.00017249491,0.00019566549,0.000043224434,0.00007285605,0.00071754714,0.000085147585,0.0002386339],"category_scores_gemma":[0.000058262372,0.0000976729,0.00008615846,0.0004292679,0.000038300786,0.0002542244,0.00022585073,0.00012564297,0.00011533874],"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.000031026702,0.00070599,0.00007660275,0.000052930107,0.00004463656,0.00001826961,0.01872091,0.0012275969,0.0059884605,0.29416114,0.06801868,0.61095375],"study_design_scores_gemma":[0.0023509287,0.0010229582,0.0011721136,0.00022998803,0.000017722206,0.00011726998,0.00015794621,0.42543653,0.16060193,0.31460634,0.09303481,0.0012514781],"about_ca_topic_score_codex":0.000018870249,"about_ca_topic_score_gemma":0.000010497386,"teacher_disagreement_score":0.75210047,"about_ca_system_score_codex":0.000013028348,"about_ca_system_score_gemma":0.000012552448,"threshold_uncertainty_score":0.39829853},"labels":[],"label_agreement":null},{"id":"W1499282428","doi":"10.1109/icassp.2000.861086","title":"A filterbank structure for voice-band PCM channel pre-equalization","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McGill University","funders":"","keywords":"Intersymbol interference; Filter bank; Precoding; Channel (broadcasting); Bandlimiting; Nyquist ISI criterion; Transmitter; Computer science; Equalization (audio); Finite impulse response; Electronic engineering; Telecommunications; Algorithm; Engineering; Mathematics; MIMO","score_opus":0.030794519034534402,"score_gpt":0.2690713429683566,"score_spread":0.2382768239338222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499282428","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.0034848182,0.0000427851,0.9908063,0.001681193,0.0001130635,0.00039081337,0.000007270947,0.0005398899,0.0029338896],"genre_scores_gemma":[0.9153051,0.000008174576,0.07815028,0.0021117306,0.00008532001,0.00005268911,0.00001266712,0.000011562262,0.004262508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921477,0.000038535836,0.00016795709,0.00026364447,0.00015328497,0.00016179906],"domain_scores_gemma":[0.9993708,0.00005561681,0.0000701806,0.0003588603,0.00009776814,0.00004677842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001185356,0.00010214635,0.00009773733,0.000087586464,0.000090240304,0.00018865048,0.00041255527,0.00008403672,0.000104768864],"category_scores_gemma":[0.000039132326,0.0000873755,0.000042824682,0.00022035131,0.000013590409,0.00052022847,0.000045439334,0.000056223587,0.000015846634],"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.000017270422,0.00018800111,0.00009125562,0.00009309775,0.00004383237,0.0000022192892,0.016578052,0.00124694,0.01508852,0.6905417,0.24916568,0.026943456],"study_design_scores_gemma":[0.00064090296,0.00027590446,0.00029555912,0.00001938918,0.000007181477,0.000012590036,0.000019712366,0.7092312,0.16844094,0.065550916,0.055106014,0.0003997153],"about_ca_topic_score_codex":0.000009582129,"about_ca_topic_score_gemma":0.000020651432,"teacher_disagreement_score":0.912656,"about_ca_system_score_codex":0.000016983719,"about_ca_system_score_gemma":0.000009850963,"threshold_uncertainty_score":0.35630694},"labels":[],"label_agreement":null},{"id":"W1501281527","doi":"10.1109/icassp.2001.940214","title":"Blind source separation of convolved sources by joint approximate diagonalization of cross-spectral density matrices","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Blind signal separation; Algorithm; Scaling; Spectral density; Mathematics; Computer science; Matrix (chemical analysis); Permutation (music); Applied mathematics; Channel (broadcasting); Statistics","score_opus":0.03139337710343383,"score_gpt":0.28771937134024067,"score_spread":0.25632599423680685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501281527","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.42295983,0.0001467373,0.57511646,0.00013515863,0.000025791147,0.0001835765,0.00000310542,0.00019175984,0.0012375562],"genre_scores_gemma":[0.9723221,0.000060224364,0.026569808,0.00013526157,0.00001796907,0.000011079675,0.00001440642,0.000010480637,0.000858656],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983285,0.00012034081,0.0006003464,0.00032848105,0.00043180116,0.0001905351],"domain_scores_gemma":[0.998616,0.00007789804,0.000503283,0.0004136755,0.0003274122,0.000061768864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048321293,0.00015756598,0.000281198,0.0001835343,0.00008576245,0.00016486015,0.00043421338,0.000117801144,0.000091872695],"category_scores_gemma":[0.00005040732,0.00014605816,0.000098918004,0.00049964257,0.00014361266,0.0008380964,0.000119317454,0.00009357927,0.000012425475],"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.00015184082,0.0024879137,0.07675649,0.0005664586,0.0002502921,0.0000045047586,0.031571694,0.0062063686,0.42830747,0.41864666,0.025640132,0.009410168],"study_design_scores_gemma":[0.00048358613,0.0001336489,0.0022818288,0.000015872472,0.0000091412785,0.000004942902,0.0000507068,0.24338701,0.7509447,0.001912597,0.00058302085,0.0001929587],"about_ca_topic_score_codex":0.00008229637,"about_ca_topic_score_gemma":0.000015260312,"teacher_disagreement_score":0.5493623,"about_ca_system_score_codex":0.000024366504,"about_ca_system_score_gemma":0.000021512697,"threshold_uncertainty_score":0.5956079},"labels":[],"label_agreement":null},{"id":"W1507911759","doi":"10.1109/icassp.1995.479870","title":"Blind identification of nonlinear models using higher order spectral analysis","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"LTI system theory; Nonlinear system; Control theory (sociology); Polynomial; Linear system; Gaussian; Linear model; Mathematics; SIGNAL (programming language); Applied mathematics; Algorithm; Computer science; Mathematical analysis; Physics; Artificial intelligence; Statistics","score_opus":0.07028583416423106,"score_gpt":0.30377078160789106,"score_spread":0.23348494744366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507911759","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.039473977,0.000024350715,0.9557291,0.00044967895,0.000034271612,0.00007719433,0.0000011806396,0.0001565099,0.0040537114],"genre_scores_gemma":[0.6890911,0.000005401693,0.3094845,0.0000953574,0.00001479211,0.0000015825182,0.0000017676355,0.0000034954778,0.0013020055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990646,0.000046007324,0.00031804782,0.0002292481,0.00023423236,0.00010785897],"domain_scores_gemma":[0.99915606,0.000016680535,0.00013847183,0.00048021576,0.00017608043,0.000032474625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022375215,0.00007295114,0.00013804132,0.000334753,0.000037715166,0.000095311094,0.00037112922,0.000051280877,0.00021158697],"category_scores_gemma":[0.0000060792336,0.00006755874,0.00008332606,0.0017407809,0.000032836004,0.00066732586,0.000057046756,0.00005769866,0.000013167675],"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.000008182656,0.0006998528,0.0010014927,0.000017355016,0.0005648194,0.000003750466,0.0033369763,0.25938615,0.033717174,0.6950221,0.0009870891,0.005255025],"study_design_scores_gemma":[0.00008407473,0.000010070759,0.0002381598,0.0000011092827,0.000039359235,6.1047405e-7,0.00000485743,0.97264165,0.02238286,0.0044526667,0.00006726672,0.00007730797],"about_ca_topic_score_codex":0.000053585158,"about_ca_topic_score_gemma":0.000010675451,"teacher_disagreement_score":0.7132555,"about_ca_system_score_codex":0.000018994051,"about_ca_system_score_gemma":0.000011859422,"threshold_uncertainty_score":0.27549657},"labels":[],"label_agreement":null},{"id":"W1512507629","doi":"10.1007/978-3-032-13094-5_9","title":"Channel Estimation and Equalization","year":2010,"lang":"en","type":"book-chapter","venue":"Signals and communication technology","topic":"Blind Source Separation 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":"Concordia University","funders":"","keywords":"Equalization (audio); Channel (broadcasting); Computer science; Estimation; Content (measure theory); Electronic engineering; Telecommunications; Computer network; Engineering; Mathematics; Systems engineering","score_opus":0.01715040077279863,"score_gpt":0.2602693557249544,"score_spread":0.24311895495215577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512507629","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.00009211004,0.004494753,0.91991156,0.011470868,0.000041938227,0.0004480193,0.0000053821636,0.0011870755,0.06234827],"genre_scores_gemma":[0.54379284,0.022082213,0.37933078,0.0025004363,0.000046905152,0.00027371856,0.00024658442,0.00012960838,0.051596884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906874,0.00004092731,0.00031604603,0.00033085933,0.00013000383,0.00011342362],"domain_scores_gemma":[0.9982288,0.00009280562,0.00034389942,0.0011294483,0.0001633497,0.00004172579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000380317,0.000201185,0.00024257338,0.00049515825,0.00022288105,0.00014241105,0.0007345724,0.0007798172,0.000018173467],"category_scores_gemma":[0.00004182853,0.00021236912,0.000025972695,0.00009363901,0.0002788327,0.0002765734,0.0006880733,0.0005985304,0.000013271083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.064826e-7,0.000006430268,7.0450494e-7,0.00000999335,0.0000084544145,2.8355467e-7,0.00017190506,0.0000030025926,0.0004625409,0.93338424,0.00008667734,0.065864965],"study_design_scores_gemma":[0.000106083375,0.0000718538,0.000005668271,0.00008094383,0.000011079927,0.000026620202,0.000010589319,0.011917495,0.0035919216,0.94867307,0.03527086,0.00023384747],"about_ca_topic_score_codex":0.0000055626156,"about_ca_topic_score_gemma":0.000016929569,"teacher_disagreement_score":0.54370075,"about_ca_system_score_codex":0.000014646129,"about_ca_system_score_gemma":0.00004035377,"threshold_uncertainty_score":0.86601615},"labels":[],"label_agreement":null},{"id":"W1516958410","doi":"10.1109/iembs.2006.260420","title":"A Combined SPM-ICA Approach to fMRI","year":2006,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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 Alberta","funders":"","keywords":"Independent component analysis; Statistical parametric mapping; Artificial intelligence; Computer science; Voxel; Pattern recognition (psychology); Haemodynamic response; Functional magnetic resonance imaging; Neuroimaging; Parametric statistics; Psychology; Neuroscience; Mathematics; Magnetic resonance imaging","score_opus":0.01233608100782324,"score_gpt":0.23400445926882849,"score_spread":0.22166837826100524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516958410","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.0018001508,0.0000023701443,0.6768785,0.0019260476,0.000022475846,0.00013664507,1.586614e-7,0.0006507679,0.31858286],"genre_scores_gemma":[0.5189715,1.9020348e-7,0.47412795,0.0019754514,0.000020952077,0.000026463791,0.000002017684,0.000004211305,0.004871246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992531,0.000035281097,0.00013771,0.00024597114,0.00017670267,0.00015123619],"domain_scores_gemma":[0.99943054,0.000020081368,0.000023933533,0.00042524314,0.000045255467,0.000054957974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001932286,0.00007642969,0.00008619913,0.00009677563,0.00004795553,0.00015974595,0.0005606548,0.000038925315,0.000012236383],"category_scores_gemma":[0.0000074868826,0.000066129534,0.000031935928,0.0003782079,0.000011689689,0.00020498436,0.0001553144,0.0000594204,0.00014936372],"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.0000012837195,0.000099947356,0.00006752056,0.0000013008628,0.0000012383915,5.3351073e-7,0.00014535733,0.00007675964,0.00039152577,0.94358975,0.054409783,0.0012150214],"study_design_scores_gemma":[0.0015903704,0.0007589862,0.022520738,0.00001989429,0.000008877619,0.000035160898,0.00009329067,0.2606065,0.14471552,0.228886,0.33915526,0.0016094289],"about_ca_topic_score_codex":0.0000951221,"about_ca_topic_score_gemma":0.000006161584,"teacher_disagreement_score":0.71470374,"about_ca_system_score_codex":0.00001643639,"about_ca_system_score_gemma":0.000024238896,"threshold_uncertainty_score":0.2696684},"labels":[],"label_agreement":null},{"id":"W1517445048","doi":"10.1109/iscas.1997.622027","title":"A generalized structure of blind adaptive frequency-shift filter for signal extraction","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McMaster University","funders":"","keywords":"Cyclostationary process; SIGNAL (programming language); Filter (signal processing); Computer science; Adaptive filter; Algorithm; Kernel adaptive filter; Signal processing; Filter design; Electronic engineering; Speech recognition; Mathematics; Telecommunications; Engineering; Computer vision","score_opus":0.046015638987820635,"score_gpt":0.2868618250970271,"score_spread":0.2408461861092065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517445048","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.01952834,0.000043619802,0.97657853,0.00059087225,0.00006657331,0.0003407157,0.00001247238,0.00017733281,0.0026615462],"genre_scores_gemma":[0.60709524,0.0000025866461,0.39220563,0.0002870789,0.00003132596,0.000013523307,0.0000026850523,0.000004742795,0.00035721285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991564,0.00005700293,0.00022947839,0.00023971348,0.00017979369,0.00013761867],"domain_scores_gemma":[0.99935234,0.00007894135,0.00013006848,0.0002737516,0.0001231664,0.000041731455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001023119,0.000104016886,0.00013564204,0.000115692055,0.000049820304,0.000057563033,0.00033091407,0.00009813704,0.0006549055],"category_scores_gemma":[0.000013435749,0.00008808608,0.00007720259,0.0001843994,0.00002691339,0.00053770817,0.000035567107,0.00008959828,0.0000063101525],"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.000047810987,0.00014352842,0.000063463194,0.000017270815,0.000050530125,0.000002061768,0.003078149,0.000290452,0.12867844,0.8394183,0.011985894,0.016224105],"study_design_scores_gemma":[0.0014953177,0.0005726767,0.00045360322,0.000016833505,0.000015065019,0.000014387522,0.000031030344,0.25781408,0.5757778,0.16088231,0.0025626158,0.00036422798],"about_ca_topic_score_codex":0.00003293931,"about_ca_topic_score_gemma":0.000039239694,"teacher_disagreement_score":0.678536,"about_ca_system_score_codex":0.000019142124,"about_ca_system_score_gemma":0.00002020405,"threshold_uncertainty_score":0.7170756},"labels":[],"label_agreement":null},{"id":"W1517963005","doi":"10.5281/zenodo.39013","title":"Combined Spatial/Beamforming And Time/Frequency Processing For Blind Source Separation","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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 Ottawa","funders":"","keywords":"Blind signal separation; Beamforming; Computer science; Source separation; Adaptive beamformer; Spatial filter; Array processing; Filter (signal processing); Signal processing; Time–frequency analysis; Adaptive filter; Speech recognition; Artificial intelligence; Algorithm; Telecommunications; Computer vision","score_opus":0.016016570701362292,"score_gpt":0.29003094865185636,"score_spread":0.27401437795049405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517963005","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.011989704,0.000041596184,0.97879237,0.0024357694,0.000019549538,0.0004663126,5.4194817e-7,0.00060635875,0.005647815],"genre_scores_gemma":[0.51254475,0.0000031099062,0.4845586,0.0008625613,0.000064894986,0.000052547588,0.0000064415067,0.00001071828,0.0018963385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990788,0.00002921796,0.00025055025,0.00029529832,0.00015705488,0.00018904863],"domain_scores_gemma":[0.99942243,0.00006426937,0.00011156486,0.00021535173,0.00012189574,0.0000644699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042159023,0.00012241164,0.00012979815,0.000118830845,0.00019661304,0.00033360985,0.00025595087,0.000075768,0.00001333774],"category_scores_gemma":[0.000034697438,0.000113365706,0.00003158141,0.00016853564,0.000028642247,0.0012677254,0.0000723512,0.00007231718,0.000021267755],"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.000039111295,0.00014094998,0.00021537338,0.000048714024,0.00001453969,4.5387296e-7,0.0045850007,0.00040716058,0.016696187,0.095064566,0.002269485,0.88051844],"study_design_scores_gemma":[0.0008031276,0.00020478673,0.00009606276,0.000020398435,0.000006429034,0.000008351922,0.000020808695,0.9410265,0.036696415,0.009115834,0.011750427,0.00025084245],"about_ca_topic_score_codex":0.000017371842,"about_ca_topic_score_gemma":0.00002019919,"teacher_disagreement_score":0.94061935,"about_ca_system_score_codex":0.000030681524,"about_ca_system_score_gemma":0.00007182758,"threshold_uncertainty_score":0.46229193},"labels":[],"label_agreement":null},{"id":"W1521144119","doi":"10.5772/8529","title":"New Trends in Biologically-Inspired Audio Coding","year":2010,"lang":"en","type":"book-chapter","venue":"Signal Processing","topic":"Blind Source Separation 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":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Speech coding; Speech recognition; Codebook; Auditory masking; Coding (social sciences); Audio signal; Lossless compression; Neural coding; Masking (illustration); Data compression; Artificial intelligence; Mathematics","score_opus":0.03561951384583587,"score_gpt":0.2800878518970018,"score_spread":0.24446833805116594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521144119","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.000015119897,0.0003246148,0.59619504,0.0006163824,0.00007248815,0.000098928096,0.0000014265248,0.0005865482,0.40208942],"genre_scores_gemma":[0.21260329,0.0000637614,0.4162701,0.0021404945,0.00071306055,0.000023206883,0.000053629432,0.00011533673,0.36801714],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981941,0.000028201415,0.00047017622,0.0006743473,0.00033059102,0.00030256654],"domain_scores_gemma":[0.99903095,0.000052343785,0.00035711305,0.00034269146,0.00009026426,0.00012664721],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004378577,0.00034775338,0.00040293153,0.00062215497,0.00012774197,0.00038739195,0.001002916,0.00065409363,0.00028316712],"category_scores_gemma":[0.000013091785,0.00031561643,0.00011694824,0.00020331136,0.00007299753,0.00047424214,0.0002633865,0.0010660733,0.00004230048],"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.000006551172,0.000010953369,0.000008500856,0.000020227522,0.0000062691624,0.000031917978,0.00042897326,0.0000066590364,0.0038858273,0.13171461,0.0005354744,0.863344],"study_design_scores_gemma":[0.0010405729,0.00048433334,0.0002692203,0.0017574915,0.000036956095,0.000094936484,0.000011068699,0.0130600035,0.016974766,0.6151342,0.3484426,0.0026938205],"about_ca_topic_score_codex":0.000012714273,"about_ca_topic_score_gemma":0.000038142138,"teacher_disagreement_score":0.86065024,"about_ca_system_score_codex":0.00007113302,"about_ca_system_score_gemma":0.00031314185,"threshold_uncertainty_score":0.9999296},"labels":[],"label_agreement":null},{"id":"W1525670124","doi":"","title":"Model-Free Estimation of Large Variance Matrices","year":2010,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":4,"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":"Estimator; Mathematics; Eigenvalues and eigenvectors; Variance (accounting); Dimension (graph theory); Parametric statistics; Matrix (chemical analysis); Sample variance; Statistics; Applied mathematics; Variance decomposition of forecast errors; Combinatorics","score_opus":0.03336488456702194,"score_gpt":0.3416949393922065,"score_spread":0.3083300548251846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525670124","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.15208526,0.00022511218,0.7252885,0.0027935393,0.000682144,0.0021459935,0.00017402857,0.00057286106,0.11603253],"genre_scores_gemma":[0.61358345,0.0018075883,0.38379708,0.00009655163,0.000047447593,0.00016839814,0.000022885579,0.00002937286,0.0004472408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975129,0.00023187099,0.0006530547,0.0007722229,0.0003646996,0.00046529187],"domain_scores_gemma":[0.9965225,0.00033402798,0.00036281825,0.002478696,0.0002011323,0.00010085663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034951665,0.00021148878,0.00039733324,0.0006626949,0.000087222565,0.00024002662,0.0031316988,0.00054837216,0.000013237936],"category_scores_gemma":[0.00053133594,0.00023917886,0.000113789596,0.00021689889,0.0001264943,0.00042077902,0.0034527835,0.0018370415,0.000005231426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002821383,0.000343425,0.00024919063,0.00031408228,0.000043631193,0.00000846229,0.0019014576,0.48803887,0.00046495354,0.25789705,0.0003040872,0.25040656],"study_design_scores_gemma":[0.00019387754,0.000028776805,0.00022869522,0.00007798339,0.0000016968786,0.000002176436,0.000013374958,0.904139,0.0013981217,0.09276096,0.00096620334,0.00018916918],"about_ca_topic_score_codex":0.000040927593,"about_ca_topic_score_gemma":0.00015843436,"teacher_disagreement_score":0.46149817,"about_ca_system_score_codex":0.00022562513,"about_ca_system_score_gemma":0.000799001,"threshold_uncertainty_score":0.9753431},"labels":[],"label_agreement":null},{"id":"W1527499336","doi":"10.1007/11569541_35","title":"Improved Motion Correction of fMRI Time-Series Corrupted with Major Head Movement Using Extended Motion-Corrected Independent Component Analysis","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Interpolation (computer graphics); Voxel; Artificial intelligence; Artifact (error); Independent component analysis; Computer vision; Motion (physics); Motion estimation; Pattern recognition (psychology)","score_opus":0.01244315308250694,"score_gpt":0.24848030789702585,"score_spread":0.23603715481451892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527499336","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.0021435064,0.000073584524,0.9949534,0.00023040887,0.00081423746,0.0008889855,0.000010360117,0.0003776675,0.00050788105],"genre_scores_gemma":[0.45813802,0.00001887793,0.5404794,0.0005640736,0.0001680928,0.000024346025,0.0000559428,0.000051597883,0.0004996216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995024,0.00013351541,0.0009965274,0.0015796841,0.0017267573,0.0005394787],"domain_scores_gemma":[0.99605,0.00018542095,0.0010735622,0.0014090015,0.0011182748,0.00016376268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012443705,0.0006643637,0.00094106374,0.0023834123,0.00027535248,0.00041302328,0.0015779303,0.00038878573,0.00005891741],"category_scores_gemma":[0.00005810397,0.0006065142,0.00024171759,0.0021394645,0.00049439503,0.0010765413,0.00065136026,0.00075407024,0.0000069415837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012344497,0.00033333027,0.00029451493,0.000048602044,0.00031090248,0.000024536317,0.0017374387,0.5722415,0.011865479,0.0019671884,0.0000119036295,0.41104117],"study_design_scores_gemma":[0.0004203894,0.000416479,0.001424798,0.00020166638,0.00012627798,0.000035305595,0.0000010492918,0.96396476,0.030384261,0.002372677,0.000040521063,0.0006117963],"about_ca_topic_score_codex":0.00029962696,"about_ca_topic_score_gemma":0.00089920417,"teacher_disagreement_score":0.45599452,"about_ca_system_score_codex":0.0009740469,"about_ca_system_score_gemma":0.00051360746,"threshold_uncertainty_score":0.9996386},"labels":[],"label_agreement":null},{"id":"W1528236795","doi":"10.1109/iembs.2006.260653","title":"A Software Module for the Adaptive Estimation of Steady State Auditory Evoked Potentials","year":2006,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":2,"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":"University of Toronto","keywords":"Computer science; Software; Noise (video); SIGNAL (programming language); Estimator; Signal processing; Process (computing); Graphical user interface; Speech recognition; Speech processing; Real-time computing; Artificial intelligence; Computer hardware; Digital signal processing","score_opus":0.01644610381370812,"score_gpt":0.25827078003449144,"score_spread":0.24182467622078332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528236795","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.002420869,0.000029935949,0.9957997,0.0003921751,0.00010980952,0.0004697101,0.000008742622,0.0002857505,0.0004832717],"genre_scores_gemma":[0.6006994,0.0000012627276,0.3979997,0.00008653419,0.000027755224,0.0000594169,0.0000034899954,0.0000049056416,0.001117505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926305,0.00005255643,0.00021768163,0.00016108695,0.00019535024,0.00011028859],"domain_scores_gemma":[0.9990819,0.0002562812,0.00014881157,0.00031666187,0.00018135793,0.000014979762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003878519,0.00007314121,0.000099130295,0.000057963123,0.00008438877,0.000058441226,0.000366956,0.00003246068,0.0000064311],"category_scores_gemma":[0.00004255502,0.000050987554,0.00005627039,0.00013271984,0.000037672748,0.00035417752,0.00006549074,0.000041571362,0.0000055901837],"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.000057990168,0.00028387076,0.00006679965,0.0000425268,0.00007645691,0.0000010942417,0.0018835935,0.27356896,0.003014661,0.5077703,0.06835919,0.14487457],"study_design_scores_gemma":[0.00023054099,0.00012484523,0.0020983964,0.000009369599,0.000007981653,9.46691e-7,0.000024231065,0.84238,0.03437208,0.11995981,0.0006880783,0.000103764134],"about_ca_topic_score_codex":0.0001648527,"about_ca_topic_score_gemma":0.00003683211,"teacher_disagreement_score":0.5982786,"about_ca_system_score_codex":0.000020964593,"about_ca_system_score_gemma":0.000062108724,"threshold_uncertainty_score":0.2079212},"labels":[],"label_agreement":null},{"id":"W1531959055","doi":"10.1109/pacrim.1997.619994","title":"Generalized DLMS algorithm","year":2002,"lang":"en","type":"article","venue":"","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":"Université Laval","funders":"","keywords":"Computer science; Convergence (economics); Residual; Algorithm; Architecture; Least mean squares filter; Algorithm design; Adaptive filter","score_opus":0.02813864554737143,"score_gpt":0.25358024199525847,"score_spread":0.22544159644788703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531959055","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.00033063372,0.00004843607,0.9337265,0.0024203227,0.000062887004,0.000055814915,1.9423742e-7,0.0008340361,0.06252119],"genre_scores_gemma":[0.022801004,0.000026377253,0.96002954,0.0038524168,0.000031526357,0.000011197103,5.1633856e-7,0.00000426963,0.013243126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947137,0.00003625956,0.00009597959,0.00015641331,0.00013137258,0.00010859597],"domain_scores_gemma":[0.9995673,0.000014192467,0.000021650536,0.00032330916,0.000030843355,0.000042742402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010784586,0.000054917997,0.000059285598,0.000053568063,0.00003921202,0.00011051729,0.0003897594,0.000031991298,0.0004111246],"category_scores_gemma":[0.000005401214,0.000046305973,0.000030683197,0.0001844738,0.000011356223,0.0003089627,0.000079807076,0.000048743397,0.0003761515],"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":[1.11859876e-7,0.000044495147,0.000012436921,6.1130186e-7,0.000004288955,0.0000044740664,0.00051582616,0.000006813512,0.0003430622,0.55209976,0.08068503,0.36628312],"study_design_scores_gemma":[0.00020005408,0.000039741895,0.00006816904,0.0000015679016,8.890856e-7,0.000014565551,0.0000041618437,0.8059443,0.018314756,0.0113322465,0.16392037,0.00015916913],"about_ca_topic_score_codex":0.000013234577,"about_ca_topic_score_gemma":0.0000013415296,"teacher_disagreement_score":0.80593747,"about_ca_system_score_codex":0.000008698356,"about_ca_system_score_gemma":0.0000041258427,"threshold_uncertainty_score":0.4834792},"labels":[],"label_agreement":null},{"id":"W1544216941","doi":"10.1109/iscas.2003.1205874","title":"A feedforward timing recovery scheme using two samples per symbol: algorithm, performance and implementation issues","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Feed forward; Scheme (mathematics); Symbol (formal); Algorithm; Mathematics; Engineering; Control engineering","score_opus":0.04283904207897455,"score_gpt":0.3407749704691371,"score_spread":0.29793592839016253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544216941","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.21696931,0.00007235061,0.78066033,0.00019355208,0.00007871727,0.00016951594,0.0000011618806,0.0002374699,0.0016175814],"genre_scores_gemma":[0.13797182,0.0000828944,0.8611883,0.00044387014,0.000042042804,0.000011545456,0.000003329065,0.000010099686,0.00024608683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989688,0.00007737511,0.00022663064,0.0003046421,0.00020067647,0.00022187365],"domain_scores_gemma":[0.9994971,0.000039633145,0.000080103884,0.00024548147,0.00008184629,0.000055844128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052337046,0.00013165899,0.00013137922,0.0001398742,0.000188672,0.00030986732,0.00018073151,0.00003914146,0.00008230094],"category_scores_gemma":[0.000014254383,0.00012524662,0.000031182048,0.00019594107,0.000026900421,0.0013645703,0.00009214925,0.00008332371,0.000011070298],"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.000011116945,0.00013128205,0.02771638,0.0000983813,0.00011414456,0.000005266931,0.011859777,0.00031817614,0.027894206,0.21265322,0.004632376,0.7145657],"study_design_scores_gemma":[0.0015408569,0.00044560296,0.0065166582,0.00009700726,0.000032027772,0.00019447361,0.0025502173,0.69954664,0.22348316,0.00834875,0.055906884,0.001337722],"about_ca_topic_score_codex":0.00014616718,"about_ca_topic_score_gemma":0.000016045573,"teacher_disagreement_score":0.7132279,"about_ca_system_score_codex":0.00004455361,"about_ca_system_score_gemma":0.00006179325,"threshold_uncertainty_score":0.5107409},"labels":[],"label_agreement":null},{"id":"W1552537573","doi":"10.1007/978-3-540-72432-2_10","title":"MFCM for Nonlinear Blind Channel Equalization","year":2007,"lang":"en","type":"book-chapter","venue":"Advances in soft computing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Algorithm; Nonlinear system; Channel (broadcasting); Simulated annealing; Blind equalization; Bayesian probability; Mathematics; Gaussian; Computer science; Mathematical optimization; Equalization (audio); Statistics; Telecommunications","score_opus":0.04967422445286042,"score_gpt":0.3514324561832285,"score_spread":0.3017582317303681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552537573","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.0000033115061,0.0025225652,0.90423334,0.00010708789,0.00051274593,0.00059335085,0.000006292614,0.00048751791,0.09153382],"genre_scores_gemma":[0.0015711127,0.0005910373,0.9803546,0.0014751767,0.0007294352,0.000012757898,0.00013728278,0.00009878433,0.015029784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790055,0.000024548688,0.00064307754,0.00070698996,0.00035435482,0.00037050896],"domain_scores_gemma":[0.9980917,0.00054515246,0.000540238,0.0005163296,0.00024152915,0.00006506123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010761793,0.00033362393,0.0004091129,0.00036529233,0.00015349407,0.00012656127,0.0008913094,0.00033801215,0.000007792693],"category_scores_gemma":[0.00009853771,0.00038907482,0.00012744017,0.00013597835,0.00006848892,0.00059361616,0.0003277023,0.00039296143,0.000026864838],"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.000019348061,0.000031216106,0.000005936431,0.0001147788,0.000012792197,0.000010337174,0.0015551534,0.009334042,0.000005258139,0.51532745,0.0002271683,0.47335652],"study_design_scores_gemma":[0.0004896082,0.000102152306,0.0000015523586,0.0004107984,0.0000060877005,0.000008047837,0.000012720609,0.39767677,0.00012803408,0.17200875,0.4286493,0.0005061543],"about_ca_topic_score_codex":0.0000027281344,"about_ca_topic_score_gemma":0.000046967027,"teacher_disagreement_score":0.47285035,"about_ca_system_score_codex":0.000086758344,"about_ca_system_score_gemma":0.000086190725,"threshold_uncertainty_score":0.9998561},"labels":[],"label_agreement":null},{"id":"W1561023326","doi":"","title":"A recursive least-squares extension of the natural gradient algorithm for blind signal separation of audio mixtures","year":2004,"lang":"en","type":"article","venue":"Canadian acoustics","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Blind signal separation; Algorithm; Extension (predicate logic); SIGNAL (programming language); Computer science; Separation (statistics); Signal processing; Audio signal; Recursive least squares filter; Speech recognition; Digital signal processing; Adaptive filter; Speech coding; Telecommunications","score_opus":0.013862043522021727,"score_gpt":0.26283996682931476,"score_spread":0.24897792330729304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561023326","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.0417596,0.00020929948,0.9559552,0.0009949091,0.00035105573,0.0005404572,0.000088220055,0.000031260424,0.00007000058],"genre_scores_gemma":[0.87482136,0.000007961541,0.124567844,0.00046797565,0.000047109308,0.000014248642,0.000012189361,0.000008174426,0.00005313239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907255,0.000042749376,0.0002494751,0.0002040181,0.00022112281,0.00021009168],"domain_scores_gemma":[0.99880266,0.000069238326,0.00018979922,0.00035554016,0.00046667628,0.00011607733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019408048,0.00011120637,0.00015037705,0.00017546122,0.00011921409,0.0000354649,0.0004785125,0.00009524659,0.0000020037724],"category_scores_gemma":[0.00010221942,0.00009030062,0.00009334961,0.00032044403,0.00010147722,0.00013727235,0.000039478226,0.00013150551,0.0000010468054],"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.00011085411,0.0005125082,0.00011449469,0.00025443416,0.00023097434,0.000038255053,0.024650503,0.0936493,0.2766536,0.32292658,0.039598037,0.24126045],"study_design_scores_gemma":[0.0031363512,0.0016132441,0.009642037,0.00048150704,0.00016376458,0.00008205758,0.0006436254,0.5223506,0.35189414,0.10512997,0.003877252,0.0009854613],"about_ca_topic_score_codex":0.002421259,"about_ca_topic_score_gemma":0.0033544316,"teacher_disagreement_score":0.83306175,"about_ca_system_score_codex":0.00016760139,"about_ca_system_score_gemma":0.000861156,"threshold_uncertainty_score":0.36823526},"labels":[],"label_agreement":null},{"id":"W1565749243","doi":"10.1109/icosp.2004.1452647","title":"A new perceptual convolutive blind source separation algorithm for speech separation","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Blind signal separation; Computer science; Speech recognition; Source separation; Separation (statistics); Algorithm; Convergence (economics); SIGNAL (programming language); Masking (illustration); Human ear; Independent component analysis; Auditory system; Artificial intelligence; Channel (broadcasting); Acoustics; Machine learning; Telecommunications","score_opus":0.025472151225857005,"score_gpt":0.32898610335257134,"score_spread":0.30351395212671434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565749243","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.0016968015,0.000038304064,0.98870903,0.002932956,0.00011876943,0.0008679738,0.00000392564,0.0008917486,0.004740507],"genre_scores_gemma":[0.02338092,0.000008651549,0.94864297,0.0019599383,0.000473009,0.00007696875,0.000036401027,0.00001931394,0.02540181],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983293,0.000091261536,0.0003810352,0.0005292125,0.00035428203,0.00031494765],"domain_scores_gemma":[0.99887407,0.00012694647,0.00014324702,0.00044110807,0.00025990276,0.00015471212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047351187,0.00021455855,0.00020308651,0.0001937067,0.00018240199,0.0003524832,0.0005234054,0.00016931284,0.00012903126],"category_scores_gemma":[0.00003298546,0.00021067687,0.000117248936,0.0003538958,0.000033581025,0.0015778714,0.00010439437,0.00014749932,0.00027935414],"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.000015995267,0.00006508436,0.000007582693,0.0000023914756,0.000017533108,4.008932e-7,0.004914046,0.0003545676,0.0009264916,0.02664324,0.06603105,0.9010216],"study_design_scores_gemma":[0.0010711246,0.00025967593,0.00008891648,0.000005706111,0.000010309019,0.000020956764,0.00013701644,0.801416,0.030231478,0.0029152168,0.16352338,0.00032026245],"about_ca_topic_score_codex":0.00007371588,"about_ca_topic_score_gemma":0.00018160396,"teacher_disagreement_score":0.90070134,"about_ca_system_score_codex":0.00012152842,"about_ca_system_score_gemma":0.0002560432,"threshold_uncertainty_score":0.85911536},"labels":[],"label_agreement":null},{"id":"W1566487560","doi":"10.1109/icsmc.2003.1244602","title":"A nonlinear prediction approach for system identification using chaos symbolic dynamic","year":2004,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Calgary","funders":"","keywords":"Computer science; Nonlinear system; Identification (biology); CHAOS (operating system); Algorithm; SIGNAL (programming language); Control theory (sociology); System identification; Artificial intelligence; Data mining","score_opus":0.022897546026659846,"score_gpt":0.2790083951421908,"score_spread":0.25611084911553095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566487560","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.017094018,0.000013917406,0.9801718,0.00012699468,0.000117359814,0.00071053754,0.000006529703,0.0011273806,0.0006314441],"genre_scores_gemma":[0.5431812,0.0000010305188,0.45657668,0.000045486602,0.000028595425,0.00007223688,0.000020096752,0.0000071156255,0.00006756447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906236,0.000030386369,0.00026813758,0.0003193793,0.00017664692,0.00014308437],"domain_scores_gemma":[0.9993144,0.0000118047865,0.0001090613,0.000399544,0.00012469372,0.00004047396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041270992,0.00009172983,0.00010409805,0.00015243325,0.00013435031,0.00018644433,0.0003397062,0.00007774851,3.6958147e-7],"category_scores_gemma":[0.00001187536,0.00008799624,0.000055673427,0.00029195327,0.000015443256,0.0005560433,0.000047776488,0.000058529415,0.0000064177443],"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.000011934915,0.00038701596,0.00004773106,0.0003071887,0.000044133878,9.537633e-7,0.0030041307,0.035078578,0.056809492,0.8985402,0.00007623698,0.0056923837],"study_design_scores_gemma":[0.00022893031,0.000034518023,0.00008716311,0.000016885722,0.000006523361,0.00002269192,0.000097208576,0.9832197,0.015135004,0.0009936527,0.00006991315,0.00008783941],"about_ca_topic_score_codex":0.000028295817,"about_ca_topic_score_gemma":0.0000026666723,"teacher_disagreement_score":0.9481411,"about_ca_system_score_codex":0.00020157624,"about_ca_system_score_gemma":0.00008042242,"threshold_uncertainty_score":0.35883823},"labels":[],"label_agreement":null},{"id":"W1568058438","doi":"10.1007/3-540-44522-6_60","title":"The Foundational Theory of Optimal Bayesian Pairwise Linear Classifiers","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Pairwise comparison; Covariance; Classifier (UML); Computer science; Linear discriminant analysis; Artificial intelligence; Linear classifier; Pattern recognition (psychology); Perceptron; Linear programming; Applied mathematics; Covariance function; Bayes' theorem; Linear model; Mathematics; Algorithm; Mathematical optimization; Bayesian probability; Covariance matrix; Machine learning; Artificial neural network; Statistics","score_opus":0.018231131688461674,"score_gpt":0.25830180362382926,"score_spread":0.24007067193536757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568058438","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.00002685803,0.00020201744,0.9878358,0.0013804549,0.00047814127,0.0003241335,0.000004211991,0.00017187677,0.009576453],"genre_scores_gemma":[0.113097295,0.0001750677,0.8828437,0.0021670696,0.00038407187,0.000020505524,0.00000992083,0.000045913876,0.0012564624],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693024,0.00012265288,0.00059503684,0.00089205895,0.001032808,0.00042721262],"domain_scores_gemma":[0.996748,0.0012218435,0.00034760294,0.0013192934,0.00025345254,0.0001098233],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002163175,0.00036385708,0.00034357116,0.00048589567,0.00037761693,0.00040596563,0.0035368952,0.00027638848,0.000047471724],"category_scores_gemma":[0.00010333161,0.0002735825,0.00015890104,0.00047813225,0.0015215719,0.00052190886,0.0006206077,0.000739051,0.000021441087],"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.000013139086,0.000016493832,0.0000059054246,0.0000064417954,0.000010416228,0.0000075501566,0.00074806955,0.0171828,0.000022092574,0.40232486,0.000037320526,0.57962495],"study_design_scores_gemma":[0.00013371311,0.0001515396,0.000043832017,0.00011863649,0.0000051832294,0.000024573204,3.9407604e-7,0.41987222,0.0012681363,0.5690118,0.009014194,0.00035576083],"about_ca_topic_score_codex":0.0000052230735,"about_ca_topic_score_gemma":0.000019493567,"teacher_disagreement_score":0.5792692,"about_ca_system_score_codex":0.00014716912,"about_ca_system_score_gemma":0.0009255048,"threshold_uncertainty_score":0.9999716},"labels":[],"label_agreement":null},{"id":"W1568113696","doi":"10.5281/zenodo.39011","title":"Marginalized Particle Filtering For Blind System Identification","year":2005,"lang":"en","type":"article","venue":"MacSphere (McMaster University)","topic":"Blind Source Separation 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":"Particle filter; Autoregressive model; Finite impulse response; MIMO; Convolution (computer science); State-space representation; Impulse response; Algorithm; Computer science; Monte Carlo method; System identification; Bayesian probability; Blind signal separation; State space; Nonlinear system; Impulse (physics); Control theory (sociology); Infinite impulse response; Posterior probability; Channel (broadcasting); Kalman filter; Mathematics; Filter (signal processing); Artificial intelligence; Statistics; Digital filter; Telecommunications; Data modeling; Artificial neural network","score_opus":0.02780975504306106,"score_gpt":0.2366691191140066,"score_spread":0.20885936407094552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568113696","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.0042384225,0.000017823733,0.94132006,0.0010267392,0.000073386655,0.00034194073,0.0000036461463,0.0005400514,0.052437913],"genre_scores_gemma":[0.7136362,0.000004593883,0.12069242,0.0002240905,0.00007454423,0.000009554139,0.000005510286,0.000016151238,0.1653369],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908733,0.00007865307,0.00017010106,0.0003178114,0.0001396453,0.00020643396],"domain_scores_gemma":[0.9993327,0.00004396751,0.000109660185,0.00034832736,0.00009086996,0.00007443973],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022854499,0.00010901154,0.00011808864,0.000087605426,0.00014511135,0.00020202405,0.0006020177,0.000059744343,0.0009329895],"category_scores_gemma":[0.00000744731,0.00012517512,0.00007261941,0.00037303937,0.000022901233,0.0009830144,0.00014712983,0.000062633895,0.00008380444],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012472608,0.00008777127,0.0001936173,0.00007737159,0.00003864433,0.000010897215,0.0014197953,0.00085773127,0.01040539,0.39551085,0.0011987912,0.5900744],"study_design_scores_gemma":[0.0016761861,0.00006517391,0.00025952063,0.000038304643,0.000021412641,0.000009998154,0.00044293542,0.18296157,0.05786824,0.00025660172,0.75612754,0.00027249788],"about_ca_topic_score_codex":0.000008285962,"about_ca_topic_score_gemma":0.000024802985,"teacher_disagreement_score":0.8206276,"about_ca_system_score_codex":0.00011035748,"about_ca_system_score_gemma":0.000030174155,"threshold_uncertainty_score":0.9999803},"labels":[],"label_agreement":null},{"id":"W1568391929","doi":"10.1109/iccv.2001.937579","title":"Sparse PCA. Extracting multi-scale structure from data","year":2002,"lang":"en","type":"article","venue":"","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 Toronto","funders":"","keywords":"Computer science; Scale (ratio); Pattern recognition (psychology); Artificial intelligence; Data mining","score_opus":0.12084344609399217,"score_gpt":0.30793594182154155,"score_spread":0.18709249572754938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568391929","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.011625728,0.000077854405,0.98115516,0.0012027919,0.00013650004,0.00010221108,0.000027673974,0.0007409856,0.0049311025],"genre_scores_gemma":[0.393736,0.0000064689993,0.6044462,0.0008296991,0.000050164163,0.0000012689588,0.000020250398,0.0000060713455,0.0009038909],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893403,0.000057499175,0.00017762194,0.00046387754,0.00020529846,0.00016166776],"domain_scores_gemma":[0.9981847,0.00008820981,0.00007439985,0.0015524912,0.0000338049,0.000066401924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014113051,0.00010513255,0.00010265223,0.00004917477,0.00008196762,0.0002491772,0.0016536774,0.00007825047,0.0007130426],"category_scores_gemma":[0.00004465642,0.00009197784,0.000020017329,0.0001715351,0.000019268866,0.0013026635,0.00059837254,0.00018778264,0.00014263786],"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.0000064320566,0.0007334114,0.0086283665,0.00001578233,0.00009208835,0.00007524488,0.015868157,0.00022779459,0.0842021,0.025525436,0.23876381,0.6258614],"study_design_scores_gemma":[0.00022015705,0.0000134574675,0.0018537071,0.0000078376515,0.0000039217075,0.000008750348,0.000056968824,0.94669664,0.02099691,0.0014735054,0.028442986,0.00022517247],"about_ca_topic_score_codex":0.00017581269,"about_ca_topic_score_gemma":0.00027723642,"teacher_disagreement_score":0.94646883,"about_ca_system_score_codex":0.000011886612,"about_ca_system_score_gemma":0.00000978711,"threshold_uncertainty_score":0.7807317},"labels":[],"label_agreement":null},{"id":"W1578593028","doi":"10.1109/iscas.2006.1693891","title":"A blind identification technique for noisy ARMA systems","year":2006,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Concordia University","funders":"","keywords":"Cepstrum; Autoregressive–moving-average model; Autocorrelation; Autoregressive model; Computer science; Noise (video); Speech recognition; System identification; Estimation theory; Identification (biology); Moving average; Algorithm; Mathematics; Pattern recognition (psychology); Artificial intelligence; Statistics; Data modeling","score_opus":0.01923041249081509,"score_gpt":0.2813606503355187,"score_spread":0.26213023784470363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578593028","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.00051848614,0.0000319222,0.9894155,0.00084373046,0.00012275601,0.0011425238,0.000002274053,0.00081835955,0.0071043926],"genre_scores_gemma":[0.8036145,0.0000015891487,0.19119594,0.000152335,0.00007684159,0.00096629106,0.0000127141575,0.000009588594,0.0039701974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990852,0.000044226003,0.0002971177,0.00027061597,0.00016067759,0.00014217575],"domain_scores_gemma":[0.99918616,0.000051841802,0.00011630241,0.0004496601,0.0001695804,0.000026463103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063509686,0.000086575776,0.000094867035,0.00015571229,0.00008173844,0.00035056265,0.00048041588,0.000078598736,0.0000027894393],"category_scores_gemma":[0.000015710068,0.00008010067,0.000049652917,0.00027052467,0.00002051903,0.00046768505,0.00005008092,0.000054065436,0.000028201495],"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.000002633085,0.000048507627,0.00002732451,0.000014661864,0.0000025364438,3.8145473e-7,0.000045210654,0.000104654246,0.054220174,0.9307037,0.01431018,0.0005200227],"study_design_scores_gemma":[0.0004887003,0.00009553558,0.0005378003,0.0000228797,0.00000662105,0.000030351568,0.000024167543,0.10312384,0.76556456,0.07203504,0.0577029,0.00036757783],"about_ca_topic_score_codex":0.00009839465,"about_ca_topic_score_gemma":0.000011787518,"teacher_disagreement_score":0.8586687,"about_ca_system_score_codex":0.000032775963,"about_ca_system_score_gemma":0.00003727345,"threshold_uncertainty_score":0.33804837},"labels":[],"label_agreement":null},{"id":"W1585372892","doi":"","title":"BLIND SOURCE SEPARATION ALGORITHM FOR MIMO CONVOLUTIVE MIXTURES","year":2001,"lang":"en","type":"article","venue":"","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":"Algorithm; Blind signal separation; Mathematics; Permutation (music); Diagonal; MIMO; Frequency domain; Source separation; Bin; Mathematical optimization; Computer science; Channel (broadcasting); Statistics","score_opus":0.024119846260050218,"score_gpt":0.3142044078251871,"score_spread":0.2900845615651369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585372892","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.0011449114,0.000055353295,0.9860444,0.0016388957,0.000113606766,0.0005003229,0.000002282378,0.00068930205,0.009810928],"genre_scores_gemma":[0.08789052,0.000022209193,0.89396673,0.0031815106,0.00015994272,0.00015681439,0.000019836985,0.000016793118,0.014585639],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989696,0.00006095846,0.00020966268,0.00034198197,0.00019224206,0.00022555598],"domain_scores_gemma":[0.9991619,0.00013761884,0.0000860252,0.00034456342,0.0001985343,0.00007137908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033810418,0.00013022608,0.00013198494,0.00012617071,0.0001372217,0.0002034718,0.0004476346,0.00010099952,0.000028410643],"category_scores_gemma":[0.000030146452,0.00011770073,0.00007744713,0.00029102227,0.000034835393,0.0005748522,0.000079496094,0.000086515705,0.00004959393],"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.000046096888,0.0002648693,0.00014348628,0.000008541898,0.00006484607,0.000005824464,0.003900786,0.00025194063,0.003467534,0.2220568,0.09013695,0.67965233],"study_design_scores_gemma":[0.0009897207,0.0002611584,0.00012673612,0.000007474436,0.000008062363,0.000030524527,0.00007328747,0.67854357,0.051927213,0.02042934,0.24726184,0.00034108025],"about_ca_topic_score_codex":0.00002808242,"about_ca_topic_score_gemma":0.000017096356,"teacher_disagreement_score":0.6793112,"about_ca_system_score_codex":0.00003079152,"about_ca_system_score_gemma":0.00005854118,"threshold_uncertainty_score":0.47996965},"labels":[],"label_agreement":null},{"id":"W1590652165","doi":"10.1109/icassp.1987.1169635","title":"A criticism of the parametric EEG spike detector","year":2005,"lang":"en","type":"article","venue":"","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":"University of British Columbia","funders":"","keywords":"Parametric statistics; Detector; Spike (software development); Noise (video); Filter (signal processing); SIGNAL (programming language); Stage (stratigraphy); Sampling (signal processing); Mathematics; Computer science; Statistics; Control theory (sociology); Artificial intelligence; Telecommunications; Computer vision","score_opus":0.012949447995038716,"score_gpt":0.25689078724980074,"score_spread":0.24394133925476202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590652165","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.08207213,0.000062872336,0.89524055,0.004655626,0.00007349472,0.00015741418,5.2206707e-7,0.00028351188,0.017453907],"genre_scores_gemma":[0.8670588,0.0000020496827,0.13062574,0.0015120789,0.000012298173,0.0000062929535,3.2990965e-8,0.0000026682717,0.0007800552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99937207,0.000050752195,0.00015297408,0.00012574498,0.00019561627,0.0001028393],"domain_scores_gemma":[0.99928766,0.00008835693,0.000045783272,0.0004886553,0.000062775216,0.000026780433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020741875,0.000053350195,0.000071468545,0.000094451985,0.000035563866,0.000043662272,0.00071331667,0.00003542547,0.00004163367],"category_scores_gemma":[0.000087367065,0.000034145167,0.000056505523,0.00062663073,0.00003318478,0.00020500623,0.00015156978,0.00007493498,0.000030411038],"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.0000023253879,0.00019047652,0.00083734083,0.000013401778,0.00001160446,8.685259e-7,0.0010827181,0.00013877594,0.011164183,0.83509296,0.008139354,0.14332598],"study_design_scores_gemma":[0.0002934365,0.00012442672,0.026516616,0.000021842954,0.0000059417093,0.000016841832,0.000020997371,0.06184743,0.8337852,0.019558355,0.057553362,0.00025556528],"about_ca_topic_score_codex":0.000015907886,"about_ca_topic_score_gemma":0.000025575864,"teacher_disagreement_score":0.822621,"about_ca_system_score_codex":0.000014622609,"about_ca_system_score_gemma":0.00003324527,"threshold_uncertainty_score":0.13923995},"labels":[],"label_agreement":null},{"id":"W1594302055","doi":"10.5772/39192","title":"On Temporomandibular Joint Sound Signal Analysis Using ICA","year":2012,"lang":"en","type":"book-chapter","venue":"InTech eBooks","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Joint (building); Sound (geography); Independent component analysis; Temporomandibular joint; SIGNAL (programming language); Acoustics; Computer science; Orthodontics; Artificial intelligence; Medicine; Physics; Engineering","score_opus":0.05117648895831193,"score_gpt":0.28119596631842914,"score_spread":0.2300194773601172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594302055","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.00014026367,0.000096168165,0.67446315,0.000047126476,0.00008777587,0.00024244288,0.000007806652,0.0004987249,0.32441655],"genre_scores_gemma":[0.8000854,0.00000813042,0.055413723,0.0013012454,0.00027490855,0.000032508993,0.00002734252,0.000115700714,0.14274102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976555,0.000061494444,0.0005893729,0.0006749329,0.0006710729,0.0003475874],"domain_scores_gemma":[0.9978271,0.00009362954,0.00048141804,0.0012635981,0.0001702833,0.00016394867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006146026,0.00047328416,0.0006441613,0.0011714828,0.00015286978,0.0002863089,0.00093470636,0.0005278597,0.00025584298],"category_scores_gemma":[0.000013107938,0.00045168234,0.0005428467,0.00008049143,0.0001269301,0.00014969427,0.00041697497,0.0007584298,0.00016753263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011726204,0.000036173285,0.0000050023364,0.000020416952,0.00096346776,0.000057853205,0.00088569184,0.000023131111,0.005735473,0.9840393,0.00038023863,0.00784149],"study_design_scores_gemma":[0.00024162896,0.00036937743,0.000007923188,0.00032260295,0.0008070695,0.000062284,0.000008418328,0.004230373,0.106193416,0.8094963,0.07669203,0.0015685877],"about_ca_topic_score_codex":0.000029138466,"about_ca_topic_score_gemma":0.000017130924,"teacher_disagreement_score":0.7999452,"about_ca_system_score_codex":0.00021335075,"about_ca_system_score_gemma":0.00012306425,"threshold_uncertainty_score":0.99979347},"labels":[],"label_agreement":null},{"id":"W1594805243","doi":"","title":"Relaxed look-ahead pipelined nonlinear channel equalizer","year":2004,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Pipeline (software); Computer science; Backpropagation; Nonlinear system; Look-ahead; Artificial neural network; Channel (broadcasting); Throughput; Equalizer; Algorithm; Parallel computing; Computer engineering; Artificial intelligence; Wireless; Telecommunications","score_opus":0.025469836423679625,"score_gpt":0.2844228598461503,"score_spread":0.2589530234224707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594805243","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.0027162042,0.000034563287,0.9690299,0.007975974,0.00014261268,0.0001830954,0.0000011019305,0.0014089514,0.018507598],"genre_scores_gemma":[0.38835004,0.00001799512,0.60078514,0.0070549618,0.00011421064,0.000024329023,0.0000071803697,0.000019703348,0.0036264444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987675,0.000050035815,0.00028095054,0.00036024346,0.00028876148,0.00025252663],"domain_scores_gemma":[0.9990371,0.00003881856,0.0000711781,0.00063835405,0.00010957284,0.00010496601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041173998,0.00014258812,0.0001495295,0.00013208465,0.000083101935,0.0001421653,0.0006943963,0.000104591345,0.00004012977],"category_scores_gemma":[0.0000486205,0.0001238954,0.00007365995,0.000341908,0.000035500187,0.00053093425,0.00019542928,0.0001569009,0.0004719598],"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.0000103096745,0.0002697628,0.000017174465,0.00001111182,0.000015575704,0.00002172542,0.0026061854,0.0008815019,0.0022308955,0.9845672,0.004677956,0.004690558],"study_design_scores_gemma":[0.00409936,0.0007942956,0.0003555009,0.000099943136,0.000015978532,0.00009214794,0.00023943113,0.1478568,0.37691915,0.37383574,0.09406121,0.0016304627],"about_ca_topic_score_codex":0.00009572523,"about_ca_topic_score_gemma":0.00002951097,"teacher_disagreement_score":0.61073154,"about_ca_system_score_codex":0.00004532638,"about_ca_system_score_gemma":0.00011426369,"threshold_uncertainty_score":0.60662454},"labels":[],"label_agreement":null},{"id":"W1595713750","doi":"10.1109/sam.2006.1706179","title":"Multiple Window Bispectrum Estimator","year":2006,"lang":"en","type":"article","venue":"","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":"Queen's University","funders":"","keywords":"Bispectrum; Estimator; Higher-order statistics; Algorithm; Mathematics; Nonparametric statistics; Computer science; Applied mathematics; Signal processing; Statistics; Spectral density; Digital signal processing","score_opus":0.006675744527724177,"score_gpt":0.22140545659012886,"score_spread":0.21472971206240468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595713750","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.0077997255,0.000013073553,0.9363961,0.0023328266,0.000055895267,0.000092821305,3.7274938e-7,0.0012359872,0.052073184],"genre_scores_gemma":[0.6861807,4.1541523e-7,0.3119697,0.00043127642,0.000024050256,0.000008059641,0.0000012253897,0.000003936892,0.0013806608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99937725,0.000023662102,0.000122919,0.00019111506,0.00014110579,0.00014394619],"domain_scores_gemma":[0.9995166,0.00004728725,0.00003241512,0.00034363166,0.000028652421,0.000031399075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012403732,0.000070689355,0.000067991925,0.000074269585,0.0000708852,0.00014360456,0.00038995664,0.000035980935,0.00002842872],"category_scores_gemma":[0.000014790664,0.00006130767,0.00003265564,0.00020771343,0.000017344079,0.0003603226,0.0000881892,0.000058070516,0.00015878164],"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":[8.0714494e-7,0.000049722592,0.003491134,0.0000013063992,0.000001681552,0.0000038203925,0.00004399724,0.00009650265,0.0028240783,0.97671837,0.014856293,0.0019123036],"study_design_scores_gemma":[0.0006564187,0.00010921075,0.04325711,0.000009357993,0.0000027034569,0.000036872585,0.000012208802,0.33301356,0.41029438,0.14474307,0.067340344,0.0005247631],"about_ca_topic_score_codex":0.00018520688,"about_ca_topic_score_gemma":0.00008452122,"teacher_disagreement_score":0.8319753,"about_ca_system_score_codex":0.000015710186,"about_ca_system_score_gemma":0.000027626982,"threshold_uncertainty_score":0.25000542},"labels":[],"label_agreement":null},{"id":"W1606194942","doi":"","title":"A novel dimensionality reduction technique based on independent component analysis for modeling microarray gene expression data","year":2004,"lang":"en","type":"article","venue":"University of Southern Queensland ePrints (University of Southern Queensland)","topic":"Blind Source Separation Techniques","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":"University of Toronto","funders":"University of Toronto","keywords":"Dimensionality reduction; Principal component analysis; Curse of dimensionality; Independent component analysis; Computer science; Pattern recognition (psychology); Artificial intelligence; Data mining; Expression (computer science); Microarray analysis techniques; Gene expression; Gene; Biology; Genetics","score_opus":0.0341641945661108,"score_gpt":0.22836796476395554,"score_spread":0.19420377019784474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606194942","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.2847968,0.000008238377,0.71290773,0.00057481,0.000024903602,0.00047049884,0.0009899657,0.00014860825,0.00007844137],"genre_scores_gemma":[0.76094407,0.000008958896,0.2386406,0.000023862223,0.000013021984,3.0641763e-7,0.00025821727,0.000015151048,0.00009580396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767345,0.00017104317,0.0002981463,0.00097202737,0.0005810916,0.0003042526],"domain_scores_gemma":[0.99724126,0.00007889058,0.0005287861,0.0015916884,0.00039717043,0.00016221865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010820267,0.00029337392,0.0005635023,0.00068346947,0.0004284624,0.000028897579,0.0017495065,0.00028962828,0.000041155785],"category_scores_gemma":[0.000021720049,0.0003409766,0.0003537639,0.000568773,0.00020044805,0.0003164221,0.00064088806,0.00024376878,0.000034006564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003717884,0.0036201098,0.01513229,0.00033102278,0.0018660403,0.00007059891,0.06093313,0.64148676,0.2672459,0.0037886624,0.00015924156,0.001648367],"study_design_scores_gemma":[0.01583488,0.00068462116,0.00464136,0.00091589463,0.0014447299,0.000036726153,0.055087987,0.8682793,0.03898174,0.010849067,0.00077920186,0.002464497],"about_ca_topic_score_codex":0.0057828743,"about_ca_topic_score_gemma":0.00050975283,"teacher_disagreement_score":0.4761473,"about_ca_system_score_codex":0.00015777056,"about_ca_system_score_gemma":0.0002174204,"threshold_uncertainty_score":0.9999042},"labels":[],"label_agreement":null},{"id":"W1608817341","doi":"10.1109/icosp.2004.1452648","title":"A post-filter perceptual convolutive blind source separation approach for speech signal","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Blind signal separation; Speech recognition; Computer science; Masking (illustration); Frequency domain; Filter (signal processing); SIGNAL (programming language); Source separation; Filter bank; Residual; Algorithm; Telecommunications; Channel (broadcasting); Computer vision","score_opus":0.029613756762571858,"score_gpt":0.29710975420200403,"score_spread":0.2674959974394322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608817341","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.011634011,0.000017106138,0.9710422,0.0018043849,0.000030329255,0.0008041629,0.000006280898,0.0006329127,0.014028588],"genre_scores_gemma":[0.42283496,0.0000011142413,0.56707555,0.0027935416,0.00015956636,0.000097826494,0.0000327764,0.000013148858,0.0069914907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846804,0.00009856093,0.00030279328,0.00050993904,0.00030951455,0.00031114367],"domain_scores_gemma":[0.9989665,0.00010901124,0.000098953344,0.00039731432,0.00032743026,0.0001007569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005202903,0.00019093623,0.00018202861,0.00017184661,0.00015631027,0.00027162366,0.00060792535,0.00014337883,0.00011808389],"category_scores_gemma":[0.000027850881,0.00017186078,0.00012134504,0.00022128987,0.00006266379,0.0010189037,0.00013976601,0.00015810877,0.00010874721],"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.0005667015,0.0019933025,0.00024814863,0.000063985746,0.00020994175,0.000003698657,0.07821732,0.008988224,0.06803796,0.3468409,0.1065995,0.38823032],"study_design_scores_gemma":[0.0011711094,0.00045133574,0.00017765483,0.0000043637874,0.000011999789,0.00003818333,0.000520574,0.9117395,0.05405857,0.00088464393,0.03049732,0.00044472734],"about_ca_topic_score_codex":0.000022020313,"about_ca_topic_score_gemma":0.000018923536,"teacher_disagreement_score":0.90275127,"about_ca_system_score_codex":0.00007147125,"about_ca_system_score_gemma":0.00010546112,"threshold_uncertainty_score":0.7008279},"labels":[],"label_agreement":null},{"id":"W1648185484","doi":"10.1109/ismvl.1992.186817","title":"Autocorrelation techniques for multi-bit decoder PLAs","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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 Victoria","funders":"","keywords":"Autocorrelation; Disjoint sets; Computer science; Decoding methods; Algorithm; Variable (mathematics); Selection (genetic algorithm); Bit (key); Mathematics; Discrete mathematics; Artificial intelligence; Statistics","score_opus":0.047621163726210274,"score_gpt":0.3257482283172772,"score_spread":0.2781270645910669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1648185484","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.00017062877,0.000010872364,0.9795255,0.0003472525,0.00007463781,0.0006901303,6.4387933e-7,0.0015058847,0.017674455],"genre_scores_gemma":[0.066081926,0.0000025559305,0.92947024,0.0009671014,0.000010523388,0.0002745164,0.000002303402,0.000009658525,0.0031811981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992265,0.000055721004,0.00018999241,0.00025596647,0.00011417874,0.00015765768],"domain_scores_gemma":[0.99937713,0.000085703075,0.000063764885,0.0003214339,0.00010755202,0.000044443063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044859035,0.00009772054,0.00009086645,0.000111295674,0.00008994388,0.000121791636,0.0002826048,0.00009723046,0.000026529015],"category_scores_gemma":[0.00010567737,0.00008820224,0.00005551732,0.00017515488,0.000015304237,0.000542233,0.000034361627,0.00007358094,0.000028315331],"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.0000012907539,0.000051434567,0.00017193762,0.0000033187446,0.0000038128474,2.634629e-7,0.00024827395,0.000018324487,0.00050583435,0.98096037,0.0057723047,0.012262846],"study_design_scores_gemma":[0.00045241602,0.00016100463,0.00037669647,0.0000127421845,0.0000045264983,0.000012642553,0.000020870604,0.32827577,0.37148494,0.04599704,0.25283566,0.00036568707],"about_ca_topic_score_codex":0.00000569683,"about_ca_topic_score_gemma":0.000013173805,"teacher_disagreement_score":0.93496335,"about_ca_system_score_codex":0.000030183473,"about_ca_system_score_gemma":0.000056893783,"threshold_uncertainty_score":0.3596783},"labels":[],"label_agreement":null},{"id":"W1657329168","doi":"10.1109/icassp.2001.940424","title":"Blind equalization of constant modulus signals via restricted convex optimization","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Blind equalization; Constant (computer programming); Equalization (audio); Mathematical optimization; Convex optimization; Mathematics; Transformation (genetics); Set (abstract data type); Optimization problem; Modulus; Computer science; Regular polygon; Algorithm","score_opus":0.039808004061766426,"score_gpt":0.26703410534470273,"score_spread":0.2272261012829363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1657329168","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.000945302,0.00004813332,0.98445404,0.00045259958,0.000058133217,0.0002507024,0.0000014275008,0.00039703344,0.013392641],"genre_scores_gemma":[0.7944478,0.00004472945,0.20457017,0.0003984101,0.000009352185,0.000009447001,0.0000074106074,0.0000069105213,0.00050577143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883,0.0001383005,0.00038914374,0.00022638623,0.00028899606,0.00012713118],"domain_scores_gemma":[0.9990104,0.000073059164,0.0002070597,0.0003610472,0.00029613022,0.000052311818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020426937,0.00009618769,0.00015102523,0.00021797956,0.000047781337,0.00007389359,0.00033531495,0.00008792975,0.0003489857],"category_scores_gemma":[0.000068635876,0.00009087152,0.000035013898,0.0008025174,0.000046298363,0.0005213551,0.000071556264,0.000059550825,0.0000158326],"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.000026325242,0.00055134005,0.00024490381,0.000034572968,0.00005040301,0.0000073324413,0.0029200667,0.1863217,0.033077378,0.7515343,0.009118134,0.016113551],"study_design_scores_gemma":[0.00032003538,0.0000874139,0.00001853284,0.000008405102,0.000003217862,0.000003346527,0.000007632967,0.9488471,0.04813583,0.0022205696,0.00024175915,0.00010616364],"about_ca_topic_score_codex":0.000019227524,"about_ca_topic_score_gemma":0.0000018454778,"teacher_disagreement_score":0.7935025,"about_ca_system_score_codex":0.000021048756,"about_ca_system_score_gemma":0.000024128236,"threshold_uncertainty_score":0.38211486},"labels":[],"label_agreement":null},{"id":"W1659874285","doi":"10.1201/9781420036756","title":"The Transforms and Applications Handbook, Second Edition","year":2000,"lang":"en","type":"book","venue":"˜The œelectrical engineering handbook/Electrical engineering handbook series/Electrical engineering handbook","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":640,"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":"Computer science; Library science","score_opus":0.0039674053170464805,"score_gpt":0.1807244245733031,"score_spread":0.17675701925625661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1659874285","genre_codex":"methods","genre_gemma":"other","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.000013369556,0.07536991,0.9103954,0.00042020253,0.0008201929,0.0042445483,0.00008246593,0.005139682,0.003514264],"genre_scores_gemma":[0.010682385,0.14224331,0.12560977,0.005335436,0.021807022,0.028148374,0.001999173,0.007852406,0.6563221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98613757,0.00025014995,0.003181687,0.0032713567,0.0027106132,0.0044486313],"domain_scores_gemma":[0.9901659,0.0037123933,0.00070596446,0.003090132,0.0005699526,0.0017556746],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0016588671,0.0035654143,0.0029243242,0.0020716814,0.0017109613,0.0024456403,0.0046017612,0.002627603,0.00011982112],"category_scores_gemma":[0.00044673288,0.002951212,0.0013525751,0.0035592213,0.00042521628,0.0015757661,0.0006349363,0.0077755866,0.00022508725],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015237733,0.0014373441,0.0000076161377,0.0025362244,0.005693551,0.00078310183,0.0021992202,0.18726599,0.04201064,0.33464584,0.17207919,0.24981749],"study_design_scores_gemma":[0.0015345468,0.0011345386,0.000014288629,0.00093667017,0.00032506278,0.0007174349,0.0000015088664,0.39185563,0.008719351,0.0021141225,0.58959955,0.0030473014],"about_ca_topic_score_codex":0.000023499475,"about_ca_topic_score_gemma":0.000018815828,"teacher_disagreement_score":0.78478557,"about_ca_system_score_codex":0.002265073,"about_ca_system_score_gemma":0.0015086336,"threshold_uncertainty_score":0.99958867},"labels":[],"label_agreement":null},{"id":"W1666284096","doi":"10.1109/pn.2015.7292462","title":"Demultiplexing by independent component analysis in coherent optical transmission: The polarization channel alignment problem","year":2015,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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 Ottawa","funders":"","keywords":"Independent component analysis; Computer science; Polarization mode dispersion; Multiplexing; Blind signal separation; Transmitter; Electronic engineering; Algorithm; Channel (broadcasting); Optical fiber; Telecommunications; Artificial intelligence; Engineering","score_opus":0.026815004118401747,"score_gpt":0.2673007233087502,"score_spread":0.24048571919034847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1666284096","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.007992996,0.00007324696,0.9825821,0.0069482904,0.000028312434,0.00044966163,8.880255e-7,0.00018516423,0.001739342],"genre_scores_gemma":[0.9475075,0.0000068274226,0.05150776,0.0006638372,0.000009134251,0.000060028786,0.000018432727,0.0000060921375,0.00022038484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982445,0.00022325845,0.00036774692,0.00033437615,0.0006124857,0.00021758051],"domain_scores_gemma":[0.9992865,0.000054992375,0.00007996141,0.00034894492,0.00007700201,0.00015264464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010799441,0.00013417748,0.00017964336,0.00018012724,0.000070459966,0.00018901395,0.0005914267,0.000081190825,0.000012779033],"category_scores_gemma":[0.000009918774,0.00008948612,0.00007106312,0.0008456728,0.000027342678,0.0002943828,0.00014658402,0.00016467445,0.000008390271],"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.00014406886,0.004166094,0.030741313,0.000050821527,0.0010153496,0.00003844287,0.05754472,0.18929864,0.03057474,0.603243,0.014404771,0.06877802],"study_design_scores_gemma":[0.0007036791,0.0001121741,0.0033294156,0.00001530696,0.000038929575,0.0000042903334,0.000303531,0.9708714,0.017246462,0.004240563,0.0028682717,0.0002659931],"about_ca_topic_score_codex":0.00021572804,"about_ca_topic_score_gemma":0.000077557685,"teacher_disagreement_score":0.9395145,"about_ca_system_score_codex":0.00012996228,"about_ca_system_score_gemma":0.000058220547,"threshold_uncertainty_score":0.36491382},"labels":[],"label_agreement":null},{"id":"W1713311234","doi":"10.1109/iccsit.2010.5563951","title":"Notice of Retraction: Coal rock interface recognition based on independent component analysis and BP neural network","year":2010,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":2,"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":"Centre for Interdisciplinary Research in Rehabilitation","keywords":"Notice; Coal; Component (thermodynamics); Computer science; Artificial neural network; Interface (matter); Artificial intelligence; Speech recognition; Engineering; Law; Operating system; Waste management; Political science","score_opus":0.01741074249517151,"score_gpt":0.26633198277407966,"score_spread":0.24892124027890813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1713311234","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.20137593,0.0000031123468,0.79511154,0.0010267666,0.00022228333,0.00011480615,0.0000014671127,0.00014958718,0.0019944916],"genre_scores_gemma":[0.95393497,0.0000019742074,0.04524473,0.000698869,0.000042312317,0.0000055292853,0.00000777153,0.000004159954,0.000059674116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989644,0.0001124249,0.0002460698,0.0002741523,0.00028334584,0.000119588876],"domain_scores_gemma":[0.9991334,0.00017409216,0.00015515521,0.00035058396,0.000121706355,0.00006502558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047933203,0.000100070625,0.00016432161,0.00019727777,0.00006501767,0.00010086258,0.00023270794,0.00011189704,0.0000889358],"category_scores_gemma":[0.000024067367,0.00009133048,0.00006553712,0.00048815875,0.000020507941,0.00028738103,0.000076946104,0.00035351832,0.000009690108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010461092,0.003097019,0.069382556,0.00017641709,0.0011415737,0.00004122976,0.0033659933,0.68194765,0.056288794,0.03804023,0.013336254,0.1321362],"study_design_scores_gemma":[0.00019570548,0.00016820796,0.027836598,0.000008986618,0.000045378718,0.000004332063,0.000013050066,0.9392497,0.031705156,0.00036981827,0.00027926083,0.00012384228],"about_ca_topic_score_codex":0.00007572202,"about_ca_topic_score_gemma":0.00023375056,"teacher_disagreement_score":0.75255907,"about_ca_system_score_codex":0.000013018154,"about_ca_system_score_gemma":0.00001781042,"threshold_uncertainty_score":0.3724349},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"not_applicable","genre":"editorial","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"not_applicable","genre":"editorial","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W1726294545","doi":"","title":"Network tomography by Non Negative Matrix Factorization (NNMF)","year":2010,"lang":"en","type":"article","venue":"International Symposium on Performance Evaluation of Computer and Telecommunication Systems","topic":"Blind Source Separation 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":"Dalhousie University","funders":"","keywords":"Network tomography; Computer science; Matrix decomposition; Algorithm; Tomography; Routing (electronic design automation); Matrix (chemical analysis); Mathematical optimization; Inference; Mathematics; Artificial intelligence","score_opus":0.01650515778627281,"score_gpt":0.29408445429848984,"score_spread":0.277579296512217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1726294545","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.39288837,0.000096750286,0.5952775,0.0018994801,0.0020671405,0.000978448,0.00001389868,0.00022590604,0.0065525],"genre_scores_gemma":[0.98453593,0.00013087435,0.014628453,0.00021384342,0.00018858067,0.00012749132,0.00010160693,0.00001350693,0.000059739625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975665,0.0003233143,0.0006223456,0.00033487842,0.0009919391,0.00016098151],"domain_scores_gemma":[0.9972554,0.0002309742,0.0005523168,0.0007356991,0.0011585589,0.00006705229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021839107,0.00019218895,0.00021438856,0.00021591206,0.0001786379,0.00029189163,0.001075853,0.00013206864,0.000014798348],"category_scores_gemma":[0.00002579752,0.00018722743,0.00005634672,0.00037945286,0.00006726233,0.0010280743,0.00020046238,0.00030284395,0.000012558337],"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.0002404726,0.0015063711,0.040809173,0.00015953786,0.0006289548,5.3635125e-7,0.010216219,0.23658215,0.051856913,0.38633707,0.024051022,0.2476116],"study_design_scores_gemma":[0.00070273195,0.00021900555,0.017081248,0.00007627547,0.000013699562,0.000008949483,0.000013709971,0.96733177,0.007518254,0.0006936571,0.0061170217,0.0002236961],"about_ca_topic_score_codex":0.000038028247,"about_ca_topic_score_gemma":0.0000056260164,"teacher_disagreement_score":0.7307496,"about_ca_system_score_codex":0.00005922685,"about_ca_system_score_gemma":0.00007220346,"threshold_uncertainty_score":0.76349133},"labels":[],"label_agreement":null},{"id":"W1727967908","doi":"","title":"La poursuite auditive du mouvement acoustique vers l'acquisition des catégories phonétiques","year":2009,"lang":"fr","type":"article","venue":"Archipelago (Université du Québec à Montréal)","topic":"Blind Source Separation Techniques","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":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Humanities; Art; Philosophy","score_opus":0.007745006105974652,"score_gpt":0.19966654536915657,"score_spread":0.19192153926318192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1727967908","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.45062783,0.004834758,0.489498,0.047731962,0.0002758763,0.0004883757,0.000045472996,0.0007465516,0.005751189],"genre_scores_gemma":[0.9705134,0.0034487094,0.020607693,0.0029723437,0.00022659395,0.000012922962,0.00003119572,0.000040023988,0.0021471393],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964244,0.00095106894,0.00042332476,0.00084857794,0.00058941875,0.00076325086],"domain_scores_gemma":[0.9974414,0.00055021426,0.0003704584,0.0007348283,0.0004906701,0.00041241833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084878196,0.0005742513,0.00048341797,0.0004640524,0.0009793463,0.00041047155,0.0011400387,0.00034024654,0.00022125957],"category_scores_gemma":[0.000113147355,0.00068578584,0.0003207267,0.00074172585,0.00083205313,0.00253179,0.0004521193,0.00067398837,0.00012257193],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022168408,0.0007011245,0.00084277964,0.000056440254,0.00018875861,0.00091233605,0.5126898,0.001123374,0.0017731969,0.18856722,0.017923238,0.275],"study_design_scores_gemma":[0.006763877,0.0064316024,0.25435227,0.0017970708,0.0008952724,0.001588065,0.12123903,0.080860496,0.018719243,0.20338,0.29883635,0.0051367134],"about_ca_topic_score_codex":0.12225012,"about_ca_topic_score_gemma":0.117915295,"teacher_disagreement_score":0.51988554,"about_ca_system_score_codex":0.0013739663,"about_ca_system_score_gemma":0.0011008597,"threshold_uncertainty_score":0.99955934},"labels":[],"label_agreement":null},{"id":"W173210115","doi":"10.1007/978-3-642-38847-7_20","title":"Robust Hierarchical and Sparse Representation of Natural Sounds in High-Dimensional Space","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Robustness (evolution); Artificial intelligence; Curse of dimensionality; Speech recognition; Pattern recognition (psychology); Sparse approximation; Feature vector; Neural coding; Noise (video); Signal processing; Digital signal processing","score_opus":0.022867881647469546,"score_gpt":0.2572222860201066,"score_spread":0.23435440437263705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173210115","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.007457211,0.00021148706,0.98887765,0.0017653079,0.00048146734,0.00038487974,0.0000018830638,0.00009597868,0.00072412455],"genre_scores_gemma":[0.49814922,0.000019222796,0.50098914,0.00052556,0.00007371099,0.0000068681406,0.000005122684,0.00001327376,0.00021787982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971303,0.00008142478,0.00051384163,0.0010921961,0.00083610136,0.00034616608],"domain_scores_gemma":[0.99807614,0.00053775543,0.00028148753,0.0007896301,0.00021437532,0.00010063919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006898507,0.0003235082,0.0004753323,0.0009947538,0.00008140824,0.00026765154,0.0011949518,0.00026644065,0.000015147107],"category_scores_gemma":[0.000111807334,0.0002949863,0.00006319597,0.0006152513,0.00074786035,0.0007620638,0.0010338882,0.0008616725,0.00000782762],"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.000030874526,0.00010927383,0.0007523124,0.0000740024,0.0000192635,0.00008807711,0.003199656,0.11238557,0.0018094478,0.43042746,0.00018624526,0.4509178],"study_design_scores_gemma":[0.00033691575,0.0001440488,0.0028577605,0.0002662738,0.0000033917781,0.0000589575,2.2454807e-7,0.69180226,0.003734201,0.30029202,0.00007882952,0.00042512256],"about_ca_topic_score_codex":0.00015140274,"about_ca_topic_score_gemma":0.00014345213,"teacher_disagreement_score":0.5794167,"about_ca_system_score_codex":0.00012058173,"about_ca_system_score_gemma":0.00028356156,"threshold_uncertainty_score":0.99995023},"labels":[],"label_agreement":null},{"id":"W174479178","doi":"10.1007/978-1-4614-2413-0_21","title":"Blind Source Separation of Convolutive Mixtures towards Modal Identification","year":2012,"lang":"en","type":"book-chapter","venue":"Conference proceedings of the Society for Experimental Mechanics","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Blind signal separation; Modal; Algorithm; Computer science; Time domain; Synchronization (alternating current); Fourier transform; Signal processing; Identification (biology); Frequency domain; SIGNAL (programming language); Domain (mathematical analysis); Mathematics; Telecommunications; Channel (broadcasting); Computer vision; Mathematical analysis","score_opus":0.03744314650763234,"score_gpt":0.29566480830003267,"score_spread":0.2582216617924003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W174479178","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.0035328213,0.0025754434,0.96989304,0.00081962516,0.0008922076,0.0040419013,0.00014462459,0.00035875436,0.017741581],"genre_scores_gemma":[0.9571278,0.00013882309,0.025637738,0.00015034927,0.00010058522,0.00017223058,0.00002567794,0.000056422137,0.016590348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980137,0.000007143568,0.0006585667,0.00047324548,0.0006065052,0.00024087347],"domain_scores_gemma":[0.99700075,0.000036872218,0.0014916073,0.0003422845,0.0010585926,0.00006986007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005720136,0.00036074678,0.0004556144,0.00007083329,0.0001654015,0.00012548646,0.0014645461,0.0005086618,0.000018239154],"category_scores_gemma":[0.00003547042,0.00031803438,0.0009574044,0.00009324475,0.00015899912,0.00064394873,0.00057838904,0.00029951183,0.0000027862434],"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.000023836415,0.000058474176,4.9249957e-7,0.00009913894,0.000121759746,5.0016085e-9,0.009326538,0.0000018929211,0.19378592,0.7942412,0.0012020654,0.0011386845],"study_design_scores_gemma":[0.00037317918,0.00019201377,0.0000013638881,0.0001699347,0.000090744485,0.0000029609184,0.0008252145,0.016854782,0.8755547,0.103151664,0.002460578,0.00032290688],"about_ca_topic_score_codex":0.0000059027593,"about_ca_topic_score_gemma":3.2235602e-7,"teacher_disagreement_score":0.953595,"about_ca_system_score_codex":0.00015864435,"about_ca_system_score_gemma":0.00019500479,"threshold_uncertainty_score":0.99992716},"labels":[],"label_agreement":null},{"id":"W1751016358","doi":"10.1109/ccece.2001.933646","title":"Spatio-temporal equalization and multiuser detection for DS-CDMA systems: a semi-blind approach","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Toronto","funders":"","keywords":"Blind equalization; Code division multiple access; Multiuser detection; Subspace topology; Computer science; Cyclostationary process; Algorithm; Estimator; Equalization (audio); Asynchronous communication; Spread spectrum; Interference (communication); Constant (computer programming); Channel (broadcasting); Mathematics; Telecommunications; Artificial intelligence; Statistics; Decoding methods","score_opus":0.05274519859011905,"score_gpt":0.27077509940670397,"score_spread":0.2180299008165849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1751016358","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.009719534,0.00009053665,0.9862952,0.00016361737,0.00010168886,0.00080773706,0.0000017351199,0.0005785608,0.0022413926],"genre_scores_gemma":[0.9002885,0.000010487436,0.09806872,0.00018446038,0.000051978677,0.00018488064,0.0000121749645,0.000011815167,0.0011869809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989652,0.00009388415,0.0002609495,0.00034489133,0.00018118578,0.00015388845],"domain_scores_gemma":[0.9993352,0.0000659844,0.00011855501,0.00028163515,0.00013916274,0.00005941269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041129792,0.00012007912,0.00013169293,0.00016368418,0.00013256236,0.00033813107,0.00019275163,0.000114446506,0.000006325342],"category_scores_gemma":[0.000045690893,0.0001087585,0.000033212644,0.0002767137,0.000020914555,0.0007385577,0.000058503305,0.00006329094,0.000007657075],"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.0001696862,0.0013061294,0.0045590987,0.0009565739,0.00017274109,0.000004136651,0.030343696,0.009036571,0.006640226,0.76293993,0.024708107,0.15916307],"study_design_scores_gemma":[0.0005598256,0.00009622237,0.00006136715,0.000008494313,0.00000420246,0.000010088754,0.00007893219,0.9858183,0.0042959326,0.00044094474,0.008469943,0.0001557462],"about_ca_topic_score_codex":0.000072411916,"about_ca_topic_score_gemma":0.000036751288,"teacher_disagreement_score":0.9767817,"about_ca_system_score_codex":0.000032508786,"about_ca_system_score_gemma":0.000009261202,"threshold_uncertainty_score":0.44350427},"labels":[],"label_agreement":null},{"id":"W1751717030","doi":"10.1109/iscas.2006.1693945","title":"Parametric Estimation of Nonlinear Systems Through Sequences Designed Using DNA Computation","year":2006,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computation; Chaotic; Parametric statistics; Nonlinear system; Sequence (biology); Computer science; Algorithm; Estimation theory; Control theory (sociology); Mathematical optimization; Mathematics; Artificial intelligence; Statistics","score_opus":0.042274274630615276,"score_gpt":0.31194103572616494,"score_spread":0.26966676109554966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1751717030","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.1470871,0.000053074804,0.8508345,0.000060000737,0.00007349555,0.00021665137,8.570945e-7,0.00028701732,0.0013872888],"genre_scores_gemma":[0.5296434,9.761781e-7,0.4702928,0.000023096192,0.000011431718,0.000003080307,0.0000044733138,0.0000029665675,0.000017771486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988741,0.00012834658,0.00038182395,0.00020174503,0.00029820748,0.000115759154],"domain_scores_gemma":[0.99923486,0.0001453857,0.00024707508,0.00019182917,0.00016419026,0.0000166771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036546198,0.000092787865,0.00015433489,0.00019441266,0.000064453736,0.00015381935,0.00024989387,0.00006357781,0.0000017061683],"category_scores_gemma":[0.000029627296,0.00008373106,0.00003548792,0.0009772955,0.00003861957,0.00088801153,0.00003796344,0.000044583372,0.000005710711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017953754,0.00006602223,0.00012192857,0.000029230338,0.0000058363125,0.0000012694737,0.0002153974,0.85258013,0.004957278,0.14007032,0.00014628386,0.0018044956],"study_design_scores_gemma":[0.00008921203,0.000049735783,0.00015029026,0.000019748048,0.0000039784136,0.000008724677,0.00002003405,0.9420732,0.048770834,0.008702047,0.000021407941,0.00009078944],"about_ca_topic_score_codex":0.0010970735,"about_ca_topic_score_gemma":0.0000048803104,"teacher_disagreement_score":0.38255632,"about_ca_system_score_codex":0.00004666783,"about_ca_system_score_gemma":0.00007641389,"threshold_uncertainty_score":0.34144533},"labels":[],"label_agreement":null},{"id":"W1772679128","doi":"10.24908/pceea.v0i0.4047","title":"HUMAN AUDIO/VESTIBULAR SYSTEM: DATA INPUT CHANNELS FOR ROBOTIC FORCE AND MOMENT SENSOR MEASUREMENTS","year":2011,"lang":"en","type":"article","venue":"Proceedings of the Canadian Engineering Education Association (CEEA)","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Vestibular system; Interface (matter); Artificial intelligence; Human–computer interaction; Computer vision; Simulation","score_opus":0.05315802967120646,"score_gpt":0.24929494565718582,"score_spread":0.19613691598597938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1772679128","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.39959997,0.0008814672,0.5026325,0.03898003,0.0122238705,0.015803425,0.00020295157,0.003398848,0.026276946],"genre_scores_gemma":[0.97030514,0.0000014258933,0.02820038,0.00017323082,0.00007676463,0.000099662066,0.000009449963,0.000020157562,0.0011137776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989112,0.000010115714,0.00026852597,0.00028215576,0.00028982456,0.00023818375],"domain_scores_gemma":[0.99863124,0.000018549948,0.00034744656,0.00027095946,0.00057225744,0.00015956818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010268565,0.00012830972,0.00015372148,0.00023925968,0.00022366038,0.00017263518,0.0008077395,0.000100298035,0.0000013356984],"category_scores_gemma":[0.00037634096,0.00012967121,0.000028524959,0.00028031121,0.0000121268995,0.0005572789,0.00010465803,0.00010033659,0.0000012079413],"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.000006861232,0.0003887067,0.07021446,0.00326271,0.00077363255,2.9754415e-7,0.025888454,0.003792023,0.026012948,0.7910578,0.07660374,0.0019983274],"study_design_scores_gemma":[0.002471651,0.00058580743,0.18790942,0.0027558932,0.0006681137,0.00005528968,0.0022103358,0.66512144,0.092628635,0.013266285,0.028958634,0.0033684906],"about_ca_topic_score_codex":0.0017241782,"about_ca_topic_score_gemma":0.0006071173,"teacher_disagreement_score":0.77779156,"about_ca_system_score_codex":0.000992506,"about_ca_system_score_gemma":0.00026697764,"threshold_uncertainty_score":0.52878386},"labels":[],"label_agreement":null},{"id":"W1800978511","doi":"10.1109/iscas.2003.1205843","title":"Local discriminant basis algorithm-a review of theory and applications in signal processing","year":2003,"lang":"en","type":"article","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Basis (linear algebra); Computer science; Principal component analysis; Signal processing; Discriminant; Multidimensional signal processing; Waveform; Linear discriminant analysis; Pattern recognition (psychology); SIGNAL (programming language); Algorithm; Artificial intelligence; Time–frequency analysis; Speech recognition; Mathematics; Digital signal processing; Computer vision; Radar","score_opus":0.014664708392607797,"score_gpt":0.28768487595035036,"score_spread":0.27302016755774255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1800978511","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.000034216868,0.0045333025,0.9896971,0.0001701358,0.0000022173842,0.00021019008,3.745535e-7,0.000048438695,0.005303998],"genre_scores_gemma":[0.38846374,0.0023731124,0.60698277,0.0017889271,0.0000055667397,0.0001633436,0.000002069418,0.000008574009,0.00021192468],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993349,0.00014186472,0.00018979923,0.00015789259,0.000099337754,0.000076207325],"domain_scores_gemma":[0.9996385,0.00006921046,0.00005537403,0.00016023303,0.000049656355,0.000027035863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089180213,0.000056536825,0.00011233733,0.000059017584,0.000027878226,0.000020754895,0.00016217763,0.00002282092,0.000014379374],"category_scores_gemma":[0.000015688296,0.000042827425,0.000016996746,0.00030334143,0.00005517326,0.00019843227,0.000038901264,0.0000530988,9.690876e-7],"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":[2.2219331e-7,0.000037503538,0.000034633387,0.00023296563,7.6105755e-7,2.2644517e-7,0.00018162685,9.2626533e-7,0.000031224896,0.49446115,0.000040074206,0.5049787],"study_design_scores_gemma":[0.0008965496,0.0003729638,0.0035657124,0.008124557,0.00006318747,0.00009332326,0.0019611493,0.08663767,0.2104056,0.6270087,0.059527777,0.0013428599],"about_ca_topic_score_codex":0.00000596437,"about_ca_topic_score_gemma":0.0000027564186,"teacher_disagreement_score":0.5036358,"about_ca_system_score_codex":0.000009929326,"about_ca_system_score_gemma":0.000058274538,"threshold_uncertainty_score":0.17464517},"labels":[],"label_agreement":null},{"id":"W1828761215","doi":"10.1007/978-3-540-30110-3_154","title":"Source Separation on Astrophysical Data Sets from the WMAP Satellite","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"CMB cold spot; Cosmic microwave background; Satellite; Physics; Separation (statistics); Blind signal separation; Astrophysics; COSMIC cancer database; Cosmic background radiation; Computer science; Astronomy; Telecommunications","score_opus":0.03245364716193739,"score_gpt":0.2932755807177369,"score_spread":0.2608219335557995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1828761215","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.00010981713,0.00019415017,0.9928715,0.0034848803,0.000664954,0.00047298055,0.000029025012,0.0003124251,0.0018602305],"genre_scores_gemma":[0.17773081,0.00009418711,0.80695117,0.01345085,0.0011259471,0.000015533657,0.00018230377,0.000070597416,0.0003785967],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99558985,0.00010559707,0.0004912693,0.0019799212,0.001349438,0.00048391375],"domain_scores_gemma":[0.9943651,0.0008932176,0.00032891147,0.0041339793,0.0001520683,0.00012670137],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00092285324,0.0005321095,0.00041715908,0.00028369416,0.00033420647,0.0011497529,0.0077225,0.00031163433,0.000019374782],"category_scores_gemma":[0.00008778279,0.00039718117,0.00010206074,0.00047872806,0.0006192939,0.0009568276,0.0025121998,0.0012221009,0.00021385106],"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.000011675747,0.000055257893,0.0000160377,0.000006142842,0.000016476979,0.000021279819,0.0016302688,0.041238423,0.00017090782,0.112867005,0.00014691343,0.8438196],"study_design_scores_gemma":[0.0003293673,0.00033089906,0.0004756923,0.00048394536,0.000014795727,0.000018982808,2.926923e-7,0.48290518,0.002834546,0.49195606,0.019767985,0.000882238],"about_ca_topic_score_codex":0.00007374528,"about_ca_topic_score_gemma":0.00009942324,"teacher_disagreement_score":0.84293735,"about_ca_system_score_codex":0.00026939117,"about_ca_system_score_gemma":0.0006593669,"threshold_uncertainty_score":0.99988717},"labels":[],"label_agreement":null},{"id":"W1833641759","doi":"10.1109/ssap.1992.246838","title":"Joint time delay and Doppler stretch estimation using wideband signals","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McMaster University","funders":"","keywords":"Cramér–Rao bound; Joint (building); Wavelet; SIGNAL (programming language); Wavelet transform; Wideband; Signal-to-noise ratio (imaging); Estimation theory; Algorithm; Upper and lower bounds; Computer science; Noise (video); Mathematics; Signal processing; Speech recognition; Pattern recognition (psychology); Statistics; Artificial intelligence; Telecommunications; Electronic engineering; Engineering; Mathematical analysis; Radar","score_opus":0.029530585334559805,"score_gpt":0.2703823858725367,"score_spread":0.24085180053797692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1833641759","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.10977989,0.000029101311,0.8848735,0.00026067012,0.000016857733,0.00011127988,2.7265128e-7,0.00020354513,0.0047248895],"genre_scores_gemma":[0.5923203,0.0000018919076,0.4070701,0.00037061694,0.0000034618986,0.0000024911394,6.1196516e-7,0.0000037607977,0.00022676114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931484,0.00008246859,0.00015852832,0.00019497902,0.00013651956,0.00011265819],"domain_scores_gemma":[0.99959844,0.000042380292,0.000053443193,0.00019990152,0.000053981355,0.00005184979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003828917,0.00007974136,0.00009256734,0.000077715384,0.000068213216,0.00019687938,0.00009859089,0.00004603845,0.00016781772],"category_scores_gemma":[0.00003865882,0.00006925285,0.000018044024,0.00015087372,0.000020528983,0.0005329814,0.000041391482,0.00005312642,0.000025994214],"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.000007461838,0.00022826342,0.0011760992,0.000038799306,0.00006844612,0.000024736652,0.0051942198,0.015053029,0.17520611,0.72341365,0.01696671,0.06262245],"study_design_scores_gemma":[0.00012438156,0.00003658669,0.000107501895,0.0000107914575,0.0000034249913,0.00006028534,0.000007528676,0.8606624,0.12070178,0.017617773,0.00052853685,0.00013898857],"about_ca_topic_score_codex":0.000022877417,"about_ca_topic_score_gemma":0.0000020856735,"teacher_disagreement_score":0.84560937,"about_ca_system_score_codex":0.000017903645,"about_ca_system_score_gemma":0.000040940715,"threshold_uncertainty_score":0.28240493},"labels":[],"label_agreement":null},{"id":"W1838306040","doi":"10.1017/s1743921314013532","title":"Bayesian CMB foreground separation with a correlated log-normal model","year":2014,"lang":"en","type":"preprint","venue":"Proceedings of the International Astronomical Union","topic":"Blind Source Separation 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":"Canadian Institute for Theoretical Astrophysics; University of Toronto","funders":"","keywords":"Cosmic microwave background; Prior probability; Gaussian; Bayesian probability; Spectral density; Physics; Pattern recognition (psychology); Component (thermodynamics); Gaussian network model; Artificial intelligence; Statistical physics; Computer science; Mathematics; Statistics; Optics","score_opus":0.010652763373899862,"score_gpt":0.24211198109572013,"score_spread":0.23145921772182027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1838306040","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.25842065,0.0000036445954,0.73330134,0.003144194,0.00025578536,0.00035079912,0.000008554742,0.00015114473,0.0043638553],"genre_scores_gemma":[0.905113,0.0000017263404,0.09402315,0.00015673938,0.00009827963,0.000054108554,0.0000275815,0.000019842175,0.00050560967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982447,0.000021489983,0.00049140846,0.000520261,0.0005262581,0.00019587284],"domain_scores_gemma":[0.998299,0.000037923397,0.0007895045,0.00027231316,0.0005327845,0.00006849216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054811157,0.00027064883,0.00027006076,0.00018742826,0.000072376184,0.0003623819,0.002489532,0.00023398404,0.000006521967],"category_scores_gemma":[0.00004340215,0.00020389572,0.0001608293,0.00011435417,0.00010654394,0.0006408286,0.0016270367,0.00066320057,0.0000042633555],"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.0002528488,0.00031175045,0.008659659,0.0000846066,0.00029181014,1.8427964e-7,0.0009908569,0.39605147,0.0038603155,0.58057386,0.005075695,0.0038469285],"study_design_scores_gemma":[0.0002939974,0.00008136747,0.0016314713,0.00017746065,0.000018878585,0.000006486049,0.000011231461,0.9634044,0.009594625,0.024212081,0.00035754038,0.00021042845],"about_ca_topic_score_codex":0.000033520413,"about_ca_topic_score_gemma":0.0000066243665,"teacher_disagreement_score":0.6466923,"about_ca_system_score_codex":0.00024573892,"about_ca_system_score_gemma":0.00017111654,"threshold_uncertainty_score":0.83146256},"labels":[],"label_agreement":null},{"id":"W1853514188","doi":"10.1109/pacrim.2001.953550","title":"Filter design targets with reduced jitter effect","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Raised-cosine filter; Jitter; Intersymbol interference; Narrowband; Pulse shaping; Computer science; Filter (signal processing); Baseband; Filter design; Nyquist–Shannon sampling theorem; Nyquist frequency; Nyquist ISI criterion; Root-raised-cosine filter; Electronic engineering; Sampling (signal processing); Bandwidth (computing); Algorithm; Telecommunications; Engineering; Physics; Optics","score_opus":0.025236057678162897,"score_gpt":0.232793380998871,"score_spread":0.20755732332070811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853514188","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.003389752,0.000020579493,0.9739497,0.0021371448,0.00003476259,0.00023662818,8.968101e-8,0.00066909345,0.019562302],"genre_scores_gemma":[0.6222872,0.0000019870176,0.37152272,0.002365676,0.000020536312,0.00003953307,3.5862573e-7,0.000008329473,0.0037536232],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991543,0.00015115936,0.000095931995,0.00025204945,0.00017648128,0.00017006393],"domain_scores_gemma":[0.99936235,0.00009473276,0.000032488024,0.00042184693,0.00003489669,0.000053659012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025438904,0.0001077087,0.00010045569,0.00007174125,0.000050934406,0.00014123876,0.00039042233,0.000042769174,0.00030849973],"category_scores_gemma":[0.000011586673,0.00007077186,0.000027357511,0.00019188269,0.000020432715,0.00041204737,0.000057482288,0.000088785244,0.0003126272],"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.00005897844,0.0003452742,0.00067017705,0.000030448507,0.00010309267,0.00012919327,0.008848173,0.0005261628,0.03410857,0.040054,0.80296326,0.112162694],"study_design_scores_gemma":[0.00064792327,0.0013577458,0.0006500103,0.000023098799,0.000007006845,0.000063439395,0.0000033194465,0.12753762,0.8506044,0.001515212,0.017108142,0.00048203475],"about_ca_topic_score_codex":0.0000035538765,"about_ca_topic_score_gemma":6.833018e-7,"teacher_disagreement_score":0.8164959,"about_ca_system_score_codex":0.000013166251,"about_ca_system_score_gemma":0.000006955697,"threshold_uncertainty_score":0.40182945},"labels":[],"label_agreement":null},{"id":"W1867503201","doi":"10.1109/icassp.1980.1170991","title":"A Wiener filter approach to coherence estimation","year":2005,"lang":"en","type":"article","venue":"","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":"Royal Military College of Canada","funders":"","keywords":"Wiener filter; Coherence (philosophical gambling strategy); Algorithm; Filter (signal processing); Transfer function; Channel (broadcasting); Computer science; Mathematics; Applied mathematics; Statistics; Computer vision; Telecommunications; Engineering","score_opus":0.02578359659903112,"score_gpt":0.27489099050647353,"score_spread":0.2491073939074424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1867503201","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.0014281896,0.0000031543022,0.87975097,0.0025467253,0.000015850863,0.00014617079,1.761892e-7,0.0004676968,0.11564108],"genre_scores_gemma":[0.3825054,1.6611945e-7,0.6122715,0.0034064394,0.000014617161,0.00003310323,9.2637123e-7,0.0000022792863,0.0017656016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993747,0.000027669837,0.000113085,0.00021362212,0.00015786002,0.00011309785],"domain_scores_gemma":[0.99951404,0.000016400754,0.000023213111,0.0003415213,0.000044612716,0.00006020226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018734913,0.00006368091,0.00005744367,0.00007487054,0.00003576523,0.00014509619,0.00042200708,0.00003138644,0.00002945584],"category_scores_gemma":[0.000017128776,0.000053401054,0.00001830202,0.0002456192,0.000008752682,0.000623796,0.00010501891,0.000049076374,0.0002979647],"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.0000020244117,0.0001451067,0.000038325976,0.0000036686713,0.0000039025067,2.8884796e-7,0.0027703538,0.01311465,0.0011238641,0.70920575,0.04715897,0.22643307],"study_design_scores_gemma":[0.00008444707,0.000040414252,0.00049009616,0.000004258025,8.8201375e-7,0.000006605548,0.00000805057,0.9440004,0.024888713,0.0030946843,0.027223317,0.00015812796],"about_ca_topic_score_codex":0.000009794752,"about_ca_topic_score_gemma":0.0000041990093,"teacher_disagreement_score":0.93088573,"about_ca_system_score_codex":0.000021006388,"about_ca_system_score_gemma":0.000021595,"threshold_uncertainty_score":0.3829833},"labels":[],"label_agreement":null},{"id":"W1868086354","doi":"10.1109/iscas.2001.921097","title":"A fully digital timing recovery scheme using two samples per symbol","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Symbol rate; Symbol (formal); Computer science; Interpolation (computer graphics); Transmission (telecommunications); Algorithm; Sampling (signal processing); SIGNAL (programming language); Filter (signal processing); Feature (linguistics); Artificial intelligence; Computer vision; Bit error rate; Telecommunications; Decoding methods","score_opus":0.08454395401645341,"score_gpt":0.2894709406655546,"score_spread":0.2049269866491012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1868086354","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.07313341,0.000041350107,0.89943457,0.000495041,0.00006207383,0.00009855346,0.0000014939502,0.0006448987,0.02608862],"genre_scores_gemma":[0.53619725,0.0000040231207,0.4616573,0.00074747053,0.000044760793,0.000004144971,0.0000011628659,0.000009273185,0.0013346566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990646,0.000027329941,0.00019017671,0.0002921007,0.00021217547,0.00021358705],"domain_scores_gemma":[0.99935466,0.00007035479,0.000057188117,0.00039025515,0.000064135194,0.00006338166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013894521,0.00011555852,0.00011460168,0.00012110595,0.00010230435,0.00069977547,0.00042530097,0.00004486329,0.00023415258],"category_scores_gemma":[0.000044077027,0.00010741552,0.00006738665,0.00021285284,0.000026090658,0.0017331641,0.00020294593,0.00010028643,0.00018446524],"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.000018956796,0.0008310772,0.007285017,0.00006048407,0.00017277706,0.000068418296,0.012527444,0.0014042769,0.06736539,0.44308737,0.03162334,0.43555546],"study_design_scores_gemma":[0.0003716032,0.00011974697,0.00019545805,0.000045697903,0.000005611988,0.00011759767,0.00014228396,0.9623987,0.010691934,0.00808285,0.017194575,0.0006339062],"about_ca_topic_score_codex":0.000023214678,"about_ca_topic_score_gemma":0.0000034257284,"teacher_disagreement_score":0.9609945,"about_ca_system_score_codex":0.000041491923,"about_ca_system_score_gemma":0.00002242259,"threshold_uncertainty_score":0.6747951},"labels":[],"label_agreement":null},{"id":"W1877892487","doi":"10.48550/arxiv.1212.2513","title":"Efficient Parametric Projection Pursuit Density Estimation","year":2012,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Blind Source Separation 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":"University of Toronto","funders":"","keywords":"Projection pursuit; Curse of dimensionality; Projection (relational algebra); Artificial intelligence; Density estimation; Dimensionality reduction; Computer science; Parametric statistics; Probabilistic logic; Random projection; Machine learning; Feature (linguistics); Product (mathematics); Field (mathematics); Basis pursuit; Pattern recognition (psychology); Mathematics; Algorithm; Matching pursuit; Statistics","score_opus":0.06219895259463146,"score_gpt":0.20136889507714656,"score_spread":0.1391699424825151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1877892487","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.40574628,0.0000069765338,0.5922985,0.000046949073,0.00010533611,0.00012493524,2.374042e-7,0.00032208857,0.0013486714],"genre_scores_gemma":[0.98567,0.0000039426304,0.013881414,0.000094105955,0.000022711163,8.00556e-7,0.0000017968441,0.000005334763,0.000319931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991485,0.000118889155,0.00009932114,0.0002926845,0.00009938269,0.00024120863],"domain_scores_gemma":[0.99922884,0.000068636335,0.00010051297,0.00040414842,0.0000919714,0.000105907166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004986579,0.000103764585,0.00009390534,0.00032549255,0.00016348406,0.000074649426,0.00040510102,0.00007833075,0.000008115806],"category_scores_gemma":[0.00006524384,0.00011475917,0.000056769666,0.0015187962,0.000035184406,0.00058439845,0.00016076224,0.00012476546,0.00015547915],"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.000011453639,0.00026567624,0.00823352,0.000008873517,0.000013948952,0.0000081616945,0.0004996892,0.10894261,0.00017231794,0.87680084,0.00031726528,0.004725643],"study_design_scores_gemma":[0.00016084264,0.00004445238,0.013823254,0.000005158025,0.000011606491,0.000008990488,0.00003255577,0.9793768,0.0025222045,0.0035757904,0.00027932477,0.00015902719],"about_ca_topic_score_codex":0.00004248275,"about_ca_topic_score_gemma":0.0000034616883,"teacher_disagreement_score":0.87322503,"about_ca_system_score_codex":0.00014745742,"about_ca_system_score_gemma":0.00003894876,"threshold_uncertainty_score":0.4679743},"labels":[],"label_agreement":null},{"id":"W1889062984","doi":"10.1109/icassp.1989.266489","title":"Parameter sensitivity and robust estimation in an ARX model with glottal excitation","year":2003,"lang":"en","type":"article","venue":"International Conference on Acoustics, Speech, and Signal Processing","topic":"Blind Source Separation 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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Robustness (evolution); Sensitivity (control systems); Estimation theory; Computation; Computer science; Algorithm; Perturbation (astronomy); Model parameter; Mathematics; Engineering; Physics; Electronic engineering","score_opus":0.04891784287080202,"score_gpt":0.29853608158697914,"score_spread":0.2496182387161771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1889062984","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.22330114,0.000007082721,0.7750724,0.00028552694,0.000020034911,0.00009977383,0.0000027291694,0.00006991403,0.0011413848],"genre_scores_gemma":[0.72791135,0.000007729841,0.2717746,0.0002513579,0.000008822394,0.0000063083057,0.0000067166184,0.000006481919,0.000026643447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988698,0.00009369076,0.00020321326,0.00037537844,0.00031811115,0.00013983382],"domain_scores_gemma":[0.99932194,0.000085558764,0.000119258446,0.00010035997,0.0003033269,0.00006953496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044156998,0.00014949992,0.00012929647,0.00019090775,0.00008944662,0.00058983866,0.00012244555,0.00007385349,0.0000045688116],"category_scores_gemma":[0.00007897114,0.00013722637,0.000010544563,0.00010352759,0.00008650829,0.0012538474,0.00002884732,0.00019194528,0.0000010204831],"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.00015065068,0.00039924413,0.0023356776,0.00008340056,0.000022887314,0.00008404726,0.0048595527,0.28995237,0.026836293,0.47417158,0.000022354718,0.20108196],"study_design_scores_gemma":[0.00027268328,0.00012337456,0.0014794699,0.000101180674,0.000004208579,0.00003936612,0.00013928868,0.9613765,0.0014030444,0.034887757,0.0000015639297,0.00017155269],"about_ca_topic_score_codex":0.000015484893,"about_ca_topic_score_gemma":0.00004610358,"teacher_disagreement_score":0.67142415,"about_ca_system_score_codex":0.00004283203,"about_ca_system_score_gemma":0.00013316971,"threshold_uncertainty_score":0.5687828},"labels":[],"label_agreement":null},{"id":"W1895635952","doi":"10.1109/pacrim.2001.953572","title":"Facial feature extraction from a video sequence using independent component analysis (ICA)","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Saskatchewan","funders":"","keywords":"Artificial intelligence; Computer science; Independent component analysis; Feature extraction; Computer vision; Pattern recognition (psychology); Feature (linguistics); Face (sociological concept); Subspace topology; Facial recognition system; YCbCr; Image processing; Color image; Image (mathematics)","score_opus":0.06752648069568305,"score_gpt":0.3098864234020929,"score_spread":0.24235994270640981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1895635952","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.114201084,0.000046307065,0.8821456,0.001236946,0.000093175855,0.00011724472,0.0000055871274,0.0004486247,0.0017054451],"genre_scores_gemma":[0.8308994,0.000011609433,0.168101,0.0005555735,0.000041947165,0.0000058956116,0.000008374691,0.0000049312084,0.00037126875],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854493,0.00013768584,0.00021372801,0.00044784936,0.00047263174,0.00018317749],"domain_scores_gemma":[0.99911934,0.000058020978,0.00013332463,0.0005201013,0.00008063336,0.00008860586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021164081,0.0001407485,0.00019661547,0.0002903961,0.00013738249,0.00032262097,0.00051083503,0.00013358913,0.00031443062],"category_scores_gemma":[0.000014746768,0.00013126206,0.00014033474,0.00090923026,0.000026043841,0.00082735776,0.0001347038,0.00024248332,0.000059630278],"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.00004295728,0.0015779736,0.025795419,0.000020306656,0.002167102,0.0003022491,0.019835636,0.033181466,0.67174613,0.06292637,0.017236264,0.16516815],"study_design_scores_gemma":[0.00014896918,0.000023742316,0.007876853,0.0000056409563,0.00007353967,0.000011444735,0.000035633504,0.9686149,0.018396448,0.0011714492,0.003414398,0.00022698601],"about_ca_topic_score_codex":0.00067169906,"about_ca_topic_score_gemma":0.00017214204,"teacher_disagreement_score":0.93543345,"about_ca_system_score_codex":0.00012044896,"about_ca_system_score_gemma":0.000018202783,"threshold_uncertainty_score":0.5352711},"labels":[],"label_agreement":null},{"id":"W1896053401","doi":"10.1109/ccece.2004.1345082","title":"Extraction of characteristics for the recognition of isolated words using the wavelet packet method","year":2004,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Pattern recognition (psychology); Computer science; Energy (signal processing); Wavelet packet decomposition; Feature extraction; Logarithm; Artificial intelligence; Discrete cosine transform; Wavelet; Wavelet transform; Hamming code; Discrete wavelet transform; SIGNAL (programming language); Speech recognition; Mathematics; Algorithm; Statistics; Image (mathematics); Decoding methods","score_opus":0.06653950889134562,"score_gpt":0.3557043629732941,"score_spread":0.2891648540819485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1896053401","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.019632226,0.000008152494,0.9786688,0.0010334523,0.000088131295,0.00031720792,0.0000069479324,0.00006105952,0.00018401588],"genre_scores_gemma":[0.5320116,0.000011875128,0.46772984,0.00018995906,0.000019657218,0.000010451454,0.0000033576791,0.000004064947,0.000019167597],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99933267,0.00008842507,0.00026404098,0.00010941356,0.0001241219,0.000081327205],"domain_scores_gemma":[0.9988499,0.00037117992,0.00026237153,0.00028323318,0.00022152408,0.000011753508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090800086,0.00006195688,0.0001020334,0.00004966647,0.00007893069,0.000037530168,0.00026455248,0.000052340296,0.000008492406],"category_scores_gemma":[0.000086957574,0.00003578652,0.00005833886,0.00024812418,0.000032888027,0.00023199817,0.000037879723,0.00008084712,6.963147e-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.00011956173,0.0003008902,0.000030081903,0.000069311405,0.000120571574,7.201501e-7,0.008575945,0.00061174243,0.25018185,0.13271843,0.00029342866,0.60697746],"study_design_scores_gemma":[0.00038127284,0.00022242477,0.000921398,0.00005269745,0.000044319648,0.000027903405,0.00029529855,0.3883065,0.55919886,0.04961184,0.0007936271,0.00014383662],"about_ca_topic_score_codex":0.00006242785,"about_ca_topic_score_gemma":0.0000067466203,"teacher_disagreement_score":0.60683364,"about_ca_system_score_codex":0.00002005285,"about_ca_system_score_gemma":0.000053699536,"threshold_uncertainty_score":0.1459332},"labels":[],"label_agreement":null},{"id":"W1898133356","doi":"10.1109/mwscas.1991.252136","title":"A two-step method for nonminimum phase ARMA identification","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Queen's University","funders":"","keywords":"Autoregressive–moving-average model; Autoregressive model; Realization (probability); Phase (matter); Moving average; Mathematics; Identification (biology); Invariant (physics); System identification; Computer science; Algorithm; Control theory (sociology); Applied mathematics; Artificial intelligence; Statistics; Data modeling; Control (management); Physics","score_opus":0.05192693741881986,"score_gpt":0.3820551843400903,"score_spread":0.3301282469212704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1898133356","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.0002668672,0.000023493725,0.9856152,0.0026076417,0.00010532643,0.00037513656,0.0000022080926,0.0005813136,0.0104228],"genre_scores_gemma":[0.10521059,0.00000442092,0.8888844,0.0013673953,0.00004172904,0.0001320343,0.0000034551363,0.000007495712,0.004348432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909216,0.000074814874,0.00024132698,0.0002952384,0.00014881737,0.00014765232],"domain_scores_gemma":[0.99914014,0.00013544389,0.0000925523,0.00047239312,0.000105404564,0.000054050637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062942127,0.00008330579,0.00009584412,0.00011314193,0.000081818274,0.00020722902,0.0004866108,0.000038885435,0.00008929683],"category_scores_gemma":[0.000046291763,0.00007802084,0.0000641283,0.00024484054,0.000011794484,0.00053587253,0.00005792611,0.000053967524,0.000119466415],"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.0000053157282,0.00033185445,0.000004076953,0.000009177497,0.0000128203,0.0000011476882,0.0012509257,0.00002341599,0.02072195,0.5605598,0.049167268,0.36791226],"study_design_scores_gemma":[0.00073164364,0.00008638608,0.000006392065,0.0000023703187,0.000004147263,0.0000067001456,0.000020328702,0.86423606,0.09565664,0.0060623316,0.03306994,0.00011704682],"about_ca_topic_score_codex":0.000009639835,"about_ca_topic_score_gemma":0.000005424937,"teacher_disagreement_score":0.86421263,"about_ca_system_score_codex":0.000017952652,"about_ca_system_score_gemma":0.000010129863,"threshold_uncertainty_score":0.31815976},"labels":[],"label_agreement":null},{"id":"W1898644624","doi":"10.1109/icassp.1988.196683","title":"Speech signal reconstruction based on higher order spectra","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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 Waterloo","funders":"","keywords":"Bispectrum; SIGNAL (programming language); Speech recognition; Computer science; Order (exchange); Signal processing; Speech production; Signal reconstruction; Process (computing); Artificial intelligence; Pattern recognition (psychology); Digital signal processing; Spectral density; Programming language; Telecommunications","score_opus":0.016566498736365936,"score_gpt":0.24684716076032678,"score_spread":0.23028066202396086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1898644624","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.0014451825,0.000001857887,0.721545,0.0010079544,0.00015625905,0.00008286682,1.4702489e-7,0.00042647135,0.27533427],"genre_scores_gemma":[0.3256485,8.600645e-7,0.6685235,0.0027678006,0.000027380604,0.000007043,5.355076e-7,0.000006582658,0.0030178153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99917954,0.0001027168,0.00012976685,0.0002539022,0.0001973455,0.00013671316],"domain_scores_gemma":[0.9994648,0.000047809237,0.000040230178,0.0003314381,0.0000689286,0.000046781908],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027122357,0.000089968074,0.00007502271,0.00011630122,0.000054701894,0.000114405375,0.00020686696,0.000060458045,0.0014946741],"category_scores_gemma":[0.000014572331,0.000078179015,0.00003313441,0.0003797245,0.00002260358,0.00025029416,0.000011398651,0.00011552513,0.00016553485],"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.000004043213,0.000084859195,0.00021070905,0.000002022051,0.000004336946,0.0000057000157,0.000040769046,0.00024845506,0.0017867206,0.95416826,0.0041780034,0.03926612],"study_design_scores_gemma":[0.0009415768,0.0005516602,0.00170702,0.000028653343,0.000005852406,0.000079874284,0.000019137153,0.14327829,0.67994565,0.09229644,0.08043372,0.00071216514],"about_ca_topic_score_codex":0.000007801164,"about_ca_topic_score_gemma":0.0000038102542,"teacher_disagreement_score":0.86187184,"about_ca_system_score_codex":0.000033600158,"about_ca_system_score_gemma":0.0000726306,"threshold_uncertainty_score":0.9994181},"labels":[],"label_agreement":null},{"id":"W1904234469","doi":"10.1109/icassp.1989.266885","title":"On detection of sinusoids from periodograms","year":2003,"lang":"en","type":"article","venue":"International Conference on Acoustics, Speech, and 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":"Royal Military College of Canada","funders":"","keywords":"Gaussian noise; Noise (video); Gaussian; Algorithm; Computer science; Mathematics; Periodogram; Pattern recognition (psychology); Speech recognition; Artificial intelligence; Statistics; Physics","score_opus":0.029202544532054134,"score_gpt":0.2821907487074067,"score_spread":0.25298820417535256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1904234469","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.103712335,0.000030558636,0.8859578,0.00021315822,0.00016361354,0.00008178798,0.0000075425883,0.00011006358,0.009723172],"genre_scores_gemma":[0.9733156,0.000023216735,0.026071753,0.00040148984,0.00004219287,0.00000542998,0.000004878134,0.000008588986,0.00012683716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987818,0.000065184664,0.0002641303,0.00033119082,0.00043107572,0.00012663788],"domain_scores_gemma":[0.9991453,0.00009927181,0.00017986711,0.00014510803,0.00037033937,0.000060104496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023461548,0.00014590277,0.00014875206,0.00016703478,0.00009735741,0.00033271292,0.00033835086,0.00009037863,0.00006868231],"category_scores_gemma":[0.00011275686,0.00013784747,0.00003730573,0.000114095514,0.00008619069,0.00032367156,0.00004013653,0.00021131024,0.000008160636],"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.000072155155,0.00024680898,0.0001471389,0.000023177112,0.000034089582,0.000015491667,0.0014059054,0.0003946142,0.28542864,0.25639454,0.00005647481,0.45578098],"study_design_scores_gemma":[0.0006509879,0.0006309834,0.0007495386,0.00032969893,0.00001598827,0.000022773636,0.00039811124,0.48774576,0.30226392,0.20623966,0.0005085358,0.0004440421],"about_ca_topic_score_codex":0.000033603592,"about_ca_topic_score_gemma":0.000006561665,"teacher_disagreement_score":0.8696033,"about_ca_system_score_codex":0.0000392808,"about_ca_system_score_gemma":0.000106385225,"threshold_uncertainty_score":0.5621257},"labels":[],"label_agreement":null},{"id":"W1906962264","doi":"10.1109/ssap.1998.739394","title":"Blind system identification using model based matching method","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Victoria","funders":"","keywords":"Transfer function; Subspace topology; Eigenvalues and eigenvectors; Algorithm; Covariance; Sensitivity (control systems); Mathematics; Matching (statistics); System identification; Computer science; Nonlinear system; Fourier transform; Finite impulse response; Data modeling; Mathematical analysis; Statistics; Engineering; Physics","score_opus":0.08336053371539975,"score_gpt":0.3341463532805294,"score_spread":0.25078581956512963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1906962264","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.002735571,0.000012185009,0.9901405,0.0003969621,0.000055301654,0.00015616832,5.243805e-7,0.00089663046,0.0056061577],"genre_scores_gemma":[0.46876407,2.568876e-7,0.53072107,0.00022647454,0.000007820836,0.000006161848,4.4174723e-7,0.000004791022,0.00026890525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989578,0.00013777905,0.00025641944,0.00027996453,0.00023997537,0.00012805143],"domain_scores_gemma":[0.99920726,0.000051402723,0.0001093689,0.00050414726,0.00008254595,0.00004528655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007875574,0.00008616627,0.000097770426,0.00016730723,0.00011952166,0.00032252146,0.00045100207,0.00005825694,0.000012905167],"category_scores_gemma":[0.000009706956,0.00008232501,0.00004562699,0.0003020374,0.000007301323,0.0006757643,0.00006331312,0.00008173754,0.00004491232],"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.0000019872366,0.00006819589,0.0000111333175,0.00004076083,0.000008496512,0.0000024861858,0.0017025493,0.29688552,0.02909355,0.6602842,0.0005196323,0.011381457],"study_design_scores_gemma":[0.00010702883,0.000004098697,0.0000056975537,0.000013248631,0.0000033430285,0.0000063982743,0.000028911796,0.97186434,0.025632532,0.0022054361,0.00003253995,0.00009639604],"about_ca_topic_score_codex":0.000027325603,"about_ca_topic_score_gemma":0.0000019138438,"teacher_disagreement_score":0.67497885,"about_ca_system_score_codex":0.000052874588,"about_ca_system_score_gemma":0.000021445183,"threshold_uncertainty_score":0.33571166},"labels":[],"label_agreement":null},{"id":"W1914632892","doi":"10.1109/pacrim.2001.953690","title":"Hybrid approach between constant modulus and decision feedback blind equalization","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Saskatchewan","funders":"","keywords":"Blind equalization; Convergence (economics); Computer science; Equalization (audio); QAM; Quadrature amplitude modulation; Constant (computer programming); Scheme (mathematics); Stability (learning theory); Control theory (sociology); Algorithm; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics; Bit error rate","score_opus":0.049653240968532214,"score_gpt":0.27408096080867467,"score_spread":0.22442771984014245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1914632892","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.035979334,0.00007054282,0.9414945,0.00028973652,0.000035374727,0.00020296399,0.0000017664785,0.00037486257,0.021550879],"genre_scores_gemma":[0.7002408,0.000026683998,0.29917514,0.00028055944,0.000019852334,0.0000060570515,0.000004078841,0.0000057472407,0.00024107499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989146,0.000059954717,0.0002473987,0.0003508256,0.00027113943,0.00015610625],"domain_scores_gemma":[0.9992965,0.000096049815,0.00007095306,0.00037248645,0.000074207084,0.000089838046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035678915,0.000111510344,0.00014125316,0.00013987276,0.00009641358,0.00027154226,0.00032775314,0.000055968118,0.000047122325],"category_scores_gemma":[0.000034685418,0.000096631185,0.000025807456,0.00024751338,0.000048442653,0.0005659776,0.00018208374,0.00008603588,0.00004039095],"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.000006547214,0.00012723194,0.0010461604,0.000012012224,0.000017350703,0.0000037071954,0.0010976518,0.00014145576,0.00023133474,0.56878054,0.012222678,0.41631335],"study_design_scores_gemma":[0.00092009193,0.00012397594,0.00082159723,0.00001704393,0.000007791995,0.00003357632,0.000023620372,0.91512054,0.0082303565,0.06951467,0.00482856,0.00035815622],"about_ca_topic_score_codex":0.000010592764,"about_ca_topic_score_gemma":0.0000010702665,"teacher_disagreement_score":0.9149791,"about_ca_system_score_codex":0.0000191568,"about_ca_system_score_gemma":0.000010440773,"threshold_uncertainty_score":0.3940505},"labels":[],"label_agreement":null},{"id":"W1928764001","doi":"10.1109/ssap.1998.739413","title":"Semi-blind training-like estimation of spatio-temporal filter coefficients for finite alphabet signals","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Toronto","funders":"","keywords":"Computer science; Training (meteorology); Equalization (audio); Blind equalization; Sequence (biology); Algorithm; Phase-shift keying; Wireless; Filter (signal processing); Signal processing; Speech recognition; Artificial intelligence; Digital signal processing; Computer vision; Bit error rate; Telecommunications","score_opus":0.06896974336124694,"score_gpt":0.2988205307231391,"score_spread":0.22985078736189213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1928764001","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.01268072,0.000018358305,0.98352724,0.0006347811,0.00009899166,0.0004820563,0.000014317496,0.0002733279,0.0022702185],"genre_scores_gemma":[0.77274764,0.0000016376522,0.22528115,0.0007166071,0.000016415666,0.000046705976,0.000038306673,0.000009107015,0.0011424529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987351,0.00006090838,0.0004097344,0.00029213988,0.000297788,0.00020434018],"domain_scores_gemma":[0.99891156,0.00028267177,0.00020499688,0.00036493552,0.00017169755,0.00006412275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048156845,0.00013281105,0.0001978778,0.00019615528,0.00006984279,0.000104583436,0.00045316503,0.00008882734,0.00021150413],"category_scores_gemma":[0.000101392674,0.00012393006,0.000086573215,0.00034375687,0.000041036023,0.0005008877,0.000065063985,0.000068308276,0.000030023995],"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.00016197578,0.0019346004,0.0014101816,0.00025442636,0.00017816816,0.000007631762,0.050997674,0.20937365,0.0024441087,0.09918301,0.2150934,0.41896117],"study_design_scores_gemma":[0.0006305383,0.00021909513,0.0000454342,0.000021034442,0.0000049533123,0.0000015536716,0.000029641953,0.97640634,0.014208577,0.0019493259,0.006332386,0.00015110512],"about_ca_topic_score_codex":0.000008979669,"about_ca_topic_score_gemma":0.0000073941046,"teacher_disagreement_score":0.7670327,"about_ca_system_score_codex":0.0000165655,"about_ca_system_score_gemma":0.000029800236,"threshold_uncertainty_score":0.5053721},"labels":[],"label_agreement":null},{"id":"W1932412445","doi":"10.1109/icassp.1995.480323","title":"A new kind of adaptive frequency shift filter","year":2002,"lang":"en","type":"article","venue":"","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":"McMaster University","funders":"","keywords":"Adaptive filter; Cyclostationary process; Kernel adaptive filter; Frequency domain; Filter (signal processing); Computer science; Prototype filter; Multidelay block frequency domain adaptive filter; Filter design; Control theory (sociology); Electronic engineering; Algorithm; Artificial intelligence; Telecommunications; Engineering; Computer vision","score_opus":0.036163892752821655,"score_gpt":0.24430928801694896,"score_spread":0.2081453952641273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1932412445","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.00064995995,0.00005237289,0.86243725,0.0013714555,0.00003097314,0.000074393865,4.7878785e-7,0.00019144923,0.13519168],"genre_scores_gemma":[0.5550859,0.0000041344565,0.4414946,0.00053700403,0.000015087144,0.000002662687,1.6137452e-7,0.000002919292,0.0028574925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999388,0.000033631226,0.00015102631,0.00016488512,0.0001585347,0.000103950784],"domain_scores_gemma":[0.99946874,0.00003570032,0.000055683053,0.00034922673,0.000035650002,0.00005497916],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008565021,0.00006619099,0.00008875203,0.0000770003,0.000017958157,0.000042248128,0.00045442148,0.00004337022,0.0011728744],"category_scores_gemma":[0.000010555738,0.000056377598,0.00004116527,0.00021930062,0.000016418657,0.0004427184,0.00007865021,0.00006652154,0.000119075376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.4030836e-7,0.000039674775,0.00014817707,0.00000190994,0.000007879167,0.000002653561,0.003170867,0.0000045565093,0.0004836316,0.9434914,0.02978907,0.022859314],"study_design_scores_gemma":[0.0013201925,0.0014327705,0.010650971,0.00009394011,0.000015812733,0.000029283052,0.00009354034,0.08004551,0.23314708,0.6447562,0.027305853,0.0011088206],"about_ca_topic_score_codex":0.00012141551,"about_ca_topic_score_gemma":0.000025502126,"teacher_disagreement_score":0.55443597,"about_ca_system_score_codex":0.000009184221,"about_ca_system_score_gemma":0.000021537291,"threshold_uncertainty_score":0.9997402},"labels":[],"label_agreement":null},{"id":"W1943484360","doi":"10.1109/cdc.1989.70469","title":"Recursive estimation for system of unknown delay","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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 British Columbia","funders":"","keywords":"A priori and a posteriori; Algorithm; Estimation theory; Computer science; Process (computing); Computation; Estimation; Mathematics","score_opus":0.015066276749666636,"score_gpt":0.27010415197526527,"score_spread":0.2550378752255986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943484360","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.0010483064,0.000013403157,0.9754675,0.00013159185,0.00006456721,0.00024198371,5.495725e-7,0.00020539215,0.022826722],"genre_scores_gemma":[0.47546747,4.0582114e-7,0.5242291,0.00005251857,0.0000021325018,0.000021028058,7.262628e-7,0.0000019493702,0.00022463864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999537,0.000046157867,0.00014835512,0.000113520815,0.00008581276,0.000069164234],"domain_scores_gemma":[0.99947083,0.00007854594,0.0000776781,0.00021082477,0.000141269,0.000020825706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033847176,0.00004339864,0.0000748128,0.000056477365,0.000028278133,0.000025536767,0.00017269999,0.000034471508,0.0000025868296],"category_scores_gemma":[0.00006486374,0.00003773368,0.000031101757,0.00014311381,0.00000954969,0.0002099174,0.0000129989085,0.000020868974,0.0000053026806],"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":[7.0634866e-7,0.000008607724,0.0000040542836,0.000013446904,0.0000022939832,9.215986e-8,0.00019407982,0.00017711324,0.00010317584,0.9965435,0.00077549333,0.0021774294],"study_design_scores_gemma":[0.00045626058,0.00030196022,0.00004052776,0.000065180575,0.000009030767,0.000024763704,0.00013636383,0.47132388,0.43616253,0.074424036,0.016836492,0.00021897633],"about_ca_topic_score_codex":0.0000039304828,"about_ca_topic_score_gemma":0.0000018375777,"teacher_disagreement_score":0.9221195,"about_ca_system_score_codex":0.000022663853,"about_ca_system_score_gemma":0.000041311447,"threshold_uncertainty_score":0.15387349},"labels":[],"label_agreement":null},{"id":"W1945167225","doi":"10.1109/ssap.1994.572435","title":"Detection In Alpha-stable Noise Environments Based On Nonlinear Prediction","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Noise (video); Nonlinear system; Alpha (finance); Computer science; Artificial intelligence; Mathematics; Physics; Statistics","score_opus":0.009578022488147776,"score_gpt":0.22902804075728098,"score_spread":0.2194500182691332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1945167225","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.022900993,0.0000035590301,0.9662946,0.0008839645,0.00005699628,0.00018814106,0.0000013440708,0.00031854297,0.009351892],"genre_scores_gemma":[0.90202427,0.000003642998,0.0957498,0.0016083098,0.00005159717,0.00003041888,0.0000037020602,0.0000064317073,0.0005218436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991707,0.000057633402,0.00016813389,0.0002482555,0.00022065728,0.00013462348],"domain_scores_gemma":[0.99957275,0.000027878834,0.000039245122,0.0003122312,0.00000777924,0.000040107207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028067606,0.000081681595,0.00006466556,0.00018076603,0.000048050093,0.000053280324,0.00019624586,0.00006338222,0.000034850826],"category_scores_gemma":[0.000012182311,0.00007927817,0.000024594281,0.00020719814,0.000010445395,0.0005263182,0.000033859433,0.000115296985,0.000114594695],"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.00011490896,0.0024241821,0.0050222846,0.000014520739,0.000013675887,0.000009597423,0.0013174749,0.14347725,0.09076639,0.008114764,0.0017992252,0.7469257],"study_design_scores_gemma":[0.00025657972,0.00009543046,0.0033195312,0.0000047942513,6.2209415e-7,6.548227e-7,0.0000024226663,0.7707183,0.20593491,0.0001465334,0.019456716,0.00006351985],"about_ca_topic_score_codex":0.000019702913,"about_ca_topic_score_gemma":0.00004533247,"teacher_disagreement_score":0.8791233,"about_ca_system_score_codex":0.00012045715,"about_ca_system_score_gemma":0.000015512527,"threshold_uncertainty_score":0.323287},"labels":[],"label_agreement":null},{"id":"W1954203030","doi":"10.1109/icassp.1994.389791","title":"Identification of parametric linear models with cyclostationary inputs","year":2002,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"Cyclostationary process; Autocorrelation; Autoregressive–moving-average model; Autoregressive model; Parametric statistics; Identification (biology); Sequence (biology); Linear prediction; Moving average; Nonparametric statistics; Computer science; Noise (video); Linear model; Algorithm; Parametric model; Mathematics; Speech recognition; Statistics; Artificial intelligence; Telecommunications","score_opus":0.027926901294357452,"score_gpt":0.25212941688007334,"score_spread":0.22420251558571588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1954203030","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.018028598,0.000026152506,0.9743932,0.0008882499,0.000015119109,0.00012652348,9.489498e-7,0.00022746614,0.0062937653],"genre_scores_gemma":[0.8139983,0.000018476232,0.18503271,0.0002477759,0.0000047854955,0.000010865856,0.0000016018245,0.000003756322,0.0006817728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992339,0.000038635913,0.00022459283,0.00017507518,0.00025327076,0.00007454634],"domain_scores_gemma":[0.9992771,0.000057159814,0.00012179832,0.00035272105,0.00016253481,0.000028684848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017130893,0.000058835478,0.00007487985,0.00023268844,0.000029493141,0.00003727367,0.00030953216,0.00003293136,0.000018400548],"category_scores_gemma":[0.000017341617,0.00004823324,0.000019639689,0.0008304356,0.000025856263,0.0007863317,0.000039252223,0.000051175884,0.000030252966],"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.0000058396517,0.0003702742,0.00044135572,0.00002101755,0.000023367356,0.000003193392,0.0026253422,0.03224624,0.0022755554,0.941386,0.0030774956,0.017524356],"study_design_scores_gemma":[0.000095916344,0.000064733096,0.00039273142,0.000004155055,0.0000019310594,0.000004649109,0.000007438131,0.95501167,0.031089522,0.013098994,0.0001522649,0.00007601232],"about_ca_topic_score_codex":0.0000067898372,"about_ca_topic_score_gemma":0.0000012518036,"teacher_disagreement_score":0.92828697,"about_ca_system_score_codex":0.000011245224,"about_ca_system_score_gemma":0.000013436409,"threshold_uncertainty_score":0.19668944},"labels":[],"label_agreement":null},{"id":"W1960297826","doi":"10.1109/icc.1988.13591","title":"An investigation of block-adaptive decision feedback equalization for frequency selective fading channels","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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; Bell (Canada)","funders":"","keywords":"Fading; Block (permutation group theory); Equalization (audio); Computer science; Adaptation (eye); Channel (broadcasting); Interpolation (computer graphics); Algorithm; Mathematics; Artificial intelligence; Telecommunications; Psychology; Combinatorics","score_opus":0.03708153234621106,"score_gpt":0.3005362899304265,"score_spread":0.26345475758421544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1960297826","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.089014105,0.000011764854,0.9089677,0.000058801877,0.00008670766,0.00045868478,0.0000014735533,0.00020655656,0.0011942022],"genre_scores_gemma":[0.623865,0.0000018628128,0.37590453,0.00014997665,0.000010446289,0.000031127038,0.0000037865377,0.000006563778,0.00002669986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99883574,0.00017374415,0.00030398788,0.00031937953,0.00021700443,0.00015013383],"domain_scores_gemma":[0.99870425,0.00025722032,0.00018399856,0.00028184435,0.00050494616,0.00006774265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007379559,0.000111796115,0.00014095817,0.0002053066,0.00009855574,0.00007676698,0.00029062343,0.000095225696,0.0000055085084],"category_scores_gemma":[0.00020095347,0.00010738096,0.000042315787,0.0006261296,0.000031154435,0.0010775463,0.00002024575,0.0000566453,0.0000027433418],"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.0000061987894,0.000033997523,0.0003724982,0.0000054300535,0.000007909877,1.1437823e-7,0.004848008,0.0019901367,0.026566902,0.963967,0.00021190882,0.0019898533],"study_design_scores_gemma":[0.00024231644,0.00042164538,0.00030869612,0.000023199571,0.000004091892,0.0000024110914,0.00010756259,0.07834785,0.5914513,0.3289141,0.000029422941,0.00014742791],"about_ca_topic_score_codex":0.000023550778,"about_ca_topic_score_gemma":0.000015477097,"teacher_disagreement_score":0.635053,"about_ca_system_score_codex":0.000057615707,"about_ca_system_score_gemma":0.00011629429,"threshold_uncertainty_score":0.43788686},"labels":[],"label_agreement":null},{"id":"W1964001453","doi":"10.1016/j.neuroimage.2012.12.072","title":"Multi-core beamformers: Derivation, limitations and improvements","year":2013,"lang":"en","type":"article","venue":"NeuroImage","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Down Syndrome Research Foundation","funders":"Behavioural and Cognitive Neuroscience Institute, Simon Fraser University; Michael Smith Health Research BC","keywords":"Computer science; Range (aeronautics); Variance (accounting); Core (optical fiber); Contrast (vision); Algorithm; Dual (grammatical number); Source model; Artificial intelligence; Theoretical computer science","score_opus":0.06793856119643094,"score_gpt":0.280845087938256,"score_spread":0.2129065267418251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964001453","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.22860408,0.000015860624,0.76610947,0.002570173,0.00007788602,0.0004321014,0.0000012755669,0.00042874512,0.0017603968],"genre_scores_gemma":[0.68159753,0.000021217214,0.31407598,0.0037882084,0.00001212151,0.00007579025,0.0000042456304,0.000009408396,0.0004154928],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9993413,0.000024473924,0.00014524271,0.0002382662,0.000118949356,0.00013175931],"domain_scores_gemma":[0.99942887,0.00005550751,0.000059662234,0.00029571852,0.00010100374,0.000059223174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008044458,0.00008248545,0.00006194463,0.000084760686,0.00010110568,0.00026697322,0.00022933217,0.000028804285,0.000010515436],"category_scores_gemma":[0.00008789606,0.00007963098,0.000018614644,0.00017408976,0.000033655775,0.0012399104,0.00012983006,0.00008657206,0.00007168925],"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.0000030892195,0.00044092807,0.008225218,0.000040721025,0.000027489046,0.000008144856,0.0069353203,0.000028548204,0.65379924,0.05500511,0.023007667,0.2524785],"study_design_scores_gemma":[0.0019048606,0.0004580028,0.6837715,0.000022882765,0.000011200714,0.000026989313,0.00020618667,0.228867,0.04155002,0.01979004,0.022663388,0.0007279314],"about_ca_topic_score_codex":0.000030665815,"about_ca_topic_score_gemma":0.0000057394373,"teacher_disagreement_score":0.6755463,"about_ca_system_score_codex":0.000008190688,"about_ca_system_score_gemma":0.000018584044,"threshold_uncertainty_score":0.32472572},"labels":[],"label_agreement":null},{"id":"W1967745774","doi":"10.1109/icassp.2010.5496251","title":"Modified hierarchical clustering for sparse component analysis","year":2010,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McMaster University","funders":"","keywords":"Cluster analysis; Mixing (physics); Hierarchical clustering; Blind signal separation; Computer science; Matrix (chemical analysis); Algorithm; Sparse matrix; Measure (data warehouse); Component analysis; Independent component analysis; Pattern recognition (psychology); Mathematics; Data mining; Artificial intelligence","score_opus":0.02973771794995409,"score_gpt":0.29446011341186373,"score_spread":0.2647223954619096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967745774","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.0416203,0.0000011530184,0.9515944,0.0018487046,0.00009823707,0.00017531602,0.0000012467002,0.00042847483,0.004232129],"genre_scores_gemma":[0.60741657,3.9676107e-7,0.39182845,0.00046180215,0.000020568083,0.000026088037,0.000003633314,0.0000029438704,0.0002395522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992306,0.000028786562,0.00018071046,0.00025867522,0.00014374389,0.00015747458],"domain_scores_gemma":[0.9992228,0.000109343026,0.000042006042,0.0004883323,0.000057069694,0.0000804191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039125874,0.000078668665,0.00014070843,0.00021594773,0.000077123965,0.0001619697,0.00053568336,0.000061284634,0.000021978623],"category_scores_gemma":[0.000023991734,0.000068111134,0.00012745644,0.00036414678,0.000026144378,0.00019535549,0.0001682898,0.00014958606,0.000008307241],"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.000010935573,0.00010281518,0.00021835745,0.0000055669034,0.00011154917,0.000001434943,0.0005841107,0.00368741,0.015234545,0.9655333,0.00080675515,0.013703192],"study_design_scores_gemma":[0.00013635887,0.000026365726,0.0013080353,6.296334e-7,0.000017797043,0.000001829683,0.000002840846,0.9816842,0.006067556,0.0073065017,0.003342189,0.000105689905],"about_ca_topic_score_codex":0.000029280216,"about_ca_topic_score_gemma":0.0002177406,"teacher_disagreement_score":0.9779968,"about_ca_system_score_codex":0.0000074223194,"about_ca_system_score_gemma":0.00002061947,"threshold_uncertainty_score":0.27774915},"labels":[],"label_agreement":null},{"id":"W1967905256","doi":"10.1142/s0218126608004423","title":"NEW Z-DOMAIN CONTINUED FRACTION EXPANSIONS BASED ON AN INFINITE NUMBER OF MIRROR-IMAGE AND ANTI-MIRROR-IMAGE POLYNOMIAL DECOMPOSITIONS","year":2008,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Blind Source Separation 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":"École de Technologie Supérieure; Concordia University","funders":"","keywords":"Mathematics; Polynomial; Image (mathematics); Alternating polynomial; Fraction (chemistry); Stable polynomial; Line (geometry); Function (biology); Matrix polynomial; Mathematical analysis; Geometry; Computer science; Artificial intelligence","score_opus":0.01818723894522944,"score_gpt":0.27537758768295284,"score_spread":0.2571903487377234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967905256","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.46723127,0.000035204543,0.5316173,0.00030703787,0.00026863965,0.00013962465,0.0000043637647,0.000042409345,0.00035415607],"genre_scores_gemma":[0.9020892,0.000026580252,0.09748687,0.00027724094,0.000079615675,0.0000024968895,0.0000025010995,0.000013925698,0.00002156236],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9980711,0.00033125706,0.00073662726,0.00025423776,0.00041382413,0.00019295556],"domain_scores_gemma":[0.99813294,0.00022429076,0.0007582107,0.00031483328,0.00028607147,0.00028366037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053471775,0.00019802878,0.0004963813,0.00036487513,0.00021236144,0.0002367491,0.0003308961,0.00011166401,0.0000054005804],"category_scores_gemma":[0.00001731625,0.00018402767,0.000115171584,0.00025844062,0.00009150878,0.0011275491,0.000048022754,0.000274647,0.0000027544713],"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.00049157673,0.0035103867,0.0458436,0.00065150065,0.00081591116,0.0014939939,0.03472222,0.0016490644,0.7776205,0.04206553,0.045321815,0.045813914],"study_design_scores_gemma":[0.0235508,0.007828889,0.6178003,0.0047915834,0.00029201797,0.020844186,0.0024995764,0.25799334,0.02936309,0.0029493927,0.028457206,0.0036296512],"about_ca_topic_score_codex":0.00018883795,"about_ca_topic_score_gemma":0.000006187396,"teacher_disagreement_score":0.7482574,"about_ca_system_score_codex":0.000040914867,"about_ca_system_score_gemma":0.0001993039,"threshold_uncertainty_score":0.75044304},"labels":[],"label_agreement":null},{"id":"W1968877023","doi":"10.1109/cbms.2012.6266371","title":"Sparse principal component extraction and classification of long-term biomedical signals","year":2012,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"University of Guelph; Toronto Metropolitan University","funders":"Mitacs","keywords":"Principal component analysis; Pattern recognition (psychology); Sparse approximation; Computer science; SIGNAL (programming language); Artificial intelligence; Term (time); Signal reconstruction; Robust principal component analysis; Representation (politics); Functional principal component analysis; Feature extraction; Set (abstract data type); Segmentation; Signal processing; Data mining","score_opus":0.06157922563655639,"score_gpt":0.3343292455900405,"score_spread":0.27275001995348414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968877023","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.40235442,0.000031658536,0.59623235,0.00040200457,0.000058084166,0.00008857337,3.1293027e-7,0.000100478086,0.0007321187],"genre_scores_gemma":[0.9634724,0.00001531039,0.036288716,0.000087940614,0.000034194036,0.000009451287,0.000004793398,0.000003115018,0.00008406082],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9992338,0.0000730104,0.00021510388,0.00013457461,0.00022095318,0.00012255694],"domain_scores_gemma":[0.9994616,0.00006181115,0.00011223604,0.00021916443,0.000044465694,0.00010072817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005065846,0.00006310783,0.00008959471,0.00010513227,0.000030741234,0.000034026005,0.00016064943,0.00006355207,0.000032752974],"category_scores_gemma":[0.0000150059595,0.00005368904,0.000021298712,0.00012823925,0.00006092262,0.00057375873,0.00007734167,0.000068713976,0.000016799879],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015646732,0.001063514,0.09805338,0.000051719726,0.000026674265,0.0000022287238,0.0022467158,0.0000031336785,0.51658124,0.2792336,0.00096691167,0.101755224],"study_design_scores_gemma":[0.00015000982,0.000070942464,0.9071887,0.000014259844,0.000004917363,0.000028675571,0.000014846504,0.008827349,0.08224489,0.00030684724,0.001042982,0.000105595136],"about_ca_topic_score_codex":0.0000063908083,"about_ca_topic_score_gemma":0.0000018580057,"teacher_disagreement_score":0.8091353,"about_ca_system_score_codex":0.000017465278,"about_ca_system_score_gemma":0.000019950872,"threshold_uncertainty_score":0.21893756},"labels":[],"label_agreement":null},{"id":"W1970139588","doi":"10.1109/bibe.2014.52","title":"Detection and Removal of Muscle Artifacts from Scalp EEG Recordings in Patients with Epilepsy","year":2014,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Electroencephalography; Computer science; Epilepsy; Scalp; Pattern recognition (psychology); Artificial intelligence; EEG-fMRI; Speech recognition; Neuroscience; Psychology; Medicine; Anatomy","score_opus":0.006014333117500101,"score_gpt":0.1987249883572776,"score_spread":0.19271065523977748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970139588","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65126497,0.0000012592982,0.3471413,0.000054202414,0.000020299962,0.00006937697,2.2305966e-7,0.000058548096,0.001389814],"genre_scores_gemma":[0.9197296,8.7846854e-7,0.08009541,0.00013521353,0.0000045319093,0.0000029614885,8.570861e-7,0.0000036680353,0.000026875608],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99936986,0.000060193805,0.00014993384,0.00020104439,0.00013439362,0.00008458],"domain_scores_gemma":[0.9995678,0.000056131663,0.000075681884,0.00021243501,0.000053638214,0.000034294826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021190618,0.000061262566,0.00010081857,0.000092137125,0.000021369115,0.000038399652,0.00012695283,0.000042317093,0.000007638628],"category_scores_gemma":[0.000035937544,0.000049996077,0.00001077828,0.00017560994,0.000023052587,0.0003653476,0.000058251073,0.000062945335,0.0000039846345],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044846456,0.0001265894,0.12666687,0.0000069350326,0.0000060907955,9.959988e-7,0.0010803458,0.00002016263,0.0044904174,0.0041438965,0.000052512947,0.86336035],"study_design_scores_gemma":[0.00046838008,0.00026523793,0.95697385,0.000021326357,0.0000014870415,7.074525e-7,0.000009769532,0.014882543,0.022564799,0.0041706064,0.00054422836,0.000097034856],"about_ca_topic_score_codex":0.0003354517,"about_ca_topic_score_gemma":0.00023215951,"teacher_disagreement_score":0.8632633,"about_ca_system_score_codex":0.000012587935,"about_ca_system_score_gemma":0.000007445078,"threshold_uncertainty_score":0.20387809},"labels":[],"label_agreement":null},{"id":"W1970275911","doi":"10.1109/icassp.2010.5496249","title":"Blind extraction of sparse sources","year":2010,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McMaster University","funders":"","keywords":"Blind signal separation; Independent component analysis; Computer science; Algorithm; SIGNAL (programming language); Sparse approximation; Iterative method; Eigendecomposition of a matrix; Convex optimization; Signal processing; Pattern recognition (psychology); Eigenvalues and eigenvectors; Mathematics; Artificial intelligence; Regular polygon","score_opus":0.021591960800776824,"score_gpt":0.29787103061722464,"score_spread":0.27627906981644784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970275911","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.32457218,0.0000034950972,0.65046394,0.000551624,0.00012441867,0.000058685488,1.498605e-7,0.00023340275,0.023992121],"genre_scores_gemma":[0.8190368,0.0000017166491,0.18010944,0.00014571018,0.000021555927,0.0000031408013,3.22264e-7,0.0000022710956,0.0006790403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99953157,0.000018933415,0.00012786462,0.00012181974,0.00013131373,0.000068508845],"domain_scores_gemma":[0.99947464,0.00004397844,0.000071253446,0.00031610235,0.000063441476,0.00003057889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002639765,0.000045199035,0.00005895485,0.000088346744,0.000025841722,0.000050247574,0.00031541215,0.000054141274,0.000092894945],"category_scores_gemma":[0.000025583813,0.000038608578,0.000028385082,0.00015355322,0.00002787989,0.0004113611,0.000054027605,0.0001266189,0.000031959473],"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.000005172888,0.00010920596,0.000977383,0.0000040035056,0.000005421315,0.000001086564,0.0008963516,0.000016283539,0.27815497,0.6918536,0.0018304605,0.02614606],"study_design_scores_gemma":[0.00020020122,0.000060970367,0.0043671345,0.000003003617,0.0000020649813,0.000018685603,0.000030456671,0.011680177,0.9414511,0.013625575,0.028441278,0.00011938469],"about_ca_topic_score_codex":0.000032215026,"about_ca_topic_score_gemma":0.000050148574,"teacher_disagreement_score":0.678228,"about_ca_system_score_codex":0.0000020829752,"about_ca_system_score_gemma":0.000026062651,"threshold_uncertainty_score":0.1574412},"labels":[],"label_agreement":null},{"id":"W1972440292","doi":"10.1007/s10827-009-0177-z","title":"Canonical bicoherence analysis of dynamic EEG data","year":2009,"lang":"en","type":"article","venue":"Journal of Computational Neuroscience","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"University of California, San Diego; Centre National de la Recherche Scientifique; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Bicoherence; Electroencephalography; Computer science; Pattern recognition (psychology); Artificial intelligence; Quadratic equation; Speech recognition; Mathematics; Bispectrum; Spectral density; Neuroscience; Psychology","score_opus":0.04167537222689209,"score_gpt":0.3541892814301985,"score_spread":0.3125139092033064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972440292","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.095531605,0.00004276023,0.9013944,0.0026750616,0.00013651022,0.000047317637,0.0000092241135,0.000027922488,0.00013516814],"genre_scores_gemma":[0.88654387,0.000015263415,0.11193377,0.0014835233,0.000007699196,1.8387847e-7,0.0000030167587,0.0000019341371,0.000010765635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978244,0.00013542903,0.0006492247,0.00028783744,0.0009612852,0.00014183063],"domain_scores_gemma":[0.9979501,0.00025788875,0.0007197136,0.00052746554,0.00044068127,0.000104155646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010029877,0.0000950897,0.00028588797,0.00067868474,0.00006571042,0.00013498528,0.0028329801,0.00003189308,0.000005555485],"category_scores_gemma":[0.000289759,0.00008244517,0.0001129965,0.002560776,0.00014511905,0.0013457631,0.00021125414,0.0001930356,8.890564e-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.000040745963,0.0008688081,0.0011504046,0.00000867916,0.000104915205,0.00009709106,0.00078454195,0.65841085,0.024910588,0.24990349,0.0014043811,0.062315527],"study_design_scores_gemma":[0.000107042666,0.00025175518,0.17707354,0.0000098314595,0.00003794312,0.000061530925,0.0000027975457,0.80408806,0.00017217115,0.017929113,0.00019145441,0.00007473491],"about_ca_topic_score_codex":0.000002412407,"about_ca_topic_score_gemma":0.0000025521604,"teacher_disagreement_score":0.7910122,"about_ca_system_score_codex":0.000027607904,"about_ca_system_score_gemma":0.00052005413,"threshold_uncertainty_score":0.5264429},"labels":[],"label_agreement":null},{"id":"W1972850445","doi":"10.1364/ofc.2014.w3b.4","title":"Non-Data-Aided Feedforward Timing Recovery for Flexible Transceivers Employing PDM-MQAM Modulations","year":2014,"lang":"en","type":"article","venue":"Optical Fiber Communication Conference","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":"McGill University","funders":"","keywords":"Quadrature amplitude modulation; Feed forward; Phase-shift keying; Computer science; Modulation (music); Electronic engineering; Estimator; Symbol rate; Engineering; Telecommunications; Mathematics; Physics; Statistics; Channel (broadcasting); Bit error rate","score_opus":0.11143064060422611,"score_gpt":0.33443062732306134,"score_spread":0.22299998671883522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972850445","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.0014523779,0.000020800879,0.96208096,0.0074922936,0.000055426302,0.00047625235,0.000013811601,0.00049157476,0.027916525],"genre_scores_gemma":[0.5625651,0.000031528038,0.43603492,0.00043051844,0.000018114164,0.00007871412,0.00012236844,0.0000139234,0.0007048446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827987,0.00016839575,0.00046200826,0.0005155269,0.00027364533,0.00030056294],"domain_scores_gemma":[0.99546224,0.00090809487,0.00015784154,0.0029476925,0.0003912349,0.00013288489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001102805,0.0001937931,0.0002668562,0.00014103204,0.00041778365,0.00050325406,0.002957839,0.00014510966,0.00005704153],"category_scores_gemma":[0.00028589717,0.00020608591,0.000098081204,0.00030926368,0.00012015866,0.0015061407,0.0004208207,0.00028408793,0.000104652834],"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.00003347051,0.00016525717,0.00006311512,0.000047025893,0.00006333608,2.2494919e-7,0.001735233,0.0023656606,0.0033278486,0.7794761,0.004066873,0.20865586],"study_design_scores_gemma":[0.00070609205,0.00017538707,0.0010104453,0.00012848004,0.00004400024,0.0000047553567,0.00006207518,0.88304347,0.009180354,0.054087978,0.05101411,0.0005428728],"about_ca_topic_score_codex":0.00003318909,"about_ca_topic_score_gemma":0.00002460844,"teacher_disagreement_score":0.8806778,"about_ca_system_score_codex":0.00005195912,"about_ca_system_score_gemma":0.00015058271,"threshold_uncertainty_score":0.84039396},"labels":[],"label_agreement":null},{"id":"W1973421361","doi":"10.1109/icca.2007.4376504","title":"Online Identification and Alignment of MIMO Cross Directional Controlled Processes Using Second Order Statistics","year":2007,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Decorrelation; MIMO; Computer science; Robustness (evolution); Autocorrelation; Blind signal separation; Control theory (sociology); Algorithm; Noise (video); Actuator; Channel (broadcasting); Artificial intelligence; Mathematics; Statistics; Telecommunications","score_opus":0.022769029689901667,"score_gpt":0.33267355620435035,"score_spread":0.30990452651444866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973421361","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.14742292,0.000047879766,0.85180056,0.000059799666,0.00004871516,0.00017403084,0.0000167322,0.00006757977,0.0003617613],"genre_scores_gemma":[0.5901058,0.0000061937276,0.40877917,0.00013786282,0.000015511674,0.0000037911716,0.00000919391,0.000003772887,0.0009387194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991532,0.00002564618,0.00035230114,0.00017269865,0.00020343713,0.00009271572],"domain_scores_gemma":[0.99896884,0.0001780322,0.00017824343,0.00013469279,0.00050616043,0.0000340579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056862005,0.00006713793,0.00012651946,0.00009103202,0.00006306045,0.0001068376,0.00012453896,0.00003614179,0.000034143195],"category_scores_gemma":[0.000120501965,0.000059240498,0.000011631564,0.00023520642,0.000052560386,0.00028620422,0.000046757963,0.000038337785,7.380166e-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.0005769158,0.0037166958,0.024507677,0.00092810125,0.00042577743,0.000016796608,0.009539185,0.0023538072,0.31981474,0.5884271,0.0045971265,0.04509602],"study_design_scores_gemma":[0.0044368473,0.00021190889,0.053815056,0.000048578124,0.00003326855,0.000044128737,0.00022748558,0.17567009,0.7389008,0.02256052,0.0035321082,0.0005192595],"about_ca_topic_score_codex":0.000023288758,"about_ca_topic_score_gemma":0.00015426066,"teacher_disagreement_score":0.56586665,"about_ca_system_score_codex":0.000020413343,"about_ca_system_score_gemma":0.00009324361,"threshold_uncertainty_score":0.24157575},"labels":[],"label_agreement":null},{"id":"W1975206251","doi":"10.1109/iembs.2010.5627291","title":"Spatiotemporal ICA applied to retinotopic fMRI data","year":2010,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Nickel Institute","funders":"Swedish Orphan Biovitrum","keywords":"Independent component analysis; Functional magnetic resonance imaging; Computer science; Benchmark (surveying); Artificial intelligence; Pattern recognition (psychology); Component (thermodynamics); Machine learning; Neuroscience; Psychology","score_opus":0.032905091089011115,"score_gpt":0.3004562155735509,"score_spread":0.26755112448453977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975206251","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.011237581,7.982569e-7,0.8931275,0.008887461,0.00015321281,0.00024273356,0.0000017941164,0.000700408,0.08564851],"genre_scores_gemma":[0.55793774,2.9623706e-7,0.43875897,0.0025562395,0.00004996366,0.000011749656,0.000010276188,0.000004032752,0.0006707143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912477,0.000017717573,0.0001484104,0.00038467455,0.00018785271,0.000136604],"domain_scores_gemma":[0.9979123,0.000031588785,0.000035983343,0.0018914185,0.000036918827,0.00009181549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040949899,0.0000760971,0.00008178126,0.00007267238,0.00005223399,0.0001714929,0.0019395966,0.00006274104,0.00009676717],"category_scores_gemma":[0.000041664323,0.00006727188,0.000012014249,0.00022165562,0.00001742912,0.0003246753,0.00087188836,0.0001745202,0.0002801998],"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.0000019107072,0.000033674303,0.00033352192,0.0000021953897,0.000002782379,0.0000013068899,0.00038687675,0.0000017998494,0.011285616,0.89283395,0.04983871,0.045277674],"study_design_scores_gemma":[0.00027526054,0.00008410658,0.010043322,0.0000047796125,0.0000031109125,0.0000085033735,0.000019103343,0.02130822,0.14691031,0.02074606,0.80008787,0.00050937705],"about_ca_topic_score_codex":0.000046536865,"about_ca_topic_score_gemma":0.00013745547,"teacher_disagreement_score":0.8720879,"about_ca_system_score_codex":0.0000047958833,"about_ca_system_score_gemma":0.000049343464,"threshold_uncertainty_score":0.3604285},"labels":[],"label_agreement":null},{"id":"W1976435971","doi":"10.1117/12.503167","title":"&lt;title&gt;Object extraction in video sequences based on the spatio-temporal independent component analysis&lt;/title&gt;","year":2003,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Independent component analysis; Video tracking; Computer vision; Object (grammar); Video compression picture types; Data compression; Component (thermodynamics); Image segmentation; Feature extraction; Pattern recognition (psychology)","score_opus":0.014802313415884283,"score_gpt":0.24769608855461206,"score_spread":0.23289377513872778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976435971","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95189404,0.00004585005,0.0059025744,0.00287271,0.0002147079,0.00041791092,0.000009575864,0.00012552865,0.03851711],"genre_scores_gemma":[0.9354219,0.000021148993,0.06398208,0.00019318689,0.00006354488,0.00006698839,0.000005071952,0.000015698672,0.00023041404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864024,1.0841355e-7,0.00035475558,0.00025284966,0.00057879457,0.00017328227],"domain_scores_gemma":[0.9991288,0.00012878829,0.0002148715,0.00007265549,0.0004105359,0.000044346918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008739183,0.00015417933,0.00019372083,0.00017172191,0.00004893235,0.0001249061,0.00064884487,0.00010548206,0.00005675716],"category_scores_gemma":[0.00023033447,0.00011486161,0.00029482594,0.0005269301,0.00007186083,0.00028349066,0.000051830768,0.00022787058,0.000009120435],"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.000010900659,0.00008053841,0.00033717143,0.000033039218,0.00012186132,1.2628195e-7,0.00010302752,0.0006152369,0.02143521,0.9733192,0.0037204348,0.0002232945],"study_design_scores_gemma":[0.00091255235,0.00039816654,0.004477208,0.00027829295,0.00019073258,0.000013433956,0.00032900186,0.76918256,0.14280315,0.012538294,0.06814024,0.0007363631],"about_ca_topic_score_codex":0.0000063175853,"about_ca_topic_score_gemma":7.803308e-7,"teacher_disagreement_score":0.96078086,"about_ca_system_score_codex":0.0001337961,"about_ca_system_score_gemma":0.00004658908,"threshold_uncertainty_score":0.46839204},"labels":[],"label_agreement":null},{"id":"W1976582586","doi":"10.1109/ccece.2006.277759","title":"An Implementation of �-Divergence for Blind Source Separation","year":2006,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Manitoba","funders":"","keywords":"Blind signal separation; Independent component analysis; Computer science; Outlier; Divergence (linguistics); Broyden–Fletcher–Goldfarb–Shanno algorithm; Source separation; Signal processing; Preprocessor; Algorithm; Source code; SIGNAL (programming language); Artificial intelligence; Pattern recognition (psychology); Digital signal processing","score_opus":0.021162650665448774,"score_gpt":0.36290354056977087,"score_spread":0.3417408899043221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976582586","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.10496655,0.00000516416,0.8936069,0.00021904048,0.000035342386,0.0002922737,0.000002595554,0.00018557924,0.0006865326],"genre_scores_gemma":[0.77431476,9.202779e-7,0.2252614,0.0001193473,0.000026158732,0.000032494936,0.00002172849,0.0000034202587,0.00021974639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993156,0.000036036246,0.00022749265,0.00017992416,0.00014365694,0.00009727334],"domain_scores_gemma":[0.99944395,0.000029143475,0.00011563653,0.0002441879,0.00014589526,0.000021188369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028509452,0.000059898113,0.00006923819,0.00008656393,0.00005472219,0.00006317197,0.00028275946,0.000032554603,0.000027336051],"category_scores_gemma":[0.0000031617585,0.0000583469,0.00003338734,0.00017647311,0.000013351125,0.0007134159,0.00002587011,0.000021085989,0.000003824649],"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.000016566915,0.00015120093,0.0050918777,0.000013953029,0.00000750121,1.369747e-7,0.0013795615,0.002387364,0.07188203,0.87151873,0.008354023,0.039197035],"study_design_scores_gemma":[0.000702663,0.00040565222,0.008604661,0.000002765783,0.000005932262,0.0000016525236,0.0001930462,0.12618211,0.8315367,0.024123184,0.00805138,0.00019021888],"about_ca_topic_score_codex":0.00027803492,"about_ca_topic_score_gemma":0.00020515888,"teacher_disagreement_score":0.84739554,"about_ca_system_score_codex":0.00001273101,"about_ca_system_score_gemma":0.000041189604,"threshold_uncertainty_score":0.23793176},"labels":[],"label_agreement":null},{"id":"W1977159424","doi":"10.1007/bf02714094","title":"A new method for fMRI data processing: Neighborhood independent component correlation algorithm and its preliminary application","year":2002,"lang":"en","type":"article","venue":"Science in China Series F Information Sciences","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Independent component analysis; Computer science; Functional magnetic resonance imaging; Independence (probability theory); Artificial intelligence; Noise (video); SIGNAL (programming language); Pattern recognition (psychology); Signal processing; Correlation; Component (thermodynamics); Algorithm; Mathematics; Image (mathematics); Statistics; Psychology; Digital signal processing","score_opus":0.03598041453421717,"score_gpt":0.32931249939976615,"score_spread":0.29333208486554896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977159424","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.0007262673,0.00012147684,0.9916243,0.0045445836,0.00017902326,0.00085603906,0.00001002513,0.00019725434,0.0017410108],"genre_scores_gemma":[0.35787132,0.000046638626,0.64154327,0.0003551945,0.00002424285,0.00008054039,0.000018381375,0.0000034066375,0.00005697792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974709,0.000060731218,0.00057005236,0.00058648345,0.0009591087,0.0003527374],"domain_scores_gemma":[0.9986077,0.00010441753,0.00041453078,0.0005214394,0.00021233594,0.00013955339],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.003843752,0.00016914737,0.00016585372,0.0006730285,0.00077002955,0.0013584583,0.002469372,0.00007470317,0.000007396984],"category_scores_gemma":[0.00027893123,0.00014995135,0.000018683579,0.00248148,0.0002689387,0.028982207,0.00072681607,0.00015445273,0.000011969299],"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.0000074629306,0.000035891986,0.00020790649,0.000024884484,0.0000010074243,1.732594e-7,0.009759503,0.00205018,0.0001632876,0.06861412,0.0003253317,0.91881025],"study_design_scores_gemma":[0.00023033565,0.00021492227,0.0052610394,0.000025914002,0.0000022639829,0.0000388392,0.00041209644,0.9803113,0.0009326615,0.010288629,0.0020888106,0.00019321004],"about_ca_topic_score_codex":0.00006048015,"about_ca_topic_score_gemma":0.000011917609,"teacher_disagreement_score":0.9782611,"about_ca_system_score_codex":0.00007699503,"about_ca_system_score_gemma":0.00037393553,"threshold_uncertainty_score":0.99967825},"labels":[],"label_agreement":null},{"id":"W1977873640","doi":"10.1049/iet-com.2010.0836","title":"Blind channel estimation and discrete speed tracking in wireless systems using independent component analysis with particle filtering","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Blind Source Separation Techniques","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":"Simon Fraser University","funders":"","keywords":"Computer science; Channel (broadcasting); Particle filter; Kalman filter; MIMO; Algorithm; Block (permutation group theory); Benchmark (surveying); Bit error rate; Wireless; Real-time computing; Control theory (sociology); Mathematics; Telecommunications; Artificial intelligence","score_opus":0.08058643431635498,"score_gpt":0.34007393093391936,"score_spread":0.2594874966175644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977873640","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.4809861,0.00014919565,0.51824236,0.000304926,0.000014113828,0.00016460432,0.0000015908654,0.000073452,0.0000636628],"genre_scores_gemma":[0.95617265,0.000030046414,0.04370306,0.000032412885,0.0000075933744,0.000027388323,0.000014201528,0.000007850343,0.0000047986723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988945,0.00027537206,0.00028307718,0.00015959101,0.0001873459,0.00020012724],"domain_scores_gemma":[0.9985503,0.00011657499,0.00015338793,0.0010393644,0.000061016573,0.000079374404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007346188,0.00010283342,0.00017909361,0.00022805002,0.00019444824,0.0002716438,0.0005761237,0.000044402055,8.5151515e-7],"category_scores_gemma":[0.000011264486,0.00009743619,0.000028025088,0.0008316872,0.000060458744,0.0010633722,0.00034633843,0.0001643576,0.0000016438593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076443735,0.0015586062,0.21306805,0.00013350719,0.00080060714,0.0000066125294,0.09006981,0.43970478,0.02724684,0.21440724,0.0000142166145,0.012913285],"study_design_scores_gemma":[0.0002237864,0.000014531917,0.028634656,0.000045352706,0.000042467735,0.0000101114265,0.00029190062,0.9691977,0.0013212111,0.00008197097,0.0000121416815,0.0001241794],"about_ca_topic_score_codex":0.00036484477,"about_ca_topic_score_gemma":0.00020878325,"teacher_disagreement_score":0.5294929,"about_ca_system_score_codex":0.000069402035,"about_ca_system_score_gemma":0.000020422458,"threshold_uncertainty_score":0.39733323},"labels":[],"label_agreement":null},{"id":"W1980137461","doi":"10.1049/el:20092690","title":"Minimisation of carrier frequency acquisition time in QAM systems","year":2009,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Blind Source Separation 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":"École de Technologie Supérieure; Carleton University","funders":"","keywords":"Quadrature amplitude modulation; QAM; Amplitude modulation; Amplitude; Electronic engineering; Symbol rate; Mathematics; Carrier recovery; Carrier signal; Computer science; Frequency modulation; Control theory (sociology); Telecommunications; Bandwidth (computing); Physics; Engineering; Bit error rate; Optics; Decoding methods","score_opus":0.004919088375612059,"score_gpt":0.21986228365969193,"score_spread":0.21494319528407987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980137461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6126498,0.00049983367,0.36510655,0.019592155,0.00009179553,0.00041489548,0.0000021931226,0.00029632234,0.0013464408],"genre_scores_gemma":[0.9918916,0.000012055795,0.0055326754,0.0024895642,0.000024592491,0.000009725013,0.000008544542,0.000004982877,0.00002621541],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989833,0.0001227,0.00025925227,0.00020331999,0.00021247304,0.00021892753],"domain_scores_gemma":[0.9994823,0.000028855473,0.000121541016,0.00030120337,0.000040084255,0.000026059635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003998555,0.00008969458,0.00013304777,0.00018949877,0.000023657667,0.00005271498,0.00032314446,0.00006138274,0.000004214682],"category_scores_gemma":[0.000010975711,0.00009713313,0.00003612009,0.0003486131,0.000013960828,0.00039661847,0.000014042742,0.00013284563,0.000008809725],"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.000008157419,0.000075781914,0.00021265082,0.000011252269,0.000010387646,0.000006320065,0.0017425918,0.0014663965,0.7969682,0.19231975,0.0039994656,0.0031790282],"study_design_scores_gemma":[0.0027631137,0.0024896448,0.027696948,0.00034121744,0.00003605185,0.00009756416,0.0000701743,0.24868348,0.64683175,0.060132504,0.008888793,0.0019687426],"about_ca_topic_score_codex":0.000019703857,"about_ca_topic_score_gemma":0.0000033768786,"teacher_disagreement_score":0.37924182,"about_ca_system_score_codex":0.00016221519,"about_ca_system_score_gemma":0.0000693465,"threshold_uncertainty_score":0.39609742},"labels":[],"label_agreement":null},{"id":"W1980458777","doi":"10.1016/j.jneumeth.2007.10.003","title":"Bootstrap significance of low SNR evoked response","year":2007,"lang":"en","type":"article","venue":"Journal of Neuroscience Methods","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Institute of Biomedical Imaging and Bioengineering; National Institute of Neurological Disorders and Stroke","keywords":"Resampling; Magnetoencephalography; Statistical power; Parametric statistics; Statistical hypothesis testing; Computer science; Statistics; Pattern recognition (psychology); Mathematics; Artificial intelligence; Speech recognition; Electroencephalography; Psychology","score_opus":0.08198922068353834,"score_gpt":0.43480927301831407,"score_spread":0.35282005233477576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980458777","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.1109269,0.000048415168,0.88707703,0.0008465324,0.00060241146,0.00009241416,4.4381403e-7,0.000040039766,0.00036582057],"genre_scores_gemma":[0.45230308,0.000013436869,0.54689854,0.0006261927,0.000028712428,6.2509565e-7,9.591446e-9,0.000005172528,0.00012422648],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965147,0.0013513211,0.0008498307,0.00025871504,0.0007368854,0.0002885489],"domain_scores_gemma":[0.9966024,0.0013885648,0.000958577,0.00047859352,0.00039191527,0.00017995934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019596456,0.00012552952,0.0002933043,0.0005394686,0.00008016917,0.00010285231,0.0017228208,0.00006455658,0.0000031965496],"category_scores_gemma":[0.0026250896,0.00010442105,0.00015390602,0.0013570098,0.00024883822,0.0009675659,0.0001288684,0.00035648898,8.42878e-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.00011826994,0.000075994256,0.00009163472,0.000005699532,0.0000013027452,0.000042040083,0.0004916977,0.00012442273,0.9770413,0.0026694303,0.00010780847,0.019230373],"study_design_scores_gemma":[0.00022092095,0.00083859713,0.037833963,0.000036250665,0.000003977009,0.00024992935,0.000037066242,0.0037834682,0.9469933,0.0040048296,0.005864654,0.00013306468],"about_ca_topic_score_codex":0.0000018169799,"about_ca_topic_score_gemma":3.8946726e-7,"teacher_disagreement_score":0.3413762,"about_ca_system_score_codex":0.000042425207,"about_ca_system_score_gemma":0.000346927,"threshold_uncertainty_score":0.679178},"labels":[],"label_agreement":null},{"id":"W1981432997","doi":"10.1109/isccsp.2010.5463480","title":"Fast method to detect specific frequencies in monitored signal","year":2010,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fast Fourier transform; Computer science; Split-radix FFT algorithm; SIGNAL (programming language); Computation; Algorithm; Speedup; Signal processing; Discrete Fourier transform (general); Digital signal processing; Parallel computing; Multidimensional signal processing; Prime-factor FFT algorithm; Fourier transform; Rader's FFT algorithm; Computational complexity theory; Short-time Fourier transform; Computer hardware; Mathematics; Fourier analysis","score_opus":0.021360402610083932,"score_gpt":0.29916781257973507,"score_spread":0.27780740996965114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981432997","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.026018796,0.000008277705,0.96232706,0.0009509873,0.0001240609,0.00017042422,5.1938946e-7,0.00040292065,0.009996955],"genre_scores_gemma":[0.33737415,9.4889276e-7,0.6619497,0.000378947,0.000037858845,0.000020506495,2.1419976e-7,0.0000046479704,0.00023304594],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990035,0.00009687392,0.00019187316,0.0003039149,0.00020583277,0.0001979596],"domain_scores_gemma":[0.9992824,0.000106759755,0.00003114395,0.00043028026,0.0000605227,0.00008886696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007025701,0.00010086639,0.000116134324,0.00025261444,0.000039931238,0.00019683164,0.0007492013,0.00007714067,0.00007440662],"category_scores_gemma":[0.000020501511,0.000089507244,0.000035251185,0.000529228,0.000018929557,0.00034906188,0.00014650564,0.00025413017,0.00011387631],"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.000004229575,0.00002935594,0.000501924,0.0000022390175,0.0000029148819,0.000011361563,0.0020144454,0.00012338498,0.63220114,0.12705623,0.0018951567,0.23615764],"study_design_scores_gemma":[0.00013866971,0.00009875192,0.006767025,0.000006664451,5.6618114e-7,0.000013484726,0.000063911335,0.0058176257,0.94806486,0.02121096,0.017561652,0.00025583577],"about_ca_topic_score_codex":0.000094899144,"about_ca_topic_score_gemma":0.00016673947,"teacher_disagreement_score":0.31586373,"about_ca_system_score_codex":0.000022258631,"about_ca_system_score_gemma":0.000042536692,"threshold_uncertainty_score":0.36499995},"labels":[],"label_agreement":null},{"id":"W1982273624","doi":"10.1109/jbhi.2014.2346493","title":"EEG Compression of Scalp Recordings based on Dipole Fitting","year":2014,"lang":"en","type":"article","venue":"IEEE Journal of Biomedical and Health Informatics","topic":"Blind Source Separation 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":"Electroencephalography; Lossless compression; Computer science; Data compression; Compression (physics); Artificial intelligence; Smoothness; Inverse problem; Pattern recognition (psychology); Dipole; Algorithm; Speech recognition; Mathematics; Physics; Mathematical analysis","score_opus":0.02538134216827222,"score_gpt":0.31347674311968243,"score_spread":0.28809540095141023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982273624","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.022311121,0.000024166717,0.9684043,0.008378493,0.00026036514,0.00006264969,0.0000011409057,0.00002505102,0.0005327394],"genre_scores_gemma":[0.7660961,0.000064036016,0.22645445,0.0072881435,0.00008320198,6.061207e-7,7.8060594e-7,0.0000033503652,0.000009332241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981628,0.00007678629,0.0010876607,0.000042512205,0.00048395814,0.0001462623],"domain_scores_gemma":[0.99820083,0.00019733253,0.0011041773,0.00013246611,0.00011760407,0.00024757365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027529683,0.000072665185,0.00026393367,0.0002466784,0.00008614515,0.000041188447,0.00029291483,0.00006912097,0.0000037454504],"category_scores_gemma":[0.000094506446,0.0000501028,0.000046029723,0.0001796331,0.00007229651,0.00028897318,0.000038721526,0.00026119626,0.0000021413127],"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.000046348,0.00028779195,0.00070412504,0.00088071625,0.000014269825,0.0000014950193,0.00561633,0.00023765817,0.0002609441,0.0055501885,0.03677621,0.94962394],"study_design_scores_gemma":[0.0011255132,0.0028966423,0.0023218766,0.0013486913,0.0000044744024,0.000040950712,0.00012408353,0.9407193,0.0017226948,0.0022431847,0.047324438,0.00012811425],"about_ca_topic_score_codex":0.000008172384,"about_ca_topic_score_gemma":3.107324e-7,"teacher_disagreement_score":0.9494958,"about_ca_system_score_codex":0.000024567064,"about_ca_system_score_gemma":0.00016078929,"threshold_uncertainty_score":0.2043133},"labels":[],"label_agreement":null},{"id":"W1982530805","doi":"10.4236/ijcns.2010.36070","title":"Nonlinear Blind Equalizers: NCMA and NMCMA","year":2010,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Blind Source Separation 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":"University of Calgary","funders":"","keywords":"Nonlinear system; Quadrature amplitude modulation; Constant (computer programming); Mathematics; Algorithm; Mean squared error; Modulus; Square (algebra); Control theory (sociology); Mathematical optimization; Applied mathematics; Computer science; Bit error rate; Statistics; Geometry; Artificial intelligence; Physics","score_opus":0.04025263552881538,"score_gpt":0.3457636567280029,"score_spread":0.30551102119918755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982530805","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.28022572,0.004864387,0.6314419,0.043546557,0.0034540754,0.00039331784,0.000007457822,0.00023396446,0.035832614],"genre_scores_gemma":[0.77542764,0.00035471222,0.22380537,0.00022244072,0.00016167195,0.0000026155928,6.300133e-7,0.000002435987,0.000022482165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868464,0.00018090791,0.0004587599,0.00012799137,0.00043771745,0.00011000298],"domain_scores_gemma":[0.9981981,0.00041091387,0.00044259746,0.0003986082,0.00046566813,0.00008412112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024964463,0.000079901874,0.0001426912,0.00019964881,0.00029182466,0.00063403416,0.0025832492,0.00005186019,0.000002657825],"category_scores_gemma":[0.00007482257,0.00006330211,0.000042219417,0.00027148685,0.00035966624,0.000872324,0.000522129,0.00027039635,0.0000020854136],"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.000009327798,0.000052170348,0.002291989,0.0000041726826,0.000038207116,0.000003976456,0.0011244115,0.00009915351,0.00031494052,0.9723507,0.0005360608,0.023174888],"study_design_scores_gemma":[0.002604636,0.0008295381,0.007885812,0.0008270696,0.00005135557,0.004996105,0.0031457513,0.68575466,0.00077897275,0.061560493,0.23073575,0.000829865],"about_ca_topic_score_codex":0.00001522851,"about_ca_topic_score_gemma":0.000040133396,"teacher_disagreement_score":0.9107902,"about_ca_system_score_codex":0.0000135557275,"about_ca_system_score_gemma":0.00012631423,"threshold_uncertainty_score":0.6114006},"labels":[],"label_agreement":null},{"id":"W1983085277","doi":"10.1002/nla.642","title":"A twisted factorization method for symmetric SVD of a complex symmetric tridiagonal matrix","year":2009,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Tridiagonal matrix; Orthogonality; Singular value decomposition; Mathematics; Matrix decomposition; QR decomposition; Singular value; Factorization; FLOPS; Matrix (chemical analysis); Divide and conquer algorithms; Symmetric matrix; Applied mathematics; Incomplete LU factorization; Algebra over a field; Algorithm; Pure mathematics; Computer science; Parallel computing; Geometry","score_opus":0.02501987492455005,"score_gpt":0.33267217644731356,"score_spread":0.3076523015227635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983085277","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.000118157324,0.00006731683,0.9953083,0.001753257,0.000015603106,0.0014658553,0.000041395073,0.00045165248,0.000778486],"genre_scores_gemma":[0.3175755,0.0000062288177,0.68133324,0.00049293105,0.00005470637,0.00036583294,0.00009566141,0.000014158492,0.00006174118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981656,0.00010870458,0.00052591535,0.0005053128,0.00042243354,0.0002720276],"domain_scores_gemma":[0.9977777,0.0005855852,0.0003635708,0.0006339325,0.00048264526,0.00015656155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036756528,0.00020644687,0.00036950814,0.0006139181,0.00013742979,0.00007510364,0.0007205276,0.0001132266,0.000011337491],"category_scores_gemma":[0.0001399926,0.00017920272,0.00012677845,0.00533415,0.00003976561,0.00025444038,0.000051008377,0.00016511836,0.000016566268],"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.000030295521,0.00040087706,0.000058335383,0.000018795887,0.000026352622,2.5223204e-7,0.00010484367,0.00033709942,0.0014942,0.9176541,0.00038820202,0.079486646],"study_design_scores_gemma":[0.0018404116,0.0017881984,0.008089424,0.000021969574,0.00009815367,0.000032056825,0.000025649217,0.82252276,0.016721614,0.07299253,0.075129904,0.00073729776],"about_ca_topic_score_codex":0.000015564632,"about_ca_topic_score_gemma":6.410773e-7,"teacher_disagreement_score":0.84466153,"about_ca_system_score_codex":0.00005977974,"about_ca_system_score_gemma":0.0001474642,"threshold_uncertainty_score":0.7307675},"labels":[],"label_agreement":null},{"id":"W1984165891","doi":"10.1088/0031-9155/52/3/016","title":"Searching for the best model: ambiguity of inverse solutions and application to fetal magnetoencephalography","year":2007,"lang":"en","type":"article","venue":"Physics in Medicine and Biology","topic":"Blind Source Separation Techniques","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":"Welichem Biotech (Canada)","funders":"National Institute of Biomedical Imaging and Bioengineering; National Institute of Neurological Disorders and Stroke; National Institutes of Health","keywords":"Ambiguity; Magnetoencephalography; Physics; Position (finance); Noise (video); Orientation (vector space); Inverse problem; Fetus; Interference (communication); Computer science; Mathematics; Mathematical analysis; Artificial intelligence; Psychology; Neuroscience; Geometry; Biology; Telecommunications; Electroencephalography","score_opus":0.19821661102137902,"score_gpt":0.41587177471950293,"score_spread":0.2176551636981239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984165891","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.035923924,0.00009192507,0.96110094,0.0024157914,0.00001555491,0.00022162385,0.0000014424024,0.000014066084,0.00021475882],"genre_scores_gemma":[0.96302706,0.000082246166,0.036066994,0.00075502746,0.000038967224,0.000023260944,0.0000026542266,0.0000014504938,0.000002342808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996004,0.000023035298,0.00010984473,0.00012851376,0.000035805755,0.00010240948],"domain_scores_gemma":[0.9995594,0.00021530807,0.00003453792,0.00012271978,0.000041677184,0.000026356629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076552137,0.000041375024,0.00008384232,0.00006969275,0.00006131915,0.000003848637,0.00013621271,0.000026414216,8.5004686e-8],"category_scores_gemma":[0.000029886682,0.000027502014,0.000010716902,0.00021308314,0.00019734622,0.000050502138,0.00008466371,0.000067119116,1.00956804e-7],"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.000008973826,0.00003288205,0.0013959984,0.000011073744,0.0000048490147,6.0535626e-8,0.0021790948,0.00042169023,0.016125098,0.717239,0.00009141607,0.26248983],"study_design_scores_gemma":[0.00032708305,0.0004448588,0.0025111935,0.000016666469,0.00000861184,0.0000017753264,0.0003490529,0.5948983,0.0011442407,0.3993863,0.0008352108,0.00007670266],"about_ca_topic_score_codex":0.00018996398,"about_ca_topic_score_gemma":0.00015484366,"teacher_disagreement_score":0.92710316,"about_ca_system_score_codex":0.0000038234775,"about_ca_system_score_gemma":0.000010648568,"threshold_uncertainty_score":0.11214996},"labels":[],"label_agreement":null},{"id":"W1984363480","doi":"10.1109/tcomm.2013.042313.120629","title":"Fourth-Order Statistics for Blind Classification of Spatial Multiplexing and Alamouti Space-Time Block Code Signals","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Defence Research and Development Canada; Memorial University of Newfoundland","funders":"","keywords":"Space–time block code; Block code; Algorithm; Fading; Spatial multiplexing; Nakagami distribution; Multiplexing; Computer science; Orthogonal frequency-division multiplexing; Antenna (radio); Electronic engineering; Channel (broadcasting); Telecommunications; MIMO; Decoding methods; Engineering","score_opus":0.056353214200314555,"score_gpt":0.31224299428634233,"score_spread":0.2558897800860278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984363480","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.0025123402,0.000031601074,0.99112934,0.0045324396,0.000054391436,0.0010448613,0.00020026653,0.00020696581,0.00028779425],"genre_scores_gemma":[0.5783812,0.00007511611,0.4209163,0.00007274154,0.000005983357,0.00030807895,0.000017839335,0.000013351587,0.00020939595],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986992,0.00020670706,0.0004532264,0.00027086723,0.00019244116,0.00017759047],"domain_scores_gemma":[0.9964488,0.0011420443,0.0002422611,0.0014909283,0.00058841397,0.00008756147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033102653,0.00015839747,0.0002070126,0.0002407322,0.00039467536,0.00014498673,0.0008555331,0.00011463064,0.000032183518],"category_scores_gemma":[0.00004198285,0.00016972372,0.00006270955,0.00030373785,0.00018945268,0.0004333397,0.000015819733,0.00023609208,0.000031735046],"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.0001851829,0.0048073935,0.00019948762,0.00022881739,0.0006742062,6.908135e-7,0.019252729,0.066597916,0.4403114,0.11424007,0.0082325665,0.34526953],"study_design_scores_gemma":[0.0006629036,0.00016194744,0.00052624417,0.00003284119,0.00003065504,0.0000037267544,0.00007591177,0.9650154,0.02840279,0.0036851803,0.0011981722,0.00020423887],"about_ca_topic_score_codex":0.00023097944,"about_ca_topic_score_gemma":0.00029510615,"teacher_disagreement_score":0.8984175,"about_ca_system_score_codex":0.00003771987,"about_ca_system_score_gemma":0.00010257121,"threshold_uncertainty_score":0.6921132},"labels":[],"label_agreement":null},{"id":"W1984505653","doi":"10.1002/acs.1011","title":"Blind identification of sparse Volterra systems","year":2007,"lang":"en","type":"article","venue":"International Journal of Adaptive Control and Signal Processing","topic":"Blind Source Separation 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":"University of Ottawa","funders":"National Natural Science Foundation of China","keywords":"Identifiability; Volterra series; Moment (physics); Independent and identically distributed random variables; Identification (biology); Mathematics; Applied mathematics; Volterra equations; System identification; Order (exchange); Computer science; Control theory (sociology); Algorithm; Nonlinear system; Random variable; Statistics; Artificial intelligence; Physics; Data modeling","score_opus":0.023921447526917612,"score_gpt":0.2911995633237356,"score_spread":0.267278115796818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984505653","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.024607223,0.00092531275,0.97342765,0.00044276108,0.00020278255,0.000076809294,0.0000022801032,0.000016288554,0.00029888892],"genre_scores_gemma":[0.9936417,0.00001629425,0.005998185,0.0001316921,0.00017131209,0.0000011116879,4.479896e-7,0.0000046709843,0.000034625285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842125,0.00006241215,0.00074315135,0.00012067811,0.00055560836,0.00009689819],"domain_scores_gemma":[0.99700934,0.00010353206,0.0010653833,0.0000612482,0.001698288,0.00006218851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017769667,0.0000859138,0.00018333206,0.00034079072,0.00004211061,0.00021249455,0.0004733772,0.00004809664,0.0000017568224],"category_scores_gemma":[0.000052398835,0.00007236951,0.000059503167,0.00011794417,0.000073532356,0.0010426074,0.000038745642,0.00014977503,7.4500036e-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.0015188493,0.00044073147,0.0016651992,0.00005774566,0.0004890282,0.00017166701,0.0060729985,0.004206144,0.31966868,0.14906685,0.00020566938,0.51643646],"study_design_scores_gemma":[0.0069407723,0.0010656535,0.02430662,0.00090167375,0.00009158575,0.0010517878,0.0013251748,0.88088125,0.061174534,0.02024192,0.0014918387,0.00052720617],"about_ca_topic_score_codex":0.000007559618,"about_ca_topic_score_gemma":0.0000013266787,"teacher_disagreement_score":0.96903443,"about_ca_system_score_codex":0.000040096613,"about_ca_system_score_gemma":0.00011188329,"threshold_uncertainty_score":0.2951143},"labels":[],"label_agreement":null},{"id":"W1985307702","doi":"10.3389/fninf.2013.00053","title":"Mutual information spectrum for selection of event-related spatial components. Application to eloquent motor cortex mapping","year":2014,"lang":"en","type":"article","venue":"Frontiers in Neuroinformatics","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":"Montreal Neurological Institute and Hospital; McGill University","funders":"National Research University Higher School of Economics; Saint Petersburg State University; Russian Foundation for Basic Research","keywords":"Neuroscience; Selection (genetic algorithm); Event (particle physics); Cortex (anatomy); Motor cortex; Computer science; Cartography; Artificial intelligence; Psychology; Geography; Physics","score_opus":0.00627149216343273,"score_gpt":0.2185204637710621,"score_spread":0.21224897160762937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985307702","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.024318106,0.0000023484695,0.97284675,0.00031875886,0.0005075615,0.0012268092,0.0000068052714,0.00018123112,0.0005916076],"genre_scores_gemma":[0.76838964,0.000004851062,0.23091567,0.00047780373,0.000019496918,0.00010628808,0.00005282141,0.000008434089,0.000024992927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984312,0.00006026837,0.00086004904,0.0001351314,0.00028864652,0.00022468816],"domain_scores_gemma":[0.999014,0.000048650178,0.00044704555,0.0003188067,0.000100796344,0.00007068181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005575885,0.00014035954,0.00022315528,0.0005862057,0.00006915335,0.000082047,0.00043989424,0.000088781075,0.0000012473596],"category_scores_gemma":[0.00009241569,0.00015546013,0.00006286135,0.0005398486,0.000021143609,0.0011030481,0.00009080312,0.00014124755,0.000014468481],"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.00038998472,0.00063961174,0.0100184735,0.00088190846,0.00014105407,6.225394e-7,0.050349455,0.04855657,0.009829382,0.22011141,0.02898341,0.6300981],"study_design_scores_gemma":[0.0004977596,0.00025816436,0.011534736,0.000025478985,0.0000038944245,0.0000028332186,0.000094294846,0.9698384,0.0025120082,0.0023284713,0.01275243,0.0001515487],"about_ca_topic_score_codex":0.00003116132,"about_ca_topic_score_gemma":0.000006573434,"teacher_disagreement_score":0.9212818,"about_ca_system_score_codex":0.00010577406,"about_ca_system_score_gemma":0.000047451744,"threshold_uncertainty_score":0.633948},"labels":[],"label_agreement":null},{"id":"W1985317697","doi":"10.1016/j.jmva.2013.05.003","title":"On the convergence of the spectrum of finite order approximations of stationary time series","year":2013,"lang":"en","type":"article","venue":"Journal of Multivariate Analysis","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Autoregressive model; Series (stratigraphy); Covariance; Approximations of π; Convergence (economics); Applied mathematics; Stationary process; Spectral density; Spectrum (functional analysis); Sequence (biology); Mathematical analysis; Statistics","score_opus":0.010142134630861662,"score_gpt":0.24113395553761507,"score_spread":0.2309918209067534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985317697","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.15674375,0.000022430238,0.8359456,0.0065676332,0.00004478776,0.00017041332,0.000009918437,0.000009662174,0.00048579],"genre_scores_gemma":[0.961348,0.000015669097,0.03829079,0.000106850006,0.000007883545,0.00000299172,9.102021e-7,0.0000032669354,0.00022366129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984497,0.0002904762,0.00066113134,0.00008372613,0.00044035853,0.00007460193],"domain_scores_gemma":[0.9968782,0.00057451986,0.0013562959,0.0004079656,0.00075877947,0.00002425502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069841614,0.000077822224,0.00027955387,0.00028186824,0.00005639705,0.00002456584,0.0007245632,0.000035210833,0.00025910255],"category_scores_gemma":[0.00035545492,0.000041814154,0.00024970397,0.0015556612,0.000097246964,0.00044561044,0.000088149325,0.00013128956,0.000004831073],"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.00012033901,0.0013947259,0.010133019,0.000084080944,0.0061312374,0.000002702531,0.025076559,0.30913648,0.0737133,0.5683729,0.0035824825,0.0022521731],"study_design_scores_gemma":[0.00037857133,0.00031783266,0.089347966,0.00008173925,0.00047916037,0.000004946471,0.00037978013,0.7346843,0.11223622,0.06181221,0.000117410375,0.00015986575],"about_ca_topic_score_codex":0.000111509326,"about_ca_topic_score_gemma":0.0000070723127,"teacher_disagreement_score":0.80460423,"about_ca_system_score_codex":0.000014013555,"about_ca_system_score_gemma":0.00010573452,"threshold_uncertainty_score":0.28369913},"labels":[],"label_agreement":null},{"id":"W1985818583","doi":"10.1155/asp/2006/45217","title":"An Automated Video Object Extraction System Based on Spatiotemporal Independent Component Analysis and Multiscale Segmentation","year":2006,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Blind Source Separation Techniques","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Artificial intelligence; Segmentation; Computer vision; Independent component analysis; Video tracking; Image segmentation; Object (grammar); Component (thermodynamics); Video processing; Image processing; Wavelet; Pattern recognition (psychology); Image (mathematics)","score_opus":0.01011532520667923,"score_gpt":0.3190834848886604,"score_spread":0.30896815968198116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985818583","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.19187069,0.00020397395,0.80687714,0.00011937528,0.00007206009,0.00016262855,0.0000014687123,0.0004001599,0.00029249868],"genre_scores_gemma":[0.93382883,0.000011904715,0.065899886,0.000151048,0.0000653777,0.0000122022475,0.000012851437,0.000012931668,0.0000049444175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975625,0.00047159268,0.000614455,0.0004150992,0.00071613153,0.00022018394],"domain_scores_gemma":[0.99882734,0.00012300564,0.0006461373,0.00016955422,0.00013802304,0.000095931966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001053197,0.00020906756,0.00026773682,0.00094969664,0.00030897255,0.0006795649,0.00027004717,0.00007720178,0.00000437462],"category_scores_gemma":[0.000010936014,0.00018756365,0.00006544219,0.0009318616,0.00003564182,0.0026532977,0.000018119263,0.00040468614,0.0000022698848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017676907,0.00054362457,0.023825115,0.00008181773,0.000019951103,0.00012645224,0.00045302472,0.78998464,0.013515336,0.0004701048,0.000012699042,0.17079045],"study_design_scores_gemma":[0.0006203533,0.00031085487,0.041288763,0.00022793155,0.00002190855,0.000048992562,0.00013841229,0.93918085,0.017732227,0.00019458108,0.00003108412,0.00020401273],"about_ca_topic_score_codex":0.000031676904,"about_ca_topic_score_gemma":0.000061886465,"teacher_disagreement_score":0.74195814,"about_ca_system_score_codex":0.00032039027,"about_ca_system_score_gemma":0.000075406766,"threshold_uncertainty_score":0.76486236},"labels":[],"label_agreement":null},{"id":"W1986023670","doi":"10.1177/1077546314544349","title":"Independent component analysis as applied to vibration source separation and fault diagnosis","year":2014,"lang":"en","type":"article","venue":"Journal of Vibration and Control","topic":"Blind Source Separation Techniques","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":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Independent component analysis; Accelerometer; Blind signal separation; Component (thermodynamics); Vibration; Computer science; Ambiguity; Fault (geology); Source separation; Separation (statistics); Workaround; Fault detection and isolation; Principal component analysis; Engineering; Acoustics; Algorithm; Artificial intelligence; Telecommunications; Physics; Actuator; Machine learning","score_opus":0.006501880835244199,"score_gpt":0.25574136784390633,"score_spread":0.24923948700866214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986023670","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.12535107,0.000039135553,0.868524,0.0055436995,0.000044467015,0.00020101995,6.424036e-7,0.00003972219,0.00025623335],"genre_scores_gemma":[0.98321205,0.000031174914,0.011830265,0.004794864,0.000077175595,0.000023329976,0.0000026151995,0.00000537148,0.000023129693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862903,0.0001950706,0.00048076504,0.0001995348,0.00038815514,0.000107435284],"domain_scores_gemma":[0.9989051,0.0001599947,0.00040808666,0.00016863535,0.00019227553,0.00016586873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008765495,0.00012121416,0.00029342872,0.00044756453,0.00012548151,0.00047512652,0.0001759141,0.00007594605,0.000011390238],"category_scores_gemma":[0.000073860356,0.00010567122,0.000072337636,0.00035964802,0.000018084456,0.0006884293,0.00004240009,0.0001304739,0.0000057910233],"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.0007448791,0.0007584645,0.022170423,0.000050775318,0.0015101089,0.000009760554,0.018484201,0.08482071,0.18186887,0.35504106,0.002517827,0.33202294],"study_design_scores_gemma":[0.0038158493,0.0015233452,0.08471518,0.000034867382,0.00046283027,0.000062986815,0.00027960612,0.85441077,0.034302488,0.007278624,0.012558132,0.0005553151],"about_ca_topic_score_codex":0.0000117057325,"about_ca_topic_score_gemma":0.000026052012,"teacher_disagreement_score":0.857861,"about_ca_system_score_codex":0.0000257616,"about_ca_system_score_gemma":0.00003544934,"threshold_uncertainty_score":0.4581656},"labels":[],"label_agreement":null},{"id":"W1986313574","doi":"10.1016/j.jmva.2010.02.006","title":"Autoregressive frequency detection using Regularized Least Squares","year":2010,"lang":"en","type":"article","venue":"Journal of Multivariate Analysis","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Autoregressive model; Mathematics; Regularization (linguistics); Mathematical optimization; Algorithm; Applied mathematics; Model selection; Noise (video); Least-squares function approximation; Statistics; Computer science; Artificial intelligence","score_opus":0.014912506618517313,"score_gpt":0.2957236742894541,"score_spread":0.28081116767093683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986313574","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.31150523,0.000018882416,0.6878273,0.0002477299,0.0002096911,0.000042508385,6.814834e-7,0.00005167069,0.000096330776],"genre_scores_gemma":[0.72926706,0.0000034255818,0.27053437,0.000056778037,0.00010151885,0.0000010060422,5.236952e-7,0.000006518627,0.0000288094],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825376,0.00025553594,0.0006250923,0.00021421649,0.00047604015,0.00017534292],"domain_scores_gemma":[0.9974877,0.00010547991,0.001119104,0.00045482814,0.00071140134,0.00012143626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011681062,0.00014789362,0.00039851086,0.0010476841,0.0001526824,0.00026230735,0.0006818311,0.00014725314,0.00003541998],"category_scores_gemma":[0.00029750506,0.000118818854,0.0004623813,0.0012150488,0.000043441138,0.0011071628,0.00008006403,0.00054511847,0.0000031893087],"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.000024799634,0.00013140187,0.0022246493,0.000004325795,0.00114311,0.000048208865,0.0017161376,0.003080633,0.97549117,0.0066576395,0.000012037884,0.009465911],"study_design_scores_gemma":[0.0008980907,0.00015776297,0.032935597,0.000029641185,0.0010493015,0.00015701703,0.00007383199,0.8264658,0.12857452,0.008993339,0.00031424835,0.00035084263],"about_ca_topic_score_codex":0.0002766981,"about_ca_topic_score_gemma":0.00017756289,"teacher_disagreement_score":0.8469166,"about_ca_system_score_codex":0.00006111218,"about_ca_system_score_gemma":0.00013399581,"threshold_uncertainty_score":0.48452923},"labels":[],"label_agreement":null},{"id":"W1987469742","doi":"10.1109/ccece.2010.5575256","title":"Iterative blind linear equalization in time-varying dispersive channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Simon Fraser University","funders":"","keywords":"Blind equalization; Fading; Channel (broadcasting); Rayleigh fading; Computer science; Kalman filter; Equalization (audio); Algorithm; Minimum mean square error; Transmission (telecommunications); Control theory (sociology); Mathematics; Telecommunications; Statistics; Artificial intelligence","score_opus":0.020673244648556233,"score_gpt":0.2980702004550069,"score_spread":0.27739695580645063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987469742","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.093010254,0.000003796685,0.8961133,0.0011984039,0.00015404128,0.00024898897,6.8588804e-7,0.00028804864,0.008982493],"genre_scores_gemma":[0.91225517,0.0000020349457,0.08518399,0.0010622831,0.00006600748,0.000020986425,0.00000966461,0.000007862464,0.0013920298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991368,0.00007343667,0.00018828828,0.000260605,0.00019193858,0.00014891558],"domain_scores_gemma":[0.99944186,0.000079734695,0.000060156384,0.0002754924,0.000093748444,0.0000490276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037946014,0.000095321644,0.00010247481,0.00020846997,0.000055165194,0.00020486045,0.00045720203,0.00008944293,0.00010999347],"category_scores_gemma":[0.00007205698,0.000086398344,0.000028197575,0.00045791198,0.000024288502,0.00085528876,0.00014854,0.00020668114,0.00012212688],"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.000034376502,0.00038366983,0.0018232493,0.000013382599,0.000020491532,0.000022220518,0.038650874,0.0014504851,0.13146211,0.8159169,0.001967523,0.008254707],"study_design_scores_gemma":[0.0005044829,0.00007285338,0.00016340718,0.000016926579,0.0000013155833,0.0000056651725,0.000029849107,0.8254316,0.16511837,0.00649403,0.0019162955,0.00024522687],"about_ca_topic_score_codex":0.000019193467,"about_ca_topic_score_gemma":0.000024520932,"teacher_disagreement_score":0.8239811,"about_ca_system_score_codex":0.000014849312,"about_ca_system_score_gemma":0.000037431757,"threshold_uncertainty_score":0.35232222},"labels":[],"label_agreement":null},{"id":"W1988119425","doi":"10.4028/www.scientific.net/amm.229-231.1919","title":"Adaptive Time Delay Estimation Based on Robust Cyclic Correlation Estimator","year":2012,"lang":"en","type":"article","venue":"Applied Mechanics and Materials","topic":"Blind Source Separation Techniques","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":"National Natural Science Foundation of China; Canadian Centre for Applied Research in Cancer Control","keywords":"Estimator; Robustness (evolution); Correlation; Mathematics; Algorithm; Computer science; Control theory (sociology); Robust statistics; Statistics; Artificial intelligence","score_opus":0.01498499556555522,"score_gpt":0.22638618590165202,"score_spread":0.2114011903360968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988119425","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.004083396,0.0000071769377,0.99369824,0.0001260802,0.00019226485,0.00038065476,0.0000071470863,0.00030218388,0.0012028338],"genre_scores_gemma":[0.65531045,0.0000020900313,0.34413233,0.00041241047,0.000028064891,0.000063843065,0.000022310232,0.000011164186,0.00001732574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913126,0.00005739262,0.0002132839,0.0002228463,0.00017821921,0.00019698689],"domain_scores_gemma":[0.9993884,0.00007621172,0.00014935702,0.00026977086,0.000030499277,0.000085735126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006825637,0.00014353845,0.00016624879,0.00009617308,0.00011299358,0.0001447473,0.00015289205,0.00011082684,0.00003561489],"category_scores_gemma":[0.000019922645,0.00013408427,0.000016631306,0.00010770296,0.000006959133,0.0003155869,0.00007098931,0.000055724646,0.00014801185],"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.000018624578,0.000043440465,2.94036e-7,0.0000055834093,0.0000038522917,2.7654224e-7,0.00015140361,0.0015198122,0.016260585,0.9789774,0.00022331976,0.0027954138],"study_design_scores_gemma":[0.00031872775,0.00011115345,0.000042144922,0.00002230101,0.000013787162,0.0000049791643,0.000008910679,0.83766073,0.10317363,0.05816168,0.00023976434,0.00024218866],"about_ca_topic_score_codex":0.0000038826875,"about_ca_topic_score_gemma":1.6969747e-7,"teacher_disagreement_score":0.9208157,"about_ca_system_score_codex":0.000029841336,"about_ca_system_score_gemma":0.000024043014,"threshold_uncertainty_score":0.5467798},"labels":[],"label_agreement":null},{"id":"W1990028708","doi":"10.1109/pho.2011.6110494","title":"Ultrafast all-optical wavelet transform based on temporal pulse shaping","year":2011,"lang":"en","type":"article","venue":"","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":"University of Ottawa","funders":"","keywords":"Ultrashort pulse; Wavelet transform; Wavelet; Computer science; Broadband; Harmonic wavelet transform; Electronic engineering; Pulse (music); Discrete wavelet transform; SIGNAL (programming language); Second-generation wavelet transform; Optics; Artificial intelligence; Physics; Telecommunications; Engineering; Laser","score_opus":0.07289660391292964,"score_gpt":0.27572455691413705,"score_spread":0.20282795300120743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990028708","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.0054608546,9.2244346e-7,0.7832646,0.0020303056,0.000045504214,0.00016428679,6.8021e-7,0.0006764928,0.20835641],"genre_scores_gemma":[0.81234765,9.382916e-7,0.18256791,0.004827785,0.00001608981,0.00001632415,0.0000034040443,0.000008915413,0.00021099465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988571,0.000043162305,0.00022794849,0.00032623997,0.00028456416,0.00026100545],"domain_scores_gemma":[0.99930924,0.00005148236,0.000033446475,0.0004331029,0.00004676571,0.00012596224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039482853,0.00014219714,0.00012887905,0.00013231592,0.00005680385,0.00009714433,0.00059499446,0.00008967164,0.00026958936],"category_scores_gemma":[0.000015575279,0.00011770395,0.00007953507,0.00019322304,0.00004124079,0.00041995526,0.000028417566,0.00017793715,0.000113210546],"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.00007820005,0.0008969759,0.0007681072,0.000024671497,0.000030972227,0.000062326406,0.005803807,0.000039237035,0.0032679702,0.89906,0.0019845115,0.08798319],"study_design_scores_gemma":[0.0007858442,0.000909616,0.0043306723,0.000038221297,0.000008370417,0.000017942733,0.00004910229,0.30801663,0.67113894,0.008828993,0.00525414,0.0006215138],"about_ca_topic_score_codex":0.00004866462,"about_ca_topic_score_gemma":0.000026980895,"teacher_disagreement_score":0.890231,"about_ca_system_score_codex":0.000027576913,"about_ca_system_score_gemma":0.00005997903,"threshold_uncertainty_score":0.47998276},"labels":[],"label_agreement":null},{"id":"W1990822679","doi":"10.1109/dcc.2013.68","title":"Real-Time Compression of Intra-Cerebral EEG Using Eigendecomposition with Dynamic Dictionary","year":2013,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McGill University","funders":"","keywords":"Computer science; Eigendecomposition of a matrix; Electroencephalography; Distortion (music); Compression (physics); Speech recognition; Data compression; Eigenvalues and eigenvectors; Artificial intelligence; Stability (learning theory); Pattern recognition (psychology); Algorithm; Machine learning; Neuroscience; Bandwidth (computing)","score_opus":0.008576714086015933,"score_gpt":0.24992368422957734,"score_spread":0.2413469701435614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990822679","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.3764648,0.0000034972527,0.61646116,0.00020230356,0.000023474515,0.000180555,8.1098364e-7,0.00030004972,0.006363312],"genre_scores_gemma":[0.69189847,0.0000033539905,0.30787614,0.00007002034,0.000005076494,0.0000073590763,0.0000073229044,0.000006121974,0.00012614226],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991499,0.00007969421,0.00020822902,0.00021488323,0.00021961266,0.00012767354],"domain_scores_gemma":[0.99934286,0.00003406431,0.00011831743,0.0003253735,0.00012667014,0.00005271827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000103770064,0.000098839744,0.00012659637,0.0001286672,0.00007703177,0.00006895039,0.0002773306,0.000055799905,0.00016925191],"category_scores_gemma":[0.0000017451275,0.00007643291,0.000030353727,0.00021985764,0.000043660766,0.00091618253,0.00009597781,0.00007606549,0.00003448797],"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.000022363,0.00027023477,0.0012528077,0.000024409639,0.000037231046,0.000002780677,0.0009404267,0.0026308189,0.94982696,0.031004418,0.0015791117,0.012408424],"study_design_scores_gemma":[0.00020671896,0.00019060523,0.016380494,0.000048808135,0.000004461164,0.00003216043,0.000024649264,0.9380894,0.041000396,0.003857712,0.000016351572,0.00014825835],"about_ca_topic_score_codex":0.00028202336,"about_ca_topic_score_gemma":0.0000034771097,"teacher_disagreement_score":0.93545854,"about_ca_system_score_codex":0.00004548719,"about_ca_system_score_gemma":0.000045470668,"threshold_uncertainty_score":0.31168437},"labels":[],"label_agreement":null},{"id":"W1991384011","doi":"10.1109/ccece.2008.4564858","title":"An algorithm for the identification of autoregressive moving average systems from noisy observations","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Autoregressive–moving-average model; Autoregressive model; Noise (video); Autocorrelation; Residual; Algorithm; Estimation theory; System identification; Moving average; Mathematics; Computer science; Least-squares function approximation; SIGNAL (programming language); Statistics; Artificial intelligence; Data modeling; Estimator","score_opus":0.028867186577853914,"score_gpt":0.2238233891140005,"score_spread":0.19495620253614657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991384011","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.023704985,0.000091712245,0.97485733,0.0005110264,0.00015481796,0.00043197576,0.000025565516,0.00018098287,0.000041629726],"genre_scores_gemma":[0.9673848,0.00006469262,0.03207973,0.0001676674,0.00010731781,0.00013616306,0.000013492119,0.000013415724,0.000032707896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985921,0.000015224401,0.00038731025,0.00044715375,0.00022680538,0.00033141175],"domain_scores_gemma":[0.9985792,0.00016589215,0.00017817107,0.00023869444,0.00059045735,0.00024760506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021865542,0.00020695245,0.00024055675,0.00024822142,0.0002708653,0.00047372153,0.0007984527,0.0001159907,0.0000019778674],"category_scores_gemma":[0.00004663657,0.00017900842,0.000043789092,0.00032654728,0.000051406772,0.00060268753,0.00004363365,0.00023896887,0.0000012234641],"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.00000644609,0.00007180165,0.0007466293,0.000042098476,0.00008149835,0.000007139873,0.0055192383,0.0037680701,0.007614354,0.8529286,0.00042968418,0.12878448],"study_design_scores_gemma":[0.00013539965,0.00014700498,0.007810807,0.00005263275,0.000007631232,0.00001207454,0.000022005142,0.9888183,0.0015172486,0.00090994645,0.00035677175,0.00021021372],"about_ca_topic_score_codex":0.0029789796,"about_ca_topic_score_gemma":0.00014489495,"teacher_disagreement_score":0.9850502,"about_ca_system_score_codex":0.000082241604,"about_ca_system_score_gemma":0.0003934983,"threshold_uncertainty_score":0.72997516},"labels":[],"label_agreement":null},{"id":"W1991461753","doi":"10.1016/j.neunet.2004.08.002","title":"Complex-valued neural networks for nonlinear complex principal component analysis","year":2004,"lang":"en","type":"article","venue":"Neural Networks","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"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":"Principal component analysis; Nonlinear system; Artificial neural network; Pattern recognition (psychology); Independent component analysis; Data set; Artificial intelligence; Dimensionality reduction; Feature extraction; Mathematics; Dimension (graph theory); Algorithm; Computer science","score_opus":0.04677720759505942,"score_gpt":0.3059106745926465,"score_spread":0.25913346699758705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991461753","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.031096896,0.00009385376,0.9639016,0.0024061385,0.00040336527,0.00089119555,0.00001531416,0.0010146437,0.00017703789],"genre_scores_gemma":[0.8586335,0.00001029493,0.13579595,0.0045707654,0.00047707258,0.00008723722,0.0003529997,0.00003716961,0.000034985445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672675,0.00023549187,0.00077560754,0.0008954645,0.00048677492,0.00087993284],"domain_scores_gemma":[0.9978133,0.00021586944,0.00035249558,0.001072376,0.00024606645,0.00029987926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005538044,0.00045159264,0.000703224,0.00029452232,0.0004439256,0.00047048958,0.0015446079,0.00023487436,0.000028032755],"category_scores_gemma":[0.000024740368,0.00043206906,0.0005789666,0.0016303154,0.00014597224,0.0004929389,0.00047095394,0.00054886256,0.000005675279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004440137,0.00013128176,0.00041389815,0.0000057127386,0.00014086883,0.000011194406,0.00013910308,0.9805681,0.000051300907,0.012997904,0.00096293807,0.0045332797],"study_design_scores_gemma":[0.0010279855,0.00025189837,0.008002871,0.000007058449,0.00011843824,0.000018761626,0.000007859707,0.98697364,0.000045010052,0.00053680706,0.002556491,0.0004531974],"about_ca_topic_score_codex":0.00007967185,"about_ca_topic_score_gemma":0.00017642097,"teacher_disagreement_score":0.8281056,"about_ca_system_score_codex":0.00011899371,"about_ca_system_score_gemma":0.00003560278,"threshold_uncertainty_score":0.99981314},"labels":[],"label_agreement":null},{"id":"W1992647454","doi":"10.1088/0964-1726/19/2/025005","title":"Wavelet-based blind identification of the UCLA Factor building using ambient and earthquake responses","year":2009,"lang":"en","type":"article","venue":"Smart Materials and Structures","topic":"Blind Source Separation Techniques","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 Waterloo","funders":"","keywords":"Identification (biology); Covariance; Wavelet; SIGNAL (programming language); Wavelet transform; Algorithm; Modal; Computer science; Mathematics; Engineering; Artificial intelligence; Statistics; Materials science","score_opus":0.02403914162013778,"score_gpt":0.2851252795623017,"score_spread":0.26108613794216395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992647454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98053294,0.000038944272,0.01854152,0.0005042079,0.00015607459,0.00016406272,0.000017169566,0.000040908595,0.0000041524504],"genre_scores_gemma":[0.9858673,0.0000052866853,0.01386579,0.0002260185,0.00002077554,0.0000014689143,9.969389e-7,0.000003608663,0.000008723485],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99914956,0.0001589843,0.0002520227,0.00019374494,0.0001473057,0.00009836465],"domain_scores_gemma":[0.9994544,0.00003402095,0.00017173086,0.00026496503,0.00004761012,0.000027303899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002770134,0.00009285326,0.000130942,0.000075298485,0.00013885455,0.00028340466,0.00018353121,0.000055500994,0.0000057907923],"category_scores_gemma":[0.00004738421,0.00006421189,0.000020672605,0.00009418979,0.00007138905,0.00015477912,0.00005896571,0.000038582508,1.0748612e-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.000023581168,0.000004692189,0.00018180514,0.000010047676,0.0000025634045,2.8991994e-7,0.00027950216,0.000008733931,0.97940606,0.017738236,0.000008311898,0.00233615],"study_design_scores_gemma":[0.00012139002,0.000030328105,0.24713314,0.000013119316,0.0000033143378,0.000005120801,0.0000052221258,0.0006127444,0.74312615,0.008794657,0.00009256485,0.00006224465],"about_ca_topic_score_codex":0.00002238919,"about_ca_topic_score_gemma":0.0000027498174,"teacher_disagreement_score":0.24695133,"about_ca_system_score_codex":0.0000070692945,"about_ca_system_score_gemma":0.00003202538,"threshold_uncertainty_score":0.27328777},"labels":[],"label_agreement":null},{"id":"W1993762614","doi":"10.1177/0962280212448974","title":"A Skew-t space-varying regression model for the spectral analysis of resting state brain activity","year":2012,"lang":"en","type":"article","venue":"Statistical Methods in Medical Research","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"University of British Columbia; Down Syndrome Research Foundation; Simon Fraser University; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Skew; Resting state fMRI; Regression analysis; State space; Regression; Mathematics; Computer science; Statistics; Econometrics; Statistical physics; Neuroscience; Psychology; Physics","score_opus":0.2554435893414817,"score_gpt":0.595130034201998,"score_spread":0.33968644486051625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993762614","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.0029031204,0.00009165617,0.98919183,0.006689643,0.00005386885,0.0004046497,0.00001783871,0.000050214767,0.0005971872],"genre_scores_gemma":[0.281153,0.00002817425,0.7184916,0.00012529269,0.000029356424,0.00008269768,0.0000019581032,0.0000086147975,0.000079293306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99153036,0.004883709,0.00046641537,0.0004112985,0.0018864791,0.0008217365],"domain_scores_gemma":[0.93701714,0.061596714,0.000110430476,0.00064853724,0.00024346782,0.00038373127],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.04714418,0.00012726958,0.00041369745,0.0006201415,0.00019612815,0.000075325705,0.0010382168,0.00014363547,0.00006923428],"category_scores_gemma":[0.06441677,0.00008301194,0.00009694139,0.0024647193,0.00048354137,0.00025919912,0.00058117486,0.001185734,0.0000010963217],"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.0000878768,0.00017215215,0.0005924826,0.00004519199,0.00007951612,0.0000058530018,0.0031033691,0.0006209104,0.0019927127,0.37530503,0.00074312114,0.6172518],"study_design_scores_gemma":[0.00016782292,0.000062968036,0.005216758,0.000045926656,0.000018135324,7.878035e-7,0.000030107234,0.88967806,0.0029840376,0.10156412,0.00015154212,0.00007973112],"about_ca_topic_score_codex":0.00019151937,"about_ca_topic_score_gemma":0.00006149491,"teacher_disagreement_score":0.88905716,"about_ca_system_score_codex":0.00010727195,"about_ca_system_score_gemma":0.00038956443,"threshold_uncertainty_score":0.9811656},"labels":[],"label_agreement":null},{"id":"W1993829695","doi":"10.1086/342645","title":"Multiresolution Analysis of Substructure in Dark Matter Halos","year":2002,"lang":"en","type":"article","venue":"The Astrophysical Journal","topic":"Blind Source Separation Techniques","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":"Queen's University","funders":"","keywords":"Halo; Substructure; Astrophysics; Dark matter; Physics; Population; Cluster analysis; Hierarchical clustering; Astronomy; Galaxy; Artificial intelligence; Computer science","score_opus":0.01272477731387269,"score_gpt":0.23870337105175274,"score_spread":0.22597859373788004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993829695","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5576336,0.000019294695,0.4404539,0.0015893298,0.000029705774,0.000040931693,0.0000010950964,0.000018041048,0.00021413865],"genre_scores_gemma":[0.97430587,0.0000047945136,0.025377577,0.00023522237,0.000039629187,0.0000015810822,4.975747e-7,0.0000034184686,0.000031433457],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99903524,0.00018906953,0.00024202336,0.000113157665,0.00027312958,0.00014736093],"domain_scores_gemma":[0.99938774,0.000053525455,0.00015368038,0.00030692166,0.00005661303,0.000041499337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018349846,0.00007635751,0.00017718626,0.00021080128,0.000062903775,0.00008014629,0.00061203353,0.00003120132,0.00005252157],"category_scores_gemma":[0.000010484236,0.000049353588,0.00014574376,0.00089665473,0.000057423298,0.0002597676,0.00007442262,0.00032934148,0.0000202951],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015273697,0.0022370229,0.06966049,0.000025585905,0.0023674648,0.00015132301,0.04324251,0.10574264,0.34286997,0.18126664,0.028306829,0.22397679],"study_design_scores_gemma":[0.00030751104,0.00008621518,0.6015135,0.000014955813,0.00009136255,0.000028992641,0.000033092907,0.38375455,0.0025257443,0.011443952,0.000069450434,0.0001306689],"about_ca_topic_score_codex":0.000013144799,"about_ca_topic_score_gemma":0.000004462471,"teacher_disagreement_score":0.531853,"about_ca_system_score_codex":0.000028254042,"about_ca_system_score_gemma":0.000007737338,"threshold_uncertainty_score":0.2012581},"labels":[],"label_agreement":null},{"id":"W1995209220","doi":"10.1007/s11517-009-0504-6","title":"The optimal linear transformation-based fMRI feature space analysis","year":2009,"lang":"en","type":"article","venue":"Medical & Biological Engineering & Computing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"SickKids Foundation; Hospital for Sick Children; University of Toronto","funders":"","keywords":"Functional magnetic resonance imaging; Artificial intelligence; Pattern recognition (psychology); Feature vector; Computer science; Signature (topology); Cluster analysis; Transformation (genetics); Feature (linguistics); Computer vision; Feature extraction; Mathematics; Neuroscience; Psychology","score_opus":0.009585005801947604,"score_gpt":0.2563440809671029,"score_spread":0.24675907516515533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995209220","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.019466141,0.00014390792,0.9617033,0.017357588,0.00008923464,0.00011782948,5.9845706e-7,0.00079840265,0.00032297938],"genre_scores_gemma":[0.87969595,0.00001271474,0.118745014,0.0014186569,0.00009746931,0.0000033811202,0.000010061553,0.000004090807,0.000012683227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998376,0.00011005853,0.00032511196,0.00032168062,0.0004755144,0.00039161832],"domain_scores_gemma":[0.99867135,0.00064720964,0.0000731786,0.00033843663,0.00006642562,0.00020340277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012973823,0.00019051529,0.00026232417,0.00012612893,0.00023042428,0.00015287865,0.0010096882,0.00023893622,0.000015431506],"category_scores_gemma":[0.00045952777,0.00011698506,0.00020780684,0.0011490154,0.00005379873,0.00009676473,0.00007628541,0.0006044155,0.000014140494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017123333,0.00015097507,0.0006430615,0.000011950889,0.00015430401,0.00003383084,0.00077095313,0.7780026,0.00050408975,0.11058711,0.000721058,0.10840294],"study_design_scores_gemma":[0.00013203222,0.000109200184,0.0064696446,0.0000181087,0.000011108057,0.0000050252793,0.0000064225073,0.9857528,0.0004806792,0.00007589343,0.0067789867,0.0001600635],"about_ca_topic_score_codex":0.0000036493866,"about_ca_topic_score_gemma":7.458404e-7,"teacher_disagreement_score":0.8602298,"about_ca_system_score_codex":0.000034384913,"about_ca_system_score_gemma":0.000054319808,"threshold_uncertainty_score":0.47705123},"labels":[],"label_agreement":null},{"id":"W1995668128","doi":"10.1109/mlsp.2007.4414294","title":"Single Channel Speech Separation using Minimum Mean Square Error Estimation of Sources' Log Spectra","year":2007,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Carleton University","funders":"","keywords":"Minimum mean square error; Estimator; Mean squared error; Binary number; Gaussian; Mathematics; Algorithm; Mixture model; Statistics; Channel (broadcasting); Minimum-variance unbiased estimator; Computer science; Physics; Telecommunications","score_opus":0.04563776900113702,"score_gpt":0.3238050090230323,"score_spread":0.27816724002189525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995668128","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.29966247,0.0000151217055,0.6961838,0.00016351002,0.000086752,0.00020026663,7.5540703e-7,0.0003092068,0.0033781405],"genre_scores_gemma":[0.68996733,6.11686e-7,0.30966508,0.0001525745,0.000040066487,0.0000015296313,0.000005541292,0.000009247239,0.00015804886],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99847364,0.000065435306,0.0004706962,0.0003260757,0.00040330997,0.00026082783],"domain_scores_gemma":[0.9989646,0.00008140053,0.00026290235,0.00044219918,0.00017342062,0.000075444856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009265112,0.0001564163,0.00018854809,0.00032416778,0.00009390792,0.000109557564,0.0003947574,0.00010036441,0.000024681533],"category_scores_gemma":[0.00004121277,0.00015510354,0.00007400267,0.00058677053,0.00004962143,0.0007798835,0.00009026091,0.00010786488,0.000017605722],"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.0001469837,0.0020816165,0.00093432766,0.00029518793,0.00011803079,0.00006323792,0.055022236,0.07691541,0.53048503,0.1746154,0.0024746088,0.15684794],"study_design_scores_gemma":[0.00013877083,0.00012266645,0.00022921027,0.000021032227,0.000005461449,0.000020852822,0.00020358112,0.41398787,0.58084303,0.0042033875,0.00007369545,0.000150453],"about_ca_topic_score_codex":0.000096041724,"about_ca_topic_score_gemma":0.00018041328,"teacher_disagreement_score":0.39030483,"about_ca_system_score_codex":0.000088415596,"about_ca_system_score_gemma":0.000058613343,"threshold_uncertainty_score":0.63249385},"labels":[],"label_agreement":null},{"id":"W1995703890","doi":"10.1190/geo2013-0465.1","title":"Sparse multichannel blind deconvolution","year":2014,"lang":"en","type":"article","venue":"Geophysics","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":127,"is_retracted":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":"Academy of Finland","keywords":"Deconvolution; Wavelet; Blind deconvolution; Impulse response; Mathematics; Algorithm; Wiener deconvolution; Noise (video); Impulse (physics); A priori and a posteriori; Computer science; Mathematical analysis; Artificial intelligence; Image (mathematics); Physics","score_opus":0.016252472929438194,"score_gpt":0.24351726200193216,"score_spread":0.22726478907249398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995703890","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.06527093,0.000008125304,0.93002045,0.00044794386,0.00017688605,0.000097845776,5.383448e-7,0.00040612736,0.0035711345],"genre_scores_gemma":[0.9336513,0.0000031923205,0.065010294,0.0009034618,0.000119970246,0.000013968988,0.000003723533,0.000007186956,0.00028687206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992585,0.000066600835,0.00012402977,0.00022600105,0.00015638529,0.00016844632],"domain_scores_gemma":[0.9992796,0.000053676613,0.000066616616,0.0004653784,0.00007985447,0.000054857082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023941923,0.00008923898,0.00009336527,0.000051979583,0.0000756697,0.00009509622,0.00040440742,0.00005034728,0.000002817042],"category_scores_gemma":[0.00003229049,0.00009034809,0.00004517475,0.00021156379,0.000024420391,0.00042953368,0.00012033058,0.00009721079,0.00036377314],"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.000005504298,0.00011493287,0.00010499462,0.000007956337,0.000009391206,9.976218e-7,0.0013535336,0.00039201317,0.0022500586,0.917306,0.0020612052,0.076393396],"study_design_scores_gemma":[0.0008698482,0.00018314991,0.0055169417,0.000018042996,0.000008432463,0.0000052634928,0.000020247468,0.65233445,0.023383884,0.2895478,0.027654588,0.00045734426],"about_ca_topic_score_codex":0.00002247637,"about_ca_topic_score_gemma":0.000005856493,"teacher_disagreement_score":0.8683804,"about_ca_system_score_codex":0.00001621787,"about_ca_system_score_gemma":0.000025864565,"threshold_uncertainty_score":0.4675689},"labels":[],"label_agreement":null},{"id":"W1995991870","doi":"10.1007/s00426-009-0272-9","title":"Switch costs and the operand-recognition paradigm","year":2010,"lang":"en","type":"article","venue":"Psychological Research","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Operand; Task (project management); Parity (physics); Arithmetic; Cognition; Numerical cognition; Cognitive psychology; Computer science; Psychology; Tapping; Mathematics; Engineering; Neuroscience","score_opus":0.14927465180755714,"score_gpt":0.45857962034171507,"score_spread":0.3093049685341579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995991870","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79067004,0.0001379564,0.07562188,0.05166372,0.0002028565,0.00088025664,0.0000017471473,0.00032806036,0.08049352],"genre_scores_gemma":[0.9900595,0.00012784693,0.0080621485,0.0014021092,0.000059427006,0.00013212925,0.0000013784565,0.000004002169,0.00015147615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981352,0.0006179079,0.00014133702,0.0003663014,0.00045462258,0.00028462717],"domain_scores_gemma":[0.9982061,0.0010229236,0.000021846678,0.0005034502,0.00013620446,0.00010947688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005072176,0.000072103205,0.00010171709,0.00009092519,0.0002635936,0.00042775008,0.00084522256,0.000119974706,0.00009112789],"category_scores_gemma":[0.00065809605,0.000039275103,0.000030903633,0.0004255856,0.0005170997,0.00020918837,0.00025097164,0.0010592506,0.00021893057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009149284,0.00013451489,0.00018063108,0.000001857928,0.0000046799278,0.0000071904965,0.0005184813,1.4345302e-7,0.003009138,0.6949988,0.003868173,0.29718488],"study_design_scores_gemma":[0.0029773985,0.000501417,0.030277438,0.000016138669,0.0000024065973,0.00013646542,0.000052333096,0.0062087737,0.003928524,0.9185884,0.037024178,0.00028652555],"about_ca_topic_score_codex":0.000030482513,"about_ca_topic_score_gemma":0.000018697396,"teacher_disagreement_score":0.29689834,"about_ca_system_score_codex":0.000009038685,"about_ca_system_score_gemma":0.000015810398,"threshold_uncertainty_score":0.46019757},"labels":[],"label_agreement":null},{"id":"W1998614909","doi":"10.1088/0031-9155/52/23/019","title":"Characterization of the image-derived carotid artery input function using independent component analysis for the quantitation of [18F] fluorodeoxyglucose positron emission tomography images","year":2007,"lang":"en","type":"article","venue":"Physics in Medicine and Biology","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":56,"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 Institute of Biomedical Imaging and Bioengineering; National Institute of Mental Health; National Institute on Aging; National Institutes of Health; Petroleum Technology Alliance Canada","keywords":"Independent component analysis; Positron emission tomography; Internal carotid artery; Fluorodeoxyglucose; Nuclear medicine; Partial volume; Medicine; Radiology; Artificial intelligence; Computer science","score_opus":0.08926890729822794,"score_gpt":0.35013461292309583,"score_spread":0.2608657056248679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998614909","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.4728541,0.000038828388,0.52664965,0.00021927778,0.00006319356,0.00016054978,0.0000019620063,0.0000074456484,0.000004991386],"genre_scores_gemma":[0.9963056,0.00004163483,0.0034265849,0.00013179844,0.000052791605,0.000005290496,0.000032224918,0.0000031361542,9.264856e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991856,0.000118613745,0.00033011197,0.00016229032,0.00010286858,0.00010051485],"domain_scores_gemma":[0.99905276,0.000244261,0.00032190842,0.00020935557,0.00015567477,0.000016045495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010890135,0.00008033981,0.00020426106,0.0001865866,0.00006673976,0.000007608641,0.00017577446,0.000045670775,5.3548143e-7],"category_scores_gemma":[0.000031308417,0.00004639723,0.00006536488,0.0006326829,0.0001508114,0.00012437215,0.00006379843,0.00008503259,2.304504e-8],"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.000031019164,0.00003835174,0.015013073,0.000014025657,0.000053902335,5.177284e-8,0.0008670551,0.00003701733,0.97747326,0.0031288546,0.000002368157,0.0033410438],"study_design_scores_gemma":[0.0003704621,0.00022887492,0.39153305,0.00004114121,0.00014728795,0.0000012299279,0.00021925238,0.013968794,0.5888985,0.004511115,0.000010496715,0.00006983926],"about_ca_topic_score_codex":0.000093794275,"about_ca_topic_score_gemma":0.000026021378,"teacher_disagreement_score":0.5234515,"about_ca_system_score_codex":0.000012378473,"about_ca_system_score_gemma":0.000015329611,"threshold_uncertainty_score":0.1892024},"labels":[],"label_agreement":null},{"id":"W1998747085","doi":"10.1002/cjs.10050","title":"Unaliasing of aliased line component frequencies","year":2010,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"Queen's University","funders":"","keywords":"Aliasing; Undo; Sampling (signal processing); Computer science; Component (thermodynamics); Algorithm; Undoing; Econometrics; Mathematics; Undersampling; Filter (signal processing); Physics; Telecommunications","score_opus":0.02508655648431516,"score_gpt":0.25203144866946126,"score_spread":0.2269448921851461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998747085","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.047797274,0.00004804372,0.9503223,0.0008367785,0.00047691603,0.000042892432,0.000084577354,0.000010341717,0.00038089525],"genre_scores_gemma":[0.60482067,0.000003628014,0.3949036,0.00020937854,0.00003445133,1.9612787e-7,0.0000020633854,0.0000041123667,0.000021895197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991287,0.000047133082,0.00040654704,0.00006887182,0.00019909872,0.00014967371],"domain_scores_gemma":[0.99844146,0.00012053286,0.00035271852,0.00020136952,0.0005530448,0.0003308566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004819712,0.000073135714,0.00016393895,0.00026813787,0.000060035796,0.000085983134,0.00050514314,0.00004834058,0.000042749467],"category_scores_gemma":[0.00026911346,0.0000698603,0.0000357588,0.00016494266,0.000119015254,0.0001908089,0.000012624542,0.00028379846,0.0000024968747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045034276,0.000034316996,0.0018005607,0.000028721779,0.00004107638,0.00029798082,0.0033741973,0.0002675572,0.02926234,0.93152404,0.016435836,0.016928894],"study_design_scores_gemma":[0.0021835694,0.002105899,0.042900093,0.0005481377,0.00014643316,0.0021280039,0.00066117966,0.061644528,0.32232016,0.41692305,0.14690162,0.0015373168],"about_ca_topic_score_codex":0.0020686495,"about_ca_topic_score_gemma":0.012561187,"teacher_disagreement_score":0.5570234,"about_ca_system_score_codex":0.00003914328,"about_ca_system_score_gemma":0.0012709852,"threshold_uncertainty_score":0.7009437},"labels":[],"label_agreement":null},{"id":"W1999801099","doi":"10.1109/acssc.2012.6489308","title":"Performance analysis of a 2-D EEG compression algorithm using an automatic seizure detection system","year":2012,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Computer science; Compression (physics); Data compression; Electroencephalography; Compression ratio; Image compression; Artificial intelligence; Metric (unit); Algorithm; Distortion (music); Pattern recognition (psychology); Speech recognition; Bandwidth (computing); Image (mathematics); Image processing; Engineering","score_opus":0.026207021162753138,"score_gpt":0.285310389188366,"score_spread":0.25910336802561285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999801099","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.40104488,0.000010722743,0.5982064,0.0000036549516,0.000050450857,0.00006889042,4.8142056e-7,0.00035433745,0.00026018443],"genre_scores_gemma":[0.72863257,7.4768485e-7,0.27131024,0.000021503492,0.00001193691,0.000004592656,0.0000016595527,0.000003702068,0.000013041189],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990199,0.00014497746,0.00026461028,0.00015400522,0.0002576234,0.00015885918],"domain_scores_gemma":[0.99919045,0.000024787665,0.00017414874,0.00044229176,0.00009416324,0.00007413432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053762784,0.000090693065,0.00020603236,0.00041597948,0.00009751501,0.00005090419,0.00028702556,0.00006753996,0.000009081796],"category_scores_gemma":[0.0000037810062,0.00007511395,0.00006694662,0.0011669736,0.00001549858,0.001325009,0.00008349559,0.000066777495,0.0000035919861],"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.000007332409,0.0007367097,0.015446598,0.00034467375,0.00068266987,0.0000017795334,0.011998559,0.022998722,0.092209436,0.0054529496,0.000043627257,0.850077],"study_design_scores_gemma":[0.000049090395,0.000038687507,0.012901631,0.00002402369,0.00007966761,0.000008829672,0.00009076841,0.9364363,0.05026671,0.00000400079,0.000015369968,0.00008491464],"about_ca_topic_score_codex":0.00007625809,"about_ca_topic_score_gemma":0.0000055375954,"teacher_disagreement_score":0.9134376,"about_ca_system_score_codex":0.00006186415,"about_ca_system_score_gemma":0.000017918817,"threshold_uncertainty_score":0.30630583},"labels":[],"label_agreement":null},{"id":"W2000796758","doi":"10.1109/embc.2012.6346406","title":"Pre-Processing of multi-channel EEG for improved compression performance using SPIHT","year":2012,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":30,"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":"Montreal Neurological Institute and Hospital","keywords":"Set partitioning in hierarchical trees; Redundancy (engineering); Computer science; Electroencephalography; Artificial intelligence; Wavelet transform; Pattern recognition (psychology); Wavelet; Channel (broadcasting); Data compression; Smoothness; Discrete wavelet transform; Speech recognition; Mathematics; Telecommunications; Psychology","score_opus":0.06030580566748496,"score_gpt":0.3301193849660881,"score_spread":0.26981357929860317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000796758","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.09898445,0.0001242299,0.90009344,0.000049772818,0.000097835735,0.0002781628,9.363534e-7,0.00019709696,0.00017409449],"genre_scores_gemma":[0.5990689,0.0000023442205,0.40070114,0.00010246244,0.000018758225,0.000010553354,9.276992e-7,0.0000059070953,0.00008905935],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992362,0.00002433874,0.00023558762,0.0001643369,0.000105320076,0.00023419055],"domain_scores_gemma":[0.999344,0.000025597776,0.0001652774,0.00026491674,0.00013824814,0.0000619576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039435885,0.00010099654,0.0001390384,0.000086080254,0.00011292935,0.000051636027,0.00036283105,0.00006666984,0.0000027479314],"category_scores_gemma":[0.000017068882,0.000083164756,0.000044644763,0.00015231334,0.000027769549,0.0013556572,0.00015817158,0.00006558309,0.0000010186666],"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.000093976705,0.0010918472,0.0027017987,0.00069348817,0.000032866912,1.4879828e-7,0.015617853,0.004104663,0.7045769,0.009999682,0.0005520258,0.26053476],"study_design_scores_gemma":[0.00021809404,0.000041139952,0.0013393469,0.000038592145,0.0000027742958,0.0000019563888,0.000018757924,0.78882474,0.20912385,0.000098352975,0.0001977249,0.00009464212],"about_ca_topic_score_codex":0.00001775067,"about_ca_topic_score_gemma":9.71803e-7,"teacher_disagreement_score":0.7847201,"about_ca_system_score_codex":0.000019243345,"about_ca_system_score_gemma":0.00003960983,"threshold_uncertainty_score":0.33913603},"labels":[],"label_agreement":null},{"id":"W2000873127","doi":"10.1109/icme.2013.6607464","title":"Multimodal information fusion of audiovisual emotion recognition using novel information theoretic tools","year":2013,"lang":"en","type":"article","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Dimensionality reduction; Entropy (arrow of time); Artificial intelligence; Information fusion; Mutual information; Information theory; Pattern recognition (psychology); Feature vector; Curse of dimensionality; Kernel (algebra); Feature (linguistics); Gaussian; Information integration; Machine learning; Data mining; Mathematics","score_opus":0.029618692209858234,"score_gpt":0.2624357842424305,"score_spread":0.23281709203257228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000873127","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.2536808,7.5403966e-7,0.7414545,0.00015198944,0.00007615901,0.00040367953,0.0000039400766,0.00022703379,0.004001145],"genre_scores_gemma":[0.7214786,0.0000036010892,0.27801925,0.0003959138,0.000010897678,0.000016903714,0.00006769662,0.0000024768876,0.0000046969158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886256,0.000055943743,0.00052769744,0.00009120443,0.00032490105,0.0001376658],"domain_scores_gemma":[0.9987492,0.000058370017,0.00034254414,0.00024468335,0.00056067354,0.000044547436],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00043538024,0.00010930873,0.00011654575,0.00032086062,0.00007951829,0.00035619675,0.0002445624,0.00010958906,0.0001121973],"category_scores_gemma":[0.0001394904,0.00009834484,0.00005160921,0.00034719447,0.00003505271,0.016897278,0.000117790514,0.00009387674,0.00020112115],"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.00001632546,0.00013384895,0.00014406354,0.0000951847,0.000014630925,4.517982e-8,0.00838162,0.0014122296,0.028390931,0.14513566,0.000362081,0.8159134],"study_design_scores_gemma":[0.00053282606,0.00013688735,0.005571296,0.000052514264,0.0000058676374,0.000010921008,0.00032401833,0.9318779,0.051913872,0.009109707,0.00024945557,0.00021474854],"about_ca_topic_score_codex":0.00018245475,"about_ca_topic_score_gemma":0.0000011220367,"teacher_disagreement_score":0.93046564,"about_ca_system_score_codex":0.00005416637,"about_ca_system_score_gemma":0.000057951114,"threshold_uncertainty_score":0.9968529},"labels":[],"label_agreement":null},{"id":"W2001107740","doi":"10.1109/tasl.2011.2163511","title":"All-Pole Modeling of Discrete Spectral Powers: A Unified Approach","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Audio Speech and Language Processing","topic":"Blind Source Separation Techniques","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":"Communications Research Centre Canada; University of Ottawa","funders":"","keywords":"Robustness (evolution); Autoregressive model; Convergence (economics); Minification; Gradient descent; Descent (aeronautics); Applied mathematics; Mathematics; Newton's method in optimization; Mathematical optimization; Computer science; Algorithm; Local convergence; Iterative method; Artificial intelligence; Artificial neural network; Physics","score_opus":0.03060110101843297,"score_gpt":0.2688147998782835,"score_spread":0.23821369885985053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001107740","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.024780292,0.00021659059,0.967453,0.000076374956,0.000037215825,0.00014089886,0.000003161949,0.00029446604,0.0069979737],"genre_scores_gemma":[0.75773764,0.000017858807,0.24195431,0.00015437722,0.000009955396,0.00000954152,9.5020715e-7,0.000011411093,0.00010395559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897236,0.00005701892,0.00023404435,0.0003205787,0.00019909636,0.00021688073],"domain_scores_gemma":[0.9994801,0.000014875535,0.000090496775,0.00027719486,0.000052071166,0.000085238265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002870851,0.00015293046,0.00017809421,0.00020253845,0.0001119326,0.000092960865,0.0002906132,0.00008085996,0.000017334523],"category_scores_gemma":[0.000003625006,0.00013817842,0.000064000254,0.00029726775,0.00005501563,0.0005683875,0.0000041007947,0.0002328474,0.0000023678406],"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.00031043543,0.0014305682,0.000035772355,0.0005847524,0.00023072332,0.00008178108,0.23310749,0.0104454765,0.050233047,0.0049245614,0.000054089134,0.6985613],"study_design_scores_gemma":[0.0003972851,0.00014786127,0.000014873612,0.00009041385,0.0000310827,0.000061424056,0.0020575682,0.6920407,0.3039062,0.0009336267,0.000013874101,0.00030510905],"about_ca_topic_score_codex":0.00013820034,"about_ca_topic_score_gemma":0.000019147603,"teacher_disagreement_score":0.73295736,"about_ca_system_score_codex":0.000019172323,"about_ca_system_score_gemma":0.00005934894,"threshold_uncertainty_score":0.56347525},"labels":[],"label_agreement":null},{"id":"W2001872373","doi":"10.1109/icip.2006.312969","title":"Video Event Detection using ICA Mixture Hidden Markov Models","year":2006,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Artificial intelligence; Hidden Markov model; Independent component analysis; Pattern recognition (psychology); Event (particle physics); Feature extraction; Feature (linguistics); Mixture model","score_opus":0.015379171070952071,"score_gpt":0.25280038133905514,"score_spread":0.23742121026810306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001872373","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.031062748,0.000033659937,0.9567316,0.00047544186,0.000084773754,0.00013749345,3.5945348e-7,0.00062161114,0.010852308],"genre_scores_gemma":[0.736964,0.0000016061807,0.2619595,0.00033303807,0.0000391279,0.0000071062964,8.166472e-7,0.0000061573455,0.0006886734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991033,0.00006825896,0.00018725584,0.0002611307,0.00022188296,0.00015814508],"domain_scores_gemma":[0.9994585,0.000023416555,0.00006137292,0.00035109944,0.00007035692,0.000035246223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022654065,0.00009868724,0.00008787574,0.0001107619,0.000096037686,0.00015729351,0.00032033114,0.000086434105,0.000016639007],"category_scores_gemma":[0.0000050197946,0.00008938535,0.000056748555,0.00027159593,0.000013400413,0.0007042209,0.00011010511,0.000102126956,0.00001262217],"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.000020317542,0.00028935066,0.00019029256,0.00002517389,0.000029110364,0.000018439012,0.0009627486,0.01691807,0.097662814,0.5854309,0.009742261,0.28871053],"study_design_scores_gemma":[0.0000866402,0.000025273834,0.00019538276,0.000006746024,0.0000028887905,0.00001814634,0.0000052020905,0.81365114,0.07620054,0.108500436,0.0011653333,0.00014225853],"about_ca_topic_score_codex":0.00033894103,"about_ca_topic_score_gemma":0.00009423326,"teacher_disagreement_score":0.7967331,"about_ca_system_score_codex":0.00006528745,"about_ca_system_score_gemma":0.000034081044,"threshold_uncertainty_score":0.3645029},"labels":[],"label_agreement":null},{"id":"W2004230937","doi":"10.1109/tbme.2013.2283514","title":"Minimum Variance Brain Source Localization for Short Data Sequences","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Biomedical Engineering","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":"McMaster University","funders":"","keywords":"Adaptive beamformer; Context (archaeology); Beamforming; Computer science; Signal processing; Pattern recognition (psychology); SIGNAL (programming language); Minimum-variance unbiased estimator; Artificial intelligence; Electroencephalography; Variance (accounting); Higher-order statistics; Algorithm; Radar; Statistics; Mathematics; Mean squared error","score_opus":0.02567628017598041,"score_gpt":0.26852720533597474,"score_spread":0.24285092515999432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004230937","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.000213014,0.0000149724465,0.994567,0.0035906024,0.0004289462,0.0003853814,0.000019479823,0.0007530203,0.000027589023],"genre_scores_gemma":[0.77458316,0.000018779283,0.2235271,0.0012293883,0.00009394316,0.0002481668,0.0000342946,0.000027654418,0.00023747994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987224,0.000027266473,0.00027336666,0.00042406982,0.00029902134,0.00025390342],"domain_scores_gemma":[0.9988277,0.0002690478,0.000029530607,0.000658514,0.000061735904,0.00015347637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003563487,0.00014896112,0.00014126598,0.00020415604,0.000105485124,0.00015619074,0.00093628286,0.00013158156,0.00002453775],"category_scores_gemma":[0.000039101385,0.00014386735,0.00004666822,0.00049380865,0.000050685074,0.0008185918,0.000008248239,0.00017515836,0.00002630313],"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.000014851459,0.0005869887,0.0000030542487,0.00018319322,0.00016473274,0.000006357651,0.0017741823,0.31654418,0.058735337,0.0075667314,0.025633626,0.5887868],"study_design_scores_gemma":[0.00012762674,0.00008530902,0.0000052249006,0.00003241813,0.000005027149,0.000007940988,0.0000111172885,0.95788586,0.008867097,0.00018085053,0.032625873,0.00016562713],"about_ca_topic_score_codex":0.000029991708,"about_ca_topic_score_gemma":0.0000027370436,"teacher_disagreement_score":0.7743702,"about_ca_system_score_codex":0.000040373234,"about_ca_system_score_gemma":0.00005931011,"threshold_uncertainty_score":0.58667403},"labels":[],"label_agreement":null},{"id":"W2004988154","doi":"10.1109/iccomm.2012.6262564","title":"Blind signal identification: Achievements, trends, and challenges","year":2012,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Defence Research and Development Canada; Memorial University of Newfoundland","funders":"","keywords":"Emphasis (telecommunications); Identification (biology); Computer science; SIGNAL (programming language); Signal processing; Telecommunications","score_opus":0.06660620958384658,"score_gpt":0.2965547581246387,"score_spread":0.22994854854079214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004988154","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.0062046815,0.0041403007,0.9188793,0.020975558,0.00016710983,0.00013633912,0.000001233312,0.00071321265,0.048782285],"genre_scores_gemma":[0.96397895,0.00040726102,0.033040535,0.0004491443,0.000066794695,0.000018064648,0.0000028499092,0.000004556567,0.0020318546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993378,0.000053973992,0.00013582902,0.00016909701,0.00015651366,0.00014676596],"domain_scores_gemma":[0.99954593,0.000027241134,0.000048912516,0.00026898162,0.00002847426,0.00008043026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049048616,0.00007012703,0.00006265522,0.00012697595,0.00006276005,0.0001152985,0.00025756247,0.00003973715,0.000068820525],"category_scores_gemma":[0.000004209008,0.00006160037,0.000017610766,0.00014830416,0.000021400743,0.00095932593,0.000120659424,0.000053988464,0.000059306996],"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.000001813582,0.000093449285,0.0004444484,0.000005476236,0.000009674936,2.1301393e-7,0.0018085183,3.8969495e-7,0.0005421175,0.64114916,0.0019167223,0.35402802],"study_design_scores_gemma":[0.0015480035,0.0002931376,0.28297096,0.000023416309,0.00002625215,0.00006192807,0.0005405041,0.007228283,0.07330771,0.016920263,0.6159758,0.0011037479],"about_ca_topic_score_codex":0.0000029539992,"about_ca_topic_score_gemma":0.0000035091998,"teacher_disagreement_score":0.9577743,"about_ca_system_score_codex":0.000007728154,"about_ca_system_score_gemma":0.0000074401714,"threshold_uncertainty_score":0.251199},"labels":[],"label_agreement":null},{"id":"W2005548261","doi":"10.1167/8.13.5","title":"Convergent flash localization near saccades without equivalent \"compression\" of perceived separation","year":2008,"lang":"en","type":"article","venue":"Journal of Vision","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flash (photography); Compression (physics); Separation (statistics); Computer science; Physics; Optics; Thermodynamics; Machine learning","score_opus":0.028640017339799862,"score_gpt":0.33216180429574593,"score_spread":0.30352178695594606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005548261","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.40446925,0.000112606016,0.5945702,0.00029494337,0.00018450814,0.00009670639,4.3429432e-7,0.000036444686,0.00023491793],"genre_scores_gemma":[0.9502418,0.0002932519,0.04911135,0.00017434882,0.000052292788,0.0000010397357,0.0000015795412,0.000007693204,0.000116663075],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998204,0.00020089894,0.000674287,0.00014311829,0.00066385465,0.00011383329],"domain_scores_gemma":[0.9983299,0.00005233166,0.0007372443,0.00024885905,0.00053921266,0.000092494905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005300746,0.00011029475,0.00025123684,0.00018424467,0.00013555514,0.000060097715,0.00042466822,0.00008702304,0.00003520634],"category_scores_gemma":[0.000062460786,0.00008699303,0.000120054414,0.00024454223,0.000067402056,0.00095853343,0.00009871065,0.00016433974,0.00001288037],"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.00067222107,0.0021896898,0.03485164,0.00020261541,0.00019599125,0.00010914091,0.041490212,0.08391781,0.6961857,0.011482899,0.090826355,0.037875693],"study_design_scores_gemma":[0.0021044803,0.0023992462,0.16844396,0.00070008216,0.000036841015,0.0004576005,0.000103901475,0.67166126,0.12927204,0.0025465668,0.021849925,0.00042409275],"about_ca_topic_score_codex":0.000004603527,"about_ca_topic_score_gemma":8.5251526e-7,"teacher_disagreement_score":0.58774346,"about_ca_system_score_codex":0.000055628527,"about_ca_system_score_gemma":0.00015749704,"threshold_uncertainty_score":0.35474727},"labels":[],"label_agreement":null},{"id":"W2007686435","doi":"10.1117/12.391931","title":"&lt;title&gt;Appearance-based three-dimensional object recognition using independent component analysis&lt;/title&gt;","year":2000,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Blind Source Separation 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":"Concordia University","funders":"","keywords":"Independent component analysis; Artificial intelligence; Redundancy (engineering); Cognitive neuroscience of visual object recognition; Computer vision; Pattern recognition (psychology); Computer science; Object (grammar); Workspace; Manifold (fluid mechanics); Identity (music); Maximization; Component (thermodynamics); Mathematics; Engineering","score_opus":0.017550186936221852,"score_gpt":0.23860571059991886,"score_spread":0.22105552366369702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007686435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9842996,0.000088164816,0.0043093297,0.00070566917,0.00013141519,0.00026743748,0.000018423705,0.00015629387,0.010023694],"genre_scores_gemma":[0.6437245,0.000034376735,0.35529324,0.00028106984,0.0002395486,0.0000541789,0.000018501052,0.00003999864,0.00031459314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851376,4.567365e-8,0.0003777623,0.00029344315,0.0006090288,0.00020596072],"domain_scores_gemma":[0.999001,0.00004391199,0.00018255923,0.00006696961,0.00063932326,0.000066213535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046784317,0.00017621298,0.00024103459,0.00014847262,0.00006208652,0.00010930116,0.0006153107,0.00012810584,0.0001451059],"category_scores_gemma":[0.000055908185,0.00015673887,0.00042549017,0.00046020417,0.00008001217,0.00031343562,0.00007591816,0.00018983477,0.000024789922],"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.00010565033,0.00041961335,0.00025587436,0.0002808305,0.0013686708,6.372002e-7,0.00023008506,0.0044922726,0.30934104,0.6608335,0.0106067825,0.01206503],"study_design_scores_gemma":[0.0006355741,0.00015503298,0.0010194923,0.00023281589,0.00021938754,0.000012295969,0.00002076511,0.9378299,0.04568311,0.0039531225,0.009805759,0.00043273479],"about_ca_topic_score_codex":0.0000052912105,"about_ca_topic_score_gemma":3.0029932e-7,"teacher_disagreement_score":0.9333376,"about_ca_system_score_codex":0.00011070043,"about_ca_system_score_gemma":0.00004569542,"threshold_uncertainty_score":0.63916254},"labels":[],"label_agreement":null},{"id":"W2007911590","doi":"10.1109/isspit.2007.4458112","title":"Extraction of Fetal Electrocardiogram from Maternal Skin Electrodes using Affine Projection Algorithm (APA), Recursive Least Square (RLS), and QR-RLS Algorithms","year":2007,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Western University","funders":"","keywords":"Algorithm; Electrocardiography; Computer science; SIGNAL (programming language); Artificial intelligence; Pattern recognition (psychology); Medicine; Cardiology","score_opus":0.013509233526287946,"score_gpt":0.29126110228105706,"score_spread":0.2777518687547691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007911590","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.21358056,0.00014029592,0.7849226,0.00008546244,0.00013969022,0.0003337928,0.000006255948,0.00031982845,0.00047152504],"genre_scores_gemma":[0.46359107,0.00007188843,0.53593355,0.00006342143,0.00020414918,0.00001036192,0.000016551401,0.000018956925,0.00009002672],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980042,0.0001276923,0.00046161644,0.0005451469,0.00045971858,0.00040161877],"domain_scores_gemma":[0.99894655,0.00008517792,0.00029266544,0.00032137075,0.00026096887,0.00009328903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007092142,0.00024222053,0.00029948377,0.00041944746,0.0001442309,0.00020211849,0.00028108186,0.00018142913,0.000015748536],"category_scores_gemma":[0.000019898303,0.00023499259,0.00011395968,0.0006659264,0.00006380423,0.0010346263,0.00009135698,0.00027800066,0.0000033695496],"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.000077573764,0.00020812466,0.0010359194,0.00001844919,0.00012417517,0.000018367202,0.0010163587,0.000053621694,0.16014934,0.002570966,0.00020729085,0.8345198],"study_design_scores_gemma":[0.00046958704,0.00052858406,0.0103585515,0.000046840254,0.000035110697,0.00028035848,0.00017968082,0.09994277,0.8843066,0.0028922064,0.00059972616,0.00035999608],"about_ca_topic_score_codex":0.0016148223,"about_ca_topic_score_gemma":0.0001486434,"teacher_disagreement_score":0.8341598,"about_ca_system_score_codex":0.0001361726,"about_ca_system_score_gemma":0.00008117166,"threshold_uncertainty_score":0.958272},"labels":[],"label_agreement":null},{"id":"W2008220076","doi":"10.1109/iembs.2010.5627753","title":"Single nucleotide polymorphism selection using independent component analysis","year":2010,"lang":"en","type":"article","venue":"","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":"Queen's University","funders":"","keywords":"Principal component analysis; SNP; Single-nucleotide polymorphism; Independent component analysis; Selection (genetic algorithm); Computer science; Matching (statistics); Computational biology; Pattern recognition (psychology); Artificial intelligence; Data mining; Biology; Genetics; Mathematics; Genotype; Statistics; Gene","score_opus":0.02156388348902343,"score_gpt":0.26549140138691196,"score_spread":0.24392751789788852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008220076","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.38427857,0.0000023590735,0.6123749,0.00030584226,0.00013115552,0.00006249659,2.4548353e-7,0.00040696177,0.0024374768],"genre_scores_gemma":[0.8058807,4.730192e-7,0.19349225,0.0004024597,0.00004081345,0.0000025245527,0.0000017146064,0.0000057620655,0.00017325826],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893814,0.00006889581,0.00021271042,0.00030831769,0.0002939779,0.00017796693],"domain_scores_gemma":[0.9993122,0.000028446588,0.00009974111,0.0003818289,0.00009455186,0.00008323875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037405235,0.000106021886,0.00014280794,0.00044015588,0.00012855833,0.0002623924,0.00041440845,0.000082224695,0.00012177746],"category_scores_gemma":[0.0000089373425,0.000101218786,0.00010652654,0.0010866036,0.000024663617,0.00049709645,0.00014087785,0.00022379143,0.000025712145],"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.0000025928773,0.00021781345,0.0056762327,0.0000015399061,0.00013006007,0.0000031965565,0.0004876172,0.0006117218,0.92246956,0.06537598,0.0002106154,0.0048130527],"study_design_scores_gemma":[0.00015845116,0.000056087923,0.013998373,0.0000020931373,0.000075404845,0.00002914307,0.000016482194,0.64970356,0.33086264,0.001803932,0.0029987423,0.00029508336],"about_ca_topic_score_codex":0.00048211645,"about_ca_topic_score_gemma":0.0005420645,"teacher_disagreement_score":0.64909184,"about_ca_system_score_codex":0.00004789391,"about_ca_system_score_gemma":0.000039395836,"threshold_uncertainty_score":0.41275823},"labels":[],"label_agreement":null},{"id":"W2009988422","doi":"10.1190/1.2890407","title":"Adaptive separation of free-surface multiples through independent component analysis","year":2008,"lang":"en","type":"article","venue":"Geophysics","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":47,"is_retracted":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":"Multiple; Subtraction; TRACE (psycholinguistics); Computer science; Algorithm; Blind signal separation; Construct (python library); Filter (signal processing); Surface (topology); Wavelet; Independent component analysis; Component (thermodynamics); Artificial intelligence; Mathematics; Arithmetic; Physics; Computer vision; Channel (broadcasting)","score_opus":0.03458149444815641,"score_gpt":0.2754728949572221,"score_spread":0.24089140050906568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009988422","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.29451603,0.000033710057,0.7041009,0.00013551395,0.000038964874,0.00013310321,0.000009771106,0.00014764721,0.00088436494],"genre_scores_gemma":[0.8723792,0.000037563754,0.12732759,0.00012368654,0.000021193831,0.000007077645,0.000015062386,0.0000059159993,0.000082726256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865985,0.00011188944,0.000294075,0.0003076631,0.00046830674,0.00015823849],"domain_scores_gemma":[0.9986502,0.00008428069,0.00024223728,0.000779569,0.00020500674,0.000038716807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001394183,0.00013814012,0.00027993723,0.00007459758,0.000112308204,0.000027709913,0.00065574993,0.00006633769,0.0000050182234],"category_scores_gemma":[0.000012003818,0.000137331,0.00017105833,0.0009457998,0.000075170654,0.0006122277,0.00024896298,0.00012542948,0.000022777916],"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.00010784369,0.0022510423,0.012021966,0.00004252584,0.0020932956,0.0000454417,0.07174838,0.32783535,0.044993047,0.52827,0.006427725,0.0041633327],"study_design_scores_gemma":[0.0010518087,0.00040182317,0.08514981,0.00002017133,0.00019295632,0.000009451232,0.00026625698,0.6362791,0.22692057,0.047796156,0.0011779892,0.0007339244],"about_ca_topic_score_codex":0.00038760793,"about_ca_topic_score_gemma":0.00003667602,"teacher_disagreement_score":0.57786316,"about_ca_system_score_codex":0.00003490045,"about_ca_system_score_gemma":0.00006570333,"threshold_uncertainty_score":0.56001955},"labels":[],"label_agreement":null},{"id":"W2010980582","doi":"10.1109/tnn.2004.828765","title":"Probabilistic Sequential Independent Components Analysis","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Blind Source Separation Techniques","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 Toronto","funders":"Royal Society of Canada","keywords":"Computer science; Independent component analysis; Artificial intelligence; Probabilistic logic; Projection (relational algebra); Sequence (biology); Feature (linguistics); Component (thermodynamics); Field (mathematics); Algorithm; Pattern recognition (psychology); Machine learning; Mathematics","score_opus":0.025676999232074206,"score_gpt":0.2624316476554458,"score_spread":0.2367546484233716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010980582","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.04137779,0.000011430201,0.9564253,0.000668054,0.0004975941,0.00027564424,0.0000037069026,0.0006034578,0.00013703582],"genre_scores_gemma":[0.993622,0.000010415873,0.005443775,0.00074568053,0.000037719823,0.00005292397,0.0000054420866,0.000012793748,0.00006926077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847424,0.00013168638,0.00031189606,0.00046387909,0.0003218337,0.00029648154],"domain_scores_gemma":[0.99907744,0.00005772776,0.00009162978,0.00057233905,0.00007041887,0.00013043577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018934443,0.00019541831,0.00022427403,0.00033159947,0.00022295948,0.00020857692,0.0005786283,0.00012693746,0.000026817166],"category_scores_gemma":[0.0000015764663,0.0001891127,0.00025937142,0.0012773599,0.00005406158,0.0004216921,0.000005127619,0.00046669872,0.000020120939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012195367,0.0001692606,0.0000069394537,0.0000017629901,0.00010320227,0.0000089123105,0.000130261,0.9936842,0.00012955954,0.0016962808,0.000013520091,0.0040439623],"study_design_scores_gemma":[0.0004431243,0.00014464548,0.00050948164,0.000009547399,0.00012417417,0.000018229664,0.000003994907,0.9944833,0.0025055786,0.001463376,0.000048161462,0.00024642298],"about_ca_topic_score_codex":0.00009399926,"about_ca_topic_score_gemma":0.00018245782,"teacher_disagreement_score":0.9522442,"about_ca_system_score_codex":0.00012197111,"about_ca_system_score_gemma":0.00003238654,"threshold_uncertainty_score":0.7711792},"labels":[],"label_agreement":null},{"id":"W2016036832","doi":"10.1121/1.4884760","title":"Robust blind identification of room acoustic channels in symmetric alpha-stable distributed noise environments","year":2014,"lang":"en","type":"article","venue":"The Journal of the Acoustical Society of America","topic":"Blind Source Separation Techniques","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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Robustness (evolution); Computer science; Gaussian noise; Gaussian; Estimator; Noise (video); Algorithm; Speech recognition; Mathematics; Statistics; Artificial intelligence; Physics","score_opus":0.017761702713959285,"score_gpt":0.2449446799356397,"score_spread":0.2271829772216804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016036832","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.018306999,0.000096406,0.978902,0.0023525862,0.00013170109,0.00016940637,0.0000074070463,0.000011672649,0.000021836868],"genre_scores_gemma":[0.96164036,0.00020518104,0.037662487,0.0003839808,0.000046211087,0.0000023452587,0.000001046351,0.000009197057,0.00004919654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976586,0.00038699489,0.0008919717,0.0001379939,0.00070196413,0.00022244986],"domain_scores_gemma":[0.997319,0.0006506202,0.001254186,0.00057237246,0.00013445507,0.0000694048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022592526,0.00013333856,0.00034639827,0.00007952683,0.000098447344,0.000038617967,0.0015778322,0.000083675004,0.000007972279],"category_scores_gemma":[0.000546707,0.000082321,0.0002404787,0.0010478437,0.00040956147,0.00027428495,0.00031369494,0.0003945768,0.0000029321693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000945108,0.0008050579,0.00033444993,0.00006533396,0.00013692972,5.653543e-7,0.0023828966,0.8453262,0.13353795,0.00026770972,0.005622231,0.011426175],"study_design_scores_gemma":[0.00049299246,0.00020236605,0.0035275358,0.000056183602,0.00007929625,0.000011977288,0.00025250844,0.97116023,0.021162312,0.002606372,0.0003431973,0.00010502537],"about_ca_topic_score_codex":0.000028733675,"about_ca_topic_score_gemma":2.757899e-7,"teacher_disagreement_score":0.9433333,"about_ca_system_score_codex":0.000095342126,"about_ca_system_score_gemma":0.000057680332,"threshold_uncertainty_score":0.3356953},"labels":[],"label_agreement":null},{"id":"W2016629183","doi":"10.1049/iet-cvi.2007.0076","title":"Discriminant analysis based on modified generalised singular value decomposition and its numerical error analysis","year":2009,"lang":"en","type":"article","venue":"IET Computer Vision","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear discriminant analysis; Singular value decomposition; Mathematics; Pattern recognition (psychology); Kernel (algebra); Algorithm; Dimension (graph theory); Feature vector; Kernel method; Subspace topology; Discriminative model; Scatter matrix; Singular value; Matrix (chemical analysis); Measure (data warehouse); Artificial intelligence; Computer science; Support vector machine; Eigenvalues and eigenvectors; Covariance matrix; Statistics; Mathematical analysis; Combinatorics","score_opus":0.017106265907881994,"score_gpt":0.3177436427044998,"score_spread":0.3006373767966178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016629183","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.11969118,0.000027986907,0.8770024,0.0026086573,0.00006234428,0.000177156,0.000003492997,0.00032970132,0.000097048985],"genre_scores_gemma":[0.79120123,0.0000036810995,0.20589095,0.0027770537,0.000042324573,0.0000041850544,0.00006215096,0.0000068790036,0.000011554552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975916,0.00038075636,0.00041473005,0.0008009857,0.00053785625,0.00027405852],"domain_scores_gemma":[0.9987066,0.00010081799,0.00017651991,0.0007174856,0.00012663245,0.00017194451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046283074,0.0002646709,0.0004937499,0.0011039765,0.00020506496,0.0004381512,0.00051608373,0.000119492404,0.000006717951],"category_scores_gemma":[0.000008804342,0.0002305632,0.00035369257,0.0024775749,0.000019090474,0.00044526267,0.00011622007,0.00016272828,0.0000070103556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008954819,0.00075158477,0.00020996056,0.000008235813,0.0004592652,0.000054423475,0.0007496406,0.93732965,0.005269097,0.020348635,0.0005227294,0.034207232],"study_design_scores_gemma":[0.00030861422,0.0005810217,0.040204637,0.000015895834,0.00040142416,0.0000021753751,8.67498e-7,0.9542182,0.002873941,0.0010765778,0.00004631417,0.00027033183],"about_ca_topic_score_codex":0.000015275198,"about_ca_topic_score_gemma":0.0000021754213,"teacher_disagreement_score":0.67151004,"about_ca_system_score_codex":0.00006174347,"about_ca_system_score_gemma":0.000026031637,"threshold_uncertainty_score":0.94020945},"labels":[],"label_agreement":null},{"id":"W2017447942","doi":"10.1109/spawc.2010.5670966","title":"Blind nonzero delay MMSE equalizer for SIMO fir systems","year":2010,"lang":"en","type":"article","venue":"","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Robustness (evolution); Finite impulse response; Blind equalization; Computer science; Adaptive equalizer; Control theory (sociology); Channel (broadcasting); Equalization (audio); Truncation (statistics); Covariance matrix; Equalizer; Algorithm; Mathematics; Telecommunications; Artificial intelligence","score_opus":0.02862449379706314,"score_gpt":0.3122127944187769,"score_spread":0.2835883006217138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017447942","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.009979475,0.000017662785,0.9742074,0.0010149674,0.00063160266,0.0005480484,0.0000033190765,0.0007304549,0.012867064],"genre_scores_gemma":[0.77158046,0.0000018220651,0.22118454,0.0009923679,0.00013373337,0.00016206739,0.0000044627127,0.000014712568,0.0059258244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892616,0.000044134766,0.00026455382,0.00032119616,0.0002111872,0.00023276279],"domain_scores_gemma":[0.99872977,0.00022126357,0.000087454886,0.00067621405,0.00018626734,0.00009903689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071809895,0.00012357939,0.0001462573,0.00010728659,0.00010253438,0.00036864734,0.0007668389,0.00014219705,0.00003627292],"category_scores_gemma":[0.00007735881,0.00010187764,0.00007212562,0.0001989258,0.000028311712,0.0004823009,0.00012514529,0.0001647756,0.00009186567],"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.000010086484,0.00006816456,0.000046390578,0.000017793729,0.000012710475,0.0000020957127,0.0005093264,0.0000713147,0.006710705,0.9569923,0.030958163,0.004600898],"study_design_scores_gemma":[0.0011144691,0.00024045297,0.000067598485,0.00001532425,0.000008733504,0.000034240355,0.000049324564,0.40380445,0.038542826,0.015256233,0.54033166,0.0005346573],"about_ca_topic_score_codex":0.00005216311,"about_ca_topic_score_gemma":0.00004787147,"teacher_disagreement_score":0.9417361,"about_ca_system_score_codex":0.000011285787,"about_ca_system_score_gemma":0.00006811373,"threshold_uncertainty_score":0.41544497},"labels":[],"label_agreement":null},{"id":"W2017560290","doi":"10.1541/ieejeiss.123.1735","title":"A Practical Digital Signal Carrier Acquisition based on Kalman Filter Theory","year":2003,"lang":"en","type":"article","venue":"IEEJ Transactions on Electronics Information and Systems","topic":"Blind Source Separation 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":"Quest University Canada","funders":"","keywords":"Kalman filter; Carrier signal; Computer science; Control theory (sociology); SIGNAL (programming language); Root-raised-cosine filter; Carrier frequency offset; Filter (signal processing); Fast Kalman filter; Linear phase; Digital filter; Frequency offset; Extended Kalman filter; Amplitude; Electronic engineering; Algorithm; Telecommunications; Bandwidth (computing); Physics; Engineering; Artificial intelligence; Transmission (telecommunications); Optics","score_opus":0.012483976558918272,"score_gpt":0.25221599031736397,"score_spread":0.2397320137584457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017560290","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.00060469215,0.000020614449,0.9857731,0.0004640965,0.00013622908,0.00033951725,0.000019653246,0.0002648378,0.012377249],"genre_scores_gemma":[0.99684596,0.000012356716,0.0015229764,0.0013177346,0.000010572731,0.000081742626,0.000017142187,0.0000077217055,0.00018379945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861705,0.00022761778,0.00035984386,0.00017318614,0.00037894223,0.00024338087],"domain_scores_gemma":[0.9991435,0.00020439981,0.00012787586,0.00030942707,0.00011757699,0.00009726209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074406975,0.00015936648,0.0001341727,0.00028300527,0.00023848568,0.00073350593,0.0001307398,0.00012660443,0.00003489916],"category_scores_gemma":[0.000021301168,0.00014486015,0.000066207635,0.00025851445,0.00003067495,0.0024221283,0.0000018562826,0.00033053587,0.000052888437],"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.00007462535,0.00015102464,0.000005763673,0.000029838493,0.00003110967,0.0000014512575,0.00097437546,0.013416032,0.000048732058,0.9689499,0.0006381128,0.015679033],"study_design_scores_gemma":[0.0011215201,0.0012053044,0.000025253392,0.00006674992,0.000018376846,0.00013711728,0.00036586472,0.8884945,0.006032875,0.0049869916,0.09705123,0.00049424375],"about_ca_topic_score_codex":0.0000019600834,"about_ca_topic_score_gemma":0.0000011812551,"teacher_disagreement_score":0.9962413,"about_ca_system_score_codex":0.00012700964,"about_ca_system_score_gemma":0.00021804271,"threshold_uncertainty_score":0.70732147},"labels":[],"label_agreement":null},{"id":"W2018219772","doi":"10.1007/s10107-003-0429-z","title":"On blind source separation using mutual information criterion","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mutual information; Mathematics; Blind signal separation; Estimator; Kernel (algebra); Convergence (economics); Optimization problem; Mathematical optimization; Independent component analysis; Stiefel manifold; Applied mathematics; Quadratic equation; Algorithm; Computer science; Artificial intelligence; Statistics","score_opus":0.03366291385291511,"score_gpt":0.3230390717195761,"score_spread":0.289376157866661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018219772","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.04060963,0.0000060502766,0.953702,0.0001462034,0.00005873488,0.00042348666,2.2761384e-7,0.00050214346,0.004551575],"genre_scores_gemma":[0.55644846,4.1889479e-7,0.44302273,0.00040156776,0.000013677695,0.000034874098,0.0000035732035,0.000009141876,0.00006557478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998572,0.00014569238,0.00041316796,0.00020054952,0.0004034092,0.00026516986],"domain_scores_gemma":[0.99914944,0.00014467741,0.00014711206,0.00037466025,0.00009505822,0.00008904503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084490277,0.00015742973,0.00015954554,0.00018472961,0.00017251722,0.0006522702,0.00026275447,0.00010647741,0.000029091298],"category_scores_gemma":[0.00041383933,0.0001435811,0.000066430344,0.0003688415,0.000037914164,0.0014916157,0.00005881022,0.00017902933,0.00023667316],"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.000007993552,0.0001302436,0.000006467142,0.000043753105,0.000007100512,0.0000012315321,0.0032823288,0.00035474845,0.0002895107,0.9501456,0.00011929045,0.045611728],"study_design_scores_gemma":[0.00097300153,0.0004604593,0.0000098070495,0.00017536536,0.000019854391,0.000110913104,0.00031233035,0.7188679,0.018126538,0.21277954,0.047504585,0.0006597171],"about_ca_topic_score_codex":0.000001557353,"about_ca_topic_score_gemma":3.3244757e-7,"teacher_disagreement_score":0.7373661,"about_ca_system_score_codex":0.000064657645,"about_ca_system_score_gemma":0.000045804074,"threshold_uncertainty_score":0.62898564},"labels":[],"label_agreement":null},{"id":"W2019224463","doi":"10.1002/mrm.21187","title":"Correction for geometric distortion and N/2 ghosting in EPI by phase labeling for additional coordinate encoding (PLACE)","year":2007,"lang":"en","type":"article","venue":"Magnetic Resonance in Medicine","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":132,"is_retracted":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":"Ghosting; Encoding (memory); Distortion (music); Computer science; Phase (matter); Artificial intelligence; Computer vision; Physics; Telecommunications","score_opus":0.01942087426703802,"score_gpt":0.31568717075081143,"score_spread":0.2962662964837734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019224463","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.038616605,0.0047188387,0.9538229,0.001292977,0.0003689602,0.00074265763,0.000027728845,0.000081593746,0.00032770596],"genre_scores_gemma":[0.9175697,0.00032248706,0.0794352,0.0007546124,0.00021399098,0.00041901707,0.0001789487,0.000020971474,0.0010850875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998703,0.000037829883,0.00044928,0.0003387654,0.00020371536,0.00026743178],"domain_scores_gemma":[0.997925,0.001669921,0.00013173625,0.00012540049,0.00009599254,0.000051971925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002262976,0.00011267695,0.00019740117,0.0005339954,0.000083206905,0.00002625241,0.00015721672,0.000072733565,0.000027832235],"category_scores_gemma":[0.0018987887,0.000111858106,0.000017734748,0.0008955998,0.000060400987,0.0002201025,0.000030683314,0.0001440733,4.223018e-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.0000887184,0.00008419486,0.001179135,0.000035641595,8.2417523e-7,0.000003908716,0.00065922615,0.000025263524,0.0015192812,0.0007306493,0.037685428,0.9579877],"study_design_scores_gemma":[0.01293496,0.0040670177,0.029627658,0.0016144186,0.00001655446,0.000048724174,0.00045955382,0.5961186,0.008484266,0.006601938,0.33934417,0.00068209117],"about_ca_topic_score_codex":0.0000632001,"about_ca_topic_score_gemma":0.00009341852,"teacher_disagreement_score":0.9573056,"about_ca_system_score_codex":0.000119899116,"about_ca_system_score_gemma":0.00002716062,"threshold_uncertainty_score":0.4561441},"labels":[],"label_agreement":null},{"id":"W2020808711","doi":"10.4236/eng.2013.510b056","title":"Feature Extraction by Multi-Scale Principal Component Analysis and Classification in Spectral Domain","year":2013,"lang":"en","type":"article","venue":"Engineering","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":"University of Guelph; Toronto Metropolitan University","funders":"","keywords":"Principal component analysis; Pattern recognition (psychology); Feature extraction; Dimensionality reduction; Artificial intelligence; Discrete wavelet transform; Wavelet transform; Computer science; Feature (linguistics); Scale (ratio); Wavelet; Dimension (graph theory); Mathematics; Geography","score_opus":0.009444012740045957,"score_gpt":0.2419770961994818,"score_spread":0.23253308345943585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020808711","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.367259,0.00003085815,0.6319155,0.00052466284,0.000020701487,0.00008699599,4.0889051e-7,0.00012738217,0.00003450558],"genre_scores_gemma":[0.7658874,0.000006982159,0.23396133,0.000019596573,0.00000890879,0.00004058611,0.0000055948544,0.000003929989,0.000065663095],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994792,0.00002199667,0.00010100499,0.0001871396,0.00009433826,0.00011636972],"domain_scores_gemma":[0.9997184,0.000021989754,0.00003334351,0.0001669886,0.000014796993,0.000044439526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014537787,0.000075826756,0.00009352402,0.00021096737,0.000020924997,0.00010790419,0.00012166127,0.000055862554,0.0000045077886],"category_scores_gemma":[0.00000574712,0.00007818859,0.0000260704,0.00041332608,0.000006296937,0.0004086841,0.000030183193,0.0001496919,0.0000060685375],"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.0000025021852,0.00016301988,0.022146167,0.00002322391,0.00007484904,0.0000036184651,0.0033664803,0.013190171,0.94751984,0.006338289,0.0009828132,0.0061890213],"study_design_scores_gemma":[0.000084494844,0.000006350319,0.33161432,0.0000034605173,0.0000034052096,0.0000019081024,0.00001696751,0.66096205,0.0064266766,0.00002608913,0.0007764194,0.00007786843],"about_ca_topic_score_codex":0.0000383272,"about_ca_topic_score_gemma":0.000028839064,"teacher_disagreement_score":0.94109315,"about_ca_system_score_codex":0.000052265837,"about_ca_system_score_gemma":0.0000042862343,"threshold_uncertainty_score":0.3188438},"labels":[],"label_agreement":null},{"id":"W2021727929","doi":"10.1109/tbme.2015.2404300","title":"Ultrasound-Based Characterization of Prostate Cancer Using Joint Independent Component Analysis","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Biomedical Engineering","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Western University; Vancouver General Hospital; London Health Sciences Centre; Kingston General Hospital; Robarts Clinical Trials; University of British Columbia","funders":"Canadian Institutes of Health Research; Natural Sciences and Engineering Research Council of Canada; Queen's University","keywords":"Pattern recognition (psychology); Artificial intelligence; Feature selection; Computer science; Independent component analysis; Wavelet; Feature vector; Joint (building); Fractal dimension; Principal component analysis; Feature extraction; Ultrasound; Radio frequency; Fractal; Mathematics; Medicine; Engineering; Telecommunications; Radiology","score_opus":0.026300631491390704,"score_gpt":0.25928850080494464,"score_spread":0.23298786931355395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021727929","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.19163013,0.0000058838164,0.8075298,0.00021226732,0.00025465337,0.00012680549,0.000023888391,0.00021351593,0.0000030485774],"genre_scores_gemma":[0.9721819,0.000011958343,0.027641237,0.00008654806,0.00001556956,0.000032326847,0.000010343009,0.00001121026,0.000008880003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869686,0.00004397228,0.00034457268,0.00023189836,0.00051393156,0.00016877626],"domain_scores_gemma":[0.99929804,0.00004238468,0.00010225297,0.00026477332,0.000111348454,0.00018122738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032918793,0.00013241127,0.00022782241,0.00070995605,0.000036342914,0.00004602305,0.00021368395,0.00008735994,0.00001283208],"category_scores_gemma":[0.000008315427,0.00012863397,0.000112040376,0.0013297652,0.000035828605,0.00021402432,0.0000024331873,0.00017905136,0.0000020152622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000093119625,0.00020028497,0.000031669177,0.00002129531,0.00013938524,0.0000026010362,0.00059122336,0.5895959,0.40731084,0.000095480915,0.0000034470177,0.001998537],"study_design_scores_gemma":[0.00024003239,0.000053528376,0.0005175053,0.000031372234,0.000051088253,0.0000029078867,0.0000061276655,0.76253253,0.23632689,0.000007218178,0.00011389806,0.000116931995],"about_ca_topic_score_codex":0.00009796602,"about_ca_topic_score_gemma":0.000004576913,"teacher_disagreement_score":0.7805518,"about_ca_system_score_codex":0.0001535724,"about_ca_system_score_gemma":0.0001404943,"threshold_uncertainty_score":0.52455413},"labels":[],"label_agreement":null},{"id":"W2022389051","doi":"10.1016/j.neuroimage.2005.11.006","title":"Linear aspects of transformation from interictal epileptic discharges to BOLD fMRI signals in an animal model of occipital epilepsy","year":2006,"lang":"en","type":"article","venue":"NeuroImage","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Robarts Clinical Trials; Western University","funders":"Canadian Institutes of Health Research; Canada Research Chairs","keywords":"Ictal; EEG-fMRI; Electroencephalography; Neuroscience; Epilepsy; Functional magnetic resonance imaging; Haemodynamic response; Psychology; Epileptogenesis; Medicine; Internal medicine","score_opus":0.022016893588350694,"score_gpt":0.2721908572004397,"score_spread":0.250173963612089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022389051","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.646976,0.000005218311,0.35148585,0.00030832307,0.000021670126,0.0001813529,0.000034513298,0.000080054524,0.0009070618],"genre_scores_gemma":[0.9656897,0.00000180892,0.034076765,0.00015616663,0.000025035833,0.0000122992205,0.000017756349,0.000012502467,0.000007957923],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863,0.0001100134,0.0005145668,0.00030125154,0.000270161,0.00017399607],"domain_scores_gemma":[0.9993157,0.000052794698,0.00014029766,0.00035666523,0.00007859113,0.000055990422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019693987,0.00013811307,0.00024561601,0.00024070231,0.000020416186,0.00004922641,0.0005123749,0.00005667934,0.000010613382],"category_scores_gemma":[0.000019601357,0.0001404725,0.00006786018,0.00032316102,0.000036824567,0.001166918,0.000081370534,0.00013504417,0.0000069603325],"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.000056780504,0.00032295613,0.00096841727,0.000016160227,0.00000256058,0.0000055657633,0.00340005,0.008157933,0.96902627,0.017141672,0.00007812882,0.000823516],"study_design_scores_gemma":[0.00025898905,0.0006890254,0.02060139,0.000027604432,0.0000035990258,0.0000013545,0.000032878525,0.57908034,0.39369884,0.005449998,0.000009062749,0.00014691908],"about_ca_topic_score_codex":0.00014032926,"about_ca_topic_score_gemma":0.00007747837,"teacher_disagreement_score":0.5753274,"about_ca_system_score_codex":0.000016562182,"about_ca_system_score_gemma":0.000040331422,"threshold_uncertainty_score":0.57283026},"labels":[],"label_agreement":null},{"id":"W2023331163","doi":"10.1109/icassp.2013.6637805","title":"Independent component analysis on Lie groups for multi-object analysis of first episode depression","year":2013,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Queen's University; University of British Columbia","funders":"","keywords":"Lie group; Pattern recognition (psychology); Similarity (geometry); Artificial intelligence; Orientation (vector space); Mathematics; Psychology; Surface (topology); Object (grammar); Component analysis; Tangent space; Independent component analysis; Component (thermodynamics); Computer vision; Computer science; Pure mathematics; Geometry; Image (mathematics); Physics","score_opus":0.029505614267492184,"score_gpt":0.29413000349681206,"score_spread":0.26462438922931986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023331163","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.14513507,0.000016754551,0.85341805,0.00032489063,0.00002931021,0.00043107697,0.000006000153,0.00020016677,0.0004386641],"genre_scores_gemma":[0.85709316,0.0000075391904,0.14223698,0.0002836627,0.0000075134176,0.00015010725,0.000030696516,0.0000067289398,0.00018360236],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830365,0.00009889557,0.00046457944,0.00050242693,0.00041434326,0.00021609312],"domain_scores_gemma":[0.9982677,0.0002705366,0.00025496318,0.0008814331,0.00022694944,0.00009840055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045447148,0.00016804424,0.00048262847,0.0013316448,0.000112449576,0.00013249007,0.00075236167,0.00010609306,0.00012790917],"category_scores_gemma":[0.00004403128,0.00013242896,0.00051736133,0.002170329,0.0000268079,0.0003470271,0.0002048899,0.00009789288,0.000018479313],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009289698,0.0041731084,0.73340905,0.00009716191,0.017524762,0.0000048070115,0.005739727,0.11345397,0.005854755,0.07970886,0.0066334354,0.033307455],"study_design_scores_gemma":[0.00024436074,0.00007658322,0.18410364,0.0000056694466,0.00050359213,1.6600877e-7,0.000025519463,0.7985148,0.015945777,0.0003010762,0.00012968639,0.00014914329],"about_ca_topic_score_codex":0.0012932068,"about_ca_topic_score_gemma":0.0020700484,"teacher_disagreement_score":0.7119581,"about_ca_system_score_codex":0.000051086772,"about_ca_system_score_gemma":0.000010951084,"threshold_uncertainty_score":0.54002964},"labels":[],"label_agreement":null},{"id":"W2023425418","doi":"10.1109/tifs.2013.2264462","title":"Extracting Spread-Spectrum Hidden Data From Digital Media","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Blind Source Separation Techniques","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":"Eion (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada; University at Buffalo","keywords":"Computer science; Spread spectrum; Embedding; Host (biology); Autocorrelation; Algorithm; Autocorrelation matrix; Artificial intelligence; Channel (broadcasting); Mathematics; Telecommunications; Statistics","score_opus":0.02086315380313131,"score_gpt":0.23862696085099117,"score_spread":0.21776380704785986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023425418","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.026248232,0.000009477567,0.9694307,0.0011831648,0.0002994979,0.00021739732,0.000257413,0.00033360822,0.0020205514],"genre_scores_gemma":[0.98555684,0.000038621645,0.013634626,0.00054913014,0.000028565973,0.000015235179,0.00016036449,0.0000055781197,0.000011009418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989705,0.000024014775,0.0003467923,0.00020670387,0.00028531207,0.00016665233],"domain_scores_gemma":[0.9987986,0.00019489812,0.00013532773,0.0006689627,0.00009320646,0.00010897429],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0001650722,0.00014054649,0.0001282558,0.00013513268,0.00019186079,0.0010767687,0.0004951072,0.000100139194,0.00005970083],"category_scores_gemma":[0.000016481123,0.00013377723,0.00003655914,0.00018280704,0.000051838193,0.011072401,0.000018343442,0.0002865834,0.00019487664],"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.000019265171,0.00013683292,0.000068767185,0.000021271164,0.00007514941,0.0000017166535,0.021835199,0.00015217537,0.000052720035,0.047588564,0.008121959,0.9219264],"study_design_scores_gemma":[0.00086286006,0.00014138328,0.0013033856,0.00005665371,0.000023845667,0.000030364024,0.0009629471,0.74853235,0.008550001,0.22365017,0.015155136,0.0007308652],"about_ca_topic_score_codex":0.0002844009,"about_ca_topic_score_gemma":0.000075996206,"teacher_disagreement_score":0.9593086,"about_ca_system_score_codex":0.000023442251,"about_ca_system_score_gemma":0.00003913236,"threshold_uncertainty_score":0.9999602},"labels":[],"label_agreement":null},{"id":"W2024666521","doi":"10.1109/tvt.2011.2181436","title":"Blind Recursive Subspace-Based Identification of Time-Varying Wideband MIMO Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Blind Source Separation 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; InterDigital (Canada)","funders":"","keywords":"Orthogonal frequency-division multiplexing; MIMO; Algorithm; Computer science; Channel (broadcasting); Wideband; Signal subspace; MIMO-OFDM; Subspace topology; Signal-to-noise ratio (imaging); Precoding; Control theory (sociology); Electronic engineering; Noise (video); Mathematics; Telecommunications; Engineering; Artificial intelligence","score_opus":0.023987166516635836,"score_gpt":0.249079272841104,"score_spread":0.2250921063244682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024666521","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.053747423,0.00004637931,0.9432731,0.0012650064,0.0002130833,0.00040907218,0.000005665272,0.0008217473,0.00021847186],"genre_scores_gemma":[0.96797454,0.000021365047,0.03155729,0.00014197506,0.000006348778,0.00012388524,0.0000023399248,0.00001973498,0.00015252508],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99850094,0.000108629785,0.0004329589,0.00047023123,0.00024271166,0.0002445029],"domain_scores_gemma":[0.99842083,0.000058649995,0.0002667195,0.0009410169,0.0002604752,0.000052279414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036759325,0.00018921882,0.00025111836,0.0011093554,0.0001461373,0.00003495677,0.000781122,0.00036896172,0.000043636293],"category_scores_gemma":[0.000016542645,0.00020016418,0.00012837508,0.0012467202,0.00019380676,0.0003250453,0.0000049408964,0.00035673485,0.0001061461],"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.000352919,0.002878173,0.00008433624,0.00011490483,0.00039194,0.00007561084,0.0054390305,0.024349166,0.8445474,0.044506088,0.00048443145,0.07677601],"study_design_scores_gemma":[0.00047281536,0.00026879,0.000013983278,0.000039400365,0.000024339839,0.00001554523,0.000025145198,0.022581134,0.9697254,0.006499612,0.00014716768,0.00018669739],"about_ca_topic_score_codex":0.000022245946,"about_ca_topic_score_gemma":0.0000070285964,"teacher_disagreement_score":0.9142271,"about_ca_system_score_codex":0.00005099986,"about_ca_system_score_gemma":0.0000843062,"threshold_uncertainty_score":0.81624585},"labels":[],"label_agreement":null},{"id":"W2025844008","doi":"10.1002/hbm.21010","title":"Independent component analysis (ICA) of generalized spike wave discharges in fMRI: Comparison with general linear model‐based EEG‐fMRI","year":2010,"lang":"en","type":"article","venue":"Human Brain Mapping","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":57,"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; Montreal Neurological Institute and Hospital","funders":"Canadian Institutes of Health Research","keywords":"Independent component analysis; General linear model; Functional magnetic resonance imaging; Electroencephalography; EEG-fMRI; Linear model; Neuroscience; Pattern recognition (psychology); Psychology; Rolandic epilepsy; Artificial intelligence; Mathematics; Statistics; Computer science","score_opus":0.04488527671287883,"score_gpt":0.30133079139851116,"score_spread":0.2564455146856323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025844008","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.48472834,0.000009505664,0.5136744,0.0009442017,0.000021984835,0.00020473247,0.00000305537,0.00012866715,0.00028513678],"genre_scores_gemma":[0.7695344,9.0211915e-7,0.22976087,0.00047368938,0.00003049882,0.00003821594,0.000047011556,0.000016266054,0.00009811613],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740803,0.0002489192,0.00072743726,0.00061734556,0.00062708027,0.00037119264],"domain_scores_gemma":[0.9983147,0.00008797496,0.00041007498,0.0009268059,0.00013673963,0.000123718],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010853811,0.00027758087,0.0006331987,0.0009785375,0.00017305078,0.0001456426,0.0007950034,0.00014834959,0.00003805616],"category_scores_gemma":[0.000018165149,0.00025279328,0.00018301471,0.0010244073,0.00011645075,0.00030763654,0.00022617794,0.0005414297,0.0000029369262],"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.000034977304,0.0006509892,0.045497306,0.000062935804,0.00025693196,0.000022011633,0.005830085,0.24594013,0.55013764,0.15032026,0.00063462363,0.0006121154],"study_design_scores_gemma":[0.0008019106,0.00006334949,0.048605327,0.000029279667,0.00002761344,0.000001998478,0.00003934858,0.9410845,0.007360105,0.00141636,0.00027206726,0.00029811118],"about_ca_topic_score_codex":0.00023439503,"about_ca_topic_score_gemma":0.0010879418,"teacher_disagreement_score":0.6951444,"about_ca_system_score_codex":0.000052639985,"about_ca_system_score_gemma":0.000090955895,"threshold_uncertainty_score":0.99999243},"labels":[],"label_agreement":null},{"id":"W2025938588","doi":"10.1016/j.neuroimage.2005.08.067","title":"Data-driven parceling and entropic inference in MEG","year":2006,"lang":"en","type":"article","venue":"NeuroImage","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Magnetoencephalography; Principle of maximum entropy; Cluster analysis; Computer science; Posterior probability; Inference; Inverse problem; Probability distribution; Entropy (arrow of time); Multivariate statistics; Inverse; Algorithm; Statistics; Artificial intelligence; Mathematics; Bayesian probability; Physics; Biology; Mathematical analysis","score_opus":0.03806582683476401,"score_gpt":0.2986074224957653,"score_spread":0.26054159566100127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025938588","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.32955602,0.00008288118,0.6624545,0.0016054988,0.000056060948,0.00018115091,0.000007982151,0.0003881889,0.0056677563],"genre_scores_gemma":[0.9664087,0.000022156722,0.033035375,0.00043438212,0.000021018976,0.0000040871832,0.000008006563,0.000004731952,0.00006150459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917185,0.00008013837,0.00015262578,0.0003370914,0.00012253526,0.00013576317],"domain_scores_gemma":[0.99921536,0.0001095624,0.00004208446,0.0005902103,0.000017789547,0.00002497143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014091335,0.00007224731,0.000084940846,0.00008860051,0.000032628523,0.00017794079,0.0006314626,0.000025964537,0.0000030065964],"category_scores_gemma":[0.00006398506,0.00007233491,0.000008116035,0.00017339738,0.000029053012,0.00064676895,0.00047263762,0.00013226742,0.000009422823],"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.000014876766,0.00050105614,0.17654489,0.00007982905,0.000009274293,0.0005109921,0.001729092,0.0027513467,0.08690188,0.62835956,0.0067660525,0.09583118],"study_design_scores_gemma":[0.00055552775,0.0000853444,0.26753595,0.000028941988,0.0000036726608,0.000016441183,0.000011377325,0.68965197,0.004385096,0.012088407,0.025300885,0.00033641446],"about_ca_topic_score_codex":0.00009786746,"about_ca_topic_score_gemma":0.00010644481,"teacher_disagreement_score":0.6869006,"about_ca_system_score_codex":0.0000071751765,"about_ca_system_score_gemma":0.000023584518,"threshold_uncertainty_score":0.2949732},"labels":[],"label_agreement":null},{"id":"W2026060111","doi":"10.1088/0031-9155/52/19/005","title":"Validation of the flash-evoked response from fetal MEG","year":2007,"lang":"en","type":"article","venue":"Physics in Medicine and Biology","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Coquitlam College; University of Toronto","funders":"National Institute of Biomedical Imaging and Bioengineering; National Institute of Neurological Disorders and Stroke; National Institutes of Health","keywords":"Fetal movement; Magnetoencephalography; Fetal head; In utero; Latency (audio); Computer science; Speech recognition; Fetus; Electroencephalography; Medicine; Pregnancy; Telecommunications","score_opus":0.1381651616379715,"score_gpt":0.3875133581026257,"score_spread":0.24934819646465423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026060111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7594918,0.000047584213,0.23764715,0.0021750424,0.00009028078,0.00005901211,8.049998e-7,0.000018196743,0.00047010434],"genre_scores_gemma":[0.9954289,0.000012749777,0.003886794,0.0005802872,0.00007008834,0.0000015668113,0.0000029015011,0.0000015449571,0.000015147213],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99946916,0.0001333228,0.00014846057,0.00011978995,0.000057049558,0.000072198345],"domain_scores_gemma":[0.9992844,0.0004031221,0.00007551506,0.00019099055,0.00003192297,0.000014085387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009168557,0.000046352325,0.000108000604,0.000041102456,0.000019857243,0.000002637709,0.00021220763,0.00004406824,0.0000017030378],"category_scores_gemma":[0.00011306237,0.000027850243,0.000013631613,0.0002096232,0.0001348293,0.0000527227,0.00008421484,0.0000886298,8.251532e-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.00013519017,0.00006704989,0.01721798,0.000005172907,0.000014879967,0.0000014385512,0.0060127806,0.000010714218,0.5872006,0.33067086,0.00056742766,0.05809591],"study_design_scores_gemma":[0.00080865796,0.00034679644,0.05188316,0.000054093078,0.0000077368295,0.0000024036237,0.00015245406,0.0022452152,0.47393617,0.4683793,0.002069147,0.00011484808],"about_ca_topic_score_codex":0.00007282949,"about_ca_topic_score_gemma":0.000011937683,"teacher_disagreement_score":0.23593709,"about_ca_system_score_codex":0.0000074396953,"about_ca_system_score_gemma":0.000018418836,"threshold_uncertainty_score":0.11357},"labels":[],"label_agreement":null},{"id":"W2026499148","doi":"10.1109/mwscas.2010.5548912","title":"Ill condition identification for linear prediction-based MIMO-OFDM channel estimation","year":2010,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Concordia University","funders":"","keywords":"MIMO; Algorithm; Channel (broadcasting); Orthogonal frequency-division multiplexing; MIMO-OFDM; Computer science; SIGNAL (programming language); Control theory (sociology); Identification (biology); Linear prediction; Mathematics; Mathematical optimization; Telecommunications; Artificial intelligence","score_opus":0.01614495554167841,"score_gpt":0.29262830821556773,"score_spread":0.27648335267388935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026499148","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.0071434653,0.0000018265061,0.9874174,0.0028257535,0.00049402035,0.00057475717,0.000020963076,0.0009764018,0.00054539513],"genre_scores_gemma":[0.7183365,5.337059e-7,0.2800462,0.00077861006,0.00007636943,0.00022543795,0.00018664364,0.000008261939,0.00034141296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990933,0.000030449772,0.00027131982,0.00028928104,0.00019089306,0.00012478403],"domain_scores_gemma":[0.9988671,0.00011321361,0.00013866668,0.00042412075,0.00040345642,0.00005344366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054111663,0.000093367904,0.00007873731,0.00016763419,0.00015767557,0.00016593529,0.0003088698,0.00011376471,0.000025705067],"category_scores_gemma":[0.00018435504,0.00009260771,0.000054303448,0.00020587671,0.000031674845,0.0008012313,0.000021008811,0.000114610484,0.000052030253],"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.000031967345,0.0005133951,0.00018835948,0.00010064123,0.000029926912,7.463323e-7,0.0015191406,0.01506657,0.15432163,0.7562161,0.029359275,0.042652227],"study_design_scores_gemma":[0.00021031876,0.00005179471,0.00080525485,0.0000044595868,0.00000393655,0.0000013916009,0.0000060671837,0.8336664,0.15013908,0.012950733,0.002075028,0.00008554554],"about_ca_topic_score_codex":0.000011850952,"about_ca_topic_score_gemma":0.000018569162,"teacher_disagreement_score":0.8185998,"about_ca_system_score_codex":0.000019473027,"about_ca_system_score_gemma":0.00006867067,"threshold_uncertainty_score":0.3776433},"labels":[],"label_agreement":null},{"id":"W2026700657","doi":"10.1121/1.4792247","title":"Sparse-representation algorithms for blind estimation of acoustic-multipath channels","year":2013,"lang":"en","type":"article","venue":"The Journal of the Acoustical Society of America","topic":"Blind Source Separation Techniques","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":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Matching pursuit; Sparse approximation; Computer science; Channel (broadcasting); Algorithm; Blind deconvolution; Multipath propagation; Deconvolution; Constraint (computer-aided design); Least-squares function approximation; Representation (politics); Compressed sensing; Identification (biology); Mathematics; Telecommunications; Statistics","score_opus":0.03513170271341455,"score_gpt":0.3131254387828099,"score_spread":0.27799373606939537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026700657","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.0076417145,0.0000435481,0.98596436,0.0056785173,0.00018208209,0.0004399596,0.0000039307574,0.000020072603,0.000025792873],"genre_scores_gemma":[0.5253241,0.000047144516,0.4740305,0.00048881397,0.00006215517,0.000006912636,4.1088248e-7,0.000006486838,0.00003345488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842197,0.00016386267,0.0006265536,0.00009966177,0.0005198997,0.00016808178],"domain_scores_gemma":[0.9969822,0.0009077511,0.0010513704,0.0003836794,0.0006162069,0.000058784764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008849973,0.000111007255,0.00028038368,0.000033618526,0.000117312266,0.000045572877,0.0010440863,0.00006898259,0.000012095903],"category_scores_gemma":[0.00042113056,0.0000624968,0.00032497148,0.00036035283,0.00031047672,0.00039807562,0.00017676892,0.00022244446,0.0000022913973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009937544,0.0004209768,0.00003127637,0.00009059748,0.00024474695,1.7891448e-7,0.008900485,0.70426804,0.06582444,0.00025347655,0.04069748,0.17916892],"study_design_scores_gemma":[0.00039001985,0.00025196275,0.00030960774,0.000039709947,0.000073604686,0.0000120477625,0.0005550165,0.9703831,0.020459983,0.007384694,0.00007329162,0.00006697822],"about_ca_topic_score_codex":0.000056911394,"about_ca_topic_score_gemma":1.09987354e-7,"teacher_disagreement_score":0.51768243,"about_ca_system_score_codex":0.000034147408,"about_ca_system_score_gemma":0.00009133844,"threshold_uncertainty_score":0.25485456},"labels":[],"label_agreement":null},{"id":"W2026930460","doi":"10.1109/isspa.2012.6310615","title":"An exponential approach to signal parameter estimation","year":2012,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Université Laval","funders":"","keywords":"Observable; Exponential function; SIGNAL (programming language); Gaussian; Estimation theory; Function (biology); Limit (mathematics); Noise (video); Computer science; Applied mathematics; Stochastic process; Mathematics; Statistical physics; Algorithm; Statistics; Artificial intelligence; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.031078884792217425,"score_gpt":0.2943227235898671,"score_spread":0.2632438387976497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026930460","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.020219306,0.0000031672603,0.9693839,0.00016843533,0.000057271656,0.00015748633,2.0692065e-7,0.00049861585,0.009511589],"genre_scores_gemma":[0.51195055,5.4250197e-8,0.48731592,0.0006176764,0.000028386183,0.000020994776,0.0000024227647,0.0000026365713,0.000061343024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927133,0.00007728369,0.00011675579,0.00016869196,0.0001849289,0.00018098301],"domain_scores_gemma":[0.9994359,0.000023939827,0.000025732617,0.00033817557,0.000029424682,0.00014685452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038041247,0.00007010522,0.00006287748,0.0000908596,0.00004613709,0.00016787752,0.00037225135,0.000042031177,0.000028852719],"category_scores_gemma":[0.000010600162,0.00006089828,0.000023387112,0.00017361861,0.000008760532,0.0014688738,0.000068293295,0.000053012216,0.00011896895],"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.000007230114,0.0007276807,0.0004835047,0.000005288841,0.000008938919,2.3942073e-7,0.007784221,0.0023408432,0.008071861,0.85893023,0.005819515,0.11582046],"study_design_scores_gemma":[0.000105077765,0.00012881253,0.0027224806,0.0000021190976,0.0000029169735,0.0000098455575,0.000035414032,0.91672605,0.07377316,0.0045826924,0.0016670357,0.0002443814],"about_ca_topic_score_codex":0.000011757116,"about_ca_topic_score_gemma":3.6023644e-7,"teacher_disagreement_score":0.9143852,"about_ca_system_score_codex":0.000014200574,"about_ca_system_score_gemma":0.000012021211,"threshold_uncertainty_score":0.24833599},"labels":[],"label_agreement":null},{"id":"W2027411766","doi":"10.1152/jn.90896.2008","title":"Resolving Precise Temporal Processing Properties of the Auditory System Using Continuous Stimuli","year":2009,"lang":"en","type":"article","venue":"Journal of Neurophysiology","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":269,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Auditory system; Computer science; Auditory scene analysis; Speech recognition; Generalizability theory; Noise (video); Auditory masking; Acoustics; Artificial intelligence; Perception; Psychology; Neuroscience; Octave (electronics); Physics","score_opus":0.03606127629310299,"score_gpt":0.2672881402956619,"score_spread":0.2312268640025589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027411766","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9615367,0.00013803318,0.037152,0.00042694827,0.0004956258,0.00012360567,2.1913871e-7,0.000051473606,0.00007539833],"genre_scores_gemma":[0.9892955,0.0000037408308,0.010249161,0.00022770705,0.00019701451,4.9581286e-7,2.3598949e-8,0.000006441455,0.000019948104],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861,0.00035138527,0.00053069566,0.00013451213,0.00023388841,0.00013948228],"domain_scores_gemma":[0.99838185,0.000034168617,0.00091531716,0.0002722231,0.00036019727,0.000036244426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016995976,0.00010252848,0.00029761725,0.0001121245,0.00010460494,0.000051059338,0.0007997643,0.000056176894,3.2285533e-7],"category_scores_gemma":[0.00010181398,0.00006256066,0.00010878868,0.00022072699,0.000081994585,0.00040960842,0.00010890458,0.0002719047,4.6775278e-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.000042762676,0.00005529662,0.000027179667,0.0000400118,0.0000062755107,0.000017691002,0.0006519256,0.0034898983,0.9916925,0.00028028205,0.00008960224,0.0036065646],"study_design_scores_gemma":[0.0018523785,0.0052040718,0.049332622,0.0033675407,0.0001102442,0.0024893244,0.0005901416,0.53686345,0.39486137,0.0024142477,0.0021088163,0.0008057572],"about_ca_topic_score_codex":0.0000028531827,"about_ca_topic_score_gemma":8.960479e-8,"teacher_disagreement_score":0.59683114,"about_ca_system_score_codex":0.00003533452,"about_ca_system_score_gemma":0.00022527207,"threshold_uncertainty_score":0.25511497},"labels":[],"label_agreement":null},{"id":"W2028479624","doi":"10.1007/s10463-014-0486-5","title":"The complex multinormal distribution, quadratic forms in complex random vectors and an omnibus goodness-of-fit test for the complex normal distribution","year":2014,"lang":"en","type":"article","venue":"Annals of the Institute of Statistical Mathematics","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"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","keywords":"Goodness of fit; Anderson–Darling test; Mathematics; Omnibus test; Kolmogorov–Smirnov test; Asymptotic distribution; Empirical distribution function; Normality; Normal distribution; Distribution (mathematics); Quadratic equation; Applied mathematics; Statistical hypothesis testing; Statistics; Mathematical analysis","score_opus":0.09581776700980571,"score_gpt":0.35982630148065636,"score_spread":0.26400853447085065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028479624","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.03451281,0.000021040922,0.9615335,0.0020503413,0.00007008244,0.0008261032,0.00086580095,0.000033338136,0.00008698379],"genre_scores_gemma":[0.9451211,0.000022687178,0.054502714,0.00011017354,0.000020603,0.000042940457,0.00016581947,0.000008763098,0.0000051785564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793345,0.00014884285,0.0009946604,0.00019958502,0.00043119106,0.0002922504],"domain_scores_gemma":[0.9947601,0.0034466353,0.0006200906,0.000687637,0.00040969535,0.000075866825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017842656,0.00020082633,0.00046270387,0.00003291425,0.00038064498,0.00010474424,0.0011092983,0.00007070589,0.0000036714343],"category_scores_gemma":[0.0024702942,0.00010931023,0.000100666206,0.00029547725,0.0010550426,0.00036286868,0.0002689536,0.00015065771,7.245969e-7],"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.00005747214,0.00036363155,0.00042095326,0.00023295637,0.000030414893,2.4168517e-7,0.00061627914,0.00067653967,0.0004957348,0.99197966,0.0013546639,0.0037714427],"study_design_scores_gemma":[0.0012461183,0.00037983706,0.050361607,0.00010662761,0.000043222048,0.000010715959,0.00015750117,0.80664253,0.002650898,0.1352825,0.0029040591,0.00021440463],"about_ca_topic_score_codex":0.000109609944,"about_ca_topic_score_gemma":0.00018041376,"teacher_disagreement_score":0.9106083,"about_ca_system_score_codex":0.000017838587,"about_ca_system_score_gemma":0.00007125179,"threshold_uncertainty_score":0.4457542},"labels":[],"label_agreement":null},{"id":"W2028577761","doi":"10.1049/ip-vis:20040463","title":"Simple and practical cyclostationary beamforming algorithms","year":2004,"lang":"en","type":"article","venue":"IEE Proceedings - Vision Image and Signal Processing","topic":"Blind Source Separation Techniques","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":"Concordia University","funders":"","keywords":"Cyclostationary process; Algorithm; Computer science; Convergence (economics); SIGNAL (programming language); Simple (philosophy); Beamforming; Interference (communication); Telecommunications","score_opus":0.015446153105200151,"score_gpt":0.31767224202735356,"score_spread":0.3022260889221534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028577761","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.051989377,0.00021596941,0.94125766,0.004182758,0.000015220253,0.00019719836,9.685464e-7,0.000372911,0.0017679624],"genre_scores_gemma":[0.60947406,0.000038202645,0.3893877,0.0010024341,0.00004920778,0.000013264798,0.0000020224602,0.000012957752,0.00002012603],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985677,0.000010267222,0.00029616195,0.0004925959,0.0003698494,0.00026345244],"domain_scores_gemma":[0.9992149,0.000057228066,0.00016977775,0.00006711443,0.00029916578,0.0001917968],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005258607,0.00018410171,0.00017075933,0.0001741467,0.00046123876,0.0012450813,0.00014926275,0.00009158496,0.000004406792],"category_scores_gemma":[0.00010336521,0.00016712048,0.000026165446,0.00033023645,0.00012448546,0.005292327,0.00022107325,0.00025851166,0.0000043288096],"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.00008827422,0.0004516905,0.0007861045,0.00064438616,0.000031522985,0.00012754131,0.021212302,0.000040598632,0.21243924,0.057567008,0.0025132329,0.7040981],"study_design_scores_gemma":[0.002718537,0.0013110553,0.0029132976,0.0007994417,0.00005437365,0.0020829947,0.0022915644,0.3492361,0.17102039,0.4576899,0.008251637,0.0016307065],"about_ca_topic_score_codex":0.00000863144,"about_ca_topic_score_gemma":3.1353176e-7,"teacher_disagreement_score":0.7024674,"about_ca_system_score_codex":0.00003157144,"about_ca_system_score_gemma":0.00015710368,"threshold_uncertainty_score":0.99979174},"labels":[],"label_agreement":null},{"id":"W2028709371","doi":"10.1016/j.measurement.2013.06.014","title":"Using ultrasonic pulse-echo B-scan signals for estimation of time of flight","year":2013,"lang":"en","type":"article","venue":"Measurement","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"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":"Cramér–Rao bound; Estimator; Minimum-variance unbiased estimator; Upper and lower bounds; Time of flight; Algorithm; Monte Carlo method; Mathematics; Statistics; Computer science; Physics; Mathematical analysis","score_opus":0.07029491777965258,"score_gpt":0.2927592763261653,"score_spread":0.2224643585465127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028709371","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.027932873,0.00006233039,0.9704919,0.00024115585,0.000033901906,0.0006244219,0.0000016352642,0.00006766885,0.0005441385],"genre_scores_gemma":[0.80228895,0.0000013151521,0.19757427,0.00005339385,0.000008047073,0.000041674142,0.0000012504038,0.00000553457,0.000025590485],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988584,0.00006362554,0.00032430372,0.00015601097,0.00047301286,0.00012464651],"domain_scores_gemma":[0.9989106,0.0000387492,0.00021774322,0.00029602487,0.00050279405,0.00003406093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009670181,0.00008098397,0.00016005323,0.00009941902,0.000033425837,0.00003638704,0.00030204267,0.00004003316,0.000045376237],"category_scores_gemma":[0.00008910885,0.00007496014,0.00006238745,0.0001653744,0.000020340914,0.00030385004,0.000028827086,0.000033652694,0.0000102021295],"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.0000040561895,0.000118750744,0.00006352171,0.000057410543,0.000029402117,4.8886474e-8,0.00090499764,0.0065478943,0.9692043,0.0021402193,0.0010166597,0.01991276],"study_design_scores_gemma":[0.0001378591,0.00009132201,0.00036524885,0.00005392574,0.0000074906584,5.8663954e-7,0.000006249755,0.25952938,0.73706484,0.0026099589,0.000064638,0.00006852231],"about_ca_topic_score_codex":0.00006969864,"about_ca_topic_score_gemma":0.000002638092,"teacher_disagreement_score":0.77435607,"about_ca_system_score_codex":0.000080202284,"about_ca_system_score_gemma":0.00009659498,"threshold_uncertainty_score":0.30567858},"labels":[],"label_agreement":null},{"id":"W2033606587","doi":"10.1109/pacrim.2009.5291397","title":"On convergence properties of subspace trackers based on orthogonal iteration","year":2009,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Subspace topology; Convergence (economics); Mathematics; Krylov subspace; Algorithm; Orthographic projection; Applied mathematics; Power iteration; Eigendecomposition of a matrix; Context (archaeology); Eigenvalues and eigenvectors; Orthogonal matrix; Mathematical optimization; Computer science; Iterative method; Orthogonal basis; Mathematical analysis","score_opus":0.019116853477587705,"score_gpt":0.24265064026708516,"score_spread":0.22353378678949745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033606587","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.25125387,0.0000067134174,0.7371655,0.0040999115,0.000053438114,0.00019180158,4.1359354e-7,0.00027877308,0.006949533],"genre_scores_gemma":[0.9809726,0.0000011969636,0.014981733,0.0037642661,0.0000070559063,0.000005258552,0.0000012898308,0.0000025651566,0.00026403117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992045,0.000065389955,0.00015728289,0.00019463839,0.00028424076,0.00009392057],"domain_scores_gemma":[0.9995303,0.00003118203,0.00006462169,0.00025272663,0.000087511675,0.000033655884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020582306,0.000084067884,0.00008631442,0.00011122141,0.000038164584,0.000055067612,0.00023261044,0.000040751547,0.000028359575],"category_scores_gemma":[0.000031184598,0.000064791726,0.000038644568,0.00020395708,0.00002186075,0.00027670446,0.0000086346245,0.000072054194,0.000020316802],"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.000119066026,0.00053703104,0.0003179839,0.000014367893,0.000005328683,0.0000033086799,0.0014913268,0.0069035804,0.051099185,0.92319834,0.003138661,0.013171834],"study_design_scores_gemma":[0.00018647934,0.0008221267,0.0026386005,0.000045219575,0.0000011433459,7.4462565e-7,0.0000106851,0.41244465,0.58197016,0.0016152466,0.00013797155,0.00012694915],"about_ca_topic_score_codex":0.0000035687594,"about_ca_topic_score_gemma":0.000003624754,"teacher_disagreement_score":0.92158306,"about_ca_system_score_codex":0.000016036498,"about_ca_system_score_gemma":0.0000585186,"threshold_uncertainty_score":0.264213},"labels":[],"label_agreement":null},{"id":"W2034067888","doi":"10.1109/isspa.2012.6310458","title":"Learning sparse dictionary for long-term biomedical signal classification and clustering","year":2012,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"Pattern recognition (psychology); Cluster analysis; Computer science; Wavelet; Artificial intelligence; Sparse approximation; Principal component analysis; Discriminative model; Dimensionality reduction; Term (time); Sparse PCA; K-SVD; Sparse matrix; SIGNAL (programming language); Machine learning","score_opus":0.04669571653996555,"score_gpt":0.3047219144552303,"score_spread":0.2580261979152647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034067888","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.046714395,0.000038118364,0.9511011,0.00092073536,0.0000867554,0.00014697654,3.0405246e-7,0.00035226133,0.0006393455],"genre_scores_gemma":[0.91533506,0.000010516572,0.08398866,0.00020461099,0.00010471721,0.000038038303,0.000009435129,0.0000054472607,0.00030348598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937564,0.000044897657,0.00013464486,0.00015742582,0.00012697103,0.00016039413],"domain_scores_gemma":[0.99961543,0.00009131704,0.000049458227,0.000114778435,0.000031625685,0.00009737636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042177722,0.000064524545,0.000063883694,0.00008974833,0.0001193007,0.00008066549,0.00013856195,0.00006109915,0.0000180406],"category_scores_gemma":[0.000019217521,0.000058270052,0.000022402382,0.00009939499,0.000036740857,0.0006353049,0.00010309735,0.0000867867,0.000008920253],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037325557,0.0004677398,0.25637695,0.00010183311,0.00004684474,0.0000021989576,0.0058179176,0.00006147093,0.029243564,0.18554375,0.0032605855,0.5190398],"study_design_scores_gemma":[0.00047697505,0.00031709578,0.43944377,0.000028532017,0.000009746669,0.00007056596,0.000098310746,0.5454638,0.003548375,0.00095205,0.009285252,0.00030551365],"about_ca_topic_score_codex":0.000001663538,"about_ca_topic_score_gemma":9.714789e-7,"teacher_disagreement_score":0.8686207,"about_ca_system_score_codex":0.00001926747,"about_ca_system_score_gemma":0.000016426082,"threshold_uncertainty_score":0.23761837},"labels":[],"label_agreement":null},{"id":"W2035349853","doi":"10.3390/s141018370","title":"A Preliminary Study of Muscular Artifact Cancellation in Single-Channel EEG","year":2014,"lang":"en","type":"article","venue":"Sensors","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":79,"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":"Qatar National Research Fund; Fonds National de la Recherche Luxembourg; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Electroencephalography; Artifact (error); Computer science; Channel (broadcasting); Hilbert–Huang transform; Speech recognition; Artificial intelligence; Pattern recognition (psychology); Psychology; Computer vision; Neuroscience; Telecommunications","score_opus":0.02171559706886661,"score_gpt":0.25312034507677195,"score_spread":0.23140474800790534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035349853","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9601267,0.000009208033,0.037791226,0.00016670016,0.000054715132,0.00027982815,1.8219805e-7,0.000117400334,0.0014540252],"genre_scores_gemma":[0.99657464,9.1511856e-7,0.0032578357,0.000055466484,0.0000108127515,0.000009293274,6.6677e-7,0.0000065732197,0.00008379102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898887,0.00022286073,0.00023572148,0.00022742577,0.00020457471,0.000120569304],"domain_scores_gemma":[0.9993568,0.00006126387,0.00010480708,0.00039359735,0.000054306427,0.000029192388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004014033,0.0000816055,0.00013640517,0.00017313182,0.000024853345,0.000024841736,0.00021867744,0.000044617478,0.000003098071],"category_scores_gemma":[0.00005799029,0.00008095473,0.000028319326,0.0003010383,0.000015998487,0.00013760391,0.00006634923,0.00008094747,0.000009252612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028260768,0.00836015,0.034764342,0.00020364743,0.00012026239,0.00008028547,0.30755618,0.43030962,0.036383454,0.022451112,0.0011819394,0.1583064],"study_design_scores_gemma":[0.0012975524,0.0032182909,0.11967906,0.00008099493,0.000012104596,0.0000076859305,0.001184069,0.83373284,0.03456933,0.00481417,0.0009577813,0.0004461137],"about_ca_topic_score_codex":0.00018726857,"about_ca_topic_score_gemma":0.00013563238,"teacher_disagreement_score":0.40342322,"about_ca_system_score_codex":0.00002764003,"about_ca_system_score_gemma":0.000014308651,"threshold_uncertainty_score":0.33012378},"labels":[],"label_agreement":null},{"id":"W2036514319","doi":"10.1109/sips.2010.5624889","title":"A fast convergence two-step procedure for AR modeling of power spectral densities","year":2010,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Ottawa","funders":"","keywords":"Residual; Convergence (economics); Mathematics; Gradient descent; Autoregressive model; Mean squared error; Minification; Spectral density; Function (biology); Algorithm; Applied mathematics; Mathematical optimization; Stochastic gradient descent; Power (physics); Computer science; Statistics; Artificial intelligence; Artificial neural network","score_opus":0.013450952354005907,"score_gpt":0.2678509218108325,"score_spread":0.2543999694568266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036514319","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.17810184,0.0000057044854,0.8174937,0.00040395616,0.00013189403,0.00021651188,0.0000015511399,0.00022291184,0.0034219595],"genre_scores_gemma":[0.6869329,7.556545e-7,0.31246927,0.00025461338,0.000019035797,0.000015615406,6.0828836e-7,0.0000050049507,0.00030217957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924886,0.000011651521,0.00020008536,0.00022070571,0.00015453396,0.00016416422],"domain_scores_gemma":[0.99933124,0.000034088254,0.00006316157,0.00031277756,0.00021334061,0.0000453955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023643574,0.00009181035,0.00012299043,0.000073582145,0.000048647194,0.000059480833,0.0004263272,0.000055595803,0.000030191815],"category_scores_gemma":[0.00003490109,0.00008068286,0.00006162488,0.00012087452,0.00003769083,0.00036467917,0.000074190655,0.00011862771,0.000005804598],"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.000010067713,0.000045605288,0.00018188499,0.00002272122,0.0000097488055,6.89081e-7,0.0023282936,0.0012555616,0.03240009,0.96242666,0.000906402,0.00041227468],"study_design_scores_gemma":[0.0001433229,0.00006697008,0.00003501259,0.0000071491527,0.0000020832063,0.000009920806,0.0001298644,0.9054263,0.083165996,0.010737148,0.00016208756,0.00011412697],"about_ca_topic_score_codex":0.000029201989,"about_ca_topic_score_gemma":0.00011331136,"teacher_disagreement_score":0.95168954,"about_ca_system_score_codex":0.0000062925087,"about_ca_system_score_gemma":0.000099350684,"threshold_uncertainty_score":0.32901517},"labels":[],"label_agreement":null},{"id":"W2036656718","doi":"10.1049/el:20056712","title":"Time-frequency analysis of visual evoked potentials using chirplet transform","year":2005,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Blind Source Separation Techniques","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":"Short-time Fourier transform; Time–frequency analysis; Fourier transform; Transient (computer programming); Evoked potential; Visual evoked potentials; Speech recognition; Computer science; Chirp; Artificial intelligence; Electroencephalography; Pattern recognition (psychology); Fourier analysis; Mathematics; Computer vision; Physics; Optics; Neuroscience; Psychology; Mathematical analysis","score_opus":0.008176093854925875,"score_gpt":0.2664669133501837,"score_spread":0.2582908194952578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036656718","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.39066803,0.00014629163,0.6036668,0.0048910165,0.00001664608,0.00012976542,0.000002290801,0.00024451685,0.00023462597],"genre_scores_gemma":[0.94441926,0.000024483781,0.05316471,0.0022773365,0.000040484407,0.000006230195,0.000013541346,0.000018032506,0.000035899404],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844307,0.00010432663,0.00039322823,0.00031666455,0.00035693112,0.00038578716],"domain_scores_gemma":[0.9992701,0.000038308277,0.00017322194,0.00040516097,0.000059044956,0.000054167707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049747835,0.00015472175,0.00031670058,0.00056689256,0.000078326,0.00007258546,0.0006119129,0.00007003442,0.000036480433],"category_scores_gemma":[0.00001057839,0.00016069585,0.00024887442,0.0013693756,0.000050900242,0.0005523656,0.00003908418,0.00018208363,0.000013232389],"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.000009026916,0.00014310807,0.00006901544,0.000006408415,0.0007478463,0.0000027846002,0.0013213783,0.015384532,0.9575684,0.015088259,0.00053508696,0.009124173],"study_design_scores_gemma":[0.00035211435,0.00016722581,0.00032180912,0.000009764811,0.00038790196,0.000008187507,0.000005551818,0.6754643,0.31969652,0.0011510397,0.0020256336,0.0004100018],"about_ca_topic_score_codex":0.00002738115,"about_ca_topic_score_gemma":0.00003148964,"teacher_disagreement_score":0.6600797,"about_ca_system_score_codex":0.00016592465,"about_ca_system_score_gemma":0.00011492738,"threshold_uncertainty_score":0.6552987},"labels":[],"label_agreement":null},{"id":"W2039140830","doi":"10.1109/ccece.2000.849715","title":"Experimental evaluation of voiceband fractionally-spaced blind equalizer based on the constant modulus algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"QAM; Blind equalization; Quadrature amplitude modulation; Algorithm; Equalizer; Computer science; Constant (computer programming); Constellation; Speech recognition; Telecommunications; Bit error rate; Decoding methods; Equalization (audio); Channel (broadcasting)","score_opus":0.09327978959855726,"score_gpt":0.3308078352607116,"score_spread":0.23752804566215435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039140830","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.008168424,0.000093496485,0.94432294,0.0033504933,0.00012306914,0.0005065456,0.0000031563497,0.00014962905,0.04328223],"genre_scores_gemma":[0.9479837,0.0000018653851,0.049927834,0.0016026004,0.00001960868,0.00007243071,0.000002473532,0.000006117897,0.0003833817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980751,0.0003487665,0.0002260126,0.0002365863,0.000995533,0.000117976546],"domain_scores_gemma":[0.998861,0.00023833108,0.00013380285,0.0004613376,0.00026641405,0.000039076152],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012947574,0.00010653641,0.00010400123,0.00011154525,0.00008947913,0.000075161624,0.00032164273,0.000056478293,0.0013426329],"category_scores_gemma":[0.00007047223,0.000073673065,0.000058044727,0.00028291697,0.000061303064,0.000260507,0.000044491044,0.00010253654,0.000047322817],"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.00008256306,0.0030404148,0.00006339498,0.000009497351,0.00012422565,0.000004997114,0.008071496,0.014825449,0.043165434,0.7159085,0.04727515,0.16742887],"study_design_scores_gemma":[0.00060199347,0.00010791726,0.00005034952,0.0000068522463,0.000004720908,0.0000013772878,0.000077607416,0.83384085,0.16348197,0.0011971196,0.00054754387,0.00008170082],"about_ca_topic_score_codex":0.0000212287,"about_ca_topic_score_gemma":0.0000037610714,"teacher_disagreement_score":0.9398153,"about_ca_system_score_codex":0.00006941574,"about_ca_system_score_gemma":0.000060167466,"threshold_uncertainty_score":0.99957025},"labels":[],"label_agreement":null},{"id":"W2040318028","doi":"10.3389/fneur.2013.00132","title":"Corrigendum: Dense Array EEG Source Estimation in Neocortical Epilepsy","year":2013,"lang":"en","type":"erratum","venue":"Frontiers in Neurology","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":2,"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":"Electroencephalography; Epilepsy; Neuroscience; Computer science; Artificial intelligence; Psychology","score_opus":0.011772582395004024,"score_gpt":0.2415298851278684,"score_spread":0.22975730273286438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040318028","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.001079957,0.00034391973,0.9533309,0.00298266,0.034619544,0.0007667187,0.0000028426891,0.00040346917,0.0064700074],"genre_scores_gemma":[0.05693418,0.0013048664,0.7412119,0.04242594,0.0014498688,0.0020092812,0.0005650576,0.00047531578,0.15362357],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620175,0.0008328956,0.0008121027,0.0010764481,0.00037450087,0.0007023107],"domain_scores_gemma":[0.99825835,0.00009976229,0.00035113376,0.0010806039,0.00007549655,0.00013463786],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0005236403,0.0004353962,0.00077097537,0.0011909383,0.0000575675,0.0001582851,0.001588903,0.001334688,0.000032348344],"category_scores_gemma":[0.0002963745,0.00047699426,0.00011396118,0.0007170174,0.00019572797,0.00045271797,0.00028882164,0.0026956026,0.00010508538],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002242766,0.00008098814,0.003966319,0.00002081507,0.000008299643,0.000096725096,0.0005860705,0.00042613017,0.0000126105315,0.0014973406,0.9823842,0.010898055],"study_design_scores_gemma":[0.00061111595,0.0005707391,0.01577309,0.000057840716,0.000012972327,0.00010746681,0.00001548147,0.48607087,0.00005360052,0.027004067,0.46897987,0.0007428853],"about_ca_topic_score_codex":0.00014024002,"about_ca_topic_score_gemma":0.00010440081,"teacher_disagreement_score":0.51340437,"about_ca_system_score_codex":0.00011197916,"about_ca_system_score_gemma":0.0003143823,"threshold_uncertainty_score":0.9999618},"labels":[],"label_agreement":null},{"id":"W2041766181","doi":"10.1016/j.asoc.2009.02.006","title":"Modified fuzzy c-means and Bayesian equalizer for nonlinear blind channel","year":2009,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bayesian probability; Equalizer; Nonlinear system; Computer science; Fuzzy logic; Channel (broadcasting); Blind equalization; Control theory (sociology); Artificial intelligence; Telecommunications; Physics","score_opus":0.026836367720280908,"score_gpt":0.28822826207893676,"score_spread":0.26139189435865584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041766181","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.006284392,0.000039679082,0.9857583,0.0012813256,0.00007082547,0.00057936285,0.0000024461249,0.0007621115,0.0052215634],"genre_scores_gemma":[0.6474348,0.0000019728125,0.35041308,0.0019829934,0.00010235837,0.000011234982,0.000007859521,0.000012075074,0.000033671175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847364,0.00003516186,0.0003497017,0.00054275076,0.00021162911,0.00038711692],"domain_scores_gemma":[0.9989997,0.00024387824,0.00015295522,0.00040494482,0.00008016326,0.00011836742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070651935,0.00021163642,0.0002570914,0.00014683946,0.00028955584,0.00027371082,0.0005197959,0.00012756913,6.663877e-7],"category_scores_gemma":[0.00003380694,0.00021865345,0.000061718405,0.00028368225,0.00003627189,0.00017824293,0.00016011023,0.00018079225,0.00000534677],"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.000045192333,0.0001402683,0.0000057765574,0.00002962362,0.000023416289,0.0000027298474,0.006019409,0.006580583,0.0016944174,0.760054,0.0008562605,0.22454831],"study_design_scores_gemma":[0.0009960697,0.00011848261,0.00007392804,0.000019279345,0.000007004975,0.000007288788,0.000061806,0.8973181,0.0023118372,0.09748941,0.001262165,0.000334622],"about_ca_topic_score_codex":0.0000034179852,"about_ca_topic_score_gemma":0.0000014673299,"teacher_disagreement_score":0.89073753,"about_ca_system_score_codex":0.000021497111,"about_ca_system_score_gemma":0.00003791476,"threshold_uncertainty_score":0.8916429},"labels":[],"label_agreement":null},{"id":"W2043951364","doi":"10.1117/12.596015","title":"Compensation of intra-frame head motion in PET data with motion corrected independent component analysis (MCICA)","year":2005,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Motion compensation; Computer science; Component (thermodynamics); Frame (networking); Motion (physics); Compensation (psychology); Head (geology); Independent component analysis; Quarter-pixel motion; Artificial intelligence; Computer vision; Physics; Telecommunications; Geology","score_opus":0.017114265038460155,"score_gpt":0.25319606134119926,"score_spread":0.23608179630273912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043951364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95731837,0.000021797938,0.038589492,0.002954806,0.000064604465,0.00053186255,0.000034331846,0.0001232928,0.00036144018],"genre_scores_gemma":[0.7352716,0.000022801369,0.2644606,0.00006532924,0.000060525326,0.000041271418,0.000045902852,0.000017212016,0.000014805862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973884,1.053999e-7,0.0008556031,0.0005239063,0.0009618668,0.00027007452],"domain_scores_gemma":[0.99750507,0.00011911444,0.00064055057,0.00018045679,0.0014726113,0.00008218303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011980246,0.00025513562,0.00047178462,0.0003702901,0.00004792168,0.0001360126,0.0017785984,0.00013352328,0.0000065130203],"category_scores_gemma":[0.00024861906,0.00021973993,0.00026449922,0.0011273994,0.00013977701,0.0014706736,0.0003528624,0.00034525513,7.417284e-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.00015649982,0.000752396,0.0052447347,0.00028785976,0.00095265877,2.1805711e-7,0.0011828681,0.009874853,0.26048392,0.7174139,0.00050133595,0.0031487737],"study_design_scores_gemma":[0.0009921036,0.0002516931,0.020159693,0.0001732935,0.00017781896,0.000015309763,0.00039258084,0.91398406,0.062592246,0.0007048104,0.00027093326,0.0002854491],"about_ca_topic_score_codex":0.000048128724,"about_ca_topic_score_gemma":0.00000719007,"teacher_disagreement_score":0.90410924,"about_ca_system_score_codex":0.0002186199,"about_ca_system_score_gemma":0.000039138456,"threshold_uncertainty_score":0.8960734},"labels":[],"label_agreement":null},{"id":"W2044396573","doi":"10.1109/dsp-spe.2013.6642558","title":"Empirical mode decomposition based sparse dictionary learning with application to signal classification","year":2013,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"K-SVD; Discriminative model; Sparse approximation; Dictionary learning; Computer science; Pattern recognition (psychology); Artificial intelligence; Hilbert–Huang transform; SIGNAL (programming language); Basis (linear algebra); Speech recognition; Feature (linguistics); Feature vector; Data dictionary; Machine learning; Mathematics; Computer vision","score_opus":0.024799074188235955,"score_gpt":0.3373432099879274,"score_spread":0.3125441357996914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044396573","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.036407482,0.0000014312695,0.9509086,0.007641986,0.000010911936,0.00048783878,2.8646795e-7,0.00083473144,0.0037067444],"genre_scores_gemma":[0.7462232,3.7087082e-7,0.25141853,0.0018688353,0.000019743116,0.00033512924,0.000021856957,0.000007462043,0.000104858176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989327,0.000111515415,0.00018088648,0.00035709678,0.00027534208,0.00014244491],"domain_scores_gemma":[0.9992502,0.000070472146,0.000073962656,0.0003049814,0.00018776662,0.0001126225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016378323,0.00010483795,0.0000828852,0.0001630778,0.00014289774,0.00018089406,0.00027702862,0.00006219683,0.00005612509],"category_scores_gemma":[0.0000064057863,0.00008919242,0.000025287052,0.00042239303,0.000018921717,0.00068583706,0.000043312808,0.00013773059,0.00032712505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011149436,0.0010778673,0.041033763,0.000027013819,0.000042177955,0.000003019598,0.002665353,0.3761481,0.19466202,0.15618666,0.025099227,0.20294331],"study_design_scores_gemma":[0.000116264055,0.00017886485,0.029721675,0.0000065410154,0.0000022572433,0.0000040752298,0.000023970862,0.95699793,0.009530366,0.0012998729,0.0019822225,0.00013597021],"about_ca_topic_score_codex":0.00006495219,"about_ca_topic_score_gemma":0.000010210569,"teacher_disagreement_score":0.70981574,"about_ca_system_score_codex":0.00007169026,"about_ca_system_score_gemma":0.0000612002,"threshold_uncertainty_score":0.42046395},"labels":[],"label_agreement":null},{"id":"W2045125028","doi":"10.1016/j.neuroimage.2005.08.053","title":"Evaluation of EEG localization methods using realistic simulations of interictal spikes","year":2005,"lang":"en","type":"article","venue":"NeuroImage","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":240,"is_retracted":false,"has_abstract":false,"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":"Ictal; Electroencephalography; Computer science; Spurious relationship; Pattern recognition (psychology); Geodesic; Principle of maximum entropy; Entropy (arrow of time); Artificial intelligence; Algorithm; Mathematics; Neuroscience; Machine learning; Physics; Psychology","score_opus":0.11891339639090005,"score_gpt":0.43824275282385683,"score_spread":0.3193293564329568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045125028","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.04658174,0.00002428368,0.9518749,0.00009856972,0.00005296854,0.00017188124,0.0000037539696,0.00007767947,0.001114204],"genre_scores_gemma":[0.6689646,0.0000014260972,0.33093727,0.00007120343,0.000010372635,0.0000017362017,0.0000031967495,0.0000050600443,0.000005075596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834496,0.0006409436,0.0003361972,0.0001776599,0.0004242841,0.000075958924],"domain_scores_gemma":[0.9986983,0.00012924838,0.00023362732,0.0003549034,0.0005616638,0.000022286697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011127638,0.00007095065,0.00012187539,0.00017098252,0.000035376386,0.000029816487,0.00024007211,0.00003578757,0.000021690388],"category_scores_gemma":[0.0005185419,0.00007427428,0.00003942725,0.00040794522,0.00004540072,0.00048189575,0.00008322509,0.000055224587,0.0000010763524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044684525,0.00013457265,0.00012529388,0.000020967966,0.000008405149,3.8125535e-7,0.0015499458,0.4328346,0.4327501,0.014857803,0.00009113642,0.11762233],"study_design_scores_gemma":[0.000119415345,0.00003976077,0.0010747655,0.000012243687,0.000025993126,0.0000023941027,0.0000058949972,0.9102821,0.085782774,0.0024390975,0.00016390688,0.00005169461],"about_ca_topic_score_codex":0.000027977409,"about_ca_topic_score_gemma":0.000008397127,"teacher_disagreement_score":0.62238294,"about_ca_system_score_codex":0.000040472663,"about_ca_system_score_gemma":0.00008675028,"threshold_uncertainty_score":0.30288172},"labels":[],"label_agreement":null},{"id":"W2045265907","doi":"10.1109/icassp.2010.5495889","title":"Discriminative base decomposition for time-frequency matrix decomposition","year":2010,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Non-negative matrix factorization; Matrix decomposition; Pattern recognition (psychology); Discriminative model; Decomposition; Discriminant; Computer science; Artificial intelligence; Time–frequency analysis; Matrix (chemical analysis); Linear discriminant analysis; Mathematics; Computer vision; Physics","score_opus":0.011045428153938457,"score_gpt":0.3292261586876735,"score_spread":0.3181807305337351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045265907","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.027737092,0.000005688794,0.9585683,0.003100408,0.0001730384,0.00049387984,0.0000065164754,0.00068771944,0.009227383],"genre_scores_gemma":[0.39555,0.0000010061844,0.6033115,0.0004782549,0.000046477347,0.00009518354,0.00003104288,0.000009147583,0.00047741563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990243,0.00006162796,0.00022350697,0.00033336825,0.0001649475,0.0001922995],"domain_scores_gemma":[0.9990407,0.00016515584,0.00009466285,0.00041732684,0.00019666292,0.000085480606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004045409,0.00013306357,0.00012203128,0.00015452316,0.00016654536,0.000219047,0.0004889166,0.00009477007,0.000091667585],"category_scores_gemma":[0.000035707355,0.000121554185,0.0000871557,0.00018022837,0.000036073758,0.0010305564,0.00008111354,0.00015303945,0.00009809476],"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.0000070513715,0.00010988263,0.000030596962,0.000008119109,0.0000068536724,0.0000014046591,0.00042379805,0.000006304556,0.290951,0.6985468,0.0033366196,0.0065715085],"study_design_scores_gemma":[0.00062751403,0.00038896615,0.0011238682,0.00001761085,0.000017099406,0.00004456569,0.000023743512,0.14018689,0.6092239,0.24621361,0.001664622,0.00046761218],"about_ca_topic_score_codex":0.000020184982,"about_ca_topic_score_gemma":0.000025107383,"teacher_disagreement_score":0.45233324,"about_ca_system_score_codex":0.000030217769,"about_ca_system_score_gemma":0.000051941963,"threshold_uncertainty_score":0.49568358},"labels":[],"label_agreement":null},{"id":"W2046579124","doi":"10.1109/icassp.2007.366699","title":"A Simple and Fast Algorithm for Automatic Suppression of High-Amplitude Artifacts in EEG Data","year":2007,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"McMaster University","funders":"","keywords":"Computer science; Algorithm; Electroencephalography; Blocking (statistics); Distortion (music); Amplitude; Simple (philosophy); SIMPLE algorithm; Matrix (chemical analysis); Transformation matrix; Artifact (error); Artificial intelligence; Computer vision; Bandwidth (computing)","score_opus":0.033754665598499295,"score_gpt":0.32669810812364497,"score_spread":0.2929434425251457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046579124","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.048064,0.00001235807,0.95110774,0.00019328087,0.000025418145,0.0002726581,0.0000101993855,0.00014386632,0.00017046629],"genre_scores_gemma":[0.5119385,0.0000016740894,0.4878945,0.00011001581,0.000004417245,0.0000050048975,0.000016141943,0.0000030770304,0.000026675962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991281,0.000026974896,0.0002741586,0.0002644526,0.00014290347,0.000163387],"domain_scores_gemma":[0.99898535,0.00022954008,0.00007665621,0.0006196798,0.0000396085,0.000049184335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000884021,0.00007216802,0.00013859352,0.00013005456,0.000026855889,0.000056817255,0.000537786,0.00005006175,0.000008791976],"category_scores_gemma":[0.000053001608,0.000060749713,0.000011614946,0.0001773374,0.000024020179,0.0005339807,0.00040890832,0.000049682916,0.0000014418902],"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.000004457213,0.00014684252,0.0005146645,0.000040907362,0.0000071161558,0.0000028092845,0.0009916056,0.000011344716,0.0036653646,0.026856612,0.0021326714,0.9656256],"study_design_scores_gemma":[0.00054068974,0.00012030513,0.030805133,0.000034721543,0.0000031623401,0.0000051342686,0.00006966362,0.88689864,0.058313835,0.021559404,0.0014928178,0.00015648874],"about_ca_topic_score_codex":0.0001397583,"about_ca_topic_score_gemma":0.00014259235,"teacher_disagreement_score":0.9654691,"about_ca_system_score_codex":0.000010669153,"about_ca_system_score_gemma":0.000028227407,"threshold_uncertainty_score":0.24773014},"labels":[],"label_agreement":null},{"id":"W2047880019","doi":"10.1109/ccece.2006.277797","title":"Noisy Autoregressive System Identification Based on Repeated Autocorrelation Function","year":2006,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Autocorrelation; Autoregressive model; Decorrelation; Noise (video); Identification (biology); Function (biology); Partial autocorrelation function; Algorithm; Statistics; System identification; Mathematics; Computer science; Least-squares function approximation; Speech recognition; Data modeling; Artificial intelligence; Autoregressive integrated moving average; Time series","score_opus":0.006005672503283054,"score_gpt":0.21446898148797666,"score_spread":0.20846330898469362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047880019","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.0028458422,0.0000044180915,0.962281,0.0005311307,0.00029695293,0.00040923993,9.2699895e-7,0.0026647518,0.030965721],"genre_scores_gemma":[0.9832257,1.024035e-7,0.0140570365,0.00025273673,0.000053175016,0.00009661139,0.000050516788,0.0000096044,0.0022545292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986397,0.0001506496,0.00034085984,0.00038361977,0.00035677827,0.00012840546],"domain_scores_gemma":[0.99887204,0.000063671534,0.00024149854,0.0006046934,0.00018692535,0.000031172993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045836557,0.00011970218,0.000095474286,0.00024939046,0.00014383924,0.0002603238,0.00026160022,0.00010608174,0.000013489978],"category_scores_gemma":[0.00002197775,0.000107280204,0.00005335722,0.00036835068,0.000015237697,0.00055559666,0.000024626575,0.000101891696,0.00019305023],"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.000021544778,0.0000926305,0.0007810886,0.000018434097,0.000005407222,0.000003919954,0.00009390792,0.025624469,0.0040523764,0.95431787,0.009158145,0.005830198],"study_design_scores_gemma":[0.00020527422,0.00007725358,0.033222206,0.000033551434,0.0000054497964,0.0000023775974,0.000010126285,0.9492977,0.014655583,0.0013528536,0.0010039557,0.00013364234],"about_ca_topic_score_codex":0.00008593195,"about_ca_topic_score_gemma":0.0000106706575,"teacher_disagreement_score":0.9803798,"about_ca_system_score_codex":0.00015945676,"about_ca_system_score_gemma":0.000053220956,"threshold_uncertainty_score":0.43747598},"labels":[],"label_agreement":null},{"id":"W2048464858","doi":"10.1049/iet-spr.2011.0260","title":"Source enumeration in large arrays using moments of eigenvalues and relatively few samples","year":2012,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Queen's University","funders":"","keywords":"Eigenvalues and eigenvectors; Estimator; Mathematics; Linear subspace; Probability density function; Subspace topology; Gaussian; Noise (video); Applied mathematics; Algorithm; Covariance matrix; Gaussian noise; Enumeration; Statistics; Computer science; Mathematical analysis; Combinatorics; Artificial intelligence; Pure mathematics","score_opus":0.04890445795822267,"score_gpt":0.30865551413293024,"score_spread":0.25975105617470756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048464858","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.33814785,0.00043538498,0.66109973,0.00004843761,0.000012818948,0.00007746494,7.931949e-7,0.00005218122,0.00012530746],"genre_scores_gemma":[0.8934603,0.000005835869,0.10638578,0.00009212431,0.00002738739,0.000004401045,0.0000016915596,0.000007926172,0.000014602029],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901104,0.00011491904,0.00025918617,0.0001793953,0.00021424613,0.00022123248],"domain_scores_gemma":[0.9995567,0.000047882055,0.00018754722,0.00009521871,0.000062774954,0.000049843835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000754021,0.000101578524,0.00014451062,0.00015549177,0.00013425142,0.00010079239,0.00014779867,0.000063494736,0.000004328603],"category_scores_gemma":[0.000026419179,0.00010018335,0.000019337276,0.00030688205,0.000045452678,0.0016427039,0.00008706462,0.00011762281,0.000001040846],"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.000056240693,0.00085199316,0.35489687,0.0004994659,0.000048539638,0.0000027239926,0.16491508,0.0032387332,0.25076616,0.045702487,0.000085838714,0.17893586],"study_design_scores_gemma":[0.0009555632,0.00014882053,0.045640495,0.00064781826,0.00002295737,0.00002102348,0.0011564828,0.63225085,0.29255623,0.025213828,0.0006993868,0.0006865398],"about_ca_topic_score_codex":0.000028641018,"about_ca_topic_score_gemma":0.0000033521067,"teacher_disagreement_score":0.6290121,"about_ca_system_score_codex":0.000034130215,"about_ca_system_score_gemma":0.000057063604,"threshold_uncertainty_score":0.40853584},"labels":[],"label_agreement":null},{"id":"W2048588522","doi":"10.1016/s1388-2457(02)00046-9","title":"Systematic source estimation of spikes by a combination of independent component analysis and RAP-MUSIC","year":2002,"lang":"en","type":"article","venue":"Clinical Neurophysiology","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Montreal Neurological Institute and Hospital","funders":"","keywords":"Independent component analysis; Electroencephalography; Waveform; Pattern recognition (psychology); Covariance matrix; Matrix (chemical analysis); Computer science; Artificial intelligence; Speech recognition; Mathematics; Algorithm; Psychology; Chemistry; Telecommunications","score_opus":0.03091658915278169,"score_gpt":0.29763524989800194,"score_spread":0.26671866074522027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048588522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6175668,0.00004960823,0.38190997,0.00015829103,0.000049072918,0.00018993055,0.000001466211,0.000049146296,0.000025680309],"genre_scores_gemma":[0.99567837,0.000058131205,0.0039355755,0.00027450608,0.000005502623,0.000010738459,0.0000054656616,0.0000051295847,0.000026603777],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976039,0.00084221276,0.0009536794,0.00031421534,0.0001874227,0.000098569886],"domain_scores_gemma":[0.99780244,0.0009355045,0.00065006065,0.0004555495,0.00010553416,0.000050886418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043421815,0.0001024181,0.00063390075,0.00020300486,0.000031083076,0.000016840455,0.0003550162,0.000099220226,0.000009447201],"category_scores_gemma":[0.00033941472,0.00008953678,0.00015083562,0.0004916971,0.00018033065,0.00012549383,0.00016144736,0.00014065407,0.0000058300934],"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.000339803,0.020092176,0.020958928,0.02011445,0.0041793524,0.000038422113,0.012089732,0.042600606,0.5950945,0.17665827,0.005725201,0.102108546],"study_design_scores_gemma":[0.0005211412,0.0010129312,0.03614364,0.00010796511,0.0001776058,0.0000034459447,0.00001281732,0.9563883,0.0034562156,0.0020306667,0.000010427964,0.0001348258],"about_ca_topic_score_codex":0.0000124621165,"about_ca_topic_score_gemma":8.535433e-7,"teacher_disagreement_score":0.9137877,"about_ca_system_score_codex":0.000005784408,"about_ca_system_score_gemma":0.000006511311,"threshold_uncertainty_score":0.36512038},"labels":[],"label_agreement":null},{"id":"W2048943702","doi":"10.1145/1094855.1094910","title":"A technique for utilizing optimization potential during multicode identification","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Western University","funders":"","keywords":"Identification (biology); Computer science; Sequence (biology); Optimization problem; Algorithm","score_opus":0.015528793467555306,"score_gpt":0.27853662788435246,"score_spread":0.26300783441679715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048943702","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.0011336699,0.000009488369,0.9952238,0.0013243638,0.000045236535,0.0006878359,9.930018e-7,0.0008333035,0.0007412723],"genre_scores_gemma":[0.4736967,0.000004127082,0.52569693,0.000112685746,0.00003166346,0.00017047739,0.0000042926936,0.0000063408606,0.00027679192],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914,0.00003492771,0.0002588793,0.00027872392,0.0001378111,0.0001496078],"domain_scores_gemma":[0.99937606,0.00002188829,0.000097344084,0.0003362669,0.00013173347,0.0000367279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003591224,0.000085177526,0.000074901225,0.00015496498,0.0001469061,0.00021252305,0.00036692727,0.000070598675,0.0000130550725],"category_scores_gemma":[0.000039363807,0.00008802076,0.000052289302,0.00018032452,0.000012848274,0.0009931993,0.000078248435,0.000058184105,0.000009668667],"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.000017427736,0.00017717003,0.000021211092,0.000036757465,0.000014653078,9.223734e-7,0.0009479501,0.20881452,0.63452435,0.14012527,0.00054960843,0.014770153],"study_design_scores_gemma":[0.00012810343,0.0000090167805,0.00007445626,0.0000046081245,0.0000018946112,0.000006086995,0.0000098715445,0.5667772,0.4321649,0.0004891932,0.00025611158,0.00007850915],"about_ca_topic_score_codex":0.0000043449686,"about_ca_topic_score_gemma":0.0000037671477,"teacher_disagreement_score":0.47256303,"about_ca_system_score_codex":0.00005088619,"about_ca_system_score_gemma":0.000024202545,"threshold_uncertainty_score":0.35893825},"labels":[],"label_agreement":null},{"id":"W2049965409","doi":"10.1190/1.1817843","title":"2D/3D seismic wavefield reconstruction for AVA imaging","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":true,"ca_institutions":"Shell (Canada); University of Alberta","funders":"","keywords":"Geology; Seismology; Geophysical imaging; Computer science; Geophysics","score_opus":0.015357984176712271,"score_gpt":0.25689977061531477,"score_spread":0.2415417864386025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049965409","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.0014737439,0.000017473889,0.9375452,0.0014457438,0.00024680723,0.00016493282,3.0631134e-7,0.0004354158,0.058670394],"genre_scores_gemma":[0.3975594,0.000004432067,0.5984838,0.0023154304,0.000020055984,0.000024752751,6.6585085e-7,0.000005349149,0.0015861008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993929,0.000039814764,0.00014058316,0.00021268261,0.000075319054,0.000138678],"domain_scores_gemma":[0.99952817,0.00006212222,0.00004547403,0.00026378804,0.00006687099,0.00003358666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031281394,0.00006848256,0.000069667294,0.00007908855,0.000080409176,0.000121875826,0.00018940993,0.000035705936,0.00003837225],"category_scores_gemma":[0.000048478978,0.00006456556,0.000041021376,0.0001229799,0.000015704618,0.00048116042,0.000023896488,0.000064509266,0.000021488244],"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.0000017322579,0.000020780453,0.00028236557,0.000006806505,0.000005700475,7.8245995e-7,0.0003844152,0.00005625323,0.0012668904,0.6577543,0.011617856,0.3286021],"study_design_scores_gemma":[0.0004361329,0.00006611645,0.000058235797,0.000016064316,0.0000053198987,0.00017903524,0.000117880765,0.5157386,0.1858306,0.15839314,0.13880897,0.0003499362],"about_ca_topic_score_codex":0.000010214156,"about_ca_topic_score_gemma":0.0000033297247,"teacher_disagreement_score":0.51568234,"about_ca_system_score_codex":0.000018853329,"about_ca_system_score_gemma":0.000042703374,"threshold_uncertainty_score":0.2632907},"labels":[],"label_agreement":null},{"id":"W2050037170","doi":"10.1109/mwscas.2011.6026510","title":"An adaptive bistable system based detector and its application in watermark extraction","year":2011,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Detector; Watermark; Gaussian noise; Noise (video); Bistability; Stochastic resonance; Computer science; SIGNAL (programming language); Gaussian; Amplitude; Digital watermarking; Additive white Gaussian noise; Signal-to-noise ratio (imaging); Pulse-amplitude modulation; Algorithm; Electronic engineering; Control theory (sociology); Physics; Pulse (music); Optics; Telecommunications; Artificial intelligence; Engineering; Optoelectronics; White noise; Image (mathematics)","score_opus":0.029156095648607702,"score_gpt":0.25705438183338375,"score_spread":0.22789828618477603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050037170","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.08581909,0.000009026852,0.909668,0.000025754689,0.000020309046,0.00026214268,4.945298e-7,0.00040545096,0.0037897236],"genre_scores_gemma":[0.9280241,8.9631953e-7,0.07178825,0.00006580239,0.0000059958174,0.000082286104,0.0000011844165,0.0000043103682,0.000027166077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936247,0.00008661694,0.00013299468,0.0002338448,0.00008606657,0.00009798976],"domain_scores_gemma":[0.99959683,0.00001769966,0.000052442254,0.00023445714,0.000052714877,0.000045848996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031673536,0.00006593634,0.000068257694,0.00012462621,0.00003828325,0.00004671255,0.0001849161,0.00005271316,0.000004994852],"category_scores_gemma":[0.0000029029072,0.000058705267,0.000009232918,0.00016932822,0.000007187933,0.00081324205,0.0000223155,0.000057765366,0.000012704113],"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.00017256016,0.0005145079,0.0043775924,0.00011845152,0.0000117988075,0.000015800102,0.0064108404,0.00018643933,0.25353125,0.67666036,0.000081515675,0.057918888],"study_design_scores_gemma":[0.00012682051,0.00010819474,0.0060634934,0.000009611269,0.0000011328584,0.000004021514,0.00007312493,0.6743338,0.31880647,0.00028815397,0.00009143383,0.00009376266],"about_ca_topic_score_codex":0.00025291802,"about_ca_topic_score_gemma":0.00012461074,"teacher_disagreement_score":0.84220505,"about_ca_system_score_codex":0.000043182208,"about_ca_system_score_gemma":0.000021564314,"threshold_uncertainty_score":0.23939313},"labels":[],"label_agreement":null},{"id":"W2051435691","doi":"10.1016/j.mcm.2004.05.006","title":"Nonlinear channel blind equalization using hybrid genetic algorithm with simulated annealing","year":2005,"lang":"en","type":"article","venue":"Mathematical and Computer Modelling","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Simulated annealing; Algorithm; Nonlinear system; Blind equalization; Computer science; Genetic algorithm; Channel (broadcasting); Gaussian; Fitness function; Binary number; Mathematical optimization; Equalization (audio); Mathematics; Decoding methods; Telecommunications","score_opus":0.03946262079563609,"score_gpt":0.26314093696572144,"score_spread":0.22367831617008535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051435691","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.068025745,0.000074672644,0.9311392,0.00016007257,0.000022414019,0.00021423053,0.000001557713,0.00032006737,0.000042067444],"genre_scores_gemma":[0.18559921,0.000010621547,0.81386316,0.0003446011,0.00014187886,0.000003188565,0.0000043048035,0.000018692252,0.000014319468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860543,0.00006106455,0.00037351256,0.0004094184,0.00028263178,0.0002679312],"domain_scores_gemma":[0.9992727,0.00008347142,0.00010665497,0.0002960228,0.00012292783,0.00011818937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026270043,0.00020424573,0.000245116,0.00013079843,0.00015855659,0.000331385,0.0002743809,0.00006373887,0.000003824622],"category_scores_gemma":[0.0000025173863,0.00016922965,0.000039049275,0.00022115352,0.000039622693,0.00043943353,0.00015896089,0.00014083191,0.0000092723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045734046,0.00008036353,0.000001104669,0.000027048443,0.000014954616,0.0000074097507,0.0010433823,0.9709579,0.000017151455,0.008800977,0.0000041407875,0.019040998],"study_design_scores_gemma":[0.0003642076,0.00008259552,5.240367e-7,0.0000968278,0.000012163753,0.00008581815,0.0000061826076,0.98163307,0.0012602004,0.01614779,0.00007492643,0.00023571178],"about_ca_topic_score_codex":0.0000049321793,"about_ca_topic_score_gemma":2.2141005e-7,"teacher_disagreement_score":0.11757347,"about_ca_system_score_codex":0.000021722195,"about_ca_system_score_gemma":0.00002899949,"threshold_uncertainty_score":0.69009846},"labels":[],"label_agreement":null},{"id":"W2052567778","doi":"10.1177/0962280212448973","title":"Comparing variational Bayes with Markov chain Monte Carlo for Bayesian computation in neuroimaging","year":2012,"lang":"en","type":"article","venue":"Statistical Methods in Medical Research","topic":"Blind Source Separation Techniques","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":"Actua; Western University; University of Victoria","funders":"","keywords":"Markov chain Monte Carlo; Computer science; Monte Carlo method; Bayesian probability; Context (archaeology); Computation; Artificial intelligence; Approximate Bayesian computation; Bayesian inference; Inverse problem; Algorithm; Machine learning; Mathematics; Statistics; Inference","score_opus":0.13727059447463075,"score_gpt":0.5244023664070628,"score_spread":0.3871317719324321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052567778","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.0007828873,0.000056057124,0.9932759,0.003574588,0.00010098716,0.00056286505,0.000005238656,0.000076390046,0.0015651071],"genre_scores_gemma":[0.34368163,0.000005065951,0.65584886,0.0002262147,0.000053893866,0.00015339965,0.0000053244476,0.000011991887,0.000013609654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99230295,0.0043115993,0.00051696895,0.00047096587,0.0015764509,0.00082105387],"domain_scores_gemma":[0.98271364,0.01635696,0.00005791108,0.0002511218,0.00022370224,0.0003966551],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.024262227,0.00014032915,0.0003204583,0.00057468895,0.00011711415,0.00014227284,0.00062784896,0.000120027136,0.000053573054],"category_scores_gemma":[0.0113852965,0.00012272819,0.000024445426,0.0010377166,0.0002589197,0.00039394936,0.00029880775,0.0010437183,0.0000030414133],"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.000094577015,0.00027037147,0.013943617,0.000079073405,0.000008898494,0.00003504852,0.0017146018,0.00041326668,0.00004945686,0.5451467,0.00051507435,0.43772933],"study_design_scores_gemma":[0.0006055072,0.00011809395,0.050151534,0.00008279681,0.0000014504978,0.000010563158,0.00006903249,0.9023379,0.000068843314,0.04600294,0.00042102276,0.00013030818],"about_ca_topic_score_codex":0.00020289798,"about_ca_topic_score_gemma":0.00011196957,"teacher_disagreement_score":0.90192467,"about_ca_system_score_codex":0.00017019236,"about_ca_system_score_gemma":0.00034711778,"threshold_uncertainty_score":0.9969422},"labels":[],"label_agreement":null},{"id":"W2053174692","doi":"10.1155/2007/92528","title":"Time-Domain Convolutive Blind Source Separation Employing Selective-Tap Adaptive Algorithms","year":2007,"lang":"en","type":"article","venue":"EURASIP Journal on Audio Speech and Music Processing","topic":"Blind Source Separation 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 Ottawa","funders":"","keywords":"Blind signal separation; Algorithm; Computer science; Artificial intelligence; Telecommunications; Channel (broadcasting)","score_opus":0.02618461440295034,"score_gpt":0.29743630735887755,"score_spread":0.2712516929559272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053174692","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.1508732,0.00033429105,0.84307295,0.00052216987,0.00014364714,0.00029801688,8.803745e-7,0.0003041098,0.004450725],"genre_scores_gemma":[0.8077724,0.00002951907,0.18904258,0.001970915,0.00048259026,0.000009345348,0.0000023135506,0.000038457645,0.0006518852],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99751914,0.00021636534,0.0005431418,0.000526896,0.0006379866,0.0005564905],"domain_scores_gemma":[0.9982682,0.00018393513,0.00058765715,0.00020705779,0.00045291006,0.00030024795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023512538,0.00031713292,0.0003281139,0.00049933436,0.0008234885,0.0007038989,0.00042960435,0.00015361994,0.000013223415],"category_scores_gemma":[0.000116396724,0.0002883645,0.00009046776,0.0007978742,0.00013672118,0.001525639,0.00011459752,0.0008581849,0.00004066429],"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.00036905543,0.00027947585,0.00028862103,0.000022723741,0.00009249683,0.00032725887,0.02043032,0.00015683981,0.017251449,0.0012998945,0.0034403002,0.9560416],"study_design_scores_gemma":[0.019944208,0.011075385,0.04554438,0.0032254788,0.0003332729,0.02364607,0.008047744,0.254063,0.48355713,0.0749731,0.0679429,0.0076473188],"about_ca_topic_score_codex":0.0000039252823,"about_ca_topic_score_gemma":0.000009157035,"teacher_disagreement_score":0.94839424,"about_ca_system_score_codex":0.00020908285,"about_ca_system_score_gemma":0.00028336857,"threshold_uncertainty_score":0.99995685},"labels":[],"label_agreement":null},{"id":"W2053337373","doi":"10.1109/isspit.2013.6781897","title":"Subband blind source separation for convolutive mixture of speech signals based on dynamic modeling","year":2013,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Blind signal separation; Computer science; Filter (signal processing); Speech recognition; Algorithm; Filter bank; Domain (mathematical analysis); Signal processing; Separation (statistics); Time domain; Frequency domain; Speech processing; Source separation; Mathematics; Digital signal processing; Machine learning; Telecommunications; Computer vision","score_opus":0.020477586358268997,"score_gpt":0.29636452856049245,"score_spread":0.27588694220222343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053337373","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.05444818,0.000013758602,0.94151896,0.0011726661,0.00003786613,0.0009311772,0.0000036439033,0.00022293883,0.0016508348],"genre_scores_gemma":[0.829554,0.0000013596477,0.16889532,0.0007503621,0.000016504446,0.0000848188,0.000013033501,0.0000106810285,0.0006738824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882877,0.00007827829,0.00031106346,0.0003307726,0.00026357523,0.0001875415],"domain_scores_gemma":[0.99877083,0.00022151144,0.00014026475,0.00039206896,0.00041764867,0.00005766841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039822876,0.00014538057,0.00019254354,0.00019433963,0.00007249057,0.00012370199,0.00039006982,0.00012511542,0.00004335311],"category_scores_gemma":[0.000049988274,0.00012602536,0.0000902822,0.00023891029,0.000027008924,0.00045507518,0.000039465667,0.000103913335,0.000022654838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024249256,0.00053822686,0.00014872826,0.0001303013,0.00008249572,0.0000012332115,0.0039161067,0.7894399,0.10801047,0.045586884,0.009072106,0.04283102],"study_design_scores_gemma":[0.0004833042,0.00022754393,0.000016649827,0.000019896841,0.0000043934783,6.829724e-7,0.0000341523,0.9301701,0.06165199,0.0070936047,0.00015944701,0.00013821461],"about_ca_topic_score_codex":0.00005914236,"about_ca_topic_score_gemma":0.000018505312,"teacher_disagreement_score":0.77510583,"about_ca_system_score_codex":0.00003763431,"about_ca_system_score_gemma":0.00008460421,"threshold_uncertainty_score":0.5139165},"labels":[],"label_agreement":null},{"id":"W2053721144","doi":"10.5589/m07-034","title":"Influence of wavelet type on the classification of marsh vegetation from satellite imagery using a combination of wavelet texture and statistical component analyses","year":2007,"lang":"en","type":"article","venue":"Canadian Journal of Remote Sensing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Wavelet; Principal component analysis; Pattern recognition (psychology); Discrete wavelet transform; Artificial intelligence; Wavelet transform; Vegetation (pathology); Panchromatic film; Context (archaeology); Remote sensing; Independent component analysis; Computer science; Geography; Mathematics; Image (mathematics)","score_opus":0.049016476696491895,"score_gpt":0.3077151524952812,"score_spread":0.2586986757987893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053721144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5980997,0.00008841087,0.4014622,0.0002170063,0.000029314378,0.00005188387,0.0000029648943,0.0000025021004,0.00004604106],"genre_scores_gemma":[0.8098695,0.00001507146,0.18999912,0.00009559306,0.0000119662245,3.6844652e-9,0.000003167599,0.000004756415,7.9664966e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99876755,0.00018118856,0.0005562993,0.000108573884,0.00026958802,0.00011676818],"domain_scores_gemma":[0.99775356,0.00044177906,0.0007622764,0.00019699016,0.0007369021,0.000108516244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094148255,0.00008492736,0.00021695225,0.00037610048,0.000057371395,0.0000379153,0.0001511853,0.00006447735,8.8763585e-7],"category_scores_gemma":[0.00033141358,0.00007024296,0.000036711903,0.00036254295,0.00015646983,0.00019290535,0.000012298983,0.00017889279,1.9525697e-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.0000901683,0.000029043877,0.0007440413,0.00006806267,0.000094607356,0.000057916524,0.0051133907,0.0013321892,0.49404567,0.012614655,0.000041408974,0.48576882],"study_design_scores_gemma":[0.0003641764,0.00031471503,0.45477068,0.00083123345,0.00006852474,0.000102941296,0.00035691392,0.37557277,0.15595059,0.011353244,0.00013355071,0.00018067584],"about_ca_topic_score_codex":0.0023849027,"about_ca_topic_score_gemma":0.0012426462,"teacher_disagreement_score":0.48558816,"about_ca_system_score_codex":0.0000867459,"about_ca_system_score_gemma":0.000323017,"threshold_uncertainty_score":0.36052755},"labels":[],"label_agreement":null},{"id":"W2054184884","doi":"10.1109/nsip.2005.1502205","title":"Chaos based semi blind identification of nonlinear systems","year":2005,"lang":"en","type":"article","venue":"","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":"University of Calgary","funders":"","keywords":"Nonlinear system; Kernel (algebra); Estimation theory; Computer science; Nonlinear system identification; System identification; Embedding; Volterra series; Identification (biology); Dimension (graph theory); Algorithm; Control theory (sociology); Maximization; Nonlinear dynamical systems; Mathematical optimization; Mathematics; Applied mathematics; Data modeling; Artificial intelligence","score_opus":0.020694478867646166,"score_gpt":0.2808499418548195,"score_spread":0.2601554629871733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054184884","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.010275474,0.000033378317,0.98444045,0.0015190527,0.00007239342,0.00020726297,0.00000192188,0.00031979382,0.0031302501],"genre_scores_gemma":[0.90934825,0.000002715743,0.08924355,0.00028365906,0.000049292223,0.000016922071,0.0000045971656,0.000004653579,0.0010463537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991115,0.00005569486,0.00033386477,0.00018180831,0.00022884774,0.00008828666],"domain_scores_gemma":[0.99914277,0.000036926882,0.00015091422,0.00048428884,0.00015058264,0.0000344939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051651173,0.00006334867,0.00009480664,0.00013598884,0.000028735398,0.000094776595,0.00043571656,0.000053407537,0.000013721632],"category_scores_gemma":[0.000021052254,0.000057688198,0.000035176603,0.0002705849,0.000022573757,0.00038567407,0.00004016813,0.000053650525,0.00006517852],"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.000027287897,0.0009637988,0.00076375314,0.00015879005,0.000045210614,0.0000024303552,0.0025785367,0.031069878,0.16622618,0.7389817,0.013083154,0.04609926],"study_design_scores_gemma":[0.0001489909,0.000019267372,0.00012149575,0.0000076258643,0.0000014802863,0.0000012655204,0.000010227483,0.7714848,0.2204476,0.00008139573,0.0076131546,0.00006267279],"about_ca_topic_score_codex":0.000018569863,"about_ca_topic_score_gemma":0.00000551751,"teacher_disagreement_score":0.89907277,"about_ca_system_score_codex":0.000019882538,"about_ca_system_score_gemma":0.000053709045,"threshold_uncertainty_score":0.23524565},"labels":[],"label_agreement":null},{"id":"W2054680506","doi":"10.1109/tcsi.2007.893507","title":"GSR: A New Genetic Algorithm for Improving Source and Channel Estimates","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications","topic":"Blind Source Separation Techniques","field":"Computer Science","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 British Columbia","funders":"","keywords":"Algorithm; Computer science; Linear subspace; Genetic algorithm; Simulated annealing; Schema (genetic algorithms); Channel (broadcasting); Mathematics; Machine learning","score_opus":0.018412632525810334,"score_gpt":0.2646679917030618,"score_spread":0.2462553591772515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054680506","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.0027599707,0.00063909305,0.9950792,0.000064877175,0.0000821238,0.001007201,0.000028072085,0.00020220068,0.00013724808],"genre_scores_gemma":[0.9820741,0.000055508084,0.016647607,0.00019349455,0.00006945285,0.0003610081,0.0000023908565,0.000016931288,0.00057954324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990221,0.000044469096,0.00025089784,0.0003834658,0.000101117024,0.00019793719],"domain_scores_gemma":[0.99911433,0.00038135258,0.000084880936,0.00021719863,0.000033388522,0.00016886056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006444884,0.00015420213,0.00015677551,0.00013121893,0.0005347222,0.00029020585,0.00013428465,0.000080669684,0.0000015340866],"category_scores_gemma":[0.0000021463582,0.0001484986,0.000035494115,0.00014158626,0.00008829292,0.00021237937,0.000004856442,0.0001035528,0.0000018339941],"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.000005325128,0.00006801273,0.0000042293836,0.000049719638,0.000023127204,3.5316782e-7,0.0011307526,0.00013880657,0.0022736648,0.05797095,0.00001004285,0.938325],"study_design_scores_gemma":[0.005099096,0.0021357608,0.0011240697,0.00038475057,0.00036139606,0.0013558987,0.008553126,0.6864767,0.07245376,0.19398554,0.025325501,0.0027443827],"about_ca_topic_score_codex":0.00004221765,"about_ca_topic_score_gemma":0.0000057655293,"teacher_disagreement_score":0.9793141,"about_ca_system_score_codex":0.000023341563,"about_ca_system_score_gemma":0.000025506964,"threshold_uncertainty_score":0.6055597},"labels":[],"label_agreement":null},{"id":"W2054976451","doi":"10.1109/csndsp.2014.6923836","title":"Discriminative kernel learning in ambiguity domain","year":2014,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Discriminative model; Artificial intelligence; Kernel (algebra); Pattern recognition (psychology); Dimensionality reduction; Machine learning; Signal processing; Frequency domain; Mathematics; Radar","score_opus":0.012733468226906379,"score_gpt":0.2660422310836952,"score_spread":0.2533087628567888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054976451","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.039408546,0.0000023196808,0.8623449,0.0015315808,0.000024144232,0.000059568367,3.857857e-8,0.0003630265,0.09626587],"genre_scores_gemma":[0.89404416,0.0000011415918,0.104086235,0.0006196828,0.0000098900855,0.000009977031,5.598069e-7,0.0000033611175,0.0012249678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917585,0.00022992418,0.00012379685,0.00020475575,0.00013331824,0.00013237186],"domain_scores_gemma":[0.9996088,0.00008042221,0.00003934257,0.0002104672,0.000027738684,0.000033225373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076570176,0.00006491071,0.00008532733,0.000093928735,0.000042943953,0.00008749116,0.00036669904,0.00003598523,0.000013836006],"category_scores_gemma":[0.00008446714,0.00005633492,0.000022491076,0.00021430015,0.000024168286,0.00034601626,0.00016063718,0.0001626393,0.000041518408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.646897e-7,0.00003059719,0.0018385303,0.0000020127957,0.0000010334954,0.0000010901697,0.0034720032,0.00007589855,0.0003443401,0.9669102,0.00032867843,0.026994683],"study_design_scores_gemma":[0.00080529856,0.0003404468,0.11824183,0.00003963096,0.0000017650182,0.0000076151023,0.00063950324,0.24489415,0.026629115,0.573204,0.03460207,0.0005945631],"about_ca_topic_score_codex":0.00009271455,"about_ca_topic_score_gemma":0.00010362977,"teacher_disagreement_score":0.85463566,"about_ca_system_score_codex":0.000026183028,"about_ca_system_score_gemma":0.000016442593,"threshold_uncertainty_score":0.22972713},"labels":[],"label_agreement":null},{"id":"W2055700480","doi":"10.1016/s0933-3657(03)00037-x","title":"Extracting multisource brain activity from a single electromagnetic channel","year":2003,"lang":"en","type":"article","venue":"Artificial Intelligence in Medicine","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":false,"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; Montreal Neurological Institute and Hospital; Aston University; Wellcome Trust","keywords":"Computer science; Electroencephalography; Embedding; Independent component analysis; Channel (broadcasting); Pattern recognition (psychology); SIGNAL (programming language); Artificial intelligence; Basis (linear algebra); Matrix (chemical analysis); Brain activity and meditation; Magnetoencephalography; Neurophysiology; Speech recognition; Neuroscience; Mathematics; Psychology; Telecommunications","score_opus":0.07269309130752616,"score_gpt":0.33429558622094874,"score_spread":0.2616024949134226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055700480","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.18740274,0.00013007634,0.80275214,0.006697266,0.00022526417,0.00023251513,4.3455344e-7,0.00022989573,0.0023296638],"genre_scores_gemma":[0.966764,0.000015403792,0.031739432,0.0012555794,0.00010059523,0.000028642093,0.000001831073,0.000014773198,0.00007974296],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977478,0.0004171182,0.000495812,0.0005539698,0.00037198127,0.00041336886],"domain_scores_gemma":[0.99804837,0.0010708022,0.00017311456,0.000517493,0.000079248515,0.000110982925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013322425,0.00020174148,0.00028808234,0.00027115326,0.00009933147,0.00008349705,0.00056302187,0.00011865878,0.000121055265],"category_scores_gemma":[0.002011684,0.00019284427,0.000042330423,0.0009117003,0.000133594,0.0004658446,0.000061922576,0.0004352872,0.000057127487],"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.000028714172,0.000521475,0.0001099975,0.000007688693,0.000011060116,0.00006014742,0.01543123,0.00040734417,0.5221275,0.08294705,0.00036175488,0.37798604],"study_design_scores_gemma":[0.000104892344,0.000717514,0.00038747673,0.00013618213,0.000006513718,0.000021536383,0.0011724049,0.14720409,0.6455847,0.20275956,0.0015079865,0.00039712942],"about_ca_topic_score_codex":0.00093082705,"about_ca_topic_score_gemma":0.0006991589,"teacher_disagreement_score":0.77936125,"about_ca_system_score_codex":0.00008860117,"about_ca_system_score_gemma":0.000058385765,"threshold_uncertainty_score":0.7863961},"labels":[],"label_agreement":null},{"id":"W2055768354","doi":"10.1016/j.ymssp.2013.06.031","title":"Decentralized modal identification of structures using parallel factor decomposition and sparse blind source separation","year":2013,"lang":"en","type":"article","venue":"Mechanical Systems and Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Underdetermined system; Blind signal separation; Algorithm; Wavelet packet decomposition; Computer science; Wavelet; Matrix decomposition; Computational complexity theory; Wavelet transform; Artificial intelligence","score_opus":0.03256631955637352,"score_gpt":0.3092822614856136,"score_spread":0.2767159419292401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055768354","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.39727423,0.00027966977,0.602039,0.000049199884,0.000024295618,0.00027034056,9.853164e-7,0.00005725795,0.000005036766],"genre_scores_gemma":[0.974178,0.000012967516,0.02570277,0.00003519125,0.000026872343,0.00001982176,0.000003820828,0.000008820207,0.000011741834],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985879,0.00015801194,0.0005084608,0.00031975712,0.00026423548,0.00016164582],"domain_scores_gemma":[0.99920416,0.000044251035,0.00035068384,0.00013240345,0.00017308904,0.0000953864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031555034,0.00013747724,0.00022806483,0.000094183626,0.00017817129,0.00064902933,0.00015525075,0.00012299321,0.000005363428],"category_scores_gemma":[0.000013340748,0.00011902413,0.000028677241,0.00015336298,0.000035313875,0.0010013867,0.00007002078,0.00009883652,9.957487e-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.000046037218,0.00007202205,0.00025704483,0.00029206442,0.000027371443,9.775955e-7,0.0018333754,0.0049822596,0.9026422,0.03651757,0.000018889088,0.053310204],"study_design_scores_gemma":[0.0003602412,0.00005253762,0.00064286886,0.00007148042,0.000010155751,0.00002740765,0.0000772169,0.9625969,0.027525002,0.00846669,0.000023283028,0.0001462191],"about_ca_topic_score_codex":0.00013788398,"about_ca_topic_score_gemma":0.0000022415365,"teacher_disagreement_score":0.95761466,"about_ca_system_score_codex":0.00002455594,"about_ca_system_score_gemma":0.000037481,"threshold_uncertainty_score":0.62586045},"labels":[],"label_agreement":null},{"id":"W2056489576","doi":"10.1016/j.sigpro.2011.02.018","title":"Optimum crossing-point estimation of a sampled analog signal with a periodic carrier","year":2011,"lang":"en","type":"article","venue":"Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"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; Maximum a posteriori estimation; Mathematics; Algorithm; Bayesian probability; Mean squared error; SIGNAL (programming language); Cramér–Rao bound; Sampling (signal processing); Statistics; Computer science; Filter (signal processing); Maximum likelihood","score_opus":0.028889270101780207,"score_gpt":0.26867675165923377,"score_spread":0.23978748155745355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056489576","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.05491,0.00009212153,0.9426219,0.00006449417,0.000011024006,0.00016454325,0.0000021437736,0.0002658127,0.0018679848],"genre_scores_gemma":[0.69291985,2.9524944e-7,0.30690232,0.000115725925,0.000013362696,0.000015508927,0.0000024445978,0.000010726035,0.000019747396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863845,0.00007458067,0.00033697742,0.00034813923,0.00035980035,0.00024202405],"domain_scores_gemma":[0.9990634,0.000031809344,0.0003026453,0.0002452978,0.0002698398,0.0000870596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045804944,0.00017075508,0.00022161803,0.00018855653,0.00028730408,0.0004010206,0.0004412956,0.00007532786,0.00006594728],"category_scores_gemma":[0.00001633428,0.00014120659,0.000050085877,0.00054067356,0.00026091098,0.001205356,0.00008591949,0.00016635125,0.0000033889673],"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.00054987054,0.0008022885,0.0038957368,0.0007178512,0.00013841485,0.00009613347,0.19347785,0.013876581,0.04648049,0.02641476,0.00029652484,0.7132535],"study_design_scores_gemma":[0.000663108,0.00078570907,0.0019575718,0.000379725,0.0000322433,0.000068007816,0.00032230545,0.84913695,0.12969269,0.016398432,0.00006956709,0.0004936727],"about_ca_topic_score_codex":0.00006356416,"about_ca_topic_score_gemma":0.000007676486,"teacher_disagreement_score":0.8352604,"about_ca_system_score_codex":0.000036692047,"about_ca_system_score_gemma":0.0005473787,"threshold_uncertainty_score":0.5758238},"labels":[],"label_agreement":null},{"id":"W2057592692","doi":"10.1121/1.4778355","title":"Patterns in the perception of VC(C)V strings","year":2002,"lang":"en","type":"article","venue":"The Journal of the Acoustical Society of America","topic":"Blind Source Separation 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":"University of Alberta","funders":"","keywords":"Percept; Mathematics; Combinatorics; Closing (real estate); Homogeneous; Statistics; Perception; Psychology","score_opus":0.01970978251267753,"score_gpt":0.26090391381923167,"score_spread":0.24119413130655415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057592692","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.08500104,0.000057769197,0.8973122,0.017297525,0.000047919515,0.000100604404,0.0000014727591,0.000009753623,0.00017169584],"genre_scores_gemma":[0.95895356,0.00033386558,0.038108904,0.0025275939,0.000045708657,7.180291e-7,4.3280416e-8,0.000003832587,0.000025767466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998544,0.00031302692,0.00042371394,0.000061953455,0.0005307437,0.00012656163],"domain_scores_gemma":[0.9985574,0.00043331433,0.00049609516,0.00037611034,0.00011303989,0.00002406356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011779293,0.00007540299,0.00017752642,0.000020839994,0.00006992145,0.000022553138,0.001602231,0.000043420816,0.000034358127],"category_scores_gemma":[0.000094422125,0.000034118188,0.00024205985,0.00034885146,0.00022194014,0.00015335409,0.00016821566,0.00041299567,0.0000016125979],"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.00013059394,0.0027157497,0.00868906,0.00021985403,0.00039853828,0.0000058406454,0.25795862,0.023747452,0.10968943,0.0013731938,0.21364604,0.38142562],"study_design_scores_gemma":[0.0007046262,0.0010195002,0.04375821,0.00022548514,0.00013395915,0.0001588781,0.013760196,0.9282435,0.0033981923,0.005930026,0.0024299012,0.00023748643],"about_ca_topic_score_codex":0.000049039845,"about_ca_topic_score_gemma":4.5700446e-7,"teacher_disagreement_score":0.9044961,"about_ca_system_score_codex":0.000031676715,"about_ca_system_score_gemma":0.000020644107,"threshold_uncertainty_score":0.29773703},"labels":[],"label_agreement":null},{"id":"W2058907959","doi":"10.1109/dcc.2010.79","title":"A New Approach to Time-Frequency Analysis","year":2010,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McMaster University","funders":"","keywords":"Time–frequency analysis; Computer science; Signal processing; Frequency domain; Interval (graph theory); Dependency (UML); SIGNAL (programming language); Computation; Algorithm; Time domain; Digital signal processing; Mathematics; Telecommunications; Artificial intelligence","score_opus":0.012063364480920715,"score_gpt":0.26012724564756906,"score_spread":0.24806388116664835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058907959","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.0010214513,9.807384e-7,0.77910817,0.0012012676,0.000023094493,0.00008317206,1.829935e-7,0.0007662715,0.21779539],"genre_scores_gemma":[0.082609676,1.5901117e-7,0.9043269,0.0014220742,0.00002786692,0.000009383467,0.0000015596911,0.0000048022594,0.011597545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992528,0.000025015192,0.0001227087,0.0002953201,0.00017533876,0.00012882744],"domain_scores_gemma":[0.9989915,0.00002066475,0.000026365844,0.0007531096,0.00005021184,0.00015814515],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028745565,0.00007233155,0.00011187016,0.00029163677,0.000036325393,0.00018771186,0.00084281154,0.000053954875,0.00022478188],"category_scores_gemma":[0.000028281393,0.00006136686,0.000075549964,0.0015482198,0.0000068947033,0.0002818676,0.00013041709,0.00011975814,0.00087654334],"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":[6.1066055e-7,0.00005564854,0.00034778647,8.219409e-7,0.00006401965,5.964643e-7,0.0009930884,0.00006901449,0.00995762,0.9275996,0.0420468,0.018864404],"study_design_scores_gemma":[0.000651326,0.0002460999,0.018632356,0.0000046737255,0.00025733167,0.000038352344,0.00004449402,0.6044539,0.090809725,0.1517601,0.1311032,0.0019984115],"about_ca_topic_score_codex":0.00016903556,"about_ca_topic_score_gemma":0.000050257622,"teacher_disagreement_score":0.7758395,"about_ca_system_score_codex":0.0000069383527,"about_ca_system_score_gemma":0.00006477218,"threshold_uncertainty_score":0.9999014},"labels":[],"label_agreement":null},{"id":"W2060012946","doi":"10.1109/iscas.2013.6572308","title":"An approach for joint blind space-time equalization and DOA estimation","year":2013,"lang":"en","type":"article","venue":"","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":"University of Victoria","funders":"","keywords":"Computer science; Joint (building); Interference (communication); Fading; Algorithm; Blind equalization; Equalization (audio); Control theory (sociology); Sequence (biology); SIGNAL (programming language); Constant (computer programming); Property (philosophy); Channel (broadcasting); Telecommunications; Artificial intelligence; Engineering","score_opus":0.034017568810312045,"score_gpt":0.28931190236469356,"score_spread":0.2552943335543815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060012946","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.004790181,0.0000056001318,0.9895424,0.000955659,0.000013565366,0.0006623763,4.873662e-7,0.0004375856,0.0035920977],"genre_scores_gemma":[0.24976148,0.0000012472275,0.74939203,0.00031291696,0.000016603777,0.00010334005,0.000023291348,0.0000057505463,0.000383352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993262,0.000051976953,0.00015388675,0.00024280949,0.0001164486,0.00010862224],"domain_scores_gemma":[0.9994639,0.000029927152,0.00006581437,0.00027118463,0.00010609799,0.00006308134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034081656,0.000078810896,0.00008821233,0.00010546758,0.000078917794,0.00041875886,0.00016517748,0.00006141561,0.000023537283],"category_scores_gemma":[0.000030023879,0.00006794162,0.000017747729,0.00013470148,0.000019409481,0.0011835105,0.000043954093,0.00003346976,0.000022400103],"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.0000051463335,0.00016394079,0.000039046172,0.000034007408,0.00000922742,7.1516226e-8,0.0021998682,0.0043901647,0.019427858,0.9023535,0.0053926753,0.06598445],"study_design_scores_gemma":[0.00019388838,0.00008541676,0.00019002998,0.0000021389374,0.0000017973468,0.0000019430215,0.00001882867,0.9668302,0.012242014,0.020204099,0.00013324476,0.000096396885],"about_ca_topic_score_codex":0.000027523862,"about_ca_topic_score_gemma":6.628703e-7,"teacher_disagreement_score":0.96244,"about_ca_system_score_codex":0.000012542684,"about_ca_system_score_gemma":0.000019329376,"threshold_uncertainty_score":0.40381014},"labels":[],"label_agreement":null},{"id":"W2060977715","doi":"10.1016/j.neunet.2009.11.004","title":"A fast algorithm for AR parameter estimation using a novel noise-constrained least-squares method","year":2009,"lang":"en","type":"article","venue":"Neural Networks","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Algorithm; Autoregressive model; Noise (video); Least absolute deviations; Mathematics; Gaussian noise; Least-squares function approximation; Computer science; Convergence (economics); Mathematical optimization; Artificial intelligence; Statistics","score_opus":0.033877533735831036,"score_gpt":0.32244579713052257,"score_spread":0.28856826339469155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060977715","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.0010417232,0.000040325725,0.99675226,0.00089802826,0.00018230027,0.0005345134,0.0000048202874,0.00047522585,0.0000707929],"genre_scores_gemma":[0.16535032,0.0000011888335,0.8324644,0.0019826135,0.00013208138,0.000027057245,0.00001040778,0.000011471285,0.000020467009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998612,0.00009494133,0.0003194541,0.00042318524,0.00019739402,0.00035305758],"domain_scores_gemma":[0.9989794,0.00028511506,0.00016727018,0.00036120816,0.00011575657,0.00009124995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040095387,0.00020240102,0.00023031847,0.000119345714,0.00015629713,0.00030916935,0.0004298744,0.00014285273,0.0000035544244],"category_scores_gemma":[0.00005337667,0.00019239417,0.00013142727,0.00035633185,0.000032992222,0.000650952,0.000054199772,0.00021648235,0.0000011599371],"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.0000069936673,0.00004454998,0.0000029343637,0.0000023533578,0.000006508979,0.0000012958095,0.00016159115,0.20377761,0.0007376931,0.0053003374,0.00011510326,0.789843],"study_design_scores_gemma":[0.00037685764,0.00020177207,0.00011008211,0.00002157735,0.000011913046,0.000048484777,0.000007083994,0.99292284,0.0008579401,0.0051119677,0.00011977846,0.00020969148],"about_ca_topic_score_codex":0.000010226035,"about_ca_topic_score_gemma":0.0000018911211,"teacher_disagreement_score":0.78963333,"about_ca_system_score_codex":0.000034887664,"about_ca_system_score_gemma":0.00003287179,"threshold_uncertainty_score":0.7845607},"labels":[],"label_agreement":null},{"id":"W2062196359","doi":"10.1016/j.jsv.2014.04.027","title":"Independent Component Analysis to enhance performances of Karhunen–Loeve expansions for non-Gaussian stochastic processes: Application to uncertain systems","year":2014,"lang":"en","type":"article","venue":"Journal of Sound and Vibration","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Karhunen–Loève theorem; Component (thermodynamics); Applied mathematics; Gaussian; Mathematics; Stochastic process; Independent component analysis; Principal component analysis; Mathematical optimization; Computer science; Statistical physics; Algorithm; Statistics; Physics; Artificial intelligence","score_opus":0.012215640826167279,"score_gpt":0.298384105116855,"score_spread":0.2861684642906877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062196359","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.16725071,0.000027494078,0.8317051,0.00056717795,0.00005602017,0.00036003793,0.0000022828033,0.000012831,0.000018384948],"genre_scores_gemma":[0.9674119,0.000005657277,0.032280087,0.00016258018,0.00007765415,0.000043329488,0.0000039599195,0.0000042686875,0.0000105742465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989018,0.000045047913,0.0004882858,0.00016525215,0.0002999272,0.00009967722],"domain_scores_gemma":[0.99868,0.00012240674,0.00047153005,0.00016628845,0.00045403585,0.00010576278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007747749,0.00008990392,0.0002541388,0.0004028884,0.00010715473,0.00015558403,0.00025225466,0.000045528617,5.2198743e-7],"category_scores_gemma":[0.000073286676,0.00007296548,0.00005197013,0.000623007,0.000013616999,0.0005401188,0.000035863493,0.000066156514,0.0000010038249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003276853,0.0005811208,0.0021125865,0.0007773339,0.0004896176,6.757873e-7,0.039513335,0.76865387,0.10903413,0.043132443,0.00045526447,0.034921944],"study_design_scores_gemma":[0.00035771498,0.0015089697,0.005990862,0.000186065,0.00014839302,0.000011942995,0.0008130123,0.9667029,0.01968806,0.003961486,0.00036094902,0.00026969373],"about_ca_topic_score_codex":0.000017349443,"about_ca_topic_score_gemma":0.000038647926,"teacher_disagreement_score":0.8001612,"about_ca_system_score_codex":0.000033243174,"about_ca_system_score_gemma":0.00007062483,"threshold_uncertainty_score":0.29754457},"labels":[],"label_agreement":null},{"id":"W2062468467","doi":"10.1109/newcas.2009.5290446","title":"Hardware implementation of free division block-based BSS algorithm","year":2009,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Concordia University","funders":"","keywords":"Computer science; Block (permutation group theory); Division (mathematics); Blind signal separation; Algorithm; Coherence (philosophical gambling strategy); Division algorithm; Computer hardware; Parallel computing; Arithmetic; Telecommunications; Mathematics","score_opus":0.013066758529069963,"score_gpt":0.3026479568597455,"score_spread":0.2895811983306755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062468467","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.0066268044,0.0000101920095,0.9888566,0.002535847,0.000034009172,0.00015724142,0.0000046435853,0.00033507534,0.001439585],"genre_scores_gemma":[0.6059725,0.0000011635153,0.39298677,0.00096564856,0.000008193976,0.0000036517065,0.000005547202,0.000002280222,0.00005419332],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991663,0.00004595733,0.00021525445,0.00018410184,0.00027534668,0.00011300237],"domain_scores_gemma":[0.9992428,0.000028507566,0.00008981362,0.0004883921,0.00011253086,0.00003798084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023957143,0.00007518854,0.00009380061,0.000115683986,0.000041907253,0.000057213652,0.00053882715,0.000036331465,0.000044521912],"category_scores_gemma":[0.000009611381,0.0000672605,0.00004679841,0.0002477983,0.000010610423,0.00030862616,0.00006859027,0.00004915455,0.000006438845],"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.0000016359618,0.00012251707,0.00039631876,0.0000048891034,0.0000056767594,0.0000022396555,0.00064524607,0.00010816229,0.0059025935,0.05417059,0.0106462175,0.9279939],"study_design_scores_gemma":[0.0007974489,0.0005548427,0.020822443,0.000015652844,0.0000040353743,0.0000016235488,0.000068939466,0.08014039,0.8782768,0.016632127,0.002476419,0.00020923541],"about_ca_topic_score_codex":0.000056773897,"about_ca_topic_score_gemma":0.000014153666,"teacher_disagreement_score":0.9277847,"about_ca_system_score_codex":0.000017336404,"about_ca_system_score_gemma":0.00005275212,"threshold_uncertainty_score":0.27428037},"labels":[],"label_agreement":null},{"id":"W2062667139","doi":"10.1109/ccece.2010.5575240","title":"A nonlinear modified constant modulus algorithm for blind equalization","year":2010,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Calgary","funders":"","keywords":"Modulus; Constant (computer programming); Blind equalization; Algorithm; Nonlinear system; Quadrature amplitude modulation; QAM; Transfer function; Equalization (audio); Mathematics; Function (biology); Error function; Computer science; Bit error rate; Engineering; Physics; Geometry","score_opus":0.029857746104851694,"score_gpt":0.307933867085329,"score_spread":0.2780761209804773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062667139","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.0017052293,0.0000032553796,0.9913286,0.00080499845,0.00029940612,0.00045042436,0.000008177712,0.00060707104,0.0047928477],"genre_scores_gemma":[0.0990085,0.00000165785,0.8992376,0.0008703088,0.00006990999,0.000062628285,0.000015756048,0.000009374939,0.00072427886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913245,0.000027480939,0.00021877982,0.00027695755,0.00017466341,0.000169681],"domain_scores_gemma":[0.9991471,0.000072760755,0.000075122945,0.0004154949,0.00021986567,0.00006961201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044534696,0.00009832126,0.00010914625,0.00011155122,0.000088730965,0.00019159382,0.00042871493,0.000104270104,0.00001762999],"category_scores_gemma":[0.000056075158,0.0000874399,0.00005000795,0.00022601837,0.00003627747,0.00039901934,0.00008421235,0.00011766515,0.000014712894],"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.0000039370866,0.00007616474,0.000002468531,0.0000027710971,0.0000057885986,6.5015354e-7,0.00026720998,0.00003024332,0.0066140536,0.8877846,0.0009626616,0.10424947],"study_design_scores_gemma":[0.0004656834,0.00006399048,0.0000033560473,0.0000018437393,0.0000020450022,0.0000048635316,0.0000060681227,0.9156604,0.052504297,0.021969749,0.009192902,0.00012480594],"about_ca_topic_score_codex":0.00002295483,"about_ca_topic_score_gemma":0.00003718419,"teacher_disagreement_score":0.91563016,"about_ca_system_score_codex":0.0000095862715,"about_ca_system_score_gemma":0.00009314931,"threshold_uncertainty_score":0.35656956},"labels":[],"label_agreement":null},{"id":"W2064513814","doi":"10.1155/2007/12172","title":"Blind Identification of FIR Channels in the Presence of Unknown Noise","year":2007,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Blind Source Separation 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":"McMaster University","funders":"","keywords":"Upsampling; Subspace topology; Computer science; Noise (video); Channel (broadcasting); Algorithm; Identification (biology); Finite impulse response; Linear subspace; Distortion (music); Mathematics; Artificial intelligence; Telecommunications; Bandwidth (computing); Image (mathematics)","score_opus":0.025010819035043735,"score_gpt":0.340229834089079,"score_spread":0.31521901505403527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064513814","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.16616696,0.0018454893,0.8301829,0.00048081778,0.00011275588,0.00017852214,3.6401013e-7,0.000019301877,0.0010128679],"genre_scores_gemma":[0.9914945,0.00014717277,0.008137029,0.00014087306,0.000053089392,0.0000038695716,2.8479522e-7,0.0000056799145,0.0000175393],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99797255,0.00020643332,0.00084783667,0.00019022095,0.0005866632,0.00019629393],"domain_scores_gemma":[0.9984167,0.00035385892,0.0007949128,0.00019091052,0.0002090792,0.000034515757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041062203,0.00010656106,0.00017435964,0.00043982247,0.000073942254,0.00011974245,0.0009731017,0.000047775095,0.0000027361723],"category_scores_gemma":[0.00017768148,0.0000782954,0.00004350871,0.0011100353,0.000109227556,0.0017749814,0.00004349032,0.0004218211,0.0000010064387],"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.00034010978,0.00087896065,0.0050760927,0.00022546366,0.000006784997,0.00008392713,0.020087484,0.056900527,0.047620215,0.02547895,0.000040079125,0.8432614],"study_design_scores_gemma":[0.0025844427,0.0011102565,0.029916102,0.0029944754,0.000012303631,0.00032303744,0.0022815682,0.13507034,0.68359673,0.13802564,0.003378006,0.0007070827],"about_ca_topic_score_codex":0.000001382324,"about_ca_topic_score_gemma":0.000006592995,"teacher_disagreement_score":0.84255433,"about_ca_system_score_codex":0.000036844318,"about_ca_system_score_gemma":0.00008507558,"threshold_uncertainty_score":0.31927937},"labels":[],"label_agreement":null},{"id":"W2065180158","doi":"10.1016/j.acha.2013.01.002","title":"Phase aliasing correction for robust blind source separation using DUET","year":2013,"lang":"en","type":"article","venue":"Applied and Computational Harmonic Analysis","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Aliasing; Orthogonality; Blind signal separation; Mathematics; Disjoint sets; Algorithm; Source separation; Phase (matter); Fourier transform; Computer science; Artificial intelligence; Channel (broadcasting); Mathematical analysis; Undersampling; Telecommunications","score_opus":0.03779153411346691,"score_gpt":0.3167687326033989,"score_spread":0.27897719848993197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065180158","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.10549664,0.000034144174,0.8933335,0.00034416543,0.00004739396,0.00038404652,0.000002485199,0.00017532364,0.00018232292],"genre_scores_gemma":[0.7582979,0.0000033817935,0.24093537,0.00044856206,0.000037889582,0.00008274181,0.000091449816,0.000008437088,0.000094221956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876654,0.000047783436,0.00033056177,0.0004280063,0.00024502823,0.00018207227],"domain_scores_gemma":[0.9991157,0.00019576303,0.00020846954,0.000177052,0.00022078796,0.00008223571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002935621,0.00015523026,0.00023372156,0.00038271403,0.00032769388,0.00042415003,0.00018237761,0.000074502066,0.000020880208],"category_scores_gemma":[0.00001054392,0.00016025695,0.000121706784,0.00094156666,0.000040970626,0.00048252044,0.00006227979,0.000091532595,0.000011420731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034643817,0.0002561643,0.000081953534,0.000010182447,0.0005065423,3.1292572e-7,0.0011378845,0.89208806,0.0019031017,0.033654038,0.0012606068,0.06906653],"study_design_scores_gemma":[0.0008964948,0.000050236067,0.00028184376,0.0000033032356,0.00018865654,0.0000044557655,0.000092737646,0.98694795,0.0007869026,0.010314852,0.00025075185,0.0001818216],"about_ca_topic_score_codex":0.00006518471,"about_ca_topic_score_gemma":0.000004994993,"teacher_disagreement_score":0.65280133,"about_ca_system_score_codex":0.000053226424,"about_ca_system_score_gemma":0.00006691221,"threshold_uncertainty_score":0.65350884},"labels":[],"label_agreement":null},{"id":"W2065433631","doi":"10.1109/ipcon.2015.7323626","title":"Ambiguity elimination of Independent Component Analysis for polarization channel alignment tracking","year":2015,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Independent component analysis; Computer science; Component (thermodynamics); Polarization (electrochemistry); Ambiguity; Channel (broadcasting); Component analysis; Electronic engineering; Telecommunications; Physics; Artificial intelligence; Engineering","score_opus":0.06592123831336294,"score_gpt":0.30805728084426315,"score_spread":0.2421360425309002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065433631","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.026177825,0.000011628779,0.97198457,0.0008403874,0.000058794965,0.0002855744,0.0000030343933,0.00013696599,0.0005012309],"genre_scores_gemma":[0.9395692,0.0000015496221,0.060083173,0.00017545842,0.00001120628,0.000025768964,0.000032311422,0.0000037300128,0.00009765223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894065,0.00007243235,0.00028411183,0.00020932018,0.00038727396,0.00010618527],"domain_scores_gemma":[0.99906474,0.000035629113,0.00018504364,0.0002714157,0.00038116542,0.00006201466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009706734,0.00007576182,0.00015417323,0.000308069,0.000038256017,0.000071349015,0.0002991745,0.000055502143,0.0000026375112],"category_scores_gemma":[0.000044860957,0.00007217365,0.00008629017,0.0005318023,0.000011859248,0.0004091564,0.00008297773,0.000035445682,0.0000013811824],"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.000048949274,0.0010222903,0.008842892,0.000048301532,0.0005364416,0.0000011277101,0.013897721,0.033354245,0.018443031,0.8998654,0.000895787,0.023043798],"study_design_scores_gemma":[0.000566411,0.00023134705,0.03898595,0.0000071665736,0.00008977424,0.0000010640821,0.00023660397,0.7640557,0.18255843,0.01279277,0.00027734708,0.00019738435],"about_ca_topic_score_codex":0.00010498835,"about_ca_topic_score_gemma":0.00004105053,"teacher_disagreement_score":0.91339135,"about_ca_system_score_codex":0.00007574487,"about_ca_system_score_gemma":0.000041480092,"threshold_uncertainty_score":0.2943156},"labels":[],"label_agreement":null},{"id":"W2066804217","doi":"10.1190/1.3517304","title":"Phase stability via nonlinear optimization: A case study","year":2010,"lang":"en","type":"article","venue":"The Leading Edge","topic":"Blind Source Separation 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":"ARC Resources (Canada)","funders":"","keywords":"Wavelet; Seismic trace; Deconvolution; Autocorrelation; Convolution (computer science); Noise (video); Algorithm; Mathematics; Computer science; Geology; Statistics; Artificial intelligence","score_opus":0.040785869652646224,"score_gpt":0.33997571887276207,"score_spread":0.2991898492201158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066804217","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.39020666,0.0000035316918,0.6075269,0.0006302268,0.00020553824,0.00030942084,8.242179e-7,0.00036116052,0.0007557217],"genre_scores_gemma":[0.9122128,3.8895448e-7,0.08720676,0.00030319483,0.00011171426,0.00002805527,0.0000010190525,0.0000088439265,0.0001272291],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990532,0.00017186585,0.00019170206,0.00026480973,0.00016273966,0.00015572837],"domain_scores_gemma":[0.99865514,0.00014721193,0.00007324106,0.00096371496,0.00010250082,0.000058216177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011892337,0.00010444538,0.00011432498,0.000055198092,0.00025152048,0.00019956125,0.0006613049,0.00004729322,0.00003510409],"category_scores_gemma":[0.00007720594,0.00007595056,0.000037544312,0.00034521203,0.0000656157,0.0003580181,0.00018195981,0.00035153588,0.000055258766],"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.00015721562,0.029096058,0.0066404482,0.00008984147,0.00030899426,0.004182956,0.45422116,0.0125205405,0.046242878,0.04130022,0.012381022,0.39285868],"study_design_scores_gemma":[0.0011158214,0.0004442795,0.000020393109,0.0000036546028,0.000016054788,0.0009886235,0.00055342464,0.98055625,0.012160412,0.0006767424,0.0031999403,0.00026441985],"about_ca_topic_score_codex":0.0000465762,"about_ca_topic_score_gemma":0.000116331415,"teacher_disagreement_score":0.9680357,"about_ca_system_score_codex":0.000016674805,"about_ca_system_score_gemma":0.000047912927,"threshold_uncertainty_score":0.3097174},"labels":[],"label_agreement":null},{"id":"W2067468424","doi":"10.1117/12.719681","title":"Elastic image registration using subspace constraints","year":2007,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Blind Source Separation 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":"University of Alberta","funders":"","keywords":"Subspace topology; Affine transformation; Image registration; Computer science; Artificial intelligence; Computer vision; Deformation (meteorology); Projection (relational algebra); Smoothness; Process (computing); Regularization (linguistics); Mathematics; Image (mathematics); Algorithm; Pattern recognition (psychology); Geometry; Mathematical analysis","score_opus":0.0157217912800841,"score_gpt":0.2591494910238953,"score_spread":0.24342769974381118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067468424","genre_codex":"empirical","genre_gemma":"methods","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.9230243,0.00002837079,0.06979732,0.0018421144,0.00018302136,0.00044131986,0.000009442439,0.00021375147,0.0044603487],"genre_scores_gemma":[0.42653266,0.000015117422,0.5730361,0.00012159164,0.00016296026,0.000022215158,0.0000025206455,0.0000274699,0.00007940867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997661,1.8463018e-8,0.00073377934,0.00041970023,0.0007814855,0.0004040264],"domain_scores_gemma":[0.9971546,0.0002023151,0.00054759654,0.000089320805,0.0018769371,0.00012921554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016349813,0.00027352682,0.00030809134,0.00015590178,0.00010106422,0.00026602249,0.0013072137,0.00019317746,0.0000058396276],"category_scores_gemma":[0.000661128,0.0002479579,0.00041100776,0.0004877077,0.0003381634,0.001295234,0.00019757827,0.00032256733,0.0000014790014],"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.00001682238,0.00004899306,0.00007154727,0.000085257656,0.00007061444,1.2369136e-7,0.00022192704,0.00003587175,0.4444436,0.5541105,0.0006525541,0.00024216562],"study_design_scores_gemma":[0.00120579,0.00042086092,0.0014240586,0.0004115337,0.00011019574,0.00009762789,0.0014128067,0.17148162,0.8109443,0.00985751,0.0019335678,0.00070011045],"about_ca_topic_score_codex":0.000008631951,"about_ca_topic_score_gemma":3.0492617e-7,"teacher_disagreement_score":0.544253,"about_ca_system_score_codex":0.00018230452,"about_ca_system_score_gemma":0.00006803577,"threshold_uncertainty_score":0.99999726},"labels":[],"label_agreement":null},{"id":"W2067703539","doi":"10.1097/01.wnp.0000236579.08698.23","title":"Independent Component Analysis in the Study of Focal Seizures","year":2006,"lang":"en","type":"article","venue":"Journal of Clinical Neurophysiology","topic":"Blind Source Separation Techniques","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":"Montreal Neurological Institute and Hospital; McGill University","funders":"","keywords":"Ictal; Electroencephalography; Independent component analysis; Electrocorticography; Rhythm; Neuroscience; Stereoelectroencephalography; Epilepsy; Focus (optics); Pattern recognition (psychology); Computer science; Psychology; Artificial intelligence; Physics; Optics; Acoustics","score_opus":0.04969788136778244,"score_gpt":0.382466487517485,"score_spread":0.3327686061497026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067703539","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97620475,0.000013059563,0.022585979,0.0007994875,0.00016530722,0.00011585073,3.0651415e-7,0.000009518657,0.00010573324],"genre_scores_gemma":[0.9976708,0.000013200121,0.0014309916,0.0007592408,0.000115734816,0.0000016105337,3.047923e-7,0.0000031391482,0.0000049460564],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9953248,0.0022795144,0.0016778162,0.00018799651,0.00041045202,0.00011945751],"domain_scores_gemma":[0.997108,0.0013074205,0.000974303,0.00041235698,0.00016442023,0.000033520242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001749494,0.00008910013,0.0006290386,0.00030428605,0.000025607122,0.000026397087,0.0011829876,0.000073683266,0.0000036304957],"category_scores_gemma":[0.00018785661,0.000053661388,0.00031916596,0.0007001949,0.00007825979,0.00012597923,0.00015057994,0.0005894218,0.0000016107585],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019164095,0.05905657,0.60333496,0.000037585458,0.0020308725,0.0035605119,0.007053333,0.20550424,0.02014275,0.06340937,0.0051768394,0.028776541],"study_design_scores_gemma":[0.00071798376,0.002765044,0.9876133,0.0000026008422,0.000061643106,0.000022387127,0.00007036616,0.00460338,0.00006319137,0.003811952,0.00021580228,0.00005230867],"about_ca_topic_score_codex":0.00007196882,"about_ca_topic_score_gemma":0.000058753383,"teacher_disagreement_score":0.38427836,"about_ca_system_score_codex":0.000005990777,"about_ca_system_score_gemma":0.000051475676,"threshold_uncertainty_score":0.2560777},"labels":[],"label_agreement":null},{"id":"W2068140550","doi":"10.1109/ultsym.2014.0137","title":"Echo identification by Singular Value Decomposition of Cross Wigner-Ville Distribution","year":2014,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Echo (communications protocol); Singular value decomposition; Identification (biology); SIGNAL (programming language); Wigner distribution function; Computer science; Distribution (mathematics); Value (mathematics); Decomposition; Mathematics; Algorithm; Physics; Statistics; Mathematical analysis; Chemistry","score_opus":0.0070507194748935225,"score_gpt":0.29578464032180013,"score_spread":0.28873392084690663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068140550","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.0742232,0.000013848862,0.9227573,0.00034548235,0.00007432162,0.00011778901,0.000005865944,0.00029412878,0.0021680486],"genre_scores_gemma":[0.9694322,0.0000032214584,0.030046104,0.00015754395,0.000014910458,0.000009068246,0.00014682331,0.00000481347,0.00018534208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989618,0.0001335119,0.00030997867,0.00024671928,0.00023515947,0.000112812864],"domain_scores_gemma":[0.9991058,0.000051145747,0.00017327727,0.00043521583,0.0001947336,0.000039809664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072220364,0.00007950538,0.000102699545,0.00004569416,0.000098405464,0.00020010213,0.00037992344,0.00007291558,0.000008809187],"category_scores_gemma":[0.00005896912,0.00007860395,0.00004687789,0.00022766697,0.000049317583,0.00067917234,0.000069626694,0.00005727454,0.000022250715],"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.000005017348,0.00015239601,0.00044588247,0.0000131806255,0.000007791399,1.3573235e-7,0.000318125,0.00034758245,0.2011073,0.7776878,0.0060828156,0.013831965],"study_design_scores_gemma":[0.00015405245,0.00006803555,0.0027240878,0.000009719565,0.000003367137,0.0000021950534,0.0000045942056,0.121159405,0.85178304,0.020292984,0.0036764892,0.00012201342],"about_ca_topic_score_codex":0.000056712994,"about_ca_topic_score_gemma":0.0000018322096,"teacher_disagreement_score":0.89520895,"about_ca_system_score_codex":0.00004073385,"about_ca_system_score_gemma":0.000016278535,"threshold_uncertainty_score":0.3205376},"labels":[],"label_agreement":null},{"id":"W2068634611","doi":"10.1016/j.spl.2015.04.001","title":"Fast approximate likelihood evaluation for stable VARFIMA processes","year":2015,"lang":"en","type":"article","venue":"Statistics & Probability Letters","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"University Corporation for Atmospheric Research","keywords":"Mathematics; Maximum likelihood; Statistics; Econometrics; Applied mathematics","score_opus":0.05595179905371646,"score_gpt":0.306853671232709,"score_spread":0.25090187217899257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068634611","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.003670826,0.000035098266,0.98974246,0.003622949,0.00017242912,0.0018566545,0.0001357085,0.00041215098,0.00035172442],"genre_scores_gemma":[0.027162971,0.0000023875284,0.97018236,0.0017633943,0.000048366866,0.00068536145,0.000113914015,0.0000187304,0.000022526185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976911,0.00023456103,0.0004029256,0.0005814299,0.00069475063,0.00039522615],"domain_scores_gemma":[0.99736863,0.00026684688,0.00019481525,0.0006362236,0.001378566,0.00015491653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028411455,0.00019583752,0.0002108381,0.000091052556,0.000120136574,0.0003516691,0.0005969783,0.000061728926,0.000006982618],"category_scores_gemma":[0.0015122697,0.00019378119,0.00003358508,0.00038521067,0.0000931022,0.00069874554,0.000134631,0.00012701526,0.00001535237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010112002,0.00068530894,0.0010277384,0.0010374874,0.0000720763,0.000003846898,0.012741519,0.0011236202,0.0020514575,0.8033194,0.095529765,0.08230668],"study_design_scores_gemma":[0.0006627021,0.00018800714,0.00014055667,0.000019047593,0.000026150263,0.000003294138,0.00001603655,0.08461759,0.0029187752,0.9078315,0.0032771225,0.00029922454],"about_ca_topic_score_codex":0.000032424665,"about_ca_topic_score_gemma":0.00006197698,"teacher_disagreement_score":0.10451212,"about_ca_system_score_codex":0.0002406221,"about_ca_system_score_gemma":0.0007561088,"threshold_uncertainty_score":0.79021674},"labels":[],"label_agreement":null},{"id":"W2069452893","doi":"10.1190/1.1815573","title":"Electromagnetic coupling in frequency domain IP data: A method for removal","year":2000,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"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":"Sandia National Laboratories","keywords":"Frequency domain; Coupling (piping); Computer science; Physics; Materials science; Composite material","score_opus":0.031617111807232014,"score_gpt":0.3297099102843212,"score_spread":0.29809279847708914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069452893","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.012172306,0.00009047943,0.97091734,0.001571751,0.000024454643,0.000360537,0.0000024294488,0.00035161935,0.014509093],"genre_scores_gemma":[0.0069377758,0.000017443144,0.9914368,0.0008961647,0.000029958033,0.000043672313,0.000011851688,0.000008995208,0.00061737554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987966,0.0000648808,0.00025848154,0.00046441288,0.00015151278,0.00026410475],"domain_scores_gemma":[0.99884117,0.00016867447,0.000036033256,0.0008799578,0.000030773263,0.000043392956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013695791,0.00010129972,0.00014233279,0.00011232446,0.000051926214,0.00012963304,0.0011784455,0.00006606251,0.000095903546],"category_scores_gemma":[0.00003531419,0.000095954885,0.00002895462,0.0004005828,0.000013465913,0.0005994416,0.00009227292,0.00011672026,0.000019402512],"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.000017069398,0.00011785891,0.000043183776,0.000013603786,0.000009596896,0.000024098206,0.00075332145,0.00015487855,0.01564445,0.9109568,0.0028522995,0.069412835],"study_design_scores_gemma":[0.00046390126,0.00020477445,0.00020520667,0.000011857415,0.0000029630164,0.000048266324,0.000015263438,0.63671845,0.0026671726,0.3485429,0.010897026,0.0002222313],"about_ca_topic_score_codex":0.00015348954,"about_ca_topic_score_gemma":0.00016651352,"teacher_disagreement_score":0.6365636,"about_ca_system_score_codex":0.000033474927,"about_ca_system_score_gemma":0.00009111256,"threshold_uncertainty_score":0.39129266},"labels":[],"label_agreement":null},{"id":"W2070074822","doi":"10.1016/j.media.2011.08.002","title":"A constrained independent component analysis technique for artery–vein separation of two-photon laser scanning microscopy images of the cerebral microvasculature","year":2011,"lang":"en","type":"article","venue":"Medical Image Analysis","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Sunnybrook Health Science Centre","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Independent component analysis; Cerebral blood flow; Biomedical engineering; Artificial intelligence; Hemodynamics; Computer science; Pattern recognition (psychology); Medicine; Cardiology","score_opus":0.012446014937098532,"score_gpt":0.29709385187753873,"score_spread":0.2846478369404402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070074822","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.106764205,0.000035796318,0.8918235,0.00038195873,0.000030369418,0.00048369716,0.00003392975,0.00007039728,0.00037616136],"genre_scores_gemma":[0.8245085,0.0000049831533,0.17500924,0.00026497754,0.000013013494,0.000083391584,0.0000422859,0.00000897597,0.00006467664],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972345,0.00036448461,0.00082939747,0.00049539993,0.000808753,0.00026741924],"domain_scores_gemma":[0.9977177,0.0001332205,0.0006037664,0.0009802511,0.00043694762,0.00012814048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001760706,0.00022210149,0.0007424184,0.0008086581,0.000103641556,0.0000682278,0.0011618886,0.00019480953,0.00017751135],"category_scores_gemma":[0.00015796663,0.00016386545,0.0011540722,0.0031469087,0.0003742019,0.00032073556,0.0002565464,0.00028202552,0.0000012523692],"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.00009556653,0.0011528132,0.038870852,0.00014406569,0.012748616,0.000022581296,0.005885058,0.0004230846,0.93307006,0.0044157933,0.0014940744,0.0016774363],"study_design_scores_gemma":[0.000496428,0.000065366985,0.009647637,0.00003381455,0.002213854,0.0000063997436,0.00006523424,0.042310443,0.944144,0.0007964485,0.00003518055,0.00018518249],"about_ca_topic_score_codex":0.00047391545,"about_ca_topic_score_gemma":0.00027427127,"teacher_disagreement_score":0.71774423,"about_ca_system_score_codex":0.000041956522,"about_ca_system_score_gemma":0.00016913208,"threshold_uncertainty_score":0.6682239},"labels":[],"label_agreement":null},{"id":"W2072323637","doi":"10.1109/ccece.2008.4564522","title":"Crossing-point estimation for sampled random signals","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Estimator; Maximum a posteriori estimation; Minimum mean square error; Minimum-variance unbiased estimator; Mathematics; Mean squared error; Minimax estimator; Applied mathematics; Algorithm; Statistics; Gaussian; Mathematical optimization; Maximum likelihood","score_opus":0.026943887173189043,"score_gpt":0.23371959838524972,"score_spread":0.20677571121206068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072323637","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.018863665,0.000037154216,0.9778764,0.0016718094,0.00009257921,0.0005208321,0.000004935124,0.00042995735,0.00050265976],"genre_scores_gemma":[0.9097276,0.000028314576,0.089145005,0.0007944002,0.00008799358,0.0001328876,0.000007086394,0.000018429646,0.00005828685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819064,0.000013105955,0.00034289155,0.0006018607,0.00023274601,0.00061876164],"domain_scores_gemma":[0.99863034,0.00014997825,0.000098753444,0.0001638631,0.00045013922,0.0005068945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028459606,0.0003124191,0.00036332483,0.00046273606,0.00040905512,0.0010245317,0.0005571949,0.00015606396,0.0000108605045],"category_scores_gemma":[0.00011889906,0.00031300602,0.00007300073,0.00043755028,0.00007348629,0.0006546828,0.000060799568,0.00030604983,0.000007061659],"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.000042513406,0.000056954235,0.00022094115,0.000069086476,0.000042638356,0.0000145439035,0.0031658837,0.0012027154,0.001834417,0.9110873,0.002350961,0.079912074],"study_design_scores_gemma":[0.0006226627,0.0003428435,0.0007417426,0.00007369914,0.000005640552,0.00005954254,0.0000045527368,0.9877031,0.0018963248,0.006802161,0.0013513127,0.0003964172],"about_ca_topic_score_codex":0.00060643646,"about_ca_topic_score_gemma":0.00013283237,"teacher_disagreement_score":0.9865004,"about_ca_system_score_codex":0.00012373949,"about_ca_system_score_gemma":0.0007063724,"threshold_uncertainty_score":0.9999322},"labels":[],"label_agreement":null},{"id":"W2072637209","doi":"10.1109/icnnsp.2008.4590299","title":"A closed-form semi-blind solution to MIMO-OFDM channel estimation","year":2008,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Concordia University","funders":"","keywords":"Weighting; Channel (broadcasting); MIMO; Orthogonal frequency-division multiplexing; Computer science; Closed-form expression; MIMO-OFDM; Algorithm; Mean squared error; Computation; Mathematics; Statistics; Telecommunications","score_opus":0.03828096641204934,"score_gpt":0.2852023105465732,"score_spread":0.24692134413452385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072637209","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.020763127,0.000010795028,0.9639905,0.0040613115,0.00011664716,0.00034167184,7.7486294e-7,0.00091754657,0.00979764],"genre_scores_gemma":[0.75189394,0.0000070444466,0.24439785,0.0020172398,0.00004099141,0.00004570569,0.0000058545347,0.0000074274903,0.0015839337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887276,0.00003721584,0.00023476427,0.00031442617,0.00030711238,0.0002337022],"domain_scores_gemma":[0.999226,0.000033723445,0.00006605721,0.00043729055,0.00011857524,0.000118406315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029747907,0.00012389143,0.00011856421,0.00023374423,0.00019498277,0.00009029695,0.00045480503,0.000089241534,0.000019780558],"category_scores_gemma":[0.00004802034,0.00011684824,0.000049803264,0.0005396297,0.000023871185,0.0008533485,0.00016081159,0.00010306767,0.00034313308],"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.00013051373,0.0008992718,0.00042284688,0.00004764778,0.000064938184,0.000054874574,0.050173007,0.008579094,0.011500007,0.4171266,0.26801243,0.24298877],"study_design_scores_gemma":[0.00055406167,0.0002733237,0.0026132849,0.000022200937,0.0000033933707,0.000067736655,0.000030200614,0.9084865,0.068731226,0.012708137,0.006103153,0.00040679288],"about_ca_topic_score_codex":0.00007168658,"about_ca_topic_score_gemma":0.000029567993,"teacher_disagreement_score":0.8999074,"about_ca_system_score_codex":0.00006685453,"about_ca_system_score_gemma":0.00007920832,"threshold_uncertainty_score":0.4764933},"labels":[],"label_agreement":null},{"id":"W2075271402","doi":"10.1109/wcnc.2010.5506326","title":"ICA with Particle Filtering for Blind Channel Estimation in High Data-Rate MIMO Systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Simon Fraser University","funders":"","keywords":"MIMO; Blind signal separation; Independent component analysis; Channel (broadcasting); Particle filter; Blind equalization; Computer science; Kalman filter; Algorithm; Benchmark (surveying); Control theory (sociology); Equalization (audio); Artificial intelligence; Telecommunications","score_opus":0.04607985033077193,"score_gpt":0.29758040521535684,"score_spread":0.2515005548845849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075271402","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.2311414,0.0000023723487,0.76730007,0.00068417424,0.00010034184,0.00036567636,0.0000045262555,0.0002269695,0.00017446661],"genre_scores_gemma":[0.8294532,4.6608943e-7,0.17017405,0.00009971547,0.000025228665,0.00009693163,0.000015563279,0.000006794744,0.0001280546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992125,0.00003416614,0.00016860379,0.00030399585,0.00011139157,0.0001693138],"domain_scores_gemma":[0.99900764,0.00009838638,0.00006733575,0.0007200332,0.000060232178,0.0000463836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067118596,0.00008441082,0.00010992751,0.0000712016,0.00005200225,0.00027555038,0.00060484343,0.000042922402,0.0000027931444],"category_scores_gemma":[0.00004820654,0.00006621672,0.000009200507,0.00021536942,0.000017973083,0.0010306479,0.00014434142,0.00009701005,0.000010588039],"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.00017961198,0.00057202094,0.00074366335,0.00018634438,0.000047751157,0.00001689803,0.0064628352,0.044995386,0.0447733,0.88046587,0.0030895083,0.018466808],"study_design_scores_gemma":[0.00041560392,0.000084383006,0.00042223767,0.000013391155,0.000002069016,0.000005058025,0.000019726773,0.975746,0.021265972,0.0014873429,0.0004333017,0.00010494506],"about_ca_topic_score_codex":0.00015580353,"about_ca_topic_score_gemma":0.00032061362,"teacher_disagreement_score":0.9307506,"about_ca_system_score_codex":0.000008975415,"about_ca_system_score_gemma":0.000037298047,"threshold_uncertainty_score":0.27002394},"labels":[],"label_agreement":null},{"id":"W2075603728","doi":"10.1109/cvpr.2010.5540026","title":"Group MRF for fMRI activation detection","year":2010,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Voxel; Computer science; Functional magnetic resonance imaging; Artificial intelligence; Markov random field; Segmentation; Pattern recognition (psychology); Markov chain; Image segmentation; Group analysis; Group (periodic table); Synthetic data; Computer vision; Machine learning; Psychology; Neuroscience","score_opus":0.012135428705798177,"score_gpt":0.2634224583859628,"score_spread":0.2512870296801646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075603728","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.028227428,3.406774e-7,0.96637225,0.0010863212,0.00018514306,0.00020238402,1.4217619e-7,0.00059178646,0.0033342226],"genre_scores_gemma":[0.7341963,2.5735898e-7,0.26498199,0.0004929976,0.000046575085,0.000051780265,0.0000012428119,0.000003283817,0.0002255774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995905,0.00001310945,0.000083806946,0.00015194649,0.000079926605,0.00008070699],"domain_scores_gemma":[0.9995841,0.000059355494,0.000040242398,0.00022789436,0.000063555686,0.000024856785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025070127,0.000046790647,0.00003966555,0.00006811921,0.00007443828,0.00010492009,0.00020572686,0.00006226309,0.000011193008],"category_scores_gemma":[0.000045183253,0.000042145748,0.000027939224,0.00012851902,0.000008629435,0.0006081849,0.00003199012,0.00009051699,0.0000117718],"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.0000026372613,0.000020305444,0.000013360299,0.0000018574228,0.000001642168,2.7583994e-8,0.00012881955,0.0000013530188,0.419964,0.4554703,0.00062993023,0.123765774],"study_design_scores_gemma":[0.000121779594,0.00007615123,0.0007189398,0.0000010642758,7.3408904e-7,0.0000019786276,0.000006185654,0.031559773,0.9020722,0.0359741,0.029386157,0.000080972444],"about_ca_topic_score_codex":0.000017061871,"about_ca_topic_score_gemma":0.000083773164,"teacher_disagreement_score":0.70596886,"about_ca_system_score_codex":0.000008583634,"about_ca_system_score_gemma":0.00001119185,"threshold_uncertainty_score":0.17186537},"labels":[],"label_agreement":null},{"id":"W2082369791","doi":"10.1007/s11265-010-0489-2","title":"On MSE Exit Chart Analysis and Real Time DSP Implementation for Iterative (Turbo) Detection","year":2010,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"National Science Council","keywords":"EXIT chart; Turbo; Computer science; Code division multiple access; Minimum mean square error; Single antenna interference cancellation; Algorithm; Additive white Gaussian noise; Equalization (audio); Multiuser detection; Data transmission; Detector; Real-time computing; Channel (broadcasting); Mathematics; Decoding methods; Telecommunications; Statistics; Computer hardware; Engineering","score_opus":0.012070180098965511,"score_gpt":0.30612703709610395,"score_spread":0.29405685699713846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082369791","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.23565435,0.000028829843,0.76364714,0.00016815981,0.00011043125,0.00019641755,0.0000024467467,0.00004689631,0.00014531493],"genre_scores_gemma":[0.98945034,0.000004187353,0.010207188,0.00005618968,0.00019573186,0.000015477104,0.0000020447605,0.000007759527,0.000061057806],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987989,0.00009364092,0.0004891352,0.00017525481,0.00031927312,0.00012377069],"domain_scores_gemma":[0.99841726,0.00012137408,0.00078917836,0.000099454206,0.00049917446,0.00007355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012574272,0.000111048095,0.00025026055,0.00071200164,0.00017366443,0.0005946648,0.00019684414,0.00007265867,0.000005787521],"category_scores_gemma":[0.000022067412,0.00008924308,0.00008928179,0.00045429522,0.000022315908,0.0009753991,0.000017899696,0.00019102964,0.0000015276722],"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.00018763682,0.00014882044,0.000723209,0.00017957711,0.0004355752,0.0000110466335,0.0077973325,0.00060548465,0.7949143,0.006322125,0.00078688207,0.18788798],"study_design_scores_gemma":[0.002174607,0.0029948964,0.004947313,0.00033487013,0.0004748926,0.0003568345,0.0008382537,0.6454048,0.33313382,0.007454463,0.0012056713,0.00067955325],"about_ca_topic_score_codex":0.000023004812,"about_ca_topic_score_gemma":0.000015229084,"teacher_disagreement_score":0.753796,"about_ca_system_score_codex":0.000032294854,"about_ca_system_score_gemma":0.00007225618,"threshold_uncertainty_score":0.5734366},"labels":[],"label_agreement":null},{"id":"W2084362512","doi":"10.1016/j.inffus.2004.02.001","title":"Robust speech processing using multi-sensor multi-source information fusion––an overview of the state of the art","year":2004,"lang":"en","type":"article","venue":"Information Fusion","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"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; Information fusion; State (computer science); Sensor fusion; Function (biology); Information processing; State of art; Fusion; Speech processing; Speech recognition; Artificial intelligence; Human–computer interaction; Data science; Linguistics; Algorithm; Psychology","score_opus":0.0773940850353137,"score_gpt":0.3045583021019601,"score_spread":0.2271642170666464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084362512","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.26284808,0.000024720503,0.73575884,0.0002977879,0.00013999728,0.0005994448,0.00000841453,0.00013268922,0.00019000995],"genre_scores_gemma":[0.7252601,0.000049773163,0.2730912,0.001459091,0.000015334403,0.000012550986,0.000023436904,0.000011201086,0.00007734249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979619,0.000120325465,0.00092677923,0.00010942435,0.0007003743,0.00018122693],"domain_scores_gemma":[0.9974482,0.00002286154,0.0012032284,0.00067405583,0.00060211035,0.000049536782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071750744,0.00016770959,0.00017836763,0.00021722312,0.00032070448,0.00020085866,0.00087047665,0.00009800679,0.0000069351863],"category_scores_gemma":[0.00013253542,0.00010831194,0.00010700755,0.00092071254,0.000086021886,0.006346508,0.0004634989,0.00021304302,0.000020405794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034163986,0.00030793462,0.0008902737,0.0006019491,0.000015355929,2.3834711e-7,0.07895729,0.55618757,0.015525033,0.0025138534,0.00011882048,0.3448475],"study_design_scores_gemma":[0.0011225604,0.000052379062,0.012342541,0.00060133694,0.000012350057,0.000025863823,0.0005365608,0.87858766,0.10098089,0.0003253233,0.005163647,0.0002488865],"about_ca_topic_score_codex":0.00016554962,"about_ca_topic_score_gemma":0.00004546695,"teacher_disagreement_score":0.46266767,"about_ca_system_score_codex":0.000104062994,"about_ca_system_score_gemma":0.000253085,"threshold_uncertainty_score":0.4601065},"labels":[],"label_agreement":null},{"id":"W2085121419","doi":"10.5402/2011/672353","title":"Edge-Detection in Noisy Images Using Independent Component Analysis","year":2011,"lang":"en","type":"article","venue":"ISRN Signal Processing","topic":"Blind Source Separation Techniques","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":"Concordia University","funders":"","keywords":"Artificial intelligence; Independent component analysis; Edge detection; Computer science; Computer vision; Pattern recognition (psychology); Phase congruency; Enhanced Data Rates for GSM Evolution; Noise (video); Image (mathematics); Digital image; Gaussian; Image gradient; Image processing","score_opus":0.042546742337180844,"score_gpt":0.2830846228225765,"score_spread":0.24053788048539568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085121419","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.14960138,0.00008083356,0.8487593,0.000030181638,0.0000296702,0.00010233595,4.1645413e-7,0.0002447666,0.0011510896],"genre_scores_gemma":[0.934899,0.0000022511485,0.06490525,0.00012705827,0.000024325827,0.000009756839,0.0000010534098,0.000010253075,0.000021091882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985042,0.00014573988,0.0003495523,0.00041024736,0.00033452027,0.0002557403],"domain_scores_gemma":[0.9993528,0.000022543247,0.00019788691,0.00023883794,0.00012519343,0.00006274433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007160284,0.00015038591,0.00021839669,0.0007292557,0.00014414982,0.00024814243,0.00046002297,0.00008888968,0.000022155651],"category_scores_gemma":[0.000008689491,0.00015042331,0.0000857758,0.0015622588,0.00004276242,0.0011307952,0.00015329973,0.00024424758,0.0000087187855],"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.00008696121,0.00087624794,0.028505614,0.00012953862,0.0002445908,0.00012711412,0.026747247,0.006461397,0.32511723,0.0023313272,0.00001930449,0.6093534],"study_design_scores_gemma":[0.00026671766,0.000064747255,0.029797526,0.000058285983,0.0000681952,0.000020032532,0.0001693561,0.60970986,0.35394332,0.005493858,0.0000307791,0.00037730508],"about_ca_topic_score_codex":0.0003528771,"about_ca_topic_score_gemma":0.00017221774,"teacher_disagreement_score":0.7852976,"about_ca_system_score_codex":0.00011160268,"about_ca_system_score_gemma":0.00008555227,"threshold_uncertainty_score":0.61340845},"labels":[],"label_agreement":null},{"id":"W2085378512","doi":"10.1114/1.1574024","title":"Using the Fast Orthogonal Search with First Term Reselection to Find Subharmonic Terms in Spectral Analysis","year":2003,"lang":"en","type":"article","venue":"Annals of Biomedical Engineering","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Term (time); Series (stratigraphy); Fourier transform; Basis (linear algebra); Subharmonic; Mathematics; Discrete Fourier transform (general); Fourier series; Set (abstract data type); Noise (video); Computer science; Fourier analysis; Nonlinear system; Short-time Fourier transform; Mathematical analysis; Physics; Artificial intelligence","score_opus":0.05327449467844169,"score_gpt":0.32299263293944014,"score_spread":0.26971813826099844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085378512","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.42209217,0.000016659475,0.5768008,0.00091634924,0.000016504271,0.0000761675,9.713312e-7,0.00003780764,0.000042531912],"genre_scores_gemma":[0.974731,0.000011868709,0.025093308,0.000112793,0.000018529783,0.000011253515,0.0000017515514,0.0000068597387,0.000012633264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880564,0.000056487457,0.00023118067,0.00022331851,0.00039872096,0.00028466425],"domain_scores_gemma":[0.9994323,0.000103081235,0.00003677658,0.00026522737,0.000054598582,0.000107979475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008440187,0.00010002787,0.00016631573,0.0006322878,0.00004642024,0.000057717432,0.00034600688,0.00005591222,0.000013404737],"category_scores_gemma":[0.000084063504,0.000072287105,0.00006251282,0.0030465228,0.000042167154,0.00016164675,0.000054275366,0.00020251756,0.0000011747281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012469523,0.000936336,0.038467493,0.00026291222,0.0012429047,0.00016461693,0.014908269,0.74733585,0.119358696,0.059237204,0.00081294426,0.01714808],"study_design_scores_gemma":[0.00034697846,0.00045900795,0.11680685,0.00015933227,0.000031391413,0.000042930835,0.0000611279,0.7649873,0.1153737,0.0001867469,0.0011446025,0.00040000965],"about_ca_topic_score_codex":0.00004408408,"about_ca_topic_score_gemma":0.000049923794,"teacher_disagreement_score":0.5526388,"about_ca_system_score_codex":0.000026919763,"about_ca_system_score_gemma":0.00007586757,"threshold_uncertainty_score":0.29477826},"labels":[],"label_agreement":null},{"id":"W2086960512","doi":"10.1371/journal.pone.0118877","title":"How Many Separable Sources? Model Selection In Independent Components Analysis","year":2015,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Baycrest Hospital; University of Toronto","funders":"National Institute of Biomedical Imaging and Bioengineering; Canadian Institutes of Health Research; James S. McDonnell Foundation; National Institutes of Health; National Center for Research Resources; Brain Mapping Support Foundation; Ahmanson Foundation","keywords":"Selection (genetic algorithm); Model selection; Separable space; Computer science; Computational biology; Biology; Mathematics; Artificial intelligence","score_opus":0.11440387705374676,"score_gpt":0.259953734054026,"score_spread":0.14554985700027923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086960512","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.4887581,0.000023490236,0.50932884,0.0007117004,0.000006170409,0.00013696207,8.630355e-7,0.00023854648,0.000795346],"genre_scores_gemma":[0.9142391,0.0000069080475,0.08408615,0.00021942424,0.000015073199,0.00003915715,0.0000067024584,0.000008271186,0.0013791778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984146,0.00012478665,0.00019711499,0.00035867834,0.0006752132,0.00022960162],"domain_scores_gemma":[0.9992708,0.00001922572,0.00011633403,0.00031192187,0.00015943097,0.00012231445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054237735,0.00012189135,0.00026374162,0.0005799853,0.000048080434,0.00030058398,0.0004952342,0.00009462377,0.0000033103956],"category_scores_gemma":[0.00003495867,0.00012928409,0.000057043122,0.0013474823,0.000015129711,0.00075923116,0.00015459607,0.00021101694,0.000022835648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016160429,0.015079963,0.3406467,0.00012781142,0.0033973502,0.000043446133,0.02262331,0.42660168,0.11268343,0.0741833,0.0025298526,0.0019215412],"study_design_scores_gemma":[0.00026803592,0.000045172015,0.003176936,0.000013011159,0.0000622776,7.8793664e-7,0.00002292305,0.9702304,0.022010064,0.0039908066,0.000031103922,0.00014850112],"about_ca_topic_score_codex":0.000121301135,"about_ca_topic_score_gemma":0.00015571006,"teacher_disagreement_score":0.5436287,"about_ca_system_score_codex":0.00015079952,"about_ca_system_score_gemma":0.00007188379,"threshold_uncertainty_score":0.52720517},"labels":[],"label_agreement":null},{"id":"W2087256716","doi":"10.1109/embc.2012.6346715","title":"Sleep EMG analysis using sparse signal representation and classification","year":2012,"lang":"en","type":"article","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Sparse approximation; Computer science; Pattern recognition (psychology); Artificial intelligence; Dimensionality reduction; SIGNAL (programming language); Representation (politics); Data mining; Machine learning; Speech recognition","score_opus":0.08851119834439589,"score_gpt":0.34056081308413527,"score_spread":0.2520496147397394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087256716","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.17372227,0.000023468083,0.82350564,0.00017544092,0.000024953824,0.00006402782,1.9395185e-7,0.00015644259,0.0023275542],"genre_scores_gemma":[0.836445,0.0000028011082,0.1632761,0.00017423746,0.000024424713,0.0000043030027,0.0000033220492,0.0000023929535,0.000067433975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993143,0.000093086135,0.00014593842,0.00017777932,0.00015197425,0.00011689824],"domain_scores_gemma":[0.9994869,0.00004107003,0.00007897875,0.0002748789,0.00005362573,0.00006450443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036263312,0.00005737406,0.00008380433,0.00022491332,0.00006753009,0.00012740881,0.00013257269,0.000040036048,0.00003303543],"category_scores_gemma":[0.000012463384,0.000053185082,0.000037894344,0.00076164596,0.000019603802,0.0010914992,0.00006342937,0.00004471046,0.000012334625],"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.000008290083,0.00021755233,0.29499882,0.000007819891,0.00027776917,0.0000013315183,0.007993353,0.002755201,0.046660025,0.57270306,0.0005078165,0.07386896],"study_design_scores_gemma":[0.000049080394,0.000008331091,0.09545829,7.7457184e-7,0.0000478479,0.0000040142663,0.00007312216,0.8923261,0.010862143,0.00092150905,0.00016369234,0.00008508266],"about_ca_topic_score_codex":0.000030864612,"about_ca_topic_score_gemma":0.0000054964653,"teacher_disagreement_score":0.8895709,"about_ca_system_score_codex":0.00002063784,"about_ca_system_score_gemma":0.000007836095,"threshold_uncertainty_score":0.21688247},"labels":[],"label_agreement":null},{"id":"W2087364536","doi":"10.1109/lsp.2014.2362932","title":"Constant Modulus Blind Adaptive Beamforming Based on Unscented Kalman Filtering","year":2014,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Blind Source Separation Techniques","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":"Simon Fraser University","funders":"","keywords":"Kalman filter; Constant (computer programming); Algorithm; Beamforming; Control theory (sociology); Noise (video); Extended Kalman filter; Adaptive filter; Covariance matrix; Covariance; Mathematics; Computer science; Artificial intelligence; Statistics","score_opus":0.022403969720660527,"score_gpt":0.24993786564012105,"score_spread":0.22753389591946052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087364536","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.018823484,0.000008638276,0.9758937,0.0027912757,0.0001428248,0.00020104428,0.0000015483268,0.0006251645,0.0015123464],"genre_scores_gemma":[0.8945866,2.862896e-7,0.09134289,0.013907306,0.000094495364,0.000023243692,0.0000028274667,0.000023454384,0.000018854396],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981039,0.00014435708,0.00032090614,0.0005345598,0.00049786305,0.00039839916],"domain_scores_gemma":[0.99909186,0.00011459299,0.00022085628,0.00036035274,0.00009714245,0.00011520512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005953068,0.00025253705,0.00021861588,0.000297923,0.00028331776,0.00036893145,0.00065707054,0.000077054094,0.000006304204],"category_scores_gemma":[0.00002163575,0.00024320683,0.00007674408,0.00041282052,0.000108850174,0.00066711515,0.000053138792,0.00032512605,0.000019793204],"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.0003195196,0.0003347787,0.00014396434,0.0001664172,0.000044537974,0.00006879195,0.0034447715,0.16576493,0.5385188,0.0071546948,0.0038669982,0.28017184],"study_design_scores_gemma":[0.0005464898,0.00017974249,0.000030710096,0.00025402327,0.000005816317,0.000006720419,0.000012678823,0.89965385,0.097774856,0.00043989622,0.0007842994,0.0003109168],"about_ca_topic_score_codex":0.000012842806,"about_ca_topic_score_gemma":0.0000023646103,"teacher_disagreement_score":0.8845508,"about_ca_system_score_codex":0.00009283016,"about_ca_system_score_gemma":0.000095500014,"threshold_uncertainty_score":0.99176866},"labels":[],"label_agreement":null},{"id":"W2088208328","doi":"10.1155/2008/765462","title":"Blind Channel Equalization Using Constrained Generalized Pattern Search Optimization and Reinitialization Strategy","year":2008,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":2,"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":"Concordia University","keywords":"Blind equalization; Intersymbol interference; Algorithm; Channel (broadcasting); Convergence (economics); Computer science; Constant (computer programming); Interference (communication); Mathematical optimization; Equalization (audio); Mathematics; Telecommunications","score_opus":0.08240214386754008,"score_gpt":0.35432108742260576,"score_spread":0.2719189435550657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088208328","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.034182567,0.0010540093,0.96387404,0.00016402264,0.00007038114,0.00018051983,9.772627e-7,0.00009937506,0.0003741214],"genre_scores_gemma":[0.9414734,0.001042523,0.056846663,0.0004715364,0.00012097775,0.000004317291,0.0000075837775,0.000021056789,0.00001189917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789476,0.00041424087,0.0005677053,0.0003404733,0.0005077742,0.00027505998],"domain_scores_gemma":[0.9990053,0.00007399655,0.00038380336,0.000110583685,0.00031735975,0.000108960645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007892582,0.00019544842,0.0002227657,0.00049710093,0.00046213059,0.00042502728,0.00027032587,0.000092297596,0.000015282423],"category_scores_gemma":[0.000044773704,0.00018843196,0.000032134107,0.00071099814,0.000112375084,0.0032618863,0.000050540366,0.00034876345,8.9465505e-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.000037998743,0.000059804337,0.00026201928,0.000028957811,0.0000035765354,0.00006606334,0.0015851388,0.9425128,0.0010204655,0.0013164143,0.000002981191,0.05310375],"study_design_scores_gemma":[0.0011098477,0.00018864677,0.00007627919,0.00024155407,0.000003441936,0.00047638136,0.000110902285,0.9917091,0.0037037232,0.002119177,0.000031510343,0.0002294093],"about_ca_topic_score_codex":0.0000030116892,"about_ca_topic_score_gemma":0.0000019066979,"teacher_disagreement_score":0.9072909,"about_ca_system_score_codex":0.00009057154,"about_ca_system_score_gemma":0.00024406033,"threshold_uncertainty_score":0.76840323},"labels":[],"label_agreement":null},{"id":"W2089400065","doi":"10.1016/j.bspc.2007.09.004","title":"Investigation of a two-point maximum entropy regularization method for signal enhancement applied to magnetoencephalography data","year":2007,"lang":"en","type":"article","venue":"Biomedical Signal Processing and Control","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Down Syndrome Research Foundation; University of Victoria","funders":"Down Syndrome Research Foundation","keywords":"Magnetoencephalography; Computer science; Filter (signal processing); Entropy (arrow of time); Noise reduction; Algorithm; Noise (video); SIGNAL (programming language); Imaging phantom; Artificial intelligence; Mathematics; Pattern recognition (psychology); Computer vision; Physics","score_opus":0.022599327826834496,"score_gpt":0.2982642080964655,"score_spread":0.275664880269631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089400065","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.0007355934,0.00014275704,0.9964095,0.001882532,0.000027221493,0.0006147383,0.000011358923,0.00010859383,0.00006771606],"genre_scores_gemma":[0.5707795,0.0000015513525,0.42778993,0.0012705373,0.000061663326,0.000043814776,0.000041164738,0.000005262213,0.0000065973354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825937,0.000077684,0.0004686334,0.00049121556,0.00044443322,0.000258671],"domain_scores_gemma":[0.998939,0.00019579864,0.000223268,0.0002621485,0.00016111898,0.00021870171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002585672,0.00013802641,0.00022930263,0.00024686402,0.00012084555,0.000120099074,0.00054171035,0.00008971622,0.000007497933],"category_scores_gemma":[0.000037567224,0.00011949024,0.000031077638,0.00055857725,0.00012801171,0.00028743732,0.0001243797,0.00008820099,7.337156e-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.000112524714,0.000055124136,0.000035371864,0.00006623723,0.000017523427,7.9400786e-7,0.00051394006,0.000007037448,0.4474977,0.014624544,0.0002553604,0.53681386],"study_design_scores_gemma":[0.0039036877,0.0012713054,0.00028005766,0.00017090213,0.000081662336,0.000009027285,0.00010006347,0.6036516,0.27634963,0.109253794,0.004457214,0.00047105743],"about_ca_topic_score_codex":0.000011690448,"about_ca_topic_score_gemma":0.0000018664225,"teacher_disagreement_score":0.60364455,"about_ca_system_score_codex":0.00001836956,"about_ca_system_score_gemma":0.00014854233,"threshold_uncertainty_score":0.48726708},"labels":[],"label_agreement":null},{"id":"W2089585358","doi":"10.1117/12.785658","title":"Statistical simulation of deformations using wavelet independent component analysis","year":2008,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","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":"University of Alberta","funders":"","keywords":"Independent component analysis; Computer science; Wavelet; Artificial intelligence; Regularization (linguistics); Segmentation; Component (thermodynamics); Pattern recognition (psychology); Statistical model; Random variable; Generalization; Algorithm; Mathematics; Statistics","score_opus":0.02220579160631072,"score_gpt":0.26352327879244886,"score_spread":0.24131748718613813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089585358","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84711844,0.000015993097,0.1514917,0.00044248046,0.00006083367,0.00032456737,0.000038802846,0.00008785211,0.00041936108],"genre_scores_gemma":[0.64644957,0.00001527955,0.35339257,0.000042674066,0.00004050354,0.000022895098,0.0000093186745,0.000013136354,0.000014037505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975915,4.7406953e-8,0.00089293736,0.00031198925,0.0009432529,0.0002602804],"domain_scores_gemma":[0.99707985,0.00022370595,0.00058032584,0.00009118317,0.0019263512,0.0000985707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068109797,0.00022292048,0.00043433334,0.00028898605,0.00011147082,0.000081174614,0.0010186597,0.0001468217,0.000007355947],"category_scores_gemma":[0.0003159897,0.00019576702,0.0005349124,0.0008153367,0.00019431383,0.00093756197,0.0002358044,0.00023523794,6.466506e-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.000030544474,0.00020108209,0.0009710686,0.0001602032,0.00077159767,1.1859587e-7,0.0009889466,0.035351392,0.12054811,0.84054744,0.00026404602,0.00016543335],"study_design_scores_gemma":[0.00041043587,0.00013248212,0.0039279712,0.00005358414,0.00018073445,0.000011824501,0.00024357527,0.94429046,0.048660498,0.0016960467,0.00018509213,0.00020726926],"about_ca_topic_score_codex":0.000021258838,"about_ca_topic_score_gemma":2.1925307e-7,"teacher_disagreement_score":0.90893906,"about_ca_system_score_codex":0.00015511278,"about_ca_system_score_gemma":0.000058015812,"threshold_uncertainty_score":0.7983147},"labels":[],"label_agreement":null},{"id":"W2091755654","doi":"10.1190/1.1885507","title":"Neural networks and AVO","year":2002,"lang":"en","type":"article","venue":"The Leading Edge","topic":"Blind Source Separation Techniques","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 Calgary; Shell (Canada)","funders":"","keywords":"Artificial neural network; Computer science; Simple (philosophy); Perceptron; Interpreter; Artificial intelligence; Plot (graphics); Nonlinear system; Class (philosophy); Machine learning; Multilayer perceptron; Mathematics; Programming language","score_opus":0.032927132020672885,"score_gpt":0.25232605834262123,"score_spread":0.21939892632194835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091755654","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.027218072,0.0007025628,0.9380866,0.011034397,0.00026844454,0.00013196564,1.3148401e-7,0.0006595917,0.021898177],"genre_scores_gemma":[0.99446845,0.000024980327,0.0017144677,0.0020162545,0.000079352765,0.0000041633352,1.1195032e-7,0.000004334395,0.0016879096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995795,0.000059458107,0.000065429485,0.00011490166,0.000062424704,0.000118304946],"domain_scores_gemma":[0.9995941,0.000081612176,0.000025785188,0.000261087,0.0000111899535,0.000026247992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020938987,0.000052109688,0.00005448781,0.000025584663,0.00010728446,0.00014294485,0.00035033718,0.000027404809,0.000007682967],"category_scores_gemma":[0.000012621533,0.000036218775,0.000016043525,0.00013094573,0.000038738326,0.00018833224,0.00010600224,0.00013165433,0.00004665728],"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.0000029110022,0.000056727593,0.0011907319,0.0000083271425,0.000021029162,0.000014516139,0.018014912,0.0048510386,0.000453814,0.35229424,0.20324044,0.4198513],"study_design_scores_gemma":[0.000049747305,0.000021430595,0.00035195198,0.0000039407587,0.000001531545,0.000020186579,0.0000050529534,0.9840414,0.0002569743,0.0016740297,0.0135066565,0.00006710971],"about_ca_topic_score_codex":0.0000022071772,"about_ca_topic_score_gemma":0.000001699455,"teacher_disagreement_score":0.97919035,"about_ca_system_score_codex":0.0000063573007,"about_ca_system_score_gemma":0.0000012858949,"threshold_uncertainty_score":0.14769588},"labels":[],"label_agreement":null},{"id":"W2093547585","doi":"10.1109/tbme.2012.2221463","title":"Dynamic Cardiac PET Imaging: Extraction of Time-Activity Curves Using ICA and a Generalized Gaussian Distribution Model","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Biomedical Engineering","topic":"Blind Source Separation Techniques","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":"Bishop's University; Université de Sherbrooke","funders":"Université de Sherbrooke","keywords":"Positron emission tomography; Gaussian; Artificial intelligence; Distribution (mathematics); Computer science; Nuclear medicine; Mathematics; Physics; Mathematical analysis; Medicine","score_opus":0.011423376688617756,"score_gpt":0.26473193732439987,"score_spread":0.2533085606357821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093547585","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.048152354,0.000143731,0.9506281,0.0003722362,0.00023092862,0.000138296,0.000046522644,0.0002764725,0.000011344418],"genre_scores_gemma":[0.9427585,0.00018338129,0.056952175,0.00003448868,0.000014632357,0.000018796338,0.000009055062,0.000013247642,0.000015724223],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989802,0.0000520493,0.0002081208,0.000203062,0.00031879716,0.00023771772],"domain_scores_gemma":[0.9994417,0.00005716608,0.00006711658,0.0002302815,0.00003368911,0.00017006739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039076543,0.00014845892,0.00020233095,0.0001683133,0.00007275814,0.000034392324,0.00014899553,0.00006227824,0.000005471484],"category_scores_gemma":[0.000009061654,0.00015083907,0.00008414229,0.0003311233,0.00005748532,0.00069450494,0.0000050573667,0.00022089605,0.0000019372749],"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.000021295518,0.00046885942,0.000009447592,0.00017466916,0.00007542437,0.0000029404441,0.00032442663,0.06702578,0.90691024,0.00073372957,0.0001328419,0.024120351],"study_design_scores_gemma":[0.00012898433,0.000021168113,0.00013767842,0.000077052355,0.000022527489,0.000029813513,0.0000021333146,0.9721717,0.027078886,0.000019765845,0.00016583886,0.00014444519],"about_ca_topic_score_codex":0.000028990604,"about_ca_topic_score_gemma":3.2353495e-7,"teacher_disagreement_score":0.90514594,"about_ca_system_score_codex":0.000104576546,"about_ca_system_score_gemma":0.000041249652,"threshold_uncertainty_score":0.61510384},"labels":[],"label_agreement":null},{"id":"W2096441936","doi":"10.1109/tsa.2005.851925","title":"A frequency domain method for blind source separation of convolutive audio mixtures","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Speech and Audio Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":132,"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 signal separation; Algorithm; Initialization; Frequency domain; Computer science; Mixing (physics); Joint (building); Bin; Speech recognition; Permutation (music); Spectral density; Mathematics; Acoustics","score_opus":0.019362324051516985,"score_gpt":0.32183531275924726,"score_spread":0.30247298870773026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096441936","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.010483241,0.00023105252,0.9865996,0.0014049849,0.0000585444,0.00043926234,0.000011219231,0.0002306026,0.00054146355],"genre_scores_gemma":[0.4218474,0.00001803404,0.57747203,0.00033888794,0.000036496458,0.000056296576,0.000001226824,0.000010921795,0.00021867281],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986584,0.00010060011,0.00036309237,0.00041060455,0.00023695224,0.00023032895],"domain_scores_gemma":[0.9990964,0.00015335497,0.00022151558,0.0002306604,0.0002170922,0.000080999824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057111017,0.00018794643,0.00025334416,0.0002571519,0.00030811172,0.00015201523,0.00024584166,0.00013718978,0.000007340957],"category_scores_gemma":[0.000010430559,0.0001791599,0.000097092015,0.00038396526,0.00007629388,0.0007974389,0.0000027643994,0.0002035166,0.000003071596],"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.00010451888,0.00026654822,0.000008043401,0.000119029944,0.00005443492,0.0000011964221,0.007389618,0.002340697,0.12435538,0.0023137543,0.00025746648,0.86278933],"study_design_scores_gemma":[0.00107204,0.0002582259,0.00001823148,0.00010333187,0.00003337944,0.000039739967,0.00014487382,0.044289995,0.9402277,0.011639448,0.0018828255,0.00029022072],"about_ca_topic_score_codex":0.000016846941,"about_ca_topic_score_gemma":0.000043535612,"teacher_disagreement_score":0.86249906,"about_ca_system_score_codex":0.00004925719,"about_ca_system_score_gemma":0.00015125936,"threshold_uncertainty_score":0.7305929},"labels":[],"label_agreement":null},{"id":"W2096863150","doi":"10.1109/tnn.2005.845145","title":"Blind Equalization Using a Predictive Radial Basis Function Neural Network","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","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":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Blind equalization; Radial basis function; Computer science; Artificial neural network; Deconvolution; Mean squared error; Algorithm; Clutter; Noise (video); Blind deconvolution; Equalization (audio); Radial basis function network; Perceptron; Artificial intelligence; Radar; Mathematics; Statistics; Telecommunications","score_opus":0.03052155042257175,"score_gpt":0.2712075245042388,"score_spread":0.24068597408166703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096863150","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.01692792,0.00008668493,0.9788944,0.0007015535,0.0017297384,0.0004993738,0.0000046515033,0.00096867874,0.00018697446],"genre_scores_gemma":[0.98269296,0.00003556542,0.013741792,0.002422504,0.0009025905,0.000060929196,0.0000072753005,0.00003778687,0.00009861698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976426,0.0003762248,0.0004775021,0.00059429073,0.0004008187,0.0005085903],"domain_scores_gemma":[0.99880797,0.0001817186,0.0001913275,0.0005204925,0.00013024804,0.00016823404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035677195,0.000309678,0.0002490271,0.00024243444,0.0005356619,0.00029115044,0.00043690234,0.00025216115,0.00004943001],"category_scores_gemma":[0.000004272824,0.0003203071,0.00019405987,0.0011553688,0.00006532433,0.001542184,0.0000068435456,0.0006235126,0.000012706355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016280284,0.00008840266,0.00001028493,0.0000019665674,0.000028041168,0.0000019294882,0.00018615025,0.9302318,0.00008415506,0.00059913914,0.00047341012,0.06813189],"study_design_scores_gemma":[0.00063981843,0.0003488557,0.00009415927,0.000020090694,0.00004811612,0.00002687461,0.000008837784,0.9968089,0.0009001332,0.00026480493,0.0005476587,0.00029173616],"about_ca_topic_score_codex":0.000021879998,"about_ca_topic_score_gemma":0.00006685519,"teacher_disagreement_score":0.965765,"about_ca_system_score_codex":0.00014705204,"about_ca_system_score_gemma":0.00004706537,"threshold_uncertainty_score":0.9999249},"labels":[],"label_agreement":null},{"id":"W2097352459","doi":"10.1109/pacrim.2013.6625508","title":"Non-stationary signals separation using STFT and affinity propagation clustering algorithm","year":2013,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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 Victoria; University of Waterloo","funders":"","keywords":"Cluster analysis; Affinity propagation; Short-time Fourier transform; Computer science; Blind signal separation; A priori and a posteriori; Pattern recognition (psychology); Artificial intelligence; Algorithm; Fourier transform; SIGNAL (programming language); Matrix (chemical analysis); Data mining; Mathematics; Correlation clustering; Canopy clustering algorithm; Fourier analysis; Channel (broadcasting); Chromatography","score_opus":0.02458483205418432,"score_gpt":0.29463900081386196,"score_spread":0.27005416875967764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097352459","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.06184706,0.000011049406,0.93588495,0.00036844402,0.00004337714,0.00043946388,5.775717e-7,0.00026644478,0.0011386299],"genre_scores_gemma":[0.4684269,0.000003316061,0.5309221,0.00038393436,0.000022449209,0.000031979172,0.000004775906,0.000005290579,0.00019924267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991372,0.000083127554,0.0002136785,0.00024719175,0.0001909108,0.00012788447],"domain_scores_gemma":[0.99942636,0.000060962077,0.000094663075,0.00018866113,0.00017262893,0.000056738027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003709195,0.00009960307,0.00009197342,0.00011765927,0.00013837492,0.00036642593,0.00015738259,0.000056827066,0.00004071168],"category_scores_gemma":[0.000014722763,0.000093219904,0.000018234417,0.0002034954,0.00002328797,0.002099974,0.0001293177,0.000074498465,0.000031744232],"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.000011562267,0.0002985721,0.0011385464,0.00009694976,0.000067635585,0.000007980654,0.012293037,0.01228524,0.20168456,0.05186554,0.0041345656,0.71611583],"study_design_scores_gemma":[0.000103171675,0.000046878282,0.0023373761,0.000009962077,0.0000021693577,0.000010306592,0.000056339617,0.96707296,0.023400545,0.006784479,0.000049880568,0.00012593021],"about_ca_topic_score_codex":0.0000907115,"about_ca_topic_score_gemma":0.0000070110777,"teacher_disagreement_score":0.95478773,"about_ca_system_score_codex":0.00003168027,"about_ca_system_score_gemma":0.000050940438,"threshold_uncertainty_score":0.38013974},"labels":[],"label_agreement":null},{"id":"W2097395080","doi":"10.1109/pacrim.2009.5291377","title":"Pairwise optimization of modulation constellations","year":2009,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Queen's University","funders":"","keywords":"Algorithm; Pairwise error probability; Binary number; Constellation diagram; Pairwise comparison; Additive white Gaussian noise; Modulation (music); Channel (broadcasting); Quadrature amplitude modulation; Computer science; Constellation; Signal-to-noise ratio (imaging); Gaussian; Mathematics; Statistics; Topology (electrical circuits); Theoretical computer science; Bit error rate; Telecommunications; Combinatorics; Physics; Arithmetic; MIMO; Acoustics","score_opus":0.015582440613668808,"score_gpt":0.25722421966042053,"score_spread":0.24164177904675171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097395080","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.0012315296,0.0000056141057,0.9585958,0.0012736883,0.000017038277,0.000093392686,2.2166414e-7,0.00028173818,0.03850097],"genre_scores_gemma":[0.62144095,0.0000027321619,0.37821454,0.00024625828,0.0000034955158,6.3859596e-7,0.0000021156675,8.632309e-7,0.000088411245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956006,0.00003229272,0.00015284211,0.00009817744,0.00010742458,0.0000491802],"domain_scores_gemma":[0.9995755,0.000025133528,0.000065369735,0.00021473966,0.00009943927,0.000019802921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013244717,0.00003913621,0.00005468176,0.00009228074,0.000027035796,0.000030212286,0.0001414113,0.00003087279,0.000028262306],"category_scores_gemma":[0.000016856131,0.00003732804,0.000022212007,0.00025451087,0.000011160818,0.00040659867,0.000014449373,0.000024781515,0.0000035402513],"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":[7.9705177e-7,0.000036314756,0.00010957501,8.22444e-7,0.0000014230563,1.0429815e-7,0.00024451202,0.3190679,0.00068986224,0.6568753,0.00043267652,0.022540709],"study_design_scores_gemma":[0.00006889799,0.00004458811,0.001613317,0.0000030562228,8.591711e-7,0.0000010874736,0.0000048968286,0.9794698,0.0067594377,0.011858019,0.00012897859,0.000047059042],"about_ca_topic_score_codex":0.0000027444646,"about_ca_topic_score_gemma":5.325732e-7,"teacher_disagreement_score":0.6604019,"about_ca_system_score_codex":0.000008229632,"about_ca_system_score_gemma":0.000023829423,"threshold_uncertainty_score":0.15221933},"labels":[],"label_agreement":null},{"id":"W2097892160","doi":"10.1109/mwscas.2005.1594108","title":"Computationally-efficient methods for blind adaptive equalization","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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 Windsor","funders":"","keywords":"Blind equalization; QAM; Computer science; Adaptive equalizer; Equalization (audio); Dither; Equalizer; Algorithm; Quadrature amplitude modulation; Constant (computer programming); Bit error rate; Decoding methods; Telecommunications; Bandwidth (computing)","score_opus":0.06900201146282746,"score_gpt":0.4167659748833216,"score_spread":0.34776396342049415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097892160","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.00019844454,0.000025577883,0.9916103,0.0023949472,0.000056007346,0.00041681214,0.0000011525875,0.0004652876,0.0048315036],"genre_scores_gemma":[0.1048176,8.288475e-7,0.8928261,0.0018489388,0.000047054782,0.000059920192,0.000008560085,0.000006442714,0.00038458934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908864,0.0001462911,0.00022554096,0.00025618996,0.00015005573,0.00013327887],"domain_scores_gemma":[0.9990421,0.00036221184,0.00008679992,0.00019860348,0.00026288335,0.00004738481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000944568,0.00008564005,0.000095221345,0.00013261767,0.00009319299,0.00011540274,0.00032802255,0.000050307415,0.000019849671],"category_scores_gemma":[0.00006333117,0.000078943965,0.00005222133,0.00028165698,0.000018270921,0.0002749621,0.00007689813,0.00004673646,0.000024669189],"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.0000053818535,0.000050303835,6.4157996e-7,0.0000012224123,0.000005047897,3.1845353e-8,0.00060862943,0.049149897,0.00032129863,0.85709757,0.00073667837,0.09202327],"study_design_scores_gemma":[0.0002977378,0.0000634405,0.000032258664,0.0000026609007,0.00000218758,0.0000015135263,0.000012484801,0.9431757,0.01587094,0.016818305,0.023618009,0.00010476191],"about_ca_topic_score_codex":0.0000028988995,"about_ca_topic_score_gemma":0.0000032270125,"teacher_disagreement_score":0.8940258,"about_ca_system_score_codex":0.000045225985,"about_ca_system_score_gemma":0.000070814356,"threshold_uncertainty_score":0.32192415},"labels":[],"label_agreement":null},{"id":"W2097907657","doi":"10.1155/asp.2005.649","title":"A MUSIC-Based Algorithm for Blind User Identification in Multiuser DS-CDMA","year":2005,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Blind Source Separation Techniques","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":"Concordia University","funders":"","keywords":"Code division multiple access; Subspace topology; Computer science; Linear subspace; SIGNAL (programming language); Ambiguity; Algorithm; Multiuser detection; Signal subspace; Identification (biology); Interference (communication); Code (set theory); Scheme (mathematics); Transformation (genetics); Process (computing); Speech recognition; Theoretical computer science; Mathematics; Artificial intelligence; Telecommunications","score_opus":0.028616822579504528,"score_gpt":0.3375854192288836,"score_spread":0.30896859664937903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097907657","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.008068862,0.0012935697,0.9886048,0.0012305357,0.00013151558,0.00034910484,0.0000015674967,0.000106243235,0.00021383655],"genre_scores_gemma":[0.5461714,0.00005343658,0.4521147,0.0013267886,0.0001953782,0.000050643663,0.0000021099127,0.000020140753,0.0000653796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978361,0.00016415624,0.00076019915,0.00041937345,0.000467609,0.00035255094],"domain_scores_gemma":[0.998752,0.00021797452,0.00049890415,0.00019697919,0.00024243702,0.00009169455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015460894,0.00020622728,0.00023041369,0.0006749881,0.00018936141,0.0005601073,0.00069555483,0.00009008866,0.000012946801],"category_scores_gemma":[0.00007894131,0.00019134952,0.00007780929,0.0007455001,0.000048197293,0.0038074416,0.00003599698,0.0005356424,0.000010785194],"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.00005314673,0.00022368143,0.00019371118,0.00001798101,0.0000017371985,0.000012248963,0.0007050286,0.015705781,0.0008606371,0.00043555177,0.00005736176,0.98173314],"study_design_scores_gemma":[0.0025444923,0.00019575293,0.0007679548,0.00042769525,0.0000038394987,0.00003555341,0.00008514452,0.9413638,0.02442987,0.0046408786,0.025145829,0.00035918405],"about_ca_topic_score_codex":9.583209e-7,"about_ca_topic_score_gemma":0.00002912883,"teacher_disagreement_score":0.98137397,"about_ca_system_score_codex":0.00020558761,"about_ca_system_score_gemma":0.00019180006,"threshold_uncertainty_score":0.78030074},"labels":[],"label_agreement":null},{"id":"W2098065052","doi":"10.1109/newcas.2008.4606323","title":"Identification of autoregressive moving average systems from noise-corrupted observations","year":2008,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Concordia University","funders":"","keywords":"Noise (video); Autoregressive model; Autocorrelation; Autoregressive–moving-average model; Residual; Algorithm; Computer science; Noise measurement; Moving average; Mathematics; Statistics; Artificial intelligence; Noise reduction","score_opus":0.040097115925134916,"score_gpt":0.25707293818189325,"score_spread":0.21697582225675832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098065052","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.2157982,0.000046694757,0.78231806,0.00019487056,0.00016573857,0.00016957922,0.000007215016,0.00041852388,0.0008811092],"genre_scores_gemma":[0.9683036,0.0000127414,0.0301499,0.000117085096,0.000025876228,0.00003033162,0.000016914466,0.0000064070673,0.0013371059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885565,0.000090168025,0.00042369848,0.00024795035,0.00028286417,0.000099639314],"domain_scores_gemma":[0.998687,0.00012346637,0.0002965308,0.0005893467,0.0002634279,0.00004018069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018708732,0.000086831125,0.00013919023,0.000117144446,0.00011946657,0.00008278329,0.0005460814,0.00006573518,0.000011431096],"category_scores_gemma":[0.000076482196,0.00008179014,0.00004515823,0.0002960672,0.000037733873,0.0007579655,0.00009244594,0.000075564625,0.000026722299],"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.000008572382,0.00032922995,0.02215923,0.000039134833,0.00008851611,0.000022911345,0.019167284,0.011550228,0.38994873,0.5453543,0.009188157,0.0021437185],"study_design_scores_gemma":[0.00021437506,0.0000279499,0.12214977,0.000040809773,0.0000058049695,0.0000092064265,0.00008045057,0.7578724,0.11655413,0.0021685741,0.000657724,0.00021879152],"about_ca_topic_score_codex":0.00042162556,"about_ca_topic_score_gemma":0.0000075985117,"teacher_disagreement_score":0.7525054,"about_ca_system_score_codex":0.000033668104,"about_ca_system_score_gemma":0.00007915842,"threshold_uncertainty_score":0.33353052},"labels":[],"label_agreement":null},{"id":"W2098078706","doi":"10.1109/iscas.2004.1329447","title":"Blind estimation and equalization of time-varying channels using the interacting multiple model estimator","year":2004,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McMaster University","funders":"","keywords":"Intersymbol interference; Estimator; Kalman filter; Computer science; Gaussian noise; Equalization (audio); Adaptive equalizer; Blind equalization; Algorithm; Gaussian; Noise (video); Channel (broadcasting); Estimation theory; Mathematics; Artificial intelligence; Statistics; Telecommunications; Decoding methods","score_opus":0.054071071245384475,"score_gpt":0.32627800845736527,"score_spread":0.2722069372119808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098078706","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.103276804,0.000010363871,0.8958242,0.00033003616,0.000030136349,0.00017350518,3.5734726e-7,0.00013948086,0.00021512483],"genre_scores_gemma":[0.57237583,9.693524e-7,0.42751676,0.00008142874,0.000005057037,0.000003065607,0.0000012453024,0.000004027249,0.000011591769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932665,0.000039459163,0.00022903204,0.00016147339,0.00014980466,0.00009358607],"domain_scores_gemma":[0.9993895,0.00013287542,0.0001600566,0.00020217532,0.000090309695,0.000025059946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037240912,0.0000784523,0.000091676506,0.000096569056,0.00013427493,0.0001478937,0.0001994707,0.000039561415,0.0000019712131],"category_scores_gemma":[0.0001633653,0.000060363865,0.000020505613,0.00020735171,0.000027498845,0.00095020334,0.00013133763,0.00006576314,0.0000017343091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034730367,0.000018006203,0.00001946351,0.00000781174,0.000003734559,1.6193395e-7,0.0029082957,0.9590915,0.014524615,0.021354623,0.0000045284223,0.0020637745],"study_design_scores_gemma":[0.00022487855,0.000014780174,0.0000032110597,0.000043851353,0.0000032182857,0.000007287803,0.0000286334,0.92508215,0.06597086,0.008555645,0.0000011707481,0.00006434142],"about_ca_topic_score_codex":0.000054447326,"about_ca_topic_score_gemma":0.0000021499034,"teacher_disagreement_score":0.46909904,"about_ca_system_score_codex":0.000027775908,"about_ca_system_score_gemma":0.000051859726,"threshold_uncertainty_score":0.24615669},"labels":[],"label_agreement":null},{"id":"W2098649150","doi":"10.1109/icassp.2003.1200019","title":"Fast convolutive blind speech separation via subband adaptation","year":2004,"lang":"en","type":"article","venue":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","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":"McGill University","funders":"","keywords":"Blind signal separation; Computer science; Reverberation; Speech recognition; Filter bank; Distortion (music); Filter (signal processing); Source separation; Sampling (signal processing); Mixing (physics); Computation; Adaptive filter; Algorithm; Channel (broadcasting); Acoustics; Telecommunications; Computer vision; Bandwidth (computing)","score_opus":0.048700698696852514,"score_gpt":0.3116715487939528,"score_spread":0.2629708500971003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098649150","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.02168128,0.000083847175,0.948702,0.0007550885,0.00071496837,0.00081490906,0.00003591601,0.00053573656,0.026676266],"genre_scores_gemma":[0.8420096,0.00019819032,0.15438616,0.0012045418,0.0004023803,0.00007043929,0.0000547968,0.000045178826,0.0016287195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995956,0.000047585603,0.0008627143,0.0011731039,0.0013679186,0.0005926623],"domain_scores_gemma":[0.99177444,0.000019881922,0.00075924373,0.00022248185,0.00691826,0.00030572165],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00072428066,0.0006026336,0.00047136607,0.0005661023,0.00044052757,0.0016226608,0.0010266462,0.00040064284,0.00012669257],"category_scores_gemma":[0.0002858358,0.00060133234,0.00006712848,0.0010416637,0.00032212184,0.0022737312,0.00012732405,0.0007710272,0.00017455286],"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.0008867054,0.0017914065,0.00058235106,0.0003361509,0.0002968388,0.00016289158,0.015288771,0.0033758353,0.07250232,0.80268717,0.012377333,0.089712225],"study_design_scores_gemma":[0.002625342,0.0008993699,0.00048529365,0.00039315457,0.000059077905,0.00025536554,0.0012320181,0.9197858,0.051639806,0.019703148,0.001757195,0.0011644298],"about_ca_topic_score_codex":0.00008993424,"about_ca_topic_score_gemma":0.000045532684,"teacher_disagreement_score":0.91640997,"about_ca_system_score_codex":0.00039339595,"about_ca_system_score_gemma":0.0010833626,"threshold_uncertainty_score":0.9996438},"labels":[],"label_agreement":null},{"id":"W2099001956","doi":"10.1109/iwvdvt.2005.1504586","title":"A blind estimation approach for symbol timing and carrier frequency offset","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Concordia University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Carrier frequency offset; Algorithm; Frequency offset; Computer science; Offset (computer science); Symbol (formal); Mean squared error; Mathematics; Statistics; Telecommunications","score_opus":0.035117308633162786,"score_gpt":0.29749223156940896,"score_spread":0.2623749229362462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099001956","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.0047211447,0.000030914925,0.98699546,0.0012835976,0.000014934261,0.00035911964,0.0000023647851,0.0002892358,0.0063032075],"genre_scores_gemma":[0.4392574,0.0000013229194,0.56010747,0.0003754983,0.000019828889,0.00004953418,0.0000054685524,0.000003440456,0.00018005243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993715,0.000022453687,0.00014815078,0.0002297155,0.00010983653,0.00011830018],"domain_scores_gemma":[0.99958354,0.000041981686,0.000045752393,0.00021923338,0.000060106468,0.000049381317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000293859,0.0000769703,0.00008297622,0.000088144414,0.00008776534,0.00015446235,0.00019449492,0.00005785465,0.000006595096],"category_scores_gemma":[0.000042118616,0.0000687724,0.00002376341,0.00012024771,0.000019148849,0.00067221455,0.000048988768,0.000054243978,0.0000030654073],"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.000010385583,0.00012678938,0.00029017444,0.000047724,0.000021637174,4.3367072e-7,0.005998532,0.0019355714,0.0014617122,0.7682596,0.0070261676,0.21482128],"study_design_scores_gemma":[0.00022009716,0.000038297516,0.00008521981,0.000004370573,0.0000034363384,0.000007918996,0.000027791373,0.9888357,0.004823848,0.0051769926,0.00066828396,0.00010806788],"about_ca_topic_score_codex":0.0000094435045,"about_ca_topic_score_gemma":0.0000059199356,"teacher_disagreement_score":0.9869001,"about_ca_system_score_codex":0.00001955982,"about_ca_system_score_gemma":0.00003280743,"threshold_uncertainty_score":0.28044572},"labels":[],"label_agreement":null},{"id":"W2099008400","doi":"10.1109/iembs.2008.4649547","title":"Modulation filtering for heart and lung sound separation from breath sound recordings","year":2008,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Queen's University","funders":"","keywords":"Heart sounds; Modulation (music); Computer science; Frequency modulation; Acoustics; Speech recognition; SIGNAL (programming language); Representation (politics); Independent component analysis; Sound (geography); Audio signal; Artificial intelligence; Physics; Radio frequency; Speech coding; Telecommunications","score_opus":0.03472527251426984,"score_gpt":0.3014305966364517,"score_spread":0.2667053241221819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099008400","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.34299386,0.000019096884,0.65553296,0.00043440275,0.00005488829,0.00019520905,0.000002123406,0.000256695,0.00051077607],"genre_scores_gemma":[0.7407664,0.000006566867,0.2584288,0.0003997305,0.00005126775,0.000029895462,0.0000139161975,0.000006638688,0.00029673922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921954,0.000029639697,0.00018259935,0.00031393944,0.00012410108,0.0001302077],"domain_scores_gemma":[0.99947244,0.0001154116,0.00006070023,0.0002338017,0.00007038793,0.00004728244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018078092,0.00009920164,0.000117592404,0.00007696735,0.00022042687,0.00019135524,0.00013531593,0.00006417343,0.00001154878],"category_scores_gemma":[0.000021666378,0.000099291436,0.000036851485,0.000106109095,0.00002260872,0.0010319101,0.000067082015,0.000051942247,0.0000052079254],"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.0002454709,0.0004703345,0.11104603,0.0001472317,0.00028167135,0.00001356298,0.05574736,0.0057375906,0.2201937,0.44515595,0.11480193,0.046159178],"study_design_scores_gemma":[0.00038925407,0.00010304225,0.02652318,0.000011605719,0.000005911835,0.000037079044,0.00002176607,0.85631084,0.012320611,0.102265485,0.0017354646,0.00027574738],"about_ca_topic_score_codex":0.00011588756,"about_ca_topic_score_gemma":0.000029194329,"teacher_disagreement_score":0.85057324,"about_ca_system_score_codex":0.00003254582,"about_ca_system_score_gemma":0.000019571802,"threshold_uncertainty_score":0.40489873},"labels":[],"label_agreement":null},{"id":"W2099076571","doi":"10.1109/vetecf.2007.284","title":"Optimal Training Signals and Detection for OFDM Under Colored Noise","year":2007,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","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":"University of Saskatchewan","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computer science; Frequency domain; Noise (video); Symbol (formal); Channel (broadcasting); Algorithm; Time domain; Computation; Signal-to-noise ratio (imaging); Computational complexity theory; Colors of noise; Multiplexing; Telecommunications; Artificial intelligence; Noise reduction; Computer vision; Image (mathematics)","score_opus":0.034940914487102584,"score_gpt":0.284661803202942,"score_spread":0.24972088871583942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099076571","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.38494334,0.000047352994,0.61281914,0.001051603,0.00007049294,0.00029053658,0.0000010669614,0.0006863224,0.00009016032],"genre_scores_gemma":[0.86159676,0.000011568274,0.1379081,0.00033501076,0.00001889395,0.000080423386,0.000001231078,0.000011181094,0.000036832167],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986691,0.0000371057,0.00028437897,0.00048566118,0.00015309981,0.0003706605],"domain_scores_gemma":[0.9990034,0.00014450689,0.00013952228,0.00039138182,0.00025040001,0.00007077033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008098216,0.00017504954,0.0002273736,0.0004691253,0.00017641348,0.00011020295,0.0005379134,0.0004096804,0.0000023512282],"category_scores_gemma":[0.000084451065,0.00017916414,0.000049299862,0.00050051766,0.00022861992,0.00029355212,0.00009547287,0.00027331398,0.0000042414645],"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.00003064896,0.000052582098,0.00008486826,0.000014837555,0.00004173714,0.000017098466,0.00090189395,0.00044127944,0.6857254,0.1572414,0.000043843473,0.15540439],"study_design_scores_gemma":[0.0005885774,0.00046354104,0.00045747845,0.0000303927,0.00001480115,0.000094224575,0.00054048444,0.080492035,0.8810792,0.034462977,0.0014437897,0.00033252558],"about_ca_topic_score_codex":0.000006269397,"about_ca_topic_score_gemma":0.000041951243,"teacher_disagreement_score":0.47665343,"about_ca_system_score_codex":0.000037572278,"about_ca_system_score_gemma":0.000096014024,"threshold_uncertainty_score":0.7306102},"labels":[],"label_agreement":null},{"id":"W2099984632","doi":"10.1109/tbme.2003.812198","title":"Conventional and reciprocal approaches to the inverse dipole localization problem of electroencephalography","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Biomedical Engineering","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":"McGill University; Montreal Neurological Institute and Hospital; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Dipole; Inverse problem; Reciprocal; Inverse; Physics; Position (finance); Mathematics; Mathematical analysis; Geometry; Quantum mechanics","score_opus":0.025852058296753164,"score_gpt":0.21097395611806152,"score_spread":0.18512189782130836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099984632","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.0010992945,0.000020041196,0.9975784,0.00082308456,0.00008134219,0.00018658489,0.0000022487263,0.00012438562,0.00008464903],"genre_scores_gemma":[0.90316045,0.000017714085,0.09651972,0.0001954091,0.000008290387,0.000067219604,0.0000012067263,0.000006828639,0.000023158336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923706,0.000045024568,0.00017666383,0.00018078534,0.00022574869,0.00013474471],"domain_scores_gemma":[0.99965084,0.00005504294,0.000027163152,0.0001491797,0.00002389423,0.0000939023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030730414,0.00008617959,0.00008801504,0.00022073148,0.00006614005,0.000028304485,0.00016874612,0.00005971382,0.0000065405056],"category_scores_gemma":[0.000007656652,0.00006821124,0.00004359498,0.0007364609,0.00006385322,0.00012583638,0.0000019386898,0.00014430063,0.0000032633907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047825808,0.0012801858,0.00007129291,0.00023070164,0.00027113277,0.000005723213,0.004818761,0.44965968,0.019171964,0.4334666,0.0023292804,0.08864684],"study_design_scores_gemma":[0.000541263,0.0005698319,0.00011293791,0.0000898346,0.000021498265,0.00004083902,0.000057480334,0.8569124,0.09686839,0.0020367426,0.042431235,0.00031754852],"about_ca_topic_score_codex":0.0000044136473,"about_ca_topic_score_gemma":0.000004618675,"teacher_disagreement_score":0.90206116,"about_ca_system_score_codex":0.000016949367,"about_ca_system_score_gemma":0.000033075154,"threshold_uncertainty_score":0.27815735},"labels":[],"label_agreement":null},{"id":"W2100167453","doi":"10.1109/ssap.2000.870176","title":"Parameter estimation in FARIMA processes with applications to network traffic modeling","year":2002,"lang":"en","type":"article","venue":"","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":"Dalhousie University","funders":"","keywords":"Cepstrum; Autoregressive integrated moving average; Computer science; Estimation theory; Autoregressive model; Range (aeronautics); Gaussian process; Gaussian; Algorithm; Statistics; Mathematics; Time series; Artificial intelligence; Engineering; Machine learning; Physics","score_opus":0.0338795894999281,"score_gpt":0.2697767619166907,"score_spread":0.2358971724167626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100167453","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.006523074,0.000031888092,0.9894027,0.0012723637,0.000005586743,0.00044320224,1.715792e-7,0.00045979657,0.0018612054],"genre_scores_gemma":[0.5140479,0.0000037383256,0.48510474,0.00055936346,0.000006386185,0.00021117544,9.4456874e-7,0.000003804457,0.00006193997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927807,0.000020380428,0.000160645,0.0002508008,0.00013495541,0.00015516837],"domain_scores_gemma":[0.99950755,0.00006926984,0.000029174076,0.00027642533,0.00007273491,0.00004483441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012516067,0.0000802775,0.00008185124,0.00010272378,0.000054146134,0.00015030957,0.00030329148,0.00003431711,0.000009225963],"category_scores_gemma":[0.000021653203,0.00006676237,0.000009773055,0.0009883567,0.000007995979,0.00043144426,0.00003728038,0.00006918314,0.000044146127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.847821e-7,0.000039233113,0.000025443627,0.0000067238857,0.0000012975828,2.8115898e-7,0.0006979591,0.9555726,0.0000024460235,0.0141286375,0.00021277065,0.029311612],"study_design_scores_gemma":[0.00006238775,0.000042520984,0.000014831873,0.00001684225,0.0000010769066,0.0000028787044,0.000010665669,0.99655354,0.00007907487,0.0026880975,0.00042647382,0.00010159322],"about_ca_topic_score_codex":0.000009312832,"about_ca_topic_score_gemma":0.0001403295,"teacher_disagreement_score":0.50752485,"about_ca_system_score_codex":0.000021873324,"about_ca_system_score_gemma":0.000028249582,"threshold_uncertainty_score":0.27224904},"labels":[],"label_agreement":null},{"id":"W2100887198","doi":"10.1016/s1053-8119(03)00333-1","title":"Multivariate analysis of neuronal interactions in the generalized partial least squares framework: simulations and empirical studies","year":2003,"lang":"en","type":"article","venue":"NeuroImage","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Baycrest Hospital","funders":"Eunice Kennedy Shriver National Institute of Child Health and Human Development; National Center for Research Resources; National Institute of Neurological Disorders and Stroke; Israel National Road Safety Authority; National Institute of Mental Health; Athinoula A. Martinos Center for Biomedical Imaging, Massachusetts General Hospital; National Institutes of Health; Centre d'Imagerie BioMédicale","keywords":"Univariate; Multivariate statistics; Principal component analysis; Independent component analysis; Computer science; Covariance; Partial least squares regression; Pattern recognition (psychology); Noise (video); Artificial intelligence; Statistical hypothesis testing; Mathematics; Machine learning; Statistics","score_opus":0.11823115478823547,"score_gpt":0.420952441785027,"score_spread":0.3027212869967915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100887198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6837405,0.000047953068,0.31346777,0.0022611066,0.00007416688,0.00014430562,0.000007060542,0.00006062338,0.00019648936],"genre_scores_gemma":[0.9803154,0.000013354397,0.018471602,0.0011554547,0.000010149714,0.000013345705,0.0000018906472,0.000004324901,0.000014503728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844736,0.0007054492,0.0002752868,0.00026057774,0.00018705922,0.00012424197],"domain_scores_gemma":[0.9984991,0.00094008254,0.00009596798,0.0003660169,0.00007307468,0.000025781283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002960824,0.00009606432,0.0001979119,0.00029033786,0.000096263924,0.00009309425,0.00024177667,0.000024882216,0.000012436996],"category_scores_gemma":[0.00059005956,0.0000725955,0.00007410325,0.0011185114,0.00008076546,0.00028473893,0.00007889596,0.00021947396,0.0000011094944],"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.00007433869,0.0016437973,0.15526928,0.00003674834,0.00090236723,0.0000686224,0.07630615,0.110574305,0.018663475,0.62956566,0.0017595623,0.0051357183],"study_design_scores_gemma":[0.0004890149,0.000117560536,0.3945662,0.000015124508,0.00020957248,0.00000974242,0.0003243426,0.5864119,0.0026078678,0.010452885,0.0045487015,0.00024704987],"about_ca_topic_score_codex":0.000022992059,"about_ca_topic_score_gemma":0.00007599839,"teacher_disagreement_score":0.61911273,"about_ca_system_score_codex":0.000008514705,"about_ca_system_score_gemma":0.00002282542,"threshold_uncertainty_score":0.29603586},"labels":[],"label_agreement":null},{"id":"W2101219687","doi":"10.5402/2012/847305","title":"Neural Network Implementations for PCA and ItsExtensions","year":2012,"lang":"en","type":"article","venue":"ISRN Artificial Intelligence","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":"Concordia University","funders":"","keywords":"Singular value decomposition; Principal component analysis; Linear discriminant analysis; Artificial neural network; Independent component analysis; Pattern recognition (psychology); Computer science; Singular spectrum analysis; Eigenvalues and eigenvectors; Signal processing; Artificial intelligence; Feature extraction; Singular value; Algorithm; Digital signal processing","score_opus":0.11391654533315936,"score_gpt":0.3785088248915519,"score_spread":0.26459227955839254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101219687","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.011404689,0.00011539279,0.98454916,0.002585632,0.00039192196,0.00035786934,0.000005096122,0.0002284497,0.00036180613],"genre_scores_gemma":[0.86477077,0.000015586627,0.13350075,0.0013293629,0.00024452337,0.0000745761,0.0000049748687,0.000008202457,0.000051228926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989439,0.000058770223,0.00028138087,0.00021638133,0.00011828014,0.00038124743],"domain_scores_gemma":[0.9991509,0.00028496553,0.000073897834,0.00026899084,0.00010211239,0.00011916999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005379054,0.00010315723,0.00010264681,0.000061400795,0.0002913736,0.00015978757,0.0002761841,0.000043253902,0.00001914426],"category_scores_gemma":[0.000090078574,0.00010081341,0.000045014116,0.0002749715,0.000056637156,0.0006357048,0.00013734271,0.00008955907,0.00003342509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036218082,0.000036532612,0.00034507655,0.000002438033,0.000004651727,2.2150734e-7,0.0012093086,0.00033820182,0.0007446558,0.8923523,0.0016282896,0.103334695],"study_design_scores_gemma":[0.000054907512,0.0002971884,0.0039026635,0.000023107339,0.000027696678,0.00003466185,0.0007810384,0.3314493,0.076377094,0.55609185,0.030305518,0.0006550013],"about_ca_topic_score_codex":0.00002104254,"about_ca_topic_score_gemma":0.00010740413,"teacher_disagreement_score":0.8533661,"about_ca_system_score_codex":0.000013955891,"about_ca_system_score_gemma":0.00002546727,"threshold_uncertainty_score":0.41110516},"labels":[],"label_agreement":null},{"id":"W2101439460","doi":"10.1109/glocom.2010.5684133","title":"Error Modeling in Network Tomography by Sparse Code Shrinkage (SCS) Method","year":2010,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Dalhousie University","funders":"","keywords":"Computer science; Shrinkage; Noise reduction; Code (set theory); Sparse matrix; Transformation (genetics); Algorithm; Field (mathematics); Matrix decomposition; Artificial intelligence; Pattern recognition (psychology); Mathematics; Machine learning","score_opus":0.02953581471682136,"score_gpt":0.3060292760447178,"score_spread":0.27649346132789643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101439460","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.018688686,0.000032665215,0.9694752,0.0008977218,0.00017632321,0.00018358267,0.0000014635954,0.00064800924,0.009896337],"genre_scores_gemma":[0.37017578,0.000004635191,0.6282545,0.001274309,0.00003516573,0.000022537599,0.0000028210495,0.000009141092,0.00022113635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986283,0.00013730733,0.00029044985,0.00040713468,0.00021333939,0.00032345575],"domain_scores_gemma":[0.9990845,0.00009402513,0.000056915243,0.0006224483,0.000047163303,0.00009500202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013323772,0.00014170005,0.00017080683,0.000164294,0.00006671305,0.00016088941,0.00082886725,0.00015206632,0.0000462475],"category_scores_gemma":[0.000021881064,0.00013092908,0.000052109033,0.000692603,0.00002129279,0.0004904657,0.00020199285,0.00048646796,0.00001948526],"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.000017706221,0.00037039534,0.0022440888,0.000014852376,0.00003334168,0.000022381237,0.0030797042,0.06766628,0.029577827,0.79151505,0.053405646,0.05205272],"study_design_scores_gemma":[0.00013258896,0.000026387735,0.000050884344,0.0000057960556,0.0000015038071,0.000004336944,0.000012631224,0.9693636,0.0047668805,0.017878061,0.0075707315,0.00018662002],"about_ca_topic_score_codex":0.00015623082,"about_ca_topic_score_gemma":0.00066504744,"teacher_disagreement_score":0.9016973,"about_ca_system_score_codex":0.000008546353,"about_ca_system_score_gemma":0.000032879463,"threshold_uncertainty_score":0.5339133},"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":"W2101843769","doi":"10.1109/icassp.2006.1661335","title":"Hidden Markov Model Framework Using Independent Component Analysis Mixture Model","year":2006,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University; RealNetworks (Canada)","funders":"","keywords":"Hidden Markov model; Mixture model; Independent component analysis; Computer science; Gaussian; Pattern recognition (psychology); Parametric statistics; Markov model; Representation (politics); Artificial intelligence; Maximum-entropy Markov model; Component (thermodynamics); Algorithm; Hidden semi-Markov model; Markov chain; Variable-order Markov model; Mathematics; Machine learning; Statistics","score_opus":0.020398701767761273,"score_gpt":0.277230974653774,"score_spread":0.25683227288601274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101843769","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.039731067,0.000038274156,0.95366305,0.0007950762,0.000030580988,0.0001531965,0.0000037400175,0.0005769913,0.005008008],"genre_scores_gemma":[0.4968695,0.0000019472075,0.50203156,0.00060359703,0.000017628294,0.0000055009264,0.00000562366,0.0000071454024,0.00045748078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981794,0.00008508409,0.0003626063,0.0005075618,0.0005747271,0.00029062593],"domain_scores_gemma":[0.9987646,0.000045597422,0.00013317047,0.0008466533,0.00012444728,0.00008554975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039179472,0.0002015834,0.00027793422,0.00041828945,0.00013684406,0.00030958347,0.00086396997,0.00021824904,0.00002468707],"category_scores_gemma":[0.000007693479,0.00018419142,0.00020851458,0.0009977135,0.000028310733,0.00048557072,0.00033573236,0.00029486362,0.000009242314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030992514,0.0000979613,0.00042469244,0.0000029371952,0.00006770007,0.0000033883605,0.0003003895,0.7849702,0.0011710639,0.21124086,0.00095913676,0.00075854413],"study_design_scores_gemma":[0.00006757574,0.0000064745846,0.00030665504,0.0000053278313,0.000055169457,0.0000024561657,0.000006374118,0.90872324,0.0019426857,0.08865507,0.000015447951,0.00021351244],"about_ca_topic_score_codex":0.00024986782,"about_ca_topic_score_gemma":0.000076538054,"teacher_disagreement_score":0.45713845,"about_ca_system_score_codex":0.00010488166,"about_ca_system_score_gemma":0.000088611065,"threshold_uncertainty_score":0.7511108},"labels":[],"label_agreement":null},{"id":"W2102033711","doi":"10.1175/1520-0426(2003)020<1804:eafmca>2.0.co;2","title":"Efficient Algorithms for Maximum Covariance Analysis of Datasets with Many Variables and Fewer Realizations: A Revisit","year":2003,"lang":"en","type":"article","venue":"Journal of Atmospheric and Oceanic Technology","topic":"Blind Source Separation Techniques","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":"Environment and Climate Change Canada","funders":"","keywords":"Singular value decomposition; Algorithm; Principal component analysis; Covariance; Covariance matrix; Eigenvalues and eigenvectors; Matrix decomposition; Computer science; Eigendecomposition of a matrix; QR decomposition; Decomposition; Factorization; Mathematics; Statistics; Artificial intelligence","score_opus":0.008986900124469933,"score_gpt":0.25137273272243926,"score_spread":0.24238583259796934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102033711","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.01553588,0.0015407267,0.98213947,0.00051901914,0.000026471951,0.00014363926,0.000012481663,0.00003736451,0.000044961056],"genre_scores_gemma":[0.21311937,0.00038514155,0.7863255,0.00013239075,0.0000053688586,0.000003958642,0.0000022815739,0.0000066543134,0.000019312394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903524,0.000057395133,0.00041414937,0.00020689152,0.00014701577,0.00013932225],"domain_scores_gemma":[0.99874043,0.00011131182,0.0005362698,0.00031444783,0.00024908056,0.000048427555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074683625,0.00010989885,0.00039114602,0.00008039132,0.0000703617,0.000041287247,0.0002934452,0.000114571936,0.0000058114906],"category_scores_gemma":[0.00016941734,0.000083882675,0.000044835677,0.0015618629,0.00011481036,0.00012296472,0.000061838065,0.00012105327,8.7804246e-8],"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.00006613176,0.0002650146,0.0033069141,0.00007759033,0.0011015338,0.00003011557,0.00043751716,0.006639968,0.0003391647,0.9529575,0.0014361885,0.033342324],"study_design_scores_gemma":[0.0033093994,0.002912453,0.0052403654,0.00030046114,0.0018372389,0.0013247326,0.00072514726,0.87182677,0.0027975573,0.05883714,0.050182097,0.0007066316],"about_ca_topic_score_codex":0.0000028658787,"about_ca_topic_score_gemma":0.0000012078068,"teacher_disagreement_score":0.8941204,"about_ca_system_score_codex":0.000020342442,"about_ca_system_score_gemma":0.000087500244,"threshold_uncertainty_score":0.34206364},"labels":[],"label_agreement":null},{"id":"W2103677028","doi":"10.1109/tbme.2006.873700","title":"The Adaptive Chirplet Transform and Visual Evoked Potentials","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Biomedical Engineering","topic":"Blind Source Separation Techniques","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":"University of Toronto","funders":"","keywords":"Spectrogram; Chirp; Time–frequency analysis; Pattern recognition (psychology); Computer science; Artificial intelligence; Visualization; Speech recognition; Gaussian; Instantaneous phase; Matching pursuit; Transient (computer programming); Computer vision; Algorithm; Optics; Physics","score_opus":0.005648010522442367,"score_gpt":0.2201134803541058,"score_spread":0.21446546983166342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103677028","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.0019157645,0.000056652745,0.9950214,0.0019412397,0.00027193606,0.000156694,0.000004626131,0.00045691797,0.00017476338],"genre_scores_gemma":[0.98656523,0.000061982326,0.013053089,0.00008535126,0.00004732221,0.00004447683,0.0000010811387,0.000011796007,0.00012966462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990252,0.000025783507,0.00021884912,0.00021172232,0.00029350937,0.00022489778],"domain_scores_gemma":[0.9995631,0.00014784763,0.000024757364,0.00014705806,0.000024380453,0.00009288162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026720454,0.00013080718,0.000111820314,0.00014539319,0.00020498151,0.0001215141,0.00022658674,0.00008991148,0.000004563217],"category_scores_gemma":[0.0000033225626,0.000098575445,0.0000636759,0.00032534773,0.00008056347,0.00021104074,0.0000019906668,0.00023668745,0.000006687816],"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.00008012002,0.00074214616,0.0000011230662,0.000052559273,0.00019398684,0.000037561265,0.001047665,0.022246731,0.0618622,0.06140256,0.0011970884,0.85113627],"study_design_scores_gemma":[0.00047518525,0.00029456484,0.00014662069,0.000035458364,0.000013282809,0.000035999386,0.000020058678,0.9248867,0.060621705,0.0012818779,0.011916851,0.00027169698],"about_ca_topic_score_codex":0.000036795805,"about_ca_topic_score_gemma":0.000010793835,"teacher_disagreement_score":0.9846495,"about_ca_system_score_codex":0.000030491054,"about_ca_system_score_gemma":0.000028164004,"threshold_uncertainty_score":0.401979},"labels":[],"label_agreement":null},{"id":"W2103734388","doi":"10.1109/icif.2003.177357","title":"Robust speech separation using two-stage independent component analysis","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Toronto","funders":"","keywords":"Independent component analysis; Kurtosis; Microphone; Computer science; Speech recognition; Noise (video); Blind signal separation; Set (abstract data type); Speech enhancement; Background noise; Source separation; SIGNAL (programming language); Pattern recognition (psychology); Artificial intelligence; Mathematics; Statistics; Telecommunications","score_opus":0.06265238288013911,"score_gpt":0.32605956133289277,"score_spread":0.26340717845275363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103734388","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.1259891,0.00001382524,0.86085624,0.00010374963,0.00006672407,0.0001532403,7.9232206e-7,0.00033495648,0.0124813765],"genre_scores_gemma":[0.6571073,0.0000024513242,0.34162983,0.00034219262,0.000009109504,0.00000431655,0.0000046159053,0.0000050942854,0.00089510257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984172,0.00024862945,0.00030465776,0.00039479957,0.00042500882,0.00020973248],"domain_scores_gemma":[0.9990327,0.00003870129,0.0001285345,0.00059756887,0.000117058495,0.00008545124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078041106,0.00013958612,0.00019692864,0.0004112499,0.00012786342,0.0003162029,0.0003913941,0.00006442116,0.0001849783],"category_scores_gemma":[0.0000182896,0.00013231726,0.00012347075,0.0012833168,0.000019696023,0.0006159418,0.00009215374,0.0001299852,0.000038705046],"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.0000036800143,0.00021879534,0.0056443657,0.000006634409,0.00024913426,0.000023296629,0.0007998679,0.27521005,0.012560201,0.70373666,0.0003525753,0.0011947508],"study_design_scores_gemma":[0.0002558924,0.00002802746,0.0009041212,0.000002533934,0.000058123536,0.000014215421,0.00006897274,0.9041601,0.09051162,0.0013246204,0.0024015466,0.00027022016],"about_ca_topic_score_codex":0.00022311161,"about_ca_topic_score_gemma":0.00030373922,"teacher_disagreement_score":0.702412,"about_ca_system_score_codex":0.000100872654,"about_ca_system_score_gemma":0.000075156815,"threshold_uncertainty_score":0.53957415},"labels":[],"label_agreement":null},{"id":"W2103741299","doi":"10.1109/hscma.2008.4538687","title":"Voice Separation Using Ratchet FAP Algorithm","year":2008,"lang":"en","type":"article","venue":"","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":"National Research Council Canada","funders":"","keywords":"Ratchet; Computer science; Separation (statistics); Scheme (mathematics); Noise (video); Adaptation (eye); Algorithm; Source separation; Adaptive filter; Speech recognition; Artificial intelligence; Mathematics; Machine learning","score_opus":0.046513111062198964,"score_gpt":0.31722138037262265,"score_spread":0.2707082693104237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103741299","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.01961073,0.000017479448,0.9718702,0.0004309416,0.000087391214,0.000112308204,4.4398382e-7,0.00065282034,0.0072176843],"genre_scores_gemma":[0.23430446,0.000009751473,0.7629195,0.0012966796,0.000049898874,0.000006201912,0.0000024503656,0.00000623023,0.0014048679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991883,0.00005456706,0.00016586987,0.0002327289,0.00021565806,0.0001428758],"domain_scores_gemma":[0.9994247,0.00002978754,0.00005637149,0.0003411906,0.00009566647,0.000052273648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019555338,0.000089209345,0.00009141912,0.000087748835,0.00015713045,0.000076741606,0.00033271787,0.00005892132,0.000018844843],"category_scores_gemma":[0.000010705776,0.00008369808,0.000038224745,0.0003265715,0.00002829207,0.0008887756,0.00009360218,0.00008608383,0.00010958952],"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.000021543246,0.0011582919,0.0040900465,0.000035381563,0.0001513808,0.0003041137,0.039444655,0.006737127,0.1526424,0.38470146,0.15602252,0.25469106],"study_design_scores_gemma":[0.00018262111,0.000054585867,0.0006386541,0.000004313835,0.0000022711738,0.00014646075,0.00002118057,0.87158215,0.10912642,0.0025661218,0.01543292,0.00024229223],"about_ca_topic_score_codex":0.00006973118,"about_ca_topic_score_gemma":0.000005590779,"teacher_disagreement_score":0.86484504,"about_ca_system_score_codex":0.000033698416,"about_ca_system_score_gemma":0.000090374,"threshold_uncertainty_score":0.34131086},"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":"W2104862955","doi":"10.1109/iscas.2009.5118084","title":"Orthogonalized linear discriminant analysis based on modified generalized singular value decomposition","year":2009,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Concordia University","funders":"","keywords":"Singular value decomposition; Linear discriminant analysis; Computer science; Subspace topology; Pattern recognition (psychology); Computational complexity theory; Algorithm; Discriminative model; Linear subspace; Dimension (graph theory); Artificial intelligence; Mathematics","score_opus":0.02059166738702435,"score_gpt":0.3147400522011278,"score_spread":0.29414838481410344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104862955","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.032193422,0.000010617907,0.95749915,0.0037622943,0.00003956606,0.00020884899,0.0000019233846,0.0007138056,0.0055703917],"genre_scores_gemma":[0.6315951,0.000002713538,0.3625196,0.005639989,0.000019189063,0.000008491008,0.00004564613,0.000005463769,0.00016385298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981175,0.00029250633,0.0003700458,0.0005078769,0.00046643792,0.00024561773],"domain_scores_gemma":[0.99876696,0.00007115311,0.00012667291,0.0008076578,0.00011331399,0.00011424675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053614593,0.00020198485,0.00032439252,0.00054150407,0.0001491497,0.00019719197,0.0005355129,0.000095056945,0.00003809794],"category_scores_gemma":[0.000026649195,0.00016635477,0.00029381353,0.0011964558,0.000020880214,0.00029536386,0.00003875983,0.00012093419,0.000017845621],"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.00008650923,0.000522128,0.000072285635,0.0000033775423,0.000094032795,0.000021354892,0.00029334045,0.16670933,0.0101093305,0.81367683,0.00046578553,0.007945686],"study_design_scores_gemma":[0.0005148643,0.00020171501,0.0026556891,0.000008291234,0.000083772946,0.0000012339112,0.0000016621233,0.9596341,0.028159099,0.008199397,0.00030852988,0.00023164743],"about_ca_topic_score_codex":0.000057812566,"about_ca_topic_score_gemma":0.000008629465,"teacher_disagreement_score":0.80547744,"about_ca_system_score_codex":0.000053207517,"about_ca_system_score_gemma":0.00006044035,"threshold_uncertainty_score":0.67837507},"labels":[],"label_agreement":null},{"id":"W2104967240","doi":"10.1109/mwscas.2007.4488616","title":"FFT filter bank-based CFAR detection schemes","year":2007,"lang":"en","type":"article","venue":"Conference proceedings","topic":"Blind Source Separation 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":"Defence Research and Development Canada","funders":"","keywords":"Constant false alarm rate; Computer science; Fast Fourier transform; Detector; Filter (signal processing); Filter bank; Noise (video); False alarm; Algorithm; Artificial intelligence; Telecommunications; Computer vision","score_opus":0.024536253692714453,"score_gpt":0.2653734969277449,"score_spread":0.24083724323503047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104967240","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.07388744,0.000018844841,0.9132727,0.0008447093,0.00009947405,0.0001797333,3.294002e-7,0.000896112,0.010800666],"genre_scores_gemma":[0.9323472,0.000003056278,0.066305935,0.0010633867,0.0000538083,0.00002375174,8.444036e-7,0.0000101426795,0.00019190737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987341,0.0000075815074,0.0002453372,0.00040054563,0.00029860428,0.00031380233],"domain_scores_gemma":[0.99906206,0.00003228602,0.00012815493,0.00019252402,0.0004768065,0.000108179316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072596146,0.0001596241,0.00013292948,0.00023038093,0.0001261868,0.00039730032,0.00065326825,0.00012692144,0.000039529914],"category_scores_gemma":[0.00010547833,0.00015579535,0.000053238524,0.0004481681,0.00006086799,0.0008740457,0.00011213465,0.00022376576,0.00006428043],"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.00005133749,0.00016823728,0.0048055295,0.0001046805,0.000022008351,0.000008005815,0.0047357376,0.0000016722344,0.36586756,0.42535383,0.0019308166,0.1969506],"study_design_scores_gemma":[0.0002881099,0.00016629667,0.0031772899,0.00006174038,0.000005069586,0.000010945358,0.000095758885,0.048951816,0.9112596,0.008916791,0.026719855,0.00034675616],"about_ca_topic_score_codex":0.000008162997,"about_ca_topic_score_gemma":0.0000073512047,"teacher_disagreement_score":0.8584597,"about_ca_system_score_codex":0.000047076708,"about_ca_system_score_gemma":0.00008536618,"threshold_uncertainty_score":0.635315},"labels":[],"label_agreement":null},{"id":"W2104969945","doi":"10.1109/icassp.2004.1326686","title":"Underdetermined blind separation for speech in real environments with sparseness and ICA","year":2004,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":61,"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":"Underdetermined system; Blind signal separation; Separation (statistics); Computer science; Independent component analysis; Speech recognition; Artificial intelligence; Pattern recognition (psychology); Machine learning; Algorithm; Telecommunications","score_opus":0.028659317597043425,"score_gpt":0.3002514863095846,"score_spread":0.27159216871254116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104969945","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.29561913,0.000003532141,0.7020246,0.0005656191,0.000010903296,0.00033131576,4.7699086e-7,0.000071582246,0.0013728454],"genre_scores_gemma":[0.78111506,0.000016947688,0.21831697,0.00021526168,0.000008606058,0.00004150792,0.0000037119157,0.0000054132743,0.0002765466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99933845,0.00001950001,0.00013483202,0.00025909414,0.00012357271,0.00012455494],"domain_scores_gemma":[0.99967164,0.0000300645,0.000043612523,0.00020669491,0.000010366201,0.000037599944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014060547,0.00008643938,0.000093636554,0.00009241279,0.000039981296,0.00008948799,0.00014953446,0.000052163337,0.0000016943259],"category_scores_gemma":[0.0000032154496,0.00007225169,0.000011402562,0.00012573502,0.000029298542,0.00041071782,0.00004578451,0.000043481643,0.0000032697403],"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.0006382677,0.0011519062,0.008682289,0.000085641586,0.000059768703,0.000079186095,0.008912065,0.0076805917,0.04339489,0.8335073,0.00030389157,0.0955042],"study_design_scores_gemma":[0.021922262,0.0034839844,0.08153654,0.00014361198,0.000028195038,0.00019488472,0.0003182466,0.0869741,0.61057836,0.18201867,0.010978508,0.0018226574],"about_ca_topic_score_codex":0.00006620216,"about_ca_topic_score_gemma":0.00033149464,"teacher_disagreement_score":0.65148866,"about_ca_system_score_codex":0.000050577855,"about_ca_system_score_gemma":0.000042400545,"threshold_uncertainty_score":0.29463384},"labels":[],"label_agreement":null},{"id":"W2105098658","doi":"10.1109/tbme.2004.841263","title":"Statistical Maps for EEG Dipolar Source Localization","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Biomedical Engineering","topic":"Blind Source Separation 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; Montreal Neurological Institute and Hospital","funders":"","keywords":"Resampling; Electroencephalography; Statistical parametric mapping; Statistic; Pattern recognition (psychology); Parametric statistics; Statistical hypothesis testing; Artificial intelligence; Computer science; Functional magnetic resonance imaging; Mathematics; Statistics; Magnetic resonance imaging; Psychology","score_opus":0.008646730050536181,"score_gpt":0.24069966498263554,"score_spread":0.23205293493209936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105098658","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.000073393545,0.000018836803,0.99724543,0.0012883008,0.00026770512,0.00020299068,0.000028815533,0.00084236177,0.00003218836],"genre_scores_gemma":[0.6324642,0.000017686476,0.36654863,0.0006183811,0.000080115286,0.000096378346,0.000014459868,0.00002495146,0.00013525944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989114,0.000022303911,0.00025325612,0.00027105768,0.0002928312,0.00024915917],"domain_scores_gemma":[0.99930906,0.0001989894,0.000028094333,0.00024467558,0.000042919644,0.00017624111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024039313,0.0001381838,0.00013124828,0.00023448878,0.00010199789,0.000077006815,0.00028516457,0.0001251104,0.000022690125],"category_scores_gemma":[0.000021257945,0.0001387645,0.000063743995,0.00033538413,0.000038808364,0.00026715003,0.0000022959268,0.00020049785,0.000034689492],"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.000019510222,0.00044907135,7.289562e-7,0.00006267877,0.000056214813,0.000003192548,0.0008991814,0.4055172,0.0063285762,0.036366556,0.0034915542,0.54680556],"study_design_scores_gemma":[0.0002614079,0.000108552485,0.0000046803643,0.00002021242,0.000006747392,0.000006981782,0.000004372116,0.81965286,0.012980532,0.00015238745,0.16665493,0.00014632409],"about_ca_topic_score_codex":0.000004909806,"about_ca_topic_score_gemma":0.0000021468531,"teacher_disagreement_score":0.63239074,"about_ca_system_score_codex":0.00007692482,"about_ca_system_score_gemma":0.000039196693,"threshold_uncertainty_score":0.5658652},"labels":[],"label_agreement":null},{"id":"W2105136387","doi":"10.1002/cem.809","title":"Shifted factor analysis—Part II: Algorithms","year":2003,"lang":"en","type":"article","venue":"Journal of Chemometrics","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Western University","funders":"","keywords":"Computation; Algorithm; Position (finance); Factor (programming language); Computer science; Factor analysis; Synthetic data; Conjecture; Mathematics; Machine learning; Discrete mathematics","score_opus":0.03123449909931067,"score_gpt":0.2855000179432603,"score_spread":0.25426551884394966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105136387","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.058282606,0.000343196,0.9369351,0.00069005805,0.00029807395,0.000049974155,0.0000016001247,0.00006604626,0.0033333285],"genre_scores_gemma":[0.701781,0.00009140672,0.29669303,0.00055845454,0.00008262681,0.0000010039171,7.258386e-7,0.000009272334,0.00078249665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982798,0.000106007436,0.00056080875,0.0001535456,0.0007137414,0.00018609299],"domain_scores_gemma":[0.9982373,0.00014727053,0.00058486953,0.00035064254,0.00052082073,0.00015908244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011455845,0.00011849057,0.0003379201,0.0025696454,0.000075685064,0.00017232957,0.00071573723,0.00009620764,0.000069574955],"category_scores_gemma":[0.0008368547,0.0000999424,0.00028518887,0.009979138,0.000019965983,0.00065953034,0.00007291832,0.00031209824,0.0000066267967],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008107414,0.0058670864,0.06931427,0.000112518625,0.008302502,0.0007213813,0.016562006,0.0026831618,0.0086916,0.45615068,0.11518185,0.31633186],"study_design_scores_gemma":[0.0021444026,0.0015364817,0.020637887,0.000040104984,0.00051463855,0.00039276978,0.0001331344,0.0139733385,0.28606784,0.02009679,0.65328807,0.0011745235],"about_ca_topic_score_codex":9.5302084e-7,"about_ca_topic_score_gemma":4.0952017e-7,"teacher_disagreement_score":0.6434984,"about_ca_system_score_codex":0.00007953221,"about_ca_system_score_gemma":0.0001413971,"threshold_uncertainty_score":0.47946453},"labels":[],"label_agreement":null},{"id":"W2105754477","doi":"10.1109/34.982905","title":"On optimal pairwise linear classifiers for normal distributions: the two-dimensional case","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Carleton University","funders":"","keywords":"Quadratic classifier; Pairwise comparison; Classifier (UML); Linear discriminant analysis; Linear classifier; Covariance; Artificial intelligence; Pattern recognition (psychology); Mathematics; Computer science; Quadratic equation; Naive Bayes classifier; Machine learning; Support vector machine; Statistics","score_opus":0.03250572109627777,"score_gpt":0.2894828334181516,"score_spread":0.25697711232187387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105754477","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.0060909092,0.00004407491,0.9909775,0.0022219375,0.000101873535,0.0002451501,0.00013786448,0.0001320682,0.00004861531],"genre_scores_gemma":[0.99074143,0.000041153602,0.007582416,0.0012418701,0.0000203769,0.000096541444,0.0000099787885,0.000009171827,0.00025703758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860346,0.00012931087,0.0003445157,0.00044668047,0.00024689175,0.00022911147],"domain_scores_gemma":[0.99869484,0.00047011938,0.000100497346,0.00051518145,0.000106861364,0.00011250357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037597909,0.0002053738,0.00020968825,0.00029491697,0.0005597696,0.00014693377,0.00034720788,0.00006295639,0.00015981348],"category_scores_gemma":[0.000011448433,0.00014834086,0.00030533946,0.0007345181,0.00010293221,0.00021911462,0.000006443852,0.00031570822,0.000026541482],"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.000034092383,0.0005470518,0.00003266474,0.000009264499,0.00051485386,0.000088008244,0.000806663,0.41995716,0.00007594783,0.0037382205,0.00036369855,0.5738324],"study_design_scores_gemma":[0.00012506111,0.00023268143,0.000017206632,0.000008801408,0.00019379845,0.00012465031,0.000027888758,0.97181064,0.026739126,0.000336987,0.00019433406,0.00018882376],"about_ca_topic_score_codex":0.00029682607,"about_ca_topic_score_gemma":0.00046944522,"teacher_disagreement_score":0.98465055,"about_ca_system_score_codex":0.00003638408,"about_ca_system_score_gemma":0.000013881445,"threshold_uncertainty_score":0.60491645},"labels":[],"label_agreement":null},{"id":"W2105813183","doi":"10.1109/ner.2009.5109381","title":"Detection and removal of ocular artifacts using Independent Component Analysis and wavelets","year":2009,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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 British Columbia","funders":"","keywords":"Wavelet; Thresholding; Artificial intelligence; Artifact (error); Pattern recognition (psychology); Computer science; Discrete wavelet transform; Independent component analysis; SIGNAL (programming language); Noise reduction; Second-generation wavelet transform; Basis (linear algebra); Wavelet packet decomposition; Basis function; Noise (video); Wavelet transform; Stationary wavelet transform; Algorithm; Computer vision; Mathematics; Image (mathematics)","score_opus":0.017265953999833602,"score_gpt":0.26192502428884196,"score_spread":0.24465907028900835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105813183","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.4918618,0.000022974498,0.5077806,0.00008513349,0.000005098903,0.000038679253,7.3905206e-8,0.000040291845,0.00016536057],"genre_scores_gemma":[0.8923665,0.0000098636465,0.10746681,0.0001394466,0.0000035001851,3.26121e-7,3.023268e-7,0.0000013212737,0.000011876727],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993415,0.00005746182,0.00016145369,0.00018936483,0.00017042669,0.00007978541],"domain_scores_gemma":[0.99962854,0.000015397422,0.00007482617,0.00018648444,0.000047890124,0.00004686662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002898585,0.00006387591,0.00013393576,0.00024960324,0.00004638927,0.00006833481,0.00008360049,0.000043063137,0.0000025381355],"category_scores_gemma":[0.000008187773,0.00005790066,0.00003259667,0.00036995075,0.000019179011,0.00023856979,0.000055340945,0.00005216114,3.0100713e-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.000016651205,0.00013851505,0.0024422354,0.000012822867,0.0001857665,0.00004102651,0.0017214518,0.00080753316,0.6910796,0.02149216,0.0000042265588,0.28205797],"study_design_scores_gemma":[0.00014685502,0.00009366213,0.080507964,0.0000051561537,0.000050080693,0.00009271913,0.000017436487,0.57310784,0.3427377,0.00306647,0.000059993366,0.00011409536],"about_ca_topic_score_codex":0.000103455895,"about_ca_topic_score_gemma":0.00003956287,"teacher_disagreement_score":0.5723003,"about_ca_system_score_codex":0.000014507791,"about_ca_system_score_gemma":0.000009087616,"threshold_uncertainty_score":0.23611204},"labels":[],"label_agreement":null},{"id":"W2106013996","doi":"10.1109/tasl.2008.2010277","title":"An Information-Theoretic View of Array Processing","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Audio Speech and Language Processing","topic":"Blind Source Separation Techniques","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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Mutual information; Beamforming; SIGNAL (programming language); Gaussian; Noise (video); Computer science; Set (abstract data type); Algorithm; Signal processing; Laplace operator; Gaussian noise; Interference (communication); Mathematics; Artificial intelligence; Digital signal processing; Telecommunications; Physics","score_opus":0.007351693946662435,"score_gpt":0.26618977404942634,"score_spread":0.2588380801027639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106013996","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.013053241,0.00043180794,0.98402864,0.00040598554,0.000027820415,0.00015061739,0.0000025135269,0.00036201382,0.001537335],"genre_scores_gemma":[0.8875011,0.000038080583,0.111429535,0.0009770073,0.000012254937,0.000007650121,0.0000016715077,0.0000057715597,0.000026890943],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904037,0.00006093925,0.0002927902,0.00019673935,0.00023653617,0.0001726276],"domain_scores_gemma":[0.9993639,0.000021609758,0.00015400391,0.00025505183,0.00011898258,0.00008646766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003606391,0.00014328194,0.00017015608,0.00023669165,0.00018897986,0.0002949234,0.00028280326,0.00007453273,0.000014699733],"category_scores_gemma":[0.000006636549,0.00012883519,0.000038435497,0.00044995008,0.00005779272,0.0022489955,9.1956514e-7,0.00019149728,0.000004764362],"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.000008688821,0.00007657234,0.0000013438676,0.000074925934,0.0000024197668,0.0000016149075,0.008281274,0.00012696329,0.010180453,0.00030879225,0.0000048709057,0.98093206],"study_design_scores_gemma":[0.00050689484,0.000508035,0.00012777047,0.00042303745,0.000026409067,0.00010083707,0.0010899428,0.045289256,0.948467,0.002649988,0.00037067727,0.00044015655],"about_ca_topic_score_codex":0.000006801211,"about_ca_topic_score_gemma":0.0000045826146,"teacher_disagreement_score":0.98049194,"about_ca_system_score_codex":0.000018519928,"about_ca_system_score_gemma":0.000097971846,"threshold_uncertainty_score":0.5253747},"labels":[],"label_agreement":null},{"id":"W2106361725","doi":"10.1109/mwscas.2007.4488607","title":"Continuous wavelet transform based source separation","year":2007,"lang":"en","type":"article","venue":"Conference proceedings","topic":"Blind Source Separation 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":"École de Technologie Supérieure","funders":"","keywords":"Short-time Fourier transform; Wavelet transform; Continuous wavelet transform; Harmonic wavelet transform; Constant Q transform; Computer science; Fourier transform; Wavelet; Artificial intelligence; Blind signal separation; Independent component analysis; Pattern recognition (psychology); Time–frequency analysis; Second-generation wavelet transform; Discrete wavelet transform; Source separation; Stationary wavelet transform; S transform; Speech recognition; Mathematics; Fourier analysis; Computer vision; Telecommunications; Channel (broadcasting)","score_opus":0.018544916142702005,"score_gpt":0.2785451178902901,"score_spread":0.2600002017475881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106361725","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.031548228,0.000011944824,0.9173217,0.002283068,0.000064800835,0.00032314658,6.0831786e-7,0.000936992,0.04750951],"genre_scores_gemma":[0.9366604,0.000003762734,0.061027326,0.0014436203,0.00004446083,0.000026974254,0.000004003207,0.000012798312,0.00077666814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99849135,0.000009021405,0.00034071272,0.00041725027,0.00036383772,0.00037785823],"domain_scores_gemma":[0.9989835,0.000053347267,0.00014209564,0.00018368255,0.0004993442,0.00013801247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010608413,0.00018950515,0.00019283939,0.00020979425,0.00013401873,0.0004595006,0.00071072316,0.00014216886,0.000032766453],"category_scores_gemma":[0.00006080093,0.0001862625,0.000066033914,0.00044274385,0.00006518818,0.0013228315,0.00005418869,0.00023036374,0.000049619925],"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.000057597503,0.00018273875,0.0019537674,0.00006794023,0.000018029737,0.0000069568227,0.017500414,0.000005592465,0.029679261,0.6694306,0.0037277064,0.2773694],"study_design_scores_gemma":[0.0013888098,0.00064533955,0.0044002007,0.00013644715,0.00001974392,0.0000508191,0.000713025,0.2183364,0.58831,0.03428831,0.15055785,0.0011530521],"about_ca_topic_score_codex":0.000012835689,"about_ca_topic_score_gemma":0.000009485681,"teacher_disagreement_score":0.90511215,"about_ca_system_score_codex":0.000050457278,"about_ca_system_score_gemma":0.000113606,"threshold_uncertainty_score":0.7595565},"labels":[],"label_agreement":null},{"id":"W2106815840","doi":"10.1109/icassp.2004.1326397","title":"TOM-based blind identification of cubic nonlinear systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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 Ottawa","funders":"","keywords":"Moment (physics); Nonlinear system; Identification (biology); Domain (mathematical analysis); Computer science; System identification; Algorithm; Mathematics; Artificial intelligence; Pattern recognition (psychology); Applied mathematics; Data mining; Mathematical analysis; Physics","score_opus":0.019669381344407096,"score_gpt":0.2795843982068467,"score_spread":0.2599150168624396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106815840","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.033847626,0.000028092963,0.96318984,0.00082054094,0.00010963969,0.00020569029,0.0000013988194,0.0003221908,0.0014749626],"genre_scores_gemma":[0.9117135,0.0000017501551,0.0878526,0.0001569432,0.00001778461,0.0000147636965,0.0000043211176,0.0000044874987,0.00023385079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99912506,0.000038877854,0.00032371553,0.00018695797,0.00023616372,0.00008923744],"domain_scores_gemma":[0.99914396,0.000024391307,0.00014644148,0.00049119035,0.00015952438,0.000034480436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040350962,0.00006492854,0.00009800815,0.00014634298,0.00003170267,0.000107969696,0.00045310034,0.000052362873,0.0000042907836],"category_scores_gemma":[0.00002255258,0.000058886468,0.000039487837,0.00035961045,0.000031460528,0.0003060492,0.00003664484,0.000053505235,0.000050017137],"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.000009608257,0.00034297703,0.00014308517,0.00006156635,0.000014237395,0.0000025434313,0.00072226144,0.028228985,0.053779766,0.9139568,0.00038396745,0.0023541762],"study_design_scores_gemma":[0.0006797306,0.000094782095,0.00038713144,0.000030723168,0.0000041815124,0.000003862738,0.000031075982,0.23976426,0.7537099,0.0038544135,0.0012852433,0.0001546816],"about_ca_topic_score_codex":0.00007851988,"about_ca_topic_score_gemma":0.0000069229145,"teacher_disagreement_score":0.9101024,"about_ca_system_score_codex":0.000030419475,"about_ca_system_score_gemma":0.000118053074,"threshold_uncertainty_score":0.24013203},"labels":[],"label_agreement":null},{"id":"W2107023572","doi":"10.1016/j.sigpro.2011.09.035","title":"ISI sparse channel estimation based on SL0 and its application in ML sequence-by-sequence equalization","year":2011,"lang":"en","type":"article","venue":"Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Equalization (audio); Computer science; Channel (broadcasting); Viterbi algorithm; Algorithm; Adaptive equalizer; Maximum likelihood sequence estimation; Intersymbol interference; Sparse approximation; Sequence (biology); Estimation theory; Decoding methods; Telecommunications","score_opus":0.07973093308475858,"score_gpt":0.3067964404288097,"score_spread":0.22706550734405112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107023572","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.011986199,0.0000793624,0.98605585,0.00027666384,0.0000127839985,0.000323463,0.000001860384,0.00026408964,0.0009997105],"genre_scores_gemma":[0.9698425,0.0000056279778,0.02933073,0.0006808927,0.00001174733,0.00008426536,0.00001760731,0.000011211848,0.000015448062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879736,0.00009168748,0.0002632365,0.00040595117,0.00026364365,0.00017814862],"domain_scores_gemma":[0.99942935,0.00003681797,0.00019299416,0.00016608063,0.00011766798,0.000057090096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005614789,0.00013655939,0.00011402634,0.00020823412,0.000117380834,0.00013537785,0.00028513093,0.00009254512,0.0000045515276],"category_scores_gemma":[0.00003747746,0.00014000337,0.000013736421,0.00054897554,0.00003538124,0.0012167759,0.000039446153,0.0001293998,0.000010617732],"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.000101906706,0.000529867,0.00058490405,0.00043000458,0.000007830329,0.00001528388,0.017738333,0.025485864,0.19559783,0.09299872,0.0001609212,0.6663485],"study_design_scores_gemma":[0.00014479521,0.000075106494,0.00011756344,0.00011559821,0.0000021524243,0.0000024396818,0.000016889046,0.9024068,0.08174163,0.01521008,0.000017436534,0.0001495047],"about_ca_topic_score_codex":0.000034617602,"about_ca_topic_score_gemma":0.0000055368805,"teacher_disagreement_score":0.9578563,"about_ca_system_score_codex":0.000066677065,"about_ca_system_score_gemma":0.0001060222,"threshold_uncertainty_score":0.5709172},"labels":[],"label_agreement":null},{"id":"W2107363208","doi":"10.1109/lsp.2004.842286","title":"Optimal step size of the adaptive multichannel LMS algorithm for blind SIMO identification","year":2005,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Algorithm; Computer science; Adaptive filter; System identification; Adaptive system; Norm (philosophy); Least mean squares filter; Computational complexity theory; Adaptive algorithm; Control theory (sociology); Mathematics; Artificial intelligence; Data modeling","score_opus":0.023243235674970608,"score_gpt":0.2721660751831672,"score_spread":0.2489228395081966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107363208","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.02025714,0.000040990242,0.97452694,0.004411886,0.000113996284,0.00046917106,0.000006937612,0.00014547292,0.0000274477],"genre_scores_gemma":[0.61845434,4.996989e-7,0.37961638,0.0016759922,0.000119776916,0.000051478382,8.9854217e-7,0.000011513661,0.00006912674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998598,0.00008330198,0.00037310662,0.00035377988,0.00036639988,0.00022545322],"domain_scores_gemma":[0.9988703,0.00018494776,0.000367243,0.0002965622,0.00023833664,0.00004262336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052873406,0.00015029039,0.00015161069,0.0000813412,0.00020573732,0.00019517391,0.000833324,0.000071440125,0.000002294776],"category_scores_gemma":[0.00003029614,0.00012224144,0.00010385982,0.00033354768,0.0001212584,0.00078039826,0.000060908922,0.000158956,0.0000045119423],"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.000044971748,0.00018548762,0.000007901472,0.000049773287,0.000038141094,9.729209e-7,0.0053108186,0.04200837,0.2754182,0.00036292936,0.0035143464,0.6730581],"study_design_scores_gemma":[0.00036446733,0.000038602942,0.000064727006,0.000041470343,0.000011093156,0.0000025936865,0.000046797453,0.7444052,0.25442803,0.00013269637,0.00033336852,0.0001309431],"about_ca_topic_score_codex":0.00000685717,"about_ca_topic_score_gemma":0.0000021036099,"teacher_disagreement_score":0.70239687,"about_ca_system_score_codex":0.000054143984,"about_ca_system_score_gemma":0.00009342777,"threshold_uncertainty_score":0.49848616},"labels":[],"label_agreement":null},{"id":"W2108595831","doi":"10.1109/milcom.1993.408534","title":"Recursive least squares algorithm for blind deconvolution of channels with cyclostationary inputs","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Cyclostationary process; Algorithm; Autocorrelation matrix; Autocorrelation; Cepstrum; Blind deconvolution; Channel (broadcasting); Computer science; Deconvolution; Blind equalization; Signal processing; Recursive least squares filter; Identifiability; Mathematics; Adaptive filter; Speech recognition; Digital signal processing; Statistics; Telecommunications","score_opus":0.027048024173599198,"score_gpt":0.25782591399542637,"score_spread":0.23077788982182718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108595831","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.002487163,0.000054635002,0.9930275,0.001729962,0.00006759622,0.00043997308,0.000008843168,0.00017637598,0.0020079445],"genre_scores_gemma":[0.28176883,0.000016912103,0.71669275,0.00049013254,0.000040932286,0.000085799315,0.000012824221,0.000009287295,0.00088253245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991853,0.00003938073,0.00019726268,0.00023998632,0.00019456622,0.00014347077],"domain_scores_gemma":[0.99917275,0.00009977667,0.00013166973,0.0002377952,0.00031142606,0.000046581714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015475362,0.000097140204,0.00012180399,0.00016496354,0.000065673164,0.00004633705,0.0002793716,0.000057099696,0.000032474745],"category_scores_gemma":[0.000018286824,0.00008260925,0.000039704453,0.00028543576,0.00004850734,0.0005891876,0.00004058295,0.000053828506,0.000011296262],"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.00007310474,0.00076096854,0.00024663442,0.00006496067,0.00010994356,0.00000688853,0.011814511,0.0012717762,0.00061136857,0.391081,0.030106535,0.5638523],"study_design_scores_gemma":[0.0017772148,0.0015583367,0.00042158057,0.00006671912,0.000013446827,0.000036251015,0.0001865747,0.9016314,0.05834469,0.029344365,0.006204267,0.00041514702],"about_ca_topic_score_codex":0.000010722074,"about_ca_topic_score_gemma":0.000007150798,"teacher_disagreement_score":0.90035963,"about_ca_system_score_codex":0.000023761246,"about_ca_system_score_gemma":0.000028829543,"threshold_uncertainty_score":0.33687076},"labels":[],"label_agreement":null},{"id":"W2109347551","doi":"10.1115/1.4005277","title":"A Novel Approach to Evaluation of Vibration Source Separation Based on Spatial Distribution of Sensors and Fourier Transforms","year":2011,"lang":"en","type":"article","venue":"Journal of Dynamic Systems Measurement and Control","topic":"Blind Source Separation 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":"Polytechnique Montréal","funders":"","keywords":"Vibration; Metric (unit); A priori and a posteriori; Computer science; Fourier transform; Noise (video); Acoustics; Algorithm; Energy (signal processing); Fast Fourier transform; Pattern recognition (psychology); Artificial intelligence; Mathematics; Statistics; Engineering; Physics","score_opus":0.05026274671886256,"score_gpt":0.25698757196563304,"score_spread":0.2067248252467705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109347551","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.12422476,0.00007068988,0.87472403,0.00010339368,0.00008156711,0.000619001,0.000005343543,0.00001037812,0.00016083791],"genre_scores_gemma":[0.99578273,0.0000024244819,0.0041368166,0.000027028516,0.000021441241,0.000019138852,0.0000026724665,0.0000050815106,0.0000026617183],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976781,0.00027583176,0.0006349253,0.00014034915,0.0011822562,0.00008853403],"domain_scores_gemma":[0.99800473,0.000031322055,0.0006418049,0.00014842564,0.0011093278,0.00006437032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004619364,0.00010987103,0.00028107798,0.000185381,0.000040211053,0.000040965933,0.00011876071,0.000068591624,5.889841e-7],"category_scores_gemma":[0.00009963917,0.00008679281,0.000060384555,0.00013155177,0.000021881287,0.0002967097,0.000006205228,0.000077329205,1.1260038e-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.0039042083,0.0036017627,0.0047070845,0.000911055,0.0009315362,0.0000018018761,0.028883718,0.16906625,0.56158143,0.026571015,0.00013533527,0.19970483],"study_design_scores_gemma":[0.0022553208,0.00071063824,0.01193095,0.00014034178,0.00009249827,0.0000121821,0.00012013364,0.9816618,0.0028773108,0.000101329235,0.000012597039,0.00008491998],"about_ca_topic_score_codex":0.00005950519,"about_ca_topic_score_gemma":0.00001243733,"teacher_disagreement_score":0.87155795,"about_ca_system_score_codex":0.00010065086,"about_ca_system_score_gemma":0.00013670356,"threshold_uncertainty_score":0.3539308},"labels":[],"label_agreement":null},{"id":"W2110130611","doi":"10.1109/icif.2002.1021182","title":"Multi-channel time-frequency data fusion","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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 Toronto","funders":"","keywords":"Multilateration; Computer science; Filter (signal processing); Channel (broadcasting); Noise (video); Ideal (ethics); Set (abstract data type); Algorithm; Gaussian noise; Speech recognition; Acoustics; Artificial intelligence; Telecommunications; Physics","score_opus":0.06101529976777928,"score_gpt":0.30051559326857946,"score_spread":0.23950029350080018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110130611","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.0002607604,0.000043935004,0.96920127,0.00060188817,0.00007714664,0.00012156357,0.0000026454084,0.0006627403,0.029028052],"genre_scores_gemma":[0.077676915,0.000015275255,0.9155222,0.0014878814,0.000013339819,0.000006700532,0.000019157163,0.000008572563,0.005249964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907213,0.000099618126,0.00014719451,0.00036663882,0.00016486953,0.00014952439],"domain_scores_gemma":[0.99835795,0.000033594762,0.000041684278,0.0014534413,0.000053170097,0.0000601306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005471705,0.000085467385,0.00007914272,0.00006927763,0.00007267642,0.00011301821,0.0012851333,0.000054221142,0.00013840345],"category_scores_gemma":[0.000095831754,0.00007312675,0.000018493265,0.00023572422,0.0000167772,0.0008449627,0.00035690723,0.00008201867,0.00053256936],"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.0000025962988,0.000742687,0.00019547417,0.000015334035,0.000028896071,0.00003120707,0.0021249908,0.00009105875,0.035071764,0.7846653,0.15921013,0.01782056],"study_design_scores_gemma":[0.0008642404,0.00015092675,0.0004701479,0.000023791283,0.0000070501237,0.000061621344,0.000044705674,0.8039671,0.06311331,0.044508703,0.08600776,0.0007806185],"about_ca_topic_score_codex":0.00002406722,"about_ca_topic_score_gemma":0.000010471673,"teacher_disagreement_score":0.80387604,"about_ca_system_score_codex":0.000012224017,"about_ca_system_score_gemma":0.00005740655,"threshold_uncertainty_score":0.68452793},"labels":[],"label_agreement":null},{"id":"W2110494637","doi":"10.1190/segam2012-1257.1","title":"Q estimation by a match-filter method","year":2012,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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 Calgary","funders":"","keywords":"Computer science; Estimation; Filter (signal processing); Computer vision; Engineering","score_opus":0.018314931060002308,"score_gpt":0.32071796338939434,"score_spread":0.30240303232939203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110494637","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.00050951005,0.000025215866,0.9755034,0.0016510164,0.00006066491,0.00007459345,3.3981385e-7,0.00054686784,0.021628384],"genre_scores_gemma":[0.18251024,9.3999796e-7,0.8139329,0.0019268804,0.000013998049,0.000014478056,0.0000019890958,0.0000035079624,0.0015950621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994531,0.0000760776,0.000100710284,0.0001045075,0.00012549905,0.00014004974],"domain_scores_gemma":[0.99958473,0.000047053534,0.000033308053,0.0002570987,0.000019995472,0.00005779861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005176128,0.00005606197,0.0000562733,0.00004259661,0.00003185498,0.0000880821,0.0002465487,0.000037333022,0.00007104208],"category_scores_gemma":[0.000014863537,0.000046767986,0.000021162981,0.00013350502,0.000005955561,0.0009971901,0.00007691704,0.000050017097,0.00020782156],"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":[8.2425737e-7,0.00008347296,0.0002080527,0.000004411302,0.000006008362,1.59314e-7,0.0019123369,0.00002418582,0.0046237414,0.68343586,0.15439872,0.15530221],"study_design_scores_gemma":[0.0001781451,0.000050080722,0.000690637,0.0000080349855,0.0000042929832,0.000024083432,0.000025593383,0.43743566,0.44106567,0.02611334,0.094081365,0.00032311695],"about_ca_topic_score_codex":0.000015162645,"about_ca_topic_score_gemma":4.4311022e-7,"teacher_disagreement_score":0.6573225,"about_ca_system_score_codex":0.0000132394935,"about_ca_system_score_gemma":0.000008550363,"threshold_uncertainty_score":0.2671195},"labels":[],"label_agreement":null},{"id":"W2110692145","doi":"10.1016/j.mri.2006.09.042","title":"CORSICA: correction of structured noise in fMRI by automatic identification of ICA components","year":2006,"lang":"en","type":"article","venue":"Magnetic Resonance Imaging","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":201,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Independent component analysis; Artificial intelligence; Noise (video); Computer science; Pattern recognition (psychology); Functional magnetic resonance imaging; Noise reduction; Aliasing; Communication noise; Brain activity and meditation; Prior probability; Electroencephalography; Bayesian probability; Undersampling; Image (mathematics); Neuroscience","score_opus":0.005566741325366598,"score_gpt":0.22972282626565127,"score_spread":0.22415608494028466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110692145","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78786534,0.0017032365,0.2079401,0.00052529335,0.000297545,0.000418629,0.0000077946115,0.00017224846,0.001069805],"genre_scores_gemma":[0.9887744,0.000012501707,0.010884868,0.0000433609,0.000007917158,0.000017886885,0.000009631687,0.000007642875,0.00024174701],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99857247,0.00011093998,0.0006068421,0.00025908402,0.00030071693,0.00014995647],"domain_scores_gemma":[0.99909866,0.000067050394,0.00031846153,0.0003976529,0.00009917662,0.000019021114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003152029,0.00010453123,0.0001909582,0.00019689082,0.0000306335,0.000050760744,0.00041270463,0.00003356989,0.000011934182],"category_scores_gemma":[0.000040281655,0.00011327064,0.000036437294,0.0005130505,0.00008820742,0.00030964604,0.00006785453,0.00009587633,0.0000029765006],"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.000013674453,0.00026568086,0.05713211,0.00006707838,0.0000017247485,0.0000036326708,0.0009748087,0.00046129196,0.5142962,0.003873965,0.0079853805,0.41492447],"study_design_scores_gemma":[0.00029127023,0.000026633737,0.46228606,0.000068188245,0.0000029476405,0.000004282691,0.000016073636,0.4411546,0.092905626,0.002255703,0.00088522275,0.00010338331],"about_ca_topic_score_codex":0.00044750667,"about_ca_topic_score_gemma":0.000018171093,"teacher_disagreement_score":0.44069332,"about_ca_system_score_codex":0.000042760254,"about_ca_system_score_gemma":0.000027275002,"threshold_uncertainty_score":0.46190426},"labels":[],"label_agreement":null},{"id":"W2111340133","doi":"10.1002/eqe.973","title":"Independent component regression for predicting the responses of biaxial base‐isolated buildings","year":2009,"lang":"en","type":"article","venue":"Earthquake Engineering & Structural Dynamics","topic":"Blind Source Separation 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 Waterloo","funders":"","keywords":"Principal component analysis; Principal component regression; Statistics; Regression; Regression analysis; Base (topology); Displacement (psychology); Curse of dimensionality; Range (aeronautics); Mathematics; Variance (accounting); Dimensionality reduction; Set (abstract data type); Dimension (graph theory); Variables; Linear regression; Uncorrelated; Data set; Component (thermodynamics); Variable (mathematics); Computer science; Engineering; Artificial intelligence; Mathematical analysis","score_opus":0.008747572180759906,"score_gpt":0.24103294640845038,"score_spread":0.23228537422769047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111340133","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56981164,0.00002756135,0.42891225,0.00053819205,0.000186377,0.00023613212,0.000011898693,0.0002662843,0.000009668136],"genre_scores_gemma":[0.9402941,0.0000048804814,0.059496503,0.000074872296,0.000051614446,0.000008399728,0.00001732047,0.000012861145,0.00003947494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987343,0.000057101744,0.00037054854,0.00027092794,0.00030780898,0.00025931332],"domain_scores_gemma":[0.998974,0.00025225643,0.0001820762,0.00041870645,0.00011649513,0.00005644219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043700854,0.00019369533,0.00020432481,0.00015191328,0.00013938948,0.000111952795,0.00061280694,0.00010078903,0.0000015384442],"category_scores_gemma":[0.00014949242,0.00014150504,0.000106987405,0.00029661483,0.000025839558,0.00029380692,0.00009769249,0.00026539492,4.052759e-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.0002856241,0.000048256676,0.0015788988,0.000088856796,0.00008151391,0.000011575349,0.0043219062,0.051867563,0.025699321,0.23694749,0.0001439481,0.67892504],"study_design_scores_gemma":[0.00024017677,0.00021049252,0.23748273,0.000064993976,0.0000062625977,0.00002573968,0.000015996979,0.75876737,0.0020673461,0.0008182183,0.00014463218,0.00015605733],"about_ca_topic_score_codex":0.000014911312,"about_ca_topic_score_gemma":0.0000065391228,"teacher_disagreement_score":0.7068998,"about_ca_system_score_codex":0.000056349916,"about_ca_system_score_gemma":0.000038684986,"threshold_uncertainty_score":0.5770408},"labels":[],"label_agreement":null},{"id":"W2111670418","doi":"10.1155/2012/891932","title":"Efficient Rank-Adaptive Least-Square Estimation and Multiple-Parameter Linear Regression Using Novel Dyadically Recursive Hermitian Matrix Inversion","year":2012,"lang":"en","type":"article","venue":"International Journal of Antennas and Propagation","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":"Communications Research Centre Canada; McGill University","funders":"National Aeronautics and Space Administration; Louisiana State University; National Science Foundation","keywords":"Cholesky decomposition; Hermitian matrix; Recursion (computer science); Algorithm; Inversion (geology); Computational complexity theory; Mathematics; Rank (graph theory); Matrix (chemical analysis); Applied mathematics; Computer science; Mathematical optimization; Theoretical computer science; Combinatorics","score_opus":0.030457589047083938,"score_gpt":0.3100845942494556,"score_spread":0.27962700520237166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111670418","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.35442975,0.00017544493,0.64399856,0.0009602318,0.00027485937,0.00011711629,0.000003093792,0.000018518136,0.000022445092],"genre_scores_gemma":[0.78776795,0.00004115766,0.21187384,0.00017099372,0.00012405303,9.2577824e-7,0.0000038337025,0.000006734994,0.000010523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867606,0.000110235604,0.0004078218,0.00015547033,0.0005142197,0.00013619644],"domain_scores_gemma":[0.99844134,0.00015196978,0.0005658427,0.0000886825,0.0006299349,0.00012223008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069217297,0.00012925945,0.00015374289,0.0002985655,0.000101992606,0.00013959204,0.00021552647,0.00008828283,0.00000402213],"category_scores_gemma":[0.00027723104,0.000101392325,0.000057819205,0.0001245476,0.000067072724,0.00095858367,0.000108432345,0.00020546291,0.0000015453746],"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.0033060648,0.0022458108,0.021677237,0.00019198172,0.0006444174,0.00011873993,0.039435823,0.036642406,0.30607185,0.09829179,0.00043295568,0.49094093],"study_design_scores_gemma":[0.00082690193,0.00021435955,0.0026068604,0.00038737388,0.000017501101,0.00041857435,0.0001790362,0.9874874,0.0067869597,0.00079825666,0.0001426805,0.00013413222],"about_ca_topic_score_codex":0.000014728496,"about_ca_topic_score_gemma":0.0000010340394,"teacher_disagreement_score":0.95084494,"about_ca_system_score_codex":0.000088336856,"about_ca_system_score_gemma":0.000060226153,"threshold_uncertainty_score":0.4134659},"labels":[],"label_agreement":null},{"id":"W2112297528","doi":"10.1162/neco_a_00355","title":"Shared and Specific Independent Components Analysis for Between-Group Comparison","year":2012,"lang":"en","type":"article","venue":"Neural Computation","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":"Montreal Neurological Institute and Hospital; McGill University","funders":"","keywords":"FastICA; Independent component analysis; Group (periodic table); Algorithm; Convergence (economics); Pattern recognition (psychology); Subspace topology; Mathematics; Constraint (computer-aided design); Computer science; Artificial intelligence; Blind signal separation","score_opus":0.08783203967916306,"score_gpt":0.3324769303899747,"score_spread":0.24464489071081166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112297528","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.3584872,0.00008230235,0.6406752,0.00020866834,0.00009074193,0.00022854384,0.000005252527,0.00017518051,0.000046910165],"genre_scores_gemma":[0.9203665,0.000002007504,0.07919662,0.00014731957,0.000081663675,0.000021935391,0.00016961913,0.000007852912,0.000006442282],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987823,0.00012789704,0.00031387302,0.00028756523,0.00026961736,0.00021875219],"domain_scores_gemma":[0.99924064,0.00020590897,0.00017504822,0.00018324006,0.000080716425,0.000114459486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039200502,0.00013156071,0.00025088806,0.00029103758,0.0001403513,0.00025040205,0.00024175578,0.00006626278,0.0000025930794],"category_scores_gemma":[0.000009650336,0.00013302246,0.00008546275,0.00050338847,0.00002186877,0.00084803504,0.00011626963,0.0001137565,0.0000067731876],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004558137,0.00040502238,0.8345949,0.000048864902,0.00035310324,0.0000011129919,0.0054620234,0.008566076,0.003957521,0.040208533,0.0020646653,0.104292564],"study_design_scores_gemma":[0.0002892288,0.00007760259,0.636088,0.0000030749493,0.000039221442,0.0000014351493,0.00001745966,0.36105517,0.00056837336,0.0010777687,0.0006404895,0.00014214599],"about_ca_topic_score_codex":0.000012175537,"about_ca_topic_score_gemma":0.0000043077016,"teacher_disagreement_score":0.56187934,"about_ca_system_score_codex":0.00003671047,"about_ca_system_score_gemma":0.0000045964043,"threshold_uncertainty_score":0.54244983},"labels":[],"label_agreement":null},{"id":"W2112646353","doi":"10.1109/isspit.2010.5711804","title":"Blind Source Separation in nonminimum-phase systems based on filter decomposition","year":2010,"lang":"en","type":"article","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Blind signal separation; Filter (signal processing); Frequency domain; Computer science; Control theory (sociology); Deconvolution; Mixing (physics); Time domain; Source separation; Algorithm; Blind deconvolution; Speech recognition; Channel (broadcasting); Artificial intelligence","score_opus":0.01781792324610569,"score_gpt":0.34339089909070564,"score_spread":0.32557297584459993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112646353","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.18153623,0.0000020054447,0.8090798,0.0008286209,0.00023819393,0.00035953757,0.000001291484,0.00037112733,0.007583148],"genre_scores_gemma":[0.9607617,3.297633e-7,0.037430227,0.0012420574,0.000058384252,0.00007298329,0.000019301404,0.000010158072,0.00040484132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871534,0.00013138556,0.00031331336,0.00036388094,0.00028658455,0.00018947848],"domain_scores_gemma":[0.99902797,0.0001428141,0.00009836813,0.0005792675,0.00007438625,0.00007721266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006216818,0.00014141029,0.0001395359,0.00036165075,0.00008756277,0.00047535964,0.00041251065,0.00014288297,0.0000499325],"category_scores_gemma":[0.000026161168,0.00013050172,0.000044898217,0.0003586697,0.000027685819,0.0005447868,0.00004332371,0.00029100775,0.00013491992],"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.00077196304,0.0065655475,0.0027132174,0.00011565675,0.000036232937,0.00008871215,0.007830148,0.08736032,0.32180187,0.46939906,0.029557856,0.0737594],"study_design_scores_gemma":[0.0012663832,0.00024591817,0.0002961016,0.000018441771,0.0000014574695,0.0000065082327,0.000010876033,0.9626406,0.029320799,0.00026122347,0.005753407,0.00017829356],"about_ca_topic_score_codex":0.000052692416,"about_ca_topic_score_gemma":0.00009230631,"teacher_disagreement_score":0.87528026,"about_ca_system_score_codex":0.000032877146,"about_ca_system_score_gemma":0.00007654705,"threshold_uncertainty_score":0.53217053},"labels":[],"label_agreement":null},{"id":"W2113136578","doi":"10.1109/icassp.2003.1202633","title":"Blind separation of BPSK signals using Newton's method on the Stiefel manifold","year":2004,"lang":"en","type":"article","venue":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","topic":"Blind Source Separation Techniques","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":"Stiefel manifold; Blind signal separation; Phase-shift keying; Rate of convergence; Algorithm; Mathematics; Quadratic equation; Manifold (fluid mechanics); Independent component analysis; Convergence (economics); Newton's method; Computational complexity theory; Separation (statistics); Applied mathematics; Computer science; Mathematical optimization; Bit error rate; Nonlinear system; Decoding methods; Artificial intelligence; Telecommunications; Statistics; Channel (broadcasting)","score_opus":0.0863386003143382,"score_gpt":0.35795990963836255,"score_spread":0.27162130932402434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113136578","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.026820662,0.00006122701,0.9469967,0.0014889379,0.00044375463,0.000818581,0.000034189965,0.00026095167,0.023075027],"genre_scores_gemma":[0.7918636,0.00009494893,0.20478392,0.0020443616,0.00027481708,0.000040707313,0.000011106928,0.000040362713,0.000846167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628013,0.00007891804,0.0008695405,0.0009128114,0.0013849407,0.00047367217],"domain_scores_gemma":[0.9937178,0.00005445863,0.00092988356,0.00026640302,0.0048405407,0.00019089806],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013201598,0.00051982916,0.00047352252,0.00048058416,0.0003781712,0.0010525791,0.0012933543,0.00031498328,0.00013249506],"category_scores_gemma":[0.0004300546,0.00042229262,0.00007982018,0.0009786783,0.00021263301,0.0011237263,0.00014016258,0.0007239557,0.00003903917],"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.00020708302,0.0004724823,0.000062359584,0.00009296693,0.00009517686,0.000018234445,0.0015946124,0.0030649898,0.07447636,0.9108758,0.0043558534,0.004684108],"study_design_scores_gemma":[0.0012934966,0.0007156928,0.00012767645,0.00060279487,0.000063062194,0.000104740095,0.0005713758,0.81060565,0.16193835,0.0218962,0.0013536494,0.0007272992],"about_ca_topic_score_codex":0.000060032748,"about_ca_topic_score_gemma":0.0000055402747,"teacher_disagreement_score":0.88897955,"about_ca_system_score_codex":0.00022149984,"about_ca_system_score_gemma":0.00090651045,"threshold_uncertainty_score":0.99998444},"labels":[],"label_agreement":null},{"id":"W2113486168","doi":"10.1109/tcsi.2005.852488","title":"Blind identification of autoregressive system using chaos","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications","topic":"Blind Source Separation 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":"University of Calgary","funders":"","keywords":"Autoregressive model; Chaotic; Lyapunov exponent; CHAOS (operating system); Identification (biology); System identification; Blind equalization; Equalization (audio); Mathematics; Control theory (sociology); SIGNAL (programming language); Algorithm; Gaussian; Parameter identification problem; Computer science; Statistics; Artificial intelligence; Decoding methods; Data modeling","score_opus":0.027724932694157135,"score_gpt":0.2834123331870087,"score_spread":0.25568740049285155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113486168","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.036133125,0.00027362813,0.96202165,0.000054324828,0.00009900023,0.0007371326,0.000049572685,0.00016222775,0.00046936455],"genre_scores_gemma":[0.9988248,0.00003179859,0.0005598632,0.000039743158,0.0000447057,0.00027283686,0.0000021100495,0.000010444072,0.00021374576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875265,0.00019444396,0.0004293009,0.0003278439,0.00017425566,0.00012152667],"domain_scores_gemma":[0.9991147,0.00013361611,0.00024294722,0.00035556327,0.00007296743,0.00008019389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069769536,0.00013427966,0.0001825601,0.0001834271,0.0003710884,0.00017133243,0.00019538251,0.00008234948,0.0000028678658],"category_scores_gemma":[0.0000014059468,0.00012790534,0.000045407833,0.00019815346,0.0001346606,0.00039665808,0.0000038768617,0.00011177281,0.000006745836],"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.000010283884,0.00016984424,0.000008403259,0.00011888483,0.000046536323,3.1965e-7,0.001635836,0.0025698638,0.033162296,0.9095036,0.000004117767,0.05277004],"study_design_scores_gemma":[0.0035301223,0.00052903476,0.0005972994,0.0010231757,0.00032645027,0.0008254183,0.011013726,0.5643852,0.39399657,0.015081234,0.006940557,0.0017512242],"about_ca_topic_score_codex":0.000011969685,"about_ca_topic_score_gemma":0.0000019678173,"teacher_disagreement_score":0.9626916,"about_ca_system_score_codex":0.00006552121,"about_ca_system_score_gemma":0.000031405794,"threshold_uncertainty_score":0.5215828},"labels":[],"label_agreement":null},{"id":"W2113812096","doi":"10.1007/978-3-540-49127-9_13","title":"Adaptive Blind Multichannel Identification","year":2007,"lang":"en","type":"book-chapter","venue":"Springer handbooks","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec; Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Impulse response; Identification (biology); Speech recognition; System identification; Finite impulse response; Adaptive filter; Impulse (physics); Communications system; Signal processing; Algorithm; Telecommunications; Mathematics; Data mining","score_opus":0.07136894318947985,"score_gpt":0.2899272191064294,"score_spread":0.21855827591694954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113812096","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008735006,0.00037956837,0.61424834,0.00007360303,0.00033256176,0.00039561946,0.000004611095,0.00054432737,0.38401264],"genre_scores_gemma":[0.017639717,0.00016699689,0.10204057,0.0009145911,0.00048641645,0.000059867074,0.000025677251,0.00013586256,0.8785303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997748,0.000026127638,0.00056689157,0.0007838129,0.0005678137,0.0003073292],"domain_scores_gemma":[0.9978989,0.00008535191,0.00044883238,0.0011248887,0.00030401818,0.00013805045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007389729,0.00039540968,0.00033475997,0.0005552983,0.00014194204,0.00029134224,0.0010230235,0.00050554425,0.00005123456],"category_scores_gemma":[0.000021559137,0.0004242449,0.00019322094,0.000052533913,0.0001032863,0.00033023846,0.00037622827,0.0006056978,0.00069107005],"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.000022444818,0.000021010756,0.0000012057325,0.00001604219,0.000063665495,0.00002663878,0.0010287032,0.000009571552,0.00036666924,0.9498746,0.0008723237,0.04769714],"study_design_scores_gemma":[0.0019172042,0.0004177912,0.00015416864,0.0011816237,0.00014926767,0.000058405367,0.000033662986,0.01592459,0.07840408,0.37573513,0.5227787,0.0032453742],"about_ca_topic_score_codex":0.000010258552,"about_ca_topic_score_gemma":0.000043695552,"teacher_disagreement_score":0.5741395,"about_ca_system_score_codex":0.00012379944,"about_ca_system_score_gemma":0.00012066736,"threshold_uncertainty_score":0.99982095},"labels":[],"label_agreement":null},{"id":"W2114491431","doi":"10.1109/ccece.2007.157","title":"An Application of ICA to DS-CDMA Detection","year":2007,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Saskatchewan","funders":"","keywords":"Code division multiple access; Independent component analysis; Detector; Computer science; Telecommunications link; Multiuser detection; Focus (optics); Algorithm; Detection theory; Speech recognition; Spread spectrum; Symbol (formal); Code (set theory); Artificial intelligence; Pattern recognition (psychology); Telecommunications","score_opus":0.009057410898930435,"score_gpt":0.29926542365842923,"score_spread":0.2902080127594988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114491431","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.043310475,0.0000012620578,0.94960064,0.00022144744,0.000022391108,0.00014704141,1.0174547e-7,0.00034247435,0.006354181],"genre_scores_gemma":[0.8055114,2.361277e-7,0.19398826,0.0004312213,0.000014603201,0.000007774964,4.0543316e-7,0.0000022784322,0.00004381764],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999492,0.000017048094,0.0001374412,0.00015199209,0.00012378913,0.000077738485],"domain_scores_gemma":[0.99943525,0.000019891258,0.000041905463,0.00036881055,0.0000802768,0.000053898584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047593718,0.000038892427,0.00004661418,0.000119550685,0.000026027723,0.0000254239,0.00029092527,0.0000365904,0.0000036915615],"category_scores_gemma":[0.000008940249,0.00003672304,0.000014694446,0.00034990464,0.000007801769,0.00025436562,0.00003297302,0.00003357567,0.000024246694],"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.000005150388,0.00005715591,0.00016846404,0.0000019643808,0.0000014064053,1.4318768e-7,0.0006271992,0.00005086256,0.30235234,0.13839732,0.00008888946,0.5582491],"study_design_scores_gemma":[0.00003868277,0.00014828239,0.00727094,0.0000010251588,5.9511325e-7,0.0000015719481,0.000019373712,0.018727038,0.96529394,0.002991803,0.0054457854,0.000060983504],"about_ca_topic_score_codex":0.000071835726,"about_ca_topic_score_gemma":0.00014539795,"teacher_disagreement_score":0.76220095,"about_ca_system_score_codex":0.000016188897,"about_ca_system_score_gemma":0.000008840637,"threshold_uncertainty_score":0.1497522},"labels":[],"label_agreement":null},{"id":"W2114732083","doi":"10.1109/lcomm.2005.10012","title":"A simple and fast carrier recovery algorithm for high-order QAM","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Algorithm; Simple (philosophy); QAM; Quadrature amplitude modulation; Telecommunications; Decoding methods; Bit error rate","score_opus":0.021339691162014975,"score_gpt":0.2845591375098508,"score_spread":0.26321944634783584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114732083","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.004940408,0.00013236063,0.94255626,0.051454525,0.0000631277,0.00031649767,0.000028108094,0.00027620053,0.0002325408],"genre_scores_gemma":[0.16173463,0.00010758585,0.8239539,0.013772479,0.000060190683,0.00021150701,0.000030074585,0.000014704483,0.0001149286],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991543,0.00011407654,0.00021879395,0.00022774436,0.000107326276,0.00017773094],"domain_scores_gemma":[0.9977504,0.0002558588,0.00009020008,0.0017408503,0.00010489131,0.0000577897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002891596,0.00011298381,0.00012292709,0.0001256045,0.00028681313,0.00019115733,0.0012722437,0.00005487025,0.0000035179994],"category_scores_gemma":[0.000023567876,0.00012114494,0.000041395568,0.00024932256,0.000107047425,0.0006303265,0.00026284857,0.00015380856,0.000010022025],"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.0000027634926,0.00012293688,0.000045755056,0.000007300338,0.000053391068,4.7097242e-7,0.0021635292,0.00039531675,0.009825971,0.028608836,0.0648165,0.89395726],"study_design_scores_gemma":[0.0009341402,0.00012316903,0.0007511829,0.00002557736,0.000026718038,0.000019525896,0.0000827695,0.29230207,0.01590836,0.005978629,0.6831913,0.00065657956],"about_ca_topic_score_codex":0.000056381232,"about_ca_topic_score_gemma":0.00007456025,"teacher_disagreement_score":0.89330065,"about_ca_system_score_codex":0.00004960264,"about_ca_system_score_gemma":0.000038472666,"threshold_uncertainty_score":0.4940147},"labels":[],"label_agreement":null},{"id":"W2114958144","doi":"10.1109/icassp.2003.1202340","title":"Gearbox fault diagnosis using independent component analysis in the frequency domain and wavelet filtering","year":2003,"lang":"en","type":"article","venue":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Morlet wavelet; Wavelet; Independent component analysis; Wavelet transform; Frequency domain; Pattern recognition (psychology); Computer science; Wavelet packet decomposition; Discrete wavelet transform; Artificial intelligence; Fault (geology); Entropy (arrow of time); Second-generation wavelet transform; Speech recognition; Mathematics; Computer vision; Physics","score_opus":0.04943865815706422,"score_gpt":0.3028077631270084,"score_spread":0.2533691049699442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114958144","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.37134936,0.00020785909,0.6080269,0.000614547,0.00032881307,0.0007899527,0.000035021287,0.0002024519,0.018445078],"genre_scores_gemma":[0.84219384,0.00024363078,0.15625158,0.0010542742,0.00008032643,0.000066982124,0.000009083615,0.000021105863,0.00007916398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664325,0.00012506176,0.0007259343,0.00090611033,0.0011002687,0.00049936015],"domain_scores_gemma":[0.9973444,0.000040629468,0.00046938396,0.00021713406,0.0017540185,0.00017447433],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014439039,0.000447718,0.00046203265,0.00072349963,0.00032846976,0.0015836736,0.00094975927,0.00023459329,0.00009079663],"category_scores_gemma":[0.00029377313,0.0003773928,0.00006198282,0.0015039522,0.0002145619,0.0007917929,0.00011814108,0.00070164533,0.000008168241],"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.00008755755,0.0012460881,0.024829987,0.00024234568,0.00048614905,0.00024290135,0.01244939,0.00067926757,0.030727591,0.9176769,0.0013321721,0.009999625],"study_design_scores_gemma":[0.0013461154,0.0004017586,0.0067139473,0.00041245733,0.00018883424,0.0002985006,0.0028817,0.9569595,0.0083843935,0.0199051,0.0011870463,0.0013206898],"about_ca_topic_score_codex":0.00012999987,"about_ca_topic_score_gemma":0.000043092125,"teacher_disagreement_score":0.9562802,"about_ca_system_score_codex":0.00018844435,"about_ca_system_score_gemma":0.00030997474,"threshold_uncertainty_score":0.9998678},"labels":[],"label_agreement":null},{"id":"W2115113441","doi":"10.1109/lcomm.2008.080394","title":"Modified Transition Matrix Simulations of Communication Systems","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Blind Source Separation Techniques","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":"Fading; Computer science; Stochastic matrix; Matrix (chemical analysis); Probability distribution; Communications system; Statistical physics; Transition (genetics); Algorithm; Bit error rate; Mathematics; Decoding methods; Telecommunications; Statistics; Physics; Markov chain; Materials science","score_opus":0.05535200371156912,"score_gpt":0.30480203582616416,"score_spread":0.24945003211459504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115113441","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.066633224,0.0003627461,0.9209393,0.010151276,0.00006041182,0.0003658739,0.000017390234,0.00038822286,0.0010815416],"genre_scores_gemma":[0.8915532,0.00024619058,0.10743309,0.0005990893,0.000009337418,0.000058808917,0.00006116802,0.000011616375,0.000027464914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841315,0.00056567177,0.00049452187,0.00017566215,0.00021483318,0.00013619519],"domain_scores_gemma":[0.99542034,0.0003752495,0.0002592006,0.003686395,0.00021195991,0.000046885332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035363444,0.0001205846,0.00018375285,0.00028044297,0.00041458398,0.0000600243,0.0024192003,0.00007293589,0.0000021539277],"category_scores_gemma":[0.000023978366,0.0001363129,0.000080889695,0.0006140747,0.00025004894,0.0007369593,0.00015887679,0.00022615967,0.000011920957],"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.000007376477,0.00042313104,0.00017458573,0.00002278134,0.00006716556,9.3004917e-7,0.013009166,0.36572713,0.066999614,0.54832506,0.004556393,0.0006866517],"study_design_scores_gemma":[0.00043734483,0.000032064654,0.00043524627,0.000060007074,0.000016340873,0.00002464165,0.000058584646,0.98942626,0.003976324,0.0018984216,0.0033582957,0.0002764926],"about_ca_topic_score_codex":0.00020633427,"about_ca_topic_score_gemma":0.000012750271,"teacher_disagreement_score":0.82492,"about_ca_system_score_codex":0.000057727775,"about_ca_system_score_gemma":0.0000581429,"threshold_uncertainty_score":0.55586785},"labels":[],"label_agreement":null},{"id":"W2115242705","doi":"10.1109/ccece.1997.614823","title":"Parallel DSP application in multicarrier FSK demodulation","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"University of New Brunswick","funders":"Ministère de la Défense Nationale","keywords":"Demodulation; Digital signal processing; Frequency-shift keying; Computer science; Modulation (music); Digital signal processor; Electronic engineering; Signal processing; Computer hardware; Digital signal; Embedded system; Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.021219044814521897,"score_gpt":0.25618759815859765,"score_spread":0.23496855334407576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115242705","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.006653349,0.000017518832,0.9778586,0.0029490434,0.000017931336,0.00021125264,1.249378e-7,0.00035917351,0.011933011],"genre_scores_gemma":[0.79792404,0.000006781285,0.20074503,0.0008141792,0.000010252707,0.000047105274,0.0000012889766,0.0000034474836,0.0004478522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993208,0.000045706314,0.00016829585,0.00021906733,0.00013499461,0.00011114543],"domain_scores_gemma":[0.99951416,0.00003281684,0.000039198276,0.00034533106,0.00003374075,0.000034764962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017999813,0.00006230574,0.00006443427,0.000103971484,0.00002986518,0.000058014917,0.0002738394,0.000056841844,0.00003247033],"category_scores_gemma":[0.000018469289,0.00005954729,0.000020031091,0.00029801423,0.000012315155,0.00044960025,0.00005001426,0.000070999005,0.00013147993],"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.0000021505052,0.0001721286,0.008272959,0.0000044079084,0.0000040048567,0.0000015863094,0.002432046,0.002923517,0.0014570592,0.8042651,0.004575055,0.17588998],"study_design_scores_gemma":[0.00016264574,0.000012195602,0.011470232,0.0000019839724,4.965796e-7,0.0000014090309,0.000005960061,0.971664,0.0010691176,0.009911756,0.0056102914,0.00008988947],"about_ca_topic_score_codex":0.0000412143,"about_ca_topic_score_gemma":0.000046773122,"teacher_disagreement_score":0.9687405,"about_ca_system_score_codex":0.000028238901,"about_ca_system_score_gemma":0.0000048889574,"threshold_uncertainty_score":0.24282679},"labels":[],"label_agreement":null},{"id":"W2116137289","doi":"10.5539/cis.v8n1p108","title":"FPGA-Based Fully Parallel PCA-ANN for Spectrum Sensing","year":2015,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; VHDL; Field-programmable gate array; Perceptron; Artificial neural network; MATLAB; Principal component analysis; Cognitive radio; Principal (computer security); Interference (communication); Implementation; Artificial intelligence; Computer hardware; Pattern recognition (psychology); Channel (broadcasting); Telecommunications; Programming language","score_opus":0.0343614047050883,"score_gpt":0.2806382528093353,"score_spread":0.246276848104247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116137289","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.002431152,0.000008901575,0.991159,0.0031997212,0.00030269683,0.00026131383,0.0000014337617,0.00028279022,0.0023529893],"genre_scores_gemma":[0.38800895,0.0000018576621,0.6066713,0.0052487133,0.00004482409,0.000005647611,0.000004406865,0.0000022871545,0.000012049656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988258,0.000024168916,0.00028355318,0.00020500312,0.0004178731,0.00024361702],"domain_scores_gemma":[0.9989061,0.000057581743,0.00013254622,0.00033573832,0.00038699686,0.00018104633],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014039214,0.000105143125,0.000112133086,0.0003377228,0.0002333852,0.0010779856,0.0005854327,0.00003612232,6.701219e-7],"category_scores_gemma":[0.0000644905,0.00009378447,0.00003161064,0.00062391994,0.00015929973,0.008681526,0.00020507969,0.00006834149,0.000023139351],"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.00003445355,0.000044764318,0.00013322677,0.000047608533,0.0000073001147,0.0000015025868,0.012006887,0.018930642,0.00011465588,0.5731866,0.016993383,0.378499],"study_design_scores_gemma":[0.00040957512,0.00015732976,0.00046572794,0.000009549907,0.00000115654,0.000014505833,0.000025441093,0.96005386,0.0022213007,0.0062828395,0.030213973,0.00014471341],"about_ca_topic_score_codex":0.0000051370744,"about_ca_topic_score_gemma":7.858568e-7,"teacher_disagreement_score":0.94112325,"about_ca_system_score_codex":0.00004748157,"about_ca_system_score_gemma":0.0003691312,"threshold_uncertainty_score":0.999959},"labels":[],"label_agreement":null},{"id":"W2116309514","doi":"10.1109/glocom.2003.1258676","title":"A blind MUSIC-based algorithm for user identification in multiuser DS-CDMA","year":2004,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Concordia University","funders":"","keywords":"Code division multiple access; Multiuser detection; Computer science; Algorithm; Subspace topology; SIGNAL (programming language); Linear subspace; Interference (communication); Ambiguity; Signal subspace; Spread spectrum; Eigendecomposition of a matrix; Code (set theory); Identification (biology); Transformation (genetics); Scheme (mathematics); Theoretical computer science; Mathematics; Eigenvalues and eigenvectors; Artificial intelligence; Telecommunications","score_opus":0.03196822212852075,"score_gpt":0.29969657369269675,"score_spread":0.267728351564176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116309514","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.008084168,0.000010137759,0.9886576,0.0018203452,0.00010591129,0.00064315315,0.0000025064105,0.00039178014,0.00028439832],"genre_scores_gemma":[0.22365408,0.0000012738055,0.77405447,0.0016349569,0.000025942114,0.0002005907,0.0000103493685,0.000010353322,0.00040798855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894685,0.000035210607,0.0002909359,0.0003563147,0.00018605597,0.00018464077],"domain_scores_gemma":[0.99921936,0.000063839565,0.00008146835,0.0004567262,0.00013198961,0.000046606372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049756764,0.00010571573,0.00010710538,0.00025595198,0.00005513894,0.00020094046,0.00048263863,0.00008674601,0.000013024694],"category_scores_gemma":[0.000031317653,0.000100755125,0.000057307974,0.00043117857,0.000022513348,0.00061896985,0.000048535156,0.000083168066,0.0000428602],"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.00003829315,0.0013972007,0.00030592413,0.000036311125,0.000023414683,0.000012039514,0.0050605116,0.0042496016,0.010899924,0.35719296,0.0042867884,0.61649704],"study_design_scores_gemma":[0.0044754245,0.00013524324,0.0032910907,0.000031044925,0.0000049402593,0.0000027490064,0.00005369931,0.700566,0.25643265,0.02293638,0.01165046,0.0004203455],"about_ca_topic_score_codex":0.000106658765,"about_ca_topic_score_gemma":0.00024396434,"teacher_disagreement_score":0.69631636,"about_ca_system_score_codex":0.0000732609,"about_ca_system_score_gemma":0.000114429226,"threshold_uncertainty_score":0.41086748},"labels":[],"label_agreement":null},{"id":"W2117439573","doi":"10.1109/tnn.2006.875985","title":"Nonlinear Spatial–Temporal Prediction based on Optimal Fusion","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Blind Source Separation 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","funders":"Chinese University of Hong Kong; University of Hong Kong","keywords":"Computer science; Clutter; Artificial intelligence; Pattern recognition (psychology); Radar; Nonlinear system; Gaussian; Support vector machine; Sensor fusion; Statistic; Spatial analysis; Signal processing; Algorithm; Data mining; Mathematics; Statistics; Telecommunications","score_opus":0.010905054886476188,"score_gpt":0.2301694800242323,"score_spread":0.2192644251377561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117439573","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.010463168,0.000007868858,0.98552704,0.0010600955,0.0009598161,0.00033821038,0.000014752968,0.0011128571,0.0005161948],"genre_scores_gemma":[0.97487736,0.000005756088,0.02342921,0.00115963,0.0002454323,0.00005220231,0.000023193787,0.00002507626,0.0001821301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830323,0.00016579247,0.00034762608,0.00048256456,0.00039921902,0.00030155943],"domain_scores_gemma":[0.9990788,0.000115932264,0.00010547486,0.00053651223,0.00007409842,0.00008917993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021403299,0.00023820257,0.00017107761,0.00023395361,0.00029622324,0.00016838907,0.00037487494,0.0001875578,0.00003666498],"category_scores_gemma":[0.0000014863898,0.0002286562,0.00015645628,0.00047423187,0.0000451795,0.0003817389,0.0000028669244,0.0005395799,0.000019786994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059027894,0.00027451475,0.000022782442,0.0000021427243,0.0000033904494,0.000009082582,0.00001826449,0.97348714,0.00013726548,0.0000878676,0.0007826929,0.025115842],"study_design_scores_gemma":[0.00043632148,0.00058310886,0.00023409053,0.000022459004,0.000008478555,0.000008173783,0.0000016230947,0.9893575,0.008265012,0.00004495419,0.0008462487,0.0001920882],"about_ca_topic_score_codex":0.00019501155,"about_ca_topic_score_gemma":0.000111090725,"teacher_disagreement_score":0.9644142,"about_ca_system_score_codex":0.00006498682,"about_ca_system_score_gemma":0.00003539948,"threshold_uncertainty_score":0.9324329},"labels":[],"label_agreement":null},{"id":"W2117806941","doi":"10.1109/ccece.2006.277813","title":"A Strict Approach to Approximating Lognormal Sum Distributions","year":2006,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Logarithm; Mathematics; Log-normal distribution; Range (aeronautics); Random variable; Least-squares function approximation; Applied mathematics; Curve fitting; Explained sum of squares; Total sum of squares; Function (biology); Lack-of-fit sum of squares; Statistics; Mathematical analysis; Non-linear least squares","score_opus":0.014265659918952888,"score_gpt":0.24015616749907578,"score_spread":0.22589050758012288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117806941","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.0020772323,0.000005631196,0.84841794,0.0006165275,0.000022214697,0.00019887584,0.000003576399,0.0007698209,0.14788817],"genre_scores_gemma":[0.5133148,1.336892e-7,0.4859366,0.00023205519,0.000025850397,0.000040501647,0.000015565298,0.0000031538293,0.0004313317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990093,0.00006315571,0.000230588,0.00026712808,0.0001969802,0.00023285038],"domain_scores_gemma":[0.999409,0.000047193807,0.00004894171,0.00036235095,0.00006831647,0.00006418225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004298298,0.00009540225,0.00009767235,0.00010569497,0.00013148699,0.00024077256,0.00052375835,0.000046377565,0.000005491544],"category_scores_gemma":[0.000038292437,0.00008516125,0.00004291131,0.0006591942,0.000015390495,0.00039380128,0.00021190922,0.00009683264,0.000030494211],"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":[6.274626e-7,0.00010928528,0.00021390954,0.00000264578,0.0000017623779,4.2453362e-7,0.000098614255,0.00051157904,0.00019939251,0.9883223,0.008498214,0.0020411992],"study_design_scores_gemma":[0.0005927013,0.00021008428,0.01631681,0.000018018549,0.000010900276,0.00006706841,0.00018188011,0.84311306,0.04840707,0.049955033,0.04001341,0.0011139712],"about_ca_topic_score_codex":0.00012152608,"about_ca_topic_score_gemma":0.0000085697675,"teacher_disagreement_score":0.9383673,"about_ca_system_score_codex":0.00003594625,"about_ca_system_score_gemma":0.00003683474,"threshold_uncertainty_score":0.3472775},"labels":[],"label_agreement":null},{"id":"W2117886280","doi":"10.1109/iembs.2005.1615743","title":"Fetal Heart Rate Deceleration Detection from the Discrete Cosine Transform Spectrum","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McGill University","funders":"","keywords":"Discrete cosine transform; Computer science; Pattern recognition (psychology); Artificial intelligence; Normalization (sociology); Algorithm; Mathematics","score_opus":0.011733201746341732,"score_gpt":0.2466941024338572,"score_spread":0.23496090068751546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117886280","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.024971815,0.000022600207,0.9165877,0.054430954,0.000071814204,0.00023394784,0.0000017714674,0.0004906705,0.0031887344],"genre_scores_gemma":[0.96367055,0.0000114918885,0.031987242,0.0037603662,0.00016317776,0.00001966451,0.0000066578637,0.000006792754,0.000374049],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916,0.00010269757,0.00018710998,0.00023153385,0.00017010699,0.00014854094],"domain_scores_gemma":[0.99947584,0.0000818851,0.000038071856,0.0003354194,0.00002806318,0.000040730494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035594567,0.000101974096,0.000084438456,0.000036885474,0.0001873616,0.00029916482,0.00030881484,0.000050553484,0.00007185014],"category_scores_gemma":[0.000009757312,0.000068459616,0.000058611055,0.00021137287,0.00002556012,0.00089978206,0.000033379365,0.00013442503,0.00010626124],"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.00011697783,0.00026731312,0.0002815644,0.000006073994,0.000088228546,0.0000032802047,0.008765715,0.0025819016,0.24472786,0.18773496,0.018287815,0.5371383],"study_design_scores_gemma":[0.00025176772,0.00009323095,0.0036611105,0.000005485756,0.0000042899323,0.000006974409,0.000022585264,0.2546495,0.6876841,0.008868364,0.04459633,0.00015625873],"about_ca_topic_score_codex":0.00019936814,"about_ca_topic_score_gemma":0.0023979081,"teacher_disagreement_score":0.93869877,"about_ca_system_score_codex":0.000042720654,"about_ca_system_score_gemma":0.000026933796,"threshold_uncertainty_score":0.28848532},"labels":[],"label_agreement":null},{"id":"W2117940998","doi":"10.1109/isbi.2004.1398799","title":"Better conditioning the MEG/EEG inverse problem: The multivariate source prelocalization approach","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Université de Montréal","funders":"","keywords":"Initialization; Multivariate statistics; Computer science; Inverse problem; Preprocessor; Inverse; Monte Carlo method; Algorithm; Mathematical optimization; Magnetoencephalography; Norm (philosophy); Artificial intelligence; Mathematics; Electroencephalography; Statistics; Machine learning","score_opus":0.016809832522446236,"score_gpt":0.24706206542862247,"score_spread":0.23025223290617625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117940998","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.0013395952,0.000011577528,0.9608222,0.015633017,0.00002736475,0.00048377315,4.5478217e-7,0.00056755095,0.021114454],"genre_scores_gemma":[0.6439752,0.0000035142714,0.33243728,0.019754276,0.000102022605,0.0001688463,0.00001219339,0.000016167205,0.0035304981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873,0.000279105,0.00023373983,0.00027821315,0.00028590733,0.00019303474],"domain_scores_gemma":[0.9990695,0.00012004982,0.00011841975,0.00056674617,0.00008890568,0.0000363568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078010204,0.0001245191,0.000083743376,0.00005293654,0.00040480416,0.0003903582,0.00084541494,0.00006794693,0.000035224217],"category_scores_gemma":[0.00002882957,0.0000666049,0.00005009387,0.00035031379,0.00009277998,0.0007092301,0.00022323744,0.00020843568,0.00007249968],"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.0000056885374,0.00017256766,0.00034452922,0.000012866378,0.00005526149,5.116415e-7,0.035134055,0.055679284,0.0010500014,0.8118886,0.05856647,0.037090216],"study_design_scores_gemma":[0.00020442117,0.000020030675,0.00042323803,0.0000070781916,0.000007832606,0.000010484522,0.0002118177,0.90437347,0.0037429282,0.004683035,0.08616497,0.00015066644],"about_ca_topic_score_codex":0.00006840668,"about_ca_topic_score_gemma":0.000027435734,"teacher_disagreement_score":0.8486942,"about_ca_system_score_codex":0.00003364567,"about_ca_system_score_gemma":0.00003879454,"threshold_uncertainty_score":0.3764233},"labels":[],"label_agreement":null},{"id":"W2118432637","doi":"10.1109/icassp.2009.4959619","title":"Sparse multivariate autoregressive (mAR)-based partial directed coherence (PDC) for electroencephalogram (EEG) analysis","year":2009,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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 British Columbia","funders":"","keywords":"Autoregressive model; Electroencephalography; Multivariate statistics; Computer science; Coherence (philosophical gambling strategy); Pattern recognition (psychology); Artificial intelligence; Speech recognition; Machine learning; Mathematics; Statistics; Psychology","score_opus":0.019968395635042973,"score_gpt":0.29913754598756953,"score_spread":0.27916915035252654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118432637","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.0046715243,0.00002879019,0.98995554,0.001805692,0.000094012314,0.00061944604,0.0000066680436,0.002157998,0.00066031597],"genre_scores_gemma":[0.6606307,0.0000015803384,0.33761987,0.0012117923,0.000023653954,0.00011043508,0.000028479457,0.000006298464,0.00036721543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790806,0.00019122963,0.00038783066,0.00067534874,0.000336686,0.00050083036],"domain_scores_gemma":[0.9983059,0.00022899277,0.00023891921,0.0007315173,0.00033723048,0.0001574381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043485002,0.00025038904,0.00037394493,0.0003783161,0.00017315507,0.00031810033,0.00089777313,0.00013106561,0.000047425972],"category_scores_gemma":[0.00015559258,0.00021447164,0.00027503475,0.0014621875,0.000054763528,0.000456011,0.000046529472,0.00015602494,0.000009667287],"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.0007968642,0.0033515643,0.0068157776,0.00004379715,0.0022350468,0.00008260665,0.0064071757,0.032420788,0.08457804,0.38873157,0.030943654,0.4435931],"study_design_scores_gemma":[0.0006097852,0.00044672829,0.0106315855,0.000008149383,0.00011072901,0.0000011086214,0.0000053305594,0.93252057,0.05051637,0.0030388064,0.0017958385,0.0003150148],"about_ca_topic_score_codex":0.0001265339,"about_ca_topic_score_gemma":0.00008098354,"teacher_disagreement_score":0.90009975,"about_ca_system_score_codex":0.00006465519,"about_ca_system_score_gemma":0.00017890084,"threshold_uncertainty_score":0.87459},"labels":[],"label_agreement":null},{"id":"W2118508180","doi":"10.1109/vtcf.2006.384","title":"ICA-Based Signal Equalization for Digital Receivers","year":2006,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Blind Source Separation 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":"InterDigital (Canada)","funders":"","keywords":"Blind equalization; Independent component analysis; Equalization (audio); Computer science; SIGNAL (programming language); Blind signal separation; Signal processing; Intersymbol interference; Quadrature amplitude modulation; Electronic engineering; Channel (broadcasting); Digital signal processing; Telecommunications; Artificial intelligence; Engineering; Bit error rate","score_opus":0.015927652808735402,"score_gpt":0.24607027315960683,"score_spread":0.23014262035087144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118508180","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.039648168,0.000025394387,0.95399743,0.003417324,0.00008353834,0.00039184463,0.000010231533,0.0017005664,0.0007254996],"genre_scores_gemma":[0.94210935,0.0000020309774,0.057279915,0.00028061031,0.000022398417,0.0001210691,0.000031861,0.000012574527,0.00014018743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987289,0.00003637148,0.00027418585,0.00046754294,0.00020630562,0.0002867524],"domain_scores_gemma":[0.99882627,0.00010547672,0.0001557434,0.0005257493,0.00035188836,0.00003489653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019836257,0.00017325509,0.00018421313,0.00041206658,0.00012878863,0.00024869782,0.00090437516,0.00031487638,0.000007878315],"category_scores_gemma":[0.00006830161,0.00017820814,0.00007624726,0.0006553871,0.00017341069,0.0004764407,0.00006043769,0.00016578137,0.000028090217],"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.000008287719,0.0001067257,0.00065516756,0.000013053301,0.000011354116,0.000009297094,0.000036627942,0.00087601884,0.024871528,0.9535671,0.0015609153,0.018283932],"study_design_scores_gemma":[0.00080538885,0.0003281545,0.00015829901,0.000049080125,0.000011540867,0.000013035852,0.000022206978,0.2053927,0.56308824,0.20728484,0.022352897,0.0004936514],"about_ca_topic_score_codex":0.000010998982,"about_ca_topic_score_gemma":0.00001095197,"teacher_disagreement_score":0.9024612,"about_ca_system_score_codex":0.00004806785,"about_ca_system_score_gemma":0.00018147567,"threshold_uncertainty_score":0.72671175},"labels":[],"label_agreement":null},{"id":"W2118718094","doi":"10.1109/milcom.1993.408587","title":"Identification of symmetric/asymmetric quadratic nonlinear channels with cyclostationary inputs","year":2002,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"Cyclostationary process; Nonlinear system; Autocorrelation; Bandlimiting; Algorithm; Computer science; Monte Carlo method; Mathematics; Frequency domain; Computation; Channel (broadcasting); Statistics; Telecommunications","score_opus":0.017573161903850373,"score_gpt":0.24655510708998368,"score_spread":0.2289819451861333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118718094","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.016564863,0.000082666105,0.97249514,0.001740165,0.00007959222,0.00029315226,0.000002638569,0.00033885086,0.008402918],"genre_scores_gemma":[0.89007664,0.000029693387,0.108281516,0.00042549014,0.000020763327,0.000024198536,0.000005131992,0.00000921185,0.0011273837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986028,0.00008235787,0.0004185901,0.00029274746,0.0004575846,0.00014592473],"domain_scores_gemma":[0.99874216,0.00015822859,0.0002523215,0.00050165755,0.0002872918,0.000058329846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034923473,0.00011605294,0.00015324028,0.000854494,0.000060690745,0.000112305854,0.00051010685,0.0000563534,0.000029029268],"category_scores_gemma":[0.0000994005,0.000096381686,0.00003874505,0.0031382844,0.00004047014,0.0008051406,0.0000677873,0.000090450194,0.00008791597],"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.000015393123,0.0015808025,0.0017539066,0.00013365193,0.00010648019,0.000018759616,0.0058421814,0.0020233335,0.0058091497,0.87545085,0.0075828657,0.09968262],"study_design_scores_gemma":[0.00047408746,0.0004455712,0.0021783102,0.000027073795,0.000012910647,0.0000295062,0.000052581774,0.8517528,0.13850568,0.0050750664,0.0010910848,0.00035530265],"about_ca_topic_score_codex":0.000013196925,"about_ca_topic_score_gemma":0.000002306267,"teacher_disagreement_score":0.87351173,"about_ca_system_score_codex":0.000027374726,"about_ca_system_score_gemma":0.000026456573,"threshold_uncertainty_score":0.39303312},"labels":[],"label_agreement":null},{"id":"W2118754398","doi":"10.1109/ner.2009.5109303","title":"Generalized Morphological Component Analysis for EEG source separation and artifact removal","year":2009,"lang":"en","type":"article","venue":"","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 British Columbia","funders":"","keywords":"Electroencephalography; Artifact (error); Blind signal separation; Independent component analysis; Computer science; Artificial intelligence; Pattern recognition (psychology); Source separation; Basis (linear algebra); Component analysis; Discrete cosine transform; Wavelet; Component (thermodynamics); Channel (broadcasting); Speech recognition; Algorithm; Mathematics; Image (mathematics)","score_opus":0.033126789355163326,"score_gpt":0.31493361551203847,"score_spread":0.28180682615687513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118754398","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.25627747,0.000023795512,0.7402742,0.002239156,0.000012728368,0.00018831751,6.941814e-7,0.00033309145,0.0006505646],"genre_scores_gemma":[0.6550255,0.0000066523057,0.34237897,0.0020431234,0.000012098342,0.000010754408,0.000013078907,0.0000020915256,0.0005077368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899507,0.00009114033,0.00023515105,0.00035039775,0.00016420177,0.00016405886],"domain_scores_gemma":[0.9994028,0.0000643178,0.00007850072,0.00031074634,0.00006782992,0.00007579596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004152409,0.000112030066,0.00021094058,0.00017448375,0.00010844195,0.00020432103,0.00023380805,0.00007519045,0.000019989751],"category_scores_gemma":[0.000021775837,0.00009060482,0.000115053735,0.0003989306,0.000023095114,0.00026493563,0.000047197227,0.0000589927,0.00000607367],"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.00013434092,0.00049864076,0.0020358483,0.000007674343,0.00032698768,0.00003079938,0.0019098434,0.012934442,0.13164236,0.7424572,0.009797336,0.09822451],"study_design_scores_gemma":[0.00049118267,0.00029816845,0.023865184,0.0000016301209,0.00006211642,0.00004500501,0.000011414605,0.9322575,0.014809764,0.014790458,0.013103652,0.00026394543],"about_ca_topic_score_codex":0.0000147306,"about_ca_topic_score_gemma":0.00000783526,"teacher_disagreement_score":0.919323,"about_ca_system_score_codex":0.000018798388,"about_ca_system_score_gemma":0.000012896348,"threshold_uncertainty_score":0.36947575},"labels":[],"label_agreement":null},{"id":"W2119108382","doi":"10.1109/glocom.2009.5425534","title":"A Subspace Method for the Blind Identification of Multiple Time-Varying FIR Channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Subspace topology; Basis (linear algebra); A priori and a posteriori; Finite impulse response; Basis function; Algorithm; Identification (biology); Computer science; Channel (broadcasting); System identification; Consistency (knowledge bases); Flexibility (engineering); Estimation theory; Mathematics; Control theory (sociology); Artificial intelligence; Data modeling; Statistics; Telecommunications; Mathematical analysis","score_opus":0.036424967120742786,"score_gpt":0.3357637108527631,"score_spread":0.2993387437320203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119108382","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.0007588769,0.000040396357,0.9904932,0.0074610854,0.000054267446,0.0005186967,0.0000012488977,0.0002003884,0.00047186634],"genre_scores_gemma":[0.54885465,0.0000043158516,0.4490826,0.00057084154,0.0000256495,0.00003732398,0.0000021150313,0.0000037665873,0.0014187136],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923044,0.00006981141,0.00023338544,0.00020051085,0.00015118862,0.00011468638],"domain_scores_gemma":[0.99874955,0.00047078566,0.00014814135,0.0004602665,0.00014797108,0.000023253788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011397161,0.000070772796,0.0001001606,0.00007927659,0.000098879886,0.000115467126,0.0005751088,0.00004578867,0.000007042157],"category_scores_gemma":[0.0001393502,0.000050421488,0.000066903536,0.00029350736,0.000016593298,0.00032490838,0.000042924585,0.000052229505,0.000010432753],"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.00006842722,0.00029029322,0.000033806245,0.000024070574,0.000052891533,4.845957e-7,0.008663179,0.006478181,0.4450519,0.2884757,0.012771759,0.23808931],"study_design_scores_gemma":[0.00018034593,0.000044209442,0.0001825668,0.000003515669,0.0000036954889,0.0000012561636,0.000014710854,0.6705887,0.3196623,0.008222527,0.001041846,0.000054330012],"about_ca_topic_score_codex":0.000014160965,"about_ca_topic_score_gemma":0.0000024360756,"teacher_disagreement_score":0.6641105,"about_ca_system_score_codex":0.000010209282,"about_ca_system_score_gemma":0.00002456478,"threshold_uncertainty_score":0.20561285},"labels":[],"label_agreement":null},{"id":"W2119964815","doi":"10.1109/icip.2005.1530051","title":"Spatiotemporal-chromatic structure of natural scenes","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Simon Fraser University","funders":"","keywords":"Chromatic scale; Computer science; Basis (linear algebra); Encoding (memory); Artificial intelligence; Data compression; Computer vision; Pattern recognition (psychology); Human visual system model; Perception; Path (computing); Image (mathematics); Mathematics","score_opus":0.007063182983840978,"score_gpt":0.24829246026792479,"score_spread":0.2412292772840838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119964815","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.40873843,0.00010738125,0.58322495,0.0035222636,0.000098782686,0.00016625533,0.0000011787299,0.00052028475,0.0036204723],"genre_scores_gemma":[0.70361817,0.0000013470637,0.29572308,0.000408095,0.000017821088,3.8518772e-7,0.0000011413911,0.000002345869,0.00022761896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99942076,0.000031617605,0.0001723346,0.00012549247,0.00016876035,0.000081022394],"domain_scores_gemma":[0.9995076,0.00002372915,0.0000778108,0.00030678196,0.000060422157,0.000023652748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006896266,0.00006547678,0.00009329568,0.00007611946,0.00002336551,0.00004179908,0.0003663825,0.00003762801,0.00005505799],"category_scores_gemma":[0.0000137496045,0.000051278665,0.000030493587,0.00017330387,0.000022281058,0.00046643292,0.00007329742,0.00006421575,0.000010013356],"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.0000045342094,0.00010200184,0.0013477508,0.000053220447,0.00002927311,0.0000018037572,0.0033956415,0.00039594612,0.11707412,0.7144573,0.009952859,0.15318556],"study_design_scores_gemma":[0.00015417126,0.000042018823,0.004681961,0.000015057369,0.000002027879,0.000010084761,0.000012601067,0.085026845,0.8969226,0.010402224,0.002581211,0.00014919238],"about_ca_topic_score_codex":0.00001904017,"about_ca_topic_score_gemma":0.000051493807,"teacher_disagreement_score":0.7798485,"about_ca_system_score_codex":0.000012377799,"about_ca_system_score_gemma":0.000031001684,"threshold_uncertainty_score":0.20910832},"labels":[],"label_agreement":null},{"id":"W2120062686","doi":"10.1109/aps.1994.407820","title":"Considerations for the hardware implementation of a four element digital beamformer","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McMaster University","funders":"","keywords":"Adaptive beamformer; Computer science; Beamforming; Sampling (signal processing); Channel (broadcasting); Element (criminal law); Digital filter; Filter (signal processing); Computer hardware; Telecommunications; Computer vision","score_opus":0.065215303563259,"score_gpt":0.3102025299997233,"score_spread":0.2449872264364643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120062686","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.0006045818,0.000015196177,0.98884153,0.0072754095,0.000032576747,0.0005016083,0.00001537297,0.00009591558,0.002617826],"genre_scores_gemma":[0.859574,0.0000057585116,0.13889173,0.00092101604,0.0000135674345,0.00012156461,0.000002915859,0.0000032712335,0.0004661525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945563,0.000010926836,0.00019982978,0.0001068102,0.00013405748,0.00009274615],"domain_scores_gemma":[0.99935395,0.00021826877,0.000072649935,0.00022001828,0.00011721471,0.000017892757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013612364,0.00005199776,0.00005580437,0.000039576254,0.000108281965,0.00017524244,0.0001621313,0.000014536697,0.00027042202],"category_scores_gemma":[0.00002827446,0.000035511446,0.000049268812,0.00008278488,0.000016881879,0.0005099153,0.000047422716,0.000025520922,0.000008401102],"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.0000012127124,0.00007120729,0.00051035365,0.000008533014,0.00005169276,2.2779736e-7,0.0039677066,0.00009713635,0.0004148451,0.80885774,0.09105071,0.09496864],"study_design_scores_gemma":[0.0027109832,0.0011303445,0.003512346,0.000020375839,0.000056075423,0.00004662684,0.004191816,0.33721012,0.156466,0.15605481,0.33785325,0.0007472523],"about_ca_topic_score_codex":0.0000128403035,"about_ca_topic_score_gemma":0.00004652382,"teacher_disagreement_score":0.85896945,"about_ca_system_score_codex":0.0000120942805,"about_ca_system_score_gemma":0.000019945272,"threshold_uncertainty_score":0.29609317},"labels":[],"label_agreement":null},{"id":"W2120130504","doi":"10.1109/vetecf.2000.887109","title":"Subspace-based blind joint detection of fading, asynchronous cochannel TDMA signals","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Simon Fraser University","funders":"","keywords":"Rayleigh fading; Subspace topology; Computer science; Fading; Algorithm; Asynchronous communication; Detector; Channel (broadcasting); Joint (building); Electronic engineering; Mathematics; Telecommunications; Artificial intelligence; Engineering","score_opus":0.04358567915176629,"score_gpt":0.25197783342499075,"score_spread":0.20839215427322447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120130504","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.040134043,0.00007778856,0.952123,0.00076234154,0.000080858175,0.00023014193,7.918301e-7,0.00050867634,0.006082369],"genre_scores_gemma":[0.9650124,0.000008811871,0.034036342,0.0004696446,0.000026107798,0.00002125139,6.8669834e-7,0.000009799424,0.00041499635],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99881005,0.00009903999,0.00030523326,0.00029126237,0.00029631588,0.00019812226],"domain_scores_gemma":[0.9990636,0.000067712266,0.00017682454,0.00045510667,0.0001609276,0.00007579207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039215724,0.00013198837,0.00018723712,0.00028284942,0.00007463764,0.0000913725,0.00036192234,0.00010140942,0.00020172876],"category_scores_gemma":[0.000042459327,0.00012361324,0.00009469337,0.0004548586,0.000045411958,0.0003325871,0.000063255575,0.00011966679,0.0000795161],"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.000050181585,0.001411388,0.00026705363,0.0001314027,0.00010139565,0.000024880725,0.008851957,0.01272114,0.78208333,0.057338342,0.0077990764,0.12921983],"study_design_scores_gemma":[0.00031560342,0.00022966927,0.00009767376,0.000013198364,0.0000029232629,0.0000043893474,0.000017573017,0.3328272,0.6651957,0.0008130269,0.00036174167,0.00012127631],"about_ca_topic_score_codex":0.000056564968,"about_ca_topic_score_gemma":0.000036359295,"teacher_disagreement_score":0.9248783,"about_ca_system_score_codex":0.000047255526,"about_ca_system_score_gemma":0.000028234535,"threshold_uncertainty_score":0.5040802},"labels":[],"label_agreement":null},{"id":"W2120455086","doi":"10.1109/tit.2007.899467","title":"Derivatives of Entropy Rate in Special Families of Hidden Markov Chains","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Blind Source Separation Techniques","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 British Columbia","funders":"","keywords":"Markov chain; Mathematics; Entropy (arrow of time); Entropy rate; Markov process; Markov kernel; Variable-order Markov model; Markov chain mixing time; Maximum-entropy Markov model; Markov property; Markov model; Binary number; Statistical physics; Applied mathematics; Simplex; Combinatorics; Discrete mathematics; Binary entropy function; Principle of maximum entropy; Statistics; Physics; Thermodynamics","score_opus":0.008171476541206538,"score_gpt":0.2405677896695639,"score_spread":0.23239631312835737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120455086","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.057929486,0.0000036552863,0.9342341,0.00006744655,0.00019186083,0.0001979734,0.000010009706,0.00007962148,0.0072858375],"genre_scores_gemma":[0.98552006,0.000029910863,0.014134868,0.00020565781,0.000018228533,0.00001122044,0.0000020853554,0.0000036719468,0.00007432169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99885815,0.00013616099,0.00058256654,0.00008229523,0.00020809715,0.00013274107],"domain_scores_gemma":[0.9990632,0.00028542042,0.00024485515,0.0002542349,0.00012154003,0.000030736588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013115475,0.00009878595,0.00015414778,0.00073096214,0.00004543058,0.000023631565,0.000302004,0.00007161929,0.00005058069],"category_scores_gemma":[0.000019743662,0.000096848984,0.00006719679,0.00054369034,0.00009797541,0.001488783,0.0000029384776,0.00014351447,0.000013312776],"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.00029540228,0.00021160167,0.00004119731,0.00006126339,0.000033548833,7.8621304e-7,0.053758163,0.00193209,0.0044305795,0.6034109,0.00007074795,0.3357537],"study_design_scores_gemma":[0.0008831208,0.00024544811,0.0046921717,0.000071959,0.000006335317,0.0000024353512,0.002958863,0.00515077,0.9667226,0.018314892,0.0007263582,0.00022506001],"about_ca_topic_score_codex":0.00000888554,"about_ca_topic_score_gemma":0.000017564314,"teacher_disagreement_score":0.962292,"about_ca_system_score_codex":0.000043394095,"about_ca_system_score_gemma":0.000058834303,"threshold_uncertainty_score":0.3949387},"labels":[],"label_agreement":null},{"id":"W2120717109","doi":"10.1109/icpr.1994.577116","title":"Videoconferencing using spatially varying sensing with multiple and moving foveae","year":2002,"lang":"en","type":"preprint","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Videoconferencing; Computer science; Computer vision; Object (grammar); Artificial intelligence; Object detection; Computer graphics (images); Pattern recognition (psychology); Multimedia","score_opus":0.044165825481814,"score_gpt":0.2604029092835986,"score_spread":0.2162370838017846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120717109","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.110173635,0.000060290397,0.8840726,0.0002296072,0.00010062356,0.00040658982,0.0000012303628,0.000825691,0.0041297604],"genre_scores_gemma":[0.5186053,0.00000991396,0.48103398,0.00023843978,0.000037460348,0.000002714543,0.0000014779537,0.000019078643,0.000051614617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795085,0.00014185326,0.0003780947,0.00085461215,0.00035022938,0.00032434167],"domain_scores_gemma":[0.9984006,0.00019519162,0.00031370888,0.0007870245,0.00019276983,0.00011069298],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004267656,0.00036238763,0.00038948946,0.00029545758,0.00021240624,0.0010925065,0.00047546328,0.00024567067,0.000010530214],"category_scores_gemma":[0.00006958791,0.0003295038,0.000057854213,0.00017234086,0.000048850856,0.00055708695,0.0016816532,0.00062354974,0.0000023144369],"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.00006768976,0.0002869859,0.016081823,0.0016604265,0.00057624676,0.00052203087,0.05004719,0.30303153,0.080626145,0.045981124,0.00022208662,0.50089675],"study_design_scores_gemma":[0.00019738045,0.000029336981,0.00014824113,0.00040313284,0.000013689469,0.0000557951,0.000021985246,0.98522234,0.010872097,0.0025155067,0.000060727427,0.00045975207],"about_ca_topic_score_codex":0.0011943945,"about_ca_topic_score_gemma":0.00024588636,"teacher_disagreement_score":0.68219084,"about_ca_system_score_codex":0.000100454825,"about_ca_system_score_gemma":0.00019984877,"threshold_uncertainty_score":0.99994445},"labels":[],"label_agreement":null},{"id":"W2121166798","doi":"10.1109/mue.2007.147","title":"Maximum Likelihood Study for Sound Pattern Separation and Recognition","year":2007,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"McGill University; National Science Foundation","keywords":"Separation (statistics); Sound (geography); Computer science; Maximum likelihood; Source separation; Speech recognition; Acoustics; Pattern recognition (psychology); Artificial intelligence; Mathematics; Statistics; Physics; Machine learning","score_opus":0.03509969255903399,"score_gpt":0.32757874508797324,"score_spread":0.29247905252893924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121166798","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.20597044,0.00000702378,0.79156667,0.0002267803,0.00005717253,0.00056848896,9.85991e-7,0.0002683607,0.0013340829],"genre_scores_gemma":[0.9302919,0.0000016961051,0.06874813,0.0007820137,0.000041014424,0.000044767632,0.000006936331,0.000005993626,0.00007757778],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992387,0.000034080123,0.00019036519,0.00025407976,0.00013011496,0.00015261487],"domain_scores_gemma":[0.9994948,0.00009864742,0.00005751961,0.00019049094,0.000108360786,0.000050165363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009821504,0.000080286445,0.00007801766,0.000104746796,0.000088069944,0.00019055766,0.0001406766,0.000045834047,0.000007018072],"category_scores_gemma":[0.000018089877,0.00007478365,0.0000215393,0.00012363242,0.00000998186,0.00049484515,0.000056467874,0.000051052717,0.000015654516],"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.000018145645,0.00037144154,0.005186095,0.0000111193785,0.00001949345,0.0000028975267,0.005758228,8.6403315e-7,0.00052779197,0.002675473,0.0012306635,0.9841978],"study_design_scores_gemma":[0.0034346934,0.003797694,0.050576992,0.000023481758,0.000040611474,0.00004388273,0.0022240418,0.027837763,0.04196959,0.8653959,0.0036365697,0.0010187885],"about_ca_topic_score_codex":0.000027479638,"about_ca_topic_score_gemma":0.00030165818,"teacher_disagreement_score":0.983179,"about_ca_system_score_codex":0.000015996528,"about_ca_system_score_gemma":0.000012970307,"threshold_uncertainty_score":0.30495888},"labels":[],"label_agreement":null},{"id":"W2121527550","doi":"10.1109/11.845864","title":"Evaluation of reduced bandwidth electronic news gathering (ENG) analog system","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Broadcasting","topic":"Blind Source Separation 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":"Communications Research Centre Canada","funders":"National Association of Broadcasters","keywords":"Bandwidth (computing); Computer science; Channel (broadcasting); Robustness (evolution); Electronic engineering; Analog signal; Transmission system; Telecommunications; Transmission (telecommunications); Engineering","score_opus":0.031435143303769265,"score_gpt":0.27926261766376376,"score_spread":0.2478274743599945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121527550","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.18547714,0.00004734764,0.8083863,0.00008158762,0.000110587534,0.00027677318,0.0000017312759,0.0004341202,0.0051843706],"genre_scores_gemma":[0.9895014,0.000019203915,0.010207906,0.00004326948,0.000027211801,0.0000585976,7.092868e-7,0.000016733311,0.00012496131],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792284,0.00036547313,0.00039753978,0.00035284678,0.0006759426,0.0002853595],"domain_scores_gemma":[0.99902356,0.00009316903,0.00013355036,0.00046284788,0.00022989229,0.00005697212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001541135,0.00015435001,0.00018909854,0.00021730771,0.0001837009,0.000074785115,0.00035188152,0.000082408,0.00009203127],"category_scores_gemma":[0.000011039678,0.00016164237,0.00010575537,0.00062266755,0.000023236407,0.00042270822,0.0000013922248,0.00026360023,0.000029297813],"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.000012637633,0.0000787341,0.0000023383352,0.00001839555,0.00003782398,7.978623e-7,0.0010777537,0.1470117,0.014743093,0.00064935285,0.000012584681,0.8363548],"study_design_scores_gemma":[0.0004825158,0.00019107251,0.00005394805,0.0001504963,0.00006623936,0.00003703936,0.00010813775,0.83837116,0.1597903,0.00039508773,0.00014819857,0.00020578231],"about_ca_topic_score_codex":0.00009667776,"about_ca_topic_score_gemma":0.000040055053,"teacher_disagreement_score":0.83614904,"about_ca_system_score_codex":0.0002702667,"about_ca_system_score_gemma":0.00022997535,"threshold_uncertainty_score":0.65915847},"labels":[],"label_agreement":null},{"id":"W2122046909","doi":"10.1109/iscas.2008.4542139","title":"An algorithm for ARMA model parameter estimation from noisy observations","year":2008,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Concordia University","funders":"","keywords":"Autoregressive–moving-average model; Autocorrelation; Noise (video); Autoregressive model; Algorithm; Estimation theory; Residual; Computer science; SIGNAL (programming language); System identification; Mathematics; Spectral density estimation; Statistics; Artificial intelligence; Data modeling; Fourier transform","score_opus":0.08555953698695533,"score_gpt":0.3102122100401745,"score_spread":0.22465267305321918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122046909","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.016568674,0.0000045569095,0.9814231,0.00076211785,0.000043562846,0.00026647322,0.000015133376,0.0007054114,0.00021101299],"genre_scores_gemma":[0.103728905,0.0000030668757,0.8940305,0.0017919285,0.000022972223,0.00010277262,0.00006453526,0.000007669498,0.00024764615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923325,0.000028816985,0.00018886139,0.00026837262,0.00015514188,0.00012554874],"domain_scores_gemma":[0.9991721,0.000118963544,0.00005746583,0.00046115756,0.00012830607,0.00006200936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121761725,0.00009005494,0.00009393227,0.00006550438,0.00015303274,0.000101549675,0.000420011,0.000062653344,0.00000634508],"category_scores_gemma":[0.000025738347,0.000085290216,0.000045448476,0.0001475658,0.000022257718,0.0013803206,0.000037134927,0.0000569993,0.000012466722],"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.000008153985,0.00064306025,0.0003733372,0.0000055288783,0.000042519543,0.000003756393,0.008023931,0.15171187,0.0043994687,0.31157082,0.022082897,0.50113463],"study_design_scores_gemma":[0.00013302227,0.00004521032,0.0005969757,0.0000016138681,0.000002357116,0.0000017762918,0.0000046533605,0.9204628,0.0071563697,0.07127121,0.00021467831,0.000109357774],"about_ca_topic_score_codex":0.00006477286,"about_ca_topic_score_gemma":0.00000874156,"teacher_disagreement_score":0.7687509,"about_ca_system_score_codex":0.000020323974,"about_ca_system_score_gemma":0.00006564628,"threshold_uncertainty_score":0.3478034},"labels":[],"label_agreement":null},{"id":"W2122053456","doi":"","title":"A cross-relation based affine projection algorithm for blind SIMO system identification","year":2011,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Algorithm; Affine transformation; Computational complexity theory; Rate of convergence; Projection (relational algebra); Convergence (economics); Mathematics; Adaptive filter; Computer science; Relation (database); System identification; Mathematical optimization; Data modeling; Channel (broadcasting)","score_opus":0.04949023430120057,"score_gpt":0.3038041116673278,"score_spread":0.2543138773661272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122053456","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.0019796346,0.0000050419562,0.99104106,0.00009433637,0.0002427378,0.00095609843,0.000003378078,0.0012251363,0.004452558],"genre_scores_gemma":[0.48540962,3.2262392e-7,0.5130036,0.00007804572,0.000044055858,0.00026363193,0.000020054958,0.0000093931185,0.001171275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989084,0.0000637332,0.0003412327,0.00035270542,0.00019363614,0.00014028198],"domain_scores_gemma":[0.9989679,0.000049124417,0.00018963379,0.00041224062,0.00034212024,0.000038970848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082292315,0.000103930484,0.000096110125,0.00022105158,0.00015303594,0.00025647308,0.00032300604,0.00010816315,0.000020296373],"category_scores_gemma":[0.000030630486,0.0000975236,0.00006460873,0.00038266744,0.000021028849,0.0009789756,0.000033427576,0.000063592764,0.000039051127],"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.000088942936,0.0005281298,0.00083239854,0.00014978787,0.00004358979,0.0000020003467,0.0034947488,0.00026596463,0.00529391,0.47609138,0.0014746565,0.5117345],"study_design_scores_gemma":[0.00050972094,0.000104456,0.003164357,0.000012554954,0.0000058727305,0.0000030961683,0.000028280421,0.9151492,0.079348974,0.0008712959,0.0006724323,0.00012971797],"about_ca_topic_score_codex":0.0000595553,"about_ca_topic_score_gemma":0.000011594828,"teacher_disagreement_score":0.91488326,"about_ca_system_score_codex":0.00008371437,"about_ca_system_score_gemma":0.000071774826,"threshold_uncertainty_score":0.3976897},"labels":[],"label_agreement":null},{"id":"W2122225378","doi":"10.1109/vetecs.2000.851441","title":"Blind joint detection of cochannel CPFSK signals over Rayleigh flat-fading channels with a diversity antenna array","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Simon Fraser University","funders":"","keywords":"Rayleigh fading; Computer science; Fading; Frequency-shift keying; Phase-shift keying; Multipath propagation; Electronic engineering; Diversity scheme; Channel (broadcasting); Algorithm; Demodulation; Telecommunications; Engineering; Bit error rate","score_opus":0.04313610494742806,"score_gpt":0.23475502004478105,"score_spread":0.191618915097353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122225378","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.13246785,0.00003851166,0.863804,0.0003115203,0.00009494776,0.00021318997,0.0000016874943,0.00034028583,0.002728056],"genre_scores_gemma":[0.9844834,0.000022017688,0.014168158,0.00038249916,0.000038800074,0.0000078491485,6.784022e-7,0.000009831307,0.0008867612],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985717,0.000095247655,0.00026258736,0.00039942138,0.00042544358,0.00024559532],"domain_scores_gemma":[0.99896467,0.000057925045,0.00019957309,0.00043335918,0.00024953915,0.00009490836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000359723,0.00016893347,0.0002477026,0.00025764204,0.00021847305,0.000099271005,0.000392507,0.00010063111,0.00013666312],"category_scores_gemma":[0.00002738461,0.00014267131,0.000088457724,0.0006321787,0.000060190087,0.00078383106,0.0002917242,0.00015966284,0.00003300976],"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.00009640052,0.00037205394,0.00064603164,0.00006156746,0.00015615074,0.00004276614,0.017194116,0.00087248365,0.9671715,0.0077359118,0.0010658882,0.004585145],"study_design_scores_gemma":[0.0007353017,0.00033874062,0.0004470437,0.00004856027,0.000013037164,0.000029633251,0.00008144495,0.09268813,0.90286434,0.002351646,0.0001409888,0.00026112917],"about_ca_topic_score_codex":0.00007032009,"about_ca_topic_score_gemma":0.000029332157,"teacher_disagreement_score":0.85201555,"about_ca_system_score_codex":0.00004348157,"about_ca_system_score_gemma":0.000017600592,"threshold_uncertainty_score":0.58179677},"labels":[],"label_agreement":null},{"id":"W2122670793","doi":"10.1109/pacrim.2011.6032970","title":"Two-stage underdetermined speech source separation using frequency normalization","year":2011,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Victoria","funders":"","keywords":"Normalization (sociology); Underdetermined system; Blind signal separation; Computer science; Binary number; Anechoic chamber; Mixing (physics); Speech recognition; Source separation; Pattern recognition (psychology); Matrix (chemical analysis); Time–frequency analysis; Artificial intelligence; Algorithm; Mathematics; Physics; Materials science; Telecommunications","score_opus":0.0688880912227669,"score_gpt":0.3195298133443543,"score_spread":0.2506417221215874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122670793","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.056926146,0.000008248409,0.8912112,0.00005082781,0.00008976319,0.00020019019,5.258538e-7,0.00080246374,0.050710645],"genre_scores_gemma":[0.56866556,0.0000017958654,0.42946273,0.0005039006,0.000023452876,0.0000057895895,0.0000043281198,0.000010346852,0.0013220933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880546,0.000116638716,0.00030100584,0.00032293895,0.00024381177,0.00021014927],"domain_scores_gemma":[0.99910516,0.000021555188,0.0001508377,0.00051740545,0.00013503576,0.00006999936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035633854,0.0001451409,0.00011954705,0.00018889034,0.00013136643,0.00016428505,0.00048941706,0.00007858224,0.00016566752],"category_scores_gemma":[0.000020418249,0.00014169444,0.000049150156,0.00042939922,0.000030197049,0.0015278484,0.00012436126,0.00009051053,0.000058810878],"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.000009247519,0.00016813926,0.004146406,0.000018535644,0.000021482065,0.000019465559,0.007694887,0.00082957116,0.04228272,0.93560606,0.0002770621,0.008926422],"study_design_scores_gemma":[0.000457952,0.00014421986,0.00073728256,0.000016827977,0.000010514355,0.0000535509,0.0001153593,0.68406504,0.2931993,0.019808339,0.0008838719,0.0005077239],"about_ca_topic_score_codex":0.0005531516,"about_ca_topic_score_gemma":0.00013624027,"teacher_disagreement_score":0.9157977,"about_ca_system_score_codex":0.00005854833,"about_ca_system_score_gemma":0.00008487567,"threshold_uncertainty_score":0.5778132},"labels":[],"label_agreement":null},{"id":"W2122963418","doi":"10.1109/itab.2003.1222555","title":"On the use of single-channels for sensing multisource activity in biomedical signals","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":3,"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":"Montreal Neurological Institute and Hospital","keywords":"Computer science; Independent component analysis; Channel (broadcasting); Context (archaeology); SIGNAL (programming language); Preprocessor; Sensitivity (control systems); Focus (optics); Component analysis; Pattern recognition (psychology); Component (thermodynamics); Artificial intelligence; Feature extraction; Representation (politics); Blind signal separation; Constraint (computer-aided design); Signal processing; Electronic engineering; Mathematics; Engineering; Telecommunications","score_opus":0.12255051261695263,"score_gpt":0.3009964337344577,"score_spread":0.1784459211175051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122963418","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.18481857,0.0000014055397,0.81328225,0.0012664793,0.000042801126,0.0002597114,8.1961923e-7,0.00007371867,0.0002542496],"genre_scores_gemma":[0.8735032,4.049839e-7,0.12554176,0.00083077955,0.0000054351917,0.0000053688964,2.5221553e-7,0.0000048095358,0.00010797111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99908066,0.00023277613,0.00016514263,0.0001901701,0.0001842938,0.00014695869],"domain_scores_gemma":[0.9978156,0.0017264872,0.000076278535,0.00029371973,0.00005443267,0.000033456257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006797102,0.000077526405,0.00011861674,0.00012092298,0.000041737087,0.00007596628,0.0001836296,0.000063591266,0.0000070636424],"category_scores_gemma":[0.00069076836,0.000052565996,0.00004694534,0.0002968547,0.000054071705,0.00021304932,0.00003971657,0.00008461842,0.0000019881686],"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.000046253,0.0010562686,0.000050259194,0.000023675131,0.000025692536,0.0000060236102,0.0047371904,0.003369144,0.38139862,0.5349011,0.006667933,0.06771783],"study_design_scores_gemma":[0.00025911324,0.00023719305,0.000036007183,0.000036312726,0.0000014157108,0.00000349185,0.000028912795,0.26416123,0.7183534,0.010237275,0.0065235808,0.00012207842],"about_ca_topic_score_codex":0.000038823357,"about_ca_topic_score_gemma":0.000011731129,"teacher_disagreement_score":0.68868464,"about_ca_system_score_codex":0.000022238833,"about_ca_system_score_gemma":0.000029518958,"threshold_uncertainty_score":0.21435791},"labels":[],"label_agreement":null},{"id":"W2123140981","doi":"10.1109/iembs.2001.1020523","title":"Information dynamics view of brain processing function","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Engineering and Physical Sciences Research Council; Montreal Neurological Institute and Hospital; Aston University","keywords":"Computer science; Independent component analysis; Unobservable; Embedding; Manifold (fluid mechanics); Entropy (arrow of time); Matrix (chemical analysis); Artificial intelligence; Algorithm; Pattern recognition (psychology); Mathematics","score_opus":0.008431898888637034,"score_gpt":0.24972470109088457,"score_spread":0.24129280220224752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123140981","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.0014258736,0.000016738952,0.97283524,0.003810679,0.000017780858,0.00007229677,2.1999566e-7,0.00026844468,0.021552738],"genre_scores_gemma":[0.84457815,0.000003489827,0.15225971,0.0029135991,0.000011047835,0.000005139891,0.0000053312,0.0000016869233,0.0002218654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995758,0.000017741868,0.0001810582,0.00004550243,0.00012403175,0.000055885557],"domain_scores_gemma":[0.9996504,0.000013629377,0.00008949199,0.00013538268,0.00009553546,0.000015542038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024657298,0.000039545157,0.000050670697,0.00008445778,0.000027565511,0.000073451156,0.00016245128,0.00003091861,0.000011221594],"category_scores_gemma":[0.0000151450495,0.00003506735,0.000016605838,0.00022531048,0.000009348597,0.0025007462,0.00003877696,0.0000403152,0.000024354498],"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":[8.4461425e-7,0.000008923219,0.000019727726,0.000011055687,8.1704894e-7,6.598147e-9,0.0005219794,0.000120744306,0.00004881621,0.21074735,0.0007817368,0.787738],"study_design_scores_gemma":[0.00010871749,0.000058839825,0.0007445156,0.000017921959,0.000001451836,0.00000275519,0.00006168143,0.93081564,0.0041837166,0.0041764765,0.05974162,0.00008669201],"about_ca_topic_score_codex":0.000005277272,"about_ca_topic_score_gemma":0.000017557844,"teacher_disagreement_score":0.9306949,"about_ca_system_score_codex":0.000027097023,"about_ca_system_score_gemma":0.000037496902,"threshold_uncertainty_score":0.18129806},"labels":[],"label_agreement":null},{"id":"W2123705983","doi":"10.1002/hbm.20647","title":"Independent component analysis as a model‐free approach for the detection of BOLD changes related to epileptic spikes: A simulation study","year":2008,"lang":"en","type":"article","venue":"Human Brain Mapping","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":42,"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; Montreal Neurological Institute and Hospital","funders":"Canadian Institutes of Health Research","keywords":"Independent component analysis; Electroencephalography; Pattern recognition (psychology); Deconvolution; Artificial intelligence; Computer science; Biological system; Neuroscience; Psychology; Algorithm; Biology","score_opus":0.07303177087558502,"score_gpt":0.3133235089220092,"score_spread":0.2402917380464242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123705983","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.2812104,0.000014980795,0.71692324,0.00035711913,0.0000139269805,0.0012091822,0.00000111767,0.0001663834,0.00010363631],"genre_scores_gemma":[0.9858961,0.0000011589935,0.013315823,0.0003254912,0.000017007329,0.00026673003,0.000006181493,0.000011800282,0.00015970315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840844,0.00018147154,0.00038795068,0.00041322067,0.0004242052,0.00018470778],"domain_scores_gemma":[0.9984878,0.0002589009,0.00023461046,0.00081234967,0.00015651567,0.000049844995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001248169,0.0001449001,0.00026091374,0.00062473153,0.00047949143,0.00007018699,0.0007152646,0.000070747345,0.000002893113],"category_scores_gemma":[0.000121214944,0.00012485958,0.00013042887,0.0011103706,0.00003350971,0.0001774291,0.00022983331,0.00013872515,0.0000014803268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014224764,0.00031506634,0.0004584375,0.000016659455,0.00023166911,0.0000011285522,0.039059266,0.9273809,0.027301183,0.004201216,0.00004094033,0.000979316],"study_design_scores_gemma":[0.00038132758,0.0002751994,0.01803381,0.000007604607,0.000056142246,0.0000019840534,0.0007209633,0.97779083,0.00048237797,0.0020657803,0.00004339571,0.0001405584],"about_ca_topic_score_codex":0.00008382107,"about_ca_topic_score_gemma":0.00010761392,"teacher_disagreement_score":0.7046857,"about_ca_system_score_codex":0.000072211245,"about_ca_system_score_gemma":0.000022501523,"threshold_uncertainty_score":0.5091626},"labels":[],"label_agreement":null},{"id":"W2124068166","doi":"10.1109/icpr.2002.1047783","title":"A comparison of PCA and ICA for object recognition under varying illumination","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"McMaster University","funders":"","keywords":"Artificial intelligence; Principal component analysis; Independent component analysis; Specularity; Pattern recognition (psychology); Subspace topology; Computer vision; Computer science; Cognitive neuroscience of visual object recognition; Object (grammar); Linear subspace; Filter (signal processing); Set (abstract data type); Blob detection; Mathematics; Image (mathematics); Image processing; Edge detection","score_opus":0.07297791235721057,"score_gpt":0.3443100966042556,"score_spread":0.271332184247045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124068166","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.022650123,0.000024906525,0.96596605,0.00024083411,0.000029487424,0.00020260915,6.47898e-7,0.00010793973,0.010777422],"genre_scores_gemma":[0.74159914,0.0000032594257,0.25815746,0.00014847482,0.0000025506472,0.000015872096,0.0000024913447,0.0000024834308,0.000068290494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995048,0.000052178726,0.0001536522,0.00013617588,0.00008472309,0.0000684819],"domain_scores_gemma":[0.99956894,0.00012438596,0.00007527596,0.00010830935,0.00010348208,0.000019586914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003003869,0.000047523423,0.00008910839,0.00008213572,0.000047750014,0.00004003204,0.00007391782,0.000039421524,0.000007728851],"category_scores_gemma":[0.000060670456,0.000045265417,0.000020592812,0.00013032767,0.000018978368,0.00026818537,0.00001652102,0.00003271388,0.0000015360167],"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.000011968981,0.00023003166,0.00080964447,0.000060964558,0.000020319641,1.4604208e-7,0.0047564995,0.00005680564,0.014548067,0.8495691,0.0013904246,0.12854604],"study_design_scores_gemma":[0.00064118253,0.00038870025,0.0012012022,0.00003266199,0.000011507781,0.0000068579743,0.0003640247,0.10036661,0.7388458,0.15557708,0.0023272422,0.0002370956],"about_ca_topic_score_codex":0.000006493756,"about_ca_topic_score_gemma":0.0000070899177,"teacher_disagreement_score":0.72429776,"about_ca_system_score_codex":0.000010970612,"about_ca_system_score_gemma":0.000022642802,"threshold_uncertainty_score":0.184587},"labels":[],"label_agreement":null},{"id":"W2124498607","doi":"10.1002/mrm.20893","title":"Isolation and minimization of head motion‐induced signal variations in fMRI data using independent component analysis","year":2006,"lang":"en","type":"article","venue":"Magnetic Resonance in Medicine","topic":"Blind Source Separation 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":"Pacific Centre for Reproductive Medicine; University of British Columbia","funders":"National Institute of Neurological Disorders and Stroke","keywords":"Computer science; Artificial intelligence; Preprocessor; Motion (physics); SIGNAL (programming language); Independent component analysis; Similarity (geometry); Pattern recognition (psychology); Task (project management); Computer vision; Minification; Image (mathematics)","score_opus":0.04827705526973323,"score_gpt":0.31398912602245455,"score_spread":0.2657120707527213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124498607","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.29661396,0.00067038974,0.7013312,0.0009992694,0.000027420398,0.00019932573,0.0000031582676,0.000023223101,0.0001320561],"genre_scores_gemma":[0.93438584,0.000040298353,0.065392256,0.0000698084,0.000026686072,0.0000071646623,0.00005885118,0.000004208556,0.000014899941],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983233,0.00022310157,0.00059605425,0.0003620465,0.00036637858,0.00012909708],"domain_scores_gemma":[0.9990778,0.00012651467,0.00018398048,0.0005056972,0.00007999387,0.000026008074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009665006,0.000099301,0.0002681994,0.00071824476,0.00003289587,0.00002481676,0.00036411724,0.00006888411,0.000025017756],"category_scores_gemma":[0.00006776828,0.00009670218,0.000014026837,0.0016931912,0.000052876883,0.0003328943,0.00014085535,0.00011583307,3.1203618e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069047914,0.00086348155,0.7066326,0.00008307669,0.000032786094,0.000029800283,0.0065393867,0.05492938,0.03888951,0.038109556,0.00030432618,0.15351701],"study_design_scores_gemma":[0.00036967333,0.00004602962,0.44410473,0.00003729498,0.000015338355,0.0000015785254,0.000018437611,0.5540557,0.000118371005,0.0011488079,0.000035703477,0.000048347218],"about_ca_topic_score_codex":0.0031260261,"about_ca_topic_score_gemma":0.0015045017,"teacher_disagreement_score":0.63777184,"about_ca_system_score_codex":0.0000534376,"about_ca_system_score_gemma":0.000041712337,"threshold_uncertainty_score":0.4725637},"labels":[],"label_agreement":null},{"id":"W2125049089","doi":"10.1109/icassp.2004.1326967","title":"An information geometric approach to channel identification","year":2004,"lang":"en","type":"article","venue":"","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":"Generalization; Maximization; Identification (biology); Channel (broadcasting); Expectation–maximization algorithm; Computer science; Algorithm; Iterative method; MIMO; Mathematical optimization; Maximum likelihood; Mathematics; Statistics; Telecommunications","score_opus":0.018230683979942788,"score_gpt":0.262139435777937,"score_spread":0.24390875179799423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125049089","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.004691823,0.000002032921,0.97996193,0.00089109736,0.000050882278,0.00023724043,4.9645865e-7,0.0006550307,0.0135094635],"genre_scores_gemma":[0.77928305,0.0000010618911,0.21885218,0.0017448617,0.000011409588,0.000038798855,0.000013502933,0.0000020591879,0.000053077285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993225,0.00001937923,0.00018775523,0.00014545716,0.0002190927,0.00010584084],"domain_scores_gemma":[0.9993122,0.0000054903503,0.00005454274,0.00043259052,0.00011750884,0.000077643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040377703,0.0000588584,0.000050918425,0.00058848073,0.00006320267,0.00039983733,0.00054419006,0.000040490046,0.0000017184012],"category_scores_gemma":[0.000028797314,0.000055382985,0.000017152517,0.001414258,0.0000057634743,0.0034978692,0.000054252465,0.000047446534,0.0002408146],"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.000001664901,0.00017838074,0.000010806726,0.0000069859316,0.000003073489,9.115487e-8,0.0058227424,0.018386224,0.0006630132,0.9370946,0.0012426061,0.03658979],"study_design_scores_gemma":[0.0015415765,0.00088550895,0.04703024,0.000020718899,0.000010155015,0.000050899205,0.001078481,0.3959742,0.39140296,0.14053185,0.01989165,0.0015817435],"about_ca_topic_score_codex":0.000042763422,"about_ca_topic_score_gemma":0.000001570182,"teacher_disagreement_score":0.7965628,"about_ca_system_score_codex":0.000047329897,"about_ca_system_score_gemma":0.00003303711,"threshold_uncertainty_score":0.38556406},"labels":[],"label_agreement":null},{"id":"W2125191947","doi":"10.1109/ijcnn.2006.247103","title":"A Cooperative Recurrent Neural Network Algorithm for Parameter Estimation of Autoregressive Signals","year":2006,"lang":"en","type":"article","venue":"The 2006 IEEE International Joint Conference on Neural Network Proceedings","topic":"Blind Source Separation 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":"University of Waterloo","funders":"","keywords":"Autoregressive model; Computer science; Algorithm; Weighting; Artificial neural network; Convergence (economics); Gaussian; Gaussian noise; Recurrent neural network; Noise (video); Standard deviation; Mathematics; Artificial intelligence; Statistics","score_opus":0.04575464100919267,"score_gpt":0.3025317251679997,"score_spread":0.256777084158807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125191947","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.040056556,0.000075376185,0.94571376,0.007974821,0.001653349,0.0015991116,0.000046619047,0.00040245373,0.0024779248],"genre_scores_gemma":[0.91721624,0.000017251514,0.07982006,0.0012301414,0.0009114563,0.00031684156,0.000040181512,0.000024745914,0.00042309565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759454,0.000080540696,0.0007328253,0.00052574504,0.000626642,0.00043968952],"domain_scores_gemma":[0.99745655,0.00036318714,0.0007612532,0.00022073775,0.0011333611,0.00006492309],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000668136,0.00033475613,0.00036559298,0.00012116712,0.00022193162,0.0004570251,0.0010782861,0.00011333229,0.00002151535],"category_scores_gemma":[0.00008318899,0.00024639178,0.00018072345,0.0003331442,0.00016394469,0.000714347,0.00014054615,0.00035093105,0.000008743161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013164856,0.00020522517,0.00008863892,0.000019376714,0.00009342136,0.0000035411736,0.0006328501,0.40624613,0.0009142342,0.3863076,0.08050882,0.12484851],"study_design_scores_gemma":[0.00035900585,0.00041306764,0.0003719681,0.0001698493,0.0000151685845,0.00001781837,0.000013670691,0.9456318,0.005032378,0.047277715,0.0004460625,0.0002515205],"about_ca_topic_score_codex":0.000030625968,"about_ca_topic_score_gemma":0.0000067123683,"teacher_disagreement_score":0.87715966,"about_ca_system_score_codex":0.00007990107,"about_ca_system_score_gemma":0.000077054516,"threshold_uncertainty_score":0.9999988},"labels":[],"label_agreement":null},{"id":"W2125326612","doi":"10.1109/icassp.1995.480415","title":"Blind equalization using second-order statistics","year":2002,"lang":"en","type":"article","venue":"","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":"Blind equalization; Intersymbol interference; Equalization (audio); Independent and identically distributed random variables; Order statistic; Computer science; Interference (communication); Algorithm; Higher-order statistics; Distribution (mathematics); Phase (matter); SIGNAL (programming language); Statistics; Artificial intelligence; Signal processing; Mathematics; Telecommunications; Random variable; Channel (broadcasting); Mathematical analysis","score_opus":0.08157323314145583,"score_gpt":0.31257771752362606,"score_spread":0.23100448438217025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125326612","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.0015691954,0.000019669455,0.9801461,0.0001987975,0.00006740528,0.00008579152,0.00000230319,0.00032010765,0.017590597],"genre_scores_gemma":[0.1129101,0.0000046710575,0.8811292,0.0015448858,0.000021788437,0.0000028272816,0.0000034996106,0.0000072788757,0.0043757404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993434,0.000054347798,0.00016096608,0.00016562376,0.00015983167,0.00011586374],"domain_scores_gemma":[0.9994783,0.000042715204,0.00005710684,0.00025751963,0.00012546136,0.000038902705],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000145589,0.00006689397,0.00006501994,0.00009224825,0.000065807144,0.00017372637,0.0002392464,0.000044374934,0.0011514028],"category_scores_gemma":[0.000031236006,0.0000648022,0.000012012906,0.0003441515,0.000014953355,0.00045828818,0.00006894555,0.000056458506,0.000094369585],"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":[7.511166e-7,0.000059171398,0.00006329963,0.000006652302,0.000006353452,0.0000029456742,0.0014446103,0.00046123765,0.0011883174,0.96249443,0.02249954,0.01177271],"study_design_scores_gemma":[0.00016782666,0.000026549691,0.00003571237,0.000002883619,0.0000016797302,0.0000063357365,0.000009964666,0.97109205,0.005077511,0.009789717,0.013664315,0.00012545387],"about_ca_topic_score_codex":0.00000835246,"about_ca_topic_score_gemma":0.000015046253,"teacher_disagreement_score":0.9706308,"about_ca_system_score_codex":0.000019343182,"about_ca_system_score_gemma":0.00001717198,"threshold_uncertainty_score":0.9997617},"labels":[],"label_agreement":null},{"id":"W2126010864","doi":"10.1145/1390156.1390215","title":"ICA and ISA using Schweizer-Wolff measure of dependence","year":2008,"lang":"en","type":"article","venue":"","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":"University of Alberta","funders":"","keywords":"Independent component analysis; Pairwise comparison; Subspace topology; Outlier; Measure (data warehouse); Computer science; Pattern recognition (psychology); Parametric statistics; Noise (video); Artificial intelligence; Pairwise independence; Contrast (vision); Algorithm; Mathematics; Image (mathematics); Data mining; Statistics; Random variable","score_opus":0.05348316466236447,"score_gpt":0.2714629600005999,"score_spread":0.21797979533823542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126010864","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.18340589,0.000074752475,0.81027776,0.00020540407,0.000020478172,0.000067480934,2.4006704e-7,0.0001567367,0.005791254],"genre_scores_gemma":[0.7295066,0.000015333151,0.2701777,0.00018085256,0.0000057506604,0.0000010263948,7.255988e-8,0.0000024469934,0.000110248366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99931693,0.000044764718,0.00013952816,0.00017763769,0.00022532223,0.000095830335],"domain_scores_gemma":[0.9994962,0.000034624263,0.000055878692,0.0002772342,0.000091915936,0.000044097163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002126455,0.00006289846,0.00009910106,0.00007161405,0.000071971685,0.000026671396,0.0002911222,0.00004552876,0.000011144699],"category_scores_gemma":[0.000031573087,0.000055306107,0.000022148186,0.00019606616,0.00006741182,0.00040263633,0.00013016183,0.0000690016,0.0000034588336],"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.000026263531,0.00033494213,0.032599248,0.00006794705,0.00006649138,0.000074535936,0.011990809,0.0003121124,0.18056099,0.7182493,0.004719042,0.05099827],"study_design_scores_gemma":[0.0007682502,0.0002744968,0.02036596,0.00009506411,0.000012606219,0.00077462127,0.00011751435,0.17330466,0.78554195,0.0152804805,0.002763502,0.0007008621],"about_ca_topic_score_codex":0.0000819749,"about_ca_topic_score_gemma":0.00000984322,"teacher_disagreement_score":0.70296884,"about_ca_system_score_codex":0.0000084818475,"about_ca_system_score_gemma":0.00007234861,"threshold_uncertainty_score":0.22553176},"labels":[],"label_agreement":null},{"id":"W2126054668","doi":"10.1109/glocom.1990.116582","title":"Improved bounds for timing estimation jitter","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Queen's University; Raytheon Technologies (Canada)","funders":"","keywords":"Upper and lower bounds; Jitter; Symbol (formal); Synchronization (alternating current); Algorithm; Computer science; Statement (logic); Signal-to-noise ratio (imaging); Contrast (vision); Noise (video); SIGNAL (programming language); Mathematics; Combinatorics; Artificial intelligence; Topology (electrical circuits); Telecommunications; Mathematical analysis","score_opus":0.04310364612584848,"score_gpt":0.2862008220500896,"score_spread":0.24309717592424113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126054668","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.0006816759,0.000008181085,0.9865789,0.0034100055,0.000055744895,0.00017615626,2.493686e-7,0.0004978532,0.008591234],"genre_scores_gemma":[0.3304756,8.521011e-7,0.6644872,0.0019236167,0.000018016093,0.000042007247,0.0000011601603,0.000004122096,0.003047416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995567,0.000011617928,0.0001069175,0.0001497116,0.000068357695,0.00010668356],"domain_scores_gemma":[0.999625,0.000043801523,0.000035209498,0.00022547493,0.0000452786,0.00002518582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014804391,0.000052986783,0.000051451698,0.00005493328,0.00006946292,0.0001932004,0.00022846759,0.00003505444,0.00005023781],"category_scores_gemma":[0.000024882322,0.000047499278,0.000031022937,0.000094427654,0.000008932579,0.00051451585,0.00003978447,0.000034369183,0.00003275837],"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.0000029071584,0.00010495003,0.000030028095,0.000020281546,0.000013313131,6.575364e-7,0.003368965,0.00018115985,0.0072992872,0.38648593,0.08723071,0.5152618],"study_design_scores_gemma":[0.00010456583,0.000045603698,0.000020166743,0.0000020353643,0.0000010359042,0.0000018565687,0.000003108465,0.9711101,0.014540868,0.0059107053,0.0081903525,0.00006958753],"about_ca_topic_score_codex":0.000003988755,"about_ca_topic_score_gemma":0.0000019045091,"teacher_disagreement_score":0.97092897,"about_ca_system_score_codex":0.000015368256,"about_ca_system_score_gemma":0.0000055501578,"threshold_uncertainty_score":0.19369644},"labels":[],"label_agreement":null},{"id":"W2126157087","doi":"","title":"Region-growing permutation alignment approach in frequency-domain convolutive blind source separation","year":2009,"lang":"en","type":"article","venue":"Canadian acoustics","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Institute for Microstructural Sciences","funders":"","keywords":"Bin; Permutation (music); Frequency domain; Algorithm; Blind signal separation; Short-time Fourier transform; Mathematics; Fourier transform; SIGNAL (programming language); Time–frequency analysis; Computer science; Fourier analysis; Acoustics; Telecommunications; Physics; Mathematical analysis","score_opus":0.01871335227988815,"score_gpt":0.2591281448026625,"score_spread":0.24041479252277434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126157087","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.055497,0.00005273897,0.93388295,0.0022684876,0.000080869984,0.00040444464,0.0000036025078,0.00014760927,0.007662294],"genre_scores_gemma":[0.8575929,0.000008389297,0.13879743,0.0033747694,0.0000520057,0.00002130654,0.00003032713,0.000010233169,0.00011262819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849105,0.00013892788,0.0003162464,0.00039687037,0.00025701444,0.00039987327],"domain_scores_gemma":[0.9990735,0.00004550614,0.000105617866,0.00039419276,0.00011154021,0.00026965557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040846664,0.00017178617,0.00016480047,0.00048267134,0.00014996588,0.000192054,0.00044886005,0.00016447353,0.0000033585825],"category_scores_gemma":[0.000053929027,0.00020043673,0.0000417595,0.0006056576,0.00004233197,0.0006792742,0.000020940675,0.00023127526,0.000015433468],"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.000018441275,0.00021124227,0.0011289231,0.000028227076,0.000031795815,0.00022365266,0.04628353,0.034359127,0.018044865,0.8739484,0.010185371,0.015536417],"study_design_scores_gemma":[0.002113328,0.00047382724,0.044758342,0.00012118843,0.00003310796,0.00018003401,0.003715705,0.6831543,0.0009867734,0.2609081,0.002016598,0.0015387033],"about_ca_topic_score_codex":0.0030985458,"about_ca_topic_score_gemma":0.0015779481,"teacher_disagreement_score":0.8020959,"about_ca_system_score_codex":0.000781419,"about_ca_system_score_gemma":0.00063877704,"threshold_uncertainty_score":0.81735724},"labels":[],"label_agreement":null},{"id":"W2126175004","doi":"10.1109/iai.2004.1300936","title":"A comparison of subspace methods for accurate position measurement","year":2004,"lang":"en","type":"article","venue":"","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":"Principal component analysis; Kernel principal component analysis; Subspace topology; Pattern recognition (psychology); Linear discriminant analysis; Artificial intelligence; Linear subspace; Kernel (algebra); Independent component analysis; Computer science; Position (finance); Kernel Fisher discriminant analysis; Mathematics; Computer vision; Kernel method; Support vector machine; Facial recognition system","score_opus":0.14317351174205253,"score_gpt":0.4646293531960592,"score_spread":0.32145584145400663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126175004","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.0008881922,0.000059109305,0.99426085,0.002729754,0.000049507053,0.00030931682,3.6276293e-7,0.00021198181,0.0014909019],"genre_scores_gemma":[0.437211,9.518201e-7,0.5625866,0.00015785036,0.0000040147775,0.000021953285,5.9150335e-7,0.000002252306,0.000014791101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992735,0.000081570135,0.00020947539,0.00015524539,0.00018081165,0.000099400095],"domain_scores_gemma":[0.9992765,0.0000487259,0.0001125858,0.00025069038,0.00028009297,0.00003136717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001064902,0.000064651744,0.0001359797,0.00007084372,0.000040445204,0.000047184163,0.0002848903,0.000038380556,0.0000025977815],"category_scores_gemma":[0.000053373864,0.000057022815,0.00005358786,0.00017808398,0.000013922142,0.0002579005,0.000045257715,0.000041487274,0.000002384869],"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.000011601545,0.000193765,0.000039331673,0.000019423956,0.00001707234,9.324006e-8,0.0023127652,0.0009633358,0.10547169,0.8601433,0.0006840457,0.030143553],"study_design_scores_gemma":[0.0002864207,0.00020447945,0.00023052345,0.000014434968,0.000004516484,0.0000010853441,0.000040756353,0.022329375,0.9382187,0.03730018,0.001288525,0.00008096395],"about_ca_topic_score_codex":0.000022845628,"about_ca_topic_score_gemma":0.000017944825,"teacher_disagreement_score":0.83274704,"about_ca_system_score_codex":0.000062782026,"about_ca_system_score_gemma":0.00007354843,"threshold_uncertainty_score":0.2325323},"labels":[],"label_agreement":null},{"id":"W2126291131","doi":"10.1109/glocom.2008.ecp.568","title":"Blind Multi-Sources Detection and Localization for Cognitive Radio","year":2008,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Institut National de la Recherche Scientifique; University of British Columbia; École de Technologie Supérieure","funders":"","keywords":"Cognitive radio; Computer science; Direction of arrival; Modulation (music); Time of arrival; Pattern recognition (psychology); Artificial intelligence; Algorithm; Telecommunications; Wireless; Physics; Acoustics","score_opus":0.04335254443651598,"score_gpt":0.2888339304705277,"score_spread":0.2454813860340117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126291131","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.045425497,0.00004715197,0.9534427,0.00009029685,0.000035467583,0.0003300205,8.1683163e-7,0.00034186462,0.00028619013],"genre_scores_gemma":[0.91056776,0.000028328253,0.088541165,0.00043359777,0.000020642761,0.000042958596,0.0000025072427,0.0000054805405,0.0003575347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994681,0.00003679115,0.00011210151,0.00020687246,0.000085247724,0.00009092334],"domain_scores_gemma":[0.999604,0.00009310444,0.0000471585,0.00009105286,0.00012551475,0.0000392008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014809555,0.000068256486,0.00007110375,0.000098028446,0.00018969126,0.00006215776,0.00009373414,0.00005520432,0.0000026205664],"category_scores_gemma":[0.00006166873,0.000062684376,0.00002212371,0.00016487887,0.000047883375,0.00040081426,0.00003515344,0.000039754985,0.0000039836204],"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.0005699384,0.0013409443,0.024564732,0.00017762829,0.00025001273,0.00002538441,0.0784857,0.0014049114,0.02267127,0.123712696,0.0040225545,0.74277425],"study_design_scores_gemma":[0.001597885,0.00024755925,0.004250899,0.000011411291,0.00000683229,0.00005994709,0.00012049486,0.8089746,0.18019572,0.0011530604,0.003166966,0.00021457548],"about_ca_topic_score_codex":0.000018085708,"about_ca_topic_score_gemma":0.000032598247,"teacher_disagreement_score":0.8651423,"about_ca_system_score_codex":0.000010428407,"about_ca_system_score_gemma":0.000019123758,"threshold_uncertainty_score":0.25561947},"labels":[],"label_agreement":null},{"id":"W2126335272","doi":"10.1109/acssc.1992.269195","title":"Asynchronous timing recovery in DSP based PSK modems","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Queen's University","funders":"","keywords":"Intersymbol interference; Asynchronous communication; Noise (video); Computer science; Detector; Symbol rate; Filter (signal processing); Pulse shaping; Interference (communication); Polyphase system; Zero crossing; Electronic engineering; Channel (broadcasting); Speech recognition; Bit error rate; Telecommunications; Electrical engineering; Engineering; Physics; Artificial intelligence; Power (physics)","score_opus":0.024104107565059783,"score_gpt":0.261070487662085,"score_spread":0.23696638009702523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126335272","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.007124222,0.000021109769,0.9165716,0.00039690587,0.00006282809,0.00010661371,1.6564856e-7,0.00031624033,0.07540032],"genre_scores_gemma":[0.5998522,0.00000283915,0.3982488,0.0015979364,0.0000049734717,0.000013742002,5.5109956e-7,0.00000509192,0.00027386416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991626,0.00011021324,0.00017201365,0.00024280991,0.0001376204,0.00017472495],"domain_scores_gemma":[0.9994528,0.00007674734,0.000037307047,0.00036521084,0.000027031834,0.00004085308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049096806,0.00008240016,0.00009638297,0.00015535024,0.00003388219,0.00010282173,0.0003058894,0.000061899205,0.00006676114],"category_scores_gemma":[0.000052188036,0.00007959957,0.000034398166,0.00031810362,0.000011618786,0.00043858873,0.00003372586,0.00010319226,0.000053511638],"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.0000075209196,0.00031149224,0.0018977385,0.000015369718,0.000008695899,0.000028320786,0.0010223456,0.02993404,0.001982672,0.90125656,0.0045465548,0.058988675],"study_design_scores_gemma":[0.00050846627,0.00014380681,0.00066375616,0.000027283082,0.0000015613618,0.000009695957,0.000025659832,0.86777204,0.077356696,0.045184128,0.007914748,0.0003921292],"about_ca_topic_score_codex":0.00004087667,"about_ca_topic_score_gemma":0.000041450836,"teacher_disagreement_score":0.8560724,"about_ca_system_score_codex":0.000059553513,"about_ca_system_score_gemma":0.00011798242,"threshold_uncertainty_score":0.32459763},"labels":[],"label_agreement":null},{"id":"W2127157301","doi":"10.1109/icassp.2004.1326188","title":"Motion-corrected independent component analysis for robust functional magnetic resonance imaging","year":2004,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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 British Columbia","funders":"National Institute of Neurological Disorders and Stroke","keywords":"Functional magnetic resonance imaging; Artificial intelligence; Computer science; Independent component analysis; Preprocessor; Interpolation (computer graphics); Pattern recognition (psychology); Mutual information; Computer vision; Entropy (arrow of time); Principal component analysis; Motion (physics); Neuroscience; Physics; Psychology","score_opus":0.02113286716607392,"score_gpt":0.23771374872294934,"score_spread":0.2165808815568754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127157301","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.0030106485,0.00019117119,0.99258846,0.0021301964,0.000152241,0.00027350313,0.0000036273857,0.0005726315,0.0010775278],"genre_scores_gemma":[0.6770775,0.0000046502805,0.32129282,0.0009553987,0.000032338212,0.00007948792,0.000027029138,0.0000075591856,0.0005232485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987197,0.00004189108,0.00026519733,0.000428058,0.00033490628,0.0002102357],"domain_scores_gemma":[0.99916136,0.000064739404,0.00007478836,0.0004074078,0.00022182567,0.000069901755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003208116,0.00012645323,0.0001569766,0.00035065366,0.00014786364,0.00018879244,0.00038520806,0.000042031832,0.0000823822],"category_scores_gemma":[0.000026255517,0.0001217012,0.00014607591,0.0009321196,0.000028214374,0.00039445565,0.00010670368,0.000100264144,0.000022311884],"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.00005734787,0.00082119426,0.026382163,0.000017220438,0.0001493952,0.000014828252,0.0014073274,0.3085077,0.0020856624,0.53101665,0.0046715117,0.12486901],"study_design_scores_gemma":[0.0010601673,0.00008207368,0.253755,0.000010346809,0.000062051244,0.00001734533,0.000048016536,0.7261678,0.004549097,0.010790161,0.003100215,0.00035772222],"about_ca_topic_score_codex":0.00012005027,"about_ca_topic_score_gemma":0.00011855144,"teacher_disagreement_score":0.67406684,"about_ca_system_score_codex":0.00011488175,"about_ca_system_score_gemma":0.00007007151,"threshold_uncertainty_score":0.4962831},"labels":[],"label_agreement":null},{"id":"W2127238581","doi":"10.1109/vetec.1995.504900","title":"A PHASE algorithm for blind adaptive optimum diversity combining","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Carleton University","funders":"","keywords":"Algorithm; Cyclostationary process; Computer science; Diversity combining; Interference (communication); Wireless; Sample matrix inversion; Computation; Adaptive filter; Rate of convergence; Computational complexity theory; Adaptive algorithm; Channel (broadcasting); Covariance matrix; Telecommunications; Fading; Decoding methods","score_opus":0.07690110843069478,"score_gpt":0.3032376360139325,"score_spread":0.22633652758323772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127238581","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.00075525924,0.000020384323,0.98810905,0.0006204911,0.00007253997,0.00030104406,0.0000046749005,0.00050029,0.009616247],"genre_scores_gemma":[0.2010402,0.000004573477,0.796517,0.0008543647,0.00002214202,0.000021243372,0.0000018205126,0.00000469302,0.0015339352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992539,0.000033506505,0.000118798336,0.00025790642,0.00016234482,0.000173499],"domain_scores_gemma":[0.99941564,0.000092848495,0.00005560204,0.00025834696,0.00010547937,0.00007205885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002241473,0.00009048926,0.00010881512,0.000093254814,0.00026346158,0.0001021762,0.0005210998,0.000052671327,0.00006236307],"category_scores_gemma":[0.000012086111,0.00008756564,0.000063355474,0.00019903401,0.000028271794,0.0005604433,0.0004253874,0.000080485544,0.0000382223],"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.000019157402,0.0011688358,0.000011616575,0.0000031704758,0.000045008757,0.000009991209,0.006717819,0.00004106212,0.000092365524,0.17926262,0.034425657,0.7782027],"study_design_scores_gemma":[0.0023672457,0.000612018,0.0000029980388,0.0000035786604,0.000004262372,0.0000036179522,0.00006152358,0.98661035,0.002764506,0.0042785546,0.003152498,0.00013885552],"about_ca_topic_score_codex":0.000013813011,"about_ca_topic_score_gemma":0.0000018951132,"teacher_disagreement_score":0.9865693,"about_ca_system_score_codex":0.000024322017,"about_ca_system_score_gemma":0.0000098605415,"threshold_uncertainty_score":0.3570823},"labels":[],"label_agreement":null},{"id":"W2127255779","doi":"10.1109/isspa.2007.4555423","title":"Neural network modeling and identification of nonlinear MIMO channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Queen's University","funders":"Utah Agricultural Experiment Station","keywords":"MIMO; Nonlinear system; Artificial neural network; Computer science; Control theory (sociology); Perceptron; Convergence (economics); Algorithm; Mean squared error; Multilayer perceptron; Mathematics; Channel (broadcasting); Artificial intelligence; Telecommunications","score_opus":0.0258845227527745,"score_gpt":0.28588078314629667,"score_spread":0.2599962603935222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127255779","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.1313018,0.000057931677,0.86758924,0.00027122922,0.000078533456,0.00007236809,1.396763e-7,0.00013277837,0.0004960061],"genre_scores_gemma":[0.8671457,0.000009086141,0.13249277,0.0002056601,0.00004969959,0.000001261523,9.638743e-7,0.0000028526301,0.00009201958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993777,0.000018666095,0.00023937183,0.0001443908,0.00011109493,0.00010877657],"domain_scores_gemma":[0.9995919,0.000031613134,0.000065726796,0.00020148933,0.000077269906,0.000032032593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007827513,0.0000475662,0.0000665669,0.000059170954,0.00003795734,0.000056807723,0.0001927924,0.00003546593,0.0000015032734],"category_scores_gemma":[0.000012042037,0.000044276054,0.000017578703,0.00019631065,0.000014636942,0.00029641564,0.00007526492,0.00004840729,0.0000018382538],"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.000030299174,0.00018374487,0.0015705883,0.00006903916,0.00003159976,0.000005818251,0.005955659,0.3247376,0.025277417,0.50095385,0.0009792717,0.1402051],"study_design_scores_gemma":[0.00004235911,0.000016160706,0.00013869451,0.0000032973714,9.818235e-7,0.0000024579072,0.00001447521,0.9785423,0.016974913,0.0041324897,0.000084491985,0.000047375037],"about_ca_topic_score_codex":0.000016572776,"about_ca_topic_score_gemma":0.000006913939,"teacher_disagreement_score":0.7358439,"about_ca_system_score_codex":0.0000042668644,"about_ca_system_score_gemma":0.000007947895,"threshold_uncertainty_score":0.18055251},"labels":[],"label_agreement":null},{"id":"W2127460961","doi":"10.1109/ccece.1997.614826","title":"A novel voiceband QAM constellation discrimination technique","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Alberta","funders":"","keywords":"Symbol (formal); Histogram; QAM; Computer science; Pattern recognition (psychology); Quadrature amplitude modulation; Channel (broadcasting); Speech recognition; SIGNAL (programming language); Algorithm; Artificial intelligence; Mathematics; Telecommunications; Bit error rate; Image (mathematics)","score_opus":0.03724514455292037,"score_gpt":0.26095278207805217,"score_spread":0.2237076375251318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127460961","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.00029602004,0.000014893081,0.8605773,0.0022367742,0.000039665956,0.000267677,5.213363e-7,0.00070197275,0.13586517],"genre_scores_gemma":[0.7328801,0.000009330526,0.26539323,0.00061118393,0.000015708918,0.000019975721,0.0000018545055,0.0000049336973,0.0010636852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992706,0.000035342033,0.00017170834,0.00022162932,0.0001863367,0.000114339375],"domain_scores_gemma":[0.99944925,0.00005308677,0.00006672213,0.00031642744,0.00007489436,0.00003963298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024675255,0.00008541702,0.0000754825,0.00014204913,0.000069312264,0.00015153043,0.0002893037,0.00006902051,0.00011327306],"category_scores_gemma":[0.00002089107,0.00007724335,0.00003207722,0.00028909728,0.000028563247,0.0007087624,0.0000746119,0.00008337819,0.000060451996],"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.0000012765662,0.00021372699,0.00012307502,0.000011662393,0.0000070344863,0.000001658699,0.00186258,0.00006537425,0.06341416,0.86130995,0.010604394,0.06238509],"study_design_scores_gemma":[0.0005881209,0.00019856704,0.0008597814,0.000044270382,0.000008723739,0.00012930132,0.00007375724,0.5057529,0.43233907,0.016561888,0.04283807,0.00060552754],"about_ca_topic_score_codex":0.0000168683,"about_ca_topic_score_gemma":0.000008088863,"teacher_disagreement_score":0.8447481,"about_ca_system_score_codex":0.000028223109,"about_ca_system_score_gemma":0.00000961195,"threshold_uncertainty_score":0.3149892},"labels":[],"label_agreement":null},{"id":"W2127509324","doi":"10.1109/aspaa.2003.1285799","title":"A new fast-converging method for blind source separation of speech signals in acoustic environments","year":2004,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McMaster University","funders":"","keywords":"Blind signal separation; Initialization; Computer science; Permutation (music); Algorithm; Frequency domain; Bin; Mixing (physics); Joint (building); Speech recognition; Spectral density; Scaling; Mathematics; Acoustics; Engineering; Telecommunications","score_opus":0.021630880016637724,"score_gpt":0.3254461970291711,"score_spread":0.3038153170125334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127509324","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.0065816366,0.000015680393,0.9916073,0.0006405616,0.000033531633,0.00050100277,7.603605e-7,0.000095654505,0.0005238509],"genre_scores_gemma":[0.26347983,0.0000033927017,0.73515993,0.00029945074,0.000021717135,0.000021683078,0.0000023171958,0.000008048763,0.0010036144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988592,0.0000653097,0.00034960225,0.00030573038,0.00023385466,0.00018625197],"domain_scores_gemma":[0.9993413,0.00013635664,0.00014178264,0.00029738125,0.000022295873,0.000060855662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006492374,0.00011818693,0.0001857325,0.00022029618,0.00003159988,0.000057125537,0.00038260804,0.00008407754,0.000023101873],"category_scores_gemma":[0.000039998962,0.00011761087,0.00006134631,0.00029231122,0.000012976425,0.00044735588,0.000086464715,0.00008296651,0.000012815189],"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.00007297331,0.00018261177,0.00013992285,0.00004234701,0.000037300262,0.000004056273,0.008205677,0.39046428,0.34768564,0.030037265,0.00059559965,0.22253235],"study_design_scores_gemma":[0.0018200569,0.00020623262,0.00018309132,0.000034692566,0.000009027985,0.000007257008,0.000096563905,0.22013767,0.74234015,0.033540457,0.0014071605,0.00021764591],"about_ca_topic_score_codex":0.00015085467,"about_ca_topic_score_gemma":0.000058462116,"teacher_disagreement_score":0.3946545,"about_ca_system_score_codex":0.000071238435,"about_ca_system_score_gemma":0.0001148365,"threshold_uncertainty_score":0.47960323},"labels":[],"label_agreement":null},{"id":"W2127567620","doi":"10.1109/wcsp.2009.5371541","title":"Whitening-rotation-based semi-blind estimation of MIMO FIR channels","year":2009,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"MIMO; Finite impulse response; Algorithm; Impulse (physics); Channel (broadcasting); Computer science; Rotation (mathematics); Matrix (chemical analysis); Impulse response; Mathematics; Control theory (sociology); Artificial intelligence; Telecommunications","score_opus":0.01878609767296934,"score_gpt":0.28511692702328995,"score_spread":0.2663308293503206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127567620","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.02202737,0.000010891306,0.9695053,0.0034981573,0.000050732437,0.00020774598,5.89906e-7,0.00039716813,0.00430206],"genre_scores_gemma":[0.7428417,6.340276e-7,0.255793,0.0011338093,0.000011542338,0.000008299756,0.0000066468733,0.0000029165165,0.0002014205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991195,0.00004959182,0.0002607386,0.00020267461,0.00024652728,0.000120922596],"domain_scores_gemma":[0.9992503,0.00008288207,0.00013585441,0.00033387434,0.00015100118,0.000046121982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030003063,0.000092102724,0.00011813347,0.00019160341,0.000047943453,0.00009180535,0.00035540617,0.00006350435,0.00002762586],"category_scores_gemma":[0.000062959945,0.00008617273,0.000047210873,0.0004549714,0.000017726798,0.00046670297,0.00001988475,0.000067471396,0.000017780974],"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.000062770865,0.00062129594,0.00037775285,0.000049532646,0.000023667983,0.0000058523947,0.005277918,0.35039365,0.011878667,0.38289136,0.012363426,0.23605411],"study_design_scores_gemma":[0.0003174456,0.00016439291,0.0008785616,0.000020493137,0.0000021236651,0.0000012519082,0.0000095049945,0.8775579,0.109276816,0.011511035,0.00015275601,0.00010774926],"about_ca_topic_score_codex":0.000010902499,"about_ca_topic_score_gemma":0.0000019149306,"teacher_disagreement_score":0.72081435,"about_ca_system_score_codex":0.000016637214,"about_ca_system_score_gemma":0.00007237179,"threshold_uncertainty_score":0.3514022},"labels":[],"label_agreement":null},{"id":"W2128021726","doi":"10.1109/icassp.2004.1326313","title":"Joint AR parameter and order estimation in a general noise environment","year":2004,"lang":"en","type":"article","venue":"","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":"University of Waterloo","funders":"","keywords":"Autoregressive model; Noise (video); Joint (building); Computer science; Estimation theory; Noise measurement; Estimation; Algorithm; Statistics; Value noise; Mathematics; Mathematical optimization; Artificial intelligence; Noise reduction; Noise floor; Engineering","score_opus":0.015231933322629178,"score_gpt":0.23806293804113052,"score_spread":0.22283100471850134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128021726","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.21321456,0.000011196232,0.78438497,0.0016626233,0.000009514723,0.00010614735,9.614167e-8,0.00007736538,0.0005335035],"genre_scores_gemma":[0.4583831,0.000008115653,0.540839,0.0006701362,0.0000025489908,0.0000141870505,6.2348886e-7,0.0000020286345,0.000080224294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994964,0.000022820568,0.00012785042,0.00017679241,0.000086645305,0.00008949701],"domain_scores_gemma":[0.9997427,0.000010272742,0.000025358622,0.00018351083,0.000006663687,0.000031499847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014023329,0.000060331644,0.000063987325,0.00007554329,0.00001921448,0.0000700773,0.00009061274,0.000032720724,0.000012531132],"category_scores_gemma":[0.000012130684,0.000052335825,0.00001093437,0.000087423556,0.000018695884,0.00029107835,0.000076969685,0.0000540778,0.000025281908],"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.000008702242,0.0004924038,0.0015761539,0.00001744533,0.0000151816685,0.000021443233,0.008386412,0.13507086,0.012181045,0.7235089,0.00045517035,0.11826631],"study_design_scores_gemma":[0.0009031074,0.00016452244,0.02625338,0.000017147056,0.000002468233,0.00002266139,0.000016623399,0.79065996,0.047516808,0.13311398,0.0010177062,0.00031165525],"about_ca_topic_score_codex":0.000071730974,"about_ca_topic_score_gemma":0.0000119397455,"teacher_disagreement_score":0.6555891,"about_ca_system_score_codex":0.000039616756,"about_ca_system_score_gemma":0.000017097846,"threshold_uncertainty_score":0.2134193},"labels":[],"label_agreement":null},{"id":"W2128041078","doi":"10.1109/dspws.1996.555521","title":"Cumulant based phase estimation for 1-D and 2-D nonminimum phase systems by Fourier series based allpass model","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"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":"All-pass filter; Control theory (sociology); Mathematics; LTI system theory; Gaussian; Algorithm; Gaussian noise; Linear system; Parseval's theorem; Estimation theory; Phase (matter); Fourier series; Fourier transform; Applied mathematics; Computer science; Fourier analysis; Mathematical analysis; Physics; High-pass filter; Fractional Fourier transform; Filter (signal processing)","score_opus":0.039972066347089594,"score_gpt":0.31033125223923463,"score_spread":0.270359185892145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128041078","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.0031573453,0.000063253894,0.99222386,0.0026236763,0.000059088674,0.00074993004,0.000060714032,0.0005651299,0.0004970044],"genre_scores_gemma":[0.43627918,0.0000029131252,0.56143343,0.0010624301,0.000014953225,0.00021470468,0.000046128516,0.000015420988,0.00093085633],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987327,0.00006286832,0.00031821453,0.0003932953,0.00025746576,0.0002354942],"domain_scores_gemma":[0.99904764,0.00013292512,0.0001241239,0.00044355655,0.00012502041,0.00012675016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038523285,0.00018682762,0.00020840755,0.00012863922,0.00018439922,0.00049939664,0.00028916306,0.00009486284,0.000018684683],"category_scores_gemma":[0.00004482492,0.00016919465,0.00005137628,0.00015235732,0.000053534037,0.000921381,0.000035421464,0.00006889177,0.0000064562596],"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.00041655707,0.005687272,0.00002096349,0.0005959619,0.00010081588,0.000021593116,0.0035099664,0.23367664,0.034079526,0.23056489,0.39889106,0.09243476],"study_design_scores_gemma":[0.0029757512,0.00042363786,1.3719726e-7,0.000017874476,0.000009458008,0.0000040310847,0.000007706339,0.97162676,0.018527305,0.000652391,0.0055366014,0.0002183243],"about_ca_topic_score_codex":0.000013018535,"about_ca_topic_score_gemma":0.0000027919677,"teacher_disagreement_score":0.73795015,"about_ca_system_score_codex":0.000030742885,"about_ca_system_score_gemma":0.00005217838,"threshold_uncertainty_score":0.6899558},"labels":[],"label_agreement":null},{"id":"W2128265580","doi":"10.1109/tasl.2006.876865","title":"Variational Probabilistic Speech Separation Using Microphone Arrays","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Audio Speech and Language Processing","topic":"Blind Source Separation 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":"University of Toronto","funders":"","keywords":"Computer science; Source separation; Probabilistic logic; Independent component analysis; Algorithm; Noise (video); Blind signal separation; Maximum a posteriori estimation; Speech enhancement; Speech recognition; Microphone; Posterior probability; Artificial intelligence; Bayesian probability; Mathematics; Noise reduction; Statistics","score_opus":0.01237606394772605,"score_gpt":0.27025188262035493,"score_spread":0.2578758186726289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128265580","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.06792541,0.00021804211,0.9303238,0.0002495216,0.00011428205,0.00023693862,0.0000070380556,0.00039368053,0.0005313279],"genre_scores_gemma":[0.66457474,0.0000057042876,0.3347734,0.0002243804,0.00007123969,0.000015306423,0.0000047651656,0.000014252762,0.00031621993],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986349,0.000092201895,0.00029788524,0.00042716454,0.00030660728,0.00024126576],"domain_scores_gemma":[0.9993748,0.000057532125,0.0001390063,0.00024212316,0.00012246362,0.00006406129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035529013,0.00019574228,0.00017025796,0.0002365994,0.00036622252,0.0004035478,0.00019872519,0.00010982537,0.000030450881],"category_scores_gemma":[0.000007957102,0.00019440881,0.000054132288,0.00051042344,0.000056591605,0.0007040798,0.000003417915,0.00023934721,0.0000137222805],"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.000051612667,0.0006004109,0.00003038571,0.00019090247,0.000032556574,0.000069758935,0.004247073,0.027755342,0.5939127,0.0011470204,0.00021271151,0.37174952],"study_design_scores_gemma":[0.00052616757,0.00008522115,0.0001079435,0.00009965576,0.000032525466,0.00028520025,0.00013815236,0.36235964,0.63288593,0.0028628577,0.00017548146,0.00044122877],"about_ca_topic_score_codex":0.00017354699,"about_ca_topic_score_gemma":0.00013458049,"teacher_disagreement_score":0.59664935,"about_ca_system_score_codex":0.000090985304,"about_ca_system_score_gemma":0.00015638261,"threshold_uncertainty_score":0.79277617},"labels":[],"label_agreement":null},{"id":"W2128478374","doi":"10.1109/issse.2007.4294415","title":"Blind Signal Separation in MIMO OFDM Systems Using ICA and Fractional Sampling","year":2007,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Dalhousie University","funders":"","keywords":"Blind signal separation; Orthogonal frequency-division multiplexing; Independent component analysis; MIMO; Algorithm; Oversampling; MIMO-OFDM; Computer science; Sampling (signal processing); Additive white Gaussian noise; Nyquist–Shannon sampling theorem; Channel (broadcasting); SIGNAL (programming language); Mathematics; Telecommunications; Artificial intelligence; Bandwidth (computing)","score_opus":0.06826730094591485,"score_gpt":0.36216441718781445,"score_spread":0.2938971162418996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128478374","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.16611798,0.00005237912,0.83103424,0.000107036256,0.00007297683,0.00014532951,3.8736428e-7,0.00012319558,0.0023464723],"genre_scores_gemma":[0.85942835,0.0000028472002,0.1402321,0.00018455686,0.000055230685,0.0000034051295,0.000002174583,0.0000043011946,0.000087032415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990454,0.000049845552,0.00028016666,0.00024062363,0.000223689,0.00016033238],"domain_scores_gemma":[0.9994986,0.00015449869,0.00008180571,0.00014031342,0.00007101595,0.000053770407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010167079,0.00008326154,0.00010110884,0.00025750045,0.000081125254,0.00021991397,0.00013911705,0.0000854464,0.000010580888],"category_scores_gemma":[0.000015184342,0.00008213019,0.000017438106,0.00031430382,0.000019843796,0.0007096924,0.000058517722,0.00013017864,0.000007223065],"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.00014185095,0.00040786614,0.020303864,0.00007329846,0.00004698614,0.000037722322,0.0050702034,0.047179446,0.11776754,0.7861436,0.0008460226,0.021981578],"study_design_scores_gemma":[0.0004978548,0.000062972525,0.007777754,0.000042641048,0.0000031137245,0.00006313759,0.00016808668,0.9768201,0.008323903,0.0026489068,0.0033273713,0.00026417067],"about_ca_topic_score_codex":0.00017705424,"about_ca_topic_score_gemma":0.00006917603,"teacher_disagreement_score":0.92964065,"about_ca_system_score_codex":0.00006149748,"about_ca_system_score_gemma":0.000055969904,"threshold_uncertainty_score":0.3349172},"labels":[],"label_agreement":null},{"id":"W2128933775","doi":"10.1109/iembs.2001.1020616","title":"Single channel analysis of electromagnetic brain signals through ICA in a dynamical systems framework","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":18,"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; Montreal Neurological Institute and Hospital; Aston University","keywords":"Independent component analysis; Electroencephalography; Computer science; Embedding; Artifact (error); Channel (broadcasting); SIGNAL (programming language); Pattern recognition (psychology); Basis (linear algebra); Artificial intelligence; Speech recognition; Mathematics; Neuroscience; Telecommunications; Psychology","score_opus":0.017748930203756424,"score_gpt":0.2819675356966872,"score_spread":0.26421860549293075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128933775","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.066257395,0.000157105,0.9260939,0.003586308,0.000020155203,0.00017979775,0.0000011901614,0.00021991435,0.0034842798],"genre_scores_gemma":[0.8787003,0.0000058775986,0.12006029,0.0009767495,0.000018046985,0.00002171689,0.0000026250423,0.000005973137,0.00020839369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984698,0.00020268146,0.00044798042,0.00033208157,0.0002969562,0.00025046172],"domain_scores_gemma":[0.998919,0.00035014775,0.00012425796,0.0004937254,0.00006894346,0.00004392381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045656544,0.00012007719,0.00035746093,0.00044243294,0.000023514944,0.000098981414,0.0005814207,0.00014044385,0.00003892967],"category_scores_gemma":[0.00009051894,0.00011054582,0.00011345224,0.0025243568,0.000036496833,0.00034185091,0.000093187286,0.00016705832,0.00000927403],"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.00001591118,0.0010286829,0.00028158232,0.00002865288,0.00031392858,0.0000076632705,0.008063981,0.03666758,0.03445594,0.913308,0.0014495554,0.0043785265],"study_design_scores_gemma":[0.00010984162,0.00027927582,0.00063672,0.00003085349,0.00003191875,0.00000270882,0.000049115253,0.980242,0.0086140735,0.00937831,0.00044515426,0.00018002186],"about_ca_topic_score_codex":0.00015934934,"about_ca_topic_score_gemma":0.00016994044,"teacher_disagreement_score":0.9435744,"about_ca_system_score_codex":0.00007188976,"about_ca_system_score_gemma":0.00003617935,"threshold_uncertainty_score":0.4507928},"labels":[],"label_agreement":null},{"id":"W2129701183","doi":"10.1109/cca.1992.269720","title":"On-line estimation of a dynamic model for basis weight variations in paper machines","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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 British Columbia","funders":"","keywords":"Basis (linear algebra); Estimator; Kalman filter; Line (geometry); Computer science; Extended Kalman filter; Exponential function; Process (computing); Forgetting; Estimation theory; Algorithm; Artificial intelligence; Mathematics; Statistics","score_opus":0.018858146004836436,"score_gpt":0.2984498344866907,"score_spread":0.2795916884818543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129701183","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.0028734163,0.0000049659534,0.992632,0.0010986624,0.000024063844,0.00022503575,0.0000036766364,0.00010094862,0.0030372876],"genre_scores_gemma":[0.526701,0.0000016279663,0.4726703,0.0003141327,8.105955e-7,0.000038573206,0.000003141804,0.0000028967204,0.0002675545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994097,0.000040347957,0.00021175736,0.00015566927,0.00010135967,0.00008120643],"domain_scores_gemma":[0.9994841,0.00013795696,0.000059273985,0.00024226216,0.00005828629,0.00001812484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029989204,0.000065506414,0.00009235624,0.00016085127,0.000028484828,0.000023186807,0.00016757491,0.000042490923,0.000016672395],"category_scores_gemma":[0.0001220374,0.00005659108,0.000033812164,0.00024629163,0.000008194121,0.00031672674,0.0000158369,0.00004189671,0.0000026733974],"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.000002031426,0.00007784135,0.0000120108525,0.0000043922378,0.0000022143042,4.6168726e-8,0.00027390217,0.12726367,0.00015840554,0.86498404,0.00010122215,0.0071202554],"study_design_scores_gemma":[0.00015756027,0.00002852307,0.00008790821,0.0000050257477,0.0000013519414,3.6133414e-7,9.716192e-7,0.7427301,0.00096755824,0.2559603,0.000014208273,0.000046145215],"about_ca_topic_score_codex":0.000013182331,"about_ca_topic_score_gemma":0.00007156185,"teacher_disagreement_score":0.6154664,"about_ca_system_score_codex":0.000026299864,"about_ca_system_score_gemma":0.000054974007,"threshold_uncertainty_score":0.23077174},"labels":[],"label_agreement":null},{"id":"W2129833203","doi":"10.48550/arxiv.1206.6385","title":"Improved Estimation in Time Varying Models","year":2012,"lang":"en","type":"article","venue":"arXiv (Cornell University)","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":"McGill University","funders":"","keywords":"Computer science; Context (archaeology); Artificial intelligence; Extension (predicate logic); Variance (accounting); Machine learning; Task (project management); Set (abstract data type); Data modeling; Basis (linear algebra); Data mining; Mathematics","score_opus":0.05787992779980283,"score_gpt":0.19550072534186688,"score_spread":0.13762079754206405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129833203","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.14585286,0.000007901172,0.8493236,0.00004905911,0.000030936564,0.00009822168,3.3117067e-7,0.00024220679,0.004394914],"genre_scores_gemma":[0.9796114,0.000004656542,0.01971455,0.00014691999,0.000008312979,5.166329e-7,0.0000018036279,0.0000051229936,0.0005067404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993735,0.00007140745,0.00009098781,0.0002147937,0.00004382992,0.00020550158],"domain_scores_gemma":[0.9994835,0.00004438715,0.000056617537,0.00031338376,0.000029787803,0.000072294926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032174197,0.0000808953,0.000084000196,0.00017686986,0.000049045648,0.000045233,0.00046691438,0.000062137595,0.000010582506],"category_scores_gemma":[0.000012071558,0.00009529448,0.00003226651,0.0005171722,0.000018295192,0.0023390686,0.00016444015,0.0001021558,0.00007650808],"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.000011869093,0.00014941394,0.0015960783,0.000006066567,0.000008625757,0.000009793837,0.001279487,0.17505264,0.0013064769,0.81857604,0.00009778965,0.0019056973],"study_design_scores_gemma":[0.00018075532,0.000014895506,0.00035746038,0.000006354987,0.0000026117275,0.0000015867624,0.0000053696303,0.97281456,0.0013249037,0.025146013,0.00003656694,0.00010894196],"about_ca_topic_score_codex":0.000032854412,"about_ca_topic_score_gemma":0.0000024824517,"teacher_disagreement_score":0.83375853,"about_ca_system_score_codex":0.00007959343,"about_ca_system_score_gemma":0.000025822288,"threshold_uncertainty_score":0.38859963},"labels":[],"label_agreement":null},{"id":"W2129859993","doi":"10.1109/iembs.2007.4353772","title":"Fast Multichannel Blind System Identification using Laguerre Filters","year":2007,"lang":"en","type":"article","venue":"Conference proceedings","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Laguerre polynomials; Finite impulse response; Computer science; System identification; Algorithm; Infinite impulse response; Monte Carlo method; Impulse response; Digital filter; Channel (broadcasting); Basis (linear algebra); Identification (biology); Signal processing; Impulse (physics); Electronic engineering; Mathematics; Digital signal processing; Data modeling; Telecommunications; Engineering; Statistics; Physics; Bandwidth (computing)","score_opus":0.0494630678442963,"score_gpt":0.2982170959140365,"score_spread":0.2487540280697402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129859993","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.20531946,0.000013576595,0.78996664,0.00018413013,0.00019051839,0.00027651724,0.0000010872002,0.00066374545,0.0033843117],"genre_scores_gemma":[0.94929445,0.0000023698592,0.05029686,0.00011339936,0.00006596534,0.000016186266,0.0000025346556,0.000012581318,0.00019563657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844295,0.000011413773,0.0004062572,0.00046718115,0.00034571497,0.0003264912],"domain_scores_gemma":[0.99869204,0.000030437288,0.00027342004,0.00022850624,0.000651673,0.00012395123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010825016,0.00017015378,0.00016251332,0.00028488174,0.00018033564,0.0006592895,0.00082041847,0.00012572286,0.000003825063],"category_scores_gemma":[0.00006886294,0.00017496769,0.000048787602,0.0005180222,0.00005834483,0.0012711593,0.00017598532,0.0001825318,0.0000456858],"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.00004433808,0.00012590729,0.0025316356,0.0002900831,0.00003412756,0.000012069739,0.03258327,0.00004120708,0.24841528,0.6851569,0.0006367608,0.030128436],"study_design_scores_gemma":[0.0006400611,0.000073730735,0.0034733817,0.0003168856,0.000020364394,0.00008978735,0.006221776,0.7104439,0.27545536,0.0020560902,0.0005820369,0.0006266543],"about_ca_topic_score_codex":0.000026098855,"about_ca_topic_score_gemma":0.0000043011955,"teacher_disagreement_score":0.743975,"about_ca_system_score_codex":0.000090399,"about_ca_system_score_gemma":0.000075083095,"threshold_uncertainty_score":0.7134975},"labels":[],"label_agreement":null},{"id":"W2130281184","doi":"10.1109/icassp.2002.5745435","title":"ICA for position and pose measurement from images with occlusion","year":2002,"lang":"en","type":"article","venue":"IEEE International Conference on Acoustics Speech and Signal Processing","topic":"Blind Source Separation Techniques","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":"Artificial intelligence; Computer vision; Independent component analysis; Principal component analysis; Subspace topology; Position (finance); Computer science; Pattern recognition (psychology); Translation (biology); Pose; Object (grammar); Occlusion; Representation (politics)","score_opus":0.06019130345146439,"score_gpt":0.28936226719730496,"score_spread":0.22917096374584056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130281184","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.015623998,0.000077966426,0.979118,0.0023387247,0.00006543722,0.000174277,0.000019335512,0.00010276064,0.0024795397],"genre_scores_gemma":[0.89814055,0.000048845992,0.101020895,0.00060662674,0.00008050388,0.000011515821,0.000006352631,0.0000075280814,0.00007716804],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988905,0.000024220384,0.00016320444,0.00032150044,0.00047600904,0.00012456128],"domain_scores_gemma":[0.9990925,0.000052493117,0.000113162736,0.0000881855,0.00058321975,0.00007041188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019558119,0.00013364301,0.00010830407,0.000103559556,0.00016201727,0.000580228,0.0002250715,0.00005588478,0.00002425615],"category_scores_gemma":[0.000022179936,0.00011242681,0.00001573509,0.000058131056,0.000054471682,0.00044924748,0.000043691765,0.00012067696,0.0000022017803],"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.00019523225,0.0002869888,0.00012054464,0.00005716112,0.000055262222,0.00004396282,0.0014479544,0.00023399983,0.575238,0.012008361,0.0018822058,0.40843034],"study_design_scores_gemma":[0.0006458772,0.00045957867,0.00032064295,0.00030978856,0.000017895347,0.000043192522,0.000058862373,0.9002942,0.07336986,0.024112456,0.00010758632,0.00026009543],"about_ca_topic_score_codex":0.00001179878,"about_ca_topic_score_gemma":0.0000030311985,"teacher_disagreement_score":0.9000602,"about_ca_system_score_codex":0.00004427371,"about_ca_system_score_gemma":0.000047015572,"threshold_uncertainty_score":0.5595152},"labels":[],"label_agreement":null},{"id":"W2130323377","doi":"10.5430/air.v1n1p18","title":"Swine influenza inspired optimization algorithm and its application to multimodal function optimization and noise removal","year":2012,"lang":"en","type":"article","venue":"Artificial Intelligence Research","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Benchmark (surveying); Algorithm; Optimization algorithm; Population; Computer science; Frame (networking); Convergence (economics); Noise (video); Optimization problem; Mathematical optimization; Mathematics; Artificial intelligence; Medicine","score_opus":0.1023294243914588,"score_gpt":0.3938904633862804,"score_spread":0.2915610389948216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130323377","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.012436576,0.00022182653,0.9848998,0.001122492,0.00008469398,0.0008470419,0.0000021926767,0.0002129961,0.00017235274],"genre_scores_gemma":[0.57279587,0.00009271459,0.42647368,0.00029214442,0.00015151083,0.00014077009,0.0000107829865,0.00001641621,0.000026151416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789995,0.00028560488,0.000370029,0.00046268638,0.00054446905,0.0004372315],"domain_scores_gemma":[0.9984786,0.00016794617,0.00007229994,0.00034310896,0.0006586771,0.00027934767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002332136,0.00014077795,0.00013309876,0.0004943513,0.0003525677,0.00030627046,0.00029990994,0.00013751972,0.000015902917],"category_scores_gemma":[0.00036942633,0.00014667331,0.000019961533,0.001258372,0.000076937926,0.0015055937,0.00033322145,0.0002521762,0.00006689353],"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.000049683353,0.00016689344,0.00011771547,0.000015457816,0.000009360683,0.0000010042098,0.0026172628,0.25116152,0.007834087,0.07881217,0.00003126505,0.65918356],"study_design_scores_gemma":[0.00003175662,0.00014871826,0.00016805244,0.000012536437,0.0000031514185,0.00000822098,0.00011577028,0.9605293,0.035991114,0.002277849,0.0005626327,0.00015088852],"about_ca_topic_score_codex":0.000112011934,"about_ca_topic_score_gemma":0.000008999776,"teacher_disagreement_score":0.7093678,"about_ca_system_score_codex":0.00007762089,"about_ca_system_score_gemma":0.000056915094,"threshold_uncertainty_score":0.5981164},"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":"W2130517475","doi":"10.1109/spawc.2001.923862","title":"Semi-blind spatio-temporal equalization and multiuser detection for DS-CDMA systems","year":2002,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"Blind equalization; Code division multiple access; Cyclostationary process; Multiuser detection; Subspace topology; Spread spectrum; Estimator; Computer science; Equalization (audio); Algorithm; Constant (computer programming); Asynchronous communication; Interference (communication); Synchronous CDMA; Channel (broadcasting); Speech recognition; Mathematics; Artificial intelligence; Telecommunications; Statistics; Decoding methods","score_opus":0.047434217587137124,"score_gpt":0.2777142832184267,"score_spread":0.2302800656312896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130517475","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.01704137,0.00007964808,0.9801639,0.00031249045,0.0001775077,0.00058075046,0.0000015263398,0.00053681823,0.0011060206],"genre_scores_gemma":[0.9666748,0.000014241519,0.031420045,0.000228712,0.000057674926,0.000097345575,0.0000074430905,0.000010390085,0.0014893267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912536,0.00007070955,0.00023551159,0.00027559302,0.00015768231,0.00013514813],"domain_scores_gemma":[0.99938387,0.00007711018,0.000105345716,0.000242706,0.0001371844,0.000053760425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033091,0.00010116293,0.000108402186,0.0001381708,0.000121990684,0.00030869007,0.00016265678,0.00009655207,0.000014123897],"category_scores_gemma":[0.00004556855,0.00009300951,0.000027868278,0.00021854523,0.000016822183,0.00071158394,0.00004828767,0.000051283598,0.0000134645825],"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.00013010176,0.00064501044,0.005752669,0.00048154456,0.00012346373,0.0000061612927,0.018041681,0.004894029,0.015525264,0.66423166,0.033835605,0.2563328],"study_design_scores_gemma":[0.00052530103,0.00011345247,0.00010745135,0.000010712251,0.0000033730612,0.0000071660106,0.00003703511,0.9643988,0.013182519,0.00069234235,0.020771615,0.00015023124],"about_ca_topic_score_codex":0.00008253835,"about_ca_topic_score_gemma":0.00010139423,"teacher_disagreement_score":0.9595048,"about_ca_system_score_codex":0.00002798421,"about_ca_system_score_gemma":0.0000074751347,"threshold_uncertainty_score":0.3792818},"labels":[],"label_agreement":null},{"id":"W2130811642","doi":"10.1109/glocom.1988.26065","title":"A comparison of synchronous and fractional-spaced DFEs in a multipath fading environment","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Multipath propagation; Fading; Baseband; Quadrature amplitude modulation; Computer science; Algorithm; QAM; Delay spread; Channel (broadcasting); Electronic engineering; Telecommunications; Bit error rate; Bandwidth (computing); Engineering","score_opus":0.024623685330300193,"score_gpt":0.30308679925437193,"score_spread":0.27846311392407175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130811642","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.17438973,0.00011927697,0.8221476,0.0001704991,0.000014622986,0.0001179994,1.9983813e-7,0.000052795214,0.0029872437],"genre_scores_gemma":[0.8507734,0.00001382885,0.14907184,0.000059929775,0.0000015458991,0.000010269678,2.5197562e-7,0.000002358579,0.00006656384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993858,0.00007086345,0.00016988761,0.0001643147,0.00012183258,0.00008732307],"domain_scores_gemma":[0.9996536,0.00008606526,0.000066719585,0.00015661732,0.000008713766,0.000028284187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002244935,0.00006082613,0.000122291,0.000098801254,0.000025084302,0.000024233817,0.000097141565,0.000036337467,0.000022933253],"category_scores_gemma":[0.000023951698,0.00005740152,0.000015044273,0.00008804474,0.00002433769,0.00019315908,0.000042256033,0.00007222414,0.0000046744526],"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.000016081314,0.0014162087,0.31076252,0.000051059935,0.000037815505,0.000008765699,0.030552099,0.010416393,0.027876573,0.58070767,0.0007550947,0.03739972],"study_design_scores_gemma":[0.00139824,0.00040997405,0.07762451,0.00006193039,0.0000065402337,0.000024115587,0.0013544679,0.67379206,0.22647607,0.006925657,0.011388852,0.0005375565],"about_ca_topic_score_codex":0.00004129153,"about_ca_topic_score_gemma":0.000019309886,"teacher_disagreement_score":0.6763837,"about_ca_system_score_codex":0.000032756165,"about_ca_system_score_gemma":0.00001844852,"threshold_uncertainty_score":0.23407662},"labels":[],"label_agreement":null},{"id":"W2130817578","doi":"10.1109/iscas.2008.4541371","title":"Perturbation analysis of subspace-based semi-blind MIMO channel estimation approaches","year":2008,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Concordia University","funders":"","keywords":"Weighting; Subspace topology; MIMO; Algorithm; Channel (broadcasting); Signal subspace; Closed-form expression; Computer science; Mathematics; Perturbation (astronomy); Constraint (computer-aided design); Mean squared error; Mathematical optimization; Noise (video); Statistics; Telecommunications; Physics; Artificial intelligence","score_opus":0.08108999856059006,"score_gpt":0.26672304090852206,"score_spread":0.185633042347932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130817578","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.06440014,0.000022106404,0.93084997,0.0010602754,0.00001884514,0.00015669741,0.0000013356137,0.0002777815,0.0032128566],"genre_scores_gemma":[0.8432265,0.0000039767206,0.15609394,0.00020969343,0.000006732117,0.000019937957,0.000034261575,0.0000044592784,0.00040052136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989546,0.000086934044,0.00025988882,0.00026759936,0.00031436986,0.00011662007],"domain_scores_gemma":[0.99910307,0.000098458535,0.00016896313,0.00045060238,0.00013262793,0.000046294463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033699383,0.000105617946,0.00020615035,0.0006768711,0.000081373044,0.00004062023,0.00032792735,0.00008187343,0.000018015706],"category_scores_gemma":[0.000049877803,0.00009474069,0.0001251094,0.0018290698,0.000048379014,0.00045841132,0.000038960454,0.00006581045,0.000005966559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006998657,0.00088432716,0.0051411632,0.000058764745,0.00058729324,0.0000056663803,0.017003162,0.732479,0.0019006078,0.22896555,0.00264602,0.010258461],"study_design_scores_gemma":[0.00018544636,0.000042466694,0.0038184,0.0000033396425,0.000044543747,0.0000012047242,0.000023537457,0.9645776,0.03033371,0.0008322191,0.000033345907,0.00010415026],"about_ca_topic_score_codex":0.000035303165,"about_ca_topic_score_gemma":0.000020466981,"teacher_disagreement_score":0.77882636,"about_ca_system_score_codex":0.000029595376,"about_ca_system_score_gemma":0.00007713474,"threshold_uncertainty_score":0.3863413},"labels":[],"label_agreement":null},{"id":"W2131002610","doi":"10.1109/nrc.1994.328095","title":"A generalized compound model for radar clutter","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"AUG Signals (Canada)","funders":"","keywords":"Clutter; Radar; Distribution (mathematics); Computer science; Gamma distribution; Algorithm; Artificial intelligence; Mathematics; Mathematical analysis; Statistics; Telecommunications","score_opus":0.0633332131932885,"score_gpt":0.2833827449850354,"score_spread":0.2200495317917469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131002610","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.0013750737,0.000025378136,0.98272204,0.005491784,0.00003638,0.00021827394,0.0000012430494,0.0005070373,0.009622792],"genre_scores_gemma":[0.17342155,0.0000056373733,0.8082456,0.008069664,0.000022388214,0.000043629443,0.0000013549147,0.0000065379068,0.01018365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937874,0.0000232293,0.00013553987,0.0002004819,0.0001170148,0.00014498136],"domain_scores_gemma":[0.9995063,0.00003292397,0.00003212234,0.00033582654,0.000050265942,0.00004255676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014007886,0.00007489964,0.00009161899,0.000055968423,0.0000670392,0.00012917454,0.00040731725,0.00004121409,0.00004932341],"category_scores_gemma":[0.000006101828,0.00006448001,0.00005780215,0.00009013177,0.000014454408,0.00031683373,0.00007004794,0.000042327443,0.00003819696],"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.000002399027,0.00006265833,0.0000056171693,0.000003786361,0.000007705688,8.026778e-7,0.001127049,0.0006157137,0.0012367278,0.7748814,0.21681263,0.0052435054],"study_design_scores_gemma":[0.00027664317,0.000021074076,0.000002508534,0.0000011454823,0.0000012046925,0.000003329642,0.000001307452,0.95034796,0.002953635,0.025961246,0.020336641,0.00009328518],"about_ca_topic_score_codex":0.000005507123,"about_ca_topic_score_gemma":0.000005687433,"teacher_disagreement_score":0.94973224,"about_ca_system_score_codex":0.00001459242,"about_ca_system_score_gemma":0.000008984733,"threshold_uncertainty_score":0.26294184},"labels":[],"label_agreement":null},{"id":"W2131295106","doi":"10.1109/icassp.2003.1202672","title":"Blind (training-like) decoder assisted beamforming for DS-CDMA systems","year":2004,"lang":"en","type":"article","venue":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","topic":"Blind Source Separation 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":"University of Toronto","funders":"","keywords":"Beamforming; Computer science; Trellis (graph); Algorithm; Code division multiple access; Channel (broadcasting); Convergence (economics); Set (abstract data type); Speech recognition; Bit error rate; Decoding methods; Telecommunications","score_opus":0.08539831685247783,"score_gpt":0.3255966102385221,"score_spread":0.24019829338604426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131295106","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.0074944743,0.00011516899,0.96759015,0.0005954223,0.0013314633,0.0011263359,0.00005594983,0.00063053734,0.0210605],"genre_scores_gemma":[0.706725,0.000101984384,0.28872234,0.0014824808,0.0005306206,0.00020487783,0.000040740953,0.000065064865,0.0021268802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958458,0.000027422038,0.0009913439,0.0011876756,0.0011858576,0.0007618863],"domain_scores_gemma":[0.99203265,0.000034059147,0.00080090377,0.00024065615,0.0065377634,0.00035394487],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010178525,0.00062401575,0.00058693293,0.0005679282,0.0005321147,0.0023853,0.0013485649,0.00043119353,0.000045630462],"category_scores_gemma":[0.00047687217,0.00059860834,0.00008976592,0.00080969743,0.00025603542,0.0016956758,0.00013827735,0.0006628339,0.000046813584],"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.000384383,0.00086295296,0.00016038776,0.00050688366,0.00025006226,0.000055813805,0.0052546887,0.0016694895,0.020620963,0.92800146,0.013458124,0.028774766],"study_design_scores_gemma":[0.003376419,0.00091398024,0.00012516558,0.0010041666,0.00007924251,0.0003913684,0.0015422675,0.95881534,0.009384034,0.008856093,0.0141071575,0.0014047612],"about_ca_topic_score_codex":0.000037018373,"about_ca_topic_score_gemma":0.000010029271,"teacher_disagreement_score":0.95714587,"about_ca_system_score_codex":0.00033221624,"about_ca_system_score_gemma":0.0012988539,"threshold_uncertainty_score":0.99964654},"labels":[],"label_agreement":null},{"id":"W2131329456","doi":"10.1109/vetecf.2004.1404735","title":"Sequential blind beamforming algorithm using combined CMA/LMS for wireless underground communications","year":2005,"lang":"en","type":"article","venue":"","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Multipath propagation; Beamforming; Adaptive beamformer; Computer science; Blind signal separation; Algorithm; Interference (communication); Blind equalization; Wireless; Channel (broadcasting); Smart antenna; Antenna (radio); Rayleigh fading; Electronic engineering; Telecommunications; Equalization (audio); Fading; Engineering; Omnidirectional antenna","score_opus":0.08279788486329027,"score_gpt":0.35276855499105647,"score_spread":0.2699706701277662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131329456","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.0045424267,0.000030385529,0.9874665,0.0046242084,0.000095344876,0.0004932846,0.000004404972,0.00055003166,0.0021933955],"genre_scores_gemma":[0.23005675,0.000012195864,0.768498,0.00084618013,0.00006371999,0.000043053624,0.000018968887,0.0000140122775,0.00044712928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880844,0.0000799429,0.00035506563,0.00027905864,0.00020786494,0.00026965232],"domain_scores_gemma":[0.9983591,0.00017715538,0.00014098639,0.0010677443,0.00017343539,0.00008158859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052978174,0.00014674757,0.00016858884,0.00015837184,0.00042379726,0.00036908963,0.0013530074,0.00009848267,0.000012179513],"category_scores_gemma":[0.000013342631,0.00014820768,0.00009132742,0.00032223098,0.00008235265,0.0012086132,0.00045163804,0.00015041901,0.000012320155],"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.000008384298,0.0002216438,0.000013080643,0.000007962466,0.000037915714,4.262552e-7,0.0009998659,0.00041711013,0.0031668553,0.8710837,0.0006176796,0.123425424],"study_design_scores_gemma":[0.0007088711,0.00006476871,0.000005709844,0.00001217465,0.000009765216,0.000011116054,0.00007158047,0.9601361,0.014080896,0.010217089,0.014469295,0.00021263193],"about_ca_topic_score_codex":0.00008784258,"about_ca_topic_score_gemma":0.00015991776,"teacher_disagreement_score":0.959719,"about_ca_system_score_codex":0.00013218516,"about_ca_system_score_gemma":0.00015980692,"threshold_uncertainty_score":0.6043734},"labels":[],"label_agreement":null},{"id":"W2132288502","doi":"10.1109/icassp.1996.547968","title":"Detection for binary transmission based on the empirical characteristic function","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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 Toronto","funders":"","keywords":"Detector; Binary number; Algorithm; Gaussian noise; Noise (video); Gaussian; Computer science; Transmission (telecommunications); Detection theory; Inference; Function (biology); Additive white Gaussian noise; Mathematics; Statistics; Artificial intelligence; White noise; Physics; Telecommunications; Image (mathematics)","score_opus":0.10169928848811066,"score_gpt":0.28730552055294584,"score_spread":0.18560623206483517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132288502","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.004585257,0.000004925627,0.9808236,0.011650383,0.00009709677,0.00030824746,4.528598e-7,0.00044550622,0.0020845816],"genre_scores_gemma":[0.98247474,0.0000022370657,0.011097481,0.005755595,0.000037138292,0.00010024837,0.0000016496386,0.000006452156,0.0005244823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993324,0.00008717974,0.00012169152,0.00020178118,0.00015019604,0.000106701256],"domain_scores_gemma":[0.9993927,0.00022016487,0.00003782964,0.0002723901,0.000041726245,0.000035199282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027275158,0.00007813571,0.000059432088,0.00007851328,0.00017471038,0.00008805787,0.00020166776,0.000058968624,0.00014040695],"category_scores_gemma":[0.000027111546,0.000048711037,0.000061572886,0.00020317678,0.000013173129,0.00017408007,0.000010719842,0.00009215389,0.000044635046],"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.00017205317,0.00065768766,0.000058386395,0.000030551753,0.000014062209,0.0000021344122,0.0012813692,0.00047842492,0.04460177,0.02612506,0.034768373,0.8918101],"study_design_scores_gemma":[0.00013479986,0.0005271493,0.0010887835,0.0000065830836,0.000002974557,0.0000010861964,0.0000044201474,0.9446253,0.015768746,0.0010355848,0.0367299,0.00007465166],"about_ca_topic_score_codex":0.0000012476636,"about_ca_topic_score_gemma":5.633989e-7,"teacher_disagreement_score":0.9778895,"about_ca_system_score_codex":0.000022335225,"about_ca_system_score_gemma":0.000008152524,"threshold_uncertainty_score":0.19863784},"labels":[],"label_agreement":null},{"id":"W2132399304","doi":"10.1109/pccc.1989.37388","title":"A sampling approach to real-time performance monitoring of digital transmission systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Nortel (Canada)","funders":"","keywords":"Knapsack problem; Sampling (signal processing); Computer science; Function (biology); Resource (disambiguation); Oversampling; Resource allocation; Mathematical optimization; Sample (material); Transmission (telecommunications); Sampling design; Algorithm; Mathematics; Bandwidth (computing); Telecommunications; Computer network","score_opus":0.03555302700430504,"score_gpt":0.26946575342834317,"score_spread":0.23391272642403813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132399304","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.088410825,0.000013207208,0.8297747,0.00002089439,0.00003737865,0.000168512,2.874757e-7,0.0002601949,0.08131403],"genre_scores_gemma":[0.69866,0.000007733788,0.3005586,0.0000047381454,0.000009309077,0.000012047818,4.2162503e-7,0.000005093419,0.0007420274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991792,0.000030080439,0.00021952149,0.00020892094,0.00021989133,0.0001423727],"domain_scores_gemma":[0.9994867,0.000031450392,0.000047130703,0.00029172515,0.000065164044,0.00007787169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002995332,0.00008447703,0.00012849942,0.00010218351,0.00004662404,0.00015373035,0.0003163006,0.000042682474,0.0000013886805],"category_scores_gemma":[0.00001145765,0.00007164506,0.000031426778,0.0003163469,0.000008256631,0.00057293294,0.000031400636,0.000053251835,0.000013285642],"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.000047427366,0.0011276527,0.022982948,0.0007432861,0.00008161511,0.0000025299812,0.022786064,0.058124475,0.17997701,0.596209,0.0011793198,0.11673867],"study_design_scores_gemma":[0.0007143718,0.0006875066,0.0034003241,0.0004879735,0.000011613922,0.000077068085,0.0007016584,0.4986801,0.4779955,0.001204642,0.01487331,0.0011659128],"about_ca_topic_score_codex":0.000008810471,"about_ca_topic_score_gemma":7.275966e-9,"teacher_disagreement_score":0.6102492,"about_ca_system_score_codex":0.000020902231,"about_ca_system_score_gemma":0.000033494638,"threshold_uncertainty_score":0.29216006},"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":"W2132733056","doi":"10.1109/icassp.2009.4959591","title":"Artifact removal in EEG using Morphological Component Analysis","year":2009,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of British Columbia","funders":"","keywords":"Electroencephalography; Artificial intelligence; Artifact (error); Pattern recognition (psychology); Computer science; Discrete cosine transform; Wavelet; Sparse approximation; Discrete wavelet transform; Wavelet transform; Noise reduction; Independent component analysis; Computer vision; Image (mathematics)","score_opus":0.04200411290979167,"score_gpt":0.31444364629628097,"score_spread":0.2724395333864893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132733056","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.4041578,0.0000071983395,0.59138626,0.00089278194,0.000009359602,0.000046412555,9.4085806e-8,0.00018292993,0.0033171682],"genre_scores_gemma":[0.7341964,0.000001568947,0.26451015,0.0012374304,0.000003958805,6.641326e-7,0.0000011208189,0.000001045188,0.000047625483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990649,0.00010408266,0.00022175751,0.00026369645,0.00018329227,0.0001622416],"domain_scores_gemma":[0.9995048,0.000028768085,0.00004713489,0.00034505708,0.00002626354,0.000047963604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038730504,0.00008002127,0.00017027272,0.00032894654,0.000033395645,0.000098444965,0.00036210107,0.000056269124,0.000049924613],"category_scores_gemma":[0.0000136411345,0.00006598403,0.000084570005,0.0011543955,0.000015319827,0.00024982457,0.00006546826,0.00010688567,0.000016474176],"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.00004288554,0.0016596965,0.02089783,0.000004056873,0.00018754494,0.0015753051,0.0025695972,0.069858186,0.1735738,0.6372042,0.0011701839,0.09125676],"study_design_scores_gemma":[0.00013170704,0.000069117974,0.113061704,0.000002858597,0.0000142814715,0.000052299773,0.000011577304,0.86989564,0.007099439,0.0090962,0.00038915582,0.00017599498],"about_ca_topic_score_codex":0.00006811312,"about_ca_topic_score_gemma":0.000020010293,"teacher_disagreement_score":0.8000375,"about_ca_system_score_codex":0.00004569045,"about_ca_system_score_gemma":0.000017143062,"threshold_uncertainty_score":0.26907507},"labels":[],"label_agreement":null},{"id":"W2133236557","doi":"10.1186/1471-2202-9-s1-o13","title":"An online Hebbian learning rule that performs independent component analysis","year":2008,"lang":"en","type":"article","venue":"BMC Neuroscience","topic":"Blind Source Separation Techniques","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 Ottawa","funders":"","keywords":"Hebbian theory; Computer science; Independent component analysis; Component (thermodynamics); Learning rule; Artificial intelligence; Leabra; Machine learning; Unsupervised learning; Artificial neural network","score_opus":0.0880832643873865,"score_gpt":0.29912295233847663,"score_spread":0.21103968795109013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133236557","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5455927,0.000007246025,0.45358965,0.00011045122,0.00008863376,0.00008078776,0.0000013510249,0.00037619378,0.00015296608],"genre_scores_gemma":[0.9644925,0.000027904363,0.03407376,0.0010254241,0.000023771114,0.000009484591,0.000007355453,0.000008995208,0.00033080977],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99755245,0.00023643448,0.00025146248,0.00076253805,0.00083438196,0.00036270832],"domain_scores_gemma":[0.99867946,0.000053579657,0.00016371271,0.0008151944,0.00007155602,0.00021649736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005327165,0.00017381438,0.00021692587,0.00044197697,0.00057908404,0.00028074742,0.0016997934,0.000055218152,0.000011177508],"category_scores_gemma":[0.00006413774,0.00015473236,0.00012525184,0.001697592,0.00017104374,0.0014119362,0.00032435768,0.00033024256,0.00001606865],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015250062,0.0010882396,0.8253934,0.000012536346,0.000014518413,0.000113736525,0.004663541,0.091966264,0.06511452,0.00556807,0.000099597266,0.005950333],"study_design_scores_gemma":[0.00009964259,0.00014030508,0.5263467,0.0000023572456,0.000007917693,0.000053854095,0.00004090938,0.46445113,0.0078893425,0.00007795477,0.00070322375,0.00018665002],"about_ca_topic_score_codex":0.00006621486,"about_ca_topic_score_gemma":0.0000694678,"teacher_disagreement_score":0.41951588,"about_ca_system_score_codex":0.00004059577,"about_ca_system_score_gemma":0.00013269235,"threshold_uncertainty_score":0.63098025},"labels":[],"label_agreement":null},{"id":"W2133732114","doi":"10.1109/icc.2004.1312959","title":"Information geometric approach to channel identification: a comparison with EM-MCMC algorithm","year":2004,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"McMaster University","funders":"McMaster University","keywords":"Markov chain Monte Carlo; Algorithm; Computation; Channel (broadcasting); Identification (biology); MIMO; Gaussian; Fading; Computer science; Monte Carlo method; Markov chain; Mathematics; Statistics; Decoding methods","score_opus":0.019353952242135257,"score_gpt":0.2571098980173534,"score_spread":0.23775594577521814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133732114","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.001265935,0.000010095727,0.98756117,0.001055789,0.00005349608,0.0004508267,0.0000014058453,0.000692227,0.008909049],"genre_scores_gemma":[0.4628978,0.0000012406471,0.53563887,0.0011848387,0.000016830943,0.000089388406,0.000017234972,0.0000042949646,0.00014948405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988279,0.000024506804,0.0003256633,0.00019807201,0.0004400198,0.0001838495],"domain_scores_gemma":[0.99902606,0.000014321237,0.00012740212,0.00049641205,0.00022875573,0.00010707135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038650638,0.00012012705,0.00013549598,0.0006818606,0.000109593304,0.00058320485,0.0006323683,0.000057295467,0.0000030720346],"category_scores_gemma":[0.000020595171,0.000099582365,0.00002725439,0.0024647466,0.000015403877,0.002052411,0.00011566771,0.000109555716,0.00023461302],"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.000018172539,0.0010176739,0.00010260713,0.000053495714,0.000058243026,0.0000014148928,0.052692648,0.056261983,0.000066381595,0.45127702,0.013057363,0.425393],"study_design_scores_gemma":[0.0035199157,0.0015729428,0.021743258,0.00007814429,0.0000320607,0.00018151238,0.006175465,0.83266425,0.080157414,0.01745241,0.034194473,0.0022281443],"about_ca_topic_score_codex":0.00005056077,"about_ca_topic_score_gemma":0.000005832369,"teacher_disagreement_score":0.7764023,"about_ca_system_score_codex":0.00007819438,"about_ca_system_score_gemma":0.00007186558,"threshold_uncertainty_score":0.5623858},"labels":[],"label_agreement":null},{"id":"W2133785369","doi":"10.1109/pacrim.1989.48367","title":"Orthogonal phase functions for full response noncoherent CPM systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Toronto","funders":"","keywords":"Frequency-shift keying; Continuous phase modulation; Orthogonality; Demodulation; Modulation index; Modulation (music); Phase (matter); Function (biology); Phase modulation; Algorithm; Computer science; Mathematics; Electronic engineering; Topology (electrical circuits); Control theory (sociology); Telecommunications; Engineering; Channel (broadcasting); Acoustics; Control (management); Physics; Electrical engineering; Artificial intelligence; Pulse-width modulation; Combinatorics","score_opus":0.03395236102219631,"score_gpt":0.3199865818282892,"score_spread":0.2860342208060929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133785369","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.015293716,0.00004037409,0.97475225,0.00053940475,0.00038840674,0.0005362463,0.0000080814525,0.00053788983,0.007903649],"genre_scores_gemma":[0.8479944,0.000001912974,0.14109845,0.00059009105,0.00005160192,0.00043974596,0.000007357257,0.00001414455,0.009802316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885523,0.0002497625,0.00023860575,0.00028234522,0.00018279915,0.00019124532],"domain_scores_gemma":[0.99897355,0.0002708739,0.00006937538,0.00043656424,0.00015674361,0.00009289915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010974782,0.00010572206,0.00011825179,0.00012310731,0.00013984127,0.00019466763,0.00026516104,0.00006220373,0.00003575601],"category_scores_gemma":[0.000121426834,0.000091805225,0.00007642065,0.00025227803,0.000019084093,0.0003022498,0.000031820593,0.00007444997,0.000072183284],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000201443,0.00033011448,0.000019476922,0.000010330478,0.000019815134,0.0000027831622,0.00029439875,0.00023203478,0.009303407,0.9520454,0.03406477,0.0034760316],"study_design_scores_gemma":[0.0018338002,0.0013001964,0.000054328757,0.000015185869,0.000009777565,0.000071737544,0.00015250305,0.051343493,0.010655968,0.0022980913,0.931922,0.00034290235],"about_ca_topic_score_codex":0.0000040284426,"about_ca_topic_score_gemma":0.000008605013,"teacher_disagreement_score":0.9497473,"about_ca_system_score_codex":0.000043798573,"about_ca_system_score_gemma":0.00017969866,"threshold_uncertainty_score":0.37437084},"labels":[],"label_agreement":null},{"id":"W2133849756","doi":"10.1109/iembs.2006.259374","title":"A Comparison of Adaptive and Non-Adaptive EEG Source Localization Algorithms Using a Realistic Head Model","year":2006,"lang":"en","type":"article","venue":"","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":"University of Alberta","funders":"","keywords":"Computer science; Electroencephalography; Head (geology); Algorithm; Artificial intelligence; Speech recognition; Neuroscience; Psychology","score_opus":0.05831988449641994,"score_gpt":0.33509981419897195,"score_spread":0.276779929702552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133849756","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.010899416,0.000044455363,0.9861189,0.000050736,0.000015078624,0.00022447518,0.0000032590021,0.00018515729,0.0024585102],"genre_scores_gemma":[0.63026434,0.0000011192711,0.36953685,0.00007874418,0.000008343953,0.0000046399014,0.0000028365057,0.000006850248,0.000096272015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988594,0.000069861366,0.0003455263,0.00030770592,0.00025656336,0.00016092631],"domain_scores_gemma":[0.9992472,0.0000599595,0.00019003906,0.00025828727,0.00019747863,0.000047038884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021579456,0.00013667266,0.0002482743,0.00014768989,0.000095483345,0.00006990323,0.00021601668,0.000084399246,0.000001455647],"category_scores_gemma":[0.000010005435,0.00013118537,0.0000341287,0.0003382175,0.00008998893,0.00036689534,0.00013526715,0.00009046573,0.0000010768462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024656849,0.00021384441,0.00094072445,0.00001475379,0.000014896647,0.000001295894,0.0043508266,0.7969799,0.0015827952,0.18959732,0.0006889067,0.005590052],"study_design_scores_gemma":[0.0001892791,0.00013255788,0.0002924657,0.000029530873,0.000008664536,0.0000036983354,0.00015381514,0.9832074,0.005378226,0.01043598,0.000024735285,0.00014366947],"about_ca_topic_score_codex":0.001848277,"about_ca_topic_score_gemma":0.00016786963,"teacher_disagreement_score":0.6193649,"about_ca_system_score_codex":0.00004888825,"about_ca_system_score_gemma":0.00007566393,"threshold_uncertainty_score":0.5349584},"labels":[],"label_agreement":null},{"id":"W2134175065","doi":"","title":"Half-Lives of EigenFlows for Spectral Clustering","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Markov chain; Cluster analysis; Spectral clustering; Stochastic matrix; Iterated function; Computer science; Mathematics; Markov process; Algorithm; Combinatorics; Artificial intelligence; Machine learning; Statistics","score_opus":0.03965903428927707,"score_gpt":0.2735942849124899,"score_spread":0.2339352506232128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134175065","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.0036282614,0.00003053112,0.9511555,0.0005372935,0.0000482533,0.00014732832,3.1052423e-7,0.00022743261,0.044225115],"genre_scores_gemma":[0.5604332,0.000006256189,0.43796784,0.0002008497,0.000017810664,0.000010489152,2.2435376e-7,0.0000032501594,0.0013601005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995233,0.000014025628,0.00013767845,0.00013346448,0.00008292163,0.000108623666],"domain_scores_gemma":[0.9996216,0.000043180735,0.000041112675,0.00023215887,0.000036174435,0.000025740006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011329496,0.000052351897,0.00008067078,0.00006100613,0.00002201651,0.00003677258,0.0003253415,0.000022125656,0.00017454597],"category_scores_gemma":[0.000012449669,0.000046976234,0.00005035692,0.00009959297,0.000014648354,0.00024315552,0.000063369735,0.000030502635,0.000011212751],"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.000008261213,0.0002387255,0.0002757447,0.00006761754,0.00003631546,0.0000031441946,0.011980076,0.0006170369,0.016860586,0.8733338,0.010766232,0.08581247],"study_design_scores_gemma":[0.00023573692,0.00020370854,0.0001566127,0.000010661292,0.0000023995433,0.000007875974,0.0000546724,0.8225393,0.16058388,0.008559201,0.0074893725,0.00015652989],"about_ca_topic_score_codex":0.000011444228,"about_ca_topic_score_gemma":0.000019448637,"teacher_disagreement_score":0.8647746,"about_ca_system_score_codex":0.000007870217,"about_ca_system_score_gemma":0.000005280957,"threshold_uncertainty_score":0.19156353},"labels":[],"label_agreement":null},{"id":"W2134465446","doi":"10.1109/tkde.2006.11","title":"Input variable selection: mutual information and linear mixing measures","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Independent component analysis; Mutual information; Computer science; Preprocessor; Dependency (UML); Data pre-processing; Data mining; Mixing (physics); Feature selection; Pattern recognition (psychology); Blind signal separation; Algorithm; Gaussian; Artificial intelligence; Channel (broadcasting)","score_opus":0.01617825178139467,"score_gpt":0.24222236436313338,"score_spread":0.2260441125817387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134465446","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.0012446691,0.00014285624,0.9973345,0.000057750003,0.00015623977,0.00009129879,0.000017783863,0.00041555485,0.000539362],"genre_scores_gemma":[0.81058663,0.00006501328,0.18904713,0.00006088649,0.000083028586,0.00001984734,0.000023817129,0.000010608243,0.00010305196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938285,0.00001886475,0.00018036808,0.00019638857,0.000095783755,0.0001257362],"domain_scores_gemma":[0.999519,0.000062173254,0.000026367321,0.00028838258,0.000058321024,0.000045756893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026167146,0.00011049381,0.000092918235,0.00021026896,0.00013799111,0.00017590557,0.00021450901,0.00006634773,0.0000025845848],"category_scores_gemma":[0.000006413752,0.00011582846,0.000011493642,0.0003172442,0.000012108218,0.00204226,0.000010618731,0.00016897933,0.000010145314],"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.000059908332,0.0006279327,0.00017869443,0.0005660611,0.00021470424,0.0000053916583,0.005714644,0.34522015,0.021432966,0.11568069,0.009177054,0.5011218],"study_design_scores_gemma":[0.00021263625,0.000046176818,0.000085835796,0.000032738037,0.000010462538,0.00002927102,0.000007494524,0.93826234,0.014012734,0.000118804164,0.047010418,0.00017109438],"about_ca_topic_score_codex":0.00004024157,"about_ca_topic_score_gemma":0.000026373544,"teacher_disagreement_score":0.80934197,"about_ca_system_score_codex":0.000019772435,"about_ca_system_score_gemma":0.00003757452,"threshold_uncertainty_score":0.47233474},"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":"W2134916849","doi":"10.1109/pimrc.2013.6666332","title":"Subspace decomposition approach to multi-user MIMO channel estimation in SC-FDE systems","year":2013,"lang":"en","type":"article","venue":"","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":"University of Ottawa; McGill University","funders":"","keywords":"MIMO; SC-FDE; Telecommunications link; Computer science; Spectral efficiency; Fading; Channel (broadcasting); Base station; Algorithm; Multi-user MIMO; Block (permutation group theory); Transmitter; Subspace topology; Bandwidth (computing); Equalization (audio); Electronic engineering; Computer network; Mathematics; Engineering","score_opus":0.02442722855170883,"score_gpt":0.2865546439667607,"score_spread":0.2621274154150519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134916849","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.020202937,0.0000172505,0.9729696,0.0012098777,0.00009166975,0.0009803765,3.7864882e-7,0.00051805895,0.004009848],"genre_scores_gemma":[0.59370965,9.899032e-7,0.40481082,0.00038949325,0.000009550616,0.000262927,0.000004969398,0.000006826013,0.00080479105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998865,0.00011926174,0.0002501079,0.00034456892,0.0002073035,0.0002137433],"domain_scores_gemma":[0.99929154,0.00003731375,0.00006360425,0.00039713824,0.0001122099,0.000098220466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003711419,0.00012554668,0.00014101481,0.00028929475,0.000054176624,0.00039495336,0.000439247,0.00008674722,0.0000045979855],"category_scores_gemma":[0.000021976399,0.00011534997,0.000026809896,0.00049222365,0.000010494392,0.0010894592,0.0001138018,0.00009854861,0.0002838928],"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.000012201347,0.0014583238,0.0012843637,0.00013285257,0.000028982557,0.0000039389897,0.019475898,0.2538636,0.011787132,0.67609525,0.027077598,0.008779846],"study_design_scores_gemma":[0.00018575271,0.000034225628,0.0043732063,0.000024568188,8.756154e-7,0.000006403038,0.000103915954,0.9903293,0.004192282,0.0004126965,0.00017364217,0.00016309005],"about_ca_topic_score_codex":0.0008866286,"about_ca_topic_score_gemma":0.00003938934,"teacher_disagreement_score":0.73646575,"about_ca_system_score_codex":0.000077697616,"about_ca_system_score_gemma":0.000022779423,"threshold_uncertainty_score":0.47038352},"labels":[],"label_agreement":null},{"id":"W2134965343","doi":"10.1109/ccece.2008.4564730","title":"Quantification and localization of features in time-frequency plane","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Feature extraction; Matrix decomposition; Deconvolution; Non-negative matrix factorization; Pattern recognition (psychology); Artificial intelligence; Computer science; Representation (politics); Time–frequency analysis; Feature (linguistics); SIGNAL (programming language); Independent component analysis; Matrix (chemical analysis); Algorithm; Computer vision; Physics","score_opus":0.014197883658870852,"score_gpt":0.20185190020525715,"score_spread":0.1876540165463863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134965343","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.2522988,0.00017314055,0.7441549,0.0011327477,0.000060648792,0.00042766784,0.000004561407,0.00026830495,0.0014792755],"genre_scores_gemma":[0.992196,0.00014633125,0.007397146,0.00018334237,0.000017698176,0.000015775737,0.000005058311,0.00000794755,0.000030704494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989166,0.000012348608,0.0002423216,0.00037123205,0.00018128865,0.0002761561],"domain_scores_gemma":[0.99939275,0.000038979713,0.000069359565,0.000107986,0.000178039,0.00021287442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015053082,0.00017094519,0.00022272728,0.0005160395,0.00006756692,0.00015786152,0.00033829536,0.000121352234,0.000004492478],"category_scores_gemma":[0.000035525823,0.00017592937,0.000015998015,0.0004909407,0.0000497417,0.0003403402,0.000043775006,0.00023468255,0.0000023978896],"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.000009651434,0.00005382468,0.014691592,0.00006560778,0.000013544096,0.000016473197,0.0025507177,0.00023795236,0.0037082855,0.95418555,0.0003666874,0.024100097],"study_design_scores_gemma":[0.00020004259,0.00022492585,0.04754438,0.000111005626,0.000002491205,0.000074038035,0.000005618374,0.9468097,0.0019899001,0.0026267576,0.00014180111,0.00026933075],"about_ca_topic_score_codex":0.0014346134,"about_ca_topic_score_gemma":0.00030301602,"teacher_disagreement_score":0.9515588,"about_ca_system_score_codex":0.000052842184,"about_ca_system_score_gemma":0.0002173595,"threshold_uncertainty_score":0.7174191},"labels":[],"label_agreement":null},{"id":"W2135379468","doi":"10.1109/isbi.2012.6235739","title":"An adaptive complex independent component analysis to analyze dynamic contrast enhanced-MRI","year":2012,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Dynamic contrast-enhanced MRI; Independent component analysis; Dynamic contrast; Computer science; Imaging phantom; Component (thermodynamics); Contrast (vision); Data mining; Artificial intelligence; Magnetic resonance imaging; Nuclear medicine; Radiology; Physics; Medicine","score_opus":0.01977327231952674,"score_gpt":0.3057359176062447,"score_spread":0.28596264528671794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135379468","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.07381983,0.000019134686,0.9212151,0.00059843966,0.000067486886,0.000304511,0.000007508887,0.0005375454,0.0034304138],"genre_scores_gemma":[0.81868136,0.0000034945904,0.17960386,0.0015049052,0.000024622103,0.000033748704,0.00002297684,0.000008692564,0.00011633904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979559,0.00023757484,0.0003653015,0.00047613773,0.0005027134,0.00046234977],"domain_scores_gemma":[0.9983045,0.00006783172,0.00012421263,0.0008928281,0.00017576196,0.00043486658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006786477,0.00021235102,0.00036092274,0.00058353017,0.000103576625,0.00020661777,0.0009864687,0.000079141646,0.0002368461],"category_scores_gemma":[0.000008283354,0.00019306008,0.0001517099,0.0014281521,0.00003550044,0.0009543065,0.00022251555,0.00015061375,0.00015103682],"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.00016939854,0.0036038107,0.010421389,0.000012190403,0.003044333,0.000013124648,0.029571503,0.03231711,0.2352442,0.633496,0.0034112795,0.048695654],"study_design_scores_gemma":[0.00038141158,0.00044320285,0.21637447,0.0000055256955,0.00017124225,0.000005711167,0.00048538274,0.746139,0.032872874,0.00084219634,0.0015436418,0.00073531666],"about_ca_topic_score_codex":0.00021556257,"about_ca_topic_score_gemma":0.0007321922,"teacher_disagreement_score":0.74486154,"about_ca_system_score_codex":0.00014649416,"about_ca_system_score_gemma":0.000035242443,"threshold_uncertainty_score":0.7872762},"labels":[],"label_agreement":null},{"id":"W2135703095","doi":"10.1109/milcom.1991.258472","title":"Structures for polyspectra-based blind equalizers","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Toronto","funders":"","keywords":"Blind equalization; Equalization (audio); Computer science; Mean squared error; Algorithm; Equalizer; Noise (video); Phase (matter); Mathematics; Artificial intelligence; Statistics; Telecommunications; Channel (broadcasting); Image (mathematics)","score_opus":0.05866016278452943,"score_gpt":0.3057367401695959,"score_spread":0.24707657738506647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135703095","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.00096532993,0.000041537747,0.9803751,0.0038962844,0.00006944495,0.00023953809,0.0000015900561,0.00063590205,0.01377527],"genre_scores_gemma":[0.58448637,0.0000014938219,0.4110401,0.0034584384,0.000026173006,0.000026147902,0.000001403227,0.0000063912876,0.00095348415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926984,0.000032228505,0.00014154249,0.00022885979,0.0001551585,0.00017238238],"domain_scores_gemma":[0.99938667,0.00010251657,0.000046031484,0.00036071346,0.000048858965,0.000055209177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014961089,0.00008859013,0.00008785183,0.00011551843,0.000073513394,0.0001598321,0.00047680305,0.000055064975,0.00021232633],"category_scores_gemma":[0.00003046682,0.00007535143,0.00006595739,0.00019648336,0.000022159607,0.00021800332,0.00002727138,0.00005625067,0.000021445167],"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.000004546694,0.000030607185,0.000012039456,0.000004288506,0.000005806433,6.618725e-7,0.00036440167,0.00010251697,0.000915692,0.9685095,0.018599402,0.011450528],"study_design_scores_gemma":[0.0015557178,0.00032443766,0.00010317021,0.000005475374,0.000006418488,0.0000048844163,0.000028595397,0.5559922,0.26328224,0.12490477,0.053354993,0.000437094],"about_ca_topic_score_codex":0.000008345128,"about_ca_topic_score_gemma":0.0000069032144,"teacher_disagreement_score":0.84360474,"about_ca_system_score_codex":0.00001665888,"about_ca_system_score_gemma":0.00001803241,"threshold_uncertainty_score":0.30727422},"labels":[],"label_agreement":null},{"id":"W2136663225","doi":"10.1007/11424918_30","title":"Comparing Dimension Reduction Techniques for Document Clustering","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Cluster analysis; Computer science; Random projection; Dimensionality reduction; Dimension (graph theory); Projection (relational algebra); Pattern recognition (psychology); Document clustering; Projection pursuit; Clustering high-dimensional data; Data mining; Artificial intelligence; Benchmark (surveying); Reduction (mathematics); Algorithm; Mathematics","score_opus":0.024464175119349015,"score_gpt":0.28357909744573234,"score_spread":0.25911492232638333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136663225","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.000048908885,0.00016891636,0.99303204,0.0013078834,0.00083885464,0.0010274628,0.0000011478953,0.00081610057,0.0027586792],"genre_scores_gemma":[0.116707295,0.000049789047,0.88144416,0.00081455876,0.0005220409,0.000057423513,0.0000068714385,0.000037976075,0.0003598904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967284,0.000035394733,0.00062080915,0.0013784504,0.00071384397,0.0005230715],"domain_scores_gemma":[0.9979079,0.00018269278,0.00036757288,0.0011449116,0.0002791888,0.00011777972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014046293,0.00047455737,0.0005004507,0.0009603329,0.00029320145,0.00068396976,0.0019698755,0.00032526228,0.0000057816546],"category_scores_gemma":[0.00003648274,0.000468175,0.00014428605,0.00033944522,0.0002832251,0.0010728117,0.0012007145,0.00059330836,0.00000970933],"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.000011494826,0.000026167023,0.000005170756,0.000043406155,0.00000874602,0.0000053774334,0.0009808968,0.021955565,0.0013721563,0.04282139,0.000082081126,0.9326875],"study_design_scores_gemma":[0.00027776643,0.00035205772,0.000016950711,0.00073452754,0.00001071555,0.00011949298,2.7923966e-7,0.7430423,0.05859136,0.18445705,0.011428796,0.0009687376],"about_ca_topic_score_codex":0.000015223952,"about_ca_topic_score_gemma":0.00005121795,"teacher_disagreement_score":0.9317188,"about_ca_system_score_codex":0.00057393743,"about_ca_system_score_gemma":0.0002539447,"threshold_uncertainty_score":0.999777},"labels":[],"label_agreement":null},{"id":"W2137008936","doi":"10.1109/icdsp.1997.627988","title":"The multimodulus blind equalization algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":86,"is_retracted":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":"Blind equalization; Quadrature amplitude modulation; QAM; Algorithm; Constellation; Equalization (audio); Computer science; Transmission (telecommunications); Modulation (music); Constellation diagram; Telecommunications; Bit error rate; Acoustics; Decoding methods","score_opus":0.033862496531463046,"score_gpt":0.26974063896717043,"score_spread":0.23587814243570737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137008936","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.00007123411,0.00009151855,0.97267604,0.003060782,0.00008290633,0.000113395065,1.8773332e-7,0.0004900057,0.023413932],"genre_scores_gemma":[0.22335048,0.00015679175,0.7565044,0.0028376814,0.00008272554,0.000043468768,0.0000015572925,0.000012120136,0.01701076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993373,0.00007124633,0.00013248326,0.00015080323,0.0001842573,0.00012390406],"domain_scores_gemma":[0.9994664,0.00008461877,0.000042027725,0.00030498137,0.000068829555,0.000033105447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024626864,0.000057875193,0.000042674284,0.00003886441,0.00018797326,0.00028289657,0.00049687765,0.000035584122,0.0000500505],"category_scores_gemma":[0.00003280018,0.000037683476,0.000025377834,0.00026197982,0.00002421572,0.0003483715,0.00009241524,0.000059415783,0.00018737576],"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":[3.6549187e-7,0.000029922463,0.0000044474423,4.2857e-7,0.000003532142,7.834907e-7,0.0008623407,0.000037074427,0.00009379751,0.3139454,0.01209709,0.6729248],"study_design_scores_gemma":[0.00013636041,0.000022149867,0.000040041345,0.0000011064803,5.8863264e-7,0.0000029073315,0.00001581343,0.93651915,0.0037735861,0.0049123107,0.05450767,0.0000683129],"about_ca_topic_score_codex":0.000010558226,"about_ca_topic_score_gemma":0.000006757343,"teacher_disagreement_score":0.9364821,"about_ca_system_score_codex":0.000012791208,"about_ca_system_score_gemma":0.000006029665,"threshold_uncertainty_score":0.2727978},"labels":[],"label_agreement":null},{"id":"W2137650880","doi":"10.1109/iembs.2004.1403143","title":"Time-frequency analysis of visual evoked potentials by means of matching pursuit with chirplet atoms","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Time–frequency analysis; Matching pursuit; Short-time Fourier transform; Computer science; Speech recognition; SIGNAL (programming language); Evoked potential; Harmonics; Artificial intelligence; Fourier transform; Visual evoked potentials; Pattern recognition (psychology); Fundamental frequency; Harmonic; Computer vision; Fourier analysis; Acoustics; Mathematics; Physics; Psychology; Neuroscience","score_opus":0.00637468010022912,"score_gpt":0.2570111403888191,"score_spread":0.25063646028859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137650880","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.25755477,0.000030757605,0.73779917,0.00057385437,0.000006508533,0.00011961049,0.00000808242,0.00025797624,0.0036492574],"genre_scores_gemma":[0.8655883,0.0000054022084,0.13349858,0.00023787962,0.000008668165,0.00000583303,0.000013236434,0.000010352622,0.0006317355],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99844164,0.00010204776,0.000448939,0.0002918605,0.00054066343,0.00017486443],"domain_scores_gemma":[0.99893403,0.00005718459,0.0002953893,0.0004977945,0.00015468782,0.00006091993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005610361,0.00013442637,0.00040644215,0.0003972002,0.00004068408,0.00006178498,0.0007627641,0.00006364159,0.00017997276],"category_scores_gemma":[0.0000116834935,0.00010660532,0.00013645027,0.0012393456,0.00007439945,0.0005416085,0.00011104608,0.00007769908,0.000014146478],"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.000079863545,0.0022782336,0.0053386195,0.00007777538,0.0051083383,0.000008248346,0.015577853,0.015871588,0.6327578,0.2708501,0.010754353,0.04129726],"study_design_scores_gemma":[0.00080779195,0.00070112717,0.0037734278,0.000049720988,0.00064011937,0.0000080751815,0.00015388317,0.3755636,0.61209553,0.004744367,0.00077977893,0.00068257004],"about_ca_topic_score_codex":0.00020265355,"about_ca_topic_score_gemma":0.00009611677,"teacher_disagreement_score":0.60803354,"about_ca_system_score_codex":0.000023579754,"about_ca_system_score_gemma":0.00005291645,"threshold_uncertainty_score":0.43472388},"labels":[],"label_agreement":null},{"id":"W2137718389","doi":"10.1109/iscas.2007.378461","title":"An Identification Technique for Noisy ARMA Systems in Correlation Domain","year":2007,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Concordia University","funders":"","keywords":"Autocorrelation; Noise (video); Autoregressive model; Residual; SIGNAL (programming language); Algorithm; Autoregressive–moving-average model; Noise measurement; Frequency domain; Computer science; Mathematics; Spectral density; Signal-to-noise ratio (imaging); Speech recognition; Statistics; Noise reduction; Artificial intelligence","score_opus":0.015623308662140654,"score_gpt":0.3065361203779944,"score_spread":0.2909128117158537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137718389","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.007323361,0.0000133858875,0.9890226,0.00018665401,0.00014931259,0.001146708,8.200841e-7,0.00046321395,0.0016939436],"genre_scores_gemma":[0.7818654,0.0000010552466,0.21764266,0.00011132336,0.000025625275,0.00019300565,0.000011576812,0.00000648119,0.00014287824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989636,0.000074168995,0.00037977894,0.0002657924,0.00015809154,0.00015858181],"domain_scores_gemma":[0.99921864,0.00009191999,0.00012220019,0.0004129975,0.00010955986,0.00004469329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002959596,0.000077541066,0.0000880599,0.0003047875,0.000054752418,0.00016721404,0.00039036426,0.00010805254,0.0000016225944],"category_scores_gemma":[0.00002351529,0.00007759403,0.000024917592,0.00039216745,0.0000135075115,0.00086749595,0.000023366463,0.00008068071,0.000009455766],"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.000009239355,0.00009251092,0.00067567104,0.000013000878,0.0000016921618,0.0000012868647,0.0008864371,0.00052049424,0.12013189,0.8728785,0.00042358835,0.0043656747],"study_design_scores_gemma":[0.00070856826,0.0003144469,0.018168397,0.000056539153,0.0000037327713,0.000035543984,0.00049849413,0.4411399,0.44978976,0.08122254,0.0074961805,0.00056589575],"about_ca_topic_score_codex":0.000070913324,"about_ca_topic_score_gemma":0.00007936782,"teacher_disagreement_score":0.79165596,"about_ca_system_score_codex":0.000079867095,"about_ca_system_score_gemma":0.000028971403,"threshold_uncertainty_score":0.31641927},"labels":[],"label_agreement":null},{"id":"W2137939963","doi":"10.1109/ijcnn.1991.155308","title":"Mean-variance backpropagation: a connectionist learning algorithm with a selective attention mechanism","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Université Laval","funders":"","keywords":"Backpropagation; Artificial intelligence; Computer science; Connectionism; Rprop; Artificial neural network; Algorithm; Variance (accounting); Mean squared error; Machine learning; Asymptote; Gradient descent; Pattern recognition (psychology); Mathematics; Statistics; Types of artificial neural networks; Recurrent neural network","score_opus":0.013281376957580207,"score_gpt":0.22140425963745033,"score_spread":0.2081228826798701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137939963","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.0004799454,0.000015166826,0.97484547,0.0013225576,0.000059353984,0.00023748162,3.453944e-7,0.0010863881,0.021953275],"genre_scores_gemma":[0.5597897,0.0000104414885,0.43288124,0.0004211488,0.000039774666,0.00006140835,0.000002753563,0.000011535727,0.006781965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881405,0.00014606932,0.00016511805,0.00040089412,0.00029011536,0.00018376464],"domain_scores_gemma":[0.9992782,0.000042739248,0.00011790995,0.0002466467,0.00025836253,0.00005616798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027961974,0.00013005396,0.00011808171,0.00010294865,0.00033657133,0.00034130216,0.0002456431,0.00006362655,0.00011722405],"category_scores_gemma":[0.000017536258,0.00011362463,0.00003590856,0.0006413763,0.000029490731,0.00085637864,0.000053911943,0.00021994108,0.00014595171],"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.0000047754634,0.00012670411,0.00006999675,0.000006213741,0.000042843658,0.000012258681,0.0024140065,0.00018069391,0.0015881788,0.94144374,0.0012013722,0.0529092],"study_design_scores_gemma":[0.00055575924,0.0006230498,0.00024484273,0.000027651198,0.000009050105,0.00015655976,0.00017139559,0.9592828,0.020640226,0.0142646665,0.003667904,0.00035608737],"about_ca_topic_score_codex":0.000036477628,"about_ca_topic_score_gemma":0.000030477328,"teacher_disagreement_score":0.9591021,"about_ca_system_score_codex":0.00006826005,"about_ca_system_score_gemma":0.000025205401,"threshold_uncertainty_score":0.4633478},"labels":[],"label_agreement":null},{"id":"W2137996830","doi":"10.1109/tsa.2005.851941","title":"A blind channel identification-based two-stage approach to separation and dereverberation of speech signals in a reverberant environment","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Speech and Audio Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec","funders":"","keywords":"Reverberation; Blind signal separation; MIMO; Robustness (evolution); Computer science; Speech recognition; Source separation; Interference (communication); Channel (broadcasting); Signal processing; Acoustics; Algorithm; Telecommunications; Physics","score_opus":0.025129042935960907,"score_gpt":0.28828980738897314,"score_spread":0.26316076445301223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137996830","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.08473204,0.0000797886,0.9134051,0.0009650953,0.00001774718,0.000533304,0.00000696039,0.00007016841,0.00018979247],"genre_scores_gemma":[0.82665336,0.00003129181,0.1726519,0.00034174506,0.000018308674,0.00008449358,0.0000033956578,0.0000101982405,0.00020531965],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99850833,0.00009188668,0.0004478434,0.00047478706,0.00029956194,0.00017757458],"domain_scores_gemma":[0.9993989,0.00004681026,0.0001644547,0.00023810002,0.00006390897,0.000087852786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061450066,0.00017123956,0.00020595788,0.00040265662,0.00016637951,0.00021137724,0.00015643307,0.000080370715,0.0000035397177],"category_scores_gemma":[0.0000053784456,0.00017693272,0.00003450446,0.00042416307,0.000045109155,0.0007705496,0.0000036845058,0.00016545912,0.000008398028],"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.00013512869,0.00069770234,0.00002930424,0.00019694622,0.000019124347,0.0000030523177,0.0057415036,0.28922683,0.15027887,0.00018924734,0.00003706545,0.5534452],"study_design_scores_gemma":[0.00076821796,0.00008370834,0.0001580366,0.00008474734,0.0000101886435,0.000010543382,0.00006542321,0.33410844,0.6641907,0.00020812284,0.00011450229,0.00019734145],"about_ca_topic_score_codex":0.000035967372,"about_ca_topic_score_gemma":0.0000561991,"teacher_disagreement_score":0.7419213,"about_ca_system_score_codex":0.000073008756,"about_ca_system_score_gemma":0.00008390567,"threshold_uncertainty_score":0.72151065},"labels":[],"label_agreement":null},{"id":"W2138005451","doi":"10.1109/ccece.2007.227","title":"An Identification Technique for ARMA Systems in the Presence of Noise","year":2007,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Noise (video); Autocorrelation; Autoregressive model; Residual; Signal transfer function; Algorithm; Autoregressive–moving-average model; SIGNAL (programming language); Mathematics; Polynomial; Computer science; Least-squares function approximation; Colors of noise; Moving average; Spectral density; Speech recognition; Statistics; White noise; Digital signal processing; Artificial intelligence; Analog signal","score_opus":0.025929429710323994,"score_gpt":0.32719718021436167,"score_spread":0.3012677505040377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138005451","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.007784602,0.000016726386,0.98974705,0.00024242008,0.00004175797,0.0009888535,7.603526e-7,0.00010930854,0.0010685375],"genre_scores_gemma":[0.93737084,0.0000018174663,0.062272176,0.000102616046,0.000012547585,0.00018112561,0.0000015248324,0.0000026888927,0.000054643653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992141,0.00008946466,0.00027734874,0.00015287085,0.00016739845,0.000098775854],"domain_scores_gemma":[0.999053,0.00018615575,0.00010346458,0.00053184974,0.000108569126,0.000016946442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034291698,0.000046529392,0.00006361998,0.00012655025,0.000028521654,0.00008289663,0.0008551358,0.000044580745,5.573643e-7],"category_scores_gemma":[0.000043484873,0.00003318004,0.000020283727,0.00032639076,0.00002220168,0.00044343347,0.000024077952,0.000051499406,0.0000010513771],"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.000006381833,0.00012977635,0.00031884166,0.000028139351,0.0000014477702,6.640202e-7,0.0024223519,0.00015192949,0.25140288,0.7416796,0.00066570565,0.0031922546],"study_design_scores_gemma":[0.000110639434,0.00013024086,0.0058813887,0.000022218781,0.0000015913736,0.000009516881,0.0004383402,0.060492948,0.9214985,0.009968108,0.0013374358,0.0001090687],"about_ca_topic_score_codex":0.000098741926,"about_ca_topic_score_gemma":0.000034817203,"teacher_disagreement_score":0.92958623,"about_ca_system_score_codex":0.000012078412,"about_ca_system_score_gemma":0.000021097158,"threshold_uncertainty_score":0.15890692},"labels":[],"label_agreement":null},{"id":"W2138069825","doi":"10.1109/icecs.2009.5411004","title":"Robust estimation of LP parameters in white noise with unknown variance","year":2009,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Overdetermined system; Mathematics; Autoregressive model; Estimator; White noise; Noise (video); Applied mathematics; Colors of noise; Singular value decomposition; Linear least squares; Robustness (evolution); Statistics; Mathematical optimization; Algorithm; Computer science; Artificial intelligence","score_opus":0.0184445744418661,"score_gpt":0.24212630931587437,"score_spread":0.22368173487400828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138069825","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.036413837,0.0000054644543,0.9546815,0.0016431949,0.000012198776,0.00013773859,1.6436233e-7,0.0001630012,0.006942912],"genre_scores_gemma":[0.531404,0.0000012438768,0.46812844,0.00034915033,0.0000012460355,0.0000032931607,5.95638e-7,0.000001476317,0.00011056051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993319,0.0000420604,0.00018045846,0.00018449643,0.00015514776,0.00010594267],"domain_scores_gemma":[0.9994985,0.000029518616,0.00008034872,0.0003156137,0.00004805295,0.00002799399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002303048,0.00007268509,0.00010776206,0.00012596753,0.000015113872,0.00005147893,0.0002917474,0.000037297694,0.0000042380316],"category_scores_gemma":[0.00001804288,0.000059013968,0.000015614974,0.00049547205,0.000020171718,0.00055857975,0.000020893911,0.000069517075,0.000004237133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022130906,0.00020265076,0.0011554433,0.000009517246,0.0000050118556,0.00000625032,0.0018862878,0.60437214,0.00039458158,0.3402622,0.0005268384,0.051156923],"study_design_scores_gemma":[0.00034181649,0.0003230981,0.019559009,0.000052460407,0.00000220727,0.0000066382663,0.000011860466,0.9536068,0.016601754,0.009254399,0.00007584465,0.00016414894],"about_ca_topic_score_codex":0.000021307173,"about_ca_topic_score_gemma":0.00002850309,"teacher_disagreement_score":0.49499017,"about_ca_system_score_codex":0.000019850126,"about_ca_system_score_gemma":0.00004099108,"threshold_uncertainty_score":0.24065197},"labels":[],"label_agreement":null},{"id":"W2138178674","doi":"10.1109/tbme.2003.816076","title":"Temporally constrained ica: an application to artifact rejection in electromagnetic brain signal analysis","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Biomedical Engineering","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":257,"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":"Montreal Neurological Institute and Hospital; Aston University","keywords":"Independent component analysis; A priori and a posteriori; Artifact (error); SIGNAL (programming language); Computer science; Signal processing; Waveform; Pattern recognition (psychology); Blind signal separation; Artificial intelligence; Magnetoencephalography; Electroencephalography; Set (abstract data type); Speech recognition; Channel (broadcasting); Digital signal processing; Telecommunications","score_opus":0.007024912417257371,"score_gpt":0.24012103622165987,"score_spread":0.2330961238044025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138178674","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.028391527,0.000003092079,0.9697667,0.0009374984,0.00006876018,0.00026367515,0.0000026233565,0.00048597855,0.00008016248],"genre_scores_gemma":[0.9258238,0.00000203398,0.0736857,0.0003142347,0.000011115781,0.00012114024,0.000004899637,0.000011637987,0.00002544508],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854016,0.00010067628,0.00034360544,0.00042567909,0.00031746377,0.00027238892],"domain_scores_gemma":[0.9992296,0.000105829444,0.000039136714,0.00035355,0.000037907743,0.00023394411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056333997,0.0001588126,0.00019823639,0.0011989637,0.000057555986,0.00007427017,0.0002598503,0.00012862978,0.000033388143],"category_scores_gemma":[0.000019349905,0.00017110618,0.00008601939,0.0031715066,0.000027106043,0.0002733339,0.0000012366695,0.00028868014,0.000016851494],"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.000020898793,0.00076615677,0.000014814867,0.000015909267,0.00013114001,0.0000138396945,0.0011316279,0.3890631,0.53043073,0.008865098,0.000050234903,0.06949644],"study_design_scores_gemma":[0.00037559916,0.0007010367,0.0006533371,0.000015450933,0.00003110508,0.000017432221,0.000024957353,0.92178345,0.07428326,0.00026352046,0.0015032924,0.0003475897],"about_ca_topic_score_codex":0.00004742657,"about_ca_topic_score_gemma":0.000051574345,"teacher_disagreement_score":0.89743227,"about_ca_system_score_codex":0.000117047864,"about_ca_system_score_gemma":0.00007632311,"threshold_uncertainty_score":0.69775075},"labels":[],"label_agreement":null},{"id":"W2138587069","doi":"10.1109/acssc.1993.342339","title":"Recursive parameter estimation for partially observed Markov chains","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Alberta","funders":"","keywords":"Markov chain; Markov process; Computer science; Variable-order Markov model; Applied mathematics; Markov model; Mathematics; Continuous-time Markov chain; Algorithm; Mathematical optimization; Statistics","score_opus":0.07159037292271393,"score_gpt":0.27809117123733684,"score_spread":0.20650079831462292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138587069","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.002573391,0.00001780128,0.9876774,0.0051339124,0.00009779684,0.0004334326,0.0000015356023,0.0005403275,0.0035243873],"genre_scores_gemma":[0.23937994,0.000006854457,0.7560447,0.0016951484,0.000023531526,0.00013392545,0.000004704683,0.0000074127865,0.0027037757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991579,0.000057656544,0.00019676395,0.00025995975,0.00014426131,0.00018347043],"domain_scores_gemma":[0.9991711,0.00020451956,0.000077404635,0.00038553707,0.00010414261,0.0000573375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002653294,0.00009617384,0.00010529526,0.00006589754,0.00007695105,0.00016723432,0.00038767207,0.000066217704,0.00007100797],"category_scores_gemma":[0.00016947932,0.00008722347,0.000067675945,0.00017326442,0.000018960143,0.0005469266,0.000056003875,0.0000575876,0.000054441767],"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.000008449903,0.0001447825,0.000064210544,0.000014121842,0.000020540632,0.0000019457586,0.0024207265,0.00054698956,0.00027096862,0.78305566,0.04877257,0.16467904],"study_design_scores_gemma":[0.00021181957,0.00014251443,0.00021311094,0.000007162132,0.0000034214552,0.0000025331774,0.000008564671,0.95654976,0.0100277895,0.02816615,0.0045215744,0.00014561179],"about_ca_topic_score_codex":0.0000043299,"about_ca_topic_score_gemma":0.000009889142,"teacher_disagreement_score":0.9560028,"about_ca_system_score_codex":0.000024020736,"about_ca_system_score_gemma":0.0000126160885,"threshold_uncertainty_score":0.35568696},"labels":[],"label_agreement":null},{"id":"W2139288028","doi":"10.1109/icip.2005.1530540","title":"Tree structure search for matching pursuit","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McMaster University","funders":"","keywords":"Matching pursuit; Coding (social sciences); Computer science; Tree (set theory); Search tree; Coding tree unit; Matching (statistics); Tree structure; Algorithm; Random access; Computational complexity theory; Variable-length code; Code (set theory); Theoretical computer science; Artificial intelligence; Pattern recognition (psychology); Search algorithm; Decoding methods; Binary tree; Mathematics; Statistics; Compressed sensing","score_opus":0.0222566119975984,"score_gpt":0.3038164884829953,"score_spread":0.28155987648539693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139288028","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.010342718,0.00001206398,0.9710736,0.007862228,0.00003282804,0.00018694688,0.0000026297987,0.00045270514,0.010034238],"genre_scores_gemma":[0.48210895,8.7369364e-7,0.5150195,0.0016402765,0.00005462975,0.00000832063,0.000002393854,0.0000034824816,0.0011616035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993677,0.0000224736,0.00010044539,0.00018232658,0.00017317546,0.00015387124],"domain_scores_gemma":[0.9995647,0.000053371623,0.000018544586,0.00027134092,0.00005022912,0.000041817006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022968162,0.00006196931,0.000064280364,0.000067593995,0.000069578426,0.00021735462,0.0006065176,0.00004507732,0.000063233616],"category_scores_gemma":[0.0000051148118,0.000051556453,0.0000348502,0.00011338802,0.000009719576,0.00044560374,0.00010483006,0.0000800879,0.000023469433],"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.0000022661095,0.00001530865,0.000024591602,0.000004602549,0.0000048361017,2.8584847e-7,0.0015391342,0.00024477852,0.006638188,0.7019382,0.014040441,0.2755474],"study_design_scores_gemma":[0.0006439448,0.00018049577,0.0006797527,0.000009962962,0.0000039559836,0.000022818027,0.00013348238,0.14298698,0.6241809,0.094400644,0.13630602,0.0004509931],"about_ca_topic_score_codex":0.000008196371,"about_ca_topic_score_gemma":0.00005715134,"teacher_disagreement_score":0.61754274,"about_ca_system_score_codex":0.000016646738,"about_ca_system_score_gemma":0.000033021246,"threshold_uncertainty_score":0.21024111},"labels":[],"label_agreement":null},{"id":"W2139806954","doi":"10.1109/icip.2002.1040033","title":"Fractal image compression using MNLPC, MIC and H-MPC network library","year":2003,"lang":"en","type":"article","venue":"Proceedings - International Conference on Image Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Fractal compression; Iterated function system; Computer science; Decoding methods; Image compression; Fractal; Data compression; Fractal transform; Artificial neural network; Artificial intelligence; Pattern recognition (psychology); Algorithm; Principal component analysis; Mathematics; Image (mathematics); Image processing","score_opus":0.03526596097694376,"score_gpt":0.3055273453197024,"score_spread":0.2702613843427586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139806954","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.103790425,0.00029279533,0.67897815,0.0034868866,0.00038099193,0.00044313434,0.000006158055,0.0011682143,0.21145324],"genre_scores_gemma":[0.6671491,0.000049700095,0.33164302,0.00082549645,0.00009903987,0.000017795659,0.0000048977245,0.00002473464,0.00018616926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980617,0.000030436593,0.00038617253,0.0006531969,0.0005168018,0.00035169921],"domain_scores_gemma":[0.9988435,0.000045341567,0.00035894377,0.00013368917,0.00048078306,0.0001377681],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00038923012,0.00028627683,0.0002236773,0.00024431103,0.0003306917,0.002744542,0.0007883994,0.000118586104,0.00011023713],"category_scores_gemma":[0.0001329463,0.00027773326,0.000050476312,0.00035047447,0.00014363481,0.00584407,0.00032079348,0.0004429974,0.000016162146],"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.00007871791,0.00024883862,0.0035266476,0.00016829271,0.000045997444,0.000024186413,0.0030122374,0.000026102769,0.19728108,0.7600421,0.0032329683,0.03231288],"study_design_scores_gemma":[0.00090202544,0.00014792659,0.00097592134,0.0012717139,0.000020182844,0.00023588413,0.0004791336,0.71470344,0.13591143,0.13871011,0.0056304755,0.0010117409],"about_ca_topic_score_codex":0.0000039979764,"about_ca_topic_score_gemma":2.4501304e-7,"teacher_disagreement_score":0.71467733,"about_ca_system_score_codex":0.0000496256,"about_ca_system_score_gemma":0.00020117495,"threshold_uncertainty_score":0.99996746},"labels":[],"label_agreement":null},{"id":"W2140440049","doi":"","title":"Adaptive overrelaxed bound optimization methods","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":84,"is_retracted":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":"Speedup; Computer science; Maximization; Convergence (economics); Simple (philosophy); Mathematical optimization; Algorithm; Upper and lower bounds; Scheme (mathematics); Scaling; Factorization; Mathematics; Parallel computing","score_opus":0.033918670021478636,"score_gpt":0.33703805399594394,"score_spread":0.3031193839744653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140440049","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.000028783637,0.000028883023,0.85612845,0.00020107602,0.000086903055,0.000097376294,9.6202626e-8,0.0004200308,0.14300841],"genre_scores_gemma":[0.028684465,0.0000068439344,0.96886665,0.0009008336,0.0000056571207,0.000012354359,5.8244075e-7,0.000005308481,0.0015173382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990837,0.00033811526,0.00013079292,0.0002098934,0.000121238416,0.00011626193],"domain_scores_gemma":[0.9994209,0.00009427869,0.000050247076,0.0003154986,0.00007456561,0.000044537857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067867886,0.00007466999,0.00007892606,0.00007518955,0.00006817797,0.00014023644,0.00024511703,0.0000544917,0.00010870225],"category_scores_gemma":[0.000090170244,0.00006756948,0.00003271027,0.00032747156,0.000019260682,0.0005524809,0.000045433833,0.00007444641,0.000021917893],"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":[7.1975563e-7,0.000019389707,0.00000751378,4.033869e-7,0.000004467344,4.7526893e-7,0.00024986407,0.0066908174,0.0001155212,0.9869852,0.0009719312,0.004953691],"study_design_scores_gemma":[0.00021134016,0.00010483393,0.000057709498,0.000003949956,0.00000335376,0.000012146858,0.000053447813,0.8673234,0.05041347,0.06262023,0.018966084,0.00023001706],"about_ca_topic_score_codex":0.0000083812765,"about_ca_topic_score_gemma":0.00000177008,"teacher_disagreement_score":0.924365,"about_ca_system_score_codex":0.000028286786,"about_ca_system_score_gemma":0.00006160333,"threshold_uncertainty_score":0.27554035},"labels":[],"label_agreement":null},{"id":"W2140972142","doi":"10.1109/vetecf.2008.154","title":"Blind Polynomial Channel Estimation for OFDM Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Orthogonal frequency-division multiplexing; Channel (broadcasting); Polynomial; Algorithm; Computer science; SIGNAL (programming language); Blind equalization; Computational complexity theory; Bit error rate; Minimum mean square error; Modulation (music); Mean squared error; Mathematics; Mathematical optimization; Telecommunications; Statistics; Equalization (audio); Estimator","score_opus":0.049808517956853565,"score_gpt":0.2857428891260741,"score_spread":0.23593437116922053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140972142","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.0045600426,0.000024483383,0.98923856,0.000772865,0.00023476826,0.0004313856,0.0000014251646,0.00054519984,0.0041912613],"genre_scores_gemma":[0.82631207,0.0000037927277,0.17077422,0.0003508098,0.000082489234,0.000102873404,0.000005362901,0.0000065044223,0.0023618946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934036,0.000026625275,0.00017361775,0.0001905099,0.0001376287,0.00013128461],"domain_scores_gemma":[0.9994827,0.000059070084,0.0000640675,0.0002625016,0.00008641905,0.000045228437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022428155,0.000073702766,0.000096957185,0.00010347536,0.00012464427,0.000092037095,0.00031368667,0.00005987889,0.00000258209],"category_scores_gemma":[0.00002872207,0.00006639298,0.000040035342,0.00014483632,0.00001898244,0.00047484104,0.00004675863,0.000041836814,0.000031581],"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.00007784599,0.0003019373,0.00007952784,0.00007390796,0.00004571014,0.000008834155,0.0066948785,0.0145173315,0.0017654074,0.6747065,0.28647515,0.015252934],"study_design_scores_gemma":[0.00041956155,0.00009892288,0.00009856494,0.0000057386283,0.0000014784607,0.000033736585,0.0000132303885,0.9850092,0.007325752,0.00092220865,0.005949327,0.00012228782],"about_ca_topic_score_codex":0.000039198127,"about_ca_topic_score_gemma":0.0000024529616,"teacher_disagreement_score":0.9704919,"about_ca_system_score_codex":0.000022740009,"about_ca_system_score_gemma":0.00006083167,"threshold_uncertainty_score":0.2707427},"labels":[],"label_agreement":null},{"id":"W2141519055","doi":"10.1109/nnsp.1994.366012","title":"Neural-net based receiver structures for single- and multi-amplitude signals in interference channels","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of British Columbia","funders":"","keywords":"Phase-shift keying; Quadrature amplitude modulation; Computer science; QAM; Amplitude and phase-shift keying; Interference (communication); Channel (broadcasting); Bit error rate; Electronic engineering; Algorithm; Keying; Amplitude; Quadrature (astronomy); Telecommunications; Engineering; Physics","score_opus":0.08758057147094574,"score_gpt":0.2948109705839515,"score_spread":0.20723039911300578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141519055","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.02154031,0.000073314215,0.97601837,0.0012511817,0.00006987706,0.0003687306,0.0000024797814,0.00022585863,0.00044987642],"genre_scores_gemma":[0.8330722,0.0000045965453,0.16523549,0.0014664723,0.000011588673,0.000034144123,0.0000012876168,0.0000059128374,0.0001683105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910414,0.00007100341,0.00019936176,0.0003397324,0.00009550394,0.00019026254],"domain_scores_gemma":[0.9993961,0.00018556921,0.0000570829,0.00024530131,0.000060254333,0.00005570413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018176006,0.00012286688,0.00014039192,0.00015846656,0.000045642515,0.00022564735,0.00036844498,0.00006676023,0.00006415288],"category_scores_gemma":[0.000062865474,0.00010578067,0.000028764884,0.00017538009,0.000039114075,0.0004594078,0.000082308085,0.00008756227,0.0000028358543],"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.00015238677,0.0021598043,0.006701851,0.00035113367,0.00008452585,0.000057069145,0.035557415,0.024393223,0.25481224,0.13915172,0.021366514,0.5152121],"study_design_scores_gemma":[0.0004894652,0.00018779744,0.0005627948,0.000017443306,0.0000013067399,0.000003990063,0.000018113706,0.94651794,0.04797035,0.0035930052,0.0004556994,0.00018210018],"about_ca_topic_score_codex":0.000024069835,"about_ca_topic_score_gemma":0.000031120348,"teacher_disagreement_score":0.9221247,"about_ca_system_score_codex":0.000018156634,"about_ca_system_score_gemma":0.0000069153984,"threshold_uncertainty_score":0.43136108},"labels":[],"label_agreement":null},{"id":"W2141937678","doi":"10.1109/milcom.1992.244162","title":"Simulated annealing optimization in blind equalization","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Toronto","funders":"","keywords":"Maxima and minima; Blind equalization; Gradient descent; Simulated annealing; Mathematical optimization; Computer science; Stochastic gradient descent; Convergence (economics); Gradient method; Algorithm; Minification; Equalization (audio); Mathematics; Artificial intelligence; Artificial neural network; Decoding methods","score_opus":0.0290326412622156,"score_gpt":0.2962071686987487,"score_spread":0.2671745274365331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141937678","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.0059939963,0.000012269015,0.9810492,0.00018691013,0.000042235195,0.00014211485,8.0807865e-8,0.00034052003,0.012232701],"genre_scores_gemma":[0.73493624,0.0000051831917,0.26444116,0.00047197822,0.0000032582145,0.0000028355528,0.0000042738397,0.000004656505,0.00013040175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992287,0.00014613253,0.00020356993,0.00018499394,0.00012383389,0.000112750204],"domain_scores_gemma":[0.9995973,0.000045355468,0.00005010521,0.00020656067,0.00007288051,0.00002776279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047010035,0.000063311316,0.00006765244,0.00019549741,0.00003419657,0.00011477988,0.00016687192,0.000062633095,0.000044179316],"category_scores_gemma":[0.000106094856,0.00006338494,0.000014536443,0.00075661903,0.0000067540664,0.00057368574,0.000023443485,0.00005634853,0.000009756984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.488035e-7,0.000016982416,0.00017343629,9.92505e-7,7.3171435e-7,6.4693535e-7,0.00028986804,0.7205405,0.000081006125,0.2785869,0.000034975183,0.0002729952],"study_design_scores_gemma":[0.00030235003,0.000016934431,0.0000371184,0.000005422469,4.7202332e-7,0.0000011831818,0.0000128881065,0.9863283,0.008910946,0.0037339062,0.00056260184,0.00008785447],"about_ca_topic_score_codex":0.000018065193,"about_ca_topic_score_gemma":0.000009113429,"teacher_disagreement_score":0.7289423,"about_ca_system_score_codex":0.000026757163,"about_ca_system_score_gemma":0.00003811441,"threshold_uncertainty_score":0.2584763},"labels":[],"label_agreement":null},{"id":"W2142074662","doi":"10.1109/ijcnn.2008.4633770","title":"Some discrete Fourier kind transforms based on FLOS","year":2008,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Flos; Discrete Fourier transform (general); Fourier transform; Chirp; Mathematics; Fractional Fourier transform; Discrete-time Fourier transform; Noise (video); Computer science; Fourier analysis; Physics; Mathematical analysis; Artificial intelligence; Optics; Chemistry","score_opus":0.020520355769467282,"score_gpt":0.25137167844471003,"score_spread":0.23085132267524275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142074662","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.006071973,0.000007416763,0.9606831,0.0049867276,0.000070683294,0.00018004958,0.0000012625932,0.0006273463,0.027371405],"genre_scores_gemma":[0.82957125,0.00000868549,0.1611971,0.0070364745,0.00006315834,0.000025382225,0.0000029435828,0.000010365563,0.002084637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990516,0.000037590213,0.00015046918,0.00025430357,0.00032366355,0.00018241406],"domain_scores_gemma":[0.9993356,0.000044003624,0.000026925085,0.00048379123,0.00002881335,0.00008087126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016489839,0.00011063414,0.00010365151,0.00011731919,0.00011574829,0.000058731846,0.00046250178,0.00006128542,0.00005744367],"category_scores_gemma":[0.000009088407,0.0000812717,0.000074643496,0.00019427262,0.000040712053,0.00059069076,0.000024813819,0.0001206509,0.000106749176],"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.00004073069,0.00024179019,0.00040937902,0.000013860439,0.000020986556,0.0000835944,0.0032655,0.0013566866,0.0012942008,0.94098836,0.021651283,0.030633649],"study_design_scores_gemma":[0.0012770015,0.00075043226,0.0032843428,0.000028809041,0.0000049676196,0.00003010922,0.000015334184,0.7145776,0.18921086,0.0400913,0.049977902,0.0007512997],"about_ca_topic_score_codex":0.000011727939,"about_ca_topic_score_gemma":0.000003763714,"teacher_disagreement_score":0.900897,"about_ca_system_score_codex":0.000019327876,"about_ca_system_score_gemma":0.00006620131,"threshold_uncertainty_score":0.33141637},"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":"W2142142556","doi":"10.1109/icassp.2008.4518333","title":"Maximum likelihood binary detection in improper complex gaussian noise","year":2008,"lang":"en","type":"article","venue":"Proceedings of the ... IEEE International Conference on Acoustics, Speech, and Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Detector; Matched filter; Binary number; Gaussian noise; Filter (signal processing); Algorithm; Measure (data warehouse); Computer science; Gaussian; Noise (video); Complex normal distribution; SIGNAL (programming language); Detection theory; Signal-to-noise ratio (imaging); Mathematics; Artificial intelligence; Physics; Telecommunications; Data mining","score_opus":0.04638481127931506,"score_gpt":0.2801136698612019,"score_spread":0.23372885858188683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142142556","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7797897,0.000041810323,0.19404502,0.0031020758,0.00036263285,0.00049886963,0.000008830486,0.0002604873,0.021890583],"genre_scores_gemma":[0.984925,0.000069459056,0.014297439,0.00042546538,0.000093148556,0.000015650161,0.0000010476582,0.000015060007,0.00015774858],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831575,0.00001686549,0.0004288677,0.00041808654,0.00057945226,0.00024098337],"domain_scores_gemma":[0.99873906,0.000028587452,0.0003432235,0.00010668756,0.0007078317,0.000074623094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003752301,0.00021232893,0.00021853375,0.00030660295,0.0002149964,0.00024537861,0.0009443806,0.00011356974,0.000023760003],"category_scores_gemma":[0.000056066558,0.00016732108,0.000059102655,0.00030818456,0.0002020099,0.00082101906,0.00019576924,0.0003918367,0.0000051022234],"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.00010750755,0.00025187896,0.0014244957,0.00010553589,0.000019166657,0.000008122891,0.0019685363,0.00009025256,0.92162967,0.0056710844,0.00028526888,0.0684385],"study_design_scores_gemma":[0.0008911179,0.00040392837,0.014480814,0.0006007243,0.000016730224,0.0001968947,0.0005864693,0.6598255,0.2779919,0.044301,0.00016355133,0.00054135814],"about_ca_topic_score_codex":0.00003902553,"about_ca_topic_score_gemma":0.000005351213,"teacher_disagreement_score":0.65973526,"about_ca_system_score_codex":0.00008260955,"about_ca_system_score_gemma":0.0001387226,"threshold_uncertainty_score":0.6823155},"labels":[],"label_agreement":null},{"id":"W2142280405","doi":"10.1109/icip.2007.4379591","title":"Wavelet-Based Texture Retrieval using Independent Component Analysis","year":2007,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"Pattern recognition (psychology); Wavelet; Artificial intelligence; Independent component analysis; Computer science; Feature extraction; Image texture; Marginal distribution; Wavelet transform; Similarity measure; Divergence (linguistics); Feature (linguistics); Similarity (geometry); Mathematics; Texture (cosmology); Gaussian; Component analysis; Measure (data warehouse); Image (mathematics); Image processing; Statistics; Data mining; Random variable","score_opus":0.023870692886832433,"score_gpt":0.29806676862909237,"score_spread":0.27419607574225996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142280405","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.08055709,0.000014137797,0.91615975,0.00042817794,0.000055116092,0.00011442553,7.2379487e-7,0.00042014633,0.0022504271],"genre_scores_gemma":[0.73706585,4.439225e-7,0.2615024,0.0012861546,0.000019575542,2.4407052e-7,0.0000044457456,0.0000047436556,0.00011613764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984889,0.0000801326,0.00030017356,0.0003444479,0.00053252326,0.00025379384],"domain_scores_gemma":[0.9989822,0.0000876052,0.0001114044,0.0005767872,0.00012987586,0.000112131114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013995599,0.00012701926,0.00018643543,0.0005534539,0.000100570214,0.0001644247,0.0005562026,0.00011315534,0.00006785278],"category_scores_gemma":[0.000019966823,0.00011153492,0.00015138065,0.0017388318,0.000026912838,0.00023436578,0.00012582376,0.00018307111,0.000015394055],"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.00034774205,0.0022723186,0.02710908,0.00006978647,0.002128322,0.0005420109,0.006111412,0.025503328,0.24264753,0.62441653,0.0029621432,0.065889776],"study_design_scores_gemma":[0.00031186224,0.000058177688,0.019430174,0.000005427731,0.0000711821,0.0000075445373,0.00003491101,0.8028727,0.17477475,0.00071838225,0.0013985566,0.00031632403],"about_ca_topic_score_codex":0.00008419025,"about_ca_topic_score_gemma":0.00005865076,"teacher_disagreement_score":0.7773694,"about_ca_system_score_codex":0.00010946246,"about_ca_system_score_gemma":0.000073692565,"threshold_uncertainty_score":0.4548262},"labels":[],"label_agreement":null},{"id":"W2142568117","doi":"10.1109/ccece.2007.299","title":"Wavelet-Based Independent Component Analysis For Statistical Shape Modeling","year":2007,"lang":"en","type":"article","venue":"","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":"University of Alberta","funders":"","keywords":"Wavelet; Independent component analysis; Wavelet transform; Artificial intelligence; Computer science; Pattern recognition (psychology); Component (thermodynamics); Statistical model; Component analysis; Range (aeronautics); Principal component analysis; Computer vision; Engineering","score_opus":0.03986839779239713,"score_gpt":0.31539793749355743,"score_spread":0.2755295397011603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142568117","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.009797292,0.0000052930154,0.9881223,0.0005162636,0.00003360052,0.0002217794,0.0000054145053,0.00036925002,0.0009288442],"genre_scores_gemma":[0.537708,2.6018913e-7,0.4614813,0.00074750284,0.000009216686,0.000009699312,0.000015922253,0.0000036483145,0.000024444385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870366,0.000035271427,0.00032617594,0.00033595896,0.00034228124,0.00025667602],"domain_scores_gemma":[0.99907213,0.00025954202,0.000053881926,0.0003549135,0.00014722638,0.000112318696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011942191,0.00010568378,0.0001771996,0.00034046193,0.000084781874,0.00013022879,0.00041835266,0.00006543083,0.00005399339],"category_scores_gemma":[0.00003286209,0.0000952805,0.00010971869,0.00046404984,0.000015997346,0.00014784245,0.00007301833,0.00009190104,0.000009700511],"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.000041357875,0.00026813088,0.0004936923,0.000013864859,0.0001790287,0.000010630618,0.00035861548,0.031856403,0.0007880402,0.922854,0.00042780416,0.042708445],"study_design_scores_gemma":[0.00020658578,0.00005125066,0.0009209626,0.0000015080711,0.000027050957,5.9422126e-7,0.000015787302,0.99195087,0.0028629045,0.0036049802,0.00022792921,0.00012956477],"about_ca_topic_score_codex":0.00005761508,"about_ca_topic_score_gemma":0.00010328061,"teacher_disagreement_score":0.96009445,"about_ca_system_score_codex":0.000055051285,"about_ca_system_score_gemma":0.000053577896,"threshold_uncertainty_score":0.3885426},"labels":[],"label_agreement":null},{"id":"W2142615865","doi":"10.1162/089976606775093936","title":"Topographic Product Models Applied to Natural Scene Statistics","year":2005,"lang":"en","type":"article","venue":"Neural Computation","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Toronto","funders":"Canada Research Chairs; Gatsby Charitable Foundation; Wellcome Trust","keywords":"Computer science; Artificial intelligence; Statistical model; Relation (database); Gaussian; Mixture model; Pattern recognition (psychology); Machine learning; Contrast (vision); Scale (ratio); Product (mathematics); Mathematics; Data mining; Geography; Cartography","score_opus":0.02100555942873878,"score_gpt":0.2770095159409491,"score_spread":0.2560039565122103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142615865","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.03857432,0.000032902124,0.95652604,0.0030775722,0.00016814707,0.00039361542,0.0000031788195,0.00061459723,0.0006096231],"genre_scores_gemma":[0.611592,0.0000013400378,0.38657644,0.001691606,0.000063973006,0.000016372353,0.000016231577,0.0000070071283,0.00003504051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987951,0.00006116415,0.00023803579,0.00038290673,0.00032287143,0.00019995542],"domain_scores_gemma":[0.99937296,0.000051006406,0.00007922863,0.00025591123,0.00016155087,0.00007935862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018368132,0.00013440769,0.00012311032,0.00021124203,0.00010400933,0.00020817087,0.0003680774,0.000030102796,0.0000020016935],"category_scores_gemma":[0.000015432539,0.00013360266,0.000028932736,0.00054624135,0.000018747072,0.0005921019,0.00010992427,0.00016043983,0.000037473554],"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.0000141709625,0.000060953986,0.000016655547,0.0000093237095,0.000006711079,0.0000019305346,0.0014345399,0.23830847,0.002458203,0.20521739,0.0056150155,0.54685664],"study_design_scores_gemma":[0.00015000835,0.000058277103,0.00090741186,0.0000039010974,0.0000026142916,0.000006864119,0.0000049712594,0.9687371,0.0047639664,0.024507193,0.0006793513,0.00017829439],"about_ca_topic_score_codex":0.000006794193,"about_ca_topic_score_gemma":0.000015117339,"teacher_disagreement_score":0.7304287,"about_ca_system_score_codex":0.000037789447,"about_ca_system_score_gemma":0.000030480096,"threshold_uncertainty_score":0.54481584},"labels":[],"label_agreement":null},{"id":"W2142891162","doi":"10.1109/vetecf.2003.1285214","title":"Generalized blind subspace channel estimation","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McGill University","funders":"","keywords":"Estimator; Subspace topology; Mean squared error; Algorithm; Kernel (algebra); Channel (broadcasting); Mathematics; Covariance; Signal subspace; Computer science; Telecommunications link; Minimum mean square error; Cramér–Rao bound; Mathematical optimization; Statistics; Artificial intelligence; Telecommunications; Combinatorics","score_opus":0.02981746247295304,"score_gpt":0.28845054620029376,"score_spread":0.25863308372734073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142891162","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.00683496,0.000024914283,0.9610881,0.0014680469,0.00008382948,0.000132295,1.2188178e-7,0.00056111655,0.02980661],"genre_scores_gemma":[0.47436753,0.0000059640115,0.52213246,0.001070157,0.0000076210417,0.000017725124,0.000001403637,0.00000483272,0.0023922957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993016,0.00009620334,0.000121446144,0.0001948203,0.00015612422,0.00012978674],"domain_scores_gemma":[0.99947804,0.000026188705,0.000045264165,0.00034007835,0.000059283444,0.0000511286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035773666,0.00007658884,0.00007549887,0.00009313797,0.000060993607,0.00014372754,0.0002525651,0.000049083537,0.0000459801],"category_scores_gemma":[0.000051722764,0.0000686175,0.00003031584,0.0002970898,0.000012246744,0.00046347128,0.00003242886,0.00005737512,0.00009783002],"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.000001053601,0.000021634378,0.0000094729,0.0000012103285,0.0000024848616,7.823511e-7,0.00038722373,0.0006101507,0.0003172005,0.9942856,0.0030683784,0.0012948369],"study_design_scores_gemma":[0.0009497661,0.000080453676,0.00016969707,0.0000066852353,0.0000036567433,0.000026871645,0.000028386177,0.63917226,0.2019325,0.13731012,0.019961221,0.00035839388],"about_ca_topic_score_codex":0.0000119693095,"about_ca_topic_score_gemma":0.0000073418614,"teacher_disagreement_score":0.85697544,"about_ca_system_score_codex":0.000016261929,"about_ca_system_score_gemma":0.000041896288,"threshold_uncertainty_score":0.27981403},"labels":[],"label_agreement":null},{"id":"W2143169494","doi":"10.1162/0899766054322964","title":"The Cocktail Party Problem","year":2005,"lang":"en","type":"review","venue":"Neural Computation","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":515,"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":"Perception; Auditory scene analysis; Analogy; Computer science; Phenomenon; Process (computing); Cognitive science; Artificial intelligence; Auditory system; Auditory perception; Computational auditory scene analysis; Psychology; Cognitive psychology; Neuroscience; Linguistics","score_opus":0.06976775862070309,"score_gpt":0.36990437972923157,"score_spread":0.30013662110852846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143169494","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.929875e-7,0.80535704,0.19100815,0.0005839229,0.00020257277,0.0006995217,0.0000015727198,0.0005854175,0.0015616118],"genre_scores_gemma":[0.000029497858,0.97927815,0.01972348,0.0002631823,0.0001484854,0.00013904933,0.000037573594,0.000023783257,0.00035680184],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979185,0.0005130252,0.00056324934,0.00041556414,0.00034702668,0.00024265294],"domain_scores_gemma":[0.99845594,0.00046602378,0.0004613581,0.00044272977,0.000115862116,0.000058093494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049650454,0.00027820782,0.00046967852,0.00010646268,0.00031073525,0.00067386817,0.0010460581,0.00015865578,0.0000019240092],"category_scores_gemma":[0.00002541349,0.00017725294,0.00023659492,0.0004880637,0.00004196712,0.0004117625,0.00022784523,0.0004423709,0.00012996038],"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":[2.6105002e-7,0.000008603155,5.1453075e-8,0.0001658746,0.000007978659,0.0000011605352,0.000057551286,0.00008693707,2.2618806e-8,0.0118427295,0.0036609261,0.98416793],"study_design_scores_gemma":[0.000040638857,0.00004153838,8.174082e-7,0.0003219796,0.000023685361,0.000031890337,0.0000015198051,0.024972277,5.6453143e-7,0.0020579607,0.97231877,0.000188366],"about_ca_topic_score_codex":0.000002635769,"about_ca_topic_score_gemma":0.0000073299225,"teacher_disagreement_score":0.9839795,"about_ca_system_score_codex":0.000081996375,"about_ca_system_score_gemma":0.00016772319,"threshold_uncertainty_score":0.72281647},"labels":[],"label_agreement":null},{"id":"W2143382543","doi":"10.1109/icassp.1997.596191","title":"Blind separation and restoration of signals mixed in convolutive environment","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McMaster University","funders":"","keywords":"Computer science; Entropy (arrow of time); Speech recognition; Artificial neural network; Blind signal separation; Set (abstract data type); Scheme (mathematics); Artificial intelligence; Pattern recognition (psychology); Mathematics; Telecommunications; Channel (broadcasting)","score_opus":0.035448035692156585,"score_gpt":0.267702736774622,"score_spread":0.23225470108246538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143382543","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.23765433,0.000121540455,0.75644654,0.001125779,0.000018927647,0.00025348106,6.2096245e-7,0.00005993829,0.0043188287],"genre_scores_gemma":[0.97413266,0.0000498014,0.02528014,0.00010987837,0.0000043416926,0.000012861196,0.0000011896947,0.000002099057,0.00040703014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993757,0.00009576483,0.00019486714,0.00013447423,0.00013321743,0.000065993096],"domain_scores_gemma":[0.99968207,0.00004128937,0.00007694851,0.00015760926,0.000019601912,0.00002247254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002586234,0.000054631353,0.00008414672,0.00011635095,0.000018485784,0.000028506882,0.000101346755,0.000045067096,0.000041635092],"category_scores_gemma":[0.00001311298,0.000052705513,0.000011443503,0.00012670552,0.00003216514,0.00042236235,0.00004529683,0.000045401608,0.0000143997295],"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.00006633985,0.0010816114,0.007888855,0.000043662483,0.00004056181,0.000008309019,0.044538155,0.00492061,0.15017119,0.7063997,0.014596662,0.07024434],"study_design_scores_gemma":[0.0014409886,0.00053865183,0.024051365,0.000027307164,0.000005272614,0.000005636022,0.00025733223,0.6924073,0.26201385,0.015116096,0.0037921206,0.0003440933],"about_ca_topic_score_codex":0.000017801009,"about_ca_topic_score_gemma":0.000019192545,"teacher_disagreement_score":0.7364783,"about_ca_system_score_codex":0.000023425375,"about_ca_system_score_gemma":0.0000062710274,"threshold_uncertainty_score":0.21492684},"labels":[],"label_agreement":null},{"id":"W2143609653","doi":"10.1109/igarss.1991.579553","title":"Maximum-Likelihood Blind Deconvolution: Non-White Bernoulli-Gaussian Case","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"National Tsing Hua University; National Science Council; Ontario Water Consortium","keywords":"Deconvolution; Blind deconvolution; Spectral density; Bernoulli's principle; Mathematics; Additive white Gaussian noise; Spectrum (functional analysis); White noise; Gaussian; Wavelet; Algorithm; Gaussian process; Statistics; Computer science; Physics; Artificial intelligence","score_opus":0.014078802955598544,"score_gpt":0.26929743327736155,"score_spread":0.255218630321763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143609653","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.013033379,0.000051530747,0.91023743,0.009631361,0.00012753099,0.00026246146,0.0000020474172,0.00084428553,0.065809995],"genre_scores_gemma":[0.64716786,0.000009172768,0.3479708,0.002597948,0.00014898673,0.00002748998,0.0000032412038,0.000012791306,0.002061661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984284,0.00006508076,0.00035850462,0.0004865032,0.00027198473,0.00038954953],"domain_scores_gemma":[0.9987055,0.000037360554,0.000101185455,0.0008320861,0.00010847994,0.00021538557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046218248,0.00019802283,0.00017338152,0.00021037977,0.00019563216,0.00030502636,0.0006702193,0.0001400352,0.00031269732],"category_scores_gemma":[0.000013289147,0.00018300932,0.00009525138,0.0004615918,0.00004458556,0.0011413527,0.00022861887,0.00021509967,0.0007579668],"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.000034314246,0.0007726762,0.0020518415,0.00002833635,0.000087922956,0.0013025528,0.008385238,0.00042889224,0.0006044392,0.20714375,0.08350742,0.6956526],"study_design_scores_gemma":[0.0048916,0.000780675,0.003282248,0.000072861694,0.000049215698,0.013708837,0.0005353465,0.46713296,0.042354163,0.050650526,0.41391912,0.0026224444],"about_ca_topic_score_codex":0.00006380387,"about_ca_topic_score_gemma":0.00047541162,"teacher_disagreement_score":0.6930302,"about_ca_system_score_codex":0.00007986083,"about_ca_system_score_gemma":0.000119550976,"threshold_uncertainty_score":0.9742382},"labels":[],"label_agreement":null},{"id":"W2144738686","doi":"10.1109/isspa.1999.818108","title":"A simplified informax approach for blind signal separation","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McMaster University","funders":"","keywords":"Blind signal separation; Maximization; Computer science; Entropy maximization; Entropy (arrow of time); Algorithm; Separation (statistics); Computational complexity theory; Source separation; SIGNAL (programming language); Speech recognition; Mathematical optimization; Principle of maximum entropy; Mathematics; Artificial intelligence; Machine learning; Telecommunications","score_opus":0.0380858873604665,"score_gpt":0.3103063706919813,"score_spread":0.27222048333151483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144738686","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.0006544203,0.0000061438327,0.8869806,0.00012240847,0.000026371155,0.0004678353,9.0409515e-7,0.0003542044,0.1113871],"genre_scores_gemma":[0.39938712,9.4274344e-7,0.59814256,0.0011038947,0.000014321691,0.00012279402,0.000013443769,0.000004924149,0.00120998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991966,0.000044132794,0.00021204122,0.00020913496,0.00016266393,0.00017545343],"domain_scores_gemma":[0.9994196,0.00005906163,0.00006661947,0.0002855988,0.00011215545,0.00005695534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053839834,0.00009613903,0.000096495176,0.000104670275,0.000097743505,0.00021624035,0.00030549095,0.00007634731,0.00001978943],"category_scores_gemma":[0.000033581404,0.00008440674,0.000055721186,0.00025788732,0.000015001176,0.00078471267,0.000031957552,0.00006773907,0.000022162554],"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.000008675732,0.00005310002,0.00001715704,0.0000063858392,0.000006576376,9.241521e-8,0.0005918442,0.00065103476,0.0005664884,0.987756,0.0065725213,0.0037700862],"study_design_scores_gemma":[0.0015396714,0.00031818205,0.000054176115,0.0000029473929,0.0000067480855,0.000015869115,0.00012014759,0.7192898,0.10617533,0.033050936,0.13897233,0.00045387095],"about_ca_topic_score_codex":0.000002370643,"about_ca_topic_score_gemma":0.0000014746012,"teacher_disagreement_score":0.9547051,"about_ca_system_score_codex":0.000019501023,"about_ca_system_score_gemma":0.000094924646,"threshold_uncertainty_score":0.34420067},"labels":[],"label_agreement":null},{"id":"W2145159132","doi":"10.1109/iscas.2005.1465445","title":"A Subspace Constrained Constant Modulus Algorithm for Blind Array","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Concordia University","funders":"","keywords":"Subspace topology; Maxima and minima; Rate of convergence; Algorithm; Constant (computer programming); Convergence (economics); Mathematics; Stochastic gradient descent; Sensitivity (control systems); Gradient descent; Computational complexity theory; Mathematical optimization; Applied mathematics; Computer science; Artificial intelligence; Artificial neural network; Mathematical analysis","score_opus":0.021460639214318372,"score_gpt":0.2842696898278127,"score_spread":0.26280905061349435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145159132","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.00023204555,0.00003264161,0.9678507,0.007581848,0.000088548375,0.0004833789,0.000007630633,0.0007347233,0.022988489],"genre_scores_gemma":[0.127898,0.0000051223524,0.86749345,0.002023057,0.000067531626,0.000062852945,0.0000033653018,0.00000821638,0.0024384372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998974,0.0000378078,0.00022323627,0.00032671037,0.0001824993,0.00025570506],"domain_scores_gemma":[0.99917555,0.00010167421,0.00007404617,0.00039477798,0.00015288791,0.0001010785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041761386,0.00012948175,0.00015217542,0.00010793344,0.00008962759,0.00018033828,0.00045247446,0.000076378936,0.000043723805],"category_scores_gemma":[0.000028274493,0.00011531995,0.00007499735,0.0002166302,0.00007897923,0.00044924076,0.000048651647,0.000087802,0.00003958145],"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.0000069717103,0.00010174451,0.0000065158806,0.000003240629,0.000019161882,0.0000018145898,0.0008849602,0.00003502429,0.003561926,0.57707226,0.009051895,0.4092545],"study_design_scores_gemma":[0.0017097896,0.00019970041,0.000012757615,0.000010642974,0.0000065247027,0.00004516452,0.000091346716,0.7049951,0.16276935,0.013841634,0.11591968,0.0003983479],"about_ca_topic_score_codex":0.000008836072,"about_ca_topic_score_gemma":0.000034257773,"teacher_disagreement_score":0.70496005,"about_ca_system_score_codex":0.00003633398,"about_ca_system_score_gemma":0.0001352087,"threshold_uncertainty_score":0.4702611},"labels":[],"label_agreement":null},{"id":"W2145272899","doi":"10.1109/glocom.2009.5425213","title":"Closed-Form Expressions for the Exact Cramer-Rao Bound for Parameter Estimation of Arbitrary Square QAM-Modulated Signals","year":2009,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Cramér–Rao bound; Quadrature amplitude modulation; Additive white Gaussian noise; QAM; Mathematics; White noise; Amplitude; Estimation theory; Closed-form expression; Upper and lower bounds; Phase-shift keying; Gaussian noise; Square (algebra); Mathematical analysis; Algorithm; Statistics; Physics; Bit error rate; Decoding methods","score_opus":0.031201089955683776,"score_gpt":0.3196951813883447,"score_spread":0.2884940914326609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145272899","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.023323268,0.00005119109,0.97024256,0.003928864,0.000060965347,0.0014576999,0.000013716326,0.00033297794,0.00058876653],"genre_scores_gemma":[0.6708777,0.0000034165685,0.32736796,0.0013363998,0.00001941066,0.00014331742,0.000016016847,0.000007678909,0.00022806798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880284,0.000046527923,0.00040976753,0.00028997773,0.00022541717,0.00022545477],"domain_scores_gemma":[0.99789107,0.0010703455,0.00020348566,0.00060359586,0.00017636971,0.00005512632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004865454,0.00015431477,0.00020309843,0.00011171974,0.00021379195,0.00019104284,0.0006307478,0.0001120974,0.000017517119],"category_scores_gemma":[0.00017354732,0.00010228564,0.00017481961,0.00023963433,0.00004531928,0.00068668614,0.000045132056,0.000097804215,0.0000028118416],"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.00016798182,0.00070261373,0.000030866915,0.00009722946,0.000109552224,9.993244e-7,0.0041228333,0.011439216,0.044791862,0.44814986,0.03115845,0.45922855],"study_design_scores_gemma":[0.00032555516,0.00040811588,0.00079106435,0.000037431535,0.000013579281,0.0000014956902,0.0000332607,0.6465025,0.14844902,0.20175134,0.0015358925,0.00015075988],"about_ca_topic_score_codex":0.00001424944,"about_ca_topic_score_gemma":0.0000024837695,"teacher_disagreement_score":0.64755446,"about_ca_system_score_codex":0.000019986026,"about_ca_system_score_gemma":0.000073720636,"threshold_uncertainty_score":0.41710874},"labels":[],"label_agreement":null},{"id":"W2145404105","doi":"10.1109/ccece.2005.1557347","title":"Area-efficient parallel white Gaussian noise generator","year":2006,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"White noise; Computer science; Additive white Gaussian noise; Gaussian noise; Generator (circuit theory); Noise (video); Telecommunications; Algorithm; Artificial intelligence; Physics; Power (physics)","score_opus":0.012896375266271116,"score_gpt":0.23256332550094475,"score_spread":0.21966695023467364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145404105","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.011137731,0.00003519025,0.91471875,0.0031253926,0.00008231848,0.00014758807,9.086956e-7,0.00084967917,0.06990247],"genre_scores_gemma":[0.6900513,0.0000018010174,0.30263406,0.0014998384,0.00006296502,0.0000280592,0.000004328354,0.00000849014,0.005709172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989194,0.00004964698,0.00021934023,0.00032855736,0.00025305996,0.00022998308],"domain_scores_gemma":[0.9992418,0.000015636746,0.00006015961,0.00054580206,0.00006428972,0.00007225347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020744838,0.00012637438,0.000110245615,0.00011242254,0.00009302775,0.00024431286,0.0005273069,0.00006088431,0.000082653576],"category_scores_gemma":[0.0000054498296,0.00010432193,0.00005818602,0.00031363004,0.000025892266,0.00018890272,0.00012866447,0.00008361368,0.00014042608],"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.000002846279,0.00022309316,0.0011961077,0.00000343441,0.0000052289965,0.000013869141,0.00034695436,0.015598654,0.0025767945,0.8979449,0.08007388,0.002014202],"study_design_scores_gemma":[0.00062921975,0.00012210735,0.013914814,0.000014814096,0.000006060612,0.00003061083,0.000030382482,0.85475534,0.03663205,0.011418398,0.08167877,0.0007674259],"about_ca_topic_score_codex":0.00005683181,"about_ca_topic_score_gemma":0.00004221089,"teacher_disagreement_score":0.8865265,"about_ca_system_score_codex":0.000030783933,"about_ca_system_score_gemma":0.000053620523,"threshold_uncertainty_score":0.42541248},"labels":[],"label_agreement":null},{"id":"W2145512244","doi":"10.1109/icassp.2009.4959963","title":"Orthogonalized discriminant analysis based on generalized singular value decomposition","year":2009,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Orthogonalization; Linear discriminant analysis; Pattern recognition (psychology); Singular value decomposition; Computer science; Subspace topology; Artificial intelligence; Algorithm; Principal component analysis; Mathematics","score_opus":0.013809542526540947,"score_gpt":0.30509347383639446,"score_spread":0.2912839313098535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145512244","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.021813296,0.000010944986,0.9650293,0.004732298,0.000034335328,0.00015524945,0.0000010964377,0.0006209634,0.007602534],"genre_scores_gemma":[0.63870114,0.000002130568,0.3537513,0.007345897,0.000012438098,0.0000064855176,0.000029144168,0.000003878321,0.00014757167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984581,0.00024453303,0.00028522484,0.0004173259,0.0003927602,0.00020206728],"domain_scores_gemma":[0.9989912,0.000057964262,0.000098773235,0.0006808471,0.0000808211,0.000090419686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045568962,0.00015858885,0.00025338714,0.00046941583,0.00012378885,0.00022958711,0.00045672513,0.00006678207,0.000058511698],"category_scores_gemma":[0.00001885483,0.00012924307,0.0002437683,0.0010950703,0.00001626919,0.00027686107,0.00003015016,0.00008712233,0.00001873302],"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.000042200783,0.00038904813,0.00017565378,0.0000021406142,0.00006980845,0.000018033556,0.00024152099,0.022610918,0.008689038,0.95438546,0.00087288854,0.012503281],"study_design_scores_gemma":[0.0004419256,0.00022373282,0.009453734,0.000008584558,0.000086758766,0.0000016038647,0.0000020047196,0.9438745,0.031035237,0.013804891,0.0008288856,0.00023818237],"about_ca_topic_score_codex":0.000039239232,"about_ca_topic_score_gemma":0.00000913185,"teacher_disagreement_score":0.94058055,"about_ca_system_score_codex":0.000047113605,"about_ca_system_score_gemma":0.000047208418,"threshold_uncertainty_score":0.5270379},"labels":[],"label_agreement":null},{"id":"W2145784841","doi":"10.1088/0954-898x_14_2_308","title":"Modular organization of adaptive colouration in flounder and cuttlefish revealed by independent component analysis","year":2003,"lang":"en","type":"article","venue":"Network Computation in Neural Systems","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":25,"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":"Canadian Institute for Theoretical Astrophysics","keywords":"Camouflage; Cuttlefish; Independent component analysis; Modularity (biology); Modular design; Component (thermodynamics); Independence (probability theory); FastICA; Artificial intelligence; Computer science; Pattern recognition (psychology); Biology; Evolutionary biology; Mathematics; Fishery; Statistics; Blind signal separation; Telecommunications","score_opus":0.010980159793696152,"score_gpt":0.23122663440042218,"score_spread":0.22024647460672603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145784841","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.36393207,0.00016678483,0.63517433,0.00007881422,0.00010560376,0.0003958907,0.0000013038981,0.0000563983,0.00008883078],"genre_scores_gemma":[0.9945832,0.00001737886,0.005229687,0.00007251034,0.00001349432,0.000023282004,0.00003700238,0.000009478525,0.000013995613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976237,0.00086976966,0.000656524,0.0003497006,0.000327368,0.00017293083],"domain_scores_gemma":[0.9990655,0.00015748675,0.00035229462,0.00017355116,0.00020508282,0.000046042158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007765661,0.00013691733,0.00034048202,0.00032928048,0.00005619215,0.00012480003,0.00016355948,0.00010670572,0.000001996761],"category_scores_gemma":[0.000032307944,0.00014762492,0.000030318888,0.0025263398,0.000025312167,0.0003939393,0.00004616557,0.00014005484,9.03196e-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.000005333502,0.000052600386,0.059207886,0.0000127629655,0.000028814935,0.0000018331167,0.0005874,0.92486626,0.00021256733,0.014627028,0.00017878522,0.00021875322],"study_design_scores_gemma":[0.00039411895,0.00006104339,0.081448585,0.000028337521,0.000013239978,0.000005359412,0.00008529164,0.91710806,0.000057945083,0.000643522,0.000024291117,0.0001302222],"about_ca_topic_score_codex":0.00020305661,"about_ca_topic_score_gemma":0.00011092046,"teacher_disagreement_score":0.6306511,"about_ca_system_score_codex":0.00012365694,"about_ca_system_score_gemma":0.000033108292,"threshold_uncertainty_score":0.6019969},"labels":[],"label_agreement":null},{"id":"W2146457394","doi":"10.1109/iscas.2007.378162","title":"Linear Prediction Based Semi-Blind Channel Estimation for MIMO-OFDM System","year":2007,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"MIMO; MIMO-OFDM; Orthogonal frequency-division multiplexing; Channel (broadcasting); Algorithm; Constraint (computer-aided design); Computer science; SIGNAL (programming language); Blind signal separation; Mean squared error; Mathematics; Mathematical optimization; Statistics; Telecommunications","score_opus":0.026412513225719057,"score_gpt":0.2903895118576979,"score_spread":0.2639769986319788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146457394","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.0015994476,0.000008909452,0.9920444,0.0005903187,0.00026876898,0.00067361,0.000005541104,0.0016059806,0.0032030123],"genre_scores_gemma":[0.6022792,3.4412162e-7,0.3969172,0.00036652322,0.00008904871,0.00005463237,0.000024239584,0.000008847153,0.0002599813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890107,0.000034422068,0.0003196159,0.00029261917,0.00024354053,0.00020876185],"domain_scores_gemma":[0.99909365,0.00015284157,0.000113711576,0.00036032958,0.00020063129,0.0000788533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013552797,0.00011282501,0.00011439078,0.00022385258,0.00012444465,0.000100495534,0.00030490843,0.00012373614,0.0000034330408],"category_scores_gemma":[0.000053163378,0.000105012856,0.00006268204,0.0003226625,0.0000142601275,0.00050348224,0.000036126705,0.00007760406,0.000022136353],"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.0004538817,0.0007251001,0.0003851569,0.0008337131,0.0000914027,0.000014430389,0.00409367,0.08210888,0.007387746,0.79214686,0.032966673,0.07879248],"study_design_scores_gemma":[0.00050077797,0.00012674058,0.00013188491,0.00003125038,0.0000045260067,0.000004720367,0.000036702462,0.94472337,0.052297898,0.0005470396,0.0014931567,0.00010193385],"about_ca_topic_score_codex":0.000013346893,"about_ca_topic_score_gemma":0.0000090009,"teacher_disagreement_score":0.8626145,"about_ca_system_score_codex":0.0000848183,"about_ca_system_score_gemma":0.00006031123,"threshold_uncertainty_score":0.42823002},"labels":[],"label_agreement":null},{"id":"W2146947327","doi":"10.1109/ccece.2011.6030512","title":"Blind correlated TDL equalization in fast Rician fading channels","year":2011,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Simon Fraser University","funders":"","keywords":"Rician fading; Fading; Computer science; Channel (broadcasting); Equalization (audio); Algorithm; Bit error rate; Transmission (telecommunications); Blind equalization; Symbol (formal); Wireless; Relay; Statistics; Mathematics; Telecommunications","score_opus":0.06516809792642854,"score_gpt":0.27977952134323053,"score_spread":0.214611423416802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146947327","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.0151003385,0.000010567655,0.9181235,0.00013572816,0.00016637302,0.00016474376,1.7103179e-7,0.00047620776,0.06582237],"genre_scores_gemma":[0.9669594,0.00000508781,0.031487234,0.0005899664,0.000012883813,0.000012855198,0.0000028975155,0.000007229771,0.0009224419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991342,0.00008417245,0.00023626225,0.00023412319,0.00013878307,0.00017245371],"domain_scores_gemma":[0.99954134,0.00002528412,0.000074547475,0.0002554897,0.000058710222,0.000044630393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037726128,0.000088577704,0.00009791057,0.00030456457,0.000043112992,0.00008139354,0.0003958735,0.000091525064,0.00007636209],"category_scores_gemma":[0.000027007743,0.00008473545,0.00002315413,0.0007446705,0.0000148596055,0.0006435956,0.000106300555,0.000108124535,0.00008940233],"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.000012621829,0.00018630929,0.001907449,0.000006262137,0.000008752428,0.000014696377,0.039346993,0.00058431854,0.00095931423,0.9346929,0.0007954809,0.021484865],"study_design_scores_gemma":[0.0012805235,0.00027250478,0.005619421,0.00008134636,0.0000051594952,0.000017370654,0.00041901047,0.84864944,0.091182955,0.04936233,0.0023988953,0.0007110446],"about_ca_topic_score_codex":0.00014286466,"about_ca_topic_score_gemma":0.000063478336,"teacher_disagreement_score":0.95185906,"about_ca_system_score_codex":0.000030014457,"about_ca_system_score_gemma":0.000027343796,"threshold_uncertainty_score":0.34554115},"labels":[],"label_agreement":null},{"id":"W2147145409","doi":"10.1109/ccece.1998.682569","title":"Implementation and evaluation of an accurate real-time voiceband signal classifier","year":2002,"lang":"en","type":"article","venue":"","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":"University of Alberta","funders":"","keywords":"Computer science; Linear discriminant analysis; Quadratic classifier; Artificial intelligence; Speech recognition; Pattern recognition (psychology); Classifier (UML); Autocorrelation; Demodulation; Binary decision diagram; Mathematics; Algorithm; Channel (broadcasting); Statistics; Telecommunications","score_opus":0.07169844755190923,"score_gpt":0.3596384049667732,"score_spread":0.28793995741486395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147145409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73579526,0.00001941495,0.2361589,0.00053719076,0.000022174074,0.00040399734,0.0000016765899,0.00021235496,0.026849007],"genre_scores_gemma":[0.96471655,0.000014140601,0.034883156,0.00010378364,0.00001184999,0.00001562457,0.0000054562615,0.0000034866257,0.00024597178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902374,0.00020095134,0.00018602713,0.00017709254,0.00033101125,0.000081183825],"domain_scores_gemma":[0.9994568,0.00002861459,0.00009773749,0.00019280345,0.00018468266,0.000039315753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091710704,0.000059334987,0.000071271585,0.00008058518,0.000041745683,0.00008541982,0.00014116125,0.0000334397,0.00061062025],"category_scores_gemma":[0.000006114287,0.000053427368,0.000013494458,0.0001423087,0.00001976633,0.0009263737,0.00003742878,0.000031286032,0.000012114468],"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.0000057816133,0.00017750208,0.000621986,0.000011342735,0.000028106537,8.9115053e-7,0.0064483904,0.00019723555,0.12318008,0.07103635,0.0057882643,0.7925041],"study_design_scores_gemma":[0.0004813072,0.00017936718,0.0077744294,0.0000032290018,0.000012678348,0.0000035543605,0.00009824477,0.8942999,0.09294517,0.0038561001,0.0002424369,0.000103547194],"about_ca_topic_score_codex":0.00005703191,"about_ca_topic_score_gemma":0.000045371657,"teacher_disagreement_score":0.8941027,"about_ca_system_score_codex":0.000017821101,"about_ca_system_score_gemma":0.000022294498,"threshold_uncertainty_score":0.6685864},"labels":[],"label_agreement":null},{"id":"W2147197068","doi":"10.1109/ccece.1999.807260","title":"A high throughput architecture for channel equalization based on a neural network using a wave pipeline method","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Pipeline (software); Computer science; Bottleneck; Throughput; CMOS; Parallel computing; Electronic engineering; Computer hardware; Computer architecture; Embedded system; Wireless; Engineering; Telecommunications","score_opus":0.061126144886260676,"score_gpt":0.33083194802830207,"score_spread":0.2697058031420414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147197068","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.00019952742,0.000013225178,0.9961878,0.0015196824,0.00020206404,0.00059076137,0.0000023063926,0.00047079474,0.0008138477],"genre_scores_gemma":[0.14810032,5.176624e-7,0.84362024,0.007977602,0.00010577526,0.00004402499,0.0000097797465,0.000017818555,0.00012394814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839437,0.0003940244,0.00026310477,0.00041902883,0.00022551365,0.000303966],"domain_scores_gemma":[0.9989049,0.00034118356,0.00012476339,0.0004442558,0.00012310361,0.00006182671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009421846,0.0001780676,0.00019738784,0.00012385883,0.00015470276,0.0001429668,0.00024086858,0.00010007963,0.000012991828],"category_scores_gemma":[0.00013815165,0.00014932363,0.00009375027,0.0005593836,0.000014382222,0.00018241121,0.000040611267,0.00012422219,0.0000013923554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016937183,0.000045080713,0.0000013650363,0.0000087386425,0.0000042308584,0.0000012389108,0.0003402339,0.68475693,0.00021574057,0.30878434,0.0012597154,0.0045654657],"study_design_scores_gemma":[0.0003889882,0.00015428562,0.0000028429808,0.00001706696,0.000006106317,0.0000076285833,0.0000065725962,0.9266688,0.0104908105,0.060017627,0.0020673184,0.000171934],"about_ca_topic_score_codex":0.000025180472,"about_ca_topic_score_gemma":0.000015516545,"teacher_disagreement_score":0.2487667,"about_ca_system_score_codex":0.0000374458,"about_ca_system_score_gemma":0.000075884294,"threshold_uncertainty_score":0.6089241},"labels":[],"label_agreement":null},{"id":"W2147456596","doi":"10.1109/glocom.1996.586809","title":"Second order Markov modelling of digital symbol synchronisers","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Queen's University","funders":"","keywords":"Markov chain; Algorithm; Markov model; Computer science; Loop (graph theory); Random walk; Order (exchange); Markov process; Noise (video); Binary number; Mathematics; Artificial intelligence; Statistics; Machine learning; Arithmetic; Combinatorics","score_opus":0.029483292319284052,"score_gpt":0.22386008289404657,"score_spread":0.19437679057476254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147456596","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.010399797,0.000036198013,0.86307883,0.00030703098,0.000027647937,0.0000776259,0.0000013828392,0.00023861212,0.12583286],"genre_scores_gemma":[0.88669205,0.0000075459666,0.108927056,0.00019669428,0.000008434405,0.0000040111263,7.446369e-7,0.000005657759,0.004157822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999317,0.000015236119,0.00018382586,0.00018797145,0.00016538288,0.00013060532],"domain_scores_gemma":[0.9994377,0.000039805254,0.000054212174,0.00034096552,0.00008338616,0.000043970387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000087789595,0.000078987505,0.00010275382,0.000081073355,0.000030856467,0.00014013793,0.00040234448,0.00004502905,0.0005220622],"category_scores_gemma":[0.000007412944,0.000071970535,0.00003990905,0.00025032647,0.000028863446,0.000814291,0.00009580285,0.00006875094,0.000053421398],"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.000012017846,0.0009109186,0.001057557,0.00016635805,0.00015684878,0.00002583626,0.012705868,0.039422996,0.0016103954,0.70056814,0.06652428,0.1768388],"study_design_scores_gemma":[0.00010218085,0.000042597287,0.000007851019,0.0000065321956,0.0000012652581,0.000004961232,0.000027285532,0.987878,0.0065210555,0.0029146122,0.0023766982,0.0001169299],"about_ca_topic_score_codex":0.0000029970101,"about_ca_topic_score_gemma":0.0000016455253,"teacher_disagreement_score":0.94845504,"about_ca_system_score_codex":0.000013812401,"about_ca_system_score_gemma":0.000015623753,"threshold_uncertainty_score":0.5716215},"labels":[],"label_agreement":null},{"id":"W2147914906","doi":"10.1109/tbme.2004.827265","title":"Fetal MEG Redistribution by Projection Operators","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Biomedical Engineering","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Welichem Biotech (Canada)","funders":"National Institute of Biomedical Imaging and Bioengineering; National Institute of Neurological Disorders and Stroke","keywords":"Redistribution (election); Projection (relational algebra); Orthographic projection; Physics; Dipole; SIGNAL (programming language); Interference (communication); Optics; Computer science; Algorithm; Artificial intelligence; Telecommunications; Quantum mechanics","score_opus":0.006631202851678807,"score_gpt":0.22546316925618531,"score_spread":0.2188319664045065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147914906","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.003954526,0.000013909102,0.9926686,0.0014004476,0.0006158076,0.00016075152,0.000016569025,0.0011031205,0.00006622292],"genre_scores_gemma":[0.9747893,0.000014762214,0.024907097,0.00014414419,0.000037598325,0.00006149212,0.000009650688,0.000012931596,0.000023007324],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989305,0.000019168196,0.00021456814,0.0002809553,0.0003386441,0.00021614085],"domain_scores_gemma":[0.9995439,0.000022871593,0.000027112304,0.00022414158,0.00003707639,0.00014491993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019388003,0.00014209957,0.00011135651,0.0002087878,0.00010925447,0.0000855052,0.0002555627,0.00014406159,0.0000066121543],"category_scores_gemma":[0.000008995143,0.0001394589,0.00006709091,0.00068808516,0.000035516892,0.0004178133,0.0000021768956,0.0003158271,0.000025232976],"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.00004380663,0.002235648,0.0000015343289,0.000092336275,0.00020184094,0.000048215086,0.0020518682,0.13320878,0.6073973,0.063856736,0.0037808437,0.1870811],"study_design_scores_gemma":[0.00089903903,0.000453563,0.000014351391,0.000075994045,0.000011482178,0.000065644046,0.000019874877,0.22916628,0.75789434,0.0002977464,0.010679228,0.00042245764],"about_ca_topic_score_codex":0.000026021062,"about_ca_topic_score_gemma":0.000001358063,"teacher_disagreement_score":0.9708348,"about_ca_system_score_codex":0.00020153234,"about_ca_system_score_gemma":0.00007402935,"threshold_uncertainty_score":0.5686969},"labels":[],"label_agreement":null},{"id":"W2149233205","doi":"10.1109/tvt.2009.2039008","title":"Subspace-Based Blind Channel Estimation for MIMO-OFDM Systems With Reduced Time Averaging","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","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":"McGill University","funders":"","keywords":"Orthogonal frequency-division multiplexing; MIMO; Signal subspace; MIMO-OFDM; Subspace topology; Algorithm; Channel (broadcasting); Computer science; Wideband; Orthogonality; Linear subspace; Spatial correlation; Mathematics; Noise (video); Electronic engineering; Telecommunications; Engineering; Artificial intelligence","score_opus":0.010758270127366116,"score_gpt":0.2419738827755609,"score_spread":0.2312156126481948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149233205","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.06383027,0.00001327856,0.9281642,0.004539946,0.00033970308,0.0010300186,0.0000086279315,0.0020122698,0.00006167104],"genre_scores_gemma":[0.8736097,0.0000016637014,0.12534246,0.00015357182,0.000018446071,0.0006671487,0.000006534735,0.000033037482,0.00016742622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984872,0.0000550281,0.00028335978,0.00056987075,0.0002581091,0.0003464847],"domain_scores_gemma":[0.99846923,0.00010497583,0.00016010403,0.0009352556,0.00025514327,0.00007526475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003824164,0.0002506723,0.00027146222,0.0009485509,0.00031550298,0.0001568796,0.0006382109,0.00044580075,0.0000063478774],"category_scores_gemma":[0.0000147376795,0.00023412888,0.0000945911,0.00090658676,0.00013247167,0.000338217,0.0000031131347,0.0006240008,0.000047001875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027182512,0.0009730869,0.000006569819,0.0001353122,0.00021927831,0.00003732639,0.00067249726,0.54725575,0.38348255,0.029744502,0.00042954652,0.036771767],"study_design_scores_gemma":[0.0007777525,0.00030167215,0.0000026701605,0.000039161,0.000020656978,0.000053804677,0.000014163859,0.64594966,0.35132143,0.00076189946,0.00054144184,0.00021569057],"about_ca_topic_score_codex":0.000014629408,"about_ca_topic_score_gemma":0.000022125785,"teacher_disagreement_score":0.80977947,"about_ca_system_score_codex":0.00005906593,"about_ca_system_score_gemma":0.00015314837,"threshold_uncertainty_score":0.9547498},"labels":[],"label_agreement":null},{"id":"W2149807144","doi":"10.1109/tnn.2006.885436","title":"Face Recognition Using an Enhanced Independent Component Analysis Approach","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":91,"is_retracted":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":"Independent component analysis; Linear discriminant analysis; Pattern recognition (psychology); Eigenface; Facial recognition system; Computer science; Artificial intelligence; Subspace topology; Principal component analysis; Support vector machine; Face (sociological concept); Component analysis; Dimension (graph theory); Unsupervised learning; Speech recognition; Mathematics","score_opus":0.047209158689677976,"score_gpt":0.2904797751869109,"score_spread":0.24327061649723294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149807144","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.12562703,0.0000102076365,0.87309396,0.00004231486,0.00027591828,0.0002656751,0.0000030714195,0.0004820823,0.00019972611],"genre_scores_gemma":[0.9430202,0.000010117471,0.056413826,0.00043801154,0.000049290044,0.000017291679,0.000014720968,0.00001510614,0.000021438558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981619,0.00020206544,0.00037892567,0.00053624157,0.00036734287,0.00035353936],"domain_scores_gemma":[0.9989732,0.00008733868,0.00013907136,0.0005357178,0.000097591554,0.00016709966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059301115,0.00020855576,0.00023553862,0.0004900159,0.00027460454,0.00018475104,0.0004407359,0.00017331257,0.000015376354],"category_scores_gemma":[0.0000010659437,0.00021316434,0.00019781443,0.0015046658,0.00003866231,0.0007439469,0.0000038062115,0.0005069802,0.000004696538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026280784,0.00028649735,0.00000351177,0.0000017485555,0.00007221226,0.0000030158408,0.00038290131,0.9310618,0.0013946526,0.000030696694,0.000003312173,0.06673338],"study_design_scores_gemma":[0.00019283974,0.000112522284,0.00022489407,0.000004955491,0.00008804906,0.000012225534,0.0000591987,0.9706004,0.028396264,0.00006664543,0.0000060334514,0.00023592166],"about_ca_topic_score_codex":0.00006157256,"about_ca_topic_score_gemma":0.00011029795,"teacher_disagreement_score":0.8173932,"about_ca_system_score_codex":0.000095379626,"about_ca_system_score_gemma":0.000015496486,"threshold_uncertainty_score":0.869259},"labels":[],"label_agreement":null},{"id":"W2150057756","doi":"10.1109/icassp.2004.1326431","title":"Blind deconvolution using Bayesian methods with application to the dereverberation of speech","year":2004,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"McMaster University","funders":"","keywords":"Deconvolution; Blind deconvolution; Computer science; Markov chain Monte Carlo; Impulse response; Bayesian probability; Algorithm; Speech recognition; Speech enhancement; Impulse (physics); Monte Carlo method; Convolution (computer science); Finite impulse response; Artificial intelligence; Mathematics; Statistics; Noise reduction","score_opus":0.026099933942769687,"score_gpt":0.35240921105705414,"score_spread":0.3263092771142845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150057756","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.009143642,0.000009005325,0.9866274,0.002723327,0.000019572763,0.00045148292,2.1069708e-7,0.0001196498,0.00090572995],"genre_scores_gemma":[0.38290086,7.138615e-7,0.61668175,0.00036382955,0.000015199729,0.00001492333,8.1948315e-7,0.00000326624,0.000018618302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992628,0.00009782089,0.0001826737,0.00019941076,0.00016441332,0.00009287483],"domain_scores_gemma":[0.99926484,0.000034891662,0.0000961307,0.0004277004,0.00014142148,0.00003499147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006919127,0.00007126244,0.00008053877,0.0000955052,0.00008693531,0.00006895816,0.00032427587,0.000041162042,0.0000034034067],"category_scores_gemma":[0.000017650671,0.000047606518,0.000021000533,0.0005694846,0.000020105199,0.0003624233,0.000054662785,0.000057976675,0.0000059745444],"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.000027713804,0.00008563739,0.00017080756,0.000011166924,0.000021157543,4.86648e-7,0.0029882519,0.05586795,0.08134859,0.6172426,0.000090721755,0.24214491],"study_design_scores_gemma":[0.0003580328,0.00014659677,0.0007301958,0.000017802351,0.000009903477,0.00002902593,0.00006223258,0.20941232,0.7624796,0.02527371,0.0013212794,0.00015931374],"about_ca_topic_score_codex":0.00021323188,"about_ca_topic_score_gemma":0.0002530109,"teacher_disagreement_score":0.681131,"about_ca_system_score_codex":0.00006229805,"about_ca_system_score_gemma":0.000100941215,"threshold_uncertainty_score":0.19413374},"labels":[],"label_agreement":null},{"id":"W2150245243","doi":"10.1109/icassp.2009.4959923","title":"Using complex-valued ICA to efficiently combine radar polarimetric data for target detection","year":2009,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":4,"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":"Clutter; Computer science; Constant false alarm rate; Stationary target indication; Radar; Polarimetry; Remote sensing; Artificial intelligence; Continuous-wave radar; Radar horizon; Moving target indication; Computer vision; Radar imaging; Telecommunications; Geology; Physics","score_opus":0.129828893500374,"score_gpt":0.3679780190566399,"score_spread":0.2381491255562659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150245243","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.00339613,0.000025805086,0.99315447,0.0011888272,0.000117383606,0.0006394509,0.000017552715,0.0006208112,0.00083955465],"genre_scores_gemma":[0.3447284,3.7525913e-7,0.6527694,0.002361772,0.000028482018,0.0000023929156,0.000029585019,0.000006123885,0.000073471],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986076,0.00007540385,0.00026690564,0.0005031855,0.0002829018,0.00026401997],"domain_scores_gemma":[0.99843496,0.00007049009,0.00008203071,0.0011647401,0.00013610985,0.000111644156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007737807,0.00013200814,0.00017495746,0.00043091874,0.00019217253,0.00021477678,0.0013436598,0.00006151111,0.000011473875],"category_scores_gemma":[0.00015662456,0.00012666061,0.000042480362,0.0013620714,0.000013407176,0.00053677213,0.0003039577,0.00008845643,0.000015202321],"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.00014381755,0.0007511565,0.00008309049,0.000029095052,0.000058760954,0.0000052126315,0.0007562954,0.0021991744,0.528764,0.28095055,0.035400998,0.15085787],"study_design_scores_gemma":[0.00051544217,0.0005664601,0.0017081309,0.000006405106,0.000008473871,0.0000112339185,0.000010507759,0.8850174,0.08927186,0.003703275,0.018897705,0.000283122],"about_ca_topic_score_codex":0.000103279795,"about_ca_topic_score_gemma":0.00000852509,"teacher_disagreement_score":0.8828182,"about_ca_system_score_codex":0.0000606079,"about_ca_system_score_gemma":0.00005289664,"threshold_uncertainty_score":0.51650697},"labels":[],"label_agreement":null},{"id":"W2150732875","doi":"10.1109/ijcnn.2005.1556445","title":"Recurrent neural equalization for communication channels in impulsive noise environments","year":2006,"lang":"en","type":"article","venue":"Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005.","topic":"Blind Source Separation 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":"University of Ottawa","funders":"","keywords":"Extended Kalman filter; Kalman filter; Noise (video); Gaussian noise; Computer science; Control theory (sociology); Gaussian; Artificial neural network; Equalization (audio); Impulse noise; Recurrent neural network; Algorithm; Artificial intelligence; Physics; Decoding methods","score_opus":0.04623838456167524,"score_gpt":0.29709876945611363,"score_spread":0.2508603848944384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150732875","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.11387205,0.00029796548,0.8499924,0.02223392,0.0031493835,0.0032848683,0.000047342968,0.00077355525,0.006348529],"genre_scores_gemma":[0.99150336,0.0002831796,0.0055265534,0.0011448053,0.00040521496,0.00035217998,0.00014279452,0.000030017425,0.0006119159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974102,0.00006739247,0.0007753286,0.0006576027,0.0005529244,0.00053657015],"domain_scores_gemma":[0.99872494,0.000100835896,0.0005402847,0.0002767735,0.00024865317,0.00010850337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059471815,0.0003402012,0.00028992476,0.00038233877,0.00013998475,0.0005461903,0.0011376068,0.00016599993,0.000035743826],"category_scores_gemma":[0.00006684978,0.00035103736,0.000119800134,0.00022120931,0.00007528018,0.0013187021,0.00017894975,0.00039895272,0.000016813177],"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.0003195274,0.0013258228,0.0019135559,0.000043557557,0.00006327369,0.000008455742,0.0010701846,0.2129016,0.008384439,0.687464,0.044886105,0.041619454],"study_design_scores_gemma":[0.0007096038,0.00013103883,0.0012586592,0.00011414152,0.0000055873397,0.000010412604,0.000026751895,0.98397183,0.0037007444,0.0064943265,0.0032146282,0.00036227985],"about_ca_topic_score_codex":0.00004163055,"about_ca_topic_score_gemma":0.000051744093,"teacher_disagreement_score":0.8776313,"about_ca_system_score_codex":0.00030864766,"about_ca_system_score_gemma":0.00003696181,"threshold_uncertainty_score":0.99989414},"labels":[],"label_agreement":null},{"id":"W2150740090","doi":"10.1109/tcsvt.2008.2005614","title":"An ICA Mixture Hidden Markov Model for Video Content Analysis","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems for Video Technology","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Toronto Metropolitan University","funders":"","keywords":"Independent component analysis; Hidden Markov model; Mixture model; Pattern recognition (psychology); Artificial intelligence; Computer science; Subspace topology; Frame (networking); Principal component analysis; Feature (linguistics); Expectation–maximization algorithm; Gaussian; Feature vector; Mathematics; Maximum likelihood; Statistics","score_opus":0.05425878157898119,"score_gpt":0.2810052736052656,"score_spread":0.22674649202628444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150740090","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.03190143,0.00018659577,0.964451,0.00066172384,0.00022019661,0.0013063855,0.00013037084,0.0011081893,0.00003411178],"genre_scores_gemma":[0.974591,0.000051695377,0.023317968,0.00038038913,0.00002616565,0.0012617349,0.000008987344,0.000029224671,0.0003328405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979625,0.000085686734,0.0005329788,0.0008088491,0.00022368255,0.00038630975],"domain_scores_gemma":[0.9981099,0.00014047716,0.00019846446,0.0010382079,0.00036078345,0.00015218375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004729884,0.00026928718,0.00056013797,0.0011739333,0.00056762854,0.00013580902,0.0007475598,0.00037998398,0.000001978284],"category_scores_gemma":[0.000013613471,0.00025227343,0.00023334724,0.0008725085,0.00013699535,0.00061536883,0.0000035064586,0.00024850143,0.000001815028],"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.00038803302,0.004068091,0.0006948654,0.0007050093,0.004629856,0.00006969979,0.012689095,0.0908201,0.09001801,0.2895166,0.004365878,0.5020348],"study_design_scores_gemma":[0.00071760506,0.0008290168,0.000031136973,0.0000210793,0.00017806387,0.00011804776,0.00016848963,0.9843936,0.009659505,0.0024181455,0.0010971265,0.00036816197],"about_ca_topic_score_codex":0.00007550501,"about_ca_topic_score_gemma":0.0001679341,"teacher_disagreement_score":0.94268954,"about_ca_system_score_codex":0.00007110792,"about_ca_system_score_gemma":0.00010189196,"threshold_uncertainty_score":0.99999297},"labels":[],"label_agreement":null},{"id":"W2150796234","doi":"10.1109/icassp.2008.4517553","title":"Blind source separation in a distributed microphone meeting environment for improved teleconferencing","year":2008,"lang":"en","type":"article","venue":"Proceedings of the ... IEEE International Conference on Acoustics, Speech, and Signal Processing","topic":"Blind Source Separation 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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Teleconference; Computer science; Microphone; Blind signal separation; Exploit; Scheme (mathematics); Speech recognition; Source separation; Perspective (graphical); Noise (video); Artificial intelligence; Multimedia; Telecommunications","score_opus":0.03813966876019507,"score_gpt":0.280738313503972,"score_spread":0.24259864474377693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150796234","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.30841088,0.00002909113,0.6888369,0.0013101123,0.000096744036,0.0004703464,0.000016350323,0.00007395219,0.00075562426],"genre_scores_gemma":[0.9458443,0.00007844527,0.05353465,0.00021526776,0.0000808615,0.000039666887,0.000006009541,0.000014772233,0.0001860233],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984096,0.000014805366,0.00052444625,0.00044977752,0.00035635525,0.0002449873],"domain_scores_gemma":[0.9987137,0.00007942027,0.00051403925,0.00009590384,0.0005374278,0.00005955194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005052258,0.0002185047,0.0002503266,0.0002025658,0.00023459058,0.00025428855,0.00073915516,0.00011701693,0.000006176137],"category_scores_gemma":[0.000114826296,0.00018717465,0.00006686501,0.00017497392,0.00014608528,0.00053562014,0.00014646511,0.0002791665,0.0000011049322],"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.00017951483,0.00018160947,0.00056221575,0.000097513475,0.000026203013,9.325746e-7,0.0023714448,0.000986602,0.97032064,0.003322489,0.00021130132,0.021739526],"study_design_scores_gemma":[0.001049072,0.00018393683,0.00057196955,0.00035917197,0.000014509028,0.000038386148,0.00041693504,0.69132924,0.2981639,0.0073215077,0.00023741832,0.00031394328],"about_ca_topic_score_codex":0.000027582473,"about_ca_topic_score_gemma":0.0000037095444,"teacher_disagreement_score":0.69034266,"about_ca_system_score_codex":0.00011384651,"about_ca_system_score_gemma":0.00015224367,"threshold_uncertainty_score":0.76327604},"labels":[],"label_agreement":null},{"id":"W2151017751","doi":"10.1109/tnn.2003.810598","title":"On the number of multilinear partitions and the computing capacity of multiple-valued multiple-threshold perceptrons","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Blind Source Separation Techniques","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 Ottawa; University of Windsor","funders":"","keywords":"Multilinear map; Computer science; Perceptron; Artificial intelligence; Algorithm; Mathematics; Artificial neural network","score_opus":0.029490921595146106,"score_gpt":0.26580440332802663,"score_spread":0.23631348173288053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151017751","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.33688006,0.000009509701,0.66186696,0.00043609075,0.000162716,0.00036285282,0.000007209303,0.000087230255,0.00018734625],"genre_scores_gemma":[0.9920389,0.00001868495,0.0072788424,0.0005671183,0.000017471732,0.000037077498,6.7668793e-7,0.000013922902,0.000027270617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823004,0.0005582172,0.00041908654,0.0002910339,0.00026370972,0.00023793387],"domain_scores_gemma":[0.99696416,0.002078295,0.00017628771,0.00060805265,0.0001125168,0.00006068888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006554552,0.00018961262,0.00025578044,0.000059781585,0.00040970076,0.000056120345,0.00039190098,0.00010191359,0.000023684928],"category_scores_gemma":[0.000059056078,0.00011975171,0.000184124,0.0003706966,0.00047835434,0.00015714063,0.000005936445,0.00058078184,0.0000028313189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010857265,0.0003581472,0.00042960883,0.000011144025,0.00006359286,8.711103e-7,0.0025203284,0.9424479,0.0004922008,0.05092078,0.00017852419,0.0024683278],"study_design_scores_gemma":[0.00093396154,0.00006307415,0.00039699033,0.000031345415,0.000019815374,0.000012883345,0.000082461964,0.99048203,0.0071001244,0.00073685456,0.000023558374,0.00011690352],"about_ca_topic_score_codex":0.0000658118,"about_ca_topic_score_gemma":0.00007023115,"teacher_disagreement_score":0.6551589,"about_ca_system_score_codex":0.00001683664,"about_ca_system_score_gemma":0.000017881108,"threshold_uncertainty_score":0.4883333},"labels":[],"label_agreement":null},{"id":"W2151773422","doi":"10.4018/jcini.2008100104","title":"Robust Independent Component Analysis for Cognitive Informatics","year":2008,"lang":"en","type":"article","venue":"International Journal of Cognitive Informatics and Natural Intelligence","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":"University of Manitoba","funders":"","keywords":"FastICA; Infomax; Independent component analysis; Outlier; Computer science; Sensitivity (control systems); Pattern recognition (psychology); Negentropy; Divergence (linguistics); Artificial intelligence; Contrast (vision); Algorithm; Mathematics; Blind signal separation","score_opus":0.045050202581262126,"score_gpt":0.31158842576101337,"score_spread":0.26653822317975123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151773422","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.1273191,0.00020280472,0.87123877,0.00018657035,0.000351841,0.00021176052,0.00003083672,0.000028411328,0.00042988796],"genre_scores_gemma":[0.9288183,0.0005594327,0.069239214,0.0012279806,0.00006255193,0.0000085530455,0.000038601676,0.0000052146484,0.00004017976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757326,0.000045007488,0.0012809756,0.00008802043,0.00082813366,0.00018458033],"domain_scores_gemma":[0.99399614,0.00095041754,0.0011790027,0.000090352245,0.003663571,0.00012053424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071791897,0.00018855707,0.00033344483,0.00088820804,0.0001276488,0.00026620025,0.0007809805,0.00008317073,0.000009908964],"category_scores_gemma":[0.0004864317,0.0001555452,0.00025175462,0.000431595,0.00014847617,0.0020752952,0.00021462608,0.00039162673,0.0000058977676],"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.0023020213,0.0015361863,0.022051964,0.0002273232,0.017112039,0.00029097096,0.22170684,0.023215085,0.00018050219,0.13922332,0.0016184067,0.57053536],"study_design_scores_gemma":[0.00197217,0.0010501913,0.017397957,0.0006378654,0.00045932116,0.001969533,0.009879583,0.9345814,0.022853332,0.0070241718,0.0012959834,0.0008785138],"about_ca_topic_score_codex":0.0000056003555,"about_ca_topic_score_gemma":0.000004912163,"teacher_disagreement_score":0.9113663,"about_ca_system_score_codex":0.00006619656,"about_ca_system_score_gemma":0.00014916739,"threshold_uncertainty_score":0.6342949},"labels":[],"label_agreement":null},{"id":"W2152161325","doi":"10.1109/wcre.2008.49","title":"Automated Concept Location Using Independent Component Analysis","year":2008,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Independent component analysis; Computer science; Singular value decomposition; Source code; Code (set theory); Component (thermodynamics); Blind signal separation; Data mining; Search engine indexing; Source separation; Decomposition; Artificial intelligence; Principal component analysis; Pattern recognition (psychology); Programming language","score_opus":0.03678792353322075,"score_gpt":0.29718279980934453,"score_spread":0.2603948762761238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152161325","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.112138696,0.000019790445,0.884851,0.00019622312,0.00003440802,0.00009180502,3.239592e-7,0.0017442927,0.00092347],"genre_scores_gemma":[0.8764451,0.0000026061873,0.12298765,0.00042374854,0.000007937411,0.0000034588982,0.000006747525,0.0000032331443,0.00011948429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990359,0.00010246871,0.00021263934,0.0002359656,0.0002902236,0.0001228238],"domain_scores_gemma":[0.9992928,0.000024927334,0.000088260436,0.00038359792,0.00015592408,0.000054517546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019050213,0.00008224942,0.00013690494,0.00027780875,0.00012554217,0.00006716433,0.00035462226,0.00005179088,0.00003303468],"category_scores_gemma":[0.000008682905,0.00007644962,0.000060201415,0.0013676409,0.000037102764,0.0003897415,0.00010271209,0.000065433975,0.000023310895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014530544,0.0010126231,0.02902383,0.00001813058,0.0013964468,0.00011365068,0.026961565,0.56545055,0.0211671,0.33856407,0.010773603,0.0055039185],"study_design_scores_gemma":[0.00009300624,0.00001455648,0.018735668,0.0000016774088,0.00001844207,0.000016514394,0.000016399203,0.96872956,0.0120209055,0.00011695853,0.00013306632,0.000103255996],"about_ca_topic_score_codex":0.00025623536,"about_ca_topic_score_gemma":0.000016940205,"teacher_disagreement_score":0.7643064,"about_ca_system_score_codex":0.00006553539,"about_ca_system_score_gemma":0.000074883734,"threshold_uncertainty_score":0.3117525},"labels":[],"label_agreement":null},{"id":"W2152667044","doi":"10.1109/nafips.2004.1337410","title":"Estimating outlier impact on FastICA using fuzzy inference","year":2004,"lang":"en","type":"article","venue":"IEEE Annual Meeting of the Fuzzy Information, 2004. Processing NAFIPS '04.","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":"University of Manitoba","funders":"","keywords":"FastICA; Outlier; Independent component analysis; Robustness (evolution); Computer science; Pattern recognition (psychology); Artificial intelligence; Estimator; Anomaly detection; Fuzzy logic; Mathematics; Algorithm; Blind signal separation; Statistics","score_opus":0.018901864679363927,"score_gpt":0.30212576289445076,"score_spread":0.2832238982150868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152667044","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.26550984,0.00011429261,0.72471195,0.0009899118,0.00070308556,0.00060164323,0.000037683403,0.00074720883,0.00658438],"genre_scores_gemma":[0.84332585,0.0000021120775,0.15576401,0.0007413032,0.00010717734,0.000014346975,0.0000051719667,0.000019447676,0.000020539492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969231,0.00013584866,0.0011171949,0.00030837493,0.00097493874,0.00054054015],"domain_scores_gemma":[0.99665827,0.00018043943,0.0012631956,0.00074640696,0.001014605,0.00013707255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013689084,0.00039150647,0.00037601936,0.0004029201,0.0007165901,0.00063850393,0.0015670215,0.00018924335,0.000001976192],"category_scores_gemma":[0.0011547975,0.00028987756,0.00017555311,0.0012733182,0.00017180527,0.004908451,0.00023493105,0.0004982336,0.00004118546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039177783,0.00013700848,0.00059690455,0.00020836518,0.000039482187,0.0000013464795,0.027653735,0.9413976,0.0007979883,0.0044116625,0.001094069,0.023622645],"study_design_scores_gemma":[0.003924566,0.0013226102,0.006523722,0.008018355,0.00017855738,0.00024701134,0.0024994293,0.75768447,0.11848734,0.09668673,0.0013119866,0.003115228],"about_ca_topic_score_codex":0.00016922355,"about_ca_topic_score_gemma":0.0000035129558,"teacher_disagreement_score":0.57781607,"about_ca_system_score_codex":0.00029451164,"about_ca_system_score_gemma":0.0010131021,"threshold_uncertainty_score":0.99995536},"labels":[],"label_agreement":null},{"id":"W2152767489","doi":"10.1109/tbme.2008.918439","title":"Investigation of Short-Term Changes in Visual Evoked Potentials With Windowed Adaptive Chirplet Transform","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Biomedical Engineering","topic":"Blind Source Separation 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 Toronto","funders":"","keywords":"SIGNAL (programming language); Computer science; Pattern recognition (psychology); Chirp; Artificial intelligence; Transient (computer programming); Speech recognition; Time–frequency analysis; Feature extraction; Segmentation; Signal processing; Term (time); Feature (linguistics); Instantaneous phase; Computer vision; Optics; Physics","score_opus":0.02056197527131659,"score_gpt":0.237044817963383,"score_spread":0.2164828426920664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152767489","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.18691139,0.000008368456,0.81210446,0.0004016641,0.000091513386,0.00022856469,0.000005736659,0.00022588311,0.000022406608],"genre_scores_gemma":[0.97983485,0.00004603039,0.019941231,0.000059728223,0.000018819346,0.00006740619,0.0000038612384,0.000015234161,0.000012818174],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99878,0.00003521097,0.0002862177,0.0002604863,0.00042263774,0.00021544624],"domain_scores_gemma":[0.99953514,0.00006641103,0.00004001894,0.00018437346,0.000043478125,0.00013058486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019846398,0.00016567994,0.00023232598,0.00057744695,0.000052395346,0.000014685978,0.00024555778,0.00012574228,0.000008396628],"category_scores_gemma":[0.000003209723,0.00014951298,0.000052449195,0.0008065791,0.00011738092,0.00029605124,0.0000017410705,0.0002656357,0.0000017891747],"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.00035785232,0.0011277572,0.00023507302,0.00023012755,0.00033364765,0.00022233174,0.022142794,0.068069205,0.8199365,0.002133327,0.000054136402,0.08515723],"study_design_scores_gemma":[0.0009295098,0.0011261632,0.0039621126,0.00022581346,0.00001474385,0.000074380085,0.000036978996,0.2480262,0.7451189,0.000060928327,0.00006781233,0.00035641683],"about_ca_topic_score_codex":0.000023494189,"about_ca_topic_score_gemma":0.0000332246,"teacher_disagreement_score":0.7929235,"about_ca_system_score_codex":0.00005604174,"about_ca_system_score_gemma":0.000082327126,"threshold_uncertainty_score":0.6096962},"labels":[],"label_agreement":null},{"id":"W2153219604","doi":"10.1109/icassp.2009.4960146","title":"Subspace tracking of fast time-varying channels in precoded MIMO-OFDM systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McGill University","funders":"","keywords":"Subspace topology; Orthogonal frequency-division multiplexing; Channel (broadcasting); Computer science; MIMO; Wireless; Algorithm; Tracking (education); Precoding; Real-time computing; Telecommunications; Artificial intelligence","score_opus":0.021547568960718907,"score_gpt":0.2676734607623779,"score_spread":0.246125891801659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153219604","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.07141743,0.00012943197,0.9001718,0.0010436617,0.00013432803,0.0004363579,6.837029e-7,0.0005716974,0.026094614],"genre_scores_gemma":[0.9760708,0.000005571787,0.022535902,0.00018561861,0.000023313178,0.000008113713,0.000001129787,0.000005575663,0.001163957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887836,0.000107870124,0.000327065,0.0002639042,0.00021725189,0.00020554067],"domain_scores_gemma":[0.9993213,0.00006410424,0.00012481734,0.00036649767,0.000078072175,0.000045226203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054230413,0.000115113886,0.00022414656,0.00023428902,0.000030020707,0.00014323655,0.00052344933,0.00007884278,0.000010670872],"category_scores_gemma":[0.000023839555,0.00010517096,0.000044835262,0.00048373046,0.000013131082,0.00065902463,0.000053586846,0.000111633904,0.000020169564],"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.000069962116,0.0014946244,0.0023677757,0.00025728016,0.000072137496,0.00006758167,0.063702695,0.05710462,0.22737138,0.46392554,0.007999086,0.17556731],"study_design_scores_gemma":[0.0004549427,0.00022837505,0.0011239216,0.00022268135,0.0000029431333,0.000019301777,0.00012567117,0.7924904,0.20217854,0.002378227,0.00042423332,0.00035072322],"about_ca_topic_score_codex":0.000064146385,"about_ca_topic_score_gemma":0.0000062779604,"teacher_disagreement_score":0.9046534,"about_ca_system_score_codex":0.000031525546,"about_ca_system_score_gemma":0.00003566282,"threshold_uncertainty_score":0.42887476},"labels":[],"label_agreement":null},{"id":"W2153643969","doi":"10.1109/iscas.1993.393821","title":"Blind deconvolution of linear systems driven by non-stationary source based on almost-symmetrical time-varying ARMA model","year":2002,"lang":"en","type":"article","venue":"1993 IEEE International Symposium on Circuits and Systems","topic":"Blind Source Separation 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":"Concordia University","funders":"","keywords":"Deconvolution; Blind deconvolution; Convolution (computer science); Autoregressive model; Autoregressive–moving-average model; Uniqueness; Envelope (radar); Algorithm; Mathematics; Blind signal separation; Applied mathematics; Source model; Computer science; Artificial intelligence; Statistics; Mathematical analysis; Theoretical computer science; Channel (broadcasting); Telecommunications; Artificial neural network","score_opus":0.034283883708854476,"score_gpt":0.2684531203520305,"score_spread":0.23416923664317602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153643969","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.040409125,0.00017595444,0.9446256,0.0011184354,0.0010530086,0.0007845637,0.00012846809,0.00024473557,0.0114601],"genre_scores_gemma":[0.99658006,0.00004215648,0.0005705919,0.0004231422,0.00017253996,0.00008755679,0.00005751408,0.00002843573,0.0020379724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719584,0.00018708642,0.00073648465,0.00058787887,0.0010413962,0.0002513202],"domain_scores_gemma":[0.9982439,0.00040521324,0.0004523674,0.00040037293,0.00034882175,0.00014926872],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056366436,0.00026496578,0.00035512375,0.00045923682,0.00016012229,0.00024617606,0.00066382927,0.00018572297,0.000010112901],"category_scores_gemma":[0.00004016231,0.00025672888,0.00010485329,0.00034869884,0.000052521347,0.00045259763,0.00004833803,0.00023613172,0.00006978356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041017924,0.00065612944,0.00060691393,0.000090980466,0.00010487264,0.000009087596,0.0010361108,0.95148665,0.02296129,0.007922526,0.013119145,0.0019652972],"study_design_scores_gemma":[0.00087017956,0.00026954786,0.00004061263,0.00019001988,0.000008868355,0.000021672658,0.000016211116,0.99480283,0.0017713221,0.000021627371,0.0017326681,0.0002544226],"about_ca_topic_score_codex":0.000097076954,"about_ca_topic_score_gemma":5.0375724e-7,"teacher_disagreement_score":0.956171,"about_ca_system_score_codex":0.0001798346,"about_ca_system_score_gemma":0.000041956955,"threshold_uncertainty_score":0.9999885},"labels":[],"label_agreement":null},{"id":"W2154106747","doi":"10.1109/icassp.2010.5495635","title":"Improving classification performance of linear feature extraction algorithms","year":2010,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Toronto","funders":"","keywords":"Linear discriminant analysis; Feature extraction; Pattern recognition (psychology); Computer science; Artificial intelligence; Algorithm; Feature vector; Feature (linguistics); Bayesian probability; Bayesian optimization; Gaussian; Matrix (chemical analysis); Transformation matrix; Mathematics","score_opus":0.017120103671562078,"score_gpt":0.2838714857956266,"score_spread":0.2667513821240645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154106747","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.1787513,0.0000036038894,0.81649095,0.0007082289,0.00019383323,0.000093838054,3.0741325e-7,0.00028471657,0.003473238],"genre_scores_gemma":[0.6085185,0.000003848155,0.39083272,0.00006949281,0.000036348636,0.0000057297416,0.0000015742772,0.0000028827494,0.0005289443],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944925,0.000017126842,0.00012942521,0.00016675603,0.00015513647,0.000082275976],"domain_scores_gemma":[0.99932086,0.000025873269,0.000121770594,0.0003679005,0.00013436539,0.000029231735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030972977,0.00005954954,0.000062224426,0.000082274644,0.000058686306,0.000041660118,0.0003064901,0.00009841546,0.000012208147],"category_scores_gemma":[0.000025838805,0.000051567185,0.00002587436,0.00019793642,0.00002181197,0.00076466624,0.000044110755,0.00025236345,0.000013020826],"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.0000031322718,0.000049088845,0.0006301676,0.000012882448,0.0000025618076,1.9726595e-7,0.00028104783,0.000011411889,0.67675656,0.04488484,0.0004466898,0.27692142],"study_design_scores_gemma":[0.000054713368,0.00004800898,0.0086082285,0.000002640285,0.0000011402743,0.000007184168,0.000010898939,0.6349778,0.35367823,0.00011061945,0.0024359934,0.00006450189],"about_ca_topic_score_codex":0.000017529941,"about_ca_topic_score_gemma":0.000008816322,"teacher_disagreement_score":0.63496643,"about_ca_system_score_codex":0.0000080040945,"about_ca_system_score_gemma":0.000042780204,"threshold_uncertainty_score":0.21028487},"labels":[],"label_agreement":null},{"id":"W2154331663","doi":"10.1109/iccis.2004.1460475","title":"An EM based method for semi blind identification of linear systems driven by chaotic signals","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Calgary","funders":"","keywords":"Estimator; Chaotic; Kalman filter; Computer science; Control theory (sociology); Extended Kalman filter; Nonlinear system; Maximization; Identification (biology); Expectation–maximization algorithm; Estimation theory; Filter (signal processing); System identification; Algorithm; Mathematics; Mathematical optimization; Maximum likelihood; Artificial intelligence; Data modeling; Statistics","score_opus":0.030617018311292973,"score_gpt":0.3462782197566344,"score_spread":0.31566120144534143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154331663","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.004702307,0.00003358706,0.9934639,0.00071894366,0.000049517697,0.00061148976,0.000012565062,0.0002983781,0.000109311986],"genre_scores_gemma":[0.56556326,9.940281e-7,0.43366122,0.0002499254,0.000037333044,0.00006410758,0.000018809906,0.00000761898,0.00039671382],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986759,0.00019634471,0.00045447715,0.0003055281,0.00023382079,0.00013393437],"domain_scores_gemma":[0.9987143,0.00016692022,0.000245507,0.00054364227,0.0002649396,0.00006467548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013536494,0.00009712489,0.00017277092,0.00014363152,0.000059521906,0.00014231345,0.0005895621,0.00008725166,0.000009753009],"category_scores_gemma":[0.000038402126,0.000090268,0.000058547263,0.0002450693,0.00001576166,0.00052772445,0.000024527335,0.000053973105,0.000010129679],"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.000028151748,0.00058403274,0.00006523073,0.00012257344,0.000039593666,2.83785e-7,0.0025672168,0.092405975,0.8086187,0.06278935,0.009535692,0.02324315],"study_design_scores_gemma":[0.00017520189,0.00007310851,0.000012550202,0.0000069098223,0.0000042713323,5.1932193e-7,0.00002985632,0.64912516,0.34926328,0.00015702414,0.001082777,0.0000693333],"about_ca_topic_score_codex":0.000018452778,"about_ca_topic_score_gemma":0.000007657864,"teacher_disagreement_score":0.560861,"about_ca_system_score_codex":0.000026012734,"about_ca_system_score_gemma":0.00005464804,"threshold_uncertainty_score":0.3681022},"labels":[],"label_agreement":null},{"id":"W2154346342","doi":"10.1109/pimrc.2007.4394546","title":"Subspace-based Blind Channel Estimation for MIMO-OFDM Systems: Reducing the Time Averaging Interval of the Correlation Matrix","year":2007,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Cyclic prefix; Algorithm; Orthogonal frequency-division multiplexing; Subspace topology; Signal subspace; Orthogonality; Channel (broadcasting); Linear subspace; Computer science; Mathematics; Covariance matrix; Noise (video); Artificial intelligence; Telecommunications","score_opus":0.019090654179685876,"score_gpt":0.2865254469943403,"score_spread":0.26743479281465443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154346342","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.01766929,0.000036044272,0.97796375,0.002143179,0.00031350984,0.00087387126,0.0000015063843,0.00020040951,0.0007984147],"genre_scores_gemma":[0.9512345,4.055219e-7,0.04756262,0.00020129548,0.000043807646,0.000028573177,0.000004689338,0.000009864432,0.0009142468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988563,0.00011661647,0.0003771392,0.00020350475,0.00027569887,0.00017074936],"domain_scores_gemma":[0.9985287,0.00044739767,0.00031153247,0.00049016596,0.00019477423,0.000027402624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022180718,0.00010665197,0.0001262362,0.00013196249,0.00018475685,0.00014919575,0.00057020434,0.000072960145,0.000004121726],"category_scores_gemma":[0.00012359954,0.00006557013,0.00009350951,0.00039382165,0.00004122191,0.00034238712,0.00008034806,0.00011562214,0.000008919498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018199919,0.00020886789,0.00036934024,0.00023381835,0.00007143949,0.000001109108,0.0153123615,0.73458487,0.008847855,0.21577378,0.008469047,0.015945535],"study_design_scores_gemma":[0.00027777127,0.000045095163,0.00025842656,0.00009072335,0.000008663374,0.0000043685204,0.0000946861,0.9726372,0.025466064,0.00086792995,0.0001690912,0.000079988495],"about_ca_topic_score_codex":0.00007029492,"about_ca_topic_score_gemma":0.0000087134795,"teacher_disagreement_score":0.9335652,"about_ca_system_score_codex":0.000066824345,"about_ca_system_score_gemma":0.00007612792,"threshold_uncertainty_score":0.2673872},"labels":[],"label_agreement":null},{"id":"W2154740766","doi":"10.1109/icassp.2003.1201769","title":"Blind identifiability of third-order Volterra nonlinear systems","year":2004,"lang":"en","type":"article","venue":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","topic":"Blind Source Separation 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":"University of Ottawa","funders":"","keywords":"Identifiability; Unobservable; Nonlinear system; Kernel (algebra); Volterra series; Mathematics; Computer science; Higher-order statistics; Applied mathematics; Kernel density estimation; Control theory (sociology); Algorithm; Mathematical optimization; Signal processing; Statistics; Artificial intelligence; Econometrics; Telecommunications","score_opus":0.04646408802605674,"score_gpt":0.3100364273794665,"score_spread":0.2635723393534098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154740766","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.054596648,0.00016828036,0.90307045,0.00061936415,0.0014570635,0.0010787192,0.00008039109,0.00057279156,0.0383563],"genre_scores_gemma":[0.8731825,0.00013970643,0.12433654,0.00053374376,0.00032667656,0.000052911062,0.000021120712,0.000038021728,0.0013688016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959504,0.000043109274,0.0010773544,0.0010446239,0.0013858894,0.0004985942],"domain_scores_gemma":[0.9890178,0.000019825342,0.00084148266,0.00030302053,0.009564219,0.00025368444],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010760177,0.00050332793,0.00056348543,0.00046049515,0.00024857724,0.0012813589,0.0013977165,0.000353196,0.000077893965],"category_scores_gemma":[0.0005693114,0.00047338125,0.00006915924,0.0010505372,0.00039674476,0.0014276939,0.00018757448,0.00069565565,0.00006521908],"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.00039800286,0.002147473,0.0011177764,0.0009405541,0.0002443153,0.000062817104,0.0047300477,0.0017205074,0.044076197,0.9254389,0.009295424,0.009827974],"study_design_scores_gemma":[0.0023323493,0.0007913471,0.0005236828,0.0009549232,0.0000652488,0.00017054165,0.00095214706,0.9467286,0.034828663,0.00865413,0.0028489316,0.0011494778],"about_ca_topic_score_codex":0.000100723366,"about_ca_topic_score_gemma":0.0000084561925,"teacher_disagreement_score":0.94500804,"about_ca_system_score_codex":0.00020687241,"about_ca_system_score_gemma":0.0010823854,"threshold_uncertainty_score":0.9997718},"labels":[],"label_agreement":null},{"id":"W2155061848","doi":"10.1109/spawc.2005.1506275","title":"Blind particle filtering for detection in a time-varying frequency selective channel with non-Gaussian noise","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McMaster University","funders":"","keywords":"Smoothing; Gaussian noise; Noise (video); Computer science; Gaussian; Algorithm; Particle filter; Channel (broadcasting); Sampling (signal processing); Artificial intelligence; Kalman filter; Telecommunications; Filter (signal processing); Computer vision","score_opus":0.015456518886530204,"score_gpt":0.2577649085409638,"score_spread":0.24230838965443358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155061848","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.16119693,0.00000551527,0.8355678,0.0006718823,0.000015258601,0.00045348145,5.016118e-7,0.0002825058,0.0018061241],"genre_scores_gemma":[0.8461364,9.699276e-7,0.15311734,0.00031182767,0.000039533326,0.0001887505,7.865676e-7,0.000010690721,0.00019369918],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990455,0.000033549353,0.00018964185,0.00032176613,0.00014539908,0.00026418178],"domain_scores_gemma":[0.9995306,0.00004838246,0.00006164839,0.0002303068,0.00006851916,0.00006052105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031385542,0.000117280826,0.00012012936,0.00014535598,0.00009394737,0.00014804488,0.00028234525,0.00005837474,0.000008536552],"category_scores_gemma":[0.000017309016,0.00010256674,0.000029709197,0.0005011525,0.000015615386,0.0009662719,0.000053580894,0.000110072695,0.00002476641],"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.00058067834,0.0010811221,0.0020238112,0.00007421934,0.00009514388,0.000020529342,0.03146932,0.016039576,0.7578769,0.010789152,0.00037695566,0.17957261],"study_design_scores_gemma":[0.00070980994,0.00024381596,0.00073999446,0.000019016901,0.0000021419266,0.000008580659,0.0000144717005,0.46958897,0.5275169,0.00096297776,0.00004784992,0.00014545996],"about_ca_topic_score_codex":0.000058965874,"about_ca_topic_score_gemma":0.00030197125,"teacher_disagreement_score":0.68493944,"about_ca_system_score_codex":0.000090971706,"about_ca_system_score_gemma":0.0000457439,"threshold_uncertainty_score":0.41825503},"labels":[],"label_agreement":null},{"id":"W2155435112","doi":"10.1109/tbme.2006.876619","title":"Optimal reduction of MCG in fetal MEG recordings","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Biomedical Engineering","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Welichem Biotech (Canada)","funders":"National Institute of Biomedical Imaging and Bioengineering; National Institute of Neurological Disorders and Stroke","keywords":"Magnetoencephalography; Magnetocardiography; In utero; SIGNAL (programming language); Signal-to-noise ratio (imaging); Projection (relational algebra); Fetus; Noise reduction; Biomedical engineering; Speech recognition; Medicine; Electroencephalography; Computer science; Neuroscience; Artificial intelligence; Pregnancy; Biology; Internal medicine; Algorithm; Telecommunications","score_opus":0.007006886011178489,"score_gpt":0.21886289499352207,"score_spread":0.21185600898234358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155435112","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.054754626,0.00001009627,0.9439367,0.00042132067,0.0003810506,0.00008506375,0.000002396383,0.00029378527,0.00011494257],"genre_scores_gemma":[0.9014395,0.0000082596525,0.098437496,0.000012840319,0.000030841587,0.000019839423,0.0000011303077,0.000008887429,0.000041217452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990724,0.000018824237,0.00029665662,0.00020544798,0.0002418364,0.00016486092],"domain_scores_gemma":[0.9996486,0.000039298873,0.000051653926,0.00018222112,0.000025247851,0.000052979973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022353878,0.000102132115,0.0001370578,0.00047088152,0.000025694222,0.000021601789,0.0002186624,0.0001053614,0.000009452745],"category_scores_gemma":[0.000005237349,0.00010707417,0.000064564105,0.00071099965,0.00003711719,0.0002623835,0.000001961968,0.0002400722,0.000005024423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030176314,0.0008614976,0.0000069496336,0.00006334911,0.000032690423,0.000019185876,0.00070877164,0.6284285,0.24436404,0.010534002,0.00039547982,0.11455533],"study_design_scores_gemma":[0.00047077853,0.0002057535,0.00023429304,0.00009100925,0.0000055941186,0.000045647037,0.000019230285,0.6606798,0.3362827,0.00017678215,0.0015507713,0.00023763903],"about_ca_topic_score_codex":0.00009734203,"about_ca_topic_score_gemma":0.0000035768696,"teacher_disagreement_score":0.8466849,"about_ca_system_score_codex":0.0000629814,"about_ca_system_score_gemma":0.000028812718,"threshold_uncertainty_score":0.43663582},"labels":[],"label_agreement":null},{"id":"W2155884633","doi":"10.1109/ccece.2004.1349668","title":"A study of outliers for robust independent component analysis","year":2004,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Manitoba","funders":"","keywords":"Independent component analysis; FastICA; Outlier; Robustness (evolution); Estimator; Cluster analysis; Computer science; Robust statistics; Pattern recognition (psychology); Artificial intelligence; Divergence (linguistics); Mathematics; Algorithm; Blind signal separation; Statistics; Channel (broadcasting)","score_opus":0.041522636349222236,"score_gpt":0.29741255646833575,"score_spread":0.2558899201191135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155884633","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.2163679,0.000002920898,0.78230566,0.00025277547,0.000020715477,0.0003871351,7.1465007e-7,0.00013890545,0.0005232392],"genre_scores_gemma":[0.82665837,4.8488755e-7,0.17311287,0.00012241358,0.0000036687086,0.000038812464,0.0000014347047,0.0000028353916,0.000059103008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913514,0.00003421941,0.00024188586,0.00022985021,0.0002549389,0.00010396159],"domain_scores_gemma":[0.99931824,0.000031873773,0.00009539443,0.00040956985,0.00010414161,0.000040770094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035204858,0.00007194295,0.0001840021,0.00029895085,0.00004314948,0.000051126714,0.00047177848,0.000029977891,0.0000048360967],"category_scores_gemma":[0.000009917603,0.00006166333,0.0000996402,0.0006321669,0.000011996108,0.00015778666,0.000109922636,0.000045450903,0.0000020465727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040637493,0.0065058335,0.015536696,0.000020538637,0.0019441154,0.000010550695,0.043585636,0.55060786,0.0008858791,0.37549353,0.0004618598,0.0049068504],"study_design_scores_gemma":[0.021410748,0.01134931,0.24188536,0.000041449326,0.0019456531,0.000017501507,0.026352456,0.5390517,0.10468207,0.0495376,0.0011677516,0.00255841],"about_ca_topic_score_codex":0.00022044554,"about_ca_topic_score_gemma":0.00043105436,"teacher_disagreement_score":0.61029047,"about_ca_system_score_codex":0.00004327698,"about_ca_system_score_gemma":0.000039337116,"threshold_uncertainty_score":0.25145578},"labels":[],"label_agreement":null},{"id":"W2156019666","doi":"10.1109/issse.2007.4294542","title":"Binary Chirp Signals in - Mixture Noise: Coherent and Noncoherent Detection","year":2007,"lang":"en","type":"article","venue":"","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":"Western University","funders":"","keywords":"Gaussian noise; Chirp; Noise (video); Binary number; Additive white Gaussian noise; Signal-to-noise ratio (imaging); Probability density function; Algorithm; Detection theory; Modulation (music); SIGNAL (programming language); Gaussian; Computer science; Speech recognition; Mathematics; Acoustics; Physics; Statistics; Detector; Telecommunications; Artificial intelligence; White noise; Optics","score_opus":0.011076437247774703,"score_gpt":0.2669184115993481,"score_spread":0.2558419743515734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156019666","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.28186145,0.00010070426,0.7118182,0.00043010354,0.00007287468,0.00023969606,2.1696339e-7,0.00026031316,0.0052164164],"genre_scores_gemma":[0.98046005,0.000014337536,0.018621102,0.0005651314,0.000025529072,0.000014035759,7.586688e-7,0.0000053723124,0.00029370585],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991352,0.000052400108,0.00021053679,0.00025788968,0.00016839337,0.00017558114],"domain_scores_gemma":[0.9995585,0.00006210179,0.000054015964,0.00022179296,0.000034682194,0.00006891165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006199634,0.000101160134,0.000105032304,0.00019247981,0.00004595246,0.00008748516,0.00020940605,0.00008967679,0.000024419649],"category_scores_gemma":[0.000011738785,0.00008709181,0.0000236561,0.0003257084,0.000021598198,0.00031212828,0.00011235345,0.000152864,0.000011706174],"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.00007293569,0.0005548662,0.0062726107,0.000046485024,0.000023205937,0.000074415046,0.00447357,0.0002496279,0.37743875,0.024933638,0.0025540371,0.5833059],"study_design_scores_gemma":[0.00093998027,0.0006569304,0.12530959,0.00006008598,0.000004688611,0.00005075013,0.00014638931,0.039021857,0.81482446,0.0077658743,0.010651082,0.000568325],"about_ca_topic_score_codex":0.000071893315,"about_ca_topic_score_gemma":0.00040432723,"teacher_disagreement_score":0.69859856,"about_ca_system_score_codex":0.000041985182,"about_ca_system_score_gemma":0.000019394869,"threshold_uncertainty_score":0.35515007},"labels":[],"label_agreement":null},{"id":"W2156716075","doi":"10.1109/ccece.2007.226","title":"Analysis of Modulated Monofractal Noise","year":2007,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multifractal system; Baseband; Noise (video); Spectral density; Statistical physics; Modulation (music); Amplitude modulation; Physics; Frequency modulation; Computer science; Acoustics; Mathematics; Fractal; Telecommunications; Bandwidth (computing); Artificial intelligence","score_opus":0.011740437139374494,"score_gpt":0.2796253203930954,"score_spread":0.2678848832537209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156716075","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.2928782,0.000004188822,0.69631726,0.000092724214,0.00001095727,0.000029036539,2.550603e-7,0.00016976082,0.0104976],"genre_scores_gemma":[0.91986585,0.0000011382295,0.07964598,0.00022783392,0.0000030621738,6.001483e-7,0.000001896136,0.0000017143508,0.0002519164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994219,0.000016519887,0.00018865205,0.00013231488,0.0001490636,0.000091555536],"domain_scores_gemma":[0.99943554,0.000047522615,0.000065440836,0.0003326532,0.000081301645,0.000037533486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004415011,0.00004551604,0.00011338431,0.00042312394,0.000015159565,0.000022899727,0.0003038059,0.00003828073,0.000035760353],"category_scores_gemma":[0.000013159284,0.00003991625,0.00007718953,0.0015221243,0.000013499342,0.0002243496,0.00006298872,0.00003898771,0.0000068047593],"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.00002737487,0.0005664319,0.046456967,0.000008003943,0.0013356053,0.00002104035,0.0053677056,0.007839097,0.09293071,0.53528607,0.0013073926,0.3088536],"study_design_scores_gemma":[0.00007829637,0.000037517282,0.09870131,0.0000012434166,0.00004734115,7.50647e-7,0.0000175085,0.74529153,0.15423387,0.0010656032,0.0004214678,0.00010354681],"about_ca_topic_score_codex":0.00008028038,"about_ca_topic_score_gemma":0.00004056082,"teacher_disagreement_score":0.73745245,"about_ca_system_score_codex":0.000009892296,"about_ca_system_score_gemma":0.000012174473,"threshold_uncertainty_score":0.16277374},"labels":[],"label_agreement":null},{"id":"W2156735594","doi":"10.1109/ismvl.2000.848597","title":"The computing capacity of three-input multiple-valued one-threshold perceptrons","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Ottawa; Lakehead University","funders":"","keywords":"Perceptron; Set (abstract data type); Computer science; Algorithm; Mathematics; Discrete mathematics; Combinatorics; Artificial neural network; Artificial intelligence","score_opus":0.07107693427843949,"score_gpt":0.267963709455179,"score_spread":0.19688677517673953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156735594","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.12278121,0.00004681695,0.8584265,0.0015780113,0.00008896544,0.00023550789,9.225401e-7,0.0004919263,0.01635015],"genre_scores_gemma":[0.86837816,0.000008697068,0.13089457,0.00038144292,0.000030195017,0.0000050683743,3.402696e-7,0.000007364541,0.00029416775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986512,0.00009246439,0.00033939653,0.00027722836,0.0003707026,0.00026901587],"domain_scores_gemma":[0.9986019,0.0002726668,0.00013307772,0.00079491484,0.00013237612,0.000065026004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061894784,0.0001274946,0.00016712796,0.00006603467,0.0003031184,0.00015221786,0.0010743744,0.00007076892,0.000044696866],"category_scores_gemma":[0.00008560788,0.00009246309,0.000098462595,0.00028493005,0.0001500178,0.00027624908,0.00029137058,0.00021405648,0.00004853985],"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.000005740337,0.00037794875,0.008356898,0.000018312694,0.000063353415,0.0000017330011,0.007830506,0.0006518608,0.009624,0.9252942,0.0077874376,0.039988004],"study_design_scores_gemma":[0.00024652507,0.00007719178,0.0060886433,0.000015444968,0.0000041880985,0.0000049935857,0.000052752654,0.9740323,0.0144032985,0.003932638,0.00097378396,0.00016828514],"about_ca_topic_score_codex":0.00010444274,"about_ca_topic_score_gemma":0.00023541963,"teacher_disagreement_score":0.9733804,"about_ca_system_score_codex":0.000029401448,"about_ca_system_score_gemma":0.000015191658,"threshold_uncertainty_score":0.37705353},"labels":[],"label_agreement":null},{"id":"W2156769952","doi":"10.1109/nafips.2004.1337411","title":"Signal separation by independent component analysis and fuzzy estimators","year":2004,"lang":"en","type":"article","venue":"IEEE Annual Meeting of the Fuzzy Information, 2004. Processing NAFIPS '04.","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":"University of Manitoba","funders":"","keywords":"Independent component analysis; Estimator; Principal component analysis; Computer science; Signal processing; Statistical signal processing; Fuzzy logic; Artificial intelligence; Pattern recognition (psychology); Blind signal separation; Component (thermodynamics); Noise (video); Gaussian; SIGNAL (programming language); Artificial neural network; Mathematics; Statistics; Digital signal processing","score_opus":0.007886143321598904,"score_gpt":0.25518320351125007,"score_spread":0.24729706018965117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156769952","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.33246648,0.0003224901,0.66188216,0.0017469984,0.00020197185,0.00051693746,0.00004786791,0.00045406827,0.0023610275],"genre_scores_gemma":[0.97168356,0.0000102991935,0.027516307,0.0006493528,0.000031897795,0.0000258302,0.000030763782,0.0000107762335,0.000041229927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973661,0.00013605643,0.00097103836,0.00028644167,0.00091502647,0.0003253745],"domain_scores_gemma":[0.9976782,0.00007374946,0.0010151477,0.00045163932,0.0006631278,0.0001180888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012664117,0.00027497552,0.00035034516,0.00048607923,0.0005412667,0.0005228223,0.0008985089,0.00016534007,0.000001869763],"category_scores_gemma":[0.00011469361,0.00022601105,0.00013578567,0.0016791489,0.00014979024,0.0039964197,0.00017644445,0.00029156654,0.000012238061],"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.00021005502,0.0010204464,0.020528523,0.0012375077,0.0011932121,0.0000053385797,0.17558627,0.65200716,0.014280149,0.021328537,0.023368077,0.0892347],"study_design_scores_gemma":[0.0067615993,0.0010332452,0.03048499,0.0020301589,0.0013511729,0.00019783068,0.0056307316,0.23537366,0.6468893,0.056465145,0.009719217,0.004062887],"about_ca_topic_score_codex":0.0002328481,"about_ca_topic_score_gemma":0.000026743672,"teacher_disagreement_score":0.6392171,"about_ca_system_score_codex":0.00013891287,"about_ca_system_score_gemma":0.00031679845,"threshold_uncertainty_score":0.9216463},"labels":[],"label_agreement":null},{"id":"W2157334800","doi":"10.1109/icassp.2006.1660595","title":"Cramer-Rao Lower Bound for Harmonic and Subharmonic Estimation","year":2006,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cramér–Rao bound; Upper and lower bounds; Harmonic; Harmonics; Noise (video); Additive white Gaussian noise; Mathematics; Variance (accounting); Estimation theory; Algorithm; A priori and a posteriori; White noise; Computer science; Statistics; Acoustics; Mathematical analysis; Physics; Artificial intelligence","score_opus":0.014529311542340877,"score_gpt":0.26703835630800304,"score_spread":0.25250904476566216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157334800","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.040095955,0.00008950339,0.95309454,0.002665695,0.00006730452,0.0002761633,0.0000010020265,0.00044066977,0.003269184],"genre_scores_gemma":[0.7146995,0.0000052144583,0.2831288,0.000567744,0.000020966778,0.00004235599,0.0000047261105,0.0000063960724,0.0015243151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993008,0.000021340027,0.00016233647,0.00024426114,0.00011333539,0.00015794062],"domain_scores_gemma":[0.9995195,0.000083040984,0.0000545145,0.00024697388,0.00006298665,0.000032946657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024433396,0.00008818526,0.00008711857,0.000075429976,0.00010143859,0.00033899525,0.00021223641,0.00005166409,0.000012296438],"category_scores_gemma":[0.000017674756,0.00008128541,0.000034831337,0.00013129538,0.00003386477,0.0005554278,0.000060675735,0.000053892945,0.000016715656],"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.000008501913,0.00009901449,0.00012579345,0.000017351611,0.0000075851412,0.0000014969607,0.00016637798,0.000140031,0.003016963,0.9240257,0.028984565,0.0434066],"study_design_scores_gemma":[0.00050927815,0.00020126425,0.0030258612,0.00001033247,0.000007957107,0.000012985522,0.000006494465,0.6704829,0.04454004,0.25695986,0.02394768,0.00029538025],"about_ca_topic_score_codex":0.00006363612,"about_ca_topic_score_gemma":0.00002185085,"teacher_disagreement_score":0.6746035,"about_ca_system_score_codex":0.0000243416,"about_ca_system_score_gemma":0.000040713785,"threshold_uncertainty_score":0.3314723},"labels":[],"label_agreement":null},{"id":"W2157537860","doi":"10.1109/iscas.2009.5117845","title":"An enhanced scheme for second-order-statistics estimation in MIMO-OFDM systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Concordia University","funders":"","keywords":"Computer science; Algorithm; Perturbation (astronomy); MIMO; Orthogonal frequency-division multiplexing; Mean squared error; Channel (broadcasting); SIGNAL (programming language); Mathematics; Statistics; Telecommunications; Physics","score_opus":0.01689067159052144,"score_gpt":0.311646561066372,"score_spread":0.2947558894758506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157537860","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.0066709914,0.0000136239305,0.98952276,0.00028608766,0.00007670006,0.00046206077,0.0000056724266,0.00038314908,0.0025789873],"genre_scores_gemma":[0.45770314,7.542379e-7,0.5415754,0.0003823464,0.000009585981,0.000032413864,0.000014546809,0.0000032244582,0.00027858902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991184,0.000050186864,0.0002729367,0.00025734538,0.00013399089,0.00016715976],"domain_scores_gemma":[0.999309,0.00007516742,0.00008202352,0.000351042,0.00013211218,0.000050641942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003577047,0.00009603159,0.00013067866,0.00012960889,0.000045152672,0.00022275663,0.00035968475,0.00007056071,0.0000122163565],"category_scores_gemma":[0.00005329173,0.00009522552,0.000015376401,0.00025632005,0.000009696789,0.00069681625,0.000014841319,0.00006851515,0.000012057633],"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.000006106541,0.000120007506,0.000013770054,0.000022527967,0.0000026993325,0.0000010182695,0.0009964841,0.0021514005,0.013376422,0.9530227,0.0023057552,0.027981067],"study_design_scores_gemma":[0.00024902637,0.0002410996,0.00025773744,0.00001318611,8.339393e-7,0.000001774972,0.00002969619,0.9489733,0.029374361,0.020122513,0.00059584074,0.00014066203],"about_ca_topic_score_codex":0.000016809625,"about_ca_topic_score_gemma":0.000056680732,"teacher_disagreement_score":0.94682187,"about_ca_system_score_codex":0.000036993788,"about_ca_system_score_gemma":0.00006401069,"threshold_uncertainty_score":0.3883184},"labels":[],"label_agreement":null},{"id":"W2157597142","doi":"10.1155/2015/386201","title":"Independent Component Analysis Based on Information Bottleneck","year":2015,"lang":"en","type":"article","venue":"Abstract and Applied Analysis","topic":"Blind Source Separation 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":"University of Victoria","funders":"National Key Research and Development Program of China; Education Department of Shaanxi Province; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Information bottleneck method; Independent component analysis; Bottleneck; FastICA; Equivalence (formal languages); Mathematics; Component (thermodynamics); Process (computing); Algorithm; Mixing (physics); Computer science; Artificial intelligence; Data mining; Blind signal separation; Mutual information","score_opus":0.01634951194919362,"score_gpt":0.2487596166840326,"score_spread":0.23241010473483897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157597142","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.14533849,0.000009439351,0.8349822,0.000688332,0.000018761253,0.00012968054,0.000005706065,0.00024496065,0.018582435],"genre_scores_gemma":[0.9892116,0.0000036485553,0.009626856,0.0010114122,0.000010883873,0.000019193263,0.00009748573,0.0000029186342,0.000015957101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874544,0.000026210213,0.0003237424,0.00024040141,0.0005125773,0.0001516402],"domain_scores_gemma":[0.9990309,0.00005954391,0.00019405603,0.00046985573,0.000084926796,0.00016073602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006486813,0.00014170914,0.00029157038,0.0010855594,0.000083669875,0.00034200703,0.00030894548,0.0000791506,0.000020915757],"category_scores_gemma":[0.000010316663,0.00012518906,0.00016974534,0.0020559295,0.000022069486,0.0004312969,0.0000650741,0.00013187797,0.000046773643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098501245,0.00061548135,0.0216958,0.000022886956,0.0050264834,0.0000073757546,0.004630434,0.79035455,0.0004145145,0.1210505,0.0016706692,0.054412786],"study_design_scores_gemma":[0.0006598375,0.00007262914,0.21596499,0.0000032883322,0.0015097773,4.7642317e-7,0.00023450209,0.7735196,0.0031088258,0.0018583752,0.0026261045,0.00044163948],"about_ca_topic_score_codex":0.000087105815,"about_ca_topic_score_gemma":0.00003984426,"teacher_disagreement_score":0.84387314,"about_ca_system_score_codex":0.000040628154,"about_ca_system_score_gemma":0.000040155548,"threshold_uncertainty_score":0.5105062},"labels":[],"label_agreement":null},{"id":"W2157641626","doi":"10.1109/icc.2000.853305","title":"Oversampled blind MLSDE receiver","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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 Toronto","funders":"","keywords":"Phase-shift keying; Computer science; Oversampling; Robustness (evolution); Channel (broadcasting); Keying; Algorithm; Gaussian noise; Bit error rate; Electronic engineering; Bandwidth (computing); Telecommunications; Engineering","score_opus":0.048181900808134656,"score_gpt":0.25724513983832276,"score_spread":0.20906323903018809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157641626","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.0024249698,0.00002401539,0.7926423,0.003176022,0.00007128497,0.00009328815,2.9784078e-7,0.000727204,0.2008406],"genre_scores_gemma":[0.6710258,0.000033517277,0.3068359,0.0048340466,0.000040352497,0.000011412173,9.150047e-7,0.00000740956,0.017210634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935675,0.000040046754,0.000109411565,0.00019955564,0.00016362121,0.00013062621],"domain_scores_gemma":[0.99943054,0.000048947135,0.00003177803,0.00039420437,0.00004242735,0.00005211146],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013888077,0.00006642741,0.00006703742,0.0000797636,0.000049298953,0.00012523652,0.00043589107,0.000044992357,0.0010144542],"category_scores_gemma":[0.000025157275,0.00005846978,0.000035040688,0.00025543087,0.000016472795,0.00048353357,0.00009594473,0.000076854914,0.00062925555],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032408107,0.0001203692,0.00022486216,0.0000025444176,0.0000134832035,0.0000076257043,0.0023849544,0.00002323072,0.00080868095,0.74879014,0.20441882,0.043202065],"study_design_scores_gemma":[0.0013699236,0.000203634,0.0015442462,0.000011000708,0.0000054236907,0.000029038207,0.000040950454,0.2410353,0.030591218,0.033462625,0.6910932,0.00061341014],"about_ca_topic_score_codex":0.000017034834,"about_ca_topic_score_gemma":0.000007799764,"teacher_disagreement_score":0.7153275,"about_ca_system_score_codex":0.000016205327,"about_ca_system_score_gemma":0.000007037076,"threshold_uncertainty_score":0.99989873},"labels":[],"label_agreement":null},{"id":"W2157917050","doi":"10.1109/memb.2006.1607673","title":"Increasing the effect size in event-related fMRI studies","year":2006,"lang":"en","type":"review","venue":"IEEE Engineering in Medicine and Biology Magazine","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":"University of British Columbia; University of British Columbia Hospital","funders":"","keywords":"Functional magnetic resonance imaging; Voxel; Independent component analysis; Computer science; Artificial intelligence; Pattern recognition (psychology); Neuroimaging; Communication noise; Noise (video); Psychology; Neuroscience; Image (mathematics)","score_opus":0.0400669426045037,"score_gpt":0.35889016519130473,"score_spread":0.318823222586801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157917050","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007655614,0.9939657,0.0035676856,0.0004606479,0.00041255564,0.0005359846,7.826801e-7,0.0001660832,0.00012501169],"genre_scores_gemma":[0.002065283,0.99647,0.001007404,0.00009106863,0.00015091138,0.00011422459,0.00001044846,0.000019667199,0.00007102819],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979725,0.00056178874,0.00070489757,0.00040005744,0.000082974984,0.0002778164],"domain_scores_gemma":[0.99641037,0.0030377237,0.00016101418,0.0003359302,0.00002339277,0.000031585936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025546057,0.00036604237,0.0013652721,0.00043187148,0.00002917661,0.000015117807,0.000459001,0.00030243341,0.0000015044984],"category_scores_gemma":[0.00079683046,0.0002017252,0.00007485125,0.0008518999,0.00013128454,0.00007144854,0.00012763645,0.00074861007,0.0000051983325],"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.000009814177,0.00004811152,0.0006374077,0.0073140827,0.00028723406,0.00016181097,0.0010164537,0.0006465519,0.00014125767,0.0036247396,0.004757416,0.98135513],"study_design_scores_gemma":[0.0015080533,0.0009306464,0.0006543199,0.021295132,0.00018245255,0.0004414994,0.000008893123,0.0053752353,0.000011946071,0.00052511814,0.9683276,0.0007391196],"about_ca_topic_score_codex":0.000045016877,"about_ca_topic_score_gemma":0.000024305707,"teacher_disagreement_score":0.980616,"about_ca_system_score_codex":0.000071103386,"about_ca_system_score_gemma":0.00003313877,"threshold_uncertainty_score":0.82261145},"labels":[],"label_agreement":null},{"id":"W2158069038","doi":"10.1109/cdc.1992.371199","title":"A novel high resolution parallel spectral estimation method for narrow-band signals","year":2005,"lang":"en","type":"article","venue":"","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":"University of New Brunswick","funders":"","keywords":"Fast Fourier transform; Singular value decomposition; Parametric statistics; Autoregressive model; Algorithm; Computer science; Nonparametric statistics; SIGNAL (programming language); Inverse; Spectral density estimation; Autoregressive–moving-average model; Parametric model; Fourier transform; Mathematics; Statistics","score_opus":0.03128867314847641,"score_gpt":0.32455374142668814,"score_spread":0.29326506827821175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158069038","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.0007674946,0.000025753132,0.98733413,0.008621239,0.00004769203,0.0004304261,0.0000027456533,0.0005965406,0.0021739814],"genre_scores_gemma":[0.1585838,0.0000011800172,0.8391499,0.0011890946,0.00007342002,0.00007620619,0.000008176452,0.000007367204,0.0009108751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989543,0.000058616817,0.00026060478,0.0003128137,0.0001993551,0.0002143431],"domain_scores_gemma":[0.99928147,0.00015590616,0.00010015673,0.00030467907,0.00009915864,0.000058649483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082378974,0.00011471374,0.00013284091,0.000120941084,0.000110355286,0.0001627703,0.00035332824,0.000082906176,0.000028103868],"category_scores_gemma":[0.000059514303,0.00010546749,0.00006770051,0.00020153285,0.000015492667,0.0007990679,0.000033288703,0.00007692121,0.00002214533],"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.000020388748,0.00011929521,0.0000026172415,0.000007819263,0.000008688159,3.0367207e-7,0.00069520506,0.07094344,0.030507559,0.85598505,0.010949703,0.030759936],"study_design_scores_gemma":[0.00041605844,0.000108860746,0.00015263958,0.0000052215655,0.0000044060735,0.000011619166,0.0000063858483,0.854049,0.11081407,0.030952688,0.0033355376,0.0001434699],"about_ca_topic_score_codex":0.00006710616,"about_ca_topic_score_gemma":0.00005373357,"teacher_disagreement_score":0.82503235,"about_ca_system_score_codex":0.00006247763,"about_ca_system_score_gemma":0.000055052078,"threshold_uncertainty_score":0.43008393},"labels":[],"label_agreement":null},{"id":"W2158375765","doi":"10.1109/iccme.2011.5876798","title":"Signal decomposition by multi-scale PCA and its applications to long-term EEG signal classification","year":2011,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Toronto Metropolitan University","funders":"Mitacs","keywords":"Principal component analysis; Pattern recognition (psychology); Computer science; Artificial intelligence; SIGNAL (programming language); Noise (video); Wavelet; Electroencephalography; Scale (ratio); Discrete wavelet transform; Feature extraction; Wavelet transform; Signal processing; Data mining; Speech recognition; Image (mathematics); Digital signal processing","score_opus":0.05462502622880141,"score_gpt":0.316275740387496,"score_spread":0.2616507141586946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158375765","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.027585866,0.00004279194,0.96844727,0.00053391577,0.000014851412,0.00059629354,0.0000051787656,0.0004492737,0.0023245784],"genre_scores_gemma":[0.82274747,0.0000101437345,0.17595735,0.00067134976,0.000012979997,0.00025329491,0.000018650022,0.000008324805,0.00032042246],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989688,0.000063556814,0.00022903085,0.00040956706,0.00016457262,0.00016452181],"domain_scores_gemma":[0.9993043,0.000038219383,0.000077382196,0.00029425754,0.00012772252,0.00015813796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019662069,0.000121887046,0.00009934902,0.00011955991,0.00015811334,0.00012934966,0.00042394685,0.000082593724,0.00008605965],"category_scores_gemma":[0.00000253798,0.00012047626,0.000028722614,0.00025903957,0.000025134286,0.0005444147,0.00011782489,0.000091062495,0.00013811176],"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.000030484407,0.0012144821,0.008871572,0.000037192593,0.00003282107,0.0000023005978,0.0048736823,0.000015880492,0.7130735,0.12545076,0.0049634012,0.14143392],"study_design_scores_gemma":[0.0005945408,0.00038158355,0.17572711,0.00002984169,0.000019380177,0.00002952465,0.00004929779,0.14067608,0.67805505,0.002008628,0.0017149625,0.000714013],"about_ca_topic_score_codex":0.000013042191,"about_ca_topic_score_gemma":0.000021154006,"teacher_disagreement_score":0.7951616,"about_ca_system_score_codex":0.00003206126,"about_ca_system_score_gemma":0.000025757885,"threshold_uncertainty_score":0.49128795},"labels":[],"label_agreement":null},{"id":"W2158596240","doi":"10.1109/icassp.2012.6288330","title":"Tuning-free step-size adaptation","year":2012,"lang":"en","type":"article","venue":"","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":"University of Alberta","funders":"","keywords":"Computer science; Adaptation (eye); Algorithm; Reinforcement learning; Set (abstract data type); Meta learning (computer science); Artificial intelligence; Machine learning","score_opus":0.029467069945768695,"score_gpt":0.26476378339909473,"score_spread":0.23529671345332603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158596240","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.0016666412,0.000032297256,0.93837804,0.001300645,0.00011947837,0.00007378353,2.0408436e-7,0.0006674018,0.057761513],"genre_scores_gemma":[0.5573707,0.0000020204232,0.44003823,0.0009886374,0.000036108315,0.0000075186194,4.1360516e-7,0.000003173455,0.0015531592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994042,0.000054059623,0.00010651425,0.00010663958,0.00017036352,0.00015821001],"domain_scores_gemma":[0.99927264,0.00009269387,0.000039823462,0.00048180492,0.000045140932,0.00006788479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003709668,0.000058485486,0.000054054246,0.00004326515,0.000045333374,0.00007958977,0.0005096813,0.00003760828,0.00006301156],"category_scores_gemma":[0.00009296753,0.000051641982,0.000024218814,0.00017334714,0.000011282108,0.0010490363,0.0001637129,0.00006077336,0.00011431294],"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.0000010504624,0.000041901498,0.00043678918,0.0000017338696,0.0000036722768,2.849488e-7,0.0022957106,0.000009798336,0.00045843225,0.9509615,0.021725517,0.024063613],"study_design_scores_gemma":[0.001443382,0.00034203945,0.040511746,0.000032072083,0.000015498777,0.00005356437,0.00086954376,0.42567018,0.051827636,0.06709794,0.41088507,0.0012513535],"about_ca_topic_score_codex":0.000029410943,"about_ca_topic_score_gemma":0.000010194111,"teacher_disagreement_score":0.88386357,"about_ca_system_score_codex":0.000016261061,"about_ca_system_score_gemma":0.000021281787,"threshold_uncertainty_score":0.2105899},"labels":[],"label_agreement":null},{"id":"W2159022375","doi":"10.1109/icpr.2008.4761381","title":"Affine invariant shape descriptors: The ICA-Fourier descriptor and the PCA-Fourier descriptor","year":2008,"lang":"en","type":"article","venue":"Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition","topic":"Blind Source Separation Techniques","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":"Toronto Metropolitan University","funders":"","keywords":"Silhouette; Fourier transform; Pattern recognition (psychology); Artificial intelligence; Affine transformation; Invariant (physics); Mathematics; Fourier analysis; Computer science; Computer vision; Mathematical analysis","score_opus":0.10235426049614164,"score_gpt":0.279475488998926,"score_spread":0.17712122850278433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159022375","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6057602,0.00008591496,0.07620518,0.101097114,0.005621134,0.00463478,0.0009842739,0.0020437774,0.20356761],"genre_scores_gemma":[0.97580063,0.0012612023,0.004224165,0.014102306,0.0014009981,0.0014220346,0.00041717393,0.00013260213,0.0012388979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99182075,0.00015397024,0.0017394894,0.002223944,0.0030138295,0.0010480115],"domain_scores_gemma":[0.9914468,0.00035688846,0.0015606661,0.00046773758,0.0056997617,0.00046816634],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0021218767,0.0012734347,0.0008580542,0.0010917599,0.0012213704,0.0037808535,0.003779874,0.000514608,0.0032302856],"category_scores_gemma":[0.0009098804,0.0009757248,0.00044959682,0.0007024286,0.0010023847,0.0039763534,0.0008902349,0.0019241342,0.000896937],"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.0026356047,0.0023612275,0.012434782,0.00023745644,0.0019230049,0.00011106298,0.017441167,0.0000037224293,0.008333027,0.37463894,0.036160175,0.5437198],"study_design_scores_gemma":[0.029611258,0.0041512856,0.027922805,0.0072000055,0.00077003514,0.004019946,0.012116158,0.5739699,0.052073166,0.25403047,0.02436841,0.009766573],"about_ca_topic_score_codex":0.00024506068,"about_ca_topic_score_gemma":0.000059331145,"teacher_disagreement_score":0.57396615,"about_ca_system_score_codex":0.00049760734,"about_ca_system_score_gemma":0.00029929835,"threshold_uncertainty_score":0.99988097},"labels":[],"label_agreement":null},{"id":"W2159423171","doi":"10.1142/s021969131460008x","title":"Noise reduction by perfect-translation-invariant complex discrete wavelet transforms for fetal electrocardiography and magnetocardiography","year":2014,"lang":"en","type":"article","venue":"International Journal of Wavelets Multiresolution and Information Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":9,"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":"Magnetocardiography; QRS complex; Wavelet; Pattern recognition (psychology); Artificial intelligence; Speech recognition; Wavelet transform; Electrocardiography; Computer science; Noise (video); Discrete wavelet transform; Mathematics; Algorithm; Cardiology; Medicine","score_opus":0.00912495335055616,"score_gpt":0.24912070769431052,"score_spread":0.23999575434375436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159423171","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.009804774,0.0002752247,0.9860639,0.0027491099,0.00017724076,0.0002620947,0.000018323502,0.00007460662,0.0005747425],"genre_scores_gemma":[0.9029947,0.00035566755,0.09589787,0.0005584964,0.000103439284,0.000014966202,0.00006215848,0.000007744479,0.0000049694777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983747,0.00007449425,0.0007117148,0.00015604035,0.0005024475,0.0001806189],"domain_scores_gemma":[0.9984483,0.000062522566,0.0005414557,0.00009029078,0.0007484723,0.000108956105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092335406,0.00017130606,0.00022213747,0.00069328916,0.0002249,0.0006150502,0.0002895379,0.00009351494,0.000002298456],"category_scores_gemma":[0.000057701975,0.00015099988,0.0001594363,0.0002600042,0.00009294905,0.006291298,0.000028406408,0.00017835698,6.8737046e-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.00021173566,0.000047655427,0.00015015024,0.0000786378,0.00012905618,4.7557404e-7,0.0033487885,0.00016644217,0.010658078,0.013812497,0.0011370761,0.9702594],"study_design_scores_gemma":[0.0045454777,0.00081919064,0.0070426147,0.00019904629,0.00006938951,0.00076374854,0.00031868299,0.8755464,0.0077693583,0.004586209,0.09775284,0.0005870436],"about_ca_topic_score_codex":0.00000853411,"about_ca_topic_score_gemma":7.22754e-7,"teacher_disagreement_score":0.9696724,"about_ca_system_score_codex":0.000038782953,"about_ca_system_score_gemma":0.000058936766,"threshold_uncertainty_score":0.6157597},"labels":[],"label_agreement":null},{"id":"W2159741800","doi":"10.1109/iembs.1995.575370","title":"Adaptive stimulus artifact cancellation in biological signals using neural networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of New Brunswick","funders":"","keywords":"Computer science; Stimulus (psychology); Adaptive filter; Artificial neural network; Active noise control; Nonlinear system; Speech recognition; Artificial intelligence; Algorithm; Noise reduction; Physics","score_opus":0.10969321073699345,"score_gpt":0.29519342907070995,"score_spread":0.1855002183337165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159741800","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.121141754,0.00007258013,0.87608105,0.00028593861,0.00004824252,0.00014050295,1.7426147e-7,0.00021870859,0.0020110314],"genre_scores_gemma":[0.9612266,0.000009285731,0.0380408,0.0006221946,0.000027976626,0.000005162967,5.322864e-7,0.0000033376045,0.0000641498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991208,0.00014276057,0.0001973616,0.0002415994,0.00010612999,0.0001913937],"domain_scores_gemma":[0.99959755,0.00009282057,0.00005973978,0.00017214174,0.00003504025,0.00004270217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002086728,0.00008987021,0.000111511654,0.000088875924,0.00004489162,0.00007835527,0.00022657351,0.00008048298,0.00012253998],"category_scores_gemma":[0.000014719492,0.0000742824,0.000030072222,0.00036721578,0.000025873484,0.00034923534,0.000076833014,0.00013424813,0.000010717082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006771706,0.000065732485,0.0027643614,6.480126e-7,0.0000037620773,0.000011921893,0.0005650739,0.94238776,0.00084268366,0.009351995,0.0003685755,0.04363073],"study_design_scores_gemma":[0.00008703295,0.000070396025,0.0012293726,0.0000041089415,5.1452076e-7,0.000003340137,0.000009614996,0.99674416,0.00080980046,0.0008883877,0.00005328155,0.00010001076],"about_ca_topic_score_codex":0.00009477367,"about_ca_topic_score_gemma":0.000043455795,"teacher_disagreement_score":0.8400848,"about_ca_system_score_codex":0.000052493357,"about_ca_system_score_gemma":0.000007433617,"threshold_uncertainty_score":0.30291483},"labels":[],"label_agreement":null},{"id":"W2160354731","doi":"10.1155/s1110865704405010","title":"A Neural Network MLSE Receiver Based on Natural Gradient Descent: Application to Satellite Communications","year":2004,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Blind Source Separation 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":"Queen's University","funders":"","keywords":"Computer science; Viterbi algorithm; Channel (broadcasting); Multipath propagation; Maximum likelihood sequence estimation; Gradient descent; Estimator; Algorithm; Electronic engineering; Telecommunications; Artificial neural network; Estimation theory; Artificial intelligence; Engineering; Mathematics; Statistics; Decoding methods","score_opus":0.01725542566618462,"score_gpt":0.30892354478653156,"score_spread":0.29166811912034696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160354731","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.0049130344,0.004124319,0.9815632,0.0069579324,0.00019129642,0.00042053594,6.89364e-7,0.000220587,0.0016083875],"genre_scores_gemma":[0.848885,0.00032538612,0.14547895,0.0051422147,0.000106877094,0.0000315062,0.0000030019619,0.00001710754,0.000009937822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795896,0.00025127432,0.00050893927,0.00038104606,0.00051424955,0.00038554877],"domain_scores_gemma":[0.9986031,0.00016394224,0.00035414085,0.0005230625,0.00018405545,0.0001716682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007979352,0.00022305938,0.00020427075,0.00033560485,0.00046337303,0.00040684768,0.0013397459,0.00005521275,0.0000020514435],"category_scores_gemma":[0.000050596638,0.0001987576,0.00007356627,0.0011893987,0.000070479764,0.0013866994,0.00010573528,0.00087888434,0.000020666092],"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.00009344963,0.00020173752,0.00035084554,0.000011530495,0.0000020877812,0.000015078971,0.00073076447,0.377326,0.0003204938,0.007121595,0.000017678809,0.6138087],"study_design_scores_gemma":[0.0026488563,0.001617163,0.008204605,0.0026981118,0.000015457294,0.00022374238,0.00013667847,0.8458256,0.0052361726,0.062397864,0.06970037,0.0012953682],"about_ca_topic_score_codex":0.0000016941635,"about_ca_topic_score_gemma":0.000019843917,"teacher_disagreement_score":0.84397197,"about_ca_system_score_codex":0.00034985246,"about_ca_system_score_gemma":0.00012731134,"threshold_uncertainty_score":0.8105099},"labels":[],"label_agreement":null},{"id":"W2160392799","doi":"10.1109/cwit.2009.5069555","title":"Blind Bit-Rate Detectors for variable-gain multiple-access systems in unknown Gaussian channel","year":2009,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Queen's University","funders":"","keywords":"Detector; Likelihood-ratio test; Algorithm; Noise (video); Maximum a posteriori estimation; Mathematics; Gaussian noise; Maximum likelihood sequence estimation; Statistics; Gaussian; Channel (broadcasting); Bit error rate; Computer science; Variance (accounting); Estimation theory; Maximum likelihood; Artificial intelligence; Decoding methods; Telecommunications","score_opus":0.038657901137390795,"score_gpt":0.3040067477350957,"score_spread":0.26534884659770486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160392799","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.0063720685,0.000058057813,0.9864862,0.0011248535,0.0002851749,0.0011233056,0.0000037329573,0.0006690373,0.0038775431],"genre_scores_gemma":[0.9521115,0.00000776567,0.045724045,0.0011803927,0.00007627666,0.00014689993,0.000006851422,0.000014672286,0.0007315841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821234,0.00017137484,0.0004632079,0.0005277923,0.0001934861,0.00043182276],"domain_scores_gemma":[0.99880534,0.00023922583,0.00014648792,0.00057080697,0.000118626995,0.000119537646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012099638,0.00021529612,0.00027851813,0.00044422643,0.0001031752,0.0006669209,0.0011650021,0.00016529551,0.0000050879016],"category_scores_gemma":[0.00013151007,0.00018837447,0.000059750906,0.0009765795,0.00001945157,0.0010770337,0.00011522275,0.00015741856,0.000009524181],"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.00016798567,0.00061365153,0.0005671738,0.00013073483,0.00004063492,0.00002278977,0.0023185748,0.034978002,0.01228899,0.92756987,0.0049466733,0.016354922],"study_design_scores_gemma":[0.0013587397,0.00026559352,0.0011494025,0.000072383584,0.0000035242083,0.0000064888363,0.000032663716,0.96090174,0.018157033,0.012547233,0.0050827772,0.0004224072],"about_ca_topic_score_codex":0.00028279875,"about_ca_topic_score_gemma":0.00015698848,"teacher_disagreement_score":0.94573945,"about_ca_system_score_codex":0.00007317827,"about_ca_system_score_gemma":0.00010318567,"threshold_uncertainty_score":0.7681688},"labels":[],"label_agreement":null},{"id":"W2160393584","doi":"10.1109/sice.2008.4654965","title":"Semiblind system identification with symbolic chaotic sequences","year":2008,"lang":"en","type":"article","venue":"","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":"University of Calgary","funders":"","keywords":"Chaotic; Identification (biology); Computer science; Identification scheme; Estimation theory; Impulse (physics); Synchronization (alternating current); Estimator; System identification; Scheme (mathematics); Chaotic systems; Control theory (sociology); Symbolic dynamics; Finite impulse response; Impulse response; Algorithm; Mathematics; Artificial intelligence; Data mining; Statistics; Channel (broadcasting); Telecommunications","score_opus":0.021682629995357354,"score_gpt":0.23890549814009496,"score_spread":0.2172228681447376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160393584","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.10767026,0.000030582407,0.8759239,0.000597054,0.000059266098,0.00019601369,3.5179917e-7,0.0012018494,0.014320718],"genre_scores_gemma":[0.96491754,0.00001043451,0.033395305,0.00020424473,0.000023084358,0.000031409698,0.0000017805855,0.0000058220417,0.0014103499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990214,0.000064433465,0.0001967092,0.00028069774,0.000296197,0.00014056955],"domain_scores_gemma":[0.99921685,0.000030483458,0.00009621476,0.00047876342,0.00012135961,0.000056303852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027041414,0.00009184456,0.00010574644,0.00016735391,0.00015367533,0.00013519407,0.00052098505,0.00004494432,0.0000059338518],"category_scores_gemma":[0.000007431459,0.00006856702,0.00002309318,0.0005838275,0.000055374872,0.00067392713,0.000047351565,0.00007346067,0.00012563176],"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.0000048158277,0.00006761343,0.0026724385,0.00004563754,0.000023859668,0.00004713949,0.0045906957,0.00025613175,0.0039678738,0.98445207,0.0018865318,0.0019851762],"study_design_scores_gemma":[0.0015304228,0.0008188051,0.066102915,0.0003566576,0.000039217306,0.0046399124,0.0016985195,0.33321273,0.57662064,0.006416289,0.0064447043,0.0021191717],"about_ca_topic_score_codex":0.000044697194,"about_ca_topic_score_gemma":0.000010621516,"teacher_disagreement_score":0.9780358,"about_ca_system_score_codex":0.000039907016,"about_ca_system_score_gemma":0.00009130098,"threshold_uncertainty_score":0.27960816},"labels":[],"label_agreement":null},{"id":"W2160434634","doi":"10.1109/ccece.2004.1347658","title":"Blind decision feedback equalizer based on high order MCMA","year":2004,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Computer science; Mean squared error; Convergence (economics); Monte Carlo method; Equalizer; Metric (unit); Noise (video); Least mean squares filter; Gaussian; Adaptive filter; Mathematics; Artificial intelligence; Statistics; Telecommunications; Engineering","score_opus":0.021212584066305062,"score_gpt":0.2907403233993088,"score_spread":0.2695277393330037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160434634","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.011010776,0.0000052079517,0.96664435,0.004559825,0.00014011537,0.00018284391,6.620995e-7,0.0006536315,0.016802613],"genre_scores_gemma":[0.5150539,0.0000017025967,0.4774942,0.0069326293,0.000021165064,0.000010413599,0.0000023200555,0.000008506307,0.0004751574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986764,0.0000512447,0.00022804923,0.0003829126,0.00045866033,0.00020273137],"domain_scores_gemma":[0.9988248,0.00015267397,0.00005901485,0.0007322507,0.00014358497,0.000087726105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036915301,0.00013994976,0.00012625457,0.00018465292,0.00008643081,0.0002184969,0.0006511386,0.00010308327,0.00023129705],"category_scores_gemma":[0.00007607965,0.000111710906,0.000051211508,0.00063383824,0.00002543749,0.00036549158,0.00011051821,0.00013234971,0.000614308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004332603,0.00030031224,0.00002681424,0.0000030514034,0.000005301257,0.000010646051,0.0002698742,0.01627967,0.00042018952,0.9371652,0.004953933,0.0405217],"study_design_scores_gemma":[0.010690217,0.0016950645,0.0038560545,0.00019312705,0.0000115766625,0.000014195144,0.00004010306,0.1688912,0.24909972,0.50192446,0.062089972,0.0014942988],"about_ca_topic_score_codex":0.00006918593,"about_ca_topic_score_gemma":0.000025794758,"teacher_disagreement_score":0.5040431,"about_ca_system_score_codex":0.00005868527,"about_ca_system_score_gemma":0.00013147088,"threshold_uncertainty_score":0.78958917},"labels":[],"label_agreement":null},{"id":"W2160518835","doi":"10.1109/glocom.2003.1258531","title":"Performance Analysis of a Jointly Optimal BPSK Receiver in Cochannel Interference","year":2005,"lang":"en","type":"article","venue":"","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":"University of Alberta","funders":"","keywords":"Phase-shift keying; Interference (communication); Additive white Gaussian noise; Computer science; SIGNAL (programming language); Signal-to-noise ratio (imaging); Algorithm; Binary number; Bit error rate; Phase (matter); Keying; Single antenna interference cancellation; Control theory (sociology); Electronic engineering; White noise; Mathematics; Telecommunications; Physics; Decoding methods; Engineering; Artificial intelligence","score_opus":0.01869176226279274,"score_gpt":0.2644745614026568,"score_spread":0.24578279913986406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160518835","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.49071786,0.00001126205,0.50090075,0.00044896366,0.000013201117,0.000055832315,5.714832e-7,0.00009141249,0.0077601327],"genre_scores_gemma":[0.8879858,0.000026465485,0.1112239,0.00030409347,0.0000059150934,0.0000075787225,0.0000012905044,0.000002369528,0.000442595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914634,0.00004635298,0.0002904522,0.00022546516,0.00015421738,0.0001371402],"domain_scores_gemma":[0.9994025,0.000037298778,0.000081255595,0.00035912445,0.000086650165,0.0000331733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036653332,0.00008163999,0.0002006579,0.00060258707,0.000017008046,0.0000359512,0.0005467259,0.00004576229,0.00009716301],"category_scores_gemma":[0.000016125858,0.00007311911,0.00006564719,0.0014075488,0.000031539872,0.0006163431,0.0001459535,0.00010044214,0.000020834415],"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.00015049476,0.0014377823,0.090619996,0.00007221831,0.0008480267,0.000010790407,0.061533906,0.2762967,0.013997072,0.1753106,0.0046181814,0.37510422],"study_design_scores_gemma":[0.0001059324,0.000081114114,0.022873288,0.000013799971,0.000013611154,9.92353e-7,0.00003787991,0.9477553,0.02874788,0.000049158287,0.00021953533,0.000101508136],"about_ca_topic_score_codex":0.000050455943,"about_ca_topic_score_gemma":0.00015650311,"teacher_disagreement_score":0.6714586,"about_ca_system_score_codex":0.000034629724,"about_ca_system_score_gemma":0.00003341727,"threshold_uncertainty_score":0.29817107},"labels":[],"label_agreement":null},{"id":"W2160531753","doi":"10.1145/1065579.1065800","title":"A non-parametric approach for dynamic range estimation of nonlinear systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Toronto","funders":"","keywords":"Computer science; Datapath; Nonlinear system; Dynamic range; Gaussian; Algorithm; Parametric statistics; Range (aeronautics); Orthonormal basis; High dynamic range; Independent component analysis; Gaussian process; Mathematical optimization; Mathematics; Artificial intelligence; Statistics","score_opus":0.01673075718311854,"score_gpt":0.2836684176025053,"score_spread":0.2669376604193867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160531753","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.0060959496,0.000052986692,0.9898897,0.0001644046,0.000036603597,0.0006824298,0.0000029459704,0.00024197678,0.0028330206],"genre_scores_gemma":[0.47373053,0.0000019263955,0.52589047,0.000048292004,0.000010878461,0.00006052265,0.000006751721,0.0000040941577,0.00024655397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919707,0.000023476894,0.00027304605,0.00020466787,0.00018096264,0.00012080804],"domain_scores_gemma":[0.99930525,0.00007690651,0.0001233634,0.00034733833,0.00011370489,0.000033452205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046217226,0.00008227826,0.00015627807,0.00027017252,0.000032613032,0.00007522014,0.00039329042,0.00006529673,0.0000014237455],"category_scores_gemma":[0.000036233363,0.000071920935,0.000056808585,0.00053712574,0.000015633575,0.00040612038,0.00004617103,0.000049660393,0.000007659821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000369969,0.0011188529,0.00019125892,0.00055543147,0.00007110458,4.9829237e-7,0.0023096781,0.5637553,0.0010968378,0.22616765,0.004195565,0.20050086],"study_design_scores_gemma":[0.00023654182,0.00007052659,0.00008117755,0.0000063393836,0.0000035438234,0.000003431118,0.000013268046,0.99702364,0.0019398325,0.00015028563,0.00038966606,0.000081733015],"about_ca_topic_score_codex":0.000021657726,"about_ca_topic_score_gemma":0.0000017681157,"teacher_disagreement_score":0.4676346,"about_ca_system_score_codex":0.000037972542,"about_ca_system_score_gemma":0.0000388072,"threshold_uncertainty_score":0.29328504},"labels":[],"label_agreement":null},{"id":"W2161161251","doi":"","title":"Efficient blind speech signal separation combining independent component analysis and beamforming","year":2007,"lang":"en","type":"article","venue":"Canadian acoustics","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Blind signal separation; Beamforming; Independent component analysis; Computer science; Direction of arrival; Speech recognition; Source separation; Interference (communication); Independence (probability theory); Algorithm; Frequency domain; SIGNAL (programming language); Time domain; Computational complexity theory; Exploit; Pattern recognition (psychology); Artificial intelligence; Telecommunications; Mathematics; Computer vision; Statistics; Channel (broadcasting)","score_opus":0.014472330153302014,"score_gpt":0.2704063059436457,"score_spread":0.25593397579034366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161161251","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.3429894,0.000022785784,0.6556839,0.00014283932,0.0000695823,0.00013503426,0.000005186606,0.00007779048,0.00087350537],"genre_scores_gemma":[0.92133594,0.0000032121638,0.07788593,0.0006462056,0.00003458244,0.0000030158303,0.000018733122,0.000008696448,0.00006366471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985471,0.00004003616,0.00032533437,0.00032729463,0.00035239634,0.00040783372],"domain_scores_gemma":[0.9988242,0.000109853725,0.00011594059,0.000319825,0.00014505566,0.00048516452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010821022,0.0001487528,0.00018992944,0.0010147648,0.00025211382,0.0002635544,0.00033337343,0.0001247224,0.000015246202],"category_scores_gemma":[0.000029344426,0.00016516967,0.000055412816,0.0010052903,0.00004972656,0.00011404077,0.00008134961,0.00022551896,0.000010518739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006493252,0.0003813433,0.018021371,0.00007839464,0.0010144089,0.00089335704,0.01963181,0.6274119,0.100947425,0.118847094,0.0019884626,0.11071951],"study_design_scores_gemma":[0.000325007,0.000064141874,0.029112129,0.000010968946,0.000109207875,0.000029263783,0.00019558394,0.9655811,0.0033696527,0.00041442845,0.0004805618,0.00030794268],"about_ca_topic_score_codex":0.0053072087,"about_ca_topic_score_gemma":0.01565099,"teacher_disagreement_score":0.57834655,"about_ca_system_score_codex":0.0002860822,"about_ca_system_score_gemma":0.0002704096,"threshold_uncertainty_score":0.873362},"labels":[],"label_agreement":null},{"id":"W2161464328","doi":"10.1109/iembs.1996.647495","title":"Imaging epicardial current sources from magnetic data","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Dalhousie University","funders":"Heart and Stroke Foundation of Canada","keywords":"Noise (video); Orientation (vector space); Current (fluid); Projection (relational algebra); Sensitivity (control systems); Computer science; Current source; Biomagnetism; Physics; Magnetic field; Electronic engineering; Electrical engineering; Computer vision; Algorithm; Engineering; Mathematics; Geometry","score_opus":0.057048850204587796,"score_gpt":0.28532074216079,"score_spread":0.2282718919562022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161464328","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.0029472148,0.0027887626,0.97257143,0.0034902338,0.00030601997,0.00011063235,0.000011932285,0.0008819639,0.01689181],"genre_scores_gemma":[0.7951474,0.00021208033,0.20211211,0.0016409144,0.00028837562,0.000011398968,0.000031760115,0.00001314365,0.00054278714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989369,0.000077602526,0.00016404034,0.00042686443,0.0002307671,0.00016385387],"domain_scores_gemma":[0.99845177,0.000073333955,0.000040574505,0.0013418442,0.000027265833,0.000065212815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017237982,0.00009442659,0.00009959468,0.00006463446,0.000062990606,0.00031312983,0.0017142454,0.000019936655,0.00040061303],"category_scores_gemma":[0.000029546989,0.00008438744,0.000030446528,0.00015823514,0.00003281456,0.000777504,0.00085749826,0.00011684301,0.00036821046],"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":[5.303573e-7,0.000067869485,0.0020600224,0.000001725159,0.000004830798,0.000004253088,0.00092450745,0.000004951175,0.00014011742,0.013463915,0.08714496,0.8961823],"study_design_scores_gemma":[0.00021776109,0.000022571081,0.002695099,0.0000121176545,0.000007962743,0.000005138346,0.000021566126,0.58987284,0.0011167058,0.0077495473,0.39800155,0.00027715496],"about_ca_topic_score_codex":0.000071598886,"about_ca_topic_score_gemma":0.0000073423403,"teacher_disagreement_score":0.89590514,"about_ca_system_score_codex":0.0000093306935,"about_ca_system_score_gemma":0.000010018339,"threshold_uncertainty_score":0.47327232},"labels":[],"label_agreement":null},{"id":"W2161770374","doi":"10.1109/lsp.2005.860544","title":"A novel radius-adjusted approach for blind adaptive equalization","year":2005,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Blind Source Separation Techniques","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 Windsor","funders":"","keywords":"Quadrature amplitude modulation; QAM; Algorithm; Blind equalization; Adaptive equalizer; Weighting; Constellation diagram; Mean squared error; Equalization (audio); Constellation; Computer science; Mathematics; Convergence (economics); RADIUS; Control theory (sociology); Bit error rate; Statistics; Decoding methods; Artificial intelligence","score_opus":0.06706403537024434,"score_gpt":0.289431842851911,"score_spread":0.22236780748166662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161770374","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.0018221546,0.00005757207,0.9933517,0.0032267,0.000046933746,0.0004933538,0.0000033237259,0.0005396653,0.00045860303],"genre_scores_gemma":[0.5035128,5.154609e-7,0.49005535,0.006078946,0.00018468435,0.00008706573,0.000009714297,0.000017665661,0.000053283682],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984803,0.00005877058,0.00031906852,0.0004915843,0.00033811547,0.00031216815],"domain_scores_gemma":[0.9992316,0.00007247312,0.00022596079,0.00022291022,0.00017016109,0.00007689804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005083781,0.0001955331,0.00017952174,0.00022034699,0.00021575364,0.00035976525,0.00058723195,0.000097930184,0.0000023179516],"category_scores_gemma":[0.000015659527,0.00019415125,0.00007544212,0.0004978594,0.00006464994,0.0012449484,0.000037974267,0.0001641753,0.0000053503854],"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.00017695646,0.0004959281,0.000010741348,0.00014234513,0.000054444557,0.000002045397,0.008711279,0.11369246,0.58672196,0.014042026,0.0113463625,0.26460344],"study_design_scores_gemma":[0.000907649,0.00007550819,0.000012825541,0.00003476553,0.00001214914,0.000013343169,0.000033728058,0.9352698,0.06139836,0.00024896732,0.0016960455,0.00029691556],"about_ca_topic_score_codex":0.0000056713893,"about_ca_topic_score_gemma":0.0000014723748,"teacher_disagreement_score":0.8215773,"about_ca_system_score_codex":0.00008855452,"about_ca_system_score_gemma":0.00011436022,"threshold_uncertainty_score":0.7917258},"labels":[],"label_agreement":null},{"id":"W2161776610","doi":"10.1109/wcnc.2008.10","title":"Subspace Blind MIMO-OFDM Channel Estimation with Short Averaging Periods: Performance Analysis","year":2008,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"McGill University","funders":"","keywords":"Algorithm; Orthogonal frequency-division multiplexing; Cyclic prefix; Subspace topology; Signal subspace; Computer science; Linear subspace; Channel (broadcasting); MIMO; Mathematics; Orthogonality; Noise (video); Telecommunications; Artificial intelligence","score_opus":0.024673643483513006,"score_gpt":0.2521624664516644,"score_spread":0.2274888229681514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161776610","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.28650892,0.000013687025,0.70858544,0.0005944403,0.000018244999,0.00012354732,2.6636422e-7,0.0004522324,0.0037032098],"genre_scores_gemma":[0.7670652,0.000032070682,0.23197986,0.00029279038,0.000013983933,0.000023454382,0.000006935477,0.000007447074,0.00057823345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987076,0.000046015488,0.00020966158,0.0003996653,0.0004010223,0.00023603579],"domain_scores_gemma":[0.99909335,0.000029579995,0.00006886615,0.00057365885,0.00014907382,0.00008546758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029412936,0.00016428478,0.00021047302,0.00044875304,0.0002867877,0.00016004327,0.0004659023,0.000057811045,0.000027616868],"category_scores_gemma":[0.000009237691,0.00013419258,0.000071917384,0.0016585793,0.00005985075,0.0012334903,0.00008895879,0.00013875874,0.000027520104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023064089,0.0008979706,0.25237474,0.00012023708,0.001721117,0.00017953315,0.090180196,0.56322235,0.0011330307,0.025195321,0.004616787,0.060128063],"study_design_scores_gemma":[0.00015250343,0.00009277979,0.019049287,0.000008448068,0.000033188688,0.000043619246,0.00004563306,0.97062045,0.009493526,0.00004609638,0.0001896302,0.0002248053],"about_ca_topic_score_codex":0.000046938247,"about_ca_topic_score_gemma":0.000053070176,"teacher_disagreement_score":0.4805563,"about_ca_system_score_codex":0.000042991345,"about_ca_system_score_gemma":0.00007892211,"threshold_uncertainty_score":0.5472215},"labels":[],"label_agreement":null},{"id":"W2161848024","doi":"10.1109/vetecf.2004.1404779","title":"Application of noisy-independent component analysis for CDMA signal separation","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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 Ottawa","funders":"","keywords":"Independent component analysis; Computer science; Code division multiple access; Noise (video); Algorithm; Detector; Telecommunications link; Gaussian noise; Channel (broadcasting); Matched filter; Multiuser detection; Noise reduction; Dimension (graph theory); Filter (signal processing); Artificial intelligence; Mathematics; Telecommunications","score_opus":0.016457394804472187,"score_gpt":0.30197805858122123,"score_spread":0.28552066377674906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161848024","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.010934199,0.000012059329,0.9858442,0.0011626158,0.000010833433,0.00038936533,0.00000274288,0.00019090374,0.0014530652],"genre_scores_gemma":[0.7669767,0.0000015429238,0.23248658,0.00025219427,0.000024257408,0.00008053689,0.000022408267,0.000003003359,0.0001527957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990343,0.000039516708,0.0003145817,0.00025247832,0.00025308976,0.000106063686],"domain_scores_gemma":[0.9991863,0.00006506671,0.00016707345,0.0003661972,0.0001750061,0.00004039751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042252915,0.000080400154,0.00015814407,0.00024140398,0.000049049235,0.000052155487,0.00036721537,0.00005479148,0.000020667214],"category_scores_gemma":[0.0000045177594,0.00007537589,0.00013008041,0.0004997578,0.000014431768,0.00034991797,0.00005334045,0.000040859668,0.0000151758],"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.000028627108,0.00047419063,0.0028100752,0.000017481561,0.00028182997,1.4154813e-7,0.0013751999,0.064517915,0.06812112,0.7761902,0.0015508793,0.0846323],"study_design_scores_gemma":[0.00015729175,0.00005268075,0.0034027153,8.8681935e-7,0.000033904915,4.406132e-7,0.000009077726,0.8435057,0.14628014,0.0015258545,0.0049419813,0.000089317604],"about_ca_topic_score_codex":0.00003800233,"about_ca_topic_score_gemma":0.00010694871,"teacher_disagreement_score":0.77898777,"about_ca_system_score_codex":0.000042118645,"about_ca_system_score_gemma":0.000027844917,"threshold_uncertainty_score":0.30737394},"labels":[],"label_agreement":null},{"id":"W2162424587","doi":"10.1109/isspit.2005.1577151","title":"Projection-based adaptive Am-FM chirp components signal decomposition","year":2006,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Queen's University","funders":"","keywords":"Chirp; Algorithm; SIGNAL (programming language); Subspace topology; Instantaneous phase; Frequency modulation; Projection (relational algebra); Mathematics; Rate of convergence; Amplitude; Additive white Gaussian noise; Computer science; White noise; Control theory (sociology); Statistics; Telecommunications; Radar; Physics; Radio frequency; Artificial intelligence","score_opus":0.017442272512221673,"score_gpt":0.26308932009406844,"score_spread":0.24564704758184677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162424587","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.018164048,0.000006562455,0.95812154,0.00067380344,0.000067155925,0.00027943784,0.0000016620132,0.00093811494,0.021747695],"genre_scores_gemma":[0.7966418,2.051408e-7,0.2024104,0.0006225377,0.00004427117,0.000022998727,0.000018635397,0.000006391097,0.00023271484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989356,0.000107728985,0.00021052512,0.00029967076,0.00027500198,0.00017151014],"domain_scores_gemma":[0.9994542,0.0000592271,0.000089600304,0.00024760966,0.00010883857,0.00004055137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018944667,0.0001228633,0.0001067112,0.0001734967,0.00014827386,0.00016410598,0.00033302652,0.000062481355,0.00003955704],"category_scores_gemma":[0.0000021889723,0.00011474705,0.00006205697,0.0003081713,0.000031415108,0.000438358,0.000051826446,0.00010802273,0.00007186034],"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.00010742175,0.0017015246,0.0035677343,0.000018950215,0.000042246436,0.00002370895,0.00051589234,0.00830195,0.07237588,0.8693438,0.020781187,0.023219684],"study_design_scores_gemma":[0.00042671044,0.00022009898,0.009872464,0.000014614313,0.0000039324973,0.000008214965,0.0000079328975,0.8136651,0.16446961,0.009710759,0.001345597,0.00025494886],"about_ca_topic_score_codex":0.00047268913,"about_ca_topic_score_gemma":0.000057534973,"teacher_disagreement_score":0.8596331,"about_ca_system_score_codex":0.00006637841,"about_ca_system_score_gemma":0.000055663488,"threshold_uncertainty_score":0.46792486},"labels":[],"label_agreement":null},{"id":"W2162693729","doi":"10.1109/icsmc.1988.754364","title":"Measures, Moments, And Perceptual Signal Processing","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Perception; SIGNAL (programming language); Computer science; Artificial intelligence; Signal processing; Pattern recognition (psychology); Mean squared error; Process (computing); Speech recognition; Mathematics; Algorithm; Statistics; Digital signal processing; Psychology","score_opus":0.022964062904224865,"score_gpt":0.26295311063981397,"score_spread":0.2399890477355891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162693729","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.007876851,0.00013096974,0.9738022,0.0024222643,0.000006118292,0.0000675865,1.228441e-7,0.00041881783,0.0152750565],"genre_scores_gemma":[0.8108665,0.0000074774985,0.18679091,0.0013326316,0.00002872691,0.0000051910033,3.02771e-7,0.0000030578765,0.0009652467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941987,0.000027611719,0.000094661686,0.00017279618,0.00017901884,0.000106028165],"domain_scores_gemma":[0.9997658,0.000009895469,0.000022330167,0.000111057234,0.000041247356,0.000049651408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002120733,0.00005992646,0.000054709493,0.000053325923,0.00007106063,0.00019096394,0.00020198282,0.000030482688,0.000038288268],"category_scores_gemma":[0.000003405775,0.000050555842,0.000011357085,0.000095867734,0.000024848008,0.00065416057,0.00008257038,0.00006249991,0.00002072025],"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.0000010734698,0.000030548068,0.00013728456,0.000002431744,0.0000022268673,5.849941e-7,0.0024750526,0.000017690147,0.0016818284,0.027027717,0.0025909783,0.96603256],"study_design_scores_gemma":[0.0008815932,0.00026730009,0.0067442763,0.000043537406,0.000008963582,0.000095701056,0.00045925105,0.4939049,0.052347817,0.0068733,0.4375201,0.0008532724],"about_ca_topic_score_codex":0.0000057010766,"about_ca_topic_score_gemma":0.000008710854,"teacher_disagreement_score":0.9651793,"about_ca_system_score_codex":0.00001612164,"about_ca_system_score_gemma":0.00003371011,"threshold_uncertainty_score":0.20616074},"labels":[],"label_agreement":null},{"id":"W2163077430","doi":"10.1109/vetecf.2000.886307","title":"Performance of TCM schemes over equalized channels","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McGill University","funders":"","keywords":"Coding gain; Computer science; Channel (broadcasting); Coding (social sciences); Intersymbol interference; Algorithm; Mathematics; Decoding methods; Statistics; Telecommunications","score_opus":0.03604827139606261,"score_gpt":0.27020143751199466,"score_spread":0.23415316611593204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163077430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49912697,0.00008954727,0.42528197,0.000854724,0.000121852085,0.00015960685,4.395405e-7,0.0006197718,0.073745124],"genre_scores_gemma":[0.94711244,0.00003863324,0.04895567,0.0005329467,0.000014094526,0.0000071146064,2.55261e-7,0.0000035974745,0.003335235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999371,0.000027282631,0.00016432074,0.00014058765,0.00018390281,0.00011289515],"domain_scores_gemma":[0.9994796,0.000028715513,0.00006242061,0.00034718876,0.000051985495,0.000030125617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017209166,0.000064192136,0.00010012765,0.000079417936,0.000028364964,0.00003793704,0.0004222552,0.000038435683,0.0004051499],"category_scores_gemma":[0.00001420724,0.000054094515,0.00003513873,0.00023134612,0.000023949426,0.0004810191,0.00011156812,0.000050305553,0.000064129286],"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.000008893656,0.00028991236,0.002266771,0.000058803686,0.000030924286,0.0000020901136,0.0049760723,0.00009323465,0.010621071,0.8688315,0.027022924,0.08579778],"study_design_scores_gemma":[0.00030355528,0.00014043451,0.0003884044,0.00001661477,0.0000014836247,0.000002961555,0.0000073450587,0.7590555,0.21823286,0.0007997983,0.020889783,0.00016124865],"about_ca_topic_score_codex":0.000005359622,"about_ca_topic_score_gemma":3.550057e-7,"teacher_disagreement_score":0.86803174,"about_ca_system_score_codex":0.000006981953,"about_ca_system_score_gemma":0.0000069478538,"threshold_uncertainty_score":0.44361076},"labels":[],"label_agreement":null},{"id":"W2163078354","doi":"10.1109/mshs.2005.1502566","title":"Route tracking of border crossing vehicles using inductance signatures of loop detectors","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":5,"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":"Induction loop; Detector; Tracking (education); Homeland security; Vehicle tracking system; Computer science; Inductance; Identification (biology); Real-time computing; Focus (optics); Transport engineering; Engineering; Telecommunications; Electrical engineering; Geography; Artificial intelligence","score_opus":0.03076034104596678,"score_gpt":0.32369970009044174,"score_spread":0.292939359044475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163078354","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5963563,0.00016760107,0.40265766,0.00009438503,0.000025029272,0.000056689747,5.908711e-7,0.000105269246,0.0005365302],"genre_scores_gemma":[0.6858105,0.0000020426414,0.31399903,0.00013050309,0.000018326366,7.5259715e-7,1.739645e-7,0.000005725973,0.000032945893],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999012,0.000053337462,0.0003334468,0.00020432359,0.00024385168,0.0001530373],"domain_scores_gemma":[0.9992017,0.00006901898,0.0002204144,0.00031073822,0.00016734136,0.00003077289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030182654,0.000100996716,0.00017141098,0.00013984018,0.00008282973,0.0001243533,0.00044889929,0.000091521295,0.000013691779],"category_scores_gemma":[0.000043173353,0.00009183009,0.00005680983,0.00040835902,0.000105606254,0.00083606405,0.000095179035,0.00013458027,6.768555e-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.000006949031,0.00008450697,0.0022186772,0.000026380012,0.000018403016,0.0000011493655,0.0034879087,0.004779979,0.8674254,0.025893651,0.000045512774,0.09601148],"study_design_scores_gemma":[0.000113337665,0.000026297546,0.0028371247,0.00004676068,0.0000032783912,0.0000026134978,0.000035818262,0.054468144,0.9410032,0.0011079335,0.00023734388,0.00011816438],"about_ca_topic_score_codex":0.00007164587,"about_ca_topic_score_gemma":0.000038993854,"teacher_disagreement_score":0.09589332,"about_ca_system_score_codex":0.000028662784,"about_ca_system_score_gemma":0.00010894573,"threshold_uncertainty_score":0.37447223},"labels":[],"label_agreement":null},{"id":"W2163968628","doi":"10.1109/ccece.2003.1226115","title":"Video sequence processing based on spatiotemporal independent component analysis","year":2004,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Wavelet; Video compression picture types; Data compression; Video tracking; Independent component analysis; Frame (networking); Pattern recognition (psychology); Multiview Video Coding; Video processing; Wavelet transform; Feature extraction; Enhanced Data Rates for GSM Evolution; Object (grammar)","score_opus":0.031015907740589436,"score_gpt":0.29508434516121507,"score_spread":0.26406843742062563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163968628","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.020901611,0.0000060531693,0.9708094,0.003616416,0.000024695775,0.0001450784,8.5986466e-7,0.0006282501,0.0038676136],"genre_scores_gemma":[0.81071705,6.0611217e-7,0.18667874,0.0025198786,0.000009136003,0.000014282882,0.0000074059462,0.0000048156335,0.000048076745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857956,0.000065715554,0.00024581258,0.0004023233,0.00053044583,0.000176158],"domain_scores_gemma":[0.99916357,0.00002776611,0.00011282004,0.0005079954,0.00010292971,0.00008489299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041470485,0.000130848,0.00016373073,0.00041107633,0.00011021053,0.00028032353,0.0005678136,0.00006242634,0.000023357523],"category_scores_gemma":[0.000015282994,0.000113758346,0.000079748395,0.0011425753,0.000030635456,0.0004696825,0.00007462016,0.00014356177,0.000033131233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000376972,0.0011260429,0.009263029,0.000046229085,0.00016258124,0.00009469569,0.0030603304,0.63738865,0.0072081843,0.29018044,0.00029665828,0.051135417],"study_design_scores_gemma":[0.00047865717,0.00020012198,0.010966822,0.00003420821,0.000032350228,0.0000030839171,0.000018584753,0.9224931,0.05825845,0.006778921,0.00038693234,0.00034878036],"about_ca_topic_score_codex":0.00024389585,"about_ca_topic_score_gemma":0.00010760112,"teacher_disagreement_score":0.7898154,"about_ca_system_score_codex":0.00014556508,"about_ca_system_score_gemma":0.00020566945,"threshold_uncertainty_score":0.46389306},"labels":[],"label_agreement":null},{"id":"W2164038961","doi":"10.1109/ccece.2003.1226205","title":"A blind user identification for multiuser DS-CDMA based on subspace search","year":2004,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Concordia University","funders":"","keywords":"Code division multiple access; Computer science; Subspace topology; Signal subspace; Ambiguity; Multiuser detection; Linear subspace; Algorithm; SIGNAL (programming language); Identification (biology); Interference (communication); Eigendecomposition of a matrix; Code (set theory); Theoretical computer science; Speech recognition; Mathematics; Artificial intelligence; Eigenvalues and eigenvectors; Telecommunications; Noise (video)","score_opus":0.041637285001871534,"score_gpt":0.3314672752804226,"score_spread":0.28982999027855105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164038961","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.023382513,0.0000030349452,0.9655391,0.008582043,0.000076356395,0.0006669776,0.0000021523044,0.0005159501,0.0012318579],"genre_scores_gemma":[0.7447654,0.0000010457059,0.25161818,0.0017169097,0.00002558508,0.00010476399,0.000007977555,0.000011623706,0.0017485567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99883276,0.000052341835,0.00019308287,0.00039072306,0.00032408265,0.00020701512],"domain_scores_gemma":[0.9988818,0.000121837824,0.000054321354,0.00066144613,0.00021035154,0.000070199916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066321343,0.000108940905,0.00009262051,0.0002153265,0.00011660413,0.00030717507,0.00055711996,0.00008196905,0.00001686605],"category_scores_gemma":[0.000060466533,0.00009745341,0.00006790595,0.0003664092,0.000026489382,0.0004607273,0.00004942373,0.00010371578,0.0001232229],"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.00013004117,0.0008043333,0.00034198439,0.000038341695,0.00001911626,0.0000038138169,0.002978875,0.025328837,0.02036632,0.93363905,0.0068269423,0.009522348],"study_design_scores_gemma":[0.0026816127,0.00030673,0.0033266891,0.000027640284,0.000004956527,0.0000017393303,0.00005176497,0.3440635,0.63293046,0.006525201,0.009736218,0.00034347898],"about_ca_topic_score_codex":0.000048224287,"about_ca_topic_score_gemma":0.00005493379,"teacher_disagreement_score":0.92711383,"about_ca_system_score_codex":0.00007177301,"about_ca_system_score_gemma":0.00012521428,"threshold_uncertainty_score":0.39740348},"labels":[],"label_agreement":null},{"id":"W2164273299","doi":"","title":"Topmoumoute Online Natural Gradient Algorithm","year":2007,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Université de Montréal","funders":"","keywords":"Stochastic gradient descent; Frequentist inference; Generalization; Gradient descent; Computer science; Convergence (economics); Algorithm; Computation; Mathematical optimization; Bayesian probability; Mathematics; Artificial intelligence; Bayesian inference; Artificial neural network","score_opus":0.01200021456643386,"score_gpt":0.280624120790552,"score_spread":0.26862390622411814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164273299","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.0051566595,0.000051480412,0.9846741,0.0013838682,0.0002816809,0.00008801138,7.475912e-7,0.00077911164,0.007584347],"genre_scores_gemma":[0.23912723,0.0000042879283,0.7547224,0.0029236535,0.000063027066,0.0000015491006,0.0000052868536,0.0000043529644,0.0031482081],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991802,0.000019094283,0.00017390972,0.00021292183,0.00020426979,0.0002096351],"domain_scores_gemma":[0.99945116,0.00004340358,0.000038515303,0.0003256925,0.00006959266,0.00007164397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004043284,0.00008321652,0.00007750122,0.00010989935,0.00004881036,0.00007728566,0.00048456324,0.000038880626,0.000013145149],"category_scores_gemma":[0.000012497115,0.000068201196,0.00004472535,0.0002734732,0.000019163808,0.00031959373,0.00014060279,0.00013569364,0.00003512714],"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.000001951085,0.0002006235,0.0000855657,0.0000018044137,0.000009336542,0.000029206594,0.00088099873,0.00000424782,0.0006087885,0.3204598,0.004854402,0.67286325],"study_design_scores_gemma":[0.0011940536,0.00063625665,0.0324643,0.000029915704,0.000010143392,0.0002559348,0.00032015055,0.40732273,0.180054,0.044047672,0.33224568,0.001419182],"about_ca_topic_score_codex":0.00003160186,"about_ca_topic_score_gemma":0.00006920412,"teacher_disagreement_score":0.67144406,"about_ca_system_score_codex":0.0000324859,"about_ca_system_score_gemma":0.000021482503,"threshold_uncertainty_score":0.2781164},"labels":[],"label_agreement":null},{"id":"W2164596805","doi":"10.1109/glocom.1997.638417","title":"An FFT method for generating bandlimited Gaussian noise variates","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Queen's University","funders":"","keywords":"Bandlimiting; Gaussian noise; Noise (video); Fast Fourier transform; Computer science; Gaussian; Algorithm; Noise measurement; Mathematics; Electronic engineering; Speech recognition; Noise reduction; Artificial intelligence; Fourier transform; Engineering; Physics; Mathematical analysis","score_opus":0.03683919452739814,"score_gpt":0.3177852338506192,"score_spread":0.28094603932322104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164596805","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.00051221316,0.000020681899,0.9903918,0.0018510835,0.00006557075,0.00023464666,0.0000014145218,0.00083171896,0.006090871],"genre_scores_gemma":[0.07121354,0.0000029260216,0.92514724,0.0026231431,0.00007457775,0.000054015116,0.0000040621057,0.000010340866,0.00087014644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989995,0.00013955426,0.00020305872,0.00033290192,0.00012694053,0.00019809054],"domain_scores_gemma":[0.99915224,0.00013730193,0.000064171596,0.00047249952,0.000085104795,0.000088691406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056608516,0.00010934283,0.00012053525,0.00010568297,0.00015094984,0.00033615576,0.00050339516,0.00007032154,0.00010458775],"category_scores_gemma":[0.00004602,0.000093211886,0.000050339684,0.00024065725,0.000009086688,0.00063693314,0.000050133265,0.000067255976,0.000017038083],"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.0000038067976,0.00028162336,0.00010437191,0.000012773237,0.000026055952,0.0000026717814,0.0043773754,0.0009388909,0.083567746,0.7733928,0.014075791,0.12321607],"study_design_scores_gemma":[0.00018185818,0.00011956392,0.0000533482,0.0000027204667,0.000003235098,0.0000045655993,0.000014210464,0.9613313,0.030254243,0.0037384406,0.004155069,0.00014141273],"about_ca_topic_score_codex":0.000028639632,"about_ca_topic_score_gemma":0.00001574123,"teacher_disagreement_score":0.9603924,"about_ca_system_score_codex":0.0000137487295,"about_ca_system_score_gemma":0.000012212244,"threshold_uncertainty_score":0.38010705},"labels":[],"label_agreement":null},{"id":"W2164802670","doi":"10.1109/adfsp.1998.685686","title":"Packet loss concealment in baseline JPEG coded images","year":2002,"lang":"en","type":"article","venue":"","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":"University of British Columbia","funders":"","keywords":"JPEG; Computer science; Decoding methods; Artificial intelligence; JPEG 2000; Iterative reconstruction; Data compression; Encoding (memory); Computer vision; Network packet; Transform coding; Missing data; Lossless JPEG; Image (mathematics); Compressed sensing; Image compression; Algorithm; Image processing; Discrete cosine transform","score_opus":0.024357742931733935,"score_gpt":0.26622884316462886,"score_spread":0.24187110023289493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164802670","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.006260144,0.000096529846,0.94949025,0.010914896,0.000060192247,0.00019775715,0.000002199735,0.0005541754,0.032423873],"genre_scores_gemma":[0.8978382,0.000059917737,0.09539065,0.0034119652,0.000018732579,0.000019959702,0.0000019196264,0.00000534428,0.0032533186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990609,0.00011656092,0.00021581516,0.0002462446,0.00018625872,0.00017419005],"domain_scores_gemma":[0.99939287,0.00008064583,0.000042760537,0.00038167232,0.00004796384,0.00005410686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044907277,0.000090251,0.000113001195,0.00009854363,0.000027733957,0.00009581719,0.0004154438,0.000042160507,0.0003643238],"category_scores_gemma":[0.000031687236,0.00007889044,0.000028061673,0.00028317227,0.0000345373,0.0003594249,0.0001096847,0.0000987521,0.00017561669],"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.000010263923,0.00092317996,0.006641563,0.000025066203,0.000019816978,0.00017893371,0.006138911,0.000272864,0.0036517642,0.49635595,0.37425238,0.11152928],"study_design_scores_gemma":[0.0019552987,0.0003150971,0.0036040673,0.0000555018,0.000004208649,0.000046640744,0.00013562811,0.6660744,0.22176258,0.015490423,0.089678444,0.00087771635],"about_ca_topic_score_codex":0.000046223995,"about_ca_topic_score_gemma":0.000037031412,"teacher_disagreement_score":0.8915781,"about_ca_system_score_codex":0.000032310712,"about_ca_system_score_gemma":0.000012346106,"threshold_uncertainty_score":0.398909},"labels":[],"label_agreement":null},{"id":"W2165923416","doi":"10.1109/icassp.1998.679540","title":"Convergence properties of blind algorithms for base station CDMA receivers","year":2002,"lang":"en","type":"article","venue":"","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Algorithm; Computer science; Convergence (economics); Code division multiple access; Base station; Channel (broadcasting); Wireless; Telecommunications","score_opus":0.10202499261361475,"score_gpt":0.2797685496540831,"score_spread":0.17774355704046835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165923416","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.013098075,0.000048896254,0.983584,0.0011093974,0.00008852184,0.00034671495,0.000003890094,0.00019448964,0.0015260284],"genre_scores_gemma":[0.704112,0.000029494882,0.29391986,0.0003212145,0.000011050174,0.000039414037,0.0000018129721,0.0000045461547,0.0015606008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933714,0.00003566336,0.00018544742,0.00017925157,0.0001586235,0.00010386093],"domain_scores_gemma":[0.9994143,0.000035790694,0.00008286123,0.00022967099,0.00020308465,0.000034268607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021753606,0.000065430024,0.000085985645,0.00008616961,0.000044643057,0.0000399965,0.00029310604,0.000036791174,0.000076761135],"category_scores_gemma":[0.00004704746,0.000055025732,0.00003607015,0.00019508414,0.000038115926,0.0005270217,0.000035241985,0.00003543303,0.000017496859],"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.00011915639,0.0008418435,0.00045308162,0.00028390286,0.00009736274,0.000004205805,0.033279292,0.000992595,0.103177376,0.42225206,0.08227366,0.35622546],"study_design_scores_gemma":[0.00036332136,0.00015707755,0.0000332339,0.000012003249,0.0000027232431,0.000001237828,0.00010368638,0.5593768,0.43569928,0.0011857789,0.0029554744,0.00010942859],"about_ca_topic_score_codex":0.00003675975,"about_ca_topic_score_gemma":0.000007658255,"teacher_disagreement_score":0.69101393,"about_ca_system_score_codex":0.000014633345,"about_ca_system_score_gemma":0.000018162322,"threshold_uncertainty_score":0.22438842},"labels":[],"label_agreement":null},{"id":"W2166186983","doi":"10.1109/bsc.2006.1644582","title":"Optimum Linear Systems for Power Constrained Transmission","year":2006,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Transmitter; Bandlimiting; Transmission (telecommunications); Computer science; Bandwidth (computing); Band-pass filter; Linear filter; Gaussian; Distortion (music); Control theory (sociology); Mathematics; Channel (broadcasting); Electronic engineering; Filter (signal processing); Algorithm; Telecommunications; Fourier transform; Physics; Engineering; Mathematical analysis; Amplifier","score_opus":0.013316591501919979,"score_gpt":0.2621700503558828,"score_spread":0.24885345885396284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166186983","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.00042374033,0.000074039635,0.96856946,0.0011918517,0.00009018228,0.0003681952,0.0000018649054,0.0006782538,0.028602391],"genre_scores_gemma":[0.5043385,0.0000030750343,0.49127504,0.00031244653,0.0000396632,0.000042768097,0.000005905445,0.000007887759,0.0039746966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993089,0.00002908931,0.0001942981,0.00019851462,0.00012668055,0.00014252556],"domain_scores_gemma":[0.9995444,0.0000634593,0.000041115018,0.00022168084,0.0000890131,0.00004036323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002632909,0.00008088953,0.000100322475,0.00006313097,0.00006032593,0.00011444616,0.00028244418,0.00006663694,0.000015648922],"category_scores_gemma":[0.0000050455305,0.00006528645,0.000055328874,0.0001167817,0.000020366557,0.00022959238,0.000018443032,0.00004443175,0.000011837949],"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.000005174287,0.000061840125,0.000009816043,0.000012891035,0.000004201319,0.0000015040496,0.00013907392,0.0009659652,0.0036549694,0.97416186,0.019058323,0.0019243627],"study_design_scores_gemma":[0.00056932215,0.00019686202,0.000048585167,0.000022001575,0.000003034735,0.00001597034,0.000026719883,0.7401492,0.024671577,0.0065456326,0.22750925,0.00024186778],"about_ca_topic_score_codex":0.00003301103,"about_ca_topic_score_gemma":6.542462e-7,"teacher_disagreement_score":0.96761626,"about_ca_system_score_codex":0.00001158573,"about_ca_system_score_gemma":0.000043939413,"threshold_uncertainty_score":0.2662304},"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":"W2166393983","doi":"10.1109/isspa.2005.1580978","title":"Channel estimation in unknown noise: application of canonical correlation decomposition in subspaces","year":2006,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McMaster University","funders":"","keywords":"Linear subspace; Subspace topology; Noise (video); Gaussian noise; Additive white Gaussian noise; Covariance matrix; Canonical correlation; Algorithm; Channel (broadcasting); Computer science; White noise; Covariance; Noise measurement; Gaussian; Matrix decomposition; Mathematics; Value noise; Artificial intelligence; Statistics; Noise reduction; Telecommunications; Noise floor; Eigenvalues and eigenvectors","score_opus":0.006205824258348482,"score_gpt":0.27266833235947047,"score_spread":0.266462508101122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166393983","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.1135224,0.000018197827,0.8826575,0.00068909215,0.000022231972,0.00025527395,3.428906e-7,0.00010690152,0.002728044],"genre_scores_gemma":[0.94612545,0.0000027430672,0.05370356,0.000047626632,0.000006340382,0.00004874088,0.00002713299,0.0000036103359,0.00003481075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913085,0.00007381905,0.00033936583,0.00019748938,0.00015815749,0.000100316065],"domain_scores_gemma":[0.9995435,0.000066657296,0.0001261213,0.00019397149,0.000054510376,0.000015271933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036520357,0.000070183465,0.000107498265,0.00028929987,0.000017921046,0.000029934019,0.0001779322,0.00008297434,0.0000017698369],"category_scores_gemma":[0.000012052366,0.00007311589,0.000019176723,0.000601865,0.000019015066,0.0005324553,0.00003364938,0.00008171701,0.0000061969445],"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.0000144789055,0.00033533465,0.013518706,0.000017933226,0.0000014804878,0.0000010396176,0.0006132745,0.30856386,0.006141113,0.66000015,0.0001882543,0.010604361],"study_design_scores_gemma":[0.00020868791,0.000025845178,0.09293747,0.000014656325,7.725922e-7,0.0000015463162,0.000005866164,0.872294,0.011107117,0.023305148,0.000027356733,0.00007150672],"about_ca_topic_score_codex":0.0015513728,"about_ca_topic_score_gemma":0.0030875409,"teacher_disagreement_score":0.83260304,"about_ca_system_score_codex":0.00008537694,"about_ca_system_score_gemma":0.00004428822,"threshold_uncertainty_score":0.29815793},"labels":[],"label_agreement":null},{"id":"W2166792848","doi":"10.1109/tgrs.2011.2112772","title":"Incorporating Uncertainty in Unexploded Ordnance Discrimination","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Geoscience and Remote Sensing","topic":"Blind Source Separation Techniques","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":"Unexploded ordnance; Maxima and minima; Context (archaeology); Posterior probability; Computer science; Artificial intelligence; Probability density function; Pattern recognition (psychology); Bayesian probability; Mathematics; Data mining; Statistics; Remote sensing; Geography","score_opus":0.03877496988423116,"score_gpt":0.2593655397988553,"score_spread":0.22059056991462414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166792848","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.06947957,0.0000067216542,0.9287905,0.00034622633,0.0001899024,0.00013211936,5.7150515e-7,0.00017045291,0.00088393304],"genre_scores_gemma":[0.7066858,0.000021928798,0.29295084,0.0002682279,0.0000047068306,2.7271093e-7,1.7369427e-7,0.0000044206267,0.000063683605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988479,0.00009962898,0.00022990086,0.00040357572,0.00020951535,0.00020946997],"domain_scores_gemma":[0.9994592,0.000051347128,0.00008966918,0.00027704352,0.000061651,0.00006106649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004962493,0.00012337785,0.00011874529,0.0002949828,0.00025407935,0.00009914582,0.00020916214,0.00006484824,0.0000010857877],"category_scores_gemma":[0.000011033396,0.00011259257,0.000029997105,0.00077754125,0.0001390649,0.00081606046,0.0000047065428,0.00021572075,0.0000038939897],"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.000008376448,0.000039106137,0.0000023967632,0.000006568685,0.0000015790699,0.000012050715,0.006587904,0.00063795253,0.003255156,0.001921162,0.0000020362222,0.9875257],"study_design_scores_gemma":[0.00018754089,0.00010975573,0.00066294224,0.00011964884,0.0000031116297,0.000034811386,0.00035988196,0.94428843,0.04204132,0.011958786,0.000024738703,0.0002090187],"about_ca_topic_score_codex":0.001073936,"about_ca_topic_score_gemma":0.0008120461,"teacher_disagreement_score":0.98731667,"about_ca_system_score_codex":0.00004704876,"about_ca_system_score_gemma":0.00006692607,"threshold_uncertainty_score":0.45913917},"labels":[],"label_agreement":null},{"id":"W2166859203","doi":"10.1109/icc.2002.996834","title":"An iterative blind cyclostationary beamforming algorithm","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Concordia University","funders":"","keywords":"Cyclostationary process; Computer science; Algorithm; Beamforming; Iterative method; Singular value decomposition; Simple (philosophy); Artificial neural network; Artificial intelligence; Telecommunications; Channel (broadcasting)","score_opus":0.01605880748473974,"score_gpt":0.2958758974922607,"score_spread":0.2798170900075209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166859203","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.002370321,0.000011505429,0.9559942,0.00034267292,0.000059410897,0.00013133144,9.497467e-7,0.00040674224,0.040682856],"genre_scores_gemma":[0.14391379,0.0000029393545,0.8541224,0.0013539718,0.00001476871,0.000017271444,0.000006863169,0.000005478907,0.0005625064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991651,0.000116365816,0.00015445276,0.00024395839,0.00018245452,0.00013765559],"domain_scores_gemma":[0.99940705,0.00005038591,0.000045962155,0.0003226097,0.00010082454,0.0000731395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000317928,0.00008866173,0.00007306826,0.00011595123,0.000110823916,0.00020108446,0.00030047746,0.000043806307,0.000057899004],"category_scores_gemma":[0.00001878698,0.000080040074,0.00002547941,0.00027670243,0.000019314613,0.001621358,0.000027351423,0.00008595659,0.00004003601],"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.0000010307723,0.00008612116,0.00008633963,9.761109e-7,0.0000056171493,0.0000047743156,0.0026908268,0.00009531723,0.0004524662,0.9400641,0.00052127126,0.0559912],"study_design_scores_gemma":[0.0011615823,0.00065176736,0.000988297,0.000017014487,0.000006090283,0.00012602466,0.0006453554,0.56038755,0.17875391,0.1753909,0.0809658,0.00090569485],"about_ca_topic_score_codex":0.0000059518698,"about_ca_topic_score_gemma":0.0000026546718,"teacher_disagreement_score":0.7646732,"about_ca_system_score_codex":0.0000206956,"about_ca_system_score_gemma":0.00007027164,"threshold_uncertainty_score":0.32639396},"labels":[],"label_agreement":null},{"id":"W2166937261","doi":"10.1109/icassp.2006.1661363","title":"A New Diagonal Hessian Algorithm for Blind Signal Separation","year":2006,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Ottawa","funders":"","keywords":"Hessian matrix; Algorithm; Blind signal separation; Diagonal; Separation (statistics); Mixing (physics); SIGNAL (programming language); Computer science; Matrix (chemical analysis); Function (biology); Diagonal matrix; Mathematics; Mathematical optimization; Applied mathematics; Telecommunications","score_opus":0.016443347712288624,"score_gpt":0.29509716000603914,"score_spread":0.2786538122937505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166937261","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.00018292436,0.000023158897,0.98703134,0.0016456653,0.00006932104,0.00031130709,0.00000313895,0.0004677658,0.010265397],"genre_scores_gemma":[0.03189633,7.848994e-7,0.9598859,0.0006752295,0.00027153865,0.0000539574,0.000029832714,0.000008081379,0.0071783694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991216,0.000029806532,0.00020356398,0.00026740282,0.00019951865,0.00017811914],"domain_scores_gemma":[0.9995179,0.00006804495,0.00006483133,0.00021083739,0.000074477655,0.000063900705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021730304,0.00010265078,0.00009797439,0.00010239397,0.00008861405,0.00026453007,0.00033551306,0.00007150648,0.00006439645],"category_scores_gemma":[0.0000035335834,0.00009354515,0.000067344394,0.00021561258,0.000011960679,0.0005921381,0.000046853023,0.00006030806,0.000047266447],"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.000005820703,0.00007050075,0.000032561704,0.0000023107991,0.0000070396595,0.000001480563,0.00017197101,0.00012774902,0.001047019,0.480344,0.105917096,0.41227245],"study_design_scores_gemma":[0.0010617286,0.0002064424,0.00052827655,0.0000068795807,0.000005732087,0.000009760283,0.000008276517,0.7042826,0.06473319,0.1318539,0.096974246,0.00032897678],"about_ca_topic_score_codex":0.000115104216,"about_ca_topic_score_gemma":0.000059563255,"teacher_disagreement_score":0.70415485,"about_ca_system_score_codex":0.000025292622,"about_ca_system_score_gemma":0.00014921284,"threshold_uncertainty_score":0.38146606},"labels":[],"label_agreement":null},{"id":"W2167106959","doi":"10.1109/iembs.2005.1616366","title":"ICA Denoising for Event-Related fMRI Studies","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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 British Columbia","funders":"","keywords":"Noise reduction; Computer science; Pattern recognition (psychology); Artificial intelligence; Subspace topology; Noise (video); Task (project management); Independent component analysis; Event (particle physics); Neuroimaging; Speech recognition; Psychology; Image (mathematics); Neuroscience; Engineering","score_opus":0.037398927455904354,"score_gpt":0.3537072744004427,"score_spread":0.31630834694453835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167106959","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.0050412402,0.00029269492,0.9791584,0.010993209,0.000074265554,0.0002151337,2.4828273e-7,0.00071537175,0.0035094647],"genre_scores_gemma":[0.6304025,0.000022950922,0.36435354,0.0015943445,0.000037013164,0.000030857314,7.4134715e-7,0.0000059285894,0.003552105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993403,0.00002972666,0.00018864861,0.0001926628,0.0001077792,0.0001408781],"domain_scores_gemma":[0.99946916,0.000104012,0.000050287246,0.00023908804,0.000106584564,0.00003088125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034109555,0.000072870025,0.00009936937,0.0000674485,0.00010276725,0.00007815877,0.00030579715,0.00004050736,0.000010574487],"category_scores_gemma":[0.000052357,0.00006076124,0.00005001306,0.00015950525,0.000020096284,0.0004356756,0.000099870485,0.00005230386,0.000045693323],"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.0000034179227,0.000073928,0.000040273506,0.000009227998,0.00006165236,8.7671594e-7,0.0043616616,0.00046287326,0.0017348249,0.838549,0.041704856,0.11299736],"study_design_scores_gemma":[0.0013753496,0.0004105197,0.00040854036,0.000072522496,0.000026118774,0.000028940665,0.00047940458,0.23997447,0.30726978,0.14761738,0.30151615,0.0008208333],"about_ca_topic_score_codex":0.000002280602,"about_ca_topic_score_gemma":0.000016276197,"teacher_disagreement_score":0.6909317,"about_ca_system_score_codex":0.000036020323,"about_ca_system_score_gemma":0.000025945366,"threshold_uncertainty_score":0.24777713},"labels":[],"label_agreement":null},{"id":"W2167133798","doi":"10.1109/ccece.2005.1557400","title":"A cost function for simultaneous blind equalization and phase recovery of QAM signals","year":2006,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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 Saskatchewan","funders":"","keywords":"Blind equalization; QAM; Quadrature amplitude modulation; Equalization (audio); Computer science; SIGNAL (programming language); Channel (broadcasting); Phase (matter); Algorithm; Control theory (sociology); Electronic engineering; Telecommunications; Bit error rate; Engineering; Physics; Artificial intelligence","score_opus":0.041066168719605375,"score_gpt":0.32647246956948417,"score_spread":0.2854063008498788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167133798","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.017058687,0.000036372978,0.98090065,0.00017894713,0.000043213247,0.0004626578,0.000005625614,0.0001647719,0.0011490795],"genre_scores_gemma":[0.9368267,0.0000066198218,0.062081933,0.0003019577,0.000029925852,0.00003267163,0.00002251151,0.000005670011,0.00069198606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936426,0.000037422684,0.00022464198,0.00017708458,0.00011047063,0.00008614631],"domain_scores_gemma":[0.9992509,0.00030652832,0.000114858936,0.00014845602,0.00015731849,0.000021921274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002838096,0.00006597888,0.000097808916,0.00010758184,0.000043934,0.00007768176,0.00009882773,0.000055227334,0.000010777419],"category_scores_gemma":[0.00006586478,0.00006163468,0.00002841638,0.0001805887,0.000017991659,0.0003454086,0.000027342805,0.000024765168,0.000001569668],"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.00054456416,0.0008767829,0.000054652857,0.000089807574,0.00003496013,0.0000024051938,0.00066650484,0.021417586,0.11033081,0.52102125,0.009861328,0.33509934],"study_design_scores_gemma":[0.0022323306,0.0011957246,0.000023020646,0.000017476166,0.000014728821,0.000005180793,0.000027863705,0.7402896,0.19276284,0.051030926,0.012198235,0.00020206693],"about_ca_topic_score_codex":0.000030224832,"about_ca_topic_score_gemma":0.00002092609,"teacher_disagreement_score":0.91976804,"about_ca_system_score_codex":0.000011681963,"about_ca_system_score_gemma":0.000026742973,"threshold_uncertainty_score":0.25133893},"labels":[],"label_agreement":null},{"id":"W2167302403","doi":"10.3389/fnsys.2011.00093","title":"ICA-fNORM: Spatial Normalization of fMRI Data Using Intrinsic Group-ICA Networks","year":2011,"lang":"en","type":"article","venue":"Frontiers in Systems Neuroscience","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":38,"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":"National Institutes of Health","keywords":"Independent component analysis; Normalization (sociology); Spatial normalization; Artificial intelligence; Pattern recognition (psychology); Computer science; Neuroscience; Psychology","score_opus":0.07539193489919087,"score_gpt":0.26609551024419426,"score_spread":0.19070357534500337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167302403","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.007902942,0.00014723737,0.98765504,0.000018753753,0.00328693,0.00039257313,0.0000064058086,0.00015646845,0.000433617],"genre_scores_gemma":[0.92582923,0.00004198383,0.07388392,0.00014353558,0.000053897144,0.00001064662,0.0000059683234,0.00001203917,0.000018780504],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752665,0.00033903614,0.00060417556,0.0007124665,0.0004746,0.00034310177],"domain_scores_gemma":[0.9979772,0.000026037778,0.00039633826,0.001425723,0.00008598511,0.00008872797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011813531,0.0001664487,0.00029213325,0.00037447928,0.000112142974,0.00015115955,0.0028806713,0.000103497594,0.0000010653521],"category_scores_gemma":[0.00012347057,0.00016640115,0.000030554194,0.0013872779,0.00020630422,0.0019249481,0.0008434862,0.00019079608,8.2319326e-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.00023171536,0.0019630382,0.60470885,0.0005936493,0.00004364246,0.00028448226,0.019398343,0.09369636,0.018360635,0.14028013,0.025225341,0.09521383],"study_design_scores_gemma":[0.00015350626,0.00008357639,0.010917719,0.000059767037,0.0000037557495,0.000022742448,0.000044802517,0.9866274,0.0006358973,0.00016090396,0.0011084739,0.00018147803],"about_ca_topic_score_codex":0.0008802913,"about_ca_topic_score_gemma":0.00003279411,"teacher_disagreement_score":0.9179263,"about_ca_system_score_codex":0.000056988043,"about_ca_system_score_gemma":0.00009880265,"threshold_uncertainty_score":0.6785642},"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":"W2168258490","doi":"10.1109/ccece.2008.4564589","title":"Random pulse train spectrum calculation unleashed","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Spectrum (functional analysis); Pulse (music); Coincidence; Amplitude; Frequency spectrum; Binary number; Pulse-amplitude modulation; Zero (linguistics); Computer science; Algorithm; Mathematics; Statistical physics; Physics; Spectral density; Telecommunications; Optics; Detector; Quantum mechanics","score_opus":0.017580493323447927,"score_gpt":0.2036670702963428,"score_spread":0.18608657697289485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168258490","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.061983425,0.000051563246,0.9293045,0.003706184,0.00013824276,0.00042266713,0.0000031157724,0.00065415585,0.0037361453],"genre_scores_gemma":[0.98711634,0.00008006251,0.011673678,0.0008089895,0.000113899274,0.000046076682,0.0000055602854,0.000020438436,0.00013493001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979556,0.000022114671,0.00033568562,0.0006722262,0.00032067162,0.0006936687],"domain_scores_gemma":[0.99877113,0.00006109482,0.000081761704,0.0002000918,0.00022401442,0.000661886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002307297,0.00035418206,0.00036808505,0.00059902074,0.00023945842,0.00048621045,0.0006341726,0.00018287203,0.000025224113],"category_scores_gemma":[0.00005016667,0.0003545804,0.00007012541,0.0006994325,0.000059226953,0.0006143392,0.000072481336,0.0005081935,0.000019659781],"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.000023878294,0.000054318716,0.0008608497,0.000028841723,0.000037546528,0.00006180155,0.0023420767,0.0004650592,0.0009954,0.9562717,0.0009451569,0.03791337],"study_design_scores_gemma":[0.0005710152,0.00026303544,0.007832845,0.00005511176,0.0000053548715,0.00014988662,0.0000053324734,0.9859157,0.0009942972,0.0024091473,0.0013183311,0.00047990226],"about_ca_topic_score_codex":0.0013162309,"about_ca_topic_score_gemma":0.00040479255,"teacher_disagreement_score":0.9854507,"about_ca_system_score_codex":0.00015722535,"about_ca_system_score_gemma":0.00052569114,"threshold_uncertainty_score":0.9998906},"labels":[],"label_agreement":null},{"id":"W2168380040","doi":"10.1109/tbme.2005.869791","title":"Bayesian Spatio-Temporal Approach for EEG Source Reconstruction: Conciliating ECD and Distributed Models","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Biomedical Engineering","topic":"Blind Source Separation Techniques","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":"École de Technologie Supérieure","funders":"University of Pennsylvania","keywords":"Magnetoencephalography; Computer science; Electroencephalography; Inverse problem; Bayesian probability; Hyperparameter; Artificial intelligence; Pattern recognition (psychology); Algorithm; Mathematics","score_opus":0.011514069514906944,"score_gpt":0.21342437959682162,"score_spread":0.20191031008191468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168380040","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.002138543,0.000020541358,0.99624133,0.00027137564,0.0001958005,0.0002787224,0.00003968441,0.0007502367,0.00006373882],"genre_scores_gemma":[0.67784715,0.000003479659,0.32191125,0.000040239065,0.000041500007,0.00008325385,0.000028594077,0.000012975418,0.000031539745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882245,0.000024508263,0.00032234384,0.00035324923,0.00023327564,0.00024415308],"domain_scores_gemma":[0.9994327,0.00010773853,0.000060838698,0.0002164119,0.000054954868,0.0001273499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026067588,0.00017120213,0.00018207342,0.00019963193,0.00015833347,0.000110975794,0.00019460799,0.00015133839,0.0000037474188],"category_scores_gemma":[0.000007078406,0.00017625901,0.000074928364,0.0003656352,0.0000653797,0.00038986487,0.0000032132136,0.00022396889,7.006445e-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.000016567681,0.00017559573,0.000013661644,0.00008640178,0.000036019523,0.0000019044968,0.0003158382,0.93241584,0.0014149579,0.006425387,0.00022740633,0.05887041],"study_design_scores_gemma":[0.00038312547,0.000070332506,0.000012947513,0.000023538187,0.000007880111,0.000037462603,0.000018263938,0.99433017,0.0031846547,0.0005418254,0.0012005154,0.00018929534],"about_ca_topic_score_codex":0.00004639993,"about_ca_topic_score_gemma":0.0000044169037,"teacher_disagreement_score":0.6757086,"about_ca_system_score_codex":0.00006711101,"about_ca_system_score_gemma":0.000043691893,"threshold_uncertainty_score":0.7187634},"labels":[],"label_agreement":null},{"id":"W2168599920","doi":"10.1109/tnn.2002.806949","title":"A neural-network appearance-based 3-D object recognition using independent component analysis","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Blind Source Separation Techniques","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":"Concordia University; McGill University","funders":"","keywords":"Independent component analysis; Computer science; Principal component analysis; Artificial intelligence; Pattern recognition (psychology); Cognitive neuroscience of visual object recognition; Artificial neural network; Facial recognition system; Object (grammar); Feature extraction; Computer vision","score_opus":0.0341544514731379,"score_gpt":0.26286028180864285,"score_spread":0.22870583033550496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168599920","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.047086697,0.000101621175,0.9506502,0.00019830263,0.0007783343,0.00042536113,0.000004716936,0.0006171283,0.00013762014],"genre_scores_gemma":[0.9754465,0.000023120418,0.022743022,0.0016026255,0.000065917084,0.00006369775,0.000007122555,0.000028059278,0.000019895198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703074,0.0008020905,0.0005104165,0.00068636023,0.00042052407,0.0005498959],"domain_scores_gemma":[0.9986056,0.00016530616,0.00021660652,0.0007086513,0.00012813891,0.00017567149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006108773,0.00033775117,0.00039437905,0.00046322058,0.00047684,0.00029475425,0.0004480939,0.00020539665,0.00004845914],"category_scores_gemma":[0.0000040869836,0.0003447162,0.0004432057,0.0026648967,0.000060941315,0.0005010961,0.0000033223769,0.000719679,0.000012221334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031118318,0.00014310161,0.000054234257,0.0000040687455,0.00010884556,0.000009123501,0.00005680003,0.9854166,0.00009048891,0.00007328799,0.00003502803,0.013977322],"study_design_scores_gemma":[0.0004429656,0.00013808101,0.00022903104,0.000030384195,0.00017484515,0.000020685413,0.000006771541,0.9957772,0.0025180622,0.0002282318,0.00006784847,0.00036589694],"about_ca_topic_score_codex":0.000052256095,"about_ca_topic_score_gemma":0.00010892636,"teacher_disagreement_score":0.92835987,"about_ca_system_score_codex":0.00012287054,"about_ca_system_score_gemma":0.00005467794,"threshold_uncertainty_score":0.99990046},"labels":[],"label_agreement":null},{"id":"W2168622085","doi":"10.1109/aspaa.2007.4393059","title":"Coherent ICA: Implications for Auditory Signal Processing","year":2007,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McMaster University","funders":"","keywords":"Infomax; Independent component analysis; Inferior colliculus; Speech recognition; Computer science; Auditory system; Coding (social sciences); Cochlear nucleus; Speech processing; Artificial intelligence; Blind signal separation; Pattern recognition (psychology); Psychology; Mathematics; Neuroscience; Nucleus; Telecommunications","score_opus":0.03427185678378388,"score_gpt":0.32857154309109693,"score_spread":0.29429968630731307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168622085","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.0005409237,0.000020615038,0.9856732,0.0020991913,0.000043371594,0.00026182432,7.1516683e-7,0.0005557115,0.010804434],"genre_scores_gemma":[0.6343877,6.611207e-7,0.36398292,0.00089680956,0.00009825008,0.000059111706,0.0000019388074,0.000004701468,0.00056796713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941546,0.000009657325,0.00015544838,0.00018434427,0.00008239729,0.000152676],"domain_scores_gemma":[0.99946266,0.00008609102,0.000058841713,0.00019948471,0.00013913508,0.00005378744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043148684,0.00005798955,0.000056958314,0.000066230976,0.00012254031,0.00009741087,0.0003486116,0.000041194056,0.000009483033],"category_scores_gemma":[0.000008977541,0.00005150213,0.000032815038,0.00016769905,0.000018647876,0.00028207834,0.00005073402,0.000050048147,0.000009516827],"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.0000034818565,0.0000925894,0.00024199783,0.000011625077,0.0000048834345,2.0741855e-7,0.00054014183,0.000012213681,0.010545262,0.5122992,0.029897198,0.4463512],"study_design_scores_gemma":[0.0009455101,0.00046804626,0.06057338,0.000047576606,0.000016577176,0.000027520484,0.0001860314,0.060772713,0.18158482,0.20833659,0.48605675,0.0009844872],"about_ca_topic_score_codex":0.0000020735422,"about_ca_topic_score_gemma":0.000012547284,"teacher_disagreement_score":0.6338467,"about_ca_system_score_codex":0.00003098891,"about_ca_system_score_gemma":0.000074087046,"threshold_uncertainty_score":0.2100196},"labels":[],"label_agreement":null},{"id":"W2168973490","doi":"10.1109/iscc.2005.80","title":"Hybrid Methods for Blind Adaptive Equalization: New Results and Comparisons","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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 Windsor","funders":"","keywords":"Blind equalization; Computer science; Adaptive equalizer; Algorithm; Weighting; Hybrid algorithm (constraint satisfaction); QAM; Constellation; Equalization (audio); Quadrature amplitude modulation; Decoding methods; Artificial intelligence; Bit error rate","score_opus":0.10913311288744285,"score_gpt":0.41425269317229785,"score_spread":0.305119580284855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168973490","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.000065994915,0.000105171435,0.9827951,0.008088342,0.000043113294,0.00031828287,0.0000030749154,0.00037330305,0.00820758],"genre_scores_gemma":[0.02735672,0.000011821114,0.9679312,0.0015235133,0.000080293474,0.000017237331,0.000006345166,0.000006171569,0.003066681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990822,0.00012094979,0.00025867857,0.00030380228,0.000093936,0.00014041338],"domain_scores_gemma":[0.99905103,0.00035919787,0.000091148104,0.00029764065,0.000099697914,0.000101296224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007728163,0.000094999574,0.0001351661,0.00009186582,0.00009061333,0.00016710116,0.00029299,0.000039315943,0.000007988763],"category_scores_gemma":[0.00010355146,0.00008634805,0.000032667085,0.00015089352,0.000024406794,0.0004945554,0.000116504285,0.0000615627,0.000007874124],"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.000045368844,0.000032248565,0.0000029153384,0.0000017911237,0.000010707484,1.5138097e-7,0.001381952,0.00021507226,0.00013230606,0.6604536,0.09987103,0.23785287],"study_design_scores_gemma":[0.0010574585,0.0001585687,0.000040389637,0.000005992941,0.000005265097,0.000007257715,0.00003502399,0.5543512,0.041589238,0.01844375,0.38413802,0.00016786455],"about_ca_topic_score_codex":0.000022690308,"about_ca_topic_score_gemma":0.000025119414,"teacher_disagreement_score":0.64200985,"about_ca_system_score_codex":0.000017851735,"about_ca_system_score_gemma":0.000080039856,"threshold_uncertainty_score":0.35211715},"labels":[],"label_agreement":null},{"id":"W2168976993","doi":"10.1109/icassp.1996.550544","title":"Blind deconvolution of echosounder envelopes","year":2002,"lang":"en","type":"article","venue":"","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 Victoria","funders":"","keywords":"Deconvolution; Finite impulse response; Envelope (radar); Blind deconvolution; Impulse response; Convolution (computer science); Signal processing; Acoustics; Algorithm; SIGNAL (programming language); Computer science; Hilbert transform; Mathematics; Filter (signal processing); Physics; Mathematical analysis; Radar; Telecommunications; Artificial intelligence","score_opus":0.04331429878763763,"score_gpt":0.2520605421737068,"score_spread":0.2087462433860692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168976993","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.009493204,0.00005489248,0.92857844,0.0010078984,0.000039478033,0.0000710139,1.7353652e-7,0.00024501618,0.060509916],"genre_scores_gemma":[0.82928824,0.000021518705,0.16848297,0.00044965916,0.000008226059,0.000004156093,2.9354854e-7,0.000002460172,0.0017424861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947584,0.00003124576,0.00014854207,0.00013285331,0.00012817001,0.00008338167],"domain_scores_gemma":[0.9995569,0.000035681336,0.000052015042,0.00026748033,0.000060991668,0.000026906884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015249604,0.000049969596,0.00006765006,0.00009142756,0.00002769015,0.00003948921,0.00031614144,0.000041998235,0.00023524744],"category_scores_gemma":[0.000017899225,0.000044241027,0.000028850262,0.0002136456,0.000024242241,0.0003961197,0.000065249296,0.00004580935,0.00009846193],"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.0000017742883,0.00012082296,0.0006397192,0.000006476359,0.000011695353,8.2003294e-7,0.0017750988,0.000034790803,0.0019494507,0.95064825,0.015233199,0.029577913],"study_design_scores_gemma":[0.0016579492,0.0004032796,0.009052518,0.00003851332,0.000010826284,0.000041270614,0.00012262516,0.3822733,0.3477526,0.15571772,0.102102205,0.0008272313],"about_ca_topic_score_codex":0.000011910853,"about_ca_topic_score_gemma":0.0000075027588,"teacher_disagreement_score":0.819795,"about_ca_system_score_codex":0.000012361086,"about_ca_system_score_gemma":0.000010052142,"threshold_uncertainty_score":0.25757945},"labels":[],"label_agreement":null},{"id":"W2169418461","doi":"10.1109/eit.2009.5189605","title":"Joint MCMA and DD blind equalization algorithm with variable-step size","year":2009,"lang":"en","type":"article","venue":"","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":"University of Windsor; University of Toronto","funders":"","keywords":"Joint (building); Blind equalization; Convergence (economics); Algorithm; Variable (mathematics); Constant (computer programming); Computer science; Equalization (audio); Blind signal separation; Mathematics; Mathematical optimization; Telecommunications; Engineering; Mathematical analysis","score_opus":0.016672789817881575,"score_gpt":0.25083193558430367,"score_spread":0.2341591457664221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169418461","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.00061247754,0.00002327915,0.97998655,0.0015446867,0.00002028984,0.00018434963,5.6174775e-7,0.0004951912,0.01713264],"genre_scores_gemma":[0.07717396,0.000011401287,0.91829157,0.0033398878,0.000026850052,0.000006522651,0.000001910959,0.0000056245444,0.0011422805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991084,0.000057565958,0.00017611809,0.0002863685,0.0002209972,0.00015058096],"domain_scores_gemma":[0.9994351,0.000055239292,0.000070386304,0.00025998862,0.000107581734,0.00007165865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033613856,0.00010964757,0.00011873043,0.00007200177,0.000077690165,0.00025862345,0.00020049528,0.00006420401,0.000037523358],"category_scores_gemma":[0.000029241943,0.00008492848,0.000013195107,0.00039103068,0.000021615326,0.0005781919,0.00005583223,0.00007931278,0.000007771765],"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.000010246363,0.00010524347,0.000025430858,0.000005396214,0.000011202207,0.0000063419006,0.00091573683,0.00010812668,0.0015983789,0.80338603,0.0024978595,0.19133002],"study_design_scores_gemma":[0.0024403534,0.0016330952,0.003725413,0.00007135579,0.000019378613,0.00013398609,0.00009624088,0.85112864,0.034543738,0.08431421,0.021034464,0.000859099],"about_ca_topic_score_codex":0.000020993471,"about_ca_topic_score_gemma":0.000004424566,"teacher_disagreement_score":0.8510205,"about_ca_system_score_codex":0.000016300522,"about_ca_system_score_gemma":0.0000526371,"threshold_uncertainty_score":0.34632826},"labels":[],"label_agreement":null},{"id":"W2169604954","doi":"10.1109/acssc.1992.269176","title":"Blind deconvolution based on cumulant fitting and simulated annealing optimization","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Toronto","funders":"","keywords":"Blind equalization; Deconvolution; Simulated annealing; Algorithm; Blind deconvolution; Higher-order statistics; Computer science; Channel (broadcasting); QAM; Transfer function; Convergence (economics); Quadrature amplitude modulation; Mathematical optimization; Mathematics; Signal processing; Equalizer; Decoding methods; Engineering; Telecommunications","score_opus":0.02040078693232394,"score_gpt":0.2683501703190751,"score_spread":0.24794938338675115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169604954","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.014344571,0.000013877829,0.980448,0.0003122715,0.000041233146,0.00015242965,2.6159518e-7,0.000389882,0.0042974404],"genre_scores_gemma":[0.66154855,0.000002991684,0.33754846,0.0008339944,0.0000051284765,0.0000020897942,0.000003253895,0.0000047110393,0.000050797713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992024,0.00011802751,0.00016884613,0.00024878856,0.00013293923,0.00012900784],"domain_scores_gemma":[0.99946564,0.000124052,0.00006589312,0.00021933396,0.00007443563,0.000050648654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004763317,0.000087157365,0.000078276724,0.00014291858,0.00011411934,0.00015277042,0.00011013474,0.000065578344,0.000020019344],"category_scores_gemma":[0.00012648707,0.00008140754,0.000019159013,0.00025879356,0.000012886281,0.00030554438,0.000020017751,0.00007561669,0.000004800416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039238944,0.00002002884,0.00023552524,0.0000029130738,0.0000017486502,9.0050656e-7,0.00011017554,0.9712851,0.00007522342,0.02729649,0.00004828045,0.00091970724],"study_design_scores_gemma":[0.00039225028,0.000055645563,0.000079850994,0.000011849394,0.0000017305154,0.0000019419306,0.000009241071,0.99309057,0.0055042743,0.0005413629,0.00020935528,0.00010192564],"about_ca_topic_score_codex":0.000010004779,"about_ca_topic_score_gemma":0.0000019068174,"teacher_disagreement_score":0.647204,"about_ca_system_score_codex":0.000023542005,"about_ca_system_score_gemma":0.000036436453,"threshold_uncertainty_score":0.3319703},"labels":[],"label_agreement":null},{"id":"W2169936910","doi":"10.1109/isspit.2006.270879","title":"Blind Separation of Anechoic Under-determined Speech Mixtures using Multiple Sensors","year":2006,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of British Columbia","funders":"","keywords":"Anechoic chamber; Blind signal separation; Underdetermined system; Computer science; Speech recognition; Source separation; Short-time Fourier transform; Algorithm; Minification; Novelty; Artificial intelligence; Pattern recognition (psychology); Fourier transform; Mathematics; Fourier analysis; Telecommunications","score_opus":0.03426195644535212,"score_gpt":0.3117221742046096,"score_spread":0.2774602177592575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169936910","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.45606458,0.00001231998,0.5411033,0.00015388003,0.000043167718,0.0001486024,9.4217165e-7,0.00022708971,0.0022461135],"genre_scores_gemma":[0.7595979,0.0000010885423,0.23981753,0.00012519797,0.000036529684,0.0000025674333,0.00000483912,0.0000072252824,0.00040713785],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988455,0.000094124254,0.0003427236,0.00027695068,0.00027148824,0.00016922441],"domain_scores_gemma":[0.9991289,0.00011639629,0.00016539061,0.00042335375,0.0001315556,0.00003444054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025483707,0.0001301873,0.00016353582,0.00021126533,0.00006634564,0.00010643878,0.00033092557,0.00010410731,0.000016219597],"category_scores_gemma":[0.000025600168,0.00012051635,0.00006639043,0.00039211893,0.000040398594,0.00047646623,0.0000791265,0.00008312952,0.000009183864],"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.000050749215,0.0004219098,0.0036493286,0.000039150727,0.000029949435,0.000019376372,0.0007227326,0.03134067,0.8535559,0.1011114,0.0029806776,0.0060781413],"study_design_scores_gemma":[0.0003763868,0.000050404265,0.0010563687,0.000008860723,0.0000045323623,0.000021789312,0.000012925403,0.38467863,0.60610753,0.0072965957,0.00023107027,0.00015488704],"about_ca_topic_score_codex":0.0004747686,"about_ca_topic_score_gemma":0.00015568105,"teacher_disagreement_score":0.35333797,"about_ca_system_score_codex":0.000033350672,"about_ca_system_score_gemma":0.000056616627,"threshold_uncertainty_score":0.4914514},"labels":[],"label_agreement":null},{"id":"W2170142494","doi":"10.1109/aero.2010.5446692","title":"Comparison of data reduction techniques based on the performance of SVM-type classifiers","year":2010,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":12,"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":"University of Toronto; Information Society Innovation Fund; Princeton University","keywords":"Dimensionality reduction; Principal component analysis; Reduction (mathematics); Computer science; Pattern recognition (psychology); Support vector machine; Data reduction; Artificial intelligence; Data mining; Data compression; Machine learning; Mathematics","score_opus":0.08838902822670726,"score_gpt":0.36144622671687393,"score_spread":0.2730571984901667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170142494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49034914,0.000008257919,0.479873,0.004872168,0.00033109277,0.0005012074,0.0000043307728,0.00060414907,0.023456657],"genre_scores_gemma":[0.84186554,0.0000031415318,0.15788914,0.00014533433,0.000015068822,0.0000044483254,0.0000054800566,0.0000037843756,0.00006809361],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99913555,0.00006225423,0.00025587186,0.00020470931,0.00025795406,0.000083632614],"domain_scores_gemma":[0.9980437,0.00009327172,0.00018710893,0.0015125939,0.00014243656,0.000020876241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082343165,0.000073699295,0.00012543684,0.000103217746,0.000052881987,0.00002755035,0.0014110109,0.00007218231,0.000027148048],"category_scores_gemma":[0.00005066155,0.00004884078,0.00002107973,0.00034966238,0.00012008286,0.00041909952,0.0001685933,0.00024296746,0.0000035414994],"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.00007318332,0.00065679237,0.005756503,0.00004504001,0.00001893571,1.736582e-7,0.0010143414,0.00017024798,0.53890395,0.30839917,0.06473673,0.08022491],"study_design_scores_gemma":[0.000026855809,0.0002111274,0.00043686508,0.000009274439,0.0000018403063,6.2810943e-7,0.000023184522,0.32354212,0.67213947,0.0001563583,0.0034050744,0.00004721512],"about_ca_topic_score_codex":0.000019873238,"about_ca_topic_score_gemma":0.0000061872547,"teacher_disagreement_score":0.35151637,"about_ca_system_score_codex":0.000006425458,"about_ca_system_score_gemma":0.0000818368,"threshold_uncertainty_score":0.26220328},"labels":[],"label_agreement":null},{"id":"W2170318876","doi":"10.1109/pacrim.1997.619895","title":"Generating bandlimited Gaussian noise variates with the FFT","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Queen's University","funders":"","keywords":"Fast Fourier transform; Bandlimiting; Gaussian noise; Noise (video); Computer science; Algorithm; Gaussian; Split-radix FFT algorithm; Discrete Fourier transform (general); Prime-factor FFT algorithm; Fourier transform; Mathematics; Fourier analysis; Fractional Fourier transform; Artificial intelligence; Physics; Mathematical analysis","score_opus":0.01765914609140258,"score_gpt":0.22002983542913815,"score_spread":0.20237068933773555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170318876","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.0047349436,0.000034052275,0.9466623,0.016456023,0.000024568555,0.0001237311,1.9937576e-7,0.00055341853,0.03141078],"genre_scores_gemma":[0.73758936,0.0000057970815,0.25267798,0.0054874755,0.0000469341,0.000022145876,6.6778784e-7,0.000007634522,0.004162006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993177,0.000075381424,0.00010144051,0.00019201713,0.00016937165,0.00014406272],"domain_scores_gemma":[0.9993815,0.0000645379,0.00004747811,0.00042059165,0.00004676849,0.00003911465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020247296,0.00008681217,0.00006709161,0.000044698583,0.00017458276,0.0003127559,0.00047756633,0.00003115475,0.00012758009],"category_scores_gemma":[0.000010652378,0.000045558816,0.000021074942,0.0003167099,0.000025296218,0.00031760565,0.00007493713,0.00009685124,0.00005414489],"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.0000059192707,0.0002641403,0.0009122032,0.000009394144,0.000072687224,0.000024705749,0.017833108,0.0021759488,0.012573835,0.78894883,0.1440085,0.033170745],"study_design_scores_gemma":[0.00019052262,0.00009722444,0.0004245906,0.000006313223,0.00000402951,0.000019545809,0.000054916512,0.98002523,0.0064341086,0.0004884907,0.012087242,0.00016777766],"about_ca_topic_score_codex":0.000021323514,"about_ca_topic_score_gemma":0.00003959812,"teacher_disagreement_score":0.9778493,"about_ca_system_score_codex":0.000008602234,"about_ca_system_score_gemma":0.00001003258,"threshold_uncertainty_score":0.30159125},"labels":[],"label_agreement":null},{"id":"W2170976240","doi":"10.1109/tmi.2004.837791","title":"An information-theoretic criterion for intrasubject alignment of FMRI time series: motion corrected independent component analysis","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Medical Imaging","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":"University of British Columbia Hospital","funders":"National Institute of Neurological Disorders and Stroke","keywords":"Independent component analysis; Artificial intelligence; Computer science; Entropy (arrow of time); Computer vision; Image registration; Preprocessor; Pattern recognition (psychology); Mathematics; Algorithm; Image (mathematics)","score_opus":0.005852320285617264,"score_gpt":0.2613787639813405,"score_spread":0.25552644369572325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170976240","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.008870632,0.00000589451,0.9873823,0.0027918112,0.00016971973,0.0003330003,0.000017191187,0.00032170844,0.000107766966],"genre_scores_gemma":[0.95465916,0.000018355637,0.04422927,0.00093202887,0.000025031331,0.00007762207,0.000033664273,0.000008140234,0.00001672724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980823,0.00017563926,0.0005655357,0.00024389719,0.00072807894,0.00020457557],"domain_scores_gemma":[0.99892515,0.00013386825,0.00016251384,0.0004026988,0.00019956531,0.00017618373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085217116,0.00015159391,0.00024512105,0.00058371644,0.00013932017,0.00012469634,0.00045129767,0.00008345259,0.00021409531],"category_scores_gemma":[0.00002330269,0.00014750655,0.00015377843,0.0006155109,0.00009631425,0.0016701191,0.0000039235247,0.00020583636,0.000020092233],"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.00017145592,0.0014505553,0.000069784684,0.00008864956,0.0004147664,0.0000039945244,0.011948069,0.069305874,0.013669451,0.0053851963,0.0005397975,0.8969524],"study_design_scores_gemma":[0.0004410968,0.0001249499,0.00015318897,0.000033568915,0.000096302276,0.000014179323,0.00011702678,0.8970049,0.101129115,0.0003069979,0.00041649057,0.00016218094],"about_ca_topic_score_codex":0.000028600502,"about_ca_topic_score_gemma":0.0000168506,"teacher_disagreement_score":0.9457885,"about_ca_system_score_codex":0.00012391355,"about_ca_system_score_gemma":0.00008268,"threshold_uncertainty_score":0.6015142},"labels":[],"label_agreement":null},{"id":"W2171664027","doi":"10.1109/wcnc.2005.1424471","title":"OFDM phase noise cancellation via approximate probabilistic inference","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":15,"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":"University of Toronto","keywords":"Probabilistic logic; Computer science; Orthogonal frequency-division multiplexing; Inference; Noise (video); Algorithm; Phase noise; Scheme (mathematics); Telecommunications; Artificial intelligence; Mathematics; Electronic engineering; Channel (broadcasting); Engineering","score_opus":0.022054227147619482,"score_gpt":0.3107386788208698,"score_spread":0.2886844516732503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171664027","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.008542353,0.000015597045,0.9721004,0.0014090828,0.00003988527,0.0002811963,7.9101994e-7,0.0007534133,0.016857283],"genre_scores_gemma":[0.78893876,0.000004612985,0.20970193,0.0006372613,0.000036697344,0.000035530808,0.0000032992937,0.000005011586,0.0006368685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907607,0.000048628124,0.00022289358,0.00028287133,0.00019833879,0.00017121744],"domain_scores_gemma":[0.9992527,0.000052534848,0.000081058635,0.0004387423,0.00010529939,0.00006966054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025549377,0.00010665099,0.000101025405,0.000082234685,0.00006552174,0.00014102386,0.0004138754,0.000049879258,0.00007850125],"category_scores_gemma":[0.00003798341,0.000094980576,0.000028700879,0.00026623323,0.000030115712,0.0007028751,0.000095086325,0.00009004913,0.000103403356],"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.000014023533,0.0005564318,0.00016818159,0.000037201986,0.000009944033,0.0000025162801,0.0026071172,0.005728702,0.012944101,0.5757251,0.002385019,0.39982167],"study_design_scores_gemma":[0.00035850218,0.00008168973,0.00012706887,0.000009993025,0.0000024220396,0.0000039957304,0.000003218367,0.9467962,0.03127625,0.01469619,0.006465474,0.0001789902],"about_ca_topic_score_codex":0.00003525978,"about_ca_topic_score_gemma":0.00006676363,"teacher_disagreement_score":0.9410675,"about_ca_system_score_codex":0.000066302644,"about_ca_system_score_gemma":0.00007546199,"threshold_uncertainty_score":0.38731956},"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":"W2177344785","doi":"10.1109/pacrim.2015.7334822","title":"Fast classification of handwritten digits using 2D-DCT based sparse PCA","year":2015,"lang":"en","type":"article","venue":"","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":"University of Victoria","funders":"","keywords":"Discrete cosine transform; Decorrelation; Principal component analysis; Pattern recognition (psychology); Dimensionality reduction; Computer science; Artificial intelligence; MNIST database; Dimension (graph theory); Speech recognition; Mathematics; Algorithm; Artificial neural network; Image (mathematics)","score_opus":0.11831226719628869,"score_gpt":0.31371779327271393,"score_spread":0.19540552607642525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177344785","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.04097024,0.000009171826,0.94404626,0.00069781713,0.00005436111,0.00012013685,0.0000010596328,0.0002704578,0.013830473],"genre_scores_gemma":[0.8135729,4.49818e-7,0.18587759,0.00029949323,0.000015156083,0.000004131029,0.000003027327,0.0000051376674,0.0002221357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911195,0.00007153534,0.00022116327,0.00020413841,0.00027520134,0.00011599155],"domain_scores_gemma":[0.9990785,0.000035031346,0.000119580516,0.00045037986,0.00023197784,0.00008449034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039587013,0.000080036174,0.00011321347,0.00013008567,0.000029769697,0.00010784678,0.00040558024,0.00005602548,0.000007568352],"category_scores_gemma":[0.00004906153,0.00007129281,0.000035381014,0.00033309465,0.00003695268,0.0005492549,0.00007539737,0.000056912264,0.000018358973],"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.00007313523,0.0010940683,0.015408508,0.00007238658,0.000057445566,0.000012221595,0.0066257417,0.007712381,0.13146724,0.6364058,0.026485778,0.17458527],"study_design_scores_gemma":[0.0003686201,0.0000988807,0.002986363,0.0000218848,0.0000046155897,0.0000038713365,0.00008817222,0.882992,0.10757881,0.00251058,0.0031791304,0.00016707114],"about_ca_topic_score_codex":0.00004851488,"about_ca_topic_score_gemma":0.000013022848,"teacher_disagreement_score":0.8752796,"about_ca_system_score_codex":0.0000386691,"about_ca_system_score_gemma":0.00017927166,"threshold_uncertainty_score":0.29072365},"labels":[],"label_agreement":null},{"id":"W2181733421","doi":"","title":"Topic Detection Using Independent Component Analysis","year":2007,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Computer science; Set (abstract data type); Component (thermodynamics); Word (group theory); Information retrieval; Natural language processing; Row; Artificial intelligence; Data set; Mathematics; Database","score_opus":0.02438607020015014,"score_gpt":0.2968911005109909,"score_spread":0.2725050303108407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181733421","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.2839819,0.000005217274,0.7132079,0.000060318056,0.000050932176,0.0000465279,4.2782155e-8,0.00022736921,0.0024198014],"genre_scores_gemma":[0.9040728,7.593187e-7,0.09548234,0.0002949818,0.000016699763,9.158834e-7,4.569243e-7,0.0000019479382,0.00012910178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992768,0.00003794726,0.00016736083,0.0001795469,0.00021268758,0.00012564308],"domain_scores_gemma":[0.99954075,0.00002721254,0.00005254642,0.00028164126,0.000051266034,0.000046603633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006494284,0.000057515834,0.00008548961,0.0003528217,0.000066322784,0.000088951354,0.00023424404,0.000045941557,0.000021562464],"category_scores_gemma":[0.0000054746097,0.00005300162,0.00007010903,0.0008067982,0.000008630651,0.00024099485,0.0000872847,0.0000735184,0.000009201399],"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.000025893238,0.00053550466,0.04849218,0.000017268956,0.0009225437,0.00006476957,0.005486662,0.0110054575,0.21605581,0.3548504,0.00008617412,0.3624573],"study_design_scores_gemma":[0.0001592562,0.000050457398,0.108573355,0.0000021734356,0.000056719695,0.000013735471,0.000058557744,0.5143188,0.3726855,0.0024682018,0.0013817254,0.00023151143],"about_ca_topic_score_codex":0.00021298915,"about_ca_topic_score_gemma":0.00038793593,"teacher_disagreement_score":0.6200909,"about_ca_system_score_codex":0.00006484631,"about_ca_system_score_gemma":0.000011627541,"threshold_uncertainty_score":0.21613432},"labels":[],"label_agreement":null},{"id":"W2184223762","doi":"","title":"Multiple Lineup Identification Procedure: Utility with Face-Only Lineups","year":2009,"lang":"en","type":"article","venue":"QSpace (Queen's University Library)","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Identification (biology); Face (sociological concept); Psychology; Artificial intelligence; Computer science; Philosophy; Linguistics","score_opus":0.008226396753529545,"score_gpt":0.1980380925575754,"score_spread":0.18981169580404586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184223762","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.101888776,0.0000116819965,0.7137043,0.17487475,0.00007533415,0.00079448416,0.000017517126,0.0031675422,0.0054656505],"genre_scores_gemma":[0.9297921,0.000034907607,0.04757661,0.0008762227,0.00003304535,0.0000010999518,0.000036178924,0.00001411987,0.021635737],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9983488,0.00015781706,0.00018128609,0.00066351023,0.00034334135,0.00030528134],"domain_scores_gemma":[0.99860114,0.00007156595,0.00019929097,0.00083355466,0.000107513515,0.00018691701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010812235,0.00023657699,0.00020759038,0.0002895616,0.00023985915,0.00030029865,0.0011639082,0.00015142119,0.000024638286],"category_scores_gemma":[0.00003668242,0.00023926637,0.0000831871,0.0010989372,0.000079395606,0.004501349,0.00021188827,0.00030867057,0.000047441892],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008660798,0.002301356,0.12691796,0.00017638355,0.00016666415,0.00040725854,0.011024615,0.0011039193,0.00068917184,0.274595,0.54881704,0.03293455],"study_design_scores_gemma":[0.002909456,0.0014131907,0.49949232,0.00018164793,0.00007612744,0.000014800632,0.0011993913,0.01783354,0.10736784,0.006943235,0.36031184,0.0022565974],"about_ca_topic_score_codex":0.00017921628,"about_ca_topic_score_gemma":0.000024484947,"teacher_disagreement_score":0.8279033,"about_ca_system_score_codex":0.00004839383,"about_ca_system_score_gemma":0.0003294915,"threshold_uncertainty_score":0.97569996},"labels":[],"label_agreement":null},{"id":"W2186331194","doi":"10.82308/39350","title":"Subspace-based blind channel estimation : generalization, performance analysis and adaptive implementation","year":2003,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"McGill University","funders":"Concordia University; McGill University","keywords":"Estimator; Subspace topology; Algorithm; Fading; Channel (broadcasting); Robustness (evolution); Computer science; Mathematics; Mathematical optimization; Statistics; Artificial intelligence; Telecommunications; Decoding methods","score_opus":0.019940305760197344,"score_gpt":0.2758551852269638,"score_spread":0.25591487946676644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186331194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9573778,0.00022204735,0.032761954,0.000075810836,0.0005272194,0.0016985657,0.0002992527,0.0008912171,0.0061461446],"genre_scores_gemma":[0.94700164,0.00022066319,0.04797566,0.00052107364,0.000015126725,0.000339836,0.0026719603,0.00008883919,0.0011652277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.995745,0.0005802396,0.0009343188,0.0012830173,0.00093920645,0.0005181889],"domain_scores_gemma":[0.9968995,0.000120058845,0.0010254487,0.00086406525,0.00084759766,0.00024335254],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012552557,0.00068880524,0.00066236703,0.0018135415,0.0010755081,0.000381555,0.0006801165,0.00055665197,0.000074838696],"category_scores_gemma":[0.0001215868,0.0007821995,0.00025494242,0.0030475494,0.000042604595,0.002147721,0.00008214659,0.00063593616,0.000031639003],"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.0004129933,0.00058050756,0.0008120936,0.00062354293,0.0020983105,0.0000263178,0.00042095323,0.033544958,0.009839205,0.508049,0.000065002896,0.4435271],"study_design_scores_gemma":[0.0035363373,0.00076034275,0.016458519,0.00030570975,0.0019500488,0.00001740037,0.0004688474,0.4007409,0.53769714,0.030833244,0.0036547326,0.00357679],"about_ca_topic_score_codex":0.00021808613,"about_ca_topic_score_gemma":0.001664171,"teacher_disagreement_score":0.52785796,"about_ca_system_score_codex":0.00044406715,"about_ca_system_score_gemma":0.00014597183,"threshold_uncertainty_score":0.9994629},"labels":[],"label_agreement":null},{"id":"W2189611566","doi":"10.13140/rg.2.1.2063.7289","title":"Modified Euclid's blind deconvolution via sparsity optimization on a sphere","year":2013,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Alberta","funders":"","keywords":"Deconvolution; Blind deconvolution; Impulse response; Mathematics; Convex optimization; Wiener deconvolution; Norm (philosophy); Optimization problem; Algorithm; Impulse (physics); Mathematical optimization; Homogeneous; Gradient descent; Regular polygon; Applied mathematics; Computer science; Mathematical analysis; Artificial intelligence; Physics; Combinatorics; Artificial neural network","score_opus":0.022157420127832998,"score_gpt":0.2427554699076466,"score_spread":0.2205980497798136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189611566","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.0137385605,0.0000044354542,0.95851034,0.0019465439,0.00008395901,0.00037581028,2.3736762e-7,0.0006856605,0.024654448],"genre_scores_gemma":[0.6918227,0.000007735208,0.30544403,0.0014810249,0.000024620924,0.00003578239,0.000004603861,0.000006951595,0.0011725471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990625,0.00006650559,0.00018559476,0.00030773977,0.00020640054,0.000171269],"domain_scores_gemma":[0.9992028,0.00004455175,0.000082328675,0.0004527469,0.00013798907,0.000079597055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015401574,0.00011435505,0.00010199807,0.00009593792,0.00011624566,0.00023294648,0.00042394735,0.00010040509,0.00032307857],"category_scores_gemma":[0.000022041408,0.00010440509,0.000043127475,0.00027226444,0.000021138088,0.0009656068,0.000105215106,0.00010561966,0.0005034417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034567398,0.00053720886,0.0008087596,0.000016321386,0.000033772074,0.0000030916135,0.0009871286,0.6029121,0.0006409757,0.30808473,0.04327639,0.04266494],"study_design_scores_gemma":[0.0002971265,0.00009379615,0.0011821645,0.0000063611774,0.0000017962285,0.0000028409045,0.000008203521,0.9878583,0.0030039814,0.0068551856,0.00053715374,0.0001530732],"about_ca_topic_score_codex":0.00021882489,"about_ca_topic_score_gemma":0.000053904747,"teacher_disagreement_score":0.67808414,"about_ca_system_score_codex":0.00005303843,"about_ca_system_score_gemma":0.000029917697,"threshold_uncertainty_score":0.64708924},"labels":[],"label_agreement":null},{"id":"W2243706233","doi":"10.1109/mssc.2015.2495661","title":"Modeling Device Mismatch: Miles Copeland's Vision","year":2016,"lang":"en","type":"article","venue":"IEEE Solid-State Circuits Magazine","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"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":"Capacitor; Telecommunications; Electrical engineering; Computer science; Electronic circuit; Filter (signal processing); Electronic engineering; Telephony; Engineering; Voltage","score_opus":0.028962446531979828,"score_gpt":0.2961289300205935,"score_spread":0.26716648348861366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243706233","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.15361655,0.00010790263,0.8409201,0.0013525044,0.00037774484,0.000281172,0.000027323711,0.0008061354,0.0025105542],"genre_scores_gemma":[0.9920975,0.0001946143,0.004488196,0.0012590468,0.00008443165,0.000029400217,0.000008796707,0.00004215458,0.001795888],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974526,0.00021972669,0.00056417834,0.00071374956,0.00050381117,0.0005459427],"domain_scores_gemma":[0.9980944,0.00020039255,0.00015462171,0.00094000204,0.0003895364,0.0002210739],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008637551,0.0003103981,0.00034384476,0.00025121312,0.0001554544,0.00028937336,0.0011211389,0.00012409396,0.000035394325],"category_scores_gemma":[0.00008876538,0.00023096899,0.00010043098,0.000499778,0.000064110376,0.0012217714,0.00016976574,0.00017650487,0.0010886758],"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.00006969358,0.0006671536,0.001050137,0.00015510953,0.0001686139,0.00020480008,0.007491988,0.015876466,0.47821057,0.013166584,0.05296472,0.42997417],"study_design_scores_gemma":[0.0041324375,0.0007334213,0.004212603,0.0008870312,0.000041809984,0.00018460446,0.00003693453,0.7236879,0.17416038,0.05190292,0.0372579,0.0027621065],"about_ca_topic_score_codex":0.000034513043,"about_ca_topic_score_gemma":0.000118789125,"teacher_disagreement_score":0.83848095,"about_ca_system_score_codex":0.00008574081,"about_ca_system_score_gemma":0.00013287038,"threshold_uncertainty_score":0.9996891},"labels":[],"label_agreement":null},{"id":"W2247019900","doi":"10.1080/1206212x.2003.11441691","title":"A New Information-Theoretic Based Ica Algorithm For Blind Signal Separation","year":2003,"lang":"en","type":"article","venue":"International Journal of Computers and Applications","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":2,"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":"Independent component analysis; Blind signal separation; Computer science; Gaussian; Algorithm; Nonlinear system; Function (biology); SIGNAL (programming language); Exponent; Pattern recognition (psychology); Artificial intelligence; Telecommunications; Physics","score_opus":0.00937234913947731,"score_gpt":0.2901952072498478,"score_spread":0.2808228581103705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2247019900","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.00009684494,0.00004680503,0.99637735,0.0024301936,0.00018103144,0.00028398147,0.000008833417,0.000038383663,0.00053655874],"genre_scores_gemma":[0.07092566,0.000022037226,0.92724705,0.001537787,0.00017268921,0.00004091105,0.000016230098,0.000005227447,0.00003239523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99900514,0.000042691838,0.00044012393,0.00010899677,0.00031062576,0.000092401926],"domain_scores_gemma":[0.9985006,0.00021099593,0.0003808098,0.00013016397,0.0006692383,0.00010820643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039659758,0.000096078744,0.00011917595,0.0002800375,0.000078444864,0.00039096715,0.00053670874,0.000047408714,0.000012332321],"category_scores_gemma":[0.000020002448,0.00009040505,0.00008767099,0.00016048993,0.000028715855,0.0009242839,0.0000314617,0.00009935148,0.000005713642],"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.000011924266,0.000054375283,0.000013600117,0.0000033208987,0.00004137022,6.502824e-7,0.0002541562,0.0011231926,0.000070978596,0.60574895,0.0046429043,0.3880346],"study_design_scores_gemma":[0.00239057,0.00024038868,0.00011767657,0.00003863948,0.000020547926,0.00012713365,0.000032306936,0.3558894,0.0033664037,0.114923276,0.5226259,0.00022774815],"about_ca_topic_score_codex":0.0000018919635,"about_ca_topic_score_gemma":3.7888097e-7,"teacher_disagreement_score":0.517983,"about_ca_system_score_codex":0.000037836002,"about_ca_system_score_gemma":0.0002746483,"threshold_uncertainty_score":0.37701052},"labels":[],"label_agreement":null},{"id":"W2262449442","doi":"10.1109/tmbmc.2015.2501744","title":"An Information Theoretic Approach Toward Assessing Perceptual Audio Quality Using EEG","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Molecular Biological and Multi-Scale Communications","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":5,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Perception; Mutual information; Entropy (arrow of time); Electroencephalography; Speech recognition; Artificial intelligence; Information theory; Audio signal; Pattern recognition (psychology); Mixture model; Mathematics; Speech coding; Psychology; Statistics","score_opus":0.18449443659882594,"score_gpt":0.3833433932482351,"score_spread":0.19884895664940913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2262449442","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.07357219,0.00006504487,0.9245777,0.00059598865,0.00004498298,0.00027828623,0.000012561361,0.0002828226,0.00057040446],"genre_scores_gemma":[0.5880477,0.000048029295,0.4114574,0.0003811613,0.000002362166,0.000036603524,0.000019792204,0.00000414692,0.0000028512445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792624,0.0010213234,0.00038072604,0.00028119324,0.00019685458,0.00019366095],"domain_scores_gemma":[0.9981426,0.00009943184,0.000120867764,0.0012257486,0.00020616564,0.00020516219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000818172,0.00017932359,0.00019740727,0.00013865551,0.00037979838,0.00032049796,0.0009882713,0.00019582246,0.000003895405],"category_scores_gemma":[0.000027900216,0.00014923229,0.0000876362,0.00031310163,0.0003743818,0.001041759,0.000034250774,0.00038688013,0.000009941331],"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.00016407979,0.009682252,0.0009070863,0.000108696855,0.00023845812,0.000005136806,0.06685805,0.0629879,0.28770334,0.15875645,0.000049238002,0.4125393],"study_design_scores_gemma":[0.00085862546,0.00033141495,0.002232503,0.00002228352,0.000027991673,0.000039192902,0.0029204325,0.98139673,0.008496918,0.0027209676,0.0004129819,0.00053997507],"about_ca_topic_score_codex":0.00006036017,"about_ca_topic_score_gemma":0.000006806343,"teacher_disagreement_score":0.9184088,"about_ca_system_score_codex":0.00006272226,"about_ca_system_score_gemma":0.00007974523,"threshold_uncertainty_score":0.6085516},"labels":[],"label_agreement":null},{"id":"W2274208992","doi":"10.1117/1.jrs.10.015012","title":"Impact factor analysis of mixture spectra unmixing based on independent component analysis","year":2016,"lang":"en","type":"article","venue":"Journal of Applied Remote Sensing","topic":"Blind Source Separation 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 Saskatchewan","funders":"China Scholarship Council; Jilin University","keywords":"Independent component analysis; Hyperspectral imaging; Endmember; Blind signal separation; Spectral line; Principal component analysis; Mixture model; Gaussian; Pattern recognition (psychology); Biological system; Matrix decomposition; Computer science; Noise (video); Component analysis; Independence (probability theory); Component (thermodynamics); Artificial intelligence; Mathematics; Statistics; Physics; Image (mathematics); Eigenvalues and eigenvectors","score_opus":0.017004423676728768,"score_gpt":0.28278959382956664,"score_spread":0.26578517015283787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274208992","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.22765744,0.000007557357,0.7711652,0.00043638615,0.00004188095,0.00006877526,0.0000030980116,0.000037981794,0.0005817042],"genre_scores_gemma":[0.8073884,0.000007624397,0.19237979,0.00016576196,0.000041953863,1.2022482e-8,0.0000012488965,0.0000094851,0.000005704869],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975914,0.00014483322,0.0008032873,0.00028410056,0.0009332563,0.00024316002],"domain_scores_gemma":[0.99735147,0.0003590718,0.0012542474,0.0005744368,0.00030204537,0.00015872275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095448195,0.00021717891,0.00079516356,0.0025568951,0.00006675836,0.00010569914,0.00045399813,0.00012349106,0.000019796948],"category_scores_gemma":[0.000034617675,0.00013567062,0.00088526733,0.0026285406,0.000041472125,0.00017744393,0.00005969067,0.00030329963,0.0000017474598],"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.00040675,0.00025055162,0.0008719927,0.000015654421,0.010246131,0.000115064526,0.0023257707,0.10879838,0.47863063,0.0013286237,0.00009334085,0.3969171],"study_design_scores_gemma":[0.0008190883,0.0002742224,0.04491439,0.000100839,0.0018048546,0.000018707677,0.000035993766,0.81153125,0.13889137,0.0011829629,0.000088420486,0.00033787618],"about_ca_topic_score_codex":0.000023792312,"about_ca_topic_score_gemma":0.000020650255,"teacher_disagreement_score":0.7027329,"about_ca_system_score_codex":0.0002616575,"about_ca_system_score_gemma":0.00013102622,"threshold_uncertainty_score":0.5532487},"labels":[],"label_agreement":null},{"id":"W2280822228","doi":"10.1109/isspit.2015.7394343","title":"FastICA architecture utilizing FPGA and iterative symmetric orthogonalization for multivariate signals","year":2015,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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 Windsor","funders":"","keywords":"Field-programmable gate array; Orthogonalization; Computer science; Independent component analysis; Gate array; QR decomposition; Iterative method; FastICA; Eigendecomposition of a matrix; Algorithm; Covariance matrix; Eigenvalues and eigenvectors; Blind signal separation; Computer hardware; Artificial intelligence","score_opus":0.0551812383462687,"score_gpt":0.3152940989491874,"score_spread":0.2601128606029187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280822228","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.0016297397,0.000055568726,0.99224585,0.0008501373,0.000049388887,0.00038808465,0.0000035377634,0.00030660332,0.004471058],"genre_scores_gemma":[0.6247318,0.0000019903332,0.37422836,0.0007130991,0.00002429918,0.000038260398,0.0000062686895,0.0000068183417,0.00024913784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909836,0.00010413286,0.0001799872,0.00029077573,0.00017575071,0.00015099079],"domain_scores_gemma":[0.9991269,0.0002658153,0.00007399556,0.00017576883,0.0002477428,0.00010977845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049509207,0.0001114004,0.00012650082,0.00023783636,0.000075136784,0.00023857995,0.00020403616,0.00005938046,0.0000038602416],"category_scores_gemma":[0.00035650938,0.00009061534,0.000028321623,0.00046927345,0.000024106716,0.00037623532,0.00011223244,0.00007030883,0.0000033313675],"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.000020499754,0.00005392103,0.00014583583,0.000017106131,0.000021186408,0.0000015064381,0.0058724917,0.00089427026,0.0014584695,0.9288776,0.0010334069,0.061603732],"study_design_scores_gemma":[0.0012104249,0.0005257467,0.0009848718,0.00004154673,0.000015451496,0.000022803008,0.00018852309,0.7882127,0.03438613,0.16046655,0.0134783145,0.00046693961],"about_ca_topic_score_codex":0.000011551068,"about_ca_topic_score_gemma":0.0000046778146,"teacher_disagreement_score":0.7873184,"about_ca_system_score_codex":0.00001826216,"about_ca_system_score_gemma":0.00006432683,"threshold_uncertainty_score":0.3695186},"labels":[],"label_agreement":null},{"id":"W2286669694","doi":"10.1109/globalsip.2015.7418378","title":"Unsupervised keyword spotting using bounded generalized Gaussian mixture model with ICA","year":2015,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Keyword spotting; Computer science; Artificial intelligence; TIMIT; Speech recognition; Independent component analysis; Pattern recognition (psychology); Dynamic time warping; Mixture model; Spotting; Hidden Markov model","score_opus":0.06565962370306201,"score_gpt":0.2900633329861301,"score_spread":0.22440370928306808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286669694","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.06942733,0.000026118989,0.91399515,0.0022686522,0.000039955517,0.00019371467,5.686242e-7,0.00082064315,0.013227857],"genre_scores_gemma":[0.32477462,0.0000012643417,0.67217076,0.0020751555,0.000030569405,0.0000074966956,0.0000024351452,0.000014950431,0.00092274597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985744,0.00010339231,0.00022692131,0.00039510545,0.0004057572,0.0002944203],"domain_scores_gemma":[0.99887675,0.000017366832,0.0000887759,0.0006089686,0.0002045995,0.00020353294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043317306,0.00018471341,0.00019595509,0.00012974742,0.00012753194,0.0004066075,0.00062873226,0.00010014092,0.000009225665],"category_scores_gemma":[0.000021601441,0.00013929761,0.00004477173,0.00045605015,0.000042155294,0.0007616595,0.00016535768,0.00015969727,0.0000106370935],"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.00010972894,0.00022514428,0.00061323616,0.000024828692,0.00007428485,0.000051964667,0.012730822,0.06191944,0.01219378,0.8973832,0.009580979,0.005092559],"study_design_scores_gemma":[0.0006163271,0.000054926055,0.000013231868,0.000016441094,0.000006165906,0.000027202595,0.000053647054,0.97593063,0.007529379,0.013953877,0.0015505936,0.00024756673],"about_ca_topic_score_codex":0.00010582331,"about_ca_topic_score_gemma":0.000024930152,"teacher_disagreement_score":0.9140112,"about_ca_system_score_codex":0.00007455336,"about_ca_system_score_gemma":0.00038542907,"threshold_uncertainty_score":0.5680392},"labels":[],"label_agreement":null},{"id":"W2287529450","doi":"10.1049/el.2015.2957","title":"Fast identification of partial discharge sources using blind source separation and kurtosis","year":2015,"lang":"en","type":"article","venue":"Electronics Letters","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":"École de Technologie Supérieure","funders":"","keywords":"Kurtosis; Blind signal separation; Identification (biology); Separation (statistics); Source separation; Computer science; Algorithm; Mathematics; Telecommunications; Statistics; Machine learning","score_opus":0.024727998522383283,"score_gpt":0.2890817200638551,"score_spread":0.2643537215414718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287529450","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.4834479,0.0001426587,0.5148576,0.0013209772,0.000035185145,0.00010358164,6.469654e-7,0.00007539733,0.000016055683],"genre_scores_gemma":[0.99110156,0.000015799125,0.008240406,0.0005256807,0.000051386978,0.000011613868,0.00000694764,0.00001178227,0.000034815654],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99869424,0.0001355838,0.00032970778,0.00029651256,0.00030606578,0.00023789363],"domain_scores_gemma":[0.9992245,0.000031867145,0.000263958,0.00032156022,0.000082959086,0.000075173164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006766294,0.00012109903,0.00014360427,0.00015353008,0.000086662236,0.0001916328,0.00030771803,0.000059372065,0.000001144637],"category_scores_gemma":[0.000034052257,0.0001255046,0.000039470237,0.00030011637,0.00006135908,0.00069337996,0.00008959636,0.00013941954,0.0000047375793],"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.0000580468,0.00013772998,0.0029550684,0.000027111852,0.00007111654,0.0000013268808,0.013892559,0.011660861,0.9201186,0.042484187,0.001704001,0.006889424],"study_design_scores_gemma":[0.0007469926,0.00016332038,0.00038728182,0.000016845954,0.00003166122,0.000025315387,0.00011199154,0.3885991,0.60308397,0.0015535804,0.0049235714,0.00035634523],"about_ca_topic_score_codex":0.000024221637,"about_ca_topic_score_gemma":0.000006768194,"teacher_disagreement_score":0.50765365,"about_ca_system_score_codex":0.000071299546,"about_ca_system_score_gemma":0.000096540694,"threshold_uncertainty_score":0.5117929},"labels":[],"label_agreement":null},{"id":"W2290190397","doi":"10.1109/isscc.2016.7418081","title":"23.7 A 16Gb/s 1 IIR + 1 DT DFE compensating 28dB loss with edge-based adaptation converging in 5µs","year":2016,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Toronto","funders":"","keywords":"Infinite impulse response; Computer science; Binary number; Algorithm; Robustness (evolution); Adaptation (eye); Control theory (sociology); Bandwidth (computing); Digital filter; Mathematics; Telecommunications; Artificial intelligence; Arithmetic","score_opus":0.020429953879159295,"score_gpt":0.2416739177680283,"score_spread":0.221243963888869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290190397","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.08913086,0.0000075015014,0.90350413,0.003445089,0.00004542693,0.00022487274,7.082298e-7,0.0005321892,0.0031091964],"genre_scores_gemma":[0.83291155,0.0000012780516,0.16565351,0.0010590377,0.000016971302,0.000029555675,0.0000019303384,0.000010205623,0.00031596518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986796,0.00013254292,0.00027492337,0.00036513823,0.00029856752,0.00024923403],"domain_scores_gemma":[0.99900234,0.0002728836,0.00013300581,0.0003965551,0.00012949444,0.00006574209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005016124,0.0001435122,0.00016148723,0.00021228929,0.000073681666,0.00013777216,0.00041783424,0.0000593843,0.000041814677],"category_scores_gemma":[0.000047241578,0.0000961727,0.00003056262,0.0004221174,0.00006255244,0.0007561623,0.00007450922,0.000100300516,0.000059678543],"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.00017174974,0.00048699824,0.04769171,0.000082523096,0.000046933586,0.00013060434,0.011953189,0.0054546283,0.017565468,0.70858437,0.0024661103,0.2053657],"study_design_scores_gemma":[0.0049150507,0.00058754126,0.013034025,0.0006428911,0.000008432809,0.000029433777,0.0005899853,0.81486523,0.15484309,0.005940804,0.0034938396,0.00104965],"about_ca_topic_score_codex":0.00009833331,"about_ca_topic_score_gemma":0.00035760392,"teacher_disagreement_score":0.80941063,"about_ca_system_score_codex":0.00008541059,"about_ca_system_score_gemma":0.0001697485,"threshold_uncertainty_score":0.3921809},"labels":[],"label_agreement":null},{"id":"W2290918639","doi":"10.1007/s11042-016-3397-z","title":"Blind image separation based on reorganization of block DCT","year":2016,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Science Foundation of Hubei Province; National Natural Science Foundation of China","keywords":"Computer science; Blind signal separation; Discrete cosine transform; Block (permutation group theory); Image (mathematics); Independent component analysis; Set (abstract data type); Pattern recognition (psychology); Cluster analysis; Artificial intelligence; Matrix (chemical analysis); Algorithm; Component (thermodynamics); Mathematics","score_opus":0.0182279310584967,"score_gpt":0.28651321834637794,"score_spread":0.26828528728788126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290918639","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.0040042433,0.000009000823,0.9908962,0.0026917309,0.000016002075,0.0004910418,0.000026430522,0.00017595534,0.001689372],"genre_scores_gemma":[0.8539067,0.000023946675,0.14532742,0.00029451674,0.000046503155,0.00021339291,0.000024112815,0.000009613718,0.0001538095],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992472,0.0000413215,0.00021112188,0.00025212512,0.0001565797,0.000091657],"domain_scores_gemma":[0.9990079,0.00024654908,0.00012282282,0.0004128412,0.0001551009,0.00005479604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018340287,0.00008722197,0.00009726821,0.000100320656,0.00007580455,0.00007044008,0.00022055268,0.00005967516,0.000015017943],"category_scores_gemma":[0.00006932875,0.00006518728,0.000024200766,0.00030473695,0.0000584363,0.00034730244,0.000040201972,0.000043495078,0.000040931205],"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.000032124288,0.0005321983,0.0010647086,0.000031492156,0.000016764725,6.385412e-7,0.0007311167,0.00016829236,0.39809537,0.17335913,0.0030936438,0.42287454],"study_design_scores_gemma":[0.0025544711,0.00030297518,0.016182804,0.00008863716,0.000022697055,0.0000044166604,0.00002282046,0.19758007,0.7339097,0.008388862,0.040401597,0.0005409374],"about_ca_topic_score_codex":0.0000029187436,"about_ca_topic_score_gemma":0.000002004172,"teacher_disagreement_score":0.84990245,"about_ca_system_score_codex":0.000016350352,"about_ca_system_score_gemma":0.00004789665,"threshold_uncertainty_score":0.26582605},"labels":[],"label_agreement":null},{"id":"W2294767061","doi":"10.1109/embc.2015.7318313","title":"Localization of brain activities using multiway analysis of EEG tensor via EMD and reassigned TF representation","year":2015,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Electroencephalography; Spectrogram; Pattern recognition (psychology); Artificial intelligence; Computer science; Tensor (intrinsic definition); Representation (politics); Time–frequency analysis; Signal processing; Speech recognition; Mathematics; Neuroscience; Computer vision; Psychology","score_opus":0.05406654753840436,"score_gpt":0.33479842173988195,"score_spread":0.2807318742014776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294767061","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.17091791,0.000010868254,0.828371,0.0001337435,0.000012295634,0.000087053995,0.0000011422889,0.00006593683,0.00040006085],"genre_scores_gemma":[0.91059273,0.0000020300695,0.08920012,0.00009341214,0.0000033380222,0.000002318082,0.000005478903,0.0000034149953,0.00009715734],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991003,0.00016629323,0.00025254476,0.00018235673,0.00023340649,0.00006505483],"domain_scores_gemma":[0.9991326,0.00011568835,0.00021605038,0.00028083625,0.00021457794,0.00004028347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004226156,0.000063506835,0.00019617501,0.00040314422,0.000024685052,0.00003622044,0.00012803449,0.000049112805,0.000005161703],"category_scores_gemma":[0.00012202551,0.00005759125,0.000041522017,0.0009939454,0.000056711673,0.0005630882,0.00007081185,0.000025704283,1.747055e-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.00017839861,0.0006707298,0.11786476,0.00011981903,0.0013763078,0.000005224835,0.077401154,0.19475284,0.4660842,0.06222878,0.0022256258,0.07709213],"study_design_scores_gemma":[0.00014254953,0.000043101583,0.0026727591,0.000005442746,0.000046617064,9.528325e-7,0.00038584106,0.8715668,0.124239914,0.00081752706,0.000018661452,0.00005987806],"about_ca_topic_score_codex":0.00051696604,"about_ca_topic_score_gemma":0.000067018154,"teacher_disagreement_score":0.7396748,"about_ca_system_score_codex":0.000020889449,"about_ca_system_score_gemma":0.00003816092,"threshold_uncertainty_score":0.2348503},"labels":[],"label_agreement":null},{"id":"W2301067200","doi":"","title":"Computation of Portfolio VaRs with GARCH-Type Volatility","year":2013,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Blind Source Separation 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":"University of Waterloo","funders":"","keywords":"Autoregressive conditional heteroskedasticity; Econometrics; Volatility (finance); Value at risk; Portfolio; Multivariate statistics; Independent component analysis; Computation; Financial asset; Nonlinear system; Mathematics; Computer science; Economics; Financial economics; Finance; Statistics; Algorithm; Risk management; Artificial intelligence","score_opus":0.007616515142120051,"score_gpt":0.24100556920269398,"score_spread":0.23338905406057392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301067200","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.27076256,0.00016799309,0.7274648,0.00046192497,0.00003498592,0.00012671876,8.714764e-8,0.00007429082,0.0009066563],"genre_scores_gemma":[0.98647,0.00011066022,0.013068266,0.00010663681,0.00002376686,0.0000033174392,0.0000010851987,0.000008168316,0.00020814154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983721,0.0001196506,0.0002770642,0.00016532093,0.0003265569,0.00073934655],"domain_scores_gemma":[0.9990368,0.000033663007,0.00024794845,0.00021141612,0.00040863833,0.000061569546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001127549,0.00010153887,0.00014309595,0.00014174604,0.00008112597,0.000092542614,0.00042900123,0.000047260222,0.00001669265],"category_scores_gemma":[0.000023984941,0.00008020485,0.00004352837,0.00039014142,0.000047810307,0.0007317825,0.00004783019,0.00076962134,0.000014069421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050760136,0.00023940345,0.0091566,0.000014778451,0.00017430003,0.000003255095,0.0012615625,0.0006746629,0.002051982,0.82819784,0.00082078396,0.1573541],"study_design_scores_gemma":[0.0005559078,0.0015305596,0.017364644,0.000031872536,0.0000129838545,0.00045793888,0.00024037571,0.05100416,0.0022388608,0.9260565,0.000259204,0.00024699632],"about_ca_topic_score_codex":0.00010918543,"about_ca_topic_score_gemma":0.00007619965,"teacher_disagreement_score":0.7157074,"about_ca_system_score_codex":0.00018424592,"about_ca_system_score_gemma":0.0014427825,"threshold_uncertainty_score":0.33436647},"labels":[],"label_agreement":null},{"id":"W2314349685","doi":"10.1190/1.3513746","title":"High‐resolution three‐term AVO inversion via a Trivariate Cauchy probability distribution","year":2010,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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 Alberta","funders":"","keywords":"Inversion (geology); Cauchy distribution; Term (time); Geology; Probability distribution; Mathematics; Statistics; Seismology; Physics","score_opus":0.013820763856725479,"score_gpt":0.23659039308520888,"score_spread":0.2227696292284834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2314349685","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.22982216,0.000002192136,0.7663141,0.0019612017,0.0003281324,0.00032046734,0.0000051724014,0.0007697815,0.00047682854],"genre_scores_gemma":[0.90445274,0.0000015205884,0.095092125,0.00025273295,0.00005314495,0.000029395265,0.000049398226,0.0000053873664,0.000063541986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863696,0.00010218029,0.0002734585,0.00043533195,0.00031006924,0.00024202719],"domain_scores_gemma":[0.9987726,0.000053167452,0.00011945168,0.0007749038,0.00017005969,0.000109788765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008050246,0.00014537228,0.00014634583,0.00006753883,0.00018480486,0.00017479774,0.0005990633,0.0001798084,0.000069154536],"category_scores_gemma":[0.000089866146,0.00012617641,0.000072587,0.00037572812,0.00007262962,0.00091392116,0.0002794074,0.0003315411,0.00008650816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025261215,0.00033706063,0.001936945,0.000016138778,0.000010608396,0.0000026475361,0.00031870624,0.000060485814,0.024316642,0.94199395,0.003659626,0.027321948],"study_design_scores_gemma":[0.000911504,0.00036535613,0.095566265,0.000015759078,0.000015027688,0.000022138865,0.000003852817,0.38799495,0.089350685,0.41981977,0.005341275,0.00059340184],"about_ca_topic_score_codex":0.00042588284,"about_ca_topic_score_gemma":0.00052543136,"teacher_disagreement_score":0.6746306,"about_ca_system_score_codex":0.00008827889,"about_ca_system_score_gemma":0.00008114991,"threshold_uncertainty_score":0.51453245},"labels":[],"label_agreement":null},{"id":"W2318345820","doi":"10.2514/6.2008-1891","title":"Independent Component Analysis for Uncertainty Representation of Stochastic Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Canada Research Chairs","keywords":"Component (thermodynamics); Computer science; Representation (politics); Independent component analysis; Artificial intelligence","score_opus":0.052449487523373826,"score_gpt":0.3063795311242381,"score_spread":0.2539300436008643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2318345820","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.04167576,0.00001820377,0.9571949,0.0001327814,0.000058178877,0.0003607332,0.0000031001657,0.00014992987,0.00040639914],"genre_scores_gemma":[0.97409225,0.000002158747,0.025522118,0.000048267335,0.000010499458,0.000060444527,0.0000135292275,0.0000029673276,0.0002477693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902266,0.0000702464,0.00029912373,0.00022363925,0.0002868183,0.000097515134],"domain_scores_gemma":[0.99903554,0.0001556527,0.00016004317,0.00039798865,0.00021202087,0.000038771133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026161785,0.00006698362,0.00021010255,0.00026737747,0.0000608641,0.000030416413,0.00031745917,0.000038838472,0.000004679114],"category_scores_gemma":[0.000031377385,0.000058745005,0.00012054052,0.00066760514,0.000026889415,0.00018190652,0.00006132237,0.000037057038,0.0000022323682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021938702,0.0001682065,0.0024989534,0.00002096154,0.000362211,0.000001924967,0.0025505624,0.7398509,0.0016177247,0.25145525,0.0009926535,0.00045873696],"study_design_scores_gemma":[0.0002223429,0.000069263944,0.005091426,0.00000389688,0.0000362709,0.0000059701374,0.00009503702,0.99072874,0.002807646,0.0008059235,0.000043164746,0.00009031566],"about_ca_topic_score_codex":0.0004228506,"about_ca_topic_score_gemma":0.000030992924,"teacher_disagreement_score":0.9324165,"about_ca_system_score_codex":0.000032242453,"about_ca_system_score_gemma":0.000039445415,"threshold_uncertainty_score":0.23955518},"labels":[],"label_agreement":null},{"id":"W2319054277","doi":"10.1190/1.3255530","title":"How reliable is statistical wavelet estimation?","year":2009,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Alberta","funders":"BG Group","keywords":"Wavelet; Estimation; Computer science; Artificial intelligence; Engineering; Systems engineering","score_opus":0.013531030402926282,"score_gpt":0.2757406026519683,"score_spread":0.262209572249042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2319054277","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.00014358894,0.000005938813,0.9436235,0.03420579,0.000025890115,0.00007969935,0.0000012164012,0.0005403636,0.02137403],"genre_scores_gemma":[0.2544244,0.0000023310547,0.734757,0.00669778,0.000009460146,0.0000030240801,0.0000027380208,0.0000021146984,0.004101147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993364,0.00002026306,0.00010190976,0.00020264313,0.00020190561,0.00013684282],"domain_scores_gemma":[0.999464,0.00003721045,0.000030079684,0.00034947536,0.000059820435,0.000059411843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015390172,0.000069687376,0.00007721538,0.00005551187,0.000055682336,0.00040502546,0.00032071528,0.00004085658,0.00005844917],"category_scores_gemma":[0.000039151488,0.000060004837,0.000017993283,0.00018135697,0.000014042222,0.00060817396,0.000036205296,0.000074871525,0.000081619626],"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":[4.8521343e-7,0.000021816859,0.000005454294,7.8871443e-7,0.0000010076734,0.0000018879065,0.000146124,0.000009466161,0.0000587659,0.864514,0.09419747,0.04104277],"study_design_scores_gemma":[0.00014575013,0.00018819515,0.0012641512,0.0000052659952,0.0000020129878,0.000011805007,0.000009978861,0.5770532,0.018570194,0.3625956,0.039961215,0.00019263322],"about_ca_topic_score_codex":0.0000057601005,"about_ca_topic_score_gemma":6.367682e-7,"teacher_disagreement_score":0.5770438,"about_ca_system_score_codex":0.000015941652,"about_ca_system_score_gemma":0.00003532586,"threshold_uncertainty_score":0.39056697},"labels":[],"label_agreement":null},{"id":"W2321928777","doi":"10.1190/1.3255552","title":"Prestack rank‐reducing noise suppression: Theory","year":2009,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":45,"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":"University of Alberta","keywords":"Prestack; Rank (graph theory); Noise (video); Computer science; Noise measurement; Algorithm; Speech recognition; Noise reduction; Mathematics; Artificial intelligence; Geology; Combinatorics","score_opus":0.013555799220913746,"score_gpt":0.2739510818119579,"score_spread":0.2603952825910441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2321928777","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.0049114204,0.00005495632,0.88849705,0.003347621,0.00009002707,0.00013551337,2.2440965e-7,0.00097481057,0.10198835],"genre_scores_gemma":[0.86272335,0.000008931058,0.12970659,0.0033141144,0.00004364548,0.000005768128,0.0000010098223,0.0000042660704,0.0041923327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99909467,0.00013060278,0.00015565133,0.00026330174,0.00018814245,0.00016760908],"domain_scores_gemma":[0.99917233,0.00007978079,0.00004335178,0.00058681436,0.00004711462,0.000070590984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004592915,0.000093372975,0.00009290184,0.00007562166,0.00007980254,0.00017251607,0.00063944375,0.000054817658,0.00011792188],"category_scores_gemma":[0.000039380382,0.0000736861,0.00004547393,0.00019045606,0.000017506969,0.00065550464,0.000091323556,0.00010958535,0.000067083],"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.000008084024,0.00007181759,0.000016558399,0.000002037361,0.0000031004809,0.0000054241914,0.0015091621,0.00011864991,0.0070775812,0.8865179,0.022807801,0.08186193],"study_design_scores_gemma":[0.0007018112,0.0003699667,0.005548178,0.000071849485,0.00000787378,0.000046579236,0.00008025495,0.046522465,0.46544448,0.43966904,0.040871132,0.0006663648],"about_ca_topic_score_codex":0.0000037886382,"about_ca_topic_score_gemma":3.8747683e-7,"teacher_disagreement_score":0.8578119,"about_ca_system_score_codex":0.000011978237,"about_ca_system_score_gemma":0.00003893778,"threshold_uncertainty_score":0.30048317},"labels":[],"label_agreement":null},{"id":"W2323749021","doi":"10.1109/spac.2014.6982725","title":"STFT-like time frequency representations for nonstationary signal &amp;#x2014; From evenly sampled data to arbitrary nonuniformly sampled data","year":2014,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"National Natural Science Foundation of China; Rice University; University of Florida","keywords":"Spectrogram; Short-time Fourier transform; Time–frequency analysis; Algorithm; Computer science; Fourier transform; Sampling (signal processing); Pattern recognition (psychology); Artificial intelligence; SIGNAL (programming language); Speech recognition; Mathematics; Fourier analysis; Computer vision; Detector; Telecommunications","score_opus":0.11762260092697172,"score_gpt":0.3534537847987315,"score_spread":0.2358311838717598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2323749021","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.001391196,0.00002173037,0.9839648,0.0048065004,0.000239823,0.0011715924,0.003460794,0.00087157503,0.004071983],"genre_scores_gemma":[0.010234723,0.0000050910644,0.96178645,0.0056564007,0.00022637428,0.0001286858,0.020471616,0.000038005608,0.0014526428],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963527,0.000295651,0.0007428223,0.0015556364,0.00060689077,0.00044634767],"domain_scores_gemma":[0.9909035,0.0021142073,0.00023448853,0.0061566676,0.00030412257,0.0002869947],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015090455,0.0003057877,0.0003603561,0.00029283497,0.0003335298,0.00047461942,0.006244453,0.00013569565,0.00062044564],"category_scores_gemma":[0.0006643317,0.0003006723,0.000070915325,0.00058040285,0.0000649608,0.0034884997,0.0021914095,0.00021841863,0.0006050867],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102946695,0.0005793217,0.0010275599,0.000030961084,0.0002501406,0.0000031398297,0.0021659075,0.00033857726,0.029564595,0.18049486,0.7626066,0.022835389],"study_design_scores_gemma":[0.001427746,0.0003135231,0.005350177,0.000057937246,0.00007926377,0.000016377333,0.00007890536,0.46409658,0.0011687491,0.19831778,0.32785413,0.0012388412],"about_ca_topic_score_codex":0.0015297587,"about_ca_topic_score_gemma":0.001130229,"teacher_disagreement_score":0.463758,"about_ca_system_score_codex":0.00004491734,"about_ca_system_score_gemma":0.0004198281,"threshold_uncertainty_score":0.99994457},"labels":[],"label_agreement":null},{"id":"W2328031340","doi":"10.1080/03772063.2005.11416394","title":"Adaptive Blind Equalization of Nonlinear Channels and Chaotic Systems using Coupled EKF and RLS Estimator","year":2005,"lang":"en","type":"article","venue":"IETE Journal of Research","topic":"Blind Source Separation 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":"Concordia University","funders":"Else Kröner-Fresenius-Stiftung","keywords":"Control theory (sociology); Extended Kalman filter; Estimator; Chaotic; Nonlinear system; Equalization (audio); Channel (broadcasting); Kalman filter; Computer science; Mathematics; Telecommunications; Statistics; Artificial intelligence","score_opus":0.15950854805216988,"score_gpt":0.4246516049181786,"score_spread":0.2651430568660087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2328031340","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.4390326,0.0013489815,0.55870044,0.000559607,0.000075496035,0.00022488371,0.00000146499,0.000015997992,0.000040517963],"genre_scores_gemma":[0.9205297,0.00021043765,0.079039186,0.000017483751,0.00015470426,0.0000015597749,2.3795022e-7,0.000008387714,0.000038285918],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981311,0.00032193924,0.00043704407,0.00014438301,0.0007704119,0.00019511108],"domain_scores_gemma":[0.9980415,0.00030169418,0.0003043032,0.00016184297,0.001060097,0.0001305405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036209242,0.00008032385,0.00023611155,0.00055846863,0.00010918135,0.00021321153,0.0002983324,0.000075097196,0.0000020721004],"category_scores_gemma":[0.00021695232,0.00006844481,0.000029337201,0.0004573433,0.00012766026,0.0007046176,0.00014269732,0.0002904036,9.285928e-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.0027805152,0.0023445014,0.007244779,0.0027493923,0.0012500493,0.00050814304,0.08193333,0.23928879,0.40335268,0.16884917,0.0035596825,0.08613898],"study_design_scores_gemma":[0.00054717134,0.00044282892,0.00008590105,0.00024986517,0.000005737794,0.00016521286,0.00019133913,0.9901879,0.0074110627,0.0004488074,0.00019683561,0.000067384],"about_ca_topic_score_codex":0.000028447066,"about_ca_topic_score_gemma":0.0000021136934,"teacher_disagreement_score":0.7508991,"about_ca_system_score_codex":0.000052609903,"about_ca_system_score_gemma":0.0002032399,"threshold_uncertainty_score":0.27910984},"labels":[],"label_agreement":null},{"id":"W2339007906","doi":"10.1109/tit.2016.2553147","title":"Arbitrarily Tight Bounds on Differential Entropy of Gaussian Mixtures","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Blind Source Separation 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 Waterloo","funders":"","keywords":"Differential entropy; Gaussian; Upper and lower bounds; Mathematics; Entropy (arrow of time); Sequence (biology); Information theory; Gaussian process; Amplitude; Algorithm; Statistical physics; Applied mathematics; Mathematical analysis; Principle of maximum entropy; Maximum entropy probability distribution; Physics; Statistics; Quantum mechanics","score_opus":0.007034788668061615,"score_gpt":0.22466821346675284,"score_spread":0.21763342479869122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339007906","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.0061082896,0.000002566955,0.9849981,0.000746034,0.0004529113,0.00018335388,0.000027245584,0.00032662507,0.007154884],"genre_scores_gemma":[0.9956514,0.000017673758,0.0030345595,0.00084364513,0.00001961157,0.000038054164,0.0000025305367,0.0000066764383,0.00038584776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99879724,0.0001446143,0.000407114,0.00013432486,0.00034994783,0.00016673405],"domain_scores_gemma":[0.99896383,0.00020368178,0.00019212316,0.00048086245,0.00008992686,0.000069573405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027466935,0.00015111463,0.0001439059,0.00041658554,0.00013665578,0.00010556426,0.0004318634,0.00010858507,0.00022481683],"category_scores_gemma":[0.000009503793,0.00010254681,0.00012329764,0.00021110244,0.00009057698,0.0016763663,0.0000024839599,0.00015701291,0.00018542299],"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.00015551048,0.0001348863,0.0000011353021,0.000013715545,0.000036728856,3.122776e-7,0.0019057132,0.00017905679,0.0063262084,0.8912531,0.00052047253,0.099473156],"study_design_scores_gemma":[0.0009936243,0.00045590548,0.00019656871,0.00009717597,0.000014643513,0.000006978536,0.000042099015,0.0015868951,0.92561346,0.06565511,0.005062535,0.00027502512],"about_ca_topic_score_codex":0.0000034586992,"about_ca_topic_score_gemma":0.0000012629478,"teacher_disagreement_score":0.98954314,"about_ca_system_score_codex":0.00005300068,"about_ca_system_score_gemma":0.00006571689,"threshold_uncertainty_score":0.41817376},"labels":[],"label_agreement":null},{"id":"W2340447012","doi":"10.1109/tnnls.2015.2436064","title":"Improper Complex-Valued Bhattacharyya Distance","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Blind Source Separation 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 Toronto","funders":"","keywords":"Bhattacharyya distance; Mathematics; Statistical distance; Gaussian; Pattern recognition (psychology); Triangle inequality; Context (archaeology); Metric (unit); Covariance matrix; Covariance; Divergence (linguistics); Upper and lower bounds; Algorithm; Statistics; Artificial intelligence; Computer science; Probability distribution; Discrete mathematics","score_opus":0.04113861932766134,"score_gpt":0.27063208923432336,"score_spread":0.22949346990666203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2340447012","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.006345075,0.00025184493,0.99086946,0.00044304904,0.0007395965,0.00025249677,0.0000011717325,0.00060597603,0.00049134466],"genre_scores_gemma":[0.99683297,0.00002126869,0.0014529969,0.000285443,0.0000886061,0.000045172124,0.0000018902176,0.000018974553,0.0012526759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983835,0.0004778274,0.00026172856,0.00036743566,0.00025537633,0.0002540871],"domain_scores_gemma":[0.9992372,0.00008995633,0.00010548633,0.0002943186,0.000094679664,0.00017840427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005662263,0.00017807221,0.00021710487,0.00008701786,0.00032291177,0.00039873944,0.00027625563,0.00009407791,0.0000041868193],"category_scores_gemma":[0.0000052406003,0.00015186022,0.000056457025,0.00028092295,0.000050749688,0.00042343925,0.0000040858963,0.00061718095,0.000010485574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020957703,0.000036409838,0.00005372888,0.00001039518,0.000014653481,0.0000060745388,0.0006495195,0.9867505,0.00006295975,0.001867426,0.0008106069,0.009716786],"study_design_scores_gemma":[0.00028394125,0.000255343,0.00007863756,0.0000297465,0.000005872167,0.00004392296,0.00009928888,0.9900707,0.00004481553,0.000012398216,0.00889065,0.00018466952],"about_ca_topic_score_codex":0.00009812336,"about_ca_topic_score_gemma":0.000010591088,"teacher_disagreement_score":0.9904879,"about_ca_system_score_codex":0.00003539384,"about_ca_system_score_gemma":0.000020101606,"threshold_uncertainty_score":0.61926806},"labels":[],"label_agreement":null},{"id":"W2340982871","doi":"","title":"On the use of time synchronous averaging, independent component analysis and support vector machines for bearing fault diagnosis","year":2007,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Polytechnique Montréal","funders":"","keywords":"Crest factor; Generalization; Bearing (navigation); Independent component analysis; Support vector machine; Fault (geology); Computer science; Feature vector; Component (thermodynamics); Envelope (radar); SIGNAL (programming language); Pattern recognition (psychology); Transmission (telecommunications); Principal component analysis; Signal processing; Artificial intelligence; Algorithm; Mathematics; Telecommunications; Physics","score_opus":0.026332254028551626,"score_gpt":0.2720000329474613,"score_spread":0.24566777891890965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2340982871","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.2993025,0.0000055337646,0.69955707,0.0005232737,0.000018561706,0.00024824007,0.0000042140696,0.00009673124,0.00024389333],"genre_scores_gemma":[0.96326846,0.0000071892837,0.035701986,0.0007106835,0.000009922879,0.000030307068,0.0000060755697,0.000006346677,0.00025903684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990398,0.000045662717,0.000256278,0.00025119676,0.00024596992,0.00016108692],"domain_scores_gemma":[0.9984611,0.00090880773,0.00011754203,0.00037974198,0.00008015143,0.000052649342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007217321,0.000108578824,0.00018596073,0.00025409024,0.00009399644,0.00014285506,0.00031617377,0.000044529777,0.00006242125],"category_scores_gemma":[0.00006501489,0.000074123476,0.00010093635,0.00031811788,0.00003368642,0.00020390168,0.00014969811,0.00008084768,0.0000047501835],"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.00020279187,0.0021015918,0.2462136,0.00013064966,0.003210503,0.000041683277,0.015930628,0.013536658,0.01593208,0.5173358,0.016534746,0.16882928],"study_design_scores_gemma":[0.00052838144,0.0005785909,0.15760997,0.000028015547,0.0002111388,0.000009223136,0.000026030853,0.6718064,0.16290516,0.0024005326,0.0034094872,0.000487099],"about_ca_topic_score_codex":0.00027586572,"about_ca_topic_score_gemma":0.00012936915,"teacher_disagreement_score":0.66396594,"about_ca_system_score_codex":0.000030000125,"about_ca_system_score_gemma":0.000016344498,"threshold_uncertainty_score":0.30226675},"labels":[],"label_agreement":null},{"id":"W2342414964","doi":"10.1109/tmi.2016.2527717","title":"Deep Independence Network Analysis of Structural Brain Imaging: Application to Schizophrenia","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Medical Imaging","topic":"Blind Source Separation Techniques","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":"Université de Montréal","funders":"National Institute of General Medical Sciences; National Institute of Biomedical Imaging and Bioengineering; National Institute of Mental Health","keywords":"Independent component analysis; Neuroimaging; Pattern recognition (psychology); Artificial intelligence; Nonlinear system; Computer science; Curse of dimensionality; Linear model; Neuroscience; Machine learning; Psychology; Physics","score_opus":0.0067852080019502785,"score_gpt":0.2773866065799928,"score_spread":0.27060139857804255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342414964","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.003481426,0.000026863383,0.981232,0.014461518,0.00018689038,0.00017881807,0.000003616316,0.0003197831,0.00010912293],"genre_scores_gemma":[0.95289326,0.000006236709,0.04422049,0.0027467003,0.000042316296,0.00004673613,0.0000011890855,0.000011204228,0.00003186755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776113,0.0001512446,0.00041795018,0.0004889551,0.0008849349,0.00029580254],"domain_scores_gemma":[0.9984345,0.0003755348,0.00012244581,0.00064666575,0.00015210538,0.00026877996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075487565,0.00015887113,0.00025634211,0.0005480069,0.00013629544,0.00006642227,0.0008834489,0.00006704363,0.000112642956],"category_scores_gemma":[0.000055721564,0.00012302339,0.00015118578,0.001891929,0.00011576645,0.00051814644,0.000011409273,0.00026063327,0.000025572857],"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.000024940648,0.000042849555,0.0007283044,0.0000042045594,0.00010898444,0.0000055660203,0.00042235508,0.011935496,0.004110922,0.004573352,0.00028364046,0.97775936],"study_design_scores_gemma":[0.0004262791,0.000025469666,0.0030115938,0.000068237336,0.000093205796,0.000015696041,0.000019782952,0.9784434,0.014131607,0.003112935,0.00038268077,0.00026912615],"about_ca_topic_score_codex":0.00006460866,"about_ca_topic_score_gemma":0.00011616777,"teacher_disagreement_score":0.97749025,"about_ca_system_score_codex":0.00006821634,"about_ca_system_score_gemma":0.00010425287,"threshold_uncertainty_score":0.50167483},"labels":[],"label_agreement":null},{"id":"W2345641368","doi":"10.1109/camsap.2015.7465293","title":"Cross recurrence plot analysis based method for TDOA estimation of underwater acoustic signals","year":2015,"lang":"en","type":"preprint","venue":"","topic":"Blind Source Separation 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":"Université du Québec à Rimouski","funders":"","keywords":"Multilateration; Estimator; FDOA; Underwater; Computer science; Spectrogram; Recurrence plot; Acoustics; Plot (graphics); SIGNAL (programming language); Underwater acoustics; Cross-correlation; Beluga Whale; Speech recognition; Statistics; Mathematics; Geology; Physics","score_opus":0.07956805094849814,"score_gpt":0.4087056555778068,"score_spread":0.32913760462930863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345641368","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.0005411913,0.00002818858,0.99705154,0.0004298671,0.00012230221,0.00075280457,0.000043621774,0.000441946,0.0005885402],"genre_scores_gemma":[0.29797384,0.0000014795727,0.701273,0.00020149941,0.000012815398,0.00015922303,0.00009844558,0.000011091271,0.00026859457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747944,0.00033886675,0.000702246,0.0007520364,0.0005010523,0.00022638553],"domain_scores_gemma":[0.9964786,0.00062534655,0.0005884996,0.0011716285,0.0010355394,0.00010034209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030969994,0.00027102153,0.00062000134,0.00067676377,0.000054834683,0.00038693432,0.0013087967,0.00031755958,0.000042266784],"category_scores_gemma":[0.00030185527,0.00023917566,0.0003490503,0.0007384241,0.00005467508,0.00029990595,0.0005634277,0.00024519808,0.0000054924008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118884955,0.00007052494,0.000035966503,0.00013735688,0.00016120239,3.0905593e-7,0.0004011027,0.9888812,0.00032817235,0.003660925,0.00054744584,0.0057639107],"study_design_scores_gemma":[0.00015385468,0.00007783789,0.000063578314,0.000042134492,0.00020909465,3.0078664e-7,0.00000491078,0.90688646,0.04626312,0.04598294,0.000072993505,0.00024277702],"about_ca_topic_score_codex":0.0001320322,"about_ca_topic_score_gemma":0.000034925262,"teacher_disagreement_score":0.29743266,"about_ca_system_score_codex":0.00009916469,"about_ca_system_score_gemma":0.0005156589,"threshold_uncertainty_score":0.97533},"labels":[],"label_agreement":null},{"id":"W2352320652","doi":"10.1007/s00024-016-1309-9","title":"GNSS Vertical Coordinate Time Series Analysis Using Single-Channel Independent Component Analysis Method","year":2016,"lang":"en","type":"article","venue":"Pure and Applied Geophysics","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Jet Propulsion Laboratory; National Natural Science Foundation of China","keywords":"GNSS applications; Geodesy; Geology; Tectonics; Hilbert–Huang transform; SIGNAL (programming language); Global Positioning System; Series (stratigraphy); Seismology; Computer science; Telecommunications; White noise","score_opus":0.01664554268775334,"score_gpt":0.2539588461433595,"score_spread":0.23731330345560617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2352320652","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.14088492,0.000016071654,0.8577906,0.0005403098,0.000018575387,0.00012154638,0.000007774433,0.00018747573,0.00043270644],"genre_scores_gemma":[0.9462066,0.000005880639,0.053338252,0.00024572283,0.000040389932,0.000017114713,0.000009010942,0.000011156307,0.0001258397],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984131,0.00010317698,0.00028576562,0.0005487905,0.0003541886,0.00029501691],"domain_scores_gemma":[0.99902004,0.00013287943,0.000104501756,0.0005184296,0.00009357679,0.00013056204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035718345,0.000220581,0.0004995006,0.00032811722,0.00015730434,0.0002128305,0.0003677223,0.00010443776,0.0000133029835],"category_scores_gemma":[0.0000070508277,0.00016610148,0.00020777408,0.0017697631,0.000073185896,0.00036584729,0.00033052388,0.00011279429,0.00002301646],"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.00014611214,0.0008810279,0.0010481634,0.000041758627,0.009129997,0.000025130013,0.004777203,0.009769578,0.45726132,0.45274392,0.00020578795,0.063969985],"study_design_scores_gemma":[0.0016337812,0.0003428363,0.01647277,0.000038263435,0.008372627,0.000019395895,0.00017855836,0.439079,0.33785367,0.1923444,0.0013594804,0.0023052252],"about_ca_topic_score_codex":0.000020186892,"about_ca_topic_score_gemma":0.000008449407,"teacher_disagreement_score":0.8053217,"about_ca_system_score_codex":0.000045263307,"about_ca_system_score_gemma":0.00002459597,"threshold_uncertainty_score":0.6773422},"labels":[],"label_agreement":null},{"id":"W2360783902","doi":"","title":"Blind Speech Signal Separation Based on Least Square","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Blind signal separation; Computer science; SIGNAL (programming language); Separation (statistics); Speech recognition; Source separation; Signal processing; Speech processing; Artificial intelligence; Algorithm; Pattern recognition (psychology); Digital signal processing; Telecommunications; Machine learning; Computer hardware","score_opus":0.02359604676430428,"score_gpt":0.2832344829710414,"score_spread":0.25963843620673716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2360783902","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.002950963,0.000016373038,0.98913753,0.0019080638,0.0000145826225,0.0008948693,0.00000725341,0.0008116505,0.0042586992],"genre_scores_gemma":[0.34248564,0.000004082289,0.65322536,0.003285447,0.00014668888,0.00047278055,0.000060037975,0.000018693472,0.0003012462],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99846464,0.000085158696,0.0003152619,0.00058018934,0.00031158244,0.00024314222],"domain_scores_gemma":[0.9987702,0.00009353372,0.00012453165,0.00072226714,0.00018069199,0.00010876905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018724309,0.00020588926,0.00016192283,0.00027957262,0.0003843597,0.00016621537,0.0008707503,0.00010905886,0.000030762585],"category_scores_gemma":[6.0577105e-7,0.00021445539,0.000103918435,0.00070269196,0.00006275854,0.00033907467,0.0001157771,0.0002215411,0.00055322464],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000869961,0.0034243087,0.0016020035,0.000074971394,0.00007466329,0.000054035685,0.0043643992,0.025818186,0.040396653,0.23116426,0.11968993,0.5732496],"study_design_scores_gemma":[0.0011864651,0.00024304145,0.0025675592,0.000028052624,0.0000083826735,0.0001063328,0.000008392698,0.30249152,0.07634323,0.003039968,0.61331326,0.0006638213],"about_ca_topic_score_codex":0.000008514197,"about_ca_topic_score_gemma":0.000003807976,"teacher_disagreement_score":0.57258576,"about_ca_system_score_codex":0.000067878536,"about_ca_system_score_gemma":0.0001576031,"threshold_uncertainty_score":0.8745237},"labels":[],"label_agreement":null},{"id":"W2369204761","doi":"","title":"Single EP Signal Few-trial Extraction Based on Empirical Model Decomposition and Independent Component Analysis","year":2008,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Independent component analysis; Component (thermodynamics); Decomposition; SIGNAL (programming language); Extraction (chemistry); Computer science; Biological system; Statistics; Mathematics; Artificial intelligence; Chemistry; Physics; Chromatography","score_opus":0.061759692094413,"score_gpt":0.33762638274309525,"score_spread":0.27586669064868224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2369204761","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.2853857,0.0000030695048,0.7120743,0.0008190634,0.00002970736,0.0001672183,9.177456e-7,0.00023874658,0.0012813249],"genre_scores_gemma":[0.89697564,0.0000023793325,0.10179533,0.0010837547,0.000026692207,0.00001804081,0.000014458852,0.0000053523227,0.00007835786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985196,0.00015645797,0.00027313654,0.00040457904,0.000493364,0.0001528848],"domain_scores_gemma":[0.99928427,0.0001278615,0.00010272598,0.0003025873,0.000075696466,0.00010685203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030451483,0.00013462997,0.0001874547,0.00042713963,0.00019253147,0.00013264094,0.00020247878,0.00010522132,0.000030949363],"category_scores_gemma":[0.000007912202,0.00012409278,0.000114248636,0.00045663002,0.000035890826,0.00040162174,0.000059730548,0.00016355765,0.000009985012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005342267,0.0070434343,0.0056013037,0.000014679807,0.00037059133,0.000098632365,0.002463765,0.90022355,0.041685503,0.017818348,0.005089105,0.014248824],"study_design_scores_gemma":[0.0021539766,0.00037358227,0.0023446274,0.0000026044213,0.000029125067,0.000009538193,0.0000038453823,0.9812397,0.0130567895,0.0005684241,0.00006988732,0.00014793668],"about_ca_topic_score_codex":0.000029146364,"about_ca_topic_score_gemma":0.000020364509,"teacher_disagreement_score":0.61158997,"about_ca_system_score_codex":0.00009792801,"about_ca_system_score_gemma":0.00006095108,"threshold_uncertainty_score":0.5060357},"labels":[],"label_agreement":null},{"id":"W2373802572","doi":"10.1007/11520153_14","title":"Perceptive, Non-linear Speech Processing and Spiking Neural Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Speech recognition; Computer science; Speech processing; Artificial neural network; Source separation; Noise (video); Voice activity detection; Speech enhancement; Context (archaeology); Artificial intelligence; Pattern recognition (psychology); Noise reduction","score_opus":0.018266970111526244,"score_gpt":0.2722868730642513,"score_spread":0.2540199029527251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2373802572","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.00037235042,0.0004303497,0.99486506,0.0008238982,0.0003886228,0.00038380563,7.85731e-7,0.00033648396,0.0023986273],"genre_scores_gemma":[0.33490658,0.000058747908,0.6611282,0.0029611504,0.0007081255,0.0000064775495,0.0000026995926,0.000038468283,0.00018954133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666595,0.00003575991,0.00048281837,0.001474815,0.00074023736,0.00060043467],"domain_scores_gemma":[0.9983112,0.00017473272,0.00029107276,0.0008194059,0.00023795107,0.00016562811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009177875,0.00052385905,0.00047535883,0.00068530353,0.00033222497,0.0009437764,0.0020260103,0.0003789038,0.000010392718],"category_scores_gemma":[0.000033810127,0.00049029215,0.000084274616,0.0005363223,0.0006325674,0.0011822184,0.0013238734,0.0011834976,0.0000074134473],"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.000002544202,0.000012478459,0.00004085225,0.000016549035,0.0000025429392,0.000033828685,0.0010776095,0.054665845,0.000043926102,0.0018454607,0.000009193046,0.9422492],"study_design_scores_gemma":[0.00013444117,0.000116289375,0.00015663552,0.00025907968,0.000004575711,0.0001351387,2.403323e-7,0.9837934,0.0002770289,0.013993051,0.0005950816,0.00053505995],"about_ca_topic_score_codex":0.000011984725,"about_ca_topic_score_gemma":0.000049322305,"teacher_disagreement_score":0.9417141,"about_ca_system_score_codex":0.00016938987,"about_ca_system_score_gemma":0.00025333872,"threshold_uncertainty_score":0.99975485},"labels":[],"label_agreement":null},{"id":"W2386292248","doi":"","title":"Real-Time Blind Speech Separation Based on Microphone Array","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Microphone array; Speech recognition; Independent component analysis; Microphone; Blind signal separation; Separation (statistics); Filter (signal processing); Speech enhancement; Time domain; Component (thermodynamics); Artificial intelligence; Computer vision; Telecommunications; Machine learning","score_opus":0.015268909567074359,"score_gpt":0.27205751564324837,"score_spread":0.256788606076174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2386292248","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.00747526,0.000011080364,0.9820147,0.0015948477,0.000020710411,0.0009936574,0.000008389767,0.0010495499,0.006831762],"genre_scores_gemma":[0.023659186,0.000027472714,0.97249633,0.0020716796,0.0001682979,0.00045113763,0.00008143761,0.000028327442,0.001016102],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99822325,0.00010940253,0.0003890356,0.0006927862,0.0002952165,0.00029033358],"domain_scores_gemma":[0.9983707,0.00012170996,0.00016618632,0.0010301629,0.00018606997,0.00012518214],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024385749,0.00024817762,0.00021993958,0.0003198033,0.00038425723,0.00016575241,0.0010052678,0.00013375982,0.000033145352],"category_scores_gemma":[9.768312e-7,0.0002601791,0.00011613555,0.00084014196,0.000079655365,0.000304493,0.00009857589,0.00021095084,0.0015494591],"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.000021473643,0.00071175536,0.000080169535,0.0000142579765,0.000020555768,0.000010153397,0.0008501331,0.0011994068,0.92280275,0.005582348,0.040747255,0.02795974],"study_design_scores_gemma":[0.0008778778,0.00014728885,0.00084771053,0.00001799828,0.00000744159,0.000094550705,0.0000032638993,0.028739434,0.6541251,0.0015347607,0.3130637,0.00054087886],"about_ca_topic_score_codex":0.000024594043,"about_ca_topic_score_gemma":0.0000029193868,"teacher_disagreement_score":0.27231646,"about_ca_system_score_codex":0.00009215357,"about_ca_system_score_gemma":0.00018403426,"threshold_uncertainty_score":0.99998504},"labels":[],"label_agreement":null},{"id":"W2401112332","doi":"10.21553/rev-jec.40","title":"Blind Identification for Communication Signals: An Approach Exploiting Sampling Phase Diversity","year":2013,"lang":"en","type":"article","venue":"REV Journal on Electronics and Communications","topic":"Blind Source Separation 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":"Université Laval","funders":"","keywords":"Cyclostationary process; Autocorrelation; Computer science; Synchronization (alternating current); Asynchronous communication; Channel (broadcasting); Algorithm; Sampling (signal processing); Noise (video); Set (abstract data type); SIGNAL (programming language); Mathematics; Artificial intelligence; Statistics; Telecommunications","score_opus":0.12371306523234629,"score_gpt":0.3683447709821576,"score_spread":0.24463170574981133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401112332","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.04298407,0.0019863825,0.9493932,0.004443325,0.000015516636,0.000553086,0.00000292571,0.00012703156,0.0004944558],"genre_scores_gemma":[0.81604946,0.004172639,0.1791607,0.00037931115,0.00002034904,0.00012675916,0.000047033252,0.000011532261,0.000032231987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998509,0.00040905233,0.0004220113,0.00022167288,0.00019841598,0.00023983857],"domain_scores_gemma":[0.9971583,0.00030106227,0.0004231899,0.0015526552,0.00043609075,0.00012870958],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017098071,0.00012901347,0.00015851404,0.00018924841,0.0021519803,0.0008782219,0.002113807,0.00007565794,0.000003603656],"category_scores_gemma":[0.00008166436,0.00012943274,0.000074259646,0.0002595871,0.000075487595,0.0015786887,0.00053204055,0.0005388374,0.000004401687],"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.00001734112,0.000939544,0.00004720696,0.000011812608,0.0000518028,6.073955e-8,0.0030089687,0.00023733694,0.0053841416,0.8463013,0.00028633475,0.14371412],"study_design_scores_gemma":[0.002144241,0.00086083874,0.0004925354,0.00008497561,0.000057827077,0.00008494734,0.00096784375,0.6387458,0.0021637836,0.3405695,0.013290411,0.0005373061],"about_ca_topic_score_codex":0.000013161797,"about_ca_topic_score_gemma":0.000005870579,"teacher_disagreement_score":0.7730654,"about_ca_system_score_codex":0.00010570245,"about_ca_system_score_gemma":0.00009223298,"threshold_uncertainty_score":0.99914706},"labels":[],"label_agreement":null},{"id":"W2406755411","doi":"10.1109/icassp.2016.7471703","title":"On time delay estimation based on multichannel spatiotemporal sparse linear prediction","year":2016,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Linear prediction; Estimation; Pattern recognition (psychology); Artificial intelligence; Algorithm; Engineering","score_opus":0.015979922457014926,"score_gpt":0.25191995217590213,"score_spread":0.2359400297188872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406755411","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.009319828,5.959893e-7,0.9819605,0.0034845248,0.00010744631,0.0002549332,0.000006360583,0.0010430084,0.003822801],"genre_scores_gemma":[0.81440526,6.131056e-7,0.18296655,0.001354559,0.000036937206,0.000025299709,0.00001070579,0.000010407031,0.0011896719],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887,0.00010241751,0.00021506472,0.00032693174,0.00033770155,0.00014784721],"domain_scores_gemma":[0.999053,0.00020659014,0.000090453905,0.00048860465,0.00008949649,0.00007185091],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003867667,0.00012844881,0.00009643563,0.00019641536,0.00008031741,0.000057867604,0.00026917877,0.00009353024,0.00009606471],"category_scores_gemma":[0.00013206365,0.00008618217,0.00004446465,0.00017197349,0.000022855698,0.0004780796,0.00003485595,0.00007426828,0.00095309515],"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.00040976162,0.0020186421,0.00067702803,0.000031496464,0.000049787093,0.000031150652,0.0013344418,0.18857364,0.014395794,0.33888474,0.07010146,0.38349205],"study_design_scores_gemma":[0.00041535817,0.00042719324,0.00038048232,0.000044435863,0.0000017771642,0.0000010307667,5.5631756e-7,0.9610011,0.034487307,0.0027147736,0.0004157207,0.000110272515],"about_ca_topic_score_codex":0.00001257874,"about_ca_topic_score_gemma":0.0000024476126,"teacher_disagreement_score":0.8050854,"about_ca_system_score_codex":0.00006904737,"about_ca_system_score_gemma":0.000050538423,"threshold_uncertainty_score":0.99982476},"labels":[],"label_agreement":null},{"id":"W2472757913","doi":"10.1007/978-3-319-00846-2_141","title":"Spontaneous Speech and Emotional Response Modeling Based on One-Class Classifier Oriented to Alzheimer Disease Diagnosis","year":2013,"lang":"en","type":"book-chapter","venue":"World Congress on Medical Physics and Biomedical Engineering, September 7 - 12, 2009, Munich, Germany","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Classifier (UML); Computer science; Class (philosophy); Artificial intelligence; Outlier; Machine learning; Pattern recognition (psychology); Speech recognition; Natural language processing","score_opus":0.020414610710851502,"score_gpt":0.2486122317984947,"score_spread":0.2281976210876432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2472757913","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.01644441,0.0045225164,0.7405113,0.07667069,0.008829481,0.009733964,0.0016639569,0.005904751,0.13571894],"genre_scores_gemma":[0.5459563,0.0024395005,0.054216836,0.08860541,0.0062022856,0.002069767,0.0019366378,0.0015742352,0.296999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946516,0.00014983884,0.0008080364,0.0012761427,0.002452828,0.0006615424],"domain_scores_gemma":[0.99546933,0.00085235765,0.00021096019,0.0011440102,0.000200787,0.002122568],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008096579,0.0008572714,0.0008268112,0.00069934566,0.00016852723,0.00025562098,0.00095612096,0.00057219353,0.0007583317],"category_scores_gemma":[0.00019965891,0.00079050177,0.0002264384,0.0002817504,0.00032922192,0.00020698577,0.00057269906,0.0015406305,0.00020201545],"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.0016751428,0.0026493417,0.000026123067,0.00056289154,0.0012161643,0.007093794,0.0004298395,0.008816729,0.00010075845,0.58848786,0.21844502,0.17049634],"study_design_scores_gemma":[0.0006803092,0.00028439745,0.000057809,0.0016484031,0.00007941604,0.00003054867,9.589515e-7,0.62122446,0.000032750035,0.0012357451,0.373914,0.00081118575],"about_ca_topic_score_codex":0.000014031024,"about_ca_topic_score_gemma":0.000014648391,"teacher_disagreement_score":0.68629444,"about_ca_system_score_codex":0.0001218906,"about_ca_system_score_gemma":0.00033599048,"threshold_uncertainty_score":0.9994546},"labels":[],"label_agreement":null},{"id":"W2476671745","doi":"10.1049/iet-com.2015.0954","title":"NDA SNR estimation using fourth‐order cross‐moments in time‐varying single‐input multiple‐output channels","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Blind Source Separation 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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Order (exchange); Algorithm; Mathematics; Statistics; Control theory (sociology); Artificial intelligence","score_opus":0.07622557198034358,"score_gpt":0.33753516576554593,"score_spread":0.26130959378520235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476671745","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.08114822,0.00006900217,0.9120548,0.004566676,0.000105069215,0.0004148612,0.000008587732,0.00048318837,0.0011496074],"genre_scores_gemma":[0.6514876,0.000026027394,0.347874,0.00022768795,0.000014251962,0.000056289166,0.000013081893,0.000016254942,0.0002848489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825865,0.0002950862,0.00048972917,0.00033561146,0.00031514117,0.00030578484],"domain_scores_gemma":[0.9965139,0.00055785413,0.00023178836,0.0023742518,0.00024062415,0.0000815753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007165143,0.00017949451,0.00018945792,0.00031849183,0.00035573277,0.0004082553,0.002458889,0.00011998688,0.000015660136],"category_scores_gemma":[0.0003548096,0.00016190739,0.000058637215,0.0007339501,0.00015197607,0.0015156112,0.0010843341,0.00019787395,0.00013403514],"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.000096156495,0.0055458937,0.063146256,0.00010683461,0.00027935317,0.000019888448,0.050658382,0.09605177,0.3043356,0.048774987,0.0032220865,0.4277628],"study_design_scores_gemma":[0.00089883566,0.000049897924,0.002593262,0.00023891224,0.000006453159,0.000011107385,0.000013548822,0.97818154,0.009451499,0.0052552153,0.002933842,0.0003659055],"about_ca_topic_score_codex":0.00010613878,"about_ca_topic_score_gemma":0.00003359796,"teacher_disagreement_score":0.8821297,"about_ca_system_score_codex":0.00022725604,"about_ca_system_score_gemma":0.00011495913,"threshold_uncertainty_score":0.66023916},"labels":[],"label_agreement":null},{"id":"W2484590830","doi":"10.1007/978-3-319-41501-7_28","title":"Multinomial Sequence Based Estimation Using Contiguous Subsequences of Length Three","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Multinomial distribution; Sequence (biology); Algorithm; Computer science; Bayesian probability; Binomial (polynomial); Convergence (economics); Field (mathematics); Set (abstract data type); Mathematics; Statistics; Artificial intelligence","score_opus":0.047042115946008455,"score_gpt":0.29384706124633914,"score_spread":0.24680494530033067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2484590830","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.0008939461,0.00009189009,0.99617606,0.00042276288,0.0005312347,0.0005122774,0.000009020456,0.0002551897,0.0011075941],"genre_scores_gemma":[0.40027735,0.000005204372,0.5992219,0.00035878856,0.00008618968,0.000005394699,0.0000020068546,0.000018650358,0.000024513205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644053,0.00007020238,0.00075725943,0.0012111551,0.0010398638,0.0004810091],"domain_scores_gemma":[0.9967861,0.0006139532,0.0007544528,0.0012626379,0.00046384073,0.00011899393],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013087476,0.0004743647,0.00058897934,0.00093683775,0.00017488892,0.00030758904,0.0028681983,0.00035836967,0.00001641785],"category_scores_gemma":[0.00017450149,0.00039641926,0.00014494649,0.0004733935,0.0011918336,0.001085654,0.0005412266,0.00046960404,0.000009882878],"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.000013253438,0.000034524994,0.00019026226,0.00006021143,0.00001189752,0.00004045497,0.0005103978,0.08452941,0.005600727,0.06540437,0.0000041259686,0.8436004],"study_design_scores_gemma":[0.00024390566,0.00013563664,0.000052821655,0.0005653976,0.0000063330363,0.000020917407,5.1222298e-8,0.8619778,0.021292763,0.11520102,0.00006615143,0.00043718735],"about_ca_topic_score_codex":0.0000841849,"about_ca_topic_score_gemma":0.0001397079,"teacher_disagreement_score":0.8431632,"about_ca_system_score_codex":0.00034397197,"about_ca_system_score_gemma":0.0012956932,"threshold_uncertainty_score":0.9998488},"labels":[],"label_agreement":null},{"id":"W2508533112","doi":"10.1016/j.neuroimage.2016.08.044","title":"Complex patterns of spatially extended generators of epileptic activity: Comparison of source localization methods cMEM and 4-ExSo-MUSIC on high resolution EEG and MEG data","year":2016,"lang":"en","type":"article","venue":"NeuroImage","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; École de Technologie Supérieure; Montreal Neurological Institute and Hospital; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Epilepsy Society; Savoy Foundation","keywords":"Electroencephalography; Magnetoencephalography; Neuroscience; High resolution; Computer science; Pattern recognition (psychology); Artificial intelligence; Psychology; Geography; Remote sensing","score_opus":0.09785730437799431,"score_gpt":0.36164071950031274,"score_spread":0.2637834151223184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508533112","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.36603278,0.000015704669,0.6334885,0.00017978577,0.000034023135,0.00014339412,0.00002947475,0.0000470271,0.000029324814],"genre_scores_gemma":[0.9255279,0.000030318652,0.07428584,0.000106668216,0.000012483579,0.0000030975455,0.000011610753,0.000013314067,0.00000881863],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980015,0.00067868776,0.000418139,0.00046708478,0.0002996678,0.00013488848],"domain_scores_gemma":[0.99802065,0.00035745226,0.00048547587,0.0009581501,0.00012309256,0.000055188462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065297895,0.00014540464,0.00036581614,0.0001856779,0.000050561575,0.000032137712,0.00047813656,0.00006999053,0.00000843001],"category_scores_gemma":[0.00017004133,0.00011939788,0.000025769825,0.00020529304,0.00015116688,0.00043986525,0.0005018041,0.000088207504,4.2463782e-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.00006038663,0.0002495231,0.0049129403,0.00010802634,0.000019530531,0.0000012858121,0.00082914665,0.00021468574,0.700712,0.0056326822,0.00031414573,0.2869456],"study_design_scores_gemma":[0.0007011616,0.00075451,0.13235615,0.000106017724,0.000030499385,0.0000046797873,0.000015850768,0.3105655,0.55407286,0.00070964306,0.00048798314,0.00019515111],"about_ca_topic_score_codex":0.00012344425,"about_ca_topic_score_gemma":0.000040030733,"teacher_disagreement_score":0.5594951,"about_ca_system_score_codex":0.000013270745,"about_ca_system_score_gemma":0.000035021552,"threshold_uncertainty_score":0.48689044},"labels":[],"label_agreement":null},{"id":"W2512268460","doi":"10.1190/segam2016-13878249.1","title":"Time-jittered marine acquisition: A rank-minimization approach for 5D source separation","year":2016,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","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; SENAI CIMATEC; BG Group","keywords":"Minification; Computer science; Rank (graph theory); Algorithm; Mathematics; Combinatorics; World Wide Web","score_opus":0.01879560533362648,"score_gpt":0.2622892988837976,"score_spread":0.24349369355017111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512268460","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.0010410094,0.000004636145,0.98311055,0.003109564,0.00004329661,0.0006129559,0.0000029595124,0.00091353984,0.011161478],"genre_scores_gemma":[0.18094061,0.000005855508,0.7938674,0.0021034954,0.000149768,0.00027737027,0.00008667384,0.000022869735,0.022545943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877316,0.00010540887,0.00028216574,0.0004168165,0.0002199165,0.0002025475],"domain_scores_gemma":[0.99900997,0.00013032819,0.00012369367,0.00048161903,0.0001891529,0.00006525375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042986358,0.00014494626,0.00015213121,0.00013706193,0.00011723641,0.00016183857,0.00042040567,0.000103448256,0.00018058218],"category_scores_gemma":[0.000038238188,0.00010390364,0.00007737538,0.00025156824,0.000037706992,0.00092947105,0.00014964148,0.000036819318,0.00009599568],"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.00030671764,0.00074342097,0.0005389205,0.000084966945,0.00012085251,0.0000018175892,0.0033555923,0.001977104,0.048404306,0.3565489,0.18153429,0.4063831],"study_design_scores_gemma":[0.0024326222,0.00038307573,0.00064841396,0.000022295219,0.000017680004,0.000025762167,0.000025019815,0.8796834,0.06327173,0.0140254935,0.038845073,0.00061947346],"about_ca_topic_score_codex":0.0000030629765,"about_ca_topic_score_gemma":9.3322717e-7,"teacher_disagreement_score":0.8777062,"about_ca_system_score_codex":0.000047480506,"about_ca_system_score_gemma":0.000043875505,"threshold_uncertainty_score":0.42370677},"labels":[],"label_agreement":null},{"id":"W2529237564","doi":"10.1007/s11336-016-9521-1","title":"Functional Generalized Structured Component Analysis","year":2016,"lang":"en","type":"article","venue":"Psychometrika","topic":"Blind Source Separation 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","funders":"National Institute on Drug Abuse","keywords":"Functional data analysis; Component (thermodynamics); Mathematics; Component analysis; Function (biology); Multivariate statistics; Structural equation modeling; Computer science; Applied mathematics; Econometrics; Algorithm; Statistics; Biology","score_opus":0.030168921483324906,"score_gpt":0.2799234535781663,"score_spread":0.24975453209484139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529237564","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.047710076,0.00009682208,0.94689727,0.0033221878,0.0003158029,0.000094808245,0.000006509001,0.00042566174,0.001130868],"genre_scores_gemma":[0.9224433,0.00003574887,0.07562117,0.0008310917,0.00006597029,0.000019920242,0.000007713141,0.0000069881444,0.0009680939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9986432,0.00010654784,0.00024282037,0.0003981003,0.00041707986,0.00019224106],"domain_scores_gemma":[0.9988403,0.00017235788,0.000107831926,0.00066503475,0.000112437934,0.00010206407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003425866,0.00012265246,0.00019715239,0.0012634719,0.00007081772,0.000111312336,0.0005444137,0.000064180516,0.0004444835],"category_scores_gemma":[0.00006748401,0.00008112801,0.00017983845,0.0034934948,0.00003210861,0.00032489683,0.0000804753,0.000062481144,0.00011540994],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008327237,0.00033352373,0.04126111,0.000007191523,0.001545348,0.0000063114926,0.00048043736,0.0001933764,0.06379541,0.5693951,0.06809408,0.2548048],"study_design_scores_gemma":[0.0024909303,0.0001434492,0.79701644,0.000010639709,0.00013138242,0.000013407275,0.000006793647,0.0037871567,0.03586858,0.0358263,0.12398247,0.00072247547],"about_ca_topic_score_codex":0.000010135987,"about_ca_topic_score_gemma":0.00000846659,"teacher_disagreement_score":0.8747332,"about_ca_system_score_codex":0.000049530714,"about_ca_system_score_gemma":0.000023358894,"threshold_uncertainty_score":0.48667827},"labels":[],"label_agreement":null},{"id":"W2534464262","doi":"10.1109/nnsp.2003.1318038","title":"Blind signal separation by matching pursuit based grouping","year":2004,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Matching pursuit; Speech recognition; Computer science; SIGNAL (programming language); Psychoacoustics; Intelligibility (philosophy); Pattern recognition (psychology); Speech enhancement; Artificial intelligence; Speech processing; Gaussian; Matching (statistics); Signal processing; Mathematics; Noise reduction; Statistics; Telecommunications; Compressed sensing; Physics","score_opus":0.01688970761444992,"score_gpt":0.28704629079523003,"score_spread":0.2701565831807801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2534464262","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.016686104,0.00001892972,0.97235787,0.0035559603,0.000049006274,0.00017481718,9.822829e-7,0.0007920684,0.00636427],"genre_scores_gemma":[0.7636416,0.0000010465867,0.23283893,0.0032469644,0.000023382518,0.000017409684,0.000012052914,0.0000074581044,0.00021116162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989238,0.000052547908,0.00020747325,0.00029434255,0.0003350997,0.00018673822],"domain_scores_gemma":[0.9994743,0.000043014177,0.000073288094,0.00028806564,0.00005364608,0.000067671666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044921416,0.00011384321,0.0000970783,0.00011175452,0.00012828948,0.0004492646,0.0005413348,0.00007101118,0.00004905281],"category_scores_gemma":[0.00000727446,0.0001094816,0.000047205336,0.00029739505,0.000017626728,0.0009635308,0.00007624844,0.00012917287,0.00010623333],"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.000024351204,0.00035575216,0.000082791375,0.000019404337,0.000022545286,0.000012305238,0.00310395,0.023502333,0.16141383,0.7827337,0.011524302,0.017204782],"study_design_scores_gemma":[0.002757512,0.00039156034,0.00029308192,0.000071244554,0.00000968729,0.000017746286,0.000088756504,0.17798044,0.6758799,0.12935016,0.012237492,0.00092241575],"about_ca_topic_score_codex":0.000076036515,"about_ca_topic_score_gemma":0.000019429533,"teacher_disagreement_score":0.7469555,"about_ca_system_score_codex":0.00006734886,"about_ca_system_score_gemma":0.000093137525,"threshold_uncertainty_score":0.44645303},"labels":[],"label_agreement":null},{"id":"W2539318712","doi":"10.1109/ssp.2003.1289439","title":"Channel identification and tracking using alternating projections","year":2004,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McMaster University","funders":"","keywords":"Expectation–maximization algorithm; Tracking (education); Iterative method; Channel (broadcasting); Identification (biology); Maximization; Maximum likelihood; Algorithm; Computer science; MIMO; Mathematics; Mathematical optimization; Statistics; Telecommunications","score_opus":0.05451436857650894,"score_gpt":0.3218943076687749,"score_spread":0.267379939092266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539318712","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.12070009,0.000011271132,0.8775689,0.0005823994,0.000055329332,0.00009880248,1.226179e-7,0.0003185282,0.00066453364],"genre_scores_gemma":[0.87524766,0.0000036207837,0.12451562,0.00014453726,0.000020531943,0.0000061759933,3.4967016e-7,0.0000032792445,0.000058222842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995244,0.000016559887,0.00012170826,0.00016795709,0.00009224616,0.00007714302],"domain_scores_gemma":[0.99971795,0.000010405549,0.000056140863,0.00014199264,0.00005209729,0.000021394695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002217813,0.000045231285,0.00003959129,0.00010211447,0.00013931877,0.00027428675,0.00013452079,0.000022672282,8.1610824e-7],"category_scores_gemma":[0.000019645791,0.00004455868,0.000012710007,0.00019103511,0.000012710072,0.00080292707,0.00005369703,0.000052333646,0.0000026908015],"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.0000014083475,0.00013168876,0.0003221525,0.000022678134,0.000018636047,0.0000047668714,0.015502301,0.0146937985,0.10345215,0.8333112,0.000037891146,0.032501332],"study_design_scores_gemma":[0.00034485586,0.00004579961,0.0034193005,0.000050587092,0.0000057658394,0.00012537594,0.0002981381,0.5341764,0.37203085,0.08906245,0.00015231845,0.0002881075],"about_ca_topic_score_codex":0.00013516878,"about_ca_topic_score_gemma":0.00001900289,"teacher_disagreement_score":0.7545476,"about_ca_system_score_codex":0.000030306723,"about_ca_system_score_gemma":0.000027566817,"threshold_uncertainty_score":0.26449534},"labels":[],"label_agreement":null},{"id":"W2539490917","doi":"10.1109/icics.2007.4449841","title":"Construction of discriminative positive time-frequency distributions","year":2007,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Discriminative model; Instantaneous phase; Time–frequency analysis; SIGNAL (programming language); Computer science; Feature extraction; Pattern recognition (psychology); Artificial intelligence; Feature (linguistics); Signal processing; Process (computing); Energy (signal processing); Point (geometry); Speech recognition; Mathematics; Computer vision; Statistics; Telecommunications","score_opus":0.008305820444832128,"score_gpt":0.264159051798063,"score_spread":0.25585323135323085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539490917","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.009136615,0.0000062143536,0.9153455,0.0005973732,0.000037191367,0.000103936094,0.000010577524,0.00018395761,0.074578635],"genre_scores_gemma":[0.67104197,0.0000012721424,0.3286775,0.00006457358,0.0000074802847,0.000002294604,0.00001055033,0.0000019386446,0.00019241848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99936897,0.000040507584,0.00019191083,0.00014514035,0.00014006792,0.00011340717],"domain_scores_gemma":[0.999361,0.00009844604,0.000090326714,0.00020600123,0.00020414613,0.000040082123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033145992,0.00006252839,0.000083786224,0.00009537083,0.000056309753,0.000024379631,0.00022891066,0.00004117494,0.000034995563],"category_scores_gemma":[0.000043222703,0.000055596207,0.000039245147,0.0003285479,0.00011493043,0.00042051994,0.00006452938,0.000066657485,0.00002119909],"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.0000013021677,0.0000317827,0.00014031533,0.000001018766,0.0000052723294,9.583689e-7,0.00047086467,3.0410632e-7,0.0058392566,0.98506945,0.00015964368,0.008279837],"study_design_scores_gemma":[0.00015972128,0.00017291687,0.017844979,0.000017548766,0.0000074419913,0.000030725634,0.00019262564,0.001181148,0.79890543,0.18115737,0.00015876404,0.00017135013],"about_ca_topic_score_codex":0.000038440456,"about_ca_topic_score_gemma":0.000008295545,"teacher_disagreement_score":0.8039121,"about_ca_system_score_codex":0.00004047054,"about_ca_system_score_gemma":0.000038866,"threshold_uncertainty_score":0.22671475},"labels":[],"label_agreement":null},{"id":"W2541906428","doi":"10.1109/mlsp.2006.275520","title":"A Joint Probabilistic-Deterministic Approach using Source-Filter Modeling of Speech Signal for Single Channel Speech Separation","year":2006,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Vocal tract; Speech recognition; Source separation; Computer science; Estimator; Probability density function; Underdetermined system; Speech enhancement; Speech processing; Speech coding; SIGNAL (programming language); Probabilistic logic; Blind signal separation; Channel (broadcasting); Filter (signal processing); Algorithm; Artificial intelligence; Mathematics; Statistics; Telecommunications","score_opus":0.08117880545204699,"score_gpt":0.2894523402036794,"score_spread":0.2082735347516324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2541906428","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.030591551,0.00001301949,0.96312153,0.00008066062,0.000055272503,0.0008936965,0.0000049196997,0.00035200702,0.004887365],"genre_scores_gemma":[0.5652488,1.8566278e-7,0.43433625,0.0000573125,0.000100732614,0.00003576231,0.0000119466595,0.00001630317,0.00019272571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979639,0.00010571728,0.00068049086,0.0005353187,0.0003773801,0.000337162],"domain_scores_gemma":[0.9987741,0.00008899282,0.00025082185,0.00047047352,0.00035727015,0.000058342328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084240036,0.0002305281,0.00032828664,0.00024361495,0.00013188858,0.00022332378,0.00042484212,0.00013706573,0.0000068385266],"category_scores_gemma":[0.000055460398,0.00021780562,0.00014803739,0.000316127,0.00005530161,0.000471617,0.00014536883,0.00010920347,0.0000029707558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004488308,0.0008408416,0.000014172224,0.000295098,0.00002774259,0.0000044146136,0.0013533982,0.812289,0.1249504,0.05069325,0.00032052153,0.00916626],"study_design_scores_gemma":[0.00023982841,0.00014663789,0.000001927999,0.000025355157,0.000015003863,0.00005097411,0.000041274187,0.8888233,0.08492011,0.025457995,0.000044355093,0.00023324369],"about_ca_topic_score_codex":0.0001421801,"about_ca_topic_score_gemma":0.000012618322,"teacher_disagreement_score":0.53465724,"about_ca_system_score_codex":0.00008953482,"about_ca_system_score_gemma":0.000111211855,"threshold_uncertainty_score":0.88818556},"labels":[],"label_agreement":null},{"id":"W2543675273","doi":"10.1109/iembs.2004.1404261","title":"A new adaptive technique of estimation of steady state auditory evoked potentials","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":8,"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":"University of Toronto","keywords":"Computer science; Noise (video); Steady state (chemistry); SIGNAL (programming language); Process (computing); Signal processing; Auditory system; Speech recognition; Noise measurement; Noise reduction; Reduction (mathematics); Nonlinear system; Estimation; Adaptive filter; Artificial intelligence; Audiology; Engineering; Algorithm; Mathematics; Telecommunications; Physics","score_opus":0.014541984385094435,"score_gpt":0.26891855060284214,"score_spread":0.25437656621774773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2543675273","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.001898697,0.00001761815,0.9918244,0.00028380295,0.00003864222,0.00035670554,0.0000021205394,0.00028037923,0.0052976697],"genre_scores_gemma":[0.47934288,0.0000031519041,0.51987755,0.00004407054,0.000014225424,0.00001037953,7.224153e-7,0.0000036468543,0.00070336025],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989623,0.00009067297,0.0003829869,0.00017960537,0.00027788477,0.0001065405],"domain_scores_gemma":[0.9990725,0.000058327292,0.00028069926,0.00037785433,0.00016146213,0.000049139035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043839254,0.00009098443,0.00017937682,0.0001860223,0.000019068048,0.000019622737,0.00041509952,0.00005985666,0.000041361858],"category_scores_gemma":[0.000025266281,0.00008413913,0.000054407952,0.00026451313,0.000032481632,0.00060993206,0.000104805265,0.00007297531,0.000011391317],"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.00004852998,0.00029801478,0.000024271538,0.000035639445,0.0000672419,0.0000016980192,0.004922553,0.025593938,0.1569894,0.3220478,0.023240574,0.46673033],"study_design_scores_gemma":[0.00018710933,0.00021329253,0.00030599665,0.000034740107,0.000005117377,0.0000028946217,0.000020308262,0.11950145,0.8557794,0.02325879,0.000569733,0.000121147954],"about_ca_topic_score_codex":0.00013402957,"about_ca_topic_score_gemma":0.00002061221,"teacher_disagreement_score":0.69879,"about_ca_system_score_codex":0.000032661897,"about_ca_system_score_gemma":0.0001945878,"threshold_uncertainty_score":0.3431094},"labels":[],"label_agreement":null},{"id":"W2545892904","doi":"10.1109/iembs.2004.1403333","title":"Dipole localization using beamforming and RAP-MUSIC on simulated intracerebral recordings","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Université de Montréal; McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Beamforming; Dipole; Focus (optics); Computer science; Orientation (vector space); Multiple signal classification; SIGNAL (programming language); Acoustics; Artificial intelligence; Speech recognition; Physics; Pattern recognition (psychology); Mathematics; Optics; Telecommunications; Antenna (radio); Geometry","score_opus":0.024326808685384907,"score_gpt":0.26694218859964075,"score_spread":0.24261537991425586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2545892904","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.20295721,0.000012266578,0.79441035,0.0005345109,0.0000379862,0.000107290056,1.5965152e-7,0.00038422598,0.0015559846],"genre_scores_gemma":[0.8494209,0.000004198856,0.14829594,0.0020808384,0.00004262363,0.0000010425739,0.0000013921324,0.0000075415223,0.00014549716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927235,0.000035257643,0.00017610285,0.00023365008,0.00013459966,0.00014801454],"domain_scores_gemma":[0.9995974,0.000042911506,0.00006446797,0.00019546703,0.000046641348,0.00005314396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002228694,0.000095872005,0.00009162501,0.00013981448,0.00011783251,0.0001857297,0.00016406889,0.00006445932,0.000035507048],"category_scores_gemma":[0.000023211735,0.00008829802,0.000020007426,0.00027970975,0.000022582917,0.00086537603,0.000089444475,0.00008804127,0.00001687454],"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.00003263543,0.00022860173,0.0023715768,0.000026105028,0.000036828063,0.000003842345,0.009684444,0.18446212,0.009910466,0.21775101,0.0033547862,0.5721376],"study_design_scores_gemma":[0.00015545687,0.00005538221,0.00006660071,0.000017902383,0.0000022105035,0.0000060772795,0.000026779704,0.9716053,0.022102566,0.0014720733,0.00436626,0.00012341767],"about_ca_topic_score_codex":0.000043941298,"about_ca_topic_score_gemma":0.000013851839,"teacher_disagreement_score":0.7871432,"about_ca_system_score_codex":0.00004637658,"about_ca_system_score_gemma":0.000021445727,"threshold_uncertainty_score":0.3600689},"labels":[],"label_agreement":null},{"id":"W2546159266","doi":"10.1109/iembs.2004.1403176","title":"Removal of EMG and ECG artifacts from EEG based on wavelet transform and ICA","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":83,"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; Montreal Neurological Institute and Hospital","funders":"","keywords":"Independent component analysis; Pattern recognition (psychology); Electroencephalography; Higher-order statistics; Wavelet transform; Wavelet; Artificial intelligence; Computer science; Signal processing; Speech recognition; Discrete wavelet transform; SIGNAL (programming language); Digital signal processing","score_opus":0.012188810647855283,"score_gpt":0.24014281144927566,"score_spread":0.22795400080142036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546159266","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.1663253,0.000027483593,0.80644983,0.0067529655,0.000013271012,0.00013243717,0.0000033693975,0.00016915187,0.020126168],"genre_scores_gemma":[0.7181241,0.000008908874,0.28037295,0.0013468087,0.0000073215438,0.0000017348499,0.0000013534861,0.000002892688,0.00013393023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993909,0.000027300133,0.00014498872,0.00019766529,0.00014705477,0.000092079346],"domain_scores_gemma":[0.9995884,0.00008474381,0.000032542965,0.00021206832,0.000023436713,0.000058841597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015819624,0.000074949814,0.000106528314,0.00006716385,0.0000299654,0.000052551757,0.00013483042,0.000050319435,0.00003600084],"category_scores_gemma":[0.000009944407,0.00006197228,0.000019321056,0.00007983529,0.000035207406,0.00023150165,0.000023154184,0.00006408689,0.000005025571],"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.00003279603,0.00013019909,0.0001175726,0.000010035643,0.000009882816,0.000010800273,0.0018281104,0.00004831245,0.007349361,0.044463355,0.0010453165,0.9449543],"study_design_scores_gemma":[0.00061864866,0.00025438666,0.005048029,0.000025649138,0.0000048167044,0.000013472094,0.000020944382,0.7106383,0.2592004,0.0067144027,0.017269058,0.00019192214],"about_ca_topic_score_codex":0.000043125263,"about_ca_topic_score_gemma":0.000052958203,"teacher_disagreement_score":0.94476235,"about_ca_system_score_codex":0.000008043787,"about_ca_system_score_gemma":0.000023627117,"threshold_uncertainty_score":0.25271562},"labels":[],"label_agreement":null},{"id":"W2547989445","doi":"10.1109/ccece.2016.7726773","title":"Independent component analysis for feature reduction in critical clearing time estimation","year":2016,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"École de Technologie Supérieure","funders":"","keywords":"Principal component analysis; Independent component analysis; Computer science; Artificial neural network; Electric power system; Dimensionality reduction; Artificial intelligence; Control theory (sociology); Pattern recognition (psychology); Power (physics)","score_opus":0.024320788974239536,"score_gpt":0.3210293157457861,"score_spread":0.2967085267715465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547989445","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.012639528,0.000004190732,0.97837687,0.008190927,0.00004087462,0.00015756114,0.0000014737731,0.00016342785,0.00042514925],"genre_scores_gemma":[0.77599406,7.3169224e-7,0.22351728,0.00007875159,0.0000125762845,0.000021958349,0.0000045040797,0.000003074389,0.00036708228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992468,0.00005563783,0.00015622051,0.00025042825,0.00016447254,0.0001264461],"domain_scores_gemma":[0.9995005,0.000116334544,0.0000349621,0.0002385973,0.00007164542,0.00003792769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004294632,0.00006475258,0.000116462346,0.00030915855,0.000041662566,0.00008812045,0.0002031717,0.00007085975,0.000020020618],"category_scores_gemma":[0.000079760306,0.000047075013,0.00006257651,0.0003913562,0.000018319297,0.00054513966,0.00006282298,0.000056041157,0.00001945666],"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.00006149974,0.00043837406,0.002426818,0.000024691788,0.00016479874,0.000004641085,0.001603541,0.0064436477,0.08571671,0.74529946,0.0046454472,0.15317038],"study_design_scores_gemma":[0.00038739617,0.00009477251,0.024446746,0.000023445475,0.000031199834,0.000007676245,0.000013955782,0.8819478,0.06876929,0.023736114,0.00032461018,0.00021696536],"about_ca_topic_score_codex":0.000017048342,"about_ca_topic_score_gemma":0.00001113905,"teacher_disagreement_score":0.8755042,"about_ca_system_score_codex":0.0000790179,"about_ca_system_score_gemma":0.000017848304,"threshold_uncertainty_score":0.19196633},"labels":[],"label_agreement":null},{"id":"W2548189140","doi":"10.1109/isco.2016.7727065","title":"A novel method for automatic ICi selection in EEG signals","year":2016,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Royal College of Physicians and Surgeons of Canada","funders":"","keywords":"Computer science; Brain–computer interface; Electroencephalography; Selection (genetic algorithm); Artificial intelligence; Set (abstract data type); Field (mathematics); Pattern recognition (psychology); SIGNAL (programming language); Independent component analysis; Signal processing; Machine learning; Speech recognition; Mathematics; Digital signal processing; Psychology; Neuroscience","score_opus":0.03293809333894704,"score_gpt":0.3395652298715946,"score_spread":0.30662713653264756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548189140","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.0008840635,0.0000026666894,0.9941719,0.0026595383,0.000024075403,0.00029609862,5.613747e-7,0.0005305403,0.0014305254],"genre_scores_gemma":[0.11522939,6.4380885e-7,0.88281244,0.0007668813,0.000009192865,0.00010466355,1.3977348e-7,0.000004770715,0.0010718573],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993192,0.000059022826,0.0001801832,0.00020318474,0.00010127647,0.00013711124],"domain_scores_gemma":[0.99938947,0.00033869117,0.000052493582,0.00013228558,0.000060090246,0.000026981292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081575074,0.00006419413,0.0000974058,0.0001551926,0.000026444104,0.000053860058,0.00025352483,0.000049221344,0.000028182594],"category_scores_gemma":[0.000093067465,0.00004221457,0.0000341497,0.00028465327,0.0000064219357,0.00039813557,0.00004097085,0.000030052193,0.000015380514],"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.0000027034737,0.000081151025,0.00005643503,0.000008908192,0.0000059925346,1.587793e-7,0.00041285268,0.000034776574,0.49666587,0.3019718,0.0022781282,0.19848122],"study_design_scores_gemma":[0.0005693465,0.00014968535,0.0013214619,0.000034522065,0.0000020045638,0.000011881721,0.000007743159,0.69395953,0.25690162,0.043791216,0.0030881593,0.00016281172],"about_ca_topic_score_codex":0.000039324776,"about_ca_topic_score_gemma":0.00006264584,"teacher_disagreement_score":0.6939248,"about_ca_system_score_codex":0.000043807922,"about_ca_system_score_gemma":0.000050766528,"threshold_uncertainty_score":0.17214602},"labels":[],"label_agreement":null},{"id":"W2553278398","doi":"10.1109/ijcnn.2016.7727656","title":"Class-wise deep dictionaries for EEG classification","year":2016,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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 British Columbia","funders":"","keywords":"Autoencoder; Computer science; Artificial intelligence; MNIST database; Deep learning; Convolutional neural network; Pattern recognition (psychology); Benchmarking; Class (philosophy); Machine learning; Representation (politics); Deep belief network","score_opus":0.031002845963620018,"score_gpt":0.2819672417135008,"score_spread":0.2509643957498808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553278398","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.0006346209,0.0000114264685,0.9689354,0.019059218,0.00010965477,0.00020381405,0.0000015981387,0.00073560385,0.010308683],"genre_scores_gemma":[0.8174073,0.000014322751,0.17749946,0.0011471099,0.000038699578,0.00015633868,0.000002582248,0.0000069122893,0.0037272759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934405,0.000029659765,0.00014950932,0.0002277834,0.00012746717,0.000121555044],"domain_scores_gemma":[0.9992358,0.00017763318,0.000057926296,0.00035488483,0.00013143953,0.00004232138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002215179,0.000066979046,0.00006317625,0.000073989584,0.0000933822,0.00009976921,0.00033861859,0.000054813045,0.000028166838],"category_scores_gemma":[0.000070850874,0.00004317695,0.000043014024,0.00011805221,0.000039338658,0.00068677927,0.00005058546,0.000025874464,0.00006510093],"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.0000028099623,0.000016969012,0.000123715,0.0000012984904,0.000002931295,5.8162776e-8,0.00011193945,0.0000012461093,0.003569964,0.92963743,0.00784474,0.058686893],"study_design_scores_gemma":[0.00065223017,0.0001900336,0.0120251505,0.00001549249,0.0000055976943,0.000006057293,0.00005327947,0.09734102,0.03530603,0.24870867,0.6053706,0.00032585158],"about_ca_topic_score_codex":0.000002332031,"about_ca_topic_score_gemma":0.000012594948,"teacher_disagreement_score":0.8167727,"about_ca_system_score_codex":0.000037583963,"about_ca_system_score_gemma":0.000040997005,"threshold_uncertainty_score":0.1760705},"labels":[],"label_agreement":null},{"id":"W2581370027","doi":"","title":"Hybrid Time and Time-Frequency Blind Source Separation Towards Ambient System Identi cation of Structures","year":2010,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":2,"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":"Natural Sciences and Engineering Research Council of Canada; University Network of Excellence in Nuclear Engineering","keywords":"Blind signal separation; Separation (statistics); Computer science; Telecommunications; Machine learning","score_opus":0.006821240885864008,"score_gpt":0.2189950129033199,"score_spread":0.2121737720174559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581370027","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892024,0.00006662846,0.008894743,0.00021393233,0.00018270506,0.0005038498,0.000033488857,0.00023032489,0.0006719537],"genre_scores_gemma":[0.8277315,0.000046675344,0.033698037,0.000018417146,0.000051478524,0.000002139526,0.0010222374,0.00004056967,0.13738897],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99837554,0.00014530012,0.00027598502,0.0005021182,0.0005111112,0.00018994586],"domain_scores_gemma":[0.9980322,0.000028259414,0.0007653868,0.00059489504,0.000486172,0.000093069466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003600435,0.00026383268,0.00045900597,0.00052704534,0.00017761448,0.00009054855,0.0007803469,0.00034484264,0.000046001027],"category_scores_gemma":[0.000016383825,0.0003074363,0.00012849615,0.00022564411,0.000092591545,0.00075056497,0.00013151663,0.0003014709,0.000035300585],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003247844,0.000230099,0.00016254208,0.0017222385,0.00037320374,0.00003538517,0.2858305,0.00041489312,0.6656335,0.023411207,0.0029280786,0.018933564],"study_design_scores_gemma":[0.0033991025,0.0012201788,0.019169714,0.0012476678,0.00073134253,0.00011131875,0.029756779,0.089267924,0.8444092,0.007322436,0.0008828736,0.002481431],"about_ca_topic_score_codex":0.010752063,"about_ca_topic_score_gemma":0.002126665,"teacher_disagreement_score":0.2560737,"about_ca_system_score_codex":0.00008050498,"about_ca_system_score_gemma":0.0001804282,"threshold_uncertainty_score":0.9999378},"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":"W2588063580","doi":"10.1007/s11336-017-9558-9","title":"Functional Parallel Factor Analysis for Functions of One- and Two-dimensional Arguments","year":2017,"lang":"en","type":"article","venue":"Psychometrika","topic":"Blind Source Separation Techniques","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":"McGill University","funders":"","keywords":"Piecewise; Basis function; Functional data analysis; Basis (linear algebra); Mathematics; Transformation (genetics); Quadratic equation; Representation (politics); Function (biology); Algorithm; Set (abstract data type); Domain (mathematical analysis); Applied mathematics; Computer science; Mathematical analysis; Statistics; Geometry","score_opus":0.07998891546375167,"score_gpt":0.3360260429008373,"score_spread":0.2560371274370856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588063580","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.11099056,0.00008451525,0.8866516,0.0009741863,0.00023688037,0.00021392251,0.000040518953,0.00007569838,0.00073214766],"genre_scores_gemma":[0.90879124,0.000008205747,0.090098284,0.00015540484,0.00003931759,0.000044784763,0.000016629283,0.000005590639,0.0008405479],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99893165,0.000028027103,0.00023916451,0.00034644932,0.0003092282,0.00014548739],"domain_scores_gemma":[0.9985288,0.00021787288,0.00026770018,0.00070551987,0.00019632893,0.00008377751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030696185,0.00010433497,0.00021949175,0.00072854984,0.00031410978,0.00018599433,0.00041034495,0.00005380015,0.00006857553],"category_scores_gemma":[0.00017841085,0.00010067163,0.00014749225,0.0005573086,0.00006788875,0.00047979763,0.00011383395,0.000073743446,0.00000972908],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041914504,0.0022683404,0.6661449,0.00008586513,0.0053056483,0.0000015683798,0.0009967719,0.0033147598,0.009914266,0.17084272,0.021389438,0.11931657],"study_design_scores_gemma":[0.0013348274,0.00017335964,0.97600085,0.000008574835,0.000102753256,0.0000015751004,0.000006115818,0.010404407,0.0015206105,0.0073997825,0.0028427772,0.00020439274],"about_ca_topic_score_codex":0.000027327102,"about_ca_topic_score_gemma":0.000016824264,"teacher_disagreement_score":0.79780066,"about_ca_system_score_codex":0.000016487174,"about_ca_system_score_gemma":0.000030156341,"threshold_uncertainty_score":0.410527},"labels":[],"label_agreement":null},{"id":"W2594578343","doi":"10.6000/1929-6029.2017.06.01.2","title":"Model Based Sparse Feature Extraction for Biomedical Signal Classification","year":2017,"lang":"en","type":"article","venue":"International Journal of Statistics in Medical Research","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Pattern recognition (psychology); Principal component analysis; Sparse approximation; Artificial intelligence; Computer science; SIGNAL (programming language); Feature extraction; Feature (linguistics); Signal processing; Signal reconstruction","score_opus":0.19001712708026455,"score_gpt":0.5168197255182762,"score_spread":0.3268025984380116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594578343","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.0008157158,0.00001714117,0.9617935,0.036209628,0.00042987216,0.00013391541,0.000035770972,0.00001181616,0.00055262813],"genre_scores_gemma":[0.5952024,0.000078188954,0.40404594,0.00029292455,0.00024108416,0.000015977856,0.000013252349,0.000006887879,0.000103345716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951147,0.00022127411,0.0005090993,0.00020102263,0.003724153,0.0002297834],"domain_scores_gemma":[0.9950862,0.0016656702,0.00040566962,0.00029363995,0.002306622,0.00024221209],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0075963526,0.00008174354,0.000156729,0.00063485175,0.00016552566,0.00046733435,0.0027638339,0.00018971894,0.000057358175],"category_scores_gemma":[0.009648904,0.00007104731,0.000057012265,0.0001063855,0.00031059416,0.00055792765,0.00017904231,0.0010556432,0.0000052389573],"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.00026903776,0.0005976106,0.00042928415,0.000022161557,0.000039614304,0.0003608272,0.00029477003,0.00037650997,0.0018537802,0.5342694,0.056813322,0.40467367],"study_design_scores_gemma":[0.0008637286,0.00016377863,0.002179546,0.00012661748,0.000001871674,0.000036560366,0.000019549587,0.89343625,0.00047598485,0.094461896,0.00817117,0.00006303204],"about_ca_topic_score_codex":0.000016589478,"about_ca_topic_score_gemma":0.0000339126,"teacher_disagreement_score":0.89305973,"about_ca_system_score_codex":0.00023857498,"about_ca_system_score_gemma":0.0015005439,"threshold_uncertainty_score":0.9986932},"labels":[],"label_agreement":null},{"id":"W2607432382","doi":"10.1371/journal.pone.0172500","title":"Decoding the infant mind: Multivariate pattern analysis (MVPA) using fNIRS","year":2017,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":56,"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":"Eunice Kennedy Shriver National Institute of Child Health and Human Development; Canadian Institutes of Health Research; National Institutes of Health; National Science Foundation","keywords":"Decoding methods; Neuroimaging; Computer science; Multivariate statistics; Artificial intelligence; Neural decoding; Population; Psychology; Cognitive psychology; Machine learning; Neuroscience; Medicine","score_opus":0.11813393019224763,"score_gpt":0.31636718690292603,"score_spread":0.1982332567106784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607432382","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.44261342,0.0000117148975,0.5555021,0.0011155007,0.000021040712,0.000118255426,0.0000018847469,0.00008133122,0.0005347513],"genre_scores_gemma":[0.9066003,0.0000057102184,0.09294069,0.00031709555,0.000044054086,0.000011318117,0.000001215201,0.0000069437656,0.00007269242],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988707,0.00009725207,0.0002008436,0.0002950824,0.00034014788,0.00019601456],"domain_scores_gemma":[0.9980783,0.00008933941,0.00027261145,0.0014153406,0.00009212309,0.000052271072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056585326,0.000107546664,0.0002080781,0.00014648592,0.0005779965,0.0007494926,0.0013653681,0.000053233052,0.000020425217],"category_scores_gemma":[0.00013494951,0.00008160912,0.00009536122,0.0002074132,0.00005034473,0.000554467,0.00045111805,0.00015092622,0.000024771361],"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.000031427455,0.0033312284,0.5168309,0.00010689609,0.010114911,0.00010065058,0.04205977,0.002327032,0.2192294,0.01224692,0.00029644105,0.19332437],"study_design_scores_gemma":[0.00015022827,0.000020494987,0.0360796,0.000049583694,0.00028708848,0.000001028703,0.000020887062,0.8769418,0.0856438,0.00055525795,0.00005833495,0.00019190292],"about_ca_topic_score_codex":0.0006112507,"about_ca_topic_score_gemma":0.00020130626,"teacher_disagreement_score":0.8746148,"about_ca_system_score_codex":0.000031140935,"about_ca_system_score_gemma":0.00003037122,"threshold_uncertainty_score":0.72273743},"labels":[],"label_agreement":null},{"id":"W2619731291","doi":"","title":"Estimation et Reconstruction des Signaux Courts à Multicomposantes Modulées à la fois en Amplitude et en Fréquence","year":2005,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Blind Source Separation 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":"Hydro-Québec","funders":"","keywords":"Amplitude; Algorithm; Monte Carlo method; Nonlinear system; Maximization; Simulated annealing; SIGNAL (programming language); Computer science; Component (thermodynamics); Mathematics; Mathematical optimization; Physics; Statistics","score_opus":0.02015800334773297,"score_gpt":0.27439758542366016,"score_spread":0.2542395820759272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619731291","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.11526705,0.00083429413,0.83600366,0.029724808,0.00029696783,0.0008807056,0.00006393451,0.00097144174,0.015957106],"genre_scores_gemma":[0.4857859,0.0017267336,0.5099082,0.00029211884,0.000028377173,0.0001355813,0.00020706114,0.00005189436,0.00186415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.96913683,0.026423944,0.0012812717,0.0016346526,0.0008713451,0.00065196294],"domain_scores_gemma":[0.9857531,0.007153018,0.0012259217,0.002803909,0.0027312206,0.00033283446],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0177402,0.0007755363,0.00071586185,0.00047499067,0.0006668675,0.0023934285,0.0024028635,0.0008019782,0.0001170277],"category_scores_gemma":[0.0037252472,0.00089592946,0.00035671765,0.00062751526,0.0009135276,0.002082311,0.0020873253,0.0016527434,0.00011757622],"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.000012174489,0.00071067456,0.00074193004,0.00015670319,0.00008711352,0.000007601563,0.056937978,0.0080130575,0.008760038,0.6208441,0.00020018077,0.3035284],"study_design_scores_gemma":[0.00070743717,0.0000037048162,0.018326715,0.0051149707,0.000082172744,0.0002991981,0.0002778374,0.76179075,0.12478355,0.07729789,0.01010429,0.0012114709],"about_ca_topic_score_codex":0.0032085648,"about_ca_topic_score_gemma":0.0030190912,"teacher_disagreement_score":0.7537777,"about_ca_system_score_codex":0.0005638549,"about_ca_system_score_gemma":0.0009413285,"threshold_uncertainty_score":0.9993491},"labels":[],"label_agreement":null},{"id":"W2654966644","doi":"10.1109/ccece.2017.7946622","title":"A null space approach for complete and over-complete blind source separation of autoregressive source signals","year":2017,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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 Windsor","funders":"","keywords":"Blind signal separation; Autoregressive model; Non-negative matrix factorization; Source separation; Matrix decomposition; Matrix (chemical analysis); Algorithm; Null (SQL); Mathematics; Representation (politics); Gaussian; Applied mathematics; Computer science; Eigenvalues and eigenvectors; Speech recognition; Statistics; Physics; Telecommunications","score_opus":0.05721603076779215,"score_gpt":0.32890034293402215,"score_spread":0.27168431216623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2654966644","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.024293432,0.00005294787,0.9677753,0.00085823063,0.000041533727,0.00086485775,0.00001577494,0.00025492467,0.0058430303],"genre_scores_gemma":[0.70730716,0.000005734738,0.29010546,0.000312469,0.000059017228,0.00007868693,0.000014979132,0.000019202591,0.0020973224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983004,0.00010502302,0.00038134647,0.00057738554,0.00034442564,0.00029144718],"domain_scores_gemma":[0.997652,0.0002220111,0.0006855232,0.0011078648,0.00021402737,0.00011860903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006601391,0.0002361856,0.00038994796,0.00015834458,0.00051616435,0.0006316239,0.0011067564,0.00013492042,0.000011188835],"category_scores_gemma":[0.00012609293,0.00021203171,0.000117227086,0.00008347209,0.00022456948,0.00085308554,0.00042056493,0.00013531178,0.0000036494112],"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.000604995,0.0009525491,0.0073703076,0.0006190604,0.00044375495,0.0000059902645,0.0272675,0.0076385327,0.11956499,0.7423803,0.03483806,0.05831394],"study_design_scores_gemma":[0.0017011344,0.00034724583,0.0029091935,0.000042203286,0.000023807526,0.000016613114,0.000098661876,0.9417452,0.021704603,0.005376974,0.02559066,0.0004437057],"about_ca_topic_score_codex":0.00013430322,"about_ca_topic_score_gemma":0.000017654509,"teacher_disagreement_score":0.93410665,"about_ca_system_score_codex":0.000023312827,"about_ca_system_score_gemma":0.0000680187,"threshold_uncertainty_score":0.8646402},"labels":[],"label_agreement":null},{"id":"W2704243436","doi":"10.1016/j.compbiomed.2017.06.013","title":"Simultaneous ocular and muscle artifact removal from EEG data by exploiting diverse statistics","year":2017,"lang":"en","type":"article","venue":"Computers in Biology and Medicine","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; Swedish Orphan Biovitrum; National Natural Science Foundation of China","keywords":"Electroencephalography; Artifact (error); Computer science; Autocorrelation; Pattern recognition (psychology); Artificial intelligence; Higher-order statistics; Independent component analysis; Blind signal separation; Independence (probability theory); Noise (video); Speech recognition; Signal processing; Statistics; Mathematics; Channel (broadcasting); Neuroscience; Psychology; Image (mathematics); Digital signal processing","score_opus":0.047976809422945396,"score_gpt":0.35224372338561705,"score_spread":0.30426691396267164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2704243436","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.13507114,0.00055237644,0.86173177,0.0020443187,0.00028005196,0.000095177755,0.00004362866,0.00006547124,0.00011605454],"genre_scores_gemma":[0.8039133,0.00046081803,0.19406807,0.0013411503,0.00006890429,0.0000014384816,0.0001286242,0.0000042182946,0.000013462099],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990856,0.00009576026,0.00018037831,0.00042407954,0.0000648123,0.00014934584],"domain_scores_gemma":[0.99849373,0.0005214568,0.0001233156,0.0007621606,0.000024861904,0.00007449678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000414156,0.00010514282,0.00020570116,0.000051729236,0.00020165097,0.00005407757,0.0007649437,0.00008403303,0.000004245137],"category_scores_gemma":[0.00038738624,0.0000879809,0.000005166226,0.000029306239,0.00038525646,0.00022838544,0.00092250755,0.00015001028,0.000001423413],"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.000020407135,0.000050692666,0.008559487,0.00001622874,0.000037052778,0.00039434826,0.0027930613,0.000009201024,0.0050956733,0.023996787,0.012554971,0.9464721],"study_design_scores_gemma":[0.0032155758,0.0006622951,0.02975399,0.0003210266,0.000035601173,0.000101872945,0.00034354278,0.81450534,0.00046581382,0.073124886,0.07685948,0.00061058864],"about_ca_topic_score_codex":0.0002660675,"about_ca_topic_score_gemma":0.000040462208,"teacher_disagreement_score":0.9458615,"about_ca_system_score_codex":0.000008809662,"about_ca_system_score_gemma":0.000013733487,"threshold_uncertainty_score":0.3587757},"labels":[],"label_agreement":null},{"id":"W2750348520","doi":"10.1103/physrevlett.120.180501","title":"Three-Dimensional Color Code Thresholds via Statistical-Mechanical Mapping","year":2018,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institute for Quantum Information and Matter, California Institute of Technology; Gordon and Betty Moore Foundation; National Science Foundation","keywords":"Code (set theory); Computer science; Statistical physics; Physics; Programming language","score_opus":0.03288573477269288,"score_gpt":0.3179788787918186,"score_spread":0.28509314401912567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750348520","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.0094630495,0.00029381015,0.96517885,0.023980718,0.00012377212,0.0004018013,0.0000063063744,0.00035137017,0.00020034726],"genre_scores_gemma":[0.5365079,0.00012281779,0.26381922,0.19883353,0.0005114231,0.00014289463,0.000017892928,0.000034263467,0.0000100457355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815565,0.00013394393,0.00033347946,0.0005221604,0.0005145266,0.00034024837],"domain_scores_gemma":[0.9987,0.00028719445,0.00012273756,0.00062982255,0.000107019114,0.00015322615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048673362,0.00020303685,0.00038661112,0.000045188815,0.00012573948,0.00007897683,0.0007348702,0.000020747508,0.00005873482],"category_scores_gemma":[0.000092097776,0.0001696006,0.00012500412,0.00038748543,0.00017491914,0.00030562043,0.0003275162,0.00025029862,0.00064115704],"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.00001650632,0.00047913936,0.0000698748,0.000442532,0.000085058964,0.0000531132,0.00026943476,0.00002764715,0.085041076,0.6217057,0.24375945,0.048050467],"study_design_scores_gemma":[0.0006556396,0.000716439,0.0018373025,0.00199797,0.000083654864,0.00007746644,0.000001671784,0.7460454,0.01023147,0.09315833,0.1437944,0.0014002118],"about_ca_topic_score_codex":0.000010565411,"about_ca_topic_score_gemma":0.000008626813,"teacher_disagreement_score":0.7460178,"about_ca_system_score_codex":0.000047462658,"about_ca_system_score_gemma":0.000042689026,"threshold_uncertainty_score":0.824099},"labels":[],"label_agreement":null},{"id":"W2750960820","doi":"10.1016/j.jeconom.2017.08.002","title":"Double instrumental variable estimation of interaction models with big data","year":2017,"lang":"en","type":"article","venue":"Journal of Econometrics","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Instrumental variable; Principal component analysis; Mathematics; Matrix (chemical analysis); Data Matrix; Variable (mathematics); Algorithm; Statistics; Applied mathematics; Computer science; Mathematical analysis","score_opus":0.3371485109574406,"score_gpt":0.32446649197848404,"score_spread":0.012682018978956544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750960820","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.0608887,0.000025268888,0.93330497,0.00024666128,0.00032998063,0.00005459145,0.0000040441705,0.000010583347,0.0051351967],"genre_scores_gemma":[0.7532698,0.00002934893,0.24660659,0.000026462129,0.000036659894,4.7042283e-7,0.0000022372137,0.0000032450537,0.000025204896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992641,0.000015314987,0.00037081345,0.000114536924,0.0001644173,0.00007077152],"domain_scores_gemma":[0.9976651,0.000042464806,0.0013362976,0.00074812246,0.00016219815,0.000045800007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008419921,0.00005942213,0.00016064977,0.00059488777,0.00008233298,0.00035880593,0.0013693103,0.00003564777,0.000005231509],"category_scores_gemma":[0.00008801555,0.000049691516,0.000023752636,0.00028246208,0.000025718078,0.005781951,0.00027687018,0.00013151253,0.0000015120276],"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.00030982855,0.00078695524,0.0061414526,0.00008936222,0.00029570903,0.000014328642,0.0013364331,0.17448708,0.00026739415,0.2835567,0.002672448,0.5300423],"study_design_scores_gemma":[0.0012539412,0.00048970786,0.0013039259,0.000076004115,0.000021136222,0.00013195159,0.000047315545,0.9745382,0.004717302,0.015624714,0.0016611469,0.00013462659],"about_ca_topic_score_codex":0.000036990954,"about_ca_topic_score_gemma":0.000004721303,"teacher_disagreement_score":0.80005115,"about_ca_system_score_codex":0.000058978476,"about_ca_system_score_gemma":0.00013500504,"threshold_uncertainty_score":0.41917747},"labels":[],"label_agreement":null},{"id":"W2752254399","doi":"10.1109/sampta.2017.8024457","title":"Estimation of varying bandwidth from multiple level crossings of stochastic signals","year":2017,"lang":"en","type":"article","venue":"","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":"University of Manitoba","funders":"","keywords":"Bandlimiting; Bandwidth (computing); Computer science; Convolution (computer science); Gaussian; Algorithm; Mathematics; Mathematical optimization; Fourier transform; Telecommunications; Artificial intelligence; Mathematical analysis","score_opus":0.06606900016935754,"score_gpt":0.3202017375131058,"score_spread":0.2541327373437483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752254399","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.11041498,0.000009141719,0.8880854,0.00015787265,0.000040943076,0.000096999924,0.0000075159865,0.00007925102,0.0011078855],"genre_scores_gemma":[0.7080247,2.43671e-7,0.29182252,0.000039412113,0.0000059617023,0.0000030609103,0.0000018089765,0.0000031101779,0.000099170975],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999262,0.000025540367,0.00025573137,0.00016892493,0.00020234723,0.0000854558],"domain_scores_gemma":[0.99868745,0.00019226385,0.00037083548,0.0006120754,0.0001077223,0.00002964763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002653192,0.00007142052,0.00015660077,0.00006362708,0.00014707842,0.00018676482,0.0006914443,0.000048003174,0.000019207959],"category_scores_gemma":[0.00029243747,0.00006462066,0.00004177055,0.00004787856,0.00009027927,0.0007782103,0.00017652336,0.000050200335,0.000004641718],"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.00007313182,0.0005115506,0.0038379938,0.000099591176,0.00011236936,0.0000034990398,0.01893445,0.06868601,0.42416254,0.076701276,0.0015479669,0.40532964],"study_design_scores_gemma":[0.00023315422,0.000030797837,0.0064359764,0.000044209013,0.0000031039963,3.7932412e-7,0.000005190138,0.69821626,0.2836801,0.011277331,0.000005923248,0.00006756684],"about_ca_topic_score_codex":0.0008414014,"about_ca_topic_score_gemma":0.000017375827,"teacher_disagreement_score":0.62953025,"about_ca_system_score_codex":0.000008935698,"about_ca_system_score_gemma":0.00005464603,"threshold_uncertainty_score":0.2635154},"labels":[],"label_agreement":null},{"id":"W2767000279","doi":"","title":"Blind Deconvolution Based on Constrained Marginalized Particle Filters","year":2008,"lang":"en","type":"dissertation","venue":"MacSphere (McMaster University)","topic":"Blind Source Separation Techniques","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":"McMaster University","keywords":"Blind deconvolution; Deconvolution; Particle filter; Computer science; Mathematics; Artificial intelligence; Algorithm; Kalman filter","score_opus":0.02102069222808811,"score_gpt":0.23242273613242528,"score_spread":0.21140204390433717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767000279","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006353396,0.000040330593,0.23156992,0.00063290534,0.00041070158,0.0006935176,0.000018855008,0.00085594424,0.75942445],"genre_scores_gemma":[0.16987312,0.00006393559,0.030219575,0.0014416052,0.00006474681,0.000010703355,0.00040555635,0.00006640584,0.79785436],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981251,0.0002457864,0.00024787374,0.00064762076,0.00039667814,0.00033695143],"domain_scores_gemma":[0.9987678,0.00010165791,0.00027443463,0.0005514639,0.00015122686,0.00015342815],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001337489,0.00034236527,0.00031464198,0.0003197847,0.00021429455,0.00014314601,0.0008777108,0.00032110797,0.009246616],"category_scores_gemma":[0.00002044254,0.00040093574,0.00019234903,0.000740464,0.00007232678,0.0004783624,0.00005902375,0.00035352638,0.00014521957],"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.00360531,0.0011027912,0.00072208367,0.00032934386,0.00032802098,0.0011334165,0.0066911457,0.004174417,0.0027145594,0.13728324,0.019606069,0.8223096],"study_design_scores_gemma":[0.010275771,0.0010297247,0.0021013157,0.0005723338,0.00015894548,0.000025673633,0.0016860878,0.24173002,0.028435592,0.0010151877,0.710672,0.0022973286],"about_ca_topic_score_codex":0.00004374833,"about_ca_topic_score_gemma":0.00015745168,"teacher_disagreement_score":0.8200123,"about_ca_system_score_codex":0.00020036366,"about_ca_system_score_gemma":0.00033596426,"threshold_uncertainty_score":0.99984425},"labels":[],"label_agreement":null},{"id":"W276985235","doi":"10.1109/twc.2008.060642","title":"Robust switching blind equalizer for wireless cognitive receivers","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Blind Source Separation 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":"Western University; Communications Research Centre Canada","funders":"","keywords":"Computer science; Equalizer; Wireless; Cognitive radio; Adaptive equalizer; Computer network; Electronic engineering; Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.11215621081236772,"score_gpt":0.32109122496809545,"score_spread":0.20893501415572774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W276985235","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.01773936,0.00006269322,0.9763047,0.0024595957,0.00019650532,0.0008660695,0.000051253137,0.00082104665,0.0014987668],"genre_scores_gemma":[0.91032994,0.0008270866,0.08691706,0.00070834375,0.000017098446,0.00068123796,0.000019544748,0.00003756489,0.00046210957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998044,0.00035024228,0.00047658544,0.00047227243,0.00031939347,0.00033749844],"domain_scores_gemma":[0.9959711,0.00131151,0.00020704667,0.0019411917,0.000425349,0.00014384172],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004482698,0.00026233486,0.00028867487,0.0003926211,0.0015620139,0.00012198605,0.0020234173,0.00017868447,0.00001502909],"category_scores_gemma":[0.000016373677,0.00029021603,0.00022282191,0.00085970503,0.00022563883,0.0008926594,0.000021597574,0.00060253247,0.000053765983],"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.0005801182,0.0061677047,0.00007538079,0.00011296071,0.0008542554,0.000016741904,0.058320537,0.022524748,0.013571823,0.23132005,0.0028695941,0.6635861],"study_design_scores_gemma":[0.006822033,0.0008170576,0.00032626043,0.00051458384,0.00019266475,0.00016424694,0.0019222042,0.8336358,0.14225934,0.004468605,0.006717314,0.002159899],"about_ca_topic_score_codex":0.00007789169,"about_ca_topic_score_gemma":0.00021312729,"teacher_disagreement_score":0.8925906,"about_ca_system_score_codex":0.000112309666,"about_ca_system_score_gemma":0.00022175643,"threshold_uncertainty_score":0.999955},"labels":[],"label_agreement":null},{"id":"W2770061147","doi":"10.1007/978-0-387-74759-0_610","title":"Signal Processing with Higher Order Statistics","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Higher-order statistics; Statistics; Signal processing; SIGNAL (programming language); Computer science; Order statistic; Order (exchange); Mathematics; Digital signal processing; Computer hardware; Economics; Programming language","score_opus":0.012573216030350241,"score_gpt":0.2279365445735584,"score_spread":0.21536332854320814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770061147","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":[2.1661869e-7,0.00012152769,0.61939585,0.00007229324,0.000038393086,0.00016991954,0.00001062508,0.00015190135,0.38003927],"genre_scores_gemma":[0.00008160459,0.0012632265,0.8168928,0.000120834375,0.00007200941,0.000011566235,0.00013720887,0.000048681824,0.18137209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855703,0.000023277738,0.00039609757,0.0003743295,0.00050578325,0.0001434877],"domain_scores_gemma":[0.9983725,0.000049202263,0.00053902046,0.00033736962,0.00064356637,0.000058321744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000944135,0.00026844657,0.00029185234,0.00021538338,0.00008019088,0.00006125762,0.000397247,0.00022740834,0.00023432472],"category_scores_gemma":[0.0000079767715,0.00024514744,0.000031009335,0.00013911423,0.00010537104,0.00046665332,0.000082581944,0.00023249006,0.000009806571],"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.000051466734,0.00014910233,0.00003737725,0.0002465951,0.00010725089,0.000082763814,0.002906302,0.39944705,0.0000029090595,0.4249584,0.052152634,0.11985814],"study_design_scores_gemma":[0.00081062486,0.0006766742,0.00005423273,0.00053778366,0.00010084331,0.000053584008,0.0000053016956,0.35148177,0.0000887701,0.008720041,0.6359763,0.0014940616],"about_ca_topic_score_codex":0.000004192085,"about_ca_topic_score_gemma":0.0000023899272,"teacher_disagreement_score":0.5838237,"about_ca_system_score_codex":0.000040849794,"about_ca_system_score_gemma":0.00042558607,"threshold_uncertainty_score":0.9996823},"labels":[],"label_agreement":null},{"id":"W2787132190","doi":"10.1109/epec.2017.8286232","title":"Performance analysis of dimensionality reduction techniques for demand side management","year":2017,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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 Regina","funders":"","keywords":"Dimensionality reduction; Smart grid; Principal component analysis; Computer science; Smart meter; Cluster analysis; Random projection; Euclidean distance; Centroid; Data mining; Raw data; Reduction (mathematics); Algorithm; Artificial intelligence; Mathematics; Engineering; Electrical engineering","score_opus":0.02606520896011756,"score_gpt":0.3138705778664235,"score_spread":0.2878053689063059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787132190","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.05771072,0.000005018153,0.9204721,0.0006885832,0.000038110906,0.00028976778,0.0000013805096,0.00020646774,0.02058785],"genre_scores_gemma":[0.696446,0.000021767355,0.30280033,0.000045425015,0.000006889126,0.00004211182,0.0000027656818,0.0000020542927,0.0006326644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929476,0.000021716387,0.00020358841,0.00022447175,0.00016376165,0.0000916806],"domain_scores_gemma":[0.9987475,0.000019182775,0.00021076982,0.0008699876,0.0001288927,0.000023664348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006707691,0.00006740254,0.00015262113,0.0002139496,0.00023433879,0.000090007736,0.0005619273,0.000036399957,0.0000047433173],"category_scores_gemma":[0.000013384809,0.000058185124,0.000097418684,0.00017019323,0.000047797945,0.0005649515,0.00019348576,0.000029784225,9.1277764e-7],"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.000033900556,0.00019270781,0.0042652213,0.00009984766,0.0007915789,7.8643205e-7,0.00036748615,0.0004962086,0.007089763,0.8325256,0.0025564202,0.15158047],"study_design_scores_gemma":[0.0002046701,0.00016050889,0.13389923,0.000031976455,0.00030148277,0.000002095416,0.000028138324,0.27274516,0.5754349,0.013231031,0.0036962014,0.00026459672],"about_ca_topic_score_codex":0.000023444201,"about_ca_topic_score_gemma":0.000006272866,"teacher_disagreement_score":0.8192946,"about_ca_system_score_codex":0.000017659399,"about_ca_system_score_gemma":0.000010231243,"threshold_uncertainty_score":0.23727205},"labels":[],"label_agreement":null},{"id":"W2790077965","doi":"10.5539/jmr.v10n3p20","title":"Dialectical Logic K-model: On Multidimensional Discrete Dynamical Sampling System and Further Properties of Kirchhoff Matrices","year":2018,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Variable (mathematics); Matrix (chemical analysis); Function (biology); Fourier transform; Mathematical analysis; Multidimensional systems; Applied mathematics; Pure mathematics; Algebra over a field; Calculus (dental)","score_opus":0.16536711538640675,"score_gpt":0.41032429477452415,"score_spread":0.2449571793881174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790077965","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.34991828,0.00010512207,0.6480745,0.0010348426,0.000051280673,0.00017245708,0.0000010088452,0.000031526906,0.0006109676],"genre_scores_gemma":[0.733226,0.000018820183,0.26663712,0.000019289353,0.000055675726,0.000002746433,5.7833137e-8,0.000008942622,0.000031354826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975513,0.00028622718,0.00055698387,0.00015718832,0.0012173109,0.0002309488],"domain_scores_gemma":[0.9978248,0.00058335037,0.00025706668,0.00027608185,0.00094391545,0.00011481873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038955857,0.00010165374,0.00028605963,0.00040378096,0.00012110972,0.00012300351,0.00051514985,0.00008532876,0.000003918051],"category_scores_gemma":[0.0005548237,0.000064353444,0.00006652241,0.00027037575,0.0002956105,0.00025016666,0.00028702477,0.0004375075,0.000010661288],"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.00018862015,0.0007247069,0.00007775637,0.00091447,0.000104294566,0.00002457776,0.012898651,0.00073224684,0.090243235,0.89181805,0.00032530344,0.0019480665],"study_design_scores_gemma":[0.00030738208,0.0010745247,0.00006970284,0.0009519835,0.000009471128,0.00016042328,0.0006873051,0.94536346,0.026029052,0.025183143,0.000042237498,0.0001212868],"about_ca_topic_score_codex":0.0000035654632,"about_ca_topic_score_gemma":0.0000014852332,"teacher_disagreement_score":0.9446312,"about_ca_system_score_codex":0.00007579093,"about_ca_system_score_gemma":0.00016071423,"threshold_uncertainty_score":0.26242572},"labels":[],"label_agreement":null},{"id":"W2797284464","doi":"10.5539/ijsp.v7n4p50","title":"On Optimal Allocation of Treatment/Condition Variance in Principal Component Analysis","year":2018,"lang":"en","type":"preprint","venue":"International Journal of Statistics and Probability","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Principal component analysis; Variance (accounting); Econometrics; Optimal allocation; Principal (computer security); Mathematics; Statistics; Mathematical optimization; Computer science; Economics","score_opus":0.025987119007187243,"score_gpt":0.32739354041643587,"score_spread":0.3014064214092486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797284464","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.27181822,0.000019153871,0.72719145,0.0003255461,0.00022313936,0.00014251794,0.00018194976,0.0000073942024,0.000090655485],"genre_scores_gemma":[0.7599092,0.000089809844,0.23985438,0.000035273126,0.00003879994,0.000007240298,0.000056433608,0.0000030810243,0.0000057870816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982399,0.00019649822,0.0007949691,0.0002575774,0.00043223138,0.00007887492],"domain_scores_gemma":[0.99738073,0.00026672203,0.0010277798,0.00025073264,0.0010241856,0.00004982039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092067465,0.00014105962,0.00034927038,0.0004577362,0.000018148352,0.00011165694,0.0005175871,0.000096151416,0.000018398998],"category_scores_gemma":[0.00016640642,0.00012518781,0.00010024997,0.0001403252,0.00009073971,0.00015497353,0.00019126156,0.00021976301,6.278684e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004897718,0.0019464984,0.014283488,0.0001255638,0.002100016,0.00006000406,0.004807816,0.14635058,0.00020962536,0.8043359,0.000223381,0.02506739],"study_design_scores_gemma":[0.00086242985,0.0012725545,0.121127434,0.00020532779,0.00016779352,0.00002182746,0.000011208724,0.31410939,0.001292437,0.56046385,0.00022123403,0.000244543],"about_ca_topic_score_codex":0.000116114155,"about_ca_topic_score_gemma":0.000073159,"teacher_disagreement_score":0.48809096,"about_ca_system_score_codex":0.00035683444,"about_ca_system_score_gemma":0.00028043456,"threshold_uncertainty_score":0.5105011},"labels":[],"label_agreement":null},{"id":"W2798445441","doi":"10.1049/iet-spr.2018.5076","title":"Block sparse multi‐lead ECG compression exploiting between‐lead collaboration","year":2018,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Blind Source Separation Techniques","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":"Toronto Metropolitan University; Queen's University","funders":"","keywords":"Kernel (algebra); Computer science; Compression ratio; Wavelet; Estimator; Algorithm; Block (permutation group theory); Compression (physics); Compressed sensing; Discrete cosine transform; Pattern recognition (psychology); Gaussian; Daubechies wavelet; Artificial intelligence; Mathematics; Wavelet transform; Discrete wavelet transform; Statistics; Image (mathematics); Discrete mathematics","score_opus":0.05522897924781725,"score_gpt":0.32753154281563174,"score_spread":0.27230256356781446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798445441","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.07378044,0.00011379282,0.9227867,0.0006695961,0.00009681158,0.00024594684,0.0000028600398,0.00093026727,0.0013735777],"genre_scores_gemma":[0.7536656,0.0000021000756,0.24547912,0.00042056176,0.00026726548,0.000019021836,0.0000075920984,0.000020496247,0.00011822673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795043,0.00017420643,0.00045835014,0.000559137,0.0004908971,0.00036695617],"domain_scores_gemma":[0.9985169,0.00009563279,0.00034954204,0.00033617785,0.0005947628,0.00010694532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062176946,0.00023172103,0.000250424,0.00019229323,0.00060432224,0.0007796935,0.0006765417,0.0001555616,0.000012378731],"category_scores_gemma":[0.000055475488,0.00022536596,0.00004720894,0.00084850425,0.00013010578,0.0019234408,0.00022590844,0.0002646115,0.00009137371],"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.000045823424,0.0003275531,0.0045823413,0.00017575026,0.000032727756,0.000021669523,0.018967478,0.00052171765,0.24079825,0.0012349001,0.0049664923,0.7283253],"study_design_scores_gemma":[0.00048137736,0.00021059343,0.00051457336,0.0003779657,0.000012316174,0.000009563384,0.0003463772,0.6248396,0.36890835,0.0015281268,0.0023405347,0.00043061824],"about_ca_topic_score_codex":0.000013518454,"about_ca_topic_score_gemma":0.000012465766,"teacher_disagreement_score":0.72789466,"about_ca_system_score_codex":0.000064706765,"about_ca_system_score_gemma":0.00021491612,"threshold_uncertainty_score":0.9190157},"labels":[],"label_agreement":null},{"id":"W2799621666","doi":"10.1049/iet-spr.2017.0512","title":"Efficient blind source extraction of noisy mixture utilising a class of parallel linear predictor filters","year":2018,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Blind Source Separation Techniques","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 Windsor","funders":"","keywords":"Computer science; Class (philosophy); Blind signal separation; Extraction (chemistry); Pattern recognition (psychology); Linear prediction; Artificial intelligence; Speech recognition; Algorithm; Chromatography; Telecommunications","score_opus":0.02264070401114699,"score_gpt":0.2959059034246326,"score_spread":0.2732651994134856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799621666","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.20021522,0.00010185707,0.7983926,0.00018425778,0.00006673345,0.00020001686,0.0000020401571,0.00017429591,0.0006629955],"genre_scores_gemma":[0.8904224,0.0000015182218,0.1092135,0.00013428686,0.00012832016,0.000008247471,0.0000022884647,0.000014615675,0.00007484431],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983048,0.000096971984,0.00048885716,0.00036288248,0.0005138056,0.0002327074],"domain_scores_gemma":[0.99856645,0.00008945761,0.00051498634,0.00029767337,0.00045750133,0.000073950905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055600965,0.0001651739,0.00023646535,0.00020998303,0.00014036027,0.00008292672,0.00049761916,0.00014902845,0.000016655407],"category_scores_gemma":[0.000046546633,0.00015311483,0.00008417499,0.00056726584,0.00021347438,0.0003541805,0.00011412002,0.00022303313,0.0000046621544],"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.0016259517,0.0016966177,0.00089057966,0.001107741,0.00013125324,0.000014144321,0.053112827,0.09667304,0.66593504,0.0029027888,0.0022452944,0.17366475],"study_design_scores_gemma":[0.00072044134,0.0002698693,0.00017935722,0.00025452272,0.000013928839,0.0000143448815,0.00011422986,0.856919,0.14014582,0.0003694812,0.0008361027,0.00016288151],"about_ca_topic_score_codex":0.0000116156325,"about_ca_topic_score_gemma":0.0000021684366,"teacher_disagreement_score":0.760246,"about_ca_system_score_codex":0.000031595693,"about_ca_system_score_gemma":0.000191863,"threshold_uncertainty_score":0.6243841},"labels":[],"label_agreement":null},{"id":"W2799712149","doi":"10.1109/access.2018.2832616","title":"Blind System Identification Using Symbolic Dynamics","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Blind Source Separation Techniques","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 Calgary","funders":"","keywords":"Cramér–Rao bound; Blind equalization; Computer science; Algorithm; System identification; Binary number; Upper and lower bounds; Kalman filter; Estimation theory; Equalization (audio); Mathematics; Artificial intelligence; Decoding methods; Data modeling","score_opus":0.058702197256683235,"score_gpt":0.36298150990727907,"score_spread":0.3042793126505958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799712149","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.2501944,0.0000073246338,0.74666893,0.00011369038,0.0005969192,0.00014571572,0.0000014207712,0.0004616903,0.0018099172],"genre_scores_gemma":[0.9894148,0.0000014249206,0.010094908,0.0001828756,0.00018922659,0.00001308463,0.0000023798857,0.000010375163,0.000090920716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898046,0.00007799958,0.000253876,0.00029813146,0.00022939002,0.00016015052],"domain_scores_gemma":[0.99887,0.00002452339,0.0001700303,0.00064607145,0.00024044611,0.000048929996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039966713,0.000092780174,0.000104494226,0.0001846608,0.00016956803,0.0008591869,0.0013477411,0.00007383833,0.0000030885396],"category_scores_gemma":[0.000013330341,0.0000939166,0.000032684242,0.00057781825,0.000050381183,0.0015158054,0.00015048182,0.000078141784,0.000079773854],"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.000029985029,0.00022245213,0.004529635,0.00020329529,0.00008179375,0.000025108702,0.0054203756,0.00092080096,0.026895564,0.91421974,0.003514952,0.04393631],"study_design_scores_gemma":[0.00014691624,0.000019811538,0.0017029309,0.00004018523,0.000007434837,0.000030105457,0.0000308132,0.91225517,0.08296497,0.002401452,0.00021956874,0.00018062795],"about_ca_topic_score_codex":0.00008893336,"about_ca_topic_score_gemma":0.00004683267,"teacher_disagreement_score":0.91181827,"about_ca_system_score_codex":0.00010280818,"about_ca_system_score_gemma":0.000061754414,"threshold_uncertainty_score":0.82851595},"labels":[],"label_agreement":null},{"id":"W2800366488","doi":"10.1155/2018/8068196","title":"A Novel Entropy-Based Decoding Algorithm for a Generalized High-Order Discrete Hidden Markov Model","year":2018,"lang":"en","type":"article","venue":"Journal of Probability and Statistics","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Forward algorithm; Algorithm; Viterbi algorithm; Hidden Markov model; Entropy (arrow of time); Computation; Mathematics; Sequence (biology); Decoding methods; Markov model; Hidden semi-Markov model; Markov chain; Iterative Viterbi decoding; Computer science; Artificial intelligence; Sequential decoding; Markov property; Variable-order Markov model; Block code","score_opus":0.02914158238759035,"score_gpt":0.2979468758040299,"score_spread":0.26880529341643955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800366488","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.0018785408,0.000021506312,0.99659294,0.00094739423,0.00011810142,0.00025976056,0.00013556116,0.000031028678,0.000015170262],"genre_scores_gemma":[0.01377386,0.000008980319,0.9856163,0.00044551093,0.00009498982,0.000010377538,0.0000047235335,0.000008274034,0.000036941783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987829,0.00008088631,0.00049622013,0.00019794927,0.0002583227,0.00018374228],"domain_scores_gemma":[0.99821997,0.00023500546,0.00035374318,0.00021525745,0.0008633595,0.000112670525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010446119,0.0001232104,0.00024980944,0.00009006033,0.00013949565,0.00018451964,0.00031068313,0.00006603658,0.0000060316083],"category_scores_gemma":[0.0003073403,0.000101469304,0.000055361186,0.00012539323,0.00012592722,0.00030339064,0.00006781311,0.00013379166,3.90149e-7],"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.00011464692,0.00026145158,0.00006237664,0.000096458905,0.00005967626,0.000004392208,0.001158816,0.0007256144,0.0019355941,0.7522253,0.0024423946,0.2409133],"study_design_scores_gemma":[0.00081480324,0.00035970932,0.0000737044,0.000017206772,0.000021785474,0.000011927402,0.000004550005,0.777588,0.0008544418,0.2199749,0.00018047354,0.00009849192],"about_ca_topic_score_codex":0.000010942397,"about_ca_topic_score_gemma":0.00002072682,"teacher_disagreement_score":0.7768624,"about_ca_system_score_codex":0.000057174435,"about_ca_system_score_gemma":0.00029225153,"threshold_uncertainty_score":0.41377982},"labels":[],"label_agreement":null},{"id":"W2807239671","doi":"10.32920/ryerson.14653806.v1","title":"Time-Frequency Feature Analysis","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Blind Source Separation Techniques","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Linear discriminant analysis; Pattern recognition (psychology); Artificial intelligence; Computer science; Discriminant; Optimal discriminant analysis; Cluster analysis; Feature (linguistics); Time–frequency analysis; Discriminative model; SIGNAL (programming language); Feature extraction; Feature selection; Scatter matrix; Machine learning; Computer vision; Multivariate statistics","score_opus":0.01278559406215926,"score_gpt":0.26855806739836025,"score_spread":0.255772473336201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807239671","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.0016460422,0.00026482527,0.9345933,0.0047759768,0.00012534166,0.00015352767,0.0000036828037,0.0012139356,0.05722335],"genre_scores_gemma":[0.079170816,0.00005386211,0.900917,0.002242061,0.000060740822,0.000048023252,0.00018248522,0.000014368564,0.017310673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982628,0.00018007128,0.00022539559,0.00078309583,0.00036802678,0.00018061054],"domain_scores_gemma":[0.9975312,0.000043621127,0.00015355104,0.001938813,0.00025066192,0.00008219205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035843544,0.00022720834,0.00041398656,0.000435474,0.000049419472,0.0008206064,0.0016423734,0.00041063633,0.00038714847],"category_scores_gemma":[0.00003400749,0.00021042151,0.00043588888,0.001240503,0.000027077369,0.0002642696,0.0018570353,0.0006556376,0.00007776164],"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.000006023737,0.0009870259,0.0034143582,0.00031989717,0.012138936,0.00056215463,0.019041132,0.020374283,0.005044229,0.60258275,0.2873747,0.048154496],"study_design_scores_gemma":[0.00033619796,0.000109207576,0.009238437,0.00018091018,0.0014984175,0.000037017173,0.00014269204,0.8556254,0.028256107,0.087577544,0.013473136,0.0035249612],"about_ca_topic_score_codex":0.000079949146,"about_ca_topic_score_gemma":0.00006212673,"teacher_disagreement_score":0.8352511,"about_ca_system_score_codex":0.000056970614,"about_ca_system_score_gemma":0.0002690439,"threshold_uncertainty_score":0.85807407},"labels":[],"label_agreement":null},{"id":"W2841351641","doi":"10.1016/j.wocn.2018.07.008","title":"Bayesian data analysis in the phonetic sciences: A tutorial introduction","year":2018,"lang":"en","type":"article","venue":"Journal of Phonetics","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":249,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"National Institutes of Health; University of Lethbridge; National Institute on Deafness and Other Communication Disorders; Ohio State University","keywords":"Computer science; Bayesian probability; Code (set theory); Process (computing); Artificial intelligence; Machine learning; Data mining; Natural language processing; Programming language","score_opus":0.04121776555961447,"score_gpt":0.3316891550027601,"score_spread":0.2904713894431456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2841351641","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.020254143,0.00008382405,0.97169363,0.006520347,0.0010266082,0.000070091206,0.0000011818277,0.000018029286,0.00033211889],"genre_scores_gemma":[0.8642531,0.00003968005,0.1333107,0.0004295969,0.0019486521,5.919771e-7,0.0000011499626,0.0000028482973,0.000013656858],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983205,0.00028998478,0.00043856094,0.0002097404,0.00059476966,0.00014641442],"domain_scores_gemma":[0.998538,0.00011015374,0.00033561504,0.0007893406,0.00018983951,0.00003705529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037060692,0.00007673701,0.00016813063,0.0005062209,0.000100585334,0.00029903842,0.0025455179,0.000044665205,0.000020854503],"category_scores_gemma":[0.0002341934,0.000051170264,0.000058600315,0.002634995,0.00018292408,0.00060096686,0.00019380692,0.00022730211,0.000006408527],"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.00036730262,0.0033555015,0.016079256,0.000061614,0.0014748382,0.00023741614,0.17214504,0.018144578,0.028499762,0.15913354,0.47727963,0.12322152],"study_design_scores_gemma":[0.0018250018,0.0037668324,0.02613188,0.000063191634,0.00057579833,0.00059494714,0.0014182738,0.7629414,0.014714989,0.05918168,0.12806535,0.00072064874],"about_ca_topic_score_codex":0.00002152367,"about_ca_topic_score_gemma":0.00008714279,"teacher_disagreement_score":0.84399897,"about_ca_system_score_codex":0.000029432236,"about_ca_system_score_gemma":0.00016150733,"threshold_uncertainty_score":0.4730248},"labels":[],"label_agreement":null},{"id":"W2883508777","doi":"10.3233/jifs-169740","title":"Parallel weak signal detection algorithm under Gauss noise interference","year":2018,"lang":"en","type":"article","venue":"Journal of Intelligent & Fuzzy Systems","topic":"Blind Source Separation 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 Waterloo","funders":"","keywords":"Signal transfer function; Noise reduction; Step detection; SIGNAL (programming language); Algorithm; Noise (video); Interference (communication); Detection theory; Matched filter; Mathematics; Wavelet; Filter (signal processing); Computer science; Pattern recognition (psychology); Artificial intelligence; Analog signal; Digital signal processing; Computer vision; Telecommunications; Channel (broadcasting)","score_opus":0.02863487043742833,"score_gpt":0.28123676583295454,"score_spread":0.2526018953955262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883508777","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.0043340144,0.00038912724,0.9901095,0.00029048626,0.0019661684,0.00021861047,0.000001210704,0.00012051002,0.0025703812],"genre_scores_gemma":[0.96365595,0.00008880066,0.034698706,0.0002163975,0.0008274952,0.000009621768,4.499662e-7,0.000017125069,0.00048547983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739003,0.00033552694,0.0010517732,0.00027747807,0.0006515078,0.0002936645],"domain_scores_gemma":[0.9973042,0.00012467087,0.0008764952,0.00042068146,0.0010736623,0.00020027428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015003186,0.00022141627,0.00036914815,0.00044669217,0.00012877848,0.00046748854,0.0011265817,0.00014530584,0.00002613726],"category_scores_gemma":[0.000042963264,0.0001776983,0.00019127107,0.00044618596,0.00009254408,0.0008613964,0.00014794592,0.00039884428,0.00012867217],"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.00048882974,0.0018385242,0.001196874,0.00028189202,0.0013115206,0.00023107715,0.01716556,0.01727921,0.08007402,0.17023392,0.027310202,0.68258834],"study_design_scores_gemma":[0.0013512501,0.009105795,0.0015271817,0.0016366495,0.000103322054,0.0044440874,0.0033408527,0.6237589,0.27652335,0.022189979,0.054388016,0.0016305943],"about_ca_topic_score_codex":0.000060847535,"about_ca_topic_score_gemma":0.000018872566,"teacher_disagreement_score":0.9593219,"about_ca_system_score_codex":0.00020851845,"about_ca_system_score_gemma":0.00016328317,"threshold_uncertainty_score":0.7246326},"labels":[],"label_agreement":null},{"id":"W2885592059","doi":"10.1109/bmsb.2018.8436750","title":"Spectrum Sensing Based on Novel Blind Pilot Detection Algorithm","year":2018,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Waveform; Detector; Pilot signal; SIGNAL (programming language); Frequency modulation; Detection theory; Noise (video); Robustness (evolution); Algorithm; Signal-to-noise ratio (imaging); Electronic engineering; Artificial intelligence; Telecommunications; Bandwidth (computing); Engineering; Channel (broadcasting)","score_opus":0.030744473327151033,"score_gpt":0.27355074175284155,"score_spread":0.24280626842569053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885592059","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.0016138442,7.202359e-7,0.97907126,0.0014091483,0.00025283278,0.00013996396,4.8650503e-7,0.00086746,0.016644279],"genre_scores_gemma":[0.5784909,1.3893317e-7,0.41913825,0.002029684,0.00012794434,0.0000013337334,4.8318174e-7,0.0000065467907,0.00020470064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906284,0.000043677705,0.00014490493,0.00031994886,0.0002462134,0.00018242978],"domain_scores_gemma":[0.99928653,0.000057276335,0.000056736604,0.0004587536,0.00008333684,0.000057357604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035164165,0.000108882814,0.00008305161,0.00020803785,0.0001443874,0.000190694,0.00024765087,0.00004832594,0.000027792708],"category_scores_gemma":[0.00002261885,0.000099108,0.000032306172,0.0004129691,0.00004339261,0.00026263704,0.000058769903,0.000118370765,0.0001557204],"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.000109636036,0.0006566768,0.000021361267,0.0000070008755,0.000022729839,0.000010681217,0.0007032606,0.00028009224,0.11130926,0.051932525,0.0018245666,0.8331222],"study_design_scores_gemma":[0.00026968884,0.00061111944,0.00013048426,0.0000051232414,9.56321e-7,0.0000062299905,0.0000026009748,0.6288511,0.36740333,0.0012426021,0.0013826453,0.00009412442],"about_ca_topic_score_codex":0.000055126937,"about_ca_topic_score_gemma":0.00008383023,"teacher_disagreement_score":0.8330281,"about_ca_system_score_codex":0.000048087317,"about_ca_system_score_gemma":0.000044868986,"threshold_uncertainty_score":0.4041507},"labels":[],"label_agreement":null},{"id":"W2886643713","doi":"10.1186/s13673-018-0148-3","title":"Improving clustering performance using independent component analysis and unsupervised feature learning","year":2018,"lang":"en","type":"article","venue":"Human-centric Computing and Information Sciences","topic":"Blind Source Separation 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":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster analysis; MNIST database; Pattern recognition (psychology); Independent component analysis; Artificial intelligence; Computer science; Principal component analysis; Unsupervised learning; Feature extraction; Feature (linguistics); Correlation clustering; Deep learning","score_opus":0.02347743665580084,"score_gpt":0.2838489163022337,"score_spread":0.26037147964643287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886643713","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5115255,0.000034165103,0.48768875,0.000060971168,0.00005061626,0.00007433855,1.8271108e-7,0.00013247992,0.00043300542],"genre_scores_gemma":[0.96362,0.000022498332,0.03603007,0.00026756662,0.000042171854,9.668479e-7,0.0000030170154,0.000002401893,0.000011303407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985558,0.000098094715,0.00035409117,0.0002799826,0.00043140355,0.00028063537],"domain_scores_gemma":[0.99920434,0.00006491309,0.00031343335,0.00016019476,0.00017105578,0.00008606874],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015603704,0.00014373452,0.00018470017,0.00079481833,0.0017850726,0.0012756706,0.00038132214,0.000059916696,0.000004525987],"category_scores_gemma":[0.000039919098,0.00012842753,0.000036622638,0.0015685109,0.00021089498,0.003290584,0.0005363558,0.00019525389,0.0000032007727],"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.00001779752,0.00007245948,0.16140634,0.00024094127,0.00015780349,0.0000022160057,0.055864394,0.050657358,0.0025157987,0.014868597,0.000073569834,0.7141227],"study_design_scores_gemma":[0.0001970947,0.00010947244,0.038970754,0.000026012016,0.000017174896,0.000017666347,0.00034070798,0.95935386,0.00045938737,0.000021874517,0.00032407843,0.00016191375],"about_ca_topic_score_codex":0.00011830816,"about_ca_topic_score_gemma":0.000009227803,"teacher_disagreement_score":0.90869653,"about_ca_system_score_codex":0.000040859355,"about_ca_system_score_gemma":0.00004869039,"threshold_uncertainty_score":0.9997611},"labels":[],"label_agreement":null},{"id":"W2889507287","doi":"10.1190/geo2018-0136.1","title":"Automatic blind deconvolution with Toeplitz-structured sparse total least squares","year":2018,"lang":"en","type":"article","venue":"Geophysics","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"U.S. Department of Energy","keywords":"Blind deconvolution; Deconvolution; Toeplitz matrix; Algorithm; Wavelet; Noise (video); Computer science; Matrix (chemical analysis); Regularization (linguistics); Mathematics; Mathematical optimization; Artificial intelligence; Image (mathematics)","score_opus":0.012412894837231387,"score_gpt":0.24394128070506524,"score_spread":0.23152838586783386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889507287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6142071,0.000009620607,0.38353595,0.00023165696,0.00013991546,0.00018898353,0.0000026075882,0.00054917973,0.0011349943],"genre_scores_gemma":[0.93017715,7.1353105e-7,0.069079496,0.00031595805,0.00020171308,0.000019395453,0.0000069915645,0.000013139635,0.00018544476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988614,0.000058789825,0.00018042783,0.00034607045,0.00029433286,0.00025901027],"domain_scores_gemma":[0.9989303,0.000030255198,0.00012565339,0.00065409136,0.00018292868,0.00007680964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012208684,0.00016504103,0.00015697289,0.00007699943,0.00016080416,0.00020522096,0.00043695176,0.00006804995,0.000026202411],"category_scores_gemma":[0.000013015501,0.00014101458,0.000046037312,0.0004354568,0.00013365714,0.00068160513,0.00012993082,0.0001262988,0.000213745],"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.00014015837,0.00046676854,0.001997892,0.0000980872,0.00017000463,0.000027462009,0.015441823,0.0003889671,0.0067114388,0.6208098,0.007806454,0.34594113],"study_design_scores_gemma":[0.0033644775,0.0030093044,0.16784431,0.00019742381,0.00007629147,0.00021673631,0.0002912689,0.56745183,0.06929183,0.18199894,0.004281766,0.0019758022],"about_ca_topic_score_codex":0.00003987123,"about_ca_topic_score_gemma":0.000026289787,"teacher_disagreement_score":0.56706285,"about_ca_system_score_codex":0.000038829075,"about_ca_system_score_gemma":0.00011513028,"threshold_uncertainty_score":0.57504076},"labels":[],"label_agreement":null},{"id":"W2896082286","doi":"10.3997/2214-4609.201800882","title":"Blind Deconvolution with Toeplitz-structured Sparse Total Least Squares Algorithm","year":2018,"lang":"en","type":"article","venue":"Proceedings","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":"University of Calgary","funders":"","keywords":"Deconvolution; Blind deconvolution; Toeplitz matrix; Algorithm; Estimator; Wavelet; Compressed sensing; Computer science; Regularization (linguistics); Iterative method; Least-squares function approximation; Synthetic data; Mathematics; Mathematical optimization; Artificial intelligence; Statistics","score_opus":0.013780223890795504,"score_gpt":0.24882517825302328,"score_spread":0.23504495436222778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896082286","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.23269741,0.000038183935,0.7561057,0.001015108,0.00017581691,0.00038828276,0.0000029472358,0.0010447974,0.008531736],"genre_scores_gemma":[0.74989104,0.0000020238865,0.24921674,0.0003173907,0.000224365,0.000028971239,0.0000020735765,0.000013675749,0.00030370808],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987123,0.000008697516,0.0001919694,0.0004645644,0.000329007,0.00029347226],"domain_scores_gemma":[0.99908537,0.000011368541,0.00013246949,0.00019660113,0.00046643178,0.000107775886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023789736,0.00017559266,0.00014739152,0.00015712528,0.0001806665,0.00037739176,0.0004832953,0.00009605913,0.000023741828],"category_scores_gemma":[0.000028831435,0.00014786235,0.000036047928,0.0005010895,0.00014394974,0.0011784764,0.00014990631,0.00015746188,0.00006747138],"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.00033236848,0.0003543217,0.008906503,0.00010526467,0.00014432525,0.000014968135,0.028690996,0.000013006327,0.018579837,0.40875444,0.028031675,0.5060723],"study_design_scores_gemma":[0.005280286,0.0052300734,0.05718223,0.00031570118,0.00007963134,0.0013023596,0.0012023494,0.36063153,0.4443865,0.06726505,0.054253142,0.002871127],"about_ca_topic_score_codex":0.000021415844,"about_ca_topic_score_gemma":0.0000070457304,"teacher_disagreement_score":0.5171936,"about_ca_system_score_codex":0.000051066705,"about_ca_system_score_gemma":0.000068837544,"threshold_uncertainty_score":0.6029651},"labels":[],"label_agreement":null},{"id":"W2897518515","doi":"10.1007/s00034-018-0961-y","title":"A Computationally Efficient Blind Source Extraction Using Idempotent Transformation Matrix","year":2018,"lang":"en","type":"article","venue":"Circuits Systems and Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Blind signal separation; Algorithm; Computational complexity theory; Singular value decomposition; Computer science; Independent component analysis; Matrix (chemical analysis); Distortion (music); Computation; Transformation (genetics); Mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.03734896975669077,"score_gpt":0.31281922438944315,"score_spread":0.2754702546327524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897518515","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.13799739,0.00046310903,0.8602659,0.00009950783,0.00009347098,0.00030654203,9.228192e-7,0.00021123019,0.0005619332],"genre_scores_gemma":[0.9936731,0.0000021924022,0.005982578,0.00009669796,0.00017558056,0.00001210119,0.000003333937,0.000012996147,0.00004145855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984743,0.00011888882,0.00044748015,0.00033149918,0.0004151576,0.00021270411],"domain_scores_gemma":[0.9991105,0.000047417365,0.00026754173,0.00012215253,0.00036150322,0.00009089266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084147236,0.00015204732,0.00017672245,0.00022686846,0.00051243795,0.0008153647,0.00019334407,0.00010025518,0.0000026048542],"category_scores_gemma":[0.000008859128,0.00014503671,0.000036876925,0.00037620738,0.000068117144,0.0008994487,0.000031470212,0.00013117789,0.000008398472],"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.00004520431,0.0003160454,0.00022515249,0.0010202631,0.00006528124,0.000012635301,0.051275272,0.2654391,0.16225871,0.059459552,0.00011119239,0.4597716],"study_design_scores_gemma":[0.00031570686,0.00006918367,0.0002046432,0.00019816733,0.000009422805,0.00017974262,0.00028666877,0.9955432,0.0019642056,0.00044606836,0.0005979321,0.00018510516],"about_ca_topic_score_codex":0.000031159678,"about_ca_topic_score_gemma":0.0000012592624,"teacher_disagreement_score":0.8556757,"about_ca_system_score_codex":0.00006855589,"about_ca_system_score_gemma":0.00014951287,"threshold_uncertainty_score":0.78625804},"labels":[],"label_agreement":null},{"id":"W2897771072","doi":"10.1109/tcst.2018.2873549","title":"Detecting the Direction of Information Flow in Instantaneous Relations Between Variables","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Control Systems Technology","topic":"Blind Source Separation Techniques","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":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Causality (physics); Process (computing); Variable (mathematics); Computer science; Causal structure; Information flow; Algorithm; Data mining; Multivariate statistics; Relation (database); Set (abstract data type); Flow (mathematics); Mathematics; Machine learning","score_opus":0.008351684351434952,"score_gpt":0.22623670907449425,"score_spread":0.2178850247230593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897771072","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.009389835,0.000026566957,0.9870203,0.00095557113,0.00042374435,0.00060845393,0.000012960203,0.00067965745,0.00088291307],"genre_scores_gemma":[0.9955945,0.000004818087,0.0041116974,0.000054157852,0.000026646047,0.00017195956,5.863437e-7,0.0000073553106,0.00002829161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986207,0.00019984037,0.0006001747,0.00018675569,0.0001973854,0.00019517582],"domain_scores_gemma":[0.99859256,0.00036002044,0.00027414755,0.0005300861,0.00022093482,0.000022248385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007866993,0.00012665828,0.00023925502,0.0009283846,0.0002519142,0.00006933411,0.00048364006,0.00027999398,0.0000033200567],"category_scores_gemma":[0.00005223134,0.00010576335,0.000049562324,0.0011847491,0.00012902966,0.0005885424,0.0000036637325,0.0003823301,0.000029043118],"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.0000762152,0.0002164169,0.0010565162,0.00006483128,0.00023403224,0.0000044987987,0.00520393,0.09065649,0.00711597,0.044878785,0.00013123182,0.8503611],"study_design_scores_gemma":[0.0015626157,0.00085072056,0.00050296687,0.00020430039,0.000048035596,0.00010950511,0.00050211226,0.935513,0.051428296,0.00399728,0.0049243835,0.00035676916],"about_ca_topic_score_codex":0.00021198302,"about_ca_topic_score_gemma":0.0003930381,"teacher_disagreement_score":0.9862046,"about_ca_system_score_codex":0.0001221468,"about_ca_system_score_gemma":0.00007418812,"threshold_uncertainty_score":0.43129042},"labels":[],"label_agreement":null},{"id":"W2898529891","doi":"10.1115/fedsm2018-83152","title":"Coherent Structures of Tornado-Like Vortices","year":2018,"lang":"en","type":"article","venue":"","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":"Western University","funders":"","keywords":"Tornado; Orthogonality; Vortex; Lagrangian coherent structures; Flow (mathematics); Constraint (computer-aided design); Turbulence; Computer science; Statistical physics; Physics; Algorithm; Mathematics; Mechanics; Meteorology; Geometry","score_opus":0.016397143865367027,"score_gpt":0.283833680768571,"score_spread":0.267436536903204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898529891","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.10888222,0.000028018452,0.8601464,0.0003838005,0.00022573717,0.00010175625,5.092596e-7,0.0003084899,0.02992305],"genre_scores_gemma":[0.87503415,0.0000017427456,0.123862796,0.0005995249,0.000031847012,0.0000024902517,2.5389647e-7,0.000002358587,0.00046486422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994406,0.000031085678,0.0001440313,0.00013625143,0.00016058296,0.000087442095],"domain_scores_gemma":[0.99942416,0.000023400276,0.00007229572,0.00033555002,0.00011214399,0.00003246311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120370554,0.000053643842,0.000074994605,0.000048203896,0.000030518353,0.00004806472,0.00046688571,0.000030897907,0.00015288191],"category_scores_gemma":[0.00001202126,0.000040845385,0.000024381103,0.00013316133,0.00005783185,0.00022556214,0.00011625177,0.000034365097,0.00001868122],"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.000004352057,0.00003835333,0.0010069978,0.0000077661,0.000015332305,6.5715597e-7,0.0021518606,0.0000039514903,0.008519367,0.9473388,0.015289672,0.025622854],"study_design_scores_gemma":[0.0002522484,0.0005336177,0.020236563,0.000013800058,0.0000061987657,0.0000069723324,0.00010045477,0.0113516655,0.8286091,0.0876024,0.05100856,0.00027839575],"about_ca_topic_score_codex":0.000057491092,"about_ca_topic_score_gemma":0.0000808032,"teacher_disagreement_score":0.85973644,"about_ca_system_score_codex":0.000006366361,"about_ca_system_score_gemma":0.00002917377,"threshold_uncertainty_score":0.16739498},"labels":[],"label_agreement":null},{"id":"W2910261954","doi":"10.48550/arxiv.1901.05044","title":"A linear programming approach to the tracking of partials","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Blind Source Separation 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":"McGill University","funders":"","keywords":"Linear programming; Viterbi algorithm; Algorithm; Computer science; Time complexity; Tracking (education); Exponential function; Dynamic programming; Mathematical optimization; Mathematics; Decoding methods","score_opus":0.12476551631270004,"score_gpt":0.22488030483135077,"score_spread":0.10011478851865073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910261954","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.044555783,0.000021675822,0.9510847,0.00022591911,0.0001416928,0.0008209801,0.000003630857,0.00026652004,0.0028791479],"genre_scores_gemma":[0.96074325,0.000013859647,0.038536467,0.00018369051,0.000043193213,0.0000040084537,0.0000050087124,0.0000126600125,0.0004578378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984919,0.0002239388,0.00022565231,0.0007041318,0.000121280165,0.00023312362],"domain_scores_gemma":[0.99797344,0.00008957408,0.00029026874,0.0013928628,0.00017708955,0.00007675169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075781933,0.00019427076,0.00028823034,0.00019190992,0.00007612359,0.000118057294,0.0022110546,0.00018994829,0.0000024374601],"category_scores_gemma":[0.000048088856,0.00017226553,0.00017862955,0.000627354,0.00005314279,0.00023237837,0.0016280857,0.00042574646,0.000033230506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016361146,0.00019476652,0.0007455665,0.00011625844,0.000075941454,0.000008857806,0.004090856,0.64560425,0.00006367314,0.34412128,0.00032457366,0.004637627],"study_design_scores_gemma":[0.00024900917,0.000117572825,0.00046396194,0.00014883216,0.000059273258,0.0000036616414,0.00027596258,0.976294,0.004024489,0.008696624,0.00913696,0.000529661],"about_ca_topic_score_codex":0.00007215011,"about_ca_topic_score_gemma":0.000008819894,"teacher_disagreement_score":0.91618747,"about_ca_system_score_codex":0.000054598473,"about_ca_system_score_gemma":0.00016014707,"threshold_uncertainty_score":0.7024784},"labels":[],"label_agreement":null},{"id":"W2916681514","doi":"10.1109/cyberc.2018.00054","title":"Information Fusion VIA Optimized KECA with Application to Audio Emotion Recognition","year":2018,"lang":"en","type":"article","venue":"","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":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Entropy (arrow of time); Artificial intelligence; Kernel principal component analysis; Information fusion; Principal component analysis; Pattern recognition (psychology); Kernel (algebra); Fusion; Machine learning; Data mining; Support vector machine; Kernel method; Mathematics","score_opus":0.00959660146689947,"score_gpt":0.23942600853683313,"score_spread":0.22982940706993366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916681514","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.0123381,5.696269e-7,0.9687416,0.0017372434,0.000054844062,0.00059192575,8.1528975e-7,0.0008277762,0.015707139],"genre_scores_gemma":[0.49121892,0.0000020308992,0.50632626,0.0021934893,0.00004632689,0.00008812061,0.00003855007,0.0000046437244,0.00008163244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916327,0.000050354956,0.00022465186,0.00017267489,0.00025630862,0.0001327443],"domain_scores_gemma":[0.99897337,0.000018007931,0.000120036515,0.00037305313,0.0004421224,0.000073419906],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036378062,0.00010009127,0.000086219334,0.00021479178,0.00013234024,0.00018970759,0.00027084223,0.00006768872,0.000039853872],"category_scores_gemma":[0.00001935888,0.00008311421,0.000020198195,0.00058243505,0.000022096607,0.002127394,0.000088185814,0.00006193814,0.0009809198],"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.0000989585,0.00006242491,0.000033573757,0.00000877889,0.000007815735,1.466077e-7,0.0042296876,0.0002511294,0.005109445,0.010487357,0.0042951466,0.9754155],"study_design_scores_gemma":[0.0019969384,0.0022876244,0.005142831,0.00008731769,0.000018224173,0.000051918174,0.00022311482,0.61950743,0.31119862,0.016580021,0.041960407,0.0009455664],"about_ca_topic_score_codex":0.000048585884,"about_ca_topic_score_gemma":0.000022494152,"teacher_disagreement_score":0.97446996,"about_ca_system_score_codex":0.000053260574,"about_ca_system_score_gemma":0.00003325767,"threshold_uncertainty_score":0.9997969},"labels":[],"label_agreement":null},{"id":"W2917790107","doi":"10.5539/ijsp.v8n2p183","title":"Principal Component Analysis and Its Derivation From Singular Value Decomposition","year":2019,"lang":"en","type":"article","venue":"International Journal of Statistics and Probability","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Singular value decomposition; Principal component analysis; Robust principal component analysis; Rank (graph theory); Decomposition; Computer science; Basis (linear algebra); Value (mathematics); Component (thermodynamics); Singular value; Applied mathematics; Mathematics; Task (project management); Algebra over a field; Algorithm; Statistics; Artificial intelligence; Eigenvalues and eigenvectors; Pure mathematics; Geometry; Combinatorics","score_opus":0.013072915101945802,"score_gpt":0.2919517191867647,"score_spread":0.2788788040848189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917790107","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.47738948,0.00003630151,0.52193683,0.0004333077,0.000091447975,0.00005273233,0.000027735196,0.0000071578584,0.000024986604],"genre_scores_gemma":[0.73870385,0.000037240417,0.26109228,0.000120389246,0.000021411137,6.8348436e-7,0.000019212963,0.000001852465,0.0000030662684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99894595,0.000104420214,0.00037296634,0.00015709196,0.0003614064,0.000058167854],"domain_scores_gemma":[0.99876785,0.00021067305,0.00031856762,0.000099574594,0.00054756063,0.000055764114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054386444,0.000071050425,0.00015966897,0.00015327039,0.00002952787,0.00019007735,0.00023370107,0.000034484543,0.00001820522],"category_scores_gemma":[0.000078200595,0.000064620835,0.000037438855,0.00010054877,0.000021949356,0.00036079928,0.00010167079,0.000104618375,0.0000013697023],"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.00013292435,0.00031158378,0.0973641,0.00002818918,0.0009981975,0.000024365263,0.0021395993,0.002617809,0.012100298,0.85081446,0.00005890823,0.033409595],"study_design_scores_gemma":[0.00046576373,0.00016118647,0.48238826,0.000029854207,0.000075889235,0.000024029214,0.000007738806,0.26781276,0.003894827,0.24466334,0.0003453351,0.00013101875],"about_ca_topic_score_codex":0.00004486437,"about_ca_topic_score_gemma":0.0000102797585,"teacher_disagreement_score":0.6061511,"about_ca_system_score_codex":0.00005344437,"about_ca_system_score_gemma":0.00004194326,"threshold_uncertainty_score":0.2635161},"labels":[],"label_agreement":null},{"id":"W2918149247","doi":"10.1109/isspit.2018.8642620","title":"Extraction of Fetal Electrocardiogram signals using Blind Source Extraction Based Parallel Linear Predictor Filter","year":2018,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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 Windsor","funders":"","keywords":"FastICA; Computer science; Blind signal separation; Pattern recognition (psychology); Independent component analysis; Artificial intelligence; Filter (signal processing); Extraction (chemistry); Sensitivity (control systems); Linear prediction; Algorithm; Engineering; Electronic engineering; Chemistry; Computer vision","score_opus":0.03726160221308574,"score_gpt":0.32372052173337745,"score_spread":0.28645891952029173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918149247","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.0828298,0.000020329027,0.9142822,0.00016306921,0.00014870646,0.00036869152,0.0000011630868,0.00051199883,0.001674009],"genre_scores_gemma":[0.66425645,0.0000035061685,0.33500552,0.00024013878,0.00019498264,0.00001580712,0.0000045418296,0.000013430675,0.00026560377],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982769,0.00018375121,0.00041721665,0.00039920886,0.0004519936,0.00027093134],"domain_scores_gemma":[0.998684,0.00011936478,0.00027557238,0.0005036895,0.00032976587,0.00008759088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060667633,0.00017669256,0.0002136884,0.0003051762,0.00013108399,0.00012341488,0.00037964323,0.00016805713,0.00013872606],"category_scores_gemma":[0.000044438315,0.00016646973,0.000159938,0.00053124246,0.00008951578,0.0010792383,0.00006082365,0.00020078546,0.000028901912],"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.0009700995,0.0010726874,0.0013508036,0.000058285645,0.00020967009,0.000008830358,0.001238757,0.018407604,0.9362093,0.0041250414,0.0052652983,0.031083578],"study_design_scores_gemma":[0.0008040662,0.00038778354,0.0003942288,0.000017199283,0.000016766413,0.000023134417,0.000013409179,0.7169649,0.27641383,0.00037986806,0.0044079423,0.00017690397],"about_ca_topic_score_codex":0.00007077641,"about_ca_topic_score_gemma":0.000008402482,"teacher_disagreement_score":0.69855726,"about_ca_system_score_codex":0.000048887156,"about_ca_system_score_gemma":0.00013442681,"threshold_uncertainty_score":0.6788439},"labels":[],"label_agreement":null},{"id":"W2924352133","doi":"10.48550/arxiv.1903.11240","title":"Eigenvalue and Generalized Eigenvalue Problems: Tutorial","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Blind Source Separation Techniques","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 Waterloo","funders":"","keywords":"Divide-and-conquer eigenvalue algorithm; Eigenvalues and eigenvectors; Eigendecomposition of a matrix; Eigenvalue perturbation; Mathematics; Inverse iteration; Applied mathematics; Principal component analysis; Generalized eigenvector; Symmetric matrix; Statistics; Physics","score_opus":0.07255336635269061,"score_gpt":0.19765468194443075,"score_spread":0.12510131559174015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2924352133","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.20072761,0.00016464615,0.79168445,0.0001793337,0.0012723499,0.00088323955,0.000015375841,0.00079048896,0.0042825267],"genre_scores_gemma":[0.9831129,0.00047703262,0.012477843,0.00030387053,0.00020897272,0.0000042474508,0.000024129475,0.00003247171,0.0033585425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997417,0.000371759,0.00028276182,0.0014032339,0.00015859524,0.00036666315],"domain_scores_gemma":[0.99768245,0.0000883924,0.00032302432,0.0015362285,0.00019269485,0.00017722792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058421615,0.00040119202,0.0004561193,0.00033204872,0.00014503072,0.0003305082,0.0016495506,0.00051524997,0.000025207371],"category_scores_gemma":[0.000033526554,0.0004596525,0.00018948688,0.00040701663,0.00011244636,0.0005437326,0.0025408152,0.00066004694,0.00009582087],"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.000030102547,0.00009109232,0.001270017,0.00013380828,0.000120819925,0.00006554261,0.0011215813,0.14039595,0.00022585955,0.8545644,0.0014818438,0.0004989777],"study_design_scores_gemma":[0.0014785313,0.00017806613,0.000716873,0.00015452855,0.00010320529,0.000013983775,0.000037954607,0.75676477,0.0014338114,0.22268973,0.015135827,0.001292695],"about_ca_topic_score_codex":0.0002698234,"about_ca_topic_score_gemma":0.000026011941,"teacher_disagreement_score":0.7823853,"about_ca_system_score_codex":0.00017369619,"about_ca_system_score_gemma":0.0003883074,"threshold_uncertainty_score":0.99978554},"labels":[],"label_agreement":null},{"id":"W2928802847","doi":"10.1063/1.5089582","title":"A fusion of principal component analysis and singular value decomposition based multivariate denoising algorithm for free induction decay transversal data","year":2019,"lang":"en","type":"article","venue":"Review of Scientific Instruments","topic":"Blind Source Separation 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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Principal component analysis; Singular value decomposition; Noise reduction; Noise (video); Algorithm; Transversal (combinatorics); Singular spectrum analysis; Filter (signal processing); Computer science; Mathematics; Pattern recognition (psychology); Artificial intelligence","score_opus":0.030140648500189736,"score_gpt":0.3184713658914135,"score_spread":0.2883307173912238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2928802847","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.3378346,0.00029615767,0.6606571,0.00010961956,0.00022011124,0.0007583912,0.00007651162,0.000029706687,0.000017783323],"genre_scores_gemma":[0.5031397,0.00017035563,0.4962608,0.000060393082,0.000006456154,0.000008742904,0.00034045865,0.0000061104943,0.0000070097285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793756,0.00018615376,0.0005966089,0.0005811041,0.0005433387,0.0001552596],"domain_scores_gemma":[0.99796,0.00005505701,0.00047501194,0.0012176768,0.00023531499,0.00005698892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024859775,0.00012980371,0.00040890905,0.00041123191,0.00012502591,0.00010579812,0.0008929529,0.000055853972,0.000009123919],"category_scores_gemma":[0.000032670763,0.00012011623,0.00012281544,0.0010205895,0.000086039334,0.0007320312,0.0003164786,0.00006866959,0.0000012789495],"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.00002000096,0.00043567494,0.0009372424,0.002739769,0.00028227968,5.4783385e-7,0.00046233545,0.00008018843,0.14735356,0.0031246077,0.000053661384,0.84451014],"study_design_scores_gemma":[0.0008807543,0.00011517213,0.002701822,0.0022624012,0.00031243483,0.000002589254,0.000008470934,0.845911,0.14666851,0.000244315,0.0007106991,0.00018181861],"about_ca_topic_score_codex":0.000053975626,"about_ca_topic_score_gemma":0.0000042198417,"teacher_disagreement_score":0.8458308,"about_ca_system_score_codex":0.00004652414,"about_ca_system_score_gemma":0.000095579926,"threshold_uncertainty_score":0.4898198},"labels":[],"label_agreement":null},{"id":"W2935895774","doi":"10.1109/icassp.2019.8682310","title":"Detection of Non Random Phase Signal in Additive Noise with Surrogate Analysis","year":2019,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"SIGNAL (programming language); Signal transfer function; Detection theory; Gaussian; Computer science; Gaussian noise; Noise (video); Surrogate data; Signal processing; Algorithm; Multiplicative noise; Higher-order statistics; Normality; Speech recognition; Phase (matter); Pattern recognition (psychology); Nonlinear system; Mathematics; Artificial intelligence; Statistics; Analog signal; Digital signal processing; Telecommunications; Physics","score_opus":0.006019997797316641,"score_gpt":0.2529528104956352,"score_spread":0.2469328126983186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2935895774","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.40077338,0.0000017403426,0.5973653,0.000019091634,0.0000067717633,0.00014322525,0.0000013016204,0.00004914267,0.0016399906],"genre_scores_gemma":[0.9909072,0.0000019558931,0.008815887,0.00005954619,0.0000035289622,0.000014563653,0.0000036833599,0.0000029473276,0.00019071253],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99926883,0.0000809157,0.00017492316,0.0002060587,0.00017588616,0.00009338836],"domain_scores_gemma":[0.9994482,0.0000915717,0.000100711164,0.00023647919,0.000096026124,0.000027059468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033395007,0.00007145148,0.00019812387,0.00040712208,0.00001273884,0.000029887673,0.00018511391,0.00003572241,0.00008301405],"category_scores_gemma":[0.0000056028875,0.00005515915,0.000060077145,0.0012530725,0.000017668826,0.00037515073,0.000032322645,0.00007162942,0.000014244529],"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.0040836213,0.0028667836,0.03217195,0.00007129189,0.0015774582,0.000050144477,0.017624842,0.019548139,0.5811711,0.016163377,0.00020054595,0.32447076],"study_design_scores_gemma":[0.0029156215,0.00040225437,0.0034435918,0.000008749851,0.000026200649,9.417194e-7,0.000048204452,0.4271945,0.56570625,0.00010723471,0.000049587146,0.00009687129],"about_ca_topic_score_codex":0.00020911226,"about_ca_topic_score_gemma":0.00042647988,"teacher_disagreement_score":0.5901338,"about_ca_system_score_codex":0.000019622059,"about_ca_system_score_gemma":0.00003193099,"threshold_uncertainty_score":0.22493249},"labels":[],"label_agreement":null},{"id":"W2937708047","doi":"10.1109/mwscas.2018.8623889","title":"Blind Source Separation as Pre-processing to Unsupervised Keyword Spotting via an ICA Mixture Model","year":2018,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Keyword spotting; Computer science; Spotting; Speech recognition; Blind signal separation; TIMIT; Preprocessor; Artificial intelligence; Independent component analysis; Speech processing; Pattern recognition (psychology); Hidden Markov model","score_opus":0.023175757968805204,"score_gpt":0.33411913009069577,"score_spread":0.31094337212189055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2937708047","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.1582145,0.000010016048,0.82910526,0.0013794476,0.000048282604,0.0003245129,4.1789582e-7,0.001134879,0.009782682],"genre_scores_gemma":[0.62505347,6.579189e-7,0.36863032,0.004105113,0.00013485138,0.000021983991,0.000004526594,0.000018243101,0.0020308197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980444,0.00011199975,0.0003555492,0.00068630424,0.00044164076,0.00036013036],"domain_scores_gemma":[0.9984804,0.000030000341,0.00011260922,0.0007544152,0.0003819193,0.00024065425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061217876,0.00022769826,0.00018547126,0.00023332305,0.00037697513,0.00068585115,0.0009861059,0.00017236275,0.00004565745],"category_scores_gemma":[0.000048624075,0.00021146622,0.000051764204,0.00074293185,0.000049603932,0.0017479638,0.0002544048,0.00019271183,0.0001672072],"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.0003234291,0.00060891523,0.00032329303,0.000063339365,0.00004035024,0.000007793369,0.11775091,0.041697264,0.15833937,0.048507303,0.008635383,0.62370265],"study_design_scores_gemma":[0.00021908774,0.00026547274,0.000085706546,0.00002180756,0.000004660134,0.000010837143,0.000060032056,0.9357656,0.054309763,0.006253847,0.0027100418,0.00029311428],"about_ca_topic_score_codex":0.000051001844,"about_ca_topic_score_gemma":0.000050638377,"teacher_disagreement_score":0.89406836,"about_ca_system_score_codex":0.000046810306,"about_ca_system_score_gemma":0.00016311649,"threshold_uncertainty_score":0.86233425},"labels":[],"label_agreement":null},{"id":"W2944424715","doi":"10.1109/sitis.2018.00020","title":"Estimating the Properties of the Single-Trial Speech Auditory Brainstem Response Using an Accurate AR Model","year":2018,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"SABR volatility model; Parametric statistics; Computer science; Statistics; Speech recognition; Mathematics; Econometrics; Stochastic volatility; Volatility (finance)","score_opus":0.1264717718667356,"score_gpt":0.31745335905070465,"score_spread":0.19098158718396904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944424715","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5489959,0.000003156389,0.44930676,0.00061075203,0.0002805755,0.00026677054,3.0507422e-7,0.00014827606,0.0003874895],"genre_scores_gemma":[0.81036186,6.787924e-8,0.18866214,0.00051513256,0.00022689797,0.0000061178694,5.517362e-8,0.00000835332,0.00021940118],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983555,0.0005887056,0.00030686505,0.00023614433,0.0003465411,0.0001662484],"domain_scores_gemma":[0.9985019,0.00009789591,0.00022447358,0.00092055806,0.00022412342,0.000031031443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017926602,0.0001128258,0.000115659874,0.000056407094,0.00034879416,0.00022386693,0.0012247033,0.00006216752,0.0000026133348],"category_scores_gemma":[0.00031239833,0.000057479047,0.000055827903,0.000284592,0.00025147892,0.00073373073,0.00037394738,0.0001266983,0.0000036312017],"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.0025445274,0.00029197897,0.00000965606,0.00002085881,0.000026808033,0.0000012855562,0.022838261,0.048486862,0.9044052,0.010432506,0.0010867837,0.009855316],"study_design_scores_gemma":[0.00044108587,0.00013766468,0.00001041316,0.000031632062,0.0000027829417,0.0000053172203,0.00006000077,0.7777505,0.22048652,0.00094532623,0.00005587714,0.00007285537],"about_ca_topic_score_codex":0.000026847249,"about_ca_topic_score_gemma":0.00001916846,"teacher_disagreement_score":0.72926366,"about_ca_system_score_codex":0.000044537588,"about_ca_system_score_gemma":0.00028386878,"threshold_uncertainty_score":0.2682678},"labels":[],"label_agreement":null},{"id":"W2947659587","doi":"10.1109/jbhi.2019.2920356","title":"Separation of Fetal-ECG From Single-Channel Abdominal ECG Using Activation Scaled Non-Negative Matrix Factorization","year":2019,"lang":"en","type":"article","venue":"IEEE Journal of Biomedical and Health Informatics","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":67,"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; Canada Research Chairs","keywords":"Non-negative matrix factorization; Pattern recognition (psychology); Computer science; Artificial intelligence; Blind signal separation; Matrix decomposition; Electrocardiography; SIGNAL (programming language); Fetus; Independent component analysis; Channel (broadcasting); Medicine; Cardiology; Pregnancy","score_opus":0.04086625933964426,"score_gpt":0.3411678111525153,"score_spread":0.30030155181287105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947659587","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.25963178,0.000015236704,0.7390916,0.00073977734,0.00030194607,0.00017241789,0.000006005039,0.000014420797,0.00002687116],"genre_scores_gemma":[0.72886294,0.000046611793,0.27060944,0.00036727238,0.00009365269,6.62195e-7,0.0000075601306,0.00000447408,0.0000074034688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769396,0.00007379871,0.001375922,0.00007725178,0.0006149188,0.00016415279],"domain_scores_gemma":[0.9972446,0.00015051934,0.0019584217,0.00013543901,0.00032616314,0.0001848608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009891267,0.00012130675,0.00036464396,0.00033951868,0.0000819092,0.00008169593,0.0002243009,0.00013778573,0.000006914651],"category_scores_gemma":[0.000053812204,0.000097807744,0.000058709953,0.0003449558,0.000063845175,0.0015269672,0.00004331976,0.00024065537,0.0000033711233],"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.0010262682,0.0022986743,0.0060281325,0.0036287992,0.0005754639,0.000009806021,0.16946177,0.009042974,0.15925017,0.0026594086,0.005483917,0.64053464],"study_design_scores_gemma":[0.001047055,0.0009979935,0.001059031,0.00041457854,0.000010201051,0.000027240232,0.0005046357,0.97030115,0.022135796,0.0031894105,0.00018842894,0.00012448247],"about_ca_topic_score_codex":0.000043015796,"about_ca_topic_score_gemma":0.0000015767753,"teacher_disagreement_score":0.9612582,"about_ca_system_score_codex":0.00012978069,"about_ca_system_score_gemma":0.00037827098,"threshold_uncertainty_score":0.3988484},"labels":[],"label_agreement":null},{"id":"W2948382333","doi":"10.48550/arxiv.1906.03148","title":"Unsupervised and Supervised Principal Component Analysis: Tutorial","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Blind Source Separation Techniques","field":"Computer Science","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 Waterloo","funders":"","keywords":"Kernel principal component analysis; Principal component analysis; Singular value decomposition; Projection (relational algebra); Pattern recognition (psychology); Artificial intelligence; Kernel (algebra); Sparse PCA; Principal component regression; Computer science; Mathematics; Kernel method; Algorithm; Support vector machine","score_opus":0.061005261189599036,"score_gpt":0.200586262534909,"score_spread":0.13958100134530996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948382333","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.49686128,0.000040315255,0.5005971,0.00012704852,0.00041040962,0.00038219403,0.00001324782,0.00045155108,0.0011168184],"genre_scores_gemma":[0.994097,0.00012195078,0.004683192,0.00019840275,0.00008577403,0.0000019511056,0.000051816147,0.00001694565,0.0007429674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750865,0.00033982744,0.00028892866,0.0013629438,0.00017541996,0.00032425032],"domain_scores_gemma":[0.99758893,0.00011993474,0.00022224337,0.001672307,0.00019659611,0.00020000972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047998197,0.0003735987,0.0005933957,0.00068910315,0.00011913218,0.00031627805,0.001704236,0.00039851188,0.00002914742],"category_scores_gemma":[0.000019544324,0.000427878,0.00033561653,0.0010065184,0.00009422543,0.00044786814,0.0026681274,0.00061534584,0.00004713671],"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.00012024577,0.00033424,0.026930155,0.00017645163,0.0017600316,0.00020505265,0.0029104427,0.3074039,0.00026668762,0.6590165,0.00035279038,0.000523483],"study_design_scores_gemma":[0.0008138951,0.00007117404,0.008636457,0.00003446475,0.00041639962,0.0000019838112,0.00005529073,0.9786165,0.00023660922,0.009363475,0.0011323289,0.00062143116],"about_ca_topic_score_codex":0.0002745765,"about_ca_topic_score_gemma":0.000057422767,"teacher_disagreement_score":0.6712126,"about_ca_system_score_codex":0.00015233054,"about_ca_system_score_gemma":0.00023455691,"threshold_uncertainty_score":0.9998173},"labels":[],"label_agreement":null},{"id":"W2949362865","doi":"","title":"First official version of ICA-AtoM","year":2011,"lang":"en","type":"article","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"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":"Independent component analysis; Artificial intelligence; Computer science","score_opus":0.026919560172255986,"score_gpt":0.24214647275143775,"score_spread":0.21522691257918175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949362865","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.04096862,0.0001938476,0.6742116,0.010443668,0.0011073463,0.0007666404,0.000032752512,0.0015492967,0.2707262],"genre_scores_gemma":[0.9303095,0.000044951874,0.0691213,0.00020846848,0.00012242785,0.00005792185,0.00002131799,0.000024502937,0.00008963894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99725676,0.0002817531,0.00065867533,0.0006207793,0.0007218293,0.00046022466],"domain_scores_gemma":[0.9978158,0.00015631478,0.00042670575,0.000854982,0.00045992693,0.0002863087],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000698549,0.00030868556,0.00037375608,0.00048245143,0.00037781248,0.000115848474,0.0013699252,0.000373258,0.0000472228],"category_scores_gemma":[0.00020101135,0.0003049883,0.00021502376,0.00081786775,0.000027898821,0.0008430227,0.00045391984,0.00040024816,0.000024822091],"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.000077478115,0.00043100945,0.0002518747,0.000032169675,0.000042089818,0.0000355743,0.0032202052,0.000024455376,0.0008908643,0.993332,0.00082323194,0.0008390256],"study_design_scores_gemma":[0.0007974153,0.00018483268,0.0068360064,0.0000997831,0.000029403904,0.0003051114,0.00013360518,0.0020605272,0.019677527,0.0034081114,0.9660112,0.0004564497],"about_ca_topic_score_codex":0.000003118988,"about_ca_topic_score_gemma":0.0000772459,"teacher_disagreement_score":0.9899239,"about_ca_system_score_codex":0.00022992035,"about_ca_system_score_gemma":0.00044549807,"threshold_uncertainty_score":0.9999402},"labels":[],"label_agreement":null},{"id":"W2949656111","doi":"","title":"DETECTION AND ESTIMATION OF SPIKES IN PRESENCE OF NOISE AND INTERFERENCE","year":2014,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Kootenay Association for Science & Technology","funders":"","keywords":"Interference (communication); Noise (video); Computer science; Estimation; Artificial intelligence; Telecommunications; Engineering","score_opus":0.011040815714708533,"score_gpt":0.2544960943611749,"score_spread":0.24345527864646635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949656111","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.3908194,0.0000065895883,0.6086128,0.000045898734,0.0000058255578,0.000036491398,4.5877506e-8,0.000017029955,0.00045594646],"genre_scores_gemma":[0.94538856,0.0000069864836,0.054574788,0.000014773507,0.0000010342578,0.000002592647,5.349612e-8,8.095077e-7,0.000010407285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996713,0.000037996284,0.00011670538,0.000090590685,0.000051494637,0.000031956686],"domain_scores_gemma":[0.9997095,0.00009075429,0.000053145664,0.000106520805,0.00002849076,0.000011625481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023219133,0.00002959064,0.00006136948,0.00006521101,0.0000066594266,0.0000148056415,0.000082995866,0.000020958121,8.0220815e-7],"category_scores_gemma":[0.00010483914,0.000026096815,0.000004231769,0.00009818323,0.000035262354,0.000277584,0.0000622857,0.00002725551,1.6180665e-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.000013413596,0.000050350787,0.01145157,0.00009507112,0.0000014697898,1.2302128e-7,0.0036715216,0.00045492873,0.11699592,0.13996138,0.000010753575,0.7272935],"study_design_scores_gemma":[0.00007614429,0.00011603851,0.038549278,0.000028207201,5.428387e-7,0.0000016766116,0.000012986076,0.63280684,0.3192422,0.009129544,0.00000462245,0.000031892738],"about_ca_topic_score_codex":0.00010736295,"about_ca_topic_score_gemma":0.000098594035,"teacher_disagreement_score":0.7272616,"about_ca_system_score_codex":0.0000024170024,"about_ca_system_score_gemma":0.000004844633,"threshold_uncertainty_score":0.10641972},"labels":[],"label_agreement":null},{"id":"W2949893072","doi":"10.48550/arxiv.1206.6442","title":"Minimizing The Misclassification Error Rate Using a Surrogate Convex\\n Loss","year":2012,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Blind Source Separation 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":"University of Waterloo","funders":"","keywords":"Statistics; Surrogate endpoint; Mathematics; Computer science; Algorithm; Econometrics; Medicine; Internal medicine","score_opus":0.22127047145661763,"score_gpt":0.24118968525934328,"score_spread":0.019919213802725655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949893072","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.33181235,0.00012942978,0.6632679,0.0012447791,0.0009846847,0.00094163447,0.000015970876,0.0003696226,0.0012336153],"genre_scores_gemma":[0.9920621,0.00041808133,0.004724045,0.0005962094,0.00021457415,0.0000043331743,0.000021727506,0.000062304454,0.0018966288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936597,0.002256205,0.000772627,0.0020174177,0.00026631184,0.00102778],"domain_scores_gemma":[0.9935838,0.0006117169,0.0015789778,0.0030908193,0.0007236124,0.00041110395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031108593,0.0008397777,0.0007304162,0.00046880863,0.0010968868,0.0007227587,0.0038799976,0.00075151544,0.00013048467],"category_scores_gemma":[0.000106322725,0.0008363524,0.0005476786,0.0016992391,0.0008533502,0.0017320238,0.0026079968,0.0015936346,0.0003152868],"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.0002805827,0.0007162259,0.005792806,0.00030923836,0.00061511964,0.00026135708,0.014469637,0.22129159,0.0042404546,0.74978095,0.00048490055,0.001757155],"study_design_scores_gemma":[0.00069129944,0.000048086767,0.0022044878,0.00026084366,0.00034114422,0.00003331544,0.0007394885,0.97584385,0.0033330333,0.010214576,0.0051830243,0.0011068442],"about_ca_topic_score_codex":0.00034636914,"about_ca_topic_score_gemma":0.00005091725,"teacher_disagreement_score":0.75455225,"about_ca_system_score_codex":0.000620489,"about_ca_system_score_gemma":0.00080892275,"threshold_uncertainty_score":0.9994087},"labels":[],"label_agreement":null},{"id":"W2951735440","doi":"10.48550/arxiv.1503.01147","title":"Random Pulse Train Spectrum Calculation Unleashed","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Train; Pulse (music); Spectral density; Blank; Spectrum (functional analysis); SIGNAL (programming language); Pulse wave; Power (physics); Cover (algebra); Mathematics; Statistical physics; Pulse duration; Mathematical analysis; Physics; Algorithm; Computer science; Telecommunications; Optics; Statistics; Engineering; Quantum mechanics","score_opus":0.07752239289706081,"score_gpt":0.2104536105091986,"score_spread":0.1329312176121378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951735440","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.06448455,0.00003247984,0.92283607,0.000605519,0.0003327398,0.00048373963,0.000009127588,0.00087663514,0.0103391325],"genre_scores_gemma":[0.9925704,0.00003608027,0.004592117,0.00021393484,0.00008106152,0.0000018690961,0.000040455652,0.000019852121,0.002444242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979192,0.0003873936,0.00024826953,0.000984513,0.00015675067,0.00030388118],"domain_scores_gemma":[0.9979769,0.00007859922,0.00027802837,0.0012669202,0.00018943104,0.00021014955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000800963,0.00031192834,0.0003725581,0.00037718832,0.00010168579,0.00021253432,0.0015248781,0.00037724053,0.00003310374],"category_scores_gemma":[0.000060916635,0.0003587857,0.0002200607,0.00060905283,0.000080481106,0.0005465126,0.0010375817,0.0006016653,0.000107194835],"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.00012778124,0.00016933387,0.0005490939,0.000045865454,0.00010880737,0.00024660392,0.0015960209,0.39706376,0.00007273927,0.59555423,0.0031877186,0.0012780131],"study_design_scores_gemma":[0.0013138606,0.000052399162,0.0005769568,0.000041845073,0.0000393727,0.0000058575815,0.000029050841,0.7973222,0.0004677694,0.19819862,0.001458883,0.0004931508],"about_ca_topic_score_codex":0.00019327845,"about_ca_topic_score_gemma":0.000085089654,"teacher_disagreement_score":0.9280858,"about_ca_system_score_codex":0.00031247007,"about_ca_system_score_gemma":0.0003837761,"threshold_uncertainty_score":0.9998864},"labels":[],"label_agreement":null},{"id":"W2952838147","doi":"10.1101/217281","title":"Decoding the auditory brain with canonical component analysis","year":2017,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Blind Source Separation Techniques","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":"Trinity College","funders":"Horizon 2020 Framework Programme; Irish Research Council; Agence Nationale de la Recherche","keywords":"Stimulus (psychology); Canonical correlation; Stimulus–response model; Perception; Brain–computer interface; Correlation; Decoding methods; Computer science; Speech recognition; Classifier (UML); Psychology; Electroencephalography; Cognitive psychology; Pattern recognition (psychology); Artificial intelligence; Neuroscience; Mathematics; Algorithm","score_opus":0.01773401879640794,"score_gpt":0.2493047668492413,"score_spread":0.23157074805283337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952838147","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.16218168,0.00041577197,0.8257168,0.008099618,0.0010335185,0.00091162213,0.000047439968,0.001500698,0.00009283332],"genre_scores_gemma":[0.95295393,0.00004927061,0.045369048,0.000979268,0.0003636615,0.0002128075,2.4702547e-7,0.000056515917,0.000015234259],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99641234,0.0004551257,0.0005267402,0.0012862995,0.00076948444,0.0005500354],"domain_scores_gemma":[0.99336416,0.00028523346,0.00089523214,0.0046970714,0.0004998844,0.00025839967],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019476989,0.0005519538,0.0007079587,0.00046219234,0.00067321124,0.0016663434,0.0040019094,0.00042327828,0.000012314817],"category_scores_gemma":[0.00020938886,0.00042312095,0.00031022896,0.0007440028,0.0002797991,0.00041048796,0.001789515,0.0012235275,0.000032187458],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029545958,0.0025656102,0.097427584,0.0013177963,0.022797046,0.0016517338,0.0015386388,0.022408808,0.40659168,0.35599262,0.08722322,0.0001898267],"study_design_scores_gemma":[0.0015470663,0.00030633443,0.63706356,0.0008192162,0.0019371008,1.5866515e-7,0.000009461843,0.13043965,0.1266581,0.000083741164,0.09623008,0.004905511],"about_ca_topic_score_codex":0.00015655794,"about_ca_topic_score_gemma":0.000049749302,"teacher_disagreement_score":0.79077226,"about_ca_system_score_codex":0.00028284529,"about_ca_system_score_gemma":0.0013911127,"threshold_uncertainty_score":0.9998221},"labels":[],"label_agreement":null},{"id":"W29531279","doi":"10.1038/s41598-018-21603-7","title":"Activation Detection and Characterisation in Brain fMRI Sequences. Application to the study of monkey vision.","year":2001,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":true,"ca_institutions":"","funders":"Canadian Institutes of Health Research","keywords":"Computer science; Artificial intelligence; Smoothing; Pattern recognition (psychology); Autocorrelation; Impulse response; Cluster analysis; Impulse (physics); Statistical power; Algorithm; Machine learning; Computer vision; Mathematics; Statistics","score_opus":0.014762516588864688,"score_gpt":0.28895676573261525,"score_spread":0.27419424914375057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29531279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5124183,9.08913e-7,0.48401082,0.0029200015,0.000009560264,0.00046867272,5.73999e-8,0.000052855525,0.000118813055],"genre_scores_gemma":[0.99721885,0.0000040905447,0.0020466095,0.00054977246,0.000012525443,0.000128036,8.9212176e-7,0.0000030640156,0.000036140307],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99920386,0.00012470315,0.00021004197,0.00021518563,0.00017745412,0.000068771544],"domain_scores_gemma":[0.99946153,0.000072844654,0.000098324694,0.00028151798,0.000064465086,0.000021306902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000587,0.000060666294,0.000071547765,0.0001750752,0.000057977777,0.00006812804,0.00020602114,0.0000351161,0.0000020591106],"category_scores_gemma":[0.000040685605,0.000045750956,0.000008449014,0.0006560108,0.000009794932,0.000601602,0.0000656369,0.00006608227,0.000003591422],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003567155,0.0004003961,0.009515458,0.0000056284844,0.000006336792,4.4241804e-7,0.020299438,0.0010722327,0.21870457,0.0064200647,0.00010770088,0.74343204],"study_design_scores_gemma":[0.00043966246,0.0006934285,0.7710397,0.000014214931,0.000002239821,0.000005530274,0.0012093879,0.15126452,0.070577875,0.0026429547,0.0019394602,0.00017098976],"about_ca_topic_score_codex":0.0005896564,"about_ca_topic_score_gemma":0.00089402084,"teacher_disagreement_score":0.76152426,"about_ca_system_score_codex":0.000035182704,"about_ca_system_score_gemma":0.000011596058,"threshold_uncertainty_score":0.18656698},"labels":[],"label_agreement":null},{"id":"W2955189066","doi":"10.5539/ijel.v9n4p275","title":"Influence of L1 Background on Categorical Perception of Mandarin Tones by Russian and Vietnamese Listeners","year":2019,"lang":"en","type":"article","venue":"International Journal of English Linguistics","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mandarin Chinese; Vietnamese; Tone (literature); Categorical perception; Psychology; Perception; Categorical variable; Linguistics; Audiology; Identification (biology); Speech recognition; Speech perception; Mathematics; Computer science; Medicine; Statistics","score_opus":0.009460147057394624,"score_gpt":0.2823468255927166,"score_spread":0.272886678535322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955189066","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9739235,0.000045301545,0.015864436,0.000109711575,0.0016941372,0.00007158175,0.000011363357,0.00002046762,0.008259501],"genre_scores_gemma":[0.99074227,0.000072254756,0.008562239,0.0001521658,0.00039486075,5.3870684e-7,0.000002979871,0.0000063882517,0.00006633023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986534,0.000054201704,0.0005214456,0.00012571792,0.000566703,0.00007851454],"domain_scores_gemma":[0.99395037,0.00014532497,0.00053585146,0.00015211232,0.005157794,0.000058566973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004071532,0.000093257506,0.00019784711,0.00020076401,0.000014833544,0.00007218138,0.00057907583,0.00007034357,0.000010153869],"category_scores_gemma":[0.002987617,0.00008302995,0.0000630455,0.000097241274,0.000066751745,0.0001737249,0.00012736862,0.000202483,0.0000015178776],"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.00041970843,0.0007984089,0.016098691,0.00011009693,0.00029849025,0.00004333253,0.011861706,0.012482325,0.005803555,0.9405819,0.0047160084,0.006785785],"study_design_scores_gemma":[0.014147548,0.012721934,0.255831,0.0027131375,0.00028733912,0.00020690687,0.0070737344,0.04588632,0.07824294,0.13170853,0.44807872,0.0031018688],"about_ca_topic_score_codex":0.000022359847,"about_ca_topic_score_gemma":0.0000014325185,"teacher_disagreement_score":0.80887336,"about_ca_system_score_codex":0.00006460644,"about_ca_system_score_gemma":0.00009047136,"threshold_uncertainty_score":0.35766724},"labels":[],"label_agreement":null},{"id":"W2955301088","doi":"10.1109/ccgrid.2019.00092","title":"A Performance Improvement Approach for Second-Order Optimization in Large Mini-batch Training","year":2019,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":2,"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":"Core Research for Evolutional Science and Technology; Canadian Institute for Advanced Research; Nvidia","keywords":"Overfitting; Computer science; Generalization; Regularization (linguistics); Artificial intelligence; Smoothing; Artificial neural network; Deep learning; Training (meteorology); Deep neural networks; Training set; Machine learning; Algorithm; Mathematical optimization; Mathematics","score_opus":0.019474099695965506,"score_gpt":0.2522402888070221,"score_spread":0.2327661891110566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955301088","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.05430331,0.0000044092053,0.9263132,0.00017292716,0.000052433727,0.0007328563,0.0000013955545,0.00017098799,0.018248469],"genre_scores_gemma":[0.46459913,0.0000014374423,0.5330813,0.00066542457,0.000008314033,0.000118936056,0.000011156799,0.0000060222883,0.0015083094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990989,0.00002055717,0.00021710765,0.00030265804,0.00012707978,0.0002337199],"domain_scores_gemma":[0.99952984,0.000030507405,0.00006380341,0.00027482453,0.00007213418,0.000028905211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059329096,0.000094669056,0.00012406641,0.00012294402,0.000036896196,0.000085153435,0.0003262204,0.00006288781,0.000080716214],"category_scores_gemma":[0.0000091782995,0.00008773339,0.000028496579,0.0002950574,0.000005770652,0.000606013,0.00007609464,0.00007785969,0.0000066803123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012346132,0.0016899189,0.014339437,0.00079018774,0.00008809293,0.0000014125646,0.07832472,0.39075258,0.0073998077,0.3190455,0.0043379706,0.18310691],"study_design_scores_gemma":[0.0006329386,0.00016382337,0.0002179249,0.000005966369,7.302841e-7,8.261711e-7,0.00026255765,0.99450713,0.0029734957,0.00010093991,0.0010046528,0.00012900545],"about_ca_topic_score_codex":0.0000032389614,"about_ca_topic_score_gemma":0.0000073890683,"teacher_disagreement_score":0.6037546,"about_ca_system_score_codex":0.000031872536,"about_ca_system_score_gemma":0.00007106711,"threshold_uncertainty_score":0.3577664},"labels":[],"label_agreement":null},{"id":"W2956278201","doi":"10.1103/physreva.100.012106","title":"Robustness of quantum-enhanced adaptive phase estimation","year":2019,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Canadian Institute for Advanced Research; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Alberta Innovates - Technology Futures; Western Canada Research Grid; Compute Canada","keywords":"Robustness (evolution); Quantum; Computer science; Estimation; Phase (matter); Control theory (sociology); Physics; Artificial intelligence; Quantum mechanics; Engineering; Biology; Systems engineering","score_opus":0.0237997882945037,"score_gpt":0.3940029084845834,"score_spread":0.3702031201900797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956278201","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.058783747,0.012847564,0.92299485,0.0011822615,0.000104728446,0.0021682214,0.000009355982,0.0002834602,0.0016257976],"genre_scores_gemma":[0.9622519,0.022724658,0.0127022285,0.0018050703,0.00012069355,0.00029773172,0.00002383474,0.000034340508,0.000039560393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966179,0.0005212271,0.00079989,0.0007823012,0.0008906714,0.00038798025],"domain_scores_gemma":[0.9967497,0.0004933681,0.0007281774,0.0014056027,0.00042765285,0.00019547435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006942942,0.00042024817,0.0016039188,0.00006944315,0.000054476608,0.00004647891,0.0012043454,0.00004377794,0.000029075545],"category_scores_gemma":[0.00049175334,0.000335972,0.00064253755,0.0012749832,0.00010493856,0.0010087277,0.00029593974,0.0004097627,0.0004132578],"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.000034742083,0.0031119036,0.000004936535,0.010386292,0.00008809333,0.0000029213938,0.00033982767,0.0008974701,0.054664522,0.69771135,0.003509937,0.22924797],"study_design_scores_gemma":[0.00059632934,0.00092069345,0.000036295936,0.014747474,0.00016148826,0.0000035731553,0.0000038154885,0.875921,0.07195573,0.032381713,0.0026688178,0.00060307083],"about_ca_topic_score_codex":0.0000061190576,"about_ca_topic_score_gemma":3.4091678e-7,"teacher_disagreement_score":0.9102926,"about_ca_system_score_codex":0.00006546443,"about_ca_system_score_gemma":0.0001425733,"threshold_uncertainty_score":0.9999092},"labels":[],"label_agreement":null},{"id":"W2957968307","doi":"10.18280/rces.040401","title":"Blind source separation algorithm for convolution mixed signals","year":2017,"lang":"en","type":"article","venue":"Review of Computer Engineering Studies","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Lanzhou Jiaotong University","keywords":"Blind signal separation; Separation (statistics); Algorithm; Convolution (computer science); Computer science; Source separation; Speech recognition; Artificial intelligence; Telecommunications; Machine learning; Channel (broadcasting)","score_opus":0.04335046213439338,"score_gpt":0.3568014376633207,"score_spread":0.3134509755289273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2957968307","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.00015115505,0.029763622,0.9680609,0.00082140794,0.00039732194,0.0005679963,0.000002704508,0.00021385965,0.000021021542],"genre_scores_gemma":[0.014260386,0.02060906,0.96420956,0.00040182314,0.0002441818,0.00017862493,0.0000069057137,0.00001860899,0.000070859045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893606,0.000040172563,0.00041332783,0.00025357708,0.00019338081,0.0001634767],"domain_scores_gemma":[0.9984139,0.0001795348,0.0003556827,0.000620036,0.00039681798,0.00003403291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080865907,0.00016874725,0.0004744893,0.000082740116,0.00016444192,0.00009857296,0.0006487915,0.000041639418,5.4763166e-7],"category_scores_gemma":[0.00014244344,0.00015442944,0.00014761309,0.00008458434,0.000039307,0.0004609087,0.00026404392,0.00007096717,0.0000036410152],"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.0000037671768,0.000089804664,0.000020496089,0.008674739,0.00046075202,0.0000018856476,0.00087280927,0.005719228,0.00045896246,0.025838044,0.02046162,0.9373979],"study_design_scores_gemma":[0.00046468695,0.00018446354,0.0003546008,0.005459409,0.00004602074,0.000007561718,0.0000035801995,0.9368156,0.0051781195,0.0004817232,0.050690066,0.00031416063],"about_ca_topic_score_codex":0.0000015131061,"about_ca_topic_score_gemma":3.174798e-7,"teacher_disagreement_score":0.9370837,"about_ca_system_score_codex":0.000029943596,"about_ca_system_score_gemma":0.000026203614,"threshold_uncertainty_score":0.62974495},"labels":[],"label_agreement":null},{"id":"W2965510792","doi":"10.1109/lsp.2019.2931150","title":"An Improved Stationarity Test Based on Surrogates","year":2019,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Blind Source Separation 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":"Institut National de la Recherche Scientifique","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Test (biology); Algorithm; Machine learning; Data mining; Artificial intelligence","score_opus":0.01111671907144038,"score_gpt":0.2569364101170627,"score_spread":0.24581969104562232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965510792","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.14653984,0.0000043981004,0.8473857,0.0046742265,0.00008458943,0.00021962513,0.0000034903178,0.0006352013,0.00045295493],"genre_scores_gemma":[0.94028765,1.253992e-7,0.045355618,0.014243883,0.000045176905,0.000017011262,0.000008351594,0.00001534487,0.00002683689],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986968,0.000092609895,0.00019478328,0.00044244304,0.00033938032,0.00023397041],"domain_scores_gemma":[0.99911183,0.0002037491,0.0001341928,0.00036198116,0.000110071946,0.000078198434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004306917,0.00015690656,0.00012777028,0.00015417645,0.00012382967,0.00046209907,0.0006040263,0.00005817821,0.00001854483],"category_scores_gemma":[0.00001642596,0.00014964298,0.0000399213,0.0003009849,0.000043118904,0.0010359894,0.000016971591,0.0002115255,0.000055058452],"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.000027446133,0.00035587972,0.0049083196,0.000074994714,0.00000558028,0.000006696686,0.0010355717,0.019552505,0.94119877,0.0004554864,0.0011650205,0.031213725],"study_design_scores_gemma":[0.00029267388,0.0002734475,0.0017835255,0.00004361644,0.0000022554464,0.0000014863514,0.000010713263,0.90242255,0.09431863,0.00042799284,0.00018778439,0.00023531745],"about_ca_topic_score_codex":0.000015288404,"about_ca_topic_score_gemma":0.0000024927724,"teacher_disagreement_score":0.8828701,"about_ca_system_score_codex":0.00004968805,"about_ca_system_score_gemma":0.00013969348,"threshold_uncertainty_score":0.61022633},"labels":[],"label_agreement":null},{"id":"W2971936035","doi":"10.1080/24709360.2019.1660110","title":"A frequentist mixture modeling of stop signal reaction times","year":2019,"lang":"en","type":"article","venue":"Biostatistics & Epidemiology","topic":"Blind Source Separation 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":"Hospital for Sick Children; Public Health Ontario; University of Toronto","funders":"","keywords":"Frequentist inference; SIGNAL (programming language); Computer science; Econometrics; Statistics; Algorithm; Mathematics; Bayesian probability; Bayesian inference","score_opus":0.035524784508415765,"score_gpt":0.3131540366445244,"score_spread":0.2776292521361086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971936035","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.0071822796,0.00017089484,0.9891166,0.0010032795,0.00024311915,0.00018809226,0.000028851933,0.0001540135,0.0019128872],"genre_scores_gemma":[0.6216811,0.000037066184,0.37732202,0.0007216262,0.000025345214,0.0000059784456,0.000030129113,0.000007647082,0.00016909663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823505,0.00048662542,0.0005563802,0.00036378985,0.00011635832,0.00024182291],"domain_scores_gemma":[0.9979467,0.0010366226,0.00032805407,0.0004597855,0.0001679533,0.000060889644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001311154,0.00013388194,0.00038330382,0.00013443544,0.00003824015,0.000012279683,0.0004088212,0.00017787736,0.000044632856],"category_scores_gemma":[0.00054658117,0.00012585106,0.00006323393,0.00016476861,0.00005875168,0.0002169527,0.000106096166,0.00020634431,0.00007833083],"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.00000994593,0.000034381046,0.0012156902,0.000024638604,0.000020103074,0.000002646881,0.00024316354,0.0017513019,0.008808347,0.98058474,0.0034735294,0.0038315225],"study_design_scores_gemma":[0.00016620243,0.00019174152,0.0008951912,0.000025867217,0.000009435832,0.000020375292,0.000017855216,0.7997234,0.0012617875,0.1950896,0.0024259035,0.0001726404],"about_ca_topic_score_codex":0.00016147303,"about_ca_topic_score_gemma":0.000007805797,"teacher_disagreement_score":0.7979721,"about_ca_system_score_codex":0.00003633659,"about_ca_system_score_gemma":0.00008280139,"threshold_uncertainty_score":0.5132057},"labels":[],"label_agreement":null},{"id":"W2977694530","doi":"","title":"Channel identification and tracking using alternating projections","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McMaster University","funders":"","keywords":"Expectation–maximization algorithm; Iterative method; Tracking (education); Identification (biology); Channel (broadcasting); Maximization; Algorithm; Maximum likelihood; Computer science; MIMO; Mathematics; Mathematical optimization; Statistics; Telecommunications","score_opus":0.060317493924712265,"score_gpt":0.320974547631109,"score_spread":0.26065705370639675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977694530","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.060022965,0.000016970289,0.9361416,0.00014452911,0.00007050435,0.000100978905,9.247719e-8,0.00024452904,0.0032578032],"genre_scores_gemma":[0.88668066,0.0000037361058,0.1129769,0.00011405381,0.0000097151,0.00000660896,2.0137144e-7,0.0000033593728,0.00020478012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949247,0.000051899813,0.00012230288,0.00016807813,0.000085908905,0.00007937159],"domain_scores_gemma":[0.99969894,0.000020280333,0.000056592406,0.00014810178,0.00005474545,0.000021342663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036768045,0.0000452491,0.000040304007,0.00009589427,0.00013896535,0.00026464107,0.00010240907,0.000022401071,0.000002472299],"category_scores_gemma":[0.00004932447,0.000044671728,0.000012129666,0.000197932,0.0000107716305,0.0006616336,0.000025772617,0.00005000944,0.0000022473837],"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":[4.6758143e-7,0.0000623292,0.00068870076,0.000012447738,0.000011175959,0.0000016439358,0.0052099833,0.0008858549,0.042222857,0.93718374,0.00010236449,0.013618448],"study_design_scores_gemma":[0.0001452461,0.000023668297,0.0013769927,0.000018795841,0.000004355281,0.00009700011,0.0002662053,0.68908507,0.27941516,0.028480595,0.00086769095,0.00021919628],"about_ca_topic_score_codex":0.000030234665,"about_ca_topic_score_gemma":0.0000067564106,"teacher_disagreement_score":0.90870315,"about_ca_system_score_codex":0.00001566929,"about_ca_system_score_gemma":0.000021101361,"threshold_uncertainty_score":0.255194},"labels":[],"label_agreement":null},{"id":"W2978374180","doi":"10.29173/aar46","title":"Perception of Unfamiliar English Phonemes by Native Mandarin Speakers","year":2019,"lang":"en","type":"article","venue":"Alberta Academic Review","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mandarin Chinese; Utterance; Psychology; Context (archaeology); Vowel; Perception; Speech perception; First language; Linguistics; Lexical decision task; Speech recognition; Computer science; Cognition","score_opus":0.00887988521550258,"score_gpt":0.2767398565125783,"score_spread":0.2678599712970757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978374180","genre_codex":"other","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.20410943,0.26599884,0.15959756,0.028855883,0.0024524906,0.010923913,0.000041636664,0.001465592,0.32655463],"genre_scores_gemma":[0.5743231,0.37883925,0.012545289,0.018968048,0.000121610115,0.00014737278,0.00007094957,0.00005594559,0.014928429],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99835753,0.00021768696,0.0005160557,0.00039067175,0.00033408284,0.00018395053],"domain_scores_gemma":[0.99873745,0.00022819557,0.0003006453,0.0005233343,0.00014944482,0.000060917646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079621706,0.0001639593,0.00039165636,0.00006544519,0.000026590838,0.000018877521,0.00091435807,0.00014832914,0.00020727169],"category_scores_gemma":[0.00021767817,0.00014242205,0.00011493707,0.00041934775,0.000048878246,0.00066190335,0.00017013754,0.00041080322,0.0002192708],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014686266,0.00013231029,0.008592113,0.003714115,0.00013511893,9.64929e-7,0.019737976,0.000010622623,0.011909237,0.11591273,0.6220827,0.21775742],"study_design_scores_gemma":[0.0003711197,0.0001393431,0.0010484033,0.0033990357,0.00003507084,0.0000073095425,0.00015527746,0.00079008046,0.0050199525,0.0015421035,0.9870186,0.0004737024],"about_ca_topic_score_codex":0.0001629795,"about_ca_topic_score_gemma":0.000003998617,"teacher_disagreement_score":0.37021366,"about_ca_system_score_codex":0.000046920464,"about_ca_system_score_gemma":0.00005930548,"threshold_uncertainty_score":0.5807803},"labels":[],"label_agreement":null},{"id":"W2979305364","doi":"10.1109/embc.2019.8856905","title":"Higher Resolution sLORETA (HR-sLORETA) in EEG Source Imaging","year":2019,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Thresholding; Artificial intelligence; Computer science; Otsu's method; Pattern recognition (psychology); Image resolution; Resolution (logic); Subspace topology; Electroencephalography; Computer vision; Image (mathematics); Neuroscience","score_opus":0.009995515105504713,"score_gpt":0.24294966916010463,"score_spread":0.2329541540545999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979305364","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.048308738,0.00010970052,0.8051724,0.0051544937,0.0003096714,0.00034722616,3.3651597e-7,0.001106264,0.13949117],"genre_scores_gemma":[0.952608,0.0000046295822,0.036612872,0.0020823819,0.000023181086,0.000012897602,0.0000025154761,0.000012245201,0.008641312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868006,0.000107406275,0.00024682825,0.00040879747,0.0002799489,0.00027697926],"domain_scores_gemma":[0.99912477,0.00005319954,0.000072355986,0.0006427873,0.000053122225,0.000053792042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054802524,0.00012716031,0.00014480375,0.00022166067,0.00003878655,0.00017914288,0.0006546118,0.000063122876,0.00017014385],"category_scores_gemma":[0.000012947904,0.00011785708,0.000051559404,0.00046175535,0.000029789566,0.00087465753,0.00026359173,0.00019607665,0.000456276],"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.000016402364,0.00011945687,0.047162306,0.000019704887,0.0000104885,0.000011869606,0.0023524133,0.00066651247,0.008450102,0.8774667,0.026666097,0.03705795],"study_design_scores_gemma":[0.0011383919,0.00011631355,0.103601,0.00007589162,0.0000048067127,0.000022152437,0.00011244242,0.6357896,0.013399177,0.021252407,0.22365397,0.000833896],"about_ca_topic_score_codex":0.00011144258,"about_ca_topic_score_gemma":0.000016145646,"teacher_disagreement_score":0.9042992,"about_ca_system_score_codex":0.00006878336,"about_ca_system_score_gemma":0.000040020444,"threshold_uncertainty_score":0.5864657},"labels":[],"label_agreement":null},{"id":"W2979412028","doi":"10.1063/1.5119387","title":"Adaptive pre-whiten filtering for the free induction decay transversal signal in weak magnetic detection","year":2019,"lang":"en","type":"article","venue":"Review of Scientific Instruments","topic":"Blind Source Separation Techniques","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China; Foundation of Science and Technology on Near-Surface Detection Laboratory","keywords":"Singular value decomposition; Noise (video); Noise reduction; Signal-to-noise ratio (imaging); Stochastic resonance; SIGNAL (programming language); Interference (communication); Algorithm; Free induction decay; Transversal (combinatorics); Physics; Adaptive filter; Salt-and-pepper noise; Filter (signal processing); Mathematics; Computer science; Acoustics; Median filter; Statistics; Artificial intelligence; Channel (broadcasting); Spin echo; Mathematical analysis; Telecommunications","score_opus":0.020696958158022676,"score_gpt":0.2604512456622498,"score_spread":0.23975428750422714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979412028","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5171888,0.004087186,0.46457413,0.001345435,0.0029552614,0.006783934,0.00003159418,0.00020781117,0.0028259014],"genre_scores_gemma":[0.98815024,0.00050272525,0.010661482,0.00009738062,0.000016096736,0.00013561368,0.000004128254,0.000007722114,0.0004246052],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985535,0.00010790285,0.00039576212,0.00036549813,0.000389737,0.00018760748],"domain_scores_gemma":[0.9990145,0.00005912449,0.00018776052,0.00058813015,0.00012034598,0.00003013176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015333405,0.00011145412,0.00018811108,0.00017485298,0.00010566563,0.00011323408,0.0008392043,0.000048551126,0.00004279148],"category_scores_gemma":[0.000026134629,0.000085506064,0.00009777983,0.00070400175,0.000073304174,0.0006385144,0.00012158179,0.0001221096,0.000013095085],"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.00001831674,0.000060865597,0.00012747372,0.0007327095,0.000012810519,1.2697777e-7,0.0007074081,0.000033897897,0.022545325,0.0028027454,0.00021422471,0.9727441],"study_design_scores_gemma":[0.0038205562,0.002366675,0.015331538,0.014826781,0.00013417234,0.000048307716,0.0004578088,0.29669014,0.591768,0.0074783466,0.0658817,0.0011959717],"about_ca_topic_score_codex":0.000020273872,"about_ca_topic_score_gemma":0.000025751522,"teacher_disagreement_score":0.97154814,"about_ca_system_score_codex":0.00006723414,"about_ca_system_score_gemma":0.00006867135,"threshold_uncertainty_score":0.3486836},"labels":[],"label_agreement":null},{"id":"W2990080654","doi":"10.5539/jmr.v11n6p70","title":"Effect of Mixed Spikes on Different Types of Complex Waves","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Representation (politics); Series (stratigraphy); MATLAB; Variable (mathematics); Spike (software development); Power (physics); Domain (mathematical analysis); Order (exchange); Statistical physics; Mathematical analysis; Computer science; Thermodynamics; Physics","score_opus":0.08726103045742012,"score_gpt":0.41639518791913344,"score_spread":0.3291341574617133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990080654","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9664725,0.000042996442,0.030383727,0.0002862991,0.00006217095,0.0002279249,0.0000010728678,0.000010732077,0.0025125947],"genre_scores_gemma":[0.9797453,0.000027376595,0.020009426,0.0000065532836,0.000017858009,0.0000014713186,2.0263425e-7,0.0000074758127,0.00018432619],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99754834,0.00049012323,0.0005191851,0.00008781493,0.0012027173,0.00015183017],"domain_scores_gemma":[0.9966829,0.0019677957,0.00040605367,0.0004082519,0.00047801028,0.000057030455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004164687,0.00008452914,0.00041491733,0.00045566747,0.000023585915,0.000044860102,0.0008780883,0.00005147742,0.000043951182],"category_scores_gemma":[0.0003983416,0.000052542087,0.00012237213,0.00024500696,0.00007129343,0.00012477709,0.00017555663,0.00031696248,0.00001992965],"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.00035881987,0.0027368704,0.0029957076,0.004375753,0.0002765482,0.00002418211,0.009190914,0.0004761354,0.5286603,0.4120821,0.008145697,0.030676933],"study_design_scores_gemma":[0.00066933106,0.0062287417,0.0020819646,0.00062371395,0.000009114988,0.000024628382,0.00010816779,0.0178216,0.9517204,0.02040069,0.00021901901,0.00009261233],"about_ca_topic_score_codex":0.0000020101725,"about_ca_topic_score_gemma":6.2542307e-7,"teacher_disagreement_score":0.4230601,"about_ca_system_score_codex":0.0000311387,"about_ca_system_score_gemma":0.00005569534,"threshold_uncertainty_score":0.21426041},"labels":[],"label_agreement":null},{"id":"W2996538552","doi":"","title":"Blind Deconvolution of Seismograms Regularized via Minimum Support","year":2010,"lang":"en","type":"article","venue":"AGU Fall Meeting Abstracts","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Seismogram; Deconvolution; Convolution (computer science); Source function; Algorithm; Blind deconvolution; Blind signal separation; Gaussian; Mathematics; Computer science; Geology; Physics; Seismology; Channel (broadcasting); Artificial intelligence","score_opus":0.016082427317240706,"score_gpt":0.26346235726214,"score_spread":0.2473799299448993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996538552","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9157308,0.000010155205,0.07266416,0.0007222458,0.00041356325,0.00024412815,0.0000013816032,0.00046102583,0.009752577],"genre_scores_gemma":[0.8352066,0.0000029172604,0.16423063,0.0002668957,0.00005794295,0.00001258957,0.000010423839,0.000013684917,0.00019828309],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982808,0.00007418729,0.00059794856,0.00039738318,0.00033230532,0.00031734482],"domain_scores_gemma":[0.9982611,0.00018746805,0.000466753,0.00071525155,0.00023388801,0.00013555234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015317199,0.00017407197,0.00023357605,0.00017393008,0.00009381664,0.00011880414,0.00075684115,0.00023376539,0.0000042318675],"category_scores_gemma":[0.0002870584,0.00017803132,0.00010555667,0.00029137018,0.000091816866,0.00047974486,0.00014885655,0.00040243706,0.000043271684],"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.000109958004,0.00097339426,0.0169406,0.00012879621,0.00011502225,0.00005675923,0.0060534184,0.0006800359,0.886731,0.017038973,0.0039076605,0.06726437],"study_design_scores_gemma":[0.0039264723,0.00084491004,0.10482965,0.00021829057,0.000075499156,0.0002751857,0.00014238794,0.10233311,0.7286572,0.02723729,0.029745951,0.0017140848],"about_ca_topic_score_codex":0.0011337305,"about_ca_topic_score_gemma":0.0010526797,"teacher_disagreement_score":0.15807386,"about_ca_system_score_codex":0.000015432237,"about_ca_system_score_gemma":0.00012509608,"threshold_uncertainty_score":0.72599065},"labels":[],"label_agreement":null},{"id":"W2998344628","doi":"10.1155/2020/2134516","title":"Multivariate Statistical Analysis on a SEM/EDS Phase Map of Rare Earth Minerals","year":2020,"lang":"en","type":"article","venue":"Scanning","topic":"Blind Source Separation Techniques","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":"McGill University","funders":"Hydro-Québec; McGill University","keywords":"Principal component analysis; Non-negative matrix factorization; Independent component analysis; Preprocessor; Multivariate statistics; Pattern recognition (psychology); Phase (matter); Computer science; Artificial intelligence; Chemometrics; Identification (biology); Analytical Chemistry (journal); Mathematics; Chemistry; Statistics; Matrix decomposition; Chromatography; Physics; Machine learning","score_opus":0.03608360391816863,"score_gpt":0.3337290527614472,"score_spread":0.2976454488432786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998344628","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.024822256,0.000027758548,0.9715739,0.002299655,0.000026488493,0.00009701097,0.000024976056,0.00019582723,0.0009321129],"genre_scores_gemma":[0.78964746,6.6667997e-7,0.20913285,0.0010188663,0.000026069685,0.0000058994287,0.000014183244,0.0000055826195,0.00014843763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989172,0.00012959326,0.00024921205,0.00029306658,0.00025986964,0.00015105172],"domain_scores_gemma":[0.99931633,0.0001110826,0.00011345724,0.0002702673,0.000072365256,0.00011650186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022853713,0.00009986249,0.00023834361,0.00016664136,0.00004505248,0.00007384021,0.00033421812,0.00003954661,0.000066299515],"category_scores_gemma":[0.000101334306,0.000093340284,0.00007797262,0.0006881976,0.000028322473,0.00017534029,0.0001004123,0.000120175966,0.000025067005],"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.0004686242,0.001212417,0.0048972834,0.0002426022,0.0019063121,0.00035055156,0.06266352,0.04059845,0.18341036,0.4832098,0.051859286,0.16918081],"study_design_scores_gemma":[0.0012059337,0.0007200995,0.0019494138,0.00004561756,0.000105756415,0.0000013002251,0.00008536993,0.92498165,0.056937657,0.00096450397,0.012668861,0.0003338498],"about_ca_topic_score_codex":0.00004340432,"about_ca_topic_score_gemma":0.0000034211346,"teacher_disagreement_score":0.8843832,"about_ca_system_score_codex":0.0000075422276,"about_ca_system_score_gemma":0.00004244475,"threshold_uncertainty_score":0.38063064},"labels":[],"label_agreement":null},{"id":"W3002788228","doi":"10.1007/978-3-030-40014-9_1","title":"Fourier Spectral Domain Functional Principal Component Analysis of EEG Signals","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Toronto Metropolitan University","funders":"","keywords":"Computer science; Pattern recognition (psychology); Artificial intelligence; Principal component analysis; Functional principal component analysis; Feature extraction; Electroencephalography; Feature (linguistics); Signal processing; Fourier transform; SIGNAL (programming language); Frequency domain; Speech recognition; Computer vision; Mathematics; Digital signal processing","score_opus":0.0235584288822606,"score_gpt":0.2558635877495776,"score_spread":0.23230515886731704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002788228","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.0005773643,0.000112704794,0.9931581,0.0016762251,0.0004364856,0.00036005423,0.000015742591,0.00022819557,0.003435148],"genre_scores_gemma":[0.36482695,0.000012054808,0.63253856,0.002237491,0.00019523886,0.000010228317,0.000026795453,0.000026263642,0.0001264244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954359,0.00009197891,0.00084352994,0.0014755348,0.001694102,0.00045895972],"domain_scores_gemma":[0.99722505,0.00044760146,0.0005597095,0.0012357351,0.00031225153,0.00021964354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012230319,0.00049577805,0.0009267397,0.001898101,0.00015048802,0.0003200882,0.0025622793,0.00029098633,0.000099201396],"category_scores_gemma":[0.00005614702,0.00046842036,0.00043066035,0.0020511646,0.00063728745,0.00046653545,0.0011529868,0.00078966276,0.000020470183],"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.000045288765,0.00015896189,0.00040703578,0.000060716713,0.0006258829,0.00013901741,0.0032664922,0.3255427,0.0033713917,0.5754989,0.00013793466,0.09074569],"study_design_scores_gemma":[0.00026344074,0.00027606543,0.0024565968,0.000101448226,0.00010915628,0.000019184941,2.9855582e-7,0.7936717,0.004679009,0.1957627,0.0019223066,0.0007380622],"about_ca_topic_score_codex":0.000016320237,"about_ca_topic_score_gemma":0.000058024856,"teacher_disagreement_score":0.46812904,"about_ca_system_score_codex":0.00024437768,"about_ca_system_score_gemma":0.0005949716,"threshold_uncertainty_score":0.9997767},"labels":[],"label_agreement":null},{"id":"W3003569488","doi":"10.1049/iet-rsn.2019.0329","title":"Grid‐less coherent DOA estimation based on fourth‐order cumulants with Gaussian coloured noise","year":2020,"lang":"en","type":"article","venue":"IET Radar Sonar & Navigation","topic":"Blind Source Separation Techniques","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 Calgary","funders":"National Natural Science Foundation of China","keywords":"Cumulant; Gaussian noise; Estimation; Noise (video); Gaussian; Grid; Computer science; Order (exchange); Mathematics; Algorithm; Statistical physics; Statistics; Physics; Artificial intelligence; Engineering; Economics","score_opus":0.022510032038209615,"score_gpt":0.26654999273649904,"score_spread":0.24403996069828943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003569488","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.06631313,0.000011327305,0.9192223,0.01259471,0.00010552972,0.0006806743,0.000018360277,0.00067556574,0.00037838338],"genre_scores_gemma":[0.7090368,0.0000022021786,0.28868833,0.0019020454,0.00007716681,0.000057364774,0.00019113466,0.000023277193,0.00002163877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801135,0.0001935542,0.00030981426,0.00052502245,0.0007158455,0.00024443283],"domain_scores_gemma":[0.9988916,0.00008102753,0.0002477929,0.00041573247,0.00018653572,0.00017732133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026765902,0.00024222767,0.0002221661,0.00008736583,0.00017792128,0.00024422017,0.00046401762,0.0001239404,0.00001656987],"category_scores_gemma":[0.00003116009,0.00021568606,0.00005393398,0.0007120428,0.00004674837,0.0005818328,0.00004803756,0.00027523364,0.000073586896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015701575,0.0017965863,0.0055597755,0.000512186,0.00020355807,0.00036844047,0.02733415,0.50007296,0.015775729,0.044579063,0.038256284,0.36397114],"study_design_scores_gemma":[0.0011009078,0.00062130333,0.0025272588,0.0001584999,0.000015133782,0.000008292558,0.000050725623,0.97470665,0.01760898,0.000546437,0.0023253823,0.00033043063],"about_ca_topic_score_codex":0.00004278636,"about_ca_topic_score_gemma":0.00001676183,"teacher_disagreement_score":0.6427237,"about_ca_system_score_codex":0.000097800454,"about_ca_system_score_gemma":0.00020339827,"threshold_uncertainty_score":0.87954223},"labels":[],"label_agreement":null},{"id":"W3004406681","doi":"10.1109/icdar.2019.00237","title":"Blind Source Separation Based Framework for Multispectral Document Images Binarization","year":2019,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Independent component analysis; Principal component analysis; Pattern recognition (psychology); Multispectral image; Blind signal separation; Focus (optics); Matrix decomposition; Computer vision","score_opus":0.013270023459634524,"score_gpt":0.3154302395753448,"score_spread":0.30216021611571026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004406681","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.008923016,0.000013764039,0.9854325,0.002790785,0.00016915696,0.00094652496,0.0000011942793,0.000671673,0.0010514072],"genre_scores_gemma":[0.4926138,0.0000014495238,0.50516015,0.001088737,0.000028758299,0.00006618603,0.000012120825,0.000009117134,0.001019661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988765,0.00006652338,0.0002310347,0.00038093558,0.00023872941,0.00020626247],"domain_scores_gemma":[0.99905264,0.00016954326,0.00011586429,0.00047970132,0.00012833149,0.000053893575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037651043,0.00013320951,0.00012784443,0.00015070435,0.00008711147,0.0003676819,0.00039477798,0.00011792543,0.00007272417],"category_scores_gemma":[0.00005463415,0.00012396323,0.000075538635,0.00029642877,0.000015199695,0.0007744938,0.00005576099,0.00010638974,0.00011129982],"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.00004952055,0.00012246931,0.00077781535,0.000029162196,0.000014051564,3.6950476e-7,0.0010164939,0.0077709137,0.0074622743,0.97254974,0.0016689148,0.008538265],"study_design_scores_gemma":[0.0012297737,0.00044094908,0.0007980693,0.000039114424,0.0000072882103,0.0000017375701,0.00003776773,0.727275,0.18915255,0.068181045,0.012454134,0.00038257218],"about_ca_topic_score_codex":0.00001339839,"about_ca_topic_score_gemma":0.0000035073544,"teacher_disagreement_score":0.9043687,"about_ca_system_score_codex":0.000050625917,"about_ca_system_score_gemma":0.00007416406,"threshold_uncertainty_score":0.5055074},"labels":[],"label_agreement":null},{"id":"W3008800301","doi":"10.1109/isspit47144.2019.9001818","title":"EEG signal Extraction Utilizing Null Space Approach","year":2019,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Windsor","funders":"","keywords":"Electroencephalography; Independent component analysis; Computer science; Artifact (error); Pattern recognition (psychology); Artificial intelligence; FastICA; SIGNAL (programming language); Noise (video); Null (SQL); Blind signal separation; Speech recognition; Data mining; Channel (broadcasting); Image (mathematics)","score_opus":0.021446244914664476,"score_gpt":0.27297892068831175,"score_spread":0.2515326757736473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008800301","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.008719834,0.000011311914,0.70307475,0.0003928876,0.000064568994,0.00013788418,7.6747405e-8,0.000540002,0.28705865],"genre_scores_gemma":[0.730636,0.0000020026216,0.26403376,0.00037028926,0.000014700988,0.000007103343,0.0000011775036,0.0000051486804,0.004929852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916685,0.00005725659,0.00012206811,0.00028727658,0.0002160767,0.00015044873],"domain_scores_gemma":[0.9994313,0.00004387463,0.000056417386,0.00037692237,0.000046310488,0.000045133955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003342972,0.00008446106,0.00008663042,0.00008915046,0.000043543765,0.0001540274,0.00037038498,0.00006512622,0.00013772024],"category_scores_gemma":[0.0000054589373,0.00007582141,0.000042336917,0.00022432236,0.000013838769,0.0008065454,0.00009513997,0.00014035005,0.00035559002],"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.000004177696,0.00010069875,0.0006342232,0.000011668312,0.0000074276436,0.0000012348241,0.0012299769,0.00026249443,0.020615764,0.96155006,0.004001197,0.011581052],"study_design_scores_gemma":[0.00046563894,0.00021224903,0.0038640106,0.000018872377,0.0000051337356,0.0000659214,0.0007812126,0.82372123,0.10623208,0.010676269,0.05336106,0.0005963241],"about_ca_topic_score_codex":0.00003188289,"about_ca_topic_score_gemma":0.0000015330335,"teacher_disagreement_score":0.9508738,"about_ca_system_score_codex":0.000026148287,"about_ca_system_score_gemma":0.000034874975,"threshold_uncertainty_score":0.4570509},"labels":[],"label_agreement":null},{"id":"W3013178132","doi":"10.1109/ieeeconf44664.2019.9048912","title":"Blind Co-Channel Source Separation for Pulse-On-Pulse Interference","year":2019,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Lockheed Martin (Canada)","funders":"","keywords":"Narrowband; Wideband; Interference (communication); Computer science; Electronic engineering; Pulse (music); Channel (broadcasting); Radar; Waveform; Pulse-Doppler radar; Acoustics; Telecommunications; Physics; Engineering; Radar imaging","score_opus":0.03299196866650779,"score_gpt":0.32814723707211924,"score_spread":0.29515526840561146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013178132","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.021199275,0.0000064995743,0.9408652,0.0011812728,0.00019236401,0.0007959151,0.000003294725,0.00054102467,0.035215132],"genre_scores_gemma":[0.96120095,0.000003003517,0.024441287,0.002530557,0.00004965411,0.00010623523,0.00001800247,0.000015109056,0.01163521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870247,0.00006427574,0.00027596502,0.00047503784,0.00023601754,0.00024626398],"domain_scores_gemma":[0.99880874,0.00020247707,0.00011337521,0.00064381363,0.00015397709,0.00007761512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044667168,0.00017040712,0.00017587132,0.00018329077,0.00008519944,0.00029358227,0.00072215265,0.00010867605,0.0001335169],"category_scores_gemma":[0.000045721146,0.00015085882,0.00008290752,0.00021981285,0.000021852762,0.00066256954,0.000099835386,0.00013792119,0.0006304946],"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.00038073398,0.0005516773,0.00039367235,0.000087680775,0.00007373622,0.0000020227685,0.009428435,0.005265792,0.011429346,0.8559298,0.050277542,0.066179544],"study_design_scores_gemma":[0.0018476272,0.0016634326,0.0003645127,0.000059454593,0.0000068994973,0.0000116181045,0.00016650626,0.7754212,0.1685215,0.021948146,0.029285192,0.0007038825],"about_ca_topic_score_codex":0.000013759423,"about_ca_topic_score_gemma":0.000010275345,"teacher_disagreement_score":0.94000167,"about_ca_system_score_codex":0.000039009665,"about_ca_system_score_gemma":0.00006136683,"threshold_uncertainty_score":0.8103943},"labels":[],"label_agreement":null},{"id":"W3016777030","doi":"10.1109/tnsre.2020.2987709","title":"High-Density Surface EMG Denoising Using Independent Vector Analysis","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Systems and Rehabilitation Engineering","topic":"Blind Source Separation 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":"University of British Columbia","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Canonical correlation; Independent component analysis; Noise reduction; Additive white Gaussian noise; Noise (video); Pattern recognition (psychology); Blind signal separation; Distortion (music); Mean squared error; Speech recognition; Signal-to-noise ratio (imaging); Computer science; Artificial intelligence; Interference (communication); Mathematics; White noise; Statistics; Telecommunications","score_opus":0.014646483253918732,"score_gpt":0.22955735958808385,"score_spread":0.2149108763341651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016777030","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.42977905,0.000020419004,0.5691515,0.00045630886,0.00019340163,0.00014381876,0.0000033637941,0.00025106754,0.0000010623593],"genre_scores_gemma":[0.97429854,0.00000260019,0.025582759,0.0000613114,0.000025619962,0.00000806481,9.760356e-7,0.000012738801,0.0000074047307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880433,0.00011525724,0.00031180336,0.00036189574,0.00025540014,0.00015131649],"domain_scores_gemma":[0.99927527,0.00022611185,0.00007405127,0.00021400132,0.00008080195,0.0001297605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024530408,0.00015563259,0.0002537121,0.00019968476,0.00013757434,0.00019879758,0.00013978804,0.00007817819,0.0000019757156],"category_scores_gemma":[0.00001525436,0.00015366991,0.000115436065,0.0008550473,0.000019311348,0.000485736,0.000003589132,0.00020451339,0.0000021136325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004334959,0.000015587186,0.000054341916,0.00004516369,0.00005969089,0.0000016110804,0.0013616299,0.9814438,0.016066281,0.0006681859,0.000003277895,0.00027605775],"study_design_scores_gemma":[0.00014173515,0.00012014489,0.00211069,0.00002230819,0.000051190844,0.0000059712593,0.00008726672,0.9923955,0.0048722154,0.000007095617,0.000018429508,0.00016745139],"about_ca_topic_score_codex":0.00027028605,"about_ca_topic_score_gemma":0.000011462303,"teacher_disagreement_score":0.5445195,"about_ca_system_score_codex":0.000068488764,"about_ca_system_score_gemma":0.000015730076,"threshold_uncertainty_score":0.6266477},"labels":[],"label_agreement":null},{"id":"W3021941172","doi":"10.1080/01621459.2020.1764365","title":"Spectral Inference under Complex Temporal Dynamics","year":2020,"lang":"en","type":"article","venue":"Journal of the American Statistical Association","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 Toronto","funders":"","keywords":"Inference; Statistical inference; Range (aeronautics); Computer science; Frequency domain; Nonlinear system; Spectral density; White noise; Statistical hypothesis testing; Mathematics; Algorithm; Mathematical optimization; Applied mathematics; Statistics; Artificial intelligence; Physics","score_opus":0.027531239290293157,"score_gpt":0.30928871737059793,"score_spread":0.28175747808030477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021941172","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.019903304,0.0000021700496,0.9298785,0.049772054,0.00007473805,0.000050772196,0.000014323605,0.000038743336,0.00026543275],"genre_scores_gemma":[0.8736153,0.0000035763564,0.12068193,0.0055713244,0.00007553823,5.160157e-7,0.0000023919704,0.000004774949,0.000044597917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99851966,0.000308823,0.0003705752,0.00010230076,0.0005536698,0.00014498715],"domain_scores_gemma":[0.9979258,0.00048145928,0.0011554561,0.00012117344,0.00021372159,0.00010238459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003910491,0.00008028595,0.00022688894,0.000034335495,0.00006404792,0.00015160655,0.00060816435,0.000023639792,0.000014888588],"category_scores_gemma":[0.00083912455,0.00005767335,0.00008055319,0.00042429983,0.000064807165,0.0002633211,0.00010925825,0.00031532245,0.000009655519],"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.00006157634,0.00016993702,0.06942963,0.000009328453,0.00015431286,0.000015074314,0.0016513655,0.001581805,0.0010386084,0.8469356,0.051509388,0.027443431],"study_design_scores_gemma":[0.00036521128,0.0005728532,0.663945,0.000012479626,0.00003496358,0.000012925707,0.0001918807,0.27256933,0.00021016077,0.059412215,0.0024570965,0.00021587202],"about_ca_topic_score_codex":0.00010387876,"about_ca_topic_score_gemma":0.00009038031,"teacher_disagreement_score":0.853712,"about_ca_system_score_codex":0.00042209562,"about_ca_system_score_gemma":0.00017232113,"threshold_uncertainty_score":0.23518509},"labels":[],"label_agreement":null},{"id":"W3022510701","doi":"10.3847/2515-5172/ab8d43","title":"sslf: A Simple Spectral-line Finder","year":2020,"lang":"et","type":"article","venue":"Research Notes of the AAS","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Simple (philosophy); Line (geometry); Computer science; Mathematics; Geometry; Philosophy; Epistemology","score_opus":0.30549515311727293,"score_gpt":0.44127515648975585,"score_spread":0.13578000337248292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022510701","genre_codex":"commentary","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.23515391,0.0014470097,0.20429513,0.54727876,0.00026679423,0.002391067,0.000105556355,0.00046072123,0.008601023],"genre_scores_gemma":[0.9902733,0.000105863546,0.0069477246,0.0018037657,0.00025139062,0.000012620694,0.0000028039722,0.000023894825,0.0005786587],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9957439,0.0010839528,0.00041623187,0.00051796174,0.001599168,0.00063883886],"domain_scores_gemma":[0.99657065,0.0011962279,0.00015207408,0.0013306201,0.0005109854,0.00023942786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002432762,0.00017857211,0.00029520277,0.00014617425,0.00026426036,0.0002864389,0.0032543715,0.00014506973,0.00022318025],"category_scores_gemma":[0.0031001319,0.00013299391,0.00021514663,0.0017249932,0.00042832253,0.00032002188,0.0021990251,0.0011091303,0.00025740758],"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.0005791178,0.0017216294,0.006701545,0.0012061499,0.00050986174,0.00010381533,0.052046355,0.0068834303,0.23597865,0.2542116,0.3798029,0.06025492],"study_design_scores_gemma":[0.0006583184,0.0012209936,0.0034970583,0.00016187926,0.000015138782,0.000007105881,0.00017076964,0.1346376,0.76368034,0.06133846,0.03422776,0.00038457572],"about_ca_topic_score_codex":0.0003484378,"about_ca_topic_score_gemma":0.000051110525,"teacher_disagreement_score":0.7551194,"about_ca_system_score_codex":0.00006555135,"about_ca_system_score_gemma":0.0005382417,"threshold_uncertainty_score":0.6047486},"labels":[],"label_agreement":null},{"id":"W3028421557","doi":"10.1002/cem.3235","title":"CATTELL'S parallel proportional profiles","year":2020,"lang":"en","type":"article","venue":"Journal of Chemometrics","topic":"Blind Source Separation 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":"Western University","funders":"","keywords":"Rotation (mathematics); Covariance; Decomposition; Tensor (intrinsic definition); TRACE (psycholinguistics); Simple (philosophy); Computer science; Factor (programming language); Mathematics; Applied mathematics; Algorithm; Statistics; Artificial intelligence; Pure mathematics; Chemistry","score_opus":0.03842134327046663,"score_gpt":0.26661377679371945,"score_spread":0.2281924335232528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028421557","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.009917078,0.0002637491,0.96065885,0.027358897,0.00010436131,0.000083925566,7.279571e-7,0.00007380016,0.0015386321],"genre_scores_gemma":[0.6266718,0.00006386226,0.36963075,0.0032940067,0.00023100051,0.0000017841953,8.1026957e-7,0.000007858774,0.000098164775],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986437,0.000037398808,0.00044650477,0.0001174985,0.0006371193,0.0001177998],"domain_scores_gemma":[0.99869734,0.000069608046,0.00050182786,0.00013167747,0.0004360007,0.00016351849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005215478,0.000082620325,0.00018073835,0.0003902858,0.000032396416,0.00011933533,0.0007117463,0.000056616565,0.000021709826],"category_scores_gemma":[0.00058053306,0.00006751616,0.00010405885,0.0019155906,0.0000231115,0.0005963236,0.000098591205,0.0002754197,0.000018312654],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017628183,0.0013540296,0.025222793,0.00029147434,0.0003265619,0.00055224035,0.010236053,0.0023144025,0.02292831,0.2586093,0.49059874,0.18738979],"study_design_scores_gemma":[0.0034763077,0.0034256151,0.02178693,0.00010605218,0.0000709967,0.0012903902,0.00029454174,0.04066422,0.38250762,0.037214898,0.5077719,0.0013905022],"about_ca_topic_score_codex":3.5007164e-7,"about_ca_topic_score_gemma":3.503157e-8,"teacher_disagreement_score":0.6167547,"about_ca_system_score_codex":0.000033347747,"about_ca_system_score_gemma":0.00021172994,"threshold_uncertainty_score":0.27532288},"labels":[],"label_agreement":null},{"id":"W3035652623","doi":"10.1016/j.ijpsycho.2020.06.004","title":"Scanning acoustic short-term memory: Evidence for two subsystems with different time-course and memory strength","year":2020,"lang":"en","type":"article","venue":"International Journal of Psychophysiology","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; International Laboratory for Brain, Music and Sound Research; Institut Universitaire de Gériatrie de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Echoic memory; Tone (literature); Short-term memory; Set (abstract data type); Psychology; Working memory; Audiology; Task (project management); Electrophysiology; Serial position effect; Electroencephalography; Cognition; Encoding (memory); Memoria; Speech recognition; Computer science; Neuroscience","score_opus":0.04058509056442937,"score_gpt":0.348120792012818,"score_spread":0.3075357014483886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035652623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.649956,0.00023203957,0.3440757,0.004896978,0.00053657737,0.00018455136,0.0000051551874,0.00005057187,0.00006241081],"genre_scores_gemma":[0.9898766,0.000038665203,0.008276683,0.0011454655,0.0005992481,0.000013575205,0.0000027961576,0.000012628783,0.00003429468],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868196,0.00011358215,0.00041401768,0.00027648456,0.00036080554,0.00015316404],"domain_scores_gemma":[0.99849665,0.00034581753,0.0003731735,0.00016162165,0.00048359483,0.00013916472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023421051,0.00015792034,0.00029403222,0.00012203022,0.00004513236,0.00012185945,0.00093537086,0.00005112163,0.000011712325],"category_scores_gemma":[0.000084182364,0.00011832828,0.000088375156,0.00008766741,0.00007457397,0.00052773266,0.00009920207,0.00021009598,0.0000030705355],"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.0021243389,0.00039447876,0.0023771955,0.00008631324,0.00097229105,0.00016015103,0.005399946,0.005063412,0.9285062,0.0024000313,0.007311496,0.045204155],"study_design_scores_gemma":[0.019372324,0.020574251,0.08700676,0.0041963016,0.00061228895,0.0034000808,0.0012792354,0.65616995,0.19112098,0.012036667,0.0011760404,0.0030551099],"about_ca_topic_score_codex":0.0000033307585,"about_ca_topic_score_gemma":0.000002948872,"teacher_disagreement_score":0.7373852,"about_ca_system_score_codex":0.000037237594,"about_ca_system_score_gemma":0.00009322609,"threshold_uncertainty_score":0.48252872},"labels":[],"label_agreement":null},{"id":"W3036109227","doi":"10.3390/s20123536","title":"A Null Space-Based Blind Source Separation for Fetal Electrocardiogram Signals","year":2020,"lang":"en","type":"article","venue":"Sensors","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":19,"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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"FastICA; Independent component analysis; Blind signal separation; Pattern recognition (psychology); Computer science; Artificial intelligence; SIGNAL (programming language); Principal component analysis; Filter (signal processing); Signal-to-noise ratio (imaging); Algorithm; Computer vision","score_opus":0.029130563591382844,"score_gpt":0.29166916336831167,"score_spread":0.26253859977692884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036109227","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.04797448,0.000036264966,0.9390017,0.010481176,0.000045126395,0.00068149786,0.0000040228556,0.0009045592,0.0008711903],"genre_scores_gemma":[0.8893251,0.0000030222313,0.10650158,0.00369153,0.00015371628,0.00006605488,0.000017709923,0.000023671753,0.00021762821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985766,0.00013595466,0.00023966223,0.00045197015,0.00029355605,0.00030230248],"domain_scores_gemma":[0.99911463,0.00014926725,0.00012449374,0.00031711633,0.00014248038,0.0001520332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030869516,0.00017672573,0.0002196953,0.00011890202,0.00012147749,0.00024358196,0.00039730416,0.00010843492,0.000007381804],"category_scores_gemma":[0.00010748445,0.00017940174,0.00020484574,0.0005534561,0.000031574866,0.00022006965,0.000044253444,0.00015105093,0.00006244662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017353148,0.00075880595,0.0008211651,0.0003268317,0.00055635074,0.000057750014,0.023957867,0.40975267,0.2313329,0.103882454,0.11553783,0.11128005],"study_design_scores_gemma":[0.0007833919,0.00051329116,0.00003089138,0.0000072496377,0.000014305543,0.000003950439,0.00003411344,0.77338827,0.15924072,0.0009300365,0.06478997,0.00026381278],"about_ca_topic_score_codex":0.000007131994,"about_ca_topic_score_gemma":0.000003417465,"teacher_disagreement_score":0.8413506,"about_ca_system_score_codex":0.000029098745,"about_ca_system_score_gemma":0.00011053235,"threshold_uncertainty_score":0.73157907},"labels":[],"label_agreement":null},{"id":"W3049338889","doi":"10.1287/ijoc.2021.1094","title":"Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Blind Source Separation 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":"Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"","keywords":"Column (typography); Row; Separation (statistics); Row and column spaces; Mathematics; Computer science; Statistics; Geometry","score_opus":0.020134538018794283,"score_gpt":0.3011796249486511,"score_spread":0.2810450869298568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049338889","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.29114124,0.000062306,0.70648766,0.00095824734,0.00029554294,0.0001133176,4.6370707e-7,0.00008126967,0.0008599257],"genre_scores_gemma":[0.9652259,0.000024017274,0.033568036,0.0010045082,0.00008340542,0.000001819358,0.000007166814,0.0000075078333,0.000077638884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983645,0.00015943291,0.0006679743,0.00015706076,0.00046490165,0.00018611035],"domain_scores_gemma":[0.9981976,0.0001625447,0.0006348401,0.00036708097,0.0005789573,0.000058984526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012377466,0.0001225418,0.00018280881,0.00012274811,0.00034596922,0.00047376764,0.00047472588,0.00007109325,0.000015343452],"category_scores_gemma":[0.00014955045,0.0000878046,0.00010932827,0.0005518356,0.000033524335,0.000719987,0.0001335578,0.00038118722,0.000012248088],"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.000053595242,0.0003000041,0.000401342,0.000034461522,0.00016596093,0.00006397896,0.0123874135,0.17362602,0.107930265,0.047665227,0.003157439,0.65421426],"study_design_scores_gemma":[0.00039299854,0.00015187965,0.00063750404,0.000052834734,0.0000051368033,0.00027218412,0.00006263384,0.94372565,0.050766855,0.0019621202,0.0018426639,0.00012756645],"about_ca_topic_score_codex":0.000005002486,"about_ca_topic_score_gemma":0.000021577136,"teacher_disagreement_score":0.7700996,"about_ca_system_score_codex":0.00010060449,"about_ca_system_score_gemma":0.00026049183,"threshold_uncertainty_score":0.4568552},"labels":[],"label_agreement":null},{"id":"W3082167925","doi":"10.1109/embc44109.2020.9176489","title":"Pole-Zero REM Modeling with Application in EEG Artifact Removal","year":2020,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Overfitting; Computer science; Artifact (error); Noise (video); Algorithm; Minification; White noise; Probabilistic logic; Task (project management); Artificial intelligence; Speech recognition; Artificial neural network","score_opus":0.02717552100056875,"score_gpt":0.25943037621394877,"score_spread":0.23225485521338002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082167925","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.021383839,0.000010595203,0.964029,0.007439787,0.0000072831135,0.0001739995,1.2822478e-7,0.00052429724,0.0064310515],"genre_scores_gemma":[0.74106306,0.0000022824095,0.25665307,0.0022156578,0.000008253994,0.000013087418,0.0000012048868,0.0000050938875,0.00003827775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992128,0.000033263048,0.00016538243,0.0002923936,0.000174434,0.000121753474],"domain_scores_gemma":[0.99956095,0.000014211546,0.000038559752,0.00028266292,0.00004019241,0.000063414685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001644003,0.00007655258,0.0000888081,0.000058014404,0.000027750637,0.000082126906,0.00034839017,0.000039743885,0.0000037926538],"category_scores_gemma":[0.000011296527,0.0000641287,0.000016854723,0.00042967772,0.000009229593,0.00039345512,0.00007551294,0.00011508484,0.00004317644],"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.00006335877,0.0001239583,0.0011512142,0.000027730259,0.000012875223,0.00003241632,0.0070955767,0.10119249,0.019133208,0.7701132,0.0011433001,0.09991065],"study_design_scores_gemma":[0.00011380539,0.00004554715,0.00008065229,0.0000049982123,6.888622e-7,0.000006280281,0.0000206458,0.9894155,0.0040651285,0.004903265,0.0012481094,0.000095362804],"about_ca_topic_score_codex":0.00008634211,"about_ca_topic_score_gemma":0.000043601653,"teacher_disagreement_score":0.88822305,"about_ca_system_score_codex":0.000023026381,"about_ca_system_score_gemma":0.00004579504,"threshold_uncertainty_score":0.26150924},"labels":[],"label_agreement":null},{"id":"W3082430410","doi":"10.1109/embc44109.2020.9176560","title":"MNDL Sparsity Order Selection for Compressed Sensing with Application in ECG Compression","year":2020,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Variance (accounting); Selection (genetic algorithm); Computer science; Noise (video); Compressed sensing; Algorithm; Compression (physics); Noise measurement; Signal-to-noise ratio (imaging); Data compression; Artificial intelligence; Noise reduction; Telecommunications","score_opus":0.023438702329532244,"score_gpt":0.2622758882081411,"score_spread":0.23883718587860883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082430410","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.010893319,0.0000034267778,0.9837668,0.0036119844,0.000011174077,0.00054305716,4.4306682e-7,0.0004946511,0.0006751225],"genre_scores_gemma":[0.57070285,6.4804027e-7,0.42814454,0.0010983581,0.00001331717,0.000011331746,0.000004899986,0.0000045552943,0.000019503188],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926585,0.000051297186,0.00013734243,0.0002977164,0.00013009449,0.000117698524],"domain_scores_gemma":[0.99954194,0.000055037537,0.000069353366,0.00015049092,0.00013455002,0.000048650843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012826508,0.000083142346,0.000111142945,0.00005709046,0.00007509591,0.00007921087,0.00019320387,0.00004955203,0.000002127929],"category_scores_gemma":[0.0000133891035,0.00007163641,0.000015217891,0.00050585705,0.000013300871,0.00032206243,0.00006126591,0.00009423479,0.000004750954],"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.0008581317,0.00078504503,0.033113286,0.00030695988,0.00007188822,0.0000055105033,0.013276165,0.09688526,0.32963094,0.19298638,0.021905988,0.31017444],"study_design_scores_gemma":[0.00035493355,0.00009130131,0.00074286986,0.000009738317,0.0000016772966,0.0000019626095,0.00001579147,0.9392597,0.055124685,0.0007161035,0.0035803474,0.0001008803],"about_ca_topic_score_codex":0.00008819295,"about_ca_topic_score_gemma":0.0001671459,"teacher_disagreement_score":0.84237444,"about_ca_system_score_codex":0.0000236616,"about_ca_system_score_gemma":0.000036250534,"threshold_uncertainty_score":0.29212478},"labels":[],"label_agreement":null},{"id":"W3085902048","doi":"10.1109/cjece.2020.2984602","title":"Fetal ECG Extraction Using Input-Mode and Output-Mode Adaptive Filters With Blind Source Separation","year":2020,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Blind signal separation; Extraction (chemistry); Computer science; Mode (computer interface); Separation (statistics); Control theory (sociology); Speech recognition; Artificial intelligence; Chromatography; Chemistry; Telecommunications; Machine learning","score_opus":0.019445745730804504,"score_gpt":0.2414783072147799,"score_spread":0.22203256148397538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085902048","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.13726094,0.00019358995,0.86184,0.00054769265,0.000049686358,0.00006722356,7.2360285e-7,0.000029349314,0.000010748579],"genre_scores_gemma":[0.8565246,0.000008568407,0.14290114,0.00040747525,0.00014311413,8.299799e-7,5.797757e-7,0.000010025624,0.0000036865197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920017,0.000035067107,0.0002244018,0.00018428106,0.00014123124,0.00021485587],"domain_scores_gemma":[0.9991568,0.0000623997,0.00011070628,0.00006996746,0.000096991556,0.0005031759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010125333,0.0001389228,0.00018820832,0.00024959442,0.00008483897,0.00023876292,0.00016720901,0.00006334566,6.65558e-7],"category_scores_gemma":[0.000017751416,0.00012673489,0.000033980617,0.00032735273,0.000020829084,0.0006164122,0.000022246031,0.00032639998,3.5151476e-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.00016902362,0.000043358505,0.0015262308,0.000055925648,0.00024786688,0.0003753859,0.009233729,0.78332555,0.0053622816,0.006889214,0.0008398771,0.19193155],"study_design_scores_gemma":[0.00031213273,0.0004831096,0.00043251298,0.0000332692,0.000012362333,0.00045455177,0.0000070098804,0.996074,0.0009255379,0.00006038515,0.0010507833,0.00015432684],"about_ca_topic_score_codex":0.00018937545,"about_ca_topic_score_gemma":0.00010735754,"teacher_disagreement_score":0.7192636,"about_ca_system_score_codex":0.00007107748,"about_ca_system_score_gemma":0.0002379378,"threshold_uncertainty_score":0.5168099},"labels":[],"label_agreement":null},{"id":"W3107167699","doi":"10.1109/ccece47787.2020.9255816","title":"Extraction of Fetal ECG Signal with Ectopic Beats using Blind Source Separation Based Null Space Approach","year":2020,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Blind signal separation; Beat (acoustics); SIGNAL (programming language); Null (SQL); Signal-to-noise ratio (imaging); Noise (video); Pattern recognition (psychology); Independent component analysis; Speech recognition; Computer science; Source separation; Artificial intelligence; Algorithm; Physics; Acoustics; Telecommunications; Data mining","score_opus":0.04810884906064371,"score_gpt":0.29699719756557236,"score_spread":0.24888834850492864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107167699","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.08660032,0.000011247947,0.9090849,0.00084218103,0.000015548207,0.0002838271,5.674277e-7,0.0002971337,0.0028642793],"genre_scores_gemma":[0.60281414,3.4019e-7,0.39674497,0.00029685217,0.000027615004,0.0000052856017,0.0000045436723,0.0000073893366,0.00009886476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877876,0.00012062807,0.00023099851,0.00036211062,0.00035901167,0.00014848825],"domain_scores_gemma":[0.99929655,0.000053858777,0.00018682153,0.00025160157,0.00012175464,0.000089446854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021418165,0.00014268348,0.00017316539,0.00010816803,0.00007790157,0.00012015954,0.0002823155,0.000070367656,0.00003112583],"category_scores_gemma":[0.000010723642,0.00012303809,0.00005336194,0.00051577337,0.000040085135,0.00066545577,0.000050333118,0.00015360679,0.000006086885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007238166,0.0012725634,0.008428492,0.0003290008,0.0001598883,0.000021323647,0.013148699,0.5840237,0.3331174,0.031641223,0.0026954017,0.024438512],"study_design_scores_gemma":[0.00041718618,0.00016298781,0.00016586101,0.000008594567,0.000009552998,0.000009509613,0.00006396763,0.85470307,0.14389053,0.00005717006,0.00037700022,0.0001345618],"about_ca_topic_score_codex":0.00006310163,"about_ca_topic_score_gemma":0.000007012232,"teacher_disagreement_score":0.51621383,"about_ca_system_score_codex":0.000030982992,"about_ca_system_score_gemma":0.00015419473,"threshold_uncertainty_score":0.5017348},"labels":[],"label_agreement":null},{"id":"W3111090830","doi":"10.22215/etd/2017-11892","title":"Complex NMF for Multichannel Source Separation","year":2017,"lang":"en","type":"dissertation","venue":"","topic":"Blind Source Separation 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":"Carleton University","funders":"","keywords":"Non-negative matrix factorization; Blind signal separation; Source separation; Computer science; Matrix decomposition; Cluster analysis; Short-time Fourier transform; Channel (broadcasting); Speech recognition; Algorithm; Pattern recognition (psychology); Artificial intelligence; Mathematics; Fourier transform","score_opus":0.05528804867787241,"score_gpt":0.3781199658803051,"score_spread":0.3228319172024327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111090830","genre_codex":"methods","genre_gemma":"other","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.0004506817,0.000034283556,0.9305563,0.00045946834,0.00052891404,0.000984108,0.000008304478,0.00082704204,0.0661509],"genre_scores_gemma":[0.17969872,0.000033630407,0.36730286,0.0013344245,0.0003985623,0.00088819757,0.0032460047,0.000102045946,0.44699556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847615,0.000051189578,0.0003514253,0.0005710057,0.00029780003,0.00025244118],"domain_scores_gemma":[0.99793917,0.00010879699,0.0004803527,0.0010067679,0.00038816343,0.00007673518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037767124,0.00028340946,0.00031888968,0.00020216442,0.0004224984,0.0007514067,0.0014014401,0.00034593634,0.000040317424],"category_scores_gemma":[0.00011759923,0.00027938758,0.00017942725,0.00007273769,0.000019448486,0.000618454,0.00004843818,0.00018257242,0.000078940924],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012281742,0.00030378395,0.000015367492,0.00042847797,0.00016385724,0.0000031031343,0.01556838,0.00030574363,0.0095053995,0.4565595,0.25230324,0.26472032],"study_design_scores_gemma":[0.00093697576,0.00029618535,0.00093279657,0.0001261487,0.000047883324,0.000005654669,0.00034583904,0.41820976,0.052120294,0.024136055,0.5015868,0.0012556305],"about_ca_topic_score_codex":0.00006680729,"about_ca_topic_score_gemma":0.00042216887,"teacher_disagreement_score":0.5632534,"about_ca_system_score_codex":0.00004145844,"about_ca_system_score_gemma":0.00015760673,"threshold_uncertainty_score":0.99996585},"labels":[],"label_agreement":null},{"id":"W3117596129","doi":"10.3390/app11010086","title":"Simplified Welch Algorithm for Spectrum Monitoring","year":2020,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Blind Source Separation 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":"École de Technologie Supérieure","funders":"","keywords":"Fast Fourier transform; Algorithm; Spectral density; Computer science; Field-programmable gate array; Reduction (mathematics); Mathematics; Computer hardware; Telecommunications","score_opus":0.05296891979340193,"score_gpt":0.2989038951206919,"score_spread":0.24593497532728995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117596129","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.0016927598,0.000023354594,0.98306483,0.0058955564,0.00014124947,0.00030967305,0.0000019199445,0.00055015716,0.008320527],"genre_scores_gemma":[0.5551201,0.0000030297956,0.44341245,0.0012152209,0.00016386823,0.000058684785,5.118776e-7,0.0000045808315,0.000021516751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987399,0.000015890091,0.00017098471,0.0004798271,0.00031474957,0.00027865474],"domain_scores_gemma":[0.9994849,0.00011591483,0.00007385845,0.00019147288,0.000024360537,0.000109490604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004708198,0.00010748632,0.0001246376,0.00006347964,0.00030601615,0.00035512345,0.0011833675,0.00004197107,0.0000046946325],"category_scores_gemma":[0.000019922365,0.00009600239,0.000042325682,0.00067998463,0.00009840549,0.00035128635,0.00017499008,0.00008697743,0.000027955874],"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.000003708743,0.00003245116,0.00011650351,0.000009366682,0.0000085500915,0.0000014166934,0.0025300132,0.00024878856,0.012711765,0.75938123,0.0028854127,0.22207077],"study_design_scores_gemma":[0.00046344678,0.000375846,0.00040443812,0.000008955007,0.000005801133,0.0000036199744,0.00048371666,0.281112,0.59294033,0.09791787,0.025737206,0.0005468175],"about_ca_topic_score_codex":0.0000041023723,"about_ca_topic_score_gemma":5.743212e-7,"teacher_disagreement_score":0.6614634,"about_ca_system_score_codex":0.000013978854,"about_ca_system_score_gemma":0.000079737685,"threshold_uncertainty_score":0.39148638},"labels":[],"label_agreement":null},{"id":"W3119687918","doi":"10.1109/access.2021.3051646","title":"Blind System Identification in Noise Using a Dynamic-Based Estimator","year":2021,"lang":"en","type":"article","venue":"IEEE Access","topic":"Blind Source Separation 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":"University of Calgary; York University","funders":"","keywords":"Cramér–Rao bound; Estimator; Algorithm; Autoregressive model; Mean squared error; Independent and identically distributed random variables; Mathematics; System identification; Computer science; Upper and lower bounds; Noise (video); Signal-to-noise ratio (imaging); Chaotic; Estimation theory; Statistics; Artificial intelligence; Random variable; Data modeling","score_opus":0.048454409138630354,"score_gpt":0.36388944068081536,"score_spread":0.315435031542185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119687918","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.29460084,0.000026292608,0.7044059,0.00024275586,0.0002296122,0.00013241044,0.0000015640898,0.00022280081,0.00013779238],"genre_scores_gemma":[0.94906616,0.0000010006149,0.050657284,0.00018819138,0.000014891564,0.000030496612,0.000004952915,0.00000932706,0.000027723663],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988233,0.00013519889,0.00030888652,0.00035379833,0.00022929348,0.0001495557],"domain_scores_gemma":[0.99900526,0.000055977285,0.00013876926,0.0005878111,0.00016711443,0.00004504149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037831083,0.00009410259,0.00013198341,0.0002148575,0.00007112389,0.0007263051,0.00075530424,0.00006986587,0.0000030868616],"category_scores_gemma":[0.00003793691,0.0001041174,0.00003790089,0.00088433287,0.000016545884,0.001070322,0.00009508974,0.000105018604,0.000016358252],"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.0001126707,0.0016760455,0.031466667,0.0015225814,0.00008872775,0.0012560829,0.0040113125,0.23696612,0.58975667,0.08663921,0.0012007772,0.045303125],"study_design_scores_gemma":[0.0002650723,0.0000038481153,0.0034129703,0.00008497709,0.000003377157,0.0000126257755,0.000016845,0.8787246,0.11699587,0.00033254083,0.000030511295,0.00011678419],"about_ca_topic_score_codex":0.000058172333,"about_ca_topic_score_gemma":0.0000747053,"teacher_disagreement_score":0.6544653,"about_ca_system_score_codex":0.00012217314,"about_ca_system_score_gemma":0.00025305207,"threshold_uncertainty_score":0.7003777},"labels":[],"label_agreement":null},{"id":"W3123111130","doi":"","title":"Statistical Inference for Independent Component Analysis: Application to Structural VAR Models","year":2016,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Consistency (knowledge bases); Independent component analysis; Component (thermodynamics); Gaussian; Inference; Parametric statistics; Monte Carlo method; Computer science; Econometrics; Mathematics; Statistical inference; Algorithm; Mathematical optimization; Applied mathematics; Statistics; Artificial intelligence","score_opus":0.04350863132725051,"score_gpt":0.3712560922546207,"score_spread":0.32774746092737017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123111130","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.01729478,0.000012820028,0.9766714,0.0008713637,0.000098003875,0.0017801465,0.00018393005,0.00013431962,0.0029532332],"genre_scores_gemma":[0.8938154,0.00017129662,0.10417237,0.00015317112,0.000060245344,0.0013909948,0.00010656077,0.000023002645,0.000106974534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966317,0.00031052958,0.0007164421,0.0013105054,0.00043126248,0.00059956656],"domain_scores_gemma":[0.9966793,0.00089397613,0.00021103921,0.0016296029,0.0003182445,0.0002678426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020426866,0.00027241817,0.00054327614,0.0010401825,0.00012705651,0.00039984164,0.0019965218,0.0003274326,0.000010148129],"category_scores_gemma":[0.00020439476,0.00026003088,0.00015741437,0.0002865587,0.000102957754,0.00026600008,0.0021128715,0.0007417355,0.00000783153],"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.00007671503,0.00009102949,0.0010720092,0.00007580504,0.00028236018,0.000003373983,0.000977993,0.22557864,0.00023447059,0.46246895,0.000053798438,0.30908486],"study_design_scores_gemma":[0.00020425422,0.00006914433,0.0038086213,0.000031573858,0.000013535321,8.9078134e-7,0.000021725145,0.7910001,0.00025430965,0.20345932,0.0008284393,0.00030804242],"about_ca_topic_score_codex":0.000078924684,"about_ca_topic_score_gemma":0.00025549327,"teacher_disagreement_score":0.87652063,"about_ca_system_score_codex":0.0008533061,"about_ca_system_score_gemma":0.00052879914,"threshold_uncertainty_score":0.9999852},"labels":[],"label_agreement":null},{"id":"W3123181520","doi":"10.2139/ssrn.1777274","title":"Asymptotic Distributions for Some Quasi-Efficient Estimators in Echelon VARMA Models","year":2011,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Estimator; Econometrics; Mathematics; Applied mathematics; Statistics; Mathematical economics","score_opus":0.026523844375687864,"score_gpt":0.2665577284321656,"score_spread":0.24003388405647771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123181520","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.04672141,0.00034278096,0.95164,0.0004606905,0.00011830103,0.000270937,0.000002944545,0.00015721621,0.00028571213],"genre_scores_gemma":[0.9736768,0.00013036506,0.02591613,0.00010298827,0.00003806164,0.00004419422,0.000003244524,0.000014340638,0.00007386203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750185,0.000106083644,0.00037565676,0.00026898878,0.00022757649,0.0015198473],"domain_scores_gemma":[0.9992969,0.000060209604,0.0001614687,0.00028896402,0.000097464326,0.00009497464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020815071,0.00015584267,0.00017630844,0.00025738002,0.00018933811,0.00009656443,0.0007759328,0.000076879594,0.0000032185756],"category_scores_gemma":[0.000055765657,0.00014674287,0.00011807676,0.00034950022,0.00003404133,0.00066942524,0.00008162986,0.0009344983,0.000010740704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009672139,0.00023188112,0.00007903671,0.000002554907,0.00001601859,0.0000017084847,0.00058842974,0.0018865456,0.000030855565,0.99258083,0.000028848526,0.004543626],"study_design_scores_gemma":[0.00032856403,0.00030369873,0.00014987824,0.000015609994,0.0000062807057,0.00009610472,0.00008630282,0.28648257,0.00087514904,0.7114625,0.000048331767,0.00014500188],"about_ca_topic_score_codex":0.00003862779,"about_ca_topic_score_gemma":0.00008369527,"teacher_disagreement_score":0.9269554,"about_ca_system_score_codex":0.000833044,"about_ca_system_score_gemma":0.0015414342,"threshold_uncertainty_score":0.59840006},"labels":[],"label_agreement":null},{"id":"W3124416748","doi":"10.1109/lcomm.2021.3053151","title":"Blind Identification of Sparse Systems Using Symbolic Dynamics Encoding","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Blind Source Separation 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":"University of Calgary; York University","funders":"","keywords":"Chaotic; Computer science; Identification (biology); Novelty; System identification; Encoding (memory); Pattern recognition (psychology); SIGNAL (programming language); Algorithm; Mean squared error; ENCODE; Artificial intelligence; Noise (video); Sparse approximation; Signal processing; Speech recognition; Mathematics; Data modeling; Statistics; Telecommunications","score_opus":0.07380075025941525,"score_gpt":0.32230382908754335,"score_spread":0.2485030788281281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124416748","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.12745723,0.0002559256,0.86598337,0.0052081235,0.00024245314,0.00017528447,0.0000074085833,0.00016685898,0.00050332356],"genre_scores_gemma":[0.9296505,0.0000996085,0.06966907,0.00046089882,0.000017609196,0.000025531226,0.000025723924,0.000011306294,0.00003976696],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984501,0.00041051288,0.00054254476,0.00022880793,0.00022617073,0.00014188448],"domain_scores_gemma":[0.99616444,0.00016356338,0.0003567382,0.0029981376,0.00027630944,0.00004083862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005817006,0.00010316671,0.00017038273,0.00021761359,0.00020001248,0.00023632424,0.001764141,0.000061677834,0.0000011796066],"category_scores_gemma":[0.000058282596,0.00012456815,0.00006945171,0.00078258256,0.00013419155,0.0005348303,0.00033041943,0.00019141844,0.000009859553],"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.0000018439289,0.00017967801,0.000573987,0.00004624649,0.00005498259,0.000004755962,0.002653115,0.011088796,0.6893673,0.29400474,0.00048599925,0.0015385506],"study_design_scores_gemma":[0.00019689437,0.0000067449514,0.0004076645,0.00008732898,0.000022491678,0.00005766871,0.00022992233,0.93175125,0.0657117,0.00060896965,0.00070556736,0.00021379524],"about_ca_topic_score_codex":0.00007489322,"about_ca_topic_score_gemma":0.000030782798,"teacher_disagreement_score":0.92066246,"about_ca_system_score_codex":0.00013471261,"about_ca_system_score_gemma":0.00011036734,"threshold_uncertainty_score":0.50797415},"labels":[],"label_agreement":null},{"id":"W3133484923","doi":"10.1002/cjs.11592","title":"Scalable spatio‐temporal Bayesian analysis of high‐dimensional electroencephalography data","year":2021,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Artificial intelligence; Scalability; Bayesian probability; Pattern recognition (psychology); Electroencephalography; Data mining; Kronecker product; Machine learning; Kronecker delta","score_opus":0.027177807224080894,"score_gpt":0.2529999779211099,"score_spread":0.225822170697029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133484923","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.005993312,0.0002336784,0.99202317,0.00078720273,0.00014132514,0.000031478747,0.00064595055,0.000008374936,0.00013553165],"genre_scores_gemma":[0.5850599,0.0000133799,0.41437468,0.00029426938,0.000017303704,2.4700182e-7,0.00020858824,0.0000044265057,0.00002723948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985634,0.00013631152,0.0005297112,0.00020035425,0.0003457716,0.0002244371],"domain_scores_gemma":[0.9975428,0.00012706657,0.0004094317,0.0006273268,0.00090899545,0.00038439513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053105224,0.00009664077,0.00032862407,0.0008777563,0.00008295118,0.00012598127,0.00090655236,0.000051487372,0.00016235598],"category_scores_gemma":[0.0002214278,0.000099503886,0.00007343892,0.0018628889,0.00009063539,0.00041758298,0.000060875558,0.00019151688,0.0000012656782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000212828,0.00017008497,0.09352533,0.00004241229,0.0026958897,0.0021109474,0.0012546489,0.008168697,0.00033385833,0.7071097,0.15653388,0.028033298],"study_design_scores_gemma":[0.0012313911,0.00085737143,0.18735358,0.00016257817,0.001976453,0.0005469447,0.0001470637,0.6255465,0.006729599,0.14698027,0.02744453,0.0010237258],"about_ca_topic_score_codex":0.00386078,"about_ca_topic_score_gemma":0.06972159,"teacher_disagreement_score":0.6173778,"about_ca_system_score_codex":0.000053861484,"about_ca_system_score_gemma":0.002897654,"threshold_uncertainty_score":0.9472536},"labels":[],"label_agreement":null},{"id":"W3135412787","doi":"10.3390/e23030329","title":"Ant Colony System Optimization for Spatiotemporal Modelling of Combined EEG and MEG Data","year":2021,"lang":"en","type":"article","venue":"Entropy","topic":"Blind Source Separation 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":"Brock University; University of Victoria","funders":"","keywords":"Magnetoencephalography; Computer science; Electroencephalography; Ant colony optimization algorithms; Artificial intelligence; Pattern recognition (psychology); Bayesian probability; Artificial neural network; Nonparametric statistics; Ant colony; Mathematics; Statistics","score_opus":0.056077764684264016,"score_gpt":0.2729216353558885,"score_spread":0.21684387067162447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135412787","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.006021283,0.000101919955,0.9928957,0.00047832512,0.00008120814,0.00020695764,0.000019535402,0.000112984504,0.000082074665],"genre_scores_gemma":[0.52967465,0.000013587932,0.4701657,0.0000371725,0.000009787308,0.000006390775,0.0000658951,0.0000038792095,0.000022945278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993067,0.00006113486,0.00019473999,0.0002355116,0.00012029994,0.0000816348],"domain_scores_gemma":[0.99916536,0.00006241568,0.00011301779,0.00048773817,0.0001420729,0.000029427541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026201596,0.000057996494,0.00012768875,0.00003806897,0.00004956245,0.0000760474,0.00029337898,0.00003846302,0.00000187531],"category_scores_gemma":[0.000029446406,0.000058765894,0.000015954292,0.00012202744,0.000014922236,0.00032236168,0.00019186811,0.000034319793,4.0659896e-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.000037678605,0.00011473727,0.00027767124,0.00019711377,0.000039831528,0.000006668632,0.0011153265,0.22975424,0.0016738493,0.76376104,0.001753205,0.0012686391],"study_design_scores_gemma":[0.0003099514,0.0000538755,0.000015632426,0.000027175789,0.0000063078337,0.0000031026213,0.000030993328,0.98877513,0.009834218,0.0005120531,0.0003739046,0.000057647296],"about_ca_topic_score_codex":0.000015826292,"about_ca_topic_score_gemma":0.0000020598484,"teacher_disagreement_score":0.763249,"about_ca_system_score_codex":0.000017428945,"about_ca_system_score_gemma":0.000070844195,"threshold_uncertainty_score":0.23964037},"labels":[],"label_agreement":null},{"id":"W3136848060","doi":"10.1109/jrfid.2021.3066884","title":"A Multi-Spectral Approach to Fuzzy Quantum Modelling of Nonlinear Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Journal of Radio Frequency Identification","topic":"Blind Source Separation Techniques","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nonlinear system; Computer science; Control theory (sociology); Fuzzy logic; Overhead crane; MIMO; Controller (irrigation); Stability (learning theory); Overhead (engineering); Complex system; Fuzzy control system; Control engineering; Control (management); Artificial intelligence; Engineering; Telecommunications; Machine learning; Physics","score_opus":0.06355900051656903,"score_gpt":0.2861388882728014,"score_spread":0.22257988775623233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136848060","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.08196817,0.00083036255,0.9155282,0.0003712349,0.0008500944,0.00018261439,0.000004903168,0.00005236831,0.00021205172],"genre_scores_gemma":[0.63346976,0.0000839197,0.36619318,0.0000261864,0.00012784163,0.0000064128685,0.000002645792,0.000010293821,0.00007977602],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975478,0.00025870558,0.0011437304,0.00028393936,0.000584718,0.00018112296],"domain_scores_gemma":[0.99731284,0.000054245316,0.00089243613,0.00058957457,0.001023082,0.00012779786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014374699,0.00013538793,0.00033227706,0.00039170796,0.000069774804,0.00026245243,0.00082034036,0.00009475123,9.790415e-7],"category_scores_gemma":[0.00008432856,0.0001344384,0.00016403792,0.0007356766,0.000030821182,0.0009795058,0.000020103007,0.00026020303,0.000008084367],"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.00001319325,0.0007538416,0.0001762182,0.00013901065,0.00010884614,0.000032490887,0.0055245976,0.24605563,0.6512923,0.09442909,0.00079096516,0.00068377884],"study_design_scores_gemma":[0.00037854305,0.00010314451,0.0004146401,0.00014294768,0.000032786193,0.000507403,0.00020945081,0.8020805,0.19172986,0.004013202,0.00015754881,0.00022996272],"about_ca_topic_score_codex":0.00004397496,"about_ca_topic_score_gemma":0.0000028328275,"teacher_disagreement_score":0.5560249,"about_ca_system_score_codex":0.0001329788,"about_ca_system_score_gemma":0.0003267035,"threshold_uncertainty_score":0.5482239},"labels":[],"label_agreement":null},{"id":"W3141490449","doi":"10.1109/iembs.2006.4398472","title":"Optimal Window Length in the Windowed Adaptive Chirplet Analysis of Visual Evoked Potentials","year":2006,"lang":"en","type":"article","venue":"Conference proceedings","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Transient (computer programming); Visual evoked potentials; Computer science; Estimator; Window (computing); Representation (politics); SIGNAL (programming language); Signal-to-noise ratio (imaging); Upper and lower bounds; Noise (video); Algorithm; Time–frequency analysis; Speech recognition; Evoked potential; Artificial intelligence; Pattern recognition (psychology); Computer vision; Mathematics; Image (mathematics); Statistics; Telecommunications","score_opus":0.01891169997521663,"score_gpt":0.26929142696425296,"score_spread":0.2503797269890363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141490449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7451809,0.000026514024,0.24642327,0.00070377305,0.000023353594,0.00035621563,0.000004076816,0.00013902453,0.0071428516],"genre_scores_gemma":[0.98642224,0.0000064660344,0.013219426,0.00018411307,0.000027600623,0.000049811806,0.0000074780532,0.0000065888157,0.00007630042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982922,0.00005698355,0.000460469,0.0004222977,0.0004898885,0.00027814717],"domain_scores_gemma":[0.9989463,0.00008128027,0.0003100023,0.00021465193,0.0004123356,0.000035445144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091548415,0.0001841603,0.00038325446,0.00059348624,0.00007868765,0.00028945785,0.0011817917,0.00010272495,0.000021551055],"category_scores_gemma":[0.000063184016,0.00014370115,0.00014146439,0.0020711415,0.00012165516,0.00072652375,0.00016193445,0.0002221404,0.000004617354],"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.0000938129,0.000776365,0.028555771,0.000029343813,0.0003446732,0.000009693768,0.025727265,0.0009857268,0.035800997,0.9020313,0.0008333161,0.0048117116],"study_design_scores_gemma":[0.0009860782,0.00061955233,0.42133647,0.000077650206,0.00031413496,0.000011300832,0.0024994002,0.5032239,0.05502131,0.014893475,0.00033961466,0.00067713606],"about_ca_topic_score_codex":0.0001794576,"about_ca_topic_score_gemma":0.000036051628,"teacher_disagreement_score":0.88713783,"about_ca_system_score_codex":0.0000287167,"about_ca_system_score_gemma":0.00010504817,"threshold_uncertainty_score":0.5859963},"labels":[],"label_agreement":null},{"id":"W3142170516","doi":"10.1007/978-1-4471-5571-3_12","title":"Principal Component Analysis","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Principal component analysis; Principal (computer security); Computer science; Mathematics; Statistics; Computer security","score_opus":0.02453148048238817,"score_gpt":0.2514881063145006,"score_spread":0.2269566258321124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3142170516","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000037067057,0.000023837943,0.45126575,0.00034793702,0.00003445563,0.0001241685,0.0000011692548,0.00044967083,0.54774934],"genre_scores_gemma":[0.0032006835,0.000030627627,0.109315805,0.0010417139,0.000037355127,0.000014865048,0.00002497627,0.000016134909,0.88631785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866736,0.000019346891,0.00031703568,0.00046104402,0.00038721674,0.00014801366],"domain_scores_gemma":[0.99851453,0.000041369854,0.00018284614,0.0010324961,0.0001309725,0.00009778207],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001846009,0.0002327948,0.0003644451,0.0005025303,0.000045822566,0.00023762471,0.00097094674,0.00022601723,0.00206702],"category_scores_gemma":[0.0000029367413,0.00020102158,0.000299642,0.000102961516,0.00003489671,0.00021929198,0.00041470717,0.00024705924,0.0016058587],"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":[2.0887444e-7,0.000006596186,0.0000024390588,0.0000021668732,0.00020960899,0.0000027014298,0.000058741818,0.000017542972,0.0000050697367,0.9909093,0.0057206694,0.0030649658],"study_design_scores_gemma":[0.000069733105,0.000048313133,0.00019706418,0.0000130614135,0.00017084596,0.0000040823593,0.0000010022254,0.027834339,0.00021721858,0.0774354,0.8934601,0.0005488704],"about_ca_topic_score_codex":0.000037421545,"about_ca_topic_score_gemma":0.000027615673,"teacher_disagreement_score":0.9134739,"about_ca_system_score_codex":0.000049351438,"about_ca_system_score_gemma":0.000048684866,"threshold_uncertainty_score":0.9991715},"labels":[],"label_agreement":null},{"id":"W3146482214","doi":"10.1007/978-1-4939-7131-2_100067","title":"Blind Source Separation","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Blind signal separation; Separation (statistics); Computer science; Telecommunications; Machine learning","score_opus":0.03167961998481396,"score_gpt":0.2935601855649397,"score_spread":0.26188056558012573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3146482214","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000024418287,0.000025739539,0.48907027,0.0003402634,0.00009346735,0.00014988425,7.998908e-7,0.0006573485,0.50965977],"genre_scores_gemma":[0.0003630126,0.00002825012,0.0632238,0.001778214,0.00024892628,0.000009818718,0.000019674031,0.000033341898,0.93429494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985625,0.00002273236,0.00032220065,0.0005343103,0.00039231902,0.00016590404],"domain_scores_gemma":[0.99848986,0.00004672945,0.00021847026,0.00094746536,0.00021449251,0.00008298832],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00031601964,0.0002725388,0.00022999675,0.00024877457,0.00008854866,0.00031336307,0.0008740607,0.00040404435,0.001399963],"category_scores_gemma":[0.000010219492,0.000257008,0.00012117123,0.00004823341,0.000071719245,0.00041839524,0.0002939218,0.00026703795,0.0031875751],"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.000002816949,0.000006177628,2.4083528e-7,0.000003658624,0.000014962339,0.000001650117,0.00035591467,0.0000026017703,0.000016091995,0.8842839,0.10805845,0.0072535193],"study_design_scores_gemma":[0.00010741786,0.00009732634,9.829764e-7,0.000024087087,0.0000065778677,0.000011005669,0.0000015077006,0.003020169,0.0008896318,0.12912008,0.8664198,0.00030143568],"about_ca_topic_score_codex":0.000003989755,"about_ca_topic_score_gemma":0.000018144401,"teacher_disagreement_score":0.75836134,"about_ca_system_score_codex":0.000047933907,"about_ca_system_score_gemma":0.000119495504,"threshold_uncertainty_score":0.9999882},"labels":[],"label_agreement":null},{"id":"W3159367133","doi":"10.1101/2021.04.28.440961","title":"Holo-Hilbert Spectral-based Noise Removal Method for EEG High-Frequency Bands","year":2021,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Blind Source Separation 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":"Alberta Children's Hospital; Hotchkiss Brain Institute; University of Calgary","funders":"","keywords":"Hilbert–Huang transform; Electroencephalography; Computer science; Noise (video); Radio spectrum; Spectral density; Frequency band; Artificial intelligence; Speech recognition; SIGNAL (programming language); Pattern recognition (psychology); Psychology; White noise; Telecommunications; Neuroscience","score_opus":0.016337330983586015,"score_gpt":0.2588780836116166,"score_spread":0.2425407526280306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159367133","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.05485317,0.00053590693,0.9369791,0.002487808,0.0015048002,0.0014023023,0.0001174875,0.0020668004,0.00005263201],"genre_scores_gemma":[0.4153089,0.00003763681,0.5826235,0.001243784,0.00023538715,0.00043238254,0.0000014720669,0.000106429594,0.000010537404],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9945955,0.00056727807,0.0009489497,0.0022669055,0.00073400163,0.00088731403],"domain_scores_gemma":[0.99375767,0.00034839837,0.00071637623,0.0036907732,0.0010920218,0.0003947499],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002243525,0.00088077283,0.0010237534,0.0005955059,0.0002722476,0.0012820234,0.0025827605,0.00095834164,0.000040031773],"category_scores_gemma":[0.00050150574,0.0009870874,0.0005044995,0.001146447,0.00010126076,0.0005161329,0.0008500888,0.0011344262,0.000024092838],"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.000041095544,0.0004822554,0.0004986219,0.0005795272,0.0002541999,0.00031042003,0.00006745481,0.0007802213,0.90433604,0.09113558,0.0014816512,0.000032920456],"study_design_scores_gemma":[0.0011562272,0.00017036505,0.010833744,0.00046017,0.00013336272,1.9626285e-7,0.0000017000227,0.02666756,0.95199776,0.0002555847,0.0064485585,0.0018748009],"about_ca_topic_score_codex":0.00015480588,"about_ca_topic_score_gemma":0.000008959312,"teacher_disagreement_score":0.36045572,"about_ca_system_score_codex":0.0004520321,"about_ca_system_score_gemma":0.0022535813,"threshold_uncertainty_score":0.9997547},"labels":[],"label_agreement":null},{"id":"W3159848467","doi":"10.1101/2021.05.01.442232","title":"Linear causal filtering: definition and theory","year":2021,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Blind Source Separation 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; Montreal Neurological Institute and Hospital","funders":"","keywords":"Coherence (philosophical gambling strategy); Filter (signal processing); Bivariate analysis; Autoregressive model; Measure (data warehouse); Mathematics; Linear model; Linear filter; Causal model; Multivariate statistics; Computer science; Econometrics; Statistics; Data mining","score_opus":0.023876591981171987,"score_gpt":0.23548497618114136,"score_spread":0.21160838419996938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159848467","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.27402464,0.0008189752,0.72219193,0.0004511139,0.00063493376,0.00038073535,0.00003243832,0.0014090289,0.00005622642],"genre_scores_gemma":[0.7897219,0.00025263368,0.20905247,0.0006523186,0.00015308036,0.00011069083,3.6905402e-7,0.00005301152,0.0000035502756],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997443,0.00037060643,0.00041919007,0.0010585124,0.0003467196,0.00036196117],"domain_scores_gemma":[0.9974744,0.00012484114,0.00028733845,0.001516641,0.00039369386,0.00020309123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001055187,0.00041908547,0.00040741602,0.0002586955,0.00015145773,0.0008206855,0.0007908677,0.0004724563,0.000019996294],"category_scores_gemma":[0.00021170506,0.00047606698,0.00010279416,0.00038191368,0.00009784569,0.00048403954,0.0015637431,0.0007669911,0.000020848713],"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.000022673392,0.00029409307,0.0010307702,0.00058215513,0.00022748655,0.00029514538,0.00028351098,0.000093634466,0.62009585,0.37656352,0.00047788664,0.000033287834],"study_design_scores_gemma":[0.00065824564,0.00015692375,0.033435285,0.00092358707,0.000100495636,2.9160992e-7,0.000010490997,0.010183852,0.94651985,0.000737967,0.0050399816,0.0022330054],"about_ca_topic_score_codex":0.000015654201,"about_ca_topic_score_gemma":0.0000013244672,"teacher_disagreement_score":0.51569724,"about_ca_system_score_codex":0.00009774284,"about_ca_system_score_gemma":0.00048103265,"threshold_uncertainty_score":0.9997691},"labels":[],"label_agreement":null},{"id":"W3160931642","doi":"10.1016/j.bspc.2021.103124","title":"Subspace based Multiple Constrained Minimum Variance (SMCMV) beamformers","year":2021,"lang":"en","type":"article","venue":"Biomedical Signal Processing and Control","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Magnetoencephalography; Computer science; Subspace topology; Noise (video); Covariance; Variance (accounting); Algorithm; Pattern recognition (psychology); Speech recognition; Artificial intelligence; SIGNAL (programming language); Electroencephalography; Mathematics; Image (mathematics); Statistics; Psychology","score_opus":0.010019954131712389,"score_gpt":0.23930955702935947,"score_spread":0.22928960289764708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160931642","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.001531715,0.0005620116,0.98478985,0.012196578,0.000052259194,0.000113578375,0.000006747637,0.00029446278,0.00045277353],"genre_scores_gemma":[0.9454749,0.0000049876408,0.04927834,0.0050266976,0.000056687033,0.000024518295,0.000009067779,0.000007906933,0.00011685288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985189,0.00012409555,0.00025740502,0.00042112565,0.00038191574,0.0002965634],"domain_scores_gemma":[0.9990457,0.0002712926,0.000106427244,0.00017093374,0.00015964602,0.0002459757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004621128,0.0001523525,0.00022563562,0.00007413002,0.00019701218,0.00030119572,0.00026877137,0.00013468805,0.00003188273],"category_scores_gemma":[0.0001375919,0.00013323133,0.000053291755,0.00040032057,0.00024942742,0.00028293632,0.00004815681,0.00018463451,0.000005361583],"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.00012664791,0.00062476273,0.00090156327,0.00019415889,0.00007129262,0.00021155557,0.0011212305,0.000036754118,0.18647099,0.008103571,0.0020170682,0.8001204],"study_design_scores_gemma":[0.0033902864,0.00018995025,0.00032164698,0.00013578622,0.00001992651,0.000051419764,0.00010075101,0.9545918,0.012314686,0.0017315856,0.026801972,0.00035016297],"about_ca_topic_score_codex":0.0000079501515,"about_ca_topic_score_gemma":0.0000028291329,"teacher_disagreement_score":0.9545551,"about_ca_system_score_codex":0.000019627922,"about_ca_system_score_gemma":0.00058822933,"threshold_uncertainty_score":0.5433016},"labels":[],"label_agreement":null},{"id":"W3163853416","doi":"10.1109/icassp39728.2021.9414795","title":"Automatic Order Selection in Autoregressive Modeling with Application in EEG Sleep-Stage Classification","year":2021,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Autoregressive model; Computer science; Feature selection; Artificial intelligence; Selection (genetic algorithm); Representation (politics); Model selection; Nonlinear autoregressive exogenous model; Machine learning; Feature (linguistics); Pattern recognition (psychology); Algorithm; Data mining; Artificial neural network; Mathematics; Statistics","score_opus":0.01914577057580584,"score_gpt":0.27767416350698204,"score_spread":0.2585283929311762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163853416","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.15337963,0.000012728583,0.8431425,0.00088352285,0.000011103408,0.00024543787,1.6946626e-7,0.00036452938,0.0019603798],"genre_scores_gemma":[0.81955135,0.0000041673047,0.17993025,0.00020712167,0.000005211057,0.00015290796,0.000007256335,0.0000075375774,0.00013418653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988446,0.00012213078,0.00027834834,0.00038955652,0.00021212979,0.00015322847],"domain_scores_gemma":[0.9993688,0.00003585776,0.00009431386,0.00027348925,0.00019771566,0.000029847857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003066964,0.0001020081,0.0001208857,0.0002380341,0.000041748564,0.00012302943,0.00021242283,0.00008330293,0.000015072769],"category_scores_gemma":[0.000033723645,0.00009336187,0.000013998371,0.0012924339,0.0000115601115,0.0006502359,0.000047231657,0.00016885441,0.000011952056],"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.00001216364,0.000448623,0.01109052,0.000057522033,0.0000134440015,0.000015360873,0.0050002737,0.30973798,0.014319703,0.5768892,0.00006254113,0.082352675],"study_design_scores_gemma":[0.00022640504,0.00001930497,0.007939764,0.000025745336,0.0000012020812,0.0000061333967,0.00013759854,0.9862309,0.0033748494,0.0018606188,0.000057883564,0.00011958405],"about_ca_topic_score_codex":0.00014547842,"about_ca_topic_score_gemma":0.0017447782,"teacher_disagreement_score":0.6764929,"about_ca_system_score_codex":0.00015498017,"about_ca_system_score_gemma":0.00018558363,"threshold_uncertainty_score":0.38071865},"labels":[],"label_agreement":null},{"id":"W3173233968","doi":"10.1109/tip.2021.3088266","title":"Blind Decomposition of Multispectral Document Images Using Orthogonal Nonnegative Matrix Factorization","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orthogonality; Multispectral image; Matrix decomposition; Endmember; Hyperspectral imaging; Computer science; Non-negative matrix factorization; Pattern recognition (psychology); Artificial intelligence; Generalization; Mathematics; Algorithm","score_opus":0.019566618958338684,"score_gpt":0.33882522371229173,"score_spread":0.31925860475395307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173233968","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.03076371,0.0000631278,0.9682031,0.000250569,0.00014870489,0.00017606224,0.000013557927,0.00021883444,0.00016228846],"genre_scores_gemma":[0.6063227,0.000011739292,0.39353767,0.00004407361,0.000015132277,0.0000105106255,0.0000039774554,0.000011176408,0.000043009524],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985107,0.00013924664,0.00039161748,0.00039370058,0.00036391284,0.00020078094],"domain_scores_gemma":[0.9989039,0.00007058863,0.00022350677,0.00024746414,0.0004905555,0.00006398791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019021974,0.00017650638,0.00019464955,0.00024715453,0.00027486382,0.0003385964,0.00021552877,0.00008072375,0.00003682872],"category_scores_gemma":[0.000008912511,0.00019006433,0.000103022314,0.00072273467,0.000068236346,0.0019365804,0.0000050463186,0.00023236238,0.0000051151483],"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.000052655105,0.00043896117,0.00001821287,0.00011008193,0.000041586056,0.000020627496,0.0028294357,0.012534469,0.9362308,0.0009295325,0.000008714715,0.046784934],"study_design_scores_gemma":[0.000457488,0.000056326273,0.00008479122,0.000116144234,0.000023191149,0.000038888076,0.000086558764,0.08920987,0.90801895,0.0017221652,0.000006905333,0.00017872307],"about_ca_topic_score_codex":0.000014453209,"about_ca_topic_score_gemma":0.000010436865,"teacher_disagreement_score":0.575559,"about_ca_system_score_codex":0.00011557037,"about_ca_system_score_gemma":0.00028736016,"threshold_uncertainty_score":0.7750599},"labels":[],"label_agreement":null},{"id":"W3174710609","doi":"10.1109/i2mtc50364.2021.9460063","title":"Windowing Compensation in Fourier Based Surrogate Analysis","year":2021,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":2,"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":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Surrogate data; Autoregressive model; Computer science; Monte Carlo method; Algorithm; Spectral density estimation; Frequency domain; Fourier transform; Mathematics; Statistics; Computer vision","score_opus":0.017397779404612033,"score_gpt":0.2671595805649713,"score_spread":0.24976180116035926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174710609","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.052215774,0.000009013471,0.938702,0.002341284,0.000025251566,0.000046482448,2.6720855e-7,0.00019249044,0.00646743],"genre_scores_gemma":[0.7813756,7.5023223e-7,0.21698295,0.0013986648,0.000004460778,0.0000045386423,0.000008073198,0.0000021602941,0.00022284218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914247,0.00016018152,0.0001714488,0.00023122417,0.00018549604,0.000109185865],"domain_scores_gemma":[0.9993737,0.00009208975,0.000036324363,0.00037540402,0.000091480615,0.000031049007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045087992,0.000058241298,0.00012284033,0.0002828739,0.000031682175,0.00014317327,0.00019901265,0.00003629689,0.00009911524],"category_scores_gemma":[0.000038984526,0.00005896398,0.00007396299,0.001867553,0.000008018169,0.000343941,0.00006306174,0.000072129704,0.000015500522],"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.00001045416,0.00049479114,0.1930302,0.000019979701,0.00029869945,0.00024031164,0.00383223,0.06509834,0.006791123,0.6852844,0.0010750291,0.043824505],"study_design_scores_gemma":[0.00021839973,0.000008270444,0.05035799,0.000004807157,0.000013962823,9.335867e-7,0.000027146916,0.9084506,0.038184,0.0017478283,0.00087441754,0.000111652014],"about_ca_topic_score_codex":0.000053420677,"about_ca_topic_score_gemma":0.0005024761,"teacher_disagreement_score":0.84335226,"about_ca_system_score_codex":0.000029720028,"about_ca_system_score_gemma":0.00008431435,"threshold_uncertainty_score":0.24044812},"labels":[],"label_agreement":null},{"id":"W3175669727","doi":"10.1109/tgrs.2021.3086834","title":"Iterative Deblending of Simultaneous-Source Seismic Data via a Robust Singular Spectrum Analysis Filter","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Geoscience and Remote Sensing","topic":"Blind Source Separation Techniques","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":"China Scholarship Council","keywords":"Algorithm; Robustness (evolution); Filter (signal processing); Gradient descent; Computer science; Filter design; Mathematical optimization; Mathematics; Artificial intelligence; Computer vision","score_opus":0.02553219356367755,"score_gpt":0.2636023325721316,"score_spread":0.23807013900845406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175669727","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.026083086,0.00003781103,0.9726954,0.00070515525,0.00014747959,0.00008968016,0.000010092145,0.0001363121,0.00009497735],"genre_scores_gemma":[0.6289246,0.000037482023,0.37040734,0.00032826743,0.000010488785,4.40656e-8,0.0000037257528,0.0000066018397,0.0002814284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809563,0.00017898474,0.00031791488,0.0007659294,0.00036343798,0.0002780976],"domain_scores_gemma":[0.9983561,0.00027201828,0.0001352525,0.0010077792,0.00013327324,0.00009555953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042889526,0.00017687163,0.00028543832,0.0004588815,0.00040184648,0.0002679347,0.00044241853,0.000080598526,0.0000066539455],"category_scores_gemma":[0.000023221517,0.00016909339,0.00010161046,0.0021734969,0.00016692966,0.0006781508,0.00002668127,0.0002465817,0.0000027250487],"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.000009877829,0.00007272108,0.0000018392692,0.00001479043,0.00013710388,0.00009348431,0.00307572,0.14401643,0.021480469,0.00003707584,0.000008005188,0.8310525],"study_design_scores_gemma":[0.00008872369,0.000044037006,0.000010677995,0.000052754218,0.00007962761,0.00011376089,0.000112650116,0.87519455,0.12375766,0.0002148643,0.00016581271,0.00016485194],"about_ca_topic_score_codex":0.0002597757,"about_ca_topic_score_gemma":0.00021484129,"teacher_disagreement_score":0.8308876,"about_ca_system_score_codex":0.00003709817,"about_ca_system_score_gemma":0.00010796464,"threshold_uncertainty_score":0.6895428},"labels":[],"label_agreement":null},{"id":"W3191288094","doi":"10.20944/preprints202108.0067.v1","title":"3D Geophysical Post-Inversion Feature Extraction for Mineral Exploration Through Fast-ICA","year":2021,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Blind Source Separation Techniques","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":"Université du Québec en Abitibi-Témiscamingue","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Ministère de l'Énergie et des Ressources Naturelles","keywords":"Geology; Inversion (geology); Feature extraction; Geophysics; Physical property; Property (philosophy); Geologic map; Mineral exploration; Feature (linguistics); Induced polarization; Pattern recognition (psychology); Computer science; Artificial intelligence; Data mining; Seismology; Electrical resistivity and conductivity; Tectonics; Geomorphology; Materials science","score_opus":0.10406878022584469,"score_gpt":0.3602724034280822,"score_spread":0.2562036232022375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191288094","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.26144004,0.0000472688,0.7256328,0.0076598967,0.0011574735,0.0012548203,0.00001852463,0.0009101353,0.0018790666],"genre_scores_gemma":[0.8270333,0.00010024149,0.16825569,0.0011994806,0.000474973,0.00065410754,0.0005765898,0.00004980025,0.001655846],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9966345,0.0002987119,0.00047706987,0.0016088032,0.00059578643,0.0003851583],"domain_scores_gemma":[0.996669,0.0001411285,0.00048131228,0.0018421356,0.0007480554,0.00011836338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053260784,0.00045515233,0.0004781273,0.00015706822,0.00021761327,0.00029903257,0.0012037873,0.00069240644,0.00006278223],"category_scores_gemma":[0.00024477753,0.0004929393,0.00039636408,0.00027756242,0.000057497262,0.0020582955,0.002233957,0.0011566512,0.00018512706],"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.0007514358,0.003950237,0.012385593,0.001650378,0.00089691347,0.00013908937,0.0815017,0.012039704,0.73550195,0.07998896,0.018713642,0.052480396],"study_design_scores_gemma":[0.0018370519,0.00039152542,0.050779935,0.0007911112,0.00021241058,0.000052699263,0.0013040095,0.14548245,0.6884361,0.04972998,0.057950053,0.0030326955],"about_ca_topic_score_codex":0.00017562666,"about_ca_topic_score_gemma":0.000036997553,"teacher_disagreement_score":0.56559324,"about_ca_system_score_codex":0.00022746884,"about_ca_system_score_gemma":0.0003445699,"threshold_uncertainty_score":0.9997522},"labels":[],"label_agreement":null},{"id":"W3196705509","doi":"10.3390/min11090959","title":"3D Geophysical Post-Inversion Feature Extraction for Mineral Exploration through Fast-ICA","year":2021,"lang":"en","type":"article","venue":"Minerals","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Université du Québec en Abitibi-Témiscamingue","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Ministère de l'Énergie et des Ressources Naturelles","keywords":"Geology; Inversion (geology); Geophysics; Feature extraction; Physical property; Induced polarization; Property (philosophy); Mineral exploration; Feature (linguistics); Maximization; Geologic map; Computer science; Pattern recognition (psychology); Artificial intelligence; Seismology; Electrical resistivity and conductivity; Tectonics; Mathematics; Geomorphology; Mathematical optimization","score_opus":0.028536918895710292,"score_gpt":0.29995263849009063,"score_spread":0.2714157195943803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196705509","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.034497384,0.00007493885,0.93627185,0.024926458,0.00040421335,0.0003502158,0.0000134381,0.00040758308,0.003053921],"genre_scores_gemma":[0.2975645,0.000034028915,0.6754488,0.0060960073,0.000584713,0.00017243606,0.0003165945,0.000028283246,0.019754654],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99878407,0.000106614614,0.00019271378,0.00043493658,0.0002612641,0.00022042019],"domain_scores_gemma":[0.99894243,0.00009834024,0.00010416335,0.0004189108,0.00038031247,0.000055844117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014687044,0.0001565735,0.00017841853,0.000057615416,0.00013781947,0.00023170903,0.00025083954,0.00013688832,0.00002171072],"category_scores_gemma":[0.00008991187,0.00015050224,0.000121032695,0.00030700894,0.000020449712,0.0020263777,0.000097827105,0.00015131083,0.000037926467],"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.0000264858,0.00017841664,0.0000075821185,0.00002118122,0.000016287275,0.000013858032,0.0020075366,0.0001348158,0.79786146,0.047522184,0.14102171,0.01118847],"study_design_scores_gemma":[0.0010559813,0.00044233064,0.00022260983,0.00005171618,0.000026937261,0.000043186454,0.00028711828,0.07624935,0.53182256,0.018123612,0.37107357,0.00060104614],"about_ca_topic_score_codex":0.000027404705,"about_ca_topic_score_gemma":0.000025624939,"teacher_disagreement_score":0.26603892,"about_ca_system_score_codex":0.000047334986,"about_ca_system_score_gemma":0.000084420884,"threshold_uncertainty_score":0.6137304},"labels":[],"label_agreement":null},{"id":"W3198618123","doi":"10.32920/ryerson.14651559.v1","title":"Blind Source Separation in the Analysis of Electrocardiogram Pre-Shock Waveforms During Ventricular Fibrillation","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Ventricular fibrillation; Shock (circulatory); Blind signal separation; Waveform; Cardiology; Computer science; Fibrillation; Internal medicine; Artificial intelligence; Medicine; Pattern recognition (psychology); Channel (broadcasting); Atrial fibrillation; Telecommunications","score_opus":0.013293830279908407,"score_gpt":0.2908703408474163,"score_spread":0.27757651056750793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198618123","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.4901274,0.00014678696,0.5086982,0.00015206465,0.000026313579,0.00037763026,0.0000010318439,0.00010858608,0.00036192584],"genre_scores_gemma":[0.9878758,0.00009704976,0.011584228,0.000077404904,0.00004278759,0.000053598073,0.00017396294,0.000009445731,0.000085701366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742883,0.00039414412,0.00065909274,0.00060051744,0.00068345584,0.00023396658],"domain_scores_gemma":[0.9979936,0.00009234381,0.0004252777,0.0012435461,0.00021193031,0.00003330497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009963537,0.00023218841,0.00052599236,0.0011104663,0.00007065287,0.00045700438,0.0008714673,0.00028250867,0.000009180391],"category_scores_gemma":[0.000048761012,0.00017547744,0.0005439587,0.0034225765,0.000021852264,0.00037403769,0.00054109877,0.00042145574,0.0000010562688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029177718,0.00013272901,0.011410373,0.000107965374,0.0012537146,0.000019920517,0.011653297,0.9653628,0.000884859,0.0027031524,0.000057064917,0.0063849464],"study_design_scores_gemma":[0.0002717617,0.00005388985,0.1342058,0.00005855408,0.00036732887,0.000017294815,0.00021014399,0.8399207,0.02329611,0.0010186136,0.00019686436,0.00038292244],"about_ca_topic_score_codex":0.00021878952,"about_ca_topic_score_gemma":0.00018866704,"teacher_disagreement_score":0.4977484,"about_ca_system_score_codex":0.000109594694,"about_ca_system_score_gemma":0.00013623049,"threshold_uncertainty_score":0.71557623},"labels":[],"label_agreement":null},{"id":"W3202641266","doi":"10.1190/geo2021-0068.1","title":"Regularization by denoising for simultaneous source separation","year":2021,"lang":"en","type":"article","venue":"Geophysics","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 Alberta","funders":"","keywords":"Noise reduction; Regularization (linguistics); Computer science; Inverse problem; Algorithm; Inverse; Thresholding; Inversion (geology); Source separation; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.00831732794849752,"score_gpt":0.2635838762241902,"score_spread":0.2552665482756927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202641266","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.007198111,0.000054272725,0.990881,0.0007248419,0.000087181594,0.00016722006,0.000004457182,0.00033876524,0.0005441081],"genre_scores_gemma":[0.8083505,0.000011268724,0.18181165,0.0020444195,0.00014848428,0.000044077533,0.0002294803,0.000026668917,0.00733345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999184,0.000056153407,0.00015224576,0.00028356328,0.00017222822,0.00015178346],"domain_scores_gemma":[0.9990999,0.00015213179,0.00008673113,0.00035842392,0.00026654222,0.00003624092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011908069,0.00009213706,0.00009981483,0.000024719908,0.00014697576,0.00025191533,0.00021205914,0.00006517766,0.0000024517951],"category_scores_gemma":[0.00008888738,0.00010653378,0.00005180622,0.00030529418,0.000013445272,0.00041946268,0.000071395,0.0000636957,0.00001626368],"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.000013736703,0.000270224,0.00002831849,0.000050991923,0.000041780157,0.000008881528,0.0040651,0.016183037,0.22956558,0.5367846,0.017681569,0.1953062],"study_design_scores_gemma":[0.00028817606,0.000077437995,0.000013898236,0.000014903232,0.000011051638,0.000009081153,0.000036135913,0.43094304,0.39940766,0.096526735,0.07238847,0.00028341557],"about_ca_topic_score_codex":0.0000037858144,"about_ca_topic_score_gemma":0.0000022245567,"teacher_disagreement_score":0.8090694,"about_ca_system_score_codex":0.000030938016,"about_ca_system_score_gemma":0.000081817765,"threshold_uncertainty_score":0.43443212},"labels":[],"label_agreement":null},{"id":"W3205109497","doi":"10.1109/mipr51284.2021.00034","title":"A Novel Correntropy Analysis Method with Application to Multi-view Feature Representation","year":2021,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Pattern recognition (psychology); Mutual information; Artificial intelligence; Computer science; Canonical correlation; Kernel (algebra); Principal component analysis; Entropy (arrow of time); Feature vector; Feature (linguistics); Representation (politics); Relation (database); Kernel principal component analysis; Feature learning; Kernel method; Support vector machine; Data mining; Mathematics","score_opus":0.026653073929662287,"score_gpt":0.358307616633634,"score_spread":0.3316545427039717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205109497","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.00019746131,0.000026919992,0.9934425,0.005058014,0.00001783841,0.00025686927,0.000001661468,0.00032059822,0.0006781343],"genre_scores_gemma":[0.029580807,0.0000053838194,0.96652156,0.0020458961,0.000012135009,0.00009584558,0.000032943153,0.00000559893,0.0016998505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889576,0.00010401868,0.00014273057,0.0004967045,0.00024529645,0.00011549548],"domain_scores_gemma":[0.9987313,0.00006186811,0.00007826634,0.0007387553,0.00031158034,0.00007819927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024084521,0.000095563206,0.00017450907,0.00017517724,0.000057180983,0.00018827317,0.00030407397,0.000047644717,0.000015952466],"category_scores_gemma":[0.00003689739,0.00007773668,0.00006984503,0.0031054115,0.000006751463,0.0002750601,0.000113725415,0.000087044915,0.00002091942],"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.000040656127,0.0009974195,0.007136427,0.000035192523,0.0009267875,0.000018945511,0.0069803777,0.036675498,0.17945868,0.39801386,0.007295691,0.36242047],"study_design_scores_gemma":[0.0004138923,0.000054704262,0.017721767,0.000010260977,0.00014423537,0.000028765839,0.00014529211,0.8651065,0.1060331,0.00028280227,0.009770024,0.00028862082],"about_ca_topic_score_codex":0.00008825247,"about_ca_topic_score_gemma":0.0003565694,"teacher_disagreement_score":0.828431,"about_ca_system_score_codex":0.00003068449,"about_ca_system_score_gemma":0.00005822918,"threshold_uncertainty_score":0.317001},"labels":[],"label_agreement":null},{"id":"W3208134729","doi":"10.1049/ell2.12346","title":"Unified left eigenvector (ULEV) for blind source separation","year":2021,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Singular value decomposition; Eigenvalues and eigenvectors; Linear subspace; Projection (relational algebra); Dimension (graph theory); Singular value; Blind signal separation; Mathematics; Eigendecomposition of a matrix; Principal component analysis; Algorithm; Dimensionality reduction; Computer science; Applied mathematics; Mathematical optimization; Artificial intelligence; Combinatorics; Pure mathematics","score_opus":0.015366708970323488,"score_gpt":0.2784719689498654,"score_spread":0.26310525997954193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208134729","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.053946476,0.00036368702,0.9249551,0.019500837,0.00011658748,0.00029797258,0.0000018412403,0.00042743096,0.00039002995],"genre_scores_gemma":[0.7220033,0.00011830714,0.23660105,0.03680139,0.00028451273,0.0001362003,0.00014960689,0.00007414619,0.0038314932],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984464,0.00013048365,0.00024636887,0.00047734816,0.00025326287,0.000446103],"domain_scores_gemma":[0.99897975,0.00013149378,0.000107450316,0.00056925847,0.00014248387,0.0000695877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004056802,0.0001658365,0.00016534739,0.00011086192,0.00018271823,0.00031828252,0.00047930257,0.000092612754,0.00002095943],"category_scores_gemma":[0.000060333092,0.00018626323,0.00011928174,0.00031743836,0.000025439193,0.00045808725,0.00008334639,0.00023144015,0.000027836697],"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.00006234604,0.00016048517,0.0001078272,0.000036860838,0.0001416931,0.000015539354,0.0035201507,0.0032989122,0.4875846,0.40241274,0.09065299,0.012005858],"study_design_scores_gemma":[0.0009682812,0.00015123235,0.00008107531,0.000012985353,0.000018425237,0.00004558742,0.000021267488,0.033270128,0.5834713,0.009359576,0.37212127,0.00047889922],"about_ca_topic_score_codex":0.0000033867234,"about_ca_topic_score_gemma":0.000049659036,"teacher_disagreement_score":0.6883541,"about_ca_system_score_codex":0.00013561852,"about_ca_system_score_gemma":0.00028911594,"threshold_uncertainty_score":0.7595594},"labels":[],"label_agreement":null},{"id":"W3213920230","doi":"10.32920/ryerson.14657721.v1","title":"Tensor analysis of electroencephalogram signal for localization of event-related potentials","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Blind Source Separation Techniques","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Electroencephalography; Pattern recognition (psychology); Computer science; Artificial intelligence; Signal processing; SIGNAL (programming language); Tensor (intrinsic definition); Representation (politics); Linear discriminant analysis; Channel (broadcasting); Speech recognition; Mathematics; Psychology; Neuroscience; Digital signal processing","score_opus":0.014551433268612834,"score_gpt":0.2955891069513907,"score_spread":0.2810376736827778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213920230","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.0056310566,0.00016795976,0.99306065,0.00014149287,0.00006695491,0.0005295863,0.000016260314,0.00017546867,0.00021057796],"genre_scores_gemma":[0.834418,0.00004800302,0.16492139,0.00008922753,0.000006501878,0.000054883873,0.00029483228,0.000008838788,0.000158349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997823,0.00021253234,0.0008998828,0.00052446756,0.0003666878,0.00017344888],"domain_scores_gemma":[0.9972959,0.00010736041,0.0007884142,0.00070079154,0.0010644365,0.00004306175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068683585,0.00017979628,0.00069679227,0.00076072983,0.00003071857,0.000091745336,0.0007574929,0.0003044465,0.00008863534],"category_scores_gemma":[0.000071313545,0.00017307815,0.000622021,0.0016463738,0.00005078789,0.00015239096,0.00038417423,0.00015961227,2.5071353e-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.000029176052,0.00079123257,0.001663603,0.0003485429,0.0064788363,0.0000031558643,0.0020251677,0.8517412,0.024654683,0.09536151,0.00058714417,0.016315755],"study_design_scores_gemma":[0.00011666073,0.00011289197,0.000474696,0.000041656127,0.0005897185,6.5271723e-7,0.000026698961,0.90097475,0.09239368,0.005069705,0.00004224573,0.00015664578],"about_ca_topic_score_codex":0.00013355701,"about_ca_topic_score_gemma":0.00005157916,"teacher_disagreement_score":0.8287869,"about_ca_system_score_codex":0.0000355035,"about_ca_system_score_gemma":0.00025506676,"threshold_uncertainty_score":0.7057922},"labels":[],"label_agreement":null},{"id":"W3215034267","doi":"","title":"Identification de systèmes OFDM à partir de la signature des pilotes","year":2011,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Blind Source Separation 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":"Queen's University","funders":"","keywords":"Humanities; Computer science; Philosophy","score_opus":0.023948735197368235,"score_gpt":0.25588283888822166,"score_spread":0.23193410369085343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215034267","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.068044156,0.0033069435,0.87454027,0.008872548,0.00025178026,0.00067991536,0.000040173036,0.0008836637,0.04338058],"genre_scores_gemma":[0.7640696,0.0014543671,0.21876042,0.00026495414,0.000044939174,0.000221858,0.0001242157,0.00007616259,0.014983458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9714889,0.024452215,0.001097773,0.001424015,0.00066429534,0.0008728312],"domain_scores_gemma":[0.98768604,0.0034209432,0.0012177024,0.0036208315,0.003588073,0.00046643533],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.02202809,0.0006587541,0.0005966058,0.00036843077,0.0010334917,0.0028946719,0.003829003,0.0010483057,0.00017796291],"category_scores_gemma":[0.0039180648,0.00076502503,0.00039732867,0.0009224235,0.001730431,0.0008967721,0.0019867378,0.0016464492,0.00015412939],"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.000012208897,0.0008983429,0.0020796715,0.0002830195,0.00010006161,0.000012317525,0.06754991,0.00017627921,0.026081061,0.86314344,0.0018593962,0.037804265],"study_design_scores_gemma":[0.0004421356,0.0000021381047,0.03284182,0.0032460918,0.0001316175,0.00011071006,0.00023614427,0.0575009,0.5568405,0.32997468,0.017643128,0.0010301984],"about_ca_topic_score_codex":0.0030449643,"about_ca_topic_score_gemma":0.0012604739,"teacher_disagreement_score":0.6960255,"about_ca_system_score_codex":0.000565887,"about_ca_system_score_gemma":0.0013615243,"threshold_uncertainty_score":0.99948007},"labels":[],"label_agreement":null},{"id":"W33240097","doi":"10.3389/fphys.2020.570412","title":"Estimating the Single-Trial Characteristics of Event-Related Responses: Evaluation of the MCERP Algorithm","year":2002,"lang":"en","type":"article","venue":"NASA Technical Reports Server (NASA)","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"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":"National Institutes of Health; Alzheimer's Association","keywords":"Algorithm; Noise (video); Computer science; Amplitude; Event (particle physics); Latency (audio); Gaussian noise; Artificial intelligence","score_opus":0.05190053100572459,"score_gpt":0.31263440333441683,"score_spread":0.2607338723286923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W33240097","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83937156,0.00027718872,0.15048373,0.0024499553,0.0017553091,0.0029754436,0.0000105275585,0.00067033723,0.0020059203],"genre_scores_gemma":[0.9689236,0.0000055337027,0.030575657,0.00015550174,0.00007871057,0.00008169564,0.0000044020794,0.000017634173,0.00015723251],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947084,0.0008781659,0.0016812601,0.0004922206,0.001969693,0.00027024598],"domain_scores_gemma":[0.99481606,0.00046827403,0.0018300388,0.0019888051,0.0008298591,0.000066956534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060718013,0.0002212991,0.0003880179,0.0001261559,0.00018878849,0.00009827219,0.0010849126,0.0002873585,0.000067439076],"category_scores_gemma":[0.003976206,0.00014755977,0.00027764007,0.0010173437,0.00022903756,0.00036602552,0.00052287336,0.0004885212,0.000003899286],"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.00073554454,0.004297969,0.003334543,0.00016001181,0.00035216482,0.00014943618,0.0048189554,0.002230491,0.048525605,0.017957803,0.007038309,0.91039914],"study_design_scores_gemma":[0.007802606,0.0016825717,0.07195041,0.0008231237,0.00043750176,0.0009402347,0.000059666247,0.8199069,0.044603158,0.048095364,0.0026149238,0.0010835674],"about_ca_topic_score_codex":0.00002565646,"about_ca_topic_score_gemma":0.00000541111,"teacher_disagreement_score":0.9093156,"about_ca_system_score_codex":0.0001553095,"about_ca_system_score_gemma":0.00023583828,"threshold_uncertainty_score":0.6017313},"labels":[],"label_agreement":null},{"id":"W37945547","doi":"10.1007/978-1-4020-3610-1_12","title":"Covariance Models with Spectral Additive Components","year":2005,"lang":"en","type":"book-chapter","venue":"Quantitative geology and geostatistics","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Covariance; Variogram; Covariance function; Isotropy; Anisotropy; Mathematics; Applied mathematics; Fast Fourier transform; Function (biology); Algorithm; Model selection; Computer science; Mathematical optimization; Statistical physics; Statistics; Physics; Kriging; Optics","score_opus":0.03745536852320596,"score_gpt":0.2687387409482912,"score_spread":0.23128337242508523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37945547","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.000023569253,0.0008640923,0.8848824,0.00056827295,0.0000994697,0.0002948822,0.0002848443,0.00015869431,0.11282377],"genre_scores_gemma":[0.0036378861,0.001633565,0.93380433,0.0010348747,0.00006928226,0.000023867167,0.00034977685,0.000043998218,0.0594024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840045,0.00009236405,0.00032886572,0.0006391652,0.00024297963,0.00029620127],"domain_scores_gemma":[0.99830097,0.00061675766,0.00036379948,0.00036460828,0.00025159735,0.00010229222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020612316,0.00039026164,0.000483851,0.00018983959,0.00016735727,0.00007219462,0.00037320997,0.00026148927,0.000055755787],"category_scores_gemma":[0.0000321188,0.00036225337,0.00003945586,0.00004994219,0.00064071943,0.00034693314,0.00016323786,0.00063646585,0.0000954004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048672344,0.00002035334,0.00000486231,0.000012382908,0.00008436205,0.00006934547,0.0008840395,0.00016013558,9.004662e-7,0.9905789,0.0016220772,0.006513982],"study_design_scores_gemma":[0.00042511284,0.0006768641,0.00030817583,0.000105548184,0.000041824725,0.00008474028,0.000015000617,0.04810885,0.000010477747,0.8829811,0.066709764,0.00053252024],"about_ca_topic_score_codex":0.00002108985,"about_ca_topic_score_gemma":0.00013001316,"teacher_disagreement_score":0.10759776,"about_ca_system_score_codex":0.00003490799,"about_ca_system_score_gemma":0.000148473,"threshold_uncertainty_score":0.99988294},"labels":[],"label_agreement":null},{"id":"W4200305765","doi":"10.1016/j.jneumeth.2021.109470","title":"Holo-Hilbert spectral-based noise removal method for EEG high-frequency bands","year":2021,"lang":"en","type":"article","venue":"Journal of Neuroscience Methods","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alberta Children's Hospital; Hotchkiss Brain Institute; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Electroencephalography; Radio spectrum; Noise (video); Speech recognition; Computer science; Artificial intelligence; Acoustics; Pattern recognition (psychology); Physics; Psychology; Neuroscience; Telecommunications","score_opus":0.04918171853969724,"score_gpt":0.4022273228362121,"score_spread":0.3530456042965149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200305765","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.004206058,0.00012698355,0.98373604,0.00943709,0.0016429424,0.00016427448,0.00000303483,0.00009997846,0.00058357697],"genre_scores_gemma":[0.016773216,0.000029351888,0.97666717,0.006064948,0.00012852631,0.000008344848,4.7485634e-7,0.00001911909,0.0003088786],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99572664,0.0017422619,0.0008177823,0.0005724205,0.0007065404,0.0004343765],"domain_scores_gemma":[0.996321,0.0012866091,0.0007131567,0.0007556484,0.0006664424,0.0002571336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007312833,0.00022809026,0.0004938961,0.0004142007,0.00022175974,0.00045494252,0.0017307095,0.000110900575,0.000010962741],"category_scores_gemma":[0.0030216065,0.00019451372,0.000366749,0.0015720845,0.0001157309,0.0009797564,0.00015630327,0.00047703617,0.0000012532964],"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.000015492647,0.00013251102,0.000037830137,0.000012355947,0.000004504099,0.00021495318,0.00015861692,0.0007161317,0.9394236,0.032416973,0.0004615531,0.026405476],"study_design_scores_gemma":[0.0008114747,0.00073911395,0.0030010052,0.000042373234,0.000030140303,0.0019526252,0.000012797293,0.0687816,0.85238254,0.04857871,0.023337673,0.0003299807],"about_ca_topic_score_codex":0.0000055795335,"about_ca_topic_score_gemma":0.0000014643915,"teacher_disagreement_score":0.08704109,"about_ca_system_score_codex":0.00008449963,"about_ca_system_score_gemma":0.00094414107,"threshold_uncertainty_score":0.79320395},"labels":[],"label_agreement":null},{"id":"W4205329525","doi":"10.1037/met0000445","title":"New computations for RMSEA and CFI following FIML and TS estimation with missing data.","year":2022,"lang":"en","type":"article","venue":"Psychological Methods","topic":"Blind Source Separation Techniques","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; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Structural equation modeling; Missing data; Statistics; Computation; Estimation; Econometrics; Mathematics; Algorithm; Economics","score_opus":0.1610506147015826,"score_gpt":0.5012766047666443,"score_spread":0.34022599006506166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205329525","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.0034711736,0.00017885702,0.99156815,0.003841171,0.00009303252,0.00028957127,0.000004205948,0.00021833858,0.00033548856],"genre_scores_gemma":[0.04906738,0.0000033579083,0.94978,0.0010336959,0.000014917543,0.00004025797,0.0000153202,0.0000058742203,0.000039194383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871176,0.00041571129,0.00015346239,0.0004594548,0.00013239397,0.00012722553],"domain_scores_gemma":[0.99874794,0.00071806414,0.00007426348,0.00035796154,0.000017934597,0.00008385702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012744863,0.00008798869,0.00013777049,0.000068919275,0.00033425255,0.00018855341,0.00038940168,0.000034251618,0.0000072144558],"category_scores_gemma":[0.00018263928,0.00007199632,0.00001926315,0.0002591249,0.00002747999,0.0003426653,0.0003308447,0.00013922254,2.5445237e-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.000012661474,0.00003424801,0.00010466257,0.0000044747794,0.000009753098,0.0000022398087,0.0005158444,0.00027737112,0.00030645035,0.012564559,0.0008520741,0.9853157],"study_design_scores_gemma":[0.0008207628,0.0006850167,0.0074712336,0.000013919613,0.000023762223,0.00008931055,0.00006695915,0.7969658,0.00022057693,0.18295589,0.010434583,0.0002522247],"about_ca_topic_score_codex":0.0000052043674,"about_ca_topic_score_gemma":4.8982724e-7,"teacher_disagreement_score":0.98506343,"about_ca_system_score_codex":0.000011229441,"about_ca_system_score_gemma":0.000019567695,"threshold_uncertainty_score":0.29359245},"labels":[],"label_agreement":null},{"id":"W4210604531","doi":"10.1007/0-306-48332-7_463","title":"Signal Processing with Higher Order Statistics","year":2001,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Higher-order statistics; Statistics; Signal processing; Computer science; SIGNAL (programming language); Order statistic; Order (exchange); Mathematics; Digital signal processing; Economics; Computer hardware","score_opus":0.011996956683695971,"score_gpt":0.23415342782708473,"score_spread":0.22215647114338877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210604531","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":[1.3379899e-7,0.000071911716,0.5555944,0.00008576011,0.00003568206,0.00015579365,0.000008249114,0.00013799127,0.44391006],"genre_scores_gemma":[0.000064956876,0.0006194703,0.7604939,0.00012672009,0.0000801833,0.000011566903,0.00013825028,0.000048082125,0.23841693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856615,0.000023602446,0.00039680893,0.0003793699,0.00048192564,0.0001521679],"domain_scores_gemma":[0.9983813,0.000048536054,0.00053814286,0.00034316335,0.0006291232,0.000059740636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013015838,0.00026997947,0.00028527167,0.00022068823,0.00006402461,0.00009334909,0.0004081432,0.00023022255,0.00047544466],"category_scores_gemma":[0.000007865539,0.00024632562,0.000029332925,0.00016408534,0.000080156235,0.0004788591,0.00008299353,0.00022956604,0.00001034725],"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.000026949614,0.000075292715,0.000027617201,0.00012502809,0.000052777308,0.000034953257,0.0007396806,0.2081647,0.0000014982829,0.6879007,0.010366195,0.0924846],"study_design_scores_gemma":[0.0006764635,0.00055811653,0.000032418433,0.00052650477,0.00011353366,0.000028867924,0.000006169727,0.32869452,0.00004677349,0.0304913,0.6375824,0.0012429219],"about_ca_topic_score_codex":0.0000051551892,"about_ca_topic_score_gemma":0.0000041238227,"teacher_disagreement_score":0.65740937,"about_ca_system_score_codex":0.000043421074,"about_ca_system_score_gemma":0.00032873207,"threshold_uncertainty_score":0.9999989},"labels":[],"label_agreement":null},{"id":"W4210868295","doi":"10.1109/tim.2022.3149325","title":"Windowing Compensation in Fourier Based Surrogate Analysis and Application to EEG Signal Classification","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Instrumentation and Measurement","topic":"Blind Source Separation Techniques","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":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Surrogate data; Computer science; Classification of discontinuities; Pattern recognition (psychology); Autoregressive model; Artificial intelligence; Electroencephalography; Feature (linguistics); Wavelet; Context (archaeology); SIGNAL (programming language); Speech recognition; Algorithm; Mathematics; Statistics; Psychology","score_opus":0.03511835523353389,"score_gpt":0.2701633779219383,"score_spread":0.23504502268840438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210868295","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.09908305,0.0000045443203,0.8983113,0.0018369681,0.000057948095,0.0005365634,0.0000059799577,0.00009022904,0.000073405645],"genre_scores_gemma":[0.9812205,0.0000044705616,0.017180067,0.0010294437,0.0000029974356,0.00053583906,0.000010324479,0.000006326048,0.000010058751],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836284,0.00024756067,0.00029000972,0.00036971038,0.0006099982,0.00011989049],"domain_scores_gemma":[0.9995008,0.000034808178,0.000096532305,0.00020633999,0.00008422308,0.000077288096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010261886,0.00011011428,0.00012538812,0.0007931002,0.0003267784,0.00010616461,0.00012078237,0.000027800877,0.00002436876],"category_scores_gemma":[0.0000025318193,0.0001295647,0.000040673254,0.0011073352,0.000017498947,0.00029471406,0.0000039961615,0.00014339692,0.0000023495397],"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.0001644471,0.00063953653,0.0035268445,0.00002547124,0.00016100093,0.0000012986719,0.005855408,0.22611986,0.07650917,0.0063684317,0.0000333623,0.68059516],"study_design_scores_gemma":[0.0014182504,0.00030702553,0.07542498,0.000014473743,0.00009249237,0.0000026033974,0.00070167525,0.8709445,0.049843594,0.00035817543,0.00059447373,0.000297749],"about_ca_topic_score_codex":0.00010979448,"about_ca_topic_score_gemma":0.0003225499,"teacher_disagreement_score":0.8821374,"about_ca_system_score_codex":0.00030882342,"about_ca_system_score_gemma":0.00006262262,"threshold_uncertainty_score":0.52834946},"labels":[],"label_agreement":null},{"id":"W4211152152","doi":"10.1007/978-1-4471-7452-3_15","title":"Independent Component Analysis","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Blind signal separation; Independent component analysis; Component (thermodynamics); Source separation; Separation (statistics); Computer science; Component analysis; Pattern recognition (psychology); Artificial intelligence; Telecommunications; Machine learning; Physics","score_opus":0.019697484073252565,"score_gpt":0.2477268318133696,"score_spread":0.22802934774011704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211152152","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021912915,0.000035644145,0.46401837,0.0002898327,0.0000677784,0.00012854481,0.0000022644492,0.00032775686,0.5351276],"genre_scores_gemma":[0.0076404153,0.000045577068,0.027385065,0.0013608205,0.000029182465,0.0000042043857,0.00003875687,0.000019641142,0.96347636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99842167,0.000022069891,0.00032009513,0.0005401361,0.00055275834,0.00014327971],"domain_scores_gemma":[0.99832004,0.00005037921,0.00021021906,0.0012366718,0.00010966542,0.00007302588],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002737535,0.00024328934,0.00042296163,0.0006667275,0.000033758784,0.00019799902,0.0010809334,0.00028112342,0.0008103118],"category_scores_gemma":[0.00000217387,0.0002187243,0.00035728025,0.00010999652,0.000021248949,0.00018210009,0.00046854524,0.00032080876,0.0012361797],"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":[5.7829726e-7,0.000007877937,0.000013286955,0.0000032988562,0.00029626265,0.000004464092,0.0000590541,0.000055824767,0.0000059034273,0.99494636,0.0029284512,0.0016786536],"study_design_scores_gemma":[0.00020104663,0.00011103946,0.00046048043,0.00003119423,0.0003849379,0.00000937655,0.0000032111757,0.024049636,0.000448976,0.08772634,0.8855434,0.0010303603],"about_ca_topic_score_codex":0.00002271915,"about_ca_topic_score_gemma":0.000048477417,"teacher_disagreement_score":0.90722,"about_ca_system_score_codex":0.00007172217,"about_ca_system_score_gemma":0.00010565062,"threshold_uncertainty_score":0.99954146},"labels":[],"label_agreement":null},{"id":"W4213182845","doi":"10.1016/j.compbiomed.2022.105324","title":"A new data covariance matrix estimation for improving minimum variance brain source localization","year":2022,"lang":"en","type":"article","venue":"Computers in Biology and Medicine","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Robustness (evolution); Covariance matrix; Covariance; Algorithm; Estimation of covariance matrices; Computer science; Mathematics; Diagonal; Matrix (chemical analysis); Statistics","score_opus":0.028419905734386932,"score_gpt":0.3480767865862657,"score_spread":0.31965688085187877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213182845","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.00019979684,0.00046309555,0.984154,0.0141829,0.00047787724,0.00035262664,0.000005471661,0.00013413934,0.00003008812],"genre_scores_gemma":[0.13790287,0.00001935787,0.85402876,0.007383673,0.00016047133,0.000050205737,0.00026003888,0.000009511585,0.0001850845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988557,0.00017667474,0.0002628364,0.00046061637,0.000081471735,0.00016271074],"domain_scores_gemma":[0.99886876,0.00043862005,0.00014130246,0.0004742614,0.000025912637,0.000051117077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012146103,0.000100054844,0.00018407335,0.00015816177,0.00017660447,0.000021363263,0.0007682184,0.000059431775,0.000006205187],"category_scores_gemma":[0.00021521917,0.00009647138,0.000009952315,0.00032398928,0.00006723111,0.0002266925,0.00063393055,0.00014188458,4.173124e-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.000075568256,0.000052566684,0.00046616208,0.00006758895,0.000016878814,0.000005145863,0.0043810382,0.010497219,0.0012994466,0.404962,0.04759316,0.5305832],"study_design_scores_gemma":[0.0009304658,0.0003117092,0.00012642214,0.00002171989,0.0000042700512,0.00002761389,0.000034753248,0.94155735,0.000028111768,0.029004643,0.027853688,0.00009923149],"about_ca_topic_score_codex":0.00007957194,"about_ca_topic_score_gemma":0.000009082756,"teacher_disagreement_score":0.93106014,"about_ca_system_score_codex":0.000037280544,"about_ca_system_score_gemma":0.0000990612,"threshold_uncertainty_score":0.39339888},"labels":[],"label_agreement":null},{"id":"W4226137696","doi":"10.2139/ssrn.4000723","title":"Posterior ratemaking of compound loss using longitudinal data with EM algorithm","year":2022,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Econometrics; Computer science; Mathematics","score_opus":0.03394717754323749,"score_gpt":0.300125593372719,"score_spread":0.2661784158294815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226137696","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.18915538,0.0005459693,0.8097335,0.00026717412,0.00008496702,0.000107604465,0.000007700065,0.000058935326,0.000038750888],"genre_scores_gemma":[0.93695575,0.000048443628,0.06274933,0.00009705643,0.000060255636,0.0000030069211,0.000006639599,0.000017106786,0.0000623865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975007,0.00026043996,0.000342762,0.00032655222,0.0005844893,0.0009850124],"domain_scores_gemma":[0.9987011,0.000039242477,0.00041702425,0.00067432836,0.00011879782,0.000049534505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026483783,0.00013985716,0.00021784309,0.00019658459,0.00045220926,0.00018990727,0.0019228891,0.00002549686,0.000014123282],"category_scores_gemma":[0.000009137894,0.00012638746,0.0000453971,0.00048449426,0.000045828652,0.00089642225,0.00091230875,0.0013452941,0.0000010198388],"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.00054882217,0.0014509409,0.014551749,0.00007911765,0.0018360412,0.0008549072,0.0091627715,0.014050158,0.008035503,0.50630844,0.0003835604,0.442738],"study_design_scores_gemma":[0.0045655337,0.006494864,0.0018536184,0.00021553019,0.00022063663,0.109619826,0.008325714,0.69792765,0.0043250658,0.16037807,0.0041806353,0.0018928415],"about_ca_topic_score_codex":0.000050790168,"about_ca_topic_score_gemma":0.00012359126,"teacher_disagreement_score":0.7478004,"about_ca_system_score_codex":0.00054387323,"about_ca_system_score_gemma":0.0023331537,"threshold_uncertainty_score":0.5844708},"labels":[],"label_agreement":null},{"id":"W4233665233","doi":"10.22215/etd/2010-09112","title":"A stochastic approximation ECM algorithm for misspecified multivariate probit models","year":2010,"lang":"en","type":"dissertation","venue":"","topic":"Blind Source Separation 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":"Carleton University","funders":"","keywords":"Multivariate statistics; Multivariate probit model; Mathematics; Probit model; Algorithm; Econometrics; Mathematical economics; Applied mathematics; Statistics","score_opus":0.029828653880672403,"score_gpt":0.29670369619421044,"score_spread":0.26687504231353804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233665233","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.0001001947,0.000022330902,0.9877612,0.00015799497,0.00058388175,0.0023788146,0.00001705249,0.0010387532,0.00793976],"genre_scores_gemma":[0.0044258744,0.0000030043109,0.9767037,0.00016540081,0.00010251952,0.0012460415,0.0009781605,0.000057546946,0.016317768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998028,0.00005296578,0.00049856096,0.0007413308,0.0003791624,0.0002999965],"domain_scores_gemma":[0.9981074,0.00013332465,0.00039733917,0.0007264783,0.0005384888,0.00009699209],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046387792,0.0003582935,0.0003573591,0.00033364582,0.00015842232,0.00041774692,0.0009851997,0.0006096275,0.000020511026],"category_scores_gemma":[0.000055484266,0.00033950512,0.00016526278,0.00024475675,0.00001496604,0.0008325239,0.00005627021,0.00047413132,0.00002506486],"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.000028290695,0.00020197325,1.8300147e-8,0.00011449554,0.000051163217,8.606848e-7,0.005968544,0.00096759864,0.002773116,0.6703481,0.0017498521,0.317796],"study_design_scores_gemma":[0.00033243824,0.0000618901,0.0000039904508,0.000043428787,0.000015210849,0.0000021619865,0.0000574175,0.8300098,0.006998334,0.16168691,0.0004308253,0.00035757315],"about_ca_topic_score_codex":0.000043703323,"about_ca_topic_score_gemma":0.00008103231,"teacher_disagreement_score":0.8290422,"about_ca_system_score_codex":0.000050027236,"about_ca_system_score_gemma":0.0002376332,"threshold_uncertainty_score":0.9999057},"labels":[],"label_agreement":null},{"id":"W4233853468","doi":"10.32920/ryerson.14646165.v1","title":"A Study Of Three Dicitonary Learning Algorithms","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Matching pursuit; Sparse approximation; Computer science; Discrete cosine transform; K-SVD; Algorithm; Coding (social sciences); Neural coding; Sparse matrix; Artificial intelligence; Compressed sensing; Mathematics","score_opus":0.048427121258253894,"score_gpt":0.31062160048418863,"score_spread":0.26219447922593475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233853468","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.18290599,0.0000876221,0.81038105,0.0001668514,0.0001770658,0.00038958775,2.8637442e-7,0.0005659946,0.005325574],"genre_scores_gemma":[0.8322757,0.00001262867,0.1672126,0.00008430073,0.000032324122,0.000058835984,0.00000567628,0.000011380542,0.00030656857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820685,0.00023387998,0.0003799798,0.00057968416,0.00046423537,0.00013537875],"domain_scores_gemma":[0.9984537,0.00008122122,0.00023748168,0.00096731173,0.00021569018,0.000044622142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050095667,0.00018076022,0.0003498515,0.00017666457,0.000051326308,0.00020413283,0.0011807445,0.00016130904,0.00002647823],"category_scores_gemma":[0.00003848295,0.00017075922,0.000100029276,0.00026268445,0.000021265827,0.0001783311,0.0036235545,0.00075399154,0.0000036941242],"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.000025516647,0.010951967,0.05640014,0.0005381981,0.0014509477,0.00093460514,0.1990848,0.046617948,0.0012828807,0.0654181,0.002458408,0.6148365],"study_design_scores_gemma":[0.0018707557,0.0037148262,0.07397834,0.0007239913,0.00013241319,0.00008001361,0.015120571,0.84366846,0.023265447,0.033470977,0.0012685856,0.0027055999],"about_ca_topic_score_codex":0.00036114416,"about_ca_topic_score_gemma":0.00012845133,"teacher_disagreement_score":0.79705054,"about_ca_system_score_codex":0.000024346851,"about_ca_system_score_gemma":0.0001798174,"threshold_uncertainty_score":0.69633585},"labels":[],"label_agreement":null},{"id":"W4237174207","doi":"10.1190/sbgf2005-287","title":"Noise suppression in seismic data with sparse coding","year":2005,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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 British Columbia","funders":"","keywords":"Principal component analysis; Series (stratigraphy); Noise (video); Sparse approximation; Pattern recognition (psychology); Computer science; Filter (signal processing); Neural coding; Representation (politics); Time series; Mathematics; Algorithm; Artificial intelligence; Statistics","score_opus":0.04025531532008953,"score_gpt":0.2940505800236017,"score_spread":0.25379526470351216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237174207","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.024641138,0.000012623207,0.9611913,0.0040763584,0.000020024454,0.000115171766,0.00000119895,0.00033023936,0.009611967],"genre_scores_gemma":[0.76590604,0.0000071827844,0.23243083,0.0012057797,0.000016433827,0.0000036753406,0.000006219384,0.0000037813425,0.00042008862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926364,0.000041907682,0.00012306054,0.00028862228,0.00015232232,0.0001304511],"domain_scores_gemma":[0.99899006,0.000033045373,0.000033999026,0.00088681956,0.000018139343,0.00003793404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030179572,0.00006767399,0.00007329456,0.00009655913,0.000029407583,0.0001011141,0.00097284734,0.000032063443,0.000024529754],"category_scores_gemma":[0.000010931016,0.000050463153,0.0000063052257,0.00021944584,0.000014482477,0.0012820911,0.0004207726,0.000099118275,0.000043645985],"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.000088013,0.00096270995,0.013842464,0.000041108677,0.000025666972,0.00010600857,0.009346971,0.018692983,0.016380785,0.28169933,0.18467526,0.4741387],"study_design_scores_gemma":[0.0002552275,0.000028318902,0.0009120011,0.000029864155,9.048695e-7,0.000011654202,0.000018182707,0.9463596,0.021576757,0.00031693585,0.030367173,0.00012343047],"about_ca_topic_score_codex":0.00004717974,"about_ca_topic_score_gemma":0.00014932829,"teacher_disagreement_score":0.92766654,"about_ca_system_score_codex":0.000019695768,"about_ca_system_score_gemma":0.000041148887,"threshold_uncertainty_score":0.20578277},"labels":[],"label_agreement":null},{"id":"W4237323158","doi":"10.4018/978-1-60566-902-1.ch019","title":"Robust Independent Component Analysis for Cognitive Informatics","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"FastICA; Infomax; Independent component analysis; Outlier; Sensitivity (control systems); Pattern recognition (psychology); Mathematics; Negentropy; Artificial intelligence; Divergence (linguistics); Computer science; Algorithm; Blind signal separation; Engineering","score_opus":0.05146461021903113,"score_gpt":0.2651893708031613,"score_spread":0.21372476058413017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237323158","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.000014858711,0.000026654168,0.5113908,0.00001505904,0.00008450327,0.00047171948,0.00011829427,0.0002524189,0.48762572],"genre_scores_gemma":[0.6017283,0.000026573498,0.2842251,0.006578509,0.00032193953,0.00044010812,0.00023855997,0.00013615146,0.10630475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998009,0.000026033951,0.0007128038,0.00040901877,0.0005314452,0.00031166367],"domain_scores_gemma":[0.9979796,0.00007982673,0.0006369957,0.0006744462,0.0004603185,0.00016885217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003370499,0.00042841403,0.0006206943,0.00032334367,0.00011819595,0.0002609498,0.0010185912,0.00045802354,0.000020102294],"category_scores_gemma":[0.000015894379,0.00042834645,0.0005266085,0.00006898636,0.000081635044,0.00019240307,0.00046117383,0.00029006499,0.00008835062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015483567,0.000014344342,0.000013629515,0.000020150852,0.00064962765,0.0000050370695,0.00063138397,0.000038296865,3.679934e-7,0.9938473,0.00053488236,0.0042294567],"study_design_scores_gemma":[0.00091610645,0.0004171735,0.00020888707,0.00021679064,0.0013762916,0.00003326033,0.00005514067,0.009307265,0.00033161073,0.9617186,0.023977872,0.0014409813],"about_ca_topic_score_codex":0.000044588356,"about_ca_topic_score_gemma":0.00011972873,"teacher_disagreement_score":0.6017134,"about_ca_system_score_codex":0.0002059784,"about_ca_system_score_gemma":0.00023291988,"threshold_uncertainty_score":0.99981683},"labels":[],"label_agreement":null},{"id":"W4237690140","doi":"10.22215/etd/2016-11373","title":"Convolutive Blind Sparse Source Separation with Application to EMG Decomposition","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Blind Source Separation 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":"Carleton University","funders":"","keywords":"Blind signal separation; Algorithm; Matrix (chemical analysis); Rank (graph theory); Computer science; Sparse matrix; Matrix decomposition; Pattern recognition (psychology); Channel (broadcasting); Mathematics; Artificial intelligence","score_opus":0.010292912869315518,"score_gpt":0.3146910690287525,"score_spread":0.304398156159437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237690140","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.012509715,0.000021870617,0.95485383,0.0008992824,0.00014703431,0.0015598582,0.0000063146394,0.00094518403,0.029056923],"genre_scores_gemma":[0.7835064,0.000027452528,0.16558437,0.0020195693,0.0002594079,0.0015606841,0.001292874,0.000113081755,0.045636173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99763346,0.00012606835,0.00044796002,0.000916667,0.00057164824,0.00030418075],"domain_scores_gemma":[0.99787104,0.00009156894,0.00041539513,0.0008597828,0.0005862337,0.00017598465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032886097,0.00039313466,0.00033125473,0.0004907127,0.00020767104,0.00032128577,0.000774197,0.0003467276,0.00003550136],"category_scores_gemma":[0.000017783837,0.00031055728,0.00008027786,0.00058898295,0.000023693547,0.0008107632,0.0000627855,0.000231666,0.0006242645],"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.0023907237,0.0008942457,0.00031229976,0.000239758,0.00042243014,0.000014636788,0.035914157,0.0014300322,0.09868051,0.43568456,0.031491406,0.39252523],"study_design_scores_gemma":[0.0046963966,0.0031044981,0.009554681,0.0012580018,0.0002426451,0.00008423215,0.0011612006,0.044939514,0.79270726,0.024630366,0.112217784,0.0054034367],"about_ca_topic_score_codex":0.000083956606,"about_ca_topic_score_gemma":0.0006535417,"teacher_disagreement_score":0.78926945,"about_ca_system_score_codex":0.00017670251,"about_ca_system_score_gemma":0.00024938057,"threshold_uncertainty_score":0.9999347},"labels":[],"label_agreement":null},{"id":"W4237810397","doi":"10.32920/ryerson.14646498.v1","title":"Video content analysis based on statistical modeling","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Video content analysis; Video tracking; Artificial intelligence; Hidden Markov model; Segmentation; Independent component analysis; Statistical model; Markov chain; Parsing; Probabilistic logic; Machine learning; Fuzzy logic; Pattern recognition (psychology); Data mining; Video processing; Computer vision","score_opus":0.098763645295514,"score_gpt":0.32476735356747793,"score_spread":0.22600370827196392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237810397","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.0031337051,0.000010906955,0.99223495,0.0009216041,0.00009857523,0.00017021081,0.000010953967,0.0006531367,0.0027659505],"genre_scores_gemma":[0.54309183,0.0000025212735,0.45465523,0.0020256687,0.0000126102,0.0000315448,0.00011827642,0.0000062981944,0.00005604144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769783,0.00031506104,0.00039059806,0.0008815403,0.00053444644,0.0001805464],"domain_scores_gemma":[0.9977642,0.00014499431,0.000090891794,0.0015595338,0.0003013676,0.00013895817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006190073,0.00021361347,0.00040424778,0.0004164462,0.00005154259,0.0008195537,0.0009044112,0.00020141479,0.00015168854],"category_scores_gemma":[0.00008529595,0.00019568503,0.00021496735,0.00040010834,0.00001665166,0.00017199201,0.00058226025,0.000480686,0.000009571795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039850083,0.0001408111,0.000053777316,0.000010311198,0.00011615146,0.000016446913,0.00024928016,0.9107277,0.000021032118,0.086159796,0.000089615976,0.0024110987],"study_design_scores_gemma":[0.000067013636,0.000045136534,0.000117562944,0.000019402227,0.00007769264,2.8032952e-7,0.000030000994,0.995871,0.00051535387,0.0030145561,0.000017246812,0.00022477032],"about_ca_topic_score_codex":0.00043307073,"about_ca_topic_score_gemma":0.00014586034,"teacher_disagreement_score":0.5399581,"about_ca_system_score_codex":0.000075488235,"about_ca_system_score_gemma":0.00028201067,"threshold_uncertainty_score":0.79798037},"labels":[],"label_agreement":null},{"id":"W4238331033","doi":"10.1109/icme.2003.1221390","title":"Robust digit recognition using phase-dependent time-frequency masking","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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 Toronto","funders":"","keywords":"Computer science; Beamforming; Speech recognition; Multilateration; Masking (illustration); Reverberation; SIGNAL (programming language); Time–frequency analysis; Noise (video); Signal-to-noise ratio (imaging); Numerical digit; Pattern recognition (psychology); Acoustics; Artificial intelligence; Mathematics; Telecommunications; Physics","score_opus":0.08302162790961236,"score_gpt":0.2902858320437551,"score_spread":0.2072642041341427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238331033","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.014193553,0.000015661002,0.9000426,0.000110885,0.000080627105,0.00015574646,0.0000011677002,0.0006880995,0.08471168],"genre_scores_gemma":[0.3919679,0.000004802214,0.6067818,0.0005911076,0.000024897534,0.000009766822,0.000004863175,0.000014349965,0.00060051976],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988809,0.00011537947,0.00023416114,0.00031579155,0.00024392676,0.0002097955],"domain_scores_gemma":[0.999346,0.00004108951,0.00008993064,0.00035547692,0.0001007954,0.00006668162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036563398,0.00011836279,0.000109549015,0.00013814896,0.00011246843,0.00031396604,0.00030832516,0.0000690383,0.00028379192],"category_scores_gemma":[0.00005770425,0.00011580147,0.000047414476,0.00029843854,0.000017411345,0.0010748319,0.00005277302,0.00011079909,0.00023381357],"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.000026269177,0.001922243,0.00048073215,0.000055258355,0.00013056115,0.00014668252,0.0035195604,0.0038132537,0.13608858,0.38923088,0.0044962247,0.46008974],"study_design_scores_gemma":[0.0018054644,0.00039686647,0.000018256695,0.00008956981,0.000022573991,0.00027864048,0.00007765646,0.2411453,0.61763865,0.13377914,0.0036798918,0.0010679817],"about_ca_topic_score_codex":0.000020097457,"about_ca_topic_score_gemma":0.0000034899376,"teacher_disagreement_score":0.4815501,"about_ca_system_score_codex":0.00006986791,"about_ca_system_score_gemma":0.00007645974,"threshold_uncertainty_score":0.4722247},"labels":[],"label_agreement":null},{"id":"W4240405842","doi":"10.1109/iembs.2006.4397503","title":"A Combined SPM-ICA Approach to fMRI","year":2006,"lang":"en","type":"article","venue":"Conference proceedings","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Independent component analysis; Statistical parametric mapping; Computer science; Voxel; Artificial intelligence; Pattern recognition (psychology); Haemodynamic response; Neuroimaging; Functional magnetic resonance imaging; Parametric statistics; Brain mapping; Psychology; Neuroscience; Mathematics; Magnetic resonance imaging; Medicine","score_opus":0.02102943297026847,"score_gpt":0.2397992341010817,"score_spread":0.21876980113081324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240405842","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.028661042,0.0000074594454,0.72927547,0.0031313598,0.00004787521,0.0003807402,7.276149e-7,0.0009741542,0.23752117],"genre_scores_gemma":[0.83893096,0.0000014469948,0.1586333,0.00092934736,0.00004412321,0.000109518034,0.000002764841,0.000010057676,0.0013384944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986162,0.000009662385,0.00024603782,0.0005056645,0.00031054148,0.0003118498],"domain_scores_gemma":[0.999158,0.00001610621,0.00009012839,0.00023038742,0.00038538946,0.000119964396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003099271,0.00017402922,0.00018744536,0.00018377302,0.00010671472,0.0006471809,0.0011072456,0.00008953191,0.000010929951],"category_scores_gemma":[0.000044041215,0.000167609,0.000045080178,0.00060929655,0.000044207827,0.0006496874,0.00029489462,0.00016865492,0.00010490761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048720085,0.000099502366,0.00055339426,0.000013204828,0.0000025840397,4.442871e-7,0.0014784781,0.0000025093977,0.004066204,0.9756162,0.016365107,0.0017974654],"study_design_scores_gemma":[0.002026893,0.0011776264,0.03039505,0.00020901459,0.000028211956,0.000074233314,0.0008294294,0.18945016,0.17159782,0.47615743,0.12531194,0.0027421913],"about_ca_topic_score_codex":0.000036614932,"about_ca_topic_score_gemma":0.0000012501272,"teacher_disagreement_score":0.8102699,"about_ca_system_score_codex":0.00003567499,"about_ca_system_score_gemma":0.00008655552,"threshold_uncertainty_score":0.6834896},"labels":[],"label_agreement":null},{"id":"W4240505264","doi":"10.1002/9780470575758.index","title":"Index","year":2010,"lang":"en","type":"paratext","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Index (typography); Computer science; Library science; Citation; Citation index; Information retrieval; World Wide Web","score_opus":0.013159169525108831,"score_gpt":0.281235549745157,"score_spread":0.2680763802200482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240505264","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000025642494,0.000032202268,0.5094213,0.000635328,0.0008808306,0.00007786172,0.0000012921244,0.00025120718,0.4886974],"genre_scores_gemma":[0.0025263734,0.000056292796,0.10609058,0.0036742985,0.00022508201,0.00003430899,0.00002463261,0.000019128707,0.8873493],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898857,0.00004450814,0.00018356912,0.0003721434,0.0002427135,0.00016851105],"domain_scores_gemma":[0.99875826,0.00003861186,0.00010631351,0.00094127824,0.00008921815,0.00006631089],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019373407,0.00017373548,0.00018520173,0.00019308068,0.000045509645,0.000334716,0.0015378456,0.00053783,0.0031711566],"category_scores_gemma":[0.000010563091,0.0001497005,0.00007300646,0.00020390053,0.000027209237,0.00026838802,0.00036199146,0.00080768915,0.021258334],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.0325243e-7,0.0000104350775,7.4761846e-7,0.0000039079027,0.000003854777,7.413015e-7,0.00005326642,0.0000022842326,0.000050561874,0.04802324,0.9456101,0.006240658],"study_design_scores_gemma":[0.000038841965,0.000016141123,0.000010124323,0.000007284978,7.4967915e-7,0.000005424538,8.188673e-7,0.0014565536,0.003061146,0.0020451564,0.9931574,0.00020039723],"about_ca_topic_score_codex":0.00004543965,"about_ca_topic_score_gemma":0.000026586076,"teacher_disagreement_score":0.4033307,"about_ca_system_score_codex":0.000014508758,"about_ca_system_score_gemma":0.0002019481,"threshold_uncertainty_score":0.9977401},"labels":[],"label_agreement":null},{"id":"W4240718222","doi":"10.32920/ryerson.14646498","title":"Video content analysis based on statistical modeling","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Video content analysis; Video tracking; Artificial intelligence; Hidden Markov model; Segmentation; Statistical model; Parsing; Markov chain; Machine learning; Probabilistic logic; Independent component analysis; Fuzzy logic; Pattern recognition (psychology); Data mining; Object (grammar); Computer vision","score_opus":0.098763645295514,"score_gpt":0.32476735356747793,"score_spread":0.22600370827196392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240718222","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.0031337051,0.000010906955,0.99223495,0.0009216041,0.00009857523,0.00017021081,0.000010953967,0.0006531367,0.0027659505],"genre_scores_gemma":[0.54309183,0.0000025212735,0.45465523,0.0020256687,0.0000126102,0.0000315448,0.00011827642,0.0000062981944,0.00005604144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769783,0.00031506104,0.00039059806,0.0008815403,0.00053444644,0.0001805464],"domain_scores_gemma":[0.9977642,0.00014499431,0.000090891794,0.0015595338,0.0003013676,0.00013895817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006190073,0.00021361347,0.00040424778,0.0004164462,0.00005154259,0.0008195537,0.0009044112,0.00020141479,0.00015168854],"category_scores_gemma":[0.00008529595,0.00019568503,0.00021496735,0.00040010834,0.00001665166,0.00017199201,0.00058226025,0.000480686,0.000009571795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039850083,0.0001408111,0.000053777316,0.000010311198,0.00011615146,0.000016446913,0.00024928016,0.9107277,0.000021032118,0.086159796,0.000089615976,0.0024110987],"study_design_scores_gemma":[0.000067013636,0.000045136534,0.000117562944,0.000019402227,0.00007769264,2.8032952e-7,0.000030000994,0.995871,0.00051535387,0.0030145561,0.000017246812,0.00022477032],"about_ca_topic_score_codex":0.00043307073,"about_ca_topic_score_gemma":0.00014586034,"teacher_disagreement_score":0.5399581,"about_ca_system_score_codex":0.000075488235,"about_ca_system_score_gemma":0.00028201067,"threshold_uncertainty_score":0.79798037},"labels":[],"label_agreement":null},{"id":"W4241420265","doi":"10.23952/jnva.4.2020.3.10","title":"A descent SQP alternating direction method for minimizing the sum of three convex functions","year":2020,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Descent (aeronautics); Sequential quadratic programming; Descent direction; Mathematical optimization; Regular polygon; Mathematics; Convex function; Gradient descent; Computer science; Control theory (sociology); Quadratic programming; Geometry; Engineering; Artificial intelligence; Aerospace engineering","score_opus":0.043487309885757074,"score_gpt":0.31431580440433543,"score_spread":0.2708284945185784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241420265","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.0049969126,0.00007319126,0.9852632,0.009487941,0.00005313475,0.00006585101,0.000009516815,0.000012322217,0.000037891237],"genre_scores_gemma":[0.28670955,0.00001898603,0.7124228,0.00059135456,0.00023115211,0.0000031249563,0.0000047836866,0.0000035458195,0.000014734857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902976,0.00009974181,0.00043273627,0.000110841895,0.0002638449,0.00006307524],"domain_scores_gemma":[0.99835926,0.00047486796,0.0005453438,0.000082745246,0.0004865278,0.000051251784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010081099,0.00006305232,0.00021830507,0.00017021247,0.00011098065,0.00007464306,0.00020496285,0.000030029907,0.000008490541],"category_scores_gemma":[0.00024138963,0.000043353233,0.00023836778,0.00062793744,0.000013368786,0.00023887535,0.00004333389,0.00010943485,2.637813e-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.00085533876,0.0014707145,0.08709389,0.00026936762,0.023858298,0.000012469599,0.02556505,0.3540173,0.040710706,0.25140324,0.00407616,0.21066745],"study_design_scores_gemma":[0.00022386842,0.00010846628,0.008485832,0.0000063522757,0.0004091667,0.0000068882114,0.000059564387,0.9872627,0.0008493747,0.0013231469,0.0012162937,0.000048305963],"about_ca_topic_score_codex":0.000025205853,"about_ca_topic_score_gemma":0.000017973942,"teacher_disagreement_score":0.63324547,"about_ca_system_score_codex":0.000015021607,"about_ca_system_score_gemma":0.0000733043,"threshold_uncertainty_score":0.17678936},"labels":[],"label_agreement":null},{"id":"W4242704000","doi":"10.1109/isspit.2018.8642696","title":"Extraction of Fetal Electrocardiogram signals using Blind Source Extraction Based Parallel Linear Predictor Filter","year":2018,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Windsor","funders":"","keywords":"FastICA; Computer science; Blind signal separation; Pattern recognition (psychology); Artificial intelligence; Extraction (chemistry); Filter (signal processing); Sensitivity (control systems); Independent component analysis; Linear prediction; Algorithm; Engineering; Electronic engineering; Chemistry; Computer vision; Chromatography","score_opus":0.03726160221308574,"score_gpt":0.32372052173337745,"score_spread":0.28645891952029173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242704000","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.0828298,0.000020329027,0.9142822,0.00016306921,0.00014870646,0.00036869152,0.0000011630868,0.00051199883,0.001674009],"genre_scores_gemma":[0.66425645,0.0000035061685,0.33500552,0.00024013878,0.00019498264,0.00001580712,0.0000045418296,0.000013430675,0.00026560377],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982769,0.00018375121,0.00041721665,0.00039920886,0.0004519936,0.00027093134],"domain_scores_gemma":[0.998684,0.00011936478,0.00027557238,0.0005036895,0.00032976587,0.00008759088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060667633,0.00017669256,0.0002136884,0.0003051762,0.00013108399,0.00012341488,0.00037964323,0.00016805713,0.00013872606],"category_scores_gemma":[0.000044438315,0.00016646973,0.000159938,0.00053124246,0.00008951578,0.0010792383,0.00006082365,0.00020078546,0.000028901912],"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.0009700995,0.0010726874,0.0013508036,0.000058285645,0.00020967009,0.000008830358,0.001238757,0.018407604,0.9362093,0.0041250414,0.0052652983,0.031083578],"study_design_scores_gemma":[0.0008040662,0.00038778354,0.0003942288,0.000017199283,0.000016766413,0.000023134417,0.000013409179,0.7169649,0.27641383,0.00037986806,0.0044079423,0.00017690397],"about_ca_topic_score_codex":0.00007077641,"about_ca_topic_score_gemma":0.000008402482,"teacher_disagreement_score":0.69855726,"about_ca_system_score_codex":0.000048887156,"about_ca_system_score_gemma":0.00013442681,"threshold_uncertainty_score":0.6788439},"labels":[],"label_agreement":null},{"id":"W4243088460","doi":"10.32920/ryerson.14653131","title":"Empirical analysis for non-stationary signal de-noising, de-trending and discrimination applications","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Hilbert–Huang transform; Computer science; SIGNAL (programming language); Artificial intelligence; Decomposition; Pattern recognition (psychology); Instantaneous phase; Context (archaeology); Signal processing; Scale (ratio); Speech recognition; Algorithm; White noise; Digital signal processing; Computer vision","score_opus":0.04364194734714789,"score_gpt":0.36453903740236204,"score_spread":0.32089709005521416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243088460","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.00551318,0.00006848762,0.99067634,0.0020576378,0.00002171937,0.0004623337,0.000014280639,0.0002537644,0.0009322536],"genre_scores_gemma":[0.49144843,0.000024841047,0.5071021,0.00041502263,0.000035866793,0.00052617915,0.00024047951,0.0000078487,0.00019924625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856395,0.00011101003,0.00030668455,0.0006157218,0.00020728954,0.00019534078],"domain_scores_gemma":[0.9987726,0.0002872186,0.00017816995,0.00044054163,0.00022251543,0.00009893333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006229587,0.0001688775,0.00024791472,0.00048442185,0.00017392346,0.0006428864,0.00044046828,0.000206801,0.000017398621],"category_scores_gemma":[0.000030014206,0.00017845228,0.00018155924,0.00056600326,0.000035731646,0.00028276062,0.00052070414,0.00022671976,7.032724e-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.00003845306,0.0016653569,0.09537211,0.0014905977,0.0033544116,0.000025310243,0.0757366,0.053467672,0.008444412,0.44120097,0.009901838,0.30930227],"study_design_scores_gemma":[0.00010144517,0.00002468844,0.023323089,0.000028988785,0.00023300332,0.0000056215576,0.00027885535,0.9434849,0.002985738,0.028584765,0.00064270815,0.0003062074],"about_ca_topic_score_codex":0.000051423907,"about_ca_topic_score_gemma":0.000086456705,"teacher_disagreement_score":0.8900172,"about_ca_system_score_codex":0.00015065484,"about_ca_system_score_gemma":0.00033501617,"threshold_uncertainty_score":0.72770727},"labels":[],"label_agreement":null},{"id":"W4243154351","doi":"10.32920/ryerson.14651559","title":"Blind Source Separation in the Analysis of Electrocardiogram Pre-Shock Waveforms During Ventricular Fibrillation","year":2021,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Ventricular fibrillation; Shock (circulatory); Blind signal separation; Waveform; Cardiology; Computer science; Internal medicine; Artificial intelligence; Medicine; Channel (broadcasting); Telecommunications","score_opus":0.013293830279908407,"score_gpt":0.2908703408474163,"score_spread":0.27757651056750793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243154351","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.4901274,0.00014678696,0.5086982,0.00015206465,0.000026313579,0.00037763026,0.0000010318439,0.00010858608,0.00036192584],"genre_scores_gemma":[0.9878758,0.00009704976,0.011584228,0.000077404904,0.00004278759,0.000053598073,0.00017396294,0.000009445731,0.000085701366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742883,0.00039414412,0.00065909274,0.00060051744,0.00068345584,0.00023396658],"domain_scores_gemma":[0.9979936,0.00009234381,0.0004252777,0.0012435461,0.00021193031,0.00003330497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009963537,0.00023218841,0.00052599236,0.0011104663,0.00007065287,0.00045700438,0.0008714673,0.00028250867,0.000009180391],"category_scores_gemma":[0.000048761012,0.00017547744,0.0005439587,0.0034225765,0.000021852264,0.00037403769,0.00054109877,0.00042145574,0.0000010562688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029177718,0.00013272901,0.011410373,0.000107965374,0.0012537146,0.000019920517,0.011653297,0.9653628,0.000884859,0.0027031524,0.000057064917,0.0063849464],"study_design_scores_gemma":[0.0002717617,0.00005388985,0.1342058,0.00005855408,0.00036732887,0.000017294815,0.00021014399,0.8399207,0.02329611,0.0010186136,0.00019686436,0.00038292244],"about_ca_topic_score_codex":0.00021878952,"about_ca_topic_score_gemma":0.00018866704,"teacher_disagreement_score":0.4977484,"about_ca_system_score_codex":0.000109594694,"about_ca_system_score_gemma":0.00013623049,"threshold_uncertainty_score":0.71557623},"labels":[],"label_agreement":null},{"id":"W4243520243","doi":"10.32920/ryerson.14648397","title":"Online LTI system identification and time delay estimation","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Akaike information criterion; Bayesian information criterion; LTI system theory; Computer science; Model selection; Impulse response; System identification; Minimum description length; Selection (genetic algorithm); Identification (biology); Algorithm; Mathematical optimization; Control theory (sociology); Linear system; Data mining; Mathematics; Control (management); Artificial intelligence; Machine learning","score_opus":0.018398540994365623,"score_gpt":0.2803714906123301,"score_spread":0.26197294961796447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243520243","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.019734204,0.00012403226,0.97614413,0.00094027334,0.00017749933,0.00032137177,0.000006465852,0.0011612463,0.0013907605],"genre_scores_gemma":[0.5629363,0.000018809644,0.4355245,0.00014587936,0.000029596424,0.00003904486,0.00025063,0.00001019177,0.0010450364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854535,0.00015269427,0.0003903311,0.00055494125,0.00025605538,0.000100622434],"domain_scores_gemma":[0.99860317,0.000048499965,0.00024130513,0.00082806876,0.00022518655,0.00005375904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051374605,0.00015716485,0.00020459142,0.00015272357,0.00006225305,0.0009228431,0.0004962466,0.00021506914,0.000010203815],"category_scores_gemma":[0.000038560665,0.00015805557,0.0000493795,0.00015306869,0.000019235722,0.00041785248,0.0008759717,0.00023989264,0.000037488175],"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.000008554187,0.0007600853,0.00013533376,0.0020443252,0.00025117953,0.00007327976,0.0090429485,0.0213243,0.0105803665,0.6976669,0.009036876,0.2490759],"study_design_scores_gemma":[0.000048201095,0.000009261536,0.00071308186,0.0001321597,0.000010744837,0.000029455292,0.000038681046,0.9929638,0.0041908757,0.0015921576,0.000094729825,0.00017687489],"about_ca_topic_score_codex":0.000050978,"about_ca_topic_score_gemma":0.000009178455,"teacher_disagreement_score":0.97163945,"about_ca_system_score_codex":0.000080525286,"about_ca_system_score_gemma":0.00012216608,"threshold_uncertainty_score":0.88989973},"labels":[],"label_agreement":null},{"id":"W4244854124","doi":"10.1007/3-540-27489-8_1","title":"Introduction","year":2005,"lang":"en","type":"book-chapter","venue":"Signals and communication technology","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"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":"Computer science","score_opus":0.013352338891842373,"score_gpt":0.2449534701890721,"score_spread":0.23160113129722973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244854124","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020376896,0.013379113,0.23546779,0.15685573,0.00007851242,0.0004693472,0.0000043165046,0.002661285,0.59106356],"genre_scores_gemma":[0.039118763,0.031404924,0.27901697,0.0031038823,0.00040083512,0.00017737999,0.00010170947,0.00010333621,0.6465722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999022,0.000038205453,0.00031534416,0.00036987613,0.00013175482,0.00012279708],"domain_scores_gemma":[0.99767303,0.00004568478,0.00028257738,0.0018089156,0.00015689046,0.000032878608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031643617,0.00019485396,0.00024470978,0.000500348,0.00014652775,0.00009478436,0.0012204151,0.0005525815,0.0001522091],"category_scores_gemma":[0.000019024725,0.00020548305,0.000045435114,0.00009883783,0.00021241175,0.00024231455,0.00071041915,0.0006027545,0.00010791144],"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":[6.969199e-7,0.0000072493594,4.4890405e-7,0.0000027562041,0.000011373732,2.4824354e-7,0.00004459116,0.0000013101708,0.00012198062,0.84600013,0.006025526,0.1477837],"study_design_scores_gemma":[0.00004567623,0.000041815158,0.0000015024701,0.000019886786,0.000005445904,0.000021046859,0.000004429592,0.00020533634,0.0010801181,0.396193,0.6022435,0.00013827247],"about_ca_topic_score_codex":0.0000021385902,"about_ca_topic_score_gemma":0.000008934877,"teacher_disagreement_score":0.59621793,"about_ca_system_score_codex":0.00003859152,"about_ca_system_score_gemma":0.000045158467,"threshold_uncertainty_score":0.83793557},"labels":[],"label_agreement":null},{"id":"W4245324638","doi":"10.1109/icpr.2004.1334120","title":"ICA filters for lighting invariant face recognition","year":2004,"lang":"en","type":"article","venue":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","topic":"Blind Source Separation 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":"McMaster University","funders":"","keywords":"Artificial intelligence; Facial recognition system; Independent component analysis; Pattern recognition (psychology); Computer science; Invariant (physics); Computer vision; Subspace topology; Principal component analysis; Cognitive neuroscience of visual object recognition; Gaussian; Feature extraction; Mathematics","score_opus":0.06641721551825251,"score_gpt":0.28850258051897437,"score_spread":0.22208536500072185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245324638","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.1251851,0.00004227611,0.7883341,0.041227266,0.0016943329,0.002481404,0.0004890118,0.00076996,0.039776552],"genre_scores_gemma":[0.96951103,0.000038514743,0.02653314,0.0030195606,0.00018672564,0.00026475286,0.00007854781,0.00003406083,0.00033366866],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976379,0.000026373833,0.0006700234,0.0006262246,0.00069419696,0.0003452536],"domain_scores_gemma":[0.9971314,0.000093907795,0.0007292286,0.00023618757,0.001706055,0.00010320286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006568203,0.00030984022,0.0002647146,0.00032505073,0.00021308388,0.00039916515,0.001605714,0.00016454144,0.00010636865],"category_scores_gemma":[0.00037282985,0.0002665786,0.00020872985,0.00034887766,0.000099470526,0.0010927027,0.0001964794,0.0003252209,0.000103741746],"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.0007265318,0.0033259685,0.0037506898,0.00075960887,0.0010136841,0.00001127665,0.016423598,0.0005764501,0.065924,0.2934309,0.04628033,0.567777],"study_design_scores_gemma":[0.003120382,0.000708865,0.00172144,0.0020784906,0.00006335697,0.00008777783,0.0006275303,0.0072838985,0.58480215,0.3967028,0.001735515,0.0010677644],"about_ca_topic_score_codex":0.00007287061,"about_ca_topic_score_gemma":0.000018421568,"teacher_disagreement_score":0.84432596,"about_ca_system_score_codex":0.0002116518,"about_ca_system_score_gemma":0.00017865072,"threshold_uncertainty_score":0.99997866},"labels":[],"label_agreement":null},{"id":"W4246083685","doi":"10.1109/vetec.1996.503411","title":"Combined equalization and differential detection using precoding","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Toronto","funders":"","keywords":"Precoding; Fading; Demodulation; Differential coding; Computer science; Phase-shift keying; Equalization (audio); Transmitter; Electronic engineering; Multipath propagation; Transceiver; Channel (broadcasting); Differential (mechanical device); Algorithm; Decoding methods; Bit error rate; Telecommunications; MIMO; Engineering; Wireless","score_opus":0.050383908774079646,"score_gpt":0.2612423010702181,"score_spread":0.21085839229613848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246083685","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.23907839,0.0000047703675,0.7593748,0.00007600107,0.00005557539,0.00006028884,5.102225e-8,0.0002684588,0.0010817038],"genre_scores_gemma":[0.97529614,0.0000071935215,0.024426555,0.00009820222,0.00001347535,0.0000024288677,2.9766863e-7,0.0000032386167,0.00015249601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995712,0.000046774647,0.00009620934,0.00013289294,0.00008304147,0.0000698526],"domain_scores_gemma":[0.9997823,0.000019482652,0.000037089605,0.00011139976,0.000025098805,0.000024618643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007139178,0.00004844148,0.000049118284,0.000075702665,0.000085706066,0.00016014559,0.00008522646,0.0000341135,0.000039424252],"category_scores_gemma":[0.000011809296,0.00004606836,0.0000115977855,0.00013153264,0.000009284096,0.00042979547,0.000060287963,0.000036092042,0.0000037171706],"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.000008301932,0.00018585332,0.001673731,0.00003089403,0.000024578812,0.0000018283672,0.005656968,0.00021250888,0.21278514,0.40164658,0.00024559538,0.377528],"study_design_scores_gemma":[0.00011878362,0.000035884437,0.00045682664,0.000003592621,0.0000016214799,0.000003144407,0.000005220041,0.94388795,0.05362153,0.0017416725,0.0000601865,0.00006359168],"about_ca_topic_score_codex":0.000011775169,"about_ca_topic_score_gemma":0.000005065275,"teacher_disagreement_score":0.94367546,"about_ca_system_score_codex":0.000014061262,"about_ca_system_score_gemma":0.000001884825,"threshold_uncertainty_score":0.18786132},"labels":[],"label_agreement":null},{"id":"W4247077282","doi":"10.32920/ryerson.14646165","title":"A Study Of Three Dicitonary Learning Algorithms","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Matching pursuit; Sparse approximation; Computer science; Discrete cosine transform; K-SVD; Algorithm; Coding (social sciences); Neural coding; Sparse matrix; Artificial intelligence; Compressed sensing; Mathematics","score_opus":0.048427121258253894,"score_gpt":0.31062160048418863,"score_spread":0.26219447922593475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247077282","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.18290599,0.0000876221,0.81038105,0.0001668514,0.0001770658,0.00038958775,2.8637442e-7,0.0005659946,0.005325574],"genre_scores_gemma":[0.8322757,0.00001262867,0.1672126,0.00008430073,0.000032324122,0.000058835984,0.00000567628,0.000011380542,0.00030656857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820685,0.00023387998,0.0003799798,0.00057968416,0.00046423537,0.00013537875],"domain_scores_gemma":[0.9984537,0.00008122122,0.00023748168,0.00096731173,0.00021569018,0.000044622142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050095667,0.00018076022,0.0003498515,0.00017666457,0.000051326308,0.00020413283,0.0011807445,0.00016130904,0.00002647823],"category_scores_gemma":[0.00003848295,0.00017075922,0.000100029276,0.00026268445,0.000021265827,0.0001783311,0.0036235545,0.00075399154,0.0000036941242],"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.000025516647,0.010951967,0.05640014,0.0005381981,0.0014509477,0.00093460514,0.1990848,0.046617948,0.0012828807,0.0654181,0.002458408,0.6148365],"study_design_scores_gemma":[0.0018707557,0.0037148262,0.07397834,0.0007239913,0.00013241319,0.00008001361,0.015120571,0.84366846,0.023265447,0.033470977,0.0012685856,0.0027055999],"about_ca_topic_score_codex":0.00036114416,"about_ca_topic_score_gemma":0.00012845133,"teacher_disagreement_score":0.79705054,"about_ca_system_score_codex":0.000024346851,"about_ca_system_score_gemma":0.0001798174,"threshold_uncertainty_score":0.69633585},"labels":[],"label_agreement":null},{"id":"W4247533534","doi":"10.1109/dac.2005.193932","title":"A non-parametric approach for dynamic range estimation of nonlinear systems","year":2005,"lang":"en","type":"article","venue":"Proceedings. 42nd Design Automation Conference, 2005.","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Datapath; Nonlinear system; Algorithm; Gaussian; Dynamic range; Parametric statistics; Range (aeronautics); Orthonormal basis; High dynamic range; Independent component analysis; Gaussian process; Mathematical optimization; Mathematics; Artificial intelligence; Statistics","score_opus":0.03145764093773942,"score_gpt":0.28030365232303706,"score_spread":0.24884601138529763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247533534","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.0026424327,0.00008551947,0.9902028,0.00023535136,0.00007941841,0.002079693,0.000008990046,0.0008249484,0.0038408905],"genre_scores_gemma":[0.48307732,0.000012985068,0.5162191,0.000051214127,0.000031588694,0.0003284755,0.00001890301,0.000014125061,0.0002463111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977861,0.00003906914,0.000768864,0.0005186177,0.0005292325,0.00035811667],"domain_scores_gemma":[0.9979907,0.00012107159,0.0006680954,0.00026816703,0.0008382338,0.000113714916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015166104,0.0002706688,0.0004110138,0.0008084688,0.00013482089,0.00050826377,0.0007347475,0.00021656347,0.000008120855],"category_scores_gemma":[0.00019071996,0.00026409404,0.00009677424,0.00095922744,0.00006017622,0.0017572377,0.0000686545,0.00015512198,0.000024835486],"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.00019288994,0.0018337282,0.00026336612,0.0021667902,0.00022543149,8.7818256e-7,0.009322869,0.18881847,0.010636789,0.5559953,0.016892996,0.21365054],"study_design_scores_gemma":[0.00059984607,0.00016131111,0.0001918443,0.000064169864,0.00002056213,0.0000119112665,0.000062594125,0.99067086,0.0060460004,0.0011532122,0.000740113,0.00027755342],"about_ca_topic_score_codex":0.0000075438647,"about_ca_topic_score_gemma":6.148862e-7,"teacher_disagreement_score":0.8018524,"about_ca_system_score_codex":0.00014360073,"about_ca_system_score_gemma":0.00027032688,"threshold_uncertainty_score":0.9999811},"labels":[],"label_agreement":null},{"id":"W4247822328","doi":"10.32920/ryerson.14665632.v1","title":"Under-Determined Blind Source Separation","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Initialization; Blind signal separation; Cluster analysis; Matching pursuit; Matching (statistics); Algorithm; Computer science; Set (abstract data type); Matrix (chemical analysis); Mixing (physics); Segmentation; Pattern recognition (psychology); Source separation; Mathematics; Artificial intelligence; Statistics; Compressed sensing; Channel (broadcasting)","score_opus":0.044470157722945096,"score_gpt":0.33161054142261076,"score_spread":0.28714038369966566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247822328","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.01858159,0.0000907854,0.9609914,0.002952434,0.0004180407,0.00039249685,0.0000011357226,0.0015448696,0.015027267],"genre_scores_gemma":[0.67814416,0.000045564106,0.31004748,0.0032234325,0.00013714508,0.00010993795,0.00009314719,0.000030284209,0.008168863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770296,0.00024528286,0.00045222943,0.0008940688,0.00045571412,0.00024977548],"domain_scores_gemma":[0.9976975,0.000091719994,0.00025471626,0.0015930581,0.00025517403,0.00010786217],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004825884,0.00030996595,0.00033809638,0.00023612812,0.000093487186,0.0014915465,0.0013286393,0.00045180426,0.0000898485],"category_scores_gemma":[0.000039022896,0.00031514277,0.00019451401,0.00029319082,0.000034051922,0.0005113451,0.0021487537,0.0006172845,0.00006345758],"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.0000782906,0.0015331496,0.00037342875,0.0005549821,0.0006378087,0.00016302378,0.028001286,0.08781236,0.014270252,0.6114627,0.05734613,0.1977666],"study_design_scores_gemma":[0.0011593346,0.00019299214,0.00088967266,0.0002693716,0.000054248012,0.00008737531,0.00034406682,0.8045951,0.102081396,0.06328125,0.024782307,0.0022628948],"about_ca_topic_score_codex":0.00007047503,"about_ca_topic_score_gemma":0.000085363725,"teacher_disagreement_score":0.71678275,"about_ca_system_score_codex":0.00008732428,"about_ca_system_score_gemma":0.00046977584,"threshold_uncertainty_score":0.9999301},"labels":[],"label_agreement":null},{"id":"W4248534906","doi":"10.4018/9781605669021.ch019","title":"Robust Independent Component Analysis for Cognitive Informatics","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"FastICA; Infomax; Independent component analysis; Outlier; Sensitivity (control systems); Pattern recognition (psychology); Negentropy; Mathematics; Artificial intelligence; Divergence (linguistics); Computer science; Contrast (vision); Algorithm; Blind signal separation; Engineering","score_opus":0.05146461021903113,"score_gpt":0.2651893708031613,"score_spread":0.21372476058413017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248534906","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.000014858711,0.000026654168,0.5113908,0.00001505904,0.00008450327,0.00047171948,0.00011829427,0.0002524189,0.48762572],"genre_scores_gemma":[0.6017283,0.000026573498,0.2842251,0.006578509,0.00032193953,0.00044010812,0.00023855997,0.00013615146,0.10630475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998009,0.000026033951,0.0007128038,0.00040901877,0.0005314452,0.00031166367],"domain_scores_gemma":[0.9979796,0.00007982673,0.0006369957,0.0006744462,0.0004603185,0.00016885217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003370499,0.00042841403,0.0006206943,0.00032334367,0.00011819595,0.0002609498,0.0010185912,0.00045802354,0.000020102294],"category_scores_gemma":[0.000015894379,0.00042834645,0.0005266085,0.00006898636,0.000081635044,0.00019240307,0.00046117383,0.00029006499,0.00008835062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015483567,0.000014344342,0.000013629515,0.000020150852,0.00064962765,0.0000050370695,0.00063138397,0.000038296865,3.679934e-7,0.9938473,0.00053488236,0.0042294567],"study_design_scores_gemma":[0.00091610645,0.0004171735,0.00020888707,0.00021679064,0.0013762916,0.00003326033,0.00005514067,0.009307265,0.00033161073,0.9617186,0.023977872,0.0014409813],"about_ca_topic_score_codex":0.000044588356,"about_ca_topic_score_gemma":0.00011972873,"teacher_disagreement_score":0.6017134,"about_ca_system_score_codex":0.0002059784,"about_ca_system_score_gemma":0.00023291988,"threshold_uncertainty_score":0.99981683},"labels":[],"label_agreement":null},{"id":"W4249596020","doi":"10.32920/ryerson.14663148","title":"Object extraction in video sequences based on spatiotemporal independent component analysis","year":2021,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Video tracking; Segmentation; Video processing; Motion compensation; Pattern recognition (psychology); Video post-processing; Object (grammar); Independent component analysis; Block-matching algorithm; Wavelet; Video compression picture types","score_opus":0.03063036966420425,"score_gpt":0.31330885266889136,"score_spread":0.2826784830046871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249596020","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.08474671,0.00003332213,0.9082973,0.0017250163,0.00028036657,0.00039202214,0.0000038042326,0.00045688913,0.004064569],"genre_scores_gemma":[0.89931846,0.000019233636,0.0994157,0.00087759394,0.000025837304,0.00009617042,0.00014608781,0.000009767407,0.00009114769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652064,0.00063716836,0.00063855253,0.0010723238,0.00090016867,0.00023117375],"domain_scores_gemma":[0.99790484,0.00018304544,0.00039131762,0.0012695909,0.00016651925,0.000084677034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012688559,0.00031302124,0.0005260266,0.0014834963,0.00005755584,0.0007671662,0.00095261395,0.00037661006,0.00013741635],"category_scores_gemma":[0.000048101396,0.00030610996,0.0003356478,0.0012789839,0.00002897213,0.00039247223,0.0005309121,0.00092493964,0.000011652102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003912429,0.0011623384,0.03373864,0.00010955942,0.00043303566,0.00027374085,0.0023360888,0.94074965,0.0010477701,0.008205203,0.00035214183,0.011552716],"study_design_scores_gemma":[0.00017687675,0.00006339346,0.07001216,0.000096519354,0.000050798702,0.000002004355,0.000068877525,0.91282135,0.014822767,0.001361168,0.000094831674,0.0004292366],"about_ca_topic_score_codex":0.003977369,"about_ca_topic_score_gemma":0.0043627964,"teacher_disagreement_score":0.81457174,"about_ca_system_score_codex":0.00038200643,"about_ca_system_score_gemma":0.000539192,"threshold_uncertainty_score":0.9999391},"labels":[],"label_agreement":null},{"id":"W4250391742","doi":"10.1090/fic/026/06","title":"Towards a more general Propp-Wilson algorithm: Multistage backward coupling","year":2000,"lang":"en","type":"other","venue":"","topic":"Blind Source Separation 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":"York University","funders":"","keywords":"Coupling (piping); Algorithm; Computer science; Mechanical engineering; Engineering","score_opus":0.014820778318790235,"score_gpt":0.2819434861226769,"score_spread":0.26712270780388664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250391742","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.0000045341217,0.00018891007,0.5840029,0.0002642705,0.00014894216,0.00040432106,0.000020674172,0.0022997793,0.41266567],"genre_scores_gemma":[0.000015484655,0.00013054661,0.50240564,0.0006892325,0.00023266171,0.000052482344,0.00003516237,0.00018039136,0.4962584],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793524,0.00004246733,0.00031694848,0.0007860859,0.00053032674,0.00038893725],"domain_scores_gemma":[0.99862975,0.00001261587,0.00017721106,0.0010019084,0.000038287915,0.00014023238],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018203864,0.00042254638,0.00041365964,0.00037016213,0.000060129496,0.0003305372,0.0012586954,0.00046382193,0.0015097929],"category_scores_gemma":[0.0000055445507,0.0003698018,0.00014335214,0.00031701016,0.00006577093,0.00019942204,0.00023918357,0.0003616243,0.00027744382],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018799776,0.00008330068,0.000004059383,0.000036951613,0.00004856843,0.00003797502,0.00044996967,0.000051944706,0.000039455925,0.007805171,0.77295893,0.21848176],"study_design_scores_gemma":[0.00021031247,0.000048081612,0.000010999368,0.00007692024,0.0000075092585,0.000012532116,0.000007328734,0.2119672,0.0010206398,0.0001535416,0.7859751,0.00050985545],"about_ca_topic_score_codex":0.00077550916,"about_ca_topic_score_gemma":0.00007089264,"teacher_disagreement_score":0.2179719,"about_ca_system_score_codex":0.000052470645,"about_ca_system_score_gemma":0.00019831007,"threshold_uncertainty_score":0.99987537},"labels":[],"label_agreement":null},{"id":"W4251382989","doi":"10.32920/ryerson.14665632","title":"Under-Determined Blind Source Separation","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Initialization; Blind signal separation; Matching pursuit; Cluster analysis; Matching (statistics); Algorithm; Set (abstract data type); Computer science; Matrix (chemical analysis); Mixing (physics); Segmentation; Pattern recognition (psychology); Source separation; Mathematics; Mathematical optimization; Artificial intelligence; Statistics; Compressed sensing; Channel (broadcasting)","score_opus":0.044470157722945096,"score_gpt":0.33161054142261076,"score_spread":0.28714038369966566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251382989","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.01858159,0.0000907854,0.9609914,0.002952434,0.0004180407,0.00039249685,0.0000011357226,0.0015448696,0.015027267],"genre_scores_gemma":[0.67814416,0.000045564106,0.31004748,0.0032234325,0.00013714508,0.00010993795,0.00009314719,0.000030284209,0.008168863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770296,0.00024528286,0.00045222943,0.0008940688,0.00045571412,0.00024977548],"domain_scores_gemma":[0.9976975,0.000091719994,0.00025471626,0.0015930581,0.00025517403,0.00010786217],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004825884,0.00030996595,0.00033809638,0.00023612812,0.000093487186,0.0014915465,0.0013286393,0.00045180426,0.0000898485],"category_scores_gemma":[0.000039022896,0.00031514277,0.00019451401,0.00029319082,0.000034051922,0.0005113451,0.0021487537,0.0006172845,0.00006345758],"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.0000782906,0.0015331496,0.00037342875,0.0005549821,0.0006378087,0.00016302378,0.028001286,0.08781236,0.014270252,0.6114627,0.05734613,0.1977666],"study_design_scores_gemma":[0.0011593346,0.00019299214,0.00088967266,0.0002693716,0.000054248012,0.00008737531,0.00034406682,0.8045951,0.102081396,0.06328125,0.024782307,0.0022628948],"about_ca_topic_score_codex":0.00007047503,"about_ca_topic_score_gemma":0.000085363725,"teacher_disagreement_score":0.71678275,"about_ca_system_score_codex":0.00008732428,"about_ca_system_score_gemma":0.00046977584,"threshold_uncertainty_score":0.9999301},"labels":[],"label_agreement":null},{"id":"W4253079719","doi":"10.32920/ryerson.14648397.v1","title":"Online LTI system identification and time delay estimation","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Akaike information criterion; Bayesian information criterion; LTI system theory; Computer science; Model selection; Impulse response; System identification; Minimum description length; Selection (genetic algorithm); Identification (biology); Algorithm; Mathematical optimization; Control theory (sociology); Linear system; Data mining; Mathematics; Control (management); Artificial intelligence; Machine learning","score_opus":0.018398540994365623,"score_gpt":0.2803714906123301,"score_spread":0.26197294961796447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253079719","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.019734204,0.00012403226,0.97614413,0.00094027334,0.00017749933,0.00032137177,0.000006465852,0.0011612463,0.0013907605],"genre_scores_gemma":[0.5629363,0.000018809644,0.4355245,0.00014587936,0.000029596424,0.00003904486,0.00025063,0.00001019177,0.0010450364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854535,0.00015269427,0.0003903311,0.00055494125,0.00025605538,0.000100622434],"domain_scores_gemma":[0.99860317,0.000048499965,0.00024130513,0.00082806876,0.00022518655,0.00005375904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051374605,0.00015716485,0.00020459142,0.00015272357,0.00006225305,0.0009228431,0.0004962466,0.00021506914,0.000010203815],"category_scores_gemma":[0.000038560665,0.00015805557,0.0000493795,0.00015306869,0.000019235722,0.00041785248,0.0008759717,0.00023989264,0.000037488175],"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.000008554187,0.0007600853,0.00013533376,0.0020443252,0.00025117953,0.00007327976,0.0090429485,0.0213243,0.0105803665,0.6976669,0.009036876,0.2490759],"study_design_scores_gemma":[0.000048201095,0.000009261536,0.00071308186,0.0001321597,0.000010744837,0.000029455292,0.000038681046,0.9929638,0.0041908757,0.0015921576,0.000094729825,0.00017687489],"about_ca_topic_score_codex":0.000050978,"about_ca_topic_score_gemma":0.000009178455,"teacher_disagreement_score":0.97163945,"about_ca_system_score_codex":0.000080525286,"about_ca_system_score_gemma":0.00012216608,"threshold_uncertainty_score":0.88989973},"labels":[],"label_agreement":null},{"id":"W42537546","doi":"10.2352/cic.2004.12.1.art00017","title":"Analysis of Spatio-chromatic Decorrelation for Colour Image Reconstruction","year":2004,"lang":"en","type":"article","venue":"Color and Imaging Conference","topic":"Blind Source Separation 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":"Decorrelation; Chromatic scale; Computer science; Artificial intelligence; Computer vision; Encoding (memory); Basis (linear algebra); Discrete cosine transform; Data compression; Iterative reconstruction; Spatial analysis; Human visual system model; Image compression; Pattern recognition (psychology); Perception; Image (mathematics); Mathematics; Image processing","score_opus":0.013796081988299926,"score_gpt":0.27078879868578387,"score_spread":0.25699271669748397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W42537546","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.26599705,0.000010943721,0.7326381,0.0007006674,0.00004838851,0.00016147546,0.0000041936955,0.00007586214,0.00036329814],"genre_scores_gemma":[0.82146543,0.000007998472,0.17838815,0.000084622465,0.000004056012,0.000023459259,0.000010339582,0.0000025607387,0.0000133583735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993722,0.000029434183,0.00021952445,0.00020199991,0.000083135885,0.00009370869],"domain_scores_gemma":[0.9992914,0.00008826425,0.0001635593,0.00017984911,0.00024412991,0.000032799926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023875156,0.00007334349,0.00016994971,0.0002564096,0.00007613236,0.000121126664,0.00015755926,0.000024592217,0.000007797437],"category_scores_gemma":[0.00008842568,0.00007431754,0.000051652805,0.00040105777,0.00007381619,0.00058993715,0.000039645638,0.00004448042,0.0000013806426],"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.00004525108,0.00018433575,0.03582701,0.00014429523,0.00038810095,0.0000027723256,0.008941549,0.0017946347,0.04655029,0.62762785,0.00023332439,0.2782606],"study_design_scores_gemma":[0.0004180284,0.00008342582,0.049965028,0.000033142103,0.0001415123,0.000009416234,0.00009070717,0.9173613,0.007955172,0.023709586,0.000088017165,0.0001446563],"about_ca_topic_score_codex":0.00003311454,"about_ca_topic_score_gemma":0.000043867338,"teacher_disagreement_score":0.9155667,"about_ca_system_score_codex":0.000029688004,"about_ca_system_score_gemma":0.00009338406,"threshold_uncertainty_score":0.30305812},"labels":[],"label_agreement":null},{"id":"W4254934518","doi":"10.32920/ryerson.14663148.v1","title":"Object extraction in video sequences based on spatiotemporal independent component analysis","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Artificial intelligence; Computer science; Computer vision; Video tracking; Segmentation; Pattern recognition (psychology); Video processing; Independent component analysis; Motion compensation; Video post-processing; Object (grammar); Block-matching algorithm; Wavelet; Video compression picture types","score_opus":0.03063036966420425,"score_gpt":0.31330885266889136,"score_spread":0.2826784830046871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254934518","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.08474671,0.00003332213,0.9082973,0.0017250163,0.00028036657,0.00039202214,0.0000038042326,0.00045688913,0.004064569],"genre_scores_gemma":[0.89931846,0.000019233636,0.0994157,0.00087759394,0.000025837304,0.00009617042,0.00014608781,0.000009767407,0.00009114769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652064,0.00063716836,0.00063855253,0.0010723238,0.00090016867,0.00023117375],"domain_scores_gemma":[0.99790484,0.00018304544,0.00039131762,0.0012695909,0.00016651925,0.000084677034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012688559,0.00031302124,0.0005260266,0.0014834963,0.00005755584,0.0007671662,0.00095261395,0.00037661006,0.00013741635],"category_scores_gemma":[0.000048101396,0.00030610996,0.0003356478,0.0012789839,0.00002897213,0.00039247223,0.0005309121,0.00092493964,0.000011652102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003912429,0.0011623384,0.03373864,0.00010955942,0.00043303566,0.00027374085,0.0023360888,0.94074965,0.0010477701,0.008205203,0.00035214183,0.011552716],"study_design_scores_gemma":[0.00017687675,0.00006339346,0.07001216,0.000096519354,0.000050798702,0.000002004355,0.000068877525,0.91282135,0.014822767,0.001361168,0.000094831674,0.0004292366],"about_ca_topic_score_codex":0.003977369,"about_ca_topic_score_gemma":0.0043627964,"teacher_disagreement_score":0.81457174,"about_ca_system_score_codex":0.00038200643,"about_ca_system_score_gemma":0.000539192,"threshold_uncertainty_score":0.9999391},"labels":[],"label_agreement":null},{"id":"W4256294459","doi":"10.1504/ijma.2011.045253","title":"Signal classification via multi-scale PCA and empirical classification methods","year":2011,"lang":"en","type":"article","venue":"International Journal of Mechatronics and Automation","topic":"Blind Source Separation 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":"Toronto Metropolitan University","funders":"","keywords":"Pattern recognition (psychology); Principal component analysis; Artificial intelligence; Computer science; SIGNAL (programming language); Feature (linguistics); Wavelet; Noise (video); Scale (ratio); Feature extraction; Discrete wavelet transform; Wavelet transform","score_opus":0.10175402586908504,"score_gpt":0.3866935357929788,"score_spread":0.2849395099238938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256294459","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.03614405,0.00014465785,0.96094036,0.0021561412,0.00025597384,0.00008880169,0.0000015032387,0.00006910577,0.00019940143],"genre_scores_gemma":[0.5389395,0.00012001555,0.46071437,0.00016501962,0.000036930407,0.0000038928674,0.0000029105288,0.0000049201667,0.00001248054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986178,0.00021380169,0.0005140466,0.0001908188,0.00036257406,0.00010090685],"domain_scores_gemma":[0.99860716,0.00008373997,0.0005892687,0.00013559371,0.0005032911,0.00008094514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001357419,0.00010855028,0.00014246737,0.00029525877,0.00006453098,0.00016559832,0.00041894853,0.00010185351,0.000013273451],"category_scores_gemma":[0.000047906877,0.0000971624,0.000057473677,0.000113767106,0.000042089112,0.0010943961,0.00009362575,0.0001914749,0.0000032347912],"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.00004275786,0.00029661678,0.0022755275,0.00001076609,0.00009898385,0.000004245233,0.0053953994,0.000020946563,0.055483315,0.17062345,0.00020704529,0.76554096],"study_design_scores_gemma":[0.00061955105,0.00024063057,0.058466993,0.000036839196,0.000018617327,0.00017732222,0.00017981447,0.8913118,0.0152489785,0.031904817,0.0016327279,0.00016191369],"about_ca_topic_score_codex":0.000006905188,"about_ca_topic_score_gemma":0.0000030257552,"teacher_disagreement_score":0.89129084,"about_ca_system_score_codex":0.0000800151,"about_ca_system_score_gemma":0.00009008875,"threshold_uncertainty_score":0.39621678},"labels":[],"label_agreement":null},{"id":"W4281629283","doi":"10.21203/rs.3.rs-1694395/v1","title":"Extensive Study of Multiple Deep Neural Networks for Complex Random Telegraph Signals","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Blind Source Separation Techniques","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":"Perimeter Institute; University of Waterloo","funders":"Canada First Research Excellence Fund; Industry Canada","keywords":"Artificial neural network; Deep neural networks; Telegraphy; Computer science; Artificial intelligence; Telecommunications","score_opus":0.13249849205881956,"score_gpt":0.42340245637330515,"score_spread":0.2909039643144856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281629283","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.0589215,0.00052844745,0.93021774,0.00043393997,0.00023855983,0.00907342,0.00006246465,0.00036102737,0.00016289712],"genre_scores_gemma":[0.9808749,0.000043177122,0.015592361,0.000088389635,0.00012350218,0.003055561,0.00012293803,0.000042521326,0.000056632667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930208,0.002776632,0.0007103606,0.0010758688,0.0017200178,0.0006963263],"domain_scores_gemma":[0.99226624,0.0034647253,0.00033890438,0.0017710297,0.0019920426,0.00016705804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0045998497,0.0003140371,0.0007467975,0.0008900527,0.00050549256,0.00035798468,0.0028699648,0.00020973636,0.00008072645],"category_scores_gemma":[0.0007899441,0.00030374422,0.00035164485,0.0010351117,0.00014326195,0.0001875039,0.004672827,0.0017864492,0.0000015255621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018896511,0.0038168172,0.0056844032,0.0008833434,0.0005110632,0.0001091321,0.024336565,0.9102106,0.00066793704,0.0053966134,0.013842118,0.032651734],"study_design_scores_gemma":[0.0022955593,0.0016385926,0.004515115,0.000049579823,0.000011312009,0.0000023663056,0.0019730856,0.9843746,0.00013575703,0.0037062124,0.0009979437,0.00029990645],"about_ca_topic_score_codex":0.00032000162,"about_ca_topic_score_gemma":0.00017962258,"teacher_disagreement_score":0.92195344,"about_ca_system_score_codex":0.000119454926,"about_ca_system_score_gemma":0.00018093221,"threshold_uncertainty_score":0.99994147},"labels":[],"label_agreement":null},{"id":"W4281834131","doi":"10.1111/jtsa.12659","title":"Dynamic deconvolution and identification of independent autoregressive sources","year":2022,"lang":"en","type":"article","venue":"Journal of Time Series Analysis","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":"York University; University of Toronto","funders":"","keywords":"Autoregressive model; Deconvolution; Estimator; Mathematics; Identification (biology); Scalar (mathematics); Applied mathematics; Constructive; Series (stratigraphy); Algorithm; Econometrics; Statistics; Computer science","score_opus":0.0038287949625115418,"score_gpt":0.2321309065273458,"score_spread":0.22830211156483426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281834131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5619016,0.00053902745,0.43617222,0.0011867727,0.00005701694,0.00005578408,0.000006859753,0.000027096323,0.000053588916],"genre_scores_gemma":[0.9899799,0.00006348806,0.009358754,0.000033411314,0.000006709795,0.000002784306,0.0000033925685,0.0000034311659,0.0005481077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986551,0.0001852101,0.000535956,0.00012172177,0.00042978863,0.00007223186],"domain_scores_gemma":[0.9982755,0.000038508053,0.0012134928,0.00020926919,0.00022463908,0.000038589616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009851339,0.00006634491,0.00024719234,0.0006565388,0.00013735499,0.00008606699,0.0004152005,0.000025115312,0.00007609219],"category_scores_gemma":[0.000036192494,0.00006141919,0.000168329,0.00069048983,0.000043357606,0.000667447,0.00018930754,0.00013582286,0.0000010163293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006581103,0.001537115,0.077326946,0.00016562015,0.015356973,0.00015960411,0.06359267,0.473466,0.2468154,0.044516243,0.004194845,0.07221047],"study_design_scores_gemma":[0.00067451294,0.0011197119,0.15440771,0.00002349575,0.0016986722,0.00038799987,0.0025834877,0.796171,0.025911612,0.013926232,0.0026259841,0.00046955716],"about_ca_topic_score_codex":0.000015263442,"about_ca_topic_score_gemma":0.000011001264,"teacher_disagreement_score":0.4280783,"about_ca_system_score_codex":0.00007282121,"about_ca_system_score_gemma":0.00006284042,"threshold_uncertainty_score":0.25046018},"labels":[],"label_agreement":null},{"id":"W4283370965","doi":"10.1080/10618600.2022.2069780","title":"Analytic Permutation Testing for Functional Data ANOVA","year":2022,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"Sheridan College; Lakehead University; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Permutation (music); Resampling; Univariate; Nonparametric statistics; Statistical hypothesis testing; Mathematics; Omnibus test; Multiple comparisons problem; Sample size determination; Algorithm; Parametric statistics; Computer science; Multivariate statistics; Statistics","score_opus":0.07933935138083462,"score_gpt":0.3144627546212596,"score_spread":0.235123403240425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283370965","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.0049064187,0.00006642214,0.99301606,0.0015170749,0.00014331526,0.00008643379,0.00021266914,0.000022482673,0.000029108653],"genre_scores_gemma":[0.44560575,0.0000022579366,0.55363035,0.0005766546,0.000054085027,0.000003846793,0.00011024,0.000004302761,0.000012490286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986665,0.00010222447,0.00042331236,0.00017121177,0.000539361,0.00009735694],"domain_scores_gemma":[0.9974571,0.0014370861,0.00035440485,0.0001173788,0.00056237937,0.00007165818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094616885,0.000076030396,0.00014232601,0.00021723931,0.00030714882,0.00011574898,0.00039319685,0.000019450215,0.0000103459315],"category_scores_gemma":[0.00036918465,0.00007174582,0.000032476226,0.0004214243,0.0000471975,0.00035615504,0.00021830111,0.00021376634,2.5727678e-7],"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.000056519588,0.00016160362,0.0017140141,0.000022042908,0.00006941507,0.000018237648,0.0001722067,0.0754923,0.000053019503,0.87676984,0.011182131,0.03428869],"study_design_scores_gemma":[0.00032330718,0.0003555995,0.019715374,0.000003592681,0.000015706144,0.0002097465,0.000016887003,0.55922115,0.0000020328027,0.4179466,0.0021221482,0.00006786256],"about_ca_topic_score_codex":0.0000023111936,"about_ca_topic_score_gemma":9.40562e-7,"teacher_disagreement_score":0.48372883,"about_ca_system_score_codex":0.00002432042,"about_ca_system_score_gemma":0.00020982006,"threshold_uncertainty_score":0.29257095},"labels":[],"label_agreement":null},{"id":"W4286461694","doi":"10.1017/s1431927622011710","title":"Comparison Between Deep Learning and Iterative Bayesian Statistics Deconvolution Methods in Energy Electron Loss Spectroscopy","year":2022,"lang":"en","type":"article","venue":"Microscopy and Microanalysis","topic":"Blind Source Separation 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":"Canadian Light Source (Canada); McMaster University","funders":"","keywords":"Deconvolution; Bayesian probability; Spectroscopy; Energy (signal processing); Electron; Bayesian statistics; Statistical physics; Statistics; Computer science; Computational physics; Physics; Bayesian inference; Materials science; Artificial intelligence; Algorithm; Mathematics; Nuclear physics; Astronomy","score_opus":0.011726688650087214,"score_gpt":0.35429149146733246,"score_spread":0.3425648028172453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286461694","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.047712844,0.0022288233,0.94960004,0.00018458099,0.000022670858,0.00008547251,0.000011787281,0.000077188226,0.000076574186],"genre_scores_gemma":[0.5368231,0.00022620554,0.46257254,0.00014365524,0.000011497966,0.000024460178,0.00005571272,0.000010476541,0.00013234494],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974732,0.0010848079,0.0004270068,0.00054583553,0.00014528351,0.000323911],"domain_scores_gemma":[0.999227,0.00023031607,0.00021863102,0.0002000501,0.00004573934,0.00007829887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009622472,0.00019799534,0.00044026753,0.00046831724,0.00045709254,0.00024918225,0.0002679041,0.00006307844,0.000036010115],"category_scores_gemma":[0.000023761919,0.00022449998,0.000049134058,0.00076752534,0.000068554225,0.00024098919,0.00032294108,0.00043559523,8.8813516e-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.000072548755,0.00022537082,0.19992906,0.00003741723,0.00031760204,0.000022209579,0.012594991,0.0010962089,0.68786746,0.02582913,0.0005540183,0.07145399],"study_design_scores_gemma":[0.0007494997,0.0006388661,0.0075762467,0.000015018683,0.0001568702,0.00003158201,0.0006003061,0.20730743,0.7517011,0.010563601,0.019959033,0.0007004109],"about_ca_topic_score_codex":0.00023529459,"about_ca_topic_score_gemma":0.00022108285,"teacher_disagreement_score":0.48911026,"about_ca_system_score_codex":0.00016621615,"about_ca_system_score_gemma":0.000048470858,"threshold_uncertainty_score":0.91548437},"labels":[],"label_agreement":null},{"id":"W4291669456","doi":"","title":"Fast Central Catadioptric Line Extraction","year":2007,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Blind Source Separation 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":"Kootenay Association for Science & Technology","funders":"","keywords":"Catadioptric system; Extraction (chemistry); Computer science; Line (geometry); Chromatography; Chemistry; Mathematics; Optics; Physics","score_opus":0.018256171465508772,"score_gpt":0.26427652325248546,"score_spread":0.24602035178697668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291669456","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.00881114,0.0007129443,0.93266374,0.009254832,0.00047398524,0.0005457996,0.000023827331,0.0013047453,0.046208996],"genre_scores_gemma":[0.54817826,0.0007539222,0.44186845,0.00044849445,0.00008100745,0.00007910412,0.00041802783,0.00006060726,0.008112141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99269044,0.0038681866,0.0008198515,0.0012157549,0.0007729543,0.00063279516],"domain_scores_gemma":[0.9921493,0.0010641495,0.0008094602,0.0034495855,0.0022007213,0.0003267939],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0077131665,0.00046540875,0.00043542095,0.0006131615,0.00034757037,0.0011124809,0.003019424,0.000564015,0.000063565996],"category_scores_gemma":[0.00088588573,0.0005236144,0.00028875278,0.0009239545,0.00016362024,0.0005970736,0.0021837319,0.00139423,0.00007859032],"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.000018380535,0.0015327454,0.0008630729,0.00021672717,0.00012645638,0.00003710461,0.02195078,0.00091609056,0.0037979083,0.610673,0.005409701,0.354458],"study_design_scores_gemma":[0.0014918444,0.0000033418899,0.015382808,0.0028666218,0.00011128697,0.0001647085,0.0001763394,0.32572007,0.5019375,0.040367506,0.10892235,0.0028556057],"about_ca_topic_score_codex":0.0010273053,"about_ca_topic_score_gemma":0.00090819836,"teacher_disagreement_score":0.5703055,"about_ca_system_score_codex":0.00029220033,"about_ca_system_score_gemma":0.0005450894,"threshold_uncertainty_score":0.9999245},"labels":[],"label_agreement":null},{"id":"W4291717789","doi":"10.1190/image2022-3744488.1","title":"Interpolated fast and computational-efficient multidimensional singular spectrum analysis (I-FMSSA) for compressive simultaneous-source data processing","year":2022,"lang":"en","type":"article","venue":"Second International Meeting for Applied Geoscience &amp; Energy","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":"University of Alberta","funders":"","keywords":"Interpolation (computer graphics); Computer science; Algorithm; Grid; Projection (relational algebra); Compressed sensing; Mathematics; Artificial intelligence; Geometry; Image (mathematics)","score_opus":0.02050509535983291,"score_gpt":0.28172349281984344,"score_spread":0.2612183974600105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291717789","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.03150236,0.00008206101,0.9659401,0.00079184317,0.00026103022,0.0004011282,0.00034176733,0.00024004845,0.00043965748],"genre_scores_gemma":[0.65597266,0.000001285679,0.34117302,0.00093677297,0.000052418534,0.00017411317,0.0010232866,0.000019734161,0.00064667035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967978,0.00008312879,0.00058942166,0.0012703611,0.0008356598,0.0004236372],"domain_scores_gemma":[0.9975115,0.0009075209,0.00055316836,0.00056878163,0.00033091026,0.00012810128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012242739,0.00027398483,0.00032324556,0.00065655005,0.0010696809,0.00043168053,0.0019706504,0.00006194875,0.00005867327],"category_scores_gemma":[0.00022656497,0.00029473176,0.00011542946,0.0009111575,0.0001791502,0.0003434655,0.0017273276,0.00019153922,0.0000013728524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007975837,0.00019225148,0.00003178579,0.000015514372,0.00014094554,0.0000010521436,0.0013189322,0.90089804,0.007887957,0.07259779,0.0003441848,0.0164918],"study_design_scores_gemma":[0.00046790263,0.000051044724,0.00004267338,0.000015408341,0.000036218098,0.000018879631,0.00011479199,0.9075039,0.0009895259,0.005582999,0.08486627,0.00031035772],"about_ca_topic_score_codex":0.00007947776,"about_ca_topic_score_gemma":0.00015128835,"teacher_disagreement_score":0.62476707,"about_ca_system_score_codex":0.00016578312,"about_ca_system_score_gemma":0.00017395237,"threshold_uncertainty_score":0.99995047},"labels":[],"label_agreement":null},{"id":"W4291909999","doi":"10.1109/ecai54874.2022.9847423","title":"An RLS Algorithm for the Identification of Impulse Responses with Particular Symmetric Properties","year":2022,"lang":"en","type":"article","venue":"2022 14th International Conference on Electronics, Computers and Artificial Intelligence (ECAI)","topic":"Blind Source Separation 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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Antisymmetric relation; Recursive least squares filter; Impulse (physics); Computer science; Bilinear interpolation; Algorithm; Identification (biology); Infinite impulse response; System identification; Impulse response; Measure (data warehouse); Mathematics; Adaptive filter; Digital filter; Filter (signal processing); Data mining","score_opus":0.055391988789302835,"score_gpt":0.31014372836691734,"score_spread":0.2547517395776145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291909999","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.01494132,0.00023850208,0.9793193,0.0043295757,0.00040414947,0.00058270636,0.000035092315,0.000099610705,0.000049789316],"genre_scores_gemma":[0.9866775,0.00017182548,0.012180429,0.00045656261,0.00006789189,0.00029365582,0.000022607292,0.000014506887,0.00011498425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777895,0.00024623304,0.000565455,0.00052281027,0.00060825393,0.0002783128],"domain_scores_gemma":[0.9984217,0.00025040063,0.00035388328,0.0004621949,0.00045086132,0.000060913004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013151581,0.00018432114,0.00019211746,0.0003228242,0.0004571013,0.00043264113,0.0013182171,0.000036645084,0.00002958277],"category_scores_gemma":[0.00006142798,0.00014299409,0.000071171446,0.0004766372,0.00015542028,0.00041741208,0.00020458006,0.00029480315,0.0000022240065],"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.0001299659,0.00020424587,0.000008927363,0.0000042524657,0.000055955574,0.0000017400689,0.0009918887,0.0046230573,0.004993522,0.6686827,0.00006209636,0.32024166],"study_design_scores_gemma":[0.00006110907,0.001368086,0.000038365222,0.000012316119,0.000011860186,0.000013738953,0.0005374608,0.89206475,0.079724595,0.024646517,0.0013421958,0.00017901184],"about_ca_topic_score_codex":0.000045104913,"about_ca_topic_score_gemma":0.000018913168,"teacher_disagreement_score":0.9717362,"about_ca_system_score_codex":0.00010369239,"about_ca_system_score_gemma":0.00027076632,"threshold_uncertainty_score":0.58311296},"labels":[],"label_agreement":null},{"id":"W4293052826","doi":"10.1080/0952813x.2022.2080868","title":"Blind separation of speech from aortic regurgitation signals using Dhoulath’s method","year":2022,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","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":"Brampton Civic Hospital","funders":"","keywords":"Computer science; Separation (statistics); Speech recognition; Regurgitation (circulation); Blind signal separation; Telecommunications; Cardiology; Medicine; Machine learning","score_opus":0.07129861354360725,"score_gpt":0.4128806467085715,"score_spread":0.34158203316496427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293052826","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.3153467,0.00012702055,0.6836004,0.00029996075,0.00023720325,0.00013843566,0.0000035807846,0.000023023427,0.00022368353],"genre_scores_gemma":[0.75916237,0.0000034351756,0.24056834,0.0001562534,0.00008814182,0.0000053879276,0.0000018999317,0.000010178892,0.0000039897955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99663967,0.0007569363,0.0011895408,0.00026263238,0.00096289726,0.00018830568],"domain_scores_gemma":[0.9980628,0.00046320393,0.0007693439,0.00029458862,0.0003020825,0.00010800628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020195418,0.00015576933,0.00033299235,0.00025606423,0.00016680874,0.00012653392,0.00076806423,0.00006753154,0.0006606543],"category_scores_gemma":[0.00016215615,0.00014818035,0.00020045303,0.0005212975,0.00020980815,0.00058511156,0.00027482412,0.00037114657,0.000006661926],"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.00018534574,0.00024158222,0.0000041596454,0.0000012674888,0.000020402977,0.00001059288,0.0030048448,0.0050358046,0.4657572,0.5161311,0.0000111074205,0.009596617],"study_design_scores_gemma":[0.00004119346,0.00041788598,0.000002507259,0.000012309818,0.000011395738,0.00003372062,0.0009257588,0.17805968,0.5599029,0.26048893,0.000018940216,0.00008481351],"about_ca_topic_score_codex":0.00002821628,"about_ca_topic_score_gemma":5.377159e-7,"teacher_disagreement_score":0.44381568,"about_ca_system_score_codex":0.00015929736,"about_ca_system_score_gemma":0.00015046386,"threshold_uncertainty_score":0.7233701},"labels":[],"label_agreement":null},{"id":"W4299365572","doi":"","title":"Cross Recurrence Plot Analysis Based Method For TDOA Estimation Of Underwater Acoustic Signals","year":2015,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Blind Source Separation 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":"Université du Québec à Rimouski","funders":"","keywords":"Multilateration; Underwater; Recurrence plot; Computer science; Plot (graphics); Acoustics; Speech recognition; Statistics; Mathematics; Geology; Physics","score_opus":0.03607110160052883,"score_gpt":0.31839213942253936,"score_spread":0.2823210378220105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299365572","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.0054501574,0.0000666659,0.9882284,0.0031261372,0.000043360233,0.0003434839,0.000017336413,0.00027210306,0.0024523572],"genre_scores_gemma":[0.47372746,0.0000032431842,0.5255377,0.00009601811,0.0000023337416,0.000044358327,0.000059747003,0.000008320323,0.0005208031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953008,0.0030554007,0.0005000057,0.0004852722,0.00042949693,0.00022899537],"domain_scores_gemma":[0.99305993,0.002174083,0.00043128533,0.0013289301,0.0028571892,0.00014855918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009875859,0.00016517345,0.0002956507,0.00036964868,0.00015219288,0.00035527727,0.0011666289,0.00010711846,0.000021009373],"category_scores_gemma":[0.0018789378,0.00016485316,0.0001810429,0.0013183883,0.000111432906,0.00048309006,0.00022141809,0.00012429775,0.000007689605],"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.00007986504,0.0018404956,0.003346926,0.00026248718,0.00048084997,0.000002573725,0.032037653,0.26011753,0.023476116,0.5112555,0.0019568102,0.16514316],"study_design_scores_gemma":[0.00031181704,0.000001520372,0.0003909706,0.00007537495,0.00004964758,8.7065956e-7,0.0000180276,0.77551836,0.21559311,0.007291358,0.0006089754,0.00013994629],"about_ca_topic_score_codex":0.00022546288,"about_ca_topic_score_gemma":0.0002281098,"teacher_disagreement_score":0.5154008,"about_ca_system_score_codex":0.00006962566,"about_ca_system_score_gemma":0.0002757388,"threshold_uncertainty_score":0.67225164},"labels":[],"label_agreement":null},{"id":"W4299406343","doi":"10.1002/9781118445112.stat02354","title":"Spectral Decomposition","year":2014,"lang":"en","type":"other","venue":"Wiley StatsRef: Statistics Reference Online","topic":"Blind Source Separation Techniques","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; American Institute of Mathematics; National Science Foundation","keywords":"Encyclopedia; Computer science; Citation; Information retrieval; Decomposition; Library science","score_opus":0.025023430054418743,"score_gpt":0.3252101491350854,"score_spread":0.30018671908066663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299406343","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.000003872124,0.0002144809,0.8816723,0.0002509094,0.00032826007,0.00034382264,0.0031940793,0.0014527885,0.11253944],"genre_scores_gemma":[0.00033942543,0.0010292243,0.8795085,0.000834464,0.00029865716,0.000030563133,0.0039793714,0.00032208595,0.11365774],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99717796,0.00025107973,0.0005583896,0.00085273926,0.00065430405,0.00050550915],"domain_scores_gemma":[0.9976674,0.00015608857,0.0005807742,0.0011994533,0.00016939451,0.00022690989],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002562983,0.00053693895,0.00058778503,0.0005193791,0.00008449209,0.0002827706,0.0013431787,0.00039999222,0.00091434363],"category_scores_gemma":[0.00007068213,0.0005285841,0.00006461935,0.00031460365,0.00012432093,0.00015927468,0.00026739197,0.00066007674,0.0005709978],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041099693,0.00013215932,0.0000075062685,0.00005181995,0.000032228614,0.000019423596,0.000060795985,0.000008403362,0.00003821421,0.37547266,0.605048,0.019124677],"study_design_scores_gemma":[0.00041308583,0.00036025737,0.00012106181,0.00041358953,0.00003600798,0.000021782098,0.000007642244,0.013929465,0.00010956868,0.053239867,0.93042094,0.0009267485],"about_ca_topic_score_codex":0.0001956664,"about_ca_topic_score_gemma":0.0008921763,"teacher_disagreement_score":0.32537293,"about_ca_system_score_codex":0.000105769075,"about_ca_system_score_gemma":0.0002653979,"threshold_uncertainty_score":0.9999989},"labels":[],"label_agreement":null},{"id":"W4319662280","doi":"10.22541/au.167597462.26786780/v1","title":"An Innovative Digital Equalizer for Wireless Communications","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Predistortion; Electronic engineering; Computer science; Amplifier; Finite impulse response; Frequency response; Nonlinear distortion; Frequency band; Adaptive equalizer; Radio frequency; Nonlinear system; Wireless; Equalization (audio); Electrical engineering; Engineering; Channel (broadcasting); Telecommunications; Bandwidth (computing); Physics","score_opus":0.1415796382059004,"score_gpt":0.40507188074535044,"score_spread":0.26349224253945003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319662280","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.00070977217,0.000008379197,0.9833397,0.0048216125,0.00016468411,0.0007443311,0.000095789,0.0025837542,0.007531931],"genre_scores_gemma":[0.5666542,0.000017696746,0.42879155,0.00084419345,0.0000443971,0.00077264337,0.00061184936,0.000036677884,0.0022268042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986589,0.00009020629,0.0003759684,0.000495937,0.00019995112,0.00017904503],"domain_scores_gemma":[0.99568194,0.00031079113,0.00020946805,0.003081529,0.000659958,0.000056299436],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005334887,0.00018625491,0.0002253214,0.00023950411,0.00012232077,0.0011045495,0.0039845896,0.00021615576,0.0000030019808],"category_scores_gemma":[0.00006930091,0.0001819232,0.00007597191,0.0005186436,0.00008352444,0.0007221986,0.003215724,0.00036558518,0.000040008068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015918125,0.00008815158,0.000037541162,0.00001803706,0.00002584811,2.8168552e-7,0.0024500843,0.000041607338,0.000048857506,0.9757335,0.0046519144,0.016902583],"study_design_scores_gemma":[0.00025127677,0.00016685178,0.0002785065,0.00008646653,0.00000642531,0.0000016149609,0.00023298782,0.4261035,0.0032814143,0.53298485,0.03582541,0.0007806655],"about_ca_topic_score_codex":0.00004021648,"about_ca_topic_score_gemma":0.000033594206,"teacher_disagreement_score":0.56594443,"about_ca_system_score_codex":0.000048058526,"about_ca_system_score_gemma":0.00025514222,"threshold_uncertainty_score":0.9999324},"labels":[],"label_agreement":null},{"id":"W4320011088","doi":"10.1109/iccspa55860.2022.10019156","title":"Improved Bayesian learning Algorithms for recovering Block Sparse Signals With Known and Unknown Borders","year":2022,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Block (permutation group theory); Algorithm; Bayesian probability; Iterated function; Computer science; Gaussian; SIGNAL (programming language); Artificial intelligence; Mathematics","score_opus":0.01594554672067837,"score_gpt":0.2638052367145443,"score_spread":0.24785968999386593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320011088","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.0055044894,0.000046200425,0.9898114,0.0014283116,0.000051845178,0.00045429092,0.0000016361156,0.000537293,0.0021645015],"genre_scores_gemma":[0.5870509,0.000010473513,0.40938082,0.00068215246,0.000026224096,0.00024119097,0.0000044099124,0.000022537502,0.0025812942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891734,0.00009046834,0.00017166045,0.00040232678,0.00017639683,0.00024183338],"domain_scores_gemma":[0.9994129,0.000120603036,0.000097637385,0.000232886,0.00006221024,0.00007376945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055820023,0.00013160758,0.00014847852,0.00012321571,0.00040374612,0.00019933315,0.00033269354,0.000030971314,0.000035992114],"category_scores_gemma":[0.000024588926,0.000120137374,0.00003568755,0.0002929118,0.000025742134,0.0003405001,0.00028567735,0.00021157213,6.338153e-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.0002362842,0.00040792717,0.0006729418,0.00011218749,0.00024286116,0.000029691175,0.012038344,0.044180553,0.026011212,0.11647361,0.005575143,0.7940192],"study_design_scores_gemma":[0.00059757923,0.0011284631,0.000029973175,0.000007999598,0.0000073913134,0.00003361096,0.00025904377,0.8826546,0.007489436,0.001278899,0.10620338,0.000309648],"about_ca_topic_score_codex":0.000060971845,"about_ca_topic_score_gemma":0.000033769265,"teacher_disagreement_score":0.83847404,"about_ca_system_score_codex":0.000038300535,"about_ca_system_score_gemma":0.0000893475,"threshold_uncertainty_score":0.489906},"labels":[],"label_agreement":null},{"id":"W4321788863","doi":"10.1007/s10044-023-01148-w","title":"Bounded multivariate generalized Gaussian mixture model using ICA and IVA","year":2023,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Independent component analysis; Mixture model; Bounded function; Computer science; Gaussian; Pattern recognition (psychology); Multivariate statistics; Component analysis; Artificial intelligence; Principal component analysis; Covariance; Independence (probability theory); Cluster analysis; Component (thermodynamics); Mathematics; Algorithm; Statistics; Machine learning","score_opus":0.03369455221902559,"score_gpt":0.3169119121925454,"score_spread":0.2832173599735198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321788863","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.04361698,0.00003046918,0.9543582,0.0014481447,0.0000036869194,0.00015458479,0.000012803308,0.00023483488,0.00014027322],"genre_scores_gemma":[0.93909127,0.00008103739,0.059943814,0.0005483836,0.000021374639,0.00009778292,0.00003713469,0.000007411354,0.00017176784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991507,0.000046474543,0.0001792594,0.00036489012,0.00012094592,0.00013774331],"domain_scores_gemma":[0.99936825,0.000028182945,0.00008259718,0.0003981499,0.000041696636,0.00008112302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018894256,0.000101537735,0.00017015972,0.00029208144,0.00023998303,0.0002669043,0.00020985819,0.000052955143,0.0000048384372],"category_scores_gemma":[0.000003291634,0.000092191236,0.000065424276,0.0012311527,0.000033621604,0.00014851682,0.00015197281,0.000071103015,0.0000065741997],"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.000008915109,0.00044131573,0.029468205,0.00012159146,0.0023835015,0.000010299728,0.013677466,0.052570768,0.10081252,0.45682833,0.0015669934,0.3421101],"study_design_scores_gemma":[0.00009975646,0.0000029668904,0.004264294,0.0000024506173,0.00010255272,0.0000011515236,0.00001545208,0.98278,0.00071059196,0.011289407,0.0006147574,0.00011662535],"about_ca_topic_score_codex":0.00020191676,"about_ca_topic_score_gemma":0.00007603077,"teacher_disagreement_score":0.9302092,"about_ca_system_score_codex":0.000010520192,"about_ca_system_score_gemma":0.000016485796,"threshold_uncertainty_score":0.37594494},"labels":[],"label_agreement":null},{"id":"W43552766","doi":"","title":"Sequence Estimation for Digital FM","year":2001,"lang":"en","type":"article","venue":"Institutional Repositories DataBase (IRDB)","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"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; Tatematsu Foundation","keywords":"Computer science; Estimation; Sequence (biology); Speech recognition; Algorithm; Telecommunications","score_opus":0.037029250845399625,"score_gpt":0.30762110002361,"score_spread":0.27059184917821033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43552766","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.0068567884,0.000052186075,0.9850009,0.0010078009,0.00080069405,0.0003312279,0.00017280909,0.0005952564,0.0051823156],"genre_scores_gemma":[0.74727243,0.000013285705,0.25093046,0.00036534428,0.0002900732,0.00010081119,0.0006308329,0.000009528011,0.00038725347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99851555,0.000026086203,0.00033400382,0.00043920125,0.00045637845,0.00022879695],"domain_scores_gemma":[0.9986633,0.00016421967,0.00013028903,0.000626191,0.00031078275,0.00010522848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002608181,0.00016315543,0.00013194111,0.00011210675,0.00044764415,0.0007302749,0.00060384016,0.00006962166,0.000004306469],"category_scores_gemma":[0.00048190806,0.00016171878,0.000070212685,0.00037814467,0.00015388853,0.0049478514,0.00020632049,0.00011825127,0.00003878093],"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.000027126662,0.000086281296,0.00041519073,0.000019387091,0.000015160119,0.000054514778,0.00015901576,0.00090301386,0.0020888604,0.9834788,0.0026035707,0.010149078],"study_design_scores_gemma":[0.0009563887,0.0002854456,0.0008662839,0.0002275568,0.000023231372,0.0015569704,0.000038849274,0.23946661,0.0459598,0.04645291,0.6631976,0.00096836226],"about_ca_topic_score_codex":0.00004519329,"about_ca_topic_score_gemma":0.000008479848,"teacher_disagreement_score":0.9370259,"about_ca_system_score_codex":0.00015641066,"about_ca_system_score_gemma":0.00036504396,"threshold_uncertainty_score":0.70420575},"labels":[],"label_agreement":null},{"id":"W4365934488","doi":"10.1007/978-3-030-05481-6_26","title":"Correction to: Spectral Band Selection Using Binary Gray Wolf Optimizerand Signal to Noise Ration Measure","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in networks and systems","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thales (Canada)","funders":"","keywords":"Gray (unit); Binary number; Selection (genetic algorithm); Measure (data warehouse); Library science; Computer science; Algorithm; Mathematics; Artificial intelligence; Data mining; Arithmetic","score_opus":0.023879141600867373,"score_gpt":0.250509204403203,"score_spread":0.22663006280233564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365934488","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.00037136866,0.00052131905,0.99173,0.00019542659,0.0030819862,0.0012266841,0.000002981981,0.00040030634,0.0024699275],"genre_scores_gemma":[0.97798276,0.0001300598,0.010879749,0.00059186126,0.002104661,0.00010574166,0.000043985285,0.00013518883,0.008025967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779165,0.00016677943,0.0005319858,0.0007623705,0.00040622958,0.00034100222],"domain_scores_gemma":[0.99885464,0.00028918587,0.0002203339,0.00030522264,0.00017905509,0.000151552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008547504,0.00041879615,0.0005338221,0.0005961336,0.00021448878,0.00057997793,0.0002543903,0.0005559729,0.000006400226],"category_scores_gemma":[0.00005107968,0.00039944236,0.00009453279,0.00048408788,0.000021787464,0.0002300757,0.00008083124,0.00072849164,0.0000070689666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005626325,0.00000804282,0.00006280498,0.000025205312,0.000025947636,0.000011374939,0.0005600609,0.9901035,0.00061879016,0.0015035343,0.0015786526,0.005445834],"study_design_scores_gemma":[0.00022173132,0.00030334352,0.00007176077,0.001022444,0.00002243194,0.000073856274,0.0000032651465,0.9951396,0.00027209503,0.0012167707,0.0011453205,0.00050736405],"about_ca_topic_score_codex":0.00022200773,"about_ca_topic_score_gemma":0.0006376982,"teacher_disagreement_score":0.9808503,"about_ca_system_score_codex":0.00023839486,"about_ca_system_score_gemma":0.000091441274,"threshold_uncertainty_score":0.99984574},"labels":[],"label_agreement":null},{"id":"W4366728435","doi":"10.1109/iccicc57084.2022.10101562","title":"Monoscale and Polyscale Analyses of Physical Signals for Compressive Detection of Relevant Complexity Features","year":2022,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Computer science; Robustness (evolution); Compressed sensing; Algorithm; Pattern recognition (psychology); Data mining; Artificial intelligence","score_opus":0.05866734651793577,"score_gpt":0.3473324280042104,"score_spread":0.2886650814862746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366728435","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.20518611,0.000097023294,0.79374015,0.00029237178,0.000018543798,0.00025073253,0.000022840557,0.00007884515,0.0003133803],"genre_scores_gemma":[0.9664295,0.0000022307931,0.03337157,0.00007472395,0.000009223595,0.000040182025,0.0000027827475,0.0000036302815,0.00006616588],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992463,0.000116326446,0.00017421713,0.00018502862,0.0001960936,0.00008205436],"domain_scores_gemma":[0.9992714,0.00023310324,0.00016685428,0.00021006638,0.00009099712,0.000027590419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001666757,0.00006870671,0.00021249482,0.000101754544,0.00010482955,0.000017104298,0.0002508368,0.000018499803,0.0000063218445],"category_scores_gemma":[0.000020096517,0.00006032639,0.00008113146,0.00020995557,0.00008347677,0.00012990471,0.00022865261,0.00007726832,8.537028e-8],"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.00004239932,0.00017905749,0.00004351499,0.000022447173,0.000028688664,2.1224636e-7,0.0011817898,0.00069925864,0.9568072,0.035343934,0.00029487943,0.005356605],"study_design_scores_gemma":[0.00017284443,0.00043988082,0.0014899803,0.0000036502895,0.000009940146,0.0000026614384,0.00010521361,0.124296546,0.85087955,0.022449266,0.00008824895,0.000062209416],"about_ca_topic_score_codex":0.00015168948,"about_ca_topic_score_gemma":0.000015510559,"teacher_disagreement_score":0.76124334,"about_ca_system_score_codex":0.000011474575,"about_ca_system_score_gemma":0.000017495135,"threshold_uncertainty_score":0.24600388},"labels":[],"label_agreement":null},{"id":"W4367321651","doi":"10.3390/electronics12092010","title":"Digital Finite Impulse Response Equalizer for Nonlinear Frequency Response Compensation in Wireless Communication","year":2023,"lang":"en","type":"article","venue":"Electronics","topic":"Blind Source Separation 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":"University of Alberta","funders":"","keywords":"Predistortion; Frequency response; Finite impulse response; Electronic engineering; Nonlinear distortion; Impulse response; Phase distortion; Nonlinear system; Phase response; Computer science; Amplifier; Control theory (sociology); Frequency band; Filter (signal processing); Engineering; Electrical engineering; Telecommunications; Bandwidth (computing); Mathematics; Physics","score_opus":0.023840440021610208,"score_gpt":0.30889429982994593,"score_spread":0.2850538598083357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367321651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6073072,0.00024244249,0.383401,0.007073459,0.000053110976,0.0006972013,0.000032281532,0.00094100065,0.00025230052],"genre_scores_gemma":[0.97465754,0.0001508886,0.023683146,0.00041068054,0.000016683562,0.00016558648,0.0001732756,0.000029299863,0.0007129306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800277,0.000653981,0.00038903975,0.00031831145,0.00023955463,0.00039632496],"domain_scores_gemma":[0.9966718,0.0021754145,0.00014175572,0.00081264734,0.00014856127,0.000049835784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003238788,0.00014461765,0.00017092162,0.00039929053,0.00013539776,0.0002673371,0.00080568134,0.00012076876,0.0000026422713],"category_scores_gemma":[0.00077910186,0.00016013408,0.000066804416,0.001139901,0.00004019167,0.00080449163,0.00016722456,0.00026318562,0.0000586466],"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.010186554,0.0008977467,0.0017729262,0.00008354105,0.00009325855,0.000043389515,0.023874577,0.0033626775,0.10172713,0.6481233,0.007885336,0.20194955],"study_design_scores_gemma":[0.002573136,0.0014575443,0.0059938724,0.00009963261,0.000008030781,0.000014450948,0.00020681228,0.75831276,0.029524704,0.091168635,0.109767,0.0008734089],"about_ca_topic_score_codex":0.0000041548988,"about_ca_topic_score_gemma":0.00005336529,"teacher_disagreement_score":0.7549501,"about_ca_system_score_codex":0.000236252,"about_ca_system_score_gemma":0.00041096663,"threshold_uncertainty_score":0.6530078},"labels":[],"label_agreement":null},{"id":"W4367675017","doi":"10.1016/j.engappai.2023.106345","title":"ICA and IVA bounded multivariate generalized Gaussian mixture based hidden Markov models","year":2023,"lang":"en","type":"article","venue":"Engineering Applications of Artificial Intelligence","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hidden Markov model; Computer science; Artificial intelligence; Independent component analysis; Machine learning; Pattern recognition (psychology); Mixture model; Speech recognition","score_opus":0.029023167012374125,"score_gpt":0.2844749459723214,"score_spread":0.2554517789599473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367675017","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.0038953146,0.000044967477,0.9934047,0.0012255949,0.00004637283,0.00037808815,0.0000073022384,0.00082621153,0.00017148734],"genre_scores_gemma":[0.5963557,0.000020896896,0.4032782,0.000052473515,0.00002727598,0.00019828297,0.000010900315,0.000014022261,0.000042280728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883556,0.000033313972,0.00036596364,0.0003556936,0.00020069465,0.00020874971],"domain_scores_gemma":[0.99896145,0.00015910986,0.00009227267,0.0005992579,0.0001009634,0.00008696798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003748394,0.00014702494,0.00016644357,0.00031318617,0.00009721355,0.00012176413,0.0005815838,0.00009199632,0.0000068234913],"category_scores_gemma":[0.000048200287,0.00015699548,0.000051616942,0.001073904,0.000051613333,0.0002465585,0.00013106671,0.0001431896,0.000025104264],"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.000005658267,0.000052259737,0.0000039739357,0.000036270627,0.000014519343,0.0000011794805,0.00073278986,0.058198497,0.021067616,0.8514672,0.00013296508,0.0682871],"study_design_scores_gemma":[0.000019462212,0.00001582371,0.00005538401,0.000016280304,0.0000038872877,0.0000011098836,0.000017219432,0.86900437,0.083946,0.046030227,0.00074647187,0.0001437696],"about_ca_topic_score_codex":0.00006397348,"about_ca_topic_score_gemma":0.0000060022953,"teacher_disagreement_score":0.81080586,"about_ca_system_score_codex":0.000022123402,"about_ca_system_score_gemma":0.000050165716,"threshold_uncertainty_score":0.64020896},"labels":[],"label_agreement":null},{"id":"W4381802355","doi":"10.20982/tqmp.19.2.p173","title":"Analysis of frequency data: The ANOFA framework","year":2023,"lang":"en","type":"article","venue":"The Quantitative Methods for Psychology","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":"University of Ottawa; Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science","score_opus":0.33556093998659864,"score_gpt":0.5959764391506407,"score_spread":0.26041549916404205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381802355","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.0012444047,0.00027573656,0.98335737,0.013295891,0.00034729159,0.00035903952,0.000042987875,0.00020346945,0.00087382447],"genre_scores_gemma":[0.010419451,0.00008291082,0.98732215,0.001954709,0.00002014335,0.0000897857,0.000030985982,0.000010450992,0.00006939653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964085,0.0023996283,0.0003677697,0.00045940487,0.000135816,0.00022885895],"domain_scores_gemma":[0.98841965,0.008640925,0.00028214479,0.0024637317,0.00016987951,0.00002366655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009743879,0.00011822696,0.0003336727,0.0003840021,0.00017565396,0.00004354153,0.003320738,0.00009377353,0.000014510718],"category_scores_gemma":[0.0017512187,0.00006660884,0.0001603201,0.0043254895,0.00033860377,0.00020579781,0.0003564157,0.00022378034,0.00001890609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011197573,0.000023804929,0.00013872294,0.0000031948275,0.00047136546,2.965254e-7,0.0043842606,0.000052318566,0.0014556162,0.96435803,0.0019481448,0.02715306],"study_design_scores_gemma":[0.00010258098,0.00023976016,0.008980041,0.0000055681685,0.00022688368,0.0000014958956,0.00032357094,0.09215211,0.0008036978,0.8867739,0.010271737,0.00011867422],"about_ca_topic_score_codex":0.000021945138,"about_ca_topic_score_gemma":0.00001423076,"teacher_disagreement_score":0.09209979,"about_ca_system_score_codex":0.0000065930144,"about_ca_system_score_gemma":0.000032191314,"threshold_uncertainty_score":0.6170813},"labels":[],"label_agreement":null},{"id":"W4382395359","doi":"10.18280/ts.400345","title":"Enhanced Single-Snapshot 1-D and 2-D DOA Estimation Using Particle Swarm Optimization","year":2023,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board","keywords":"Snapshot (computer storage); Particle swarm optimization; Computer science; Algorithm; Estimation; Mathematical optimization; Mathematics; Engineering","score_opus":0.04472152520772041,"score_gpt":0.2836504775249262,"score_spread":0.23892895231720582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382395359","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.254755,0.0000074873824,0.74404067,0.00045163362,0.000036653746,0.0001648929,8.930438e-7,0.000377289,0.00016549078],"genre_scores_gemma":[0.82245547,0.000004824954,0.17722854,0.00022936556,0.00002290799,0.000018730085,0.000017250255,0.0000072597654,0.00001564597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990202,0.00007000163,0.00022852677,0.00025338223,0.00024048942,0.00018740993],"domain_scores_gemma":[0.9995856,0.000059141254,0.00008386834,0.0001519593,0.00005798655,0.00006139396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038328025,0.000101454745,0.000095185955,0.000107745545,0.0001349584,0.0002253145,0.00016387076,0.000040004506,0.00004796584],"category_scores_gemma":[0.00001994098,0.000104372004,0.000024157991,0.00047971404,0.000030767922,0.0006775713,0.000080622056,0.000051854848,0.000011056879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009719371,0.00008478439,0.000046878038,0.000014564442,0.000012134865,0.0000032869184,0.0025166937,0.8585788,0.11081627,0.012355812,0.00020165974,0.015359415],"study_design_scores_gemma":[0.00022681309,0.00007920176,0.00017857297,0.00001429985,0.0000049541973,0.0000024299031,0.00002742323,0.83787405,0.16055998,0.00089582294,0.000034180666,0.00010225193],"about_ca_topic_score_codex":0.0000064291885,"about_ca_topic_score_gemma":0.0000017310974,"teacher_disagreement_score":0.5677005,"about_ca_system_score_codex":0.00003965948,"about_ca_system_score_gemma":0.00002585897,"threshold_uncertainty_score":0.42561665},"labels":[],"label_agreement":null},{"id":"W4386088262","doi":"10.1109/jsen.2023.3306311","title":"A Sensor-Fusion Method for Motion Artifacts Reduction in Intraoral EEG Signals","year":2023,"lang":"en","type":"article","venue":"IEEE Sensors Journal","topic":"Blind Source Separation Techniques","field":"Computer Science","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer vision; Artificial intelligence; Sensor fusion; Fusion; Reduction (mathematics); Computer science; Electroencephalography; Motion (physics); Mathematics; Medicine","score_opus":0.04509081756401373,"score_gpt":0.3448722150741734,"score_spread":0.2997813975101597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386088262","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.30160695,0.000007397317,0.6939919,0.0030816218,0.00064295705,0.00025539365,0.0000014722026,0.0003024227,0.00010989893],"genre_scores_gemma":[0.69288045,0.00006408123,0.3059312,0.00024849002,0.00034206556,0.000021132142,0.000004182523,0.000025071027,0.0004833109],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979256,0.00050002796,0.0004966167,0.0003227827,0.0003730747,0.00038188993],"domain_scores_gemma":[0.99897593,0.00017731644,0.00024981902,0.0002473342,0.00022271684,0.0001268529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002746027,0.00015512861,0.00021572915,0.00076479645,0.000196984,0.00029613797,0.00030490293,0.00013907951,0.000013486279],"category_scores_gemma":[0.00016399918,0.00014829032,0.00012671719,0.00093982305,0.000022130278,0.0007659875,0.00003878527,0.0004004208,0.000057915233],"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.00010062901,0.00015050528,0.000094878604,0.000027846638,0.000032132168,0.00010368628,0.0070840367,0.09651936,0.67387354,0.0035175106,0.017318308,0.20117757],"study_design_scores_gemma":[0.00086334394,0.0002766843,0.0018094993,0.000090977344,0.000010620416,0.0009131298,0.00034154655,0.6160118,0.33777416,0.03858861,0.0029535335,0.00036610715],"about_ca_topic_score_codex":0.000015123286,"about_ca_topic_score_gemma":0.0000053650224,"teacher_disagreement_score":0.51949245,"about_ca_system_score_codex":0.000113293616,"about_ca_system_score_gemma":0.000074541706,"threshold_uncertainty_score":0.60471034},"labels":[],"label_agreement":null},{"id":"W4387193954","doi":"10.1109/gtd49768.2023.00056","title":"Assessment of Non-Intrusive Load Monitoring as a Blind Source Separation Problem","year":2023,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"University of Waterloo","funders":"","keywords":"Computer science; Independent component analysis; Blind signal separation; Preprocessor; Software deployment; Energy (signal processing); Data pre-processing; Limiting; SIGNAL (programming language); Aggregate (composite); Energy consumption; Component (thermodynamics); Data mining; Artificial neural network; Source separation; Data modeling; Artificial intelligence; Real-time computing; Engineering; Database; Telecommunications","score_opus":0.022848217394527096,"score_gpt":0.3626661682422867,"score_spread":0.3398179508477596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387193954","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.122845225,0.0000048086113,0.83985066,0.0006489123,0.000108120155,0.0003862545,4.4735836e-7,0.000754895,0.035400677],"genre_scores_gemma":[0.84096843,0.000013282242,0.1558068,0.0000868423,0.000046538702,0.00006940499,0.0000025284426,0.000009281837,0.0029969031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998587,0.0000628448,0.00030796655,0.0003095804,0.0005348018,0.0001978225],"domain_scores_gemma":[0.9990037,0.00008787194,0.00015551638,0.00042843889,0.00026381665,0.000060641938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006777165,0.00011737796,0.00015797607,0.00021032362,0.00008013142,0.00014508194,0.00047995689,0.00007561434,0.000016900669],"category_scores_gemma":[0.000025857467,0.00010996891,0.000059001377,0.0009082145,0.000023579021,0.0005325124,0.00025974878,0.00012837956,0.00012013987],"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.00005022589,0.00068702287,0.023315256,0.00025003552,0.00025349486,0.000043862176,0.035981257,0.035093844,0.26496983,0.47716388,0.018910712,0.14328057],"study_design_scores_gemma":[0.0011410568,0.0006383772,0.02651316,0.00012421561,0.000014777146,0.000013787072,0.0006060008,0.53527254,0.41281393,0.015547841,0.0067595397,0.0005547446],"about_ca_topic_score_codex":0.000092824426,"about_ca_topic_score_gemma":0.000006552946,"teacher_disagreement_score":0.7181232,"about_ca_system_score_codex":0.00008214096,"about_ca_system_score_gemma":0.00029653186,"threshold_uncertainty_score":0.4484402},"labels":[],"label_agreement":null},{"id":"W4387618741","doi":"10.1016/j.patter.2023.100844","title":"Nonlinear independent component analysis for principled disentanglement in unsupervised deep learning","year":2023,"lang":"en","type":"review","venue":"Patterns","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":28,"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":"Precursory Research for Embryonic Science and Technology; Japan Science and Technology Agency; Japan Society for the Promotion of Science; Academy of Finland; Canadian Institute for Advanced Research","keywords":"Independent component analysis; Identifiability; Nonlinear system; Heuristic; Artificial intelligence; Computer science; Unsupervised learning; Representation (politics); Component (thermodynamics); Feature learning; Machine learning; Probabilistic logic; Uniqueness; Deep learning; Pattern recognition (psychology); Algorithm; Mathematics","score_opus":0.09468974548462399,"score_gpt":0.374004057197054,"score_spread":0.27931431171243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387618741","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011256452,0.22697598,0.7700147,0.000088352645,0.00015035798,0.0020064544,0.00006299552,0.0005524289,0.000036180707],"genre_scores_gemma":[0.000492006,0.9870619,0.009588607,0.00009073352,0.00009346557,0.0013440651,0.0010423004,0.0000737327,0.00021318765],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.996797,0.00043379638,0.0010156039,0.0008330279,0.00049526663,0.00042525236],"domain_scores_gemma":[0.9982808,0.0003386906,0.00044826,0.0007523853,0.00006832467,0.00011148665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010334109,0.00040684605,0.0014328663,0.0012285938,0.00008608623,0.00023903996,0.0012870685,0.00020319501,0.000026071857],"category_scores_gemma":[0.000045178575,0.0003704434,0.0008035246,0.0014754507,0.00001157736,0.0001426758,0.00065253687,0.00047954026,0.000060510494],"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.000005344134,0.00045240732,0.0060040904,0.0092859715,0.0018365621,0.00007801344,0.0021568919,0.0011116564,9.187474e-7,0.0016452002,0.000023931607,0.977399],"study_design_scores_gemma":[0.00074204104,0.0001696251,0.0012900201,0.003738473,0.0013582965,0.000005399791,0.00008583808,0.17332311,0.000013823741,0.00012774729,0.8179016,0.001244024],"about_ca_topic_score_codex":0.00008781387,"about_ca_topic_score_gemma":0.0007368534,"teacher_disagreement_score":0.976155,"about_ca_system_score_codex":0.00029958904,"about_ca_system_score_gemma":0.00009982129,"threshold_uncertainty_score":0.9998748},"labels":[],"label_agreement":null},{"id":"W4388118095","doi":"10.23919/eusipco58844.2023.10290091","title":"Granger Causality Pattern Learning Equipped with Noise Invalidation Soft Thresholding","year":2023,"lang":"en","type":"article","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Granger causality; Thresholding; Computer science; Artificial intelligence; Robustness (evolution); Causality (physics); Context (archaeology); Noise (video); Exploit; Pattern recognition (psychology); Machine learning; Algorithm; Image (mathematics); Geography; Biology","score_opus":0.033009170074764144,"score_gpt":0.28094410317674634,"score_spread":0.2479349331019822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388118095","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.14640945,0.0000040970012,0.84688103,0.0018916874,0.00004261234,0.00014319667,3.5740507e-7,0.002252542,0.0023750307],"genre_scores_gemma":[0.9895437,0.000007597339,0.0084461905,0.0008367878,0.000028601879,0.000030872296,0.000013213285,0.000013067174,0.00107999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988422,0.00011703864,0.0001669544,0.0003204204,0.00032741154,0.00022598606],"domain_scores_gemma":[0.9993256,0.00011063876,0.00007797176,0.00034337977,0.0000848653,0.000057593406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077337853,0.00010993853,0.00010868542,0.00016562261,0.00015211795,0.00029399604,0.00036192202,0.00005241496,0.000040507857],"category_scores_gemma":[0.000051619085,0.00008912595,0.000029399213,0.0007115995,0.000024085466,0.00073650776,0.00020833805,0.00017077863,0.0001885285],"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.000045684774,0.00023495844,0.3400229,0.0001563071,0.0001316433,0.00015722027,0.01992036,0.01700603,0.03929571,0.14850883,0.023894554,0.41062582],"study_design_scores_gemma":[0.0010993759,0.0005783805,0.093767256,0.00018390967,0.000022953349,0.000032742628,0.00045258555,0.7715603,0.10244402,0.010977254,0.01748838,0.0013928476],"about_ca_topic_score_codex":0.00011189124,"about_ca_topic_score_gemma":0.000057813304,"teacher_disagreement_score":0.8431342,"about_ca_system_score_codex":0.000025295973,"about_ca_system_score_gemma":0.000038194645,"threshold_uncertainty_score":0.36344507},"labels":[],"label_agreement":null},{"id":"W4388407250","doi":"10.1007/s42113-023-00184-3","title":"Towards Dependent Race Models for the Stop-Signal Paradigm","year":2023,"lang":"en","type":"article","venue":"Computational Brain & Behavior","topic":"Blind Source Separation Techniques","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":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Independence (probability theory); Censoring (clinical trials); Computer science; Context (archaeology); Observability; Race (biology); Econometrics; Mathematics; Statistics; Applied mathematics; Geography","score_opus":0.060826132935448966,"score_gpt":0.333703849606353,"score_spread":0.27287771667090405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388407250","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.0065573496,0.00006061121,0.97425807,0.017088972,0.00020850149,0.0008555792,0.000031377796,0.00077763596,0.00016193725],"genre_scores_gemma":[0.88225955,0.0000064647625,0.112053335,0.003228692,0.000117037,0.0011407291,0.00010366675,0.00002988117,0.0010606331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833935,0.000103940074,0.0002945349,0.0004087826,0.00057115266,0.00028220643],"domain_scores_gemma":[0.99818337,0.0010968387,0.00010649487,0.00036322483,0.00016841112,0.000081649385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000909498,0.00016160225,0.00014920566,0.00015942883,0.0003410144,0.0002987252,0.0009900155,0.00007413232,0.000016711134],"category_scores_gemma":[0.000043316202,0.00013371094,0.00013131383,0.00048485122,0.000061344974,0.000497768,0.00023426926,0.00015553413,0.00006459613],"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.000009409645,0.00008924923,0.000047783262,0.000004763668,0.000017777005,0.000010391301,0.0016787332,0.28887275,0.00011169688,0.60838336,0.020900045,0.07987407],"study_design_scores_gemma":[0.0003575136,0.00006845449,0.006716428,0.000006629895,0.000013469397,0.000017897248,0.000039264123,0.84877497,0.00034013213,0.13948703,0.003989902,0.0001883059],"about_ca_topic_score_codex":0.000014075472,"about_ca_topic_score_gemma":0.0000042698052,"teacher_disagreement_score":0.8757022,"about_ca_system_score_codex":0.000059827384,"about_ca_system_score_gemma":0.00024259115,"threshold_uncertainty_score":0.5452574},"labels":[],"label_agreement":null},{"id":"W4389723778","doi":"10.1109/cipae60493.2023.00141","title":"Enhancing Performance of Linked Independent Component Analysis: Investigating the Influence of Subjects and Modalities","year":2023,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Component (thermodynamics); Modalities; Computer science; Independent component analysis; Artificial intelligence","score_opus":0.02062192130634543,"score_gpt":0.25934058741139515,"score_spread":0.23871866610504971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389723778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97813034,0.000019393332,0.021143924,0.00026524282,0.000010012805,0.00010527876,6.016421e-7,0.00015032204,0.00017486555],"genre_scores_gemma":[0.99226505,0.000029443887,0.007493724,0.00014187829,0.0000036969307,0.00001073013,0.0000010718845,0.0000027235337,0.000051671614],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9989946,0.000092439324,0.00033511865,0.00015820161,0.00030419475,0.0001154516],"domain_scores_gemma":[0.99912554,0.0002034355,0.0001880006,0.00033341403,0.00011905168,0.0000305762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009560924,0.00007305326,0.0001735343,0.00024739167,0.00007191458,0.00004238188,0.000403925,0.000034420886,0.0000012979664],"category_scores_gemma":[0.000059535643,0.000051924195,0.000038927275,0.0012211795,0.000111563815,0.00031722305,0.00028830126,0.000094562194,0.0000012819605],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010594747,0.00006120098,0.23359449,0.00040933787,0.00043901242,0.0000019655265,0.069830865,0.1692083,0.35348678,0.17045632,0.000040587547,0.0024605512],"study_design_scores_gemma":[0.000074451105,0.00005618775,0.44510508,0.000047806847,0.000021072818,0.0000010958036,0.0004725625,0.2970013,0.2556906,0.0014438058,0.000003939108,0.00008208232],"about_ca_topic_score_codex":0.0002295165,"about_ca_topic_score_gemma":0.00006899088,"teacher_disagreement_score":0.2115106,"about_ca_system_score_codex":0.000008215589,"about_ca_system_score_gemma":0.000048749822,"threshold_uncertainty_score":0.21174072},"labels":[],"label_agreement":null},{"id":"W4389888669","doi":"10.1007/s11634-023-00576-0","title":"QDA classification of high-dimensional data with rare and weak signals","year":2023,"lang":"en","type":"article","venue":"Advances in Data Analysis and Classification","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Shandong Province","keywords":"Quadratic classifier; Linear discriminant analysis; Mathematics; Artificial intelligence; Covariance; Pattern recognition (psychology); Covariance matrix; Gaussian; Classifier (UML); Machine learning; Statistics; Computer science","score_opus":0.05659637533914804,"score_gpt":0.33905421800217767,"score_spread":0.28245784266302965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389888669","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.081619866,0.001010908,0.9132318,0.0031101676,0.000028884417,0.00024384106,0.00030002766,0.00017386036,0.00028065644],"genre_scores_gemma":[0.96115446,0.0017543166,0.03347698,0.000047818347,0.000010067952,0.00001678831,0.0034943777,0.0000054669727,0.000039750088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998321,0.00012472497,0.0003567482,0.0007733195,0.00030729707,0.00011690012],"domain_scores_gemma":[0.99729455,0.00020210647,0.00028404925,0.002084116,0.00009255255,0.000042606865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009373218,0.00010713773,0.00023821901,0.00046326435,0.000071561735,0.000092080154,0.0010668397,0.00005159778,0.000005180569],"category_scores_gemma":[0.00008338087,0.00008889627,0.000012591492,0.0022771196,0.00011220029,0.002592635,0.0005918288,0.0000858841,0.0000031295],"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.000086292355,0.00031693402,0.101068534,0.0001313212,0.00046166332,0.0000059911977,0.00066154846,0.0031790151,0.013987954,0.31073833,0.0033861317,0.5659763],"study_design_scores_gemma":[0.00017197846,0.000028941344,0.26746908,0.000023778348,0.00008922293,0.0000015017707,0.00014164222,0.72525734,0.00033733208,0.0030636822,0.003287242,0.00012827195],"about_ca_topic_score_codex":0.00004998143,"about_ca_topic_score_gemma":0.0006827355,"teacher_disagreement_score":0.8797548,"about_ca_system_score_codex":0.000011178215,"about_ca_system_score_gemma":0.000041479496,"threshold_uncertainty_score":0.36250848},"labels":[],"label_agreement":null},{"id":"W4390493794","doi":"10.1109/snams60348.2023.10375396","title":"Adaptive Constrained ICAMGGMM: An Improvement Over ICA","year":2023,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Concordia University","funders":"","keywords":"Independent component analysis; Robustness (evolution); Computer science; Blind signal separation; Covariance matrix; Multivariate statistics; Covariance; Source separation; Pattern recognition (psychology); Gaussian; Algorithm; Artificial intelligence; Mathematics; Machine learning; Statistics","score_opus":0.02926304484837247,"score_gpt":0.2956137511194639,"score_spread":0.2663507062710915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390493794","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.021827927,0.0000023533632,0.9332404,0.002010492,0.000099399986,0.00027625734,0.0000030202325,0.002939094,0.03960103],"genre_scores_gemma":[0.9278977,0.0000035057938,0.06776671,0.0022559052,0.000026658508,0.000036338675,0.0000051914194,0.0000070723545,0.0020009486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990961,0.00004355137,0.00015045596,0.00029458216,0.00022141598,0.00019386933],"domain_scores_gemma":[0.999327,0.00004522562,0.00004129243,0.00044359645,0.00005488935,0.00008801596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032845122,0.00008931561,0.000087449676,0.00011786276,0.00006398264,0.00011796942,0.0004758457,0.000046676992,0.00010348368],"category_scores_gemma":[0.0000130632325,0.00007737803,0.000036089074,0.00043653534,0.000039719987,0.0004888301,0.00019281456,0.00007928413,0.00017989855],"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.0000036168133,0.000055944904,0.000037181497,0.0000017125469,0.000011891121,0.000009067606,0.0012425941,0.000023064014,0.008312494,0.9258553,0.011746482,0.052700654],"study_design_scores_gemma":[0.0010871227,0.0019677884,0.007225673,0.000016983722,0.000007783598,0.000009766002,0.0007307759,0.7445991,0.10902365,0.11070698,0.023776202,0.00084814546],"about_ca_topic_score_codex":0.00003891718,"about_ca_topic_score_gemma":0.000018447952,"teacher_disagreement_score":0.90606976,"about_ca_system_score_codex":0.000021529017,"about_ca_system_score_gemma":0.00006662603,"threshold_uncertainty_score":0.31553844},"labels":[],"label_agreement":null},{"id":"W4391720265","doi":"10.1007/978-3-031-17299-1_2706","title":"Simple Component Analysis","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Simple (philosophy); Component (thermodynamics); Computer science; Physics; Philosophy; Epistemology","score_opus":0.0379089784421,"score_gpt":0.27896512363971615,"score_spread":0.24105614519761615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391720265","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.8445904e-7,0.000007680066,0.4820325,0.00034100327,0.000040378727,0.00007890503,0.000004669458,0.0012365127,0.51625746],"genre_scores_gemma":[0.0013102742,0.000047417267,0.017553953,0.00093154603,0.000036036367,0.000008549895,0.000089852794,0.000026621934,0.9799957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872917,0.000017081593,0.00028428718,0.00044822658,0.00037851126,0.00014271184],"domain_scores_gemma":[0.9986781,0.00008661005,0.00013725854,0.0009383554,0.00008771437,0.00007197121],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025651426,0.00019774518,0.0003426958,0.00067769986,0.000053634056,0.00016919717,0.0008517487,0.00018747726,0.00036495787],"category_scores_gemma":[0.0000050836475,0.00018330151,0.00031653425,0.00023275711,0.000025209856,0.00012232788,0.0004254837,0.0002049986,0.0011450947],"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":[2.4233177e-7,0.0000033648275,0.000003382811,0.0000022303877,0.0002184548,0.000007754571,0.000044417502,0.000050795297,0.000002964949,0.98484075,0.013214901,0.001610758],"study_design_scores_gemma":[0.00005701931,0.000038622977,0.00014979922,0.000009151237,0.0001749212,0.0000015676866,0.0000017129803,0.030408505,0.00015966526,0.3689498,0.5995721,0.00047710293],"about_ca_topic_score_codex":0.00003759298,"about_ca_topic_score_gemma":0.000108255255,"teacher_disagreement_score":0.6158909,"about_ca_system_score_codex":0.00003579976,"about_ca_system_score_gemma":0.000042052165,"threshold_uncertainty_score":0.99963266},"labels":[],"label_agreement":null},{"id":"W4392616936","doi":"10.48550/arxiv.2403.04234","title":"Fundamental limits of Non-Linear Low-Rank Matrix Estimation","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Blind Source Separation Techniques","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":"Natural Sciences and Engineering Research Council of Canada; European Commission; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Rank (graph theory); Matrix (chemical analysis); Mathematics; Statistics; Applied mathematics; Combinatorics; Chemistry; Chromatography","score_opus":0.056164512102791456,"score_gpt":0.2426729058496591,"score_spread":0.18650839374686762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392616936","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.28450152,0.000039648363,0.71199393,0.00014020845,0.00033749366,0.00029834895,0.000017698734,0.0004285104,0.002242646],"genre_scores_gemma":[0.9705649,0.00005754269,0.02777624,0.00006260131,0.00003655517,0.0000014191234,0.00002506815,0.000019242698,0.0014564007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985339,0.00008797134,0.00027606447,0.0007672716,0.00013648505,0.00019830003],"domain_scores_gemma":[0.9985343,0.00006757519,0.0002625478,0.000901286,0.00014345904,0.0000907916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029614224,0.00025346328,0.0002977958,0.00044067486,0.00005938395,0.00011305717,0.0012155755,0.00028390725,0.000020208236],"category_scores_gemma":[0.000018086743,0.00029737465,0.0002171094,0.00062429975,0.00008600857,0.00031200977,0.0016321889,0.0005607498,0.0001917756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004180804,0.0002656654,0.00036993477,0.00076188106,0.00017874059,0.00020661418,0.001613013,0.52229387,0.0010314436,0.46955448,0.0013463373,0.0023362353],"study_design_scores_gemma":[0.00018216138,0.00006356321,0.00018468984,0.0002299858,0.000045249995,0.0000034170287,0.000027222417,0.9422714,0.0054175765,0.051195346,0.00011062308,0.0002687676],"about_ca_topic_score_codex":0.00007697592,"about_ca_topic_score_gemma":0.000009353248,"teacher_disagreement_score":0.6860634,"about_ca_system_score_codex":0.00015862918,"about_ca_system_score_gemma":0.00024877,"threshold_uncertainty_score":0.99994785},"labels":[],"label_agreement":null},{"id":"W4393019167","doi":"10.1101/2024.03.18.585544","title":"Towards Interpretable Cryo-EM: Disentangling Latent Spaces of Molecular Conformations","year":2024,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":2,"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":"SLAC National Accelerator Laboratory; National Institutes of Health; U.S. Department of Energy; Laboratory Directed Research and Development; Flatiron Health; Canadian Institute for Advanced Research","keywords":"Leverage (statistics); Identifiability; Computer science; Latent variable; Artificial intelligence; Machine learning; Data science","score_opus":0.011772419567250779,"score_gpt":0.23783974396888888,"score_spread":0.2260673244016381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393019167","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.4513401,0.0020005237,0.54080576,0.001092105,0.0014867054,0.0009383257,0.00014137918,0.0019694215,0.00022567164],"genre_scores_gemma":[0.9411235,0.00010758729,0.05824039,0.00025954426,0.00006099754,0.00014084707,3.5059057e-7,0.000060109214,0.0000066741563],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974112,0.00013415367,0.0007441478,0.00075809093,0.0005640193,0.0003884189],"domain_scores_gemma":[0.9971564,0.0000409325,0.0004711811,0.0015892885,0.0005580768,0.00018413001],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007397995,0.00045161735,0.000535288,0.0005445705,0.000079646,0.00092230417,0.0014503954,0.0003632992,0.000015797097],"category_scores_gemma":[0.00010830717,0.0004681932,0.00025252588,0.00074419164,0.00008589434,0.00042014217,0.0022732473,0.000803283,0.00005573543],"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.000017139278,0.00031108139,0.00055237126,0.0020727268,0.0006418636,0.00013673934,0.0011088827,0.0022858407,0.5901163,0.40141803,0.0012888085,0.000050164927],"study_design_scores_gemma":[0.00018184313,0.00006235756,0.001000777,0.0011043868,0.00010829296,4.224056e-8,0.000011588687,0.04220709,0.9526065,0.00045936776,0.0014735686,0.000784207],"about_ca_topic_score_codex":0.000041213203,"about_ca_topic_score_gemma":0.0000017153747,"teacher_disagreement_score":0.48978338,"about_ca_system_score_codex":0.00018501481,"about_ca_system_score_gemma":0.00075749273,"threshold_uncertainty_score":0.99977696},"labels":[],"label_agreement":null},{"id":"W4393129448","doi":"10.1016/j.dsp.2024.104476","title":"Novel approach for ECG separation using adaptive constrained IVABMGGMM","year":2024,"lang":"en","type":"article","venue":"Digital Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Independent component analysis; Multivariate statistics; Data mining; Artificial intelligence; Covariance; Adaptability; Covariance matrix; Heartbeat; Set (abstract data type); Blind signal separation; Machine learning; Pattern recognition (psychology); Algorithm; Mathematics; Channel (broadcasting); Statistics","score_opus":0.05634071236804497,"score_gpt":0.31517770958737695,"score_spread":0.25883699721933195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393129448","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.00047583715,0.00020936581,0.9902126,0.00008931005,0.000038107257,0.00034967554,0.000020810352,0.00075436855,0.007849927],"genre_scores_gemma":[0.7321053,2.3860738e-7,0.26756018,0.00011064607,0.00006329301,0.00002828955,0.000024152918,0.00001552955,0.000092390466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881357,0.000012677014,0.00025193352,0.00045045477,0.00023897993,0.0002323898],"domain_scores_gemma":[0.99950343,0.000081614104,0.00007753748,0.00012041348,0.00015300393,0.00006397529],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002436998,0.00016662407,0.00014395351,0.00014758843,0.00016020086,0.0024211612,0.00029822093,0.00008158416,0.0000016816851],"category_scores_gemma":[0.000019281993,0.00015642155,0.00008292556,0.00045232972,0.00007029687,0.0034402132,0.00007792503,0.00012612015,0.0000037656723],"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.000029434843,0.00016836035,0.000008558869,0.00022551822,0.000042473166,0.000005594448,0.0029494627,0.0065608867,0.02462504,0.09103019,0.00022167101,0.8741328],"study_design_scores_gemma":[0.0001265222,0.00007707234,0.0000018182304,0.000083077444,0.000006817114,0.00004447843,0.000107038904,0.98759234,0.00448259,0.0067367367,0.0005362909,0.0002052027],"about_ca_topic_score_codex":0.0000021753965,"about_ca_topic_score_gemma":1.7286041e-7,"teacher_disagreement_score":0.9810315,"about_ca_system_score_codex":0.00006909591,"about_ca_system_score_gemma":0.00031779963,"threshold_uncertainty_score":0.99861443},"labels":[],"label_agreement":null},{"id":"W4393144259","doi":"10.1049/icp.2023.2617","title":"Bayesian phase search for probabilistic amplitude shaping","year":2023,"lang":"en","type":"article","venue":"IET conference proceedings.","topic":"Blind Source Separation 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":"University of British Columbia","funders":"","keywords":"Probabilistic logic; Bayesian probability; Computer science; Amplitude; Phase (matter); SIGNAL (programming language); Algorithm; Noise (video); Degradation (telecommunications); Artificial intelligence; Physics; Telecommunications","score_opus":0.11479793843894644,"score_gpt":0.36706738359136787,"score_spread":0.25226944515242145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393144259","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.023131942,0.000009058904,0.9656907,0.0034206118,0.00009981322,0.0009828876,0.000008291748,0.0021035008,0.004553233],"genre_scores_gemma":[0.948703,0.000011368204,0.050043516,0.00036908675,0.000069186695,0.00041260684,0.000011397051,0.00001880093,0.00036104838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826807,0.000014447367,0.0002887935,0.000588703,0.00035117668,0.0004887841],"domain_scores_gemma":[0.9988166,0.000087074695,0.00008766869,0.00022540231,0.00064168713,0.00014155473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000987444,0.00017919148,0.00020625362,0.00024917017,0.00020708781,0.00083879766,0.0010181583,0.00009942514,0.000017910945],"category_scores_gemma":[0.00019904462,0.00017597145,0.0000717936,0.00084568316,0.00007185002,0.0007746407,0.00026081124,0.00019270017,0.00006599594],"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.000017356051,0.00009822453,0.00022623525,0.00016466418,0.000014705143,0.0000022553438,0.007197709,0.000015209706,0.008719935,0.95353407,0.0051548523,0.02485479],"study_design_scores_gemma":[0.0010196888,0.00052573817,0.00035112223,0.00013980063,0.000009944245,0.000011753548,0.00047350244,0.8401143,0.027884588,0.119967826,0.008967549,0.00053416897],"about_ca_topic_score_codex":0.0000073687474,"about_ca_topic_score_gemma":0.0000022428721,"teacher_disagreement_score":0.925571,"about_ca_system_score_codex":0.00004786148,"about_ca_system_score_gemma":0.000204931,"threshold_uncertainty_score":0.8088545},"labels":[],"label_agreement":null},{"id":"W4394686985","doi":"10.1007/s10548-024-01044-4","title":"Adapted Beamforming: A Robust and Flexible Approach for Removing Various Types of Artifacts from TMS–EEG Data","year":2024,"lang":"en","type":"article","venue":"Brain Topography","topic":"Blind Source Separation Techniques","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 Toronto; Centre for Addiction and Mental Health","funders":"HORIZON EUROPE European Research Council; Tekniikan Edistämissäätiö; Aalto-Yliopisto; Academy of Finland; Deutsche Forschungsgemeinschaft","keywords":"Electroencephalography; Computer science; Artificial intelligence; Beamforming; Pattern recognition (psychology); Speech recognition; Psychology; Neuroscience; Telecommunications","score_opus":0.0582423085842378,"score_gpt":0.2873244978585982,"score_spread":0.22908218927436041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394686985","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.0030416434,0.0013759015,0.99203676,0.0009375769,0.00008232834,0.00034427582,0.00006039767,0.0005394072,0.0015817329],"genre_scores_gemma":[0.2452681,0.00003165596,0.7540055,0.00038243795,0.000042058055,0.000024757845,0.0001270017,0.00001700993,0.00010144902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987986,0.000046720084,0.00024531546,0.00054684846,0.00017974383,0.00018273765],"domain_scores_gemma":[0.9986633,0.00033911061,0.000071711394,0.0008125829,0.000049374506,0.00006388683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005910312,0.00013155036,0.0001863607,0.00033234854,0.00007283714,0.00025221735,0.0007543051,0.00008901475,0.000004146399],"category_scores_gemma":[0.00009009435,0.00012228776,0.00006743817,0.00067255605,0.000059756832,0.0006613713,0.00035702344,0.00011720652,0.0000010208311],"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.000085710606,0.00041092196,0.0007007112,0.00065763737,0.0005882405,0.000016845604,0.011580995,0.0016716914,0.016924527,0.56459045,0.046044555,0.3567277],"study_design_scores_gemma":[0.00031522548,0.00018020644,0.0009806562,0.00013245115,0.000042101707,0.000013744205,0.0001262063,0.88575816,0.005794922,0.03875212,0.06752702,0.00037719472],"about_ca_topic_score_codex":0.000103338185,"about_ca_topic_score_gemma":0.00001637774,"teacher_disagreement_score":0.8840865,"about_ca_system_score_codex":0.0000066025796,"about_ca_system_score_gemma":0.00006389072,"threshold_uncertainty_score":0.49867502},"labels":[],"label_agreement":null},{"id":"W4396738069","doi":"10.1038/s41598-024-58524-7","title":"The impact of spike timing precision and spike emission reliability on decoding accuracy","year":2024,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Blind Source Separation Techniques","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":"Ontario Brain Institute; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spike (software development); Reliability (semiconductor); Computer science; Decoding methods; Algorithm; Physics","score_opus":0.027137512512219665,"score_gpt":0.3506489788287201,"score_spread":0.3235114663165004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396738069","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9353608,0.00033947107,0.058944125,0.0004840388,0.0023084264,0.00036300375,8.345597e-7,0.00031100295,0.0018883358],"genre_scores_gemma":[0.9940037,0.000019410438,0.0052929604,0.000008835422,0.000020520063,0.000007655859,0.0000023252394,0.000006736124,0.0006378688],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980093,0.00009561128,0.00048488448,0.00071085244,0.00050658494,0.00019277127],"domain_scores_gemma":[0.9978035,0.0005317165,0.00021355433,0.0012205858,0.00014197097,0.00008866068],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00524114,0.00011635404,0.00012424256,0.0001717121,0.00040195463,0.0013569111,0.00032720077,0.000056670076,0.000008979053],"category_scores_gemma":[0.0011356403,0.00006761409,0.00011550962,0.0006303703,0.00014411008,0.000642383,0.00027227035,0.00016105201,0.000004216403],"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.000027670309,0.000156514,0.004670638,0.00010005129,0.0000277757,0.00019684735,0.005788988,0.0011424726,0.10215343,0.0075121773,0.07293883,0.8052846],"study_design_scores_gemma":[0.000115477276,0.00039922202,0.011240442,0.00095733773,0.000014960477,0.0004251804,0.00007473483,0.29758674,0.389517,0.2531954,0.04597983,0.0004936411],"about_ca_topic_score_codex":0.000031932566,"about_ca_topic_score_gemma":0.0000020476884,"teacher_disagreement_score":0.804791,"about_ca_system_score_codex":0.00007322627,"about_ca_system_score_gemma":0.00021958341,"threshold_uncertainty_score":0.9996798},"labels":[],"label_agreement":null},{"id":"W4398163937","doi":"10.1109/dcc58796.2024.00060","title":"Two-stage Multiple-Model Compression Approach for Sampled Electrical Signals","year":2024,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"","funders":"","keywords":"Residual; Waveform; Computer science; Parametric statistics; Stage (stratigraphy); Algorithm; Window (computing); Data compression; Compression (physics); Electronic engineering; Mathematics; Engineering; Statistics; Telecommunications; Materials science","score_opus":0.05833918355170984,"score_gpt":0.3416920455607294,"score_spread":0.28335286200901955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398163937","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.0004399717,0.00011025128,0.988888,0.00038779926,0.000043700413,0.00056463433,0.000006697589,0.0017413794,0.007817541],"genre_scores_gemma":[0.4146906,0.0000029065766,0.58276206,0.0005144342,0.000028524797,0.000114228846,0.000013636656,0.000010782401,0.0018628454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874043,0.000064899454,0.00023171165,0.00047437334,0.00023697708,0.0002515836],"domain_scores_gemma":[0.9990633,0.00040057933,0.000031627755,0.00035493876,0.00006889924,0.00008066501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004777319,0.00013592353,0.0001554288,0.00016492135,0.000091946094,0.0003896325,0.0005705317,0.00007708474,0.000011796131],"category_scores_gemma":[0.00004977431,0.00010595716,0.000108836095,0.00035006524,0.000018235563,0.00044183663,0.00014552342,0.00015757741,0.000011431973],"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.00001504967,0.00012360446,0.000016089265,0.000040573843,0.00001782877,0.0000015604312,0.0005228814,0.018162958,0.030757083,0.92315704,0.013544528,0.013640819],"study_design_scores_gemma":[0.00022359118,0.000054273936,0.0000037178154,0.000008009603,0.0000030777724,0.0000023400157,0.0000054425254,0.95414394,0.03232158,0.008628305,0.0044587236,0.0001469924],"about_ca_topic_score_codex":0.000016240592,"about_ca_topic_score_gemma":0.00000219835,"teacher_disagreement_score":0.935981,"about_ca_system_score_codex":0.000034269102,"about_ca_system_score_gemma":0.000094245195,"threshold_uncertainty_score":0.43208075},"labels":[],"label_agreement":null},{"id":"W4399304331","doi":"10.1145/3650200.3656619","title":"Sylva: Sparse Embedded Adapters via Hierarchical Approximate Second-Order Information","year":2024,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Vector Institute; University of Toronto","funders":"","keywords":"Computer science; Order (exchange); Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.011865474103435804,"score_gpt":0.24927441090615404,"score_spread":0.23740893680271824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399304331","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.001784894,0.000023740844,0.950472,0.0019739117,0.00023642312,0.00020895553,0.000002012455,0.0019296262,0.043368425],"genre_scores_gemma":[0.6338326,0.000007774755,0.36074883,0.003779216,0.000046368536,0.00005666003,0.000020652971,0.000012089045,0.001495849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989417,0.000056667795,0.0002932447,0.00022876219,0.0002681141,0.00021151491],"domain_scores_gemma":[0.9993546,0.000061578015,0.00003695194,0.00038937287,0.00007142452,0.00008608476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037987658,0.00013316363,0.000114129885,0.00025636982,0.00006108332,0.00068233925,0.0004537944,0.000088277055,0.0002486179],"category_scores_gemma":[0.000017257093,0.00011208344,0.000057661826,0.00051014684,0.000037241505,0.0027483758,0.00018002326,0.00024089291,0.00050984096],"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.0000050407725,0.000025000152,0.0000043849423,0.000057156452,0.00002317294,0.000007905618,0.004547826,0.0000934487,0.00047389927,0.86009306,0.017428158,0.11724093],"study_design_scores_gemma":[0.00013509537,0.000068685404,0.00005677172,0.000024232031,0.0000037764153,0.000043220552,0.00004769753,0.874053,0.0067836964,0.027244374,0.09128475,0.00025467208],"about_ca_topic_score_codex":0.000007762062,"about_ca_topic_score_gemma":0.0000065392205,"teacher_disagreement_score":0.8739596,"about_ca_system_score_codex":0.000033284723,"about_ca_system_score_gemma":0.00009228859,"threshold_uncertainty_score":0.6579813},"labels":[],"label_agreement":null},{"id":"W4399568601","doi":"10.1109/tmlcn.2024.3413669","title":"Deep Conditional Generative Adversarial Networks for Efficient Channel Estimation in AmBC Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Machine Learning in Communications and Networking","topic":"Blind Source Separation Techniques","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":"Huawei Technologies (Canada); University of Alberta","funders":"Huawei Technologies","keywords":"Adversarial system; Generative grammar; Computer science; Artificial intelligence; Channel (broadcasting); Generative adversarial network; Deep learning; Computer network","score_opus":0.026365614596337825,"score_gpt":0.2953677246895106,"score_spread":0.26900211009317276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399568601","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.00033040292,0.0028615987,0.99439734,0.0010281842,0.00046276482,0.0004901456,0.0000044745434,0.00028767742,0.0001374349],"genre_scores_gemma":[0.97241354,0.0007923209,0.026154613,0.00008940932,0.000052558044,0.00039486995,0.000046444784,0.000017531233,0.00003870119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862134,0.00039042672,0.00035367036,0.00030738197,0.00012625352,0.00020093298],"domain_scores_gemma":[0.99849695,0.00097031734,0.0000744467,0.00037519608,0.00004364855,0.000039447197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089918944,0.00014774888,0.0001685199,0.0004135686,0.00040782246,0.0003082118,0.0003644408,0.00010563852,0.000001627472],"category_scores_gemma":[0.0000061278884,0.00015602642,0.000055166885,0.0006328216,0.000058480477,0.0002348762,0.0000140697175,0.00072220917,0.0000017465873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000100519665,0.000059472208,0.0000108018185,0.000011750536,0.000013240212,9.4313845e-7,0.0010248758,0.9535704,0.000010071517,0.012652882,0.00000832504,0.032627188],"study_design_scores_gemma":[0.00031720003,0.000087876855,0.00003584724,0.00019627572,0.0000083958985,0.000009119794,0.00004326796,0.9967916,0.000015631373,0.0008975619,0.001447543,0.00014966523],"about_ca_topic_score_codex":0.00009938392,"about_ca_topic_score_gemma":0.00027790113,"teacher_disagreement_score":0.97208315,"about_ca_system_score_codex":0.000115616116,"about_ca_system_score_gemma":0.000046545807,"threshold_uncertainty_score":0.6362573},"labels":[],"label_agreement":null},{"id":"W4400041205","doi":"10.18280/ts.410341","title":"A Spectral Graph Fractional Stockwell Transform for Signal Analysis","year":2024,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Graph; Spectral analysis; Mathematics; Computer science; Algorithm; Artificial intelligence; Pattern recognition (psychology); Discrete mathematics; Physics","score_opus":0.017974381069752205,"score_gpt":0.27760109610366324,"score_spread":0.25962671503391105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400041205","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.0038461767,0.00013404634,0.9897493,0.0028936209,0.00011683265,0.0005391269,0.000045732522,0.0007356317,0.0019395101],"genre_scores_gemma":[0.95567065,0.000010733334,0.042927936,0.00057909155,0.00019710937,0.00022213414,0.00005768392,0.000016317708,0.0003183319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820465,0.0000561241,0.00038575253,0.0005252248,0.00050028256,0.00032795884],"domain_scores_gemma":[0.9993524,0.0001945924,0.000053986172,0.00020442226,0.000081523445,0.000113060756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006614366,0.00020679433,0.0002296119,0.0006723733,0.0001496834,0.0004623567,0.00048330394,0.00007938881,0.00066834834],"category_scores_gemma":[0.0000028193685,0.00019159733,0.00051979657,0.0012143626,0.000040715637,0.0007658178,0.00002583404,0.00018998414,0.000029072284],"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.00013625648,0.0006344821,0.00018953189,0.00013327917,0.002712743,0.000045464432,0.0051395786,0.01950639,0.007863608,0.85473627,0.021754691,0.087147735],"study_design_scores_gemma":[0.00065504154,0.0006818116,0.0013519528,0.00003156794,0.0004447843,0.00001774065,0.000061526254,0.8481166,0.024209978,0.069660015,0.054200068,0.000568963],"about_ca_topic_score_codex":0.000019188687,"about_ca_topic_score_gemma":0.000035989193,"teacher_disagreement_score":0.9518245,"about_ca_system_score_codex":0.00008161619,"about_ca_system_score_gemma":0.00012934988,"threshold_uncertainty_score":0.7813112},"labels":[],"label_agreement":null},{"id":"W4401136337","doi":"10.18280/mmep.110713","title":"Advanced Low-Pass Filters for Signal Processing: A Comparative Study on Gaussian, Mittag-Leffler, and Savitzky-Golay Filters","year":2024,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Binary Golay code; Signal processing; Gaussian; Mathematics; SIGNAL (programming language); Algorithm; Computer science; Statistics; Physics; Digital signal processing; Computer hardware","score_opus":0.04101809788508299,"score_gpt":0.2811568450225041,"score_spread":0.24013874713742112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401136337","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.02188482,0.0002740344,0.9758222,0.00036359334,0.000041949974,0.0008076777,0.000003218667,0.0006406156,0.00016188454],"genre_scores_gemma":[0.81236446,0.000008766234,0.18718144,0.00003566677,0.000019784748,0.000268742,0.0000017918361,0.000024478959,0.000094874595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986776,0.000024394983,0.000318222,0.0004931972,0.00020749308,0.00027908763],"domain_scores_gemma":[0.99930215,0.0003059252,0.00004002443,0.00019224895,0.000039831535,0.00011979432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040915012,0.0002539024,0.0003094778,0.0001628871,0.000096981465,0.00050692045,0.0001985437,0.00006839533,0.0000012883892],"category_scores_gemma":[0.000010542354,0.00021068746,0.000048918286,0.00019706474,0.00003231244,0.00039468502,0.00006532778,0.0002284375,0.000003758391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001976312,0.00029750672,0.0000019021597,0.0018729971,0.00007422498,0.000007978811,0.029644681,0.8870255,0.0014955795,0.06988,0.000101560465,0.009578303],"study_design_scores_gemma":[0.00025989514,0.0003780598,0.0000032713608,0.0007914978,0.0000150010155,0.000008235748,0.00013476811,0.98037183,0.00082788686,0.016682317,0.00027421146,0.00025301042],"about_ca_topic_score_codex":0.0000011399603,"about_ca_topic_score_gemma":1.9074066e-7,"teacher_disagreement_score":0.79047966,"about_ca_system_score_codex":0.000024860057,"about_ca_system_score_gemma":0.00002101625,"threshold_uncertainty_score":0.8591585},"labels":[],"label_agreement":null},{"id":"W4402475581","doi":"10.1109/ccece59415.2024.10667336","title":"Multimode Fiber Image Transmission via Cross-Modal Knowledge distillation","year":2024,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McGill University","funders":"","keywords":"Multi-mode optical fiber; Modal; Distillation; Transmission (telecommunications); Modal dispersion; Computer science; Fiber; Materials science; Optical fiber; Graded-index fiber; Fiber optic sensor; Telecommunications; Composite material; Chemistry","score_opus":0.012756796458256718,"score_gpt":0.3305143425255577,"score_spread":0.317757546067301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402475581","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.0027582627,0.00017953347,0.94386476,0.0006272039,0.00012449584,0.00014417857,0.000001354744,0.0016896785,0.05061052],"genre_scores_gemma":[0.7451761,0.0000070150013,0.24482477,0.0000720749,0.000053150987,0.000014375394,0.0000066984985,0.000013267264,0.009832584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990745,0.00005394206,0.0001971255,0.000361055,0.00015955893,0.0001538148],"domain_scores_gemma":[0.9994678,0.000077724624,0.000018046152,0.00028815,0.000074597505,0.00007367448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026551046,0.00011793244,0.00008748614,0.000116091884,0.00008524835,0.00060087326,0.00031237432,0.000082385486,0.0002809345],"category_scores_gemma":[0.0000068941054,0.000094822164,0.00007806257,0.00030866652,0.00003731417,0.001069939,0.00007478088,0.0001315282,0.000715614],"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.000007647481,0.00010273305,0.000041417017,0.00007909993,0.00001486909,0.000011215058,0.0047944086,0.00021411366,0.022634292,0.081985965,0.007345107,0.8827691],"study_design_scores_gemma":[0.000088274435,0.000028494625,0.00075819757,0.000026675709,0.0000023732464,0.0000078206,0.0000020567165,0.8812189,0.03322468,0.00643108,0.07805865,0.00015276246],"about_ca_topic_score_codex":0.000027767635,"about_ca_topic_score_gemma":0.0000048578804,"teacher_disagreement_score":0.8826164,"about_ca_system_score_codex":0.000039487186,"about_ca_system_score_gemma":0.000055765984,"threshold_uncertainty_score":0.9198009},"labels":[],"label_agreement":null},{"id":"W4402726381","doi":"10.26434/chemrxiv-2024-7mnqb","title":"Nano Trees: Nanopore signal processing and sublevel fitting using Decision Trees","year":2024,"lang":"en","type":"preprint","venue":"ChemRxiv","topic":"Blind Source Separation Techniques","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":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decision tree; Nanopore; SIGNAL (programming language); Nano-; Signal processing; Computer science; Decision system; Algorithm; Artificial intelligence; Materials science; Mathematics; Nanotechnology; Operations research; Computer hardware; Digital signal processing; Composite material","score_opus":0.04600445717730381,"score_gpt":0.3112047490734716,"score_spread":0.2652002918961678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402726381","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.38585266,0.002700204,0.60856426,0.0003899871,0.0002377304,0.00031532047,0.0000019059365,0.00096892635,0.00096898776],"genre_scores_gemma":[0.76009387,0.000040269904,0.23933466,0.00013273598,0.0001351187,0.000025556372,0.0000063874427,0.000039745668,0.00019167832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975006,0.00006330506,0.0005344529,0.0011148615,0.0004501574,0.0003366036],"domain_scores_gemma":[0.99864036,0.00013444836,0.00029810506,0.000629143,0.00017617136,0.000121763456],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00081696716,0.00040780916,0.00041464288,0.0003613004,0.00021712857,0.0014260089,0.0009342359,0.00043278877,0.000010327464],"category_scores_gemma":[0.00005879737,0.00038043535,0.00013658014,0.00043355947,0.00009549018,0.0003678499,0.0027548023,0.000767029,0.000009359905],"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.000025549834,0.00016931491,0.0006544361,0.0013473199,0.000106488355,0.00012521901,0.016309677,0.0018159114,0.099591136,0.007050801,0.0017125723,0.87109154],"study_design_scores_gemma":[0.00028930805,0.000053962212,0.00033824754,0.0039023454,0.00006377228,0.00008774778,0.00017675436,0.71952635,0.15647537,0.11667364,0.001352298,0.0010602272],"about_ca_topic_score_codex":0.000030325456,"about_ca_topic_score_gemma":0.000016462174,"teacher_disagreement_score":0.87003136,"about_ca_system_score_codex":0.00011243274,"about_ca_system_score_gemma":0.00048922974,"threshold_uncertainty_score":0.99986476},"labels":[],"label_agreement":null},{"id":"W4402752632","doi":"10.54254/2753-8818/52/2024ch0119","title":"From FFT to sparse FFT: Innovations in efficient signal processing for large sparse data","year":2024,"lang":"en","type":"article","venue":"Theoretical and Natural Science","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fast Fourier transform; Computer science; Signal processing; SIGNAL (programming language); Algorithm; Digital signal processing; Computer hardware","score_opus":0.024091796542876527,"score_gpt":0.32683764105189167,"score_spread":0.30274584450901515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402752632","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.1306562,0.0002767148,0.86026114,0.0076725464,0.00016048577,0.00034706862,0.000043060307,0.0002152501,0.00036751278],"genre_scores_gemma":[0.9133006,0.0000022989202,0.08578412,0.0008095605,0.000053325228,0.000015360063,0.000010711727,0.0000041736002,0.000019870611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838203,0.000033665434,0.00021106335,0.0006798215,0.00035168367,0.00034171945],"domain_scores_gemma":[0.99918556,0.00022237893,0.000022938466,0.00035984037,0.00009785732,0.00011142516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018110345,0.00010548945,0.000114989925,0.00024685333,0.00018780153,0.000624643,0.0012287436,0.000041443443,0.000014834015],"category_scores_gemma":[0.00021939978,0.000077156605,0.000014334843,0.0020307705,0.0003931317,0.00067943777,0.000848378,0.00019834848,0.000011407745],"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.000007517669,0.000029314366,0.000010944456,0.0000069278676,8.2096886e-7,0.00000300975,0.0009588779,0.000010008498,0.006219809,0.9686964,0.00015235212,0.023904],"study_design_scores_gemma":[0.000089066496,0.000039976545,0.00039872542,0.00008141849,0.0000025171948,0.0000035618693,0.000033824177,0.866409,0.0028751548,0.1279648,0.0019736618,0.00012832032],"about_ca_topic_score_codex":0.000012253258,"about_ca_topic_score_gemma":0.000008961218,"teacher_disagreement_score":0.866399,"about_ca_system_score_codex":0.0000336041,"about_ca_system_score_gemma":0.00022558986,"threshold_uncertainty_score":0.6023447},"labels":[],"label_agreement":null},{"id":"W4403094473","doi":"10.1109/jsen.2024.3469548","title":"On Multichannel Coherent-to-Diffuse Power Ratio Estimation","year":2024,"lang":"en","type":"article","venue":"IEEE Sensors Journal","topic":"Blind Source Separation 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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"National Natural Science Foundation of China","keywords":"Estimation; Computer science; Physics; Electronic engineering; Engineering","score_opus":0.01730538845155581,"score_gpt":0.29328749722119335,"score_spread":0.2759821087696375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403094473","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.15843442,0.000032690405,0.8350394,0.0033828742,0.0014460508,0.00016955186,0.0000017902806,0.00046454315,0.0010286834],"genre_scores_gemma":[0.9448106,0.00000802717,0.05270299,0.0013103781,0.00013967024,0.00000730054,7.279026e-7,0.000020096584,0.0010001586],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985867,0.00015077302,0.00030558478,0.00027444938,0.0004483413,0.00023414019],"domain_scores_gemma":[0.99915016,0.00016661092,0.00007150247,0.00029331428,0.00012535608,0.00019305198],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005273676,0.0001559074,0.00012965643,0.00040779813,0.0001558376,0.0010760095,0.0003968483,0.00007518326,0.00005630552],"category_scores_gemma":[0.00010706309,0.00013241956,0.00009210983,0.00037404767,0.000018259274,0.00062076777,0.000033248623,0.00043639512,0.0007007553],"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.00010264205,0.0007399687,0.000019984393,0.00005184511,0.00021013053,0.0009971085,0.038788233,0.22168773,0.056484964,0.22310716,0.38122994,0.07658031],"study_design_scores_gemma":[0.00036515642,0.00038765476,0.00011891873,0.00018941572,0.000008708818,0.00044782241,0.000043304168,0.93304193,0.04544348,0.01358021,0.0060590296,0.0003143612],"about_ca_topic_score_codex":0.0000028048687,"about_ca_topic_score_gemma":0.0000015864783,"teacher_disagreement_score":0.78637624,"about_ca_system_score_codex":0.000098125936,"about_ca_system_score_gemma":0.00008594602,"threshold_uncertainty_score":0.99996096},"labels":[],"label_agreement":null},{"id":"W4403272525","doi":"10.3397/in_2024_4247","title":"A positive semi definite tensor factorization method for separation of non stationary noise sources","year":2024,"lang":"en","type":"article","venue":"NOISE-CON proceedings","topic":"Blind Source Separation 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":"Safran Electronics (Canada)","funders":"","keywords":"Separation (statistics); Mathematics; Positive-definite matrix; Noise (video); Factorization; Tensor (intrinsic definition); Applied mathematics; Mathematical analysis; Computer science; Physics; Algorithm; Pure mathematics; Artificial intelligence; Statistics; Image (mathematics)","score_opus":0.017922420168228526,"score_gpt":0.3206183988778091,"score_spread":0.30269597870958054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403272525","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.048004895,0.00009435365,0.9473134,0.0009903604,0.00015789799,0.0008277692,0.000047422094,0.00057556195,0.0019883388],"genre_scores_gemma":[0.71420515,0.000017697597,0.28448722,0.00042650237,0.000088249166,0.00020803676,0.00006216244,0.000031079402,0.00047389834],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843,0.000027897546,0.00045026763,0.0005428179,0.00032536546,0.00022365208],"domain_scores_gemma":[0.99847573,0.00032939226,0.00023392442,0.0001366052,0.0007529635,0.000071391936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006864415,0.00021163259,0.00024235436,0.00041217942,0.00011905316,0.00036309744,0.00034940804,0.00015733302,0.000007854271],"category_scores_gemma":[0.00014273972,0.00020395218,0.00011888767,0.0007344431,0.000036461628,0.0016647562,0.0000770945,0.00015322182,0.000013938674],"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.00012185913,0.0001541788,0.0012770746,0.0006731189,0.00012231836,0.0000018570036,0.041003894,0.00035005878,0.5075692,0.41734186,0.0069634956,0.024421094],"study_design_scores_gemma":[0.00043576016,0.0005585228,0.0032927513,0.00025460933,0.000059507216,0.000017249615,0.0003592646,0.48316342,0.47540006,0.030143531,0.005880736,0.00043457895],"about_ca_topic_score_codex":0.000023173741,"about_ca_topic_score_gemma":0.000001413221,"teacher_disagreement_score":0.6662002,"about_ca_system_score_codex":0.00007677965,"about_ca_system_score_gemma":0.00014459934,"threshold_uncertainty_score":0.8316929},"labels":[],"label_agreement":null},{"id":"W4403332825","doi":"10.1145/3686490.3686519","title":"MPSleepNet: Matrix Profile-Guided Transformer for Multi-Channel Sleep Classification","year":2024,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Winnipeg","funders":"","keywords":"Computer science; Transformer; Electronic engineering; Pattern recognition (psychology); Artificial intelligence; Electrical engineering; Engineering; Voltage","score_opus":0.0909814663963676,"score_gpt":0.36915886118372493,"score_spread":0.2781773947873573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403332825","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.00031609353,0.00014601702,0.98738515,0.004906828,0.00030305033,0.0009453077,0.000008832042,0.0019186002,0.0040701404],"genre_scores_gemma":[0.5058227,0.00002303517,0.48579147,0.0006957196,0.00008903799,0.0006247829,0.00003094802,0.00003120936,0.006891052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880016,0.000037329573,0.00030388543,0.0004422397,0.00018807373,0.00022832822],"domain_scores_gemma":[0.99935836,0.00007233779,0.0000350513,0.0003510182,0.0001164502,0.00006676854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046568154,0.0001438774,0.00012153647,0.00019728922,0.00008748419,0.00035119662,0.00045655062,0.00011417436,0.00003513235],"category_scores_gemma":[0.000018217608,0.00012091958,0.00011872832,0.00037510548,0.00002394337,0.00074774364,0.000023015413,0.00011184853,0.00016037378],"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.0000066977136,0.00010353645,0.0000050546582,0.00011344322,0.000037812802,0.0000019524625,0.0028259598,0.00014102474,0.0091877645,0.9202531,0.021228625,0.046095006],"study_design_scores_gemma":[0.00020785062,0.00006321895,0.000075400094,0.000015484233,0.000007452291,0.0000075305074,0.000036625574,0.9306143,0.038717393,0.0050125695,0.0250677,0.00017450195],"about_ca_topic_score_codex":0.000012413655,"about_ca_topic_score_gemma":0.0000097399325,"teacher_disagreement_score":0.93047327,"about_ca_system_score_codex":0.00004663742,"about_ca_system_score_gemma":0.00006849181,"threshold_uncertainty_score":0.49309576},"labels":[],"label_agreement":null},{"id":"W4404036645","doi":"10.1109/mwp62612.2024.10736264","title":"Programmable Temporal Processing of Optical Signals by Fully Reversible Talbot Sampling","year":2024,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Sampling (signal processing); Signal processing; Talbot effect; Computer vision; Digital signal processing; Optics; Computer hardware; Physics; Diffraction; Filter (signal processing)","score_opus":0.031466137302838454,"score_gpt":0.3108949782494088,"score_spread":0.2794288409465704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404036645","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.003963589,0.00049728603,0.9852152,0.0012167998,0.00004427851,0.00019219147,0.0000011737648,0.0009335806,0.00793589],"genre_scores_gemma":[0.5713212,0.00000373395,0.42713884,0.00011734471,0.000014568493,0.000013158074,0.0000033474994,0.000007754889,0.001380083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989173,0.000027520015,0.00026489035,0.00031328687,0.00027350543,0.00020348995],"domain_scores_gemma":[0.9995185,0.0000591228,0.000046663663,0.00021580905,0.000094763374,0.00006513839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000519621,0.00010131302,0.00013931382,0.00011192624,0.00005361365,0.00046791177,0.00041136425,0.0000682077,0.00003158924],"category_scores_gemma":[0.000021659074,0.00008641405,0.000056109155,0.00059774774,0.000048131806,0.00082532293,0.00014004677,0.00013292424,0.0000195616],"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.00002180356,0.00041805953,0.00050597324,0.00086078705,0.00007086225,0.000028064727,0.003071582,0.00045125588,0.15780234,0.39642042,0.051985145,0.38836372],"study_design_scores_gemma":[0.00021095522,0.00042316262,0.000018383105,0.00040096958,0.000016486509,0.000026234013,0.00010727195,0.30608815,0.57599056,0.021823743,0.094398834,0.00049528177],"about_ca_topic_score_codex":0.000034624172,"about_ca_topic_score_gemma":0.0000023048665,"teacher_disagreement_score":0.5673576,"about_ca_system_score_codex":0.00002370933,"about_ca_system_score_gemma":0.00017029943,"threshold_uncertainty_score":0.45120838},"labels":[],"label_agreement":null},{"id":"W4404355270","doi":"10.48550/arxiv.2411.02281","title":"Conformal-in-the-Loop for Learning with Imbalanced Noisy Data","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conformal map; Loop (graph theory); Computer science; Artificial intelligence; Machine learning; Mathematics; Mathematical analysis; Combinatorics","score_opus":0.106144363555274,"score_gpt":0.2305611787290219,"score_spread":0.1244168151737479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404355270","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.04182705,0.000047366535,0.9499073,0.0005824107,0.00015764787,0.00069335813,0.00002473439,0.00051958853,0.0062405113],"genre_scores_gemma":[0.9886411,0.00005375446,0.008637227,0.00030806908,0.000042287753,0.0000056112854,0.000103649465,0.000017743158,0.0021905636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839276,0.00011985914,0.00017014908,0.0009467869,0.000098997065,0.00027146243],"domain_scores_gemma":[0.9977909,0.00017254836,0.0001653958,0.0017214398,0.00009897726,0.000050789604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007752165,0.00022829302,0.00023452002,0.00024152682,0.00010622962,0.0003371825,0.0036368219,0.00017470523,0.0000038661983],"category_scores_gemma":[0.000030565006,0.00019593026,0.00007307579,0.0005317208,0.00007020701,0.00046186423,0.0027258382,0.00091274554,0.00003080196],"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.000076520344,0.00008444154,0.0007052479,0.00026916253,0.00010647441,0.00028134655,0.0024982984,0.10250575,0.000027044014,0.8891526,0.0026015374,0.0016915748],"study_design_scores_gemma":[0.00043845846,0.0001393416,0.00014530068,0.00016680693,0.000050557053,0.000011152805,0.00026074288,0.9499576,0.00014646367,0.038374577,0.009902092,0.00040692015],"about_ca_topic_score_codex":0.00006705356,"about_ca_topic_score_gemma":0.000107907275,"teacher_disagreement_score":0.94681406,"about_ca_system_score_codex":0.000070338116,"about_ca_system_score_gemma":0.00027171578,"threshold_uncertainty_score":0.7989804},"labels":[],"label_agreement":null},{"id":"W4405633994","doi":"10.1109/ipc60965.2024.10799897","title":"Longitudinal Power Monitoring in Low Accumulated Chromatic Dispersion Regime","year":2024,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Huawei Technologies (Canada)","funders":"","keywords":"Dispersion (optics); Power (physics); Optics; Physics; Materials science; Environmental science; Thermodynamics","score_opus":0.024776845232535795,"score_gpt":0.30599217484517105,"score_spread":0.28121532961263523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405633994","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5039178,0.00037532471,0.48481584,0.0017417349,0.00045927954,0.00019821091,2.1811523e-7,0.001705863,0.0067857355],"genre_scores_gemma":[0.9823345,0.00001539231,0.016748834,0.000051057363,0.000022743992,0.000008184374,6.2868145e-7,0.000007915598,0.0008107401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999133,0.000040992396,0.00017634107,0.00029091307,0.00019595315,0.00016281471],"domain_scores_gemma":[0.99954057,0.00006339911,0.000018160268,0.00031315407,0.00002262576,0.00004210339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026969315,0.000094387404,0.00009396853,0.00022574252,0.000030673087,0.0003353188,0.00036160808,0.000058907757,0.000045603338],"category_scores_gemma":[0.000017122526,0.00007924437,0.000040319792,0.00063281896,0.000013169758,0.00081797043,0.00014157812,0.00014768579,0.00015891904],"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.000040183797,0.0009592265,0.04732748,0.00074274855,0.00018514264,0.0017647422,0.036175117,0.0030737726,0.050781228,0.724842,0.02178444,0.11232391],"study_design_scores_gemma":[0.0004048388,0.00022820855,0.06900312,0.0015696976,0.000007520449,0.000073134084,0.00013389549,0.81673765,0.09667096,0.011140512,0.0032852222,0.00074524153],"about_ca_topic_score_codex":0.000033487187,"about_ca_topic_score_gemma":0.0000041194457,"teacher_disagreement_score":0.8136639,"about_ca_system_score_codex":0.00007504754,"about_ca_system_score_gemma":0.000038676135,"threshold_uncertainty_score":0.32334867},"labels":[],"label_agreement":null},{"id":"W4406038666","doi":"10.1007/978-3-031-68915-4_2","title":"Eigenvalues, Eigenvectors, and Correlation","year":2024,"lang":"en","type":"book-chapter","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Physics; Quantum mechanics","score_opus":0.015252934266882298,"score_gpt":0.23475271500356543,"score_spread":0.21949978073668314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406038666","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012448357,0.0011818862,0.3097346,0.00043428133,0.00022951748,0.00015109795,0.0000026982902,0.00085697905,0.6874077],"genre_scores_gemma":[0.0011425042,0.0003691501,0.024551254,0.00050858484,0.00008634803,0.000006232647,0.000019441233,0.000033969536,0.9732825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989651,0.000009788023,0.0002219853,0.00046007693,0.00023765498,0.00010542946],"domain_scores_gemma":[0.999339,0.000046098165,0.00007470562,0.00042561293,0.00004955006,0.000065060325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001995115,0.0002142963,0.0001733243,0.0002225107,0.000048167156,0.00027141982,0.00028926745,0.00027845948,0.00015785868],"category_scores_gemma":[0.000004655263,0.00019339166,0.0000657727,0.000037375503,0.000040693663,0.00023815328,0.00026582478,0.00031426846,0.00052426633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.2181435e-7,0.000001453733,0.0000016111127,0.000010989804,0.0000143649295,0.000005685795,0.0001446287,0.0000019766903,0.0000041438257,0.983462,0.008862006,0.007490858],"study_design_scores_gemma":[0.000024849665,0.000038626076,0.000009230581,0.000053861757,0.000013115277,0.000018773828,0.000001025413,0.007770749,0.000085134816,0.5104856,0.48127612,0.00022294575],"about_ca_topic_score_codex":0.000010757902,"about_ca_topic_score_gemma":0.000012241774,"teacher_disagreement_score":0.4729764,"about_ca_system_score_codex":0.000040838662,"about_ca_system_score_gemma":0.0000604879,"threshold_uncertainty_score":0.78862834},"labels":[],"label_agreement":null},{"id":"W4406038729","doi":"10.1007/978-3-031-68915-4_9","title":"Regularisation","year":2024,"lang":"en","type":"book-chapter","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Environmental science; Geology","score_opus":0.01871216948808242,"score_gpt":0.2450788694669857,"score_spread":0.2263666999789033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406038729","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.3379835e-8,0.000109213215,0.38596985,0.001407605,0.00012174476,0.00007127965,6.013236e-7,0.0009540011,0.6113657],"genre_scores_gemma":[0.0001484341,0.000034138895,0.04457609,0.000745278,0.000065047614,0.0000047332974,0.000008169356,0.000018873332,0.9543992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925137,0.0000043663326,0.00015675413,0.0003070037,0.00021422953,0.000066254055],"domain_scores_gemma":[0.9993362,0.000018412176,0.00005124061,0.0005151441,0.00004934816,0.000029652994],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015589193,0.00013064429,0.000106899286,0.00017214532,0.000020510388,0.00023197288,0.00040531802,0.00021005516,0.00019878351],"category_scores_gemma":[0.0000024957717,0.000116617775,0.00007818967,0.000025765801,0.000016806001,0.00017949098,0.00018960373,0.00022087363,0.001643541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.0263515e-7,8.73667e-7,2.005397e-8,0.000005381937,0.0000071667914,0.000003843905,0.00006709913,5.2383564e-7,0.0000051761454,0.9632321,0.028888257,0.007789463],"study_design_scores_gemma":[0.000006868049,0.000010115506,2.9865177e-7,0.000020614214,0.0000027390467,0.000003870634,2.3152377e-7,0.001021684,0.00017823988,0.51722795,0.4814465,0.00008088022],"about_ca_topic_score_codex":0.0000026179157,"about_ca_topic_score_gemma":0.000004445271,"teacher_disagreement_score":0.45255825,"about_ca_system_score_codex":0.000037715028,"about_ca_system_score_gemma":0.000052477604,"threshold_uncertainty_score":0.99913377},"labels":[],"label_agreement":null},{"id":"W4406266549","doi":"10.1109/vtc2024-fall63153.2024.10757482","title":"Joint Estimation of Direct and RIS-assisted Channels with Tensor Signal Modelling","year":2024,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"McGill University","funders":"","keywords":"Joint (building); Tensor (intrinsic definition); Computer science; SIGNAL (programming language); Engineering; Mathematics","score_opus":0.03312973750023578,"score_gpt":0.2535418413137359,"score_spread":0.22041210381350013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406266549","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.01803869,0.0000941903,0.9778126,0.00043414597,0.000021939439,0.00010679247,6.365746e-7,0.0004524888,0.0030385177],"genre_scores_gemma":[0.7192786,0.0000056436647,0.2804308,0.000050947987,0.000005973973,0.000007044328,7.7749553e-7,0.0000040713567,0.00021616358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994302,0.000029891951,0.00013598341,0.00018772548,0.00014270726,0.00007352401],"domain_scores_gemma":[0.99970996,0.000049133385,0.000031831023,0.00013569981,0.000049102244,0.000024292032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022858454,0.000067212095,0.00009903062,0.00012215624,0.00002928067,0.0001526881,0.000090924186,0.000029996649,0.0000064755363],"category_scores_gemma":[0.0000033678805,0.000047480364,0.000018533645,0.0002251464,0.000023587252,0.00036147085,0.000039495655,0.00005484512,0.000003019703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021757023,0.00012696486,0.00002819972,0.00030588932,0.00009946812,0.00003023155,0.0069173453,0.56117964,0.0080409665,0.24204312,0.001193263,0.18001315],"study_design_scores_gemma":[0.00004205613,0.00008781155,0.00003597477,0.00007636656,0.0000043616205,0.000013249758,0.000010341529,0.9489049,0.048415646,0.0022684508,0.00007630718,0.00006456276],"about_ca_topic_score_codex":0.00003280974,"about_ca_topic_score_gemma":0.0000016787639,"teacher_disagreement_score":0.7012399,"about_ca_system_score_codex":0.000009804166,"about_ca_system_score_gemma":0.000031484633,"threshold_uncertainty_score":0.1936193},"labels":[],"label_agreement":null},{"id":"W4406480091","doi":"10.1007/s10472-025-09966-w","title":"Energy disaggregation via Bayesian non-negative matrix factorization with sum-to-k constraint","year":2025,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Constraint (computer-aided design); Complex system; Factorization; Bayesian probability; Matrix (chemical analysis); Matrix decomposition; Bayesian network; Mathematics; Applied mathematics; Energy (signal processing); Mathematical optimization; Computer science; Algebra over a field; Algorithm; Artificial intelligence; Pure mathematics; Physics; Statistics; Quantum mechanics; Materials science","score_opus":0.04203839224597804,"score_gpt":0.33405096524878636,"score_spread":0.2920125730028083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406480091","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.0062196082,0.000017355705,0.990406,0.0021249568,0.0000387863,0.0001942882,0.0000034979093,0.000059308968,0.0009362371],"genre_scores_gemma":[0.8769172,0.000034102326,0.12264159,0.00031750675,0.00000966662,0.000015867265,0.0000018415531,0.0000051722254,0.000057040157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990176,0.000030494406,0.00039679187,0.00022739798,0.0001886996,0.00013904924],"domain_scores_gemma":[0.9990041,0.0001990382,0.00018518901,0.0002598844,0.0002906212,0.00006114274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031038307,0.000126049,0.00019055294,0.00019009694,0.000082915816,0.00013202893,0.0002657245,0.000054583445,0.0000063103707],"category_scores_gemma":[0.00008057644,0.000106026855,0.00003235016,0.0005086035,0.00010132915,0.00023989007,0.00008346636,0.000059224083,0.000002964313],"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.000006349036,0.00010476187,0.000018709023,0.00003584659,0.000016909531,7.4020244e-7,0.002646333,0.00021560937,0.0022069279,0.9127346,0.000047075086,0.08196611],"study_design_scores_gemma":[0.000010773175,0.00011939021,0.000022188653,0.00014327081,0.000004042426,0.000001275389,0.00028497106,0.14350374,0.44723034,0.40852025,0.00005882518,0.00010092005],"about_ca_topic_score_codex":0.00005713018,"about_ca_topic_score_gemma":0.000056705652,"teacher_disagreement_score":0.8706976,"about_ca_system_score_codex":0.0000069697103,"about_ca_system_score_gemma":0.0000571892,"threshold_uncertainty_score":0.43236497},"labels":[],"label_agreement":null},{"id":"W4406543021","doi":"10.1016/0967-0653(95)99258-s","title":"10.1016/0967-0653(95)99258-s","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Environmental science; Climatology; Geology","score_opus":0.008009270783592278,"score_gpt":0.19451417747201524,"score_spread":0.18650490668842296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406543021","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049069295,0.000033099197,0.002832856,0.0010511028,0.0000015273653,0.00017956554,0.000002294626,0.00093018764,0.9949203],"genre_scores_gemma":[0.0001256575,2.632361e-7,0.011568506,0.00033694843,0.00005500704,0.000025966936,0.000004326166,0.000013160369,0.98787016],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989522,0.00007298652,0.00018197192,0.0003142314,0.0002398876,0.00023870074],"domain_scores_gemma":[0.999119,0.000042741372,0.00003258939,0.0006176657,0.000054280703,0.00013376694],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00026195016,0.00012748333,0.00013167401,0.00008230914,0.00007916395,0.00018093694,0.00084414484,0.00006730706,0.9758756],"category_scores_gemma":[0.000020065016,0.0001272916,0.00005380745,0.00039394587,0.000022334643,0.0003737697,0.000116750576,0.00011752575,0.9945317],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052469177,0.000029997613,1.9666883e-8,0.0000011926643,0.0000038988906,0.0000027247015,0.000071819755,0.000045372155,0.000023652698,0.0001372995,0.32457006,0.67510873],"study_design_scores_gemma":[0.00008302248,0.00011306372,0.000008081469,0.000007633589,0.000002152746,0.000008031367,2.6400005e-7,0.0034268214,0.00091203285,0.00019383764,0.99507725,0.00016778037],"about_ca_topic_score_codex":0.000013563966,"about_ca_topic_score_gemma":1.6606934e-7,"teacher_disagreement_score":0.67494094,"about_ca_system_score_codex":0.000028483575,"about_ca_system_score_gemma":0.000040261068,"threshold_uncertainty_score":0.51908004},"labels":[],"label_agreement":null},{"id":"W4408197111","doi":"10.1016/j.neuroimage.2026.122030","title":"Common but different: An ERP study of single- and multi-source interference processing in MSIT","year":2025,"lang":"en","type":"preprint","venue":"NeuroImage","topic":"Blind Source Separation 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":"McGill University Health Centre","funders":"Narodowe Centrum Nauki; Fundacja na rzecz Nauki Polskiej","keywords":"Interference (communication); Computer science; Telecommunications","score_opus":0.06581982928564543,"score_gpt":0.32800920172175213,"score_spread":0.2621893724361067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408197111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7712358,0.00006698064,0.22727695,0.000087809465,0.000082502665,0.0006235081,0.0000061456485,0.00028032975,0.0003399686],"genre_scores_gemma":[0.9899608,0.0000104520595,0.009617004,0.00016805546,0.000011143029,0.000044548317,0.0000052233445,0.000015584888,0.00016721514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975299,0.00053011643,0.0005569091,0.00091091776,0.0002632766,0.00020883576],"domain_scores_gemma":[0.99835503,0.00008634961,0.000335238,0.0010494353,0.00010592227,0.00006802916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028576585,0.0003198718,0.0005282062,0.00045148752,0.00006225288,0.00041532534,0.0014197368,0.00015907656,0.0000012725233],"category_scores_gemma":[0.000061067396,0.00031903145,0.000041767344,0.00026251018,0.000074593154,0.00036577196,0.0029290137,0.00083846546,4.4660655e-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.00018353843,0.01869187,0.14278479,0.0023536992,0.000052931704,0.00020251608,0.13990434,0.0017089703,0.06230268,0.0010172848,0.000080093734,0.6307173],"study_design_scores_gemma":[0.002327695,0.0021709239,0.30391642,0.0016774042,0.000056259985,0.000018922223,0.0012281673,0.65963036,0.025624244,0.0020442845,0.00007806933,0.0012272372],"about_ca_topic_score_codex":0.00031220028,"about_ca_topic_score_gemma":0.00062540127,"teacher_disagreement_score":0.65792143,"about_ca_system_score_codex":0.00003996481,"about_ca_system_score_gemma":0.00006618323,"threshold_uncertainty_score":0.99992615},"labels":[],"label_agreement":null},{"id":"W4408358675","doi":"10.1109/vcc63113.2024.10914398","title":"Advancing Spectrum Management with Machine Learning: A System Identification Case Study","year":2024,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Communications Research Centre Canada","funders":"","keywords":"Identification (biology); Computer science; Artificial intelligence; Machine learning","score_opus":0.008513144749548915,"score_gpt":0.26351333478850075,"score_spread":0.25500019003895186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408358675","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.037615925,0.000062109095,0.95231086,0.00046946347,0.00009181935,0.0005350355,1.9770977e-7,0.002637423,0.0062771784],"genre_scores_gemma":[0.97377664,0.000002715943,0.022929024,0.000031032087,0.00001474673,0.000066806795,0.0000010936384,0.000011162375,0.0031668092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895257,0.00010230264,0.00019018959,0.0003843601,0.00023702758,0.00013354821],"domain_scores_gemma":[0.99948364,0.00002735729,0.000040156945,0.00038454964,0.000023851124,0.000040456718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066417735,0.000098614386,0.00008333558,0.0002178087,0.000117490985,0.0005962169,0.00024222612,0.000015491107,0.000006919759],"category_scores_gemma":[0.000002271773,0.00007472143,0.000021428748,0.0005314848,0.0000073427595,0.00048518402,0.00012604278,0.00012915304,0.00006388056],"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.000010179339,0.00034241885,0.0017762461,0.00042996963,0.0002190753,0.023916103,0.014813288,0.0024634744,0.0001699384,0.9185683,0.0006838432,0.036607135],"study_design_scores_gemma":[0.00029569777,0.000550101,0.0003054944,0.00011958602,0.00004629444,0.0045937668,0.011232347,0.9750993,0.002037272,0.00045694166,0.004929946,0.00033320714],"about_ca_topic_score_codex":0.00017611992,"about_ca_topic_score_gemma":0.00023119262,"teacher_disagreement_score":0.97263587,"about_ca_system_score_codex":0.000087555425,"about_ca_system_score_gemma":0.000016869255,"threshold_uncertainty_score":0.5749333},"labels":[],"label_agreement":null},{"id":"W4409406851","doi":"10.1155/atr/9961530","title":"Multitask Vehicle Signal Recognition With Dual‐Speed Adaptive Weighting","year":2025,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Weighting; Computer science; Dual (grammatical number); SIGNAL (programming language); Artificial intelligence; Pattern recognition (psychology); Speech recognition; Automotive engineering; Real-time computing; Engineering; Acoustics","score_opus":0.01304080178987277,"score_gpt":0.25576439752543334,"score_spread":0.24272359573556057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409406851","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.3651029,0.00005081664,0.6337919,0.00048576266,0.00008946063,0.00011544518,0.0000024709796,0.00006444144,0.0002967681],"genre_scores_gemma":[0.77298236,0.000020390318,0.22672267,0.00020898438,0.00002272366,0.0000027320477,0.0000054929046,0.000005193881,0.000029444727],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99898076,0.00005494169,0.00043012726,0.00014705471,0.00027468335,0.00011241694],"domain_scores_gemma":[0.9987925,0.00009475785,0.00042922093,0.00010204265,0.0005365701,0.000044859087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028466454,0.00010071743,0.00016213504,0.00024101268,0.00007362525,0.00004733323,0.00016198159,0.00004685652,0.000006255077],"category_scores_gemma":[0.000012888877,0.0000854291,0.00006433914,0.0004507046,0.000023716459,0.0014396087,0.0000029430566,0.0002152565,0.0000021110093],"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.0022639502,0.00078013964,0.0028985299,0.000119634344,0.00038951356,0.00032449045,0.019042874,0.13614395,0.18891591,0.053930912,0.00044048476,0.5947496],"study_design_scores_gemma":[0.011800512,0.003648676,0.1612125,0.0018119493,0.00022853709,0.00007671552,0.0031726155,0.020407686,0.72953403,0.06449349,0.00267434,0.00093895907],"about_ca_topic_score_codex":0.000004104475,"about_ca_topic_score_gemma":0.00002484093,"teacher_disagreement_score":0.5938106,"about_ca_system_score_codex":0.00004523944,"about_ca_system_score_gemma":0.00011918669,"threshold_uncertainty_score":0.34836978},"labels":[],"label_agreement":null},{"id":"W4409640669","doi":"10.1109/jsen.2025.3560989","title":"New Semidefinite Programming Joint Localization and Synchronization Using Sequential One-Way TOAs and Doppler Shifts","year":2025,"lang":"en","type":"article","venue":"IEEE Sensors Journal","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":"NovAtel (Canada)","funders":"National Natural Science Foundation of China","keywords":"Semidefinite programming; Synchronization (alternating current); Joint (building); Doppler effect; Computer science; Mathematical optimization; Algorithm; Mathematics; Telecommunications; Engineering; Physics","score_opus":0.03675657090898065,"score_gpt":0.2868205562187436,"score_spread":0.2500639853097629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409640669","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.07936004,0.00025467723,0.91892284,0.00074276613,0.0002748658,0.00016006212,4.5350666e-7,0.00013120851,0.00015309644],"genre_scores_gemma":[0.76280093,0.0001654883,0.2362512,0.00046854166,0.00015899079,0.0000014211932,0.0000015848376,0.00001314244,0.0001386935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987373,0.00016923009,0.00036338114,0.00026297139,0.00025333214,0.00021382942],"domain_scores_gemma":[0.9993082,0.000037842387,0.00019512622,0.00016467384,0.00016213443,0.00013197427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005015148,0.00014143305,0.00016875917,0.0003233981,0.0003219423,0.0009238264,0.00013752353,0.00010608263,0.00000778122],"category_scores_gemma":[0.000053171334,0.00014253835,0.00003539789,0.00043382152,0.000046549812,0.0007362619,0.00008239967,0.00024865783,0.0000014212833],"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.00011850565,0.0003119782,0.013312367,0.00041617156,0.0004890467,0.00019708223,0.024240162,0.09387634,0.06376201,0.11186361,0.012816433,0.6785963],"study_design_scores_gemma":[0.0014981134,0.00019192198,0.0020252925,0.00081606174,0.00010066778,0.0011293818,0.00020250364,0.9220074,0.046594508,0.019709704,0.005073471,0.00065096305],"about_ca_topic_score_codex":0.00005386968,"about_ca_topic_score_gemma":0.000014917022,"teacher_disagreement_score":0.8281311,"about_ca_system_score_codex":0.00009343164,"about_ca_system_score_gemma":0.00020143288,"threshold_uncertainty_score":0.8908479},"labels":[],"label_agreement":null},{"id":"W4410086776","doi":"10.1016/j.bspc.2025.107947","title":"Non-Gaussian modeling of sleep EEG based on a skewed scale mixture structure and its application to sleep stage analysis","year":2025,"lang":"en","type":"article","venue":"Biomedical Signal Processing and Control","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":2,"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":"Japan Society for the Promotion of Science","keywords":"Electroencephalography; Sleep (system call); Computer science; Scale (ratio); Stage (stratigraphy); Gaussian; Artificial intelligence; Pattern recognition (psychology); Psychology; Cartography; Neuroscience; Geology; Physics; Geography","score_opus":0.00457331780275932,"score_gpt":0.2472928043685265,"score_spread":0.24271948656576717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410086776","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.020183083,0.0001887725,0.9758404,0.0032952146,0.000011878164,0.0002875936,0.000015498856,0.00008603314,0.000091546055],"genre_scores_gemma":[0.9905272,0.0000014170605,0.00723342,0.002145694,0.00002008688,0.000036473946,0.000009720611,0.0000050450667,0.000020914495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987095,0.00005882141,0.0002888349,0.00043257998,0.00033789617,0.0001723817],"domain_scores_gemma":[0.9993543,0.0000746814,0.00010414799,0.00017708083,0.00012899184,0.00016077273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033612782,0.00014626,0.00030192186,0.00044141183,0.00014267092,0.00012513663,0.0002739877,0.00015555669,0.0000046534683],"category_scores_gemma":[0.000028275832,0.00011705984,0.000049197653,0.0011780646,0.000050121238,0.00012461265,0.000050475755,0.00016324222,3.600852e-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.00042663256,0.00042690957,0.0013582925,0.0006299851,0.0003343646,0.0000056267136,0.0021373022,0.058408726,0.13119774,0.005697825,0.00008239371,0.79929423],"study_design_scores_gemma":[0.00061223225,0.00010450651,0.0005109149,0.00006427841,0.00008064781,2.900382e-7,0.000017648419,0.99522126,0.0024878005,0.0006429477,0.00014242853,0.00011504032],"about_ca_topic_score_codex":0.000018341167,"about_ca_topic_score_gemma":0.000006469107,"teacher_disagreement_score":0.9703441,"about_ca_system_score_codex":0.000018855586,"about_ca_system_score_gemma":0.00008334133,"threshold_uncertainty_score":0.47735617},"labels":[],"label_agreement":null},{"id":"W4410537232","doi":"10.1109/tcomm.2025.3571910","title":"Triple IRS-Aided Communications: Row-Column Sparsity Enhanced Bayesian Tensor Learning for Channel Estimation","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Blind Source Separation 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 Waterloo","funders":"National Natural Science Foundation of China","keywords":"Channel (broadcasting); Computer science; Column (typography); Bayesian probability; Algorithm; Tensor (intrinsic definition); Electronic engineering; Mathematics; Artificial intelligence; Telecommunications; Engineering","score_opus":0.040754293905622026,"score_gpt":0.3243394170097982,"score_spread":0.28358512310417616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410537232","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.00011981495,0.0001538852,0.9733697,0.016872702,0.00022466715,0.0013806534,0.000021704143,0.0011576903,0.0066991528],"genre_scores_gemma":[0.7287076,0.0004282646,0.26670998,0.0007458053,0.0000064924684,0.0012854103,0.00004389425,0.00001917343,0.0020533751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978128,0.0005968691,0.00061602215,0.00044351237,0.000221099,0.00030966685],"domain_scores_gemma":[0.993112,0.0013475909,0.00025450523,0.004741237,0.00045168292,0.00009293059],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00080787024,0.000248927,0.00030821495,0.0005733277,0.0021623082,0.0003037571,0.003710403,0.00019345191,0.000010036049],"category_scores_gemma":[0.0001279499,0.0002976395,0.00022227403,0.001278783,0.0002219526,0.0008107137,0.000063276806,0.0007362982,0.000035662244],"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.00022080544,0.0053415727,0.00003035395,0.00021367242,0.000659524,7.219557e-7,0.013481562,0.14670613,0.0117480755,0.41515535,0.006348716,0.40009353],"study_design_scores_gemma":[0.0008436126,0.0001449891,0.00010895565,0.00013103808,0.00006530444,0.0000025141183,0.00022186789,0.94418913,0.02743185,0.015541237,0.010979996,0.00033951714],"about_ca_topic_score_codex":0.00009191909,"about_ca_topic_score_gemma":0.00045078885,"teacher_disagreement_score":0.79748297,"about_ca_system_score_codex":0.00023155892,"about_ca_system_score_gemma":0.00026286842,"threshold_uncertainty_score":0.99994755},"labels":[],"label_agreement":null},{"id":"W4410545618","doi":"10.1051/epjconf/202532601006","title":"Optimizing Q-Learning for Automated Cavity Filter Tuning: Leveraging PCA and Neural Networks","year":2025,"lang":"en","type":"article","venue":"EPJ Web of Conferences","topic":"Blind Source Separation 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":"Université de Moncton","funders":"","keywords":"Artificial neural network; Filter (signal processing); Artificial intelligence; Computer science; Machine learning; Engineering; Computer vision","score_opus":0.028903016280399863,"score_gpt":0.29018100000693,"score_spread":0.2612779837265301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410545618","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.04063798,0.00016716473,0.95178175,0.0011131673,0.00014334184,0.00018352218,5.3683533e-7,0.0006587684,0.0053137946],"genre_scores_gemma":[0.94658095,0.000017799739,0.05295907,0.00023737439,0.000013957099,0.00001817435,0.0000031865643,0.0000037306074,0.00016575525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991335,0.000108967375,0.00022885727,0.00024914386,0.000102906146,0.0001765823],"domain_scores_gemma":[0.99922603,0.00030527063,0.0001303102,0.00016589781,0.00013746147,0.000035047615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043449178,0.00011105785,0.00019964617,0.00014990428,0.00014594231,0.00023298754,0.000360726,0.000068175745,0.00000611771],"category_scores_gemma":[0.00008206156,0.000104445986,0.00004096779,0.00021503204,0.00006648301,0.00032027074,0.00017315795,0.00015687107,1.5299604e-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.00008604235,0.0001335709,0.04796779,0.00027099618,0.00021687099,0.000008067833,0.009378282,0.13068496,0.005487452,0.54194903,0.0061321957,0.25768477],"study_design_scores_gemma":[0.00019594784,0.000059246442,0.0019097406,0.00006705003,0.00000634042,0.0000012417835,0.00008903856,0.9924905,0.0016421633,0.0010589571,0.0023770514,0.00010272765],"about_ca_topic_score_codex":0.000036442867,"about_ca_topic_score_gemma":0.000010459432,"teacher_disagreement_score":0.905943,"about_ca_system_score_codex":0.000008508701,"about_ca_system_score_gemma":0.00020862972,"threshold_uncertainty_score":0.42591837},"labels":[],"label_agreement":null},{"id":"W4410995817","doi":"10.1364/ofc.2025.m2e.3","title":"Active Learning with Gaussian Process Regression and Physical Models for Robust SNR Estimation","year":2025,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Ciena (Canada)","funders":"","keywords":"Gaussian process; Kriging; Computer science; Process (computing); Regression; Estimation; Artificial intelligence; Regression analysis; Machine learning; Gaussian; Statistics; Mathematics; Engineering","score_opus":0.018351579812243005,"score_gpt":0.3088520899702095,"score_spread":0.2905005101579665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410995817","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.01481408,0.0000044630565,0.97725797,0.0012096717,0.000007907476,0.00026598823,2.1648533e-7,0.0002852005,0.006154486],"genre_scores_gemma":[0.74076474,0.0000010106581,0.2585239,0.000107022046,0.000005490124,0.0000593507,0.0000021439118,0.0000032980222,0.0005330508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949455,0.000026531348,0.000065916436,0.0002265719,0.00009794841,0.000088500754],"domain_scores_gemma":[0.99966127,0.0000645881,0.000048725327,0.00011464913,0.00008630315,0.000024477431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008871504,0.00007521267,0.000088814806,0.000074972515,0.00012802266,0.00011526214,0.00013204307,0.000033491036,4.6645434e-7],"category_scores_gemma":[0.00001910192,0.000051162362,0.000012888289,0.0001982647,0.0000228566,0.0008031753,0.00004584458,0.000090134716,3.8123466e-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.000079182355,0.00010126656,0.000048370945,0.00008556522,0.0000187216,6.19212e-7,0.007776708,0.19496474,0.00031017276,0.5756682,0.0003279487,0.2206185],"study_design_scores_gemma":[0.00018530671,0.00009442244,0.000070181544,0.00006621183,0.0000037231357,9.692437e-7,0.00012353736,0.93813306,0.017285537,0.043946095,0.000025376798,0.000065599874],"about_ca_topic_score_codex":0.000004060214,"about_ca_topic_score_gemma":0.0000029744024,"teacher_disagreement_score":0.7431683,"about_ca_system_score_codex":0.000014707248,"about_ca_system_score_gemma":0.000055719538,"threshold_uncertainty_score":0.20863406},"labels":[],"label_agreement":null},{"id":"W4411172187","doi":"10.1109/tsc.2025.3577425","title":"Feature Noise Resilient for QoS Prediction With Probabilistic Deep Supervision","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Blind Source Separation 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":"University of Victoria","funders":"","keywords":"Computer science; Probabilistic logic; Noise (video); Feature (linguistics); Quality of service; Artificial intelligence; Data mining; Pattern recognition (psychology); Computer network","score_opus":0.008363526595493595,"score_gpt":0.25110738948284145,"score_spread":0.24274386288734784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411172187","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.019721327,0.000032069973,0.97565424,0.0015936847,0.00071146985,0.0009436446,0.000009537516,0.0009191936,0.00041482097],"genre_scores_gemma":[0.8680755,0.000005950918,0.13039348,0.0011424039,0.0000615437,0.00009300928,0.0000078031735,0.000016995973,0.0002033213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985379,0.000096014795,0.0002498762,0.00057736185,0.00027142477,0.00026739558],"domain_scores_gemma":[0.99863493,0.00024944366,0.0000963062,0.0005795362,0.00037397598,0.00006578457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003275931,0.00021514593,0.0001963698,0.00030126335,0.0004927216,0.0002785532,0.0005726559,0.00013157104,0.0000020508755],"category_scores_gemma":[0.0000043272016,0.0001887147,0.00009043281,0.00079205434,0.000027362626,0.00047188424,0.000008398654,0.0002798677,0.000005109792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034201037,0.000780188,0.00017575276,0.0010144347,0.00015895053,0.000004029984,0.007542824,0.82937264,0.0022953062,0.0102331955,0.00071585516,0.14736484],"study_design_scores_gemma":[0.0007046605,0.00036141794,0.0004199774,0.00040329754,0.000037576116,0.0000053512886,0.00014916663,0.9798019,0.014726449,0.00064071396,0.0025441884,0.00020532009],"about_ca_topic_score_codex":0.00002398436,"about_ca_topic_score_gemma":0.00017998595,"teacher_disagreement_score":0.84835416,"about_ca_system_score_codex":0.00009530471,"about_ca_system_score_gemma":0.00007986515,"threshold_uncertainty_score":0.76955616},"labels":[],"label_agreement":null},{"id":"W4411555752","doi":"10.1007/978-981-96-6588-4_8","title":"Adaptive Constrained ICABMGGMM: Application to ECG Blind Source Separation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Algoma University; Concordia University","funders":"","keywords":"Blind signal separation; Computer science; Source separation; Speech recognition; Artificial intelligence; Algorithm; Telecommunications","score_opus":0.016340657321123945,"score_gpt":0.28553435390618115,"score_spread":0.2691936965850572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411555752","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.000015072393,0.00007351911,0.9830094,0.0027113212,0.00042076065,0.0013258862,0.0000073720767,0.0005529819,0.011883668],"genre_scores_gemma":[0.12324446,0.000013356637,0.8676348,0.006756029,0.00022792691,0.00009602563,0.000018018292,0.000030787476,0.001978613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600583,0.00007163357,0.0006517409,0.0018101431,0.00094369426,0.00051695027],"domain_scores_gemma":[0.99686664,0.00048012825,0.0003403913,0.0015974784,0.0005080126,0.00020737511],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011299255,0.00053977926,0.0005189868,0.0014546658,0.00027532785,0.00065087824,0.00294553,0.0004388183,0.000011021909],"category_scores_gemma":[0.00011641843,0.00055288937,0.0001264296,0.0012739785,0.0004333535,0.0006371624,0.0011475615,0.00077006954,0.00009087312],"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.000018576282,0.000032121185,0.0000059844,0.000014963442,0.000011709753,0.0000066229095,0.0014112829,0.043924928,0.00033330702,0.11375135,0.00021950823,0.8402696],"study_design_scores_gemma":[0.00029299423,0.00025315429,0.000019685147,0.0002364617,0.0000094616225,0.000020290656,5.4427034e-7,0.86562073,0.004687481,0.11901515,0.009160754,0.00068331655],"about_ca_topic_score_codex":0.000027049586,"about_ca_topic_score_gemma":0.00010360828,"teacher_disagreement_score":0.8395863,"about_ca_system_score_codex":0.0003897997,"about_ca_system_score_gemma":0.001024647,"threshold_uncertainty_score":0.99969226},"labels":[],"label_agreement":null},{"id":"W4412175736","doi":"10.1007/978-3-030-54621-2_610-1","title":"Signal Processing with Higher Order Statistics","year":2025,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Higher-order statistics; Statistics; SIGNAL (programming language); Signal processing; Computer science; Order (exchange); Order statistic; Mathematics; Digital signal processing; Economics; Computer hardware","score_opus":0.008964758547998964,"score_gpt":0.23393731892834282,"score_spread":0.22497256038034386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412175736","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":[4.3244295e-8,0.00008054279,0.56032485,0.00011280285,0.00004464532,0.00016379099,0.000012956376,0.00012917076,0.4391312],"genre_scores_gemma":[0.000027306907,0.00029665302,0.6726087,0.00013459503,0.000038487266,0.0000110361625,0.00011611591,0.000022997234,0.32674414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986999,0.00002390766,0.00038108707,0.0003678839,0.0003993,0.00012791851],"domain_scores_gemma":[0.99843895,0.00006682872,0.00044344802,0.00033963862,0.00066867215,0.000042467836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012335862,0.00024836176,0.00028118162,0.00026049852,0.000062528095,0.000088755514,0.00041757105,0.00022062068,0.00022863771],"category_scores_gemma":[0.000011565008,0.00022860122,0.000029006134,0.00017225012,0.00006930742,0.0003751578,0.0001078918,0.00022227068,0.0000046279238],"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.000016835855,0.000041441992,0.000010391838,0.0001736099,0.000043779382,0.000009836638,0.0003880627,0.08823953,8.083916e-7,0.82151216,0.016165402,0.07339814],"study_design_scores_gemma":[0.0006901864,0.00043829475,0.000026559725,0.0010377805,0.00015763035,0.000007529317,0.000005709257,0.47633868,0.00008584843,0.034072183,0.48596254,0.0011770627],"about_ca_topic_score_codex":0.000004280036,"about_ca_topic_score_gemma":0.0000033459423,"teacher_disagreement_score":0.78744,"about_ca_system_score_codex":0.000042375254,"about_ca_system_score_gemma":0.00055342517,"threshold_uncertainty_score":0.93220866},"labels":[],"label_agreement":null},{"id":"W4412496830","doi":"10.1007/978-981-96-6957-8_18","title":"Top-Down Backpropagation in Deep Feedforward Neural Networks","year":2025,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Backpropagation; Feed forward; Feedforward neural network; Artificial neural network; Computer science; Artificial intelligence; Control engineering; Engineering","score_opus":0.02107952939137216,"score_gpt":0.283759156999145,"score_spread":0.26267962760777286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412496830","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.000027330894,0.0002536639,0.8148027,0.0017271211,0.00019970421,0.0004497965,0.0000022098757,0.00014532763,0.18239217],"genre_scores_gemma":[0.37960598,0.0065179197,0.59757847,0.011518288,0.00009413214,0.00021481483,0.0002527341,0.000027249067,0.004190398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980888,0.000070243375,0.0008652367,0.00033557485,0.00038750458,0.00025267614],"domain_scores_gemma":[0.99702096,0.00022713338,0.00033519146,0.0019834598,0.00035883603,0.000074394724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015378292,0.00023398225,0.00027262344,0.0017734492,0.0002861444,0.0008715229,0.003383313,0.00019513597,0.000005538523],"category_scores_gemma":[0.00005277892,0.00024652088,0.000048286805,0.00094593794,0.00046903608,0.0077558835,0.0024385497,0.0006853858,0.000013878134],"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.000001519743,0.000010236746,0.00007695034,0.000012045063,0.0000017013491,2.5274878e-7,0.0010361784,0.0039803963,3.8748297e-7,0.6731558,0.00017142994,0.32155314],"study_design_scores_gemma":[0.00018860612,0.000030988445,0.0011189212,0.00013411573,0.000002025633,0.0000071095455,0.000010190107,0.96259564,0.0000063525054,0.00923323,0.026437646,0.00023519801],"about_ca_topic_score_codex":0.000020620419,"about_ca_topic_score_gemma":0.000055348923,"teacher_disagreement_score":0.95861524,"about_ca_system_score_codex":0.00020895147,"about_ca_system_score_gemma":0.000261882,"threshold_uncertainty_score":0.9999987},"labels":[],"label_agreement":null},{"id":"W4412722568","doi":"10.1109/tvt.2025.3593372","title":"Multi-Dimensional Spectrum Prediction Using Closed-Form Continuous-Time Neural Network With Graph Attention","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"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":"Artificial neural network; Graph; Computer science; Graph theory; Spectrum (functional analysis); Artificial intelligence; Mathematics; Theoretical computer science; Physics; Combinatorics","score_opus":0.008605066956959366,"score_gpt":0.23387036896239524,"score_spread":0.22526530200543587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412722568","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.20606114,0.00004347468,0.7894704,0.0018756111,0.0003253372,0.0004356427,0.0000058466835,0.0017324778,0.00005007818],"genre_scores_gemma":[0.8964833,0.000009242818,0.10268165,0.00041394806,0.000019922665,0.000079300895,0.000005501662,0.0000206011,0.0002865061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826056,0.00010077714,0.0003641524,0.0005994448,0.00026879602,0.00040627478],"domain_scores_gemma":[0.9989459,0.000041267092,0.00013617853,0.0006897956,0.00013627265,0.000050570576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026427058,0.0002627415,0.00028914798,0.00090848433,0.00044876972,0.00008646419,0.00048258438,0.000384769,0.0000115493085],"category_scores_gemma":[0.0000033905274,0.00024690974,0.00013930498,0.0017657499,0.00018628426,0.00041737035,0.0000108263175,0.0006189806,0.000021460703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020779297,0.0015796308,0.001968514,0.000049765556,0.0007098996,0.00011854349,0.0001760225,0.80416137,0.12188113,0.025016638,0.00068575365,0.043444946],"study_design_scores_gemma":[0.0012335336,0.00047847148,0.001090829,0.00014334141,0.000087806824,0.0001682797,0.000020044785,0.92676157,0.06439473,0.0048523583,0.00042562204,0.00034342858],"about_ca_topic_score_codex":0.00002590239,"about_ca_topic_score_gemma":0.00003818885,"teacher_disagreement_score":0.6904222,"about_ca_system_score_codex":0.00012436074,"about_ca_system_score_gemma":0.00009418025,"threshold_uncertainty_score":0.99999833},"labels":[],"label_agreement":null},{"id":"W4412732448","doi":"10.1017/s0952675725100079","title":"Nazarré Merchant and Alan Prince (2023). <i>The Mother of All Tableaux: Order, Equivalence, and Geometry in the Large-scale Structure of Optimality Theory</i> (Advances in Optimality Theory series). Sheffield: Equinox. Distributed by University of Toronto Press. xii+356 pages.","year":2025,"lang":"en","type":"article","venue":"Phonology","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"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":"Equinox; Equivalence (formal languages); Series (stratigraphy); Order (exchange); Mathematics; Scale (ratio); Mathematical economics; Geometry; Algebra over a field; Calculus (dental); Computer science; Pure mathematics; Physics; Geography; Cartography; Economics; Geology; Astronomy","score_opus":0.0068763731401324316,"score_gpt":0.24562865496954778,"score_spread":0.23875228182941535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412732448","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5423736,0.0187131,0.43379572,0.001920322,0.00009368442,0.0008540566,0.00041459885,0.00006195501,0.001772994],"genre_scores_gemma":[0.9904972,0.0038565942,0.0053322185,0.00021542162,0.0000030707045,0.0000042085853,0.000011128934,0.000004060765,0.00007613389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981048,0.0008622127,0.00031237886,0.00034503054,0.0001345137,0.00024103058],"domain_scores_gemma":[0.99863607,0.00048905244,0.00021976499,0.0005391348,0.00009195598,0.000024000841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014690858,0.00014350294,0.00034463714,0.000046518584,0.00005261609,0.0000156855,0.00087550376,0.00016047747,0.000031605563],"category_scores_gemma":[0.00011332606,0.00010599635,0.000029580611,0.00029651748,0.00051851524,0.0004038376,0.0005755107,0.0002348516,5.590445e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013034563,0.00086177717,0.029889347,0.00076837867,0.00019977709,0.000010280754,0.03171831,0.0013698487,0.023747308,0.89273053,0.0012781614,0.016122809],"study_design_scores_gemma":[0.008489476,0.002263317,0.22059454,0.0005769966,0.00025064676,0.000067152905,0.0252227,0.019381382,0.20999865,0.43070018,0.080650605,0.0018043491],"about_ca_topic_score_codex":0.001425044,"about_ca_topic_score_gemma":0.003592507,"teacher_disagreement_score":0.46203035,"about_ca_system_score_codex":0.000033516113,"about_ca_system_score_gemma":0.00006475548,"threshold_uncertainty_score":0.43224055},"labels":[],"label_agreement":null},{"id":"W4413096405","doi":"10.1109/iccsp64183.2025.11089193","title":"A novel framework for a stand-alone Orienteering Problem reinforcement learning-driven beam search","year":2025,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation 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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Orienteering; Reinforcement learning; Computer science; Artificial intelligence; Reinforcement; Machine learning; Human–computer interaction; Mathematical optimization; Engineering; Mathematics","score_opus":0.024270713582488192,"score_gpt":0.3115513432134865,"score_spread":0.2872806296309983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413096405","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.0005932612,0.000021375785,0.9881238,0.0018745732,0.00007248028,0.000766552,6.575353e-7,0.00069488044,0.007852423],"genre_scores_gemma":[0.25829086,0.000009213714,0.7346407,0.0005575205,0.00001808751,0.00018221357,0.0000032084336,0.000008097159,0.006290072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881023,0.000022090644,0.00026158083,0.00034752185,0.00026163488,0.00029695503],"domain_scores_gemma":[0.9991367,0.00017528607,0.000054810793,0.00037830113,0.00019767304,0.000057221652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050412037,0.00012264987,0.00015372277,0.00019266264,0.00018250188,0.000248949,0.0005712223,0.000092978065,0.000014278803],"category_scores_gemma":[0.00008694215,0.00011440754,0.00006606406,0.0005514981,0.000025267034,0.0002902199,0.00036882496,0.00026841124,0.000008134444],"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.000013168478,0.00004848019,0.000088034474,0.000048050715,0.00002438533,3.5174952e-7,0.0013955373,0.024588356,0.0015389915,0.9683831,0.0008047149,0.0030668825],"study_design_scores_gemma":[0.0011845303,0.0007111209,0.00014399475,0.00037742054,0.000012156639,0.000003695769,0.00026346234,0.7807695,0.08945508,0.03527008,0.09135361,0.00045531668],"about_ca_topic_score_codex":0.000029078623,"about_ca_topic_score_gemma":0.000004224954,"teacher_disagreement_score":0.933113,"about_ca_system_score_codex":0.00009146314,"about_ca_system_score_gemma":0.00017960738,"threshold_uncertainty_score":0.4665404},"labels":[],"label_agreement":null},{"id":"W4413180892","doi":"10.1109/isscs66034.2025.11105696","title":"Blind Channel Equalization Using MCMA Algorithm with Adam Optimization","year":2025,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Blind equalization; Computer science; Channel (broadcasting); Algorithm; Equalization (audio); Telecommunications","score_opus":0.024075840999373217,"score_gpt":0.2960537328296441,"score_spread":0.2719778918302709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413180892","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.00014675732,0.000020944477,0.99124146,0.0007062659,0.000080172555,0.00022778522,5.183423e-7,0.00054244476,0.0070336736],"genre_scores_gemma":[0.032147244,0.000008350918,0.96531075,0.0014040458,0.000018854722,0.00001406915,0.000009789301,0.000007666897,0.0010792534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918175,0.00006341781,0.00017379942,0.00026384238,0.00018527107,0.00013191221],"domain_scores_gemma":[0.99936926,0.000027590533,0.00007329743,0.00030379242,0.00019500677,0.000031063493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022591239,0.000100455545,0.00009701324,0.00024257254,0.00011676599,0.00022127084,0.00029354508,0.000067381996,0.000015707843],"category_scores_gemma":[0.000014190558,0.00008608606,0.000019459667,0.000967065,0.000020590393,0.00072188803,0.000100555975,0.00006201001,0.0000030520544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000143015595,0.00012090579,0.00003861965,0.00001584919,0.000032694406,0.0000032007088,0.0009360453,0.6685516,0.0002010262,0.29627293,0.0009726487,0.032840166],"study_design_scores_gemma":[0.0002928151,0.000039768704,0.000014089764,0.000025752419,0.0000050293165,0.000003243376,0.00003119963,0.9894671,0.0077477274,0.0019031749,0.00036062923,0.00010950585],"about_ca_topic_score_codex":0.00003957845,"about_ca_topic_score_gemma":0.00000795157,"teacher_disagreement_score":0.32091546,"about_ca_system_score_codex":0.000042886404,"about_ca_system_score_gemma":0.00012495654,"threshold_uncertainty_score":0.35104877},"labels":[],"label_agreement":null},{"id":"W4413392937","doi":"10.23919/acc63710.2025.11108069","title":"Integrating System Identification and Blind Source Separation for Real-Time Pipeline Monitoring: A Field Study","year":2025,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Blind signal separation; Pipeline (software); Identification (biology); Computer science; Field (mathematics); Separation (statistics); Telecommunications; Machine learning; Operating system; Mathematics","score_opus":0.01941350189550086,"score_gpt":0.3393494825371797,"score_spread":0.3199359806416789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413392937","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.067010485,0.000014502696,0.9271354,0.0007186305,0.00013509733,0.000999319,4.7266067e-7,0.00066888705,0.0033171806],"genre_scores_gemma":[0.9400874,0.000003388574,0.052373666,0.000065064814,0.000051543102,0.00021283882,0.0000032734856,0.0000059587255,0.0071969084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988812,0.00010157125,0.00039136622,0.00036535645,0.00014304406,0.00011747076],"domain_scores_gemma":[0.9989415,0.0002939985,0.0001265924,0.0003912689,0.00021473134,0.000031942553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092905527,0.000112145666,0.00014962541,0.00019677122,0.00018632681,0.00045666556,0.00030134394,0.00007052424,0.0000012337256],"category_scores_gemma":[0.00012981915,0.000102433856,0.00003267876,0.00033498454,0.0000090485655,0.0004217765,0.00010945104,0.000079430945,0.000005479526],"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.00026886124,0.001084264,0.013930072,0.00047671015,0.00019471823,0.0000038177186,0.028295545,0.00043180436,0.11605367,0.5563151,0.027645139,0.25530025],"study_design_scores_gemma":[0.0012701458,0.00044408464,0.001840379,0.00014922216,0.000043872715,0.0000044826857,0.0043864828,0.8460024,0.14252609,0.0017301886,0.0012808238,0.00032184954],"about_ca_topic_score_codex":0.00008724517,"about_ca_topic_score_gemma":0.000015798096,"teacher_disagreement_score":0.87476176,"about_ca_system_score_codex":0.000045502755,"about_ca_system_score_gemma":0.00004525483,"threshold_uncertainty_score":0.44036365},"labels":[],"label_agreement":null},{"id":"W4413855985","doi":"10.1101/2025.08.29.672336","title":"Precise temporal localisation of M/EEG effects with Bayesian generalised additive multilevel models","year":2025,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Blind Source Separation 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":"Canadian Nautical Research Society","funders":"","keywords":"Bayesian probability; Electroencephalography; Multilevel model; Econometrics; Bayesian hierarchical modeling; Bayesian inference; Psychology; Statistics; Computer science; Artificial intelligence; Mathematics; Neuroscience","score_opus":0.014081005549551967,"score_gpt":0.22807769689866167,"score_spread":0.2139966913491097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413855985","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.03872417,0.00016735661,0.9577564,0.00017301024,0.00035300662,0.0015908857,0.0002519171,0.0009329872,0.000050241946],"genre_scores_gemma":[0.7457194,0.00003842824,0.25348747,0.00021912895,0.00005938091,0.00042076694,0.0000012881382,0.000044179946,0.000010000855],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965395,0.00044376904,0.00067892415,0.0012534965,0.000661382,0.00042292496],"domain_scores_gemma":[0.9957502,0.00019348392,0.0007790929,0.001970805,0.0011010598,0.00020535216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070194225,0.0006159056,0.0007427883,0.0005843349,0.000115889095,0.00027557102,0.0014346135,0.0005704515,0.0000054134634],"category_scores_gemma":[0.00012407854,0.00061012147,0.00016121386,0.00076020946,0.00014495815,0.0007403198,0.0007767002,0.000651674,0.000004149679],"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.0007287032,0.0034775778,0.005193963,0.007914354,0.0025004921,0.00036039524,0.0024542424,0.08604583,0.52053326,0.3620672,0.007982003,0.0007419615],"study_design_scores_gemma":[0.0008209338,0.00014477431,0.005763983,0.0012405816,0.00007671399,1.3389007e-8,0.000001551563,0.3190367,0.67158943,0.00015494974,0.00032932902,0.00084103394],"about_ca_topic_score_codex":0.000165578,"about_ca_topic_score_gemma":0.000007947471,"teacher_disagreement_score":0.7069952,"about_ca_system_score_codex":0.00024931895,"about_ca_system_score_gemma":0.0013817,"threshold_uncertainty_score":0.99963504},"labels":[],"label_agreement":null},{"id":"W4414243762","doi":"10.1137/24m1646947","title":"Log-Concave Density Estimation with Independent Components","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Mathematics of Data Science","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"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":"Component (thermodynamics); Estimation; Probability density function; Density estimation; Kernel density estimation; Noise (video)","score_opus":0.049892011006255,"score_gpt":0.3370261329961606,"score_spread":0.28713412198990557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414243762","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.07389359,0.000010034846,0.92314744,0.0007802269,0.000093783645,0.00014809264,0.0000044424783,0.000054233555,0.0018681556],"genre_scores_gemma":[0.5415105,0.000007498851,0.4582686,0.0001788306,0.000004550711,8.574998e-7,0.0000019363385,0.0000023588098,0.000024822108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979553,0.000055141692,0.0004144949,0.00032660097,0.0010490528,0.00019936326],"domain_scores_gemma":[0.9976452,0.00017293854,0.00044212822,0.0013066354,0.00033916044,0.00009393796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029385923,0.00011840137,0.00020222338,0.0004271282,0.00026055664,0.00041371107,0.003690587,0.00003636993,0.0000037146335],"category_scores_gemma":[0.00030235434,0.00008728658,0.000023548771,0.0008832991,0.00027859182,0.0027742325,0.0008167026,0.00027413882,0.00001083275],"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.000029111276,0.00088303024,0.0007330659,0.00012548265,0.00005261939,0.00003363843,0.0020347985,0.0017359438,0.01511991,0.950124,0.001210161,0.0279182],"study_design_scores_gemma":[0.0006954689,0.0003714649,0.005333572,0.0007810017,0.000025373407,0.00028269103,0.00016549487,0.8071072,0.056572005,0.12815371,0.0002197032,0.0002922757],"about_ca_topic_score_codex":0.0000039996767,"about_ca_topic_score_gemma":0.0000035779324,"teacher_disagreement_score":0.82197034,"about_ca_system_score_codex":0.000076503624,"about_ca_system_score_gemma":0.00045041548,"threshold_uncertainty_score":0.685809},"labels":[],"label_agreement":null},{"id":"W4414721029","doi":"10.1007/978-3-032-02725-2_7","title":"Sparse Least Square SVM in Primal via Nesterov Accelerated Alternating Directions Method of Multipliers","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Support vector machine; Quadratic programming; Regularization (linguistics); Least squares support vector machine; Lasso (programming language); Least-squares function approximation; Context (archaeology); Lagrange multiplier","score_opus":0.02856076614534515,"score_gpt":0.30910972617141297,"score_spread":0.28054896002606783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414721029","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.00022012004,0.00012902096,0.9935018,0.000516162,0.0008023343,0.0006135348,0.0000050407193,0.00028466104,0.0039273193],"genre_scores_gemma":[0.15003382,0.000024639057,0.8486995,0.0007988294,0.000094575924,0.000024946521,0.0000063979032,0.000026236172,0.00029102725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962214,0.00015351104,0.0008930476,0.001425694,0.0007825203,0.0005237858],"domain_scores_gemma":[0.99710464,0.00071350805,0.00051142543,0.0011665246,0.00039421272,0.00010966641],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014434402,0.0005028256,0.0006902884,0.0020050616,0.00017033283,0.00037455274,0.0027626366,0.00036801197,0.000012243435],"category_scores_gemma":[0.00016220362,0.00050875795,0.00014597231,0.0015672687,0.00035001975,0.00078502187,0.0012920401,0.0010496493,0.000005040332],"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.000010421451,0.00007465113,0.0004142297,0.00006472307,0.000015108167,0.000032682154,0.002121148,0.06670565,0.0012049038,0.009991091,0.000013149343,0.91935223],"study_design_scores_gemma":[0.00039686347,0.00014196378,0.00066329894,0.0008335964,0.00000826905,0.000041561914,8.3161575e-7,0.94826525,0.02022409,0.028267654,0.00054910395,0.0006074853],"about_ca_topic_score_codex":0.00019149222,"about_ca_topic_score_gemma":0.00043945262,"teacher_disagreement_score":0.91874474,"about_ca_system_score_codex":0.0003608668,"about_ca_system_score_gemma":0.00066268625,"threshold_uncertainty_score":0.9997364},"labels":[],"label_agreement":null},{"id":"W4414834375","doi":"10.1007/s00034-025-03333-0","title":"SNRENN: A Transformer-Based Neural Network with Self-Supervised Learning for Auditory Steady State Response Signal SNR Enhancement","year":2025,"lang":"en","type":"article","venue":"Circuits Systems and Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Biometrics; Regularization (linguistics); Authentication (law); Pattern recognition (psychology); Artificial neural network; SIGNAL (programming language); Noise reduction; Transformer","score_opus":0.016094921596689238,"score_gpt":0.2533535620127594,"score_spread":0.23725864041607014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414834375","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.05358378,0.0010674867,0.9432409,0.00023385958,0.00012184041,0.00094865134,0.0000019010091,0.00045646343,0.00034511162],"genre_scores_gemma":[0.99333125,0.000004616003,0.0054999785,0.0003282444,0.00011219723,0.0002968043,0.000005359059,0.00002312737,0.00039842664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976792,0.0004177555,0.0004847805,0.00057807897,0.00035840756,0.00048178397],"domain_scores_gemma":[0.99882656,0.00035469764,0.00022360453,0.00018648562,0.0002931764,0.00011547552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016730579,0.00027765322,0.00037141555,0.00019916402,0.00067996845,0.0007860703,0.00034159873,0.00010198052,0.0000025892198],"category_scores_gemma":[0.000011770949,0.00024005394,0.000060778228,0.0005229998,0.00005904994,0.00061759626,0.00002534191,0.00027284207,9.355125e-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.0016856862,0.00046002652,0.0013421137,0.004698188,0.00028905313,0.000048549577,0.020290432,0.31339952,0.06661589,0.003200925,0.0012565332,0.5867131],"study_design_scores_gemma":[0.0013426095,0.00085943565,0.00015238105,0.00089354225,0.00003210716,0.000009552496,0.00026634324,0.98829126,0.0036681267,0.00022309583,0.0038853807,0.00037615365],"about_ca_topic_score_codex":0.000010101475,"about_ca_topic_score_gemma":0.00000368906,"teacher_disagreement_score":0.93974745,"about_ca_system_score_codex":0.00009888703,"about_ca_system_score_gemma":0.0007057092,"threshold_uncertainty_score":0.9789115},"labels":[],"label_agreement":null},{"id":"W4415104121","doi":"10.1109/icst66402.2025.11512369","title":"Sparse Signal Blind Deconvolution using Bayesian MAP Estimation","year":2025,"lang":"","type":"article","venue":"","topic":"Blind Source Separation 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":"Safran Electronics (Canada)","funders":"Safran","keywords":"Deconvolution; Pattern recognition (psychology); Blind deconvolution; Bayesian probability; SIGNAL (programming language); Noise (video); Signal processing; Bayes estimator","score_opus":0.03323537973859565,"score_gpt":0.318725291193863,"score_spread":0.28548991145526736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415104121","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.004044867,0.00026337017,0.9807364,0.0033027579,0.0007811771,0.0007202656,0.0000023706684,0.0005160176,0.009632809],"genre_scores_gemma":[0.6063099,0.00001109803,0.3900837,0.0011847853,0.000050073784,0.000012160029,0.0000061196397,0.000010797467,0.0023313703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970221,0.00037109316,0.0008641361,0.00081533816,0.00044295532,0.00048435523],"domain_scores_gemma":[0.99828714,0.00013304583,0.00030374213,0.0007958404,0.00033546085,0.00014478312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011684491,0.0003504651,0.00033043974,0.000781464,0.0004687283,0.0009852289,0.00079463224,0.00034690663,0.00046475985],"category_scores_gemma":[0.000058904025,0.00039291865,0.00015805032,0.0013542621,0.000147175,0.0018336602,0.00039503883,0.00036393086,0.0001479236],"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.00009306285,0.00047837934,0.0005619161,0.00016898873,0.00011349866,0.000012100096,0.001742254,0.050281532,0.0032631443,0.6926583,0.007230141,0.24339667],"study_design_scores_gemma":[0.0005766865,0.00008528789,0.0002580358,0.00020417979,0.00004661407,0.000008203556,0.000043419892,0.94152397,0.019876167,0.035665404,0.0013747023,0.00033732055],"about_ca_topic_score_codex":0.00017745439,"about_ca_topic_score_gemma":0.000055711556,"teacher_disagreement_score":0.89124244,"about_ca_system_score_codex":0.00033455688,"about_ca_system_score_gemma":0.0009307171,"threshold_uncertainty_score":0.9998523},"labels":[],"label_agreement":null},{"id":"W4415180696","doi":"10.23919/ecc65951.2025.11186975","title":"A Regularized Least-Squares Approach to Digital Filter Design for Periodic and Aperiodic Signal Separation","year":2025,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","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":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Aperiodic graph; Digital filter; Filter (signal processing); Regularization (linguistics); SIGNAL (programming language); Trigonometry; Component (thermodynamics); Digital signal; Measure (data warehouse)","score_opus":0.024534899668531444,"score_gpt":0.2815430742570798,"score_spread":0.25700817458854835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415180696","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.0029894095,0.000031408483,0.986765,0.0017145076,0.00003124046,0.0010404123,0.000003516667,0.00039148194,0.0070329737],"genre_scores_gemma":[0.5218126,8.30742e-7,0.47334838,0.0014189748,0.000014439692,0.00030939255,0.000009134914,0.000006135642,0.003080127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891895,0.00006605158,0.0002210873,0.00044296935,0.00015612892,0.00019482787],"domain_scores_gemma":[0.9993465,0.0001221279,0.000039700615,0.00031195866,0.00010407659,0.000075634256],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003296465,0.00014670429,0.00017299048,0.00021277653,0.00017852923,0.0012037763,0.00035731037,0.000080560065,0.0000063562024],"category_scores_gemma":[0.00005291513,0.00012978491,0.000055998793,0.00032886124,0.00004562567,0.00072726794,0.00014920329,0.00006542427,0.000008007145],"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.0003099569,0.00041187461,0.00020203674,0.000119609176,0.000091588816,0.0000016758365,0.010326888,0.0014699403,0.021080688,0.80855685,0.04596205,0.11146684],"study_design_scores_gemma":[0.0014844032,0.0006935202,0.00062133535,0.000047502785,0.000019910187,0.000015486738,0.00022414143,0.8907861,0.031560436,0.030331304,0.0435869,0.0006289566],"about_ca_topic_score_codex":0.0000042082884,"about_ca_topic_score_gemma":0.0000012608386,"teacher_disagreement_score":0.88931614,"about_ca_system_score_codex":0.000027602038,"about_ca_system_score_gemma":0.00012213146,"threshold_uncertainty_score":0.99983305},"labels":[],"label_agreement":null},{"id":"W4415321497","doi":"10.1016/j.ymssp.2025.113496","title":"An end-to-end modeling and source separation solution for vibration signal analysis","year":2025,"lang":"en","type":"article","venue":"Mechanical Systems and Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Vibration; SIGNAL (programming language); Harmonics; Transmission (telecommunications); Control theory (sociology); Transfer function; Harmonic; Convolution (computer science); Expression (computer science); Artificial neural network","score_opus":0.02409644022778806,"score_gpt":0.3050706736147516,"score_spread":0.28097423338696353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415321497","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.01826175,0.00025832996,0.98027676,0.00045867963,0.000032296626,0.00044335422,0.000002349656,0.00021525085,0.00005122632],"genre_scores_gemma":[0.9524101,0.0000028002494,0.047061622,0.00030262163,0.00005546242,0.00009292665,0.00001379465,0.000007413336,0.000053261745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984571,0.00015647402,0.00041104326,0.0005341772,0.000236081,0.00020515235],"domain_scores_gemma":[0.9993331,0.00007433064,0.00011799997,0.0001601383,0.00019787063,0.00011657143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011969132,0.00015081292,0.00027817927,0.0003256484,0.0004523511,0.0010165295,0.00018891178,0.00013706274,0.000001757582],"category_scores_gemma":[0.00001762016,0.00014100899,0.000051853192,0.00067290076,0.000014592012,0.0009503008,0.00007374298,0.000101575795,4.2641759e-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.000117335985,0.00015174456,0.0001177356,0.00039269667,0.00018237856,0.0000011946719,0.0028290185,0.20228268,0.20798856,0.1708911,0.00006650748,0.41497904],"study_design_scores_gemma":[0.00016506226,0.0001493493,0.00001920862,0.00006984671,0.000073884075,0.0000024557016,0.00009199233,0.9911719,0.0033846952,0.004566572,0.00014797528,0.00015706051],"about_ca_topic_score_codex":0.000093703435,"about_ca_topic_score_gemma":0.00003380958,"teacher_disagreement_score":0.9341484,"about_ca_system_score_codex":0.000041450614,"about_ca_system_score_gemma":0.00007895316,"threshold_uncertainty_score":0.9802418},"labels":[],"label_agreement":null},{"id":"W4415532935","doi":"10.1103/vr7v-lwtb","title":"Mitigating source and detection noises in autocorrelative weak-value amplification","year":2025,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Blind Source Separation 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":"University of Ottawa","funders":"Engineering and Physical Sciences Research Council; Natural Science Foundation of Hubei Province; National Natural Science Foundation of China","keywords":"Noise (video); Quantum; Quantum noise; Shot noise; Photon; Gaussian; Background noise; Spectral density; Gaussian noise","score_opus":0.012902215504443678,"score_gpt":0.36839936990224453,"score_spread":0.35549715439780083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415532935","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.06145888,0.036428392,0.88576967,0.0076930355,0.00009023862,0.0032306332,0.0000031391298,0.0005695034,0.004756532],"genre_scores_gemma":[0.9552772,0.03242807,0.0040647713,0.00703751,0.00010076624,0.0009593209,0.000008815451,0.000024914752,0.00009862367],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970934,0.0007051976,0.000650826,0.00080425054,0.000414339,0.0003319854],"domain_scores_gemma":[0.9978913,0.0007299726,0.00034810937,0.00073973835,0.00016377235,0.00012711987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078906945,0.00034302066,0.0009032818,0.000118829725,0.00013977924,0.00010784465,0.0005822476,0.000050062383,0.0000021651902],"category_scores_gemma":[0.0012566022,0.00029811668,0.00026647706,0.0017345465,0.00012258904,0.0008445644,0.00030844365,0.00056475407,0.00006821976],"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.0000056938284,0.00048229037,0.00026542344,0.004353794,0.000031911884,0.000001501781,0.00045521333,0.000042457417,0.029817823,0.48106775,0.0006588567,0.4828173],"study_design_scores_gemma":[0.0008243836,0.00045572783,0.009315994,0.057285488,0.00037806114,0.000012867314,0.0000496849,0.36683208,0.09358179,0.386656,0.08299803,0.0016099355],"about_ca_topic_score_codex":0.000037402806,"about_ca_topic_score_gemma":0.000006189044,"teacher_disagreement_score":0.8938183,"about_ca_system_score_codex":0.000114955794,"about_ca_system_score_gemma":0.00009532814,"threshold_uncertainty_score":0.9999471},"labels":[],"label_agreement":null},{"id":"W4416799931","doi":"10.1109/snpd65828.2025.11253527","title":"Schizophrenia Detection using non-Orthogonal Adaptive Constrained Independent Vector Analysis with Multivariate Distribution","year":2025,"lang":"","type":"article","venue":"","topic":"Blind Source Separation 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":"Algoma University; Concordia University","funders":"","keywords":"Independent component analysis; Multivariate statistics; Pattern recognition (psychology); Multivariate normal distribution; Mixture model; Gaussian; Component analysis; Blind signal separation; Component (thermodynamics)","score_opus":0.014819618053382982,"score_gpt":0.2720386963197823,"score_spread":0.2572190782663993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416799931","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.12893279,0.000025434218,0.8686307,0.00026071092,0.00024798,0.0007698017,0.00009752984,0.00027607067,0.0007589592],"genre_scores_gemma":[0.93101156,0.000004241207,0.06843169,0.00015471679,0.00004916323,0.00004121372,0.0000798552,0.000014339209,0.00021323153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608046,0.00048750706,0.00085281255,0.0012615988,0.00075381517,0.0005638307],"domain_scores_gemma":[0.99743783,0.00017367754,0.00054074073,0.00080666295,0.0008433232,0.00019778038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009564909,0.00054134324,0.0006837817,0.0009709439,0.0006553,0.0007542331,0.0006082358,0.00037780957,0.000084897896],"category_scores_gemma":[0.00006729241,0.00049886364,0.00035719396,0.006162931,0.0002943198,0.001084451,0.00036239313,0.0006662567,0.000011839991],"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.0071337423,0.0027899938,0.010380237,0.00017685111,0.02090996,0.000159543,0.00588648,0.14632905,0.06957257,0.5407523,0.00008474904,0.19582452],"study_design_scores_gemma":[0.0015112726,0.00034875993,0.044236165,0.00010081592,0.0010653989,0.000012791666,0.00016287733,0.90308326,0.048297714,0.0006452986,0.000029201301,0.00050644233],"about_ca_topic_score_codex":0.0010458067,"about_ca_topic_score_gemma":0.001508422,"teacher_disagreement_score":0.8020788,"about_ca_system_score_codex":0.00061055954,"about_ca_system_score_gemma":0.0012744277,"threshold_uncertainty_score":0.9997463},"labels":[],"label_agreement":null},{"id":"W571574196","doi":"","title":"Deterministic Independent Component Analysis","year":2015,"lang":"en","type":"article","venue":"International Conference on Machine Learning","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":"University of Alberta","funders":"","keywords":"Independent component analysis; Algorithm; Gaussian; Component (thermodynamics); Computer science; Mixing (physics); Mathematics; Matrix (chemical analysis); Polynomial; Applied mathematics; Artificial intelligence; Mathematical analysis; Physics","score_opus":0.07364211003263099,"score_gpt":0.3404124261591362,"score_spread":0.2667703161265052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W571574196","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.025181076,0.000012569404,0.9069139,0.0037702727,0.00027416626,0.00008961566,0.000003850229,0.00043567305,0.06331888],"genre_scores_gemma":[0.98799044,0.0000069437456,0.010145612,0.0006242365,0.00003621362,0.000014120301,0.000044966175,0.000007066202,0.0011304005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983686,0.00020974477,0.00024998022,0.00034641087,0.0006787669,0.00014647083],"domain_scores_gemma":[0.9990647,0.00007439789,0.00016794486,0.0002731691,0.0002905254,0.00012925551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005822962,0.00013857298,0.00016945945,0.00048305208,0.000065551336,0.00038421573,0.0009524565,0.000051606123,0.00013074723],"category_scores_gemma":[0.00017392213,0.00013101583,0.000089927205,0.00033162956,0.000025358584,0.00028455618,0.00024914197,0.0003948259,0.00016778096],"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.00004366535,0.00016895952,0.018315671,0.0000024621786,0.00032464022,0.00006100805,0.0020217206,0.02346637,0.00050907227,0.9315175,0.00018002895,0.023388943],"study_design_scores_gemma":[0.00027728814,0.00014724938,0.0040881857,0.000009369794,0.000018548066,0.000010274532,0.000045378107,0.9831398,0.00026467143,0.0066527044,0.0051764403,0.00017010634],"about_ca_topic_score_codex":0.000117193165,"about_ca_topic_score_gemma":0.000048508864,"teacher_disagreement_score":0.9628094,"about_ca_system_score_codex":0.00009328776,"about_ca_system_score_gemma":0.0000903403,"threshold_uncertainty_score":0.53426707},"labels":[],"label_agreement":null},{"id":"W6986888186","doi":"","title":"Review of \"An Introduction to Statistical Signal Processing by R. M. Gray and L. D. Davisson\" Cambridge University Press, 2004","year":2006,"lang":"en","type":"article","venue":"NPARC","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Gray (unit); Signal processing; Pattern recognition (psychology); Statistical analysis; Statistical signal processing","score_opus":0.0075297984733772765,"score_gpt":0.2436708123757035,"score_spread":0.23614101390232622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6986888186","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.0012529473,0.0008649616,0.99087787,0.0037317413,0.000015726648,0.00020969396,0.000019350131,0.0001193541,0.0029083362],"genre_scores_gemma":[0.30143744,0.00068552536,0.6941834,0.0014315951,0.00024103202,0.000009216617,0.00008876744,0.000018700292,0.0019043369],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99929386,0.00009027593,0.00013182152,0.00023798215,0.00014950546,0.000096535005],"domain_scores_gemma":[0.9995911,0.000015597812,0.000066319946,0.0001686369,0.0001020794,0.000056238092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002750911,0.00006379651,0.000113096925,0.00003543967,0.0000507421,0.000039059374,0.00018842351,0.000026099051,0.000008814978],"category_scores_gemma":[0.000015802998,0.00006442304,0.00001052415,0.00016982752,0.00004193916,0.000359152,0.00006190801,0.00006472045,8.993178e-7],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009893269,0.000121493424,0.000021301104,0.00048023998,0.0000027775154,0.0000028979512,0.00006322208,0.000012892813,0.015513837,0.12759039,0.7984246,0.057756446],"study_design_scores_gemma":[0.0003352179,0.00047299673,0.0007780061,0.0006560496,0.00002851507,0.000029703826,0.000016434897,0.01785015,0.057493992,0.0020030856,0.9199258,0.00041004896],"about_ca_topic_score_codex":0.00005469804,"about_ca_topic_score_gemma":0.0000020099867,"teacher_disagreement_score":0.3001845,"about_ca_system_score_codex":0.000024888837,"about_ca_system_score_gemma":0.000041419167,"threshold_uncertainty_score":0.26270953},"labels":[],"label_agreement":null},{"id":"W6990480965","doi":"","title":"Dipole localization using simulated intracerebral electroencephalograms","year":2004,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Blind Source Separation Techniques","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":true,"ca_institutions":"","funders":"Canadian Institutes of Health Research","keywords":"Dipole; Beamforming; Focus (optics); SIGNAL (programming language); Noise (video); Amplitude; Orientation (vector space); Plane (geometry)","score_opus":0.01547834961307859,"score_gpt":0.26271580265119354,"score_spread":0.24723745303811495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6990480965","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9585427,0.00045607638,0.0086555295,0.000061793544,0.0020520203,0.0022930263,0.00017689251,0.0046313824,0.023130562],"genre_scores_gemma":[0.9813683,0.00008518696,0.015742442,0.00063927146,0.000046070785,0.000029507359,0.0009406124,0.00018033877,0.0009682448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9947099,0.0005199174,0.0011317879,0.0015395978,0.0011199211,0.0009788944],"domain_scores_gemma":[0.99668145,0.00011088814,0.000887362,0.0012378641,0.0007375899,0.0003448262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085016625,0.0008979035,0.00075127097,0.00077118684,0.0011163302,0.0005420445,0.0018325588,0.0011811575,0.00007772311],"category_scores_gemma":[0.00033532054,0.0010131535,0.0003531881,0.0019351792,0.00006987692,0.0025257822,0.00022720601,0.0017174669,0.00018296302],"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.00013600245,0.0006987194,0.00005603928,0.00032979454,0.00031983329,0.00012374204,0.00015404203,0.037749257,0.045586154,0.7861646,0.000008784874,0.12867305],"study_design_scores_gemma":[0.0020502096,0.0007488248,0.0003309936,0.0011901049,0.0002783051,0.00013069085,0.00018478064,0.08505106,0.52481705,0.365222,0.016297152,0.0036988228],"about_ca_topic_score_codex":0.0006109953,"about_ca_topic_score_gemma":0.0005509472,"teacher_disagreement_score":0.47923088,"about_ca_system_score_codex":0.0013009635,"about_ca_system_score_gemma":0.0002746217,"threshold_uncertainty_score":0.9992319},"labels":[],"label_agreement":null},{"id":"W7008330546","doi":"","title":"Blind demodulation techniques in interception of MIMO signals","year":2009,"lang":"fr","type":"other","venue":"OpenGrey (Institut de l'Information Scientifique et Technique)","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"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":"Demodulation; Transmission (telecommunications); Nova scotia","score_opus":0.03119344000366426,"score_gpt":0.30093121026743097,"score_spread":0.2697377702637667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7008330546","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.0007860007,0.000078223035,0.730227,0.0018482072,0.0004143382,0.010699829,0.000050354367,0.00084171793,0.25505432],"genre_scores_gemma":[0.16891605,0.00089660246,0.7726263,0.0044806134,0.0001932708,0.003270658,0.0006889363,0.00019816379,0.048729397],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9927987,0.0012452864,0.002804005,0.0009913195,0.0013119408,0.00084875704],"domain_scores_gemma":[0.99430764,0.00018446168,0.0023148144,0.0016621208,0.0012581889,0.00027279003],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.010221341,0.00089381647,0.0010825922,0.0041140495,0.00021894876,0.0014505809,0.0023950387,0.0015806587,0.001268574],"category_scores_gemma":[0.00079708843,0.0009885199,0.00037527372,0.0029318256,0.000510622,0.00958765,0.0005979352,0.0013830353,0.00033635926],"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.00011543763,0.00056433806,0.00024329478,0.0010055493,0.000044556673,0.000019630144,0.013001736,0.0015794979,0.029479044,0.2328194,0.023592198,0.69753534],"study_design_scores_gemma":[0.001002833,0.0003546414,0.0020782615,0.0075100767,0.000044761106,0.000085980195,0.00013409372,0.025381848,0.3251426,0.01502695,0.6216848,0.0015531873],"about_ca_topic_score_codex":0.00061919744,"about_ca_topic_score_gemma":0.0011978286,"teacher_disagreement_score":0.69598216,"about_ca_system_score_codex":0.0009831373,"about_ca_system_score_gemma":0.0015217006,"threshold_uncertainty_score":0.9997155},"labels":[],"label_agreement":null},{"id":"W7011850740","doi":"","title":"A novel postsynaptic role for DDC in synaptic plasticity in the adult mammalian hippocampus","year":2014,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Blind Source Separation Techniques","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":"McGill University","keywords":"Dendritic spine; Postsynaptic potential; Synapse; Hippocampal formation; Deleted in Colorectal Cancer; Hippocampus; Synaptic plasticity; Biological neural network; Neuron; Neuroplasticity","score_opus":0.013070170279371041,"score_gpt":0.24759745388703785,"score_spread":0.2345272836076668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7011850740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98300636,0.000067454544,0.0010162332,0.00022286856,0.0006915341,0.0027186205,0.00025445953,0.00051461125,0.011507857],"genre_scores_gemma":[0.9843665,0.000019831632,0.012254832,0.0015372519,0.000035843765,0.0010432317,0.00026037704,0.00011277725,0.000369399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947785,0.00068873254,0.0012521871,0.0014340515,0.0008909634,0.00095557654],"domain_scores_gemma":[0.996196,0.0012825292,0.00068826106,0.0011723547,0.00047570257,0.00018516196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021371166,0.0007964794,0.0008353686,0.0009510629,0.00049711147,0.00034675517,0.0031171665,0.0009930569,0.000012505066],"category_scores_gemma":[0.0020096442,0.0007319483,0.00032709097,0.0011582666,0.000060264272,0.0010262822,0.00019950117,0.0019225883,0.000099808596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024523248,0.00066526973,0.000050699233,0.00037452846,0.00008376954,0.000042048385,0.0002820384,0.00024303989,0.015698891,0.9118405,0.000009943524,0.07046407],"study_design_scores_gemma":[0.009615728,0.0027431983,0.017702375,0.0033990066,0.0003667265,0.0003404392,0.0023842356,0.0713886,0.053380992,0.8129641,0.018810945,0.006903676],"about_ca_topic_score_codex":0.0006480888,"about_ca_topic_score_gemma":0.013743886,"teacher_disagreement_score":0.098876394,"about_ca_system_score_codex":0.0005681791,"about_ca_system_score_gemma":0.00012920101,"threshold_uncertainty_score":0.99951315},"labels":[],"label_agreement":null},{"id":"W7036448826","doi":"","title":"Carlin Spins Out Yukon Joint Venture Properties","year":2012,"lang":"en","type":"other","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.05091230366292001,"score_gpt":0.25478797510180234,"score_spread":0.20387567143888233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036448826","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000023425864,0.0011985843,0.25866482,0.00073790364,0.00048663898,0.00029900804,0.0000019451932,0.0017848948,0.73682386],"genre_scores_gemma":[0.001847436,0.00007246685,0.048590366,0.0009954515,0.0003608321,0.00004012307,0.000005659322,0.00014726695,0.9479404],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896926,0.00006272083,0.00017281191,0.00030848896,0.0002588468,0.00022784587],"domain_scores_gemma":[0.999006,0.0000032217456,0.00013581503,0.00074651965,0.000032053926,0.00007642794],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016648567,0.00022160042,0.00023553288,0.00020554,0.00002824196,0.00013907343,0.00063664117,0.0003116177,0.00069657824],"category_scores_gemma":[0.000009234224,0.00016036956,0.00008726475,0.00008473249,0.00003285485,0.00015758662,0.00024519715,0.00023852261,0.00084134436],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.28096e-7,0.000040074112,0.000005294984,0.000034706492,0.000018067933,0.0000015422022,0.00084609503,4.69575e-7,0.0001843082,0.038489792,0.9547678,0.005611369],"study_design_scores_gemma":[0.000051391427,0.000030060948,0.000017314942,0.000103428654,0.0000051574834,0.0000031633147,0.000010570111,0.00016746501,0.0040577473,0.0002406422,0.9950584,0.00025464344],"about_ca_topic_score_codex":0.00013995706,"about_ca_topic_score_gemma":0.000107399275,"teacher_disagreement_score":0.21111654,"about_ca_system_score_codex":0.00003269195,"about_ca_system_score_gemma":0.000070120725,"threshold_uncertainty_score":0.99993664},"labels":[],"label_agreement":null},{"id":"W7037076297","doi":"","title":"Distributed Fault Detection in Formation of Multi-Agent Systems with Attack Impact Analysis","year":2019,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Blind Source Separation Techniques","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":"Concordia University","keywords":"Filter (signal processing); Fault (geology); Tracking system; Noise (video); Frame (networking); Synchronism","score_opus":0.03202938077433503,"score_gpt":0.3135625680442679,"score_spread":0.28153318726993287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7037076297","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7736628,0.00006361158,0.22139509,0.00002472779,0.0001869027,0.0009806061,0.000026200389,0.0001456923,0.0035143676],"genre_scores_gemma":[0.9957071,0.000046087203,0.00013895262,9.966353e-7,0.000019558165,0.000009058745,0.0002958977,0.000018779609,0.00376357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964891,0.00097734,0.00044926093,0.0006422394,0.00097100716,0.0004710385],"domain_scores_gemma":[0.9975318,0.00016551054,0.0005604468,0.00092175615,0.0006716834,0.00014883016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083796383,0.0002782529,0.00058581954,0.004157952,0.00020101684,0.00026782244,0.0010501376,0.0003558822,0.0000030629271],"category_scores_gemma":[0.000037365833,0.00027046876,0.00027553097,0.0058214455,0.00007033189,0.0011521265,0.0001240581,0.0008364683,0.000009353604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009484793,0.004363038,0.386019,0.0062018116,0.011321044,0.0033918717,0.035654426,0.40664223,0.1085867,0.017105607,0.0011931822,0.010036303],"study_design_scores_gemma":[0.0019025033,0.0017577127,0.2941405,0.00044743108,0.00032955818,0.000028787916,0.0050265365,0.55703044,0.13732977,0.000028818073,0.0010433207,0.0009346469],"about_ca_topic_score_codex":0.019633548,"about_ca_topic_score_gemma":0.031178633,"teacher_disagreement_score":0.2220443,"about_ca_system_score_codex":0.0015861893,"about_ca_system_score_gemma":0.00071451825,"threshold_uncertainty_score":0.9999747},"labels":[],"label_agreement":null},{"id":"W7097683588","doi":"","title":"Author manuscript, published in &amp;quot;38th International Conference on Acoustics, Speech, and Signal Processing (ICASSP), Vancouver: Canada (2013)&amp;quot; JOINT BSS AS A NATURAL ANALYSIS FRAMEWORK FOR EEG-HYPERSCANNING","year":2013,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"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":"Blind signal separation; Joint (building); Signal processing; Source separation; Point (geometry); Independent component analysis; SIGNAL (programming language)","score_opus":0.04188831268109783,"score_gpt":0.29523085917254643,"score_spread":0.2533425464914486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097683588","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.04437458,0.000050753613,0.940117,0.012081218,0.0006883412,0.0006532423,0.0000141012615,0.00028338344,0.0017373948],"genre_scores_gemma":[0.63568205,0.0000048627617,0.35765246,0.0020425017,0.00006262646,0.00009563155,0.000031582364,0.00001623305,0.0044120834],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996875,0.00010897574,0.00068082626,0.00091722346,0.00086403446,0.00055395986],"domain_scores_gemma":[0.99777126,0.00023523397,0.00035816288,0.0005403421,0.00084433635,0.0002506697],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006918717,0.00036266958,0.00050234736,0.0007423198,0.00020798921,0.0016917614,0.0010156401,0.0002187121,0.00043996784],"category_scores_gemma":[0.00043098634,0.00032328343,0.000115138784,0.0009506448,0.000088393266,0.0015505386,0.000308488,0.00067346124,0.000009930684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020654772,0.0007421907,0.010218124,0.00026799866,0.001179403,0.000071238086,0.012965195,0.0055692303,0.01032406,0.1908697,0.6633733,0.104213014],"study_design_scores_gemma":[0.0007703696,0.00014890888,0.0074600126,0.00024395902,0.00010675298,0.000022117898,0.0015889342,0.9179944,0.0013280698,0.05308176,0.016090838,0.0011638821],"about_ca_topic_score_codex":0.093308195,"about_ca_topic_score_gemma":0.3155867,"teacher_disagreement_score":0.91242516,"about_ca_system_score_codex":0.00038775837,"about_ca_system_score_gemma":0.00075696467,"threshold_uncertainty_score":0.9999219},"labels":[],"label_agreement":null},{"id":"W7132948642","doi":"","title":"Analysis of electrical activities in hippocampal slices using coherence measures","year":2005,"lang":"","type":"dissertation","venue":"TSpace","topic":"Blind Source Separation 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":"Library and Archives Canada","funders":"","keywords":"Coherence (philosophical gambling strategy); Hippocampal formation; SIGNAL (programming language); Signal processing; Wavelet; Pattern recognition (psychology); Wavelet transform","score_opus":0.04618058818482126,"score_gpt":0.3766886972671009,"score_spread":0.3305081090822797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132948642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88870645,0.0011076403,0.10681529,0.00010005591,0.00012838829,0.00046340673,0.0000048247193,0.00012526319,0.0025486734],"genre_scores_gemma":[0.97640175,0.0002450314,0.022272166,0.0000800622,0.000055773202,0.00003475589,0.000044694363,0.000029293053,0.0008364754],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953987,0.0007691407,0.0010337364,0.0009711891,0.0012477953,0.0005794258],"domain_scores_gemma":[0.9968843,0.0004668435,0.0012847228,0.0008437624,0.00039060708,0.00012976369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012302409,0.00055768574,0.0013808528,0.0031730658,0.00014174951,0.00031097006,0.0012781484,0.0006068934,0.00014569241],"category_scores_gemma":[0.0001906526,0.0006259246,0.00045406396,0.0069554904,0.00013419492,0.0007808206,0.00010746384,0.0008281007,0.0000043205314],"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.0008834374,0.0024310832,0.05657368,0.00045466074,0.004819312,0.000044025554,0.48763716,0.09402832,0.13918461,0.02296546,0.00015051659,0.19082776],"study_design_scores_gemma":[0.00046499373,0.00035127148,0.04952021,0.00041543524,0.0015646046,0.000005007982,0.009137539,0.8069241,0.12968872,0.00040134497,0.00021162527,0.0013151702],"about_ca_topic_score_codex":0.0021898034,"about_ca_topic_score_gemma":0.0057023247,"teacher_disagreement_score":0.71289575,"about_ca_system_score_codex":0.00031874343,"about_ca_system_score_gemma":0.0009487978,"threshold_uncertainty_score":0.9996192},"labels":[],"label_agreement":null},{"id":"W76729348","doi":"10.5281/zenodo.1078225","title":"Blind Impulse Response Identification Of Frequency Radio Channels: Application To Bran A Channel","year":2007,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Blind Source Separation Techniques","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":"Agence Universitaire de la Francophonie","keywords":"Channel (broadcasting); Impulse response; Identification (biology); Computer science; Telecommunications; Speech recognition; Mathematics; Biology","score_opus":0.027841337487976403,"score_gpt":0.27885045846763756,"score_spread":0.25100912097966116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76729348","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.028641319,0.000027577918,0.96275884,0.0019844023,0.00008068115,0.00080236665,0.000028527274,0.0010339918,0.0046422975],"genre_scores_gemma":[0.9945866,0.000012440229,0.0043150755,0.00028490345,0.00006984482,2.8179198e-7,0.0001621714,0.0003490713,0.00021964291],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774706,0.00043259864,0.0005211574,0.0005115574,0.00047041627,0.00031718716],"domain_scores_gemma":[0.99772495,0.00006249492,0.00024969436,0.0009090155,0.0008536844,0.00020014425],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004570237,0.00013526491,0.00014691993,0.00071568333,0.000745151,0.0005357474,0.0018158795,0.000084926454,0.00014300914],"category_scores_gemma":[0.0007626991,0.00015471193,0.000053172593,0.0015888328,0.00008013113,0.00055823365,0.00056611537,0.00018369191,0.0013234108],"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.0007041573,0.00048768066,0.0000037183202,0.000072218856,0.00004586176,0.000010298022,0.019044636,0.00046845994,0.6289042,0.084867716,0.022687454,0.24270357],"study_design_scores_gemma":[0.0019324692,0.0015594562,0.006014396,0.00009124644,0.000022812057,0.00023025757,0.0007747566,0.018857649,0.33926648,0.01099744,0.6193016,0.0009514312],"about_ca_topic_score_codex":0.000024434565,"about_ca_topic_score_gemma":6.471859e-7,"teacher_disagreement_score":0.96594524,"about_ca_system_score_codex":0.00014591153,"about_ca_system_score_gemma":0.000008972885,"threshold_uncertainty_score":0.9994542},"labels":[],"label_agreement":null},{"id":"W82822220","doi":"10.1007/978-3-540-79224-6_3","title":"Bispectrum and Bicoherence","year":2008,"lang":"en","type":"book-chapter","venue":"Advances in industrial control","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bispectrum; Bicoherence; Computer science; Mathematics; Statistics; Spectral density","score_opus":0.027245597751589443,"score_gpt":0.2549760160136277,"score_spread":0.22773041826203824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W82822220","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003774115,0.016496025,0.12771499,0.0022981595,0.0011996357,0.0016462004,0.000036854908,0.00066382514,0.84990656],"genre_scores_gemma":[0.54798275,0.070415884,0.031790875,0.008092308,0.0038430893,0.0005667421,0.000049536004,0.00033190407,0.33692688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983201,0.000062946136,0.0004584469,0.0005851194,0.00031734302,0.00025605716],"domain_scores_gemma":[0.9987441,0.0002976562,0.0003076706,0.00050975534,0.000055171615,0.00008567481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029525193,0.00031358365,0.0004943486,0.0003165237,0.00007152223,0.000098067765,0.0006783793,0.0005237361,0.000032743912],"category_scores_gemma":[0.00009100762,0.0003099619,0.00006838,0.00009223879,0.00015915647,0.00082688214,0.00013997253,0.0009038675,0.000023979748],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045785335,0.000015751115,0.00013855565,0.0000059728673,0.000019497942,0.00007849772,0.00015772023,0.000036711866,0.000009753458,0.75174886,0.0020398747,0.24570303],"study_design_scores_gemma":[0.0017967084,0.00022897127,0.000012856796,0.0001571351,0.000008152436,0.00003370611,0.0000019455956,0.0007872777,0.00007869443,0.06769384,0.928743,0.0004577142],"about_ca_topic_score_codex":0.000013867965,"about_ca_topic_score_gemma":0.000059717142,"teacher_disagreement_score":0.9267031,"about_ca_system_score_codex":0.000072975105,"about_ca_system_score_gemma":0.00018448601,"threshold_uncertainty_score":0.99993527},"labels":[],"label_agreement":null},{"id":"W85383986","doi":"","title":"A table of lower bounds for the number of mutually orthogonal frequency squares","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Table (database); Combinatorics; Arithmetic; Statistics; Computer science","score_opus":0.014791926258050906,"score_gpt":0.2795426746781005,"score_spread":0.2647507484200496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85383986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.856582,0.0001990553,0.13003266,0.0011083629,0.0012020618,0.0005612046,0.000010961431,0.00018779935,0.010115914],"genre_scores_gemma":[0.98650116,0.000020526626,0.012968555,0.00016583747,0.000007855277,0.000050060473,0.000002256811,0.000009878277,0.0002738489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897027,0.000053579573,0.00031466805,0.00019251108,0.00028637575,0.0001825867],"domain_scores_gemma":[0.9985294,0.0003323474,0.00019354116,0.0005681979,0.0003406817,0.0000358452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005296435,0.000103514096,0.00017685232,0.000046762023,0.00008752479,0.000051279127,0.0008167925,0.0000701329,0.00004770006],"category_scores_gemma":[0.00009554765,0.00008046099,0.00009529742,0.00041565308,0.00009293949,0.00032191558,0.00011165053,0.00009205879,0.0000057705097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000134702905,0.00013043404,0.0046403315,0.00000929935,0.000020492107,0.0000014252446,0.00039887452,0.000007082997,0.00060982216,0.9919178,0.0015362807,0.0007147048],"study_design_scores_gemma":[0.00058933155,0.00027809708,0.003934389,0.00002660461,0.000012815525,0.000015938645,0.000039032,0.0021285499,0.007056601,0.9792016,0.0065646954,0.00015234342],"about_ca_topic_score_codex":0.00007314394,"about_ca_topic_score_gemma":0.000014681634,"teacher_disagreement_score":0.12991919,"about_ca_system_score_codex":0.000014903504,"about_ca_system_score_gemma":0.00015532774,"threshold_uncertainty_score":0.3281104},"labels":[],"label_agreement":null},{"id":"W91053303","doi":"10.5006/c2001-01283","title":"Applications of Electrochemical Noise: Real Time Plant and Field Challenges","year":2001,"lang":"en","type":"article","venue":"","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":"Chevron (Canada)","funders":"","keywords":"Electrochemical noise; Noise (video); Electrochemistry; Field (mathematics); Materials science; Electrical engineering; Electronic engineering; Computer science; Acoustics; Environmental science; Electrode; Engineering; Physics; Artificial intelligence","score_opus":0.011858820795191788,"score_gpt":0.25509441838409436,"score_spread":0.24323559758890256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W91053303","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.006476846,0.00017187394,0.8812986,0.0052384753,0.000004135982,0.00015177508,5.0280215e-7,0.00030623513,0.106351525],"genre_scores_gemma":[0.88037926,0.002937128,0.11465634,0.0006326699,0.00004419737,0.00007248696,0.0000050931976,0.0000065602103,0.0012662405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996123,0.000012753325,0.0000922187,0.0001339526,0.00007558586,0.000073244286],"domain_scores_gemma":[0.9996291,0.00008190795,0.000028127606,0.00020383394,0.000026245454,0.000030833624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000085286214,0.000042412823,0.000066830115,0.000040088747,0.000017903898,0.000014012461,0.00019676358,0.0000447964,0.000016731437],"category_scores_gemma":[0.000005879466,0.000037469617,0.000012816405,0.00008403679,0.000014098409,0.00008603027,0.000060383518,0.000046244335,0.00000799364],"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.0000076180722,0.00008654082,0.00010893311,0.000010195108,0.000009156403,0.0000010119619,0.00057162525,2.2268188e-7,0.0917733,0.8428542,0.002261115,0.06231605],"study_design_scores_gemma":[0.00034418335,0.00044512269,0.0010356134,0.00001819204,0.000008187234,0.0001175291,0.00003980245,0.017986212,0.8482579,0.049741287,0.081641875,0.00036407093],"about_ca_topic_score_codex":0.000011160627,"about_ca_topic_score_gemma":0.0000043980817,"teacher_disagreement_score":0.87390244,"about_ca_system_score_codex":0.0000039007473,"about_ca_system_score_gemma":0.000013513713,"threshold_uncertainty_score":0.15279667},"labels":[],"label_agreement":null}]}