{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023148004,0.0071737356,0.83249503,0.0047001797,0.0009920693,0.00015769662,0.0013150482,0.00038105762,0.12963712],"genre_scores_gemma":[0.60053486,0.00920316,0.3388842,0.0023351707,0.0026703542,0.0006521632,0.0016600797,0.00042513746,0.043634865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993508,0.0019205809,0.00036853462,0.0010096398,0.0025657932,0.00062751153],"domain_scores_gemma":[0.98889285,0.005918967,0.00083266915,0.0012828546,0.0021596856,0.0009130794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004018123,0.0011714849,0.0021091406,0.003765845,0.0027119117,0.0089289285,0.002062719,0.0021727702,0.008476177],"category_scores_gemma":[0.01517856,0.00082855864,0.0013333363,0.0040139193,0.008953355,0.009559322,0.00441647,0.0055996026,0.002915194],"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.000029133904,0.000009072805,0.00006671756,0.00003724816,0.0000086484015,0.000038264727,0.00005641166,0.0024211414,0.00014330326,0.9902559,0.0014218285,0.0055123344],"study_design_scores_gemma":[0.0000145200775,0.000017532037,0.000042059655,0.00002749573,0.000004575167,0.00008894109,0.000033245888,0.017015183,0.00025991022,0.97216254,0.010311652,0.000022353826],"about_ca_topic_score_codex":0.0025333564,"about_ca_topic_score_gemma":0.0012066236,"teacher_disagreement_score":0.0089289285,"about_ca_system_score_codex":0.0033669278,"about_ca_system_score_gemma":0.0027878587,"threshold_uncertainty_score":0.028355598},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011944257,0.00030422374,0.98634106,0.0002033882,0.000043722594,0.000019762576,0.000071375005,0.00018660034,0.0008856321],"genre_scores_gemma":[0.2771485,0.0014515151,0.71608573,0.00025110578,0.00024053988,0.00015351266,0.0008388055,0.00013937248,0.0036908996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903786,0.00030904284,0.000057370784,0.000097272925,0.00042606157,0.00007236111],"domain_scores_gemma":[0.99727964,0.001623414,0.00020748885,0.00030560757,0.00052675745,0.000057070483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001587064,0.00070354895,0.0007415712,0.001303155,0.00040607224,0.0007607192,0.0006690823,0.0009122012,0.0009659344],"category_scores_gemma":[0.008516725,0.00037398937,0.0005290207,0.0022903734,0.0009688852,0.0015042215,0.0014841569,0.00090796046,0.00056286785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060613564,0.00008783603,0.0012430273,0.00041172517,0.00010000577,0.00038985093,0.00051334983,0.30837476,0.07386472,0.07020279,0.0043690866,0.5398366],"study_design_scores_gemma":[0.000026126616,0.000057274705,0.0005503032,0.00004271511,0.00002423351,0.0001879714,0.0000684147,0.9454538,0.018450508,0.031396694,0.0037152185,0.000026825739],"about_ca_topic_score_codex":0.0020749883,"about_ca_topic_score_gemma":0.0026650412,"teacher_disagreement_score":0.0020749883,"about_ca_system_score_codex":0.00039056738,"about_ca_system_score_gemma":0.0008036171,"threshold_uncertainty_score":0.008393288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005598988,0.00008497922,0.9938804,0.000044331005,0.000014540463,0.000007098414,0.000010424236,0.00015455637,0.00020461669],"genre_scores_gemma":[0.44448918,0.00030513376,0.552034,0.00008466897,0.000067096626,0.000084100815,0.00014110855,0.00005949944,0.0027352406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968493,0.00011330364,0.0000222639,0.0000642031,0.000096321644,0.00001901331],"domain_scores_gemma":[0.99915266,0.00048152835,0.0001061999,0.00009525654,0.00014632527,0.000017905173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087347836,0.00043208187,0.0006865502,0.00036688393,0.00021918904,0.00040724687,0.0004987426,0.0007005882,0.0007801541],"category_scores_gemma":[0.0034583663,0.0002898169,0.00038848753,0.00035120064,0.00051108224,0.0009822934,0.00063852716,0.0006154704,0.00039869602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036415254,0.000075159274,0.0023984623,0.0002973839,0.00017414747,0.00010260082,0.00018211117,0.6402864,0.029691309,0.03207425,0.0013669623,0.29298708],"study_design_scores_gemma":[0.000014804753,0.000035729525,0.00027052817,0.000006753971,0.000007927338,0.00004537683,0.000006044638,0.9923735,0.004042609,0.0024119387,0.00077425805,0.000010521436],"about_ca_topic_score_codex":0.00084247335,"about_ca_topic_score_gemma":0.0008104985,"teacher_disagreement_score":0.00087347836,"about_ca_system_score_codex":0.0002448397,"about_ca_system_score_gemma":0.00050035276,"threshold_uncertainty_score":0.0046194196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016932612,0.00011026891,0.99750394,0.000040143408,0.000013681104,0.000009561858,0.000012406991,0.00016710318,0.00044965025],"genre_scores_gemma":[0.107081525,0.0003782147,0.8897546,0.00011937587,0.000067651905,0.00009910046,0.00014049544,0.00006614944,0.002292902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995493,0.00014956834,0.000023334387,0.00007585214,0.00017224028,0.000029594443],"domain_scores_gemma":[0.9994105,0.00022085494,0.00009318701,0.000099780744,0.0001529673,0.000022771497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041981373,0.0008011089,0.0005357113,0.00035227853,0.0002630464,0.0004791218,0.000737118,0.000631241,0.0016900379],"category_scores_gemma":[0.0014851976,0.00024758294,0.0004645366,0.00072803063,0.0005283832,0.0008899719,0.00069621735,0.00083959906,0.0009640675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023338776,0.00006699163,0.00055559387,0.00033568116,0.00009545332,0.00012952714,0.00013264836,0.3667809,0.0729741,0.046988413,0.003970262,0.50773704],"study_design_scores_gemma":[0.000024286946,0.00008135291,0.00016997902,0.000009173506,0.0000122389665,0.000127408,0.000017912802,0.9768768,0.012024786,0.007110596,0.003522477,0.000022911414],"about_ca_topic_score_codex":0.00063044863,"about_ca_topic_score_gemma":0.0010935086,"teacher_disagreement_score":0.0016900379,"about_ca_system_score_codex":0.00028793557,"about_ca_system_score_gemma":0.0006149568,"threshold_uncertainty_score":0.005653739},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003724588,0.00033723607,0.9861623,0.00012460575,0.000081087535,0.000080979196,0.00007642216,0.0007323179,0.008680462],"genre_scores_gemma":[0.1285839,0.0007189584,0.8628954,0.0002713953,0.00008794361,0.0001746554,0.00023121537,0.00008679529,0.0069496916],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974304,0.00004824676,0.000031910276,0.000038349783,0.00010460173,0.000033752473],"domain_scores_gemma":[0.99980634,0.000049362523,0.000020586016,0.000033720247,0.00008148305,0.000008402707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023575024,0.00044410085,0.00026457792,0.0005913137,0.0003912594,0.0011224953,0.0007406708,0.00052500126,0.0065920665],"category_scores_gemma":[0.00055924326,0.00027100032,0.00037291757,0.0005763307,0.00037798297,0.000814648,0.00034290977,0.0006973213,0.0017316435],"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.0001987676,0.0000760256,0.00022869177,0.00051222224,0.00005677391,0.00027058338,0.00018967893,0.041269325,0.19918063,0.35874242,0.0061102416,0.39316472],"study_design_scores_gemma":[0.00014999886,0.00058192556,0.00044694435,0.00021102071,0.00013998094,0.0010319643,0.00007091562,0.5171493,0.22535087,0.14869913,0.10605228,0.00011567106],"about_ca_topic_score_codex":0.00097590825,"about_ca_topic_score_gemma":0.001880242,"teacher_disagreement_score":0.0065920665,"about_ca_system_score_codex":0.0006055558,"about_ca_system_score_gemma":0.0007491405,"threshold_uncertainty_score":0.022052646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060612578,0.00071202836,0.93544626,0.00016724832,0.00012272719,0.000018845913,0.00006635976,0.0006662968,0.0021876304],"genre_scores_gemma":[0.60081303,0.0014751018,0.38207018,0.00020979112,0.00019205434,0.00004996109,0.0003418427,0.00014124849,0.014706785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995407,0.000087495486,0.000027062682,0.00009069935,0.00018551646,0.000068624926],"domain_scores_gemma":[0.9983582,0.0012285537,0.00009880074,0.000117091025,0.00017010682,0.000027236696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059257186,0.00066536583,0.00074392796,0.000499293,0.0002376269,0.0006881046,0.00063808216,0.0014134519,0.0017270928],"category_scores_gemma":[0.003270516,0.00035636115,0.00024479255,0.00046862705,0.0005002798,0.0010760992,0.00086411403,0.0006919008,0.0005921289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014230323,0.00015850029,0.0017673008,0.00029907777,0.0001447771,0.00029688477,0.00018139854,0.07612347,0.18026222,0.018504817,0.002240474,0.71859807],"study_design_scores_gemma":[0.00008963353,0.0002705448,0.0041131396,0.000066673674,0.000086873806,0.0010504618,0.000048667334,0.70588064,0.26812565,0.017155485,0.00305268,0.000059568836],"about_ca_topic_score_codex":0.00041818552,"about_ca_topic_score_gemma":0.0007010588,"teacher_disagreement_score":0.0017270928,"about_ca_system_score_codex":0.00018621422,"about_ca_system_score_gemma":0.00028749448,"threshold_uncertainty_score":0.0057777166},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75254756,0.0014524758,0.24120127,0.00030549642,0.000039871782,0.000065335706,0.00014296401,0.00055825914,0.003686864],"genre_scores_gemma":[0.9730074,0.0003318647,0.026148591,0.000031771797,0.0000062135978,0.000029043294,0.000054263226,0.000022335476,0.00036850042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990538,0.00043767065,0.000045793517,0.000059246973,0.00029956075,0.00010395649],"domain_scores_gemma":[0.98947924,0.008550489,0.0007362166,0.00054991693,0.0006196152,0.00006462692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024839232,0.00040557652,0.00048174543,0.00041136116,0.00031363557,0.00051436544,0.00037668404,0.00063622184,0.0010481263],"category_scores_gemma":[0.011957588,0.00019314428,0.0002058468,0.0005161862,0.0006917165,0.0009901503,0.00036909248,0.0004887571,0.00023294054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004442395,0.00034211003,0.009594566,0.0005415905,0.0001236772,0.00050567527,0.00045689245,0.7479601,0.11337967,0.016753577,0.0009922277,0.10490753],"study_design_scores_gemma":[0.0000731313,0.00096479146,0.0032692635,0.0000683115,0.00007200821,0.00049887237,0.000102730955,0.8532306,0.13809636,0.002649498,0.00091884396,0.000055705965],"about_ca_topic_score_codex":0.00084099185,"about_ca_topic_score_gemma":0.0008449515,"teacher_disagreement_score":0.0024839232,"about_ca_system_score_codex":0.00047290762,"about_ca_system_score_gemma":0.000507865,"threshold_uncertainty_score":0.013136387},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02919895,0.0005030439,0.9619202,0.00021361082,0.00010272468,0.000041444328,0.00008771906,0.0023852668,0.0055471095],"genre_scores_gemma":[0.5468008,0.00037936456,0.44544628,0.00018886631,0.000069607166,0.000060799826,0.0001772371,0.000049571012,0.006827393],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999027,0.000013794239,0.000005180354,0.000024477202,0.000034299024,0.000019569254],"domain_scores_gemma":[0.9999013,0.000018965842,0.000008278438,0.000014036431,0.000049344853,0.000008118504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011279103,0.00025355493,0.0002262572,0.0002773299,0.0002628679,0.00037691803,0.0006994538,0.0004817032,0.0032142727],"category_scores_gemma":[0.0002928366,0.00017105178,0.00018892712,0.00022877874,0.00016878275,0.00051557174,0.00019304248,0.00033720475,0.0011177065],"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.00047427145,0.00011269834,0.0011677691,0.00024373575,0.000107664244,0.00029516153,0.00009600645,0.07619849,0.4042294,0.02192686,0.005568703,0.4895793],"study_design_scores_gemma":[0.00012165341,0.00076970365,0.0016768121,0.0000333925,0.00017633862,0.0011718919,0.0000459312,0.75549155,0.19627228,0.0048475484,0.039333865,0.00005905202],"about_ca_topic_score_codex":0.0012541829,"about_ca_topic_score_gemma":0.0017068004,"teacher_disagreement_score":0.0032142727,"about_ca_system_score_codex":0.0003147277,"about_ca_system_score_gemma":0.0003622249,"threshold_uncertainty_score":0.010752797},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049705645,0.00019936627,0.9937396,0.000046097935,0.00005931303,0.00003400933,0.00003481852,0.00025129583,0.0006649492],"genre_scores_gemma":[0.15992478,0.0006689451,0.8341851,0.00013143185,0.00014917346,0.00014793326,0.00027934517,0.00005293772,0.004460321],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987173,0.0000294843,0.000010704996,0.000030684037,0.000043119046,0.000014179287],"domain_scores_gemma":[0.9997875,0.000067532834,0.000021318798,0.00003830243,0.00007744399,0.000007831312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028715262,0.0005250758,0.0003545188,0.00028976967,0.00029052098,0.0003760366,0.00043966938,0.00077288866,0.0029044736],"category_scores_gemma":[0.00069022964,0.00022123638,0.00029039718,0.00029502463,0.0002754235,0.00063628034,0.00023051353,0.00063484174,0.0015123507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047373289,0.00014958868,0.00033912229,0.00036018447,0.00006824434,0.00025704107,0.0000936227,0.03935686,0.50302577,0.03167439,0.0026695498,0.42153183],"study_design_scores_gemma":[0.000117331874,0.0008415626,0.0017172705,0.0000835503,0.00012344295,0.0011365967,0.000039184863,0.6228919,0.33171865,0.010339553,0.030921385,0.00006955602],"about_ca_topic_score_codex":0.00029579407,"about_ca_topic_score_gemma":0.00061897084,"teacher_disagreement_score":0.0029044736,"about_ca_system_score_codex":0.0002311388,"about_ca_system_score_gemma":0.00044077684,"threshold_uncertainty_score":0.009716451},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043186303,0.00008437279,0.99515826,0.000028135706,0.000011315999,0.000006817411,0.000012706307,0.000119527656,0.00026026773],"genre_scores_gemma":[0.11586015,0.00029281454,0.88125396,0.00006580833,0.00004989708,0.000060833918,0.000113635484,0.000051537176,0.0022513831],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961674,0.00009675743,0.000020488034,0.000071687246,0.00016941295,0.000024861454],"domain_scores_gemma":[0.99956006,0.00017403232,0.000060831273,0.00008679077,0.00010103697,0.000017112427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053673814,0.0006156819,0.0005996387,0.00060363574,0.0002981102,0.00058013067,0.0005755262,0.0005849938,0.001209623],"category_scores_gemma":[0.0016832014,0.00036438802,0.0004844811,0.0005842324,0.0007577531,0.0009240571,0.00064124464,0.0007773878,0.00071830594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002942977,0.00013157076,0.00083346147,0.00018704774,0.00011761388,0.00015824624,0.00016203758,0.32122612,0.13432527,0.05557515,0.0016828777,0.48530638],"study_design_scores_gemma":[0.000018221595,0.000050474937,0.00025909237,0.000007696945,0.000015760892,0.00013363211,0.000011090125,0.95567095,0.030805381,0.010737736,0.0022675823,0.00002240083],"about_ca_topic_score_codex":0.0010224857,"about_ca_topic_score_gemma":0.0015221881,"teacher_disagreement_score":0.001209623,"about_ca_system_score_codex":0.00031806563,"about_ca_system_score_gemma":0.00059021235,"threshold_uncertainty_score":0.0040465593},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032895587,0.00007389841,0.99599516,0.000022811675,0.000018633302,0.000009971977,0.000013650344,0.0002723092,0.00030393706],"genre_scores_gemma":[0.22300014,0.00023944835,0.77317333,0.00005187019,0.000051416588,0.00008870986,0.00013104716,0.000076706914,0.0031873586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973804,0.00007268096,0.000014831602,0.000057151618,0.000099067016,0.000018267678],"domain_scores_gemma":[0.9995491,0.0001563849,0.00007785534,0.00011765126,0.00007696694,0.000022062251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040297184,0.0008426853,0.0007345018,0.0005993247,0.00039336964,0.00046374113,0.0006916605,0.0007273344,0.0012012052],"category_scores_gemma":[0.0010675184,0.00030661793,0.0007582295,0.00036368833,0.0007030201,0.0011140301,0.0007631032,0.0008560344,0.0006852598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003816509,0.00015893647,0.0011503233,0.00033368773,0.00022061986,0.0001991943,0.0002342106,0.29045638,0.17044587,0.092591636,0.0023197448,0.44150773],"study_design_scores_gemma":[0.00001232609,0.000055638877,0.00021796052,0.000006724492,0.0000145928525,0.000120966026,0.000008202665,0.9717272,0.013767636,0.011789606,0.0022554956,0.000023687644],"about_ca_topic_score_codex":0.0009198534,"about_ca_topic_score_gemma":0.0010997029,"teacher_disagreement_score":0.0012012052,"about_ca_system_score_codex":0.00032219253,"about_ca_system_score_gemma":0.0005763568,"threshold_uncertainty_score":0.0040184855},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022291942,0.038229555,0.6372145,0.0017441452,0.0032324512,0.000170424,0.0007521769,0.0032003922,0.31322712],"genre_scores_gemma":[0.035758886,0.05946066,0.22199365,0.0014686933,0.0020224128,0.00021651434,0.001623424,0.0009250009,0.67653066],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966633,0.000028716291,0.000011960917,0.00008365908,0.00018452512,0.00002489467],"domain_scores_gemma":[0.99979454,0.00006181917,0.000007881402,0.00003197205,0.00009578156,0.000007985067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002989746,0.0010277168,0.0008191886,0.00097584684,0.00055983977,0.0016717241,0.000914835,0.0011530926,0.035091527],"category_scores_gemma":[0.0006949291,0.00034017858,0.00037089095,0.00085415103,0.0005189741,0.0016897459,0.0008121518,0.0013075654,0.029564485],"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.000055402237,0.00004368673,0.00014353673,0.00060447905,0.00003474321,0.0001321915,0.00019290714,0.008844586,0.010119577,0.10595597,0.12061793,0.75325495],"study_design_scores_gemma":[0.00001078021,0.00004280984,0.0003151536,0.0002786863,0.00002086385,0.00060131,0.00006539074,0.013895195,0.008944782,0.03663174,0.9391498,0.000043485452],"about_ca_topic_score_codex":0.0007628771,"about_ca_topic_score_gemma":0.0012006887,"teacher_disagreement_score":0.035091527,"about_ca_system_score_codex":0.0005471138,"about_ca_system_score_gemma":0.0006565396,"threshold_uncertainty_score":0.11739284},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011613073,0.00016901264,0.9947831,0.000100388344,0.000069832764,0.00009715108,0.0002895261,0.0018473277,0.0014823403],"genre_scores_gemma":[0.022435956,0.00029457157,0.97028214,0.00008035317,0.00011999244,0.00074236793,0.0006394643,0.00062501314,0.004780172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990583,0.00036067574,0.000054224787,0.00025509018,0.0002081259,0.000063542764],"domain_scores_gemma":[0.9992841,0.00025197043,0.00003377825,0.00017054248,0.00022871829,0.000030826977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017666599,0.0015802485,0.0011674794,0.0025530863,0.0007381197,0.0016157082,0.0014633044,0.0012473019,0.0110410545],"category_scores_gemma":[0.0033447773,0.00053809717,0.0022627811,0.0024076537,0.00054682867,0.0008831115,0.0014944255,0.0020314076,0.0057831686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002592305,0.00019052615,0.00088222674,0.00065092585,0.00086157135,0.00043669352,0.0002689218,0.042289253,0.06795976,0.04244829,0.02816576,0.81558686],"study_design_scores_gemma":[0.00011939105,0.00047067078,0.0055143614,0.00008790256,0.0004294814,0.0020633065,0.00016634319,0.73488027,0.035546668,0.119708546,0.10082149,0.00019164782],"about_ca_topic_score_codex":0.0021512285,"about_ca_topic_score_gemma":0.004341609,"teacher_disagreement_score":0.0110410545,"about_ca_system_score_codex":0.00041522016,"about_ca_system_score_gemma":0.0013468753,"threshold_uncertainty_score":0.036935985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028247389,0.00013124042,0.9963187,0.00003152697,0.00003198008,0.000015396346,0.000016908,0.00012002856,0.00050952163],"genre_scores_gemma":[0.13264994,0.00045475183,0.862726,0.00013551887,0.00015603572,0.00012398018,0.00015544014,0.000041277115,0.003557141],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997645,0.000050351435,0.000011562058,0.00006991004,0.00008063735,0.000023012193],"domain_scores_gemma":[0.9997811,0.0000438814,0.000024963338,0.000044089076,0.000088208646,0.000017908234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030295693,0.0006358114,0.0005681046,0.00039000055,0.0003524287,0.00047846872,0.0007372628,0.0011420503,0.0014254363],"category_scores_gemma":[0.0005071464,0.0002176801,0.00045706012,0.00036880863,0.0005065398,0.0007169938,0.00044539094,0.00072308234,0.0011794835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044561623,0.00010992737,0.00061748264,0.0003577456,0.00012945385,0.00019930417,0.00014981651,0.09284792,0.4219266,0.11336795,0.0030768875,0.36677137],"study_design_scores_gemma":[0.00009043799,0.00058220536,0.0008556135,0.00003457995,0.000091361835,0.0007123275,0.000024211105,0.8553252,0.08255019,0.03076795,0.028887711,0.00007820928],"about_ca_topic_score_codex":0.0006092301,"about_ca_topic_score_gemma":0.00074692426,"teacher_disagreement_score":0.0014254363,"about_ca_system_score_codex":0.00027653572,"about_ca_system_score_gemma":0.0006663612,"threshold_uncertainty_score":0.00476861},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053565875,0.0027496752,0.98626804,0.00027661305,0.0006736354,0.000033205484,0.000084468316,0.00055686285,0.0040009217],"genre_scores_gemma":[0.09578849,0.0041395486,0.8651109,0.00019843224,0.000999209,0.000080957885,0.0004957808,0.00021670351,0.032970056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994746,0.00010501707,0.000030714233,0.000061883715,0.00028708088,0.00004075266],"domain_scores_gemma":[0.999443,0.00017247426,0.00002423105,0.000072310475,0.00025890465,0.000029087274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068964803,0.0008088031,0.00057478703,0.001184038,0.0002689717,0.000863528,0.00054337876,0.00074025907,0.011742758],"category_scores_gemma":[0.0012067426,0.00032565184,0.00064515014,0.0010491462,0.00047936256,0.001262722,0.0008715342,0.00087037863,0.0043837097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072796264,0.00009430914,0.00023372856,0.0002744431,0.00011966582,0.00015562642,0.00005156303,0.014302018,0.17336775,0.01334336,0.010830564,0.786499],"study_design_scores_gemma":[0.00016906316,0.0006587133,0.0017452408,0.000117432086,0.00032264873,0.0015618358,0.0000762588,0.5987564,0.2900017,0.023087602,0.08339271,0.00011043428],"about_ca_topic_score_codex":0.0007020182,"about_ca_topic_score_gemma":0.0017640936,"teacher_disagreement_score":0.011742758,"about_ca_system_score_codex":0.00019477285,"about_ca_system_score_gemma":0.00048907957,"threshold_uncertainty_score":0.039283454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008041806,0.2440284,0.5476985,0.0054795966,0.0039216015,0.0000696346,0.0002172495,0.0013585186,0.18918467],"genre_scores_gemma":[0.09725214,0.23556873,0.42917648,0.0027855728,0.0037034282,0.00027007106,0.00076572795,0.0010333153,0.22944456],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99982893,0.000019912366,0.000009444361,0.00003310482,0.00009774597,0.000010901351],"domain_scores_gemma":[0.99972135,0.00015715841,0.00001067463,0.000029494711,0.000064423606,0.000016794464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029708535,0.00058853725,0.00049400225,0.0008778237,0.0003029272,0.0017010018,0.0009988814,0.0011327465,0.008762054],"category_scores_gemma":[0.0006609408,0.00035104298,0.00045768922,0.0010816158,0.0012169547,0.002193949,0.0006878656,0.0021045704,0.0040359246],"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.00004528579,0.000055451135,0.00016592871,0.0013597201,0.000039700404,0.00013864246,0.00036070513,0.010485827,0.02508559,0.42664343,0.035392266,0.5002275],"study_design_scores_gemma":[0.00001524417,0.000078644414,0.0002748884,0.0002956747,0.00001775838,0.0006238245,0.00009839904,0.029334022,0.009272355,0.18526886,0.77466524,0.000054959542],"about_ca_topic_score_codex":0.0004257147,"about_ca_topic_score_gemma":0.0005424902,"teacher_disagreement_score":0.008762054,"about_ca_system_score_codex":0.0008310427,"about_ca_system_score_gemma":0.00035541083,"threshold_uncertainty_score":0.029312015},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027128092,0.00037791044,0.99433833,0.00023501362,0.00010443356,0.000027786062,0.00020687097,0.0005154597,0.0014814246],"genre_scores_gemma":[0.43470162,0.0028911573,0.5119407,0.00072488614,0.00076883606,0.0005246663,0.00447521,0.0009592266,0.04301367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794143,0.00089540187,0.000084695785,0.0005213271,0.00040778192,0.00014932406],"domain_scores_gemma":[0.9918105,0.0053776684,0.0004858833,0.0016779959,0.00051994855,0.00012799432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035509146,0.0016489751,0.001632346,0.001069755,0.00048472104,0.0019684806,0.0018350335,0.002148886,0.008731448],"category_scores_gemma":[0.021362852,0.0013533443,0.0014823879,0.0013676644,0.0016094684,0.0032079525,0.0020365326,0.003062747,0.004529391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037752435,0.00013364789,0.0016608253,0.00067776145,0.0004226452,0.00032688343,0.00014899438,0.58391243,0.008299455,0.15922286,0.017945023,0.226872],"study_design_scores_gemma":[0.000027659593,0.000039289418,0.00062355876,0.000045056324,0.0000330478,0.00013695541,0.00001275075,0.9234694,0.0021529526,0.06896883,0.004461243,0.000029194132],"about_ca_topic_score_codex":0.003624209,"about_ca_topic_score_gemma":0.0040032184,"teacher_disagreement_score":0.008731448,"about_ca_system_score_codex":0.00079906377,"about_ca_system_score_gemma":0.0016952367,"threshold_uncertainty_score":0.029209614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023020107,0.00086048647,0.9731482,0.00014173296,0.00019507251,0.00004288514,0.0002287715,0.0015001427,0.0008626355],"genre_scores_gemma":[0.10629092,0.0011514076,0.8857476,0.00007922196,0.00010344895,0.00008212225,0.0009207203,0.0006617103,0.004962915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976414,0.000055854613,0.000019765794,0.000047789705,0.00008640255,0.000026028667],"domain_scores_gemma":[0.99936694,0.00022123592,0.00005002505,0.00012416876,0.00021959175,0.000018088593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045786728,0.0009576748,0.0005468925,0.00062553596,0.00028806846,0.0006103363,0.0006444474,0.0006832985,0.0023110206],"category_scores_gemma":[0.0025287287,0.0003140042,0.00080074376,0.0009933127,0.00025665358,0.0006924546,0.00052228954,0.0010140757,0.00094138813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005595314,0.00008830019,0.00054295245,0.00039218657,0.0001993473,0.00020946052,0.00017275252,0.033713117,0.3406496,0.0029851312,0.004521703,0.6159659],"study_design_scores_gemma":[0.000060890663,0.00017370403,0.011088766,0.00007837844,0.00033730603,0.00080399483,0.000049835286,0.7009657,0.26606438,0.0031592767,0.017075606,0.00014217618],"about_ca_topic_score_codex":0.0033387535,"about_ca_topic_score_gemma":0.0074564423,"teacher_disagreement_score":0.0033387535,"about_ca_system_score_codex":0.00024907693,"about_ca_system_score_gemma":0.0008552677,"threshold_uncertainty_score":0.0077311397},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003877424,0.00014250817,0.71759045,0.0000751494,0.00010050493,0.000597359,0.0017711185,0.27321047,0.0026350114],"genre_scores_gemma":[0.0971673,0.00054623774,0.8048392,0.0010837726,0.00036416837,0.0060001863,0.014737418,0.04360243,0.031659298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917334,0.0001112531,0.00009180915,0.0002654446,0.00025871463,0.00009942152],"domain_scores_gemma":[0.99757344,0.0010842914,0.00015597462,0.0004005813,0.0005384089,0.00024734883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013796083,0.0023258198,0.001322562,0.0020128847,0.00028417583,0.0010142153,0.0027327077,0.0013066821,0.047719974],"category_scores_gemma":[0.0042728106,0.001085221,0.0009251191,0.0006649833,0.00038978906,0.0011367286,0.0014455589,0.0015241056,0.03131586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023912257,0.0007372454,0.004230597,0.0014372565,0.00043230286,0.0015166859,0.0005552589,0.008076739,0.110401474,0.005989192,0.11817965,0.74605227],"study_design_scores_gemma":[0.0026562638,0.0020140875,0.021886947,0.0004776715,0.0005283178,0.00728103,0.00013845557,0.2855573,0.25567654,0.014180054,0.40877858,0.00082479004],"about_ca_topic_score_codex":0.0006839579,"about_ca_topic_score_gemma":0.00034694982,"teacher_disagreement_score":0.047719974,"about_ca_system_score_codex":0.00030122857,"about_ca_system_score_gemma":0.00064837513,"threshold_uncertainty_score":0.15963924},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036852628,0.00076617737,0.9860038,0.00024601418,0.00018217199,0.00009086818,0.00026359083,0.0009832612,0.0077787484],"genre_scores_gemma":[0.17354675,0.0014723205,0.779497,0.0007155962,0.00033468992,0.00040938883,0.0015109399,0.00027930728,0.04223398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999433,0.00010614159,0.000033573997,0.00019010737,0.00018291622,0.000054298744],"domain_scores_gemma":[0.999653,0.00007217388,0.000029672321,0.000076944256,0.00014911412,0.000019104324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039437425,0.0007912713,0.0008373672,0.0008908962,0.0003637834,0.0011430837,0.0012699158,0.0011003263,0.011734028],"category_scores_gemma":[0.0013523445,0.00021445606,0.00048494918,0.0009789962,0.000465418,0.000958001,0.0011019659,0.0007423165,0.0067726406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027283313,0.00003596755,0.0004398135,0.00025017193,0.00006940779,0.00013930116,0.00008784256,0.15357772,0.013211146,0.058164127,0.016052006,0.7576997],"study_design_scores_gemma":[0.00008819478,0.00008990794,0.0003053761,0.000043774693,0.000026789497,0.00027941933,0.000039166254,0.9001735,0.0074540568,0.033666037,0.057798944,0.000034866727],"about_ca_topic_score_codex":0.0025572486,"about_ca_topic_score_gemma":0.0032188962,"teacher_disagreement_score":0.011734028,"about_ca_system_score_codex":0.00055007346,"about_ca_system_score_gemma":0.0011630252,"threshold_uncertainty_score":0.03925425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010733795,0.00021145058,0.98798406,0.00012618345,0.000033383356,0.00004579206,0.000013831124,0.0004593989,0.00039220153],"genre_scores_gemma":[0.2006431,0.0002835628,0.7969728,0.00009466216,0.00007409569,0.000107205735,0.000053403593,0.000032276053,0.001738958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999398,0.00017535963,0.0000454203,0.000084163265,0.00025170206,0.000045374065],"domain_scores_gemma":[0.9981559,0.0009125405,0.00021681548,0.00033560774,0.00033740967,0.000041654424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013708319,0.0005620415,0.0006687575,0.00039577208,0.00032327988,0.0006101921,0.0007746942,0.0011345294,0.0013925126],"category_scores_gemma":[0.003768039,0.0002956046,0.00024401632,0.00044171122,0.00043901018,0.0012764947,0.00047558814,0.0009883699,0.0004791202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009567254,0.0001822887,0.0010123408,0.0003131737,0.00008381302,0.00019775722,0.00016346284,0.075259216,0.12953837,0.026155073,0.0017272374,0.76441056],"study_design_scores_gemma":[0.00019905441,0.00071514,0.0015042371,0.00007501042,0.000059536975,0.0011609972,0.00002886283,0.85684216,0.12616488,0.008462218,0.0046861046,0.000101826474],"about_ca_topic_score_codex":0.00073850807,"about_ca_topic_score_gemma":0.0010401286,"teacher_disagreement_score":0.0013925126,"about_ca_system_score_codex":0.00037045404,"about_ca_system_score_gemma":0.0010116835,"threshold_uncertainty_score":0.007249713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011057374,0.0151482485,0.93828905,0.00048516155,0.0018313018,0.00004487856,0.00018028526,0.0016697012,0.041245576],"genre_scores_gemma":[0.03876491,0.018439025,0.6274905,0.000915736,0.0022706331,0.00019852098,0.0006896315,0.0008221363,0.31040886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998073,0.000025538066,0.000009209086,0.00003459547,0.00011193614,0.000011553371],"domain_scores_gemma":[0.99980706,0.000070244234,0.000009915888,0.000031236308,0.000075668075,0.0000059168588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019990784,0.00090334396,0.0006200939,0.0008509978,0.0003134589,0.0007133536,0.0007391576,0.0012493851,0.020015897],"category_scores_gemma":[0.0007813523,0.0002565704,0.0003559342,0.0010915565,0.0004695898,0.001267344,0.00048359451,0.001443268,0.012079723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003784947,0.000030372472,0.000028430331,0.0004220282,0.000019048577,0.00010733731,0.000057718447,0.00767091,0.021774888,0.093940526,0.061394148,0.8145168],"study_design_scores_gemma":[0.00001562999,0.00011846341,0.00042282537,0.00041067082,0.000041565178,0.0016169129,0.000036591453,0.12807947,0.046845436,0.15770856,0.6645982,0.00010560436],"about_ca_topic_score_codex":0.00049037195,"about_ca_topic_score_gemma":0.00083092466,"teacher_disagreement_score":0.020015897,"about_ca_system_score_codex":0.00033381747,"about_ca_system_score_gemma":0.0003051202,"threshold_uncertainty_score":0.06695986},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009614065,0.00016528998,0.9975629,0.00002833239,0.000048295733,0.000022985398,0.000014306627,0.00042085783,0.0007756519],"genre_scores_gemma":[0.031195844,0.0003239295,0.96254206,0.00008145081,0.00008991046,0.0000930982,0.00015462338,0.00015107928,0.0053679156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995628,0.00010803026,0.000023860224,0.000103717255,0.00017378088,0.000027921218],"domain_scores_gemma":[0.99977595,0.00007383634,0.000018455072,0.000033578348,0.000088532994,0.000009635287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005654667,0.00075062405,0.0005920358,0.00045335336,0.0002860051,0.00055422523,0.0009547254,0.0007200745,0.0033926456],"category_scores_gemma":[0.0014418626,0.00034041423,0.00070544524,0.00048575876,0.00032558138,0.0007240319,0.0006093395,0.0009746105,0.0028445607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001317496,0.000109798144,0.000424634,0.00017109071,0.000073634335,0.000099180936,0.000086137516,0.13132489,0.024494324,0.021834739,0.005180766,0.81606907],"study_design_scores_gemma":[0.000012642884,0.000049399765,0.00029565697,0.00001145629,0.000012517499,0.00010399857,0.0000062574695,0.9825668,0.004227827,0.0030837145,0.009612652,0.00001700337],"about_ca_topic_score_codex":0.0031794189,"about_ca_topic_score_gemma":0.0045506,"teacher_disagreement_score":0.0033926456,"about_ca_system_score_codex":0.00030046562,"about_ca_system_score_gemma":0.0008628721,"threshold_uncertainty_score":0.011349499},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012577488,0.00012487665,0.99799156,0.000036030317,0.000052604846,0.000016173613,0.0000063247508,0.00012733488,0.0003872931],"genre_scores_gemma":[0.036588382,0.0002710712,0.95996356,0.00010793477,0.00007910855,0.00007069367,0.000052804306,0.000045040833,0.0028215135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999451,0.00010036247,0.00003375008,0.0001353054,0.00025156015,0.000028170083],"domain_scores_gemma":[0.99941874,0.00015041845,0.000041457843,0.000058011727,0.00029386143,0.000037461898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007300726,0.0007420456,0.00059054943,0.0007090775,0.00047036348,0.0006892518,0.00091247674,0.0011424839,0.0021826634],"category_scores_gemma":[0.0015550784,0.0002350726,0.00048393622,0.00070254056,0.00062161556,0.0012718006,0.0006833868,0.0009661614,0.0011704346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039990974,0.000125647,0.00041182115,0.00027158597,0.000104774255,0.00014320819,0.00013801188,0.04822494,0.13138583,0.023306217,0.0032091204,0.7922788],"study_design_scores_gemma":[0.000079508856,0.00022052898,0.00055681594,0.000019961235,0.000051067633,0.00054807035,0.000027501934,0.92175454,0.050857108,0.0061622327,0.019659821,0.0000628727],"about_ca_topic_score_codex":0.0009283804,"about_ca_topic_score_gemma":0.0014040499,"teacher_disagreement_score":0.0021826634,"about_ca_system_score_codex":0.0003590663,"about_ca_system_score_gemma":0.0007640466,"threshold_uncertainty_score":0.007301748},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029915418,0.00009350441,0.9958384,0.000060073657,0.00001707442,0.0000099530025,0.0000067115725,0.00010144862,0.00088125805],"genre_scores_gemma":[0.5007382,0.00077625795,0.4910932,0.00014753739,0.00014568842,0.00016818187,0.00011009827,0.000091932656,0.0067289146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998061,0.000045966754,0.000010133926,0.000044592973,0.0000815278,0.000011685565],"domain_scores_gemma":[0.9997762,0.00012306675,0.00002686358,0.000025974774,0.00004159126,0.000006349047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037153575,0.0005398222,0.00042363937,0.0003564303,0.00031166384,0.0003496912,0.00044983678,0.00049148453,0.0014410334],"category_scores_gemma":[0.00091215083,0.00020845195,0.00042043775,0.00031708498,0.00051395525,0.00070568867,0.00043306453,0.00068000815,0.00044256364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077642486,0.0000557302,0.000910063,0.00019674361,0.00007195344,0.00020734538,0.00019994253,0.6386503,0.027475676,0.08141058,0.00097574166,0.24976826],"study_design_scores_gemma":[0.0000036083238,0.000028427201,0.00010484931,0.0000060905827,0.000008338674,0.000039043705,0.0000061293435,0.99032015,0.0022958706,0.0059564495,0.0012218368,0.000009227166],"about_ca_topic_score_codex":0.0018714062,"about_ca_topic_score_gemma":0.0016001574,"teacher_disagreement_score":0.0018714062,"about_ca_system_score_codex":0.00030694198,"about_ca_system_score_gemma":0.00052197796,"threshold_uncertainty_score":0.0048207045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088738906,0.0010275731,0.9892987,0.0005221369,0.000113633774,0.000017427834,0.00009278412,0.00007213537,0.007968136],"genre_scores_gemma":[0.16388091,0.008149218,0.80432284,0.0017701394,0.0026659854,0.0007052015,0.0008069984,0.00038029728,0.017318327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99487525,0.0019323116,0.00028448587,0.0008238237,0.0018005199,0.00028354814],"domain_scores_gemma":[0.9912935,0.006386114,0.00034566916,0.0009074424,0.00091916847,0.00014818381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057372246,0.0015179291,0.002305747,0.0018819745,0.001422013,0.004194346,0.0052207992,0.0036408736,0.007206966],"category_scores_gemma":[0.022544783,0.0023048017,0.0018810396,0.003543901,0.005345073,0.009100559,0.0040633185,0.0064924452,0.002480715],"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.000018232262,0.000014842032,0.000060235445,0.000088521796,0.000026520778,0.000018552522,0.000059950333,0.01719667,0.00022862612,0.95111984,0.003099229,0.028068706],"study_design_scores_gemma":[0.000006423561,0.000007655941,0.0000339486,0.000023819923,0.000008628255,0.00002703337,0.000005760981,0.036587905,0.00010721342,0.9604632,0.0027181567,0.000010258204],"about_ca_topic_score_codex":0.001540743,"about_ca_topic_score_gemma":0.0013781525,"teacher_disagreement_score":0.007206966,"about_ca_system_score_codex":0.0023341386,"about_ca_system_score_gemma":0.0020640437,"threshold_uncertainty_score":0.030341744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013514665,0.0007316005,0.99678516,0.00011079746,0.00026482707,0.000008579398,0.000033354823,0.00027888155,0.00043527878],"genre_scores_gemma":[0.16203257,0.002494987,0.8156211,0.00017822326,0.0006922082,0.00012917674,0.0007059893,0.00029774357,0.017848054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993687,0.00023578845,0.000034574296,0.00010870433,0.0002113848,0.000040851803],"domain_scores_gemma":[0.9989844,0.0005099357,0.000040433115,0.00016106291,0.00027497375,0.000029107885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012517697,0.0010046064,0.0010891089,0.0008477273,0.00038742568,0.0010244269,0.0006995758,0.0010030952,0.0047583557],"category_scores_gemma":[0.0046631857,0.0005880965,0.00077596604,0.0007516952,0.00075062684,0.0013416078,0.00082432193,0.001801997,0.0017164447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067086786,0.0001124049,0.0007392845,0.0003821644,0.0002507003,0.00017598206,0.00014488153,0.21795996,0.019316245,0.08223484,0.025414899,0.65259784],"study_design_scores_gemma":[0.000017498951,0.000045021392,0.00038028794,0.00001541168,0.000029428118,0.00005852765,0.0000066456155,0.97500575,0.0038521534,0.013994002,0.0065795244,0.000015823343],"about_ca_topic_score_codex":0.002874606,"about_ca_topic_score_gemma":0.002756225,"teacher_disagreement_score":0.0047583557,"about_ca_system_score_codex":0.00041719963,"about_ca_system_score_gemma":0.0008916176,"threshold_uncertainty_score":0.015918314},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021663546,0.0013150874,0.99270153,0.00028910904,0.00010596829,0.00005807104,0.00041391226,0.0014182336,0.0015316946],"genre_scores_gemma":[0.10824053,0.0049917535,0.8770934,0.00035021114,0.0005575184,0.00026213174,0.003169918,0.00041188332,0.004922793],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895144,0.00019111311,0.000046757967,0.00023730147,0.00051757344,0.000055794364],"domain_scores_gemma":[0.9988286,0.00039356927,0.00016907802,0.00030678068,0.00025699698,0.000044976605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095037086,0.0013081846,0.0011106445,0.0020669163,0.0005403452,0.0014627784,0.0010153373,0.0012022685,0.0029437337],"category_scores_gemma":[0.0035469534,0.00061521475,0.0009874584,0.0034854906,0.0011970578,0.0016388858,0.0017195564,0.0016609147,0.0031819197],"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.00011804284,0.00008187676,0.0012948918,0.0008381869,0.00016595714,0.00028150252,0.00019915598,0.06904956,0.042160362,0.05043464,0.029563144,0.80581266],"study_design_scores_gemma":[0.0000419153,0.000082726154,0.003278161,0.000102543105,0.00007900789,0.0005840544,0.000105378174,0.79678625,0.027332302,0.108373314,0.06312765,0.00010666651],"about_ca_topic_score_codex":0.0018790514,"about_ca_topic_score_gemma":0.0020574802,"teacher_disagreement_score":0.0029437337,"about_ca_system_score_codex":0.00042087559,"about_ca_system_score_gemma":0.00089813955,"threshold_uncertainty_score":0.00984776},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002094828,0.00019166245,0.99693835,0.000029341165,0.00004782299,0.000015766467,0.000014407004,0.00030592686,0.00036195555],"genre_scores_gemma":[0.18690579,0.0006048065,0.8073261,0.0001193378,0.00013307025,0.00014935987,0.00015767288,0.00013015092,0.004473685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943537,0.00015025436,0.000037447022,0.00013429977,0.00021606934,0.00002650387],"domain_scores_gemma":[0.9994618,0.0001822817,0.00007792312,0.00013019807,0.00013113354,0.000016627315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007658471,0.0006972941,0.00082004414,0.00056983484,0.0003793972,0.0005366476,0.0006829964,0.0010005325,0.001463696],"category_scores_gemma":[0.002325448,0.00036511407,0.00068020355,0.0004230969,0.0005201944,0.0011191687,0.00069435907,0.001168182,0.0014196661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046500305,0.00012445271,0.000577696,0.0005703201,0.00019613538,0.00034757672,0.000264503,0.16930284,0.21017782,0.04145534,0.002662932,0.5738554],"study_design_scores_gemma":[0.000023298755,0.00016417967,0.00046177953,0.000037255315,0.000050462135,0.00059604587,0.000020746229,0.93988794,0.03919411,0.0075768316,0.0119223045,0.000065021595],"about_ca_topic_score_codex":0.00047019534,"about_ca_topic_score_gemma":0.000513728,"teacher_disagreement_score":0.001463696,"about_ca_system_score_codex":0.00022536756,"about_ca_system_score_gemma":0.00044289097,"threshold_uncertainty_score":0.0048965216},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031172938,0.000077073404,0.9962872,0.00004304576,0.000016218928,0.000008187417,0.000009403909,0.00014008449,0.0003014983],"genre_scores_gemma":[0.081013806,0.00021487591,0.91481006,0.00005495975,0.000040980696,0.0000685123,0.000072375355,0.00004612323,0.0036781682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977106,0.000046594334,0.000011647883,0.000054128162,0.00009823137,0.000018297294],"domain_scores_gemma":[0.9996556,0.0001429626,0.00003923374,0.000032092175,0.0001109086,0.000019236759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005298026,0.00055505923,0.0006479856,0.00040187791,0.00040529453,0.00056082004,0.0006912506,0.0011131692,0.0016663865],"category_scores_gemma":[0.0013319255,0.00028537426,0.00034844177,0.000528179,0.000656193,0.00082941534,0.0006995301,0.0009888418,0.0009437105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003117609,0.000076534736,0.0004995065,0.00013147561,0.00007254987,0.00013064667,0.00020122329,0.50984496,0.048029456,0.0506129,0.0025735968,0.38751534],"study_design_scores_gemma":[0.000013201459,0.000018782805,0.00008588891,0.0000030313936,0.0000047574863,0.00004977387,0.000005956933,0.98974717,0.004382635,0.0043399944,0.0013387637,0.000010072078],"about_ca_topic_score_codex":0.0014770349,"about_ca_topic_score_gemma":0.0016326109,"teacher_disagreement_score":0.0016663865,"about_ca_system_score_codex":0.00049717014,"about_ca_system_score_gemma":0.0007744963,"threshold_uncertainty_score":0.0055746436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009862482,0.0036484103,0.9352276,0.02917334,0.0013355287,0.00022637265,0.00034034226,0.002626035,0.017559843],"genre_scores_gemma":[0.3925057,0.0047348323,0.55808705,0.016770212,0.002526981,0.0007944438,0.0002714572,0.0007876974,0.023521623],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98164946,0.006570281,0.00089189876,0.003011429,0.0074951528,0.0003817109],"domain_scores_gemma":[0.9450592,0.03757333,0.0011111012,0.0069735274,0.008806151,0.00047672316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019951737,0.0011769946,0.0014569702,0.0022314908,0.0012783696,0.003428504,0.005060827,0.004597133,0.002592106],"category_scores_gemma":[0.08004021,0.00095807086,0.0012390394,0.0019544426,0.005011789,0.0038275549,0.003149919,0.0058705984,0.0057945577],"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.0008018616,0.00014649516,0.006851808,0.0014118862,0.00040793626,0.00047965045,0.0011743136,0.010857839,0.015405369,0.37471512,0.038355637,0.5493921],"study_design_scores_gemma":[0.00036145514,0.0010947693,0.008115951,0.0011547668,0.00046963236,0.011090668,0.0007139354,0.20745167,0.05510724,0.49493846,0.21889317,0.00060834904],"about_ca_topic_score_codex":0.0012644845,"about_ca_topic_score_gemma":0.00090709835,"teacher_disagreement_score":0.019951737,"about_ca_system_score_codex":0.0016371773,"about_ca_system_score_gemma":0.0017250289,"threshold_uncertainty_score":0.105516076},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032072326,0.052594144,0.9171568,0.0006731029,0.0012105007,0.00004457681,0.00022536599,0.0013816366,0.023506667],"genre_scores_gemma":[0.08254583,0.16187292,0.6527347,0.0011210123,0.0047905287,0.00026355108,0.0027597514,0.00073524757,0.09317643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974185,0.000049559567,0.000017772107,0.00006997422,0.00010371793,0.000017172093],"domain_scores_gemma":[0.9997838,0.00011642507,0.000010633789,0.00002291905,0.00006009859,0.000006222114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032110148,0.0010724217,0.0005158859,0.0010560252,0.00023005859,0.0009321865,0.00057264866,0.0009999331,0.007363957],"category_scores_gemma":[0.0006994205,0.0002605618,0.0007455528,0.002103405,0.0005359054,0.0010306746,0.0005558835,0.0011885812,0.00876039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007091158,0.00005130475,0.00019299772,0.0005781417,0.00007972324,0.00028912214,0.0001689746,0.019830042,0.017571608,0.014105176,0.042714555,0.9043474],"study_design_scores_gemma":[0.000028259237,0.00029176322,0.00555923,0.0008441523,0.00016740881,0.0027211122,0.00022345466,0.35841575,0.024706075,0.065528244,0.5412521,0.0002625059],"about_ca_topic_score_codex":0.0016006975,"about_ca_topic_score_gemma":0.001016337,"teacher_disagreement_score":0.007363957,"about_ca_system_score_codex":0.0002626477,"about_ca_system_score_gemma":0.00027339382,"threshold_uncertainty_score":0.024634838},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0126016755,0.000341746,0.9835202,0.0001452027,0.000083550374,0.0000393155,0.000058620215,0.0007232934,0.002486312],"genre_scores_gemma":[0.2378944,0.0005458849,0.75061166,0.00023654013,0.00008401393,0.00006548511,0.0002133724,0.00006192111,0.010286683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997608,0.000030152534,0.000014775496,0.000052248124,0.00011251314,0.000029519966],"domain_scores_gemma":[0.9998536,0.000038159156,0.000020647194,0.000034109584,0.000045261953,0.000008148422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027104115,0.00040345904,0.0003431773,0.00024693203,0.00032072823,0.0003942449,0.00082216226,0.00060001406,0.0031582294],"category_scores_gemma":[0.0004408388,0.00032310703,0.0004231736,0.00028887732,0.00030761928,0.00089797575,0.00048767834,0.0009328422,0.00086206914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068752916,0.00011022172,0.0005893291,0.00028233125,0.00015307646,0.00041230198,0.0001875743,0.11338192,0.39469776,0.030098982,0.0051412475,0.45425776],"study_design_scores_gemma":[0.000069978,0.0004445551,0.0006003237,0.000028158547,0.000087228495,0.00069385796,0.000022014408,0.8615014,0.115667894,0.0046611396,0.016161744,0.00006183999],"about_ca_topic_score_codex":0.0010774072,"about_ca_topic_score_gemma":0.0030209809,"teacher_disagreement_score":0.0031582294,"about_ca_system_score_codex":0.00029945213,"about_ca_system_score_gemma":0.0005809745,"threshold_uncertainty_score":0.0105654},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004752879,0.0002908699,0.9941322,0.000042238804,0.000032278003,0.000015353391,0.000057152698,0.00021616029,0.00046096297],"genre_scores_gemma":[0.11829535,0.0006997035,0.87744755,0.000104145605,0.00012268718,0.000111298774,0.00035647818,0.000119584714,0.0027432432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927825,0.00013144748,0.00005336196,0.0001957518,0.00029322138,0.000048017086],"domain_scores_gemma":[0.9988098,0.0004768218,0.00017657339,0.00018175534,0.00031588905,0.00003915269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011407243,0.0007648975,0.0011000491,0.001124691,0.0002955384,0.00084984145,0.00080556376,0.0011763687,0.0027876138],"category_scores_gemma":[0.0052745147,0.00033154085,0.0005964985,0.0009947963,0.0003405793,0.0025010458,0.0007115663,0.0011500097,0.0013518049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044555456,0.00013138114,0.0023897893,0.00035476495,0.00024525935,0.00018813521,0.00009354262,0.13514492,0.09422569,0.04945561,0.0036597021,0.7136656],"study_design_scores_gemma":[0.000031759115,0.000092478214,0.0022730099,0.00003556625,0.000050224946,0.00038159345,0.000023871651,0.9493538,0.025326028,0.015959825,0.00642137,0.000050472274],"about_ca_topic_score_codex":0.0005816602,"about_ca_topic_score_gemma":0.0006416689,"teacher_disagreement_score":0.0027876138,"about_ca_system_score_codex":0.0003438516,"about_ca_system_score_gemma":0.0006791399,"threshold_uncertainty_score":0.009325504},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015594822,0.00019497635,0.99747497,0.00008367718,0.000043018234,0.00003590796,0.000083701285,0.0003218144,0.00020237494],"genre_scores_gemma":[0.046102785,0.00091610255,0.9492945,0.00012542198,0.00015345772,0.00043175157,0.0009323705,0.00013403546,0.0019095811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985624,0.00041147956,0.00008789686,0.00027658592,0.0005849079,0.00007671239],"domain_scores_gemma":[0.99909604,0.00036787608,0.00008865742,0.0001408678,0.00027887334,0.000027794737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012170828,0.0013639755,0.001487067,0.0012558289,0.0006323418,0.0009729419,0.00095346814,0.000994838,0.0009101939],"category_scores_gemma":[0.0028760978,0.0005041598,0.0021258318,0.0020993545,0.00062606705,0.001117247,0.00072491245,0.002005469,0.0009826701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000181427,0.00020563591,0.0018335445,0.00046499187,0.0005241286,0.00031653175,0.00028908823,0.27046302,0.061773628,0.0370741,0.013694212,0.61317974],"study_design_scores_gemma":[0.0000114622835,0.000090698304,0.0012133344,0.000018779429,0.000059128197,0.00016359062,0.000021945662,0.9708495,0.00873824,0.010161033,0.008608248,0.000064102],"about_ca_topic_score_codex":0.0039734566,"about_ca_topic_score_gemma":0.0036615597,"teacher_disagreement_score":0.0039734566,"about_ca_system_score_codex":0.0005043472,"about_ca_system_score_gemma":0.0011990783,"threshold_uncertainty_score":0.007900655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052432283,0.00018194718,0.99356866,0.00003120968,0.000043097258,0.000028902221,0.00000889593,0.0003106088,0.0005834043],"genre_scores_gemma":[0.13542996,0.0003893798,0.8593326,0.00011327601,0.00008770755,0.000079766534,0.00006512944,0.000066170476,0.0044359816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996126,0.00008365027,0.000022881497,0.00008189359,0.0001772348,0.000021822583],"domain_scores_gemma":[0.99955934,0.00010527326,0.000040411498,0.00006580423,0.0002031085,0.000026066009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044806738,0.0007182416,0.00047866668,0.0004564253,0.00040181933,0.00058817136,0.0007088897,0.000828089,0.001728198],"category_scores_gemma":[0.0007758944,0.00024914177,0.0005299905,0.00030898547,0.0005095364,0.00062753755,0.00039712831,0.0006398811,0.0010630859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057628844,0.0001547103,0.00050994765,0.00029138595,0.00014519737,0.00023857362,0.00016109095,0.026574599,0.47660893,0.007872585,0.0011503592,0.48571628],"study_design_scores_gemma":[0.000059813716,0.0008109086,0.0020311216,0.00001981771,0.00015328573,0.0014220559,0.00004541691,0.66479576,0.31055236,0.0037844775,0.01623733,0.00008770467],"about_ca_topic_score_codex":0.0008105359,"about_ca_topic_score_gemma":0.0018406677,"teacher_disagreement_score":0.001728198,"about_ca_system_score_codex":0.00024353428,"about_ca_system_score_gemma":0.0005500443,"threshold_uncertainty_score":0.005781412},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059237126,0.0003803465,0.98146,0.00011679825,0.00004646095,0.00003464047,0.000059555117,0.0018373254,0.010141252],"genre_scores_gemma":[0.20076455,0.000700909,0.7750943,0.00023064509,0.00008505586,0.00013830586,0.00021440134,0.00056117814,0.022210715],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994037,0.00011765445,0.000040788225,0.00009219941,0.00027829866,0.00006735412],"domain_scores_gemma":[0.99913895,0.00035938664,0.00010821609,0.00018971662,0.00017280452,0.00003082459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004353933,0.0005471585,0.00048832566,0.0010101517,0.00059924246,0.0011484677,0.000849382,0.00063350087,0.013875909],"category_scores_gemma":[0.0022049681,0.00042109957,0.00044558718,0.0011348157,0.00061566284,0.0012652292,0.0012282917,0.0012278424,0.004712394],"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.00024351549,0.00006298296,0.0002898907,0.00036026188,0.000044145447,0.00037196625,0.00036008394,0.07140899,0.077976435,0.34731403,0.006263937,0.49530375],"study_design_scores_gemma":[0.00008216305,0.0002029719,0.0003981819,0.00016065588,0.00006161433,0.0011757485,0.00010924969,0.6472171,0.13275896,0.16145748,0.05628858,0.000087351254],"about_ca_topic_score_codex":0.00078787655,"about_ca_topic_score_gemma":0.002335586,"teacher_disagreement_score":0.013875909,"about_ca_system_score_codex":0.000970816,"about_ca_system_score_gemma":0.0009130599,"threshold_uncertainty_score":0.0464195},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003429067,0.000045282683,0.9957562,0.000051820785,0.000008819104,0.0000076283536,0.000008853511,0.00007133102,0.00062088657],"genre_scores_gemma":[0.29839993,0.00061553717,0.6953117,0.00014423125,0.000112247835,0.00018686957,0.00015423087,0.0001075172,0.004967685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938655,0.00023827811,0.000027457556,0.000107116095,0.00019622927,0.000044453063],"domain_scores_gemma":[0.99933976,0.00038764792,0.00009245536,0.00007548189,0.00008826427,0.000016382199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008991914,0.0007244922,0.00073093065,0.0003780918,0.00019973979,0.00076966395,0.0007130539,0.00055250997,0.0014238593],"category_scores_gemma":[0.0029307685,0.00026810708,0.00047586384,0.00060319406,0.0009246965,0.0011880702,0.0010286621,0.00095246255,0.0006485704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032879083,0.000108051885,0.00026489474,0.00021017721,0.00007851862,0.00013805123,0.00008962123,0.65555304,0.04239149,0.09296241,0.0026196137,0.20525528],"study_design_scores_gemma":[0.0000246856,0.000050615203,0.00006431133,0.0000063239713,0.000009509898,0.000043821605,0.000005829861,0.9741796,0.008016722,0.01631064,0.0012784922,0.000009420695],"about_ca_topic_score_codex":0.00051325106,"about_ca_topic_score_gemma":0.0005526285,"teacher_disagreement_score":0.0014238593,"about_ca_system_score_codex":0.00030215507,"about_ca_system_score_gemma":0.00059964927,"threshold_uncertainty_score":0.004763305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022895688,0.2752907,0.34313744,0.0053285393,0.021861557,0.0004572493,0.008378525,0.016068239,0.3271881],"genre_scores_gemma":[0.019232811,0.21414329,0.17363946,0.0025457172,0.009542667,0.0008196288,0.013728833,0.0058470387,0.56050056],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99785584,0.00021721963,0.00025009312,0.0003373102,0.0012297543,0.00010985691],"domain_scores_gemma":[0.99670607,0.0011590997,0.00015542284,0.00048858626,0.0013759913,0.00011487626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018472009,0.0025225698,0.0022925362,0.0046114936,0.00078215386,0.004597803,0.002381812,0.0022754895,0.13202998],"category_scores_gemma":[0.0056256806,0.0012378496,0.001105227,0.006274866,0.0012648224,0.0048406757,0.002114894,0.003718678,0.13823277],"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.000069865746,0.000045460598,0.00021073737,0.0013524634,0.000024523499,0.00024445777,0.00022132158,0.002151683,0.0028490834,0.026992142,0.46344084,0.5023975],"study_design_scores_gemma":[0.0000068972813,0.000024539379,0.00019421682,0.00028976437,0.000008058358,0.00078347715,0.00007831555,0.001345101,0.0006813384,0.009258936,0.987305,0.000024473797],"about_ca_topic_score_codex":0.0020111909,"about_ca_topic_score_gemma":0.0020545274,"teacher_disagreement_score":0.13202998,"about_ca_system_score_codex":0.0008595871,"about_ca_system_score_gemma":0.002030071,"threshold_uncertainty_score":0.4416843},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065465895,0.0019804407,0.98862016,0.00050755707,0.000071994655,0.000021885799,0.00003165043,0.00007544802,0.0021442093],"genre_scores_gemma":[0.23485088,0.006976625,0.7506501,0.00032867186,0.00059867103,0.00019854681,0.00029071848,0.00009549376,0.006010239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992513,0.00028208044,0.000030181345,0.00013923329,0.00024827028,0.000048983322],"domain_scores_gemma":[0.9987274,0.00095309445,0.00009532175,0.00008051184,0.00011925928,0.000024387022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010787864,0.00066708145,0.0005082507,0.00068073114,0.0004925196,0.0007645783,0.00063894567,0.0012186395,0.0009825386],"category_scores_gemma":[0.0036031783,0.00038615175,0.00048528603,0.0017271676,0.0013987961,0.0013342865,0.0006804516,0.0016658399,0.00043493573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014569343,0.00014084858,0.00078052713,0.00046081547,0.00013097655,0.00030954447,0.00027905524,0.33406207,0.011345829,0.18545139,0.0107254265,0.45616782],"study_design_scores_gemma":[0.00002158402,0.000041359846,0.00053297944,0.000027294178,0.000019389461,0.00017426485,0.00003262538,0.8947336,0.0071452092,0.089852646,0.0073770573,0.000042084626],"about_ca_topic_score_codex":0.0018756391,"about_ca_topic_score_gemma":0.0015382738,"teacher_disagreement_score":0.0018756391,"about_ca_system_score_codex":0.00061996747,"about_ca_system_score_gemma":0.0008859767,"threshold_uncertainty_score":0.0057052374},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026240712,0.0037151007,0.011303316,0.041258045,0.92050093,0.00012007012,0.0011920353,0.0010540109,0.018232405],"genre_scores_gemma":[0.046875846,0.009800493,0.021738512,0.019580144,0.19360664,0.00031694872,0.0053943233,0.0026733612,0.70001376],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979482,0.00022407775,0.00037844488,0.00018179332,0.0011310492,0.00013646395],"domain_scores_gemma":[0.98193157,0.0036603743,0.0004947562,0.0013485891,0.011713621,0.0008510596],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024753003,0.0013304487,0.0012782217,0.0020388996,0.0018800497,0.002382567,0.0020468456,0.003974638,0.07479152],"category_scores_gemma":[0.03395853,0.00045167925,0.0011177937,0.0015653736,0.0013724307,0.0020059366,0.0014395679,0.005159114,0.035811037],"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.00012345088,0.000019934605,0.00021360445,0.00026433542,0.000021619937,0.00068106,0.00009865922,0.00017807334,0.0013605095,0.0037503934,0.9375551,0.055733312],"study_design_scores_gemma":[0.000042029384,0.00009962449,0.0018305645,0.000193119,0.000046987705,0.0013885865,0.00014417259,0.0016039386,0.0026485238,0.0024353454,0.98951656,0.000050591632],"about_ca_topic_score_codex":0.00404722,"about_ca_topic_score_gemma":0.00426632,"teacher_disagreement_score":0.9960254,"about_ca_system_score_codex":0.0011347353,"about_ca_system_score_gemma":0.002729166,"threshold_uncertainty_score":0.25020254},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016577595,0.000077465884,0.99769163,0.000057448528,0.000017867776,0.000014181603,0.000020059033,0.00014750802,0.00031609138],"genre_scores_gemma":[0.091133624,0.0003584684,0.9064297,0.00012416071,0.000061514496,0.00013047084,0.00017442585,0.000095022806,0.001492729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924314,0.00030041384,0.000029462899,0.00011395704,0.00026390344,0.000049209306],"domain_scores_gemma":[0.99837804,0.0010137398,0.00018884477,0.00016890121,0.00022088931,0.000029588758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015374082,0.0012202738,0.00063800556,0.00083866995,0.0005022259,0.0006324244,0.00071615836,0.0010844609,0.0016179127],"category_scores_gemma":[0.0056204787,0.0004336929,0.0008837988,0.00092678383,0.0009293021,0.001729569,0.00080585823,0.0012573015,0.0006313557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018183523,0.00006296974,0.0008609475,0.00023818825,0.00008485237,0.00021534158,0.00024574297,0.7265275,0.019347161,0.042355504,0.0037591108,0.20612086],"study_design_scores_gemma":[0.000010818689,0.00003217686,0.00019361966,0.000011171067,0.000007018484,0.000080109014,0.00001540784,0.9833134,0.0029885108,0.011005185,0.0023246382,0.00001789664],"about_ca_topic_score_codex":0.0065390454,"about_ca_topic_score_gemma":0.0072108703,"teacher_disagreement_score":0.0065390454,"about_ca_system_score_codex":0.00058250653,"about_ca_system_score_gemma":0.0011150164,"threshold_uncertainty_score":0.013001978},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87773085,0.0011763443,0.1022958,0.00033351648,0.00006893153,0.00005523417,0.00021712444,0.00042446327,0.017697621],"genre_scores_gemma":[0.97748315,0.0004945635,0.01559208,0.00003831092,0.0000058997794,0.00004986813,0.000059441838,0.000054447264,0.006222199],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972886,0.000052133073,0.00001204252,0.00006599578,0.00009716538,0.00004382252],"domain_scores_gemma":[0.99905545,0.00055524666,0.0001030977,0.00007727805,0.000157445,0.000051412735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049691973,0.0004222963,0.0003430355,0.00024461033,0.00045591287,0.001141171,0.000510489,0.0008138263,0.0067267604],"category_scores_gemma":[0.0028789227,0.00046025962,0.00054540974,0.00014940726,0.0007014307,0.0011186443,0.000999236,0.0005754061,0.0007344437],"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.0007009415,0.00010288184,0.033981323,0.000832464,0.00013627355,0.0014596216,0.006529441,0.07865135,0.65897155,0.024625847,0.0008839967,0.19312425],"study_design_scores_gemma":[0.00007798599,0.0018803312,0.196028,0.00045574998,0.00030697917,0.0034086995,0.00469068,0.44704613,0.2906279,0.026202066,0.028919227,0.00035632288],"about_ca_topic_score_codex":0.0072302544,"about_ca_topic_score_gemma":0.0072071976,"teacher_disagreement_score":0.0072302544,"about_ca_system_score_codex":0.00049483264,"about_ca_system_score_gemma":0.0007405473,"threshold_uncertainty_score":0.022503316},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008312136,0.00026514535,0.98995626,0.00006418018,0.00003432478,0.000015340278,0.00012252512,0.000295275,0.0009347944],"genre_scores_gemma":[0.21020333,0.0013165291,0.7794367,0.00016974461,0.00018701811,0.00012891192,0.0012975188,0.0001910156,0.0070692506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997476,0.000041313193,0.000012009463,0.00005108528,0.00011240997,0.00003561861],"domain_scores_gemma":[0.99958223,0.00017191037,0.00004218409,0.00008434537,0.00009333466,0.000026081549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003100868,0.00067898206,0.0005978611,0.00074959575,0.00022409714,0.00067517074,0.00076698273,0.0007000897,0.0024632013],"category_scores_gemma":[0.0013833059,0.00032316588,0.0007386302,0.0010759605,0.0005514081,0.0011536442,0.0012004834,0.0009975429,0.0009894633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032686917,0.00015363914,0.00047853155,0.00037853196,0.00009337571,0.00017827518,0.00017471235,0.19411339,0.18862036,0.030162685,0.006683774,0.5786358],"study_design_scores_gemma":[0.000019485806,0.00009383026,0.001044528,0.000020199306,0.000027730961,0.00021116823,0.0000437073,0.9617667,0.016078658,0.01778214,0.0028826715,0.000029103734],"about_ca_topic_score_codex":0.0016252456,"about_ca_topic_score_gemma":0.0029376165,"teacher_disagreement_score":0.0024632013,"about_ca_system_score_codex":0.00023550064,"about_ca_system_score_gemma":0.0005302595,"threshold_uncertainty_score":0.008240223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013608382,0.0010118415,0.9932768,0.00006963233,0.0001479141,0.0000132538835,0.00002087552,0.0002684234,0.003830489],"genre_scores_gemma":[0.054575406,0.004360098,0.8910251,0.00019371854,0.00035253933,0.0000868991,0.0003416534,0.00036872516,0.048695706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994979,0.00008501642,0.000025272631,0.00009869671,0.0002690534,0.000024132729],"domain_scores_gemma":[0.99955064,0.00020603584,0.000019423498,0.00007907539,0.00012655798,0.000018311288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006398271,0.0009773532,0.00066393043,0.00093763665,0.00038348383,0.0013945829,0.0008996363,0.0009318508,0.0075960965],"category_scores_gemma":[0.0013450359,0.00054883666,0.0006610423,0.0010901105,0.0011724059,0.0015749256,0.0014507069,0.002121286,0.0048048343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026322927,0.000096606906,0.00011462828,0.0003870358,0.00008084452,0.00009107702,0.0002901732,0.030281752,0.16312875,0.14306284,0.013555514,0.6486476],"study_design_scores_gemma":[0.000034674194,0.00015654578,0.00049482187,0.00013314966,0.0000732489,0.00073534047,0.000081971375,0.49739885,0.20483814,0.15873002,0.13721508,0.00010820655],"about_ca_topic_score_codex":0.00034961035,"about_ca_topic_score_gemma":0.0006521887,"teacher_disagreement_score":0.0075960965,"about_ca_system_score_codex":0.0003518397,"about_ca_system_score_gemma":0.000463979,"threshold_uncertainty_score":0.025411487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029797216,0.00013613715,0.9962651,0.000036724083,0.000015786125,0.0000108442055,0.000006483323,0.00012307569,0.00042613337],"genre_scores_gemma":[0.15733163,0.0005052706,0.83810383,0.000092862116,0.00008734153,0.00008777397,0.000048641356,0.000046646204,0.0036959723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963355,0.00010893927,0.00002017012,0.000041765765,0.00017218532,0.000023369246],"domain_scores_gemma":[0.9993837,0.00025444472,0.000087110435,0.000107812484,0.00014033158,0.000026550568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041776238,0.0004184824,0.00034528595,0.0003898292,0.00026340576,0.0005676183,0.000531833,0.00061923254,0.0012827519],"category_scores_gemma":[0.001450575,0.00026080338,0.00036835534,0.00030321526,0.0006123955,0.00089469703,0.000639423,0.0005467755,0.0007218218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037833932,0.00014647866,0.0007168378,0.00032043166,0.00012256166,0.00017248234,0.00019059154,0.17243285,0.23292796,0.07487447,0.0018230113,0.515894],"study_design_scores_gemma":[0.000019262685,0.00013227861,0.00026544597,0.000010799587,0.000016530625,0.00026957187,0.000018553084,0.9410182,0.043623723,0.010637191,0.0039613163,0.00002714493],"about_ca_topic_score_codex":0.0003860485,"about_ca_topic_score_gemma":0.0006881295,"teacher_disagreement_score":0.0012827519,"about_ca_system_score_codex":0.00023900454,"about_ca_system_score_gemma":0.0005925597,"threshold_uncertainty_score":0.0042912364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039856814,0.00016629772,0.95867056,0.00006026633,0.000034123488,0.000054256125,0.000013516034,0.00016164816,0.000982541],"genre_scores_gemma":[0.443105,0.00035442816,0.5542451,0.00006312905,0.000024489804,0.00012022296,0.00005982733,0.00003905555,0.001988672],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967515,0.000096707925,0.000028990999,0.000069797745,0.00011323913,0.000016189097],"domain_scores_gemma":[0.99942833,0.00027116487,0.000114698916,0.000055774064,0.000110265646,0.00001964499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004904568,0.00042082547,0.00022186419,0.0003563581,0.00019078043,0.0002733876,0.0003296561,0.0003656038,0.0007217458],"category_scores_gemma":[0.002340109,0.00017985316,0.00017631592,0.0002357419,0.0004303675,0.00058263174,0.00027803174,0.00035359227,0.00024078909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039906104,0.00009214968,0.0013185526,0.00046643752,0.000047730777,0.00023549338,0.00034278564,0.21277097,0.4648835,0.059744194,0.00032537038,0.25937378],"study_design_scores_gemma":[0.00006045255,0.0007058582,0.00053711,0.000066675035,0.000034775912,0.0003210664,0.000045214514,0.6237135,0.3545865,0.0096798865,0.010205276,0.000043685875],"about_ca_topic_score_codex":0.00028146943,"about_ca_topic_score_gemma":0.00037915696,"teacher_disagreement_score":0.0007217458,"about_ca_system_score_codex":0.0002589972,"about_ca_system_score_gemma":0.00038008144,"threshold_uncertainty_score":0.0025938153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051917277,0.00049890706,0.92778665,0.00051190815,0.00028575846,0.00076603034,0.0012028735,0.005489933,0.011540578],"genre_scores_gemma":[0.59122294,0.0005847009,0.38930073,0.0007213832,0.00024712522,0.0009667735,0.00084157503,0.0003015025,0.01581336],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99942744,0.00009593686,0.000032132495,0.00013079544,0.00026669342,0.000047024245],"domain_scores_gemma":[0.9994142,0.00019046948,0.00004685812,0.00007233882,0.00022940148,0.00004682395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009392075,0.00046227738,0.00035445733,0.0004874355,0.00035794816,0.0010144134,0.00060551765,0.00063109276,0.009819122],"category_scores_gemma":[0.0019406944,0.00022876915,0.00016193537,0.00039519015,0.00045068553,0.0007185058,0.0005872611,0.00036636842,0.002893399],"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.001733404,0.00021099688,0.0036316903,0.00089541386,0.00005403289,0.0003629845,0.0005687844,0.005261616,0.4833622,0.01260523,0.01685815,0.47445542],"study_design_scores_gemma":[0.00043055977,0.0019743128,0.015455442,0.00030329332,0.00015396543,0.0023263602,0.00030717428,0.16677117,0.6453238,0.0103148455,0.1564383,0.00020086337],"about_ca_topic_score_codex":0.00083067926,"about_ca_topic_score_gemma":0.0011933305,"teacher_disagreement_score":0.009819122,"about_ca_system_score_codex":0.00037020814,"about_ca_system_score_gemma":0.00091896555,"threshold_uncertainty_score":0.03284824},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002775795,0.1650112,0.8203026,0.0011175829,0.0007360879,0.00007029251,0.00015352503,0.00043572774,0.009397126],"genre_scores_gemma":[0.06944759,0.28036577,0.6330996,0.0009859179,0.0033901564,0.00030052743,0.0008835419,0.00025754844,0.011269253],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993487,0.00012716485,0.00006729109,0.00013427365,0.00029133956,0.000031167812],"domain_scores_gemma":[0.99921906,0.0003772052,0.000051026345,0.00006430642,0.0002618784,0.000026479795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009213735,0.0007634734,0.0014249071,0.00228367,0.00045313258,0.0016733117,0.0010268904,0.0013330989,0.0023618012],"category_scores_gemma":[0.0017803643,0.0003955456,0.000633439,0.0050008465,0.0009517155,0.0019926992,0.0008110451,0.0016960922,0.0029023213],"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.000062414074,0.00006587289,0.0006178211,0.001043446,0.0000711456,0.00015361457,0.00009242907,0.016425224,0.0061012004,0.051531147,0.013039469,0.9107963],"study_design_scores_gemma":[0.000052422587,0.00033371657,0.0030633984,0.0007961928,0.00015077037,0.0023932334,0.00024624853,0.27851656,0.012161054,0.22055623,0.48150983,0.00022042295],"about_ca_topic_score_codex":0.0010055222,"about_ca_topic_score_gemma":0.0006333451,"teacher_disagreement_score":0.0023618012,"about_ca_system_score_codex":0.0005165964,"about_ca_system_score_gemma":0.0007506465,"threshold_uncertainty_score":0.007901013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32666698,0.0028146915,0.6513518,0.0008398069,0.00032683893,0.00012745126,0.0069209253,0.00310918,0.00784232],"genre_scores_gemma":[0.43152383,0.0019712218,0.53739506,0.00012468144,0.00033694727,0.00012711086,0.018012075,0.0006381081,0.009871085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996178,0.000082697516,0.000022987717,0.0000662773,0.00017434188,0.000035791723],"domain_scores_gemma":[0.99910396,0.00046447644,0.00005917349,0.0001786612,0.00016538563,0.00002821191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000849147,0.0009686074,0.0005241912,0.001590542,0.0004931535,0.0007046212,0.0008269496,0.00075993885,0.0014027354],"category_scores_gemma":[0.0037016214,0.00034515845,0.0008988176,0.0033104853,0.00041734104,0.0010437886,0.00096967665,0.0009662824,0.0011260348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010943615,0.00013763242,0.004987862,0.0005814148,0.0003446346,0.000518612,0.00043022895,0.13743566,0.060407322,0.007124774,0.018330516,0.768607],"study_design_scores_gemma":[0.00018183819,0.00015750958,0.03337521,0.00010833851,0.00020734081,0.000980916,0.0002983163,0.81121385,0.09569767,0.03675207,0.020890344,0.00013669435],"about_ca_topic_score_codex":0.006178948,"about_ca_topic_score_gemma":0.006792026,"teacher_disagreement_score":0.006178948,"about_ca_system_score_codex":0.00035292393,"about_ca_system_score_gemma":0.0005021476,"threshold_uncertainty_score":0.012285948},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009249364,0.00031247726,0.9893968,0.00008177275,0.00004729346,0.000008390203,0.000010288543,0.00014757016,0.00074604416],"genre_scores_gemma":[0.28351697,0.0014173329,0.70379984,0.00009037001,0.0003112277,0.000057078985,0.00012371746,0.00011975439,0.010563673],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99964046,0.00008722593,0.000020281363,0.00006737522,0.00015750909,0.000027128515],"domain_scores_gemma":[0.9993919,0.00030088294,0.0000847033,0.00008857354,0.00011224286,0.000021629363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006507241,0.0008339082,0.0005920573,0.0005894343,0.00025682102,0.0008327366,0.00037549317,0.0007147037,0.0010700261],"category_scores_gemma":[0.003165028,0.00028723228,0.00055224885,0.0009683002,0.00036311775,0.0012099976,0.00094824354,0.00053791073,0.0006771546],"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.00046503675,0.00007808578,0.0012892974,0.00017669263,0.00016421745,0.0001873627,0.00025229462,0.25113878,0.07751784,0.04393017,0.0024774515,0.62232274],"study_design_scores_gemma":[0.000015852234,0.00014936806,0.0005648171,0.000018860106,0.000049887713,0.00023901704,0.00003432089,0.9547021,0.027204618,0.0118089905,0.005172033,0.000040094048],"about_ca_topic_score_codex":0.00075997936,"about_ca_topic_score_gemma":0.00070498185,"teacher_disagreement_score":0.0010700261,"about_ca_system_score_codex":0.00020044856,"about_ca_system_score_gemma":0.00032232184,"threshold_uncertainty_score":0.003579557},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007838448,0.0001923153,0.9908103,0.00015986693,0.00002005195,0.000016922739,0.00006737241,0.00029160883,0.00060311373],"genre_scores_gemma":[0.4984855,0.00080321525,0.49242875,0.00034192344,0.00017340673,0.00013427349,0.0008035723,0.00020442442,0.006624899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998917,0.00044653384,0.000042871194,0.00022604884,0.00028242418,0.00008510796],"domain_scores_gemma":[0.9982774,0.00097613706,0.00021622093,0.0002213242,0.00025060598,0.00005827855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021322242,0.0010582791,0.0008661143,0.0012645845,0.00044721528,0.0014891847,0.0014986707,0.0017585894,0.0018221308],"category_scores_gemma":[0.0073971436,0.0006848962,0.0008448312,0.00139212,0.001282419,0.0018573188,0.0014873382,0.0018692367,0.0011612882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003477075,0.00008545385,0.0020444463,0.0001540286,0.00011514809,0.00018981179,0.00013490656,0.8126529,0.009208892,0.04656365,0.0027151983,0.12578773],"study_design_scores_gemma":[0.000014121653,0.000010114547,0.00034353408,0.000009141933,0.00000785577,0.000057815178,0.000007275751,0.98211426,0.0007928256,0.016021628,0.0006068098,0.0000146168795],"about_ca_topic_score_codex":0.0091478005,"about_ca_topic_score_gemma":0.0065504727,"teacher_disagreement_score":0.0091478005,"about_ca_system_score_codex":0.0010649479,"about_ca_system_score_gemma":0.0016212974,"threshold_uncertainty_score":0.018189073},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009600984,0.00022368271,0.98763275,0.000064195905,0.000046201152,0.000039328494,0.000021246542,0.0002770888,0.0020945342],"genre_scores_gemma":[0.3596192,0.00083907985,0.6318809,0.00022500318,0.00013255447,0.00027124706,0.0002024606,0.000120634344,0.006708878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999537,0.00008718198,0.0000385455,0.00010372072,0.00018374129,0.000049909322],"domain_scores_gemma":[0.99920374,0.0002513493,0.00011194253,0.00007795294,0.00031967074,0.00003525624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057397975,0.00059087004,0.0005256885,0.0004873763,0.00034463152,0.0012129303,0.00059379585,0.001613734,0.0023725352],"category_scores_gemma":[0.0021616924,0.00020599838,0.00032896825,0.0004365761,0.00035043192,0.0010001665,0.00038538923,0.00068870455,0.0016644797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011094386,0.00016563995,0.00096727145,0.0005699334,0.00009507086,0.00022000745,0.0002720655,0.08206957,0.30633715,0.054340538,0.0038237378,0.55002975],"study_design_scores_gemma":[0.00014092213,0.0009956072,0.001027681,0.000056512377,0.000096498115,0.0007383425,0.00007102247,0.72817206,0.23569934,0.011564566,0.021381604,0.000055789467],"about_ca_topic_score_codex":0.0004652044,"about_ca_topic_score_gemma":0.0003387031,"teacher_disagreement_score":0.0023725352,"about_ca_system_score_codex":0.00049447996,"about_ca_system_score_gemma":0.00057488173,"threshold_uncertainty_score":0.007936895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004907966,0.00010970458,0.99882704,0.000033639768,0.000020898226,0.000005457845,0.000010466432,0.00006764713,0.0004343264],"genre_scores_gemma":[0.056909185,0.0009546613,0.93575174,0.00011618061,0.00025664852,0.00009304798,0.00014401262,0.00012280156,0.0056517334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916935,0.00019829921,0.00005261798,0.00016252085,0.00036751264,0.000049762857],"domain_scores_gemma":[0.9992392,0.00043200978,0.000054287542,0.00008655614,0.00016204239,0.000025898757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010646472,0.0006761627,0.00065774296,0.0009924306,0.0003535953,0.0010021992,0.0008133503,0.00091147836,0.0024408824],"category_scores_gemma":[0.0034346827,0.0004356665,0.0006872978,0.0007489517,0.0007625209,0.0019283354,0.00097381516,0.0014406438,0.001040494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016101044,0.00007228829,0.00049271586,0.0002909359,0.00016306428,0.00017886628,0.0001927004,0.22742592,0.04230219,0.34896976,0.0032397723,0.37651077],"study_design_scores_gemma":[0.000021481303,0.000071142844,0.0002616095,0.000028265707,0.00003871346,0.00017715637,0.000014637019,0.92920077,0.010697921,0.0489849,0.010453163,0.000050217666],"about_ca_topic_score_codex":0.0016994664,"about_ca_topic_score_gemma":0.002056839,"teacher_disagreement_score":0.0024408824,"about_ca_system_score_codex":0.00063318695,"about_ca_system_score_gemma":0.0009478483,"threshold_uncertainty_score":0.008165538},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013782874,0.0005395778,0.98289746,0.00012774022,0.00016650603,0.000083631356,0.000051380408,0.00079758733,0.0015531743],"genre_scores_gemma":[0.26303446,0.000508236,0.7298398,0.00024782727,0.0002420418,0.00009828056,0.0001724315,0.000043313426,0.005813661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994585,0.000116881274,0.0000486642,0.000108884466,0.00022052585,0.000046620476],"domain_scores_gemma":[0.9993747,0.00014961754,0.000087424574,0.00020817353,0.00014812326,0.000032076732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005986123,0.0005035186,0.0005525908,0.0005563566,0.00040625944,0.0005528677,0.00098681,0.0009216387,0.0030026552],"category_scores_gemma":[0.0011446086,0.00024654882,0.00034800143,0.00040443425,0.00036113188,0.0013870959,0.00068958924,0.0007416116,0.0011179472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007960667,0.00015591364,0.0004648241,0.0004708027,0.00007128634,0.00020513959,0.0001341629,0.012090945,0.29694003,0.023627082,0.0022911902,0.66275257],"study_design_scores_gemma":[0.00041541646,0.0022210367,0.0018162789,0.00018761682,0.00027788163,0.0039268234,0.000060905382,0.51805365,0.39996278,0.012892035,0.05993607,0.00024954515],"about_ca_topic_score_codex":0.00023410546,"about_ca_topic_score_gemma":0.00046080264,"teacher_disagreement_score":0.0030026552,"about_ca_system_score_codex":0.00027096362,"about_ca_system_score_gemma":0.0005295686,"threshold_uncertainty_score":0.010044873},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016488292,0.00003685799,0.9976841,0.00006011536,0.000004226093,0.00001158782,0.00002069791,0.00010624342,0.00042731332],"genre_scores_gemma":[0.18855986,0.0003449255,0.80579734,0.00011117265,0.00007183578,0.000236532,0.0003976036,0.0001622467,0.00431846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845266,0.0006706423,0.00006788883,0.00021800617,0.00049107557,0.000099771474],"domain_scores_gemma":[0.9974765,0.0015839939,0.00014630036,0.00043989823,0.00028619755,0.00006715196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002433524,0.0009346976,0.0014450612,0.00056890084,0.00041547773,0.0012227591,0.0014341077,0.0011604981,0.0025146645],"category_scores_gemma":[0.010485568,0.0007432122,0.0007782996,0.0009821516,0.0010914302,0.0026119307,0.003016363,0.0024800652,0.00113816],"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.00014782112,0.00007438387,0.00069763284,0.00018298937,0.00007194264,0.000093727416,0.00019183707,0.5083747,0.006734892,0.18615754,0.0042879554,0.29298452],"study_design_scores_gemma":[0.000004639401,0.000012188506,0.00004686635,0.0000044035905,0.0000029094524,0.000027785589,0.0000057597,0.96497923,0.0009853191,0.03318715,0.000738066,0.0000056303984],"about_ca_topic_score_codex":0.0013861266,"about_ca_topic_score_gemma":0.0013349099,"teacher_disagreement_score":0.0025146645,"about_ca_system_score_codex":0.00061070407,"about_ca_system_score_gemma":0.0013656236,"threshold_uncertainty_score":0.012869835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008345175,0.00019743881,0.9902356,0.00010032925,0.000033383767,0.000012038517,0.000021764412,0.00027758072,0.00077670265],"genre_scores_gemma":[0.7111435,0.0010138819,0.27483574,0.00031915915,0.00022128495,0.00015015589,0.0003147449,0.0006850628,0.0113164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849737,0.0006358572,0.00007956243,0.00028245582,0.00042057267,0.00008430728],"domain_scores_gemma":[0.9954085,0.003491725,0.0003434658,0.00041719677,0.00030683636,0.00003236299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024337927,0.0013057317,0.0010877801,0.0006271095,0.0003303388,0.0012253731,0.0007275302,0.001585999,0.0016732002],"category_scores_gemma":[0.009879575,0.0008225819,0.0011041,0.0005761972,0.0011327243,0.0017092134,0.0015519666,0.0013964908,0.0007292889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015772114,0.000032052467,0.00029568767,0.00010313867,0.00009191067,0.0001783964,0.00017036019,0.920456,0.01621947,0.024214534,0.00073238875,0.03734835],"study_design_scores_gemma":[0.000004407673,0.000040719646,0.00015651247,0.000008394628,0.000013029609,0.00007546589,0.000008789644,0.9879964,0.0064188447,0.004694864,0.0005597486,0.00002299309],"about_ca_topic_score_codex":0.0017807615,"about_ca_topic_score_gemma":0.000846842,"teacher_disagreement_score":0.0024337927,"about_ca_system_score_codex":0.00043361558,"about_ca_system_score_gemma":0.0003656212,"threshold_uncertainty_score":0.012871265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017455477,0.000904495,0.9777206,0.00012650627,0.00018642291,0.00009941123,0.00021403414,0.0009996068,0.0022934868],"genre_scores_gemma":[0.11371088,0.002276941,0.87960523,0.000075967546,0.00018888128,0.0001406824,0.0006570554,0.000106996435,0.0032373741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981755,0.000018576817,0.000011272913,0.000044483302,0.00009196442,0.000016025828],"domain_scores_gemma":[0.999821,0.000044787732,0.000020290017,0.00002099481,0.00008353083,0.000009437012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022440823,0.0007720267,0.0005171312,0.00124384,0.00024601226,0.00041003097,0.00033356517,0.00040569986,0.0014751555],"category_scores_gemma":[0.0010092547,0.00019039934,0.00042793463,0.0008299514,0.00025418887,0.00057471683,0.0002404053,0.0005569655,0.0012123649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012853475,0.000035566038,0.000587939,0.00022842974,0.000031988515,0.00015560258,0.000080344376,0.0069100466,0.24102274,0.0022223953,0.0023572394,0.74623924],"study_design_scores_gemma":[0.00005998613,0.0005788744,0.017397871,0.00019470626,0.00020204642,0.0020773748,0.00024632996,0.4816199,0.43836465,0.009879874,0.0492388,0.00013960247],"about_ca_topic_score_codex":0.0022041458,"about_ca_topic_score_gemma":0.002476988,"teacher_disagreement_score":0.0022041458,"about_ca_system_score_codex":0.00020959073,"about_ca_system_score_gemma":0.00037588965,"threshold_uncertainty_score":0.004934907},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032931376,0.00043236237,0.96434283,0.000071134586,0.000096047304,0.00011911348,0.00028432353,0.0009183591,0.00080442784],"genre_scores_gemma":[0.18564115,0.0013038561,0.8083203,0.000045100795,0.000087936496,0.00027472936,0.0014017393,0.00019971289,0.0027254478],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99963534,0.000048927337,0.000036866306,0.00006439055,0.00017160023,0.000042849686],"domain_scores_gemma":[0.9995054,0.00016075915,0.000052628347,0.000057366546,0.00019629791,0.000027520728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045831094,0.00068048463,0.0008258086,0.0023026655,0.00025931248,0.00077985233,0.00052307895,0.0006166767,0.0018043476],"category_scores_gemma":[0.0015332979,0.00031899795,0.000670232,0.0026886836,0.0002852165,0.0011921108,0.0004929942,0.0008651472,0.002340264],"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.00035354547,0.00012792644,0.0010181532,0.00025523957,0.000045397195,0.00020770846,0.00006218271,0.0056924205,0.20245774,0.002102057,0.0022857152,0.7853919],"study_design_scores_gemma":[0.00019936827,0.0009945392,0.024095463,0.00013689333,0.00034679737,0.0020505448,0.00041129946,0.65575624,0.2698228,0.009192469,0.036858127,0.00013549888],"about_ca_topic_score_codex":0.0007157196,"about_ca_topic_score_gemma":0.00053534406,"teacher_disagreement_score":0.0023026655,"about_ca_system_score_codex":0.00018580878,"about_ca_system_score_gemma":0.00057633343,"threshold_uncertainty_score":0.0060361624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031397308,0.000049311,0.9987961,0.000022053537,0.000036929552,0.000030477186,0.000013916129,0.00019733413,0.00053982297],"genre_scores_gemma":[0.016667927,0.00012218891,0.9756925,0.00008086968,0.000049196293,0.00027082875,0.0001399442,0.00011978922,0.006856753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921095,0.00023588887,0.000036940386,0.00013503432,0.00034615718,0.00003506516],"domain_scores_gemma":[0.99931395,0.0002889832,0.0000405355,0.00010458944,0.00022563717,0.000026387568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007922118,0.0009358828,0.00076271716,0.0008448943,0.0005554167,0.0006784145,0.0010868552,0.0012725961,0.009417397],"category_scores_gemma":[0.0023299407,0.0004558027,0.00083047623,0.00060171925,0.00039419028,0.0008536422,0.0010254263,0.0016204139,0.0053103487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001981012,0.00017189824,0.0002995398,0.00033800048,0.00013054961,0.00016053498,0.00011792623,0.08197005,0.040882833,0.04885248,0.00813783,0.81874025],"study_design_scores_gemma":[0.000045543246,0.000092191534,0.00027823134,0.000025249303,0.000025569723,0.00018965353,0.0000125719125,0.9599963,0.010055742,0.0106285,0.01860785,0.00004264729],"about_ca_topic_score_codex":0.0009959603,"about_ca_topic_score_gemma":0.0016860234,"teacher_disagreement_score":0.009417397,"about_ca_system_score_codex":0.0002567187,"about_ca_system_score_gemma":0.00083409104,"threshold_uncertainty_score":0.031504273},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019216754,0.00018412393,0.9780457,0.00009313104,0.00003027527,0.0000134969305,0.00004537741,0.00048841315,0.0018827473],"genre_scores_gemma":[0.21916075,0.0009147455,0.77256817,0.00007507191,0.000057156383,0.0000390804,0.00028911175,0.00024062817,0.006655223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997304,0.000084502484,0.000013154766,0.000036282767,0.00011101817,0.00002464614],"domain_scores_gemma":[0.99922097,0.0003898586,0.000057392732,0.00015459652,0.00015093798,0.000026210611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055410556,0.0005074242,0.00039198328,0.0007270717,0.00023480716,0.0007983213,0.00033410717,0.0005205056,0.003389732],"category_scores_gemma":[0.0021046726,0.00023911621,0.0005563526,0.00055463903,0.0005020895,0.0011387256,0.0006118795,0.0008592198,0.0013609132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059706817,0.000095690884,0.0007718469,0.00026220415,0.000070246235,0.0003093742,0.00025968053,0.15353414,0.28239277,0.10075548,0.0017216781,0.45922983],"study_design_scores_gemma":[0.000019377061,0.000058058187,0.00064844865,0.00001981693,0.000019145851,0.00033158687,0.000031382297,0.90027505,0.077788405,0.01729984,0.0034804302,0.000028360004],"about_ca_topic_score_codex":0.0009130603,"about_ca_topic_score_gemma":0.00097019883,"teacher_disagreement_score":0.003389732,"about_ca_system_score_codex":0.00022970856,"about_ca_system_score_gemma":0.0004537593,"threshold_uncertainty_score":0.011339843},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047772,0.0018155081,0.99170387,0.00013653714,0.00010894986,0.000018284276,0.00003892711,0.00025359227,0.0011471175],"genre_scores_gemma":[0.13715461,0.009722925,0.84451693,0.00035061844,0.0012467592,0.00015234595,0.00042026537,0.00032851225,0.006106995],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989292,0.0003686053,0.00006335558,0.00020086492,0.0003722052,0.00006573441],"domain_scores_gemma":[0.99562716,0.00331424,0.00024107078,0.00028600715,0.0004759656,0.00005558807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012084295,0.00079334574,0.0009405781,0.0014614607,0.00046711802,0.0012428843,0.00074225286,0.001269997,0.0012671112],"category_scores_gemma":[0.009481324,0.0004134954,0.00048528673,0.0016853645,0.0016371405,0.0018371571,0.001070696,0.00095962477,0.0010605842],"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.0004959341,0.000033870023,0.00069223915,0.000588433,0.000116072166,0.0005960743,0.00037803446,0.07744208,0.05741326,0.080457166,0.0058328807,0.77595395],"study_design_scores_gemma":[0.00006600639,0.00018107367,0.0019633388,0.00013296984,0.00007048384,0.0016483252,0.0001341987,0.79883295,0.032751508,0.1384466,0.025647439,0.00012505832],"about_ca_topic_score_codex":0.0013198365,"about_ca_topic_score_gemma":0.0007726019,"teacher_disagreement_score":0.0014614607,"about_ca_system_score_codex":0.00031953058,"about_ca_system_score_gemma":0.0004060668,"threshold_uncertainty_score":0.00639081},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080585486,0.000048033748,0.99837035,0.00001943041,0.0000149700045,0.000013256176,0.000011211362,0.00032420017,0.00039273422],"genre_scores_gemma":[0.16917568,0.00035466344,0.82294756,0.00013533732,0.00006765392,0.00025413046,0.00019092577,0.00015604368,0.006718002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991849,0.0001985894,0.00003776021,0.00018910377,0.00032753535,0.00006201814],"domain_scores_gemma":[0.99965775,0.00011466628,0.000044956283,0.000075872886,0.00009143921,0.000015421127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007657318,0.00060883595,0.0012212832,0.0007761491,0.0005572843,0.00089135044,0.00087066484,0.0014687973,0.0035599777],"category_scores_gemma":[0.0017172662,0.0004104741,0.0009954002,0.00070651533,0.0005209062,0.0012644628,0.0010083776,0.001128382,0.0020440414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025487618,0.00013249366,0.0004041567,0.000260573,0.00018840595,0.0001374872,0.00011104847,0.3911342,0.052490823,0.087347135,0.00414193,0.46339694],"study_design_scores_gemma":[0.00002162981,0.000060149137,0.00013451898,0.000009595855,0.000018102915,0.00009488316,0.0000069137504,0.9746816,0.008636732,0.01286149,0.0034506375,0.000023707988],"about_ca_topic_score_codex":0.001166083,"about_ca_topic_score_gemma":0.0007809987,"teacher_disagreement_score":0.0035599777,"about_ca_system_score_codex":0.0004860858,"about_ca_system_score_gemma":0.0010437667,"threshold_uncertainty_score":0.011909306},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0090991175,0.00039045743,0.9883333,0.000106178784,0.00007350708,0.000023047896,0.000009779199,0.00019799669,0.0017667636],"genre_scores_gemma":[0.4331066,0.00045993895,0.5603274,0.0002088122,0.00017575752,0.00007381832,0.000030569005,0.000047945574,0.0055691805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999613,0.000092051945,0.000020430709,0.00008560716,0.00015820251,0.00003080858],"domain_scores_gemma":[0.9995702,0.00021935087,0.000026039555,0.00005690123,0.00011042158,0.000017024213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005799731,0.00039299804,0.0004781603,0.000459795,0.00033572727,0.00060444284,0.00096591143,0.00082372,0.0017196531],"category_scores_gemma":[0.001178172,0.00019660848,0.00028371153,0.000436773,0.0005982487,0.0011469185,0.00063612725,0.00069417147,0.00036748566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006000021,0.00016198475,0.00071656547,0.00028406116,0.000114476374,0.00022680464,0.00022318873,0.14775209,0.117498726,0.17519167,0.0024527535,0.55477774],"study_design_scores_gemma":[0.000069903756,0.00014906659,0.00020981101,0.000013107999,0.000029004534,0.00019967185,0.000015665915,0.94122165,0.024542257,0.028276779,0.005237533,0.000035460722],"about_ca_topic_score_codex":0.0005828928,"about_ca_topic_score_gemma":0.00072572596,"teacher_disagreement_score":0.0017196531,"about_ca_system_score_codex":0.00044775035,"about_ca_system_score_gemma":0.0004802164,"threshold_uncertainty_score":0.005752802},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050985855,0.00006184121,0.99441695,0.000021253356,0.000010633343,0.000009396125,0.00001001434,0.00012299696,0.00024835832],"genre_scores_gemma":[0.1998159,0.00026484896,0.79775876,0.000053823394,0.000035077635,0.000099849916,0.000091709786,0.000038081278,0.0018420138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999747,0.00007704255,0.000015827134,0.000034814664,0.00010458269,0.000020663469],"domain_scores_gemma":[0.99902284,0.0005619433,0.00014054004,0.00011878948,0.00013096322,0.000024860052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046042172,0.00040973848,0.00033787926,0.00028428342,0.00022862609,0.00039978148,0.0005472051,0.0006799278,0.0008841092],"category_scores_gemma":[0.002894135,0.00018878756,0.00023620314,0.00032663564,0.0005519676,0.00078866223,0.0004208355,0.0006780725,0.0005299026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005886586,0.0000890575,0.000669052,0.00029826586,0.000053081225,0.00011048517,0.0002153856,0.26362583,0.18439907,0.031296067,0.0014185265,0.5172365],"study_design_scores_gemma":[0.000018709268,0.0000840439,0.0002851894,0.000018787547,0.000009422875,0.0002118224,0.00000938324,0.94926757,0.043521933,0.0049841492,0.0015684691,0.000020646443],"about_ca_topic_score_codex":0.00053324795,"about_ca_topic_score_gemma":0.0008642849,"teacher_disagreement_score":0.0008841092,"about_ca_system_score_codex":0.00021916708,"about_ca_system_score_gemma":0.0005095964,"threshold_uncertainty_score":0.002957642},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004828339,0.00081386697,0.9901664,0.00018150477,0.00036675637,0.000026973568,0.000041143114,0.0004830902,0.0030918422],"genre_scores_gemma":[0.1880923,0.0022913425,0.7807475,0.0013683419,0.00093832606,0.00014956469,0.00030280728,0.0001601687,0.025949668],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996711,0.000036308513,0.000018615734,0.000118484924,0.00012341274,0.000032028678],"domain_scores_gemma":[0.99969494,0.00008049467,0.000023099883,0.000060890852,0.00010700945,0.000033593496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035629695,0.00048874057,0.00053345127,0.0006250324,0.00038302786,0.0007098601,0.0008525383,0.0013601551,0.005061996],"category_scores_gemma":[0.00080779067,0.00024176283,0.0005587701,0.00064306264,0.00062151486,0.0018548851,0.0005573478,0.0009748933,0.001645846],"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.00038347277,0.00009402604,0.001163721,0.00038297792,0.00016554193,0.0002996714,0.00014487308,0.020995144,0.19180895,0.10221222,0.009773414,0.67257595],"study_design_scores_gemma":[0.00017973901,0.0005862853,0.002025574,0.000069766495,0.00025493823,0.0022596037,0.00007324447,0.58021444,0.10170089,0.06225914,0.2501846,0.00019175462],"about_ca_topic_score_codex":0.0006195209,"about_ca_topic_score_gemma":0.00069317524,"teacher_disagreement_score":0.005061996,"about_ca_system_score_codex":0.00027424228,"about_ca_system_score_gemma":0.0003600022,"threshold_uncertainty_score":0.016934037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005553844,0.00007686121,0.9988978,0.000021891741,0.000011417449,0.00000780443,0.000010347654,0.00017022247,0.00024832357],"genre_scores_gemma":[0.07422196,0.0006270258,0.91821915,0.00007551478,0.000078954276,0.00016335011,0.00020462117,0.0001870901,0.006222305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956423,0.00012510493,0.00002230214,0.000105806226,0.00013638519,0.000046129648],"domain_scores_gemma":[0.99927086,0.00044051875,0.00007303928,0.00007663778,0.00012342689,0.00001561303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007019369,0.000983738,0.0008073166,0.00057073985,0.00046980736,0.00077849574,0.0007701923,0.00089242,0.0034827392],"category_scores_gemma":[0.002653288,0.00044564114,0.00078094844,0.0006257304,0.0006537361,0.0011490297,0.0010552648,0.0015188805,0.0016944202],"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.00012350302,0.00003273709,0.00053546217,0.00023328714,0.000097574906,0.00022354948,0.00021994507,0.51001984,0.023762662,0.17121474,0.0047143977,0.28882232],"study_design_scores_gemma":[0.000014693881,0.00002243042,0.00015154801,0.000014498088,0.000019577486,0.00014361253,0.000010703032,0.9664265,0.0042819725,0.022511557,0.006379725,0.000023202902],"about_ca_topic_score_codex":0.003271267,"about_ca_topic_score_gemma":0.003863259,"teacher_disagreement_score":0.0034827392,"about_ca_system_score_codex":0.0007661566,"about_ca_system_score_gemma":0.0010060511,"threshold_uncertainty_score":0.01165086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05757034,0.00018331282,0.94091696,0.00010644387,0.00003503805,0.000010849211,0.000020537236,0.00021556046,0.0009409056],"genre_scores_gemma":[0.7716933,0.00041493672,0.22442324,0.000071048795,0.000080159945,0.00003877372,0.00009630474,0.000058893267,0.0031233833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969804,0.00009471992,0.000012848002,0.000054511267,0.0001029535,0.000036976864],"domain_scores_gemma":[0.99839586,0.0011191067,0.00010942061,0.00010174185,0.00022714226,0.00004679261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067290216,0.00066388963,0.000657806,0.0003464464,0.00037721242,0.00059995253,0.00049385655,0.00068394054,0.0005685767],"category_scores_gemma":[0.0038116158,0.00035184674,0.00021020092,0.00041852868,0.0006006586,0.0013934778,0.0009493975,0.00076056155,0.00038656904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017154814,0.00014307359,0.003758788,0.00016205608,0.000094152296,0.0002742517,0.00036052355,0.46067962,0.10302253,0.023529017,0.0015181794,0.4047423],"study_design_scores_gemma":[0.000011113836,0.000032046133,0.00041061398,0.000003898653,0.000006938471,0.000044255856,0.000007887281,0.9900085,0.0055629746,0.0037608708,0.00014234232,0.000008644378],"about_ca_topic_score_codex":0.0013404557,"about_ca_topic_score_gemma":0.001719464,"teacher_disagreement_score":0.0013404557,"about_ca_system_score_codex":0.00021629933,"about_ca_system_score_gemma":0.00044095377,"threshold_uncertainty_score":0.0035586953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016824007,0.0001391157,0.9815506,0.00006106605,0.00001612974,0.000016439622,0.00002971289,0.00030648638,0.0010564507],"genre_scores_gemma":[0.81827307,0.0004944205,0.17565137,0.000066246175,0.000040575145,0.00011081097,0.00021971921,0.00005708795,0.0050867163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971694,0.00009278905,0.000017596307,0.000061537685,0.00008417527,0.00002698019],"domain_scores_gemma":[0.99946064,0.00030621808,0.00009513282,0.00006678395,0.00006271085,0.000008613894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047620686,0.00044751828,0.0004098141,0.00040943554,0.00019679584,0.00046804984,0.0003823577,0.00045388113,0.0011063874],"category_scores_gemma":[0.0021474487,0.00025091416,0.00045899843,0.00027398486,0.0003353383,0.0005281465,0.00051292655,0.0005192623,0.0003556947],"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.00017638034,0.000052991876,0.0013901572,0.00020820237,0.000101565274,0.0002560194,0.00016032404,0.701293,0.033412818,0.033228528,0.0011381652,0.22858188],"study_design_scores_gemma":[0.0000046413115,0.000020095691,0.00034380742,0.0000061578526,0.0000060145176,0.00005089311,0.000009215292,0.98950243,0.0042486386,0.0049698395,0.00083083217,0.0000073770866],"about_ca_topic_score_codex":0.0012528666,"about_ca_topic_score_gemma":0.0012461797,"teacher_disagreement_score":0.0012528666,"about_ca_system_score_codex":0.00019122571,"about_ca_system_score_gemma":0.00037559663,"threshold_uncertainty_score":0.00370121},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123163,0.0012507384,0.8615763,0.00031508232,0.000096062795,0.000085881155,0.000060124945,0.00041619915,0.013036618],"genre_scores_gemma":[0.92628086,0.0010867058,0.06731179,0.000066714056,0.000024455627,0.00006522863,0.00003813852,0.000041808195,0.005084373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998661,0.000050265484,0.0000031497705,0.00000810397,0.0000550906,0.000017304355],"domain_scores_gemma":[0.9991598,0.0006532997,0.000038100945,0.00003104979,0.000107293796,0.000010472376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041408473,0.00024844342,0.0002954271,0.00015096519,0.00021612615,0.0002943798,0.00033700082,0.00048854004,0.0025960712],"category_scores_gemma":[0.0018808533,0.00013429766,0.00018970438,0.00023607639,0.0002811685,0.00060529,0.00020106588,0.00032701797,0.00025672896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099828,0.00003897483,0.0005420455,0.00010794949,0.00002671616,0.0000940774,0.00005958377,0.9308439,0.0118009625,0.028922793,0.0005837754,0.026879495],"study_design_scores_gemma":[0.0000039538895,0.000030773266,0.00010447321,0.0000044475637,0.000002889799,0.00002118803,0.0000049610103,0.9973242,0.00086491165,0.001359387,0.00027642876,0.000002300155],"about_ca_topic_score_codex":0.0028112798,"about_ca_topic_score_gemma":0.0030471047,"teacher_disagreement_score":0.0028112798,"about_ca_system_score_codex":0.00041574278,"about_ca_system_score_gemma":0.0003665319,"threshold_uncertainty_score":0.008684754},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058163767,0.0007685577,0.997338,0.0001484982,0.000046058656,0.000020329599,0.000035943624,0.0003785029,0.00068254705],"genre_scores_gemma":[0.013002851,0.0016459208,0.98224854,0.00018037613,0.000104974635,0.00008616033,0.0001741923,0.00022184716,0.0023350755],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964798,0.0014543174,0.0002705248,0.0003955141,0.0012822225,0.000117656775],"domain_scores_gemma":[0.983272,0.006840716,0.0006811247,0.003513205,0.005410304,0.00028260992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064264094,0.0025389004,0.001531369,0.0014265426,0.00052640407,0.0024509635,0.0024259156,0.0022746355,0.008198903],"category_scores_gemma":[0.0202763,0.0015599048,0.0013640624,0.0024150594,0.0010402788,0.004730984,0.0024037175,0.0031122894,0.010473621],"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.00042142332,0.000116221796,0.00084113906,0.00067567703,0.00020981922,0.00006238454,0.00018647067,0.03377058,0.028115144,0.04364782,0.008317015,0.88363624],"study_design_scores_gemma":[0.00017352666,0.00034849072,0.0017073045,0.0005161051,0.0002876845,0.0021431064,0.00013300552,0.8013855,0.07367133,0.0610577,0.05838762,0.00018849745],"about_ca_topic_score_codex":0.002226264,"about_ca_topic_score_gemma":0.0044358643,"teacher_disagreement_score":0.008198903,"about_ca_system_score_codex":0.0006758068,"about_ca_system_score_gemma":0.0024316912,"threshold_uncertainty_score":0.03398651},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010213843,0.0002497672,0.99773836,0.00006267382,0.000028995408,0.000033281747,0.000058121674,0.000220595,0.0005868623],"genre_scores_gemma":[0.056199174,0.0005148441,0.93922246,0.00013456163,0.00011826672,0.0002740498,0.00050680916,0.00019685188,0.002832958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981633,0.0006900948,0.000072311275,0.00032051402,0.0006642535,0.00008957498],"domain_scores_gemma":[0.9981964,0.00072558573,0.00015458978,0.00035172814,0.0005231581,0.000048649497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016586463,0.0010702661,0.00094194623,0.0019167254,0.0006907409,0.00083705084,0.0019105386,0.0012914255,0.0037085107],"category_scores_gemma":[0.0063409284,0.00046400932,0.001155969,0.00254752,0.00090775033,0.0011287427,0.0012902116,0.0015300645,0.0023661046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015077928,0.00004953657,0.0005463997,0.00032232417,0.00021303575,0.00012653152,0.00021292607,0.4857188,0.010969714,0.14176951,0.009869615,0.35005093],"study_design_scores_gemma":[0.000010518159,0.000021416725,0.00023645001,0.000012729545,0.000015561143,0.000041451334,0.000012365922,0.9639151,0.0014727735,0.029726865,0.004511811,0.000022976092],"about_ca_topic_score_codex":0.00746065,"about_ca_topic_score_gemma":0.007835174,"teacher_disagreement_score":0.00746065,"about_ca_system_score_codex":0.0012414828,"about_ca_system_score_gemma":0.0012472223,"threshold_uncertainty_score":0.014834464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045145866,0.0004239705,0.9423392,0.00014433559,0.000099511475,0.000039763403,0.000054829503,0.00028949176,0.011463061],"genre_scores_gemma":[0.49781623,0.00096485124,0.48225483,0.00018592196,0.0001831448,0.00014248281,0.00017772564,0.00016362256,0.018111195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981636,0.000047792153,0.000010565738,0.000025890791,0.00007782767,0.000021533479],"domain_scores_gemma":[0.9996954,0.00013605425,0.000042467072,0.000044562275,0.000059251393,0.000022370637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041647165,0.0006086053,0.00026247796,0.0007416356,0.000197659,0.00059055956,0.00043979558,0.0004737933,0.0029280651],"category_scores_gemma":[0.0013350307,0.00021339013,0.00042064337,0.00037022048,0.00059941644,0.00096461276,0.00031570558,0.00071648124,0.00083286717],"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.00022219868,0.00007326679,0.0005624638,0.00015736799,0.000025091984,0.00040722176,0.0002661778,0.041614022,0.08841476,0.6867731,0.0020357873,0.1794485],"study_design_scores_gemma":[0.000059256985,0.00025502418,0.00073493406,0.00006361082,0.00003698555,0.00088485394,0.00009524759,0.7983214,0.03798924,0.13778275,0.023707233,0.0000694811],"about_ca_topic_score_codex":0.00023728369,"about_ca_topic_score_gemma":0.00033675498,"teacher_disagreement_score":0.0029280651,"about_ca_system_score_codex":0.0003537415,"about_ca_system_score_gemma":0.00023814698,"threshold_uncertainty_score":0.009795368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010644068,0.00026135155,0.9885357,0.00010314169,0.00002066778,0.000015870888,0.00005820513,0.00014531169,0.0002156312],"genre_scores_gemma":[0.30594465,0.0014685527,0.689661,0.00006474008,0.0001847539,0.00014381089,0.0008267498,0.000090137146,0.0016155222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995309,0.0001681704,0.00003088804,0.00010326557,0.00012974249,0.000037080146],"domain_scores_gemma":[0.99888486,0.00053905084,0.00019097247,0.00015473994,0.00020255106,0.000027842818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088327815,0.00067041605,0.0005378556,0.0009985369,0.00031166803,0.0006597278,0.00057348434,0.000703846,0.0007608616],"category_scores_gemma":[0.0038041438,0.0002770086,0.0007850825,0.0014545636,0.00055775064,0.0008983536,0.0005463564,0.0010424352,0.00042117742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018754961,0.00012585518,0.00279227,0.000363718,0.00013893245,0.00023187241,0.0002126748,0.16010603,0.07648011,0.022490622,0.0026429633,0.73422736],"study_design_scores_gemma":[0.000007734761,0.000070970214,0.0037034154,0.000022451202,0.000033329692,0.00014368378,0.0000381395,0.97000915,0.009339238,0.014409457,0.002196011,0.000026490106],"about_ca_topic_score_codex":0.0012063046,"about_ca_topic_score_gemma":0.0013124538,"teacher_disagreement_score":0.0012063046,"about_ca_system_score_codex":0.00025065138,"about_ca_system_score_gemma":0.00058650033,"threshold_uncertainty_score":0.0046712756},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8907524,0.0014564696,0.10617285,0.00019496902,0.00005941124,0.00009222842,0.0001916233,0.00034175732,0.0007383599],"genre_scores_gemma":[0.9641583,0.00066641177,0.034473035,0.000038401187,0.00003985232,0.000031741056,0.00023876732,0.000024943558,0.0003285712],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99984837,0.000057509063,0.000016335995,0.000027368418,0.000035387286,0.000015031264],"domain_scores_gemma":[0.99945086,0.0003189482,0.00008158508,0.000033576907,0.00008936788,0.000025675605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003444909,0.00034941395,0.00034440882,0.00041162866,0.00010624564,0.00021300776,0.00012704957,0.00035933888,0.00037257338],"category_scores_gemma":[0.002625968,0.00007106642,0.00019437693,0.00023760514,0.0001844749,0.00017677817,0.00016308157,0.00020300632,0.00017790265],"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.0032302358,0.00030460246,0.065127045,0.000499187,0.00019298682,0.0017204557,0.0004262618,0.012769032,0.22483906,0.00043319707,0.001659388,0.68879867],"study_design_scores_gemma":[0.00028983472,0.003136519,0.51891226,0.00009566335,0.00036842783,0.008539023,0.0005150466,0.28134078,0.18146671,0.0018415316,0.0033945795,0.00009956421],"about_ca_topic_score_codex":0.000721905,"about_ca_topic_score_gemma":0.001137442,"teacher_disagreement_score":0.000721905,"about_ca_system_score_codex":0.00007282655,"about_ca_system_score_gemma":0.00024509733,"threshold_uncertainty_score":0.001821816},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010470385,0.000084780724,0.9983041,0.000038998147,0.000018660638,0.000011055155,0.000014589563,0.00012554921,0.0003550771],"genre_scores_gemma":[0.033366486,0.00034348355,0.9634288,0.000089821464,0.00007035767,0.000061914456,0.00016394115,0.00008377433,0.00239158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992157,0.00013630683,0.00004867726,0.00017872466,0.0003726615,0.0000477875],"domain_scores_gemma":[0.998774,0.0005918199,0.0001531632,0.00016472823,0.00027964698,0.000036689366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010630595,0.0010871135,0.0015373651,0.0015441006,0.0006213182,0.0011895105,0.0009980282,0.0013474828,0.0023923921],"category_scores_gemma":[0.0038756265,0.0006228102,0.0008608953,0.0011070273,0.0008707718,0.0023831474,0.0015607532,0.0014073518,0.0017242802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003129912,0.00008123427,0.0005383186,0.00034207528,0.00010874214,0.00020545657,0.00015950331,0.1630525,0.06821523,0.058350805,0.0037177224,0.7049154],"study_design_scores_gemma":[0.00005077598,0.00007363678,0.00032058402,0.00003661252,0.000034762495,0.0003784416,0.000037033362,0.9211537,0.028411815,0.037774425,0.011677925,0.00005023733],"about_ca_topic_score_codex":0.0006033579,"about_ca_topic_score_gemma":0.00084113615,"teacher_disagreement_score":0.0023923921,"about_ca_system_score_codex":0.00043000642,"about_ca_system_score_gemma":0.0009478954,"threshold_uncertainty_score":0.0080032945},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08789934,0.00084326224,0.9038951,0.0003845143,0.00022422962,0.00006127612,0.0007079741,0.0008272561,0.005157178],"genre_scores_gemma":[0.66595405,0.0018699248,0.32418522,0.00010676567,0.00018459948,0.00010385187,0.0016651835,0.00042783434,0.005502649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996947,0.00007764748,0.000020154699,0.000060859198,0.0001010844,0.000045672507],"domain_scores_gemma":[0.9994567,0.0001796892,0.00003052004,0.00011091424,0.00019965992,0.000022466087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004519657,0.0005164839,0.0003143061,0.0011786838,0.00030148315,0.0007444889,0.00032709527,0.00026785312,0.0036250423],"category_scores_gemma":[0.0035472938,0.00015894888,0.0003699954,0.0017299891,0.00041391348,0.0008524225,0.00050839974,0.00055760733,0.00088217587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078267587,0.00011781891,0.0019374721,0.000464886,0.00014801652,0.00040592396,0.00036849553,0.047601115,0.1499515,0.04745161,0.008137118,0.74263334],"study_design_scores_gemma":[0.000044360055,0.00021651459,0.013203314,0.000079796635,0.00010759552,0.0012431307,0.00034016202,0.8298639,0.096489646,0.04213952,0.0161652,0.000106854364],"about_ca_topic_score_codex":0.0018754748,"about_ca_topic_score_gemma":0.0025818446,"teacher_disagreement_score":0.0036250423,"about_ca_system_score_codex":0.00018178138,"about_ca_system_score_gemma":0.00066109264,"threshold_uncertainty_score":0.012126923},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23781586,0.00034397704,0.7588433,0.00017013165,0.00009424126,0.000067685374,0.00009176785,0.00095037447,0.001622763],"genre_scores_gemma":[0.86732876,0.000098548604,0.13046646,0.00004787578,0.000022584787,0.00004211675,0.00007624249,0.000038287075,0.001879102],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996779,0.000060427086,0.00002271806,0.00004561302,0.00016043936,0.000032917997],"domain_scores_gemma":[0.99895453,0.00042816685,0.0002296851,0.00018912292,0.00016574883,0.00003266746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006993468,0.00035903222,0.00026188252,0.000302045,0.0002873824,0.00046184464,0.0006981462,0.000478145,0.00095120113],"category_scores_gemma":[0.0021379814,0.00017951839,0.00013899869,0.00028322832,0.0003456255,0.0008311824,0.0005235358,0.00054103864,0.00029597967],"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.0011113003,0.00016477506,0.0014254064,0.00023063521,0.000040312992,0.0001969002,0.00021914233,0.035629675,0.7690852,0.008300294,0.0007308652,0.18286547],"study_design_scores_gemma":[0.000091595175,0.00063548033,0.0023035207,0.000044401895,0.0000353491,0.0004888107,0.000037749152,0.3699919,0.61984324,0.0036012991,0.002864699,0.00006189146],"about_ca_topic_score_codex":0.00028887787,"about_ca_topic_score_gemma":0.0008559214,"teacher_disagreement_score":0.00095120113,"about_ca_system_score_codex":0.00030804277,"about_ca_system_score_gemma":0.00052667834,"threshold_uncertainty_score":0.0036985278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03616216,0.00009322677,0.96283597,0.000036946294,0.000019911122,0.000018043042,0.000012196139,0.00024603715,0.0005755524],"genre_scores_gemma":[0.8516585,0.00018963356,0.14623798,0.000042637144,0.00003336841,0.000094099945,0.000069033165,0.00005385847,0.0016208172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995091,0.00012843768,0.000029686249,0.000114634044,0.00018061041,0.00003751559],"domain_scores_gemma":[0.9988518,0.00062412536,0.00025064423,0.000085841304,0.00016114398,0.000026504618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006223465,0.0005119648,0.0004999247,0.000443314,0.00028148363,0.0006994295,0.00033106995,0.00036072708,0.00046956047],"category_scores_gemma":[0.002427594,0.00030640603,0.0003446391,0.00039366004,0.0006130043,0.0006263628,0.00046210445,0.00055567693,0.00016062208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005264797,0.00018824343,0.0029092347,0.00021066678,0.000113533715,0.0001594592,0.00030418218,0.60597885,0.1054534,0.028512038,0.0007637679,0.2548802],"study_design_scores_gemma":[0.000011759204,0.00007346533,0.0007164858,0.000004197835,0.000006423027,0.000034706,0.000009689098,0.98568463,0.010695407,0.002435918,0.00031544516,0.000011927822],"about_ca_topic_score_codex":0.0013377749,"about_ca_topic_score_gemma":0.001467613,"teacher_disagreement_score":0.0013377749,"about_ca_system_score_codex":0.00037305607,"about_ca_system_score_gemma":0.0007264567,"threshold_uncertainty_score":0.0032913089},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2043265,0.00044621286,0.78784734,0.00020947598,0.00017227523,0.00025578958,0.00089736364,0.0026386569,0.0032063245],"genre_scores_gemma":[0.44578922,0.00054780097,0.5504958,0.00006485843,0.00004175078,0.00031881934,0.0011724207,0.000264623,0.0013046161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996842,0.00009383266,0.000030618594,0.00007376454,0.000079245714,0.00003834723],"domain_scores_gemma":[0.99924636,0.00037394353,0.000045519904,0.00018583858,0.00012150733,0.000026923884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007687466,0.0007189593,0.0006025663,0.0011950498,0.0004326542,0.0007622169,0.0003638491,0.0005533532,0.0018319982],"category_scores_gemma":[0.004303031,0.00023911418,0.0005909171,0.0012954269,0.00044036002,0.00057804293,0.0006110936,0.0006413476,0.0006758064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010051476,0.00022021394,0.003159803,0.00042192682,0.00031737404,0.0004781851,0.00028490496,0.26700038,0.3402417,0.0125915315,0.0028356358,0.3714432],"study_design_scores_gemma":[0.000065153145,0.0003190797,0.008362659,0.000025456444,0.00007344364,0.00065163337,0.000077298115,0.84092176,0.13684852,0.00876108,0.0038304173,0.00006357132],"about_ca_topic_score_codex":0.0031457222,"about_ca_topic_score_gemma":0.0033840165,"teacher_disagreement_score":0.0031457222,"about_ca_system_score_codex":0.00024202645,"about_ca_system_score_gemma":0.0008002673,"threshold_uncertainty_score":0.006254852},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03482808,0.009523148,0.8748898,0.0025303375,0.005987564,0.000536179,0.0015743095,0.0055244914,0.064606026],"genre_scores_gemma":[0.19912536,0.015068498,0.5443628,0.00086800667,0.0037463896,0.00037689373,0.0063754893,0.0014521843,0.2286244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981314,0.000024265375,0.000018124303,0.00003515992,0.00009718784,0.000012196522],"domain_scores_gemma":[0.9993406,0.00013334575,0.00005009797,0.00008083726,0.0003565981,0.000038456496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027604867,0.00053589314,0.0005194527,0.0013854918,0.00032859712,0.0008156512,0.000424141,0.000533003,0.019544227],"category_scores_gemma":[0.0009442964,0.0001403722,0.00026929166,0.0014563162,0.0005160361,0.000829575,0.00026462562,0.0005132398,0.011914454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003334664,0.00008386282,0.0005631581,0.00044351124,0.000027288115,0.00039169658,0.00008450332,0.0033225708,0.17559914,0.0151178595,0.06957021,0.73446274],"study_design_scores_gemma":[0.000071077266,0.0006351611,0.008386314,0.00025344093,0.00009277227,0.0017700513,0.00012987008,0.17346159,0.41792786,0.012684764,0.38446254,0.00012460478],"about_ca_topic_score_codex":0.0021609191,"about_ca_topic_score_gemma":0.0031161355,"teacher_disagreement_score":0.019544227,"about_ca_system_score_codex":0.00038741756,"about_ca_system_score_gemma":0.00047592938,"threshold_uncertainty_score":0.065381885},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015060662,0.000026451351,0.9964128,0.000038312683,0.000018479937,0.00001669348,0.00001692386,0.0008156059,0.001148752],"genre_scores_gemma":[0.065648325,0.000053076965,0.9318196,0.00006629902,0.000015394658,0.00008130032,0.00009406175,0.00023237785,0.0019894992],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994197,0.00016856674,0.000050665018,0.00006878015,0.0002497359,0.000042658772],"domain_scores_gemma":[0.9993531,0.00025874563,0.000032740638,0.00008067623,0.00023765967,0.00003707758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009896967,0.0007114856,0.0004217009,0.00037742502,0.000438277,0.0006085806,0.0011695459,0.00093973393,0.0058954656],"category_scores_gemma":[0.0034620874,0.00025753456,0.00043072726,0.00039607004,0.00039650223,0.0006599451,0.0009376594,0.001226532,0.002725874],"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.0005040484,0.00023736512,0.0013624891,0.0002700829,0.000086805216,0.00042179733,0.00033080613,0.20688815,0.0411284,0.10123511,0.0087666195,0.6387683],"study_design_scores_gemma":[0.000079512334,0.0001305283,0.0002719691,0.000025424019,0.000010566215,0.00036945843,0.000022274182,0.9447315,0.021781513,0.019399863,0.013148055,0.000029353847],"about_ca_topic_score_codex":0.0014615844,"about_ca_topic_score_gemma":0.0015295655,"teacher_disagreement_score":0.0058954656,"about_ca_system_score_codex":0.00045690002,"about_ca_system_score_gemma":0.000930356,"threshold_uncertainty_score":0.019722283},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016913178,0.0003264588,0.99730825,0.00006574087,0.00005207221,0.000021419848,0.000027749975,0.00012712422,0.0003799072],"genre_scores_gemma":[0.017478108,0.0006470059,0.9794692,0.00004198806,0.00010531975,0.000117776726,0.000113791066,0.000089211775,0.0019375428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994419,0.00018753103,0.000030589057,0.00010729646,0.00021201528,0.000020579848],"domain_scores_gemma":[0.9985468,0.0005948631,0.000062243,0.00016749658,0.0005813048,0.00004730959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012880701,0.0006211027,0.00072892755,0.0011148358,0.0005566207,0.0006670535,0.00092406105,0.0009378466,0.0023977547],"category_scores_gemma":[0.0036210727,0.00041808683,0.00062570616,0.0016942144,0.0006073479,0.0012933273,0.0006036374,0.0011126916,0.0010845735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023420063,0.00014076094,0.0012404997,0.00034892798,0.00014251718,0.00018622524,0.00024293816,0.06841351,0.04922666,0.07418725,0.009316134,0.79632026],"study_design_scores_gemma":[0.000018090019,0.00006622224,0.00081961835,0.000018350009,0.000041926873,0.00031748533,0.000019539277,0.9639849,0.01171875,0.01080649,0.01212985,0.00005886278],"about_ca_topic_score_codex":0.0027707508,"about_ca_topic_score_gemma":0.0036031543,"teacher_disagreement_score":0.0027707508,"about_ca_system_score_codex":0.0003381762,"about_ca_system_score_gemma":0.0013081701,"threshold_uncertainty_score":0.0080212355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005540393,0.00021210095,0.99362636,0.000046202047,0.00003106237,0.000011672686,0.0000070522206,0.00015586159,0.00036926492],"genre_scores_gemma":[0.45694098,0.001150013,0.5384634,0.00007219825,0.000117582495,0.00010185237,0.00008303868,0.000057067016,0.0030138833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958295,0.00015181495,0.000019881494,0.000055946413,0.00015999097,0.000029406547],"domain_scores_gemma":[0.9994734,0.00031215986,0.00007063534,0.000058053192,0.00007185568,0.000013920176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000641028,0.00058067,0.00053579867,0.0005100758,0.00027559607,0.0007730069,0.00040476865,0.0008925853,0.00056284026],"category_scores_gemma":[0.002099687,0.00027424726,0.00044703067,0.000650156,0.00058697764,0.0008519389,0.0005539337,0.00080123986,0.00021760956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032624355,0.000089574045,0.0009473115,0.00021756251,0.0001095235,0.000090487505,0.00014208908,0.6935259,0.02425679,0.024516538,0.0014215101,0.25435647],"study_design_scores_gemma":[0.000012568206,0.00004054518,0.00020848121,0.000006511314,0.000010066213,0.000029757868,0.0000050787266,0.99232084,0.0041841078,0.0024738393,0.0006972539,0.000011047951],"about_ca_topic_score_codex":0.002601711,"about_ca_topic_score_gemma":0.0019223694,"teacher_disagreement_score":0.002601711,"about_ca_system_score_codex":0.00040582826,"about_ca_system_score_gemma":0.00077654346,"threshold_uncertainty_score":0.005173087},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14642325,0.0015978835,0.8487385,0.00024646622,0.000036536447,0.000062345665,0.000033811644,0.00043665833,0.0024245002],"genre_scores_gemma":[0.6570346,0.0006758469,0.3402713,0.00005134793,0.000031822812,0.000076799726,0.000046837973,0.000121725745,0.0016898074],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994407,0.00018501152,0.000022369588,0.00006513079,0.00024032814,0.00004644365],"domain_scores_gemma":[0.9981768,0.0013660819,0.00020472037,0.000097516735,0.0001341927,0.000020728285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008628005,0.000698101,0.0004014661,0.00040917684,0.00028775717,0.00048400383,0.000331624,0.00058025867,0.0012515915],"category_scores_gemma":[0.0040414906,0.00020589332,0.00022308982,0.00043085354,0.0004347169,0.00089041505,0.000364322,0.000538858,0.00027223816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014945538,0.00016073737,0.0011315343,0.0005957282,0.00006925099,0.00017348687,0.00044629304,0.3204553,0.3351549,0.021465793,0.00066496455,0.3181875],"study_design_scores_gemma":[0.00013637591,0.0009773772,0.0023846556,0.00006239726,0.00007315336,0.0007174888,0.000058206588,0.6865468,0.29368132,0.00798337,0.007307555,0.000071291994],"about_ca_topic_score_codex":0.000350875,"about_ca_topic_score_gemma":0.0005263075,"teacher_disagreement_score":0.0012515915,"about_ca_system_score_codex":0.0005272839,"about_ca_system_score_gemma":0.00050613686,"threshold_uncertainty_score":0.0045630336},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4157719,0.00049574935,0.57475644,0.0005192226,0.00028857944,0.000108123204,0.00048064545,0.0013766252,0.0062027145],"genre_scores_gemma":[0.9731469,0.00006963401,0.024910139,0.000093278664,0.00010070526,0.00005827718,0.00044634304,0.00021250574,0.0009622372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99560755,0.0026500835,0.00020105185,0.00060198584,0.00066108064,0.00027818227],"domain_scores_gemma":[0.93770915,0.052530617,0.0009837087,0.0050074263,0.0028543035,0.0009148813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009592096,0.0005600185,0.00071975857,0.0009684551,0.0007746222,0.0013285271,0.0010752088,0.001307241,0.007975011],"category_scores_gemma":[0.08846931,0.0002464332,0.00058667536,0.0005334721,0.0011668791,0.0013842349,0.0014799774,0.0014965708,0.0009761233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013227214,0.0012840361,0.056794785,0.0015477675,0.0013980154,0.0022441559,0.0016560233,0.09555207,0.2219168,0.08650938,0.008651875,0.509218],"study_design_scores_gemma":[0.00035792313,0.0013833616,0.12728074,0.00023338242,0.000534396,0.0018326626,0.0006412073,0.6710302,0.10115428,0.087699704,0.00768885,0.0001632275],"about_ca_topic_score_codex":0.00055227097,"about_ca_topic_score_gemma":0.0005456505,"teacher_disagreement_score":0.009592096,"about_ca_system_score_codex":0.0003314963,"about_ca_system_score_gemma":0.00075097353,"threshold_uncertainty_score":0.0507285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042432547,0.0003261299,0.9921524,0.00007186911,0.0000711457,0.00004080134,0.000055913562,0.0011669307,0.001871595],"genre_scores_gemma":[0.083352946,0.00066386315,0.9066561,0.000117043346,0.00007718928,0.00013382839,0.0001945972,0.00010338794,0.008701071],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972576,0.000039346924,0.0000111542495,0.0000569001,0.00015215352,0.000014570737],"domain_scores_gemma":[0.999653,0.000111831156,0.00003396162,0.000063605454,0.00012468174,0.000012913436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030499866,0.0005496628,0.0003973072,0.0009043012,0.00030838008,0.00046487793,0.0005787781,0.00064230344,0.0052214335],"category_scores_gemma":[0.00088162674,0.00018091232,0.000308989,0.0006314778,0.00029369158,0.0007374061,0.00046753587,0.0005992719,0.0020808398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026253317,0.00005855841,0.0006225469,0.00027502302,0.000049026727,0.00012902603,0.00013297533,0.015356445,0.18852276,0.018084532,0.0065672686,0.76993924],"study_design_scores_gemma":[0.00013162338,0.00034465894,0.0023514675,0.00008462699,0.00008305643,0.0020629899,0.00010112831,0.6720884,0.24816439,0.014666898,0.059814967,0.000105800995],"about_ca_topic_score_codex":0.0007070764,"about_ca_topic_score_gemma":0.0009179447,"teacher_disagreement_score":0.0052214335,"about_ca_system_score_codex":0.0002789305,"about_ca_system_score_gemma":0.0005150815,"threshold_uncertainty_score":0.01746744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019105904,0.0005902623,0.97887427,0.00008687525,0.00009265823,0.000043785556,0.000068201916,0.00050000695,0.00063804985],"genre_scores_gemma":[0.3165379,0.002684597,0.67685163,0.000110267014,0.0002746046,0.00010990775,0.0005274737,0.00017419686,0.0027295032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982387,0.000039835602,0.000011526258,0.00003153029,0.00008192456,0.000011322136],"domain_scores_gemma":[0.99968076,0.00014764686,0.000033800556,0.00006598493,0.00006179009,0.0000099939025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021707678,0.0005785482,0.00044871794,0.0005468959,0.00013327519,0.00032338346,0.00037559343,0.00042498365,0.0010996594],"category_scores_gemma":[0.0010751064,0.00012990863,0.000385663,0.00073833426,0.00027485768,0.0006055211,0.0005061436,0.00044658838,0.00044892306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005158517,0.000066595516,0.0009079159,0.00032342126,0.00006243119,0.0005797587,0.00019069503,0.051985152,0.27539474,0.0087396065,0.0021872397,0.65904653],"study_design_scores_gemma":[0.000069538924,0.00040852567,0.0033078322,0.000056342924,0.00007887469,0.002901988,0.00006890493,0.7763432,0.1972422,0.0063128714,0.0131452065,0.00006465479],"about_ca_topic_score_codex":0.00030207093,"about_ca_topic_score_gemma":0.0002770342,"teacher_disagreement_score":0.0010996594,"about_ca_system_score_codex":0.000101864825,"about_ca_system_score_gemma":0.0001550687,"threshold_uncertainty_score":0.0036786795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011032041,0.0007288032,0.9838573,0.00020258062,0.00012860926,0.000044329758,0.000016677537,0.00023526356,0.0037544332],"genre_scores_gemma":[0.41483486,0.0010732467,0.5718082,0.0003655062,0.0002808086,0.0002339129,0.000064475666,0.00006458348,0.01127443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993057,0.00014782925,0.000044946537,0.00015284555,0.0003015527,0.000047228077],"domain_scores_gemma":[0.9988317,0.0005073402,0.00013024497,0.00018347388,0.0003139525,0.000033282206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095560396,0.00069610064,0.0004778561,0.0005026634,0.00042810434,0.0007990618,0.0007750892,0.0010792814,0.0017774447],"category_scores_gemma":[0.003932044,0.00021079421,0.0003214206,0.0004775763,0.0010779457,0.0014368992,0.0007566816,0.0009656731,0.0006823585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086890097,0.00012901143,0.0015116597,0.0003785021,0.00013517807,0.00014226828,0.0002278072,0.16992389,0.10733424,0.12748283,0.0032994829,0.5885663],"study_design_scores_gemma":[0.00007545937,0.00017533338,0.00062509143,0.00004521795,0.0000667939,0.0003098999,0.000035340458,0.9121361,0.061752897,0.0122981565,0.012424192,0.000055452987],"about_ca_topic_score_codex":0.0013514555,"about_ca_topic_score_gemma":0.0017714073,"teacher_disagreement_score":0.0017774447,"about_ca_system_score_codex":0.00060032407,"about_ca_system_score_gemma":0.00088312576,"threshold_uncertainty_score":0.0059461594},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017590566,0.000028857288,0.9976053,0.000015648759,0.000023731065,0.000014405689,0.000012262429,0.00015536157,0.00038526522],"genre_scores_gemma":[0.052889355,0.00013237746,0.945217,0.000033222343,0.000037716138,0.00007249841,0.00008519564,0.00014298013,0.0013896485],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995659,0.00013223845,0.000028946723,0.000051088275,0.00018443516,0.00003739866],"domain_scores_gemma":[0.9991658,0.00031206466,0.00006255075,0.00015562076,0.00024856886,0.000055453005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007293417,0.00086565147,0.00072267797,0.0008847496,0.0005192989,0.000810094,0.0007721268,0.00050812506,0.007360427],"category_scores_gemma":[0.0028149837,0.00027462246,0.0008451613,0.00066366006,0.0009228161,0.0011616588,0.001130284,0.00096373877,0.002661404],"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.0002988657,0.00008033512,0.000798249,0.00040069464,0.000111982336,0.00050719496,0.00047752142,0.25040933,0.05009967,0.15590353,0.007060463,0.53385216],"study_design_scores_gemma":[0.000028409864,0.00006228669,0.00007861087,0.000022739945,0.000013417233,0.00014943267,0.00005154365,0.95780593,0.0077824146,0.029065695,0.0049175113,0.000022073506],"about_ca_topic_score_codex":0.0017835066,"about_ca_topic_score_gemma":0.001907623,"teacher_disagreement_score":0.007360427,"about_ca_system_score_codex":0.00032095241,"about_ca_system_score_gemma":0.0009266179,"threshold_uncertainty_score":0.024623096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04977821,0.00022814621,0.94890976,0.00020945379,0.000008614533,0.000020762442,0.000021195985,0.00016504656,0.0006588494],"genre_scores_gemma":[0.55305845,0.000339196,0.44551963,0.00005186987,0.00003140245,0.0000502554,0.00008435795,0.00007740848,0.0007874913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992906,0.0003110295,0.000038644677,0.000112084614,0.00020699184,0.000040644758],"domain_scores_gemma":[0.99721634,0.0023016848,0.00017367907,0.00013923587,0.000114475086,0.000054560245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017903544,0.0008503765,0.0009468938,0.0008538301,0.00041374008,0.0008978551,0.000629078,0.0012713833,0.0008089557],"category_scores_gemma":[0.014866645,0.00060478545,0.00080071547,0.00060618145,0.0009277566,0.001147847,0.0012974166,0.00081635296,0.00018526672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018829934,0.000068873516,0.0028775048,0.00015183368,0.00006300306,0.0006050526,0.000492519,0.8243098,0.014881008,0.028502965,0.0003879432,0.12747121],"study_design_scores_gemma":[0.000011776028,0.000040519706,0.00050991814,0.000017112465,0.000010645414,0.0001972506,0.000039708902,0.9805581,0.0028402312,0.015313841,0.00044113136,0.000019735811],"about_ca_topic_score_codex":0.0017979454,"about_ca_topic_score_gemma":0.0009860069,"teacher_disagreement_score":0.0017979454,"about_ca_system_score_codex":0.00036406075,"about_ca_system_score_gemma":0.0006537077,"threshold_uncertainty_score":0.009468436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014481899,0.0004289656,0.9837001,0.00011730768,0.000044310673,0.00003020896,0.000058369507,0.00037324167,0.0007655574],"genre_scores_gemma":[0.3223525,0.00091595337,0.6729396,0.0001538182,0.00020854815,0.00018369609,0.00040619317,0.00009366266,0.002746079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984585,0.0004584637,0.00010767817,0.00017130523,0.00069170847,0.00011237],"domain_scores_gemma":[0.99477357,0.0030732795,0.00082856877,0.0005719996,0.0006608333,0.00009168601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002139618,0.0007707906,0.0007221097,0.0021375786,0.0005343184,0.0011235457,0.0006798788,0.00097590964,0.0010702254],"category_scores_gemma":[0.01094827,0.0002801912,0.0005599521,0.0015093387,0.0013245625,0.0011667635,0.0007159768,0.0011949025,0.0006697646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071366807,0.00013158444,0.002799052,0.00024146083,0.00010659397,0.00012970548,0.00021625323,0.24418646,0.02602597,0.1202822,0.0030413717,0.6021257],"study_design_scores_gemma":[0.000019298352,0.00006802582,0.0008796267,0.000017234313,0.000013325422,0.0001566685,0.00001507039,0.9610148,0.012313345,0.023969423,0.0014969758,0.00003628348],"about_ca_topic_score_codex":0.0013376283,"about_ca_topic_score_gemma":0.0012886329,"teacher_disagreement_score":0.002139618,"about_ca_system_score_codex":0.0010710169,"about_ca_system_score_gemma":0.0019450373,"threshold_uncertainty_score":0.011315465},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049262606,0.00014428422,0.9494345,0.000087729975,0.00003706179,0.000016709519,0.00003180868,0.00017607522,0.00080930314],"genre_scores_gemma":[0.89789295,0.0002330812,0.09913219,0.000059529273,0.00005392268,0.000046604728,0.00010625222,0.000027957914,0.0024474678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997024,0.000077571254,0.00001899365,0.00007357871,0.00010039069,0.000027098726],"domain_scores_gemma":[0.9991648,0.00043647795,0.00016042477,0.00009880346,0.00011825721,0.000021165724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054870016,0.0004125096,0.0007223588,0.0003995135,0.00021408159,0.00050591084,0.0003739291,0.0006015185,0.0009593428],"category_scores_gemma":[0.0034138055,0.00021194435,0.0003563987,0.00027411652,0.00054863584,0.000707034,0.0007097986,0.0006173245,0.00021926282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039035958,0.00005779986,0.0011772744,0.00027064077,0.00008918583,0.00025371727,0.00017992577,0.7086362,0.07114356,0.05353436,0.0013212722,0.16294572],"study_design_scores_gemma":[0.0000070465967,0.000016860291,0.00018406601,0.0000055614405,0.0000052439473,0.00005963446,0.000009067609,0.9846222,0.004551602,0.010192748,0.0003384456,0.000007540893],"about_ca_topic_score_codex":0.0007082752,"about_ca_topic_score_gemma":0.00047246137,"teacher_disagreement_score":0.0009593428,"about_ca_system_score_codex":0.00021299579,"about_ca_system_score_gemma":0.00041290122,"threshold_uncertainty_score":0.003209293},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01949125,0.00032584422,0.97813433,0.00009441342,0.000020693606,0.00008431368,0.00017672643,0.00046343636,0.0012089794],"genre_scores_gemma":[0.38451678,0.00046621685,0.61199164,0.00008785908,0.00008021173,0.00035695414,0.00072418834,0.0002785508,0.0014976381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989755,0.0004423574,0.00007555303,0.00012772606,0.0003473623,0.00003154509],"domain_scores_gemma":[0.9970989,0.0019807706,0.00035246974,0.00020101554,0.00027654192,0.000090268346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002218337,0.000812199,0.00047693052,0.002716313,0.00029608497,0.00065209024,0.0005840874,0.0005858478,0.0017089043],"category_scores_gemma":[0.009092334,0.00020505069,0.00053778104,0.0012764296,0.0006878518,0.00089786964,0.0008456671,0.00060490967,0.00050823204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007462698,0.0002070831,0.005831927,0.0006101033,0.00029283855,0.0004761301,0.00031102542,0.1447681,0.20464192,0.061498612,0.0037879448,0.5768281],"study_design_scores_gemma":[0.000024031728,0.00025594662,0.012693299,0.00004595597,0.000058593665,0.00044301874,0.00006133125,0.89592725,0.046578277,0.040108483,0.0037030412,0.00010082713],"about_ca_topic_score_codex":0.0005120702,"about_ca_topic_score_gemma":0.000599501,"teacher_disagreement_score":0.002716313,"about_ca_system_score_codex":0.00047166215,"about_ca_system_score_gemma":0.0003853284,"threshold_uncertainty_score":0.011731803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07186252,0.0014143904,0.9178831,0.0006586364,0.00023313449,0.000036390375,0.00008449565,0.0001557068,0.0076716975],"genre_scores_gemma":[0.79658115,0.005605797,0.18148537,0.00046042967,0.0006456064,0.00018641153,0.00045499127,0.00053316145,0.014047054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862003,0.0006842549,0.000067199326,0.00013684876,0.0004017593,0.00009000106],"domain_scores_gemma":[0.9685291,0.027015902,0.0008871174,0.0009470007,0.0019277752,0.00069305726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062586283,0.0012975063,0.0009152003,0.002044416,0.00057355565,0.0019538556,0.0012879904,0.0014333922,0.0037135915],"category_scores_gemma":[0.043606296,0.0005536529,0.0008812551,0.00084934884,0.0036100498,0.003650164,0.002245126,0.0028507323,0.00045713465],"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.00044194856,0.00013627693,0.0019870456,0.0004347254,0.000120221994,0.0004053509,0.0007059373,0.16539957,0.014764764,0.7718535,0.0020923333,0.04165838],"study_design_scores_gemma":[0.000014997192,0.00005020391,0.0005466169,0.00006981858,0.000017352688,0.00013224068,0.00008368424,0.86986995,0.0016294497,0.12657014,0.0009913219,0.000024273182],"about_ca_topic_score_codex":0.0024558709,"about_ca_topic_score_gemma":0.0015211579,"teacher_disagreement_score":0.0062586283,"about_ca_system_score_codex":0.0011337256,"about_ca_system_score_gemma":0.00094805117,"threshold_uncertainty_score":0.033099174},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012064777,0.00017413993,0.9837857,0.0000608064,0.000043007924,0.00013096358,0.00010387199,0.0029197498,0.0007169984],"genre_scores_gemma":[0.07099054,0.00018227525,0.92658937,0.0000767105,0.000058718793,0.00021556462,0.00032364466,0.000090925154,0.0014723205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968576,0.000031083797,0.000023208753,0.000082931714,0.00015389585,0.000023172859],"domain_scores_gemma":[0.99957746,0.00007616583,0.000051916173,0.000058172416,0.00021456277,0.000021663087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003924692,0.000480194,0.00082846865,0.0012964556,0.00032482058,0.0004357122,0.0006179284,0.0006324994,0.0010402928],"category_scores_gemma":[0.0008399448,0.00031871494,0.0004243386,0.0007492676,0.0002517531,0.00081524515,0.0004456698,0.00038912226,0.00090269826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001543836,0.00009547294,0.0009317318,0.000116034586,0.00006229469,0.00015409147,0.00006980421,0.0049760956,0.3885322,0.0027919598,0.0039471425,0.5981689],"study_design_scores_gemma":[0.00009322148,0.000484658,0.009911696,0.0000334817,0.00016248738,0.0011747222,0.000050028615,0.68549484,0.2787358,0.0030374,0.0206914,0.0001302941],"about_ca_topic_score_codex":0.0014519072,"about_ca_topic_score_gemma":0.002040712,"teacher_disagreement_score":0.0014519072,"about_ca_system_score_codex":0.0003021801,"about_ca_system_score_gemma":0.0005369459,"threshold_uncertainty_score":0.0034800768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017283227,0.0025601157,0.99385214,0.00013471009,0.0001306851,0.000027534521,0.000018080584,0.00020747104,0.001340921],"genre_scores_gemma":[0.15714008,0.008776229,0.8282877,0.0001541259,0.00058344624,0.00021009975,0.00017699295,0.000120553064,0.004550766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898285,0.00043707294,0.00005958966,0.00012278678,0.0003538438,0.00004395635],"domain_scores_gemma":[0.9989636,0.00061747263,0.000080518825,0.000095502546,0.00022135531,0.000021576794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078715273,0.0009668988,0.00062834396,0.0013212394,0.00035226395,0.0008363226,0.00049422693,0.0010067692,0.0012814916],"category_scores_gemma":[0.0029900004,0.00025891868,0.0005345051,0.0023148167,0.0010633431,0.00072143803,0.00058461446,0.001250435,0.00080624875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020801289,0.000077903285,0.0008057318,0.0006978885,0.00018123665,0.00038283406,0.0002872481,0.15384346,0.03967767,0.11273131,0.0052464027,0.68586034],"study_design_scores_gemma":[0.0000207179,0.00016165052,0.0012686347,0.000085063366,0.00006733264,0.000457467,0.00006391546,0.87242365,0.01766552,0.08481716,0.02289953,0.000069359856],"about_ca_topic_score_codex":0.0017716746,"about_ca_topic_score_gemma":0.0009817755,"teacher_disagreement_score":0.0017716746,"about_ca_system_score_codex":0.00035735712,"about_ca_system_score_gemma":0.00076860486,"threshold_uncertainty_score":0.004287064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025772746,0.000055916626,0.99674004,0.000032585594,0.00002007278,0.000008525239,0.000014375485,0.00038015653,0.00017108023],"genre_scores_gemma":[0.04942294,0.0001557973,0.9484236,0.000042988773,0.00004070111,0.000055690743,0.00012360245,0.000179467,0.0015551598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991781,0.0002974282,0.000055142864,0.00016700718,0.000251658,0.00005057786],"domain_scores_gemma":[0.99831724,0.0008071294,0.00019875747,0.00034399476,0.00029436933,0.000038428767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009366758,0.0008925195,0.0010697519,0.00086170743,0.0003979689,0.0008920587,0.00079433556,0.0010841448,0.001895193],"category_scores_gemma":[0.004935013,0.0007073709,0.0011376012,0.00088572846,0.0005262305,0.0012863299,0.001096437,0.0013994371,0.0018601231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005245073,0.00020471399,0.0007142962,0.00025007632,0.00026255933,0.00014641612,0.0002119854,0.10033405,0.11728386,0.024035063,0.0038876908,0.7521448],"study_design_scores_gemma":[0.000040246356,0.00007974525,0.00064214354,0.000020112384,0.00004902595,0.0001876998,0.000019231826,0.95615053,0.028202908,0.010633826,0.003936438,0.000038174534],"about_ca_topic_score_codex":0.00079284725,"about_ca_topic_score_gemma":0.0014535554,"teacher_disagreement_score":0.001895193,"about_ca_system_score_codex":0.00022121951,"about_ca_system_score_gemma":0.00085651706,"threshold_uncertainty_score":0.006340027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029393582,0.00025988993,0.96854085,0.0000632573,0.000021403535,0.000014318163,0.000015460306,0.00023960206,0.0014516407],"genre_scores_gemma":[0.6325475,0.00061501755,0.36125982,0.0000754333,0.00005309051,0.00006851532,0.000057048423,0.00003936801,0.0052841636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997888,0.000052466698,0.000010012365,0.00003238294,0.000091383634,0.000024876954],"domain_scores_gemma":[0.99967885,0.00018567005,0.000039480237,0.00004033362,0.000047941234,0.000007815808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001854928,0.00027436911,0.0002888897,0.0001884286,0.00023523113,0.0003661652,0.0004373357,0.0004595715,0.00068194995],"category_scores_gemma":[0.0010459173,0.00014449279,0.00019297199,0.00035014757,0.0005215766,0.000753551,0.0005011898,0.0003618923,0.00028745283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029996966,0.00008760113,0.0007146582,0.00013279387,0.000064066895,0.00025186758,0.00023647188,0.6575819,0.08953521,0.034412216,0.0013762373,0.21530707],"study_design_scores_gemma":[0.000019588584,0.00006425079,0.00015318124,0.0000049292134,0.000009555693,0.00008963471,0.000012478399,0.9750175,0.017819602,0.0055662734,0.0012299384,0.000012969754],"about_ca_topic_score_codex":0.0010538327,"about_ca_topic_score_gemma":0.0015619916,"teacher_disagreement_score":0.0010538327,"about_ca_system_score_codex":0.0002901791,"about_ca_system_score_gemma":0.0004294358,"threshold_uncertainty_score":0.0022813082},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039069112,0.00009295073,0.99549896,0.0000248831,0.00002155226,0.0000070109077,0.00001551916,0.00011235868,0.00031975118],"genre_scores_gemma":[0.2485189,0.0004699819,0.74877524,0.0000798396,0.00011205265,0.000073644194,0.00016644,0.000087318884,0.0017165077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957687,0.00008379827,0.000027298356,0.000107700536,0.0001735521,0.000030862902],"domain_scores_gemma":[0.99911815,0.00035875716,0.00016341673,0.00009485077,0.00023977539,0.000025015734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055626675,0.00060198596,0.00047319668,0.0006446304,0.00026258331,0.00042272624,0.00067123363,0.0006070961,0.00091965834],"category_scores_gemma":[0.002792039,0.00021247225,0.00049314176,0.00081626617,0.00044127693,0.00088785274,0.0006264347,0.0007526026,0.00034747017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028086698,0.000073080104,0.0015980548,0.00021535103,0.00013216285,0.00016472593,0.00011386458,0.38376936,0.12530982,0.047340456,0.002264931,0.43873733],"study_design_scores_gemma":[0.000014739748,0.0000631575,0.00030950486,0.000008299257,0.000022750733,0.00015040797,0.000006111172,0.9704635,0.023808336,0.0030093642,0.002111254,0.000032534674],"about_ca_topic_score_codex":0.0013452843,"about_ca_topic_score_gemma":0.0013132235,"teacher_disagreement_score":0.0013452843,"about_ca_system_score_codex":0.00038057976,"about_ca_system_score_gemma":0.0008450119,"threshold_uncertainty_score":0.003076613},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14604367,0.0006286124,0.841666,0.00031336118,0.00016390072,0.00008085958,0.000069551854,0.00051520875,0.010518927],"genre_scores_gemma":[0.6274227,0.0007248008,0.36477566,0.00012928083,0.00006347985,0.000085874715,0.000070010465,0.000065611006,0.006662612],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999879,0.000015625215,0.0000046566024,0.000014143452,0.00006977936,0.00001689229],"domain_scores_gemma":[0.9998055,0.00007353922,0.000039656647,0.000030212084,0.000037315913,0.000013715247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023936646,0.00032568476,0.00024468265,0.00022333543,0.00015659635,0.00047776592,0.00051611435,0.00045130675,0.0010733125],"category_scores_gemma":[0.00046619104,0.00014787963,0.00018858677,0.00030591158,0.00040431862,0.0006399464,0.00043935934,0.0006122625,0.00037049325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021123746,0.0000998134,0.0002635397,0.00015077699,0.000015488478,0.00016413705,0.00008196993,0.00539989,0.8466387,0.07661938,0.0006228036,0.06973229],"study_design_scores_gemma":[0.00006771353,0.0005204708,0.00061318383,0.000034187957,0.000026435491,0.00075137516,0.00003387225,0.26238808,0.71250576,0.010581668,0.012437961,0.000039375547],"about_ca_topic_score_codex":0.00011986173,"about_ca_topic_score_gemma":0.00023565808,"teacher_disagreement_score":0.0010733125,"about_ca_system_score_codex":0.00025959325,"about_ca_system_score_gemma":0.00029945472,"threshold_uncertainty_score":0.0035905242},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047266018,0.0008762315,0.95036393,0.0001493123,0.000114364506,0.000039735944,0.00008674784,0.00032457753,0.0007789646],"genre_scores_gemma":[0.18586269,0.001260732,0.80947095,0.0000872162,0.00011634923,0.00007625712,0.00030999558,0.00007984487,0.0027359403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987495,0.000022097076,0.000010920688,0.00002130615,0.00006145228,0.000009177182],"domain_scores_gemma":[0.9998431,0.000061092134,0.000024380392,0.000025658874,0.00003836788,0.0000073404685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015047583,0.00038018433,0.00029706385,0.0003936923,0.000117812095,0.00026189527,0.00027677548,0.00031507804,0.00091245247],"category_scores_gemma":[0.00047434826,0.000121158184,0.0002483532,0.00047850295,0.00019636606,0.00045179398,0.00031599193,0.00038434833,0.00031814058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032113944,0.00007215997,0.0005868889,0.00015728633,0.00004525463,0.00023128392,0.00009386059,0.010344017,0.30922854,0.0027625903,0.0017065251,0.6744504],"study_design_scores_gemma":[0.00009427115,0.00061902707,0.0057270853,0.00004828206,0.00008065862,0.004859035,0.00009813171,0.47774106,0.49285606,0.0020712842,0.015722148,0.00008295632],"about_ca_topic_score_codex":0.00041134038,"about_ca_topic_score_gemma":0.00081207516,"teacher_disagreement_score":0.00091245247,"about_ca_system_score_codex":0.00009353142,"about_ca_system_score_gemma":0.00017969341,"threshold_uncertainty_score":0.003052473},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032797834,0.00006435865,0.9991955,0.000015202374,0.000025616346,0.000012652888,0.000010405252,0.0001682678,0.00018003397],"genre_scores_gemma":[0.015240359,0.00015217498,0.9827069,0.000033673085,0.00004945772,0.00016628414,0.00012532623,0.000079577454,0.0014462558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935204,0.00013798961,0.000055069944,0.00016893302,0.00025202942,0.000033908687],"domain_scores_gemma":[0.9992387,0.0003467772,0.000080835875,0.00009409313,0.00022132762,0.000018248997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010405688,0.0010702193,0.0010709668,0.0010399766,0.0007907064,0.0007913584,0.0014425081,0.001373736,0.0030240847],"category_scores_gemma":[0.003526643,0.0006299759,0.00081817294,0.0009791114,0.00058885204,0.0012477124,0.0010800816,0.0020151015,0.0024232848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017065738,0.00007236722,0.0004838108,0.00023860365,0.00012542128,0.00016536073,0.00015803833,0.17966053,0.018909017,0.051686164,0.0046009365,0.74372905],"study_design_scores_gemma":[0.000034472254,0.000065303524,0.0003118548,0.00003335638,0.000026709266,0.00020283087,0.000016928101,0.9626289,0.0063847005,0.016624281,0.013633722,0.000036932328],"about_ca_topic_score_codex":0.001493298,"about_ca_topic_score_gemma":0.0016083308,"teacher_disagreement_score":0.0030240847,"about_ca_system_score_codex":0.0004317749,"about_ca_system_score_gemma":0.00092752854,"threshold_uncertainty_score":0.010116518},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012237565,0.0016993133,0.9957424,0.00016812808,0.000098686505,0.000012394427,0.00004139075,0.00011594229,0.00089796283],"genre_scores_gemma":[0.15614264,0.00617528,0.8238959,0.00021302997,0.00042883214,0.0002197516,0.00035609488,0.00020108391,0.012367338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970895,0.00009921674,0.00002133087,0.00006819098,0.00008223661,0.000020061749],"domain_scores_gemma":[0.9990232,0.0005395087,0.00008574614,0.0001040388,0.00022225699,0.00002523985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073782995,0.000680459,0.0005858696,0.00040710112,0.00029731746,0.0011140254,0.0010673302,0.0013590391,0.0032693055],"category_scores_gemma":[0.0041059223,0.00033940564,0.00035577492,0.0012414468,0.00073844683,0.0013878444,0.0008061167,0.0022717027,0.001245208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012264233,0.000058348433,0.00029734115,0.00040784807,0.00009089154,0.00010711572,0.00009499977,0.386848,0.008817548,0.24196124,0.010246861,0.35094708],"study_design_scores_gemma":[0.0000057994766,0.0000066222883,0.00007510884,0.000015545149,0.000007402733,0.000018428836,0.000004496849,0.95408684,0.00071941665,0.04214763,0.0029033523,0.00000949247],"about_ca_topic_score_codex":0.003539966,"about_ca_topic_score_gemma":0.004409385,"teacher_disagreement_score":0.003539966,"about_ca_system_score_codex":0.0005905933,"about_ca_system_score_gemma":0.0005645765,"threshold_uncertainty_score":0.0109369755},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22974922,0.00012408548,0.76810646,0.000057104065,0.000024247574,0.00002544616,0.000066253684,0.0005153631,0.0013318022],"genre_scores_gemma":[0.8544212,0.0001005684,0.14414012,0.000013499823,0.000012181288,0.00003061502,0.0001420631,0.000031972475,0.0011077987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997466,0.00006468325,0.000012127953,0.000046958135,0.000108039,0.000021473326],"domain_scores_gemma":[0.9996753,0.00014139229,0.000046559355,0.00004255038,0.00007988878,0.000014321124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047182856,0.00053948164,0.00046001663,0.00050998904,0.00017476415,0.00031594434,0.00030612602,0.00046376765,0.0006771697],"category_scores_gemma":[0.0015074149,0.00016009792,0.0002915062,0.00035634282,0.0003397956,0.0005887005,0.0004620232,0.00032151194,0.00023175201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089203235,0.00014428278,0.0047351313,0.00031759395,0.00009512229,0.00029305601,0.00031790062,0.30368212,0.29548776,0.006877169,0.0010272606,0.38613057],"study_design_scores_gemma":[0.000023759158,0.00019663991,0.0056414115,0.000013592126,0.000027917866,0.00018582566,0.000046891964,0.90910006,0.08196811,0.0014607375,0.0012959158,0.000039161212],"about_ca_topic_score_codex":0.0011896379,"about_ca_topic_score_gemma":0.0016320079,"teacher_disagreement_score":0.0011896379,"about_ca_system_score_codex":0.0001480351,"about_ca_system_score_gemma":0.00031941792,"threshold_uncertainty_score":0.0024952888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017496359,0.00013103097,0.98131883,0.0001330906,0.000034260385,0.00008183038,0.0002512039,0.00030166926,0.00025176557],"genre_scores_gemma":[0.43629473,0.00090862514,0.548094,0.0003197023,0.0001997765,0.0012466091,0.0023067407,0.0003963414,0.010233569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960556,0.0025246001,0.00016132489,0.0007193539,0.00034258925,0.00019646152],"domain_scores_gemma":[0.9915633,0.0060414285,0.0007196223,0.00074212824,0.0008077123,0.00012583722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011025746,0.0012317419,0.0012850992,0.0011704162,0.00057129824,0.00100267,0.0023212226,0.0014525253,0.0043886327],"category_scores_gemma":[0.019521452,0.0007286053,0.0023358103,0.0013774126,0.0011880996,0.001731186,0.0011037177,0.0018645215,0.0013435065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011449535,0.00025475217,0.011648875,0.00023663531,0.00066616485,0.0006895467,0.0006859871,0.663329,0.010801782,0.19497052,0.0034446444,0.11212709],"study_design_scores_gemma":[0.000033829576,0.0001263618,0.0013947345,0.000012620301,0.00004301032,0.00010383638,0.000023074586,0.97256947,0.0006516933,0.023756934,0.00124794,0.000036577094],"about_ca_topic_score_codex":0.0060543735,"about_ca_topic_score_gemma":0.0061304346,"teacher_disagreement_score":0.011025746,"about_ca_system_score_codex":0.00081295276,"about_ca_system_score_gemma":0.0016905144,"threshold_uncertainty_score":0.05831039},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7009777,0.0007492176,0.2961201,0.00020768425,0.000021983149,0.000019290474,0.00008988292,0.00037012994,0.001444134],"genre_scores_gemma":[0.96202326,0.00028196152,0.03715895,0.000013602606,0.000018696039,0.000005748511,0.000069939095,0.00004447062,0.0003833821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990284,0.000022983178,0.000004033233,0.000013013403,0.00003684918,0.000020229478],"domain_scores_gemma":[0.9996395,0.00013802537,0.00007744655,0.000054017957,0.000045006767,0.00004597685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041211693,0.00024944602,0.00028878424,0.0010586557,0.00028935916,0.00058112293,0.00021103311,0.00030316264,0.00048537948],"category_scores_gemma":[0.0016219257,0.00021966897,0.00033214546,0.0006603537,0.00038879094,0.00048196682,0.0006679517,0.00034532827,0.00011550822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005379469,0.00009486103,0.01589742,0.00017467192,0.0001572231,0.0008629172,0.00066418195,0.6384006,0.15541346,0.028965387,0.001343978,0.1574873],"study_design_scores_gemma":[0.000022348231,0.00003318246,0.0110392915,0.000009115862,0.00001879243,0.00013985173,0.00006817474,0.96646136,0.009583835,0.01185347,0.00074791315,0.000022672366],"about_ca_topic_score_codex":0.00087189267,"about_ca_topic_score_gemma":0.00052119844,"teacher_disagreement_score":0.0010586557,"about_ca_system_score_codex":0.00021408626,"about_ca_system_score_gemma":0.00016593828,"threshold_uncertainty_score":0.0021795034},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029302693,0.00027608694,0.9958287,0.00018543715,0.000029067283,0.000014720639,0.000053950105,0.0001866641,0.00049523544],"genre_scores_gemma":[0.20137087,0.0008389873,0.79167116,0.00018666161,0.00018488005,0.00016321303,0.00036913136,0.0002013147,0.0050138035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999421,0.00017402852,0.00003480451,0.00012356274,0.00019410951,0.000052537955],"domain_scores_gemma":[0.999671,0.000152124,0.000027376329,0.00004123241,0.000091693044,0.000016642869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074153556,0.0005164987,0.0007874367,0.00055086776,0.0002953429,0.00084573886,0.0007002445,0.00080609863,0.0024840909],"category_scores_gemma":[0.002513379,0.00043723002,0.00068765227,0.0006952649,0.0006125067,0.0011545928,0.0009345142,0.00081647275,0.0010197404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038266028,0.00009067053,0.00051292375,0.00030156126,0.00010581248,0.000097825185,0.0000925191,0.10727776,0.05815629,0.0476685,0.0076184194,0.77769494],"study_design_scores_gemma":[0.000025784202,0.00007936081,0.0007579537,0.000013481608,0.000035276516,0.00017322594,0.000013721679,0.95830107,0.012986997,0.023658952,0.0039217127,0.000032429183],"about_ca_topic_score_codex":0.001770523,"about_ca_topic_score_gemma":0.0016056349,"teacher_disagreement_score":0.0024840909,"about_ca_system_score_codex":0.00034718358,"about_ca_system_score_gemma":0.0015394673,"threshold_uncertainty_score":0.00831008},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022685362,0.00034373562,0.97587204,0.00004915038,0.000029967616,0.00001437862,0.000037887927,0.00042760684,0.00053970073],"genre_scores_gemma":[0.26486295,0.00047180336,0.7312109,0.00004743653,0.00006517182,0.00005178799,0.0001806889,0.00007356684,0.003035651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996747,0.000060386454,0.000023321762,0.00006508232,0.00015727311,0.000019171064],"domain_scores_gemma":[0.99954635,0.00022794465,0.00005864295,0.000064653206,0.00008715395,0.00001530134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049192976,0.0005047558,0.0007152825,0.00048658645,0.0002384744,0.00057467166,0.0004195531,0.0006796696,0.0014664745],"category_scores_gemma":[0.0018302988,0.00024825588,0.00034923345,0.00042057422,0.0002758479,0.0007586867,0.00045307796,0.0004160808,0.0009763978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074894,0.000109419,0.0011401712,0.0002947742,0.00012421687,0.00020391984,0.00015698395,0.044841528,0.26638803,0.006171118,0.0011260562,0.6786949],"study_design_scores_gemma":[0.00004711815,0.00024116338,0.0022443824,0.00003642113,0.00008396339,0.0009179826,0.00004905184,0.72845644,0.2578794,0.0058079287,0.004172984,0.00006317408],"about_ca_topic_score_codex":0.00045122352,"about_ca_topic_score_gemma":0.0007537349,"teacher_disagreement_score":0.0014664745,"about_ca_system_score_codex":0.0001489826,"about_ca_system_score_gemma":0.0003181378,"threshold_uncertainty_score":0.0049058795},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0141592575,0.00015312618,0.9845191,0.00007048666,0.00004231061,0.000020716932,0.000047389796,0.00021031772,0.00077727076],"genre_scores_gemma":[0.24284136,0.0002244607,0.7543883,0.00009039165,0.000060626153,0.00005221867,0.00016582402,0.000043962213,0.0021328707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952126,0.000102946186,0.000027090433,0.00010515698,0.00021284676,0.000030853444],"domain_scores_gemma":[0.9992995,0.00024354232,0.00007624537,0.0001266788,0.0002317366,0.000022247572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007881502,0.00040603374,0.0005744732,0.00064742076,0.00026485478,0.00045048344,0.00046030764,0.00074507407,0.0010264007],"category_scores_gemma":[0.0017412473,0.00023268594,0.0005308074,0.00051299547,0.00056261366,0.00069621776,0.00072032,0.00064299064,0.00026935997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026022192,0.00008714414,0.0013593651,0.0003135575,0.00012182765,0.00014676031,0.00014540674,0.5342436,0.114319496,0.025709048,0.0022728075,0.32102075],"study_design_scores_gemma":[0.000012979849,0.000025094922,0.0003106593,0.0000072012617,0.000007241605,0.000062860054,0.000006939004,0.9794572,0.015785437,0.0026193962,0.0016897391,0.000015307833],"about_ca_topic_score_codex":0.002500714,"about_ca_topic_score_gemma":0.002159922,"teacher_disagreement_score":0.002500714,"about_ca_system_score_codex":0.0003790283,"about_ca_system_score_gemma":0.0008235399,"threshold_uncertainty_score":0.0049723387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8483759,0.0009081251,0.108423695,0.0032844364,0.00044018755,0.00014624798,0.00025077953,0.00020986891,0.03796066],"genre_scores_gemma":[0.98201436,0.00027216016,0.012419151,0.0005544992,0.00015065486,0.00011299939,0.000115501396,0.000119152115,0.004241506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988426,0.0004278144,0.00006790434,0.00017757707,0.00039310535,0.00009106427],"domain_scores_gemma":[0.97162503,0.024072636,0.001388852,0.0016986544,0.00045444714,0.00076029985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034655721,0.0007362089,0.00066444825,0.0006373762,0.00036741648,0.001761671,0.001296542,0.0013850359,0.013945793],"category_scores_gemma":[0.023181181,0.00034536002,0.0003444656,0.00047165813,0.0015602598,0.0040495982,0.0010013536,0.0024722375,0.00046288432],"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.018214699,0.003395342,0.008852601,0.0006625507,0.00023862494,0.0005447473,0.00061853527,0.011562868,0.22228971,0.55584794,0.0049144896,0.17285796],"study_design_scores_gemma":[0.0013320326,0.0012118872,0.032290332,0.00005736532,0.00018693038,0.00084324897,0.00027653013,0.07118981,0.02336189,0.8654005,0.0037316012,0.00011794579],"about_ca_topic_score_codex":0.00056268286,"about_ca_topic_score_gemma":0.00073551957,"teacher_disagreement_score":0.013945793,"about_ca_system_score_codex":0.0008637194,"about_ca_system_score_gemma":0.0008017822,"threshold_uncertainty_score":0.04665333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088330716,0.0002740186,0.9096259,0.00005605233,0.000028022972,0.00009245999,0.00014002695,0.00083556253,0.0006173659],"genre_scores_gemma":[0.3889186,0.0005408273,0.60817385,0.000054558783,0.000055427154,0.0004279049,0.0005468388,0.0003718122,0.0009100895],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99964297,0.00010487062,0.00001754343,0.00006901486,0.00012753111,0.00003815174],"domain_scores_gemma":[0.99894375,0.00061394955,0.0000532965,0.0001170132,0.00024959983,0.000022411406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010881796,0.0007704697,0.00048391783,0.00090138963,0.00029798292,0.00083807204,0.00045319952,0.0006380599,0.0010459771],"category_scores_gemma":[0.0043635755,0.00026609248,0.00044374398,0.0006154287,0.00057413266,0.0005316845,0.00026116267,0.000726411,0.000554662],"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.00035877153,0.00014293993,0.0030180619,0.0002833265,0.00007114005,0.00025155398,0.00027257274,0.021619583,0.75475854,0.0034709566,0.0007984292,0.21495415],"study_design_scores_gemma":[0.000051943975,0.00026672886,0.05055927,0.00003661071,0.0001194696,0.0007861077,0.00007368385,0.42853174,0.511735,0.0034859604,0.0042337338,0.000119774195],"about_ca_topic_score_codex":0.0016097977,"about_ca_topic_score_gemma":0.0022553415,"teacher_disagreement_score":0.0016097977,"about_ca_system_score_codex":0.00039294313,"about_ca_system_score_gemma":0.00087153673,"threshold_uncertainty_score":0.0057549477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05093884,0.000569843,0.9445502,0.00013658505,0.00020661663,0.000048516587,0.0001562283,0.00081228267,0.0025809193],"genre_scores_gemma":[0.46570694,0.0007287228,0.52760077,0.00023154952,0.00026926975,0.00008378677,0.0005100035,0.0003420576,0.0045269094],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972777,0.0006012962,0.000238021,0.0007069261,0.0009277232,0.00024829182],"domain_scores_gemma":[0.9816798,0.0067238165,0.0023160514,0.0069800937,0.0020143816,0.00028592368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030302443,0.0007379671,0.0009801885,0.0016803737,0.0006101144,0.0016563605,0.0011608757,0.00094021484,0.0040516355],"category_scores_gemma":[0.027745884,0.00035935105,0.0007181249,0.0016878599,0.0014081642,0.0023259846,0.0016027464,0.0017112773,0.0014453462],"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.0012819804,0.00017439164,0.007769311,0.00043740775,0.00022772889,0.0002823205,0.00046283207,0.026688257,0.06975878,0.0756962,0.0025716783,0.81464916],"study_design_scores_gemma":[0.00023723599,0.0005774332,0.016276833,0.0003142258,0.00040502913,0.0026169433,0.00037433035,0.4176591,0.3853363,0.12863635,0.047339585,0.00022657443],"about_ca_topic_score_codex":0.0008866109,"about_ca_topic_score_gemma":0.00086981157,"teacher_disagreement_score":0.0040516355,"about_ca_system_score_codex":0.0004992968,"about_ca_system_score_gemma":0.0011729548,"threshold_uncertainty_score":0.016025662},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86141884,0.0005298159,0.13414277,0.00019805062,0.000080013204,0.00014612825,0.00014456443,0.0011330881,0.0022068177],"genre_scores_gemma":[0.9648595,0.00012312384,0.033583477,0.00005327463,0.00002192337,0.000071678944,0.00015028083,0.000029026634,0.0011077416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964213,0.00008947496,0.00003038585,0.00005698885,0.00014062446,0.00004044006],"domain_scores_gemma":[0.9988117,0.000722561,0.00006008374,0.00007873838,0.0002831625,0.000043736163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061092497,0.00056815386,0.00040589154,0.0007055091,0.00026559518,0.00047506797,0.00029992414,0.00073171774,0.0012691988],"category_scores_gemma":[0.0027802994,0.00012419089,0.00017499544,0.00047099858,0.00021151497,0.00042476272,0.0002797569,0.00026632473,0.00028045714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006322472,0.0007247464,0.009628742,0.0004420602,0.0002586413,0.00041729034,0.00029018303,0.2023661,0.25906682,0.0022239846,0.0016035337,0.5166555],"study_design_scores_gemma":[0.0001481777,0.002396491,0.010748078,0.00001509678,0.00006302118,0.00033630646,0.00003300139,0.8996515,0.08565888,0.00021676376,0.0006952106,0.000037450223],"about_ca_topic_score_codex":0.0017374353,"about_ca_topic_score_gemma":0.0009206148,"teacher_disagreement_score":0.0017374353,"about_ca_system_score_codex":0.0002912312,"about_ca_system_score_gemma":0.0002931539,"threshold_uncertainty_score":0.0042458773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05912192,0.00065575866,0.9378805,0.00016665494,0.00018507744,0.00007803202,0.00010874789,0.0006977393,0.0011054098],"genre_scores_gemma":[0.25137544,0.001356129,0.7431595,0.00011514646,0.00022610146,0.0001336395,0.000426373,0.00013211898,0.003075581],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998227,0.000018819246,0.000013903119,0.000019214376,0.000108029904,0.000017391085],"domain_scores_gemma":[0.9996006,0.00016576762,0.000041621093,0.000046254234,0.00013495267,0.000010754076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002361894,0.00062231685,0.00041203323,0.0007501209,0.0002557154,0.0003451744,0.00034601073,0.00044003583,0.0016039624],"category_scores_gemma":[0.0009618075,0.00015706081,0.00038054315,0.0006965187,0.00027386812,0.0005925165,0.00031387282,0.0005915888,0.00045489336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036189082,0.00007795212,0.0004248464,0.00036451046,0.00003901148,0.00046107164,0.00016400468,0.018498177,0.50226927,0.003099973,0.0016530509,0.47258627],"study_design_scores_gemma":[0.00004320329,0.0007379323,0.0043603308,0.000066745095,0.000098191864,0.0020489304,0.000104291204,0.28122392,0.69526887,0.0029087756,0.013082135,0.000056646477],"about_ca_topic_score_codex":0.0004286822,"about_ca_topic_score_gemma":0.00085255655,"teacher_disagreement_score":0.0016039624,"about_ca_system_score_codex":0.00014005345,"about_ca_system_score_gemma":0.00032312455,"threshold_uncertainty_score":0.005365789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005404801,0.00031200593,0.99342465,0.00007085865,0.000030107114,0.000014639434,0.000015749827,0.00013303025,0.0005941132],"genre_scores_gemma":[0.38194743,0.001035037,0.6144642,0.0001701032,0.00021148176,0.0001182086,0.00017707665,0.000108077686,0.001768301],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932134,0.00019446998,0.00005228431,0.00012252126,0.00026178706,0.000047482485],"domain_scores_gemma":[0.9992817,0.00033466774,0.00008575002,0.00009707228,0.00017609097,0.000024759063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00120655,0.0007025205,0.00090660417,0.0012966163,0.0003299696,0.001078075,0.00068190345,0.00060860993,0.0010903858],"category_scores_gemma":[0.0035366977,0.00023654931,0.0010127004,0.0009615166,0.00083520846,0.002062288,0.001335446,0.0007488411,0.0003957466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042359286,0.000113090624,0.0007071293,0.00032763297,0.00020589509,0.00028053505,0.00033783546,0.15244685,0.098951414,0.08075162,0.0021144953,0.66333985],"study_design_scores_gemma":[0.000012720721,0.000093089206,0.00060662633,0.000023007708,0.000051839226,0.00020473072,0.00005664348,0.935248,0.026423117,0.034983113,0.0022464376,0.000050619106],"about_ca_topic_score_codex":0.00041597392,"about_ca_topic_score_gemma":0.00032484162,"teacher_disagreement_score":0.0012966163,"about_ca_system_score_codex":0.00049184513,"about_ca_system_score_gemma":0.0004009062,"threshold_uncertainty_score":0.0063809156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071275135,0.000106872125,0.9980008,0.00003063398,0.000021451677,0.0000056958334,0.000012768049,0.000059074737,0.0010500026],"genre_scores_gemma":[0.27613336,0.0027352422,0.7068537,0.00022201116,0.00046546743,0.00016749126,0.00022545959,0.00036495746,0.012832366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997249,0.00009169336,0.000017161798,0.00006369186,0.000083561994,0.000018992756],"domain_scores_gemma":[0.99975437,0.000079190155,0.000025530506,0.000057974066,0.00006460674,0.000018333372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006213262,0.0010258026,0.00082965835,0.0006427247,0.00031397934,0.0012664812,0.0012127714,0.00093203684,0.002734481],"category_scores_gemma":[0.0011883643,0.00045405765,0.00078762544,0.0005392568,0.000644702,0.001758057,0.0010879837,0.0014360783,0.0014595232],"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.00006311474,0.00006756426,0.00026271216,0.00019796634,0.00006779972,0.00021047276,0.00020582307,0.45517635,0.01581528,0.4098703,0.0025307718,0.11553178],"study_design_scores_gemma":[0.0000052522632,0.000023440467,0.000050398,0.000012803284,0.000010543201,0.00003937654,0.000012650309,0.9467488,0.0008793223,0.048631072,0.0035753353,0.000011013705],"about_ca_topic_score_codex":0.0008922907,"about_ca_topic_score_gemma":0.0011429334,"teacher_disagreement_score":0.002734481,"about_ca_system_score_codex":0.000337472,"about_ca_system_score_gemma":0.00056509604,"threshold_uncertainty_score":0.009147763},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031014746,0.000136244,0.99607086,0.000044698958,0.00001663303,0.0000085673,0.00002540914,0.0003754316,0.00022070424],"genre_scores_gemma":[0.30767685,0.0006941545,0.6885954,0.00012164941,0.00012510622,0.00009296999,0.0004952083,0.00011282385,0.0020858138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995913,0.00010606237,0.000018208317,0.00010150603,0.00014584592,0.000037031637],"domain_scores_gemma":[0.9991898,0.00053175905,0.0000862205,0.000067136425,0.00010015231,0.000024915547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088991545,0.00073982106,0.0008227728,0.0010571611,0.00028547167,0.00064761244,0.0009567897,0.0007513916,0.0007769353],"category_scores_gemma":[0.0032772867,0.00039371103,0.000891052,0.0007478067,0.0004165457,0.0012309995,0.00054641446,0.0012324378,0.0005050318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044748108,0.00018204442,0.0035151541,0.0002187362,0.00029394226,0.00036756977,0.00018112815,0.3850592,0.039598756,0.04491633,0.0037723898,0.52144724],"study_design_scores_gemma":[0.00000833778,0.0000234095,0.0003740458,0.000006000406,0.000012742316,0.00006148905,0.0000059618355,0.98771477,0.0036909042,0.007327765,0.0007600198,0.000014647363],"about_ca_topic_score_codex":0.002438646,"about_ca_topic_score_gemma":0.002233392,"teacher_disagreement_score":0.002438646,"about_ca_system_score_codex":0.0005043335,"about_ca_system_score_gemma":0.0005640897,"threshold_uncertainty_score":0.004848957},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071654413,0.00016713103,0.9920203,0.000057587,0.00001201732,0.000017810398,0.000018662666,0.00016615952,0.00037481406],"genre_scores_gemma":[0.1954972,0.0007983617,0.80157715,0.00010312722,0.000049936025,0.00017132644,0.00023727394,0.00008470968,0.0014809235],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950635,0.00017886393,0.000029248178,0.0000620133,0.00020335898,0.00002020205],"domain_scores_gemma":[0.99839336,0.0011525464,0.00012587539,0.00014635567,0.00016141695,0.000020440879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007427276,0.00053460087,0.00036503817,0.00046212028,0.00016949397,0.00037432162,0.00037547544,0.00057946617,0.0017323642],"category_scores_gemma":[0.0064959335,0.00021172904,0.00033347678,0.00066054723,0.00044022486,0.0010272,0.0005223966,0.00046950116,0.0006436086],"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.00045337423,0.000058245696,0.000658697,0.00042793935,0.00006499016,0.00036782125,0.0002582613,0.32936335,0.174917,0.0218325,0.001797537,0.46980032],"study_design_scores_gemma":[0.000039267587,0.00018471897,0.0009859592,0.00003561076,0.000016744665,0.0003668457,0.000038632414,0.93967474,0.034692783,0.019642645,0.0042950967,0.000026910728],"about_ca_topic_score_codex":0.00071942667,"about_ca_topic_score_gemma":0.0010726945,"teacher_disagreement_score":0.0017323642,"about_ca_system_score_codex":0.00017160182,"about_ca_system_score_gemma":0.00046773112,"threshold_uncertainty_score":0.0057953},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017390164,0.61865175,0.33218926,0.01179874,0.0016054125,0.000050867882,0.00018147149,0.00070719136,0.017425088],"genre_scores_gemma":[0.16918352,0.65158683,0.16136554,0.0019463912,0.008132222,0.0000815297,0.0005945228,0.00022631575,0.0068830987],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981158,0.0004115537,0.00017206791,0.00032919206,0.00086536654,0.000106060346],"domain_scores_gemma":[0.9929932,0.004073541,0.00039352928,0.00040599296,0.001906842,0.0002269377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050370283,0.00090950995,0.0014167887,0.0018280761,0.0005276001,0.0032144976,0.0012745424,0.0020520135,0.0014171131],"category_scores_gemma":[0.0052386923,0.00038026736,0.00044835405,0.0027772076,0.0018690804,0.0049969167,0.0013811055,0.0023850221,0.001911149],"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.00020055233,0.00013512041,0.002165889,0.0026843997,0.000082911,0.00014603886,0.00029128417,0.00863446,0.0068625337,0.045356385,0.009667401,0.923773],"study_design_scores_gemma":[0.00008645344,0.0010028157,0.0058577484,0.0026924028,0.00029743448,0.0038097294,0.0025705423,0.16016757,0.038873527,0.23199253,0.5522014,0.00044788214],"about_ca_topic_score_codex":0.00056859246,"about_ca_topic_score_gemma":0.0004090924,"teacher_disagreement_score":0.0050370283,"about_ca_system_score_codex":0.0005525447,"about_ca_system_score_gemma":0.00085214886,"threshold_uncertainty_score":0.026638627},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9897982,0.00030846806,0.008581531,0.000027551883,0.0000075083335,0.000015260879,0.00004651645,0.0001495641,0.001065316],"genre_scores_gemma":[0.99728703,0.00009049873,0.0022228416,0.000019252477,0.0000050782214,0.000010963697,0.00010508134,0.000021947677,0.00023726493],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9996877,0.000042500775,0.000029187717,0.000073494375,0.00013517776,0.000032057203],"domain_scores_gemma":[0.9974667,0.0011436675,0.0005115371,0.00045666887,0.00024352327,0.0001779099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036477903,0.00030150873,0.00041532546,0.0006420093,0.00017447145,0.00030760784,0.000246081,0.00039263908,0.0016355335],"category_scores_gemma":[0.004134706,0.00017977293,0.00017158514,0.00032540946,0.00067624333,0.0005710816,0.0008477859,0.00041990442,0.00023537088],"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.0014768284,0.000039231152,0.008383033,0.00015039669,0.00002865858,0.0003800755,0.0002900637,0.0005955712,0.965794,0.00052488176,0.000071454735,0.0222657],"study_design_scores_gemma":[0.0001106279,0.0013419171,0.44056815,0.000045963116,0.000090954214,0.0035985906,0.00027437363,0.009187247,0.5408662,0.003098826,0.0007791313,0.000037962214],"about_ca_topic_score_codex":0.00075386453,"about_ca_topic_score_gemma":0.0006209246,"teacher_disagreement_score":0.0016355335,"about_ca_system_score_codex":0.0002795732,"about_ca_system_score_gemma":0.00022196786,"threshold_uncertainty_score":0.0054713488},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030857056,0.021043045,0.7292191,0.0044980235,0.018498784,0.00066195877,0.003578761,0.016534615,0.17510872],"genre_scores_gemma":[0.1456106,0.014481723,0.27757543,0.0014038889,0.004794978,0.0004444838,0.0149833,0.0040016193,0.53670394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995914,0.000045126446,0.000028927481,0.00010084674,0.00020164934,0.000032036325],"domain_scores_gemma":[0.999086,0.00017841758,0.00004502511,0.00014329038,0.00048029533,0.00006689964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049054914,0.000687045,0.00080387294,0.0012497022,0.00036674473,0.0011765189,0.00084804074,0.0007417985,0.059998237],"category_scores_gemma":[0.0011692077,0.00018209207,0.00035676637,0.001765772,0.0006444618,0.0012705621,0.0005483865,0.00078712724,0.049822126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043776762,0.000131233,0.00036175328,0.00053727254,0.00003577474,0.00023535569,0.00005941214,0.002139996,0.072274365,0.008518371,0.21480913,0.70045966],"study_design_scores_gemma":[0.000109003784,0.0007310394,0.0046143224,0.00019697868,0.0000741395,0.001016133,0.00006043425,0.049588177,0.1791332,0.0079333335,0.7563986,0.00014468486],"about_ca_topic_score_codex":0.002191103,"about_ca_topic_score_gemma":0.0026963814,"teacher_disagreement_score":0.059998237,"about_ca_system_score_codex":0.0005870174,"about_ca_system_score_gemma":0.00036100004,"threshold_uncertainty_score":0.20071411},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033261802,0.00027398323,0.9644621,0.00008784985,0.000032024323,0.000052163654,0.000059637623,0.0011365764,0.0006338292],"genre_scores_gemma":[0.108896926,0.00027425954,0.88887185,0.000041011244,0.000022238135,0.00006321863,0.00015391698,0.00007819057,0.0015983791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996706,0.00008300182,0.000029611276,0.00008710728,0.00010767952,0.000022046068],"domain_scores_gemma":[0.99950874,0.00018737979,0.00006809474,0.000065334934,0.00015261804,0.000017783865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005902036,0.00065819605,0.00048503026,0.0006900043,0.00018495944,0.00041829416,0.00044967493,0.0005553206,0.0013903937],"category_scores_gemma":[0.0020714388,0.00026533703,0.0006063334,0.00057192566,0.00028047638,0.0005214685,0.00034422532,0.00040499272,0.00093692576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022873355,0.00008257071,0.002121103,0.00015606619,0.00009094792,0.00013383491,0.00013028507,0.023804229,0.11024905,0.0017988224,0.00096212846,0.8602422],"study_design_scores_gemma":[0.00011409516,0.00035355365,0.011315621,0.000034859004,0.00011971698,0.0014016483,0.00010034238,0.8342225,0.14401862,0.0020080756,0.0062300884,0.000080754035],"about_ca_topic_score_codex":0.0011930118,"about_ca_topic_score_gemma":0.0020503826,"teacher_disagreement_score":0.0013903937,"about_ca_system_score_codex":0.00015470642,"about_ca_system_score_gemma":0.0005164541,"threshold_uncertainty_score":0.0046513677},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057705245,0.000110995046,0.9925708,0.00008018963,0.000032679105,0.000056538196,0.00009571766,0.00092474045,0.00035782004],"genre_scores_gemma":[0.10087514,0.00026611402,0.8956627,0.000101861304,0.000111570385,0.00034263456,0.0009779156,0.00023704204,0.0014249453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802136,0.0008335086,0.00009268734,0.00040500675,0.00054180284,0.00010567879],"domain_scores_gemma":[0.99738556,0.0013496425,0.00015865409,0.00032964654,0.000706263,0.00007034864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002418094,0.0011458221,0.00123099,0.0027083417,0.0006893924,0.0010729276,0.0010864555,0.00078669866,0.0015561063],"category_scores_gemma":[0.0072797392,0.00037120402,0.0013372762,0.0031406272,0.0005606143,0.00087535096,0.0007447855,0.0010086722,0.0013407947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034407602,0.00023912598,0.0047305943,0.00014361611,0.0005563299,0.00027075264,0.00013242452,0.099194296,0.03062493,0.011834214,0.007975855,0.8439538],"study_design_scores_gemma":[0.00006062495,0.00009201541,0.0044403276,0.000013856499,0.00010521387,0.00018442166,0.000023302355,0.9603415,0.013052903,0.016375793,0.00523177,0.00007818816],"about_ca_topic_score_codex":0.003397079,"about_ca_topic_score_gemma":0.0032571817,"teacher_disagreement_score":0.003397079,"about_ca_system_score_codex":0.00035781116,"about_ca_system_score_gemma":0.0014222013,"threshold_uncertainty_score":0.012788296},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003919054,0.000031853535,0.995514,0.000023607558,0.00001143966,0.000014487879,0.000013871591,0.00029485385,0.00017688438],"genre_scores_gemma":[0.06227119,0.00007602401,0.93601704,0.000029451,0.000023272607,0.000053654945,0.00012734722,0.00011991582,0.0012821927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939644,0.000088005094,0.000030347948,0.00009214933,0.00034845516,0.00004449808],"domain_scores_gemma":[0.9991716,0.00032211782,0.00006946125,0.00017949975,0.00022545768,0.00003188939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007777928,0.0008719811,0.00054006407,0.0010209915,0.0003713171,0.000685854,0.00091960886,0.0007090826,0.0018805113],"category_scores_gemma":[0.0024678574,0.00037772502,0.0007619457,0.0007937004,0.0006236343,0.0011308587,0.0009211813,0.0013421176,0.0010122943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025063223,0.00017594972,0.0013814424,0.00016459702,0.00014058912,0.00014447772,0.00020693446,0.09897,0.12233362,0.02627993,0.0026879353,0.7472639],"study_design_scores_gemma":[0.000017718836,0.00006486666,0.0010003169,0.000011634424,0.000019541754,0.00012176022,0.00002349203,0.93266934,0.050775673,0.010868677,0.0043879743,0.000038918683],"about_ca_topic_score_codex":0.0019501658,"about_ca_topic_score_gemma":0.002501729,"teacher_disagreement_score":0.0019501658,"about_ca_system_score_codex":0.00038530875,"about_ca_system_score_gemma":0.0010022837,"threshold_uncertainty_score":0.0062909126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001231735,0.00016941607,0.9977465,0.00005959816,0.000022808808,0.000035538713,0.000085751315,0.00013391489,0.00051470497],"genre_scores_gemma":[0.15961358,0.0015373605,0.8305415,0.00020485622,0.00034703084,0.0005741055,0.0015608812,0.00024463984,0.0053761113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625266,0.001386335,0.00020931187,0.0009039095,0.0010326544,0.00021522972],"domain_scores_gemma":[0.9947876,0.0027603037,0.00046326965,0.0010126887,0.00086769916,0.000108435765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004554801,0.0017818478,0.0021984493,0.0016437036,0.0007204263,0.0019581348,0.0021593827,0.0012338343,0.0035250862],"category_scores_gemma":[0.013542324,0.0009788522,0.0016964136,0.002619052,0.0016680253,0.0034275185,0.0022689172,0.00262641,0.0015068974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023301766,0.00009471039,0.0017841174,0.00030626467,0.00030711974,0.00016757338,0.00018096589,0.42231473,0.0029633746,0.24423148,0.007401929,0.32001472],"study_design_scores_gemma":[0.000014168391,0.000033812685,0.0002975671,0.000017156151,0.000022273987,0.000081808954,0.000012854782,0.89457047,0.0008781441,0.10049468,0.003556316,0.000020665693],"about_ca_topic_score_codex":0.002837582,"about_ca_topic_score_gemma":0.0024990516,"teacher_disagreement_score":0.004554801,"about_ca_system_score_codex":0.00084693404,"about_ca_system_score_gemma":0.0021909748,"threshold_uncertainty_score":0.024088442},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046266433,0.00013944383,0.95274186,0.000039548515,0.000016783051,0.000014158863,0.0000150141295,0.00025472554,0.00051216205],"genre_scores_gemma":[0.75945956,0.00027059417,0.2385604,0.00004242067,0.00003209497,0.000044655597,0.00006956296,0.000049286522,0.001471475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995065,0.00016233634,0.000023995472,0.00012465847,0.00013501695,0.00004752073],"domain_scores_gemma":[0.99923646,0.00041375504,0.00011741049,0.00007667229,0.00013138333,0.000024295432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007904465,0.00064237625,0.00062751933,0.00041668312,0.00031386354,0.0004233846,0.0004406071,0.0005799239,0.0003691037],"category_scores_gemma":[0.0027306553,0.00023402579,0.0003177859,0.00036331895,0.00062642194,0.0010042164,0.00074680854,0.00046306392,0.00026515874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087482185,0.00011831142,0.0020045345,0.00018099298,0.00008136389,0.00023260449,0.00024546887,0.51310927,0.14531824,0.013165863,0.0009266801,0.32374182],"study_design_scores_gemma":[0.000014242742,0.000065688095,0.000621273,0.000006026996,0.0000074165846,0.00010879308,0.000022888305,0.9695851,0.025476031,0.003639557,0.00043381858,0.000019169562],"about_ca_topic_score_codex":0.00080469187,"about_ca_topic_score_gemma":0.0007082836,"teacher_disagreement_score":0.00080469187,"about_ca_system_score_codex":0.00019188726,"about_ca_system_score_gemma":0.0005268661,"threshold_uncertainty_score":0.004180312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018479497,0.00014535291,0.997569,0.000033847475,0.000030072604,0.00001143866,0.000010366977,0.000087132474,0.0002648044],"genre_scores_gemma":[0.11223753,0.0006805253,0.8837906,0.00006908489,0.00010347013,0.00014564558,0.00016731759,0.00015278804,0.002653033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754286,0.00069409335,0.00015925961,0.00036869943,0.0011441415,0.00009110889],"domain_scores_gemma":[0.99705935,0.0012609707,0.00027989122,0.00041238253,0.00091611984,0.00007121055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032709409,0.00091107894,0.0011525358,0.0020511027,0.00037395474,0.0013191974,0.0011489815,0.0010615005,0.0013866858],"category_scores_gemma":[0.008057764,0.00028856104,0.0012104916,0.0019989745,0.0015411223,0.0013135768,0.0012316046,0.0017173167,0.00087605184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003045984,0.00010114414,0.0017039207,0.00042197545,0.0002207401,0.00021670938,0.0002473929,0.30104867,0.04616551,0.1516994,0.0031553486,0.49471465],"study_design_scores_gemma":[0.000009647939,0.000050386785,0.0005392777,0.000015939413,0.000016752541,0.00014136931,0.000013912204,0.9717665,0.005543657,0.019281514,0.002581487,0.000039491755],"about_ca_topic_score_codex":0.0012219802,"about_ca_topic_score_gemma":0.0007576835,"teacher_disagreement_score":0.0032709409,"about_ca_system_score_codex":0.00066993287,"about_ca_system_score_gemma":0.0008118555,"threshold_uncertainty_score":0.01729858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012851513,0.00023295131,0.9856991,0.000080203274,0.000050754727,0.000011678586,0.000032951728,0.00021292234,0.00082806754],"genre_scores_gemma":[0.42618185,0.0008192395,0.5638383,0.0001156495,0.00012439513,0.000076505,0.00016061366,0.00004654463,0.008636845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978226,0.00005486008,0.00001482759,0.000044301556,0.00007916926,0.000024621342],"domain_scores_gemma":[0.9997714,0.000115721385,0.000022366665,0.000032482345,0.000049430608,0.000008481158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042221294,0.00044958043,0.00038313906,0.00030413418,0.0002617939,0.000428336,0.00033305486,0.00044966678,0.0012791815],"category_scores_gemma":[0.0011465696,0.00018736138,0.00024258415,0.00035235495,0.00045186118,0.00057068764,0.00042646614,0.0005720655,0.00039990267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001131298,0.00009409429,0.0009871946,0.0002706843,0.00011926643,0.0002175664,0.00020567278,0.29035,0.19220969,0.09524466,0.003936768,0.41523305],"study_design_scores_gemma":[0.000045519268,0.00010049758,0.0003851127,0.000015541125,0.000028941067,0.00012581561,0.000019566918,0.92968136,0.053739376,0.010914295,0.004922403,0.000021594626],"about_ca_topic_score_codex":0.00070812233,"about_ca_topic_score_gemma":0.0018386225,"teacher_disagreement_score":0.0012791815,"about_ca_system_score_codex":0.0003142276,"about_ca_system_score_gemma":0.00061936537,"threshold_uncertainty_score":0.004279256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011821961,0.0001977616,0.9970175,0.000058105168,0.00003247589,0.000026815145,0.0000139954545,0.00027835023,0.0011928452],"genre_scores_gemma":[0.2335522,0.0016535886,0.75500715,0.00017827531,0.00016491278,0.0002094789,0.00019033368,0.000099201214,0.008944793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994311,0.000106803214,0.000030379115,0.00013493134,0.00026267162,0.000034025266],"domain_scores_gemma":[0.99964285,0.00013865317,0.00002595076,0.000044654542,0.00013724665,0.000010528985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006827003,0.0005429845,0.0006786521,0.0005579763,0.0004331023,0.0007461971,0.0004840029,0.00085853686,0.0031009128],"category_scores_gemma":[0.0015736852,0.00030158376,0.00038946682,0.0005403267,0.0005282875,0.0014333001,0.00051417085,0.0007615166,0.0013546105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019669475,0.000076512086,0.0013889542,0.0005480417,0.00011647189,0.00023335236,0.00028738682,0.15092799,0.056192487,0.0853644,0.005644538,0.6990232],"study_design_scores_gemma":[0.000050668696,0.00017716712,0.0009187651,0.0000733665,0.000052729025,0.0003861535,0.00003281378,0.9327208,0.02252704,0.014776105,0.028215738,0.00006872179],"about_ca_topic_score_codex":0.0040415656,"about_ca_topic_score_gemma":0.0032750757,"teacher_disagreement_score":0.0040415656,"about_ca_system_score_codex":0.00053742237,"about_ca_system_score_gemma":0.0011737227,"threshold_uncertainty_score":0.010373533},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084667915,0.00012321405,0.99779236,0.000108312415,0.00001835652,0.000007768882,0.000010868278,0.00003348738,0.0010590174],"genre_scores_gemma":[0.15107135,0.0021801637,0.83581245,0.00040428364,0.0004551934,0.00036645122,0.00019423285,0.0003286511,0.009187257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977715,0.001135824,0.00009698327,0.00024306071,0.00067075127,0.00008203608],"domain_scores_gemma":[0.99432725,0.004548011,0.00027084604,0.00024626125,0.0005355203,0.00007204417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032619531,0.0013575733,0.0013398335,0.0013405693,0.00059372344,0.0012427848,0.0013373483,0.0013604648,0.0030976478],"category_scores_gemma":[0.01084739,0.0007686514,0.0011335652,0.001985115,0.0019348927,0.003244427,0.0028278695,0.0024440843,0.001017015],"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.00013920739,0.000091151756,0.00031367232,0.0003582365,0.00008898394,0.00010304702,0.00020191538,0.30604234,0.004640228,0.55812126,0.00544555,0.124454424],"study_design_scores_gemma":[0.000010060542,0.00003780791,0.000078680256,0.00002909399,0.000021274254,0.00007553333,0.000018130731,0.783476,0.0019555336,0.2119367,0.002337281,0.00002385823],"about_ca_topic_score_codex":0.00077829586,"about_ca_topic_score_gemma":0.00052338466,"teacher_disagreement_score":0.0032619531,"about_ca_system_score_codex":0.000754561,"about_ca_system_score_gemma":0.0012563822,"threshold_uncertainty_score":0.017251074},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028882874,0.00016103897,0.96919966,0.00011754411,0.000054632652,0.000050545448,0.000025937554,0.00095063425,0.00055717624],"genre_scores_gemma":[0.06982169,0.00024925842,0.92804605,0.000085879336,0.000033046406,0.00007375447,0.000060088183,0.00025222715,0.0013780523],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99953413,0.0001410354,0.000027752454,0.0000876413,0.00017642089,0.00003297157],"domain_scores_gemma":[0.9990128,0.00033780793,0.00020840064,0.0003189915,0.000090923924,0.000031109415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084600685,0.00093554537,0.0005150432,0.0005462697,0.00044051348,0.00065048976,0.0008589014,0.0008283794,0.0014679318],"category_scores_gemma":[0.0034173604,0.0005435865,0.0004604637,0.00068063283,0.0008772405,0.0014857776,0.0012522963,0.001255796,0.0007436937],"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.00071179937,0.00010965744,0.0016402586,0.00044229897,0.00009077095,0.000781865,0.00041137368,0.011667401,0.59400433,0.018719696,0.0024966858,0.3689238],"study_design_scores_gemma":[0.00011776924,0.00089458487,0.00555408,0.000035248784,0.00013618673,0.007072303,0.00008998124,0.08594107,0.8698058,0.012447141,0.017757865,0.00014796089],"about_ca_topic_score_codex":0.00031482973,"about_ca_topic_score_gemma":0.0010547844,"teacher_disagreement_score":0.0014679318,"about_ca_system_score_codex":0.00020207414,"about_ca_system_score_gemma":0.0005903741,"threshold_uncertainty_score":0.004910767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046945647,0.0004116936,0.99396694,0.00006668361,0.00006421462,0.00003322495,0.00003348106,0.00027655857,0.00045255342],"genre_scores_gemma":[0.108375974,0.001193842,0.8884553,0.00006763459,0.00015285125,0.00015147905,0.00020457133,0.00008530901,0.0013130885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999169,0.00015989224,0.000065660824,0.00018579992,0.00036340443,0.000056288267],"domain_scores_gemma":[0.99933594,0.0002367663,0.0000966905,0.000113039205,0.00019756754,0.000019991901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008337739,0.0007971898,0.00090724183,0.0017755885,0.0003836367,0.0008705661,0.0005474701,0.000809175,0.0013537498],"category_scores_gemma":[0.002237852,0.00027044743,0.0011034643,0.0028611461,0.0006409452,0.0014481829,0.00046778817,0.0008101962,0.0008892704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014199028,0.000105579405,0.0011869656,0.000385591,0.00011776044,0.000202846,0.00008770714,0.03796155,0.13339074,0.017696172,0.0027586198,0.80596447],"study_design_scores_gemma":[0.00002849462,0.0001560402,0.006074995,0.000042628883,0.000088049535,0.0004758601,0.000060032024,0.9055003,0.05803364,0.018219681,0.011230477,0.00008985615],"about_ca_topic_score_codex":0.0008991444,"about_ca_topic_score_gemma":0.0007152802,"teacher_disagreement_score":0.0017755885,"about_ca_system_score_codex":0.00025460776,"about_ca_system_score_gemma":0.0003762756,"threshold_uncertainty_score":0.0045287013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21488218,0.0012812797,0.78143454,0.00020488865,0.000052329506,0.00009161702,0.0002913444,0.000764691,0.0009971445],"genre_scores_gemma":[0.7128054,0.0008182448,0.2846874,0.000077460216,0.000100256075,0.00011809357,0.00047138517,0.00009945027,0.0008223432],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996132,0.000098895325,0.000022261711,0.00007170498,0.00016506157,0.000028872686],"domain_scores_gemma":[0.99933964,0.00029266468,0.00009126378,0.00008007855,0.00016593105,0.000030360872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095835887,0.00066005887,0.00047705334,0.0012988026,0.00015523823,0.0005709939,0.00031819212,0.0004501589,0.0007536052],"category_scores_gemma":[0.0023520486,0.00014592573,0.00046796995,0.00072307995,0.00039068243,0.00048542596,0.00037888542,0.0005521575,0.00027209055],"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.0005888788,0.00025470078,0.021995489,0.00042032683,0.00023626593,0.00021610195,0.00021068768,0.043825846,0.5448507,0.0013219487,0.0012152762,0.38486373],"study_design_scores_gemma":[0.000040426432,0.00068249286,0.09172372,0.000051511095,0.00030565757,0.0014725714,0.00011790995,0.64759487,0.25080252,0.0027132276,0.0043629645,0.00013218065],"about_ca_topic_score_codex":0.00065605016,"about_ca_topic_score_gemma":0.00095569505,"teacher_disagreement_score":0.0012988026,"about_ca_system_score_codex":0.00018457536,"about_ca_system_score_gemma":0.00036418068,"threshold_uncertainty_score":0.005068302},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8883953,0.00041888744,0.10799199,0.00029940077,0.000028162936,0.000034889264,0.00017857879,0.00022739595,0.002425322],"genre_scores_gemma":[0.9875101,0.00030827167,0.009990141,0.00002745979,0.000012794308,0.000020234782,0.00012586194,0.00003562451,0.0019696008],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99996686,0.000010802502,0.0000018032628,0.0000044758926,0.000010924796,0.000005104464],"domain_scores_gemma":[0.99989164,0.000043909986,0.000032212727,0.00001305191,0.000010802968,0.0000083788655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110881,0.00026586402,0.00009984135,0.00021560214,0.00007239124,0.00015336645,0.000120504315,0.00020053612,0.00058042683],"category_scores_gemma":[0.00062209385,0.000110107845,0.00014406783,0.00018351806,0.00024912631,0.0001932397,0.00010846568,0.00031070944,0.0001275239],"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.0013932426,0.00015736323,0.0010162853,0.00008007025,0.000051100353,0.00035231042,0.00007717608,0.016842304,0.9311416,0.0035120943,0.00044299182,0.04493341],"study_design_scores_gemma":[0.00012054012,0.0012560869,0.034854885,0.000024402558,0.00013460951,0.0021345841,0.00014600177,0.29286024,0.6529654,0.013346521,0.0021003133,0.000056360463],"about_ca_topic_score_codex":0.0006385822,"about_ca_topic_score_gemma":0.0012492638,"teacher_disagreement_score":0.0006385822,"about_ca_system_score_codex":0.00013101855,"about_ca_system_score_gemma":0.00013615105,"threshold_uncertainty_score":0.0019417405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006605835,0.00020356428,0.9924936,0.000049818682,0.000023336279,0.000051670115,0.00003918055,0.00026683405,0.00026604105],"genre_scores_gemma":[0.13474798,0.00039723964,0.8629801,0.00004564805,0.00007495219,0.0002828105,0.00026793458,0.00010855485,0.0010948131],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954635,0.00018750233,0.000024113608,0.000064189175,0.00014228257,0.000035640187],"domain_scores_gemma":[0.99953234,0.00020144867,0.000046984125,0.00007763923,0.0001154324,0.00002620183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010021013,0.00072823116,0.0005457342,0.0016392143,0.00041906047,0.0004899176,0.0006915794,0.0004898641,0.001278651],"category_scores_gemma":[0.0021422654,0.00023986312,0.000921827,0.0011282917,0.00049774745,0.000507409,0.00060453534,0.00075505726,0.00059642683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026942187,0.00013784364,0.0023303726,0.00018808947,0.00027644724,0.0003262779,0.0003897832,0.082797185,0.05544313,0.028293595,0.0036772701,0.8258707],"study_design_scores_gemma":[0.000025364036,0.0001512863,0.004794366,0.000028108807,0.00006249893,0.00020985704,0.00011025496,0.94128716,0.0155221755,0.03128303,0.006468501,0.000057407622],"about_ca_topic_score_codex":0.0024775467,"about_ca_topic_score_gemma":0.0024871354,"teacher_disagreement_score":0.0024775467,"about_ca_system_score_codex":0.00029868403,"about_ca_system_score_gemma":0.0006117028,"threshold_uncertainty_score":0.0052996874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082639925,0.00024843705,0.91612536,0.0001521711,0.00003194048,0.00002510221,0.00003889757,0.00012402043,0.00061417196],"genre_scores_gemma":[0.5911421,0.00073740166,0.40454036,0.00007193329,0.00008969591,0.000040566723,0.00014003403,0.000035351793,0.0032025801],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998173,0.000026693579,0.000009836336,0.00003711087,0.00009305332,0.000015983027],"domain_scores_gemma":[0.99950063,0.00024957638,0.0000877542,0.00008918741,0.000055746885,0.000017046097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032710028,0.0005331803,0.00047076694,0.00054184376,0.00023362761,0.0005542561,0.0005620158,0.0008950432,0.00061538536],"category_scores_gemma":[0.001578858,0.0002194837,0.00034175627,0.0003830036,0.0011165049,0.0014200797,0.0009564939,0.0005300311,0.0003687274],"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.00040488914,0.00012889254,0.0014747961,0.0005291594,0.00007654239,0.0010700624,0.00038098567,0.22753976,0.3912727,0.037677024,0.0006120104,0.3388331],"study_design_scores_gemma":[0.000025647716,0.0001783766,0.00056275155,0.000026614649,0.000024775876,0.00058253476,0.00013407796,0.77265936,0.20444892,0.019393148,0.0019250296,0.00003879088],"about_ca_topic_score_codex":0.00030052065,"about_ca_topic_score_gemma":0.00033020938,"teacher_disagreement_score":0.0008950432,"about_ca_system_score_codex":0.00017694614,"about_ca_system_score_gemma":0.00035356564,"threshold_uncertainty_score":0.0020586848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065097786,0.00006491065,0.99293476,0.000018613448,0.000008229373,0.000008659608,0.000008317967,0.0001949069,0.00025189942],"genre_scores_gemma":[0.25955397,0.00024538723,0.7374977,0.00006389708,0.000029057634,0.00009333099,0.00011910663,0.000063794665,0.00233379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996567,0.00011615199,0.00001759612,0.00005005984,0.0001227637,0.000036696692],"domain_scores_gemma":[0.99942553,0.0002762193,0.000071168826,0.0000922052,0.00011625356,0.000018699584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043286497,0.0005168774,0.0006131571,0.0002906393,0.00030079094,0.0004560183,0.00056755636,0.0006576185,0.00074693776],"category_scores_gemma":[0.0018724244,0.00025984953,0.00043486984,0.00042741527,0.0004499652,0.00078071817,0.00062536576,0.0006548146,0.0005065968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018371583,0.00008173188,0.0006878318,0.00009852665,0.00006734465,0.000093099545,0.00017947836,0.64882743,0.040213082,0.015797788,0.0009970779,0.29277292],"study_design_scores_gemma":[0.0000057471602,0.00002995226,0.0001050648,0.0000025099223,0.000004699669,0.000035828336,0.0000056573626,0.9931763,0.004720667,0.0014836031,0.00041981915,0.000010238945],"about_ca_topic_score_codex":0.0018854638,"about_ca_topic_score_gemma":0.0027271074,"teacher_disagreement_score":0.0018854638,"about_ca_system_score_codex":0.00024159394,"about_ca_system_score_gemma":0.0006534505,"threshold_uncertainty_score":0.003749013},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3655579,0.006929472,0.61965793,0.00059039815,0.00022000425,0.00019752911,0.00058261753,0.0020853973,0.004178775],"genre_scores_gemma":[0.7848,0.002922688,0.21034949,0.00011950882,0.00017492667,0.00015220548,0.0005504514,0.00034353265,0.00058713835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916756,0.0005243392,0.000032148782,0.00010849925,0.00011945963,0.000047939793],"domain_scores_gemma":[0.9986498,0.0010132835,0.00006854892,0.0001096483,0.00012877042,0.000029951116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024356851,0.0007711778,0.00057007687,0.00170423,0.00017672712,0.00060741615,0.00024989044,0.0005290449,0.0006700449],"category_scores_gemma":[0.004802828,0.00018324667,0.0008101202,0.0011824284,0.00041876154,0.00070492644,0.00034434776,0.00037329973,0.00023383442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021980724,0.00021214398,0.01593255,0.001180852,0.001969736,0.0006044584,0.00042679496,0.07054852,0.08702362,0.0033416164,0.0031820668,0.81337965],"study_design_scores_gemma":[0.00022155955,0.001161682,0.2229558,0.00013522292,0.0011264886,0.0020040178,0.00022875659,0.7228167,0.027742382,0.0153599875,0.005995035,0.00025238644],"about_ca_topic_score_codex":0.0017372825,"about_ca_topic_score_gemma":0.0034698907,"teacher_disagreement_score":0.0024356851,"about_ca_system_score_codex":0.0002436927,"about_ca_system_score_gemma":0.00045244696,"threshold_uncertainty_score":0.012881279},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009467502,0.0001737498,0.9896881,0.00017363651,0.000018861236,0.000011334341,0.00006116953,0.00022736992,0.00017836531],"genre_scores_gemma":[0.5280749,0.000653794,0.467176,0.00020551383,0.00019663302,0.00011914862,0.00046002545,0.00041041838,0.0027035468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994831,0.0002611835,0.000039824838,0.000089215704,0.00008187338,0.000044827542],"domain_scores_gemma":[0.9957048,0.003464688,0.00016272896,0.00035721337,0.00024474517,0.000065846965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023363214,0.0006240984,0.00092742953,0.00070033496,0.00035103326,0.0010178966,0.0014435758,0.0011286992,0.001848999],"category_scores_gemma":[0.016482677,0.0009655512,0.00079361605,0.0008929303,0.00095033646,0.0025069807,0.0016128747,0.001682382,0.00037365864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007234229,0.00012959514,0.0016173992,0.00030317993,0.00023185698,0.0001758808,0.0002731895,0.6309895,0.028470812,0.07112864,0.0025563273,0.26340014],"study_design_scores_gemma":[0.000011423644,0.000007856539,0.00028565974,0.0000040805894,0.0000075795706,0.000018464778,0.0000064860815,0.963538,0.0023490684,0.033514865,0.0002477381,0.000008762136],"about_ca_topic_score_codex":0.0037292284,"about_ca_topic_score_gemma":0.004188586,"teacher_disagreement_score":0.0037292284,"about_ca_system_score_codex":0.00046129467,"about_ca_system_score_gemma":0.000866101,"threshold_uncertainty_score":0.012355804},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6689777,0.00024565193,0.3282003,0.0000819983,0.00006184559,0.00014543136,0.0004667355,0.0005265028,0.0012938209],"genre_scores_gemma":[0.9384866,0.00012461843,0.059633985,0.00007396985,0.000024922732,0.0001989931,0.0007226303,0.00012804853,0.0006062994],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986583,0.000669044,0.00011350346,0.0001503503,0.00034340806,0.00006543854],"domain_scores_gemma":[0.9967135,0.0018538247,0.0002012871,0.00040707088,0.000752766,0.000071571405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023864408,0.00047129497,0.00034533007,0.0005167447,0.00016127445,0.0003354291,0.00041095706,0.0005402824,0.0012407358],"category_scores_gemma":[0.017246405,0.00014859145,0.00027778218,0.0002777904,0.0005581016,0.0005028129,0.00067747664,0.00026890272,0.0004662421],"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.0020022062,0.00014828469,0.010127836,0.00043525329,0.00012943812,0.0005348897,0.0004161106,0.012200928,0.84759235,0.001273863,0.0003618108,0.12477697],"study_design_scores_gemma":[0.00020599662,0.0029105905,0.124180876,0.00006282302,0.00013519282,0.0033674529,0.00018608452,0.13172957,0.7314574,0.0024466717,0.0032140673,0.00010331771],"about_ca_topic_score_codex":0.0004484684,"about_ca_topic_score_gemma":0.00045963874,"teacher_disagreement_score":0.0023864408,"about_ca_system_score_codex":0.00012238727,"about_ca_system_score_gemma":0.00032631538,"threshold_uncertainty_score":0.012620807},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033984755,0.0000333103,0.99614316,0.000021640231,0.000011013165,0.000010801913,0.000007290186,0.00017662301,0.00019780839],"genre_scores_gemma":[0.34571204,0.00025745307,0.65218,0.000095595635,0.000071905546,0.00015894083,0.00012857017,0.00007406747,0.0013214417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902797,0.00029318233,0.000048668393,0.00012648999,0.00044374628,0.000059917977],"domain_scores_gemma":[0.9975331,0.0014011135,0.00026952918,0.00028789105,0.0004468663,0.0000614765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009253799,0.00074109616,0.00072910887,0.0004862322,0.0004802798,0.0006428423,0.0006151954,0.000817412,0.0013098906],"category_scores_gemma":[0.0053210994,0.0003483149,0.00040035852,0.00042218762,0.0010065961,0.0014635315,0.0009906952,0.001318199,0.000594695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068969215,0.00017258016,0.0023375705,0.00030528737,0.00009366257,0.000268077,0.0003315004,0.43041092,0.08501127,0.037834074,0.0032758815,0.43926957],"study_design_scores_gemma":[0.000009629291,0.000038254726,0.00020057923,0.000005380381,0.0000058275186,0.0000732276,0.0000059965964,0.9838997,0.013197433,0.0021769474,0.00036956504,0.000017393975],"about_ca_topic_score_codex":0.0009067903,"about_ca_topic_score_gemma":0.0009969367,"teacher_disagreement_score":0.0013098906,"about_ca_system_score_codex":0.00036124035,"about_ca_system_score_gemma":0.0009093778,"threshold_uncertainty_score":0.004893899},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013007774,0.00024205465,0.99803585,0.000048227983,0.000014207521,0.000008894876,0.0000140288275,0.00007810404,0.00025780938],"genre_scores_gemma":[0.113315135,0.0018314408,0.8821655,0.00008893581,0.00016329727,0.00014997555,0.00023624903,0.00008288962,0.0019665053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950135,0.00018026418,0.000022272447,0.000069654096,0.00019376371,0.00003264734],"domain_scores_gemma":[0.9989391,0.0006739109,0.00010308078,0.00009327283,0.00016780241,0.000022832324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090145756,0.0007212651,0.0007262048,0.0007986397,0.0003844231,0.0005238778,0.00068977225,0.0008538736,0.0016293188],"category_scores_gemma":[0.003734391,0.00032553298,0.0005769545,0.0013606702,0.0006990164,0.0012845063,0.0011270221,0.0015183216,0.00065802294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012766378,0.000070485024,0.00046888692,0.0003401283,0.00008950724,0.00007627414,0.00017004971,0.39265966,0.020067442,0.12483733,0.0038095505,0.45728305],"study_design_scores_gemma":[0.000013818322,0.000034674715,0.00013055373,0.00001351016,0.0000097687625,0.000056393994,0.000016533935,0.96031135,0.0032035718,0.03353093,0.0026638042,0.000015129405],"about_ca_topic_score_codex":0.0011317434,"about_ca_topic_score_gemma":0.0011185787,"teacher_disagreement_score":0.0016293188,"about_ca_system_score_codex":0.00033997901,"about_ca_system_score_gemma":0.0008117874,"threshold_uncertainty_score":0.0054506063},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004514411,0.00023014746,0.9979182,0.00009490261,0.000027841828,0.0000062707204,0.000013112674,0.0000386268,0.0012194822],"genre_scores_gemma":[0.22952108,0.0055835554,0.74281645,0.0007341646,0.001110511,0.00021377618,0.00026189233,0.00026694566,0.0194916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987565,0.0004433013,0.0000694793,0.0002736839,0.00037846115,0.000078432764],"domain_scores_gemma":[0.9975752,0.00158815,0.0001379566,0.0002745162,0.00037940833,0.000044755925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024000655,0.0011869253,0.000751956,0.0014211865,0.00040021905,0.0013657017,0.0015488924,0.0014265716,0.0031573214],"category_scores_gemma":[0.009271683,0.00054997724,0.0008475549,0.0010814756,0.0014418509,0.003152515,0.0017265552,0.0026651542,0.0012418217],"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.000054084023,0.00003589839,0.00037871464,0.00016783162,0.000067488305,0.00016145028,0.00011906856,0.19524027,0.0058336067,0.71515965,0.0016175086,0.08116442],"study_design_scores_gemma":[0.00001306899,0.000056341178,0.00019328248,0.00004690171,0.000025398374,0.00023652935,0.000023103483,0.6816433,0.0022978936,0.30425864,0.011160185,0.000045302764],"about_ca_topic_score_codex":0.0010402274,"about_ca_topic_score_gemma":0.0007362861,"teacher_disagreement_score":0.0031573214,"about_ca_system_score_codex":0.0006885782,"about_ca_system_score_gemma":0.00068378286,"threshold_uncertainty_score":0.012692928},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46981537,0.0034455522,0.52166677,0.00015228688,0.000105617306,0.00014660938,0.00017410195,0.00038988842,0.0041037505],"genre_scores_gemma":[0.81521755,0.002279316,0.18067539,0.00010450184,0.00009005142,0.000108247055,0.00014767692,0.00006295884,0.001314237],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998222,0.000052409487,0.000012141299,0.000038321592,0.00006100207,0.000013891848],"domain_scores_gemma":[0.9992786,0.00051368144,0.000053536558,0.0000686051,0.00006072356,0.00002491465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043899997,0.00031764354,0.00016512559,0.0003189672,0.00012028011,0.00040526866,0.0003394681,0.0005153249,0.001570612],"category_scores_gemma":[0.0017669703,0.00012901647,0.00016589748,0.00023910301,0.0005532248,0.00091144367,0.00042137603,0.00045498877,0.0003221738],"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.00021850508,0.00003561616,0.0004322444,0.00023032891,0.000011264117,0.00016133388,0.00007605053,0.00076993933,0.93125594,0.0010646534,0.000087163506,0.065657],"study_design_scores_gemma":[0.00011643056,0.0017359514,0.04145137,0.00011298233,0.00009215652,0.0033379793,0.00027339652,0.041943293,0.891804,0.012524975,0.0065075774,0.00009990091],"about_ca_topic_score_codex":0.00014264442,"about_ca_topic_score_gemma":0.0002837719,"teacher_disagreement_score":0.001570612,"about_ca_system_score_codex":0.00008508655,"about_ca_system_score_gemma":0.00014453483,"threshold_uncertainty_score":0.005254209},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32391688,0.0005865176,0.6600546,0.0019584252,0.00035896176,0.00034345494,0.0012039979,0.00044587153,0.011131215],"genre_scores_gemma":[0.9218427,0.00022427547,0.07346965,0.00047088164,0.0002469299,0.00067560957,0.0010490133,0.00016893171,0.0018520327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9540356,0.02898365,0.0027745988,0.0062302267,0.0066551166,0.0013208201],"domain_scores_gemma":[0.6654591,0.28515875,0.013558775,0.022778997,0.009474902,0.0035695424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04298334,0.0013163678,0.00252637,0.004312894,0.0017743803,0.003672727,0.0031649137,0.003427121,0.008302976],"category_scores_gemma":[0.23576827,0.00081562006,0.0025327106,0.0037506516,0.009020603,0.00803245,0.0042198277,0.0041738045,0.0011565496],"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.0058669834,0.0009661193,0.20841233,0.0010082086,0.0022922058,0.0027804659,0.0033223908,0.04544398,0.007998438,0.56368566,0.008663004,0.14956015],"study_design_scores_gemma":[0.0009960739,0.0028783707,0.11320491,0.0003486827,0.00062798295,0.0044383123,0.002908277,0.2431624,0.0038842757,0.6187706,0.008326546,0.00045356795],"about_ca_topic_score_codex":0.0014386442,"about_ca_topic_score_gemma":0.0009251438,"teacher_disagreement_score":0.04298334,"about_ca_system_score_codex":0.0009798192,"about_ca_system_score_gemma":0.0030908803,"threshold_uncertainty_score":0.22732031},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013824762,0.00032121973,0.9954124,0.000093828334,0.000056907156,0.0000481472,0.00003263378,0.00028955677,0.0023627628],"genre_scores_gemma":[0.058253,0.0008855574,0.9345403,0.00015575557,0.00010618386,0.0002211258,0.00019392913,0.00011094805,0.005533164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945825,0.00012804396,0.000041067775,0.000086930704,0.00024811912,0.000037436414],"domain_scores_gemma":[0.9994654,0.00017987817,0.000046541634,0.00008395145,0.0001946227,0.000029610337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074182573,0.0012467022,0.000694108,0.00088122784,0.00043360278,0.00096590444,0.00082661834,0.0010844211,0.005185301],"category_scores_gemma":[0.0022347409,0.00048516528,0.00056576595,0.000966647,0.0006346872,0.0011599858,0.0010255104,0.0011968839,0.003539265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017135378,0.000077396835,0.00055714505,0.00032603327,0.00007736982,0.000093166724,0.00009362614,0.115801536,0.038130615,0.10422733,0.008104553,0.73233986],"study_design_scores_gemma":[0.00010622761,0.00013393576,0.00057861046,0.000073758834,0.000028868842,0.0004135214,0.000036273374,0.89781934,0.01872658,0.049809385,0.032209344,0.00006410405],"about_ca_topic_score_codex":0.0009674347,"about_ca_topic_score_gemma":0.0014625306,"teacher_disagreement_score":0.005185301,"about_ca_system_score_codex":0.00050475437,"about_ca_system_score_gemma":0.0007284314,"threshold_uncertainty_score":0.017346561},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067670355,0.0003433963,0.9920936,0.00004936119,0.000029821302,0.000013209367,0.000026030753,0.0002903161,0.0003872308],"genre_scores_gemma":[0.13930249,0.0012870053,0.85703903,0.00014994781,0.00010082565,0.00006196979,0.00015498706,0.00015468228,0.0017491115],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996172,0.000113691785,0.000021132677,0.00006875203,0.00016123241,0.000017957664],"domain_scores_gemma":[0.99895275,0.00053035025,0.00012207401,0.00010403047,0.0002579793,0.00003279063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007059883,0.0009836311,0.00044012896,0.0011526835,0.0003091708,0.0007491122,0.0006200614,0.0016023834,0.0010174147],"category_scores_gemma":[0.0030930452,0.00041859652,0.00027750077,0.0015512103,0.000421,0.00127013,0.00054363156,0.0008423196,0.00097002595],"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.0005663473,0.00011773484,0.0013480788,0.00053531764,0.00009474092,0.00018213803,0.00013785169,0.018684557,0.4639248,0.0076544085,0.0013321635,0.5054219],"study_design_scores_gemma":[0.00011402166,0.00033627154,0.004064769,0.000121050834,0.0001342443,0.0011920689,0.000066303626,0.53463113,0.44181627,0.006781373,0.010628981,0.00011355515],"about_ca_topic_score_codex":0.0010966146,"about_ca_topic_score_gemma":0.00142633,"teacher_disagreement_score":0.0016023834,"about_ca_system_score_codex":0.00017891279,"about_ca_system_score_gemma":0.00047446243,"threshold_uncertainty_score":0.003733635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016660856,0.00053700025,0.9792336,0.00015267174,0.000041877916,0.00003963564,0.000026049602,0.00013252211,0.0031757117],"genre_scores_gemma":[0.6793293,0.0024836496,0.30968836,0.0003141839,0.00024894747,0.00042519765,0.00033587712,0.00059413264,0.006580358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967423,0.0015169302,0.0001585415,0.0004370405,0.00094217714,0.00020308924],"domain_scores_gemma":[0.9660954,0.025495699,0.0016230954,0.0017332386,0.004518333,0.000534254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010211498,0.0012218532,0.00142819,0.0017513395,0.00087859354,0.0013724694,0.0011818964,0.0015054317,0.0018508399],"category_scores_gemma":[0.054355133,0.00062180037,0.0010786544,0.0011352737,0.0037241988,0.0036151148,0.0031379606,0.0028189432,0.00085759663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003477631,0.000063227475,0.0031079184,0.00025649977,0.000111759546,0.0001986931,0.0006001752,0.62643623,0.012022779,0.29357603,0.0013865486,0.061892424],"study_design_scores_gemma":[0.00000844545,0.000066749555,0.00024279278,0.000027150132,0.0000087453545,0.00007639821,0.000020409132,0.9742042,0.0019511889,0.022810094,0.0005611687,0.000022656743],"about_ca_topic_score_codex":0.0019186868,"about_ca_topic_score_gemma":0.0006848123,"teacher_disagreement_score":0.010211498,"about_ca_system_score_codex":0.0009487713,"about_ca_system_score_gemma":0.0013491792,"threshold_uncertainty_score":0.054004192},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00846638,0.00014866363,0.9908076,0.00008908125,0.00001650187,0.000013900195,0.000051570336,0.00018161589,0.00022466344],"genre_scores_gemma":[0.29698876,0.0006525688,0.69925785,0.00010339544,0.00012081837,0.00017944667,0.0010591495,0.00008690841,0.0015510547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994991,0.00018481017,0.000035306843,0.000093893694,0.00014619633,0.000040755058],"domain_scores_gemma":[0.9985066,0.0007411323,0.00014338946,0.00020902234,0.00035378255,0.00004603696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010959844,0.0005167742,0.0008197348,0.00086739234,0.00033952622,0.0005447512,0.0006648055,0.00076794456,0.0010050922],"category_scores_gemma":[0.004063027,0.0002498728,0.00058742205,0.0012322529,0.00045746588,0.0008319768,0.000668767,0.00096834725,0.00056163664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029150237,0.00015604828,0.0018649651,0.00020042738,0.00015297472,0.000096329815,0.00016726983,0.41591138,0.030431677,0.01814425,0.005120583,0.52746254],"study_design_scores_gemma":[0.0000065157315,0.000026079635,0.00029319426,0.00000541541,0.0000065470126,0.00002345528,0.000010284369,0.99333596,0.0023013474,0.0033869727,0.0005974165,0.0000067700566],"about_ca_topic_score_codex":0.002163248,"about_ca_topic_score_gemma":0.0023752926,"teacher_disagreement_score":0.002163248,"about_ca_system_score_codex":0.00036591673,"about_ca_system_score_gemma":0.0006699249,"threshold_uncertainty_score":0.005796194},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39343163,0.0027163064,0.59715253,0.00044298355,0.00019645038,0.00020700574,0.00012714758,0.00025158253,0.0054743807],"genre_scores_gemma":[0.83927745,0.0019775263,0.15517817,0.000089163725,0.00010416266,0.00010216317,0.00014691867,0.00002947565,0.0030950243],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974936,0.000086477274,0.00001793231,0.0000398911,0.00008920602,0.000017131639],"domain_scores_gemma":[0.99863064,0.00082758866,0.000061011528,0.00009563338,0.00034556093,0.0000394901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004958986,0.00031151055,0.0003890399,0.00026212583,0.00025825473,0.00033138634,0.00024404869,0.0004996443,0.001237526],"category_scores_gemma":[0.0032398722,0.000099219025,0.0004043051,0.00034978657,0.00027830093,0.0005002319,0.00021320324,0.0002611943,0.00023305252],"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.0012319955,0.00060048647,0.009606966,0.0024326001,0.00027092855,0.0027837537,0.0009736453,0.1875572,0.37910303,0.011264001,0.0033584163,0.400817],"study_design_scores_gemma":[0.0000802109,0.0025672936,0.015367519,0.00010580037,0.00010762812,0.0021446142,0.00038160704,0.8482544,0.11887645,0.003785182,0.008256744,0.000072623145],"about_ca_topic_score_codex":0.0012103538,"about_ca_topic_score_gemma":0.001156105,"teacher_disagreement_score":0.001237526,"about_ca_system_score_codex":0.00010132163,"about_ca_system_score_gemma":0.0002877742,"threshold_uncertainty_score":0.0041399},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029759778,0.000041593128,0.99913776,0.000013565371,0.000014690454,0.00001544592,0.0000075589764,0.0001976107,0.00027423757],"genre_scores_gemma":[0.014505875,0.0001260808,0.9829959,0.00002624993,0.000023711806,0.00013688029,0.00007312978,0.00016248086,0.0019496485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995592,0.00012385414,0.000023453777,0.00006891371,0.00020499255,0.000019532034],"domain_scores_gemma":[0.9995204,0.00022338296,0.00003082504,0.00007125524,0.0001363601,0.00001774404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010248193,0.0012438259,0.0007603025,0.000753714,0.0005436544,0.0004927309,0.0008529193,0.0008339122,0.0050784224],"category_scores_gemma":[0.002303791,0.00043598367,0.0009309674,0.0005959257,0.0005025745,0.0008016637,0.00096619636,0.0021149826,0.0034987873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013796939,0.00010766155,0.00025760676,0.0003399312,0.00010644704,0.00018179057,0.0002157195,0.15910259,0.07069819,0.09313789,0.0065731183,0.669141],"study_design_scores_gemma":[0.000023494877,0.000072278344,0.0002170207,0.000020450874,0.000015097501,0.00022659486,0.000012900751,0.95808345,0.018790742,0.012293196,0.01019959,0.00004522205],"about_ca_topic_score_codex":0.0014128139,"about_ca_topic_score_gemma":0.001953362,"teacher_disagreement_score":0.0050784224,"about_ca_system_score_codex":0.0003199598,"about_ca_system_score_gemma":0.0009250222,"threshold_uncertainty_score":0.016989052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10427525,0.001112193,0.8877987,0.00012124957,0.00007854051,0.00012076466,0.00020696022,0.0010735056,0.0052127736],"genre_scores_gemma":[0.45401222,0.0014415019,0.5402234,0.00006971674,0.00008952123,0.00015677743,0.0003408093,0.00014166147,0.0035244257],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998764,0.000021106449,0.00000541782,0.000021102747,0.000065715525,0.000010334161],"domain_scores_gemma":[0.99963796,0.00020342515,0.000032245767,0.00003246271,0.00007802639,0.00001581361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022021505,0.0003028677,0.00021206909,0.0011835244,0.00017797545,0.0003508053,0.00020764774,0.00035457828,0.0024398584],"category_scores_gemma":[0.0011671621,0.00009334404,0.0001430869,0.0009269476,0.00023995027,0.0005314144,0.00025495392,0.0003253465,0.00058156234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019133835,0.000033144734,0.0005217893,0.00020245275,0.00001911792,0.0002739797,0.00007688968,0.0031366097,0.71262467,0.0024154345,0.0005828496,0.27992174],"study_design_scores_gemma":[0.00006942574,0.0006604209,0.034972653,0.000089360525,0.000079287434,0.005159541,0.0001602949,0.27472013,0.6613655,0.0074075735,0.015214785,0.00010096473],"about_ca_topic_score_codex":0.00031133747,"about_ca_topic_score_gemma":0.0004895082,"teacher_disagreement_score":0.0024398584,"about_ca_system_score_codex":0.00010909252,"about_ca_system_score_gemma":0.00015879239,"threshold_uncertainty_score":0.008162141},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.934468,0.0001819946,0.063012205,0.00009234946,0.000030396284,0.00008339896,0.00011402896,0.000314718,0.0017028142],"genre_scores_gemma":[0.97971535,0.0000904154,0.019129043,0.00003029198,0.000009456805,0.00006055158,0.00013160621,0.00001918499,0.0008141838],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998934,0.00047050632,0.0000974525,0.00013724576,0.00023148111,0.00012938437],"domain_scores_gemma":[0.9942444,0.0038869015,0.0002490098,0.00036781357,0.0011137169,0.00013813011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017488085,0.00056838786,0.0005716518,0.0005290514,0.00037319356,0.00042561346,0.00057573855,0.00090113847,0.0015038362],"category_scores_gemma":[0.005703689,0.00022595235,0.00020472951,0.00044604743,0.00054916844,0.00076269277,0.00039768367,0.00032833847,0.00030393447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012081828,0.0013277734,0.00831505,0.00067635474,0.00039156378,0.00044866878,0.00058113184,0.33384562,0.5294366,0.005103965,0.0008346838,0.10695687],"study_design_scores_gemma":[0.00059754634,0.007993779,0.0045202402,0.000054667165,0.00016143479,0.00041943224,0.00014516119,0.41385898,0.5701252,0.00074454944,0.0013064783,0.000072464034],"about_ca_topic_score_codex":0.00075007806,"about_ca_topic_score_gemma":0.0005852562,"teacher_disagreement_score":0.0017488085,"about_ca_system_score_codex":0.00035011335,"about_ca_system_score_gemma":0.0002656917,"threshold_uncertainty_score":0.0092487335},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016839974,0.0017079884,0.0014099373,0.040661853,0.95100975,0.000040412815,0.0006115491,0.0005408529,0.0038492682],"genre_scores_gemma":[0.014527906,0.011731765,0.008678995,0.11028224,0.57206506,0.00044466823,0.0025107935,0.0016580786,0.27810052],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99727887,0.00045371806,0.00061582256,0.00047241774,0.0009968713,0.00018231598],"domain_scores_gemma":[0.97892123,0.0039497707,0.00070098374,0.0013301466,0.0143519305,0.0007459201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002727835,0.0027910501,0.0018448085,0.0031322218,0.0024435346,0.0022822763,0.0028308884,0.0054532457,0.025138434],"category_scores_gemma":[0.034723677,0.0008564668,0.0015440519,0.0019380611,0.0021570607,0.0017585199,0.0013566144,0.006976116,0.02393789],"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.000017885737,0.000008410969,0.0000618553,0.000080737016,0.0000064819933,0.00017292265,0.000011294796,0.00005052177,0.000035831006,0.00046168393,0.9922267,0.0068657724],"study_design_scores_gemma":[0.00004369225,0.00007364772,0.0030812782,0.0004200659,0.00005797072,0.0012722643,0.000084722094,0.0009855897,0.0007430719,0.0031947237,0.98996454,0.00007841605],"about_ca_topic_score_codex":0.026426569,"about_ca_topic_score_gemma":0.032137625,"teacher_disagreement_score":0.026426569,"about_ca_system_score_codex":0.0039280234,"about_ca_system_score_gemma":0.002901546,"threshold_uncertainty_score":0.08409643},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056734453,0.0002319564,0.993523,0.00006226676,0.00003671865,0.000009222096,0.000013494788,0.00006118874,0.0003885928],"genre_scores_gemma":[0.2549163,0.0005841586,0.7394645,0.00012002989,0.000106438594,0.00010575613,0.00008440971,0.00004770518,0.0045707263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992582,0.00018126972,0.00004914598,0.00014017486,0.00031071113,0.000060452894],"domain_scores_gemma":[0.9988814,0.00047932102,0.0000598587,0.00007546885,0.0004797438,0.0000241328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011793852,0.00051800394,0.00075110805,0.0006409229,0.00061241916,0.00083912123,0.0010194761,0.0014336604,0.0012648435],"category_scores_gemma":[0.004068694,0.00033543806,0.00059919653,0.00093120994,0.0007106237,0.0011795408,0.00057504594,0.0012013299,0.00032807936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005334072,0.00010290486,0.00044902693,0.00018559709,0.0001529567,0.000074503354,0.00014949727,0.6240348,0.019473126,0.044241827,0.0025879547,0.30801436],"study_design_scores_gemma":[0.000008997184,0.000014225076,0.00014070729,0.0000045769116,0.00001204465,0.000017944936,0.0000050515614,0.9923666,0.002220233,0.004805995,0.00038810886,0.000015440834],"about_ca_topic_score_codex":0.011969362,"about_ca_topic_score_gemma":0.013074729,"teacher_disagreement_score":0.011969362,"about_ca_system_score_codex":0.0008583157,"about_ca_system_score_gemma":0.0015773088,"threshold_uncertainty_score":0.02379936},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06033,0.0015712542,0.9339587,0.0003556742,0.00025481716,0.00015193134,0.00048726666,0.001632223,0.0012580372],"genre_scores_gemma":[0.30623174,0.001366658,0.6884344,0.00030737123,0.00013217225,0.00023152021,0.0014630854,0.00041335472,0.0014196215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933773,0.00014279086,0.00006459239,0.00013915215,0.00023329037,0.00008245278],"domain_scores_gemma":[0.9985512,0.0005284814,0.00018115771,0.00033450092,0.00037273575,0.00003192626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013992805,0.0011615139,0.00077235827,0.0009393311,0.00044109626,0.00097177614,0.0009381562,0.00086762256,0.0013117802],"category_scores_gemma":[0.006682946,0.00042299248,0.0006756281,0.0015568496,0.0006214929,0.00080294086,0.0004392645,0.001217379,0.00065489224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008760912,0.00010037468,0.01413626,0.0007461703,0.00048425622,0.0011686743,0.00044574673,0.04232694,0.46096155,0.0062843314,0.0061368584,0.46633276],"study_design_scores_gemma":[0.00003326067,0.0002351865,0.07057233,0.00008459732,0.0003420922,0.0026323493,0.0002682632,0.4951211,0.40189844,0.0101317745,0.018487653,0.00019300285],"about_ca_topic_score_codex":0.0040301844,"about_ca_topic_score_gemma":0.008127933,"teacher_disagreement_score":0.0040301844,"about_ca_system_score_codex":0.00047975732,"about_ca_system_score_gemma":0.0010997473,"threshold_uncertainty_score":0.008013487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019544512,0.0002116677,0.99728596,0.00007045696,0.000015789346,0.0000088419565,0.000013935804,0.00008640688,0.00035259707],"genre_scores_gemma":[0.10564693,0.0011449307,0.89047873,0.00009905644,0.00012102667,0.00009815547,0.00018657249,0.000085696614,0.0021387734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953485,0.00016941248,0.000029523739,0.00008011031,0.00016024605,0.000025854932],"domain_scores_gemma":[0.9985323,0.0008548158,0.00010416862,0.00019626002,0.00027836798,0.00003400323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010999867,0.0005334378,0.00073503534,0.0007438142,0.00022923092,0.00066123914,0.0006963823,0.00081909844,0.0013579463],"category_scores_gemma":[0.004142223,0.00026774206,0.0005534068,0.0012748046,0.00069066684,0.00083114,0.000794557,0.001248723,0.0006243084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001314169,0.000105323394,0.0012012288,0.0003117452,0.0000988454,0.00016202645,0.00020026648,0.3247431,0.026187973,0.084830746,0.004296821,0.55773044],"study_design_scores_gemma":[0.0000056200647,0.000027760843,0.00013957013,0.00000817218,0.0000050848207,0.000056043373,0.000007991631,0.9854417,0.0021833992,0.00992069,0.0021963129,0.0000075920634],"about_ca_topic_score_codex":0.0010899854,"about_ca_topic_score_gemma":0.00087335974,"teacher_disagreement_score":0.0013579463,"about_ca_system_score_codex":0.00027401594,"about_ca_system_score_gemma":0.00037593194,"threshold_uncertainty_score":0.0058173537},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5380782,0.000656339,0.45383638,0.00061645027,0.0001268666,0.00023160379,0.00052374165,0.0016280636,0.004302351],"genre_scores_gemma":[0.93639827,0.00022863921,0.062110413,0.000047763544,0.000017333057,0.000090500995,0.0002893594,0.00014755863,0.0006700652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996575,0.00016013464,0.000026221862,0.000031647403,0.00009305895,0.000031451564],"domain_scores_gemma":[0.99263245,0.0058428235,0.00024638628,0.0002754857,0.000880299,0.00012253551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008916907,0.00093002495,0.0005399632,0.00063429953,0.00038104883,0.00065238675,0.0008223539,0.001300514,0.0012844605],"category_scores_gemma":[0.0116556855,0.0004064365,0.00040097538,0.00054777367,0.0004455829,0.00069316104,0.00052455714,0.00061143585,0.00022121824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022364859,0.00008327304,0.00047195566,0.00011321104,0.000043237134,0.00007176312,0.000063056934,0.9857001,0.0032534783,0.000963766,0.00035260915,0.008660042],"study_design_scores_gemma":[0.000028630926,0.000043913922,0.00015846589,0.0000050142353,0.000006340558,0.00002090307,0.000015666521,0.99778074,0.0015655902,0.0002768662,0.00009222691,0.0000055609976],"about_ca_topic_score_codex":0.008392532,"about_ca_topic_score_gemma":0.0044821487,"teacher_disagreement_score":0.008392532,"about_ca_system_score_codex":0.00066014007,"about_ca_system_score_gemma":0.0006882718,"threshold_uncertainty_score":0.016687393},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022419947,0.000120466,0.99698645,0.00003559362,0.000032501986,0.000011697324,0.000036258138,0.000127294,0.000407738],"genre_scores_gemma":[0.09904665,0.00045877654,0.8976691,0.000089155845,0.00010936153,0.00012126281,0.00039502667,0.0001287783,0.0019819755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993426,0.00016039076,0.000028554525,0.00014053876,0.00028722233,0.00004067355],"domain_scores_gemma":[0.9989427,0.00039028673,0.000103716986,0.00019781967,0.0003163758,0.000049138704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001039365,0.0011135569,0.0006883335,0.0010033203,0.00035652105,0.000746963,0.0006988198,0.00080531434,0.0032066677],"category_scores_gemma":[0.0039908225,0.00026288067,0.0005737962,0.0010772384,0.0005141885,0.0010190216,0.00073280354,0.0011993644,0.0015505429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023473661,0.000103967635,0.00081242615,0.0002807367,0.000060854843,0.00014647195,0.00010176991,0.074158475,0.132116,0.054477677,0.005442,0.7320649],"study_design_scores_gemma":[0.000020668032,0.00008098856,0.0010633469,0.000027975288,0.00002169127,0.00022359355,0.000030569674,0.9437692,0.023598813,0.020995721,0.01013536,0.000032042517],"about_ca_topic_score_codex":0.0013145918,"about_ca_topic_score_gemma":0.0014899083,"teacher_disagreement_score":0.0032066677,"about_ca_system_score_codex":0.00035414385,"about_ca_system_score_gemma":0.00059507,"threshold_uncertainty_score":0.010727406},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011442301,0.00013688908,0.9976386,0.00004169824,0.000062300416,0.000058785045,0.000028793316,0.00069432607,0.0001944503],"genre_scores_gemma":[0.010017777,0.00017165254,0.98814243,0.000052805557,0.000052043928,0.00015794593,0.00012652436,0.000098982666,0.0011797778],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999201,0.000117742486,0.00006951333,0.00014617475,0.00041868645,0.0000469083],"domain_scores_gemma":[0.99884975,0.0004175346,0.00012241557,0.00022039007,0.00034003583,0.000049888138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011564834,0.0012977485,0.00088034366,0.0013075268,0.00059593335,0.00079404487,0.0011233183,0.0013050691,0.00452936],"category_scores_gemma":[0.0030670334,0.0005191007,0.0006020078,0.001147065,0.0005622732,0.0010481577,0.00092412526,0.0017816746,0.0038860135],"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.00022280468,0.00008534947,0.0002761725,0.00030840034,0.00009417729,0.00010749868,0.0001235411,0.0056944513,0.21641974,0.0043435693,0.0041426397,0.7681816],"study_design_scores_gemma":[0.00043317713,0.00082509394,0.006668853,0.00014564989,0.00022884985,0.0030187203,0.00012798721,0.46459416,0.41651985,0.013457165,0.09369505,0.00028545214],"about_ca_topic_score_codex":0.0008091203,"about_ca_topic_score_gemma":0.0016259669,"teacher_disagreement_score":0.00452936,"about_ca_system_score_codex":0.00023259256,"about_ca_system_score_gemma":0.00088092434,"threshold_uncertainty_score":0.015152216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00949438,0.00010157724,0.9899569,0.00001754183,0.00001060301,0.000005628456,0.000005706089,0.00014431986,0.00026330855],"genre_scores_gemma":[0.45648766,0.00034145324,0.5414276,0.000032899174,0.00006837774,0.000063125844,0.000087310946,0.00009545792,0.0013960537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950457,0.00015377611,0.000033141452,0.00009900195,0.0001833095,0.000026330155],"domain_scores_gemma":[0.9990577,0.00053834164,0.0001420318,0.00009601577,0.00014779002,0.000018058661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062933704,0.00048793823,0.0006440596,0.00047925726,0.00021905491,0.00041522,0.00058156153,0.00051582465,0.0004977216],"category_scores_gemma":[0.0029127267,0.00028583716,0.0004991678,0.00033311773,0.00037380756,0.0007326591,0.00035376524,0.0006075195,0.0003038186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021191254,0.000054729844,0.00165271,0.00022523063,0.00013718478,0.00047157338,0.00023331177,0.5746897,0.07193362,0.033910286,0.0006103398,0.31586942],"study_design_scores_gemma":[0.0000040915984,0.000025650896,0.00022723798,0.000005658437,0.000009269889,0.00009408469,0.0000043200353,0.99298507,0.004415746,0.0017167544,0.00050051726,0.0000115883895],"about_ca_topic_score_codex":0.00093806646,"about_ca_topic_score_gemma":0.0009829557,"teacher_disagreement_score":0.00093806646,"about_ca_system_score_codex":0.00019846161,"about_ca_system_score_gemma":0.00035637745,"threshold_uncertainty_score":0.0033282638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007687075,0.00009011827,0.99172103,0.000030286445,0.000008798807,0.000011066647,0.000019374545,0.00010013642,0.00033218344],"genre_scores_gemma":[0.19063672,0.00023061573,0.8068714,0.000071792674,0.000040778712,0.00010345207,0.00023102206,0.00008530642,0.0017289137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992879,0.00024722234,0.000050028157,0.00009912588,0.00027136345,0.000044390683],"domain_scores_gemma":[0.9973847,0.0016761315,0.00021395145,0.0003223228,0.000328828,0.00007400052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091652374,0.00073241437,0.000877633,0.0009767574,0.00038464667,0.00074825576,0.00083134434,0.0007335439,0.0011874931],"category_scores_gemma":[0.004536601,0.0003774873,0.0005691924,0.000706966,0.0005911928,0.0020322353,0.0010760137,0.0007274013,0.0005088899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066881353,0.00012288506,0.0021692428,0.00044287863,0.00012468614,0.00024853085,0.00031351516,0.43178046,0.07329687,0.08229715,0.0020132104,0.4065218],"study_design_scores_gemma":[0.000017883474,0.00006793108,0.00026114038,0.000013221114,0.000009392015,0.00009476043,0.000020332309,0.9714353,0.0134447785,0.013616864,0.0009966092,0.000021853632],"about_ca_topic_score_codex":0.0006050031,"about_ca_topic_score_gemma":0.0008252713,"teacher_disagreement_score":0.0011874931,"about_ca_system_score_codex":0.00041195963,"about_ca_system_score_gemma":0.00059503806,"threshold_uncertainty_score":0.0048471093},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005146434,0.00039853834,0.993618,0.000036054673,0.00003622846,0.000033806205,0.00003842849,0.00035488594,0.00033757158],"genre_scores_gemma":[0.09343451,0.00063952594,0.9045405,0.00005007499,0.00007743793,0.00012150279,0.00018415843,0.0001485236,0.00080382155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958664,0.00012658873,0.000038340524,0.00007166698,0.00014927523,0.000027431723],"domain_scores_gemma":[0.99933535,0.00027519788,0.00005972962,0.00011444755,0.00019183327,0.000023542165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079574395,0.00094029494,0.0007080147,0.0011236592,0.00037651564,0.00066277955,0.00056165375,0.00063387834,0.0011330853],"category_scores_gemma":[0.003081642,0.00048673557,0.0009502446,0.0013959063,0.0003636587,0.0010165403,0.00072734203,0.00082698074,0.00068813836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005973857,0.00009248993,0.0013978842,0.00041320155,0.00025211528,0.00015954179,0.00012600576,0.030448401,0.12652345,0.00678148,0.0018096832,0.8313984],"study_design_scores_gemma":[0.00013445735,0.00034205042,0.005975749,0.000088777706,0.0002690105,0.001434071,0.00005788114,0.8794751,0.08802308,0.018039847,0.006036463,0.00012344151],"about_ca_topic_score_codex":0.00083937513,"about_ca_topic_score_gemma":0.0018431311,"teacher_disagreement_score":0.0011330853,"about_ca_system_score_codex":0.00016821046,"about_ca_system_score_gemma":0.00089629256,"threshold_uncertainty_score":0.0042083263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011235992,0.00018887212,0.9858453,0.000084297106,0.000040820138,0.00005262029,0.0000238638,0.00047136395,0.002056851],"genre_scores_gemma":[0.22423074,0.00025705853,0.7713214,0.000085408756,0.000042038035,0.00012115299,0.00006258896,0.00014223657,0.0037373363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969256,0.00007489649,0.000016508213,0.00006026717,0.00012639344,0.00002928165],"domain_scores_gemma":[0.9993734,0.00030035927,0.000082465944,0.000109470726,0.00010981328,0.000024492538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037644117,0.0006089215,0.00035224162,0.0006477433,0.0005920028,0.00043203204,0.00047020684,0.00049562973,0.00218979],"category_scores_gemma":[0.0014881096,0.00023432476,0.0003099798,0.0006417252,0.00042482588,0.00096978614,0.0007056416,0.0007166564,0.00077935454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034986297,0.000094917996,0.0005479402,0.00017899576,0.000047396872,0.00019575439,0.00020957162,0.036124244,0.29963377,0.02472814,0.0015540124,0.63633543],"study_design_scores_gemma":[0.00003847532,0.00047433417,0.0011902616,0.00005704653,0.000053210446,0.0017507798,0.00006263472,0.59830236,0.3571801,0.02131771,0.019472152,0.000100953635],"about_ca_topic_score_codex":0.00041830514,"about_ca_topic_score_gemma":0.001120839,"teacher_disagreement_score":0.00218979,"about_ca_system_score_codex":0.00022729028,"about_ca_system_score_gemma":0.0005095335,"threshold_uncertainty_score":0.0073255897},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01991911,0.00015980062,0.97174263,0.00030252212,0.000067191846,0.00006204974,0.0006748157,0.0024052197,0.0046667443],"genre_scores_gemma":[0.11741493,0.00034957903,0.87188077,0.00010573254,0.00004683882,0.00008060839,0.002575892,0.00061644963,0.0069293436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996933,0.000046630223,0.000015703212,0.00005031818,0.0001710318,0.000023099006],"domain_scores_gemma":[0.9993728,0.0001616095,0.000035884037,0.00014352314,0.00024143647,0.000044793873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006453777,0.00064210966,0.00039949635,0.0009783193,0.0003078267,0.001079563,0.00051301235,0.00066314475,0.011423136],"category_scores_gemma":[0.0023107675,0.00041817492,0.00068044476,0.0009276682,0.00026218407,0.0009297565,0.0011219793,0.00090594654,0.0042573046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005361064,0.00016417539,0.00580068,0.0001744135,0.00008521289,0.00029110513,0.00024095677,0.17849155,0.093408436,0.012645049,0.0163555,0.6918068],"study_design_scores_gemma":[0.000025606394,0.00004367699,0.0020348732,0.000015185342,0.000014489154,0.00017076312,0.000058519283,0.96494985,0.018727504,0.0033261601,0.010603278,0.000029995892],"about_ca_topic_score_codex":0.0040206215,"about_ca_topic_score_gemma":0.004763193,"teacher_disagreement_score":0.011423136,"about_ca_system_score_codex":0.00031110927,"about_ca_system_score_gemma":0.0009163871,"threshold_uncertainty_score":0.038214207},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039073337,0.0016801459,0.95602155,0.00019145633,0.0000736203,0.000032653767,0.000020578944,0.00034595933,0.0025605818],"genre_scores_gemma":[0.618224,0.0017571793,0.37581283,0.00022283256,0.00007852205,0.000051236777,0.000057623703,0.00003713823,0.0037586505],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980646,0.00003882858,0.0000093530125,0.000046545352,0.00008669253,0.000012291009],"domain_scores_gemma":[0.9996921,0.00015059381,0.00003844134,0.000030441695,0.00007632232,0.000012175686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025128236,0.0002651307,0.00029961864,0.00037698617,0.00012288462,0.00027606814,0.00035511382,0.0007013271,0.00079801516],"category_scores_gemma":[0.0009870238,0.00014749139,0.00018739246,0.00039138083,0.00037059802,0.00061433314,0.00028978073,0.00035349,0.00029538627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026712948,0.000067074216,0.0013348553,0.00027196246,0.000056163422,0.00038517872,0.00011393367,0.02971009,0.6166335,0.02313877,0.0007189617,0.32730234],"study_design_scores_gemma":[0.000032709253,0.00040597393,0.0015268697,0.000029998413,0.0000502012,0.0012515746,0.0000443489,0.69571966,0.28790438,0.005236726,0.007742867,0.000054643548],"about_ca_topic_score_codex":0.00018177931,"about_ca_topic_score_gemma":0.00019207195,"teacher_disagreement_score":0.00079801516,"about_ca_system_score_codex":0.00017791893,"about_ca_system_score_gemma":0.00013900027,"threshold_uncertainty_score":0.0026696324},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029884575,0.00013827023,0.9661347,0.000115303454,0.000058375015,0.00006693367,0.000015734606,0.00046897217,0.0031170123],"genre_scores_gemma":[0.4652358,0.0001240869,0.5307914,0.0001004324,0.000031308773,0.00030109697,0.000050229108,0.00011240421,0.0032531563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999705,0.00011725827,0.00001151029,0.000048411304,0.00008654134,0.000031189335],"domain_scores_gemma":[0.9991917,0.0005493455,0.00004782255,0.000053279844,0.0001348077,0.000023091272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070869614,0.000609196,0.0009436265,0.00065933465,0.0005847106,0.0007235021,0.00087148696,0.0014319671,0.0016628591],"category_scores_gemma":[0.0020603763,0.00060501025,0.00092624535,0.0006045345,0.00080856425,0.000726292,0.000721351,0.0009074213,0.00029198127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000442796,0.00003689337,0.00021225972,0.000021052929,0.000037124548,0.000023301687,0.00003738134,0.97472626,0.0021373606,0.003144812,0.00018669023,0.019392597],"study_design_scores_gemma":[0.000013468265,0.000015758917,0.000038429,0.0000024038109,0.000007180643,0.000006320105,0.000003776247,0.99823195,0.000602903,0.00090825354,0.00016623453,0.000003340666],"about_ca_topic_score_codex":0.0041824128,"about_ca_topic_score_gemma":0.0041787243,"teacher_disagreement_score":0.0041824128,"about_ca_system_score_codex":0.0007127659,"about_ca_system_score_gemma":0.0010240322,"threshold_uncertainty_score":0.0083161},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023193234,0.00075209636,0.9950299,0.0005417175,0.00004936043,0.00003361335,0.000030113115,0.00011845255,0.001125238],"genre_scores_gemma":[0.1496264,0.0021264483,0.84475017,0.00041146707,0.000309035,0.00048346256,0.00021338438,0.00040257804,0.0016771149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926186,0.005490047,0.00021287445,0.00045896764,0.0010326931,0.00018687149],"domain_scores_gemma":[0.9376683,0.057559367,0.001005142,0.0017090975,0.0015931408,0.00046492787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015561046,0.0016168308,0.002303276,0.0022088648,0.0012171053,0.002742817,0.0029949427,0.00313055,0.0041214745],"category_scores_gemma":[0.07787268,0.0013433595,0.0015301913,0.0019935102,0.00369173,0.0053641,0.0031698563,0.0036658586,0.0006082637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009719589,0.0000460237,0.00062474003,0.00016950487,0.00009941432,0.000048469985,0.00023048827,0.5366112,0.0002135804,0.42111322,0.0011112518,0.039634988],"study_design_scores_gemma":[0.000018894263,0.000012702041,0.000088457855,0.000033195716,0.000008147304,0.000013363801,0.000015730287,0.777843,0.00008572533,0.22089128,0.0009719767,0.00001748744],"about_ca_topic_score_codex":0.017249703,"about_ca_topic_score_gemma":0.012672828,"teacher_disagreement_score":0.017249703,"about_ca_system_score_codex":0.003712999,"about_ca_system_score_gemma":0.0041762725,"threshold_uncertainty_score":0.082295656},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009062607,0.00011271665,0.989892,0.00003067197,0.000011965195,0.00001448221,0.0000059719923,0.00014592461,0.0007236732],"genre_scores_gemma":[0.16365917,0.00039150662,0.83323646,0.000062014355,0.000050157432,0.000072388546,0.000047288664,0.000038754995,0.0024422142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997073,0.00007709432,0.000018599354,0.000050955357,0.00012664156,0.000019418723],"domain_scores_gemma":[0.99918216,0.0003692393,0.000099806195,0.00011551969,0.00020434753,0.00002890709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049655326,0.00071585167,0.00046824996,0.00046419157,0.00026795708,0.00048025165,0.0006295636,0.0005446486,0.0009765369],"category_scores_gemma":[0.0017932276,0.00021290603,0.00035456242,0.0008038573,0.00058146863,0.0006835239,0.0005006524,0.00043470634,0.0006395412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030186758,0.00011380271,0.001264922,0.00017924915,0.00010207321,0.00016662889,0.00012955593,0.33230755,0.13837379,0.036511246,0.0013829101,0.4891664],"study_design_scores_gemma":[0.000016460112,0.000065733155,0.00027288074,0.000005685946,0.000015135854,0.00011890462,0.000007786463,0.9510104,0.043279108,0.0027724742,0.002420238,0.000015161161],"about_ca_topic_score_codex":0.0008375515,"about_ca_topic_score_gemma":0.0017220892,"teacher_disagreement_score":0.0009765369,"about_ca_system_score_codex":0.00028150377,"about_ca_system_score_gemma":0.0006836968,"threshold_uncertainty_score":0.0032668114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031468302,0.00011529402,0.99632436,0.000024055693,0.000016074535,0.0000083378645,0.000006547873,0.00013531026,0.00022314252],"genre_scores_gemma":[0.17146638,0.0006796597,0.8245202,0.00008898946,0.0000580966,0.00007634135,0.00014543202,0.00009731772,0.0028676072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996555,0.0000772568,0.000019282306,0.000086184875,0.00013843979,0.000023320157],"domain_scores_gemma":[0.9997017,0.0001335831,0.000042470256,0.000044153654,0.00006232355,0.000015763331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043824397,0.00072833593,0.0007237618,0.0007385577,0.0003287569,0.00057997205,0.0006066973,0.0007726755,0.0010420068],"category_scores_gemma":[0.0009687896,0.00033706092,0.00083555863,0.00050488935,0.000512119,0.0010648825,0.0006296262,0.0008403154,0.0007104635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004572206,0.00012065261,0.00076833746,0.00030619738,0.00019355638,0.00020930052,0.00017629274,0.20274,0.26077688,0.033550747,0.001118431,0.4995824],"study_design_scores_gemma":[0.000011526385,0.00005279054,0.00028372675,0.00000784178,0.000027248305,0.00019641711,0.000015003193,0.95877105,0.03356295,0.004171693,0.0028737406,0.000025964311],"about_ca_topic_score_codex":0.0010796249,"about_ca_topic_score_gemma":0.0011903635,"teacher_disagreement_score":0.0010796249,"about_ca_system_score_codex":0.00037320473,"about_ca_system_score_gemma":0.00054945354,"threshold_uncertainty_score":0.0034858584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96023554,0.00031769573,0.038017627,0.000083149964,0.00004590843,0.000040483686,0.0000752208,0.00010868612,0.0010756695],"genre_scores_gemma":[0.9634057,0.000431832,0.03529107,0.000049329792,0.00004090457,0.0000190031,0.00022499982,0.000095437244,0.00044167967],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984769,0.0008100614,0.000100763886,0.00009865872,0.00041816043,0.00009545494],"domain_scores_gemma":[0.98928773,0.008137448,0.00057427253,0.0005776318,0.0012187811,0.00020399387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004485405,0.00052536046,0.0005036024,0.0014310334,0.00020918643,0.00091456703,0.00022204214,0.00034746423,0.00032006903],"category_scores_gemma":[0.018116232,0.000272725,0.0008174902,0.00090939034,0.00047376985,0.0007563405,0.0004259256,0.00048145323,0.00025884784],"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.007090201,0.00036406587,0.21748239,0.00041000263,0.0007261429,0.0010902662,0.00058981153,0.0863028,0.3165824,0.00078640704,0.0010331583,0.3675423],"study_design_scores_gemma":[0.00018530292,0.0022999889,0.46734828,0.00008965621,0.0010252091,0.001645399,0.00060525077,0.40870917,0.11547878,0.0012595395,0.0011818396,0.00017162564],"about_ca_topic_score_codex":0.0011121781,"about_ca_topic_score_gemma":0.0015118956,"teacher_disagreement_score":0.004485405,"about_ca_system_score_codex":0.00018485347,"about_ca_system_score_gemma":0.00017894828,"threshold_uncertainty_score":0.023721337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031271026,0.00081161276,0.9616172,0.00027781824,0.00022594068,0.000031147938,0.000082096914,0.00047717738,0.005205934],"genre_scores_gemma":[0.7235125,0.0015229532,0.24422766,0.00019070703,0.00040136615,0.00011070197,0.00030618603,0.00012959565,0.029598277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988675,0.000034237622,0.000007535669,0.000020141431,0.000046776444,0.0000046205146],"domain_scores_gemma":[0.99964726,0.00020259472,0.000033723274,0.000040335697,0.00006691348,0.000009151724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025089024,0.00023444208,0.00039401313,0.00023904351,0.00013021969,0.0003310778,0.00017825363,0.00026962874,0.004732745],"category_scores_gemma":[0.0012117288,0.00008127901,0.00010842567,0.00017118247,0.0002693271,0.00036989295,0.00046438852,0.0002736121,0.00091956684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043279296,0.000055465,0.0012318841,0.0005748056,0.000101045356,0.00020953214,0.0001497475,0.4169951,0.11694296,0.10686874,0.01035217,0.3460858],"study_design_scores_gemma":[0.000007076236,0.000043565524,0.00031370288,0.000013230921,0.000009271637,0.000103128885,0.000005757297,0.9741726,0.009766255,0.009963064,0.0055918144,0.000010524072],"about_ca_topic_score_codex":0.00022835421,"about_ca_topic_score_gemma":0.00027652254,"teacher_disagreement_score":0.004732745,"about_ca_system_score_codex":0.00017010338,"about_ca_system_score_gemma":0.0002065337,"threshold_uncertainty_score":0.015832663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043644905,0.00007767638,0.9946291,0.000048017086,0.000019749277,0.000027551341,0.000015776157,0.00027799344,0.00053971465],"genre_scores_gemma":[0.0987268,0.00018629066,0.89807916,0.00014988187,0.000039330967,0.00016946468,0.00014099058,0.00013494033,0.0023731275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929357,0.00022505983,0.00002979442,0.00015195175,0.00025322067,0.000046348763],"domain_scores_gemma":[0.9993438,0.00035139677,0.00007128139,0.00007825034,0.00013426135,0.000021067948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014567593,0.00095177954,0.0009107136,0.0010468903,0.0003388825,0.0005510088,0.0014282472,0.0013432698,0.0017764152],"category_scores_gemma":[0.0031430481,0.00037725954,0.0007345249,0.000753499,0.00089154457,0.0010275078,0.0010115231,0.0010617033,0.0005703763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086258435,0.00006668804,0.00077035726,0.00011652082,0.000092231836,0.00009741028,0.00018197787,0.73241097,0.013351899,0.029033773,0.0015402267,0.22225171],"study_design_scores_gemma":[0.000030382773,0.00005780458,0.00012464802,0.000011465293,0.000017181284,0.00006217581,0.000012154771,0.9897441,0.0028034481,0.004964875,0.0021574025,0.000014425299],"about_ca_topic_score_codex":0.0027131734,"about_ca_topic_score_gemma":0.0021631913,"teacher_disagreement_score":0.0027131734,"about_ca_system_score_codex":0.0004946902,"about_ca_system_score_gemma":0.0011016893,"threshold_uncertainty_score":0.0077041388},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015720094,0.00012866026,0.9836676,0.00005251597,0.000007992481,0.000008712811,0.000016646405,0.0001374441,0.0002604336],"genre_scores_gemma":[0.7597466,0.00035605425,0.23719727,0.00008611158,0.00006274263,0.00006115631,0.00028200776,0.00009792706,0.0021100435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901915,0.0003761025,0.000057783942,0.00018589875,0.00027576563,0.00008524518],"domain_scores_gemma":[0.99750537,0.0013288417,0.00029046988,0.00041176865,0.00037665706,0.0000868698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015038183,0.0006056894,0.0009252036,0.0007409775,0.00024914058,0.0009578673,0.0008409399,0.00065116864,0.0008165466],"category_scores_gemma":[0.005907727,0.00027726384,0.00053323497,0.00090656185,0.0008340394,0.0015415179,0.0013153728,0.001259933,0.0003791868],"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.00029785212,0.0001271101,0.0014373241,0.00024648552,0.00009752472,0.00012594149,0.00018547903,0.5505499,0.020929951,0.073491655,0.001783386,0.35072735],"study_design_scores_gemma":[0.0000040820933,0.00002523425,0.00024985767,0.0000029506764,0.0000053560398,0.000027195054,0.000008489098,0.98827106,0.0016033702,0.0094469255,0.0003479168,0.000007533767],"about_ca_topic_score_codex":0.0010117143,"about_ca_topic_score_gemma":0.00059831486,"teacher_disagreement_score":0.0015038183,"about_ca_system_score_codex":0.00051386736,"about_ca_system_score_gemma":0.0005648798,"threshold_uncertainty_score":0.007953107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053437337,0.0009377726,0.94189435,0.00017568226,0.00015373837,0.00006547547,0.00031369238,0.00067216286,0.0023498137],"genre_scores_gemma":[0.42276987,0.0029345858,0.5674899,0.000188502,0.00033780743,0.00013649785,0.0006278878,0.0001416769,0.0053732237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998926,0.000016124353,0.000009465992,0.000025610394,0.000040311865,0.000015921065],"domain_scores_gemma":[0.99975735,0.00012601985,0.000024955867,0.000026579446,0.00004951432,0.000015632584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022617869,0.0007184884,0.0005128571,0.0009339787,0.00021231954,0.00055786624,0.00031446706,0.0008259471,0.00224156],"category_scores_gemma":[0.001129359,0.00023009609,0.0007454807,0.0010090076,0.00031563814,0.0007661665,0.0004983142,0.0004898882,0.0013249499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037962935,0.0001067191,0.0015085931,0.00048538457,0.00012523851,0.0004547481,0.00010891916,0.009416581,0.4407361,0.0022767598,0.0012962335,0.543105],"study_design_scores_gemma":[0.000116745665,0.0006192843,0.03985347,0.00019935121,0.0007622559,0.0068329517,0.00036453438,0.36229393,0.5534602,0.02247844,0.012887795,0.00013116932],"about_ca_topic_score_codex":0.00033351238,"about_ca_topic_score_gemma":0.00076120906,"teacher_disagreement_score":0.00224156,"about_ca_system_score_codex":0.00009757238,"about_ca_system_score_gemma":0.00030984328,"threshold_uncertainty_score":0.007498741},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044071055,0.00003956006,0.99481225,0.000033557284,0.000008497964,0.000009127424,0.000019355033,0.00009453355,0.0005760189],"genre_scores_gemma":[0.39233866,0.00028817976,0.6034675,0.00006964585,0.000076711694,0.00014006344,0.00024108925,0.000088925284,0.0032893321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996018,0.00010869028,0.000016142432,0.0000968738,0.00014118517,0.000035408462],"domain_scores_gemma":[0.99934334,0.00024333382,0.00009172823,0.00016490907,0.00013378581,0.000022888624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004837467,0.00075088296,0.00081479864,0.0004327866,0.00045820998,0.0005972785,0.00062218605,0.0006169995,0.0017380128],"category_scores_gemma":[0.0018226244,0.000419076,0.0006082319,0.0005802128,0.00065866293,0.0013188953,0.0010304339,0.0009150905,0.0005010809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003477192,0.00013118025,0.000570683,0.00017913363,0.00010082389,0.0000991758,0.00013602967,0.6058751,0.06971097,0.04600617,0.0022255082,0.27461755],"study_design_scores_gemma":[0.000015865626,0.000032732623,0.00014597912,0.0000047397752,0.000009350396,0.000035099198,0.0000129365435,0.9803653,0.0040512867,0.014548798,0.00076817535,0.000009807153],"about_ca_topic_score_codex":0.001532955,"about_ca_topic_score_gemma":0.0029271992,"teacher_disagreement_score":0.0017380128,"about_ca_system_score_codex":0.000323136,"about_ca_system_score_gemma":0.00075617805,"threshold_uncertainty_score":0.0058142543},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078362845,0.00037732456,0.91924095,0.000117661744,0.00004877946,0.000024910261,0.00004269252,0.00015216545,0.0016326084],"genre_scores_gemma":[0.64905745,0.0004701417,0.3484274,0.000048976694,0.00007834847,0.00003254394,0.00010532679,0.00005397135,0.0017258401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996728,0.00008958512,0.000018114777,0.00006397184,0.00012594995,0.000029550378],"domain_scores_gemma":[0.999419,0.0003483994,0.00006396908,0.00005997802,0.000083207895,0.000025577909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060886,0.00050453766,0.00046511577,0.00069193775,0.0002661356,0.0006444188,0.00037707604,0.00089022715,0.0012362312],"category_scores_gemma":[0.0034363251,0.0002648308,0.00030416815,0.00074909977,0.00045209084,0.0008180466,0.0004276612,0.0005838561,0.0002480264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002359802,0.00021414059,0.0030860177,0.00059363415,0.00015291011,0.00055779394,0.00052477285,0.16673182,0.23904693,0.04605309,0.001531911,0.53914714],"study_design_scores_gemma":[0.0000611749,0.00029873024,0.0036725146,0.00006089022,0.000059145226,0.00052161026,0.00004618895,0.9194975,0.06437219,0.009447537,0.0019244197,0.000038140446],"about_ca_topic_score_codex":0.00070162193,"about_ca_topic_score_gemma":0.00085807114,"teacher_disagreement_score":0.0012362312,"about_ca_system_score_codex":0.00031709074,"about_ca_system_score_gemma":0.00047179166,"threshold_uncertainty_score":0.0041356087},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9981437,0.000024589122,0.0007133427,0.000008968379,0.000005277168,0.0000065199442,0.00003641895,0.00001515522,0.0010461187],"genre_scores_gemma":[0.99827385,0.000020559994,0.0012417065,0.000012505636,0.00000476192,0.000010213326,0.00012489862,0.000021017431,0.0002904847],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9997615,0.00005247062,0.00002659746,0.00005905352,0.00006122887,0.00003907266],"domain_scores_gemma":[0.99895394,0.0004998431,0.00017115161,0.000103989136,0.00013493793,0.00013618471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034159695,0.00020041435,0.00021972093,0.0006275746,0.00023730088,0.0006690724,0.00021622035,0.00040410896,0.0020633189],"category_scores_gemma":[0.0032617068,0.00018942531,0.00015930136,0.00045238118,0.00037468504,0.00051312335,0.00062089524,0.0003218726,0.00024729912],"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.002767697,0.00013354886,0.018597629,0.00017553043,0.000034437347,0.0002681445,0.0010201323,0.0009406185,0.92256665,0.0015274299,0.0005069671,0.05146114],"study_design_scores_gemma":[0.00023369932,0.0015424634,0.87073773,0.000050547387,0.00012230071,0.0014184541,0.0011939724,0.02049545,0.09720325,0.003946728,0.002953945,0.0001014219],"about_ca_topic_score_codex":0.0009934101,"about_ca_topic_score_gemma":0.00073167455,"teacher_disagreement_score":0.0020633189,"about_ca_system_score_codex":0.00021760582,"about_ca_system_score_gemma":0.00010138388,"threshold_uncertainty_score":0.0069024563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041426424,0.00052359817,0.99614966,0.00027378637,0.00019745762,0.000011180218,0.000022935943,0.00008947412,0.0023176924],"genre_scores_gemma":[0.046869908,0.003087436,0.9366689,0.00080012187,0.0016175597,0.00014846824,0.00014642553,0.00025626458,0.010404894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808085,0.00043537203,0.00015144637,0.0004906788,0.00075421,0.00008738753],"domain_scores_gemma":[0.9985104,0.0005561189,0.00011444439,0.00038390924,0.00035949814,0.00007561586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001541322,0.0009877463,0.000906355,0.002014691,0.000728622,0.0026919204,0.0015179854,0.0013186766,0.004067614],"category_scores_gemma":[0.004415353,0.00047096444,0.0011903855,0.0018710437,0.002653433,0.004216921,0.0025037169,0.0035963012,0.002440283],"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.000038909613,0.000026686417,0.00021093455,0.00019220744,0.00005186348,0.00015486011,0.00021830137,0.009238518,0.009413734,0.8634025,0.004162792,0.11288875],"study_design_scores_gemma":[0.000023452469,0.000083196675,0.00029692636,0.0000742248,0.000056330467,0.00094765634,0.00008224771,0.12568331,0.0066874637,0.7440568,0.12194665,0.000061777835],"about_ca_topic_score_codex":0.00045750078,"about_ca_topic_score_gemma":0.00033408808,"teacher_disagreement_score":0.004067614,"about_ca_system_score_codex":0.00076555525,"about_ca_system_score_gemma":0.00082165864,"threshold_uncertainty_score":0.013607502},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002771775,0.000076601435,0.9992285,0.000016365648,0.000018802895,0.000008109722,0.0000073932597,0.00012473817,0.00024235407],"genre_scores_gemma":[0.029362105,0.00026512943,0.9672185,0.000054022243,0.0000804273,0.000096202806,0.00006979407,0.00005352292,0.0028002888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994823,0.00010883514,0.000033523374,0.000102626145,0.00022475483,0.00004807207],"domain_scores_gemma":[0.9996799,0.000113198425,0.00003152981,0.00006958155,0.00008707154,0.000018597339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057059765,0.0009541797,0.0009045071,0.00065326865,0.00048528047,0.0008311254,0.001338794,0.0011510854,0.003018542],"category_scores_gemma":[0.0012906828,0.00053033535,0.0009792346,0.0007333894,0.0005522096,0.0011713587,0.00148408,0.0014928131,0.0019866365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018513617,0.00013472514,0.00051563117,0.00025206292,0.0002321654,0.00016959847,0.00014511909,0.15334292,0.08837104,0.05656281,0.004099085,0.6959897],"study_design_scores_gemma":[0.00003428569,0.0001768137,0.0003524253,0.000026709033,0.00006266518,0.000516595,0.000025682544,0.9391438,0.020227691,0.023465686,0.015901469,0.00006614894],"about_ca_topic_score_codex":0.0014009305,"about_ca_topic_score_gemma":0.002554601,"teacher_disagreement_score":0.003018542,"about_ca_system_score_codex":0.0003533394,"about_ca_system_score_gemma":0.001045341,"threshold_uncertainty_score":0.0100979805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030779862,0.000051708284,0.9992465,0.000021415313,0.000030502766,0.000009180514,0.000008121022,0.00017899882,0.00014578074],"genre_scores_gemma":[0.011559325,0.00014407313,0.9862862,0.000049381528,0.00004983309,0.00008502446,0.00006867621,0.00009559157,0.0016617756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993975,0.00009167645,0.000034581357,0.00013019939,0.00031305462,0.000033017404],"domain_scores_gemma":[0.9992743,0.00026829093,0.00005675769,0.00007525643,0.00029600962,0.000029447805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085801433,0.0011570724,0.0009940796,0.0007273635,0.000566762,0.0008130005,0.0013592868,0.0014749378,0.0033829377],"category_scores_gemma":[0.002476915,0.00072592386,0.0006862996,0.0009846991,0.00052738795,0.0013325372,0.0012814007,0.0021419118,0.00265754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017708365,0.000093391674,0.00029985336,0.0002395261,0.000107098174,0.000106795254,0.00010505796,0.116834156,0.05343896,0.02042836,0.005597398,0.80257225],"study_design_scores_gemma":[0.000032723372,0.00004274694,0.00019071954,0.000015500798,0.000024041832,0.00015410656,0.000010067225,0.97872823,0.010002438,0.0044790125,0.006283295,0.000037173664],"about_ca_topic_score_codex":0.0032731425,"about_ca_topic_score_gemma":0.005189275,"teacher_disagreement_score":0.0033829377,"about_ca_system_score_codex":0.00042454147,"about_ca_system_score_gemma":0.0013794572,"threshold_uncertainty_score":0.011317074},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010085898,0.00027383817,0.9883763,0.00005854505,0.00005284441,0.000013406969,0.000014120234,0.00024580758,0.00087923376],"genre_scores_gemma":[0.418137,0.0010233311,0.5761415,0.000096062075,0.00013277962,0.0001019941,0.00014492816,0.00031668198,0.0039057136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996232,0.00012854695,0.000025530246,0.00004312025,0.0001473531,0.000032258053],"domain_scores_gemma":[0.9986436,0.0009544533,0.000041908406,0.0000858438,0.00025252154,0.000021773292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010690362,0.0010942374,0.0005451044,0.00052758504,0.00034055498,0.00056871143,0.00052177004,0.00068889785,0.0017677516],"category_scores_gemma":[0.0042343372,0.0002933457,0.00058517477,0.000567821,0.0004892603,0.001056871,0.0006082394,0.0012106397,0.00053497247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005717726,0.00023448833,0.0005795373,0.00040330543,0.00012794098,0.00018660787,0.00027819237,0.36562237,0.073135436,0.04190283,0.0029182294,0.5140392],"study_design_scores_gemma":[0.0000061326623,0.00003726701,0.00021470792,0.000008559077,0.000015241483,0.000027139618,0.000008808474,0.9871317,0.009580071,0.0020592266,0.00089852954,0.000012486481],"about_ca_topic_score_codex":0.0012971782,"about_ca_topic_score_gemma":0.0019131718,"teacher_disagreement_score":0.0017677516,"about_ca_system_score_codex":0.00023438061,"about_ca_system_score_gemma":0.0005672454,"threshold_uncertainty_score":0.0059137344},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019414239,0.00017116184,0.9717713,0.00015880447,0.000094043586,0.00012049954,0.00010565994,0.0034814205,0.0046829274],"genre_scores_gemma":[0.26184392,0.00023964445,0.72802496,0.00021966569,0.000089416986,0.00024064294,0.00039807736,0.0001602016,0.00878344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996207,0.00008299958,0.00002551334,0.00005042347,0.00016350187,0.000056825036],"domain_scores_gemma":[0.9995639,0.0001260374,0.00004053995,0.00007726306,0.00016711195,0.000025223662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029450923,0.0005136976,0.0004444543,0.0004921861,0.00043837057,0.00070410996,0.0011171907,0.0006696057,0.011358459],"category_scores_gemma":[0.0009475536,0.0002724254,0.00023464445,0.00034702857,0.0002447426,0.0007747783,0.0005291059,0.0005624681,0.0052573374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015014568,0.00023282545,0.0012224361,0.00035414565,0.000118216594,0.00027322056,0.00026494075,0.047297463,0.29264092,0.026988525,0.009881323,0.6192244],"study_design_scores_gemma":[0.00034153208,0.0007184491,0.0011004705,0.000051799718,0.00008184615,0.0007384857,0.000050865492,0.66944516,0.2844425,0.0058012935,0.037155483,0.00007204295],"about_ca_topic_score_codex":0.0016682381,"about_ca_topic_score_gemma":0.0018335573,"teacher_disagreement_score":0.011358459,"about_ca_system_score_codex":0.00045229966,"about_ca_system_score_gemma":0.0008009631,"threshold_uncertainty_score":0.03799784},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003001771,0.00022360173,0.9954152,0.00008106601,0.000056142937,0.000021156451,0.000011525953,0.00017991029,0.0010096423],"genre_scores_gemma":[0.10085269,0.00038708549,0.8923938,0.000115545554,0.000098944154,0.00008251113,0.00006651272,0.000096608615,0.0059062764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996463,0.000089138746,0.000022668239,0.00007969493,0.00014089125,0.000021397767],"domain_scores_gemma":[0.999471,0.00020033607,0.000051286297,0.000101777034,0.00015632526,0.000019360166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006752747,0.00061898056,0.00040008154,0.0004865554,0.00036547118,0.0007052355,0.0009071541,0.001020667,0.0037360592],"category_scores_gemma":[0.0024632998,0.00021628117,0.00040762246,0.0005699201,0.0006825884,0.0014292459,0.0005907535,0.0010568353,0.0014463713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048752455,0.0000959893,0.0006246369,0.00025639217,0.00009644534,0.00012225797,0.000095776784,0.1456572,0.095136814,0.08481342,0.0037904182,0.6688231],"study_design_scores_gemma":[0.000039301805,0.00012948987,0.00027387217,0.000018619077,0.000019792216,0.0002219448,0.000010676366,0.95290935,0.025892707,0.011406347,0.0090458365,0.000031947755],"about_ca_topic_score_codex":0.00097152294,"about_ca_topic_score_gemma":0.0011799397,"teacher_disagreement_score":0.0037360592,"about_ca_system_score_codex":0.000520709,"about_ca_system_score_gemma":0.00082521705,"threshold_uncertainty_score":0.012498319},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054950345,0.00013125583,0.94404006,0.0000678551,0.000028289533,0.000014863473,0.000034560187,0.0002598452,0.00047291952],"genre_scores_gemma":[0.59173506,0.00021528473,0.4066489,0.00004612587,0.00005683131,0.00004160438,0.00012218067,0.000020874717,0.0011130512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935836,0.00024278581,0.00002951028,0.00013286828,0.0001755399,0.000060928254],"domain_scores_gemma":[0.99846363,0.0009845152,0.00017697166,0.00013938238,0.00019620461,0.00003934866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008587186,0.0004917821,0.00077475363,0.0005510411,0.0002734126,0.00051631854,0.00040158324,0.00072384457,0.00053014635],"category_scores_gemma":[0.0041722865,0.00021625396,0.00026631152,0.0005008538,0.0006822681,0.00061705307,0.0006120145,0.0004994044,0.00021106952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010575334,0.00013788567,0.0031772116,0.00019870055,0.00007694052,0.00030375042,0.00012159459,0.58509225,0.079240635,0.022599425,0.0014043256,0.30658978],"study_design_scores_gemma":[0.000016072594,0.000038967803,0.00041333912,0.000004791122,0.00000634594,0.00007054448,0.000010349376,0.9813731,0.014596665,0.0031311137,0.0003288299,0.000009994864],"about_ca_topic_score_codex":0.0012849009,"about_ca_topic_score_gemma":0.0011590288,"teacher_disagreement_score":0.0012849009,"about_ca_system_score_codex":0.00026468415,"about_ca_system_score_gemma":0.00089988444,"threshold_uncertainty_score":0.004541397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018220128,0.00018685071,0.9968053,0.00008160163,0.00012088496,0.000017190716,0.000031733052,0.00018415166,0.00075018744],"genre_scores_gemma":[0.08315781,0.00084398687,0.9077445,0.00016925871,0.00018275609,0.00012639853,0.00029301507,0.0002867197,0.007195495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932504,0.00016182293,0.000048305577,0.00010768593,0.0003114234,0.000045876597],"domain_scores_gemma":[0.99924004,0.00032102753,0.000069316724,0.0001471318,0.00019884844,0.000023720584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007793189,0.00093810394,0.00097081636,0.0007547573,0.0006271519,0.0009673481,0.0007908349,0.0011350672,0.004299086],"category_scores_gemma":[0.0042686374,0.00034791237,0.0008127905,0.0009986545,0.00055223756,0.0021965045,0.0013529628,0.0014888069,0.0019107551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000564717,0.00013379265,0.0004433066,0.0005131527,0.00011994698,0.000260282,0.00017644235,0.06433851,0.21915148,0.08894675,0.005908563,0.61944306],"study_design_scores_gemma":[0.000048513026,0.00015690451,0.00065344846,0.000052637388,0.00005423086,0.00078002334,0.00003632255,0.81642646,0.13818504,0.0236643,0.019867575,0.00007459823],"about_ca_topic_score_codex":0.00066175073,"about_ca_topic_score_gemma":0.000852732,"teacher_disagreement_score":0.004299086,"about_ca_system_score_codex":0.00030046678,"about_ca_system_score_gemma":0.00080346665,"threshold_uncertainty_score":0.014381826},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002301053,0.00012410316,0.9970306,0.000023026962,0.000021780874,0.000007604472,0.000012441106,0.00012420745,0.00035504138],"genre_scores_gemma":[0.1219585,0.00052362046,0.8746347,0.0000676892,0.00012510149,0.00008581242,0.00018987601,0.00017347104,0.0022412988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993882,0.0001672189,0.000025866231,0.0001054028,0.0002582316,0.000054966527],"domain_scores_gemma":[0.9994529,0.00023259522,0.00004780039,0.00007341765,0.00017374966,0.00001958905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006328187,0.00093803025,0.0006498682,0.0009439429,0.00048821117,0.0006121434,0.0006230319,0.0006244557,0.0013631625],"category_scores_gemma":[0.0019527726,0.00033419384,0.0007769875,0.0009260839,0.00060206343,0.00090283365,0.0006598322,0.0013770289,0.0009783459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030454865,0.00010326189,0.00088758895,0.0001829428,0.00013897169,0.00012430355,0.00013379237,0.1243685,0.098989174,0.036075056,0.0034765427,0.73521537],"study_design_scores_gemma":[0.000012471469,0.00004573155,0.00064729585,0.000011588735,0.00003227202,0.00009439656,0.00001160196,0.9649976,0.022761265,0.007440513,0.003914316,0.00003091738],"about_ca_topic_score_codex":0.0015669812,"about_ca_topic_score_gemma":0.0014394604,"teacher_disagreement_score":0.0015669812,"about_ca_system_score_codex":0.00024924774,"about_ca_system_score_gemma":0.0007817645,"threshold_uncertainty_score":0.004560232},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0810835,0.002730653,0.8742358,0.0019105746,0.00008226087,0.00013144886,0.00011237972,0.00018933187,0.039524123],"genre_scores_gemma":[0.8852093,0.0016929416,0.09836033,0.00013179833,0.0001364717,0.00017041648,0.00006988717,0.00010282913,0.014126108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948835,0.00024164178,0.000026699534,0.00006615733,0.00011674417,0.00006040664],"domain_scores_gemma":[0.99807644,0.0014522956,0.00013448605,0.00007752652,0.00018927302,0.000069965936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016364595,0.00059204653,0.0008359517,0.0005829881,0.0007220336,0.0013341417,0.000508733,0.0019373944,0.0038317102],"category_scores_gemma":[0.004762526,0.00023335223,0.00075618277,0.0008518395,0.0010461959,0.0007988026,0.0015532973,0.0009916972,0.00043642154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016592405,0.0001317716,0.0011736568,0.00020543435,0.000060698487,0.0013607634,0.00019843971,0.8202848,0.0019937584,0.1223916,0.0026885725,0.04934453],"study_design_scores_gemma":[0.000031198833,0.00007930946,0.00022410031,0.000018839517,0.000015413643,0.00024605845,0.000060754883,0.95976007,0.0007460816,0.035699226,0.003104009,0.000014999616],"about_ca_topic_score_codex":0.0035542143,"about_ca_topic_score_gemma":0.0026279518,"teacher_disagreement_score":0.0038317102,"about_ca_system_score_codex":0.0008009772,"about_ca_system_score_gemma":0.0006827345,"threshold_uncertainty_score":0.0128183365},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017574572,0.00006777743,0.99703574,0.00005543134,0.000012906702,0.000020907013,0.000022942031,0.00022802659,0.00079881714],"genre_scores_gemma":[0.12325983,0.00061080285,0.8685687,0.0001531613,0.000093224335,0.00024766775,0.0004495108,0.00033528867,0.0062818234],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984939,0.00036485193,0.00007861131,0.00033205227,0.0006458874,0.000084734434],"domain_scores_gemma":[0.9986077,0.00051836506,0.0001931068,0.0003860503,0.00024188726,0.000052886495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013076189,0.0010440248,0.001062527,0.0017536859,0.0005795305,0.0013679574,0.001202701,0.0012889666,0.0031249523],"category_scores_gemma":[0.0040231487,0.000673375,0.001101086,0.0019305245,0.0012209017,0.0025514243,0.0030252005,0.0017896472,0.001608494],"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.00016776194,0.00010618592,0.00053553405,0.00017881872,0.00013647706,0.00022581857,0.0001505674,0.33969703,0.04379542,0.10745985,0.00545526,0.5020913],"study_design_scores_gemma":[0.000022079403,0.00007167549,0.00042433548,0.000017706141,0.000018776955,0.00025482953,0.000035200577,0.9133978,0.01857174,0.056846697,0.010289065,0.0000500809],"about_ca_topic_score_codex":0.0014977326,"about_ca_topic_score_gemma":0.0022793012,"teacher_disagreement_score":0.0031249523,"about_ca_system_score_codex":0.0004737179,"about_ca_system_score_gemma":0.0012350049,"threshold_uncertainty_score":0.010453999},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012240005,0.32808572,0.6301017,0.0029916738,0.0029843645,0.0007661873,0.0006766366,0.000791563,0.021362197],"genre_scores_gemma":[0.21735865,0.18840419,0.5678793,0.0019659041,0.0065363403,0.002074942,0.0017441248,0.0004691366,0.013567298],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99678504,0.0016324633,0.00030675653,0.00046921393,0.00071552827,0.000090875204],"domain_scores_gemma":[0.99663615,0.0023086178,0.00034192437,0.00018608569,0.0004302034,0.0000970264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00501168,0.001360172,0.0012647742,0.003831768,0.00032250013,0.0020248708,0.0009351372,0.0016116097,0.0025865887],"category_scores_gemma":[0.009203477,0.0003215012,0.00075281423,0.006034,0.0017370972,0.0011975791,0.0011989721,0.0021759504,0.001398521],"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.00026451252,0.00019740727,0.0071236324,0.0052346247,0.0007025029,0.0014508496,0.0009768012,0.026665911,0.009491825,0.109136336,0.03233622,0.8064194],"study_design_scores_gemma":[0.00021638646,0.0010408415,0.049558986,0.005041172,0.00059390825,0.006738339,0.0011441713,0.101542234,0.006756891,0.29862988,0.5282539,0.0004832438],"about_ca_topic_score_codex":0.0021473651,"about_ca_topic_score_gemma":0.0012555156,"teacher_disagreement_score":0.00501168,"about_ca_system_score_codex":0.0007290339,"about_ca_system_score_gemma":0.0017869567,"threshold_uncertainty_score":0.026504576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061533786,0.000063684456,0.993277,0.00002048865,0.00001277498,0.000010341174,0.000015316238,0.0001444286,0.00030257355],"genre_scores_gemma":[0.18957594,0.0002453936,0.8081465,0.00004759745,0.000041214164,0.000045076908,0.00012143797,0.00007260818,0.001704189],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969554,0.00005559125,0.000018894463,0.00005175708,0.00015199026,0.000026193366],"domain_scores_gemma":[0.9995491,0.00016897763,0.00007670995,0.000060936047,0.00012047137,0.000023803714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050568744,0.00048100716,0.00033743097,0.0009986107,0.00020698101,0.0006618573,0.0004161871,0.00058709766,0.0010948386],"category_scores_gemma":[0.0015266561,0.00017965538,0.00035816594,0.0005741201,0.0005097288,0.00085744745,0.00048239477,0.0006129923,0.00079465006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002574456,0.0001136335,0.0022151703,0.0002233567,0.000069191425,0.0005369871,0.00017700643,0.0656592,0.4815053,0.048381608,0.0016998703,0.39916134],"study_design_scores_gemma":[0.000017638833,0.0001520221,0.0014603519,0.000016754364,0.000022903165,0.0012213688,0.000044451313,0.82888305,0.15235767,0.011640015,0.0041261725,0.000057517962],"about_ca_topic_score_codex":0.0002789656,"about_ca_topic_score_gemma":0.00032571398,"teacher_disagreement_score":0.0010948386,"about_ca_system_score_codex":0.00014994759,"about_ca_system_score_gemma":0.00031233756,"threshold_uncertainty_score":0.0036626458},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038439066,0.00010163928,0.9953283,0.00006550632,0.000013052402,0.000011913238,0.000023283537,0.00018169981,0.00043074985],"genre_scores_gemma":[0.26121327,0.00036158436,0.7309053,0.00009231192,0.00010143105,0.00014901253,0.00037890032,0.0004504054,0.006347792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885833,0.00044087367,0.000055977558,0.00009088013,0.00045873216,0.0000951241],"domain_scores_gemma":[0.9961086,0.002978458,0.00013339779,0.00020303465,0.0004792288,0.00009735292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031904501,0.0008619723,0.0009104087,0.001022248,0.0005056351,0.002112819,0.0012618863,0.0012777762,0.006000085],"category_scores_gemma":[0.01311015,0.0006997048,0.0006908755,0.00083749165,0.00074311625,0.0018861836,0.0018384454,0.0014156341,0.0014362986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054705184,0.00008509859,0.0010869747,0.000281994,0.00010344362,0.0002441203,0.00022694754,0.55296725,0.014066332,0.15472811,0.003600653,0.27206197],"study_design_scores_gemma":[0.000012965697,0.000016119,0.000087280205,0.000007710929,0.0000053149947,0.000029619343,0.0000092198525,0.97921824,0.0014240977,0.018685685,0.0004960872,0.000007687359],"about_ca_topic_score_codex":0.0025815794,"about_ca_topic_score_gemma":0.0046750903,"teacher_disagreement_score":0.006000085,"about_ca_system_score_codex":0.00097564043,"about_ca_system_score_gemma":0.0017464212,"threshold_uncertainty_score":0.020072222},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014395689,0.00008434866,0.99617815,0.00007240413,0.000082624014,0.00008645614,0.00016269581,0.0011925986,0.00070111296],"genre_scores_gemma":[0.012890203,0.0002609705,0.9805164,0.00007145315,0.00013159805,0.0002665121,0.000801998,0.00080303196,0.0042578913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997191,0.00058903906,0.00025248074,0.00046063244,0.0013507331,0.00015603441],"domain_scores_gemma":[0.9897629,0.0040794946,0.0007305866,0.0024726319,0.0027473476,0.00020702055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036578593,0.0017599788,0.0012633433,0.00454724,0.0012394837,0.002739106,0.0024108456,0.0016387329,0.010535079],"category_scores_gemma":[0.017628362,0.0009939787,0.0022594698,0.004154172,0.0013926135,0.0028509886,0.003890596,0.004332051,0.011363686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026503904,0.00017557871,0.002532309,0.0006394405,0.00022139482,0.00057936413,0.00075792405,0.008786981,0.04401906,0.022540873,0.02052576,0.8989562],"study_design_scores_gemma":[0.00019240553,0.00040558245,0.013276728,0.0004154093,0.00053460913,0.004872012,0.0012446038,0.6057931,0.09545709,0.063558996,0.21375433,0.0004951518],"about_ca_topic_score_codex":0.0023668117,"about_ca_topic_score_gemma":0.0025630884,"teacher_disagreement_score":0.010535079,"about_ca_system_score_codex":0.00042402357,"about_ca_system_score_gemma":0.0018715141,"threshold_uncertainty_score":0.035243392},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015489762,0.00009587471,0.9979031,0.000035712816,0.00001744028,0.000018403749,0.000031511463,0.00020322534,0.00014571197],"genre_scores_gemma":[0.024106111,0.00032684256,0.9738646,0.000041794407,0.00003984948,0.00013661946,0.00014676906,0.00012290773,0.0012144333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965787,0.000107479216,0.00001997541,0.00006069409,0.00013033109,0.000023545294],"domain_scores_gemma":[0.99932253,0.00030422508,0.00005236102,0.000085858584,0.00020787939,0.000027141647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006966674,0.00083551806,0.0005750818,0.001001982,0.0005411898,0.0006384985,0.0008437752,0.0008053857,0.0019441035],"category_scores_gemma":[0.001963452,0.00050155923,0.0010400133,0.0011937727,0.00046948684,0.00061718305,0.0007844294,0.0014628363,0.0009227563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002672017,0.00014157992,0.00046804125,0.00025695973,0.00021331497,0.00012528879,0.00012862754,0.03995676,0.21285608,0.017746532,0.0054940465,0.7223456],"study_design_scores_gemma":[0.00004071213,0.00010665902,0.0025502378,0.000029914387,0.00013397611,0.00037955897,0.000028015269,0.89071596,0.084387094,0.010525242,0.010997241,0.000105371975],"about_ca_topic_score_codex":0.0041664066,"about_ca_topic_score_gemma":0.0056922645,"teacher_disagreement_score":0.0041664066,"about_ca_system_score_codex":0.0003812574,"about_ca_system_score_gemma":0.0014743508,"threshold_uncertainty_score":0.008284271},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011676271,0.000179061,0.9875844,0.000036517762,0.00001518934,0.000013699922,0.000020940672,0.0000912559,0.0003825562],"genre_scores_gemma":[0.5035887,0.0010102892,0.4925739,0.00009555056,0.00009497684,0.00008656997,0.00029870984,0.00010005699,0.002151344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987539,0.00037768998,0.000055009536,0.0003477216,0.00039067896,0.00007507993],"domain_scores_gemma":[0.99643034,0.0025038703,0.00038044306,0.00027699716,0.00031302005,0.00009538282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003102399,0.0007774771,0.0010870664,0.0012144822,0.00031503147,0.0011794015,0.0010821966,0.0014602337,0.0014908505],"category_scores_gemma":[0.012854788,0.00048900105,0.00072637707,0.0013036228,0.0014650995,0.002106911,0.0011294091,0.0011197734,0.00046759364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018030619,0.000035023822,0.0016872486,0.00018112276,0.000082238,0.00028108706,0.00015992673,0.85196954,0.008071421,0.081980176,0.0006076212,0.054764256],"study_design_scores_gemma":[0.000009930297,0.00003885726,0.0002989141,0.000013766934,0.000009968574,0.0001144499,0.000011961924,0.9782598,0.002121055,0.018694935,0.00041315795,0.0000133213225],"about_ca_topic_score_codex":0.0009476321,"about_ca_topic_score_gemma":0.00056622527,"teacher_disagreement_score":0.003102399,"about_ca_system_score_codex":0.00075931265,"about_ca_system_score_gemma":0.0006006334,"threshold_uncertainty_score":0.016407192},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005298713,0.00004991514,0.99893767,0.000024896792,0.000013515925,0.000012619705,0.000014169878,0.0000956501,0.00032179523],"genre_scores_gemma":[0.11936809,0.00058003084,0.87455654,0.00011677795,0.00011395502,0.00023693824,0.00014452367,0.00008186328,0.0048013297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999318,0.00018967752,0.00004299504,0.00011218052,0.000287585,0.000049588845],"domain_scores_gemma":[0.99886644,0.0005912149,0.00009982758,0.00009533321,0.00031761194,0.000029662693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092455425,0.0008466556,0.0009822499,0.00044837286,0.0004687238,0.0011243391,0.00079172617,0.0014691211,0.0036273994],"category_scores_gemma":[0.003330766,0.00042710468,0.00060900336,0.000574592,0.0008096818,0.0010872466,0.001244883,0.0013859273,0.0017321579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016922632,0.00012585694,0.00032969067,0.00077520474,0.000087197855,0.00019779298,0.00028849853,0.5889804,0.036832113,0.07483529,0.0062137325,0.29116508],"study_design_scores_gemma":[0.000020676758,0.000070486625,0.000104207254,0.000026379374,0.000012891432,0.00018208436,0.000027737355,0.9772093,0.007835815,0.011464636,0.0030186402,0.000027254617],"about_ca_topic_score_codex":0.00093859975,"about_ca_topic_score_gemma":0.0014826878,"teacher_disagreement_score":0.0036273994,"about_ca_system_score_codex":0.00037842375,"about_ca_system_score_gemma":0.0015466103,"threshold_uncertainty_score":0.01213485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038811134,0.00025943617,0.995154,0.000059581158,0.000043123026,0.000009298257,0.0000075505814,0.00019743283,0.00038841757],"genre_scores_gemma":[0.35368633,0.0011176317,0.6420196,0.00009873741,0.00021101518,0.00010636466,0.00007454165,0.00006782849,0.002617866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961793,0.00015408026,0.000019900892,0.000039979885,0.00013841927,0.000029592806],"domain_scores_gemma":[0.9994407,0.00032921342,0.00005028005,0.000070481765,0.00009030855,0.000019017116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077434874,0.0005873753,0.00057936535,0.00035584462,0.0003639131,0.0006155842,0.00036069422,0.00079430034,0.0007061286],"category_scores_gemma":[0.0017736566,0.0003066413,0.0004390807,0.00049970887,0.00067621813,0.0007789503,0.00055002543,0.0009320497,0.00032445195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033832339,0.00008544192,0.0007620986,0.00018779725,0.000115875206,0.00021671224,0.0001600112,0.7162953,0.02690736,0.034519527,0.00285199,0.21755964],"study_design_scores_gemma":[0.000016610864,0.00005334927,0.00017510445,0.0000056856848,0.000010063763,0.00004676272,0.000006882632,0.99084646,0.0039665634,0.003872513,0.000986589,0.000013409108],"about_ca_topic_score_codex":0.0016945387,"about_ca_topic_score_gemma":0.0018442712,"teacher_disagreement_score":0.0016945387,"about_ca_system_score_codex":0.00033706205,"about_ca_system_score_gemma":0.00070651935,"threshold_uncertainty_score":0.0040951967},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025441847,0.00028357198,0.99581134,0.00010443986,0.000039467195,0.000028348883,0.000049335074,0.0006616019,0.00047762116],"genre_scores_gemma":[0.06952535,0.000300229,0.92805064,0.00008813091,0.00009899133,0.00015621255,0.00016785058,0.00027311774,0.0013395419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932134,0.00032848387,0.000022520682,0.00010882012,0.00018225433,0.00003661521],"domain_scores_gemma":[0.99855024,0.0007852849,0.00013225006,0.00032543056,0.00016525314,0.000041534397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017171967,0.00073852355,0.0006940901,0.0010341052,0.0005183865,0.00041782012,0.00072090887,0.0012728912,0.0038450083],"category_scores_gemma":[0.0065515502,0.00030378732,0.0007027783,0.001059318,0.0005337264,0.000775323,0.0005391537,0.0012480316,0.0016476238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002801356,0.00010391167,0.001001433,0.0002399152,0.0001379859,0.00023589536,0.00017818529,0.09332473,0.050870564,0.03933039,0.010653846,0.803643],"study_design_scores_gemma":[0.000038049784,0.00013064599,0.0013704412,0.000032168376,0.000049553633,0.00043862432,0.000029823725,0.896931,0.023167305,0.059607826,0.018142471,0.00006213202],"about_ca_topic_score_codex":0.001966012,"about_ca_topic_score_gemma":0.0023987372,"teacher_disagreement_score":0.0038450083,"about_ca_system_score_codex":0.000338951,"about_ca_system_score_gemma":0.000799736,"threshold_uncertainty_score":0.012862802},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005483219,0.00016794793,0.99199647,0.000047831385,0.000037427893,0.000017741757,0.000024331275,0.0009434544,0.0012814689],"genre_scores_gemma":[0.20438747,0.0005309908,0.7870587,0.000077135126,0.00013381834,0.00007007705,0.00022185816,0.00057400763,0.0069459495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993267,0.00019600356,0.00004857007,0.000062994346,0.00030891734,0.000056789147],"domain_scores_gemma":[0.99789596,0.0011884349,0.00009568997,0.00024410785,0.0005374147,0.00003833219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010841391,0.0009485342,0.0005549579,0.0009930269,0.0003309983,0.0010803575,0.00069331535,0.0005237507,0.008321892],"category_scores_gemma":[0.0070712008,0.00029763536,0.0005280172,0.0008161441,0.00047492713,0.0014156833,0.00061702507,0.001135683,0.002009093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005566432,0.00015490051,0.0009943848,0.0001783479,0.000056910692,0.00026158552,0.00023681919,0.14373755,0.03964125,0.0646761,0.0070270095,0.7424785],"study_design_scores_gemma":[0.000014920376,0.00007474788,0.00045936872,0.000018839279,0.000012747282,0.0001267701,0.000020422036,0.9734135,0.01687032,0.006289116,0.002678764,0.000020520232],"about_ca_topic_score_codex":0.002913727,"about_ca_topic_score_gemma":0.004093828,"teacher_disagreement_score":0.008321892,"about_ca_system_score_codex":0.0004950756,"about_ca_system_score_gemma":0.0007478665,"threshold_uncertainty_score":0.027839482},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002883173,0.09573508,0.8961291,0.00044640363,0.0003112942,0.000052754607,0.00012038141,0.00063436886,0.0036873773],"genre_scores_gemma":[0.13014835,0.18496421,0.6717978,0.0007120309,0.0032241475,0.00018887121,0.0010249726,0.00031923444,0.0076203425],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894863,0.00022835429,0.00011481708,0.0002225006,0.00043911752,0.000046704357],"domain_scores_gemma":[0.9989741,0.0005664969,0.0000880227,0.000118072385,0.00023247581,0.000020920568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001506855,0.0011315638,0.0019115792,0.0018194875,0.0003228339,0.0023284215,0.0013123194,0.0021393795,0.0025439577],"category_scores_gemma":[0.0018870259,0.0006044224,0.0013565103,0.0020967945,0.0006849164,0.0027788973,0.00090647716,0.0013264619,0.0028661636],"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.00031760268,0.000113151174,0.000261408,0.0027573963,0.00023786376,0.000103785635,0.00010389675,0.017047238,0.0341549,0.011878402,0.003538275,0.92948616],"study_design_scores_gemma":[0.00010552028,0.0008879498,0.0027071256,0.0013899558,0.0007707703,0.002021131,0.0002797224,0.5727489,0.16409466,0.077204265,0.17740956,0.0003804348],"about_ca_topic_score_codex":0.0005926383,"about_ca_topic_score_gemma":0.00045049872,"teacher_disagreement_score":0.0025439577,"about_ca_system_score_codex":0.00032055582,"about_ca_system_score_gemma":0.00047367503,"threshold_uncertainty_score":0.008510351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014420857,0.00049752975,0.9838702,0.00005180202,0.000028832002,0.00002190954,0.000024100242,0.00040716643,0.00067766197],"genre_scores_gemma":[0.14258327,0.00087888644,0.85520095,0.000045408848,0.00007177487,0.00005264806,0.00013403737,0.00008729934,0.0009456632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995433,0.00011418886,0.000026554706,0.0000816806,0.0002125265,0.000021657946],"domain_scores_gemma":[0.99933076,0.0003214534,0.00007826948,0.000072560084,0.00018111733,0.00001588748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005257387,0.0006620737,0.00073658366,0.0015691313,0.00024348183,0.00064593944,0.00047809738,0.0007455311,0.00075301476],"category_scores_gemma":[0.0020174829,0.00024172089,0.00045543053,0.0011681764,0.00050960225,0.0011175707,0.00048776806,0.00058903615,0.00054091745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033267608,0.00009323883,0.0012483869,0.00032750843,0.00014658053,0.00027221238,0.00015048221,0.0434264,0.18317926,0.0072618285,0.0015987117,0.7619628],"study_design_scores_gemma":[0.00003483685,0.00016223699,0.0035388723,0.00005237446,0.00009578384,0.0005036287,0.00004786309,0.8607055,0.12059518,0.008336906,0.0058585005,0.00006824185],"about_ca_topic_score_codex":0.00059597765,"about_ca_topic_score_gemma":0.0007834224,"teacher_disagreement_score":0.0015691313,"about_ca_system_score_codex":0.0002098819,"about_ca_system_score_gemma":0.00024504965,"threshold_uncertainty_score":0.0027804375},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011954046,0.00030811795,0.9867871,0.000060322687,0.000034831708,0.000018754026,0.0000256663,0.0002051422,0.00060604047],"genre_scores_gemma":[0.09172556,0.00047219137,0.90430033,0.000073654315,0.00007635157,0.00011030081,0.00018701633,0.00014283409,0.002911732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955636,0.00018311177,0.000024917012,0.000042503707,0.00016176024,0.00003126122],"domain_scores_gemma":[0.9990664,0.0005337503,0.00006238405,0.00012974134,0.00017706482,0.000030662948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011168262,0.000704359,0.0007140196,0.0011490899,0.0004076619,0.00050648843,0.00060748536,0.00076065323,0.0017377455],"category_scores_gemma":[0.0028852783,0.0003712136,0.00063018186,0.0008775473,0.000451185,0.0011888598,0.0008414159,0.0008671679,0.000800865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006644215,0.00020587334,0.00075011357,0.00029499742,0.00013834183,0.00014936508,0.00013827007,0.09541926,0.13744445,0.04471236,0.0039536785,0.71612877],"study_design_scores_gemma":[0.000036138874,0.0000853381,0.0004227031,0.0000091909205,0.000034644385,0.00011677759,0.000013385852,0.9650195,0.023508262,0.008776573,0.0019507476,0.000026742218],"about_ca_topic_score_codex":0.0009120053,"about_ca_topic_score_gemma":0.0017047793,"teacher_disagreement_score":0.0017377455,"about_ca_system_score_codex":0.00017980584,"about_ca_system_score_gemma":0.00068376074,"threshold_uncertainty_score":0.005906403},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038641505,0.0014900676,0.9912696,0.0018543305,0.00007237407,0.00005078877,0.000066450535,0.00012518851,0.0012071481],"genre_scores_gemma":[0.21664155,0.004439764,0.7721393,0.0012394409,0.00072199694,0.0006227939,0.0005607733,0.00022539758,0.0034090253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922692,0.004681083,0.00026503237,0.0012486173,0.0013509911,0.00018508648],"domain_scores_gemma":[0.9889498,0.008979779,0.00049724686,0.00065772625,0.00075805443,0.00015738995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01234008,0.001548514,0.0021775477,0.0021434715,0.00093017257,0.0030561017,0.0021271452,0.00264784,0.0020772736],"category_scores_gemma":[0.039435185,0.0011577284,0.0015915569,0.0028834476,0.003228388,0.0051899687,0.002386469,0.0038008653,0.0012193461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025608504,0.00013745639,0.0041743,0.0008181812,0.0006011451,0.00040780596,0.0008578041,0.28243613,0.0022432902,0.35688263,0.010940512,0.34024468],"study_design_scores_gemma":[0.00005109937,0.000053724165,0.0008455783,0.00018811338,0.0000760029,0.00019226175,0.00017479775,0.4582548,0.00096271804,0.5324675,0.0066622756,0.00007127076],"about_ca_topic_score_codex":0.003287886,"about_ca_topic_score_gemma":0.0023811983,"teacher_disagreement_score":0.01234008,"about_ca_system_score_codex":0.0012450046,"about_ca_system_score_gemma":0.0018438033,"threshold_uncertainty_score":0.065261364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031203872,0.00020419325,0.9674501,0.0001426958,0.000020867094,0.00003607915,0.00007001012,0.00030658592,0.0005655668],"genre_scores_gemma":[0.4234563,0.00058146636,0.57335126,0.00007255521,0.00007859377,0.000120142024,0.00046703717,0.000065758984,0.0018068819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975926,0.000063410036,0.000018116345,0.00004582686,0.00009099594,0.000022365622],"domain_scores_gemma":[0.9996474,0.00015553698,0.000058277546,0.000051157484,0.00007648015,0.000011135732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004929376,0.00037037616,0.00041256423,0.0006768845,0.00016073132,0.0004676005,0.00029865466,0.0004700058,0.0009235985],"category_scores_gemma":[0.0016701381,0.00016175296,0.00041708688,0.0007501524,0.0002698903,0.00057214726,0.00047021758,0.00039886028,0.00037322374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002947433,0.00013738638,0.0024507097,0.00019640505,0.00006603297,0.00014268862,0.0001278433,0.10050972,0.15395309,0.008949038,0.0017783341,0.731394],"study_design_scores_gemma":[0.000011950334,0.00008441071,0.0022477903,0.000011803304,0.000011245534,0.00012738029,0.00001888953,0.9786224,0.014975511,0.002945688,0.0009302365,0.000012754336],"about_ca_topic_score_codex":0.00088018645,"about_ca_topic_score_gemma":0.0008370844,"teacher_disagreement_score":0.0009235985,"about_ca_system_score_codex":0.0001473133,"about_ca_system_score_gemma":0.0003138363,"threshold_uncertainty_score":0.0030897856},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008433996,0.000095103416,0.9985039,0.000027340377,0.000021408769,0.000008782714,0.000006943076,0.00014502935,0.00034809634],"genre_scores_gemma":[0.14899378,0.00073844974,0.8457473,0.00014275718,0.00009530779,0.00017095073,0.0001419719,0.00010585529,0.0038636543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994154,0.00014064876,0.000037398382,0.00014665704,0.00022230926,0.00003753451],"domain_scores_gemma":[0.99937505,0.0002551443,0.00008573545,0.00006949096,0.0001940408,0.00002045887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066463574,0.00083898375,0.00064317876,0.00046707242,0.00037609861,0.00069015427,0.0011382684,0.0008090494,0.0017313112],"category_scores_gemma":[0.0026627064,0.00034851453,0.00059676287,0.00087161234,0.00063927914,0.0015683261,0.00083891413,0.0011562037,0.00087479356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019905978,0.00006541429,0.00090342906,0.00024407396,0.00009499297,0.000111629095,0.00016512381,0.29369354,0.056221582,0.06724947,0.0035720477,0.57747966],"study_design_scores_gemma":[0.000016826927,0.000072877,0.0002100819,0.000015164939,0.0000144826345,0.000115730596,0.000008434347,0.98212093,0.008925374,0.0047967904,0.003673762,0.000029581957],"about_ca_topic_score_codex":0.0024803989,"about_ca_topic_score_gemma":0.0024292378,"teacher_disagreement_score":0.0024803989,"about_ca_system_score_codex":0.00052696984,"about_ca_system_score_gemma":0.001251089,"threshold_uncertainty_score":0.0057917833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046725394,0.000066030276,0.99468464,0.00002583562,0.000015756816,0.000012196459,0.000007065207,0.00014771381,0.00036826008],"genre_scores_gemma":[0.15243338,0.00014883623,0.84404314,0.00007232948,0.00003451652,0.00009173173,0.000055579454,0.00007627024,0.0030442078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997002,0.00008212163,0.000018861567,0.000060924223,0.000107317835,0.000030612253],"domain_scores_gemma":[0.9997186,0.00009424934,0.000035324967,0.00006648753,0.000071221744,0.0000140609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039413257,0.00066270726,0.0009199375,0.00039507376,0.00021805549,0.0004949864,0.0007640604,0.0007631945,0.0014004143],"category_scores_gemma":[0.0010119404,0.00023492383,0.0004998856,0.00053757016,0.0005442301,0.0008754231,0.0006968623,0.0006107055,0.00050903106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002485327,0.00007382481,0.00043689038,0.00018247786,0.000118147465,0.00011431048,0.00008321771,0.45992136,0.071003586,0.026183898,0.0022517252,0.439382],"study_design_scores_gemma":[0.000030976636,0.00007281971,0.00012914086,0.000004894835,0.000012738843,0.0001039546,0.000006858923,0.98259914,0.012423774,0.003108655,0.0014877736,0.00001933063],"about_ca_topic_score_codex":0.0009773606,"about_ca_topic_score_gemma":0.0011575752,"teacher_disagreement_score":0.0014004143,"about_ca_system_score_codex":0.0002064453,"about_ca_system_score_gemma":0.0005936558,"threshold_uncertainty_score":0.0046848655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027183399,0.00019387463,0.9715997,0.00012925973,0.000022622367,0.000049785234,0.00001509001,0.00019161683,0.0006146797],"genre_scores_gemma":[0.24645624,0.00035737792,0.7500436,0.00007092997,0.00004175285,0.00009074055,0.00007052399,0.00012949284,0.0027393552],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950373,0.00021940177,0.000025823127,0.00004870058,0.00017959949,0.00002273443],"domain_scores_gemma":[0.9982162,0.0011657291,0.00008986793,0.0001185534,0.00036185587,0.000047748075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001954555,0.00050871266,0.00049715757,0.00033429483,0.0002984634,0.00055923255,0.0005806255,0.0009478954,0.001009789],"category_scores_gemma":[0.0041226274,0.0002574658,0.00044544766,0.0003057731,0.00037153612,0.00075507344,0.0005879965,0.00061076955,0.00027307158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010891136,0.00038167898,0.001752885,0.00061576255,0.00021720208,0.00051062385,0.00035535294,0.1530972,0.46104354,0.023265274,0.0015187036,0.35615274],"study_design_scores_gemma":[0.00001650223,0.00015172362,0.00067835074,0.0000114090235,0.000020619666,0.00016382957,0.000010722356,0.9561866,0.041051045,0.00076514715,0.00093002454,0.000014001496],"about_ca_topic_score_codex":0.0007402446,"about_ca_topic_score_gemma":0.0009184627,"teacher_disagreement_score":0.001954555,"about_ca_system_score_codex":0.000186722,"about_ca_system_score_gemma":0.00063285936,"threshold_uncertainty_score":0.010336816},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03187986,0.00004459093,0.9666307,0.00010913891,0.000021502638,0.000038665454,0.0000522973,0.0004343837,0.00078889984],"genre_scores_gemma":[0.7036233,0.00028863875,0.29380205,0.000063353415,0.000030553198,0.00024466266,0.0002856735,0.00018035527,0.0014814102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962485,0.00011638758,0.000020986708,0.000059998274,0.00014816655,0.000029604527],"domain_scores_gemma":[0.9983405,0.0010272182,0.00013344562,0.0002723163,0.0001876054,0.00003902762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001299969,0.0005403658,0.00048922276,0.00084058126,0.000309574,0.0007210816,0.00067837245,0.00076206075,0.001156261],"category_scores_gemma":[0.0053408844,0.00039126593,0.0007202115,0.00090105174,0.00082802156,0.001164813,0.0006492844,0.0012100805,0.00035619843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004962517,0.000026115387,0.00073634024,0.000023702869,0.00002237093,0.000054890203,0.00005180995,0.9615451,0.0040082834,0.013265752,0.0003947981,0.019821195],"study_design_scores_gemma":[0.0000017750216,0.000004985997,0.000112817026,0.0000011463964,0.0000011268766,0.000007475765,0.0000026267817,0.9971501,0.00068524026,0.0019139948,0.00011497754,0.000003881939],"about_ca_topic_score_codex":0.0032013524,"about_ca_topic_score_gemma":0.0021515796,"teacher_disagreement_score":0.0032013524,"about_ca_system_score_codex":0.00052103476,"about_ca_system_score_gemma":0.00084524415,"threshold_uncertainty_score":0.006874919},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045611477,0.04741342,0.8858045,0.005838834,0.0017383287,0.00004266062,0.00013266514,0.000628833,0.05383976],"genre_scores_gemma":[0.36959088,0.07404712,0.48472974,0.0032998996,0.005191392,0.00031290305,0.0005065482,0.0005630386,0.06175846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992982,0.00021725993,0.000045946734,0.00014856475,0.00022846993,0.00006147766],"domain_scores_gemma":[0.9989808,0.0006735542,0.00008029148,0.00008487169,0.00014362237,0.000036854475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011825253,0.00092504546,0.0007714402,0.0008605107,0.000576626,0.0022665565,0.000952111,0.0024795518,0.006131146],"category_scores_gemma":[0.004267803,0.00035247355,0.0005501424,0.0011880022,0.0027834466,0.0038986094,0.001407398,0.002723731,0.0016182192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056272078,0.00002324573,0.0005474758,0.00041616368,0.000065135464,0.0001269115,0.00017227649,0.05893456,0.0018886572,0.7331135,0.010674705,0.19398114],"study_design_scores_gemma":[0.00001102827,0.000033919318,0.00029738428,0.00015664761,0.000015378919,0.00018431952,0.00008265005,0.11932711,0.0010162947,0.8196544,0.059190076,0.00003085027],"about_ca_topic_score_codex":0.001882659,"about_ca_topic_score_gemma":0.0010494521,"teacher_disagreement_score":0.006131146,"about_ca_system_score_codex":0.0007619802,"about_ca_system_score_gemma":0.00058529334,"threshold_uncertainty_score":0.020510733},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040331115,0.00014689947,0.99507105,0.000040352654,0.000010014001,0.000013307819,0.000039957795,0.00038917156,0.00025602506],"genre_scores_gemma":[0.16338864,0.0012397929,0.83284616,0.00006098277,0.000083089275,0.00017389416,0.00043314937,0.00023960003,0.00153468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997776,0.00006018138,0.000014813388,0.00006709219,0.000057039095,0.00002325032],"domain_scores_gemma":[0.9997147,0.00015066014,0.000034172106,0.000033715034,0.0000555718,0.000011167771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068652333,0.0008632997,0.00060074416,0.0009482671,0.0001920324,0.0006262667,0.0005371678,0.0006175852,0.0006464574],"category_scores_gemma":[0.0014215735,0.0003317755,0.0009588161,0.0011941174,0.0004369771,0.0007411537,0.00038617788,0.0008154868,0.00060077826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020771373,0.000113036294,0.0013316079,0.00023718405,0.00019781772,0.0002308812,0.0001258757,0.25351718,0.09197719,0.014956972,0.0026084404,0.6344961],"study_design_scores_gemma":[0.00000971833,0.000051154966,0.001533464,0.000010661686,0.000037354173,0.00018225997,0.000012882986,0.9775737,0.011426535,0.0062282225,0.002901114,0.000032901935],"about_ca_topic_score_codex":0.002381896,"about_ca_topic_score_gemma":0.0020623785,"teacher_disagreement_score":0.002381896,"about_ca_system_score_codex":0.00042455684,"about_ca_system_score_gemma":0.000911894,"threshold_uncertainty_score":0.0047361255},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005050144,0.00014763983,0.9988146,0.000023897863,0.000048189173,0.000011308506,0.000010394423,0.00012496389,0.00031411965],"genre_scores_gemma":[0.013794181,0.0003490565,0.98343223,0.0000529528,0.00009109887,0.00006768737,0.00007645104,0.000045665063,0.0020906492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994382,0.000110739806,0.0000274311,0.000110966044,0.00029230278,0.000020347714],"domain_scores_gemma":[0.9996153,0.00012730775,0.000031524345,0.000057073907,0.00015054233,0.00001823256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057739514,0.00086181494,0.0006171268,0.0009111896,0.0004407159,0.0005406355,0.00071613374,0.00096906803,0.0027231341],"category_scores_gemma":[0.0011959517,0.0003341518,0.0006145428,0.000648643,0.00064539054,0.0010296117,0.0006566234,0.0012141353,0.0023027698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019571777,0.00009942663,0.0002579902,0.00034585156,0.00010306326,0.00011523554,0.00008983287,0.057314698,0.13417625,0.034487568,0.003721916,0.76909256],"study_design_scores_gemma":[0.000073374016,0.00021353045,0.00064576796,0.000037474383,0.00005972961,0.0010361788,0.000035435503,0.8668178,0.06585313,0.015253846,0.04986159,0.000112133246],"about_ca_topic_score_codex":0.00077058683,"about_ca_topic_score_gemma":0.0010762449,"teacher_disagreement_score":0.0027231341,"about_ca_system_score_codex":0.00030221354,"about_ca_system_score_gemma":0.0005980161,"threshold_uncertainty_score":0.009109795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005029266,0.00026290675,0.9935969,0.000060234117,0.000036073034,0.000012120784,0.000006919664,0.0003157972,0.00067981327],"genre_scores_gemma":[0.49555936,0.00081292295,0.49845257,0.00022055893,0.00015301889,0.00010936435,0.00007940408,0.000065243614,0.004547476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995875,0.00010909393,0.000019765637,0.000080824386,0.00016822902,0.00003460555],"domain_scores_gemma":[0.99955565,0.00019024064,0.00005006944,0.00005117445,0.00013994901,0.000012972139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000814879,0.00051150186,0.00067449926,0.00044956844,0.00028396348,0.0005257474,0.0009856364,0.0010368516,0.0009447582],"category_scores_gemma":[0.0018817085,0.000313959,0.0004804859,0.0003976693,0.00051087234,0.0012479752,0.0005092912,0.00084561604,0.00052719394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004347631,0.00014020149,0.00081000564,0.00021077992,0.00011976366,0.00017538689,0.000083826955,0.49460414,0.047107078,0.016107416,0.0014088273,0.43879777],"study_design_scores_gemma":[0.000010970551,0.000040097275,0.00009475383,0.000005930208,0.00001268161,0.000044833003,0.000002476824,0.99304974,0.004713738,0.0012197897,0.0007932189,0.000011862163],"about_ca_topic_score_codex":0.0015469297,"about_ca_topic_score_gemma":0.0012807698,"teacher_disagreement_score":0.0015469297,"about_ca_system_score_codex":0.00030623257,"about_ca_system_score_gemma":0.0005506308,"threshold_uncertainty_score":0.0043095946},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003481194,0.00008801971,0.9958269,0.000041026058,0.000019178091,0.000018537465,0.00000976771,0.00013884457,0.000376477],"genre_scores_gemma":[0.10698711,0.0003817078,0.88791096,0.00006660643,0.00008501756,0.00011249728,0.00018848987,0.00008694907,0.004180556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888843,0.0001705696,0.000065664055,0.00021547753,0.00057828333,0.00008163736],"domain_scores_gemma":[0.99901307,0.0003293388,0.0001407177,0.00010994991,0.00035860876,0.000048293536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000946199,0.001118321,0.0010103249,0.0018948636,0.0008651925,0.0011159255,0.001359175,0.0014568341,0.0016103588],"category_scores_gemma":[0.002478986,0.00040704853,0.0009816731,0.0019823886,0.0007879347,0.0018491563,0.0011698874,0.0012317143,0.0013625498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023321073,0.0001779805,0.0011506111,0.00024074447,0.00015883172,0.00020082691,0.00031053467,0.21775037,0.04887929,0.023097249,0.0025207184,0.70527965],"study_design_scores_gemma":[0.000012939462,0.000046807596,0.00058402657,0.000010151681,0.000021850978,0.00011622738,0.00003713097,0.9769424,0.009821559,0.010533985,0.0018452982,0.000027625965],"about_ca_topic_score_codex":0.0031739348,"about_ca_topic_score_gemma":0.0025643555,"teacher_disagreement_score":0.0031739348,"about_ca_system_score_codex":0.00058893906,"about_ca_system_score_gemma":0.0010678362,"threshold_uncertainty_score":0.00631094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047737677,0.000209687,0.9482782,0.0001275084,0.00003669616,0.00004174427,0.000037775262,0.0001933904,0.003337326],"genre_scores_gemma":[0.6139288,0.00033864228,0.38130963,0.00007392255,0.000041153005,0.0001215384,0.00017310865,0.00011117575,0.0039021093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943477,0.00023942834,0.000031687403,0.00009173295,0.00013678563,0.0000655524],"domain_scores_gemma":[0.99898833,0.00046147872,0.00016998596,0.00018220385,0.00014924424,0.000048843052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073611666,0.0008025492,0.0007420906,0.0004087016,0.0002743197,0.00057261396,0.0006371263,0.00049847056,0.0021764848],"category_scores_gemma":[0.003974157,0.00027665173,0.0004192231,0.0008382414,0.00052799424,0.0009023736,0.0012180522,0.000685938,0.0006239111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035075383,0.00007028725,0.00072156196,0.00014909924,0.0000661894,0.00015266618,0.00013463855,0.7175316,0.03416071,0.05323858,0.00102125,0.19240257],"study_design_scores_gemma":[0.000051321356,0.00036148384,0.00031584856,0.000018936315,0.000027723947,0.00018074838,0.000035088895,0.94813067,0.023967115,0.023808833,0.0030749077,0.000027315169],"about_ca_topic_score_codex":0.00018959571,"about_ca_topic_score_gemma":0.00024742907,"teacher_disagreement_score":0.0021764848,"about_ca_system_score_codex":0.00044876817,"about_ca_system_score_gemma":0.00040351768,"threshold_uncertainty_score":0.0072811246},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031775498,0.00035746128,0.9980202,0.000043860287,0.000040128154,0.000012619686,0.000011575086,0.000106079926,0.0010903503],"genre_scores_gemma":[0.026641902,0.0015392102,0.96605176,0.00010212299,0.00020703992,0.00015429952,0.00008831133,0.00013692558,0.005078403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912506,0.00020820928,0.000046441026,0.00009128517,0.0004896613,0.000039390878],"domain_scores_gemma":[0.9990214,0.00052489137,0.000059016777,0.00017683813,0.00019850789,0.000019199451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090013054,0.0010107977,0.0006763651,0.0010464471,0.00049437134,0.0009360706,0.0009831126,0.0008422221,0.004153645],"category_scores_gemma":[0.003547749,0.00038265143,0.0006205761,0.000845237,0.0008066273,0.0015550797,0.001193168,0.0018174943,0.002214425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013501167,0.00007849815,0.0001922764,0.00038584237,0.00009127351,0.0000676881,0.00010520887,0.13035679,0.021288637,0.29904866,0.0073227603,0.54092735],"study_design_scores_gemma":[0.000043058102,0.00004646327,0.00017591116,0.00006899227,0.000027004804,0.00024121466,0.000018265118,0.8535293,0.013012004,0.09998363,0.032803856,0.00005028388],"about_ca_topic_score_codex":0.00076592155,"about_ca_topic_score_gemma":0.0012240334,"teacher_disagreement_score":0.004153645,"about_ca_system_score_codex":0.00051704224,"about_ca_system_score_gemma":0.00081525143,"threshold_uncertainty_score":0.013895333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022786492,0.00015133414,0.99677163,0.000038843475,0.000028597551,0.00002497603,0.0000142552535,0.00027656902,0.00041510267],"genre_scores_gemma":[0.057871666,0.00020803038,0.93997926,0.00005370129,0.000044798177,0.00012451869,0.00006572797,0.000039898736,0.0016123715],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99925953,0.00022136538,0.000050979965,0.00010008396,0.0003221913,0.00004575597],"domain_scores_gemma":[0.9995283,0.0001617935,0.000045380326,0.000067959896,0.0001724505,0.000024214061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007977077,0.00069459435,0.0006690297,0.00085176644,0.0006959368,0.00069596793,0.00072299485,0.0007916541,0.0015536058],"category_scores_gemma":[0.0020645494,0.00028786558,0.00045601002,0.0007891362,0.00065578165,0.0009992631,0.00082539,0.0008693616,0.0012074278],"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.0004148403,0.00007973962,0.00054515013,0.0001326372,0.00005353077,0.00009733828,0.0001322815,0.09258246,0.035330515,0.04368217,0.002906016,0.82404333],"study_design_scores_gemma":[0.00004805263,0.0001231227,0.0003593226,0.000015243309,0.000015007114,0.00020666479,0.000019686542,0.96123475,0.018507931,0.013908183,0.0055213803,0.000040712835],"about_ca_topic_score_codex":0.0010229977,"about_ca_topic_score_gemma":0.0013240366,"teacher_disagreement_score":0.0015536058,"about_ca_system_score_codex":0.00044066092,"about_ca_system_score_gemma":0.00093601877,"threshold_uncertainty_score":0.0051972866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044187484,0.000120664256,0.99512583,0.00001302005,0.00001701857,0.000008808992,0.000008869534,0.00010675386,0.00018026908],"genre_scores_gemma":[0.27103963,0.00048504837,0.7252496,0.000048358954,0.00007898302,0.000115993156,0.00020853318,0.00006694762,0.0027068434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999446,0.0001441273,0.000049271985,0.00013673733,0.00019301288,0.000030796415],"domain_scores_gemma":[0.9993261,0.00034355238,0.00011516725,0.00008934718,0.00011317919,0.00001265214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093692984,0.0006595464,0.0009204802,0.00047595665,0.00038301141,0.00061961805,0.00081267173,0.00073717843,0.00065267034],"category_scores_gemma":[0.0032299028,0.00042164384,0.0006209198,0.00040301486,0.0004881053,0.0009591787,0.0006647669,0.0010581556,0.00039482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031619024,0.00007233475,0.0013701696,0.0004081941,0.00018060136,0.0002697835,0.00037491912,0.43597636,0.081332095,0.044204406,0.0008640295,0.43463087],"study_design_scores_gemma":[0.000008788312,0.00004077658,0.0003608679,0.00001264805,0.000016093072,0.00006855015,0.000008295719,0.9849915,0.008736315,0.004219819,0.0015201977,0.000016161743],"about_ca_topic_score_codex":0.0014168143,"about_ca_topic_score_gemma":0.0015972074,"teacher_disagreement_score":0.0014168143,"about_ca_system_score_codex":0.0002770733,"about_ca_system_score_gemma":0.0005474287,"threshold_uncertainty_score":0.0049549937},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032499635,0.000051476865,0.996151,0.000023854644,0.000018079523,0.0000057379757,0.000005933469,0.00016486285,0.0003291462],"genre_scores_gemma":[0.26562274,0.00037321285,0.7305851,0.00010128687,0.000079582525,0.0000650963,0.00012132907,0.000111533576,0.0029401875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941874,0.0001598305,0.000027737291,0.00011042875,0.0002347981,0.000048436],"domain_scores_gemma":[0.99937767,0.00030812656,0.0000816205,0.00009224608,0.00012168519,0.000018687066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006270395,0.00067743595,0.00063680543,0.0005758001,0.00037179797,0.00060642726,0.0009548291,0.0008763144,0.0011042815],"category_scores_gemma":[0.0025199568,0.0003283895,0.0008281075,0.00041349305,0.00054546224,0.0014372906,0.0007942284,0.0011073421,0.0005739625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002354197,0.00017102569,0.001280825,0.00018612226,0.00023897589,0.00015504094,0.00018200224,0.4421222,0.06584869,0.04764542,0.0016825363,0.4402517],"study_design_scores_gemma":[0.000016843447,0.00005407511,0.00029676288,0.000006688114,0.000026669004,0.00010152572,0.000011116298,0.9796718,0.012172123,0.0061244634,0.0014954421,0.000022566272],"about_ca_topic_score_codex":0.0011108826,"about_ca_topic_score_gemma":0.001514128,"teacher_disagreement_score":0.0011108826,"about_ca_system_score_codex":0.00031941332,"about_ca_system_score_gemma":0.0006002531,"threshold_uncertainty_score":0.0036942363},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016385585,0.00031826823,0.9821353,0.000046423003,0.000031824195,0.000016257061,0.000015777514,0.0002952198,0.0007553368],"genre_scores_gemma":[0.32952616,0.0008479114,0.6634349,0.0001657922,0.00010171701,0.00009741152,0.00014455855,0.000082434075,0.0055991462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997173,0.00008877569,0.000012219802,0.00007322098,0.00009100132,0.000017333274],"domain_scores_gemma":[0.9997341,0.00013435478,0.000024943818,0.000049840437,0.000047336536,0.000009460557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003438757,0.00056696945,0.00055774156,0.0002448397,0.0001534244,0.00039053906,0.0003664535,0.00053328526,0.0013566809],"category_scores_gemma":[0.0009223762,0.00018889505,0.0003021585,0.0003933117,0.00037610365,0.00071404537,0.000498698,0.00051514537,0.00090809545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004588433,0.000087070584,0.0006318338,0.00012780336,0.0000890535,0.00012570465,0.00011984782,0.16501655,0.21515732,0.010344844,0.0008865239,0.60695463],"study_design_scores_gemma":[0.000014297569,0.00007836181,0.0006614134,0.000005858339,0.000020550659,0.00013104799,0.000011518753,0.94429064,0.04741512,0.0038414176,0.0035133348,0.000016351476],"about_ca_topic_score_codex":0.00083473144,"about_ca_topic_score_gemma":0.0010726475,"teacher_disagreement_score":0.0013566809,"about_ca_system_score_codex":0.00019984419,"about_ca_system_score_gemma":0.0002841279,"threshold_uncertainty_score":0.0045385957},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001619186,0.00013133061,0.99785006,0.000026490743,0.000034869478,0.000009257863,0.000008880881,0.000104198756,0.00021566017],"genre_scores_gemma":[0.13500193,0.0006345384,0.86136776,0.00011127784,0.0002022731,0.00008432874,0.0001250856,0.000047585207,0.0024252422],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993357,0.00014827763,0.000038992228,0.00014446353,0.00029037578,0.000042277177],"domain_scores_gemma":[0.9989968,0.0004301028,0.00014151708,0.0001219129,0.00027949552,0.00003020844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062167953,0.0006517895,0.00070652505,0.0008798476,0.0005263148,0.00062399195,0.0006724121,0.0010350307,0.0011065686],"category_scores_gemma":[0.0034152854,0.00031642366,0.00056346745,0.00078145694,0.0006347495,0.0012272582,0.00071331766,0.0011734433,0.00066790363],"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.0003390314,0.00010943404,0.0011440596,0.00033263123,0.00021878531,0.000190525,0.00013490097,0.26084945,0.061614446,0.064275496,0.0026067856,0.60818446],"study_design_scores_gemma":[0.000038989067,0.000105615494,0.00041314625,0.000017761615,0.000060301925,0.0003531494,0.000012996658,0.957903,0.021922804,0.01460131,0.004525318,0.000045492332],"about_ca_topic_score_codex":0.0013084218,"about_ca_topic_score_gemma":0.0014838156,"teacher_disagreement_score":0.0013084218,"about_ca_system_score_codex":0.00044196963,"about_ca_system_score_gemma":0.001542321,"threshold_uncertainty_score":0.003701806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07365564,0.001000832,0.923855,0.00011657699,0.000043087977,0.000060971714,0.000048643862,0.00036579504,0.0008534272],"genre_scores_gemma":[0.3294622,0.00091503456,0.66810894,0.000068426176,0.00006570523,0.000088010405,0.00013721101,0.00005962469,0.0010948278],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997707,0.0000744191,0.000015670377,0.000033846627,0.00008924213,0.000016105361],"domain_scores_gemma":[0.9994448,0.0003584187,0.00004669205,0.00004268308,0.000086572865,0.00002075426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055044424,0.00032306206,0.0002906027,0.0005746818,0.0001965009,0.00040092343,0.00025400185,0.00057687535,0.0012293765],"category_scores_gemma":[0.0027251886,0.00013905727,0.00022333948,0.00045010188,0.00022048544,0.00047256378,0.00030849862,0.00037440154,0.0005565457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000785776,0.00007188621,0.00087605946,0.00018835255,0.00003750973,0.00011642896,0.00010493431,0.0074117323,0.5325355,0.0029298346,0.0005273941,0.45441464],"study_design_scores_gemma":[0.00016187942,0.00097121083,0.014861648,0.00008048238,0.0001522169,0.0013754463,0.000100179335,0.5124005,0.45133588,0.0072982353,0.01118824,0.00007404435],"about_ca_topic_score_codex":0.0005885925,"about_ca_topic_score_gemma":0.0009082261,"teacher_disagreement_score":0.0012293765,"about_ca_system_score_codex":0.00017112764,"about_ca_system_score_gemma":0.0003293756,"threshold_uncertainty_score":0.004112661},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019201771,0.000050476414,0.99757916,0.000041782452,0.0000099749095,0.0000070342935,0.000008356657,0.00003433327,0.0003487506],"genre_scores_gemma":[0.297022,0.0005438944,0.69945985,0.00015470758,0.00009581072,0.00019299318,0.00011536089,0.00007484167,0.002340564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989519,0.00044968716,0.00004017156,0.00017770576,0.00029284845,0.00008774367],"domain_scores_gemma":[0.99866366,0.0009700129,0.00011351057,0.000056887264,0.0001663134,0.000029622637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010958982,0.0010756447,0.0010257282,0.00045998284,0.00030822813,0.00075217744,0.00069071125,0.00080257136,0.0010584359],"category_scores_gemma":[0.0046972684,0.00047142303,0.00043630236,0.00059814006,0.0010101666,0.0010942509,0.0007178067,0.0009743706,0.00029088045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015726592,0.00006445643,0.000251943,0.0001374812,0.000044767214,0.00009221648,0.000086773325,0.8037171,0.008501286,0.090787046,0.0012754829,0.09488416],"study_design_scores_gemma":[0.000010690436,0.00003099301,0.000036782585,0.0000066434986,0.0000053073786,0.000020276615,0.0000040868595,0.9873467,0.0019102657,0.010106624,0.0005137195,0.000007832569],"about_ca_topic_score_codex":0.0010178661,"about_ca_topic_score_gemma":0.0007999132,"teacher_disagreement_score":0.0010958982,"about_ca_system_score_codex":0.00060479005,"about_ca_system_score_gemma":0.0011200929,"threshold_uncertainty_score":0.0057957172},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010305243,0.00012444823,0.9842509,0.00011739374,0.000022619399,0.000034353703,0.000024576717,0.00015203575,0.0049684085],"genre_scores_gemma":[0.1873233,0.00055015413,0.8082052,0.00005588511,0.000031185475,0.00020907061,0.00007388423,0.00014030287,0.003411004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948525,0.00017454253,0.000030927837,0.00004619807,0.00024012051,0.000022936605],"domain_scores_gemma":[0.99897695,0.00058863574,0.000097831784,0.00016782556,0.00014851672,0.000020239082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010442521,0.0006656893,0.00038517194,0.00043071373,0.0003132737,0.0007906642,0.0008875013,0.0010477359,0.003519933],"category_scores_gemma":[0.0065575955,0.000353717,0.0005273595,0.00053319125,0.0009812574,0.0013512148,0.0010383916,0.00071786763,0.0013887594],"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.00014933341,0.000076386765,0.0005687263,0.00048283447,0.00007892632,0.00022050462,0.00055553985,0.6504984,0.02955808,0.16915506,0.0017878087,0.1468684],"study_design_scores_gemma":[0.000040770465,0.00006835507,0.00020315868,0.000027211145,0.00002199351,0.00037673372,0.00008584561,0.93686044,0.009991471,0.047858678,0.0044268984,0.00003843235],"about_ca_topic_score_codex":0.00086395757,"about_ca_topic_score_gemma":0.001212604,"teacher_disagreement_score":0.003519933,"about_ca_system_score_codex":0.00031536203,"about_ca_system_score_gemma":0.000692888,"threshold_uncertainty_score":0.011775315},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015971832,0.00015233278,0.9834999,0.00006131022,0.000012761919,0.0000059963722,0.0000060902257,0.00010976274,0.00017993784],"genre_scores_gemma":[0.65046006,0.00095842895,0.34713662,0.00005527641,0.00012350956,0.000051732335,0.00008342549,0.00009093537,0.0010400602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955434,0.00021304084,0.000026287857,0.0000733407,0.000105957246,0.0000270542],"domain_scores_gemma":[0.9969023,0.0024492177,0.0002479412,0.00019307747,0.00018002224,0.000027412376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013152162,0.0008241828,0.00051505823,0.00074392866,0.00025812155,0.00063599146,0.0004660002,0.0009713041,0.0004218213],"category_scores_gemma":[0.01157224,0.0003220973,0.00044261027,0.0006710386,0.000729143,0.0013061751,0.00049261015,0.0008753405,0.00015188899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006479009,0.000048340273,0.001068115,0.00007063603,0.000043009783,0.00012056204,0.00014569935,0.8561696,0.010175232,0.029800085,0.00023688252,0.10205712],"study_design_scores_gemma":[0.000003510837,0.00001960572,0.00022060581,0.000005941493,0.000005145014,0.000047107136,0.000011950747,0.9873154,0.002606577,0.0094433455,0.00030914674,0.000011599754],"about_ca_topic_score_codex":0.0010855028,"about_ca_topic_score_gemma":0.0007437674,"teacher_disagreement_score":0.0013152162,"about_ca_system_score_codex":0.00030576083,"about_ca_system_score_gemma":0.0004306706,"threshold_uncertainty_score":0.0069556236},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43072808,0.0006469205,0.5660336,0.00049540156,0.00002195892,0.000047420326,0.00008514561,0.00029088225,0.0016506144],"genre_scores_gemma":[0.9546213,0.00032364868,0.04410176,0.000040196166,0.000017660903,0.000052944553,0.0000604606,0.000057592682,0.00072436605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951565,0.00033282218,0.000013222065,0.000039745617,0.00006207038,0.000036478614],"domain_scores_gemma":[0.99101466,0.007850976,0.00033582866,0.00029190214,0.0003993792,0.000107231805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024719024,0.0006486569,0.00076088595,0.00048761585,0.00032495498,0.00073765276,0.00078795577,0.0011157724,0.0011764348],"category_scores_gemma":[0.015751954,0.00041728676,0.0008086821,0.00072775973,0.0009937444,0.0017382992,0.00062802434,0.0012899315,0.00013772029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011931123,0.000054021948,0.0011524414,0.00006305695,0.00007181132,0.00006001623,0.00009632733,0.9762114,0.0013540147,0.010483926,0.00037703564,0.009956538],"study_design_scores_gemma":[0.000009662608,0.000011395492,0.000280332,0.00000232846,0.000006254399,0.000015164218,0.000008334099,0.99417204,0.00019217024,0.005260807,0.000036411846,0.0000050732574],"about_ca_topic_score_codex":0.008053389,"about_ca_topic_score_gemma":0.0057957913,"teacher_disagreement_score":0.008053389,"about_ca_system_score_codex":0.0005464655,"about_ca_system_score_gemma":0.00084114575,"threshold_uncertainty_score":0.016013026},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018967937,0.0007377499,0.98838437,0.00020987426,0.00015276308,0.00002800531,0.0000864897,0.0008990029,0.0076049813],"genre_scores_gemma":[0.1632666,0.0031352122,0.8103579,0.00035079257,0.00041334846,0.00036842664,0.00058747624,0.00038342402,0.021136846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947566,0.00011615999,0.00004738057,0.000100817364,0.00021039974,0.000049542403],"domain_scores_gemma":[0.9994192,0.00017695225,0.000040286246,0.00010636396,0.00023843865,0.000018787303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070051313,0.00082001294,0.000519316,0.00068432884,0.00038574354,0.0012275412,0.0012800772,0.00076813047,0.009694202],"category_scores_gemma":[0.0029968994,0.00032076336,0.00056923064,0.0010811646,0.0004731856,0.0015251262,0.0008270158,0.001545659,0.0032814683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116550604,0.00007228074,0.00050304394,0.0002906717,0.00009937,0.00013892289,0.00010551977,0.18422386,0.0068340413,0.19239594,0.01048524,0.6047346],"study_design_scores_gemma":[0.000015376494,0.000028440088,0.00021920125,0.00003115625,0.00001905488,0.00011282911,0.00001671897,0.9270633,0.002954939,0.05212395,0.017398307,0.000016799268],"about_ca_topic_score_codex":0.0039913417,"about_ca_topic_score_gemma":0.0047299494,"teacher_disagreement_score":0.009694202,"about_ca_system_score_codex":0.0005073485,"about_ca_system_score_gemma":0.0007125377,"threshold_uncertainty_score":0.03243029},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003990599,0.000038931707,0.9956657,0.00003388208,0.000008253061,0.000006883799,0.000012450645,0.000069048285,0.00017422624],"genre_scores_gemma":[0.4613235,0.00057771394,0.5356241,0.0001129395,0.000082009305,0.00016555136,0.00019137177,0.00013280712,0.0017900583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994267,0.00020216676,0.00002525026,0.000076539,0.00023373585,0.00003553662],"domain_scores_gemma":[0.99808097,0.0011754755,0.00023972301,0.0001935655,0.00027776838,0.000032452695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001184201,0.00069377304,0.00045293025,0.0005705587,0.0002627406,0.00040934322,0.00070719334,0.0006976959,0.00048213708],"category_scores_gemma":[0.0051476145,0.0003138321,0.0004454969,0.0006647966,0.0008354162,0.0012748652,0.000718737,0.0010308699,0.00019005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013750611,0.000025082545,0.0013345864,0.0001019962,0.000043899992,0.00013149295,0.00015423042,0.8835535,0.016458848,0.021700315,0.00081048487,0.07554815],"study_design_scores_gemma":[0.000005019676,0.000013283242,0.00013921947,0.0000052566083,0.0000053540834,0.00004307774,0.000007381585,0.99283934,0.0034107326,0.0030639824,0.00045652787,0.000010857586],"about_ca_topic_score_codex":0.0027077754,"about_ca_topic_score_gemma":0.0020620222,"teacher_disagreement_score":0.0027077754,"about_ca_system_score_codex":0.00034291207,"about_ca_system_score_gemma":0.0005767964,"threshold_uncertainty_score":0.0062627196},"labels":[],"label_agreement":null},{"id":"W2101480027","doi":"10.1109/78.845930","title":"Blind identification of FIR systems driven by Markov-like input signals","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Finite impulse response; Algorithm; Autocorrelation; A priori and a posteriori; Mathematics; Impulse response; Blind equalization; Signal processing; System identification; Computer science; Context (archaeology); Equalization (audio); Speech recognition; Decoding methods; Statistics; Digital signal processing","score_opus":0.01865191987931289,"score_gpt":0.2705058682826039,"score_spread":0.251853948403291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101480027","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052295853,0.000049559436,0.9943223,0.000024459807,0.000014441819,0.000010574358,0.000006858768,0.00014071862,0.00020147499],"genre_scores_gemma":[0.24952938,0.00020190046,0.74722004,0.000107135,0.00006111043,0.0000944788,0.000068248424,0.000030895455,0.0026868382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996469,0.00008181974,0.000022745973,0.0000721813,0.00013132553,0.000044957465],"domain_scores_gemma":[0.9992072,0.0004262927,0.0001370498,0.00008470347,0.00011911353,0.00002560192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078574836,0.00039341598,0.0004767421,0.00036373138,0.00026661053,0.00038621892,0.00067041314,0.00068352965,0.00092996826],"category_scores_gemma":[0.0021155241,0.00032395,0.00032492244,0.00027209026,0.00056663586,0.00072288874,0.0006603254,0.0006847793,0.0003353207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034321757,0.00009865285,0.0015728676,0.0001382483,0.00008946545,0.00014184524,0.00015737941,0.51427513,0.047410913,0.053544257,0.00148276,0.3807452],"study_design_scores_gemma":[0.00001626323,0.00003112917,0.00015799399,0.0000036654492,0.0000058685255,0.00004340494,0.0000028492448,0.9884637,0.0063159005,0.0043772254,0.0005713735,0.000010560939],"about_ca_topic_score_codex":0.0012481628,"about_ca_topic_score_gemma":0.0019095023,"teacher_disagreement_score":0.0012481628,"about_ca_system_score_codex":0.0003714035,"about_ca_system_score_gemma":0.00082892354,"threshold_uncertainty_score":0.0041555166},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007256208,0.00032452386,0.9968162,0.000121119505,0.000044130884,0.000013751554,0.00007696174,0.00031273122,0.0015649182],"genre_scores_gemma":[0.19956096,0.002611201,0.7829702,0.00023562746,0.00037661727,0.00034898688,0.0010329761,0.00029892317,0.012564521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992204,0.0002896459,0.00003326748,0.00016730868,0.00022603641,0.00006336045],"domain_scores_gemma":[0.999393,0.00033897354,0.000058204347,0.000074468146,0.0001106056,0.000024737603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008449245,0.00082510576,0.0009645237,0.000825626,0.00038821262,0.0012043036,0.0016522619,0.0010655442,0.0038999708],"category_scores_gemma":[0.0024936018,0.00043228292,0.0010325788,0.001126963,0.0005901412,0.0019772546,0.0008337406,0.001731289,0.001873224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006393481,0.00005415396,0.00074067316,0.00018468023,0.00014519757,0.00033171425,0.00018819452,0.37936848,0.004292994,0.5193053,0.0054639997,0.089860655],"study_design_scores_gemma":[0.000009223077,0.000014612796,0.00014117714,0.00001544205,0.000023465298,0.00007175849,0.000011237555,0.90783,0.0006821115,0.08378517,0.0073948647,0.000020906824],"about_ca_topic_score_codex":0.0052001863,"about_ca_topic_score_gemma":0.0036580055,"teacher_disagreement_score":0.0052001863,"about_ca_system_score_codex":0.0007361545,"about_ca_system_score_gemma":0.0013432852,"threshold_uncertainty_score":0.013046682},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034412785,0.00020376849,0.9990369,0.00006278125,0.000020728208,0.000028555372,0.000027624605,0.00016836515,0.00010711947],"genre_scores_gemma":[0.0086704325,0.0005652303,0.9892663,0.00007082572,0.00015471767,0.00031257045,0.00022151422,0.00016802165,0.00057037204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920055,0.003466286,0.00067082443,0.001433304,0.0021566784,0.00026735888],"domain_scores_gemma":[0.9719997,0.018881917,0.001662383,0.00387282,0.0033281907,0.0002549736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009880009,0.0033566724,0.0030772313,0.0034784784,0.0015056947,0.003345229,0.0032974915,0.0026218412,0.003554809],"category_scores_gemma":[0.039809246,0.0020553372,0.0028609748,0.005158916,0.0023613675,0.0065250276,0.0038531155,0.005364286,0.003584505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019939149,0.00014416987,0.0010438333,0.0008072884,0.00041944903,0.00014956908,0.00037470894,0.13340591,0.010937002,0.096789904,0.006664345,0.7490643],"study_design_scores_gemma":[0.00010472093,0.000105971514,0.00087348453,0.0001038833,0.000065944325,0.00029101328,0.000074041236,0.82877994,0.0059624845,0.1536669,0.009845919,0.0001257687],"about_ca_topic_score_codex":0.0030701754,"about_ca_topic_score_gemma":0.0033996208,"teacher_disagreement_score":0.009880009,"about_ca_system_score_codex":0.0011015419,"about_ca_system_score_gemma":0.0035349927,"threshold_uncertainty_score":0.0522511},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046286788,0.0015682568,0.9475617,0.00033945893,0.000060927865,0.000027162385,0.00004201139,0.00021638225,0.0038973347],"genre_scores_gemma":[0.6002471,0.0021725185,0.39171186,0.00024453373,0.00032904843,0.00006691132,0.00012824968,0.00007714111,0.0050226925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998529,0.000036478188,0.000005243372,0.00003134096,0.0000625634,0.0000114025315],"domain_scores_gemma":[0.9996184,0.00023521081,0.00005513613,0.000026630833,0.000047873003,0.000016682337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024352895,0.00034090108,0.00014263653,0.0005525785,0.00009016184,0.00038475636,0.000311007,0.00066589395,0.00092178927],"category_scores_gemma":[0.0016171596,0.0001322528,0.00017674583,0.00057208264,0.00059997145,0.0009532406,0.00030564514,0.0005047279,0.00027292324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057603203,0.000082466795,0.0021574178,0.0002545537,0.00006569761,0.0012702949,0.0001549565,0.11396613,0.2674736,0.114840776,0.0017599268,0.49739805],"study_design_scores_gemma":[0.00003861478,0.0002239246,0.0056408006,0.000029788238,0.000018818302,0.0021538234,0.00005255603,0.8772804,0.043618828,0.063705936,0.0071859835,0.000050538787],"about_ca_topic_score_codex":0.00036706324,"about_ca_topic_score_gemma":0.00030197707,"teacher_disagreement_score":0.00092178927,"about_ca_system_score_codex":0.00016167063,"about_ca_system_score_gemma":0.00014714568,"threshold_uncertainty_score":0.003083706},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002007408,0.00030919796,0.9956397,0.000059469017,0.00007035756,0.000051480532,0.000057788842,0.0009325375,0.0008720468],"genre_scores_gemma":[0.061976083,0.00047132323,0.9319533,0.00012550609,0.00013273266,0.0001703416,0.00042006417,0.00022442096,0.004526291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998965,0.00019922073,0.00006599506,0.00027269928,0.0004079037,0.0000892644],"domain_scores_gemma":[0.9994129,0.00019459873,0.000050186143,0.00011298884,0.00020374412,0.000025673677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010271725,0.0016589164,0.0011481165,0.0012421493,0.00045011815,0.0010471087,0.0011995295,0.0012242688,0.0035209565],"category_scores_gemma":[0.0017667348,0.0006258985,0.0015152263,0.0010763428,0.000447761,0.0013982115,0.0014635294,0.0017070838,0.003452439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000526613,0.00018923187,0.00042838673,0.0003545941,0.00031049846,0.00017840922,0.00012814098,0.050994523,0.1406357,0.012804276,0.004972393,0.7884772],"study_design_scores_gemma":[0.00006075257,0.00026206355,0.0015555603,0.000041681225,0.00009303857,0.00027915498,0.000027054319,0.899701,0.07825334,0.005401738,0.014198233,0.00012635747],"about_ca_topic_score_codex":0.0011057178,"about_ca_topic_score_gemma":0.0013083714,"teacher_disagreement_score":0.0035209565,"about_ca_system_score_codex":0.00036243902,"about_ca_system_score_gemma":0.00077583257,"threshold_uncertainty_score":0.0117788315},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037112092,0.0001031423,0.9949227,0.000032661457,0.000033028155,0.00001930048,0.000008568375,0.00041230113,0.0007571317],"genre_scores_gemma":[0.1752295,0.0002787764,0.8188598,0.00010311472,0.00009850955,0.000096262454,0.00009245462,0.0001385956,0.005102926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996257,0.0001096845,0.00001979218,0.000079055615,0.0001344857,0.000031196498],"domain_scores_gemma":[0.99961793,0.00012953236,0.000035026223,0.0000682216,0.0001309894,0.000018302519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000511693,0.00059393654,0.0004640562,0.00052224146,0.00035824877,0.0005165915,0.0005370995,0.0006726656,0.0027393822],"category_scores_gemma":[0.0016201338,0.00019379104,0.00041738123,0.00045885515,0.0004162484,0.00078259036,0.0007335323,0.00087620877,0.0017260835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027209538,0.00004659675,0.0004408605,0.00009456548,0.00006447822,0.0001624912,0.00013225581,0.075973734,0.0721641,0.01919564,0.0022071686,0.82924604],"study_design_scores_gemma":[0.00003005465,0.00014266772,0.00055624056,0.000014853364,0.000024969393,0.0005035466,0.000023711966,0.9363851,0.045137294,0.008542864,0.008587213,0.000051488965],"about_ca_topic_score_codex":0.0010666207,"about_ca_topic_score_gemma":0.0011025512,"teacher_disagreement_score":0.0027393822,"about_ca_system_score_codex":0.00018189737,"about_ca_system_score_gemma":0.00045217125,"threshold_uncertainty_score":0.009164095},"labels":[],"label_agreement":null},{"id":"W2104820701","doi":"10.1109/tsp.2006.887126","title":"Matrix-Group Algorithm via Improved Whitening Process for Extracting Statistically Independent Sources From Array Signals","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Science Foundation","keywords":"Blind signal separation; Algorithm; Independent component analysis; Mathematics; Subspace topology; Orthogonality; Convergence (economics); Matrix (chemical analysis); Function (biology); Signal subspace; Noise (video); Computer science; Artificial intelligence","score_opus":0.021350499863772913,"score_gpt":0.3133550508845633,"score_spread":0.29200455102079037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104820701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035762046,0.000059496557,0.9958395,0.000023016612,0.0000129654145,0.000015573818,0.000006821694,0.00009935152,0.0003671363],"genre_scores_gemma":[0.05916843,0.00010807627,0.9388747,0.000040774667,0.000030052965,0.00009165432,0.00007228161,0.000055084158,0.0015589104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995003,0.00015089122,0.000022642265,0.00010763315,0.00018266233,0.00003585998],"domain_scores_gemma":[0.9995739,0.00018053447,0.000053576598,0.00006812815,0.00010939646,0.000014450037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079310464,0.00078314915,0.00058997556,0.00070268684,0.00032738355,0.00043268016,0.0008471758,0.0007212074,0.0019021772],"category_scores_gemma":[0.0020048162,0.0002461704,0.0005937877,0.00076072384,0.00058843044,0.0011672487,0.0007837853,0.0008977426,0.0007478473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038885386,0.000094133604,0.00044569437,0.00018038396,0.00008573718,0.00011234794,0.00024795084,0.27644384,0.065631725,0.0716406,0.0017012013,0.5830276],"study_design_scores_gemma":[0.000030945204,0.00013690484,0.00018836737,0.000008195878,0.000015945412,0.000064423104,0.000014230292,0.97487664,0.012054689,0.009550128,0.0030419573,0.000017583834],"about_ca_topic_score_codex":0.0011961317,"about_ca_topic_score_gemma":0.0015347141,"teacher_disagreement_score":0.0019021772,"about_ca_system_score_codex":0.00033402786,"about_ca_system_score_gemma":0.00068884925,"threshold_uncertainty_score":0.006363392},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005041336,0.00010774155,0.9941041,0.00003486645,0.000033567794,0.000022146873,0.000027752083,0.00025069516,0.00037779403],"genre_scores_gemma":[0.103448346,0.0002955086,0.89409196,0.000067836685,0.000073060684,0.00012930109,0.00027435162,0.000090195106,0.0015294313],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989266,0.0003592568,0.000064506174,0.00017689675,0.00040702298,0.000065647844],"domain_scores_gemma":[0.99910384,0.00030474414,0.000077089826,0.00014228131,0.00034175714,0.000030330066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010535783,0.00079366827,0.0010140704,0.0011645261,0.0003082199,0.0007344014,0.000664517,0.00055627764,0.0011994735],"category_scores_gemma":[0.00303009,0.00027101245,0.00085004396,0.0015712924,0.0006309478,0.0008623621,0.0007698283,0.0009052115,0.000777236],"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.00024451417,0.00010486628,0.000993698,0.000168376,0.00017145771,0.00013516161,0.000111848036,0.16999649,0.05009989,0.03415331,0.0042079077,0.7396125],"study_design_scores_gemma":[0.000019234829,0.00005567009,0.00041019262,0.0000063395996,0.000015890899,0.00008391876,0.0000119771685,0.9829502,0.0076595643,0.0061624325,0.0025932316,0.00003137616],"about_ca_topic_score_codex":0.0014306728,"about_ca_topic_score_gemma":0.0015702045,"teacher_disagreement_score":0.0014306728,"about_ca_system_score_codex":0.00031418086,"about_ca_system_score_gemma":0.0007829447,"threshold_uncertainty_score":0.005571902},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002964809,0.0005813933,0.9928141,0.000105489446,0.00013826381,0.00005920407,0.00003848135,0.0008800757,0.0024182335],"genre_scores_gemma":[0.10038962,0.0019290312,0.890726,0.00027187722,0.00028308286,0.00011110261,0.0002045648,0.0001006679,0.0059839836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990157,0.00017417906,0.00009651775,0.00011608007,0.00053240114,0.00006507504],"domain_scores_gemma":[0.99794334,0.0006004255,0.00017612634,0.00037509282,0.0008619475,0.000043118256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016025252,0.000992929,0.0008067037,0.0010527817,0.0004870916,0.0010972556,0.001433681,0.0009829501,0.0051883343],"category_scores_gemma":[0.005400457,0.00041411593,0.00064729026,0.00082610536,0.00054691394,0.002079186,0.0006773211,0.0014109483,0.0026198965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005876281,0.00012306047,0.0011687076,0.00050949753,0.000122024925,0.00035591106,0.00017128063,0.04296477,0.08882095,0.077658065,0.0060839755,0.78143424],"study_design_scores_gemma":[0.00016292208,0.0008305219,0.0019050954,0.00030430563,0.00029309254,0.0041969735,0.000083393184,0.70819455,0.14247695,0.03732547,0.103983976,0.0002427541],"about_ca_topic_score_codex":0.00078170304,"about_ca_topic_score_gemma":0.0013675354,"teacher_disagreement_score":0.0051883343,"about_ca_system_score_codex":0.0006234546,"about_ca_system_score_gemma":0.00045813102,"threshold_uncertainty_score":0.017356753},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00334308,0.00017609075,0.9959876,0.000060837745,0.000026480615,0.00000866306,0.000012229905,0.00015180797,0.00023319603],"genre_scores_gemma":[0.08139727,0.0005542323,0.9162037,0.00010947663,0.00020338943,0.00007525746,0.0001548018,0.00007630923,0.0012255237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990237,0.00030509973,0.00005653496,0.00018620516,0.00037041117,0.000058036596],"domain_scores_gemma":[0.9979698,0.0011477575,0.00023791604,0.00027940798,0.00031723725,0.0000477668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009608947,0.00093317864,0.001045357,0.0010023783,0.0005902903,0.00072667276,0.0007692867,0.0011339702,0.0011033708],"category_scores_gemma":[0.0034612373,0.00048929104,0.0009745609,0.00097244844,0.0013008249,0.0017784627,0.00097509683,0.0012072627,0.0007044882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004156525,0.00015799019,0.0013376747,0.0005000227,0.0002901011,0.0005318178,0.0005428992,0.20558937,0.1268703,0.047208205,0.0038676513,0.61268836],"study_design_scores_gemma":[0.00006226987,0.00016872473,0.0011123499,0.000026771086,0.00006259454,0.0007914122,0.000081392864,0.92231095,0.03799839,0.029179044,0.008131478,0.00007456617],"about_ca_topic_score_codex":0.0011907144,"about_ca_topic_score_gemma":0.0015854065,"teacher_disagreement_score":0.0011907144,"about_ca_system_score_codex":0.00031748638,"about_ca_system_score_gemma":0.00077965466,"threshold_uncertainty_score":0.005081773},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027838305,0.00029829735,0.9945262,0.00006269527,0.000026814905,0.000035057008,0.00026451432,0.001007548,0.0009949974],"genre_scores_gemma":[0.09033624,0.00066614966,0.906232,0.000057779434,0.000096205484,0.00030799292,0.0006687773,0.0004915549,0.0011432696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933845,0.00020986931,0.000034510227,0.00007756312,0.000308302,0.000031256703],"domain_scores_gemma":[0.9966008,0.0019295947,0.0003323672,0.0004405893,0.0006231927,0.000073398085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012129431,0.0008584575,0.00048642856,0.0030242903,0.00046439184,0.0012225541,0.0008463028,0.00043692582,0.0034525685],"category_scores_gemma":[0.009950352,0.000349329,0.000796078,0.0028016437,0.00077021535,0.0013424596,0.0010984876,0.0009349999,0.0013210815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029318235,0.00007663955,0.0023480111,0.00060829375,0.0002587989,0.00037784662,0.0002451923,0.15224518,0.029027482,0.13383795,0.009413458,0.6712679],"study_design_scores_gemma":[0.00005469577,0.00011938797,0.006018349,0.00009088805,0.0000909203,0.0011581432,0.00010273303,0.74455106,0.022348808,0.19336395,0.031895224,0.00020589025],"about_ca_topic_score_codex":0.0013036559,"about_ca_topic_score_gemma":0.001049558,"teacher_disagreement_score":0.0034525685,"about_ca_system_score_codex":0.00044173375,"about_ca_system_score_gemma":0.0007042794,"threshold_uncertainty_score":0.011550009},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001235819,0.0003647718,0.99736917,0.00012805042,0.000039192226,0.00003378288,0.00004557769,0.00025663126,0.0005269924],"genre_scores_gemma":[0.062024012,0.0010275672,0.93204457,0.0002571183,0.00024039723,0.00038002737,0.00051593746,0.00023535824,0.0032749898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783784,0.0009693364,0.00013014802,0.00053821446,0.00041329887,0.0001111115],"domain_scores_gemma":[0.99613535,0.002005437,0.00023064931,0.0009978384,0.0005469122,0.00008389003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034950003,0.0014925608,0.0011814242,0.0016052176,0.0005983177,0.0016529071,0.0018266878,0.0017228606,0.009036465],"category_scores_gemma":[0.014718224,0.00083844824,0.0014533187,0.0023500635,0.0015070438,0.0034103002,0.0022492786,0.002013788,0.0042807483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019813607,0.00007774875,0.0008653717,0.00032793925,0.00015367263,0.000075519696,0.00015174302,0.17806296,0.0037048813,0.13314188,0.010283082,0.67295706],"study_design_scores_gemma":[0.00004124975,0.000044895864,0.0002836781,0.000045062814,0.000020300093,0.00009426929,0.000028800949,0.7855072,0.0018685607,0.20418154,0.00785845,0.000025993326],"about_ca_topic_score_codex":0.002178585,"about_ca_topic_score_gemma":0.0012238497,"teacher_disagreement_score":0.009036465,"about_ca_system_score_codex":0.0008827493,"about_ca_system_score_gemma":0.0015898016,"threshold_uncertainty_score":0.030229926},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028785609,0.00074390194,0.96722823,0.00060114404,0.000033327764,0.00004598499,0.00008797427,0.00016685764,0.0023070043],"genre_scores_gemma":[0.61303324,0.0016977336,0.3789446,0.0004868504,0.00048963155,0.00029097806,0.0007245847,0.00017549018,0.0041569117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948842,0.0022836223,0.0002632358,0.00085168186,0.0013409215,0.00037628654],"domain_scores_gemma":[0.9811282,0.014901182,0.0009987936,0.0009067623,0.0017818764,0.0002830734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009379692,0.0010969458,0.0021708566,0.0023711168,0.001074554,0.0017897919,0.0013828791,0.0019902058,0.0021724033],"category_scores_gemma":[0.04308496,0.00055933814,0.0007429722,0.0022377018,0.0026630799,0.004770038,0.0027418581,0.002297986,0.00086486194],"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.00036456867,0.00013661382,0.0028896993,0.00021032874,0.00009763414,0.00019887403,0.0002978271,0.39879358,0.002382719,0.23275702,0.0058424682,0.35602868],"study_design_scores_gemma":[0.000020129559,0.000045881057,0.0004853662,0.000023639943,0.000013333011,0.000109035645,0.00005087286,0.850366,0.00097473303,0.1470335,0.0008499827,0.000027551996],"about_ca_topic_score_codex":0.0024016427,"about_ca_topic_score_gemma":0.0018116797,"teacher_disagreement_score":0.009379692,"about_ca_system_score_codex":0.0016286977,"about_ca_system_score_gemma":0.0017345407,"threshold_uncertainty_score":0.04960519},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007860281,0.00037230106,0.99115175,0.000049508002,0.00004348386,0.000023041568,0.000025213272,0.00017697198,0.00029750247],"genre_scores_gemma":[0.07113956,0.000974534,0.92628485,0.00006050971,0.00007900463,0.00008012221,0.00017069899,0.00009929513,0.001111435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954337,0.00007938454,0.00003591646,0.000068322624,0.00024309233,0.000030002857],"domain_scores_gemma":[0.9993523,0.00023045664,0.000073352734,0.000105093284,0.00021789296,0.000020861116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005601376,0.0008478182,0.0007100513,0.001243759,0.00027879517,0.00063991064,0.0005758338,0.00069213886,0.00061789254],"category_scores_gemma":[0.0022814102,0.0003387307,0.00086521026,0.0011238379,0.0003529566,0.00085027475,0.0004962615,0.0008303805,0.0006005132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021640466,0.00007696347,0.000999156,0.00030658877,0.00011433541,0.00024366513,0.0001056476,0.015045437,0.2480559,0.005760861,0.0015548014,0.7275202],"study_design_scores_gemma":[0.00008365347,0.00043965818,0.006248361,0.00009168909,0.00021242877,0.0012184579,0.000106803884,0.68088263,0.28141752,0.011176017,0.018004758,0.00011803118],"about_ca_topic_score_codex":0.0005952584,"about_ca_topic_score_gemma":0.0006981142,"teacher_disagreement_score":0.001243759,"about_ca_system_score_codex":0.00019277852,"about_ca_system_score_gemma":0.0004997198,"threshold_uncertainty_score":0.0029622912},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001952209,0.004430017,0.97351235,0.0018913277,0.00019666497,0.000018730243,0.00011299466,0.00007811193,0.017807532],"genre_scores_gemma":[0.46333802,0.030718312,0.4733279,0.0030257725,0.0050999303,0.0004902116,0.0005435359,0.00014130688,0.023314904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998825,0.00037874165,0.000060599352,0.00019139679,0.00047519346,0.00006901306],"domain_scores_gemma":[0.9987482,0.0008229972,0.00009759414,0.00013119534,0.00017124302,0.000028818253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013385555,0.001024024,0.00085452024,0.0012973975,0.00037299702,0.002423548,0.0011152788,0.0014984272,0.0028005221],"category_scores_gemma":[0.0028487267,0.00037782534,0.0008039422,0.0013589109,0.0028120847,0.0027131476,0.0011934293,0.0023149014,0.0009116091],"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.000021562062,0.000013813361,0.00012157954,0.00019605288,0.00004401229,0.00009759079,0.00010163546,0.048166405,0.0025319715,0.9190673,0.0019456059,0.02769245],"study_design_scores_gemma":[0.000011592681,0.00006029736,0.00015717157,0.00006166684,0.000020678213,0.000172504,0.000038362876,0.12591761,0.000988572,0.8586984,0.013845445,0.00002760793],"about_ca_topic_score_codex":0.0007171586,"about_ca_topic_score_gemma":0.00037767465,"teacher_disagreement_score":0.0028005221,"about_ca_system_score_codex":0.0009984495,"about_ca_system_score_gemma":0.0006730298,"threshold_uncertainty_score":0.009368658},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004758489,0.0012521647,0.9909791,0.00006673324,0.00017327984,0.00002762967,0.000040773302,0.00028724765,0.002414665],"genre_scores_gemma":[0.113456696,0.00439142,0.87242174,0.000181559,0.00036031898,0.00009899889,0.00043912043,0.00017919921,0.008470922],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994729,0.000082536084,0.000027707121,0.00012188751,0.000258511,0.000036370588],"domain_scores_gemma":[0.9996087,0.00014189929,0.00004528402,0.000058274072,0.00013061035,0.000015269248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004554123,0.0009182802,0.0010474474,0.0010060152,0.00033259505,0.0010339086,0.00062092365,0.0011765569,0.0024511048],"category_scores_gemma":[0.0015348194,0.0002445595,0.0006971296,0.0012499647,0.00047631923,0.001442137,0.0008494022,0.0009707822,0.0023307598],"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.00024769644,0.00013533416,0.00043548344,0.0005303281,0.00015208703,0.00050539227,0.000083690036,0.040412974,0.24662803,0.029130826,0.0033732574,0.6783648],"study_design_scores_gemma":[0.00004392138,0.00028376214,0.001940138,0.00007611476,0.00013406377,0.0020777753,0.00007173549,0.76183766,0.17205289,0.023131164,0.038256753,0.0000939528],"about_ca_topic_score_codex":0.00040184267,"about_ca_topic_score_gemma":0.00037444974,"teacher_disagreement_score":0.0024511048,"about_ca_system_score_codex":0.00017323332,"about_ca_system_score_gemma":0.0004828345,"threshold_uncertainty_score":0.008199692},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028152533,0.00015389668,0.96978533,0.000077439254,0.000026979933,0.000019222496,0.000027749431,0.0003358618,0.0014209897],"genre_scores_gemma":[0.5786194,0.0002613214,0.41849387,0.00009407247,0.000045487173,0.00004670655,0.00014620421,0.000061965824,0.0022308847],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997913,0.0000516603,0.000012413343,0.00003865213,0.00008405062,0.000021937503],"domain_scores_gemma":[0.99939036,0.0002696329,0.00009103327,0.000086280175,0.00014178807,0.000020963145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039325136,0.00038582683,0.00052230246,0.00047978107,0.00031309933,0.00038708976,0.00034435236,0.0004580528,0.0011105975],"category_scores_gemma":[0.0022446294,0.00017097333,0.00037633712,0.00047648157,0.00056281185,0.0009306707,0.0007593807,0.00043729125,0.00033004038],"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.0012055752,0.00007826292,0.0023237728,0.00044717302,0.00011253363,0.00029987853,0.0003450067,0.29232275,0.13569053,0.040459685,0.002021415,0.52469337],"study_design_scores_gemma":[0.000014299922,0.000059023285,0.00048628292,0.000009075275,0.000015173098,0.00021359242,0.00003052961,0.97348887,0.018224437,0.0060233446,0.001416979,0.000018284509],"about_ca_topic_score_codex":0.0011419033,"about_ca_topic_score_gemma":0.0018365285,"teacher_disagreement_score":0.0011419033,"about_ca_system_score_codex":0.0002629461,"about_ca_system_score_gemma":0.00053224707,"threshold_uncertainty_score":0.0037152767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008854208,0.00019156116,0.9896337,0.00006444884,0.000028575962,0.000008587787,0.000020462909,0.00019027173,0.0010082138],"genre_scores_gemma":[0.36968794,0.0011598129,0.6248455,0.00010759603,0.00023778678,0.00006200389,0.00019618038,0.00014209084,0.0035611144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977547,0.00008183323,0.000012608072,0.000031389318,0.000083655534,0.000014983999],"domain_scores_gemma":[0.99888307,0.0007077816,0.00006200974,0.000094195726,0.0002235829,0.000029348765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005642699,0.0004825764,0.00041487496,0.00058059284,0.0002489302,0.00038371462,0.00032231663,0.0005952025,0.0014571748],"category_scores_gemma":[0.0032275517,0.00025280542,0.00026222406,0.0008973436,0.0004850809,0.00093164935,0.0005232682,0.00054537645,0.00057123834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058013515,0.00012240051,0.0017259058,0.00035766631,0.00008999506,0.00020149683,0.0002950743,0.2355009,0.15572618,0.043145034,0.0023272429,0.5599279],"study_design_scores_gemma":[0.000011615413,0.00005641335,0.0005824786,0.0000134445545,0.000021977785,0.0001265587,0.00001450724,0.96985257,0.022071617,0.005827103,0.0014004526,0.000021261352],"about_ca_topic_score_codex":0.00080964866,"about_ca_topic_score_gemma":0.0010989944,"teacher_disagreement_score":0.0014571748,"about_ca_system_score_codex":0.00013955381,"about_ca_system_score_gemma":0.0004060928,"threshold_uncertainty_score":0.004874766},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007357407,0.00030938638,0.99059147,0.00013660033,0.000050489853,0.000024376908,0.000012719339,0.00023470414,0.0012827604],"genre_scores_gemma":[0.2720355,0.0004459127,0.72541493,0.00010929573,0.000059803617,0.00018894552,0.00005896709,0.000092589355,0.0015940903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995704,0.00016452865,0.000023547793,0.00006396627,0.00015556299,0.000021822992],"domain_scores_gemma":[0.99913627,0.00054472924,0.00004783604,0.000069133785,0.0001787118,0.000023396728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077848166,0.000554551,0.000355846,0.00039453313,0.0002510879,0.0004659515,0.00052056066,0.0008490943,0.0015936533],"category_scores_gemma":[0.00483803,0.0002062002,0.00017981853,0.00036467714,0.00051134103,0.00079411233,0.00044881995,0.0007938051,0.0005853533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006108209,0.00014658248,0.000998537,0.00029808463,0.000054727916,0.00012715814,0.00018605628,0.2884098,0.08919974,0.07990445,0.0049024,0.5351617],"study_design_scores_gemma":[0.000053215805,0.00007777666,0.00025714285,0.000023680019,0.000010252573,0.00007519539,0.000016627799,0.97075033,0.016916838,0.00960345,0.0021947073,0.00002071442],"about_ca_topic_score_codex":0.00053234014,"about_ca_topic_score_gemma":0.0007922171,"teacher_disagreement_score":0.0015936533,"about_ca_system_score_codex":0.00031179402,"about_ca_system_score_gemma":0.0007898253,"threshold_uncertainty_score":0.005331278},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013327985,0.00013036963,0.9978655,0.000036806166,0.000020164056,0.000010683048,0.000012365423,0.00026581713,0.00032544657],"genre_scores_gemma":[0.04051779,0.00026567304,0.95588875,0.0000612068,0.000039802584,0.000088823894,0.00010880793,0.000110687855,0.0029185503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995766,0.00012140442,0.000018601466,0.00007469644,0.0001740523,0.000034633966],"domain_scores_gemma":[0.9996506,0.0001619612,0.000038705963,0.000044753797,0.00009427349,0.000009663653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005328402,0.00072715635,0.00062196486,0.0005040183,0.00035273813,0.0006004866,0.0007799389,0.0009346495,0.0019405494],"category_scores_gemma":[0.0016932767,0.00040164485,0.00047385338,0.0005791754,0.000584512,0.0008132972,0.0006058317,0.0010915358,0.0013530581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020848631,0.000074972006,0.00040420055,0.0001910822,0.00011665758,0.00014049091,0.00019197026,0.349053,0.032625873,0.08218485,0.0064270967,0.5283812],"study_design_scores_gemma":[0.000023673489,0.000028339264,0.00013123402,0.000008851824,0.000011807256,0.00008642596,0.000008991263,0.97895926,0.007046076,0.008401926,0.0052745347,0.000018790368],"about_ca_topic_score_codex":0.0023388625,"about_ca_topic_score_gemma":0.0028847368,"teacher_disagreement_score":0.0023388625,"about_ca_system_score_codex":0.00044954574,"about_ca_system_score_gemma":0.00094396225,"threshold_uncertainty_score":0.0064917803},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00391063,0.0001788544,0.9951692,0.000030375788,0.000016752465,0.000018171833,0.000012203669,0.00012958203,0.00053416967],"genre_scores_gemma":[0.26484895,0.0007524392,0.7321303,0.00005312282,0.000094460396,0.0001225844,0.00008332818,0.00010795137,0.0018069496],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985018,0.00036540916,0.0000912257,0.00021989451,0.00075506145,0.00006670218],"domain_scores_gemma":[0.998408,0.0006800681,0.00019939031,0.00012114458,0.00055292156,0.000038471426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001584553,0.0012952153,0.0009100917,0.0026346846,0.0003088697,0.0011730073,0.0010070839,0.0011222193,0.0010613803],"category_scores_gemma":[0.0045079133,0.00041841238,0.000696437,0.0012164244,0.0010432797,0.0021473896,0.00084789895,0.00095146353,0.00045614067],"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.0005954116,0.00025718394,0.0025460024,0.00051638624,0.00022535569,0.00027907806,0.00021613247,0.23971073,0.15009327,0.07184105,0.0012645205,0.5324549],"study_design_scores_gemma":[0.000018537956,0.00017370866,0.0016991344,0.000027242117,0.00004179824,0.00036103005,0.000043540083,0.9563327,0.028979268,0.0103829065,0.0018904441,0.000049654016],"about_ca_topic_score_codex":0.0010851595,"about_ca_topic_score_gemma":0.0006936425,"teacher_disagreement_score":0.0026346846,"about_ca_system_score_codex":0.0006890847,"about_ca_system_score_gemma":0.0006999943,"threshold_uncertainty_score":0.008380055},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00763442,0.0003280393,0.99053407,0.00011748497,0.00011727418,0.000022193719,0.00003091229,0.00033943506,0.0008761766],"genre_scores_gemma":[0.3226488,0.0006804375,0.67163765,0.00023150985,0.0003232286,0.000117890675,0.00020607747,0.00007289006,0.004081469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843127,0.00029068376,0.00011301187,0.00026712826,0.00077910133,0.00011870669],"domain_scores_gemma":[0.99879265,0.00036138817,0.00012391197,0.0002896818,0.00038933707,0.000042950236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012811732,0.00084042794,0.0011388676,0.0010616306,0.000535756,0.0010290242,0.0012347332,0.0013080804,0.0022015404],"category_scores_gemma":[0.0031584003,0.0003416033,0.0008077037,0.0009892139,0.00052495627,0.0023439284,0.0019391396,0.0008598922,0.0008688204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084133545,0.00013669617,0.0008716214,0.00031703498,0.00016928764,0.0002567861,0.00026374773,0.10890292,0.12830584,0.020018075,0.0025761726,0.7373405],"study_design_scores_gemma":[0.00007219738,0.0002950895,0.0010704433,0.000053145373,0.000111171066,0.0008008921,0.000096994714,0.81322247,0.14946191,0.017906843,0.016767843,0.0001410218],"about_ca_topic_score_codex":0.00049085316,"about_ca_topic_score_gemma":0.0007664074,"teacher_disagreement_score":0.0022015404,"about_ca_system_score_codex":0.0004401424,"about_ca_system_score_gemma":0.0005525785,"threshold_uncertainty_score":0.007364869},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027144975,0.000040243838,0.99669755,0.00001877662,0.000011881033,0.000022545744,0.00001628234,0.0002210125,0.0002572185],"genre_scores_gemma":[0.07423752,0.00012473631,0.92321396,0.000064842934,0.000038385795,0.00010463488,0.0001231827,0.000084716594,0.0020080474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991322,0.00019057361,0.00006738554,0.00024188118,0.00028615445,0.00008167769],"domain_scores_gemma":[0.9989312,0.0005222507,0.00012741162,0.00011940734,0.000264266,0.000035455716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001653958,0.00092600274,0.0010742889,0.0014543793,0.0005043785,0.0009250252,0.0012097544,0.0020315805,0.004768076],"category_scores_gemma":[0.0041958936,0.0005298733,0.0011218378,0.0010974653,0.0007325341,0.0014676418,0.0010459048,0.0008009063,0.0024098356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068099244,0.00025102057,0.0016684817,0.00028269077,0.00015828709,0.00016989066,0.00014504422,0.15765524,0.07507033,0.021016855,0.0022932221,0.740608],"study_design_scores_gemma":[0.000037036458,0.000115111114,0.0007458329,0.0000132852865,0.00003701019,0.00013337354,0.000022640601,0.97210187,0.01943499,0.00461097,0.0027173336,0.000030473408],"about_ca_topic_score_codex":0.003413118,"about_ca_topic_score_gemma":0.00223625,"teacher_disagreement_score":0.004768076,"about_ca_system_score_codex":0.00053352397,"about_ca_system_score_gemma":0.0014617704,"threshold_uncertainty_score":0.015950799},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026165291,0.000331567,0.9893512,0.00009613126,0.00022567669,0.000060103448,0.00013734652,0.0065134126,0.0006679715],"genre_scores_gemma":[0.026086131,0.00027828696,0.9677069,0.00013264576,0.00012927358,0.00013206311,0.00040720473,0.0011821066,0.0039454093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999188,0.00022140422,0.000037432255,0.00018565006,0.00029644737,0.000071115275],"domain_scores_gemma":[0.9988422,0.00036402082,0.00008752944,0.00036594513,0.0002706592,0.0000697072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019785187,0.0020533733,0.001107655,0.001375306,0.00086050294,0.0014745586,0.0018372306,0.0016590079,0.0064809113],"category_scores_gemma":[0.0043155933,0.0007006951,0.0011136273,0.0011118741,0.00085506315,0.0014320367,0.0017234383,0.0017925927,0.0038612117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010210245,0.00016353728,0.0006017448,0.00037270298,0.000286865,0.00030870095,0.00014634425,0.015760243,0.08966346,0.01506232,0.019730218,0.85688275],"study_design_scores_gemma":[0.0002455629,0.0003003919,0.0025567217,0.000066675115,0.00020431323,0.0010911664,0.000059982394,0.74369705,0.17702848,0.021862501,0.05273194,0.0001552693],"about_ca_topic_score_codex":0.0025545817,"about_ca_topic_score_gemma":0.0063210907,"teacher_disagreement_score":0.0064809113,"about_ca_system_score_codex":0.00034184146,"about_ca_system_score_gemma":0.0016441145,"threshold_uncertainty_score":0.021680772},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16066857,0.00019535904,0.8360805,0.00014053978,0.00005280329,0.000060530554,0.0002821666,0.0014533133,0.0010662168],"genre_scores_gemma":[0.89227486,0.0002610302,0.104147054,0.00003681388,0.00003362466,0.00010332618,0.0006160918,0.00014213056,0.0023850584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995888,0.00019174875,0.00001139726,0.000083852996,0.00008841215,0.00003575841],"domain_scores_gemma":[0.99891806,0.0006694484,0.00011147539,0.000076257194,0.00019566498,0.000029180883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011031501,0.001186289,0.00058713125,0.0008506362,0.00019953879,0.0004607012,0.00064042927,0.0006261077,0.0015655496],"category_scores_gemma":[0.004139651,0.00030193015,0.0005223254,0.0011639794,0.00024434368,0.00053804304,0.0003435855,0.0009993488,0.001011817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015519268,0.000106342624,0.003760362,0.00004481581,0.00007578455,0.00004299483,0.000042283154,0.914834,0.004498474,0.0013832002,0.0010664945,0.07398998],"study_design_scores_gemma":[0.000002475352,0.000012578875,0.00053460064,0.0000015852183,0.00000426627,0.000003938091,0.0000033140868,0.99871945,0.0004393487,0.00019918772,0.00007551557,0.0000037963887],"about_ca_topic_score_codex":0.010564416,"about_ca_topic_score_gemma":0.0068979464,"teacher_disagreement_score":0.010564416,"about_ca_system_score_codex":0.00037331614,"about_ca_system_score_gemma":0.00067247555,"threshold_uncertainty_score":0.021005869},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014122692,0.00005059942,0.9980552,0.000030427029,0.000008662536,0.000011091478,0.000009477873,0.00012642457,0.00029576442],"genre_scores_gemma":[0.07167527,0.000188271,0.92609775,0.00006635762,0.000038434304,0.00008453955,0.00011431187,0.00008675787,0.0016484223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880123,0.0004483459,0.00006966281,0.00018411524,0.00041694514,0.00007972824],"domain_scores_gemma":[0.9985505,0.0006954437,0.000120436096,0.00023607558,0.00035172745,0.000045817742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012647272,0.00091554306,0.0009476185,0.0005405098,0.00046746817,0.0008415739,0.0010529256,0.0009400482,0.0022270733],"category_scores_gemma":[0.004797905,0.00046152447,0.0007060614,0.0009977672,0.0006470041,0.0014747762,0.0012782289,0.0012398981,0.0012063477],"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.00021413027,0.00014683172,0.0011284755,0.0002036386,0.00011498057,0.00019853526,0.00017479353,0.48470885,0.044487342,0.09452547,0.003569151,0.37052783],"study_design_scores_gemma":[0.000013880396,0.000028786066,0.00008486434,0.0000038318076,0.000006395522,0.0000675667,0.0000073204,0.98948973,0.0043372666,0.0048304284,0.0011174357,0.000012504878],"about_ca_topic_score_codex":0.002956913,"about_ca_topic_score_gemma":0.00529467,"teacher_disagreement_score":0.002956913,"about_ca_system_score_codex":0.0005852102,"about_ca_system_score_gemma":0.0014846879,"threshold_uncertainty_score":0.0074502826},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029275527,0.00015775491,0.9958878,0.000047213096,0.000050447376,0.000095336254,0.00006155623,0.0002724557,0.0004998298],"genre_scores_gemma":[0.07940843,0.00024637175,0.9175582,0.00009099054,0.000085165484,0.0009133247,0.0004906246,0.00031736263,0.00088954234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922133,0.0038429708,0.00045654623,0.0017041919,0.0015076777,0.00027524124],"domain_scores_gemma":[0.9872268,0.007230892,0.00079861446,0.002941022,0.0016306035,0.00017216848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0124900285,0.0020593696,0.0019666662,0.0027013433,0.0010073449,0.0014259728,0.0017045018,0.0018304478,0.005981637],"category_scores_gemma":[0.034048714,0.00056271016,0.002035989,0.0027361107,0.0020909063,0.0027151196,0.00164265,0.0024912674,0.0018427926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008103968,0.00031436942,0.0035234627,0.00085306837,0.0009608536,0.00026227022,0.00056714646,0.0993641,0.030230364,0.07641349,0.006212876,0.7804876],"study_design_scores_gemma":[0.00014843843,0.00059771363,0.009608268,0.0001757082,0.0003925045,0.00048873556,0.00023671627,0.8066027,0.03348366,0.1270135,0.020989629,0.00026233256],"about_ca_topic_score_codex":0.0009278839,"about_ca_topic_score_gemma":0.0012753893,"teacher_disagreement_score":0.0124900285,"about_ca_system_score_codex":0.00077068567,"about_ca_system_score_gemma":0.0022262502,"threshold_uncertainty_score":0.066054404},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003517815,0.00008026826,0.9961371,0.000018453253,0.000008967421,0.0000065384875,0.000004896316,0.000048837323,0.00017712833],"genre_scores_gemma":[0.09712081,0.00044665442,0.9007155,0.00003468595,0.000049907674,0.00006259926,0.00008504435,0.000049824786,0.0014349888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964595,0.00010844224,0.000027313317,0.00006773243,0.00012670796,0.000023929571],"domain_scores_gemma":[0.99933064,0.0004218926,0.00007522106,0.000054077078,0.000100530175,0.000017742126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006879865,0.00065430894,0.00074343116,0.0005878648,0.00030287897,0.00059941586,0.0004975792,0.0008708216,0.0010892926],"category_scores_gemma":[0.0016224997,0.00026668631,0.0005952042,0.0005582585,0.00052483066,0.0014214463,0.0005352375,0.0007508801,0.0004556298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038422938,0.00013627937,0.0009241032,0.00045966706,0.00012947847,0.00019980273,0.00022446181,0.22561106,0.14438055,0.077166505,0.0014023099,0.54898155],"study_design_scores_gemma":[0.00003186117,0.00007535058,0.0003494225,0.0000125562865,0.000019150799,0.00016810575,0.000012568901,0.96028453,0.02149417,0.0153936995,0.002138486,0.00002007509],"about_ca_topic_score_codex":0.00048173376,"about_ca_topic_score_gemma":0.00046513614,"teacher_disagreement_score":0.0010892926,"about_ca_system_score_codex":0.0002762872,"about_ca_system_score_gemma":0.0005218203,"threshold_uncertainty_score":0.0036441088},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037219329,0.00009611815,0.9954566,0.00006208435,0.00002446054,0.000011641299,0.0000065576987,0.000085531006,0.00053518295],"genre_scores_gemma":[0.07339661,0.00044325352,0.9227738,0.000052292617,0.00009177063,0.000088650995,0.000047403293,0.00006397476,0.0030423317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996867,0.000078810226,0.00001534675,0.00003694233,0.00016566733,0.000016520828],"domain_scores_gemma":[0.9997603,0.00009323927,0.000038376053,0.000025010384,0.00006927171,0.000013744873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039244056,0.0007132327,0.0007035838,0.00060371397,0.000311363,0.00045924945,0.00058487756,0.0007771575,0.0012491263],"category_scores_gemma":[0.000969587,0.00027501024,0.0004970041,0.0006163028,0.0007485553,0.0012081382,0.0007067154,0.0009736819,0.0004899335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017900126,0.00008208145,0.00040621855,0.00031079777,0.00008700897,0.00019581005,0.00024616948,0.4326685,0.065548696,0.10980804,0.0042665047,0.38620117],"study_design_scores_gemma":[0.000015895308,0.00003434009,0.000072627634,0.0000053424446,0.0000051090447,0.000060014525,0.0000059134854,0.9822379,0.0046124402,0.010534858,0.0023993442,0.000016185953],"about_ca_topic_score_codex":0.0009008389,"about_ca_topic_score_gemma":0.0009275383,"teacher_disagreement_score":0.0012491263,"about_ca_system_score_codex":0.00029734778,"about_ca_system_score_gemma":0.00082648045,"threshold_uncertainty_score":0.0041787624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03213629,0.0002405124,0.96675473,0.000070438946,0.000024621331,0.000013948874,0.000012182016,0.00015875508,0.0005884589],"genre_scores_gemma":[0.7597326,0.0006595532,0.23650232,0.00006124308,0.000057523168,0.00007944013,0.00007921778,0.000035257122,0.0027928278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971384,0.00009530813,0.000016690314,0.00005808317,0.000095577656,0.000020474396],"domain_scores_gemma":[0.9994054,0.00036300367,0.000103658305,0.000048005837,0.000067383146,0.000012545185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048176383,0.00039227636,0.00054397393,0.00042308605,0.00026345951,0.00043569267,0.0003000969,0.00058411044,0.00037755026],"category_scores_gemma":[0.0018106978,0.00020467857,0.00040857424,0.0003454753,0.0005143792,0.0007206251,0.0006079374,0.00044904763,0.00014319063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027267684,0.000053709744,0.002404179,0.00027803582,0.0001460513,0.000317328,0.00027563534,0.72524947,0.085985854,0.059918277,0.000733095,0.124365754],"study_design_scores_gemma":[0.000009137083,0.000046539633,0.00027596828,0.000006647553,0.000010091872,0.00008874883,0.000008873829,0.984938,0.0063189743,0.00753917,0.00074112724,0.000016628404],"about_ca_topic_score_codex":0.00083463284,"about_ca_topic_score_gemma":0.0006020364,"teacher_disagreement_score":0.00083463284,"about_ca_system_score_codex":0.00024172665,"about_ca_system_score_gemma":0.00049057696,"threshold_uncertainty_score":0.0025478601},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011193197,0.016020142,0.918199,0.0002782349,0.0009855445,0.0000365596,0.00015452526,0.0017054213,0.06150124],"genre_scores_gemma":[0.031848185,0.033411518,0.44240916,0.0006351522,0.0012942445,0.00016165587,0.0008615256,0.0011326722,0.48824587],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997663,0.000019086401,0.00000949071,0.000044765213,0.0001504996,0.000009818403],"domain_scores_gemma":[0.99968815,0.00012229383,0.0000149621565,0.000059252827,0.00010661878,0.000008700449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021300695,0.00096901495,0.0007602698,0.00091357384,0.00026439258,0.0010952256,0.00085020025,0.00088592945,0.023659106],"category_scores_gemma":[0.00068598543,0.0003894724,0.00029141505,0.0013668226,0.0004295652,0.0013293257,0.00080208434,0.0011365912,0.018654203],"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.000030300049,0.0000258883,0.000039686067,0.00032995624,0.000015888018,0.00004061185,0.000046349018,0.0045625116,0.017922908,0.021585079,0.037195385,0.9182054],"study_design_scores_gemma":[0.000016507729,0.00010949454,0.0007473836,0.00030454842,0.00006871107,0.0013190513,0.00006240673,0.08849493,0.054673947,0.064704075,0.7893964,0.00010258033],"about_ca_topic_score_codex":0.00028535494,"about_ca_topic_score_gemma":0.0006051,"teacher_disagreement_score":0.023659106,"about_ca_system_score_codex":0.00020663417,"about_ca_system_score_gemma":0.00033197607,"threshold_uncertainty_score":0.07914764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002944101,0.001012686,0.99173623,0.00016098753,0.00018519555,0.0000138245405,0.000022324097,0.00028761904,0.0036370575],"genre_scores_gemma":[0.19119139,0.0032055846,0.7990911,0.00020766094,0.00047696545,0.00006224134,0.000087656066,0.00008531529,0.005592142],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99965,0.00010778014,0.000015157826,0.00006844738,0.00013557028,0.000022963084],"domain_scores_gemma":[0.9995003,0.0002793544,0.000016531156,0.000051359653,0.00013864198,0.000013792343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000491522,0.00065017765,0.00051140535,0.00076232,0.0003462602,0.00067599164,0.00037402587,0.000726111,0.0013748693],"category_scores_gemma":[0.001669704,0.00022299477,0.0005768154,0.00073751464,0.0006981036,0.00059015217,0.0005107423,0.0011232354,0.0008568905],"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.0001631675,0.000070629736,0.0012744914,0.00032441344,0.0002112505,0.00038078436,0.00020066938,0.15961576,0.053301953,0.10991822,0.0053893877,0.6691492],"study_design_scores_gemma":[0.000019845398,0.0001515298,0.00066480285,0.00004750876,0.00007666622,0.00090688275,0.00003990107,0.856927,0.043623287,0.05326422,0.044220727,0.000057595294],"about_ca_topic_score_codex":0.00079193176,"about_ca_topic_score_gemma":0.00080715696,"teacher_disagreement_score":0.0013748693,"about_ca_system_score_codex":0.0003652258,"about_ca_system_score_gemma":0.00039770038,"threshold_uncertainty_score":0.0045993924},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026464718,0.00017943968,0.99638075,0.00007133426,0.00008448119,0.000030758056,0.000016759075,0.00022654547,0.00036346086],"genre_scores_gemma":[0.041390676,0.00024531354,0.95552224,0.00009801033,0.00011932811,0.0000757347,0.00008783159,0.00005945557,0.002401439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995484,0.00006272431,0.000027709268,0.00008240098,0.00023906537,0.000039666338],"domain_scores_gemma":[0.99960345,0.00008052009,0.000059822614,0.00009676815,0.00013243992,0.000027075586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005406682,0.0007026102,0.00059969217,0.00067088765,0.00045738023,0.00067218114,0.00089669746,0.0012690387,0.0031088386],"category_scores_gemma":[0.001032593,0.000331033,0.000482403,0.0006070553,0.0005782174,0.0013774879,0.0007048549,0.001462018,0.0023151669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002563334,0.00014816923,0.00044252886,0.000321771,0.00007822154,0.00014666245,0.00010634811,0.023164831,0.33357972,0.04494197,0.0039603,0.5928532],"study_design_scores_gemma":[0.00026663448,0.0006006736,0.0011950823,0.000050244016,0.000080942045,0.0013638607,0.000030238882,0.71005404,0.2235308,0.022283144,0.04037108,0.00017331731],"about_ca_topic_score_codex":0.00037987492,"about_ca_topic_score_gemma":0.0007302215,"teacher_disagreement_score":0.0031088386,"about_ca_system_score_codex":0.00030244354,"about_ca_system_score_gemma":0.0007781776,"threshold_uncertainty_score":0.010400057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04694114,0.00054771866,0.95108026,0.00011291254,0.00007196225,0.000030843086,0.00003224695,0.0004979218,0.0006850069],"genre_scores_gemma":[0.44922662,0.00071377674,0.5483251,0.00006692492,0.00011657296,0.00007618106,0.00016492972,0.000049447546,0.0012603564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996488,0.000068721354,0.000024534944,0.00005912282,0.00016694823,0.000031797605],"domain_scores_gemma":[0.99953496,0.0002459893,0.000046630004,0.00004366777,0.0001137768,0.000015030595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005863947,0.0006795035,0.00072878797,0.0011799864,0.000179127,0.00050739927,0.00037638898,0.00073177356,0.00058423437],"category_scores_gemma":[0.00206172,0.00022666788,0.00054235914,0.00065267377,0.00029890507,0.00081040506,0.00031614563,0.00040801064,0.00029526153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039689464,0.00017914832,0.003347455,0.0001777496,0.00020345362,0.00027584613,0.00009073411,0.07165483,0.1287666,0.0038313023,0.0015039397,0.78957206],"study_design_scores_gemma":[0.000044083383,0.00024290901,0.0045512095,0.00002393289,0.00014186632,0.0003406932,0.000031438463,0.9186962,0.06968455,0.0042439015,0.0019577486,0.00004144949],"about_ca_topic_score_codex":0.0008393647,"about_ca_topic_score_gemma":0.0010614232,"teacher_disagreement_score":0.0011799864,"about_ca_system_score_codex":0.00021491213,"about_ca_system_score_gemma":0.00033707474,"threshold_uncertainty_score":0.00310117},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49366382,0.0003727727,0.46449947,0.0013068343,0.00030672338,0.00017688407,0.0004445044,0.0007502679,0.038478713],"genre_scores_gemma":[0.97639227,0.00010038453,0.020017851,0.00013858629,0.000032606782,0.00012207718,0.00009042905,0.000070642476,0.0030350878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953246,0.00019078073,0.000019570945,0.000041394527,0.00013592704,0.00007988072],"domain_scores_gemma":[0.99847895,0.00089349545,0.000108336724,0.0001983072,0.00020506649,0.00011588688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065525377,0.00037490606,0.0006638963,0.00053394726,0.00044463715,0.00088467,0.0010588049,0.0013802573,0.004231451],"category_scores_gemma":[0.0037098639,0.00025270422,0.0004891108,0.0005500944,0.0008064847,0.0014565324,0.0009601758,0.00094821147,0.00043477907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006585419,0.000026878988,0.0002929823,0.00002557337,0.00001728128,0.000105311294,0.00006994855,0.9188781,0.0016864975,0.076517776,0.00043261505,0.0018811199],"study_design_scores_gemma":[0.0000075677535,0.0000051912407,0.000024339199,0.0000014046987,0.000001041192,0.000004443921,0.0000036205604,0.99441886,0.00015076803,0.0052675204,0.0001119696,0.0000032827193],"about_ca_topic_score_codex":0.003782224,"about_ca_topic_score_gemma":0.0017895458,"teacher_disagreement_score":0.004231451,"about_ca_system_score_codex":0.0006150069,"about_ca_system_score_gemma":0.00069647154,"threshold_uncertainty_score":0.014155626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05386303,0.0007969383,0.93067247,0.00022625508,0.00012918124,0.00012922077,0.000045194472,0.0011532402,0.012984474],"genre_scores_gemma":[0.31549165,0.00090977753,0.671954,0.00014931566,0.000091582806,0.00008630913,0.00011276808,0.00013859445,0.011066086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997187,0.00005947867,0.000021048092,0.00005229383,0.00012537366,0.000022960152],"domain_scores_gemma":[0.9995147,0.00015215245,0.000033274107,0.000093317496,0.00018333444,0.000023270799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004542949,0.00044334502,0.00028507374,0.00051356474,0.0002876716,0.00047692054,0.0004178655,0.0005219586,0.004243517],"category_scores_gemma":[0.0012660669,0.00022894806,0.00021528435,0.00043374332,0.00027085695,0.00062921474,0.00042240217,0.00046131664,0.0019354821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047324417,0.00017684247,0.0013087767,0.00031493304,0.000047116882,0.00045702426,0.00022258829,0.028569825,0.37476057,0.019326728,0.002013492,0.57232887],"study_design_scores_gemma":[0.00013447872,0.0007538868,0.0016236173,0.000078488556,0.00008260701,0.0023870955,0.00010997553,0.28106534,0.6225678,0.013203415,0.07795033,0.00004300096],"about_ca_topic_score_codex":0.00031865752,"about_ca_topic_score_gemma":0.00057203847,"teacher_disagreement_score":0.004243517,"about_ca_system_score_codex":0.00023067558,"about_ca_system_score_gemma":0.00041767413,"threshold_uncertainty_score":0.014195979},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040884852,0.0006374927,0.94188154,0.00015702582,0.00016668414,0.00008063364,0.00013484573,0.004701222,0.011355728],"genre_scores_gemma":[0.6654734,0.00044197528,0.3224228,0.00013103265,0.000048232818,0.00014725514,0.0002578347,0.000092528935,0.010984924],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999882,0.000019435383,0.000006299392,0.00003124547,0.0000440137,0.000017025723],"domain_scores_gemma":[0.9999057,0.000029065794,0.000007779845,0.000015780433,0.000036802117,0.00000481619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015309703,0.00046069565,0.0002707968,0.0002368192,0.00019276988,0.00033734256,0.00055933365,0.0002804785,0.00345164],"category_scores_gemma":[0.00027337586,0.00020534515,0.0002479694,0.00023981348,0.00012545804,0.00030423165,0.00020940216,0.00037799196,0.00080787495],"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.00043246525,0.00017621391,0.0015430792,0.0003613584,0.00014805369,0.00025440115,0.0000665312,0.29788116,0.09587575,0.007898829,0.005903522,0.58945864],"study_design_scores_gemma":[0.000014661833,0.00011293773,0.00090259797,0.000012613763,0.000022519898,0.00012165229,0.0000071617214,0.9785186,0.015631828,0.0008400731,0.003803016,0.0000122922465],"about_ca_topic_score_codex":0.0023299914,"about_ca_topic_score_gemma":0.0041274754,"teacher_disagreement_score":0.00345164,"about_ca_system_score_codex":0.00025328193,"about_ca_system_score_gemma":0.00035063745,"threshold_uncertainty_score":0.01154691},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029289182,0.00016572117,0.99592495,0.00004098446,0.000031621264,0.000029796445,0.000015068916,0.00038511268,0.00047784948],"genre_scores_gemma":[0.05821415,0.0001767886,0.9395112,0.000052106076,0.000037383994,0.00010829392,0.00006196295,0.000039364306,0.0017988328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992906,0.00021283377,0.00004405753,0.00009035157,0.00031735311,0.000044815057],"domain_scores_gemma":[0.9995684,0.00013115915,0.000040625397,0.0000649387,0.00016942788,0.000025394931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000762145,0.0006423395,0.0006187538,0.0008457208,0.0006905523,0.0006598375,0.00073967234,0.000769975,0.0017172791],"category_scores_gemma":[0.0018694103,0.0002800785,0.00040935708,0.00069990155,0.00063127594,0.001051425,0.00074585807,0.00077726715,0.0012978486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047106078,0.00008577681,0.0005850734,0.00012612499,0.000047498383,0.000082724095,0.00012715555,0.061015144,0.043135613,0.036018886,0.002611999,0.855693],"study_design_scores_gemma":[0.00006183878,0.00018370463,0.00045681192,0.000017405904,0.000017832597,0.00024970275,0.000025730615,0.9496441,0.027271861,0.014957952,0.0070649628,0.000048121386],"about_ca_topic_score_codex":0.0009779419,"about_ca_topic_score_gemma":0.0013570349,"teacher_disagreement_score":0.0017172791,"about_ca_system_score_codex":0.00041865397,"about_ca_system_score_gemma":0.0008956301,"threshold_uncertainty_score":0.005744815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0128935985,0.00016433457,0.9859066,0.000098119584,0.000030324021,0.000008412016,0.000014037266,0.00013911916,0.0007455225],"genre_scores_gemma":[0.72919214,0.00042277825,0.26745176,0.000102872466,0.0000965212,0.000060701597,0.00011561267,0.00004773674,0.0025098366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955744,0.00010885288,0.000028121303,0.00009386658,0.00016538924,0.000046294557],"domain_scores_gemma":[0.9995141,0.00019216405,0.00007696234,0.000076919336,0.000120415585,0.000019406458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007886032,0.00045158563,0.00065155624,0.00027512168,0.00031674144,0.000491938,0.0006147648,0.0005456302,0.0007599736],"category_scores_gemma":[0.0021239684,0.0002735075,0.00041006305,0.0005173521,0.0006140993,0.0011486186,0.00090534345,0.0006991439,0.00021724637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022006953,0.000044600987,0.0010082828,0.00007358833,0.00006050348,0.000115660114,0.00010474982,0.76555246,0.014439962,0.03990185,0.0015107123,0.17696758],"study_design_scores_gemma":[0.0000028273612,0.000011232088,0.00006353054,0.0000014220147,0.0000030268257,0.00001385312,0.0000021105836,0.9954407,0.0012417088,0.002985947,0.00022922321,0.000004370592],"about_ca_topic_score_codex":0.002284871,"about_ca_topic_score_gemma":0.0015910859,"teacher_disagreement_score":0.002284871,"about_ca_system_score_codex":0.0004090415,"about_ca_system_score_gemma":0.0007632472,"threshold_uncertainty_score":0.0045431852},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008776845,0.000050965416,0.998401,0.000030612937,0.000015113485,0.0000047694216,0.000007731892,0.00006721132,0.0005448903],"genre_scores_gemma":[0.13233541,0.0010081482,0.8573459,0.00033257567,0.00018798333,0.00011725134,0.00016642347,0.00023405704,0.008272241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984382,0.00051692995,0.0000837909,0.00022184294,0.00067324704,0.00006604146],"domain_scores_gemma":[0.9980422,0.0008497433,0.0001419367,0.0004304362,0.00049360114,0.000041966734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021184022,0.00089015166,0.0006236899,0.0007761998,0.00044229775,0.001387586,0.001245587,0.000787583,0.0016069746],"category_scores_gemma":[0.007509852,0.0003919618,0.00065081246,0.0008317956,0.0009838374,0.0020040828,0.0012633759,0.0025741078,0.0015287633],"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.0001504174,0.00006524541,0.0016017517,0.00030372056,0.00012502013,0.0003094452,0.0003592778,0.42766187,0.03532144,0.28687462,0.003441531,0.24378566],"study_design_scores_gemma":[0.0000055490887,0.000035186567,0.0002123712,0.000018509721,0.000014139506,0.00028651705,0.000025852376,0.9540561,0.008361023,0.03136099,0.0056002834,0.000023462679],"about_ca_topic_score_codex":0.0014610918,"about_ca_topic_score_gemma":0.0012451243,"teacher_disagreement_score":0.0021184022,"about_ca_system_score_codex":0.0006002314,"about_ca_system_score_gemma":0.00084800395,"threshold_uncertainty_score":0.011203349},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12329602,0.00038269834,0.8730659,0.00016172788,0.00008455912,0.000057372756,0.000120724144,0.00064369873,0.0021873708],"genre_scores_gemma":[0.4734623,0.0006201897,0.52266,0.0000638327,0.0000818946,0.00005429493,0.00040965894,0.00010326455,0.0025445316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998536,0.000021736647,0.000008130126,0.00003006419,0.00007345318,0.000013052833],"domain_scores_gemma":[0.9996501,0.00014971872,0.00004136629,0.000037707527,0.00009852402,0.00002257192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034255217,0.00035903393,0.00029847448,0.0008395791,0.00013320784,0.00038749108,0.00027692592,0.0004155409,0.0009991175],"category_scores_gemma":[0.0018779892,0.00015717348,0.00023039992,0.00042296387,0.00022501177,0.00044070208,0.00033704966,0.00043324436,0.00048974063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004016967,0.00011054838,0.0023214382,0.000120517405,0.00002515376,0.00014843233,0.000072439274,0.019539481,0.34419307,0.003672676,0.0011022347,0.6282924],"study_design_scores_gemma":[0.000056113684,0.00024171341,0.014053645,0.000033754197,0.000039071736,0.0009452431,0.00004382279,0.76847845,0.20779143,0.004250032,0.004020016,0.00004671091],"about_ca_topic_score_codex":0.0006420546,"about_ca_topic_score_gemma":0.0007755768,"teacher_disagreement_score":0.0009991175,"about_ca_system_score_codex":0.00016128,"about_ca_system_score_gemma":0.00026232534,"threshold_uncertainty_score":0.00334239},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006755581,0.00006059297,0.9925613,0.00011635387,0.000008376056,0.00001548588,0.000015961496,0.0001387323,0.0003276231],"genre_scores_gemma":[0.17771627,0.00027348773,0.820285,0.00013298319,0.00007000094,0.000120242774,0.00009015169,0.00018838422,0.0011234028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954176,0.00021729714,0.000021126165,0.000081348146,0.00011179537,0.0000267464],"domain_scores_gemma":[0.9991474,0.00044420498,0.00009748132,0.00017707715,0.00009374642,0.00004017785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012532956,0.00095749693,0.0006114059,0.00040470346,0.0002559554,0.00042721423,0.000764441,0.0006760384,0.0022993532],"category_scores_gemma":[0.0036153847,0.0003609627,0.0005853048,0.00034200525,0.00080804894,0.0012515294,0.0017704994,0.0012727269,0.00046116146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005157625,0.00015293545,0.0009861118,0.00037166683,0.00016612247,0.00017079756,0.00028690347,0.40527636,0.15188017,0.10196985,0.0019299831,0.3362934],"study_design_scores_gemma":[0.00005342186,0.00016633711,0.0007123747,0.000018124118,0.00003265052,0.0001569735,0.000021781778,0.9231387,0.039474107,0.032285426,0.0038944816,0.000045716406],"about_ca_topic_score_codex":0.00083808566,"about_ca_topic_score_gemma":0.0010817146,"teacher_disagreement_score":0.0022993532,"about_ca_system_score_codex":0.0002586056,"about_ca_system_score_gemma":0.0008284047,"threshold_uncertainty_score":0.007692039},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004902928,0.00036120423,0.9940805,0.00008743086,0.000021621163,0.00002019481,0.000054174256,0.00016285533,0.0003090254],"genre_scores_gemma":[0.19840823,0.0017509091,0.7976551,0.00013156074,0.00020557367,0.00013686129,0.0004989553,0.00012538717,0.0010873934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953043,0.00020493015,0.000023688228,0.00007721127,0.00014473371,0.000019004136],"domain_scores_gemma":[0.9981553,0.0011168311,0.00023329872,0.00019012163,0.0002671446,0.000037249098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092361745,0.0007408239,0.00061363005,0.0008733257,0.00027450832,0.00049878756,0.00060586893,0.00065973215,0.00094664766],"category_scores_gemma":[0.0055758306,0.00029829357,0.000667414,0.0013884116,0.00058452983,0.00074624195,0.0005731666,0.0009672108,0.00038555145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023696157,0.00010488255,0.002410898,0.00054499076,0.00024874625,0.0003592037,0.0002338322,0.36897227,0.07108619,0.05228575,0.004800019,0.49871626],"study_design_scores_gemma":[0.0000117970685,0.00006933958,0.00092916924,0.000015803545,0.000035980487,0.00017406735,0.0000129467,0.98299974,0.0052321474,0.007816618,0.0026740313,0.000028420593],"about_ca_topic_score_codex":0.0012477285,"about_ca_topic_score_gemma":0.0020346302,"teacher_disagreement_score":0.0012477285,"about_ca_system_score_codex":0.00020764538,"about_ca_system_score_gemma":0.00045476505,"threshold_uncertainty_score":0.0048846006},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009844102,0.0005042836,0.9961985,0.00008521455,0.000073131574,0.0000124267635,0.000017284408,0.0003586791,0.001766036],"genre_scores_gemma":[0.10081518,0.0021525486,0.8880167,0.00021984217,0.00032200452,0.0001387293,0.00018221229,0.0001116085,0.008041274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996861,0.000091774404,0.000017633392,0.00004984123,0.00012843445,0.000026223464],"domain_scores_gemma":[0.9997484,0.00009415064,0.000020776568,0.000044271084,0.00008527487,0.000007055609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046770216,0.0006527748,0.00052308745,0.0006640143,0.00041027536,0.0007302737,0.00047184946,0.00088604423,0.0024403192],"category_scores_gemma":[0.0011429155,0.00025622864,0.0006584046,0.0008471987,0.0005853826,0.000905913,0.0005186843,0.0010679974,0.0017495787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020050946,0.000065329485,0.00039350204,0.00033017088,0.00014594986,0.00018969903,0.00014204101,0.1585942,0.090988666,0.13646488,0.009390102,0.60309494],"study_design_scores_gemma":[0.00002894478,0.00010949439,0.0004388058,0.000058879836,0.000051891842,0.0003148653,0.00002663923,0.88767904,0.03810094,0.037631866,0.03550149,0.00005714546],"about_ca_topic_score_codex":0.0010060818,"about_ca_topic_score_gemma":0.0011825298,"teacher_disagreement_score":0.0024403192,"about_ca_system_score_codex":0.0005259873,"about_ca_system_score_gemma":0.0006248727,"threshold_uncertainty_score":0.00816375},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024362829,0.000097842756,0.97345394,0.000070259426,0.000028629234,0.000033405977,0.000036725338,0.0001545363,0.0017618592],"genre_scores_gemma":[0.70992726,0.0002827734,0.2841479,0.0000611257,0.000058648944,0.000087145905,0.00015213162,0.000043097625,0.0052398965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997806,0.000056029567,0.000008779306,0.000038224625,0.0000904164,0.000025940033],"domain_scores_gemma":[0.99972695,0.000096437,0.000053333046,0.000042459502,0.00006799273,0.000012646356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033310786,0.00037393713,0.00030987756,0.00034481194,0.00025227354,0.0003389783,0.0003552274,0.0003177574,0.0010967238],"category_scores_gemma":[0.001164377,0.00015942277,0.00024745055,0.00020413793,0.0004899076,0.00052445434,0.00058418646,0.0003805607,0.00028289368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005789717,0.00012041142,0.001681382,0.00026149087,0.00006791383,0.00033074085,0.0002114288,0.45942944,0.11874154,0.08187312,0.0026618019,0.33404174],"study_design_scores_gemma":[0.00001040806,0.000035633042,0.00030438165,0.0000045698716,0.000003919416,0.000095678886,0.0000142027875,0.9824096,0.009490186,0.006669559,0.00095164555,0.000010324444],"about_ca_topic_score_codex":0.00088380766,"about_ca_topic_score_gemma":0.0011632041,"teacher_disagreement_score":0.0010967238,"about_ca_system_score_codex":0.00019803969,"about_ca_system_score_gemma":0.00034053987,"threshold_uncertainty_score":0.0036689043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005767591,0.00090696535,0.9920814,0.00012730098,0.000057369358,0.000034401648,0.000053241878,0.00039100857,0.0005807554],"genre_scores_gemma":[0.059041414,0.0011656302,0.93781114,0.000054220924,0.000056988833,0.000094060546,0.00020106361,0.000061684295,0.0015138303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959606,0.00011480584,0.00002901271,0.000064234075,0.00017859567,0.000017331784],"domain_scores_gemma":[0.9995382,0.00016121042,0.00004961917,0.00009119115,0.0001454337,0.000014389112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005728738,0.0006163054,0.0004954665,0.000978213,0.000263648,0.0005201049,0.0005135515,0.00069018186,0.0018677304],"category_scores_gemma":[0.0018621517,0.00022495708,0.000636647,0.0016274569,0.00041767754,0.0006402294,0.0004689955,0.0006020338,0.00074224506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016901059,0.00005150566,0.0006199999,0.0003907226,0.00014760582,0.00031075816,0.00007261807,0.06343616,0.118453234,0.018701978,0.0040911315,0.7935553],"study_design_scores_gemma":[0.000059309183,0.00016451269,0.0030326103,0.00003950798,0.00008646998,0.0007759677,0.000034583194,0.90284747,0.045331728,0.021124752,0.02642719,0.00007585492],"about_ca_topic_score_codex":0.0011945519,"about_ca_topic_score_gemma":0.0015520205,"teacher_disagreement_score":0.0018677304,"about_ca_system_score_codex":0.00022692606,"about_ca_system_score_gemma":0.0005506187,"threshold_uncertainty_score":0.0062482357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055476895,0.000110030516,0.99895346,0.000017206301,0.00002164886,0.000007577385,0.000012032972,0.00012040981,0.00020282554],"genre_scores_gemma":[0.040120646,0.0005245659,0.95663446,0.000049693994,0.000081996805,0.00011913297,0.00011479458,0.000071580434,0.0022830423],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949276,0.0001643929,0.000025969095,0.00008025436,0.00020076521,0.000035814457],"domain_scores_gemma":[0.9995061,0.00018517525,0.00004825796,0.00006802843,0.00016228117,0.000030089792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005714535,0.0008286203,0.00084283546,0.00082432467,0.0004702949,0.0005062623,0.0009195226,0.0008397371,0.0026558419],"category_scores_gemma":[0.0011535238,0.000297466,0.0007656457,0.00086802815,0.00065924384,0.0012441783,0.0008573515,0.0011118911,0.001365982],"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.00018084694,0.00009980203,0.00035302996,0.00041123354,0.00014365245,0.00015890371,0.0001373793,0.15332927,0.079439364,0.07314187,0.004870622,0.68773407],"study_design_scores_gemma":[0.000019063684,0.00009212659,0.00017136123,0.0000157015,0.000017767306,0.00024160068,0.000017578375,0.9719305,0.010642654,0.008891151,0.007915857,0.000044561613],"about_ca_topic_score_codex":0.0010594603,"about_ca_topic_score_gemma":0.0012396837,"teacher_disagreement_score":0.0026558419,"about_ca_system_score_codex":0.000250365,"about_ca_system_score_gemma":0.00091858726,"threshold_uncertainty_score":0.008884668},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47873715,0.0013788115,0.5111826,0.00030405578,0.000059704955,0.000058054637,0.0007195957,0.00029695002,0.0072629997],"genre_scores_gemma":[0.8756214,0.0013006832,0.119825795,0.000054053908,0.000056695793,0.000029958725,0.0005359773,0.000057905167,0.0025176317],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99995446,0.000006843823,0.0000015279461,0.000014531851,0.000015150937,0.0000074884933],"domain_scores_gemma":[0.9997863,0.000053259108,0.00004427521,0.000042818898,0.00005989556,0.000013409138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010962415,0.00014967419,0.000101030084,0.00059970416,0.00014400683,0.00032208476,0.00017843694,0.00013281073,0.0013795326],"category_scores_gemma":[0.0005285756,0.00009558731,0.00019087267,0.0005963521,0.00037291666,0.0004640969,0.00022724111,0.00027537596,0.00024326253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040647484,0.00008714149,0.005170578,0.00046945398,0.00007600413,0.0003980306,0.00042817977,0.095791034,0.6400716,0.05221053,0.0018081183,0.20308284],"study_design_scores_gemma":[0.00003641359,0.00032725025,0.059758905,0.000051257495,0.00014432294,0.0014285205,0.00026991143,0.74175775,0.13055566,0.050753176,0.014835619,0.00008123292],"about_ca_topic_score_codex":0.0015344255,"about_ca_topic_score_gemma":0.0023219315,"teacher_disagreement_score":0.0015344255,"about_ca_system_score_codex":0.000161588,"about_ca_system_score_gemma":0.0002527201,"threshold_uncertainty_score":0.004614949},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024446081,0.00022161717,0.9905033,0.0010807647,0.000115514216,0.00008404142,0.000020452744,0.00068554387,0.004844148],"genre_scores_gemma":[0.0633359,0.00048340578,0.92967445,0.0005946991,0.000096311756,0.00016797967,0.00008617685,0.0001333448,0.0054276935],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986513,0.0005065865,0.0001381187,0.0001389256,0.00046840598,0.000096581614],"domain_scores_gemma":[0.9961205,0.002077108,0.00021090159,0.0004999378,0.0009652386,0.00012624606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020656432,0.0007658311,0.0004096973,0.0007226043,0.0005721124,0.0018345454,0.001703732,0.0014867852,0.01750152],"category_scores_gemma":[0.006611308,0.0005367898,0.0004330637,0.0006566193,0.00078775943,0.0026473638,0.00090788695,0.0014443651,0.0060114088],"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.00092136965,0.00017296957,0.0021305091,0.0012089366,0.000110521716,0.0007612693,0.0004946876,0.07923664,0.15203948,0.20393269,0.0121561,0.5468348],"study_design_scores_gemma":[0.0006468988,0.0019368127,0.0019617449,0.00062389177,0.00023488139,0.004350504,0.0005689046,0.3583321,0.1801479,0.08200081,0.36896732,0.00022823048],"about_ca_topic_score_codex":0.0012763804,"about_ca_topic_score_gemma":0.0019246276,"teacher_disagreement_score":0.01750152,"about_ca_system_score_codex":0.00075224985,"about_ca_system_score_gemma":0.00093415455,"threshold_uncertainty_score":0.05854845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029668257,0.00016643338,0.9693414,0.00005007178,0.000017286431,0.000011479162,0.000022893728,0.0001452695,0.00057689595],"genre_scores_gemma":[0.69643795,0.00037646628,0.3012236,0.000040183066,0.000058500762,0.00005183666,0.000103225466,0.000025997288,0.0016822307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996574,0.00013118796,0.000013471262,0.00005746546,0.00010526602,0.000035296544],"domain_scores_gemma":[0.9994734,0.00031814486,0.000049040624,0.00005853636,0.00008063909,0.000020219886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046712116,0.0003770248,0.0004988739,0.00024437328,0.0002330754,0.00045603348,0.00041622441,0.00044634962,0.00046031884],"category_scores_gemma":[0.0017422464,0.00012583593,0.00026217784,0.0004504083,0.0005848938,0.0007489942,0.00045559267,0.00037200164,0.00018767659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043467176,0.00008935746,0.0011383438,0.000120221135,0.00007706667,0.00010168774,0.00011537818,0.71310246,0.052203435,0.036295265,0.001088053,0.19523412],"study_design_scores_gemma":[0.0000068263053,0.00003454183,0.00009504046,0.0000014710722,0.0000037810307,0.000024859812,0.0000057352436,0.99036485,0.004819185,0.0043432824,0.00029492367,0.0000055251435],"about_ca_topic_score_codex":0.0012903627,"about_ca_topic_score_gemma":0.001050643,"teacher_disagreement_score":0.0012903627,"about_ca_system_score_codex":0.00020698634,"about_ca_system_score_gemma":0.00043711162,"threshold_uncertainty_score":0.0025657415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39400494,0.0009717208,0.59317267,0.0008680803,0.000112247595,0.000054671054,0.00020426439,0.00052311335,0.010088232],"genre_scores_gemma":[0.97406965,0.00041970127,0.022952957,0.00010284319,0.0000719229,0.000057166773,0.00010619849,0.0001369428,0.0020825968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893206,0.00032226884,0.00006272332,0.0001935553,0.00029901083,0.00019036344],"domain_scores_gemma":[0.99015725,0.006588249,0.0011626566,0.00070635934,0.0007254663,0.0006600597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00365714,0.00066942576,0.000925948,0.0019372054,0.00090561004,0.0017763621,0.0014389504,0.0013649429,0.0026924042],"category_scores_gemma":[0.019660765,0.0006224956,0.0011686516,0.0006068864,0.003649538,0.0046252287,0.0016935839,0.0021284372,0.00026234885],"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.000071870316,0.000023643292,0.0014212164,0.00006226891,0.000033305932,0.00040106656,0.00039851587,0.09018686,0.0031926134,0.9002206,0.0005081152,0.0034800137],"study_design_scores_gemma":[0.0000117043155,0.000016417816,0.00057283184,0.000025439254,0.00000925666,0.000122014484,0.00003714771,0.6047355,0.00089624955,0.3931778,0.000362712,0.000032982465],"about_ca_topic_score_codex":0.0017343896,"about_ca_topic_score_gemma":0.0009333262,"teacher_disagreement_score":0.00365714,"about_ca_system_score_codex":0.0018510127,"about_ca_system_score_gemma":0.0007718237,"threshold_uncertainty_score":0.019341052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021266805,0.0023353624,0.9714679,0.00018169962,0.00013307064,0.00006590076,0.000040995266,0.0004823056,0.0040258556],"genre_scores_gemma":[0.21641622,0.0018578382,0.7754723,0.00017537674,0.0001942727,0.000088536195,0.000060392103,0.00005270035,0.0056824125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994281,0.00010369161,0.00001958793,0.000112235466,0.00029416196,0.0000422407],"domain_scores_gemma":[0.9995552,0.0002129961,0.0000436899,0.00006849796,0.00009342858,0.000026163727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046403077,0.00052847713,0.00042387686,0.0005964891,0.00032493362,0.00067623326,0.0009158153,0.00094461907,0.0016897524],"category_scores_gemma":[0.001166463,0.0002683531,0.00042884593,0.0007427255,0.0005763035,0.0011265551,0.00074314175,0.0006842851,0.00044317578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003512482,0.00007971065,0.00038141722,0.00025199322,0.0000792343,0.00038383104,0.00017251934,0.01127571,0.4728453,0.028023358,0.0026667393,0.48348898],"study_design_scores_gemma":[0.00020913676,0.0013830514,0.002758854,0.0001480646,0.00019694999,0.0071503394,0.00017613433,0.46904147,0.451757,0.020438472,0.04649039,0.0002501493],"about_ca_topic_score_codex":0.0009350525,"about_ca_topic_score_gemma":0.0010860458,"teacher_disagreement_score":0.0016897524,"about_ca_system_score_codex":0.0005064894,"about_ca_system_score_gemma":0.0002887204,"threshold_uncertainty_score":0.005652845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025219445,0.00065178965,0.9958413,0.00017868067,0.000014413127,0.000014218728,0.000014795337,0.0000853792,0.0006773062],"genre_scores_gemma":[0.32839575,0.0031759185,0.6537122,0.00028265646,0.00071446825,0.00044004642,0.00047844456,0.00032799237,0.012472477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725753,0.0012956664,0.00016101896,0.00038629363,0.000758741,0.00014082211],"domain_scores_gemma":[0.9866173,0.011562087,0.00042857468,0.00035718238,0.0009214846,0.000113347945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005009036,0.0009289445,0.0013143164,0.0016128906,0.0006499506,0.0017205233,0.0012594878,0.0013071849,0.0035788976],"category_scores_gemma":[0.02759141,0.00085893954,0.0010988573,0.0015317133,0.0015803446,0.0032801179,0.0012562656,0.0018184226,0.0014009498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043638077,0.00014693548,0.0029993313,0.0006067225,0.0002119025,0.00052634574,0.0005337717,0.3737252,0.012804143,0.32115266,0.0042507383,0.28260592],"study_design_scores_gemma":[0.000016373982,0.00003192242,0.00031424168,0.00001215148,0.000011637386,0.00011018546,0.000012231915,0.9682064,0.0017378998,0.02790869,0.0016217101,0.000016593367],"about_ca_topic_score_codex":0.0025404633,"about_ca_topic_score_gemma":0.0010833282,"teacher_disagreement_score":0.005009036,"about_ca_system_score_codex":0.0012193972,"about_ca_system_score_gemma":0.0011471153,"threshold_uncertainty_score":0.026490629},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96961087,0.00040093274,0.025692131,0.00009649356,0.000059464688,0.00019044075,0.00011887909,0.0007629485,0.0030678448],"genre_scores_gemma":[0.9921951,0.00012827093,0.0058394587,0.00004341169,0.00002333273,0.00004259656,0.00014450579,0.000021835556,0.0015614815],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99905866,0.00032675153,0.00006369557,0.000104267776,0.00035101804,0.000095637515],"domain_scores_gemma":[0.9978829,0.00093472056,0.0001326544,0.00014719942,0.00080095726,0.00010161193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009883246,0.00033558215,0.0004122073,0.0006497301,0.00031201524,0.000486905,0.00053753913,0.0007526593,0.0032786855],"category_scores_gemma":[0.004090167,0.00010980388,0.00019612748,0.0003362332,0.00030110913,0.00047425285,0.00025709663,0.00022593017,0.0005542461],"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.012217893,0.0008207768,0.008602,0.0012165316,0.00018854385,0.0007623294,0.0006041176,0.024271253,0.7469878,0.0011385765,0.00096817635,0.20222208],"study_design_scores_gemma":[0.001552164,0.039211847,0.05320252,0.00011083643,0.0007743812,0.0018918057,0.0008221967,0.13394438,0.7564605,0.00060154096,0.011287308,0.00014061153],"about_ca_topic_score_codex":0.0016390105,"about_ca_topic_score_gemma":0.00077225774,"teacher_disagreement_score":0.0032786855,"about_ca_system_score_codex":0.00034136517,"about_ca_system_score_gemma":0.00027448137,"threshold_uncertainty_score":0.010968268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026922007,0.000055727516,0.99922013,0.000017609178,0.00002204578,0.000012048945,0.000013022762,0.00021747741,0.00017266948],"genre_scores_gemma":[0.015016123,0.00014125794,0.9828562,0.00004137029,0.000057048714,0.00018542257,0.00016320284,0.00013175768,0.0014075661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989729,0.00023606174,0.00008576277,0.00028957333,0.00036380225,0.000051953695],"domain_scores_gemma":[0.99901426,0.00045919028,0.00010610905,0.00014565626,0.00025183038,0.00002292866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011912538,0.0014510916,0.0013776309,0.0012046352,0.00081131764,0.0010035455,0.0015691029,0.001604727,0.0043518324],"category_scores_gemma":[0.0047626076,0.000932967,0.0010559502,0.0010925521,0.00063602143,0.0015019416,0.0014381614,0.0026254272,0.0037803126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019216833,0.00006345578,0.000354964,0.00019433069,0.0001430039,0.0001261632,0.00012807986,0.21192046,0.013473943,0.031083347,0.0043741567,0.7379459],"study_design_scores_gemma":[0.00003934981,0.0000487165,0.00021468526,0.000027298178,0.000028992075,0.0001465739,0.000014722316,0.96487314,0.0054423125,0.016171284,0.012953798,0.000039233233],"about_ca_topic_score_codex":0.0017149852,"about_ca_topic_score_gemma":0.0017151984,"teacher_disagreement_score":0.0043518324,"about_ca_system_score_codex":0.00049767364,"about_ca_system_score_gemma":0.0010367463,"threshold_uncertainty_score":0.014558315},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014384942,0.00010656777,0.99777967,0.000022125043,0.000020571657,0.0000143962025,0.000007777294,0.00018714182,0.000423397],"genre_scores_gemma":[0.055077307,0.00028884417,0.94174767,0.0000665773,0.000055903645,0.00011063866,0.00009514864,0.00007532032,0.0024825186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993968,0.00015698308,0.00003101051,0.0001344076,0.00024973016,0.000031111816],"domain_scores_gemma":[0.9993144,0.00025102377,0.000075748016,0.000112277936,0.00022084487,0.000025601148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008743165,0.0008705449,0.0005436479,0.0006686316,0.00045565257,0.00077557913,0.0009359894,0.00080689095,0.0027217488],"category_scores_gemma":[0.00210857,0.00034499954,0.00056259165,0.0008911662,0.0007481527,0.001097274,0.0009192764,0.0016089948,0.001250727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002472547,0.000093242175,0.0007707343,0.00019690393,0.00012277534,0.00010788601,0.00014490815,0.14072187,0.054103278,0.030006489,0.0033104452,0.7701742],"study_design_scores_gemma":[0.000016441873,0.00010516333,0.00039275835,0.000011302954,0.000018439578,0.0001900938,0.000010834684,0.975691,0.015677333,0.0023548338,0.0055006067,0.000031294887],"about_ca_topic_score_codex":0.0012485309,"about_ca_topic_score_gemma":0.001328233,"teacher_disagreement_score":0.0027217488,"about_ca_system_score_codex":0.00034774226,"about_ca_system_score_gemma":0.0010202976,"threshold_uncertainty_score":0.009105206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010585894,0.0000961144,0.98858076,0.00003199684,0.00001314032,0.000015009207,0.000020765849,0.00022025559,0.0004361926],"genre_scores_gemma":[0.27124283,0.00018952244,0.72651005,0.000062318424,0.000046370867,0.000084474814,0.000074478055,0.000030133637,0.0017599079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996056,0.000089521534,0.000021264366,0.00005784147,0.00019330512,0.000032605032],"domain_scores_gemma":[0.9995067,0.00023629918,0.00005290963,0.00008549983,0.00009435661,0.000024230587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039203375,0.00032658738,0.00042014045,0.00040840445,0.00023468002,0.00040488385,0.0005499101,0.00056542654,0.00073730666],"category_scores_gemma":[0.0015078887,0.00020400502,0.00026489748,0.00041420636,0.00044287764,0.00062030763,0.0005313192,0.0005891549,0.0004141576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006357262,0.00012315503,0.0015488626,0.0001829837,0.00012038568,0.00013814046,0.00015051727,0.29863572,0.23614784,0.032741487,0.0014599917,0.42811522],"study_design_scores_gemma":[0.00003624328,0.00010589328,0.00028854865,0.0000059926924,0.000018002913,0.00015001032,0.000005814879,0.9441386,0.04830804,0.0049153813,0.0020055587,0.000021902471],"about_ca_topic_score_codex":0.0010237839,"about_ca_topic_score_gemma":0.0013118527,"teacher_disagreement_score":0.0010237839,"about_ca_system_score_codex":0.0003857222,"about_ca_system_score_gemma":0.00061772496,"threshold_uncertainty_score":0.0027985573},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047675627,0.0002106003,0.9944224,0.000035748264,0.00002915285,0.00001995138,0.000017456472,0.00015001743,0.0003471613],"genre_scores_gemma":[0.082860306,0.00047997708,0.9135321,0.000047030153,0.000065884255,0.00008150856,0.00012532275,0.00005210974,0.0027557744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990589,0.00024523144,0.00005169828,0.00026009924,0.0003307606,0.00005331459],"domain_scores_gemma":[0.9991841,0.00042051726,0.00009897945,0.0001171509,0.0001536516,0.00002563509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010009067,0.0012434764,0.0012323363,0.00056638126,0.00042550635,0.0008307414,0.00077443104,0.0013728086,0.0014397826],"category_scores_gemma":[0.0030160188,0.00046478442,0.0008243863,0.0007525911,0.0007277767,0.0018073804,0.0010440651,0.00091726496,0.0009599221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005641705,0.00014629471,0.00089693745,0.00053314376,0.00020043254,0.00034208846,0.00036360158,0.12457617,0.24909437,0.023758976,0.0016507008,0.59787315],"study_design_scores_gemma":[0.0000528725,0.00020996346,0.00122967,0.000026040258,0.00006612542,0.0007557838,0.00004424244,0.85927916,0.12202604,0.009382216,0.00683354,0.000094320065],"about_ca_topic_score_codex":0.0012118777,"about_ca_topic_score_gemma":0.0015205288,"teacher_disagreement_score":0.0014397826,"about_ca_system_score_codex":0.00032024848,"about_ca_system_score_gemma":0.0009378873,"threshold_uncertainty_score":0.0052933693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002467089,0.002559353,0.9916609,0.00019313353,0.00010921165,0.000029853954,0.000055700275,0.00011677467,0.0028080577],"genre_scores_gemma":[0.15584624,0.01594039,0.82064945,0.0005157759,0.00068893685,0.00023632028,0.00023209713,0.00014974386,0.005741094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992287,0.0002336492,0.00003903054,0.00017899495,0.00028562942,0.00003396207],"domain_scores_gemma":[0.99907494,0.0005527804,0.000057639445,0.00018872555,0.000105540836,0.000020400033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009604092,0.000901375,0.000658715,0.0006584872,0.00039847987,0.0012793251,0.00083674985,0.001393842,0.0016406392],"category_scores_gemma":[0.0023166619,0.0002641978,0.00057469745,0.0008991551,0.0023076236,0.0019321183,0.0011701063,0.0009551503,0.0009674573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026432355,0.00005724679,0.0007517819,0.00091497606,0.00010848468,0.0004914755,0.0004337273,0.057501692,0.08047402,0.35330865,0.0038479248,0.50184566],"study_design_scores_gemma":[0.000049770562,0.00041421453,0.0035098006,0.00042338556,0.00016110398,0.0022921197,0.0002011019,0.45607626,0.081527725,0.3596306,0.095374,0.00033990247],"about_ca_topic_score_codex":0.00085338356,"about_ca_topic_score_gemma":0.0009916249,"teacher_disagreement_score":0.0016406392,"about_ca_system_score_codex":0.00031419017,"about_ca_system_score_gemma":0.0004449817,"threshold_uncertainty_score":0.005488515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006415054,0.0029430152,0.9674319,0.002587825,0.00014436868,0.000020837111,0.00020819205,0.00011836728,0.020130396],"genre_scores_gemma":[0.62397134,0.011137369,0.33611208,0.000938715,0.0018439464,0.00042443397,0.0004534998,0.00017449226,0.024944102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997619,0.00005654577,0.000010001436,0.000060774142,0.00008982957,0.00002094713],"domain_scores_gemma":[0.9996599,0.00018003384,0.000034937086,0.000047612815,0.00005500444,0.000022429442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046223044,0.00082304724,0.00046799428,0.0011483917,0.00037281375,0.0015870217,0.00078574003,0.0008385665,0.0042054714],"category_scores_gemma":[0.0012475033,0.00021978126,0.00067963527,0.0006691106,0.0015619991,0.0028014344,0.0008962217,0.0013228165,0.0009881115],"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.000013089549,0.000011226771,0.00016358466,0.00007583113,0.00002381765,0.000067851724,0.00011219027,0.026866917,0.0035315508,0.9471168,0.0012824964,0.020734664],"study_design_scores_gemma":[0.00000748359,0.000031904096,0.00041191024,0.00002862746,0.000012346663,0.000111288704,0.000027797721,0.1322058,0.0009543693,0.8539104,0.012280504,0.000017623684],"about_ca_topic_score_codex":0.0009836063,"about_ca_topic_score_gemma":0.00049564295,"teacher_disagreement_score":0.0042054714,"about_ca_system_score_codex":0.00074970897,"about_ca_system_score_gemma":0.0004465043,"threshold_uncertainty_score":0.014068663},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77127385,0.0004656926,0.22370131,0.0003724386,0.000034013174,0.00014675703,0.00032031836,0.00037970734,0.0033058643],"genre_scores_gemma":[0.9624746,0.00022333172,0.036301397,0.000025421128,0.000008480472,0.00016310185,0.00020336329,0.00003748671,0.00056285673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997242,0.00018460197,0.000010766562,0.000021828348,0.000039318576,0.000019321884],"domain_scores_gemma":[0.9973068,0.002165985,0.000097923396,0.00014041307,0.00025260015,0.000036179485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010757186,0.00057833537,0.0004888519,0.00047618942,0.00027726675,0.00033594645,0.00044681237,0.00060720375,0.0007241354],"category_scores_gemma":[0.0035980958,0.0002460817,0.00074483803,0.00035991965,0.000278704,0.00032513565,0.00026090533,0.00053040235,0.00009768139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010078634,0.000053559033,0.0017083789,0.000033780994,0.000060718125,0.000055121905,0.000029760635,0.9906279,0.0012148896,0.0012936909,0.00019858625,0.0046229702],"study_design_scores_gemma":[0.000008233079,0.00002611292,0.00028429867,0.0000020589412,0.0000070362453,0.000010266293,0.000003845629,0.9989318,0.00036644403,0.00027979552,0.00007664839,0.000003425861],"about_ca_topic_score_codex":0.009657384,"about_ca_topic_score_gemma":0.006330082,"teacher_disagreement_score":0.009657384,"about_ca_system_score_codex":0.000373961,"about_ca_system_score_gemma":0.00058094074,"threshold_uncertainty_score":0.019202352},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18245949,0.0024464861,0.8014609,0.000397522,0.00025915177,0.00022114927,0.00020529312,0.005760662,0.006789233],"genre_scores_gemma":[0.5599836,0.0018329582,0.43409702,0.00019032566,0.00012698486,0.00021889873,0.00043202259,0.00032998703,0.002788144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998434,0.0005807366,0.000059971848,0.00022195713,0.00054436346,0.00015888026],"domain_scores_gemma":[0.99517244,0.0031867614,0.00014659995,0.0003677458,0.0010223708,0.00010404936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00263157,0.00091845175,0.0009863287,0.0011853052,0.00035960428,0.00081569084,0.0004787313,0.0010514716,0.0017376869],"category_scores_gemma":[0.00933291,0.00032224905,0.00054000487,0.000987871,0.00074294064,0.0016051022,0.00044588035,0.0007102252,0.0010599358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029674275,0.00022124291,0.0027981545,0.0005476065,0.0003306648,0.00021382784,0.00034868103,0.042869143,0.19008864,0.003093837,0.0023726893,0.7541481],"study_design_scores_gemma":[0.00023568096,0.0028390486,0.0259375,0.0001164129,0.00042187158,0.0016824583,0.00033327975,0.7382267,0.21775526,0.004640756,0.007538752,0.00027222498],"about_ca_topic_score_codex":0.0016997714,"about_ca_topic_score_gemma":0.0015741558,"teacher_disagreement_score":0.00263157,"about_ca_system_score_codex":0.00028464085,"about_ca_system_score_gemma":0.00045929276,"threshold_uncertainty_score":0.013917267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033871166,0.00015464041,0.9648529,0.00010812167,0.000024172141,0.00010112852,0.000057831097,0.00044531,0.00038473462],"genre_scores_gemma":[0.18611772,0.00025772984,0.8121139,0.000056682347,0.000023269487,0.00038521853,0.00030972122,0.00027393995,0.00046182447],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992679,0.00027294905,0.000046915557,0.0001319309,0.00022545039,0.000054856486],"domain_scores_gemma":[0.99873024,0.00071856944,0.00011450922,0.00019026017,0.00021794016,0.000028362678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018344868,0.0013648747,0.0007064642,0.0010881086,0.00050434074,0.000769701,0.00072285905,0.00066415704,0.0006479871],"category_scores_gemma":[0.0074956142,0.00046218437,0.0010559421,0.0010169225,0.000807277,0.0008594983,0.0008333919,0.001369261,0.00033101693],"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.00048471105,0.0002674058,0.002591787,0.00059968495,0.00051413465,0.0003221797,0.00046849204,0.3144972,0.26398557,0.016322061,0.0026160511,0.39733064],"study_design_scores_gemma":[0.00003752648,0.00016774039,0.0048767827,0.000020175692,0.00007855966,0.00015918537,0.000035574652,0.91446143,0.070138454,0.00772489,0.002229107,0.00007054397],"about_ca_topic_score_codex":0.0024812438,"about_ca_topic_score_gemma":0.0037065449,"teacher_disagreement_score":0.0024812438,"about_ca_system_score_codex":0.00045966837,"about_ca_system_score_gemma":0.0019581788,"threshold_uncertainty_score":0.009701788},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003030008,0.00020301928,0.9981622,0.00009092773,0.00003535976,0.000006713563,0.000012585447,0.00005200459,0.001134189],"genre_scores_gemma":[0.12655741,0.0030791974,0.8612244,0.00036807364,0.00076583057,0.00022699068,0.00023248087,0.00016810122,0.0073775393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989047,0.00042755427,0.000044245367,0.00018411815,0.00036458627,0.0000747322],"domain_scores_gemma":[0.998774,0.0006725146,0.00012031093,0.0001875539,0.00020243897,0.000043243544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009815973,0.001241688,0.0009667386,0.0017288943,0.0005988662,0.0015739714,0.0014977083,0.0014732182,0.0028238397],"category_scores_gemma":[0.0033830889,0.00059587025,0.0013081278,0.00140305,0.0024138694,0.0026887269,0.002241991,0.0024713813,0.0013723008],"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.000034286903,0.000027190948,0.00013749543,0.00014868489,0.00005983415,0.00013538817,0.00015582489,0.29269907,0.0038100302,0.61796063,0.00310248,0.08172912],"study_design_scores_gemma":[0.0000103136235,0.00007158411,0.00011073395,0.000030462123,0.000018715247,0.00028049684,0.000034927492,0.6770937,0.0024887344,0.3081572,0.011649017,0.000054057302],"about_ca_topic_score_codex":0.0009278538,"about_ca_topic_score_gemma":0.0007094405,"teacher_disagreement_score":0.0028238397,"about_ca_system_score_codex":0.00089017925,"about_ca_system_score_gemma":0.0010950607,"threshold_uncertainty_score":0.009446681},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019443579,0.0001644519,0.997265,0.00002178165,0.000018785233,0.000011746543,0.0000085357005,0.0002233813,0.00034206163],"genre_scores_gemma":[0.16766852,0.0004217939,0.82835543,0.000090174566,0.00007088826,0.00014713625,0.00014086686,0.000118380405,0.0029867964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994024,0.00014412035,0.00004449546,0.00017684604,0.00019515872,0.000036994457],"domain_scores_gemma":[0.9992906,0.00026426505,0.0001124184,0.00008849457,0.00022448531,0.000019778148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011902966,0.0008644612,0.00082863047,0.0006911729,0.00032169468,0.0006299936,0.0015952172,0.0009506906,0.001213051],"category_scores_gemma":[0.002442664,0.00039629062,0.00065049867,0.00071968185,0.00044913217,0.0012961809,0.00069922925,0.0012188826,0.00068751007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013585248,0.00008299903,0.00069294,0.00015328193,0.00012281386,0.000111427595,0.00014672268,0.42198542,0.023101369,0.020464066,0.0022877483,0.53071535],"study_design_scores_gemma":[0.000008392296,0.00003033762,0.00008226801,0.000005554375,0.0000130084,0.00005122323,0.000005173792,0.99379843,0.0029273117,0.001888692,0.0011779725,0.000011603878],"about_ca_topic_score_codex":0.0026218088,"about_ca_topic_score_gemma":0.0027464584,"teacher_disagreement_score":0.0026218088,"about_ca_system_score_codex":0.00041600148,"about_ca_system_score_gemma":0.00057465606,"threshold_uncertainty_score":0.006294906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0097977575,0.0002167412,0.9883046,0.00007349149,0.000048566988,0.000017559109,0.000021115347,0.00047243436,0.0010477597],"genre_scores_gemma":[0.3842133,0.00080067775,0.6075905,0.00019415819,0.00013693617,0.00013336664,0.00019335384,0.00009604042,0.0066417176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921095,0.00017149764,0.000036572186,0.00010756331,0.00038651825,0.00008685865],"domain_scores_gemma":[0.9989247,0.0005429072,0.00010201256,0.00017490088,0.00022692904,0.000028464458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007044335,0.00051139755,0.0007250479,0.00079317606,0.00037985557,0.00093837525,0.00047920516,0.0007480736,0.00091796217],"category_scores_gemma":[0.003141965,0.00028270762,0.0004348035,0.0008453199,0.0007044889,0.0013150615,0.0007988704,0.0006655859,0.0006465042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005975118,0.00016469439,0.0014570722,0.00021809734,0.00018863216,0.000120541605,0.00014600466,0.30599523,0.1079312,0.07566985,0.003952925,0.5035582],"study_design_scores_gemma":[0.000050716044,0.00008553033,0.0006576919,0.000012198066,0.000021823975,0.00016411515,0.000008434169,0.94105285,0.035208154,0.019768583,0.0029336677,0.000036312587],"about_ca_topic_score_codex":0.0012978715,"about_ca_topic_score_gemma":0.0014815179,"teacher_disagreement_score":0.0012978715,"about_ca_system_score_codex":0.0005471702,"about_ca_system_score_gemma":0.0013488445,"threshold_uncertainty_score":0.003970027},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016623545,0.00013116795,0.99744713,0.000047536883,0.000019683028,0.000012282779,0.0000100702155,0.000113350136,0.0005563458],"genre_scores_gemma":[0.07748808,0.00038959263,0.9195778,0.00009606222,0.0002255544,0.00012898385,0.00012781739,0.0001404655,0.0018257742],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988325,0.00031734197,0.000070897426,0.0002550919,0.00044335323,0.000080896694],"domain_scores_gemma":[0.99809057,0.00105505,0.00019678105,0.00020933573,0.0003673046,0.000080909645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001782927,0.0013420454,0.0013743751,0.0019728146,0.0007450834,0.001837528,0.0014522611,0.0017816798,0.0018924356],"category_scores_gemma":[0.005832001,0.00054182665,0.0013793809,0.00161337,0.0015653938,0.003029567,0.0018116409,0.0022133032,0.0009908094],"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.00020451743,0.00006994056,0.0012784548,0.0001791901,0.00015073197,0.00018128366,0.00018664017,0.19782694,0.019919109,0.14970347,0.003889051,0.6264107],"study_design_scores_gemma":[0.000019091643,0.00009669913,0.0006141297,0.000018556919,0.000026007086,0.0002300753,0.000020085663,0.9218996,0.007422379,0.06423014,0.005369861,0.00005340717],"about_ca_topic_score_codex":0.0011446271,"about_ca_topic_score_gemma":0.00095667987,"teacher_disagreement_score":0.0019728146,"about_ca_system_score_codex":0.0005807799,"about_ca_system_score_gemma":0.0008960996,"threshold_uncertainty_score":0.009429097},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021220972,0.001957627,0.989085,0.00019255068,0.00021563667,0.000032229676,0.00009565844,0.0003525381,0.0059467177],"genre_scores_gemma":[0.3100363,0.008547842,0.6579221,0.00093179126,0.002085108,0.00045613863,0.000757495,0.0009966233,0.01826662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926272,0.0016096669,0.00038675097,0.0012038798,0.0034200822,0.0007524525],"domain_scores_gemma":[0.97205985,0.018434782,0.0016649246,0.0031650811,0.004175127,0.00050025055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007555428,0.0027240277,0.0014516963,0.0041280105,0.0010465437,0.0044490364,0.0025901007,0.002200889,0.0087045645],"category_scores_gemma":[0.039277803,0.0009115261,0.0015569377,0.0034383214,0.0021656065,0.0055046775,0.0048165135,0.0052437116,0.0028091418],"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.00037317147,0.0000603189,0.00069291465,0.00041054538,0.00009815826,0.00021954812,0.00021327118,0.42973146,0.011586814,0.435527,0.0058157933,0.11527097],"study_design_scores_gemma":[0.000027596441,0.00010107132,0.00038263708,0.00013314975,0.000055571967,0.0002203423,0.000027505792,0.9033265,0.007254148,0.07859963,0.0098115485,0.000060279614],"about_ca_topic_score_codex":0.0030560482,"about_ca_topic_score_gemma":0.0020377832,"teacher_disagreement_score":0.0087045645,"about_ca_system_score_codex":0.0035791392,"about_ca_system_score_gemma":0.002869435,"threshold_uncertainty_score":0.039957404},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001544638,0.0001004483,0.99793315,0.000020177598,0.000017278693,0.000010979665,0.000006334841,0.00012534538,0.00024165332],"genre_scores_gemma":[0.04031629,0.00026284563,0.9575154,0.00003575551,0.00005890984,0.00007528004,0.00006149524,0.00009459619,0.0015793375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989504,0.00040970978,0.000055577475,0.00019402256,0.00033703804,0.000053220465],"domain_scores_gemma":[0.99892056,0.00048986723,0.00010111705,0.00015764713,0.0002913609,0.000039467675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011292213,0.00092054554,0.0010764797,0.0007866327,0.00058534683,0.000649084,0.0014085486,0.0011135086,0.0012431323],"category_scores_gemma":[0.00270494,0.0005582032,0.0009470278,0.0013908135,0.0010271814,0.0016649726,0.00086953264,0.0014346138,0.0010990398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032786417,0.00010520835,0.0004902617,0.00025136012,0.00015928525,0.00038991802,0.00033672355,0.20430164,0.13395053,0.058000125,0.0021873093,0.5994998],"study_design_scores_gemma":[0.000017782297,0.00013161989,0.00041325175,0.000008671823,0.000033249627,0.00042556014,0.000026730384,0.9387506,0.03891108,0.013883575,0.007340279,0.000057432728],"about_ca_topic_score_codex":0.001273531,"about_ca_topic_score_gemma":0.0012781773,"teacher_disagreement_score":0.0014085486,"about_ca_system_score_codex":0.00037565143,"about_ca_system_score_gemma":0.0007954365,"threshold_uncertainty_score":0.005971968},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017611025,0.0020122044,0.97519016,0.000086665896,0.00008668541,0.00006296786,0.00014157937,0.0022633402,0.0025453935],"genre_scores_gemma":[0.19123887,0.0022259483,0.8034956,0.000059255024,0.000071025104,0.00014519344,0.00062380615,0.0003850152,0.0017552817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598134,0.0011702696,0.00016370587,0.00038303746,0.002157542,0.00014410926],"domain_scores_gemma":[0.99336183,0.0029282295,0.00037088833,0.0008801288,0.0023356772,0.00012318969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027246121,0.001257831,0.0011409547,0.0032201388,0.0005497799,0.0014578472,0.00085638516,0.0009959684,0.0028529398],"category_scores_gemma":[0.010943236,0.00046176207,0.00067374477,0.0028697266,0.00048919057,0.00165059,0.0011831209,0.00070576835,0.0019794342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056525273,0.000070131915,0.0018219257,0.00038115354,0.000191767,0.00004592714,0.00013308748,0.037582975,0.025630917,0.0058032107,0.0021876665,0.9255861],"study_design_scores_gemma":[0.0001042026,0.00089370296,0.010830335,0.00019181771,0.00013867051,0.0012969652,0.0002983751,0.8807941,0.0766286,0.011221949,0.017354894,0.00024635592],"about_ca_topic_score_codex":0.0018646474,"about_ca_topic_score_gemma":0.0019982173,"teacher_disagreement_score":0.0032201388,"about_ca_system_score_codex":0.0004019084,"about_ca_system_score_gemma":0.0007042774,"threshold_uncertainty_score":0.014409304},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008614676,0.00032901362,0.99012965,0.00006811533,0.000043308635,0.000011771063,0.000014079712,0.00026988453,0.0005195609],"genre_scores_gemma":[0.54880714,0.00045584806,0.44809857,0.00017015857,0.00011916152,0.00007063191,0.00007008606,0.000033379114,0.002175062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992478,0.00029594052,0.000028343919,0.000104088096,0.00025713377,0.0000667167],"domain_scores_gemma":[0.9990534,0.00043584863,0.00012464332,0.00014736492,0.00019647129,0.00004220908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071351277,0.0005370805,0.00044231355,0.00080968766,0.00034843315,0.0007502686,0.000623429,0.00081823254,0.0009332008],"category_scores_gemma":[0.0026398506,0.0002580389,0.0003612543,0.00047137093,0.00063573575,0.0010581848,0.0007929954,0.0005622526,0.00058855885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011696502,0.0002529464,0.0020453664,0.0003578988,0.00019680838,0.0003130124,0.00022895714,0.19441417,0.13340418,0.07049023,0.0035982798,0.5935286],"study_design_scores_gemma":[0.000042272488,0.00014656338,0.0005562958,0.0000216697,0.00003106982,0.00023912115,0.00002636336,0.94071114,0.027110718,0.027521214,0.0035541644,0.000039457682],"about_ca_topic_score_codex":0.00056777144,"about_ca_topic_score_gemma":0.0007671633,"teacher_disagreement_score":0.0009332008,"about_ca_system_score_codex":0.000405683,"about_ca_system_score_gemma":0.00057998893,"threshold_uncertainty_score":0.0037734509},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40476376,0.00090241054,0.58276933,0.00018015846,0.00010345314,0.00012369269,0.00016096914,0.00404116,0.0069551035],"genre_scores_gemma":[0.8591369,0.0003022218,0.13275062,0.0000734476,0.000044215623,0.000053857515,0.00014012994,0.000119160395,0.0073794373],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996327,0.00007056001,0.00002326536,0.000060144488,0.00018140374,0.000031925105],"domain_scores_gemma":[0.99939215,0.00020105003,0.00011259679,0.00010948845,0.00015902576,0.000025624246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041057038,0.00028852033,0.00022348049,0.0004668832,0.00027090136,0.00036675387,0.0006105245,0.0003737997,0.001971401],"category_scores_gemma":[0.0014197594,0.00013108004,0.000104809704,0.0003607487,0.00022977426,0.00057457556,0.00028077845,0.00037792692,0.0009446497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012893546,0.00011278811,0.0010282387,0.00017986556,0.000015485275,0.0002553878,0.00027377158,0.01398902,0.67514664,0.008970117,0.0011067768,0.29763255],"study_design_scores_gemma":[0.00016313234,0.0010349537,0.0017051419,0.000039740935,0.000025840616,0.00081691577,0.000046481007,0.19806367,0.7831582,0.0035194973,0.0113855945,0.0000408825],"about_ca_topic_score_codex":0.0003908074,"about_ca_topic_score_gemma":0.00044129143,"teacher_disagreement_score":0.001971401,"about_ca_system_score_codex":0.00023250964,"about_ca_system_score_gemma":0.00021713124,"threshold_uncertainty_score":0.006594956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030003276,0.00052268384,0.9953755,0.00011373463,0.00004792027,0.000037896596,0.000062211344,0.0005617093,0.00027801562],"genre_scores_gemma":[0.038198642,0.0005079194,0.959366,0.00008078162,0.0000947961,0.00021294512,0.00037567713,0.00021769019,0.00094552507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877495,0.0005557871,0.000081049184,0.00019165642,0.00034593468,0.00005059512],"domain_scores_gemma":[0.9981229,0.0009618393,0.00014920952,0.00034220523,0.00039030073,0.00003362465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022981402,0.0013817587,0.00072555314,0.0012768547,0.00052635116,0.00072315126,0.0009308472,0.0010959457,0.002209791],"category_scores_gemma":[0.008314693,0.00054321846,0.001064343,0.0015798317,0.0008231037,0.0009761573,0.000752735,0.0016424794,0.0013204537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028513928,0.00011532485,0.00069628964,0.00042020704,0.00038381564,0.00018496421,0.00013963135,0.13672055,0.088555135,0.03598218,0.007881787,0.7286349],"study_design_scores_gemma":[0.000049630456,0.00012680955,0.0024606637,0.000040661318,0.000092307135,0.00021827657,0.000021851576,0.9083699,0.041447382,0.030823793,0.016241696,0.00010705784],"about_ca_topic_score_codex":0.003370658,"about_ca_topic_score_gemma":0.005486958,"teacher_disagreement_score":0.003370658,"about_ca_system_score_codex":0.0005475513,"about_ca_system_score_gemma":0.0017874101,"threshold_uncertainty_score":0.0121539235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068294915,0.000073857336,0.9985373,0.00003129339,0.0000283363,0.000013774456,0.000009645898,0.00007512423,0.00054777134],"genre_scores_gemma":[0.055518474,0.0004091626,0.9403251,0.000080516664,0.00012386983,0.00018004056,0.00010231846,0.0000694703,0.0031911053],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948907,0.0001310361,0.00002680014,0.0000627875,0.0002590742,0.000031234147],"domain_scores_gemma":[0.9995447,0.00016213396,0.00004400095,0.0000519534,0.00017615629,0.000021109434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007033833,0.00072489446,0.00061601796,0.00068805245,0.00037329478,0.0008835988,0.0007045134,0.0006956364,0.0025171535],"category_scores_gemma":[0.0020550976,0.00033225978,0.0005284625,0.00092990394,0.0006629984,0.0011194608,0.0009934987,0.0010537555,0.0013603113],"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.00018501778,0.0000514062,0.00047930545,0.00015662608,0.00006481469,0.000066224275,0.00007531883,0.19892187,0.021873478,0.1699855,0.0051982235,0.6029422],"study_design_scores_gemma":[0.000055686953,0.00013345949,0.00022986834,0.00001733899,0.000018115375,0.0001772895,0.000013292922,0.942175,0.008143997,0.035221472,0.013784508,0.000030017947],"about_ca_topic_score_codex":0.00052246207,"about_ca_topic_score_gemma":0.0005773214,"teacher_disagreement_score":0.0025171535,"about_ca_system_score_codex":0.00043577945,"about_ca_system_score_gemma":0.00088289735,"threshold_uncertainty_score":0.008420765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028091641,0.00036936527,0.96922016,0.00011698742,0.000031967094,0.000014491685,0.000051359064,0.00018865449,0.0019153157],"genre_scores_gemma":[0.92702854,0.00064797816,0.067876875,0.000051874278,0.000052855907,0.00010921522,0.0001024746,0.00002797767,0.004102216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998247,0.000052835483,0.000008569615,0.00004129306,0.00005123873,0.000021364878],"domain_scores_gemma":[0.99969757,0.00016238191,0.000045993507,0.000019130774,0.000066597626,0.000008280336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034600598,0.0004410679,0.00044633707,0.000272685,0.00020242877,0.0004297448,0.0005520381,0.0007244411,0.0005677934],"category_scores_gemma":[0.0012428749,0.00025769518,0.00028595736,0.00030383136,0.00036962275,0.0006826353,0.00033902194,0.0006627815,0.00016352098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015799276,0.0000066670145,0.00022100596,0.000018409797,0.0000109033135,0.00002773166,0.00001213485,0.9877988,0.0015241363,0.0024077815,0.00008521124,0.007871326],"study_design_scores_gemma":[5.607897e-7,0.000001923991,0.000043980508,7.88347e-7,9.828217e-7,0.0000039394845,8.696589e-7,0.9990822,0.00019904393,0.00061621226,0.00004823046,0.0000012624484],"about_ca_topic_score_codex":0.0046866955,"about_ca_topic_score_gemma":0.0030981826,"teacher_disagreement_score":0.0046866955,"about_ca_system_score_codex":0.0004162462,"about_ca_system_score_gemma":0.00040541778,"threshold_uncertainty_score":0.009318829},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03336849,0.00035957617,0.96210206,0.00018061204,0.00014189507,0.000055514945,0.00008820563,0.0009391245,0.0027645978],"genre_scores_gemma":[0.27553633,0.00025294058,0.7184977,0.00034755026,0.00013996735,0.000079404395,0.00023987953,0.000061590414,0.0048446166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996062,0.000040075036,0.000017375685,0.0000858137,0.0002104192,0.000040105933],"domain_scores_gemma":[0.9995111,0.00013223801,0.000064534135,0.000100007055,0.00015478424,0.00003726965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003067141,0.00031256187,0.000455325,0.0006517041,0.00034696504,0.0004896004,0.000586186,0.00055629294,0.002087109],"category_scores_gemma":[0.0011860727,0.00019345965,0.00026105114,0.0004213485,0.00036571044,0.00077027845,0.00056956307,0.0007963238,0.0012838636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027108548,0.000097861426,0.0010476968,0.00010650886,0.000024988369,0.00022123272,0.00008905754,0.004934958,0.36753273,0.0123244235,0.0023571753,0.61099243],"study_design_scores_gemma":[0.00014866571,0.0006706921,0.0051132757,0.000055358865,0.0000758287,0.0058839805,0.000074498894,0.45415586,0.47398123,0.020327931,0.039390262,0.00012245854],"about_ca_topic_score_codex":0.00019139974,"about_ca_topic_score_gemma":0.00031851567,"teacher_disagreement_score":0.002087109,"about_ca_system_score_codex":0.0002143042,"about_ca_system_score_gemma":0.00037016105,"threshold_uncertainty_score":0.006982088},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013374755,0.00010407755,0.9979753,0.000025293186,0.00003425995,0.000012792964,0.000007854646,0.0001487163,0.0003542743],"genre_scores_gemma":[0.015468099,0.00019192295,0.9820939,0.000035217094,0.000052624768,0.000069182795,0.000055855537,0.00005559858,0.0019776113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947864,0.00012098893,0.000026299256,0.00008685922,0.00026775786,0.0000195283],"domain_scores_gemma":[0.9994814,0.00015199713,0.00003810383,0.000058249647,0.00023338398,0.000036834204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078819,0.0009424265,0.0007103182,0.00077686395,0.0004286469,0.0006088275,0.00089414354,0.00092177565,0.002047709],"category_scores_gemma":[0.0016219266,0.0003950529,0.0004931535,0.00051069877,0.0006855629,0.001174194,0.0009695224,0.0010887521,0.0018393453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021884889,0.00009655813,0.00031502132,0.0003286129,0.00007907209,0.000118114745,0.00021602362,0.09673056,0.12797745,0.02649042,0.0037437277,0.74368554],"study_design_scores_gemma":[0.00004997799,0.00017170722,0.00022536331,0.000016948074,0.000022485354,0.00036360198,0.000026178166,0.9452725,0.031234369,0.0058001173,0.016765304,0.000051407384],"about_ca_topic_score_codex":0.0008252481,"about_ca_topic_score_gemma":0.0011242824,"teacher_disagreement_score":0.002047709,"about_ca_system_score_codex":0.00025102208,"about_ca_system_score_gemma":0.0007652518,"threshold_uncertainty_score":0.006850302},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049433596,0.000084830455,0.9944167,0.000016623108,0.000016166445,0.000010913277,0.000013633131,0.0002512837,0.00024638727],"genre_scores_gemma":[0.18412565,0.00034889227,0.813014,0.000056742352,0.000060941533,0.000083524064,0.00013486831,0.00007924433,0.0020961384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994259,0.0001899451,0.000036565612,0.00010564296,0.00020008015,0.000041942796],"domain_scores_gemma":[0.9989637,0.00052235584,0.00014697094,0.00015493808,0.00018807121,0.000024007406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069948944,0.00065305794,0.00078669534,0.00043288292,0.0002939367,0.00054231647,0.0005649509,0.00059723976,0.0011919922],"category_scores_gemma":[0.0027777676,0.00035438905,0.00045839485,0.00040218278,0.0006609594,0.0010147503,0.0006470245,0.0006955469,0.0007464557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005838142,0.00011473486,0.0007213798,0.00037284818,0.000119123586,0.00011386077,0.00018162896,0.30925772,0.17630729,0.015338298,0.0014851058,0.4954042],"study_design_scores_gemma":[0.000027506698,0.00012987551,0.000550901,0.000018447496,0.00002310637,0.00018653926,0.000014886304,0.9345766,0.059746303,0.0027553814,0.0019233617,0.000047044796],"about_ca_topic_score_codex":0.00074860774,"about_ca_topic_score_gemma":0.00095542375,"teacher_disagreement_score":0.0011919922,"about_ca_system_score_codex":0.00020719327,"about_ca_system_score_gemma":0.000822232,"threshold_uncertainty_score":0.00398767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019311866,0.00012545085,0.99723285,0.000017425707,0.000017468219,0.000004078882,0.000010918017,0.0002420858,0.00041850584],"genre_scores_gemma":[0.14677028,0.00057579135,0.8477032,0.000047372498,0.000084914805,0.000047313035,0.00020674849,0.00017126881,0.0043931333],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880576,0.00024028975,0.00006452422,0.00021851253,0.00059349055,0.00007732286],"domain_scores_gemma":[0.99897397,0.0003316902,0.00014283691,0.00025973233,0.00026121608,0.000030658586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086408405,0.0009927356,0.0010106032,0.00069218274,0.0003067752,0.00090626295,0.0008211515,0.00097224046,0.0008718499],"category_scores_gemma":[0.0030395784,0.00046976414,0.00066457497,0.00067174947,0.0005393804,0.0013828955,0.0011178214,0.0012327783,0.0010776668],"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.000263247,0.00008454612,0.0010271815,0.00017817755,0.00010961801,0.0002333151,0.00013731279,0.31734362,0.08254298,0.03820791,0.0031870648,0.556685],"study_design_scores_gemma":[0.000015580612,0.000069361675,0.00041208262,0.000011445141,0.000028982991,0.00025978987,0.000012282333,0.9691738,0.017522909,0.008357221,0.004093231,0.000043274405],"about_ca_topic_score_codex":0.001569901,"about_ca_topic_score_gemma":0.0024083918,"teacher_disagreement_score":0.001569901,"about_ca_system_score_codex":0.0002454219,"about_ca_system_score_gemma":0.0007718292,"threshold_uncertainty_score":0.004569769},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004355907,0.00016976912,0.9946682,0.00003866275,0.0000107979195,0.0000105180125,0.000016962258,0.00007489968,0.000654312],"genre_scores_gemma":[0.3007575,0.0009475044,0.6943078,0.00009378317,0.00007475193,0.00014874151,0.00022610291,0.00016076,0.00328309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950194,0.00017007612,0.000035404388,0.00007210224,0.0001867404,0.00003379754],"domain_scores_gemma":[0.9988716,0.0006368734,0.000116495474,0.00010486458,0.000246074,0.000024053616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008185476,0.00074048486,0.00057564967,0.00070925325,0.00031106896,0.0007417281,0.00044576623,0.0007269044,0.0011141129],"category_scores_gemma":[0.0035975694,0.0002882869,0.00056164444,0.0007227345,0.0006256507,0.0013471133,0.0007097005,0.00078226125,0.0005057288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003648986,0.00005577262,0.0011273673,0.00023763161,0.00006829834,0.00013480207,0.00022653007,0.5640682,0.05772103,0.085608676,0.0031201316,0.2872666],"study_design_scores_gemma":[0.000007883603,0.000035529323,0.00026907187,0.000008330709,0.0000073146884,0.000056011693,0.000010237052,0.9849917,0.0071930317,0.005920259,0.0014848963,0.000015751013],"about_ca_topic_score_codex":0.0017042008,"about_ca_topic_score_gemma":0.0023222961,"teacher_disagreement_score":0.0017042008,"about_ca_system_score_codex":0.0006733798,"about_ca_system_score_gemma":0.0006893451,"threshold_uncertainty_score":0.004885733},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024851798,0.000115164505,0.99648535,0.00006197066,0.00001292662,0.000009024855,0.00002397049,0.00014666142,0.0006596419],"genre_scores_gemma":[0.3137408,0.00063349033,0.6770177,0.00013361234,0.00014495739,0.0001710379,0.00039234108,0.00025795554,0.007508126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927396,0.00024810742,0.00003188843,0.00015502611,0.00024011462,0.000050861916],"domain_scores_gemma":[0.99893194,0.0007653256,0.000073463765,0.00006828436,0.00012587376,0.00003508798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097076554,0.00080626376,0.0008246244,0.00056228664,0.0003478389,0.0009018613,0.0014744477,0.0011432716,0.0017279374],"category_scores_gemma":[0.0031957775,0.0009531053,0.0011474867,0.00061164715,0.00088219356,0.001220028,0.001460253,0.0012745198,0.00064555847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078182755,0.00001901048,0.00024853818,0.000093261224,0.00007028349,0.000073100695,0.00008962586,0.89419436,0.00721934,0.046618413,0.0009566914,0.050339278],"study_design_scores_gemma":[0.0000039759952,0.0000047116077,0.000037407113,0.0000023480934,0.0000022119832,0.000011675528,0.0000029587216,0.99286795,0.0005063297,0.0061412314,0.0004143786,0.000004872593],"about_ca_topic_score_codex":0.0050225793,"about_ca_topic_score_gemma":0.0039191996,"teacher_disagreement_score":0.0050225793,"about_ca_system_score_codex":0.00074898807,"about_ca_system_score_gemma":0.0010575121,"threshold_uncertainty_score":0.009986699},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018105555,0.000372871,0.9804708,0.000061574465,0.000026414993,0.0000127241055,0.000008507081,0.00012603606,0.000815491],"genre_scores_gemma":[0.47021654,0.0007331647,0.52755356,0.000050971423,0.00012779981,0.00004723937,0.00003938462,0.000026964613,0.0012043874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968755,0.00013270686,0.000015533116,0.00004094813,0.00009535081,0.000028028087],"domain_scores_gemma":[0.9995165,0.00031837742,0.000057119883,0.000048685873,0.00004724862,0.000012039318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060489035,0.00048447578,0.0005373481,0.00045349883,0.00035716145,0.0004935582,0.00026633614,0.0004897096,0.0005544334],"category_scores_gemma":[0.0019379634,0.00019979312,0.0004352045,0.00043360112,0.0007426954,0.00086432364,0.00044449113,0.00049202685,0.0001826703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005198081,0.00008680902,0.0013319135,0.00020270565,0.00011422469,0.00033127778,0.0002853034,0.49590582,0.051467165,0.049908977,0.0010702604,0.39877573],"study_design_scores_gemma":[0.000020276339,0.000070715505,0.000314187,0.0000116209785,0.00001569939,0.00014908651,0.000022803866,0.9798478,0.0081040645,0.010217743,0.0012088057,0.000017235008],"about_ca_topic_score_codex":0.000913123,"about_ca_topic_score_gemma":0.0008679367,"teacher_disagreement_score":0.000913123,"about_ca_system_score_codex":0.00033100744,"about_ca_system_score_gemma":0.00033542063,"threshold_uncertainty_score":0.003199041},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017009414,0.0003007191,0.9969959,0.000051157684,0.000033240303,0.0000157962,0.000045894634,0.00022546118,0.0006307871],"genre_scores_gemma":[0.09619373,0.0017719901,0.8990216,0.00006434926,0.0002220762,0.00016916495,0.00033032583,0.00013560469,0.0020911708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997092,0.000073718984,0.000019757206,0.000084574545,0.000093184004,0.000019466248],"domain_scores_gemma":[0.9997564,0.00012520883,0.000032973272,0.000033848013,0.000040792773,0.000010716845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048857636,0.0008964365,0.00076062785,0.0010339712,0.0002879361,0.00079693156,0.00053814054,0.00050761335,0.0013401174],"category_scores_gemma":[0.0012936741,0.0002886345,0.00095128996,0.0009155143,0.0006070666,0.0009275162,0.0004885512,0.00086871744,0.0008059872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012417903,0.000093555835,0.0011990768,0.0005663622,0.00042927018,0.0004166887,0.0003374355,0.24232104,0.09891506,0.09785141,0.0043310514,0.5534148],"study_design_scores_gemma":[0.000023301734,0.00009941651,0.0019531425,0.000049766863,0.00009034116,0.00038653138,0.000048164125,0.8889071,0.014900039,0.07804953,0.01541449,0.00007813531],"about_ca_topic_score_codex":0.001327052,"about_ca_topic_score_gemma":0.0012610165,"teacher_disagreement_score":0.0013401174,"about_ca_system_score_codex":0.0002668028,"about_ca_system_score_gemma":0.00047492626,"threshold_uncertainty_score":0.0044831634},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01044638,0.00007447649,0.9885456,0.000036324196,0.000015734777,0.000010824909,0.000040072933,0.0003338599,0.00049671624],"genre_scores_gemma":[0.69501114,0.00043361558,0.29589373,0.000092911345,0.00005439505,0.000103094484,0.00047209457,0.00027849505,0.0076605063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995535,0.000080523896,0.00002006192,0.00014262827,0.0001701673,0.000033097247],"domain_scores_gemma":[0.9991371,0.0003556171,0.00016925563,0.0001373638,0.00017502735,0.000025608277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005743508,0.00060986937,0.00068455096,0.00056250667,0.00027616133,0.0011083906,0.0008444175,0.00079085823,0.0018077588],"category_scores_gemma":[0.0031627784,0.00047070818,0.0004843576,0.00066847075,0.0004744787,0.0014713801,0.00052341935,0.0011227519,0.0009805968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017480944,0.00009827349,0.0022132162,0.00014564674,0.00007632046,0.0000996418,0.00014082332,0.6737565,0.04083299,0.011608707,0.0018611145,0.26899198],"study_design_scores_gemma":[0.0000047484937,0.00002227635,0.0009625206,0.0000071804466,0.000007876331,0.00004524794,0.000007741379,0.9899436,0.0054015326,0.0026973248,0.00088633085,0.000013539602],"about_ca_topic_score_codex":0.0031544366,"about_ca_topic_score_gemma":0.0041872435,"teacher_disagreement_score":0.0031544366,"about_ca_system_score_codex":0.00043683464,"about_ca_system_score_gemma":0.00051306025,"threshold_uncertainty_score":0.006272137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046186983,0.00012599051,0.9946465,0.000078002435,0.000008648855,0.000006313761,0.000032382657,0.00018042211,0.0003030815],"genre_scores_gemma":[0.3428419,0.00093732326,0.6476108,0.00024088769,0.00015506109,0.00017036968,0.00071470276,0.00040284736,0.0069260104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896204,0.0005047613,0.000043945456,0.00021847858,0.00020676006,0.00006400853],"domain_scores_gemma":[0.9977229,0.0014164699,0.00019129922,0.00038440354,0.00023638007,0.000048666876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017945827,0.0010307393,0.0010224978,0.00065834064,0.00029790422,0.00080267806,0.0013472544,0.0011357729,0.0017255619],"category_scores_gemma":[0.008853018,0.0006799978,0.0009979131,0.0009978799,0.00081792066,0.0024794068,0.0013768256,0.0022798087,0.0007304073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008841528,0.000041040064,0.0005236542,0.00009780615,0.00009018251,0.00007202371,0.00012041726,0.8246936,0.0079536885,0.048547566,0.0017711361,0.1160004],"study_design_scores_gemma":[0.0000038407043,0.000010575922,0.00010268807,0.0000034504137,0.0000060755,0.000015591639,0.0000046816913,0.98659384,0.0006246588,0.012157527,0.00047039255,0.000006717607],"about_ca_topic_score_codex":0.004113485,"about_ca_topic_score_gemma":0.0038553106,"teacher_disagreement_score":0.004113485,"about_ca_system_score_codex":0.00060793775,"about_ca_system_score_gemma":0.0006301071,"threshold_uncertainty_score":0.009490728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007839448,0.00013880793,0.99084234,0.00003709519,0.00001596974,0.000017033179,0.0000123485925,0.00050566957,0.0005913388],"genre_scores_gemma":[0.20223513,0.00034460463,0.7948412,0.000059348993,0.000029522393,0.00009325712,0.00007629069,0.00009101111,0.0022297408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999323,0.0002829799,0.000025056584,0.00006518271,0.0002528136,0.000050999297],"domain_scores_gemma":[0.9986965,0.00093908847,0.0000989304,0.0001357499,0.00010691695,0.000022848648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015147742,0.0007841999,0.0005919749,0.00052947266,0.00035123125,0.0006272571,0.00056356064,0.00094237534,0.0015812553],"category_scores_gemma":[0.0028850536,0.00036347244,0.00045186531,0.0005789122,0.00055656745,0.0014941983,0.0005370268,0.0009745558,0.0006711915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006530312,0.0001394705,0.0006139249,0.00019574745,0.00010565595,0.00010488813,0.00017911664,0.5775121,0.07456617,0.05223777,0.0012257696,0.29246637],"study_design_scores_gemma":[0.000025190411,0.000070980386,0.00015226254,0.000011764651,0.000008062141,0.00006737023,0.0000074314157,0.9771922,0.01712471,0.0040272367,0.0012863948,0.000026270935],"about_ca_topic_score_codex":0.001590523,"about_ca_topic_score_gemma":0.002106063,"teacher_disagreement_score":0.001590523,"about_ca_system_score_codex":0.0004938441,"about_ca_system_score_gemma":0.0007540121,"threshold_uncertainty_score":0.0080109835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017157218,0.0011919497,0.99348867,0.00011604428,0.00014677292,0.000029840405,0.00008937052,0.0014351944,0.0017863959],"genre_scores_gemma":[0.057310645,0.0026306224,0.9308485,0.00017203049,0.00046221065,0.00030044426,0.0008799397,0.0003457546,0.007049948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920803,0.00017241332,0.000034784618,0.00016086252,0.00035305193,0.00007093429],"domain_scores_gemma":[0.9993845,0.00021256531,0.00006973028,0.00014241878,0.00016884189,0.000021918122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070947804,0.0013071677,0.0009962849,0.00142268,0.0005966813,0.001053508,0.0008546082,0.0011960947,0.0034899653],"category_scores_gemma":[0.0023633544,0.00050105294,0.000812331,0.0018952425,0.000924604,0.0012032303,0.0010213738,0.0015623821,0.0029791016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020815096,0.000061837316,0.0004102331,0.00032036004,0.00014605805,0.00034604807,0.00018879192,0.062427834,0.065384924,0.049633123,0.020826563,0.800046],"study_design_scores_gemma":[0.0000507396,0.0001611714,0.0026590456,0.000087423374,0.000106401894,0.00097562757,0.000059019167,0.81062496,0.04576768,0.05559226,0.08378621,0.00012942152],"about_ca_topic_score_codex":0.0024145504,"about_ca_topic_score_gemma":0.002244197,"teacher_disagreement_score":0.0034899653,"about_ca_system_score_codex":0.00053983764,"about_ca_system_score_gemma":0.0009455257,"threshold_uncertainty_score":0.011675119},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010911862,0.0002706828,0.98539495,0.0001450214,0.000031285497,0.000025063484,0.000014247116,0.00014131304,0.0030656294],"genre_scores_gemma":[0.30848426,0.0005608974,0.6850662,0.00015777397,0.000046322377,0.00029884544,0.00012470824,0.00010106504,0.005159936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998055,0.00007512472,0.00001174829,0.00002456703,0.000064995686,0.00001811663],"domain_scores_gemma":[0.9997639,0.00012123358,0.000024909734,0.000014150539,0.00006650607,0.000009309207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066341436,0.00056946214,0.0005353632,0.00047553304,0.00028316432,0.00037903953,0.00054324465,0.000792507,0.0012254373],"category_scores_gemma":[0.001301902,0.00023850714,0.00074000546,0.00061889156,0.00034182452,0.0003441914,0.0005435031,0.00055866706,0.00018532132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045240507,0.000029479015,0.0005021867,0.000063409796,0.00006711226,0.000064973894,0.00006233094,0.921248,0.0038463215,0.010589744,0.0009823049,0.062498964],"study_design_scores_gemma":[0.0000047047956,0.000019946918,0.00008032255,0.0000032269813,0.000005276991,0.000016277234,0.000003967885,0.9977114,0.0004653082,0.0010565754,0.0006302801,0.00000268255],"about_ca_topic_score_codex":0.002269649,"about_ca_topic_score_gemma":0.0015517377,"teacher_disagreement_score":0.002269649,"about_ca_system_score_codex":0.00031879486,"about_ca_system_score_gemma":0.0006001896,"threshold_uncertainty_score":0.0045128465},"labels":[],"label_agreement":null},{"id":"W2130498245","doi":"10.1109/tsp.2002.808112","title":"Blind constant modulus equalization via convex optimization","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Blind equalization; Constant (computer programming); Convex optimization; Modulus; Mathematics; Computer science; Mathematical optimization; Equalization (audio); Signal processing; Regular polygon; Applied mathematics; Algorithm; Digital signal processing","score_opus":0.028904986799122838,"score_gpt":0.27704478391368553,"score_spread":0.2481397971145627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130498245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014529137,0.00005477179,0.9976375,0.00005357903,0.0000090665535,0.0000075454814,0.000006807887,0.00005379648,0.00072403473],"genre_scores_gemma":[0.24073383,0.0007844951,0.75092196,0.00018182822,0.00014437326,0.00016318247,0.00016514429,0.00016633513,0.0067388504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993705,0.00023396155,0.00002403031,0.000101774465,0.0002254916,0.00004415789],"domain_scores_gemma":[0.999295,0.00047973308,0.00005643636,0.000053214255,0.00009917215,0.00001632932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009704808,0.00095024187,0.0008506467,0.00042435882,0.0002855302,0.000923306,0.00069983624,0.00066945,0.0019061855],"category_scores_gemma":[0.002747852,0.00029808376,0.00047585883,0.00066967274,0.0011241838,0.0014895195,0.0011115278,0.001230506,0.00074158824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012363901,0.000058361617,0.00018652952,0.00015749464,0.00004618999,0.00008632225,0.000058607475,0.7566218,0.008220647,0.10360808,0.002425711,0.12840666],"study_design_scores_gemma":[0.000008949786,0.000021521904,0.000029376473,0.000004488564,0.0000037572554,0.000021486056,0.0000049439377,0.98274946,0.0020107874,0.014290684,0.00085019536,0.0000044222725],"about_ca_topic_score_codex":0.0010107443,"about_ca_topic_score_gemma":0.0008464221,"teacher_disagreement_score":0.0019061855,"about_ca_system_score_codex":0.0005258319,"about_ca_system_score_gemma":0.00088461355,"threshold_uncertainty_score":0.006376803},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010671111,0.00023058556,0.9882252,0.00005044963,0.000024334526,0.000012141756,0.000009283581,0.00016879334,0.00060811115],"genre_scores_gemma":[0.31755003,0.0005254666,0.6771877,0.00010771889,0.00010489266,0.00008201311,0.00006175237,0.00004881196,0.0043316553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966264,0.00009439113,0.00001635029,0.000040931413,0.00015944226,0.000026314034],"domain_scores_gemma":[0.99956733,0.00016588562,0.00006711147,0.000079198675,0.000097397184,0.000023137829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034331897,0.00033891608,0.0003004983,0.00026869,0.00018477188,0.00042023498,0.00043383765,0.00047125184,0.0010716885],"category_scores_gemma":[0.0012172781,0.00020938201,0.00023830871,0.0002578933,0.00042252723,0.0006302176,0.0005416088,0.00035987777,0.00053954055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053226977,0.0001292545,0.00092779176,0.00025950925,0.00009164197,0.0001614469,0.00016341075,0.20295748,0.2597952,0.06891184,0.0017397648,0.4643304],"study_design_scores_gemma":[0.000022564764,0.00012463875,0.00030721357,0.000006678705,0.000013753028,0.00016339718,0.000011169643,0.9364171,0.05136739,0.0078708045,0.003674574,0.000020805008],"about_ca_topic_score_codex":0.00030395246,"about_ca_topic_score_gemma":0.00051358796,"teacher_disagreement_score":0.0010716885,"about_ca_system_score_codex":0.0001786264,"about_ca_system_score_gemma":0.0003623418,"threshold_uncertainty_score":0.0035851598},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8044979,0.0013018155,0.18479343,0.00016620703,0.00010932333,0.000023978375,0.000105231025,0.00058214075,0.008420028],"genre_scores_gemma":[0.9713699,0.00032620152,0.026831897,0.00003674176,0.000022371927,0.000008013036,0.00006748815,0.000024202189,0.0013131851],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997044,0.000088461085,0.000016364795,0.000039076465,0.00010126795,0.000050336213],"domain_scores_gemma":[0.99784505,0.0015291077,0.00010310713,0.00018336711,0.00027669186,0.000062638865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008937517,0.00027173874,0.00025110107,0.0003745006,0.00020848673,0.00038267532,0.0002733662,0.00055730634,0.0017225073],"category_scores_gemma":[0.0039522354,0.00009295906,0.00016843854,0.00028501885,0.00019823636,0.0008742161,0.00023234896,0.00019448742,0.00025872866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0069737793,0.00024355219,0.005631232,0.0003743815,0.00019761828,0.00027393835,0.0001805587,0.2792568,0.1857948,0.012699863,0.00084226276,0.50753117],"study_design_scores_gemma":[0.00045692705,0.00643076,0.014317086,0.00010023733,0.00025099912,0.0013399883,0.00021597129,0.73263913,0.22921914,0.007638745,0.007269927,0.00012112062],"about_ca_topic_score_codex":0.00051173836,"about_ca_topic_score_gemma":0.0006361382,"teacher_disagreement_score":0.0017225073,"about_ca_system_score_codex":0.00017477298,"about_ca_system_score_gemma":0.00016021519,"threshold_uncertainty_score":0.0057623982},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005304528,0.00011559858,0.99381363,0.000033934066,0.000011175465,0.000012306044,0.000009259398,0.000073394396,0.00062615785],"genre_scores_gemma":[0.54412156,0.00097637373,0.45084435,0.00010980471,0.000093355666,0.00014437643,0.00014112414,0.00012135718,0.003447718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988122,0.00042509404,0.000048169764,0.00010191336,0.0005558317,0.000056784545],"domain_scores_gemma":[0.99760866,0.0014938932,0.00020792462,0.00019771796,0.00044665555,0.000045216006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001375813,0.00067459024,0.000630726,0.0005950743,0.00028383546,0.00068543875,0.0004928171,0.0006195439,0.0010985098],"category_scores_gemma":[0.004930454,0.00031431866,0.00046882432,0.0004495622,0.00081495155,0.0014118219,0.0008819649,0.00064692734,0.000462966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020128861,0.00005090839,0.0003986039,0.00019263024,0.00009554322,0.00007642881,0.00013400032,0.8388159,0.03317909,0.044522554,0.0006403745,0.08169263],"study_design_scores_gemma":[0.0000024830622,0.000026357364,0.00010587631,0.0000046278315,0.0000042763313,0.00003508058,0.0000072557787,0.99079895,0.0051590353,0.0034896827,0.0003552158,0.000011122467],"about_ca_topic_score_codex":0.0006189661,"about_ca_topic_score_gemma":0.00042007334,"teacher_disagreement_score":0.001375813,"about_ca_system_score_codex":0.00047807643,"about_ca_system_score_gemma":0.00053398265,"threshold_uncertainty_score":0.007276058},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008592227,0.00036406727,0.9877033,0.00021465225,0.00007718054,0.00002737675,0.0002971351,0.00029202283,0.002431961],"genre_scores_gemma":[0.6399878,0.004362244,0.3282475,0.00068113825,0.00048501653,0.0003499705,0.0019867176,0.00037828585,0.023521319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924016,0.00016075345,0.000033381028,0.00020932737,0.00024189554,0.00011448369],"domain_scores_gemma":[0.9989334,0.00038563705,0.00018067361,0.00018544194,0.00025913073,0.000055716202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009806252,0.001011246,0.0011713483,0.000893876,0.00044569952,0.001633484,0.002144255,0.0017822777,0.003078453],"category_scores_gemma":[0.00232322,0.0004067334,0.0011389023,0.0018549053,0.0010030054,0.0033115032,0.00088220276,0.0014423123,0.0017246873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013013385,0.000045557852,0.0013050466,0.00016744692,0.0000794418,0.00044506436,0.0001568831,0.7123741,0.010248812,0.22185518,0.0045898054,0.04860261],"study_design_scores_gemma":[0.000009782855,0.0000360199,0.00021149224,0.000012010566,0.000017737691,0.0002571803,0.000012782072,0.95480627,0.0008712254,0.04100423,0.0027301821,0.000031124324],"about_ca_topic_score_codex":0.0033080648,"about_ca_topic_score_gemma":0.0024104891,"teacher_disagreement_score":0.0033080648,"about_ca_system_score_codex":0.0009404133,"about_ca_system_score_gemma":0.001575587,"threshold_uncertainty_score":0.0102984905},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00435727,0.00043022181,0.99381435,0.00007606137,0.000026960042,0.000019781843,0.000024595598,0.0002622555,0.0009884948],"genre_scores_gemma":[0.26844972,0.0013629436,0.7233292,0.00017131724,0.000094006515,0.00016371746,0.00015993457,0.00006652773,0.0062026433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968314,0.000115479874,0.00001728941,0.000031374686,0.00012505693,0.00002773151],"domain_scores_gemma":[0.99963105,0.00015240152,0.00004537928,0.00004660514,0.000106014704,0.000018479745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040507302,0.0006129325,0.00039962985,0.0003219438,0.000317388,0.00056238094,0.0004918376,0.000690276,0.0012828986],"category_scores_gemma":[0.0012472454,0.00025113818,0.00024975228,0.00047279426,0.00050674705,0.00060548016,0.0004942992,0.00062149676,0.0010004477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046991592,0.0000963119,0.0006254617,0.00036118602,0.000058470574,0.00011947477,0.00021293762,0.32370216,0.16256657,0.054643854,0.004032471,0.45311114],"study_design_scores_gemma":[0.000038692844,0.00018770501,0.00023861432,0.000020063573,0.000019383868,0.00019942506,0.000013916823,0.92825705,0.04755696,0.01751453,0.0059159137,0.0000378502],"about_ca_topic_score_codex":0.0009041628,"about_ca_topic_score_gemma":0.0012774026,"teacher_disagreement_score":0.0012828986,"about_ca_system_score_codex":0.00031941425,"about_ca_system_score_gemma":0.00056191615,"threshold_uncertainty_score":0.0042917132},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039209663,0.00012970918,0.9950879,0.000045161927,0.000029821074,0.0000107201895,0.00001096095,0.00028492056,0.00047991457],"genre_scores_gemma":[0.16341172,0.00035974797,0.8318083,0.00011870325,0.0000890628,0.00014665487,0.000112947695,0.000071912415,0.0038809264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999567,0.000119301614,0.000026215535,0.00007325313,0.00018220721,0.00003208162],"domain_scores_gemma":[0.99948967,0.00021100874,0.0000626994,0.00006308398,0.00015466908,0.00001884566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004889039,0.0007102946,0.00046476093,0.00048779082,0.00026193346,0.00033370036,0.0005530474,0.0006781876,0.0015863156],"category_scores_gemma":[0.0012488592,0.00030836687,0.00040952375,0.00065718306,0.00039704877,0.0007570938,0.00051799085,0.000585213,0.0011325754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034784366,0.000074357136,0.000919546,0.00014453601,0.00014347649,0.000075628785,0.00009600017,0.2092028,0.09825729,0.013087072,0.003151972,0.67449945],"study_design_scores_gemma":[0.00003991073,0.00015096838,0.00035465258,0.000010195853,0.000029662442,0.000116701616,0.000013929223,0.9687148,0.021337718,0.003801862,0.005399682,0.000029938257],"about_ca_topic_score_codex":0.0011907818,"about_ca_topic_score_gemma":0.0020009675,"teacher_disagreement_score":0.0015863156,"about_ca_system_score_codex":0.00027525943,"about_ca_system_score_gemma":0.00063189626,"threshold_uncertainty_score":0.0053067803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014297611,0.0002525408,0.98460984,0.00007979111,0.000021300766,0.0000109176035,0.000020335548,0.00022193897,0.0004858258],"genre_scores_gemma":[0.33493844,0.00032992804,0.6621944,0.000105008774,0.00007253123,0.00005577362,0.00008397272,0.00009889104,0.002121097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903274,0.00028362466,0.00004445296,0.00016343113,0.00037901138,0.00009683685],"domain_scores_gemma":[0.9972312,0.0014825775,0.00044418126,0.00038063194,0.0003853794,0.0000760803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001380343,0.00044886465,0.000957428,0.0008073351,0.00030090797,0.0008139768,0.0008294948,0.0006901135,0.0011159036],"category_scores_gemma":[0.0071058455,0.00027518807,0.00030429487,0.00069163647,0.0009078701,0.0015030561,0.0009376652,0.0010545845,0.00047372223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006492458,0.00010123142,0.003052662,0.00021926417,0.00010291564,0.00017486484,0.00019575979,0.17534637,0.08209,0.10111938,0.0033742278,0.6335741],"study_design_scores_gemma":[0.00002024862,0.00007549321,0.0005955531,0.000015724632,0.000017185435,0.00029320424,0.000010228165,0.9584793,0.025391521,0.013291881,0.0017711145,0.000038575112],"about_ca_topic_score_codex":0.0005844048,"about_ca_topic_score_gemma":0.00070411974,"teacher_disagreement_score":0.001380343,"about_ca_system_score_codex":0.00065824966,"about_ca_system_score_gemma":0.0006804402,"threshold_uncertainty_score":0.0073000193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014389763,0.00030656497,0.9973699,0.00005900165,0.000021478023,0.000011285399,0.000009111512,0.00007189178,0.00071182876],"genre_scores_gemma":[0.3984986,0.0023788225,0.59227675,0.00018053438,0.00035187995,0.00020614467,0.00012461522,0.00011239456,0.0058702533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989378,0.0005102724,0.000047405636,0.00013844506,0.00030471064,0.00006137654],"domain_scores_gemma":[0.99871147,0.00094801903,0.00008218529,0.00008044817,0.000139937,0.000037983085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012145743,0.00093712844,0.0007421252,0.0007760762,0.00034408606,0.00096292834,0.0010051654,0.0007884552,0.0016368172],"category_scores_gemma":[0.0033094673,0.00045054077,0.000485684,0.0010137178,0.0010471995,0.001267358,0.00061534956,0.0010051812,0.00025539915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014897255,0.000058466147,0.00035639454,0.00020851471,0.000070240385,0.000085615735,0.00009434532,0.7633225,0.0072376127,0.07942959,0.0015905604,0.14739712],"study_design_scores_gemma":[0.000010991803,0.000049462855,0.00012666754,0.00001089326,0.000009593384,0.000028289396,0.000010223837,0.9775088,0.002145181,0.018086521,0.0020026858,0.000010636159],"about_ca_topic_score_codex":0.0023396893,"about_ca_topic_score_gemma":0.0018414853,"teacher_disagreement_score":0.0023396893,"about_ca_system_score_codex":0.00095142727,"about_ca_system_score_gemma":0.0008369444,"threshold_uncertainty_score":0.006903112},"labels":[],"label_agreement":null},{"id":"W2132483362","doi":"10.1109/tsp.2007.895998","title":"Underdetermined Anechoic Blind Source Separation via $\\ell^{q}$-Basis-Pursuit With $q≪1$","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia Hospital; University of British Columbia","funders":"","keywords":"Blind signal separation; Anechoic chamber; Underdetermined system; Source separation; Computer science; Basis (linear algebra); Algorithm; Matching pursuit; Speech recognition; Signal processing; Basis pursuit; Artificial intelligence; Mathematics; Compressed sensing; Telecommunications","score_opus":0.0227640615523525,"score_gpt":0.2938148370445632,"score_spread":0.2710507754922107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132483362","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00597189,0.00015226706,0.99302787,0.000075184755,0.000010889059,0.000011277955,0.000017308334,0.00012269168,0.0006106258],"genre_scores_gemma":[0.11376406,0.00042836348,0.8835833,0.000114942195,0.00006128415,0.000074395786,0.00015952757,0.000057816964,0.0017563251],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989189,0.0004298134,0.000047806392,0.00020835739,0.00033229182,0.00006302535],"domain_scores_gemma":[0.9991001,0.0005052912,0.00009981598,0.00012510862,0.00013289171,0.000036852125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012753395,0.0009923549,0.000882386,0.00062635593,0.00036571376,0.0006591584,0.000636867,0.0010055524,0.00089182117],"category_scores_gemma":[0.0031375072,0.0004161524,0.00057690445,0.00085029873,0.00091277546,0.0016397467,0.0019072046,0.0011374658,0.0007471713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005625089,0.00016363464,0.0007910942,0.00027684477,0.0001632322,0.00022241008,0.00026538494,0.35354823,0.07378608,0.09152298,0.0028317396,0.47586584],"study_design_scores_gemma":[0.000024592202,0.00006524154,0.00019007252,0.000010707318,0.000012156469,0.0001144862,0.00001912948,0.97110116,0.00924153,0.017266093,0.0019327656,0.000022106791],"about_ca_topic_score_codex":0.0014599764,"about_ca_topic_score_gemma":0.0012331728,"teacher_disagreement_score":0.0014599764,"about_ca_system_score_codex":0.0003274388,"about_ca_system_score_gemma":0.0010548156,"threshold_uncertainty_score":0.0067447424},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045286257,0.0008418874,0.95224607,0.0001560853,0.00006572373,0.00004297597,0.0000627683,0.00053157215,0.0007666276],"genre_scores_gemma":[0.21812135,0.0015663195,0.7780126,0.00007999275,0.00007725972,0.0000678834,0.00022847742,0.00011716253,0.0017289716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979204,0.00004604411,0.000015540194,0.000033576773,0.00009897585,0.000013983219],"domain_scores_gemma":[0.99963474,0.00012621246,0.000047520214,0.00005326637,0.00012596931,0.000012273074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041242014,0.0004303144,0.00041155764,0.0010038299,0.00020787636,0.0005419305,0.00030836952,0.00039563948,0.0008892649],"category_scores_gemma":[0.0014420563,0.00019176689,0.00057854346,0.0012192107,0.0003368571,0.0005733204,0.00032877226,0.00033644502,0.00044114632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023954887,0.00005840196,0.0012288388,0.00031378405,0.00012123647,0.0003674831,0.00008928085,0.022400877,0.34124854,0.003949145,0.001407158,0.6285757],"study_design_scores_gemma":[0.000096650016,0.00044507883,0.017246699,0.000055449273,0.00022065024,0.002132346,0.00009487913,0.6589433,0.29173133,0.011308465,0.017632848,0.00009225233],"about_ca_topic_score_codex":0.00064604625,"about_ca_topic_score_gemma":0.00078235177,"teacher_disagreement_score":0.0010038299,"about_ca_system_score_codex":0.00014763194,"about_ca_system_score_gemma":0.00033292596,"threshold_uncertainty_score":0.0029749274},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003693512,0.000115676245,0.9918785,0.00009360353,0.0001005796,0.00007362948,0.000035769957,0.001060839,0.0029478783],"genre_scores_gemma":[0.19844191,0.00036998355,0.7868629,0.000416667,0.00021377217,0.00024730604,0.00018217803,0.00029595636,0.012969314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858534,0.00016238126,0.000108311484,0.0005273555,0.0005053388,0.000111300826],"domain_scores_gemma":[0.9979778,0.0006295061,0.00017132371,0.00044008487,0.00067262544,0.00010866054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018853247,0.00074577774,0.0011526556,0.00076901773,0.0007087765,0.001439993,0.0025392734,0.001362633,0.0039442787],"category_scores_gemma":[0.0058174413,0.00030221383,0.00052373525,0.00058498577,0.0013217655,0.0017733756,0.0008921101,0.0019297831,0.003227716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023907948,0.00025887488,0.0012622458,0.00018370095,0.00015073105,0.00023112744,0.000100608566,0.10028147,0.03488987,0.05273943,0.009162917,0.8005],"study_design_scores_gemma":[0.00008326571,0.00019177678,0.0007741978,0.000041818028,0.00006631497,0.000428947,0.000022277862,0.8690893,0.046584707,0.06641699,0.016229853,0.00007060485],"about_ca_topic_score_codex":0.00329723,"about_ca_topic_score_gemma":0.0045289174,"teacher_disagreement_score":0.0039442787,"about_ca_system_score_codex":0.00060094235,"about_ca_system_score_gemma":0.0017115632,"threshold_uncertainty_score":0.013194919},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008343445,0.00036002096,0.9971124,0.0001428601,0.000035566423,0.000022445673,0.00002077204,0.00031942024,0.0011521355],"genre_scores_gemma":[0.06734552,0.0012446053,0.92833215,0.00027394702,0.00019397817,0.00018191777,0.00021649551,0.0002834623,0.0019279507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974771,0.0012263579,0.000100579695,0.0002491476,0.0008447731,0.000102064754],"domain_scores_gemma":[0.99350005,0.0044795857,0.00021179931,0.00072698656,0.0009735477,0.000108060405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003952104,0.0015344482,0.0017025702,0.0025186914,0.00077329244,0.0014336496,0.0027940643,0.0020779695,0.0042281854],"category_scores_gemma":[0.014662766,0.0006355691,0.000886577,0.002975201,0.0019296318,0.0028410382,0.0021293,0.0021106799,0.0014944368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016632643,0.000060411807,0.00057982805,0.00020111608,0.00011350485,0.000064615284,0.00009905868,0.63588905,0.0009580924,0.100113325,0.0035121543,0.25824243],"study_design_scores_gemma":[0.000016214808,0.000021838565,0.00013469209,0.000013213876,0.000010291841,0.00006656897,0.000016956566,0.9759713,0.00070885586,0.020962678,0.0020581197,0.000019241555],"about_ca_topic_score_codex":0.004939014,"about_ca_topic_score_gemma":0.0038728588,"teacher_disagreement_score":0.004939014,"about_ca_system_score_codex":0.0012203505,"about_ca_system_score_gemma":0.0021144685,"threshold_uncertainty_score":0.020900965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007200361,0.0008408082,0.98490196,0.00013537054,0.000058032558,0.000026460762,0.000036138335,0.00017441151,0.006626455],"genre_scores_gemma":[0.32753277,0.0033187408,0.6502932,0.0003337144,0.00033586216,0.00024180472,0.00031873814,0.00019333478,0.017431771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960643,0.00013746094,0.000015676442,0.000035653684,0.00017275271,0.000032010517],"domain_scores_gemma":[0.9993332,0.0003438095,0.00008380581,0.000081315964,0.0001395357,0.000018429404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006633859,0.0005463176,0.00025698415,0.0005761442,0.0002635324,0.0008508859,0.00031433694,0.0006650089,0.004672872],"category_scores_gemma":[0.0022498597,0.00019063223,0.00023002044,0.00058263756,0.0005615157,0.00089815323,0.0005692483,0.000777562,0.0017682229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014179044,0.00004350789,0.00022158437,0.00018836274,0.000015982901,0.00019280576,0.0001235768,0.05993569,0.023878466,0.7251127,0.0030025216,0.18714303],"study_design_scores_gemma":[0.000032886608,0.00013713054,0.00034531506,0.00007580257,0.000013635169,0.0006030281,0.00004979515,0.75052977,0.01755104,0.20539078,0.025228135,0.00004273812],"about_ca_topic_score_codex":0.00021062665,"about_ca_topic_score_gemma":0.00023277671,"teacher_disagreement_score":0.004672872,"about_ca_system_score_codex":0.0003968522,"about_ca_system_score_gemma":0.00039205243,"threshold_uncertainty_score":0.015632331},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085253835,0.00027908283,0.9120487,0.00017142335,0.000036480702,0.00010536911,0.000069872716,0.00058083626,0.001454401],"genre_scores_gemma":[0.51810974,0.0006527729,0.47907448,0.00006440732,0.000014938899,0.0001852653,0.00029165286,0.00014409376,0.0014626071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972147,0.000090320216,0.000027366954,0.00005015278,0.000090670954,0.000019908517],"domain_scores_gemma":[0.99782395,0.0014051803,0.00010298241,0.00023258271,0.00039939146,0.00003585994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012366134,0.00044787436,0.00025886192,0.00043119417,0.00014453415,0.0004034908,0.0008209825,0.0004931716,0.0012442956],"category_scores_gemma":[0.007010069,0.00020598304,0.00034173328,0.00048409382,0.00031132056,0.0008293711,0.00038304558,0.00042524302,0.00034531511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072748517,0.0002001149,0.0028159362,0.0003241719,0.00014484164,0.0001252292,0.00014017784,0.65347856,0.029114986,0.00654049,0.0010307839,0.30535722],"study_design_scores_gemma":[0.00005185721,0.00017930937,0.0014328773,0.000015290414,0.000027040056,0.00009411446,0.00003301574,0.98490703,0.01062108,0.0016046767,0.001013454,0.000020283342],"about_ca_topic_score_codex":0.002887904,"about_ca_topic_score_gemma":0.0031559288,"teacher_disagreement_score":0.002887904,"about_ca_system_score_codex":0.00028021095,"about_ca_system_score_gemma":0.00071979605,"threshold_uncertainty_score":0.006539941},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009202671,0.0001280123,0.98980284,0.000075861426,0.000014687401,0.000034124685,0.000052267187,0.0003497011,0.00033981825],"genre_scores_gemma":[0.28240272,0.00027129945,0.714795,0.000107965185,0.000079795216,0.00032975964,0.00040243907,0.00048259698,0.0011284368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894005,0.0003673715,0.000072729265,0.0002724536,0.00027056705,0.000076871205],"domain_scores_gemma":[0.9897702,0.006491652,0.0011094867,0.0011452973,0.0011565753,0.00032692406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002930979,0.000894998,0.00094554026,0.0026879178,0.0013089286,0.001528136,0.0014029894,0.0013260349,0.002679135],"category_scores_gemma":[0.018026765,0.00057072705,0.0010531122,0.0014362938,0.0020714288,0.002639267,0.0016900582,0.002063966,0.0008861046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034484058,0.00017125145,0.0040330198,0.00028323886,0.0001396011,0.00023720715,0.000953052,0.43466717,0.02839895,0.29038817,0.003975372,0.23640817],"study_design_scores_gemma":[0.000006359388,0.000026959606,0.000469102,0.00001867537,0.0000070971437,0.0000681696,0.00003085756,0.8929078,0.0032373548,0.10228625,0.0009111888,0.000030171102],"about_ca_topic_score_codex":0.0013985423,"about_ca_topic_score_gemma":0.0012181764,"teacher_disagreement_score":0.002930979,"about_ca_system_score_codex":0.0012448273,"about_ca_system_score_gemma":0.0010896854,"threshold_uncertainty_score":0.015500724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023576105,0.0003218394,0.97407156,0.0002452199,0.000017747176,0.000054486994,0.000078695455,0.0003110074,0.0013233512],"genre_scores_gemma":[0.6299979,0.00035093713,0.36749455,0.0001663455,0.00014187569,0.0003014824,0.00037597993,0.00021322428,0.0009577162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959371,0.0019320399,0.00025132298,0.00063990953,0.001067388,0.00017223928],"domain_scores_gemma":[0.9836767,0.013064697,0.0013232181,0.0008547797,0.00088163535,0.00019898915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064534596,0.0011110007,0.0010243434,0.0020833474,0.0006129742,0.0021913855,0.0012345474,0.0017049165,0.0012293227],"category_scores_gemma":[0.028146137,0.00040722766,0.0008457256,0.0014183457,0.0019987642,0.0030802388,0.0018737583,0.0014028249,0.0002843376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007859314,0.00031143535,0.0143523365,0.00048784752,0.0005093671,0.00026865618,0.000306101,0.51523584,0.022456517,0.13401385,0.002423245,0.30884895],"study_design_scores_gemma":[0.00002270102,0.00012967933,0.0023350096,0.00003126285,0.000051231655,0.00009347305,0.000029799407,0.9376958,0.010958456,0.04787211,0.0007351019,0.000045376873],"about_ca_topic_score_codex":0.0007006774,"about_ca_topic_score_gemma":0.00050522195,"teacher_disagreement_score":0.0064534596,"about_ca_system_score_codex":0.00091405044,"about_ca_system_score_gemma":0.00093825994,"threshold_uncertainty_score":0.03412956},"labels":[],"label_agreement":null},{"id":"W2134624761","doi":"10.1109/tsp.2007.907891","title":"Progressive Coding of a Gaussian Source Using Matching Pursuit","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Matching pursuit; Encoder; Bitstream; Computer science; Gaussian; Residual; Quantization (signal processing); Probabilistic logic; Algorithm; Rate–distortion theory; Coding (social sciences); Vector quantization; Decoding methods; Speech recognition; Pattern recognition (psychology); Artificial intelligence; Data compression; Mathematics; Compressed sensing; Statistics","score_opus":0.04130498768908788,"score_gpt":0.29141509919262837,"score_spread":0.2501101115035405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134624761","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01720811,0.0002259913,0.98136157,0.0000620899,0.000017793041,0.000023299775,0.000017800814,0.00008884651,0.0009945584],"genre_scores_gemma":[0.5407902,0.0009808894,0.45352346,0.0001384952,0.00006115858,0.000091832924,0.00012072511,0.000040578503,0.004252654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996799,0.00006348554,0.00001465853,0.000048834885,0.00017022227,0.000022949935],"domain_scores_gemma":[0.99949205,0.00027377758,0.00006083462,0.00006811348,0.00008907689,0.000016082518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006020043,0.00048116723,0.00039278134,0.0004630646,0.00018132282,0.00036615384,0.0006916156,0.00050214736,0.0007215164],"category_scores_gemma":[0.002173098,0.00016375034,0.00033817248,0.0007278725,0.0005862538,0.0009544902,0.0008647994,0.0005462213,0.00024549162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003806345,0.00007786956,0.00056857994,0.00023737397,0.00006130605,0.00035050666,0.00023954209,0.39562845,0.09924101,0.16705859,0.0010190229,0.3351371],"study_design_scores_gemma":[0.000020532749,0.00012615278,0.0001513227,0.000020076379,0.000012991466,0.0001614573,0.000016309687,0.95937216,0.019472264,0.01885858,0.0017711709,0.000017104374],"about_ca_topic_score_codex":0.0010692052,"about_ca_topic_score_gemma":0.0009367143,"teacher_disagreement_score":0.0010692052,"about_ca_system_score_codex":0.0003252212,"about_ca_system_score_gemma":0.00044999592,"threshold_uncertainty_score":0.003183782},"labels":[],"label_agreement":null},{"id":"W2134835659","doi":"10.1109/tsp.2005.853220","title":"Assessing the relevance of fMRI-based prior in the EEG inverse problem: a bayesian model comparison approach","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université de Montréal; McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Prior probability; Functional magnetic resonance imaging; Bayesian probability; Inverse problem; Computer science; Neuroimaging; Electroencephalography; Bayes' theorem; Relevance (law); Artificial intelligence; Inference; Bayesian inference; Magnetoencephalography; Machine learning; Bayes factor; Pattern recognition (psychology); Statistical inference; Brain activity and meditation; Psychology; Mathematics; Statistics; Neuroscience","score_opus":0.046069805557494944,"score_gpt":0.31734889615796796,"score_spread":0.271279090600473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134835659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01605062,0.00022535103,0.9821238,0.00045925862,0.000014380857,0.000052318417,0.000041078747,0.000083642546,0.0009494698],"genre_scores_gemma":[0.59042674,0.00061231834,0.4065104,0.0003833395,0.00014901036,0.00042648657,0.00023648223,0.00012046701,0.0011346991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9914158,0.0068219337,0.00018910323,0.0005248676,0.000887227,0.00016104669],"domain_scores_gemma":[0.9649799,0.031369414,0.0011189237,0.0011709654,0.0010988327,0.0002619602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019726658,0.0013812121,0.0015294775,0.0021161344,0.0007195875,0.0017555627,0.0020214482,0.002962078,0.0018909404],"category_scores_gemma":[0.062414065,0.00071241177,0.0012775924,0.0008153819,0.0021640223,0.002893857,0.0020764326,0.0019788907,0.00030105462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036680294,0.00012145795,0.001609696,0.00024033338,0.00026583564,0.00014753189,0.00018496563,0.7890085,0.003441053,0.14630184,0.00075140764,0.057560638],"study_design_scores_gemma":[0.000066284425,0.000093724266,0.00053220184,0.00003210307,0.00005086252,0.00007025148,0.00001864615,0.9084901,0.0010139723,0.08912746,0.00046701974,0.00003735974],"about_ca_topic_score_codex":0.0018589541,"about_ca_topic_score_gemma":0.0016035571,"teacher_disagreement_score":0.019726658,"about_ca_system_score_codex":0.0012816564,"about_ca_system_score_gemma":0.0018146867,"threshold_uncertainty_score":0.10432583},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029175375,0.00017648215,0.9962984,0.00004941902,0.000011457828,0.0000058332575,0.000012164488,0.00005070732,0.00047811551],"genre_scores_gemma":[0.37136748,0.0012812454,0.6232201,0.00010679891,0.00010012203,0.00010783063,0.00013938746,0.0000491056,0.0036278851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971694,0.00012037044,0.000013822277,0.000029014005,0.00009431059,0.000025590123],"domain_scores_gemma":[0.99948883,0.00030397202,0.00003709669,0.000053091197,0.00010199096,0.000015064599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045584745,0.00046078072,0.00043328834,0.00033691683,0.00028750024,0.0004627297,0.00032368483,0.0005626839,0.00096598227],"category_scores_gemma":[0.0014800212,0.00024402564,0.0003701764,0.00049696234,0.00046484312,0.00058533484,0.0005165095,0.0007424711,0.00034873007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080063044,0.00004157928,0.00033656758,0.000089403875,0.000036582544,0.000073448755,0.000090545,0.8566476,0.010445228,0.032616522,0.0010536346,0.09848884],"study_design_scores_gemma":[0.0000027713718,0.000012071503,0.00006487643,0.000003221667,0.0000020146376,0.000020035146,0.0000074071177,0.9941229,0.0013223197,0.0039962847,0.00043994864,0.000006175412],"about_ca_topic_score_codex":0.0024900057,"about_ca_topic_score_gemma":0.003029826,"teacher_disagreement_score":0.0024900057,"about_ca_system_score_codex":0.00035469848,"about_ca_system_score_gemma":0.0006441035,"threshold_uncertainty_score":0.004951},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045319326,0.00036897763,0.9518964,0.0001259775,0.00003732852,0.000028670514,0.00018097009,0.00040229075,0.0016399474],"genre_scores_gemma":[0.58248293,0.00079322926,0.41388002,0.000057717218,0.00006922421,0.000097963864,0.0004636437,0.00017393903,0.0019813192],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996853,0.000038182035,0.00001745802,0.00010691171,0.00011591397,0.000036343536],"domain_scores_gemma":[0.9992093,0.00029852532,0.00015535261,0.00013082514,0.00018453682,0.000021492386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047896197,0.000591301,0.0004353925,0.0017219499,0.00023149828,0.00082406343,0.00039166972,0.00048842386,0.002058388],"category_scores_gemma":[0.002623519,0.00020506262,0.0003390174,0.001306073,0.00061561767,0.0018441676,0.0006116116,0.0005668441,0.0007474903],"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.00023592307,0.00008506882,0.0027838445,0.00038663344,0.000054597735,0.0002591983,0.00027288144,0.054439407,0.35255903,0.028342133,0.0017602488,0.558821],"study_design_scores_gemma":[0.000046950947,0.00033008785,0.025828762,0.00011786526,0.00010545804,0.0014396065,0.0003542815,0.63765424,0.26632142,0.05073141,0.01692615,0.00014376268],"about_ca_topic_score_codex":0.0005978112,"about_ca_topic_score_gemma":0.00029604376,"teacher_disagreement_score":0.002058388,"about_ca_system_score_codex":0.0002931654,"about_ca_system_score_gemma":0.0002739407,"threshold_uncertainty_score":0.0068860054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033779575,0.00017052444,0.99562657,0.00004405754,0.000030412448,0.00002737406,0.000034337056,0.00034807145,0.00034071048],"genre_scores_gemma":[0.059300933,0.00043863375,0.9381061,0.000048318485,0.00004497709,0.00014451671,0.00018491852,0.00011646815,0.0016150591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997862,0.00006279227,0.0000121142375,0.0000356671,0.00009084708,0.000012419319],"domain_scores_gemma":[0.9995384,0.00022619961,0.000026583004,0.00004274179,0.00015480648,0.000011323146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005218024,0.0007136318,0.00031683175,0.0005724776,0.00023575181,0.00034263954,0.0004477864,0.00039918095,0.0013666376],"category_scores_gemma":[0.0016913709,0.0001629409,0.00040939142,0.0007246859,0.00027642527,0.00042317153,0.00026952513,0.00072656956,0.0005756253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016761063,0.0001196585,0.00077568844,0.0001947435,0.00012606964,0.00012913736,0.00007566802,0.1394409,0.13524875,0.013903463,0.0052031614,0.7046152],"study_design_scores_gemma":[0.0000098775545,0.000063633976,0.0008286164,0.0000067764336,0.00002308246,0.00009961174,0.0000084534095,0.9710004,0.02090519,0.0021590802,0.00487322,0.000022012126],"about_ca_topic_score_codex":0.0025100554,"about_ca_topic_score_gemma":0.0030651619,"teacher_disagreement_score":0.0025100554,"about_ca_system_score_codex":0.0002993391,"about_ca_system_score_gemma":0.0006615291,"threshold_uncertainty_score":0.0049909353},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022698008,0.00059785345,0.98321205,0.00015404352,0.0001485111,0.00008137551,0.00014274876,0.00070344866,0.012690146],"genre_scores_gemma":[0.08585056,0.0021738757,0.868932,0.00067352393,0.00039320186,0.00045696678,0.00081043417,0.00049768266,0.040211704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994543,0.000094981195,0.00006802723,0.00012225905,0.00020808294,0.000052356383],"domain_scores_gemma":[0.99934214,0.00013432618,0.000082362836,0.00016013176,0.00026336813,0.000017694796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005939552,0.0013171892,0.00051035546,0.0013871685,0.0010959827,0.0019772819,0.0011781843,0.0014419443,0.015493118],"category_scores_gemma":[0.0016944912,0.0005615577,0.0006682898,0.0010732828,0.00091476884,0.0026379079,0.0010881828,0.0016881983,0.010240982],"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.00019621299,0.00007029167,0.0002332034,0.00040345272,0.00006164854,0.0002749496,0.0002479901,0.026232546,0.049895614,0.6290321,0.008572058,0.28477994],"study_design_scores_gemma":[0.00008935558,0.00043485084,0.0007367626,0.00033932488,0.00016306315,0.0021406373,0.00014980578,0.24692218,0.10181102,0.45202658,0.19501212,0.0001743473],"about_ca_topic_score_codex":0.00061983423,"about_ca_topic_score_gemma":0.0015213398,"teacher_disagreement_score":0.015493118,"about_ca_system_score_codex":0.00079670595,"about_ca_system_score_gemma":0.0008989812,"threshold_uncertainty_score":0.051829636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2301123,0.017911935,0.73115206,0.0009717226,0.0009625656,0.00037983916,0.001652412,0.0052172104,0.011639895],"genre_scores_gemma":[0.2586778,0.004187467,0.725045,0.00014911812,0.0003140479,0.00024163853,0.004215157,0.0006307009,0.006539047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958448,0.0015725506,0.00031029418,0.00039842466,0.0016323768,0.00024155366],"domain_scores_gemma":[0.9815865,0.013108097,0.00030259247,0.002238437,0.0025643772,0.00019992456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004187403,0.001260924,0.0016691468,0.0042576063,0.0010460035,0.0022086892,0.0014926873,0.0012995171,0.0032719604],"category_scores_gemma":[0.017843623,0.00047199635,0.0015825906,0.005205421,0.0006267596,0.003385897,0.0016435721,0.0012477961,0.0014144307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026385796,0.0003637597,0.002079918,0.00053385756,0.00054691336,0.000043517924,0.00031948212,0.06756013,0.007838436,0.0063913553,0.01286068,0.8988235],"study_design_scores_gemma":[0.00047610435,0.0011143775,0.010204262,0.00012021957,0.00066361023,0.0004125144,0.000888922,0.92040825,0.026290195,0.028574143,0.010667491,0.00017996087],"about_ca_topic_score_codex":0.005760623,"about_ca_topic_score_gemma":0.006564576,"teacher_disagreement_score":0.005760623,"about_ca_system_score_codex":0.0011105705,"about_ca_system_score_gemma":0.001020826,"threshold_uncertainty_score":0.02214539},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017923177,0.00036864428,0.99510574,0.000093668925,0.0001160938,0.000029266317,0.00003101779,0.00033996033,0.0021232867],"genre_scores_gemma":[0.06763592,0.0007588969,0.92127717,0.00031744628,0.0002968082,0.00012466827,0.00019277094,0.000109950764,0.009286426],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99900347,0.00022687229,0.00005399636,0.00020001465,0.0004402478,0.00007542958],"domain_scores_gemma":[0.99926335,0.00026895432,0.00005537682,0.00014270793,0.0002349766,0.000034611618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000989634,0.00066737045,0.00071624946,0.0010251694,0.00066177594,0.0012495304,0.00097215857,0.0010593603,0.004519087],"category_scores_gemma":[0.002905863,0.00023160336,0.0004627447,0.0008748144,0.00062662165,0.0017486754,0.0012838268,0.00091544894,0.0025308235],"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.00019937135,0.00004458204,0.0003572284,0.000115225645,0.00006554017,0.000052110903,0.000041725074,0.034965754,0.011750841,0.05664868,0.005781027,0.88997805],"study_design_scores_gemma":[0.00007022193,0.00019733897,0.0006560749,0.000043467808,0.000049444487,0.00063859037,0.000028319646,0.85263133,0.03556397,0.05440754,0.055631462,0.0000822159],"about_ca_topic_score_codex":0.0007773412,"about_ca_topic_score_gemma":0.00081019086,"teacher_disagreement_score":0.004519087,"about_ca_system_score_codex":0.00039614295,"about_ca_system_score_gemma":0.0010404876,"threshold_uncertainty_score":0.015117824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046352204,0.00016396222,0.9523404,0.000054623037,0.000016694472,0.000044269862,0.000036072754,0.0002322264,0.0007594268],"genre_scores_gemma":[0.27471372,0.00027987867,0.72357804,0.000031144627,0.000030434712,0.000096291515,0.00012475422,0.000054523698,0.0010913027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998266,0.00004753033,0.000008994491,0.000034322624,0.00007222629,0.000010377664],"domain_scores_gemma":[0.9997484,0.00012304714,0.00003341798,0.00003358312,0.0000493168,0.000012259788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030771724,0.0004012094,0.0003116546,0.00077613286,0.00019647449,0.00030098314,0.00032495096,0.00037696603,0.00088858855],"category_scores_gemma":[0.0012863856,0.00014287748,0.00029542457,0.000695309,0.00025787557,0.0005837395,0.00046849868,0.00037093536,0.00025929863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004295912,0.00008534325,0.0013377138,0.0002064706,0.000080807295,0.00018556428,0.00012812186,0.035099532,0.39161992,0.012184711,0.00058803003,0.55805427],"study_design_scores_gemma":[0.000024392235,0.00018246766,0.003311018,0.000012013098,0.000024549387,0.00035597084,0.000024748704,0.9253294,0.06324735,0.0054969275,0.0019675475,0.000023597795],"about_ca_topic_score_codex":0.00043069912,"about_ca_topic_score_gemma":0.00045178024,"teacher_disagreement_score":0.00088858855,"about_ca_system_score_codex":0.00013294948,"about_ca_system_score_gemma":0.00023849828,"threshold_uncertainty_score":0.0029726028},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015552393,0.00013930848,0.9976993,0.000022416343,0.000028336859,0.000012324281,0.0000073127526,0.00018623642,0.00034955196],"genre_scores_gemma":[0.119857244,0.00042514733,0.8763032,0.00006640039,0.00009603658,0.00012339247,0.00009284637,0.00008780137,0.002947929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962854,0.00009280562,0.000026135769,0.00008915706,0.0001413501,0.00002203528],"domain_scores_gemma":[0.99948597,0.00020337326,0.00008159813,0.00008797354,0.00012927511,0.000011712322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063935254,0.00063335715,0.0006878666,0.0005163717,0.00045927984,0.00042875228,0.00051368005,0.0007237415,0.0017313219],"category_scores_gemma":[0.002195839,0.00040527017,0.00062774,0.0005010257,0.00040179287,0.0006830778,0.0005476262,0.0009553336,0.0012605734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020102574,0.00007471702,0.0005553933,0.00044735998,0.00014973982,0.0004274658,0.00034277176,0.17632706,0.16131064,0.052536782,0.0026607863,0.6049662],"study_design_scores_gemma":[0.000013021027,0.000085822896,0.00035761483,0.000028590379,0.000030246225,0.00033636385,0.000019887291,0.96656036,0.017840361,0.0053168572,0.009377161,0.000033746997],"about_ca_topic_score_codex":0.000784912,"about_ca_topic_score_gemma":0.0008694697,"teacher_disagreement_score":0.0017313219,"about_ca_system_score_codex":0.00021713991,"about_ca_system_score_gemma":0.0004560387,"threshold_uncertainty_score":0.0057919025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024464421,0.00025697867,0.99421024,0.0001412978,0.00011152542,0.000029287678,0.00003103098,0.0016984623,0.0010747575],"genre_scores_gemma":[0.10137013,0.0006135611,0.88888335,0.00029120492,0.00020174023,0.0001596857,0.00019414735,0.00042728774,0.007858924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995689,0.00008099078,0.000026238296,0.000088471956,0.00020178482,0.000033664048],"domain_scores_gemma":[0.99947363,0.00019229193,0.000043004286,0.000067737994,0.00019712122,0.00002632723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008053554,0.001003578,0.0008418618,0.0007623916,0.0004277354,0.0008832087,0.0020897356,0.0015405472,0.003043775],"category_scores_gemma":[0.0023112241,0.0005402958,0.0005833346,0.001028763,0.00059639185,0.0015825303,0.00081240415,0.0015384122,0.001389047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001966065,0.00014399343,0.00063815305,0.00021288786,0.0003115189,0.00017648957,0.00005887748,0.22107553,0.03057422,0.019019872,0.013432031,0.7141598],"study_design_scores_gemma":[0.00003199779,0.00003531411,0.00023872252,0.000012552476,0.00003231137,0.00009513837,0.000002352273,0.9772585,0.008207587,0.0074512563,0.0066126217,0.000021708991],"about_ca_topic_score_codex":0.0038645638,"about_ca_topic_score_gemma":0.0053633447,"teacher_disagreement_score":0.0038645638,"about_ca_system_score_codex":0.00060501025,"about_ca_system_score_gemma":0.0008871357,"threshold_uncertainty_score":0.01018244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048504393,0.00008336382,0.9941993,0.000027156571,0.000019381403,0.000017225719,0.000012829606,0.00020089599,0.00058951584],"genre_scores_gemma":[0.20793505,0.0002954559,0.7855135,0.00007487712,0.00005591882,0.0001001659,0.000090734735,0.000042629166,0.0058916626],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99970275,0.00006654617,0.000018460565,0.00008794169,0.000090973095,0.000033315937],"domain_scores_gemma":[0.99974304,0.00008651624,0.000025077828,0.000044431825,0.00008535814,0.000015587788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029582708,0.0005657201,0.00054353854,0.0004156168,0.00039576265,0.00042417314,0.0005578955,0.00070699287,0.0016091818],"category_scores_gemma":[0.0007435763,0.00030473995,0.0005218984,0.00030985835,0.00064161967,0.0006680832,0.0005340055,0.00067127554,0.000717083],"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.0005959478,0.00018677049,0.0007056157,0.00025580844,0.000095836185,0.00023979586,0.00026395536,0.28882048,0.1964595,0.03414405,0.0018532224,0.47637904],"study_design_scores_gemma":[0.0000292712,0.00015945565,0.00045676233,0.0000062882878,0.00002037512,0.00022096842,0.000020041949,0.95170134,0.03871097,0.0061340216,0.0025022696,0.000038296155],"about_ca_topic_score_codex":0.0016545289,"about_ca_topic_score_gemma":0.0028312518,"teacher_disagreement_score":0.0016545289,"about_ca_system_score_codex":0.00037696963,"about_ca_system_score_gemma":0.00079305476,"threshold_uncertainty_score":0.005383253},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058756815,0.00012537155,0.99879456,0.00002019101,0.000025183876,0.000011542142,0.000004708421,0.00010675108,0.00032401207],"genre_scores_gemma":[0.10334587,0.0007084315,0.89095926,0.00008578932,0.00017278761,0.00019321861,0.000077972065,0.000092509385,0.0043641594],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949396,0.00014619599,0.000033788503,0.00011612313,0.00018751538,0.00002237925],"domain_scores_gemma":[0.99940693,0.0003112981,0.000085221356,0.00006430846,0.00011961344,0.000012629546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008139865,0.00092649163,0.0008599419,0.0005813855,0.0005866499,0.000519841,0.0007058864,0.0010951766,0.0018185376],"category_scores_gemma":[0.0028783756,0.0004260848,0.00086019095,0.00054987473,0.0005078819,0.0008861945,0.00077286764,0.0015645243,0.0012874765],"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.0001503198,0.000067847555,0.00049568084,0.00051677413,0.00016761535,0.00048461073,0.00048223458,0.27787042,0.070567966,0.06413808,0.002442186,0.58261627],"study_design_scores_gemma":[0.000010581124,0.000068874404,0.00020748818,0.000037738435,0.000029126759,0.000268089,0.000020457112,0.9757943,0.0066540497,0.0072857263,0.009594239,0.000029293456],"about_ca_topic_score_codex":0.0009992822,"about_ca_topic_score_gemma":0.0011010189,"teacher_disagreement_score":0.0018185376,"about_ca_system_score_codex":0.00022370944,"about_ca_system_score_gemma":0.0005093868,"threshold_uncertainty_score":0.0060836077},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010559506,0.00009944748,0.9888678,0.000026146667,0.0000078585035,0.0000045571574,0.000015683056,0.00017786399,0.00024107973],"genre_scores_gemma":[0.33266118,0.00052251975,0.66447544,0.000055632092,0.000081212675,0.00006723733,0.00024320949,0.00018468653,0.001708854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992951,0.00021848516,0.000039059723,0.00015463868,0.00025560756,0.000037081158],"domain_scores_gemma":[0.9991466,0.00043237797,0.00012614996,0.00012947238,0.0001515007,0.000013928609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008542699,0.0006322767,0.0007770094,0.00057617365,0.00017428224,0.0006648866,0.00058086135,0.0007772597,0.00040395066],"category_scores_gemma":[0.0043527973,0.00036330093,0.00045218653,0.00057405996,0.0005553396,0.001127595,0.0007390523,0.0008259348,0.00033931748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020961682,0.000057900685,0.0008261748,0.00015558522,0.000109113804,0.00018771553,0.00011969302,0.50920504,0.10894866,0.032129202,0.0013343174,0.34671694],"study_design_scores_gemma":[0.000008736723,0.000021390862,0.00042373952,0.0000060341968,0.0000117757345,0.00006337317,0.0000085374795,0.9772345,0.014779959,0.0067976397,0.0006264095,0.000018020455],"about_ca_topic_score_codex":0.0008922852,"about_ca_topic_score_gemma":0.00069672515,"teacher_disagreement_score":0.0008922852,"about_ca_system_score_codex":0.00022400785,"about_ca_system_score_gemma":0.00054476154,"threshold_uncertainty_score":0.0045178533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015818543,0.0007506584,0.99544734,0.0001584993,0.000060044335,0.0000259564,0.00004216456,0.00050717447,0.0014262943],"genre_scores_gemma":[0.04517063,0.0029237077,0.94850045,0.0001255033,0.0002895179,0.00011997739,0.00015190839,0.00020637602,0.0025119432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970835,0.00009039822,0.000018635756,0.00004487614,0.000120582066,0.000017142835],"domain_scores_gemma":[0.9995832,0.0002208234,0.00003595617,0.00004552908,0.00009915545,0.000015297994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006511841,0.0010630423,0.0007253841,0.0009431132,0.0004197235,0.00075800414,0.0006096192,0.0010925214,0.0018991686],"category_scores_gemma":[0.0024431103,0.00024009674,0.00065000786,0.0018320777,0.0007387495,0.00056129065,0.00077250326,0.0010044379,0.0011129222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015821279,0.00006956043,0.0006851822,0.00045733043,0.00015927432,0.0006541198,0.00027169133,0.15669347,0.080597125,0.052567337,0.011204633,0.69648206],"study_design_scores_gemma":[0.00002825294,0.00010485244,0.0012584992,0.00006272703,0.000059844504,0.0010712077,0.000056537483,0.88374823,0.026342964,0.0507523,0.036456436,0.00005814728],"about_ca_topic_score_codex":0.0018122644,"about_ca_topic_score_gemma":0.0016605201,"teacher_disagreement_score":0.0018991686,"about_ca_system_score_codex":0.00023978605,"about_ca_system_score_gemma":0.0005951177,"threshold_uncertainty_score":0.0063533783},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002122719,0.00007671379,0.9972264,0.000039143215,0.0000065472486,0.000010736098,0.000049808958,0.00023924996,0.00022869596],"genre_scores_gemma":[0.22730602,0.0009725753,0.7629477,0.0001292971,0.000095848685,0.00038475142,0.0014144303,0.00043118605,0.0063182754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979899,0.00094447675,0.00010817631,0.00040433658,0.0003801509,0.00017302063],"domain_scores_gemma":[0.9905978,0.0070700296,0.00058940204,0.0009688378,0.00066485634,0.000109083856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029240393,0.0009806855,0.001402706,0.0014390443,0.00056260556,0.0014771417,0.0020812112,0.0011763732,0.0033673407],"category_scores_gemma":[0.020892916,0.0011655506,0.0012988565,0.001433305,0.0012902564,0.002919401,0.0016813147,0.002103399,0.0013732937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106062864,0.000038798866,0.0011738897,0.00013180554,0.00012160991,0.00014011025,0.0002167774,0.72292125,0.0032273396,0.1803657,0.0016330478,0.08992366],"study_design_scores_gemma":[0.0000065406552,0.0000060135358,0.00017483273,0.0000115686225,0.000009196118,0.00002220124,0.0000058092073,0.95936227,0.0006981871,0.03916885,0.0005195348,0.000014919386],"about_ca_topic_score_codex":0.0100369165,"about_ca_topic_score_gemma":0.015584136,"teacher_disagreement_score":0.0100369165,"about_ca_system_score_codex":0.0015077378,"about_ca_system_score_gemma":0.0021140974,"threshold_uncertainty_score":0.019957006},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009408956,0.00025141757,0.9885492,0.0001106567,0.000019039966,0.000018328341,0.000030555642,0.00014886896,0.0014630673],"genre_scores_gemma":[0.38077706,0.0011246259,0.6129114,0.00020492898,0.00010261063,0.00019765328,0.0003268366,0.000103506594,0.0042512743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951184,0.000158236,0.000019790528,0.000067086505,0.00020475131,0.00003840429],"domain_scores_gemma":[0.9990521,0.00058083347,0.00008514269,0.000092510054,0.00015521416,0.000034189998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057637464,0.00036120505,0.0005410799,0.0007232298,0.00032262868,0.00052082643,0.00047368722,0.0008084972,0.002132824],"category_scores_gemma":[0.004055187,0.0002285838,0.00034546934,0.0013190121,0.00068217935,0.0010471132,0.0011674322,0.00084158353,0.00083404774],"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.00036155526,0.000063521795,0.0005798994,0.00023747692,0.00006120424,0.00013661299,0.00013151331,0.44709885,0.02934077,0.2560238,0.0045010247,0.26146382],"study_design_scores_gemma":[0.000025377989,0.00005333884,0.00007874787,0.000007867007,0.000004815453,0.0000424037,0.000007372496,0.9531558,0.0021635054,0.042895064,0.001558643,0.0000070534393],"about_ca_topic_score_codex":0.001066453,"about_ca_topic_score_gemma":0.00078416255,"teacher_disagreement_score":0.002132824,"about_ca_system_score_codex":0.00048319894,"about_ca_system_score_gemma":0.0006807483,"threshold_uncertainty_score":0.0071350336},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03930519,0.0010050833,0.9478683,0.00020332394,0.00008237719,0.0000745247,0.00013617745,0.0033329593,0.007992067],"genre_scores_gemma":[0.33100426,0.0007456297,0.6585217,0.00013023864,0.000087434666,0.00014799506,0.00045697708,0.00015770287,0.008748039],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99987924,0.000012541477,0.000006207641,0.000015932364,0.00007646675,0.000009517388],"domain_scores_gemma":[0.9998356,0.00004001396,0.000018006365,0.000042170563,0.00005282518,0.000011321847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017302466,0.00027162087,0.00031362573,0.00072895293,0.00022428672,0.00038052135,0.00048923417,0.00036648996,0.001485936],"category_scores_gemma":[0.0005943374,0.00014181726,0.0002266212,0.00066457555,0.00029450527,0.0007067911,0.0003694045,0.0005449945,0.00054932915],"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.00034286815,0.00009918148,0.0007200491,0.0001696699,0.000051453648,0.00025704948,0.00008117585,0.106486656,0.12097331,0.038613353,0.005616014,0.72658926],"study_design_scores_gemma":[0.000016244594,0.000061019306,0.0005759387,0.000008500028,0.000013961951,0.00027946307,0.000008993912,0.9362128,0.05177329,0.004061914,0.0069719106,0.000015954023],"about_ca_topic_score_codex":0.0019475808,"about_ca_topic_score_gemma":0.0025683797,"teacher_disagreement_score":0.0019475808,"about_ca_system_score_codex":0.00040208333,"about_ca_system_score_gemma":0.00033915046,"threshold_uncertainty_score":0.004970968},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022578344,0.00016309787,0.9967152,0.000061716404,0.000022332339,0.000016540178,0.000009515071,0.00013423168,0.0006195515],"genre_scores_gemma":[0.14235494,0.0004565764,0.85247636,0.00020063104,0.00011329678,0.00023641602,0.00008583122,0.00016555464,0.003910329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809283,0.0008214233,0.00010343463,0.0003294207,0.00053228636,0.000120552875],"domain_scores_gemma":[0.9967006,0.0018848443,0.00030044088,0.0006096826,0.00042223302,0.000082068786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030453727,0.0012806511,0.0009656211,0.0007133081,0.00045163019,0.0010991462,0.0021474855,0.0016348866,0.004007468],"category_scores_gemma":[0.011334227,0.0004863975,0.0005520739,0.0010245206,0.0014706189,0.0023164703,0.0020640974,0.0024214354,0.001573408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023596534,0.00009031826,0.00046883718,0.00021360042,0.000091213726,0.000091209644,0.00012573146,0.65261984,0.010284843,0.104445495,0.0033992508,0.22793373],"study_design_scores_gemma":[0.000023550343,0.00004436977,0.000078961566,0.0000115337,0.000007504764,0.000033054705,0.0000065962677,0.9803591,0.0024747062,0.015143013,0.0018040169,0.0000137143315],"about_ca_topic_score_codex":0.0009957554,"about_ca_topic_score_gemma":0.001032382,"teacher_disagreement_score":0.004007468,"about_ca_system_score_codex":0.00060597435,"about_ca_system_score_gemma":0.0007900259,"threshold_uncertainty_score":0.016105652},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074330424,0.00024889762,0.99159336,0.000079371115,0.00001591433,0.000011596918,0.000024964158,0.0001522106,0.0004406385],"genre_scores_gemma":[0.5494063,0.0014232739,0.44445795,0.00008630293,0.00012655632,0.0000929833,0.00022162005,0.00007663463,0.0041083926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996151,0.00012072465,0.000014073166,0.000059845675,0.00015020472,0.000040178948],"domain_scores_gemma":[0.99923885,0.00048380313,0.00008785237,0.0000549451,0.00011509264,0.000019442898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047211806,0.00039230328,0.00049191527,0.00034681306,0.00035036544,0.00050552137,0.00031944076,0.0005090495,0.0013296879],"category_scores_gemma":[0.0030997852,0.00021110757,0.00028314002,0.0005622502,0.0005806759,0.00079510565,0.0005759584,0.0007814104,0.00047010192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026079893,0.000048215283,0.00046612596,0.00018103121,0.000046301815,0.00008632485,0.00008316875,0.7139799,0.022999983,0.05775779,0.002366051,0.20172428],"study_design_scores_gemma":[0.00001120222,0.000015514375,0.000098003664,0.0000032186915,0.000003892348,0.00002488046,0.0000052523933,0.9899546,0.002472409,0.0067786435,0.00062163675,0.000010728562],"about_ca_topic_score_codex":0.0030875306,"about_ca_topic_score_gemma":0.0025748145,"teacher_disagreement_score":0.0030875306,"about_ca_system_score_codex":0.0005320396,"about_ca_system_score_gemma":0.0011879683,"threshold_uncertainty_score":0.0061390996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088841364,0.00063058874,0.9056571,0.00012845406,0.00005289375,0.00007072729,0.000052240735,0.0007042143,0.0038624855],"genre_scores_gemma":[0.73618776,0.0004421475,0.25808445,0.00013084797,0.00004964828,0.000085792955,0.000118777214,0.000054381206,0.0048461193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928516,0.00022142108,0.00003324794,0.00006501851,0.0003235251,0.00007169389],"domain_scores_gemma":[0.9977543,0.0012892572,0.00020786513,0.00010662871,0.0005973926,0.000044533088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016025122,0.0005534542,0.0005751065,0.00054068083,0.00034849942,0.00075805,0.0009275087,0.0008906018,0.0021009394],"category_scores_gemma":[0.0031580853,0.00016797839,0.00037025387,0.00034704394,0.00046520974,0.0011736942,0.00037021327,0.00074149424,0.00055390655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008267848,0.0002551464,0.0028132591,0.0003396015,0.00018536203,0.00015365177,0.00009738565,0.77544284,0.04427853,0.009793927,0.00097020273,0.1648434],"study_design_scores_gemma":[0.000010217726,0.00022380454,0.0003341857,0.0000076753895,0.000027838994,0.00005174126,0.000007829281,0.97847605,0.019985046,0.0005053506,0.00035823754,0.000012066344],"about_ca_topic_score_codex":0.0013275993,"about_ca_topic_score_gemma":0.0021388554,"teacher_disagreement_score":0.0021009394,"about_ca_system_score_codex":0.0010518183,"about_ca_system_score_gemma":0.00049518916,"threshold_uncertainty_score":0.008475006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024974789,0.00038416317,0.9951094,0.00008789524,0.000041640706,0.000019869185,0.0000089158775,0.00015537064,0.0016953008],"genre_scores_gemma":[0.24286428,0.0012702335,0.74669343,0.00019459544,0.00009290463,0.0003439373,0.00006581544,0.00023030369,0.008244442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995547,0.0002460669,0.000015764517,0.000048391244,0.000115074574,0.000020027805],"domain_scores_gemma":[0.9996816,0.00020111112,0.000026127287,0.00003524916,0.00004318677,0.000012841543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006075195,0.0004659382,0.0007772838,0.00038622296,0.00032207553,0.00055915717,0.0004985701,0.0010218102,0.001253655],"category_scores_gemma":[0.0015944579,0.00041357704,0.00053671515,0.00047092806,0.0009913542,0.00057310483,0.00062916585,0.00091981434,0.00044484806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043455864,0.000015293715,0.00016190465,0.00008546508,0.000051912783,0.000040489987,0.00005547467,0.89153,0.00668047,0.06199871,0.0011075403,0.038229305],"study_design_scores_gemma":[0.00000837537,0.000016735388,0.000069561946,0.0000070420956,0.000005856924,0.000015234794,0.0000029844568,0.985666,0.0014624196,0.009650354,0.0030875981,0.000007867205],"about_ca_topic_score_codex":0.0014338141,"about_ca_topic_score_gemma":0.001461304,"teacher_disagreement_score":0.0014338141,"about_ca_system_score_codex":0.00056440325,"about_ca_system_score_gemma":0.00047934474,"threshold_uncertainty_score":0.004193902},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02842432,0.002364493,0.9574172,0.00030635356,0.0002196416,0.000025144322,0.00012210355,0.0003790256,0.010741701],"genre_scores_gemma":[0.50561327,0.005200559,0.47598055,0.00025566074,0.0004575597,0.00005975583,0.00050670054,0.00014598263,0.011779983],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979204,0.000032677828,0.000013568546,0.000036538113,0.000109271314,0.000015853891],"domain_scores_gemma":[0.99959546,0.00016996393,0.000049515937,0.00006369211,0.00010303831,0.000018271501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030589584,0.00043344242,0.00026739715,0.0007037679,0.00020066771,0.0004927431,0.0002841035,0.00045635263,0.0021779072],"category_scores_gemma":[0.0015497124,0.00014800434,0.00036949504,0.00086295884,0.00058657414,0.0010439228,0.00028383627,0.0006889806,0.00072223425],"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.00042037186,0.00006692721,0.0012794351,0.00045821458,0.000051713203,0.0004764087,0.00018894539,0.08227194,0.113690324,0.25749555,0.0049952758,0.53860486],"study_design_scores_gemma":[0.000042977605,0.00022671543,0.0017971726,0.000056278765,0.000047371814,0.0019517177,0.00010276005,0.7883067,0.07934862,0.09083988,0.037192855,0.000086934306],"about_ca_topic_score_codex":0.0006019607,"about_ca_topic_score_gemma":0.00046145363,"teacher_disagreement_score":0.0021779072,"about_ca_system_score_codex":0.00021270232,"about_ca_system_score_gemma":0.0002746104,"threshold_uncertainty_score":0.0072857738},"labels":[],"label_agreement":null},{"id":"W2142134169","doi":"10.1109/tsp.2002.1011206","title":"A fractionally spaced blind equalizer based on linear programming","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Blind equalization; Baud; Quadrature amplitude modulation; QAM; Linear programming; Intersymbol interference; Convex optimization; Computer science; Piecewise linear function; Equalization (audio); Equalizer; Quadratic programming; Mathematics; Algorithm; Control theory (sociology); Mathematical optimization; Regular polygon; Transmission (telecommunications); Telecommunications; Decoding methods; Bit error rate; Artificial intelligence","score_opus":0.05052993359516259,"score_gpt":0.3000487753965221,"score_spread":0.2495188418013595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142134169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011577695,0.000035813526,0.9982008,0.000034572113,0.000008155313,0.0000061761216,0.0000041189737,0.000057197056,0.00049533456],"genre_scores_gemma":[0.1543126,0.00036100083,0.8389829,0.00010864596,0.000057041594,0.00013742718,0.00005045092,0.00007219045,0.005917794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975556,0.0000814793,0.000009530889,0.000043054744,0.000082775514,0.000027548704],"domain_scores_gemma":[0.99979967,0.00011600343,0.000021158236,0.000015722686,0.000038490933,0.000008954998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042767383,0.00059859606,0.0006360803,0.00028372477,0.00026127,0.00073777797,0.00060856494,0.0006545509,0.0018131024],"category_scores_gemma":[0.00093692617,0.00030286913,0.00038539307,0.00045514252,0.00053519354,0.00086330343,0.0005553373,0.0010556671,0.0005385897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070681606,0.00004135588,0.00009746817,0.000072213144,0.00002327258,0.000047122012,0.000047487334,0.84517086,0.013218003,0.04101349,0.0012558311,0.09894227],"study_design_scores_gemma":[0.000005069146,0.000021402702,0.000015320114,0.0000031184925,0.0000038899825,0.000017691862,0.000004236642,0.99289274,0.0019416317,0.0042505823,0.00084030366,0.000003997165],"about_ca_topic_score_codex":0.0013672288,"about_ca_topic_score_gemma":0.00119664,"teacher_disagreement_score":0.0018131024,"about_ca_system_score_codex":0.0004245787,"about_ca_system_score_gemma":0.00063417864,"threshold_uncertainty_score":0.006065488},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03571197,0.00030923044,0.96312803,0.00014333302,0.000013380169,0.000009379891,0.000018629784,0.00009062464,0.0005754111],"genre_scores_gemma":[0.67884886,0.0004851599,0.31893057,0.00014768091,0.000057545163,0.000046148394,0.00008147396,0.000025628708,0.0013769479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982432,0.000840126,0.0000750049,0.00024414508,0.0004752669,0.00012226787],"domain_scores_gemma":[0.99577564,0.0031460333,0.00045038763,0.00020185146,0.00035725956,0.00006879915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022698585,0.00039283544,0.0008483378,0.00065217254,0.00021010273,0.00091763167,0.0005362117,0.0010271716,0.0002993585],"category_scores_gemma":[0.012020267,0.0003337605,0.0002212735,0.00071612076,0.001059947,0.0014524403,0.0010490838,0.0006137825,0.00018654086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017220149,0.00010788838,0.0063509927,0.00035662774,0.000096127274,0.0006850792,0.0006557158,0.42607236,0.07543186,0.18992414,0.0015903235,0.2970068],"study_design_scores_gemma":[0.000032969736,0.000055915876,0.0007604649,0.000013197689,0.000009147553,0.00016572446,0.000018943383,0.96149904,0.012944597,0.023850821,0.00062468863,0.00002455005],"about_ca_topic_score_codex":0.0005343706,"about_ca_topic_score_gemma":0.00036963084,"teacher_disagreement_score":0.0022698585,"about_ca_system_score_codex":0.00049028127,"about_ca_system_score_gemma":0.0005046218,"threshold_uncertainty_score":0.012004316},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006596491,0.0004936383,0.9917109,0.00007028789,0.000050277198,0.000026340696,0.000046908666,0.00041215372,0.00059293304],"genre_scores_gemma":[0.17983729,0.0016378451,0.8151382,0.00013428848,0.00020493937,0.00011023107,0.00048723858,0.00019607085,0.002253903],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99955386,0.000072759525,0.000024165818,0.00007831054,0.00023463195,0.000036188245],"domain_scores_gemma":[0.9995695,0.0001360287,0.00004790564,0.000075859236,0.00015480968,0.000015914584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053789717,0.0006759623,0.001046472,0.0022241825,0.00027058207,0.0009241421,0.0007701163,0.00070986967,0.0012772767],"category_scores_gemma":[0.001799531,0.00028155075,0.0008104193,0.0021583482,0.0004715028,0.0016019928,0.00057409494,0.00062012376,0.0009409586],"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.00025329366,0.000086607586,0.0006697014,0.00031735923,0.00013184988,0.0002285079,0.000085856926,0.060828842,0.18020925,0.0128154,0.0033036117,0.7410697],"study_design_scores_gemma":[0.00003423956,0.00009693575,0.0012724339,0.000020183184,0.000087800516,0.00039228104,0.00004605034,0.9351883,0.048705988,0.007876425,0.0062229596,0.00005640957],"about_ca_topic_score_codex":0.0012837267,"about_ca_topic_score_gemma":0.0010275147,"teacher_disagreement_score":0.0022241825,"about_ca_system_score_codex":0.00033533416,"about_ca_system_score_gemma":0.0004069981,"threshold_uncertainty_score":0.004272878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039174993,0.00040133155,0.9983411,0.000065989196,0.00004123434,0.000015713409,0.000062907726,0.00024156591,0.00043843506],"genre_scores_gemma":[0.051714957,0.0032189665,0.94004697,0.00014128417,0.00022809864,0.0003324449,0.00080141774,0.0002942998,0.0032214955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906296,0.00027422307,0.000049480543,0.00016577014,0.00040819816,0.000039525927],"domain_scores_gemma":[0.99890053,0.0005261724,0.00009616835,0.0002383049,0.00021413545,0.000024712024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012970219,0.0013537556,0.0011235066,0.0014253096,0.00041604272,0.000977783,0.0014618615,0.0014129101,0.0036074521],"category_scores_gemma":[0.0049191928,0.00053314347,0.001214329,0.0036259603,0.00094595645,0.0013898582,0.0009809836,0.0024140382,0.0036849265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009209642,0.0000705006,0.00046569825,0.00039715634,0.00018006291,0.00023736138,0.00013275702,0.29718596,0.019993197,0.16804796,0.012323884,0.50087345],"study_design_scores_gemma":[0.0000078272005,0.000023292192,0.00024232885,0.000026785585,0.000018745257,0.00008255366,0.000010748544,0.94589335,0.0022656752,0.03965361,0.011744727,0.000030322248],"about_ca_topic_score_codex":0.0029573713,"about_ca_topic_score_gemma":0.0022714227,"teacher_disagreement_score":0.0036074521,"about_ca_system_score_codex":0.00061206357,"about_ca_system_score_gemma":0.0009613989,"threshold_uncertainty_score":0.012068152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053088074,0.00014978398,0.99271107,0.0001434112,0.000020555788,0.000010840437,0.00006257845,0.00014122714,0.0014516542],"genre_scores_gemma":[0.619348,0.0014286843,0.36200076,0.00029542728,0.00022909482,0.00021812794,0.00056598807,0.00042457916,0.015489273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966097,0.00010879078,0.00001747295,0.00007524636,0.000107614316,0.000029913812],"domain_scores_gemma":[0.99889344,0.0005737759,0.00012922424,0.00016774674,0.00018499928,0.00005086219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009429322,0.00053711433,0.00054350385,0.0008412873,0.00027425587,0.001085007,0.0012616045,0.0007893205,0.0028384582],"category_scores_gemma":[0.004119087,0.00037956797,0.0008078553,0.0012008597,0.0011945382,0.0023476912,0.00093682576,0.0011231075,0.00076386495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034377925,0.00002294926,0.0007255957,0.000071275055,0.000052775016,0.00012635053,0.0001293994,0.4661988,0.0022366147,0.48434353,0.0023494954,0.043708913],"study_design_scores_gemma":[0.000002208031,0.000011756803,0.00013784588,0.0000031735724,0.0000048777065,0.000052468145,0.0000067156857,0.8981703,0.00027935268,0.10010706,0.0012179582,0.0000062036593],"about_ca_topic_score_codex":0.002945136,"about_ca_topic_score_gemma":0.0027732432,"teacher_disagreement_score":0.002945136,"about_ca_system_score_codex":0.0006461155,"about_ca_system_score_gemma":0.0006452725,"threshold_uncertainty_score":0.009495616},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016352539,0.00045629905,0.99722654,0.00003370761,0.00002056904,0.000010274584,0.00001955809,0.0000797146,0.0005180093],"genre_scores_gemma":[0.18823393,0.0034013637,0.8039225,0.0001954654,0.00026115708,0.00015821483,0.0002203824,0.000114939314,0.0034919728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902415,0.0004218344,0.00003861275,0.00013184024,0.00031564664,0.00006802136],"domain_scores_gemma":[0.99898595,0.0003887423,0.00010671453,0.000236451,0.00025819143,0.000023904242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010137729,0.00075215276,0.0011698272,0.000781177,0.00031761808,0.0008145847,0.00077705976,0.0009929319,0.0013123676],"category_scores_gemma":[0.0033106504,0.00030969386,0.0007266759,0.0013450807,0.00094766007,0.0014880543,0.0011565192,0.0008776092,0.00061482255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081660786,0.00004001785,0.00042882742,0.00043184508,0.00019292376,0.00008114578,0.00010634498,0.609993,0.014508204,0.15561393,0.0025003208,0.2160217],"study_design_scores_gemma":[0.000008728099,0.000042087737,0.00015026356,0.000019975083,0.000021953845,0.00014061003,0.000011507046,0.9627441,0.0045013004,0.028193096,0.004133269,0.000033044053],"about_ca_topic_score_codex":0.0013749215,"about_ca_topic_score_gemma":0.0011225145,"teacher_disagreement_score":0.0013749215,"about_ca_system_score_codex":0.00039087445,"about_ca_system_score_gemma":0.0010074385,"threshold_uncertainty_score":0.005361378},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002888054,0.693177,0.11434565,0.005087604,0.0021379418,0.00006413382,0.00014115342,0.0002521583,0.18190636],"genre_scores_gemma":[0.073375784,0.8090558,0.046316992,0.0049601165,0.0044469303,0.00023048816,0.00038867161,0.00015194973,0.061073173],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990452,0.00017110766,0.000056822766,0.0002249481,0.00042447448,0.000077466815],"domain_scores_gemma":[0.9993319,0.00040076365,0.000059562124,0.00006197126,0.00011008028,0.000035759113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082970504,0.0009446731,0.0014491439,0.0013640845,0.0010796789,0.0024319224,0.0017262881,0.0027387622,0.0108344015],"category_scores_gemma":[0.0022381714,0.0004729518,0.0008205868,0.001504632,0.0023418162,0.004774692,0.0021411679,0.002292075,0.006065997],"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.00006671057,0.000052522068,0.00019732655,0.0027285733,0.00007625535,0.00040047136,0.0002197995,0.0030614065,0.0021324523,0.4297687,0.044953942,0.5163418],"study_design_scores_gemma":[0.000016317672,0.000050096627,0.00032269963,0.0008301066,0.000036789977,0.0021533456,0.00016275686,0.0019496797,0.001580782,0.22888462,0.7639634,0.000049381088],"about_ca_topic_score_codex":0.0007401874,"about_ca_topic_score_gemma":0.0005605676,"teacher_disagreement_score":0.0108344015,"about_ca_system_score_codex":0.00090071606,"about_ca_system_score_gemma":0.0011626048,"threshold_uncertainty_score":0.03624469},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037511583,0.0005287792,0.96052337,0.00004944868,0.000047396683,0.00001543208,0.00001301481,0.00026703117,0.0010438652],"genre_scores_gemma":[0.46794853,0.00064722355,0.5279522,0.000083248844,0.000079695055,0.0000330761,0.000050756436,0.000052377607,0.0031529788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997367,0.00007272912,0.000016899892,0.0000539536,0.00008733964,0.00003233022],"domain_scores_gemma":[0.999713,0.00014394462,0.000042840755,0.00003697368,0.00004891733,0.0000144215255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004281893,0.00047619097,0.00044571888,0.00043868137,0.00024816976,0.00035645443,0.00038599846,0.00056877534,0.00070734567],"category_scores_gemma":[0.0011446167,0.0001951221,0.00031780315,0.0002949397,0.00067323097,0.00075217395,0.0004833047,0.00045185623,0.00021052545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077461323,0.00010759021,0.000926826,0.00034312878,0.000108178814,0.0003153559,0.00023804471,0.15740448,0.23316792,0.029359033,0.00073440396,0.5765204],"study_design_scores_gemma":[0.000023573915,0.00021005653,0.0010729575,0.000021776354,0.0000367472,0.000494385,0.000035662488,0.87193286,0.10848903,0.013870881,0.0037701055,0.00004192669],"about_ca_topic_score_codex":0.0003949004,"about_ca_topic_score_gemma":0.0007956291,"teacher_disagreement_score":0.00070734567,"about_ca_system_score_codex":0.00019967543,"about_ca_system_score_gemma":0.00026079096,"threshold_uncertainty_score":0.002366364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004624202,0.00017848097,0.99421906,0.0002040063,0.000013182186,0.000012139042,0.000025555162,0.000066734625,0.0006565478],"genre_scores_gemma":[0.39326409,0.0009241108,0.6008951,0.00021143073,0.00023817361,0.00015503248,0.00016304276,0.000063519234,0.0040856046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986934,0.00056598394,0.0000562457,0.00019441117,0.00039758376,0.000092339185],"domain_scores_gemma":[0.9958289,0.0031874846,0.00038101783,0.00024018831,0.0002743225,0.000087977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035107844,0.000791513,0.0011271605,0.00083167123,0.00043246924,0.0008861886,0.001498642,0.002309317,0.0009564443],"category_scores_gemma":[0.012474271,0.00063024706,0.00057563896,0.0009291144,0.002348946,0.0016193412,0.0015175338,0.0011609575,0.0005830434],"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.0002935634,0.00009004753,0.0016488055,0.0002849496,0.00008339471,0.0007507948,0.00021872141,0.6143503,0.005790273,0.29518622,0.0021552541,0.079147674],"study_design_scores_gemma":[0.000020499605,0.000011744301,0.00017106667,0.0000075261223,0.0000055878313,0.0001218108,0.000007329993,0.9580583,0.0012417855,0.03983585,0.00050341664,0.000015048362],"about_ca_topic_score_codex":0.0013677562,"about_ca_topic_score_gemma":0.0009809565,"teacher_disagreement_score":0.0035107844,"about_ca_system_score_codex":0.00068490626,"about_ca_system_score_gemma":0.001006274,"threshold_uncertainty_score":0.018567026},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079808757,0.00013538975,0.99764013,0.000039833638,0.000025783387,0.000013269846,0.000018810138,0.00015047904,0.0011782721],"genre_scores_gemma":[0.08289766,0.0011545826,0.90785044,0.00020439044,0.00022079484,0.00013126062,0.00027565315,0.00013899073,0.0071262773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944395,0.00013181151,0.000030634073,0.0000827989,0.00027969957,0.000031060248],"domain_scores_gemma":[0.9996995,0.00012369588,0.000022467839,0.00007435229,0.00006621031,0.000013720346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041925866,0.0008954719,0.00075497566,0.000695031,0.00032126805,0.00069818244,0.0009030247,0.00095958647,0.0033329271],"category_scores_gemma":[0.001352416,0.00030566406,0.0006141379,0.0005229755,0.0006185675,0.0011354602,0.00088347844,0.0012737717,0.0024029696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023900816,0.00008670737,0.00023334136,0.00040326788,0.00008728564,0.0002821288,0.00013035945,0.24351759,0.06830183,0.13870205,0.0054196166,0.5425968],"study_design_scores_gemma":[0.000027884536,0.0001115055,0.00030501868,0.000028079823,0.00003964307,0.00047363335,0.000011364355,0.9247924,0.016844062,0.036906347,0.020420952,0.000039095627],"about_ca_topic_score_codex":0.0010224627,"about_ca_topic_score_gemma":0.0011591905,"teacher_disagreement_score":0.0033329271,"about_ca_system_score_codex":0.00039600587,"about_ca_system_score_gemma":0.0005871173,"threshold_uncertainty_score":0.011149704},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012854532,0.00016398993,0.9976991,0.000053687556,0.000030507597,0.0000128842385,0.00001611988,0.00020227146,0.0005359415],"genre_scores_gemma":[0.040775135,0.00027715522,0.9556105,0.000075749296,0.000056218913,0.00010004133,0.00011195873,0.0000701356,0.0029230355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965096,0.00008619196,0.000019530362,0.00009227641,0.00013229689,0.000018737115],"domain_scores_gemma":[0.9996222,0.00014343581,0.000039894476,0.000066516564,0.00010831399,0.000019509658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063161354,0.0006617725,0.0005310078,0.00045481528,0.00039910618,0.00056146935,0.00071034057,0.00092757895,0.0039217356],"category_scores_gemma":[0.0018352799,0.00030848978,0.0004310986,0.00091454224,0.0005556356,0.001224543,0.0007742569,0.001124104,0.0017276898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022293332,0.00007235736,0.00039508814,0.00017024874,0.000060129205,0.00008112447,0.00008277636,0.1804235,0.041226894,0.08295726,0.0063781324,0.6879295],"study_design_scores_gemma":[0.00002974291,0.000068797286,0.00017548043,0.00001024684,0.000008380402,0.0001326397,0.0000068543677,0.9739111,0.007292402,0.010299781,0.008041068,0.000023581886],"about_ca_topic_score_codex":0.0012292379,"about_ca_topic_score_gemma":0.0012045015,"teacher_disagreement_score":0.0039217356,"about_ca_system_score_codex":0.00034678413,"about_ca_system_score_gemma":0.001088642,"threshold_uncertainty_score":0.013119578},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010046533,0.0024415907,0.9930091,0.00016761204,0.00007513108,0.00004316744,0.00012894462,0.00022134521,0.0029084848],"genre_scores_gemma":[0.117201604,0.013098751,0.8588455,0.0006625781,0.0005274338,0.00070257037,0.0010610311,0.00053472084,0.0073659187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967892,0.00092803093,0.0002374348,0.0004604576,0.0013019247,0.00028292672],"domain_scores_gemma":[0.98932797,0.0072507374,0.0006146981,0.0008153381,0.0019107083,0.00008059548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046322807,0.00234058,0.0015828513,0.0021310567,0.00066639454,0.0028484603,0.0020848985,0.0018489292,0.009493655],"category_scores_gemma":[0.031493846,0.00084347255,0.0009440126,0.0023896212,0.0016887537,0.0037811764,0.0014701321,0.0028183,0.0057470333],"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.00015111308,0.00011985164,0.0005042012,0.0014475258,0.00016491368,0.00024743544,0.0004261251,0.3954826,0.009720667,0.33566332,0.015224293,0.24084795],"study_design_scores_gemma":[0.0000330598,0.000102561826,0.0005969695,0.00045718037,0.00007957657,0.00067689165,0.00014477626,0.84602356,0.0075127245,0.12333825,0.020903422,0.00013098719],"about_ca_topic_score_codex":0.0026017644,"about_ca_topic_score_gemma":0.004494879,"teacher_disagreement_score":0.009493655,"about_ca_system_score_codex":0.0017658889,"about_ca_system_score_gemma":0.0023011554,"threshold_uncertainty_score":0.03175944},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05574354,0.00027857957,0.9387481,0.00015409205,0.000077402365,0.000074587995,0.00005894265,0.0017397605,0.0031250026],"genre_scores_gemma":[0.54986984,0.00018635251,0.44454873,0.00014615292,0.000050361483,0.00010785329,0.00014703142,0.00008743975,0.004856326],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997224,0.000060748043,0.000011524693,0.000053402073,0.00012383172,0.000028020033],"domain_scores_gemma":[0.9997596,0.00008055417,0.00004401348,0.00003917826,0.00006248845,0.000014266223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023177633,0.00040484272,0.00029964861,0.00034691594,0.00017642372,0.00030905497,0.0007706104,0.00026760218,0.0015897199],"category_scores_gemma":[0.00055626535,0.00013206691,0.00016198741,0.0003042653,0.00022961656,0.00047171587,0.00034434284,0.0002868899,0.0005290688],"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.00084332726,0.00018578094,0.0011779239,0.00022891395,0.000058508875,0.00041279595,0.0001044418,0.089465015,0.39489198,0.037384413,0.002891542,0.47235537],"study_design_scores_gemma":[0.00014969756,0.0006620909,0.00065313786,0.000021459706,0.000039511186,0.0007613886,0.000015501042,0.68153954,0.29753008,0.0059494637,0.012636372,0.00004178362],"about_ca_topic_score_codex":0.00037510553,"about_ca_topic_score_gemma":0.00072306034,"teacher_disagreement_score":0.0015897199,"about_ca_system_score_codex":0.00027640339,"about_ca_system_score_gemma":0.00035955544,"threshold_uncertainty_score":0.005318105},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038048194,0.000102970625,0.9953785,0.000033864813,0.000027595146,0.000015397582,0.000021144335,0.00021167345,0.0004040562],"genre_scores_gemma":[0.12480291,0.0004049724,0.87240165,0.000056339155,0.00006985291,0.000110927416,0.0002499104,0.000103490434,0.0017999373],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991273,0.000264745,0.000052982738,0.00015003468,0.00034427783,0.000060579903],"domain_scores_gemma":[0.9990715,0.00029605228,0.00007774189,0.00014028106,0.00038302992,0.00003137978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009785668,0.0007246973,0.0009611108,0.0011298001,0.0003132238,0.0008014575,0.00058722496,0.00049890124,0.0012039635],"category_scores_gemma":[0.0032432107,0.00026244816,0.0007443059,0.0013433921,0.0006311547,0.0009213213,0.000806419,0.00093083305,0.00073454384],"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.00016422664,0.00007766667,0.0008851113,0.0001624363,0.0001308021,0.00010079188,0.00010056174,0.17680964,0.04105228,0.049486388,0.0043661725,0.72666395],"study_design_scores_gemma":[0.000012499208,0.000037952756,0.0003417633,0.000006960222,0.000011817783,0.00006764262,0.000012992858,0.981203,0.006609742,0.009056672,0.0026147238,0.000024203142],"about_ca_topic_score_codex":0.0014114146,"about_ca_topic_score_gemma":0.0011567512,"teacher_disagreement_score":0.0014114146,"about_ca_system_score_codex":0.0003373147,"about_ca_system_score_gemma":0.00084425014,"threshold_uncertainty_score":0.005175233},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9652789,0.00019578023,0.033168953,0.000070600014,0.0000062337194,0.00001358011,0.000051468076,0.00007812102,0.0011363458],"genre_scores_gemma":[0.9826072,0.000090137786,0.016611788,0.000025824835,0.0000066990688,0.0000149938805,0.00008217273,0.00002374401,0.0005373767],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99993503,0.000011145716,0.0000034930354,0.00002352652,0.000013349882,0.000013540702],"domain_scores_gemma":[0.9997671,0.0000505295,0.000064638014,0.000040329993,0.00005424246,0.000023137733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015675125,0.00013491491,0.00014821025,0.00059177546,0.00010978975,0.00028432245,0.00015116196,0.00018351052,0.0004447802],"category_scores_gemma":[0.0008223852,0.0001410807,0.00017337826,0.00029069776,0.0006181087,0.0002780686,0.00026953593,0.00020846745,0.00009240826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002910032,0.00004886312,0.048827913,0.00009771464,0.00010229903,0.00039212574,0.00092914246,0.011351027,0.7755311,0.004670407,0.00057696993,0.15718135],"study_design_scores_gemma":[0.000032792657,0.00013251169,0.88052225,0.000021371909,0.00007465357,0.00053449447,0.00021888528,0.07646256,0.031140385,0.009181129,0.0016096649,0.0000692946],"about_ca_topic_score_codex":0.0011356918,"about_ca_topic_score_gemma":0.0013956372,"teacher_disagreement_score":0.0011356918,"about_ca_system_score_codex":0.00016183674,"about_ca_system_score_gemma":0.0001296448,"threshold_uncertainty_score":0.0022581816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044318675,0.00013042528,0.99470854,0.000039994244,0.000022904398,0.0000101603255,0.000014047388,0.0002763013,0.00036574158],"genre_scores_gemma":[0.5085722,0.00056624535,0.487473,0.00013878636,0.000103129394,0.000108259934,0.00011808541,0.00007121682,0.0028491607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953544,0.00015759876,0.000020535346,0.000070133996,0.00017998207,0.000036265454],"domain_scores_gemma":[0.99905163,0.0005301105,0.00010777378,0.000104516424,0.00018059576,0.00002538449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005812085,0.0004746972,0.00065079017,0.00027464077,0.0003987088,0.00048633537,0.00049136503,0.0005789387,0.0012132752],"category_scores_gemma":[0.0021519822,0.00032585496,0.0003256795,0.00030542025,0.00050672,0.00092744495,0.00056703214,0.0008060087,0.00047839302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039599338,0.00009720815,0.0007716406,0.0003114711,0.00009162689,0.00013297073,0.00019343526,0.6362325,0.04904676,0.017134942,0.0027789022,0.29281265],"study_design_scores_gemma":[0.000008234277,0.00003081078,0.00012195711,0.0000050171266,0.000007507253,0.00004520382,0.000005534008,0.992461,0.0052646804,0.0016012542,0.00043563123,0.0000131229845],"about_ca_topic_score_codex":0.00195883,"about_ca_topic_score_gemma":0.0024364754,"teacher_disagreement_score":0.00195883,"about_ca_system_score_codex":0.00033119525,"about_ca_system_score_gemma":0.00088824326,"threshold_uncertainty_score":0.004058838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019317472,0.00047447433,0.9770914,0.00013544444,0.000040969095,0.000021827147,0.000055112178,0.00060530816,0.0022580887],"genre_scores_gemma":[0.5768469,0.00075256935,0.41546136,0.00016977638,0.0000735823,0.000058032023,0.00011841501,0.00008862178,0.0064306757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995621,0.00012550366,0.000021965921,0.0000687205,0.00017318629,0.000048568123],"domain_scores_gemma":[0.9992706,0.00027465384,0.00011319125,0.00015966163,0.00016367424,0.000018191193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057373143,0.00037419744,0.00049849023,0.00043799027,0.00030610678,0.0007136634,0.00046623926,0.00047684464,0.0011975573],"category_scores_gemma":[0.00165481,0.0002594173,0.00027177448,0.00059643906,0.0008053354,0.0011429377,0.00072351284,0.00042437422,0.0007458115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007070345,0.00009234347,0.0010650886,0.0003263309,0.000088587025,0.00032204538,0.00028135168,0.37841055,0.13805494,0.045107197,0.004711813,0.43083265],"study_design_scores_gemma":[0.00004143397,0.00007545777,0.0003387554,0.000014625506,0.000016749205,0.0002024393,0.000021974043,0.94562626,0.042988546,0.007429521,0.0032115248,0.00003275272],"about_ca_topic_score_codex":0.0012212466,"about_ca_topic_score_gemma":0.0018179102,"teacher_disagreement_score":0.0012212466,"about_ca_system_score_codex":0.0005598894,"about_ca_system_score_gemma":0.0009043903,"threshold_uncertainty_score":0.0040623546},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22859034,0.0002596329,0.76382345,0.00022885727,0.00015817251,0.00037552157,0.00020510117,0.0040096203,0.0023492472],"genre_scores_gemma":[0.5529831,0.00014975917,0.44221538,0.0001330258,0.000055011576,0.00022582703,0.0005522723,0.00016467698,0.003520882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981312,0.00030600536,0.00012895212,0.00035231767,0.00093872607,0.00014276338],"domain_scores_gemma":[0.99628925,0.0013764979,0.00016461784,0.00035189476,0.0017099088,0.0001078271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020202834,0.0004553771,0.00053788687,0.0007708336,0.0004258799,0.0010032911,0.0013730739,0.0008818666,0.0022492625],"category_scores_gemma":[0.0071021696,0.00025267483,0.00018013464,0.0004505326,0.00039854558,0.0013174635,0.00041333542,0.0006041206,0.001188215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014614477,0.0006261028,0.007955037,0.00028577223,0.00009621786,0.00020452711,0.00017046511,0.0780906,0.22681928,0.0034423359,0.003045818,0.6778023],"study_design_scores_gemma":[0.000114432136,0.0010642878,0.004873392,0.000016957445,0.000055106633,0.00027637213,0.000057389985,0.80343646,0.18413752,0.00045423233,0.005473682,0.000040220784],"about_ca_topic_score_codex":0.0034277628,"about_ca_topic_score_gemma":0.0023503946,"teacher_disagreement_score":0.0034277628,"about_ca_system_score_codex":0.0010478632,"about_ca_system_score_gemma":0.0011952553,"threshold_uncertainty_score":0.010684431},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030396286,0.00022961503,0.9626157,0.00012838833,0.00006717109,0.00006120484,0.00007555829,0.0026349444,0.003791166],"genre_scores_gemma":[0.30847952,0.0002472971,0.68300503,0.00012327278,0.000054855132,0.000118679905,0.00021692317,0.000076866745,0.007677565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998969,0.000014925287,0.000006564549,0.000020177067,0.00004448484,0.000016953098],"domain_scores_gemma":[0.9998505,0.000045055654,0.00001435402,0.000018509063,0.00006291164,0.00000869574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019654493,0.00029474995,0.00021450536,0.00030554054,0.00029482582,0.0003517852,0.00085899106,0.0003870532,0.003790107],"category_scores_gemma":[0.00031769957,0.00018534553,0.000210007,0.00038830625,0.00023640547,0.0007586382,0.00025384713,0.00042792302,0.0009258448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046921032,0.00014835529,0.0007917524,0.00019570092,0.00008514771,0.00019980833,0.00010870874,0.054430127,0.37559512,0.017778166,0.004693542,0.5455044],"study_design_scores_gemma":[0.00009451691,0.0006254593,0.0012370585,0.000025732954,0.00009171925,0.00037694655,0.000035105484,0.7700869,0.20533888,0.0055559915,0.016483616,0.000048112546],"about_ca_topic_score_codex":0.0019934145,"about_ca_topic_score_gemma":0.004368689,"teacher_disagreement_score":0.003790107,"about_ca_system_score_codex":0.00048263505,"about_ca_system_score_gemma":0.0007168333,"threshold_uncertainty_score":0.01267916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11088808,0.00050345756,0.8786819,0.0004904072,0.00010325772,0.00015131032,0.000480874,0.00070762035,0.007993182],"genre_scores_gemma":[0.96152836,0.0005012494,0.024995422,0.00011103445,0.00006675661,0.00030153294,0.00037434394,0.00008691589,0.012034351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985695,0.00032059738,0.000062544015,0.00024103292,0.0004665176,0.00033982404],"domain_scores_gemma":[0.99508345,0.0031932618,0.0005204206,0.0003259667,0.0007267459,0.00015017201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018218568,0.00088046695,0.0014129793,0.00109095,0.0007938294,0.00161672,0.0015252031,0.0016623512,0.0038116868],"category_scores_gemma":[0.0061963894,0.0006984004,0.00080804975,0.0009682097,0.0013494729,0.0018462121,0.0009940071,0.0016839884,0.00092036184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083644045,0.000024843743,0.00057498936,0.00002743029,0.000018401059,0.00010406157,0.00009099162,0.95226735,0.0014436012,0.042381614,0.00029414135,0.0026889045],"study_design_scores_gemma":[0.00000887815,0.000014138455,0.000078164645,0.0000035753344,0.00000508685,0.000012413657,0.0000039070324,0.9952512,0.00027628808,0.004197142,0.00014193123,0.0000073494916],"about_ca_topic_score_codex":0.012665295,"about_ca_topic_score_gemma":0.009198043,"teacher_disagreement_score":0.012665295,"about_ca_system_score_codex":0.0019043094,"about_ca_system_score_gemma":0.0016617932,"threshold_uncertainty_score":0.025183141},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007261123,0.000060773993,0.9911698,0.00006996698,0.000027356411,0.0000294077,0.00003458217,0.00028389724,0.0010631046],"genre_scores_gemma":[0.20346102,0.000673489,0.78619367,0.00015249089,0.00010461423,0.00018757845,0.00024887628,0.0005283607,0.008449971],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996425,0.00014223969,0.000018435632,0.000067768575,0.00010015632,0.000028883169],"domain_scores_gemma":[0.9994443,0.00023847488,0.000051798383,0.00014645008,0.000101456266,0.00001740753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009235286,0.00089439313,0.00030945303,0.00038497205,0.00024211715,0.00063524966,0.0005522615,0.000545762,0.003416271],"category_scores_gemma":[0.003731513,0.00036452318,0.0006771726,0.0005461341,0.0006301383,0.0009992517,0.0010588418,0.0008658812,0.00091333396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005736469,0.00008764435,0.0009014854,0.00028604863,0.00011361812,0.00071859965,0.0004688578,0.1753832,0.17425524,0.1776652,0.005490837,0.4640556],"study_design_scores_gemma":[0.000045566805,0.000105004896,0.0010522183,0.000021358464,0.000056662695,0.0006748269,0.00004800245,0.871504,0.06398618,0.052353006,0.01010861,0.000044473065],"about_ca_topic_score_codex":0.0008503753,"about_ca_topic_score_gemma":0.0008441681,"teacher_disagreement_score":0.003416271,"about_ca_system_score_codex":0.00021018749,"about_ca_system_score_gemma":0.000499013,"threshold_uncertainty_score":0.011428535},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00473448,0.00017237835,0.99445033,0.000029956811,0.000016838834,0.000009683738,0.000014913829,0.00020674162,0.0003647771],"genre_scores_gemma":[0.34929252,0.0006508113,0.6480486,0.00007483873,0.00009333001,0.00010219677,0.00016738297,0.000055658882,0.0015146971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936706,0.00027653069,0.00003453897,0.00007281721,0.0001998788,0.000049200764],"domain_scores_gemma":[0.9989724,0.0005636501,0.000111290254,0.000132484,0.0001927594,0.000027305798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064327166,0.00057459914,0.0007197257,0.00051731634,0.00043647893,0.00047414916,0.0004533931,0.0005762692,0.000991511],"category_scores_gemma":[0.0027426798,0.00025006846,0.0004878892,0.00081690814,0.00053483737,0.0011832836,0.00060823647,0.0006274371,0.000449381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034881648,0.00011016093,0.0007391932,0.0001802257,0.00012170109,0.00008929548,0.00014623516,0.5540361,0.029277954,0.02306866,0.0024663515,0.38941538],"study_design_scores_gemma":[0.000009444537,0.00003694031,0.00013093279,0.0000033817525,0.00000838645,0.000043605014,0.000007387138,0.9921821,0.0041338922,0.0028309969,0.00059951894,0.000013396128],"about_ca_topic_score_codex":0.0018801052,"about_ca_topic_score_gemma":0.0027382597,"teacher_disagreement_score":0.0018801052,"about_ca_system_score_codex":0.00027768448,"about_ca_system_score_gemma":0.0008306567,"threshold_uncertainty_score":0.0037383437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058422834,0.0006749146,0.9905138,0.00008701304,0.00007280223,0.000032940992,0.00005012073,0.00056405296,0.0021621122],"genre_scores_gemma":[0.14862648,0.0013069,0.8444596,0.00016942562,0.00020337164,0.000106359854,0.00033246764,0.000077664256,0.004717769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994124,0.00010251382,0.000030039493,0.00013588337,0.00027607052,0.000043071173],"domain_scores_gemma":[0.9997044,0.00007002088,0.000019678322,0.000070302565,0.00012654052,0.00000900843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005698921,0.00058091164,0.0007189449,0.0011363854,0.00023484523,0.00061174016,0.00058263366,0.0006486449,0.0018347192],"category_scores_gemma":[0.0011511501,0.00018494831,0.0008722092,0.0008836893,0.00032122392,0.0008713329,0.00053468853,0.0007038584,0.0012673163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105893574,0.000077493045,0.00062544935,0.00015693906,0.00010974622,0.00012786561,0.00005563546,0.03609609,0.0854382,0.014386996,0.0033333222,0.85948634],"study_design_scores_gemma":[0.000015181099,0.00016938365,0.003425521,0.00003238168,0.000095981086,0.0007114166,0.00003322723,0.90492827,0.052541804,0.012140943,0.025842683,0.00006329206],"about_ca_topic_score_codex":0.0010719713,"about_ca_topic_score_gemma":0.0010731064,"teacher_disagreement_score":0.0018347192,"about_ca_system_score_codex":0.00024543804,"about_ca_system_score_gemma":0.00033185075,"threshold_uncertainty_score":0.0061377287},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007350381,0.0001771598,0.9985343,0.000047884885,0.000010519173,0.000008595527,0.000005664817,0.00012255642,0.00035821088],"genre_scores_gemma":[0.039366215,0.0009233521,0.95715904,0.000056481636,0.00007085384,0.00011284532,0.000056390945,0.000095530944,0.0021592104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930406,0.00026181698,0.00003121705,0.000078290825,0.00028609042,0.00003846048],"domain_scores_gemma":[0.99858356,0.0009833891,0.00009851816,0.00008137827,0.00022010472,0.0000330692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013378544,0.0009897085,0.0008079993,0.00095324335,0.0008123349,0.0008896853,0.00092962576,0.0014644482,0.0018297815],"category_scores_gemma":[0.00464539,0.0006394245,0.0007017901,0.0011221638,0.0010337313,0.0013138583,0.0015331622,0.0016228603,0.0010148117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013135493,0.00009884281,0.00036432268,0.00020815374,0.000092283924,0.00016595107,0.000197735,0.47922602,0.016271746,0.09270545,0.002568687,0.40796944],"study_design_scores_gemma":[0.00001787374,0.000026256213,0.00010200805,0.000016003545,0.000012552333,0.000112873,0.000011062826,0.9660473,0.0035537446,0.0262908,0.0037804118,0.000028971408],"about_ca_topic_score_codex":0.003640922,"about_ca_topic_score_gemma":0.003618182,"teacher_disagreement_score":0.003640922,"about_ca_system_score_codex":0.0006146863,"about_ca_system_score_gemma":0.0015189765,"threshold_uncertainty_score":0.007239461},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012929639,0.00011390453,0.9856527,0.00006640838,0.000026013508,0.0000140646935,0.000023661703,0.00026149527,0.00091211044],"genre_scores_gemma":[0.17027542,0.00029026243,0.8280279,0.00006372061,0.00006749548,0.000047433186,0.00015344702,0.0000614817,0.0010127528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996941,0.00009343185,0.000016036447,0.000051024952,0.00011801919,0.000027379885],"domain_scores_gemma":[0.99935263,0.00033857473,0.00007057724,0.00008564168,0.00013562164,0.00001699316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007220577,0.00087711465,0.00044728603,0.0007354852,0.00024052543,0.0006788966,0.00044870254,0.00039424642,0.00091599073],"category_scores_gemma":[0.002458994,0.00026766572,0.00045240423,0.0010665571,0.00053828745,0.0008812572,0.00066333025,0.0006687505,0.0004926877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022449091,0.00014621743,0.0021482087,0.00016572146,0.00028255046,0.00019180367,0.00018841145,0.30957127,0.1306713,0.020841548,0.00235473,0.5332138],"study_design_scores_gemma":[0.000020294514,0.000064939035,0.0010530031,0.000009301489,0.000039494902,0.00020895455,0.000020356832,0.95942676,0.02870609,0.0077974955,0.0026219285,0.00003140675],"about_ca_topic_score_codex":0.0010752856,"about_ca_topic_score_gemma":0.0018242273,"teacher_disagreement_score":0.0010752856,"about_ca_system_score_codex":0.00024846947,"about_ca_system_score_gemma":0.00051076524,"threshold_uncertainty_score":0.0038186312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04038422,0.00035780392,0.9570196,0.00009580887,0.000031563184,0.000011520075,0.000013425436,0.00042255892,0.0016634137],"genre_scores_gemma":[0.895156,0.00048590914,0.10023954,0.00008004528,0.000037967246,0.000030355175,0.000036450954,0.000049323025,0.003884349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997633,0.00006428588,0.000012327843,0.00003684558,0.000092157046,0.000031109874],"domain_scores_gemma":[0.9993781,0.0003916542,0.00006355153,0.000059090005,0.00009705406,0.0000104913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058277807,0.00031609618,0.00040405773,0.00020087963,0.00020561415,0.00043971525,0.00042663285,0.0005525245,0.00073184405],"category_scores_gemma":[0.0022720636,0.00017268943,0.0002495064,0.00024115435,0.00046007056,0.00080415333,0.00045462634,0.00051535264,0.00018825673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011818735,0.000028753097,0.00040898382,0.000058145037,0.000034957946,0.000121235295,0.00006982011,0.9004771,0.0147476895,0.017162036,0.0003689516,0.06640412],"study_design_scores_gemma":[0.0000027961005,0.000014467357,0.00006131063,0.0000020288396,0.0000047499175,0.00001785145,0.0000027319177,0.99530953,0.0023873658,0.0020006923,0.00019218473,0.0000044106787],"about_ca_topic_score_codex":0.0027122432,"about_ca_topic_score_gemma":0.0032523707,"teacher_disagreement_score":0.0027122432,"about_ca_system_score_codex":0.00034067122,"about_ca_system_score_gemma":0.00044945895,"threshold_uncertainty_score":0.005392909},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012365428,0.00044134044,0.99692315,0.00008745498,0.000061726045,0.00002186072,0.0000884571,0.00032060864,0.0008189672],"genre_scores_gemma":[0.19361188,0.0027187301,0.7932504,0.00027253383,0.00040148088,0.00039710864,0.0012651852,0.00024360234,0.007839073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993924,0.0001642855,0.000027323946,0.00016500904,0.00020232299,0.00004872544],"domain_scores_gemma":[0.999491,0.00025202983,0.000052145777,0.00007307809,0.000114055874,0.000017643339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008878984,0.00077281473,0.0008221866,0.0011446336,0.00033861125,0.0008702526,0.0013755484,0.000963301,0.0021988018],"category_scores_gemma":[0.0025033774,0.0003911263,0.0011024053,0.001395477,0.0006002271,0.0016271174,0.00063794776,0.0015491756,0.0013106383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021161263,0.00010958779,0.001937794,0.00040782866,0.00025676313,0.00040097898,0.00025791512,0.3780598,0.024714332,0.18862192,0.010811405,0.39420998],"study_design_scores_gemma":[0.0000058476626,0.000021406104,0.00033262768,0.000015049073,0.000025705825,0.000084053376,0.000011751869,0.9768141,0.0015114495,0.016860964,0.0042961664,0.000020763797],"about_ca_topic_score_codex":0.004079682,"about_ca_topic_score_gemma":0.0037982103,"teacher_disagreement_score":0.004079682,"about_ca_system_score_codex":0.0008745106,"about_ca_system_score_gemma":0.0009226526,"threshold_uncertainty_score":0.0081118345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07717913,0.0001260147,0.9191517,0.00012868186,0.000059853355,0.00003176757,0.000024060146,0.0008308155,0.0024678318],"genre_scores_gemma":[0.40125883,0.00015443427,0.5943551,0.000098381635,0.00007414651,0.000059243546,0.000075851734,0.00008315982,0.0038408441],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995352,0.00019848233,0.000015542575,0.00007244312,0.00013968626,0.000038808383],"domain_scores_gemma":[0.9995982,0.00017562373,0.000031949894,0.000061480285,0.00009629886,0.000036492205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005467534,0.00044746898,0.00044196477,0.00025253996,0.00031577723,0.00048129426,0.0006601926,0.00075157307,0.0019024478],"category_scores_gemma":[0.0013416691,0.00026673282,0.00030608545,0.00031252642,0.00032099526,0.0008864365,0.0010712944,0.0006750475,0.0011370936],"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.0011302077,0.00023334543,0.0005094209,0.0001220552,0.00003707063,0.00039776327,0.00031053307,0.077280425,0.66722375,0.008561889,0.0015917764,0.24260186],"study_design_scores_gemma":[0.00018072237,0.00072408246,0.0013778436,0.000022777756,0.000039797047,0.00068184664,0.000096253345,0.78431255,0.20169218,0.0035861556,0.00721298,0.00007279733],"about_ca_topic_score_codex":0.00038262134,"about_ca_topic_score_gemma":0.0007851106,"teacher_disagreement_score":0.0019024478,"about_ca_system_score_codex":0.00020692871,"about_ca_system_score_gemma":0.00046970576,"threshold_uncertainty_score":0.0063643456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11613439,0.0014062467,0.87216115,0.0011518868,0.000075017306,0.000060222595,0.0003925958,0.00055664696,0.008061868],"genre_scores_gemma":[0.86750036,0.0009031399,0.12762511,0.00018263469,0.00020775407,0.00025324294,0.00039784628,0.00019264493,0.002737235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750596,0.0007270133,0.0001956918,0.00050564297,0.0006159816,0.0004497376],"domain_scores_gemma":[0.9654668,0.029245198,0.0014674916,0.0016143563,0.0014216506,0.00078451436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035009605,0.0008848697,0.0013213343,0.001530788,0.00094592315,0.0027634678,0.0020607666,0.0011613512,0.0030779114],"category_scores_gemma":[0.03138746,0.00073914806,0.00077693164,0.0019073808,0.0039104526,0.0099071,0.0031292886,0.0023954704,0.00048682466],"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.00084155245,0.000089277164,0.0022014584,0.000355855,0.0001002974,0.00017699652,0.0004345989,0.5196429,0.009487806,0.37682998,0.0025037301,0.08733554],"study_design_scores_gemma":[0.000013930398,0.000033360895,0.00027972562,0.000029647665,0.000014110637,0.000052402786,0.000033837878,0.7874923,0.0028327622,0.20859969,0.0006010536,0.000017234224],"about_ca_topic_score_codex":0.0012554032,"about_ca_topic_score_gemma":0.00088669953,"teacher_disagreement_score":0.0035009605,"about_ca_system_score_codex":0.0016789105,"about_ca_system_score_gemma":0.0011439703,"threshold_uncertainty_score":0.01851505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024470403,0.004315538,0.9872207,0.0005692537,0.00014546077,0.00006687689,0.00015213294,0.00081789657,0.004265059],"genre_scores_gemma":[0.10208539,0.006002923,0.8842318,0.00027124558,0.0004577073,0.00070451555,0.00071749685,0.00029580013,0.005233137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977869,0.001004163,0.00013603807,0.00030859196,0.0007041249,0.0000601481],"domain_scores_gemma":[0.99646914,0.001887502,0.0002644736,0.0006419593,0.00068812835,0.000048882914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028410747,0.0012523571,0.0012090828,0.0017406521,0.00039709575,0.0020775758,0.0009976745,0.0013175105,0.0048115356],"category_scores_gemma":[0.011963763,0.00033430633,0.00093877537,0.0029126906,0.0010512742,0.0014699252,0.0013029329,0.0016042372,0.0027730586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012992525,0.0000836337,0.0012082417,0.00061155256,0.0002816352,0.00012929115,0.00013878007,0.069272764,0.005653203,0.13877062,0.013104195,0.7706161],"study_design_scores_gemma":[0.00004948408,0.00013280645,0.002670878,0.00024342045,0.00010825916,0.00017837959,0.00009500812,0.68788266,0.0058628954,0.25279236,0.04988981,0.000094034585],"about_ca_topic_score_codex":0.002440281,"about_ca_topic_score_gemma":0.0019451659,"teacher_disagreement_score":0.0048115356,"about_ca_system_score_codex":0.00079323805,"about_ca_system_score_gemma":0.0016527239,"threshold_uncertainty_score":0.016096175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034416222,0.00010064836,0.99275255,0.00006702734,0.000030031819,0.000042895903,0.00007787121,0.0028275948,0.0006597968],"genre_scores_gemma":[0.06374202,0.00018079394,0.93338174,0.000055321278,0.000043778433,0.00012897259,0.00046298478,0.00033817143,0.0016662342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831355,0.00042427002,0.00008531082,0.00045130154,0.0005907761,0.0001348108],"domain_scores_gemma":[0.9968755,0.0013758774,0.0002734771,0.00047956777,0.0009014882,0.00009413227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014857288,0.0014678926,0.0010642816,0.0041660783,0.00090456917,0.0021805253,0.0016064415,0.0014522639,0.0045385305],"category_scores_gemma":[0.0076219426,0.00047386248,0.0010344288,0.0028415788,0.0010790686,0.002788266,0.0018442736,0.0019564973,0.0039803376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026670282,0.00011958041,0.00077035703,0.00018204178,0.00009016802,0.00023011271,0.00038855843,0.022249695,0.049261913,0.017321024,0.0084501775,0.9006697],"study_design_scores_gemma":[0.00008075541,0.000117120064,0.0016190453,0.000049094364,0.00007138646,0.00037035104,0.00034816275,0.8509356,0.07074554,0.05804702,0.017509565,0.00010629169],"about_ca_topic_score_codex":0.0033841303,"about_ca_topic_score_gemma":0.0025975374,"teacher_disagreement_score":0.0045385305,"about_ca_system_score_codex":0.00064307003,"about_ca_system_score_gemma":0.001677661,"threshold_uncertainty_score":0.015182912},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13478115,0.00018227768,0.8636762,0.00009001792,0.000017368533,0.00003698089,0.000025489684,0.0002802594,0.0009101872],"genre_scores_gemma":[0.8379408,0.00016838394,0.16127315,0.000035832993,0.000015655158,0.000039838196,0.00005037288,0.000030274314,0.00044575494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892956,0.00024162694,0.00009061641,0.00016851413,0.00048420305,0.000085532716],"domain_scores_gemma":[0.9928256,0.005408044,0.00045421557,0.00027629975,0.00097033137,0.00006543022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028047161,0.000719218,0.0006446658,0.0012336723,0.0005922556,0.0012428724,0.0005075952,0.0008664436,0.0004933068],"category_scores_gemma":[0.015112087,0.00032829086,0.00068398914,0.00067374215,0.0007552476,0.001222765,0.00063262356,0.00093535456,0.00012735864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005246504,0.0000772721,0.003850953,0.00013263474,0.00011273377,0.00020845172,0.00027653895,0.7773741,0.026748385,0.0049523995,0.00018262862,0.18555926],"study_design_scores_gemma":[0.000009224237,0.000068670975,0.0019735375,0.000009986075,0.000019306613,0.00005873835,0.000021808475,0.9849807,0.010251828,0.0024465586,0.00013998729,0.000019545112],"about_ca_topic_score_codex":0.005961083,"about_ca_topic_score_gemma":0.0038170153,"teacher_disagreement_score":0.005961083,"about_ca_system_score_codex":0.0009777918,"about_ca_system_score_gemma":0.00097012625,"threshold_uncertainty_score":0.014832914},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77048224,0.0013209092,0.2256713,0.00012891548,0.00003889357,0.000048857637,0.000088640765,0.00017640043,0.0020439464],"genre_scores_gemma":[0.93790025,0.0007759568,0.06047469,0.000025267274,0.000042257292,0.000027941956,0.00007038179,0.000024838539,0.0006584571],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999397,0.000009922994,0.0000027095737,0.000010929209,0.000030782052,0.000005948997],"domain_scores_gemma":[0.99982685,0.000091926864,0.00002559013,0.00001365821,0.00003192872,0.000009984884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001652962,0.00017566918,0.000141456,0.00034353478,0.00007679504,0.00020404141,0.00018224197,0.00023712582,0.00048988743],"category_scores_gemma":[0.00058386166,0.00009247174,0.000117862204,0.00046285806,0.00020110019,0.00047240345,0.00013975742,0.00022191329,0.000070618524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028649945,0.00004063876,0.0025108238,0.00011182669,0.000028801645,0.0007304419,0.000119673015,0.007813636,0.90969807,0.0015501032,0.00018971633,0.07691973],"study_design_scores_gemma":[0.00005820861,0.0007547024,0.05348876,0.00003608982,0.0000764283,0.0021958181,0.00017562741,0.5201655,0.41622925,0.0028632095,0.0039033212,0.000053160365],"about_ca_topic_score_codex":0.00027742088,"about_ca_topic_score_gemma":0.0002647452,"teacher_disagreement_score":0.00048988743,"about_ca_system_score_codex":0.000059962043,"about_ca_system_score_gemma":0.00007212712,"threshold_uncertainty_score":0.0016388297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019048138,0.00020603971,0.9799258,0.000044594115,0.000027077664,0.000012578516,0.000023827823,0.00020855933,0.00050327403],"genre_scores_gemma":[0.56205356,0.00068630144,0.43433353,0.00007939926,0.00007231639,0.00007046778,0.00014072572,0.00004218113,0.0025215435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994307,0.0001912741,0.000029483383,0.000071407965,0.00022163968,0.00005551253],"domain_scores_gemma":[0.9990946,0.00044619478,0.00011298916,0.00012629748,0.00019396008,0.00002583753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053721725,0.00045407325,0.00050809764,0.00030150326,0.00040962387,0.00051110954,0.00034186852,0.00048685764,0.0005826434],"category_scores_gemma":[0.0025520797,0.00022267587,0.00028198352,0.0006557363,0.0004555729,0.00096429995,0.0005696833,0.00055552414,0.00031600156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041615116,0.000059129376,0.0013481522,0.00013823337,0.000060034698,0.00017346683,0.00025221208,0.56981325,0.046551324,0.018990124,0.001217097,0.36098078],"study_design_scores_gemma":[0.000012145984,0.00008413779,0.0002780823,0.0000071232116,0.000009151184,0.000106177504,0.00001721781,0.98578554,0.00963374,0.003060176,0.0009904967,0.000016060001],"about_ca_topic_score_codex":0.0016716907,"about_ca_topic_score_gemma":0.0021270642,"teacher_disagreement_score":0.0016716907,"about_ca_system_score_codex":0.00029050687,"about_ca_system_score_gemma":0.00062882627,"threshold_uncertainty_score":0.0033239126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008355559,0.00016910027,0.9906295,0.0000683062,0.000023106555,0.0000073001765,0.000014595237,0.00015986734,0.0005726181],"genre_scores_gemma":[0.49893126,0.00095346535,0.48964152,0.00014085977,0.000079196,0.00007690455,0.0001657818,0.00010008659,0.009911077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996927,0.000114707276,0.000017740009,0.000055850516,0.00009325145,0.000025879637],"domain_scores_gemma":[0.99957734,0.0002064286,0.00006861422,0.000058592777,0.000072629504,0.000016351483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000872762,0.00050114444,0.0005703056,0.0003152298,0.00024389492,0.00055695773,0.00053506374,0.0008755845,0.0010377434],"category_scores_gemma":[0.0014232452,0.000261279,0.00066274824,0.00032929334,0.0006088481,0.0010341578,0.00065661094,0.00076316134,0.00042782468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033576274,0.000083144056,0.000586585,0.00026532702,0.00014031517,0.000265872,0.0002793677,0.6189571,0.09031816,0.116110645,0.002293239,0.17036447],"study_design_scores_gemma":[0.0000050380204,0.000020406378,0.00008458216,0.000004310448,0.0000082439,0.00005132492,0.0000044727026,0.9876172,0.0051439763,0.0065241405,0.0005261459,0.000010207896],"about_ca_topic_score_codex":0.0009426789,"about_ca_topic_score_gemma":0.0012311261,"teacher_disagreement_score":0.0010377434,"about_ca_system_score_codex":0.00042508618,"about_ca_system_score_gemma":0.0005784263,"threshold_uncertainty_score":0.0046156645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010798936,0.00053874933,0.98626626,0.00016272195,0.000038696766,0.000028973998,0.000039783397,0.0012780728,0.0008478542],"genre_scores_gemma":[0.29784516,0.0007413193,0.6963916,0.00028318077,0.00017819223,0.000109950684,0.0005551185,0.00047249824,0.0034230386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684393,0.00081269484,0.00023507391,0.00060723774,0.0012666909,0.00023448729],"domain_scores_gemma":[0.9931195,0.0042241574,0.00042029686,0.00070093345,0.0014578932,0.0000773414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004136079,0.001530141,0.0013791485,0.0013737201,0.0004981293,0.0015398358,0.0014172562,0.001460354,0.0024969308],"category_scores_gemma":[0.019555684,0.0004624572,0.00049144094,0.0011183092,0.00073568575,0.0022528288,0.0014118871,0.0015437889,0.0029646885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037209585,0.00015941662,0.0013609811,0.00014285966,0.00009261297,0.000057895115,0.00006143433,0.10947371,0.028886214,0.005384602,0.0028100759,0.8511981],"study_design_scores_gemma":[0.000029999104,0.00008678856,0.0010213001,0.000013726367,0.000021211592,0.000082133716,0.000013285121,0.9685808,0.024054432,0.004486394,0.0015832045,0.000026759657],"about_ca_topic_score_codex":0.0018405548,"about_ca_topic_score_gemma":0.0013639078,"teacher_disagreement_score":0.004136079,"about_ca_system_score_codex":0.000620383,"about_ca_system_score_gemma":0.0009629086,"threshold_uncertainty_score":0.021873951},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057912624,0.00004550951,0.9991592,0.000016730633,0.000009133919,0.0000041689436,0.0000043460095,0.000059437618,0.0001223677],"genre_scores_gemma":[0.124777734,0.0003341164,0.87169635,0.00013321143,0.00008647641,0.00010847296,0.000108273074,0.00007728061,0.002678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99937963,0.0002412432,0.000038425587,0.000114635484,0.00020345094,0.000022479573],"domain_scores_gemma":[0.9989266,0.00062614406,0.00011975849,0.00012541084,0.00017923169,0.000022871485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013348552,0.0006529472,0.0007513171,0.00048101335,0.00028046113,0.00043449443,0.00074754487,0.0009198179,0.0012610134],"category_scores_gemma":[0.003387532,0.0003371061,0.000587625,0.000360844,0.00071386783,0.001076614,0.0007805006,0.0010481252,0.00062382605],"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.0002705201,0.000119488395,0.0008889558,0.0003670396,0.00028634854,0.00019771281,0.00018542518,0.43421936,0.054952398,0.078252755,0.0022490765,0.42801085],"study_design_scores_gemma":[0.000013365235,0.000059588085,0.00021580994,0.00001150008,0.000017034607,0.00016641579,0.000008530582,0.9791454,0.009904765,0.00725929,0.003170696,0.000027603575],"about_ca_topic_score_codex":0.00042121374,"about_ca_topic_score_gemma":0.00045248534,"teacher_disagreement_score":0.0013348552,"about_ca_system_score_codex":0.00026609856,"about_ca_system_score_gemma":0.00042135734,"threshold_uncertainty_score":0.0070595145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010179899,0.00017856773,0.98904955,0.000033210934,0.00001557566,0.000012372841,0.000015044218,0.00020218983,0.000313551],"genre_scores_gemma":[0.2771899,0.00039852393,0.7212564,0.000049054797,0.00004872925,0.00006304524,0.00009041112,0.000048266742,0.0008556807],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99941385,0.00022805575,0.000035586083,0.00007328202,0.00020986312,0.000039370374],"domain_scores_gemma":[0.99892634,0.0005444278,0.00013492044,0.00017444407,0.00018451308,0.000035368546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006444925,0.0004906728,0.0005858252,0.00043030785,0.00039482414,0.00039545656,0.00038828742,0.00052533014,0.00088888244],"category_scores_gemma":[0.0029094536,0.00020182303,0.0003517706,0.000614713,0.00051797775,0.0012481202,0.0005758058,0.00053386914,0.0003755218],"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.00065514003,0.00019388946,0.0012702558,0.0002357581,0.00013026698,0.00011893623,0.00020560167,0.26749912,0.12158809,0.02334465,0.0018987356,0.58285964],"study_design_scores_gemma":[0.000026749183,0.00016059585,0.00055407966,0.00000928966,0.000019630383,0.00020456109,0.000020207002,0.9488531,0.044390157,0.004039472,0.0016863059,0.000035989535],"about_ca_topic_score_codex":0.00092239986,"about_ca_topic_score_gemma":0.0016778368,"teacher_disagreement_score":0.00092239986,"about_ca_system_score_codex":0.00023907337,"about_ca_system_score_gemma":0.0007275271,"threshold_uncertainty_score":0.003408432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01757736,0.00013274788,0.98158675,0.000076074255,0.000019315336,0.000008481918,0.00001946926,0.00013910225,0.0004406932],"genre_scores_gemma":[0.78550035,0.00054863456,0.21078144,0.000081274426,0.000058195154,0.000073654235,0.00014947515,0.00006128308,0.0027457692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994568,0.00013046787,0.0000380131,0.00009888004,0.00022183283,0.000053963347],"domain_scores_gemma":[0.9980774,0.0010164143,0.00035764035,0.0002278844,0.00027896868,0.00004168663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009171894,0.00056083745,0.0006286471,0.00061465177,0.00034228872,0.0008263411,0.000507812,0.00088231545,0.000527107],"category_scores_gemma":[0.0042654043,0.00037249865,0.00051690306,0.00037382447,0.00084847765,0.001182402,0.0009860204,0.0014274842,0.0002491969],"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.00037474144,0.00008193896,0.0019295816,0.0002664809,0.00011710236,0.0003469076,0.00045793547,0.5422746,0.096559085,0.14108759,0.0015028372,0.21500118],"study_design_scores_gemma":[0.000007794025,0.00002718022,0.0003271338,0.00000928456,0.000007584561,0.00010036797,0.000013337229,0.9681843,0.008715324,0.021938344,0.0006483671,0.000020916854],"about_ca_topic_score_codex":0.00087375054,"about_ca_topic_score_gemma":0.00065000384,"teacher_disagreement_score":0.0009171894,"about_ca_system_score_codex":0.00045765936,"about_ca_system_score_gemma":0.0009140225,"threshold_uncertainty_score":0.004850626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019814125,0.0000813843,0.997698,0.000036137528,0.000025772444,0.0000058290148,0.0000038572693,0.000055798642,0.000111896385],"genre_scores_gemma":[0.209322,0.00070712314,0.7875958,0.000094340736,0.00010303078,0.00008471243,0.00006013482,0.000044349476,0.0019885043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994894,0.0001739364,0.000024407262,0.00008934295,0.00018181794,0.000041033116],"domain_scores_gemma":[0.9989147,0.0006932661,0.00009415308,0.00009941209,0.00016796993,0.00003037205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010770208,0.0007447294,0.0009215333,0.0005277485,0.0004895892,0.0007424781,0.0007304431,0.0012813788,0.0008077376],"category_scores_gemma":[0.003848634,0.000381057,0.0005294467,0.00066954695,0.0009175036,0.0013787504,0.0007077219,0.0011162949,0.00032772488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033580026,0.00008492725,0.0007068384,0.00027330845,0.00009841291,0.00019543171,0.00017431026,0.7091798,0.021214355,0.081422605,0.0019810486,0.18433318],"study_design_scores_gemma":[0.000018320505,0.000021619775,0.00009229458,0.0000046800656,0.000008697523,0.000027823951,0.000005646857,0.9888685,0.0028576683,0.007318502,0.0007664116,0.000009822096],"about_ca_topic_score_codex":0.0018606288,"about_ca_topic_score_gemma":0.0016949591,"teacher_disagreement_score":0.0018606288,"about_ca_system_score_codex":0.0005273296,"about_ca_system_score_gemma":0.0010759588,"threshold_uncertainty_score":0.005695939},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11278702,0.0006533996,0.88468397,0.00008359946,0.000028973644,0.00007066038,0.00014003718,0.00051883236,0.0010334695],"genre_scores_gemma":[0.3728499,0.000693481,0.62497044,0.000041474712,0.000048048096,0.00014326465,0.00037891042,0.0001356387,0.00073887716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994168,0.00023051396,0.000030860316,0.00006704335,0.00021192383,0.000042787484],"domain_scores_gemma":[0.99915624,0.0005562019,0.000045175806,0.00006196279,0.00015876927,0.000021670525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006238602,0.00082858943,0.00048947206,0.0004350875,0.00011980324,0.00043156443,0.00024859578,0.00041043165,0.0008507327],"category_scores_gemma":[0.0040836963,0.00020544934,0.00028632456,0.00037499343,0.00029395267,0.0004736782,0.00062935177,0.0003668675,0.00031063627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014377165,0.00011589371,0.0017912723,0.00036306476,0.00006773475,0.00016594738,0.0001310939,0.05219653,0.2811267,0.0026300172,0.0010330587,0.658941],"study_design_scores_gemma":[0.00011633281,0.0008472646,0.014299136,0.000057657777,0.00016672934,0.000821854,0.000089318535,0.6870599,0.28790817,0.0041578836,0.0044066343,0.00006920444],"about_ca_topic_score_codex":0.00092708727,"about_ca_topic_score_gemma":0.0013037918,"teacher_disagreement_score":0.00092708727,"about_ca_system_score_codex":0.00017668869,"about_ca_system_score_gemma":0.0004889167,"threshold_uncertainty_score":0.0032993555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018023074,0.00076153094,0.97843254,0.0002361151,0.000044658886,0.000016477932,0.000018515264,0.00017759005,0.0022895387],"genre_scores_gemma":[0.69532925,0.0016808313,0.30004206,0.00025645105,0.00031015754,0.00015056424,0.00018918642,0.00037823734,0.0016632313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967891,0.00155956,0.00014537145,0.00027979427,0.0011181977,0.00010803523],"domain_scores_gemma":[0.9685053,0.025863942,0.0015495091,0.0011835875,0.0026835746,0.0002140272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039544585,0.00065478834,0.00089733984,0.0007085756,0.0006477139,0.0013386244,0.00082101417,0.0013924105,0.0008811317],"category_scores_gemma":[0.05189943,0.00034136433,0.0006382825,0.0013386926,0.0012865713,0.002021701,0.0013173047,0.0013934226,0.00035670088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005326674,0.000085079875,0.0046353796,0.00038347245,0.00018375413,0.0009462917,0.0005427161,0.5853766,0.0155306915,0.22146747,0.0029568586,0.16735895],"study_design_scores_gemma":[0.000017585558,0.00012403354,0.00089582836,0.00004266354,0.000020112837,0.0003920521,0.00005091555,0.92512715,0.005275255,0.06470409,0.0033224754,0.000027785138],"about_ca_topic_score_codex":0.0008811308,"about_ca_topic_score_gemma":0.00034526424,"teacher_disagreement_score":0.0039544585,"about_ca_system_score_codex":0.00054194656,"about_ca_system_score_gemma":0.00048770342,"threshold_uncertainty_score":0.020913422},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22417237,0.0033081633,0.76521075,0.0003725249,0.00008583211,0.00006268954,0.00005711362,0.0001970075,0.0065336376],"genre_scores_gemma":[0.8952334,0.001147133,0.10111419,0.00007645412,0.000099629426,0.000040265983,0.000071131624,0.000029560224,0.0021881592],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994261,0.00013430673,0.00001758495,0.00007061704,0.0002991938,0.000052192594],"domain_scores_gemma":[0.9991529,0.00048556415,0.000121574434,0.00005395913,0.00015114534,0.000034845245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006838493,0.00052674586,0.0004889449,0.0005089384,0.00026731277,0.00069957646,0.00048817278,0.0008055818,0.00058138085],"category_scores_gemma":[0.00257952,0.00029553924,0.00019340559,0.00067187496,0.00058615947,0.00104867,0.000808022,0.00037551374,0.00021919551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025299725,0.00018552945,0.0090504065,0.0007695863,0.00015927442,0.0012248349,0.00061913556,0.20019202,0.3567684,0.13797154,0.0012686475,0.2892608],"study_design_scores_gemma":[0.000027846942,0.00024610336,0.0023690641,0.000031791835,0.00004497881,0.00085833983,0.00007058986,0.9223027,0.057252068,0.015520066,0.0012366001,0.000039810424],"about_ca_topic_score_codex":0.00036041357,"about_ca_topic_score_gemma":0.0007796279,"teacher_disagreement_score":0.0008055818,"about_ca_system_score_codex":0.00034778303,"about_ca_system_score_gemma":0.00025579636,"threshold_uncertainty_score":0.0036165714},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39205655,0.0012466552,0.5984849,0.00020722003,0.00007550441,0.000052238167,0.00016208338,0.0002781659,0.0074367085],"genre_scores_gemma":[0.9727286,0.00057768804,0.023049928,0.000086270236,0.00006795818,0.00003478765,0.00013499497,0.000067989815,0.0032518017],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949455,0.00006677054,0.000015508893,0.00007924194,0.0003025102,0.000041431107],"domain_scores_gemma":[0.9986708,0.0006961347,0.00020815531,0.00014744341,0.00024170514,0.000035832167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043781433,0.00042155018,0.00033635023,0.0006405694,0.00021649801,0.00049026374,0.0004358856,0.0005961404,0.0012677901],"category_scores_gemma":[0.0034110781,0.00012795388,0.00031289252,0.00038762056,0.00054963556,0.00067995046,0.0003496899,0.00048198772,0.00031956256],"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.00075011916,0.00012459896,0.0032285196,0.00032141438,0.00013614149,0.00060383655,0.000254595,0.3477093,0.5025845,0.06876925,0.00076543563,0.074752286],"study_design_scores_gemma":[0.000008533176,0.00010768389,0.0037410997,0.000016091919,0.000020145442,0.00036536742,0.000022518556,0.94688576,0.039886203,0.007523647,0.0014014153,0.000021506195],"about_ca_topic_score_codex":0.0007112697,"about_ca_topic_score_gemma":0.00037878088,"teacher_disagreement_score":0.0012677901,"about_ca_system_score_codex":0.0004420733,"about_ca_system_score_gemma":0.00019986095,"threshold_uncertainty_score":0.0042411685},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06790558,0.00048412426,0.92472124,0.00030191342,0.000050060436,0.000031232456,0.00015358996,0.00047356664,0.0058787144],"genre_scores_gemma":[0.83639497,0.00040371515,0.16071111,0.000121409896,0.000048554906,0.00013204421,0.00016564391,0.00012411896,0.0018985103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992824,0.00015856067,0.00006597386,0.00014188827,0.0002124141,0.0001387055],"domain_scores_gemma":[0.994991,0.0038593656,0.0002474465,0.00035327164,0.00040487657,0.00014407255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012882267,0.00045029842,0.00076666416,0.00061595335,0.00046502045,0.0014441335,0.0014367308,0.0007623774,0.0034906003],"category_scores_gemma":[0.008352279,0.00027332164,0.0005893981,0.00079385017,0.0021833926,0.0039051662,0.001623331,0.0013735016,0.0005317899],"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.0004541588,0.000058630012,0.00078158296,0.00042659676,0.00006306865,0.00019874958,0.0003470227,0.41643164,0.02614105,0.42529672,0.0016331024,0.1281677],"study_design_scores_gemma":[0.0000076674905,0.00001828621,0.00016409317,0.000022770299,0.0000072115254,0.00005313206,0.000020444946,0.8594406,0.006863548,0.13285998,0.0005237898,0.0000184161],"about_ca_topic_score_codex":0.0010612523,"about_ca_topic_score_gemma":0.00069833384,"teacher_disagreement_score":0.0034906003,"about_ca_system_score_codex":0.0012061818,"about_ca_system_score_gemma":0.00084065745,"threshold_uncertainty_score":0.011677206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009365353,0.0016838314,0.99540967,0.00017043202,0.000057433568,0.000019434277,0.000011932712,0.000056195007,0.0016544868],"genre_scores_gemma":[0.061668932,0.004976357,0.9297605,0.00016537066,0.00040903135,0.00014217866,0.000066062494,0.000036455764,0.0027751417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894255,0.00034902245,0.00006930071,0.00017155803,0.0004272833,0.000040253286],"domain_scores_gemma":[0.99934214,0.00036335355,0.00007907512,0.000053407934,0.00014812112,0.000013872629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016712849,0.0007425538,0.00087296707,0.0015768133,0.00050152483,0.0012496505,0.00075982476,0.0015335724,0.0011271568],"category_scores_gemma":[0.003705823,0.00033063215,0.00066980516,0.0015875159,0.0016249524,0.0017275113,0.0009977263,0.001433683,0.0007834238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010000335,0.000032213742,0.00030872357,0.00037602143,0.00009588601,0.00016158844,0.00019398547,0.0981457,0.0118953865,0.54911685,0.0033980298,0.33617556],"study_design_scores_gemma":[0.000038451406,0.000068661735,0.00038847825,0.00012392868,0.00004339814,0.00024602647,0.000055575816,0.6210619,0.007522675,0.34901717,0.021365993,0.0000677911],"about_ca_topic_score_codex":0.0013316656,"about_ca_topic_score_gemma":0.0010934591,"teacher_disagreement_score":0.0016712849,"about_ca_system_score_codex":0.00063469505,"about_ca_system_score_gemma":0.0007690375,"threshold_uncertainty_score":0.008838713},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013732415,0.0032689048,0.99260193,0.00017105992,0.0000723111,0.000024644341,0.00007797272,0.00027113754,0.0021388072],"genre_scores_gemma":[0.19496185,0.010510386,0.78598166,0.00057087844,0.0005952563,0.0004971051,0.000783862,0.0005244208,0.0055745947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99051756,0.0026628058,0.00050677615,0.001604642,0.0040665176,0.00064172555],"domain_scores_gemma":[0.9698224,0.01915762,0.0015483038,0.003052767,0.006087141,0.000331735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068773325,0.0028264727,0.0021706943,0.0033778048,0.0010688748,0.0026708574,0.0022680266,0.002797622,0.0038037784],"category_scores_gemma":[0.046359334,0.0008629691,0.0011201111,0.0033180583,0.0026728956,0.0032853524,0.0023553877,0.004299588,0.003656911],"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.00045282565,0.00008498237,0.0012998435,0.00101336,0.00029519835,0.0002604121,0.00033055458,0.4764108,0.0129543,0.21459384,0.011611877,0.280692],"study_design_scores_gemma":[0.000037297857,0.0001092192,0.0008485898,0.00017068919,0.00007606057,0.00038221318,0.00006755561,0.9074457,0.0149089545,0.057445172,0.018370468,0.00013809022],"about_ca_topic_score_codex":0.006079337,"about_ca_topic_score_gemma":0.004765793,"teacher_disagreement_score":0.0068773325,"about_ca_system_score_codex":0.0020839681,"about_ca_system_score_gemma":0.0031397794,"threshold_uncertainty_score":0.03637123},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020819971,0.00028672162,0.9770082,0.00011614279,0.000073883944,0.000037893715,0.000042340915,0.00025953137,0.0013552847],"genre_scores_gemma":[0.5654825,0.00042564177,0.42940375,0.00013857998,0.00013340676,0.00009750126,0.00012810287,0.00003580596,0.004154721],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994491,0.00016602235,0.000030952033,0.00006325425,0.00024266663,0.000047999834],"domain_scores_gemma":[0.99941385,0.00018699552,0.00006656971,0.0001613391,0.00014129883,0.000029917259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006707374,0.0005241797,0.0005037844,0.00041852889,0.000343718,0.0004591575,0.00048062217,0.0005477293,0.00088357023],"category_scores_gemma":[0.0016867884,0.00019795964,0.00036723263,0.0005348998,0.0004222822,0.00092451146,0.0009918521,0.0007009105,0.00042274213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009487452,0.00020244558,0.0015084877,0.00031540068,0.00010765952,0.00034086782,0.0004720858,0.17773929,0.28556415,0.10195583,0.0028119585,0.42803308],"study_design_scores_gemma":[0.000035531193,0.00027337487,0.0006492157,0.00001781119,0.000026605674,0.00034161855,0.000020988773,0.9415555,0.041697405,0.010695438,0.0046420973,0.000044376022],"about_ca_topic_score_codex":0.00046991106,"about_ca_topic_score_gemma":0.0007841673,"teacher_disagreement_score":0.00088357023,"about_ca_system_score_codex":0.00023487814,"about_ca_system_score_gemma":0.0005699291,"threshold_uncertainty_score":0.0035471916},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022619392,0.0002965187,0.99606955,0.00007415075,0.000038026308,0.0000128586325,0.00001411994,0.0001045725,0.0011282273],"genre_scores_gemma":[0.32513717,0.0027604664,0.6668831,0.00022275036,0.00038409565,0.0002907964,0.0002619536,0.0002144426,0.0038451713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983773,0.00061642326,0.00009531815,0.00023016575,0.0005773237,0.000103388666],"domain_scores_gemma":[0.9978351,0.0013110614,0.00012259271,0.00025620544,0.0004274644,0.000047535785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024418635,0.0011386735,0.0008905648,0.0013578933,0.00053287396,0.0014539792,0.0009267074,0.00093545666,0.0016674362],"category_scores_gemma":[0.00769019,0.0003174867,0.00071152794,0.0014944304,0.0017068629,0.002462412,0.0014471752,0.00166054,0.0006320035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027968385,0.00007209043,0.0006272725,0.00035068978,0.00013987173,0.00016373552,0.00023052278,0.26596662,0.017095681,0.48687184,0.003376493,0.2248255],"study_design_scores_gemma":[0.000016443873,0.000059856662,0.00021778164,0.000024020894,0.000025831581,0.00010804543,0.00001830183,0.8999101,0.0077682505,0.088124536,0.0036978293,0.000029127661],"about_ca_topic_score_codex":0.0009260168,"about_ca_topic_score_gemma":0.0003324949,"teacher_disagreement_score":0.0024418635,"about_ca_system_score_codex":0.00074413634,"about_ca_system_score_gemma":0.0011245479,"threshold_uncertainty_score":0.012914002},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007701848,0.0005022964,0.98946536,0.00014870468,0.000077182594,0.000021716023,0.000049696384,0.0008560184,0.001177342],"genre_scores_gemma":[0.32686996,0.0006087112,0.6650402,0.0005132167,0.00018295154,0.000075459306,0.00025523902,0.00006425278,0.0063900193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875605,0.00035385828,0.0000866397,0.00020505357,0.00051185215,0.00008646933],"domain_scores_gemma":[0.99863476,0.0005035448,0.0001363006,0.00030226292,0.0003859496,0.00003718647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010422837,0.00052059395,0.0012302898,0.00071716943,0.0003385938,0.00084305793,0.0006890357,0.0013359535,0.0022952154],"category_scores_gemma":[0.0029168925,0.00032167014,0.00049653806,0.00054262724,0.00055006007,0.001305669,0.0011420747,0.0008125896,0.0009764043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082279247,0.00012341616,0.0020047117,0.00040692877,0.00016228504,0.00028733345,0.00021236422,0.140869,0.1469927,0.03730038,0.005821434,0.6649967],"study_design_scores_gemma":[0.00008664983,0.00022324227,0.00074498163,0.000043950167,0.00006099374,0.0011518502,0.000025440891,0.9003098,0.07426371,0.009437274,0.013565436,0.00008670671],"about_ca_topic_score_codex":0.00056639855,"about_ca_topic_score_gemma":0.00069211185,"teacher_disagreement_score":0.0022952154,"about_ca_system_score_codex":0.0003513016,"about_ca_system_score_gemma":0.00080463476,"threshold_uncertainty_score":0.0076782703},"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":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007216119,0.9787892,0.015785838,0.0017214912,0.00047934693,0.00006181528,0.00006246359,0.000091748916,0.0022864938],"genre_scores_gemma":[0.017997595,0.93759584,0.036860358,0.0027966953,0.0022912046,0.00047880464,0.0001530404,0.00006697065,0.0017595141],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951374,0.0022969446,0.00047916555,0.00063751824,0.0013754239,0.0000736867],"domain_scores_gemma":[0.9489907,0.046881396,0.0012797635,0.00070384744,0.0019224996,0.00022189911],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.014251483,0.0016310805,0.0038163646,0.0047268234,0.00022914723,0.0012821216,0.002795368,0.0036162054,0.0041724015],"category_scores_gemma":[0.033239223,0.0008441496,0.0014934536,0.0029752206,0.00230765,0.0026975833,0.0009699063,0.0024676577,0.0017765666],"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.00028394934,0.00006109152,0.00061585207,0.013630057,0.0005684961,0.00026210927,0.000064883774,0.0006595412,0.002313883,0.0077183084,0.0072645224,0.9665573],"study_design_scores_gemma":[0.001038683,0.0019109771,0.035154197,0.02221862,0.005041409,0.016582368,0.00029446487,0.0057171388,0.022412345,0.13373645,0.7555028,0.00039047722],"about_ca_topic_score_codex":0.0005250153,"about_ca_topic_score_gemma":0.0007827858,"teacher_disagreement_score":0.9857485,"about_ca_system_score_codex":0.00094195467,"about_ca_system_score_gemma":0.0011111711,"threshold_uncertainty_score":0.075369954},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081227126,0.000057924426,0.9985279,0.000020518873,0.000016874339,0.000010943566,0.00001304336,0.00023570558,0.0003047907],"genre_scores_gemma":[0.02147729,0.00016745388,0.97589713,0.000037917605,0.000047917583,0.00008548434,0.0001140232,0.000092511655,0.002080282],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992095,0.00015485978,0.00004097127,0.00018582678,0.00036393182,0.00004492953],"domain_scores_gemma":[0.99903333,0.00031286594,0.00011553994,0.00018050362,0.00032323145,0.000034612956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094331225,0.0009908982,0.0008628112,0.0012177258,0.00063209864,0.0009468122,0.0013188727,0.0009746867,0.0037180963],"category_scores_gemma":[0.0023752316,0.000534503,0.00087474263,0.0014299367,0.0006107518,0.0017214419,0.0010907047,0.0011645423,0.002371472],"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.00023597163,0.00009771136,0.0006196225,0.00018874761,0.000096613425,0.00014887484,0.00012240869,0.09184891,0.050687008,0.0215477,0.0035535586,0.83085287],"study_design_scores_gemma":[0.000030401361,0.00005903302,0.00041436046,0.000017829683,0.000025931524,0.00036036276,0.000021301012,0.9599193,0.019134603,0.009663925,0.010312862,0.000040045386],"about_ca_topic_score_codex":0.0018954093,"about_ca_topic_score_gemma":0.001999376,"teacher_disagreement_score":0.0037180963,"about_ca_system_score_codex":0.00042722072,"about_ca_system_score_gemma":0.0010816184,"threshold_uncertainty_score":0.012438297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02534676,0.0022504032,0.9702978,0.0003222561,0.00008615401,0.000036226196,0.000078008736,0.00044297118,0.0011393579],"genre_scores_gemma":[0.38185012,0.004507056,0.61079216,0.000075486576,0.00028948416,0.000098081095,0.00033384707,0.00012519307,0.0019285292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996088,0.00012076512,0.00003305788,0.000062219064,0.00015073702,0.000024457782],"domain_scores_gemma":[0.9989951,0.00048140812,0.00011831474,0.00013334009,0.00024115658,0.00003073266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007766178,0.00058570487,0.00040632376,0.0013244617,0.00027010497,0.00057909044,0.0002733469,0.00043378054,0.0011516573],"category_scores_gemma":[0.0025097725,0.0001514157,0.0005797139,0.002238265,0.00045905728,0.00063935533,0.0003245568,0.00066891557,0.00041309965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011937204,0.0001000339,0.0024952253,0.0002591143,0.00009909247,0.00022869137,0.0001447978,0.06666777,0.04417693,0.010018256,0.0027116209,0.8729791],"study_design_scores_gemma":[0.000011966344,0.0001077049,0.009859604,0.000028483462,0.00004613923,0.0004033651,0.00006523388,0.95506585,0.01705561,0.011331723,0.0059667444,0.000057500823],"about_ca_topic_score_codex":0.0011002425,"about_ca_topic_score_gemma":0.0010353028,"teacher_disagreement_score":0.0013244617,"about_ca_system_score_codex":0.00015386316,"about_ca_system_score_gemma":0.00025015528,"threshold_uncertainty_score":0.0041071773},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008876802,0.00034315497,0.9847852,0.00007214212,0.00013637471,0.00009079803,0.000040917606,0.002583139,0.0030714471],"genre_scores_gemma":[0.36778265,0.00032976503,0.6238789,0.00026367835,0.00007540515,0.0004500254,0.00021997424,0.000617181,0.006382362],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943584,0.00009955506,0.000043825225,0.0001683505,0.00020232484,0.00005003022],"domain_scores_gemma":[0.9982967,0.00070283824,0.000089278554,0.00044367908,0.00040058894,0.00006693852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085101236,0.00092148583,0.00091093965,0.00056631217,0.00043349635,0.0007895078,0.0022939753,0.0011493881,0.003877615],"category_scores_gemma":[0.0053876,0.00042596617,0.00052826357,0.00047760157,0.0005295582,0.0010948172,0.0013292485,0.0016980909,0.0016874286],"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.0003086335,0.00029080248,0.0014895492,0.00033956778,0.00010781376,0.00018226943,0.0001588853,0.2812845,0.039029352,0.015345395,0.009302587,0.6521605],"study_design_scores_gemma":[0.000044014614,0.000059924354,0.00043285044,0.000017737339,0.000017969902,0.00012547473,0.000014458486,0.97606486,0.0142489085,0.0034103973,0.0055340375,0.000029361046],"about_ca_topic_score_codex":0.0015550606,"about_ca_topic_score_gemma":0.0022631513,"teacher_disagreement_score":0.003877615,"about_ca_system_score_codex":0.00042613514,"about_ca_system_score_gemma":0.0008690899,"threshold_uncertainty_score":0.012971878},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026108438,0.003964281,0.96203613,0.0002574458,0.0004910355,0.00018394068,0.0006562765,0.0015338693,0.0047685704],"genre_scores_gemma":[0.41395625,0.005488621,0.5625397,0.0005711164,0.0011773111,0.00045544855,0.0051772725,0.00045290042,0.010181309],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989305,0.00010034542,0.00006831611,0.00018589964,0.0006266232,0.00008827569],"domain_scores_gemma":[0.9982383,0.00037172736,0.00021851153,0.00030527564,0.00079389877,0.00007238972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009427844,0.0007446308,0.0011048043,0.003118478,0.00034110932,0.0012572592,0.0011488342,0.0009061974,0.0024122233],"category_scores_gemma":[0.0034031286,0.00028331665,0.0010467123,0.0032824574,0.0009146193,0.0022280472,0.00064205704,0.0009876235,0.0023104555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003577852,0.00015057193,0.0030992636,0.0003506633,0.00014877062,0.00018020328,0.00006333208,0.016807055,0.056272205,0.0154247,0.008805399,0.89834005],"study_design_scores_gemma":[0.00016567293,0.0011735759,0.02895417,0.0001733185,0.00043982264,0.00478527,0.00033103427,0.70264906,0.16798085,0.022658193,0.07008455,0.00060448085],"about_ca_topic_score_codex":0.0024512352,"about_ca_topic_score_gemma":0.0018599099,"teacher_disagreement_score":0.003118478,"about_ca_system_score_codex":0.0006457745,"about_ca_system_score_gemma":0.0007599334,"threshold_uncertainty_score":0.008069694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008270033,0.0014691831,0.98839885,0.00010635812,0.00013870231,0.000046430046,0.000070671485,0.0003352925,0.001164556],"genre_scores_gemma":[0.09675653,0.0028145385,0.8967626,0.00008033913,0.00017482284,0.00017768651,0.0004494029,0.00016787314,0.002616194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995443,0.0000993534,0.000036285634,0.00009423507,0.0002008202,0.000024968998],"domain_scores_gemma":[0.9997017,0.00011961449,0.000040526367,0.000041474566,0.00008512991,0.000011618364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006861642,0.00068700704,0.00041290143,0.0006297118,0.00016636953,0.0005442714,0.00039858295,0.00061289885,0.0016890656],"category_scores_gemma":[0.001852369,0.00020656166,0.0009293389,0.0018154217,0.00042477285,0.00052705524,0.00040850157,0.0010277163,0.0010895146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026724752,0.00008594571,0.00060337724,0.00040449496,0.00008070973,0.00040651712,0.00012990428,0.03169146,0.17470813,0.022907263,0.0031978267,0.76551723],"study_design_scores_gemma":[0.000049569815,0.0004008179,0.005299505,0.0001030637,0.00012658277,0.0009999517,0.000052216095,0.843093,0.08987505,0.010574148,0.049333192,0.00009296876],"about_ca_topic_score_codex":0.00087372604,"about_ca_topic_score_gemma":0.0007125543,"teacher_disagreement_score":0.0016890656,"about_ca_system_score_codex":0.00027742353,"about_ca_system_score_gemma":0.0003601316,"threshold_uncertainty_score":0.0056505203},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050091073,0.00070927263,0.9470323,0.000106923784,0.00003663348,0.000026896674,0.000010584031,0.00065862184,0.0013277236],"genre_scores_gemma":[0.6485989,0.0008992952,0.3458148,0.00010582305,0.0000628436,0.000093293354,0.00006604269,0.000085491025,0.004273477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980134,0.00006494504,0.000008719318,0.000028656204,0.00007964879,0.000016711316],"domain_scores_gemma":[0.9996111,0.0002527452,0.00003153597,0.000021621936,0.00007491796,0.000008074982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047872856,0.00044536847,0.0002642963,0.00028591265,0.00017652249,0.0003613132,0.00031636452,0.000421907,0.00083550374],"category_scores_gemma":[0.0014480078,0.00016424338,0.00025098617,0.00036054928,0.0003738915,0.00065681525,0.00033203495,0.00045348104,0.00022155218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040012648,0.0000859137,0.00068870815,0.00016732975,0.000093938535,0.00015859802,0.0001012053,0.41242898,0.13644093,0.0061934986,0.00063499523,0.44260582],"study_design_scores_gemma":[0.00001636827,0.00007060072,0.00037734493,0.0000065306544,0.00001459295,0.000051048195,0.000006215142,0.9781025,0.018301154,0.0022370555,0.0008072927,0.000009366014],"about_ca_topic_score_codex":0.001759781,"about_ca_topic_score_gemma":0.0019093388,"teacher_disagreement_score":0.001759781,"about_ca_system_score_codex":0.0003635166,"about_ca_system_score_gemma":0.00023399545,"threshold_uncertainty_score":0.003499031},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012925793,0.00032064584,0.9848546,0.00017894467,0.000030745312,0.000016214715,0.000011796233,0.00043712175,0.0012242337],"genre_scores_gemma":[0.35988435,0.0005414319,0.63339394,0.00016587632,0.00010723383,0.00005615755,0.000059445745,0.000074552925,0.0057169404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997563,0.00008945019,0.000009741591,0.000037208607,0.00009010449,0.000017133],"domain_scores_gemma":[0.9996686,0.00016555155,0.000028027664,0.000028664204,0.000095242496,0.000013948013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005766384,0.00034563753,0.0005068842,0.00019096732,0.00020785574,0.00035453268,0.00043099176,0.001060166,0.0008224377],"category_scores_gemma":[0.001241523,0.00020621592,0.00021065075,0.00032754056,0.00034361435,0.00057149376,0.0004481934,0.0006060792,0.00038892514],"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.00028986923,0.00009377161,0.002151098,0.00020446445,0.00011737369,0.0004342229,0.00020920223,0.49926805,0.077160195,0.020647509,0.0023530887,0.39707118],"study_design_scores_gemma":[0.000014543812,0.000063329506,0.0002106975,0.000006564656,0.000010540542,0.00013938636,0.0000060229986,0.9878906,0.008863833,0.0014216223,0.001360654,0.000012156469],"about_ca_topic_score_codex":0.0012753827,"about_ca_topic_score_gemma":0.0016594614,"teacher_disagreement_score":0.0012753827,"about_ca_system_score_codex":0.00023545978,"about_ca_system_score_gemma":0.000325371,"threshold_uncertainty_score":0.003049612},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069688475,0.000312568,0.9921336,0.000051853527,0.000019738183,0.000016162803,0.000014189356,0.00025157715,0.0002313715],"genre_scores_gemma":[0.30067173,0.00046677183,0.6971911,0.00014390594,0.00008991194,0.0000976862,0.0000801856,0.00005512479,0.001203496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788123,0.0008610155,0.00009172523,0.00022522794,0.0008177503,0.00012307364],"domain_scores_gemma":[0.99731964,0.0015132374,0.00038567188,0.00030352268,0.00041315987,0.00006479082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028500534,0.0008478424,0.0012146427,0.0008312613,0.00036480196,0.0009888752,0.0013717873,0.0014210078,0.000954804],"category_scores_gemma":[0.007153943,0.00042443484,0.00070500467,0.00067763746,0.0010434834,0.0019932892,0.0010478337,0.0010350829,0.0007478024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013762544,0.00023766031,0.0022653313,0.000408848,0.00037080707,0.00027315837,0.00021027835,0.5171294,0.057738632,0.080669135,0.0019897015,0.33733076],"study_design_scores_gemma":[0.00005311079,0.00013789495,0.00019464693,0.0000094990755,0.000037670783,0.00015903641,0.000006223559,0.9785896,0.01259616,0.007403298,0.000774098,0.00003882879],"about_ca_topic_score_codex":0.0006728548,"about_ca_topic_score_gemma":0.0006709907,"teacher_disagreement_score":0.0028500534,"about_ca_system_score_codex":0.0005673414,"about_ca_system_score_gemma":0.0008118199,"threshold_uncertainty_score":0.015072703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060668737,0.00014867923,0.9379892,0.000097504635,0.00003137914,0.000024168385,0.000021778167,0.0002673647,0.00075119844],"genre_scores_gemma":[0.79708683,0.0001862158,0.20048015,0.000058583446,0.000038760085,0.000044358632,0.00006875997,0.000028224014,0.0020081906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999173,0.00032022264,0.000042370466,0.0001256392,0.0002953038,0.000043414897],"domain_scores_gemma":[0.99812096,0.0009350612,0.00034794654,0.00036790897,0.00017854587,0.000049485825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083564786,0.0003461155,0.00047141808,0.00030481085,0.00022603876,0.00051260664,0.0004487455,0.0006835271,0.00095989],"category_scores_gemma":[0.003672246,0.00014584186,0.00021432627,0.00026748257,0.0007320148,0.0015016226,0.001074816,0.0006622274,0.0002832737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016082004,0.00020742952,0.0023224615,0.000340475,0.00013380937,0.00035923006,0.0004786741,0.31194577,0.26280996,0.091059305,0.0010476392,0.32768705],"study_design_scores_gemma":[0.000048681206,0.00027648913,0.00056038646,0.000017061193,0.000012373787,0.00025305926,0.000036143767,0.91474056,0.057233457,0.02544138,0.0013435559,0.00003678195],"about_ca_topic_score_codex":0.00017714973,"about_ca_topic_score_gemma":0.00017571759,"teacher_disagreement_score":0.00095989,"about_ca_system_score_codex":0.00022133386,"about_ca_system_score_gemma":0.00039840426,"threshold_uncertainty_score":0.004419327},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054789386,0.0002020402,0.9933883,0.000058836096,0.00005402951,0.000020078773,0.00001704437,0.0002833864,0.0004972986],"genre_scores_gemma":[0.28531417,0.0003049431,0.70940906,0.00017070402,0.000090827765,0.0001216052,0.000091222915,0.000045874225,0.004451603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944645,0.00013870605,0.000028192342,0.000118399796,0.00021044175,0.000057776473],"domain_scores_gemma":[0.9995054,0.00024403473,0.00005029846,0.00006713125,0.00011412443,0.00001898214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006418906,0.0005863503,0.00068968383,0.00047566884,0.00036394486,0.0005442099,0.0008270745,0.0007934557,0.0014796582],"category_scores_gemma":[0.0018934881,0.00028991088,0.0004411276,0.00048757982,0.0004823922,0.0008855214,0.00052289525,0.0011169869,0.00059416244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061794,0.0001311107,0.0014516888,0.00017924332,0.00015826437,0.00013680021,0.00014391773,0.26607156,0.072076246,0.046951834,0.002717374,0.60936403],"study_design_scores_gemma":[0.000040670788,0.00007899878,0.00035468602,0.000010012965,0.0000212959,0.00012083235,0.0000068248432,0.9727634,0.017634865,0.0056376425,0.0033035441,0.000027219694],"about_ca_topic_score_codex":0.0020505826,"about_ca_topic_score_gemma":0.0028226625,"teacher_disagreement_score":0.0020505826,"about_ca_system_score_codex":0.00050461653,"about_ca_system_score_gemma":0.0009124346,"threshold_uncertainty_score":0.0049499273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16385269,0.0005989391,0.83066374,0.00025846175,0.000022945145,0.000035630546,0.00005593633,0.00035372472,0.0041579353],"genre_scores_gemma":[0.93747437,0.00021307197,0.060899768,0.00005183681,0.000022647446,0.000030080804,0.000043601503,0.00002693455,0.0012376294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755186,0.00092717854,0.00008843129,0.0002428462,0.0008963092,0.00029343113],"domain_scores_gemma":[0.9957961,0.0028322483,0.0003204322,0.00027409825,0.0006864959,0.00009066963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025628605,0.0008826451,0.0011059922,0.00043724853,0.00037032887,0.0008060157,0.000572611,0.0011809269,0.0008387659],"category_scores_gemma":[0.008033424,0.0005474023,0.00047070975,0.00061342923,0.0012164244,0.001009457,0.0011525145,0.00072427513,0.00032793457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050670974,0.000054468223,0.0015831412,0.0001281466,0.00013031441,0.00019752525,0.00017788474,0.9067738,0.028384835,0.02766971,0.00036500173,0.034028385],"study_design_scores_gemma":[0.000011497587,0.00008047631,0.00033722864,0.000006252239,0.000018101411,0.00009644953,0.0000119567285,0.9917561,0.0049617435,0.0025345152,0.00016831495,0.000017410299],"about_ca_topic_score_codex":0.0015242405,"about_ca_topic_score_gemma":0.0009096789,"teacher_disagreement_score":0.0025628605,"about_ca_system_score_codex":0.0009526277,"about_ca_system_score_gemma":0.0011253539,"threshold_uncertainty_score":0.013553917},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010292388,0.00022736257,0.99786526,0.000047082973,0.000017621764,0.000010170722,0.00001015111,0.0001467213,0.00064650894],"genre_scores_gemma":[0.14176093,0.0011413455,0.85148644,0.0001214185,0.00016506539,0.00018375307,0.00011482305,0.000108365115,0.004917839],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994493,0.00013128205,0.000021687822,0.00011330222,0.00025730682,0.00002701153],"domain_scores_gemma":[0.99945706,0.00029374997,0.000047545353,0.000102006496,0.0000860473,0.000013609779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005119392,0.00071532413,0.000640007,0.00078838493,0.0004192447,0.00060760847,0.00065730495,0.00067367055,0.0015694458],"category_scores_gemma":[0.0023295016,0.0002921684,0.0004829266,0.00062010135,0.00069885585,0.00088520494,0.0007238401,0.0012484613,0.0006662828],"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.00011205759,0.000070837865,0.00046556248,0.00023276471,0.00008827517,0.00018365923,0.00015429329,0.14646536,0.06290612,0.056763377,0.0022316596,0.73032594],"study_design_scores_gemma":[0.000012554665,0.0000949233,0.00089661026,0.000024356754,0.00002798968,0.0005424686,0.000028146,0.9317207,0.028154038,0.023907918,0.014528183,0.000062146515],"about_ca_topic_score_codex":0.00066437066,"about_ca_topic_score_gemma":0.0010484747,"teacher_disagreement_score":0.0015694458,"about_ca_system_score_codex":0.00030343156,"about_ca_system_score_gemma":0.00056996575,"threshold_uncertainty_score":0.0052503347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023881153,0.00035888492,0.99575114,0.000054213368,0.000042767006,0.000019866815,0.000028551578,0.00047386638,0.00088240945],"genre_scores_gemma":[0.09312116,0.0014035975,0.89943194,0.0001249905,0.00022313032,0.00015816561,0.0004860884,0.00014866435,0.004902227],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916387,0.00017263835,0.000057447392,0.00014722305,0.0003875571,0.00007126999],"domain_scores_gemma":[0.9994579,0.00021209793,0.000033509838,0.00006281848,0.00021360697,0.000020098914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000694452,0.0012416418,0.0013539561,0.0013157486,0.00043105276,0.0010361638,0.0006695278,0.0012153485,0.0024408218],"category_scores_gemma":[0.0016174313,0.00049560587,0.0008878536,0.0014481967,0.0004939535,0.0019654434,0.0012840531,0.0008052364,0.0033606023],"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.00029505667,0.000078075835,0.00027896947,0.000285041,0.000094305964,0.000119694865,0.000080501704,0.04869309,0.122560106,0.011080878,0.0035991485,0.81283504],"study_design_scores_gemma":[0.00008352005,0.00016295548,0.00072673487,0.00005141013,0.00009546998,0.0005009275,0.000045504217,0.87419415,0.089618325,0.017855242,0.016582953,0.00008277791],"about_ca_topic_score_codex":0.0010898483,"about_ca_topic_score_gemma":0.0012285783,"teacher_disagreement_score":0.0024408218,"about_ca_system_score_codex":0.00026247144,"about_ca_system_score_gemma":0.000979675,"threshold_uncertainty_score":0.0081653},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045038373,0.0003109754,0.99399227,0.000057013956,0.000031690066,0.000022833317,0.00007063255,0.00028685576,0.00072385976],"genre_scores_gemma":[0.04014944,0.0008741259,0.9568921,0.000048896378,0.000070551665,0.00008502855,0.00026195231,0.00012025393,0.0014977403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999746,0.000053383068,0.000016458069,0.00004331908,0.000118018,0.00002288719],"domain_scores_gemma":[0.9994973,0.00019400737,0.000055125824,0.00010512036,0.00011407379,0.000034336652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044439983,0.00072882755,0.00045452145,0.0014003956,0.00033205395,0.001238481,0.00064137974,0.00085358316,0.0030410935],"category_scores_gemma":[0.0026276144,0.00050756254,0.00034375474,0.0010356965,0.00055900315,0.0012779825,0.0017447725,0.0010115427,0.0015292255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023338631,0.00003887476,0.00083417754,0.0005291391,0.000048550748,0.000538125,0.00032895218,0.01783222,0.25486526,0.02627843,0.0028602846,0.69561267],"study_design_scores_gemma":[0.00018195523,0.00041797032,0.006222471,0.000353622,0.00015133625,0.0053305323,0.0003222041,0.5531405,0.22914192,0.11055387,0.093948215,0.00023539459],"about_ca_topic_score_codex":0.00031324502,"about_ca_topic_score_gemma":0.00054928515,"teacher_disagreement_score":0.0030410935,"about_ca_system_score_codex":0.0001492058,"about_ca_system_score_gemma":0.00050995767,"threshold_uncertainty_score":0.01017344},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008835827,0.00016404719,0.9981073,0.000022356815,0.000028492803,0.00001039393,0.000008142813,0.00019826402,0.0005775345],"genre_scores_gemma":[0.051816903,0.00033142176,0.9446057,0.00008829497,0.00007329731,0.00007440544,0.00006258293,0.00009496746,0.002852474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933213,0.00015496033,0.000044912504,0.00013195814,0.00029819467,0.000037839498],"domain_scores_gemma":[0.9995372,0.0001314512,0.000038583723,0.00009607935,0.00017509378,0.000021599772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047828173,0.0007082661,0.000625527,0.0007077078,0.0004019695,0.0007602662,0.0011663379,0.0008768414,0.0018933483],"category_scores_gemma":[0.0017614437,0.00031175508,0.00054794387,0.0006592752,0.00047500798,0.0013420391,0.00090266083,0.00079541566,0.0012710359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030698933,0.000057455556,0.0003645126,0.00019255711,0.00011270674,0.00012708436,0.0001309505,0.126423,0.13604307,0.08948036,0.004776516,0.6419848],"study_design_scores_gemma":[0.000026091167,0.000084287356,0.00021689758,0.0000129894515,0.000025819409,0.00033590486,0.00001041282,0.94043535,0.029603135,0.013213594,0.015978968,0.00005667497],"about_ca_topic_score_codex":0.00074556697,"about_ca_topic_score_gemma":0.0009388976,"teacher_disagreement_score":0.0018933483,"about_ca_system_score_codex":0.00044858642,"about_ca_system_score_gemma":0.0005225106,"threshold_uncertainty_score":0.0063338876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04586776,0.0009452785,0.9505812,0.00013594556,0.000030519142,0.000032607615,0.00004038667,0.00038884568,0.001977534],"genre_scores_gemma":[0.83949333,0.0010615056,0.15806311,0.000067998684,0.00006968794,0.000100347774,0.00012103894,0.00004075171,0.0009822783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858415,0.00063313375,0.000056625424,0.00010529912,0.00046693438,0.00015392063],"domain_scores_gemma":[0.9939335,0.004439343,0.00039747704,0.00041840968,0.0007176351,0.000093559465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018784157,0.0007868426,0.00089057715,0.0005679874,0.00042992714,0.0006607239,0.00038231286,0.0009429991,0.0010200478],"category_scores_gemma":[0.008247065,0.00024141386,0.000339466,0.0008904371,0.0008120539,0.0013844168,0.0009023039,0.00067304197,0.00036032285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080674497,0.00010789137,0.0017158813,0.00026121555,0.00011708001,0.0001327294,0.00012865066,0.8259132,0.017449878,0.020190407,0.00091827026,0.13225801],"study_design_scores_gemma":[0.000007706639,0.000090479414,0.00035248822,0.0000064528704,0.000011886021,0.00007358563,0.000013971751,0.9928479,0.004968805,0.0014459626,0.00016784781,0.0000127984285],"about_ca_topic_score_codex":0.0014938747,"about_ca_topic_score_gemma":0.001186588,"teacher_disagreement_score":0.0018784157,"about_ca_system_score_codex":0.0004648143,"about_ca_system_score_gemma":0.0008002536,"threshold_uncertainty_score":0.009934127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006361443,0.00030841428,0.99216485,0.00008551851,0.000036139474,0.0000131015895,0.000017583048,0.00022108362,0.00079178304],"genre_scores_gemma":[0.2532647,0.00093798887,0.7438111,0.00012289583,0.0001373178,0.00007660247,0.00009908946,0.000050198712,0.0015001197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945027,0.00015038648,0.000024624529,0.000088721084,0.00025698554,0.000028988898],"domain_scores_gemma":[0.9993618,0.0002381184,0.00006085239,0.00008798996,0.00023449046,0.000016746144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000539438,0.00059072167,0.0005375056,0.0004548615,0.00031215986,0.00059807824,0.0004463964,0.00062777504,0.00076104584],"category_scores_gemma":[0.002231407,0.00023664114,0.00034658288,0.0006431316,0.00056594657,0.0006230702,0.0005036979,0.0005550846,0.00042841787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034007887,0.00011544996,0.002936213,0.00034318442,0.00021369675,0.00033802888,0.00019924503,0.31720924,0.13237241,0.06698572,0.0025915843,0.47635522],"study_design_scores_gemma":[0.000019341758,0.00009193803,0.000749482,0.00001692181,0.000040327377,0.00021511472,0.000013801026,0.9390734,0.04171537,0.012271102,0.0057591624,0.000034133544],"about_ca_topic_score_codex":0.00072854315,"about_ca_topic_score_gemma":0.00085547543,"teacher_disagreement_score":0.00076104584,"about_ca_system_score_codex":0.0003316768,"about_ca_system_score_gemma":0.00054549164,"threshold_uncertainty_score":0.002852857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076392223,0.00009292597,0.9912753,0.000047209596,0.000015332076,0.000018468196,0.000017380462,0.00020922328,0.0006848682],"genre_scores_gemma":[0.21280873,0.00031308027,0.78282106,0.000074690026,0.000051542334,0.00010870568,0.00020376644,0.00013076644,0.003487662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969697,0.000070359594,0.000012359892,0.00005399413,0.00014575037,0.000020602343],"domain_scores_gemma":[0.9997024,0.00011669592,0.000030035315,0.000029676477,0.000108774126,0.000012385917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004220349,0.00068031636,0.00044918954,0.00042662068,0.000215348,0.00039929358,0.0004448044,0.0004547195,0.0014336987],"category_scores_gemma":[0.001411711,0.00024325744,0.0004050317,0.0005136844,0.00026152522,0.0007262487,0.00044926876,0.0005679584,0.0006889067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003770536,0.00010608594,0.00089546683,0.00017294855,0.00007938085,0.000099331075,0.000080928745,0.22900693,0.089003734,0.01335269,0.002386434,0.664439],"study_design_scores_gemma":[0.000010741893,0.000039833703,0.0006107718,0.0000065489767,0.000008592915,0.00007887089,0.0000062583804,0.9828091,0.013270376,0.0016686255,0.0014819974,0.000008293736],"about_ca_topic_score_codex":0.0011019506,"about_ca_topic_score_gemma":0.0011273227,"teacher_disagreement_score":0.0014336987,"about_ca_system_score_codex":0.00027891083,"about_ca_system_score_gemma":0.00048443957,"threshold_uncertainty_score":0.004796207},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018169096,0.030473739,0.931505,0.0030170758,0.0005391211,0.00003919125,0.000096733784,0.00035553853,0.015804458],"genre_scores_gemma":[0.55308944,0.020787472,0.41267264,0.001226147,0.0026855376,0.00013686181,0.000178735,0.00020964323,0.009013571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990159,0.00028738347,0.00007404715,0.00019431046,0.0003726275,0.00005567927],"domain_scores_gemma":[0.99723685,0.0016891188,0.00036377314,0.00028170753,0.00033051713,0.00009802621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015140474,0.0008526158,0.00062259147,0.0022118187,0.00042305037,0.0022446068,0.00087080087,0.0013495036,0.0021142443],"category_scores_gemma":[0.006878492,0.0002441946,0.00042273448,0.0019704124,0.004693576,0.0047849086,0.001361184,0.0018250942,0.0005346732],"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.00009306305,0.000021381466,0.00036994615,0.00027177733,0.000040203657,0.00009782434,0.00025209304,0.0115148295,0.0053773155,0.851602,0.0019119434,0.12844753],"study_design_scores_gemma":[0.000010483024,0.0000736516,0.00072413724,0.000050935058,0.000011304689,0.00017662777,0.000072956864,0.01981534,0.0015146878,0.968474,0.009035783,0.000040027953],"about_ca_topic_score_codex":0.0005802496,"about_ca_topic_score_gemma":0.00035957995,"teacher_disagreement_score":0.0022446068,"about_ca_system_score_codex":0.00070821174,"about_ca_system_score_gemma":0.00030857892,"threshold_uncertainty_score":0.008007169},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7331594,0.0012802881,0.25548255,0.00016163883,0.000081186,0.00008651135,0.00016046874,0.0007039779,0.008883852],"genre_scores_gemma":[0.97410685,0.00025018142,0.024456369,0.000044604614,0.000028058952,0.000024331332,0.00006706899,0.000024311292,0.0009982289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817884,0.0006108803,0.000087455555,0.00017977825,0.0006080439,0.0003350021],"domain_scores_gemma":[0.9950649,0.0028087415,0.00043949138,0.0005970508,0.00097440626,0.000115490635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015986429,0.0007453471,0.00077993184,0.0007547037,0.0005314745,0.0008832478,0.0005527357,0.0009928618,0.00196471],"category_scores_gemma":[0.007824669,0.0001832404,0.0003149666,0.0007739227,0.00092540734,0.0014887198,0.0011457033,0.00043625102,0.0003138746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006239189,0.00019806605,0.0062692356,0.00046684602,0.00032580944,0.00043497866,0.0004369398,0.6711793,0.124556795,0.026953395,0.0008437638,0.16209567],"study_design_scores_gemma":[0.00014991248,0.0016371504,0.003031412,0.00006980892,0.00018284192,0.0005751333,0.00012050909,0.8764541,0.10859318,0.0077055674,0.0013754619,0.000104949235],"about_ca_topic_score_codex":0.0014659467,"about_ca_topic_score_gemma":0.0009618688,"teacher_disagreement_score":0.00196471,"about_ca_system_score_codex":0.00088441337,"about_ca_system_score_gemma":0.0007905761,"threshold_uncertainty_score":0.008454502},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7109961,0.00024699053,0.28401086,0.000059124694,0.00003958719,0.000039321956,0.00017115413,0.0011594942,0.0032772769],"genre_scores_gemma":[0.9387038,0.00009458557,0.05974124,0.000018314176,0.000012467585,0.000011051695,0.00021549688,0.00002421103,0.0011788817],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99986446,0.000023416458,0.0000050730005,0.00003881691,0.000048957645,0.000019212135],"domain_scores_gemma":[0.99970067,0.00008495067,0.00006655657,0.00003097955,0.000102144964,0.000014840187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014847801,0.00018197838,0.00020446147,0.00076349964,0.0001287391,0.00030844656,0.00019207818,0.00024428056,0.00036597042],"category_scores_gemma":[0.0007410506,0.00010049834,0.000104264625,0.00041949673,0.000108372646,0.00034444346,0.00025136265,0.00018659334,0.00025958655],"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.00080600125,0.00017773043,0.025581079,0.00009618178,0.00006962918,0.00021835857,0.00026446144,0.023007145,0.29979852,0.001114729,0.0012548399,0.6476113],"study_design_scores_gemma":[0.000088929075,0.0006014976,0.053663485,0.00002174982,0.00010861271,0.0010483814,0.00020632171,0.5673535,0.36901516,0.0012076079,0.0066208043,0.00006408797],"about_ca_topic_score_codex":0.0007440474,"about_ca_topic_score_gemma":0.0013944953,"teacher_disagreement_score":0.00076349964,"about_ca_system_score_codex":0.00016590979,"about_ca_system_score_gemma":0.00015335694,"threshold_uncertainty_score":0.0014794469},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012244995,0.0003609326,0.9852305,0.0000649368,0.0000730954,0.000094236995,0.0001257363,0.0006268633,0.0011786643],"genre_scores_gemma":[0.13293694,0.0014753838,0.86176366,0.00006306425,0.000113994516,0.00019363088,0.0006162562,0.00007632479,0.00276081],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997832,0.000023842373,0.000018322784,0.00004015169,0.00012075981,0.000013690621],"domain_scores_gemma":[0.9997192,0.000060365994,0.000027111566,0.00002948624,0.00015445826,0.000009388638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022671046,0.0005155088,0.00037942617,0.0011420023,0.00020698535,0.00041990163,0.00032778174,0.00028630026,0.0013136263],"category_scores_gemma":[0.0008552453,0.00015438531,0.00035864805,0.001163332,0.00026531654,0.0007178146,0.00022082987,0.00042948188,0.00073626573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017301746,0.00006514629,0.0006436193,0.00023348704,0.00005079674,0.00013008766,0.000071294126,0.0121298665,0.39790818,0.006739154,0.0018653854,0.5799899],"study_design_scores_gemma":[0.00003834897,0.00045798087,0.007991779,0.000050665847,0.00010374377,0.0008238767,0.00008236712,0.6059643,0.35829225,0.006140987,0.019976167,0.00007753905],"about_ca_topic_score_codex":0.0018817273,"about_ca_topic_score_gemma":0.0019770777,"teacher_disagreement_score":0.0018817273,"about_ca_system_score_codex":0.00020523572,"about_ca_system_score_gemma":0.00050973124,"threshold_uncertainty_score":0.0043945312},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006905329,0.00017269059,0.99208754,0.000042663043,0.000022216362,0.000031385418,0.00001382179,0.00026738047,0.0004570348],"genre_scores_gemma":[0.1974877,0.00031887693,0.79962564,0.000062795174,0.00004202605,0.00014237665,0.000072944684,0.000027607133,0.0022200162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921346,0.00034507542,0.000037778937,0.00008589622,0.00027145867,0.00004638104],"domain_scores_gemma":[0.9994572,0.00018191441,0.000053390653,0.00010449596,0.00016498417,0.000037988764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006239601,0.00050324923,0.0007210287,0.0006088388,0.00055081,0.000574032,0.00046442263,0.0005877566,0.0012579561],"category_scores_gemma":[0.0012385867,0.00024327807,0.000420867,0.00061580597,0.0006348445,0.0009684109,0.0006887593,0.00052852824,0.00090162584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074582617,0.00019088315,0.00096556847,0.00023954202,0.00012285887,0.00015159431,0.00021507997,0.07734743,0.15357265,0.07764348,0.0028206408,0.6859845],"study_design_scores_gemma":[0.00004457443,0.00026339214,0.00040251616,0.000013623192,0.000023419867,0.0003549309,0.000025505611,0.94509625,0.039061166,0.01073724,0.003924825,0.000052643067],"about_ca_topic_score_codex":0.0007202365,"about_ca_topic_score_gemma":0.0010137206,"teacher_disagreement_score":0.0012579561,"about_ca_system_score_codex":0.00032620804,"about_ca_system_score_gemma":0.0007945127,"threshold_uncertainty_score":0.0042082667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005020427,0.00027925542,0.9904371,0.00023470115,0.00009740834,0.00009908856,0.00013406873,0.0023426453,0.0013552471],"genre_scores_gemma":[0.17444193,0.0002690737,0.81233287,0.00054300757,0.00012830441,0.00068829604,0.0011253154,0.0004059007,0.010065334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920434,0.00021774584,0.000045528846,0.00022039578,0.00020794797,0.000104072744],"domain_scores_gemma":[0.9991743,0.00035387668,0.00006925917,0.00015517823,0.00018544243,0.00006193668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014938718,0.0011806148,0.0017782518,0.00092699495,0.0007539292,0.00096521823,0.0023401903,0.0019953279,0.008426649],"category_scores_gemma":[0.0043394472,0.00047102055,0.0008882065,0.0010165031,0.00088499073,0.0014757774,0.0017147043,0.0018904454,0.003105623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043436897,0.0002018222,0.00065287336,0.00025796733,0.00015692542,0.0001741732,0.00008651472,0.1952425,0.0057770205,0.023297245,0.025551258,0.74816734],"study_design_scores_gemma":[0.00006417935,0.000055980945,0.0001811608,0.000010049493,0.000016877371,0.00008719746,0.000009770706,0.9799287,0.0028472245,0.013602716,0.0031821993,0.000013901496],"about_ca_topic_score_codex":0.0047745924,"about_ca_topic_score_gemma":0.007970176,"teacher_disagreement_score":0.008426649,"about_ca_system_score_codex":0.0009466345,"about_ca_system_score_gemma":0.0030675656,"threshold_uncertainty_score":0.028189898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017501846,0.000040059498,0.9970208,0.000015340956,0.00002160609,0.000019344463,0.000027142218,0.0002508853,0.00085459044],"genre_scores_gemma":[0.059650213,0.00020309226,0.9366292,0.000024795629,0.000028664304,0.00011421217,0.00014643792,0.0000916997,0.003111669],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998128,0.000029636,0.00001144835,0.000022431375,0.00011577352,0.000008025262],"domain_scores_gemma":[0.99975616,0.000120095945,0.000018394736,0.000029394481,0.000067851426,0.000008236377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027067057,0.0003957568,0.0002489385,0.0003645631,0.00030079382,0.00025490383,0.00035783096,0.00040159206,0.004320325],"category_scores_gemma":[0.0013540566,0.00013170473,0.00024056922,0.00039663567,0.0002179285,0.0005205488,0.00022232243,0.000488032,0.0012329714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024475937,0.00006485113,0.0003871906,0.00022596166,0.000039629354,0.00039956495,0.00022059258,0.10123597,0.14105955,0.07617662,0.0044028694,0.6755424],"study_design_scores_gemma":[0.00004847614,0.00011187615,0.00040449656,0.000040671086,0.00001931483,0.0007904996,0.000018567807,0.8981792,0.0669035,0.01511205,0.018335873,0.000035466444],"about_ca_topic_score_codex":0.00092401967,"about_ca_topic_score_gemma":0.0010970487,"teacher_disagreement_score":0.004320325,"about_ca_system_score_codex":0.00017817835,"about_ca_system_score_gemma":0.0003816896,"threshold_uncertainty_score":0.014452934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23332845,0.0010088119,0.7631041,0.00019712368,0.00005862952,0.0000582601,0.000070352675,0.00046693656,0.0017073664],"genre_scores_gemma":[0.8269816,0.0009699562,0.16856205,0.000057753536,0.000033094417,0.00002494867,0.00013862389,0.000046940753,0.0031849365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994898,0.000070987124,0.000023526296,0.00004612362,0.00031385513,0.00005577776],"domain_scores_gemma":[0.9981823,0.00082993455,0.00029083973,0.00027194124,0.00037661946,0.000048478232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001020847,0.00034774406,0.00033682803,0.0006567646,0.00019906883,0.0005875909,0.00052440015,0.0005482307,0.00053887605],"category_scores_gemma":[0.0045791953,0.00017544019,0.00026619728,0.0005392897,0.00045463193,0.0009256026,0.0005165836,0.00043291572,0.00020289583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003455756,0.0002339312,0.007015902,0.00047445713,0.000095996285,0.0013256575,0.00035029766,0.21320328,0.3398612,0.02170728,0.0020417857,0.41023433],"study_design_scores_gemma":[0.000053165008,0.00041122935,0.0031466032,0.000040149887,0.00004990372,0.0012253524,0.000061459126,0.7439606,0.2463898,0.0030393908,0.0015967349,0.000025633562],"about_ca_topic_score_codex":0.0014011167,"about_ca_topic_score_gemma":0.000951096,"teacher_disagreement_score":0.0014011167,"about_ca_system_score_codex":0.00043431722,"about_ca_system_score_gemma":0.0004782656,"threshold_uncertainty_score":0.00539881},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015474661,0.0006462236,0.97976947,0.00012682543,0.000043900935,0.00005678381,0.000053467727,0.0002508623,0.0035777052],"genre_scores_gemma":[0.45123443,0.0018614214,0.53693265,0.00024124261,0.00015900702,0.00052074256,0.00035986584,0.0003668547,0.0083238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978865,0.0006364307,0.00010331803,0.00024626494,0.0009818661,0.00014552567],"domain_scores_gemma":[0.9830322,0.012563775,0.00090050837,0.0009913044,0.0023316047,0.00018056344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045106513,0.00084910524,0.0006291062,0.0013921314,0.0006745707,0.0015309236,0.0007760644,0.0013125133,0.0029438622],"category_scores_gemma":[0.042225976,0.00044717095,0.0005477841,0.00094985624,0.0017884686,0.0022576712,0.0013106476,0.0016834514,0.0015591237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046848282,0.00008486101,0.0020502503,0.0003196174,0.00009841599,0.00010293106,0.00040069566,0.48312163,0.013466453,0.35408795,0.0021835722,0.14361522],"study_design_scores_gemma":[0.000028673378,0.00006798017,0.0004225542,0.00004041975,0.00001165703,0.00009058746,0.000030053368,0.9262637,0.005037845,0.06626666,0.0017093815,0.000030455862],"about_ca_topic_score_codex":0.0011604471,"about_ca_topic_score_gemma":0.00073510053,"teacher_disagreement_score":0.0045106513,"about_ca_system_score_codex":0.0010291841,"about_ca_system_score_gemma":0.0017703266,"threshold_uncertainty_score":0.023854911},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009379132,0.0012320619,0.97941715,0.0003599967,0.00004635872,0.000032913314,0.000050194132,0.00007251561,0.0094095925],"genre_scores_gemma":[0.8254131,0.0045923498,0.14957993,0.00032215446,0.0005030084,0.00036827425,0.00020759074,0.00011900339,0.018894522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895847,0.00040508,0.00005180728,0.00017023087,0.00031495656,0.000099391706],"domain_scores_gemma":[0.99796665,0.001475133,0.00023288411,0.00007333498,0.00022266526,0.00002926239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011014984,0.0008289985,0.00091063767,0.00042511633,0.0003989234,0.0012897342,0.0004631699,0.0011734086,0.004774139],"category_scores_gemma":[0.005918449,0.0004907184,0.00035710764,0.00073268067,0.0011470082,0.0014774632,0.0010024484,0.0013911189,0.0009132692],"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.000085108404,0.000029430046,0.00018334427,0.00025584793,0.000035473317,0.0001536386,0.00022591898,0.70127755,0.0029023017,0.2640577,0.0019047295,0.028888969],"study_design_scores_gemma":[0.00003115963,0.000068859445,0.000121735255,0.000034222976,0.000013834322,0.00009188034,0.00003598827,0.92136925,0.0007438189,0.074821696,0.0026477086,0.000019822402],"about_ca_topic_score_codex":0.001224206,"about_ca_topic_score_gemma":0.0009699423,"teacher_disagreement_score":0.004774139,"about_ca_system_score_codex":0.00078894035,"about_ca_system_score_gemma":0.000688823,"threshold_uncertainty_score":0.015971124},"labels":[],"label_agreement":null},{"id":"W2166317606","doi":"10.1109/tsp.2008.917354","title":"A Semiblind Channel Estimation Approach for MIMO–OFDM Systems","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Weighting; MIMO; MIMO-OFDM; Constraint (computer-aided design); Channel (broadcasting); Computer science; Algorithm; Mean squared error; Closed-form expression; Control theory (sociology); Mathematical optimization; Mathematics; Statistics; Telecommunications; Artificial intelligence","score_opus":0.05139883940876321,"score_gpt":0.2812029615370891,"score_spread":0.2298041221283259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166317606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001313748,0.00007568841,0.99803203,0.000032906635,0.000017020953,0.0000101325795,0.000010291074,0.000095241034,0.00041304668],"genre_scores_gemma":[0.24551053,0.0005468989,0.74938387,0.00018276564,0.00016744333,0.000123231,0.00012695085,0.00009398679,0.003864471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990151,0.00034812957,0.000044418197,0.00013683856,0.00039947336,0.000056008026],"domain_scores_gemma":[0.99880075,0.0005668939,0.0001373762,0.00017179102,0.00028566286,0.00003751905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007806903,0.0007058272,0.0007313288,0.00047503237,0.00046295716,0.0008679947,0.0007476417,0.00086200755,0.002086389],"category_scores_gemma":[0.0027142395,0.0003380666,0.0005209059,0.00041588864,0.00073550973,0.0013258645,0.0011262258,0.0010920485,0.0009049683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035479266,0.00016944592,0.0005843242,0.00043459493,0.00013135644,0.0001947918,0.0002504425,0.44387576,0.08769693,0.06641086,0.004257727,0.395639],"study_design_scores_gemma":[0.000012225646,0.00008093072,0.00014630947,0.000012083547,0.000011739351,0.0001327592,0.000013750685,0.9776793,0.011466897,0.007891984,0.0025212415,0.000030679366],"about_ca_topic_score_codex":0.000764881,"about_ca_topic_score_gemma":0.001040375,"teacher_disagreement_score":0.002086389,"about_ca_system_score_codex":0.00036830988,"about_ca_system_score_gemma":0.0009461553,"threshold_uncertainty_score":0.006979704},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027134856,0.00015949423,0.99645764,0.00004093562,0.000028224722,0.000011505257,0.000009984927,0.00012307095,0.00045569122],"genre_scores_gemma":[0.13119781,0.0006817792,0.8669621,0.00007885757,0.00011677267,0.00006776587,0.00010108686,0.00005465921,0.0007392235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990594,0.0003571673,0.000044244916,0.00014979515,0.00032776388,0.000061641185],"domain_scores_gemma":[0.99834275,0.0007197811,0.00012102454,0.0002876876,0.00046723709,0.00006146553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009986944,0.0008529149,0.0009224763,0.0009282257,0.00041269406,0.00074897485,0.0005590245,0.00093450974,0.00069293746],"category_scores_gemma":[0.0047706105,0.0002604719,0.0005212501,0.0013462111,0.0008380708,0.0009965332,0.0010371394,0.00086636236,0.00034051228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001600761,0.00010255222,0.0013282013,0.000112340436,0.00008982444,0.00015194557,0.00017768015,0.35615036,0.015823878,0.09066,0.0034110376,0.5318321],"study_design_scores_gemma":[0.000007642936,0.000034808803,0.0001803987,0.000005954738,0.0000057633124,0.000094671675,0.000012274763,0.987938,0.004359782,0.005914964,0.0014298761,0.0000158612],"about_ca_topic_score_codex":0.0024066898,"about_ca_topic_score_gemma":0.0019708553,"teacher_disagreement_score":0.0024066898,"about_ca_system_score_codex":0.0003190895,"about_ca_system_score_gemma":0.0011658453,"threshold_uncertainty_score":0.005281627},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48987916,0.00034637295,0.50717705,0.00033754756,0.000018801356,0.000021046662,0.00006509611,0.00009619957,0.0020586625],"genre_scores_gemma":[0.9740571,0.00009911072,0.02548889,0.00003157249,0.000012226472,0.0000068129657,0.000028343049,0.000014754863,0.00026126698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994838,0.00014555998,0.000023221488,0.00010022096,0.00017006314,0.00007714835],"domain_scores_gemma":[0.9960722,0.0027960117,0.00045786504,0.00031555694,0.00025178125,0.000106631414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021866404,0.0005549552,0.00062803685,0.0013000903,0.00039255375,0.0014968679,0.0006293398,0.00087121874,0.00055628526],"category_scores_gemma":[0.010843778,0.0003072201,0.00045463844,0.0008703127,0.0015411371,0.0021829314,0.0017385646,0.0008017241,0.000082026185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029296553,0.000059376976,0.014923712,0.00009848096,0.000069123096,0.00054498005,0.0005491881,0.85495526,0.017197361,0.030857451,0.00017384489,0.08027829],"study_design_scores_gemma":[0.0000061796245,0.00004055823,0.003808168,0.000017547876,0.000008040311,0.000111310655,0.00007841787,0.9682689,0.0029615194,0.024421372,0.0002379038,0.00004001692],"about_ca_topic_score_codex":0.0024276862,"about_ca_topic_score_gemma":0.0022273255,"teacher_disagreement_score":0.0024276862,"about_ca_system_score_codex":0.00054987974,"about_ca_system_score_gemma":0.00037026746,"threshold_uncertainty_score":0.011564195},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018562869,0.00009711932,0.99614644,0.00005631861,0.000031196767,0.000026189738,0.00001752739,0.00022866689,0.001540227],"genre_scores_gemma":[0.1078911,0.0002977823,0.88411975,0.00019993815,0.0000706649,0.00022452508,0.0001623885,0.000074318676,0.0069595235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951327,0.00008663009,0.000027208669,0.00010345991,0.0002198869,0.000049616847],"domain_scores_gemma":[0.9995925,0.00012812881,0.000037172755,0.00004752106,0.00017311395,0.000021584307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005335011,0.00072478293,0.00064835686,0.0006560376,0.00044383507,0.0006359739,0.00088102673,0.0010056865,0.0028848383],"category_scores_gemma":[0.0014640759,0.00039786115,0.0005020636,0.00066120166,0.00055796193,0.0007961679,0.00089593703,0.0010413012,0.0014853085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021145355,0.00008101674,0.00059255416,0.00013102395,0.000092735936,0.00011875255,0.00013125043,0.28939897,0.03835049,0.043623216,0.006797896,0.62047064],"study_design_scores_gemma":[0.00003498063,0.000046129495,0.00017504767,0.000012374555,0.00001340159,0.00012622503,0.00001015855,0.98051935,0.008611409,0.0055933124,0.004835978,0.00002159262],"about_ca_topic_score_codex":0.0019457113,"about_ca_topic_score_gemma":0.0021213486,"teacher_disagreement_score":0.0028848383,"about_ca_system_score_codex":0.00052867614,"about_ca_system_score_gemma":0.001295755,"threshold_uncertainty_score":0.009650707},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005675475,0.000070181035,0.99847037,0.000038879116,0.000028579543,0.000013570874,0.00001929905,0.00022848498,0.0005630867],"genre_scores_gemma":[0.024610396,0.0002031068,0.97062546,0.00008225061,0.00006553189,0.00007920977,0.00016539134,0.00016978044,0.003998983],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949324,0.00008791723,0.000026695208,0.00009519265,0.00026235124,0.000034571545],"domain_scores_gemma":[0.9996475,0.00008660265,0.000031724685,0.000045803212,0.00016031793,0.000028127699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005968175,0.00080731703,0.0006935704,0.0008635017,0.00040992763,0.00079307065,0.0009626118,0.0007407961,0.004578643],"category_scores_gemma":[0.0013053344,0.00039403638,0.00050986605,0.0006340686,0.00065123005,0.0011214248,0.0009150195,0.0011505225,0.0026147459],"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.00011485645,0.000071264585,0.00034756988,0.00026438542,0.000088414985,0.00010632408,0.00009301572,0.120422065,0.049956046,0.11304733,0.011514638,0.7039741],"study_design_scores_gemma":[0.000036933052,0.00006335175,0.00027698258,0.000014072669,0.000016058899,0.00018772992,0.000012580106,0.94976723,0.012340229,0.020131603,0.017110756,0.000042408858],"about_ca_topic_score_codex":0.002158613,"about_ca_topic_score_gemma":0.0027555814,"teacher_disagreement_score":0.004578643,"about_ca_system_score_codex":0.0005437116,"about_ca_system_score_gemma":0.001082855,"threshold_uncertainty_score":0.015317082},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020640215,0.0003766926,0.9965089,0.00009661939,0.000041368923,0.000025133913,0.000040932377,0.000358913,0.00048739466],"genre_scores_gemma":[0.050244942,0.001358491,0.9464295,0.00009042741,0.00012770807,0.00025038747,0.00030629558,0.00016630847,0.0010258693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940515,0.0002696274,0.00003825727,0.00007262239,0.00019393767,0.000020404792],"domain_scores_gemma":[0.9982216,0.0011209282,0.00011438925,0.00024305882,0.00026122204,0.000038861013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017777905,0.0008817246,0.00083202677,0.00080071855,0.0004633578,0.00072595256,0.0007029669,0.0014380633,0.0020375873],"category_scores_gemma":[0.005917929,0.00046896443,0.00086453866,0.0011196779,0.0008521699,0.0007505367,0.00056650303,0.0017370137,0.0012502553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005069874,0.0001411662,0.0008852952,0.0010036139,0.000347893,0.00050427427,0.00023372272,0.26884103,0.23440625,0.062828,0.008992553,0.42130926],"study_design_scores_gemma":[0.000047694786,0.00013072568,0.0015703058,0.00006625429,0.00008147824,0.00035226258,0.000024511284,0.8778785,0.05842529,0.046192817,0.0151601555,0.000070000104],"about_ca_topic_score_codex":0.0010916174,"about_ca_topic_score_gemma":0.0012938707,"teacher_disagreement_score":0.0020375873,"about_ca_system_score_codex":0.00038985055,"about_ca_system_score_gemma":0.00077312405,"threshold_uncertainty_score":0.009401917},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035173493,0.0001282056,0.99576676,0.00008068856,0.000026751357,0.000022735736,0.00001506474,0.00005934154,0.0003830972],"genre_scores_gemma":[0.26523522,0.00057641906,0.72788906,0.0001624345,0.00014835797,0.00034627964,0.00024405058,0.00014642748,0.005251715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989532,0.00027615615,0.000053934924,0.000111831985,0.00051212363,0.00009264277],"domain_scores_gemma":[0.999022,0.00042200327,0.00006232342,0.00007954323,0.0003804898,0.000033695018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018217813,0.0008552562,0.00080574764,0.00070960046,0.00033297326,0.0009018252,0.0010084698,0.0012683438,0.00129692],"category_scores_gemma":[0.004200614,0.00027791728,0.00045678965,0.0006496385,0.0006493738,0.001703007,0.00082294294,0.0010328611,0.00041872307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000305027,0.00015476381,0.0008142008,0.0002685505,0.00011217111,0.00011892923,0.00004567433,0.5694095,0.029301658,0.07548503,0.0037381207,0.32024634],"study_design_scores_gemma":[0.000011265304,0.000040896666,0.0002568744,0.0000072990606,0.000010798883,0.000059018203,0.0000037539107,0.988208,0.0049131773,0.0052004866,0.0012719947,0.000016409016],"about_ca_topic_score_codex":0.0016333207,"about_ca_topic_score_gemma":0.0010426537,"teacher_disagreement_score":0.0018217813,"about_ca_system_score_codex":0.0008793821,"about_ca_system_score_gemma":0.0011087127,"threshold_uncertainty_score":0.009634614},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029545277,0.0001247582,0.99228024,0.00006984079,0.00004483934,0.00006793317,0.00019505649,0.0034217783,0.00084099825],"genre_scores_gemma":[0.06399291,0.0003876838,0.92998356,0.00008817139,0.00007667371,0.00043483145,0.0012693194,0.0012442761,0.0025226118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937075,0.00014207969,0.000029273397,0.00016905417,0.00023178871,0.00005694307],"domain_scores_gemma":[0.9992987,0.00021782808,0.00009603747,0.00019264186,0.00016733936,0.000027492426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018940973,0.0017569872,0.0006881068,0.0015166554,0.0006589963,0.0011330827,0.0012906884,0.0007683497,0.0039224173],"category_scores_gemma":[0.003799784,0.00046555512,0.001430649,0.0015808933,0.00082964613,0.0013793021,0.0011393353,0.0015057664,0.0024291433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029030707,0.0001637542,0.0019121022,0.0003632436,0.0003983607,0.00029121773,0.0003315623,0.07620106,0.06759595,0.0199789,0.016166585,0.81630707],"study_design_scores_gemma":[0.000050745697,0.00022938795,0.0063437545,0.000062798375,0.00014949481,0.00076738826,0.00010070172,0.82290137,0.10273149,0.03147679,0.03507113,0.000114937226],"about_ca_topic_score_codex":0.0052117878,"about_ca_topic_score_gemma":0.007341971,"teacher_disagreement_score":0.0052117878,"about_ca_system_score_codex":0.00073510857,"about_ca_system_score_gemma":0.0015627459,"threshold_uncertainty_score":0.013121724},"labels":[],"label_agreement":null},{"id":"W2168085983","doi":"10.1109/tsp.2005.849192","title":"On spectral theory of cyclostationary signals in multirate systems","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cyclostationary process; Linear system; LTI system theory; Mathematics; Invariant (physics); Computer science; Algorithm; Signal processing; Transformation matrix; Control theory (sociology); Digital signal processing; Telecommunications; Artificial intelligence","score_opus":0.023741427771523334,"score_gpt":0.27828956852172093,"score_spread":0.2545481407501976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168085983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058807316,0.0026210982,0.97849476,0.0003681514,0.00018716662,0.000017395136,0.000038033548,0.000054008855,0.012338627],"genre_scores_gemma":[0.69255006,0.02258871,0.25869152,0.001110018,0.0028642435,0.00027546327,0.00034132908,0.00020019215,0.021378424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930966,0.0002051964,0.00003409187,0.00010212489,0.0002835623,0.00006542254],"domain_scores_gemma":[0.9987166,0.00079826673,0.00013734434,0.000099727244,0.00020992038,0.00003816483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010881086,0.0009276523,0.0006676933,0.0011326832,0.00042637548,0.0012410424,0.00069128023,0.00092119176,0.0030920517],"category_scores_gemma":[0.002922416,0.00030796172,0.0006637179,0.0011366237,0.0019348788,0.0022282328,0.0011075035,0.0018956991,0.0008808798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029798333,0.000018562827,0.00016892969,0.0001665405,0.000022152351,0.00015241337,0.00019722948,0.060960587,0.0032086663,0.9094869,0.0013263572,0.02426187],"study_design_scores_gemma":[0.000012533221,0.0000902249,0.0003042426,0.000102039885,0.000018923678,0.00024120972,0.000093248535,0.4404674,0.0015622954,0.5447581,0.012301221,0.00004867612],"about_ca_topic_score_codex":0.0008242673,"about_ca_topic_score_gemma":0.00043764364,"teacher_disagreement_score":0.0030920517,"about_ca_system_score_codex":0.0006811205,"about_ca_system_score_gemma":0.00038065345,"threshold_uncertainty_score":0.010343969},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012160413,0.00041620704,0.97677714,0.00022809593,0.00014960278,0.000013396368,0.00002381613,0.00023963844,0.009991693],"genre_scores_gemma":[0.69632465,0.0014482156,0.2849409,0.00029332718,0.0002958187,0.00008071222,0.00013501616,0.0004633987,0.016017951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996371,0.00007892845,0.000014617238,0.000048184083,0.00020315337,0.000017916454],"domain_scores_gemma":[0.99936205,0.00031262793,0.000042823922,0.00014314843,0.000118609714,0.000020758242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003523684,0.00037934227,0.00043992113,0.00053869374,0.00028960808,0.00066370267,0.000809364,0.00060742744,0.0034982986],"category_scores_gemma":[0.0020568694,0.00016695258,0.00033822714,0.0003202369,0.0007180609,0.0017431313,0.0005434425,0.0008191902,0.0010054733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006927217,0.000028940845,0.00043254875,0.00020979319,0.000022830254,0.00026552207,0.00012284672,0.059100896,0.017617049,0.8497943,0.0014266067,0.070909366],"study_design_scores_gemma":[0.000011491895,0.00003877727,0.00022595351,0.000039921182,0.000013668246,0.00042513447,0.000030598443,0.70045227,0.012233736,0.28050464,0.006003241,0.000020493317],"about_ca_topic_score_codex":0.00033002687,"about_ca_topic_score_gemma":0.00022749256,"teacher_disagreement_score":0.0034982986,"about_ca_system_score_codex":0.0002813951,"about_ca_system_score_gemma":0.00033226894,"threshold_uncertainty_score":0.011702955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013800035,0.0001129274,0.99814856,0.00006392561,0.000004318921,0.0000051076563,0.000010499999,0.00005296699,0.00022174667],"genre_scores_gemma":[0.18492061,0.0011474796,0.81064695,0.00017228839,0.00013875762,0.00013173603,0.00023405135,0.00012827647,0.0024797795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911445,0.0003701099,0.000048526093,0.00010245795,0.00032794644,0.000036611993],"domain_scores_gemma":[0.99726033,0.0018492357,0.00023096288,0.00024403639,0.0003461781,0.00006921054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018895529,0.00079214154,0.00076702517,0.001224544,0.00023536281,0.0009114041,0.001106837,0.0013650352,0.0013346493],"category_scores_gemma":[0.007974124,0.00050503324,0.0009191192,0.0008585492,0.0008135352,0.0018123336,0.0015694704,0.0013458187,0.00057143637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013360007,0.000074630676,0.0006821617,0.00015873135,0.00008657913,0.00010975335,0.00011276377,0.70907396,0.007332104,0.0808433,0.0011812529,0.2002111],"study_design_scores_gemma":[0.000007234279,0.000012079789,0.00009895658,0.00000459287,0.0000067812352,0.000045355166,0.00000488749,0.98793006,0.00060420297,0.010845136,0.00043218958,0.00000843738],"about_ca_topic_score_codex":0.0027556666,"about_ca_topic_score_gemma":0.002778502,"teacher_disagreement_score":0.0027556666,"about_ca_system_score_codex":0.0005687038,"about_ca_system_score_gemma":0.0010000383,"threshold_uncertainty_score":0.009993076},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027383225,0.00079362135,0.9668482,0.00015989334,0.000106875894,0.00007507062,0.00009830332,0.001378094,0.0031567505],"genre_scores_gemma":[0.23598716,0.00086063833,0.7563417,0.00011862235,0.000050784813,0.00013078684,0.00034711044,0.0000686345,0.00609448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997352,0.000045907243,0.000010508608,0.000074000964,0.00010837944,0.000026090838],"domain_scores_gemma":[0.9997962,0.000066680346,0.000014260978,0.00003354897,0.00007615925,0.00001316502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049652345,0.00048628022,0.00046231833,0.00060877437,0.0002683861,0.00064257707,0.0006733901,0.00074965646,0.0018906469],"category_scores_gemma":[0.0008556638,0.0002471836,0.0005169385,0.00074939185,0.0003844278,0.0008366291,0.0005006419,0.0004666901,0.0008762137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023157807,0.00014038179,0.0010910982,0.00015230932,0.00013300679,0.00012041929,0.00006127337,0.07047709,0.09371165,0.004186147,0.0032080847,0.8264869],"study_design_scores_gemma":[0.000015276886,0.00010473224,0.0018318266,0.000017390901,0.000038414146,0.0001357201,0.000013552008,0.9551235,0.03716158,0.001478979,0.0040529706,0.000026082398],"about_ca_topic_score_codex":0.003757173,"about_ca_topic_score_gemma":0.0036505836,"teacher_disagreement_score":0.003757173,"about_ca_system_score_codex":0.00039967254,"about_ca_system_score_gemma":0.00037679228,"threshold_uncertainty_score":0.0074706078},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026585844,0.012450064,0.9692432,0.004284187,0.0005660701,0.000022650103,0.00007653149,0.00021040752,0.010488351],"genre_scores_gemma":[0.188283,0.023344994,0.77407163,0.0020589137,0.0050358386,0.00018859054,0.00022930212,0.00020910017,0.0065785656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956304,0.00011442298,0.000025288626,0.000097773394,0.0001681755,0.000031344483],"domain_scores_gemma":[0.9980155,0.0013603182,0.00013791959,0.00014785086,0.0002778583,0.000060664162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001143077,0.0008205148,0.00057416665,0.0007234036,0.00055271696,0.0026337712,0.00097258884,0.0019957172,0.0024987534],"category_scores_gemma":[0.0052489727,0.0003130196,0.00049631094,0.0013221785,0.003039284,0.003149916,0.000900393,0.0021414612,0.0012946775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053986372,0.000026479713,0.00050080376,0.00027984,0.000057395126,0.00017219795,0.00010997853,0.025677696,0.0069846944,0.8082951,0.0051740566,0.1526678],"study_design_scores_gemma":[0.000016958305,0.000049773927,0.00033013508,0.000068973895,0.000020089283,0.00026493907,0.00004266287,0.09234655,0.0034769236,0.88282764,0.02051156,0.00004387083],"about_ca_topic_score_codex":0.00093261024,"about_ca_topic_score_gemma":0.0006363437,"teacher_disagreement_score":0.0026337712,"about_ca_system_score_codex":0.0005720543,"about_ca_system_score_gemma":0.0008226771,"threshold_uncertainty_score":0.008359134},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045092064,0.006296927,0.9848296,0.00010155216,0.00013816784,0.000021178805,0.000018691335,0.00026118773,0.0038235525],"genre_scores_gemma":[0.13575527,0.008590848,0.84800285,0.00017114547,0.0005010916,0.000117975615,0.00010212333,0.00024144772,0.006517252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998796,0.00032624093,0.00008446956,0.00013403184,0.0006164183,0.000042881864],"domain_scores_gemma":[0.9981,0.0011818956,0.00007420028,0.00021731257,0.0003903361,0.00003614326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001794581,0.0007483164,0.0008662719,0.0017538263,0.0003304733,0.0011257194,0.000817865,0.0010095773,0.0032955143],"category_scores_gemma":[0.0049593146,0.00031086558,0.00067000755,0.0013358161,0.0007360349,0.0019344534,0.0011885773,0.0011599322,0.0010299211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042551965,0.00010859006,0.00065712654,0.00062233064,0.00023133711,0.00006488885,0.0002277169,0.07475999,0.014500916,0.14591569,0.0031879267,0.75929797],"study_design_scores_gemma":[0.0000846235,0.00025204467,0.000888045,0.0001247777,0.00010845343,0.00051140663,0.00006851739,0.8771996,0.019424312,0.07236309,0.028853124,0.00012197351],"about_ca_topic_score_codex":0.0004991267,"about_ca_topic_score_gemma":0.0004361668,"teacher_disagreement_score":0.0032955143,"about_ca_system_score_codex":0.0004401407,"about_ca_system_score_gemma":0.00026843752,"threshold_uncertainty_score":0.011024594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04978355,0.0001313641,0.94894916,0.000061137885,0.000029817205,0.000010809256,0.00004846822,0.00026788772,0.00071795355],"genre_scores_gemma":[0.5008853,0.0007024583,0.49165577,0.000068625064,0.000073014584,0.000048905546,0.00037406484,0.00013962567,0.0060522384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978274,0.00004018243,0.000014569568,0.000041291525,0.00009229878,0.000028974464],"domain_scores_gemma":[0.99944276,0.00020046723,0.00007355216,0.00010935635,0.00015263795,0.00002122411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059594837,0.0004417386,0.00043045182,0.00054871506,0.00019011978,0.00053096813,0.0004363001,0.00063264224,0.0007644395],"category_scores_gemma":[0.0025227843,0.00023762033,0.00049397163,0.00036063438,0.0005707942,0.0011495419,0.00081520126,0.0005722416,0.0004907973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005340375,0.00011724793,0.0013605234,0.00020704619,0.000103515835,0.0002302694,0.00022024635,0.22341068,0.34695202,0.035538953,0.0015235192,0.38980195],"study_design_scores_gemma":[0.00002383645,0.00005479287,0.0017049105,0.000016192971,0.000021236314,0.00018841759,0.000030558655,0.8639206,0.114898294,0.016706593,0.0023942287,0.00004036275],"about_ca_topic_score_codex":0.0006672159,"about_ca_topic_score_gemma":0.0007358624,"teacher_disagreement_score":0.0007644395,"about_ca_system_score_codex":0.00026942394,"about_ca_system_score_gemma":0.00056447077,"threshold_uncertainty_score":0.0031516552},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020965002,0.00008184215,0.9967541,0.00004935391,0.000045463137,0.000023247818,0.000019784091,0.0003309825,0.00059867237],"genre_scores_gemma":[0.115987666,0.00012534272,0.8795152,0.000103402956,0.000052857304,0.00019693936,0.00011218549,0.00007039033,0.0038360616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991303,0.00023151933,0.00006896841,0.0001568136,0.0003453621,0.00006696005],"domain_scores_gemma":[0.9982157,0.00072146894,0.00014004625,0.0003990494,0.00044992345,0.00007384566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001061761,0.00058115454,0.00078039576,0.0008680927,0.0005331079,0.0008145191,0.0011854401,0.0009786371,0.0045019044],"category_scores_gemma":[0.005277112,0.0003728244,0.0005178869,0.0010030646,0.00058096735,0.0011027965,0.0011002923,0.0013312522,0.0015626507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008501715,0.00021926648,0.001818435,0.00021715654,0.00015321025,0.000121496705,0.00013381064,0.09366091,0.06897877,0.04468227,0.005468893,0.7836956],"study_design_scores_gemma":[0.000101883066,0.000115004135,0.0007845148,0.000018836769,0.00003968282,0.00034299272,0.000017416894,0.9342152,0.04391905,0.012031895,0.008364149,0.000049350572],"about_ca_topic_score_codex":0.0014402356,"about_ca_topic_score_gemma":0.0022448099,"teacher_disagreement_score":0.0045019044,"about_ca_system_score_codex":0.00045243162,"about_ca_system_score_gemma":0.0017020935,"threshold_uncertainty_score":0.015060365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072343466,0.00008465244,0.9906346,0.00006684837,0.00002158179,0.000026728043,0.0000141683495,0.0003684295,0.0015485662],"genre_scores_gemma":[0.20299605,0.00018210347,0.7924573,0.00008278342,0.00003385025,0.0002130683,0.000082821796,0.00028472967,0.0036673138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995278,0.00022763455,0.000016166287,0.000057396453,0.00014007009,0.00003085397],"domain_scores_gemma":[0.99913126,0.0005454158,0.000071891176,0.00011384229,0.00011509857,0.000022470022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093962776,0.000677764,0.0008655945,0.0006881049,0.00048802645,0.00067224103,0.00064230926,0.0011346153,0.0014686413],"category_scores_gemma":[0.0031320564,0.0005089697,0.0008419485,0.00078466034,0.00092586677,0.0007486291,0.00072078616,0.00092520635,0.0005114173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006135661,0.000032209806,0.0001574875,0.000040531624,0.000041650557,0.00003358069,0.00007637134,0.93584096,0.006349768,0.026646627,0.0006409128,0.030078562],"study_design_scores_gemma":[0.0000024278654,0.0000041390103,0.000027955022,0.0000014413353,0.0000018122154,0.000003858122,0.0000011467384,0.99688846,0.0009232798,0.0018724564,0.0002692494,0.0000038318203],"about_ca_topic_score_codex":0.003816136,"about_ca_topic_score_gemma":0.0034996867,"teacher_disagreement_score":0.003816136,"about_ca_system_score_codex":0.0009896938,"about_ca_system_score_gemma":0.001145246,"threshold_uncertainty_score":0.00758785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013392577,0.0003034125,0.9854996,0.00004801237,0.00003616002,0.000011330049,0.000022617187,0.0001921255,0.00049410964],"genre_scores_gemma":[0.16731682,0.00062456983,0.8296684,0.00009880321,0.00009989696,0.00004584101,0.00015894689,0.00007192921,0.0019147585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992939,0.00017758274,0.000047612637,0.00019755152,0.00024320162,0.000040058698],"domain_scores_gemma":[0.99925584,0.00037632653,0.00009475959,0.00011754632,0.00012504724,0.00003047546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006123372,0.00091182103,0.001064601,0.0007872634,0.00041708114,0.0006744077,0.00068365614,0.0010601539,0.00080621155],"category_scores_gemma":[0.0022461675,0.00040488984,0.0006543498,0.0006295381,0.0007126443,0.0016568634,0.0012011457,0.0008903531,0.0006963272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066909875,0.00014792761,0.00082879106,0.00039746967,0.00018656926,0.0002484643,0.000283084,0.10580464,0.26385608,0.02035054,0.0012632194,0.6059641],"study_design_scores_gemma":[0.000063987914,0.00021571714,0.0009990706,0.000032929514,0.00008726664,0.00067267916,0.00007487411,0.8037097,0.16820785,0.018852182,0.006997546,0.00008619305],"about_ca_topic_score_codex":0.0005814933,"about_ca_topic_score_gemma":0.0007930736,"teacher_disagreement_score":0.001064601,"about_ca_system_score_codex":0.00027540277,"about_ca_system_score_gemma":0.00062952336,"threshold_uncertainty_score":0.00323838},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44167233,0.0057336553,0.5390074,0.000847754,0.0006472741,0.00060022186,0.0011170185,0.005582699,0.0047916723],"genre_scores_gemma":[0.5497036,0.0020198736,0.44156688,0.00018101651,0.00026070906,0.00033087906,0.0029000426,0.00037763797,0.0026593816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964922,0.0008202691,0.00043569086,0.0004313868,0.001593913,0.00022648399],"domain_scores_gemma":[0.98846847,0.00644941,0.00060880574,0.0011293394,0.0031788463,0.00016511868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042121406,0.0013240561,0.0012725488,0.0030280366,0.00049115386,0.0013417962,0.00093218865,0.0011324115,0.0014842813],"category_scores_gemma":[0.018635426,0.00022658274,0.0008627076,0.0017780886,0.00042198884,0.0018646696,0.000708657,0.0011205908,0.001423952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016024414,0.00063047884,0.006548937,0.00064820977,0.00047794936,0.00011109112,0.00018906122,0.050491977,0.047571074,0.0013753782,0.0038134258,0.88654],"study_design_scores_gemma":[0.00017473337,0.0021005012,0.023463463,0.00014136892,0.0003291609,0.0006466769,0.00037245767,0.7950608,0.16780412,0.0026338988,0.007106585,0.000166179],"about_ca_topic_score_codex":0.0011338552,"about_ca_topic_score_gemma":0.0014273402,"teacher_disagreement_score":0.0042121406,"about_ca_system_score_codex":0.00042397203,"about_ca_system_score_gemma":0.0006033105,"threshold_uncertainty_score":0.022276223},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042703166,0.000028317574,0.9943482,0.000029450954,0.000024435403,0.000018702962,0.000023935258,0.00044818307,0.000808437],"genre_scores_gemma":[0.08704176,0.00020033406,0.9105526,0.00004195439,0.00003864658,0.00009996914,0.00017858788,0.00016160558,0.0016845382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997156,0.000056463618,0.000015709404,0.000039140385,0.00015804866,0.00001499518],"domain_scores_gemma":[0.999524,0.00027254684,0.000035060595,0.000075653355,0.00008134452,0.000011389784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044137723,0.00041614682,0.00041233265,0.00044658262,0.00029765096,0.0004060318,0.00041763295,0.0004621518,0.002811995],"category_scores_gemma":[0.002453589,0.0001952937,0.00030888885,0.0004237167,0.00043196243,0.00088741083,0.00042377747,0.0005372416,0.0012807869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039177947,0.00010274161,0.0009515866,0.00028633338,0.000062776,0.00040122593,0.00023311572,0.20061882,0.14081647,0.10783221,0.005447075,0.5428559],"study_design_scores_gemma":[0.00004180787,0.000058355636,0.0003762375,0.000019973619,0.000009439397,0.00032706695,0.00001713517,0.916701,0.053620193,0.022431144,0.006372426,0.000025289626],"about_ca_topic_score_codex":0.0008078499,"about_ca_topic_score_gemma":0.00070652814,"teacher_disagreement_score":0.002811995,"about_ca_system_score_codex":0.00020389554,"about_ca_system_score_gemma":0.00046950634,"threshold_uncertainty_score":0.009407043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025057844,0.0002161342,0.9967033,0.00007219257,0.000021658534,0.000031539865,0.000050958493,0.00014578892,0.0002525682],"genre_scores_gemma":[0.08051349,0.00035257274,0.91724116,0.000109665314,0.00010833497,0.000299109,0.00039415256,0.0002531644,0.00072827924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970893,0.0009289918,0.00027889296,0.0005070309,0.0010955211,0.00010022869],"domain_scores_gemma":[0.9959008,0.0016499201,0.0006424216,0.0005812786,0.0011115527,0.000114010174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004244607,0.0013549763,0.0012542312,0.0030836524,0.00082418876,0.0015638652,0.0015332702,0.0016802729,0.0009752909],"category_scores_gemma":[0.012673908,0.00058110134,0.0010874397,0.001948179,0.0021588646,0.0017775384,0.0015394673,0.0020091303,0.000783329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035149485,0.00013976233,0.003184026,0.0006633027,0.0003926619,0.00047694414,0.00034077663,0.26895645,0.12531905,0.11687616,0.0048017837,0.47849756],"study_design_scores_gemma":[0.000021633901,0.00026360364,0.0057149683,0.00009000597,0.00009735622,0.00061880524,0.00005467495,0.87228304,0.046133347,0.06383913,0.010684239,0.00019914513],"about_ca_topic_score_codex":0.0011672977,"about_ca_topic_score_gemma":0.0013572294,"teacher_disagreement_score":0.004244607,"about_ca_system_score_codex":0.000990355,"about_ca_system_score_gemma":0.0019181946,"threshold_uncertainty_score":0.022447944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010712451,0.00005461407,0.99840575,0.00009166709,0.000009376214,0.0000067881338,0.000016185604,0.000048262198,0.00029612827],"genre_scores_gemma":[0.2772577,0.00078684493,0.7183665,0.00037255118,0.00029522818,0.00020486771,0.00025072336,0.0000777613,0.0023878173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998204,0.00066714897,0.00007626462,0.00026276903,0.00066833023,0.000121480174],"domain_scores_gemma":[0.9949921,0.0035998523,0.0003791874,0.00050166575,0.00046038593,0.000066915876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028140468,0.0007829119,0.0011858371,0.0008548212,0.00068549655,0.0014209158,0.0019243447,0.001113201,0.0016265064],"category_scores_gemma":[0.013788379,0.0007903463,0.0009000268,0.0012428535,0.0015691186,0.002189248,0.0018640272,0.0019884307,0.00060686877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012771192,0.000059166334,0.000977045,0.0001641639,0.00011986537,0.00010951672,0.00010895884,0.71203715,0.0029913592,0.17406388,0.0016330592,0.107608095],"study_design_scores_gemma":[0.000020051733,0.000017306525,0.00008612568,0.000007843137,0.000012637718,0.000036858775,0.000004291549,0.94575506,0.00092909794,0.05243057,0.0006885955,0.0000116207575],"about_ca_topic_score_codex":0.0025560572,"about_ca_topic_score_gemma":0.0031039566,"teacher_disagreement_score":0.0028140468,"about_ca_system_score_codex":0.0007625275,"about_ca_system_score_gemma":0.0023381317,"threshold_uncertainty_score":0.0148822665},"labels":[],"label_agreement":null},{"id":"W2171668918","doi":"10.1109/tsp.2014.2313525","title":"Reduced Mean-Square Error Quadratic Inverse Spectrum Estimator","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Multitaper; Estimator; Mathematics; Minimum-variance unbiased estimator; Mean squared error; Efficient estimator; Bias of an estimator; Minimax estimator; Minimum mean square error; Invariant estimator; Statistics; Applied mathematics","score_opus":0.027792805302288507,"score_gpt":0.28138732027543556,"score_spread":0.25359451497314706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171668918","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023602522,0.00014110957,0.9966275,0.000034926,0.000031596046,0.000012348987,0.00002081146,0.0001736699,0.0005978575],"genre_scores_gemma":[0.19846404,0.0004940762,0.7950243,0.00017453282,0.00014537218,0.000111119174,0.000335409,0.00016764292,0.005083517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982778,0.00031319243,0.000073918316,0.00026029622,0.0009901458,0.000084721585],"domain_scores_gemma":[0.997891,0.00073934015,0.00021920052,0.00027590248,0.00082708255,0.00004735117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014735395,0.0006152094,0.0008877512,0.00070007466,0.00027952524,0.0009945352,0.0014829343,0.00093326136,0.0017958713],"category_scores_gemma":[0.005839548,0.00036732855,0.0004798938,0.0006526218,0.0005044405,0.0017391002,0.001026608,0.0012328358,0.0010260463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032885565,0.0001873863,0.003042314,0.0004391678,0.00017622665,0.00022654745,0.0001608944,0.2642895,0.07319193,0.0528109,0.005849309,0.5992969],"study_design_scores_gemma":[0.000016527438,0.000064124186,0.00059799134,0.000017362367,0.00002046647,0.00020640579,0.000012455247,0.97916013,0.011653523,0.0044744406,0.0037490872,0.000027433616],"about_ca_topic_score_codex":0.0009085144,"about_ca_topic_score_gemma":0.0011830701,"teacher_disagreement_score":0.0017958713,"about_ca_system_score_codex":0.00045513018,"about_ca_system_score_gemma":0.0008760668,"threshold_uncertainty_score":0.0077929497},"labels":[],"label_agreement":null},{"id":"W2172065902","doi":"10.1109/tsp.2004.831067","title":"Stochastic correlative learning algorithms","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Algorithm; Convergence (economics); Correlative; Artificial intelligence; Basis (linear algebra); Machine learning; Mathematics","score_opus":0.021916848103083614,"score_gpt":0.27479705637676777,"score_spread":0.2528802082736842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172065902","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020095923,0.00024599623,0.99612576,0.00012333329,0.00003955669,0.000021323607,0.000021314987,0.00012699566,0.0012862524],"genre_scores_gemma":[0.3368964,0.0014270269,0.6522353,0.0006220951,0.00034025265,0.0005129956,0.00032994995,0.00015546089,0.0074804667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984041,0.0005535707,0.00009635349,0.0002794515,0.00054272363,0.00012381935],"domain_scores_gemma":[0.9943341,0.0036821545,0.0004388546,0.00052126084,0.0009121758,0.000111524416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038162684,0.000851044,0.0013959276,0.001267889,0.00063953723,0.0018279562,0.0020086295,0.0018545972,0.0023766963],"category_scores_gemma":[0.012986281,0.0005592289,0.00070704037,0.0016234963,0.0016027251,0.0020383543,0.0021801486,0.002050558,0.0008345839],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000455855,0.00005126469,0.0007638247,0.00009265829,0.000072692055,0.00004972025,0.000050277606,0.663111,0.00085614977,0.20813377,0.002002618,0.12477044],"study_design_scores_gemma":[0.0000059637127,0.0000130933995,0.000058102414,0.0000095164705,0.000004300272,0.000020218182,0.000003615988,0.967442,0.00035784513,0.030990018,0.0010883991,0.000007018639],"about_ca_topic_score_codex":0.0019435541,"about_ca_topic_score_gemma":0.0015401805,"teacher_disagreement_score":0.0038162684,"about_ca_system_score_codex":0.0011104568,"about_ca_system_score_gemma":0.001577634,"threshold_uncertainty_score":0.02018255},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027354179,0.0002954895,0.96887803,0.00016764768,0.0001539367,0.00007746618,0.00018396278,0.0013826512,0.0015066214],"genre_scores_gemma":[0.16132496,0.0006997577,0.83132106,0.00018170814,0.00018379168,0.00010462651,0.0010418914,0.00012038913,0.0050218403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949276,0.000060131308,0.000030391366,0.00010684496,0.00025546117,0.000054456636],"domain_scores_gemma":[0.99925655,0.00020205198,0.00008891893,0.00011322204,0.00030751477,0.000031667252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042163618,0.0007830006,0.0007258104,0.0014865247,0.00028080816,0.0008072786,0.00060565677,0.0006534499,0.001969179],"category_scores_gemma":[0.0015340727,0.0002706618,0.0005956889,0.0016732805,0.00032330948,0.0009522657,0.0004002204,0.00072459236,0.0022720129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001909497,0.00012558857,0.0012226264,0.00013830615,0.000032878357,0.00014426345,0.000054981865,0.018036908,0.1310523,0.0023687754,0.0036441043,0.8429883],"study_design_scores_gemma":[0.000037518916,0.00021803437,0.0044849375,0.00002442185,0.0000352465,0.0006992294,0.00005732464,0.8710185,0.11349596,0.0022753966,0.0076066474,0.000046712554],"about_ca_topic_score_codex":0.0016240444,"about_ca_topic_score_gemma":0.0024226718,"teacher_disagreement_score":0.001969179,"about_ca_system_score_codex":0.00019696874,"about_ca_system_score_gemma":0.00056826574,"threshold_uncertainty_score":0.006587565},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049562906,0.00074588513,0.99174714,0.00017156191,0.000108455235,0.0000759335,0.00024804423,0.001204448,0.00074221054],"genre_scores_gemma":[0.14420241,0.0019697016,0.84528804,0.0002031935,0.0006529661,0.0005172192,0.0025177978,0.0003679873,0.004280746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975942,0.000748733,0.00016015564,0.00068333757,0.0005975942,0.00021596068],"domain_scores_gemma":[0.99624157,0.00205109,0.00030445063,0.0004685587,0.0008376566,0.00009670472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024969238,0.0015345081,0.0014867081,0.0059141745,0.00094314513,0.0022599697,0.0013852608,0.0016733373,0.0017486163],"category_scores_gemma":[0.010972667,0.00063938944,0.0015198657,0.0052279467,0.0008416894,0.002580347,0.0015156087,0.0021773041,0.0025741728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052928634,0.00020674382,0.004313415,0.00044615523,0.00048277492,0.00044392596,0.0006608474,0.05040675,0.030996932,0.03188308,0.020710427,0.8589197],"study_design_scores_gemma":[0.00006392966,0.00007984923,0.0039396174,0.00005949711,0.0001243137,0.00043365397,0.00016759199,0.9160525,0.015309889,0.04878874,0.01486247,0.00011781925],"about_ca_topic_score_codex":0.004347832,"about_ca_topic_score_gemma":0.0029147589,"teacher_disagreement_score":0.0059141745,"about_ca_system_score_codex":0.0005965329,"about_ca_system_score_gemma":0.001554114,"threshold_uncertainty_score":0.013205171},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007089968,0.00006743393,0.9690645,0.000075323835,0.00008350049,0.00010010231,0.00031753915,0.020111877,0.0030896452],"genre_scores_gemma":[0.07192222,0.00007410695,0.9135816,0.00017116034,0.000067545254,0.0002733231,0.00075129274,0.0019729594,0.011185766],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916875,0.0001688687,0.000051521252,0.000180383,0.000334816,0.00009562251],"domain_scores_gemma":[0.9977526,0.0005558224,0.00013335852,0.00082053896,0.0006491753,0.00008848106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008734297,0.0015525883,0.0009944172,0.0015326397,0.0012909749,0.0012322213,0.0019814577,0.001913008,0.04132304],"category_scores_gemma":[0.005387776,0.0005949428,0.0006901175,0.0010851683,0.00037818137,0.0021292698,0.0022765324,0.0011433836,0.022827087],"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.00096895406,0.00019096256,0.0011021879,0.0001427958,0.000059479837,0.00024512224,0.00014362359,0.0034349507,0.08027947,0.003943181,0.015498557,0.8939907],"study_design_scores_gemma":[0.00019417374,0.000488597,0.0061861835,0.00007737138,0.000114930626,0.0020581812,0.00020662985,0.34161583,0.5877775,0.008710437,0.052353192,0.00021690587],"about_ca_topic_score_codex":0.00094464334,"about_ca_topic_score_gemma":0.002080434,"teacher_disagreement_score":0.04132304,"about_ca_system_score_codex":0.00031115496,"about_ca_system_score_gemma":0.0007514299,"threshold_uncertainty_score":0.13823932},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043267864,0.00026716464,0.994696,0.00004107654,0.000010306546,0.00001135551,0.000009809753,0.00008722174,0.0005502174],"genre_scores_gemma":[0.33417782,0.0023063815,0.6598776,0.00008516245,0.0001488365,0.00014296004,0.00012083162,0.00008732057,0.003053075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994087,0.0002269037,0.000027416745,0.0001026046,0.00018845023,0.000045842302],"domain_scores_gemma":[0.9987863,0.0006326896,0.00009643654,0.00023377393,0.00023306292,0.000017799744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011341976,0.0005680854,0.00069864804,0.00036558512,0.00020782501,0.00053406303,0.0005559187,0.0006486616,0.0010199007],"category_scores_gemma":[0.0044005746,0.00025642023,0.00041679118,0.000642443,0.00075672555,0.0011247032,0.0007736982,0.0009042288,0.00045317513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009108502,0.000048005575,0.00059977826,0.00018895067,0.00007723624,0.000047246584,0.00011316251,0.60279375,0.019189904,0.09748918,0.0011719303,0.27818975],"study_design_scores_gemma":[0.0000044515987,0.000033897206,0.00015565615,0.0000082752,0.000007106569,0.00004886181,0.000006478786,0.9861675,0.0033840847,0.009196396,0.0009749822,0.000012303043],"about_ca_topic_score_codex":0.0013427032,"about_ca_topic_score_gemma":0.0010134764,"teacher_disagreement_score":0.0013427032,"about_ca_system_score_codex":0.00039394214,"about_ca_system_score_gemma":0.00066323485,"threshold_uncertainty_score":0.0059983134},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023595449,0.00006703233,0.9965431,0.00006579338,0.000017128008,0.000007924984,0.00002907466,0.00010752676,0.00080279965],"genre_scores_gemma":[0.08692609,0.00023655874,0.9074536,0.000112420006,0.000049279544,0.00006689936,0.00016933958,0.00012932296,0.0048565464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993568,0.00021478173,0.0000355755,0.00010074108,0.00025314398,0.000038863636],"domain_scores_gemma":[0.99937445,0.00020193151,0.00004982099,0.00011477327,0.00021292044,0.000046227324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010276247,0.000548765,0.000764638,0.00046157022,0.00027255036,0.0005987709,0.00081647706,0.0008846207,0.001683655],"category_scores_gemma":[0.0017488045,0.00030135413,0.0006964848,0.0004921298,0.000882001,0.0009877684,0.0012899381,0.0010119322,0.0008361625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025780892,0.00006011649,0.0004466852,0.00027322993,0.00011666173,0.00014930229,0.00015909449,0.59928006,0.052615054,0.15282422,0.007033661,0.18678407],"study_design_scores_gemma":[0.000009515,0.000024948931,0.00008471501,0.0000060854363,0.000004545965,0.000053429594,0.0000050092867,0.9799749,0.006230094,0.010979374,0.0026117538,0.000015578225],"about_ca_topic_score_codex":0.0018855525,"about_ca_topic_score_gemma":0.0017385463,"teacher_disagreement_score":0.0018855525,"about_ca_system_score_codex":0.00048672192,"about_ca_system_score_gemma":0.001065901,"threshold_uncertainty_score":0.0056324005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006532855,0.016494898,0.9214904,0.008669306,0.0011857336,0.000057367484,0.00023282318,0.0015510101,0.043785624],"genre_scores_gemma":[0.5378939,0.039195973,0.33890226,0.005907557,0.002494814,0.00031295742,0.0006322052,0.001254292,0.0734061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999648,0.00007085941,0.000010958494,0.000088000896,0.00016227865,0.00001987039],"domain_scores_gemma":[0.9994474,0.00025578187,0.00004406259,0.000103733764,0.00012083813,0.00002823356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000667491,0.0012355649,0.0006830749,0.0007465282,0.00036490112,0.0017186481,0.0023382006,0.002616566,0.0030821692],"category_scores_gemma":[0.00270261,0.00054504385,0.00039992176,0.0007635131,0.0013616204,0.004391046,0.001197157,0.0025088596,0.0015186822],"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.00012286815,0.00007510737,0.001098195,0.0003045433,0.00005765737,0.00042549538,0.00026996795,0.29553577,0.010212697,0.42396715,0.042181913,0.22574857],"study_design_scores_gemma":[0.000015422092,0.00004763808,0.00031667008,0.00018786735,0.000024703284,0.0003499443,0.00006819546,0.7021933,0.0032488566,0.20235093,0.0911421,0.00005439848],"about_ca_topic_score_codex":0.0033986177,"about_ca_topic_score_gemma":0.0016718275,"teacher_disagreement_score":0.0033986177,"about_ca_system_score_codex":0.0011764521,"about_ca_system_score_gemma":0.0007119285,"threshold_uncertainty_score":0.010310829},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015042342,0.00017771737,0.9970298,0.00008570557,0.000056085642,0.000024660074,0.000025685153,0.00028425868,0.0008119275],"genre_scores_gemma":[0.051505987,0.00029938182,0.9430698,0.00016924173,0.00023980117,0.00019903627,0.00022713211,0.00010586383,0.0041838386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991242,0.00016473052,0.00005568679,0.00021004493,0.00037431883,0.00007096806],"domain_scores_gemma":[0.99931586,0.00021006439,0.00006769443,0.00008809733,0.00028300835,0.000035286772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010145844,0.0013353812,0.0013186026,0.0015919905,0.00073827064,0.0014175699,0.0015264411,0.0016732392,0.004090977],"category_scores_gemma":[0.0021687772,0.0004728353,0.0012153393,0.0013812201,0.0011553103,0.0021410713,0.001660065,0.0023342916,0.0020990698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035684105,0.00013428893,0.00049754593,0.00018164354,0.0001366121,0.00012559062,0.00010842418,0.22758949,0.034462705,0.043369334,0.0078882305,0.6851493],"study_design_scores_gemma":[0.00002616447,0.00004398555,0.0001338882,0.000010103573,0.000014933522,0.00011704941,0.0000068644135,0.98392695,0.005712451,0.006483882,0.0035051322,0.000018685285],"about_ca_topic_score_codex":0.0017789655,"about_ca_topic_score_gemma":0.001597171,"teacher_disagreement_score":0.004090977,"about_ca_system_score_codex":0.0010040624,"about_ca_system_score_gemma":0.0014459444,"threshold_uncertainty_score":0.013685644},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041904873,0.00019045814,0.994764,0.00013870458,0.000020088677,0.000016368482,0.000039881554,0.000049325314,0.0005907269],"genre_scores_gemma":[0.503508,0.0011238123,0.49223283,0.00031836823,0.0003225111,0.00023788928,0.0002298638,0.000061287916,0.0019654308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984768,0.00057359703,0.00009522843,0.0002258163,0.00057772594,0.000050799925],"domain_scores_gemma":[0.9973036,0.0017236427,0.0003053594,0.00031232546,0.00029907137,0.000055980476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020731536,0.0011862981,0.00084145844,0.0017471603,0.00030023284,0.0015096609,0.0014210179,0.0011849011,0.0010493512],"category_scores_gemma":[0.0076456717,0.00043511554,0.0008199692,0.00088606024,0.0020633875,0.0035159613,0.0014051234,0.0011887827,0.00027632725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021812422,0.00019981111,0.0024820575,0.0003926545,0.00026288306,0.00032690002,0.00026685485,0.5979832,0.038012836,0.20739675,0.0013454151,0.15111254],"study_design_scores_gemma":[0.000009718241,0.00014764586,0.0010972925,0.000026627209,0.000031401727,0.00016167872,0.000038299797,0.91946584,0.004296189,0.0737869,0.00088342093,0.00005486899],"about_ca_topic_score_codex":0.000667401,"about_ca_topic_score_gemma":0.00045485544,"teacher_disagreement_score":0.0020731536,"about_ca_system_score_codex":0.0008614389,"about_ca_system_score_gemma":0.00055153423,"threshold_uncertainty_score":0.010964036},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009913356,0.00011356936,0.9884786,0.00003211097,0.000025332147,0.000037864123,0.00004404169,0.00041519848,0.0009398729],"genre_scores_gemma":[0.29064935,0.00067780906,0.7046867,0.000052189123,0.00008095854,0.00016870376,0.00065885176,0.0004117172,0.0026136928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876815,0.00024480518,0.00005142364,0.00020515466,0.00063634815,0.00009407483],"domain_scores_gemma":[0.9987664,0.0003884718,0.000100003,0.00014888175,0.0005559345,0.00004034926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012441422,0.0014669773,0.0006872343,0.0020111613,0.00045736082,0.0008655203,0.00062221865,0.0005190592,0.0028521505],"category_scores_gemma":[0.004027211,0.0003922528,0.0013283007,0.0015357257,0.0006845164,0.0017482036,0.0008570828,0.00094891054,0.00083557144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055101607,0.00015790324,0.0033378373,0.00036915796,0.00030941554,0.00021744872,0.0002731179,0.1500509,0.120769545,0.031668123,0.002603418,0.68969214],"study_design_scores_gemma":[0.00002082502,0.00009262174,0.0037492618,0.000023916478,0.00010030225,0.00012324311,0.000049454255,0.9405468,0.04240951,0.007897396,0.0049187825,0.00006792112],"about_ca_topic_score_codex":0.0027049694,"about_ca_topic_score_gemma":0.0021008993,"teacher_disagreement_score":0.0028521505,"about_ca_system_score_codex":0.00042453018,"about_ca_system_score_gemma":0.0008241837,"threshold_uncertainty_score":0.009541392},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008826195,0.00043304553,0.98259693,0.0000650585,0.00005406527,0.00007108684,0.00007485745,0.0033723866,0.0045063314],"genre_scores_gemma":[0.25210017,0.0005309353,0.74075264,0.00010245623,0.000062462495,0.00022947363,0.00044466095,0.00015804709,0.0056191357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999699,0.00006288711,0.000019817884,0.000066451175,0.00011215235,0.000039781316],"domain_scores_gemma":[0.99969983,0.00008205037,0.000022540064,0.000049708004,0.00013702888,0.000008902046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039932213,0.00090502814,0.00035388567,0.0007216498,0.00034333894,0.0007581519,0.00076847203,0.00045279707,0.0059165405],"category_scores_gemma":[0.00070042437,0.00026391455,0.00031527126,0.00054808,0.00021143733,0.00058699783,0.00025440514,0.00046972412,0.0017088164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048341294,0.00008563813,0.00106673,0.0003667689,0.00011186481,0.00025326814,0.00012551884,0.08185089,0.08480774,0.016685242,0.007187307,0.8069756],"study_design_scores_gemma":[0.00015817782,0.0006669844,0.0019019418,0.000086076834,0.00008873395,0.0009438859,0.000060570303,0.83302695,0.11252901,0.0048601003,0.045599148,0.00007838065],"about_ca_topic_score_codex":0.0029958142,"about_ca_topic_score_gemma":0.0032552858,"teacher_disagreement_score":0.0059165405,"about_ca_system_score_codex":0.0004841884,"about_ca_system_score_gemma":0.00079500343,"threshold_uncertainty_score":0.019792795},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051408834,0.00017989844,0.99335927,0.000034889043,0.000022402424,0.00001785508,0.000036328584,0.00076320756,0.00044520476],"genre_scores_gemma":[0.19250035,0.00061112386,0.8025228,0.000113883194,0.000098047516,0.00011821059,0.0006019606,0.0003574025,0.0030761813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992151,0.00022602899,0.000035608165,0.0001975872,0.00026883258,0.00005675617],"domain_scores_gemma":[0.9993319,0.0002951027,0.00006807127,0.0001307025,0.000149025,0.000025189976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070810714,0.001209869,0.0010410884,0.0010692852,0.00032913542,0.0006566015,0.0009970152,0.00091191573,0.0009828635],"category_scores_gemma":[0.0019260425,0.00038468023,0.0012220087,0.0011601417,0.00067904516,0.0013777576,0.00085917435,0.0011660246,0.0011959637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057228596,0.00012592645,0.0011511822,0.00030251226,0.00025360342,0.00035071158,0.00025572142,0.16424349,0.14225012,0.011212945,0.0031468885,0.67613465],"study_design_scores_gemma":[0.000016768545,0.00007222258,0.0008764669,0.000013032731,0.000036240857,0.00032248523,0.00003271027,0.9550391,0.035449933,0.005261252,0.002838805,0.000041068542],"about_ca_topic_score_codex":0.0022260288,"about_ca_topic_score_gemma":0.0023819096,"teacher_disagreement_score":0.0022260288,"about_ca_system_score_codex":0.0003352635,"about_ca_system_score_gemma":0.00071916,"threshold_uncertainty_score":0.0044261813},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010116345,0.00012736839,0.989101,0.000039504102,0.000021601547,0.000012934522,0.000019198325,0.0002478587,0.00031424084],"genre_scores_gemma":[0.33940047,0.00064842636,0.65736234,0.00006310298,0.00007515442,0.00010078867,0.00026313428,0.00014816443,0.0019383322],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99952924,0.00011344569,0.000032044023,0.00008004579,0.00021190687,0.000033418593],"domain_scores_gemma":[0.99907947,0.000448098,0.00014606654,0.00010244772,0.00019990743,0.000024124445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000594022,0.00088946236,0.00062948104,0.0011346375,0.0003608727,0.0006184313,0.00051485945,0.000691941,0.00067738787],"category_scores_gemma":[0.0027087876,0.0003434881,0.00072346075,0.0008911234,0.0007287348,0.0016131671,0.0010523103,0.00084095466,0.00048408203],"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.00055048737,0.000120745906,0.001667948,0.00032823364,0.00016288135,0.00036352134,0.00029271792,0.29945415,0.22431293,0.033511136,0.0018382693,0.43739706],"study_design_scores_gemma":[0.00002433165,0.000088713874,0.00058580225,0.000012708129,0.00001544817,0.00030225707,0.000017930772,0.9556703,0.03465159,0.007183776,0.0013943103,0.000052920757],"about_ca_topic_score_codex":0.0005414191,"about_ca_topic_score_gemma":0.00046848124,"teacher_disagreement_score":0.0011346375,"about_ca_system_score_codex":0.00033028747,"about_ca_system_score_gemma":0.0005690649,"threshold_uncertainty_score":0.0031415224},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47882906,0.0025883547,0.42101535,0.0010781002,0.00078892004,0.00076674024,0.0020358325,0.023283632,0.06961403],"genre_scores_gemma":[0.7107503,0.00078443583,0.2286027,0.0005109974,0.00015181494,0.00024347441,0.0013739786,0.00044148127,0.05714081],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965477,0.000023251741,0.000014713749,0.00008109729,0.00017598896,0.000050224815],"domain_scores_gemma":[0.9998234,0.000029253715,0.00003533976,0.000026755417,0.000058294536,0.000026935602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003605129,0.0005728744,0.00041278082,0.00070126797,0.00040972698,0.00081143784,0.0006769684,0.00062421797,0.0127136605],"category_scores_gemma":[0.00040282187,0.00020940734,0.00018741158,0.0005106394,0.00028494876,0.0005230438,0.00039638902,0.0005497767,0.005211795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048184447,0.00013934849,0.002303764,0.00017441217,0.00003994945,0.00019209432,0.00013674685,0.0023070022,0.8417663,0.004076455,0.005468966,0.14291306],"study_design_scores_gemma":[0.0001549858,0.0011171106,0.0072199684,0.00008549217,0.00008879873,0.0016809197,0.000066257504,0.030071538,0.8158165,0.0010395678,0.14257465,0.00008414042],"about_ca_topic_score_codex":0.0013602575,"about_ca_topic_score_gemma":0.0023559625,"teacher_disagreement_score":0.0127136605,"about_ca_system_score_codex":0.001016276,"about_ca_system_score_gemma":0.00072844286,"threshold_uncertainty_score":0.04253149},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020879788,0.00023392645,0.9761761,0.000071576746,0.00008248432,0.000045462984,0.00009505882,0.00060495344,0.0018106491],"genre_scores_gemma":[0.29497942,0.00065037224,0.69417423,0.00008884338,0.0001329334,0.00012297099,0.00058136566,0.00022415757,0.0090457965],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978524,0.00003857015,0.000012183488,0.000056766028,0.00008151724,0.000025789222],"domain_scores_gemma":[0.99967146,0.00009655588,0.000029898669,0.00009278146,0.00008745905,0.000021847272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019158176,0.00050863094,0.000479584,0.0006221419,0.00028835094,0.00041242366,0.00033764064,0.00029762345,0.0033910288],"category_scores_gemma":[0.00095614354,0.0002453971,0.00041322235,0.0006485073,0.0003171034,0.0006668621,0.00041630433,0.00055757817,0.0014116269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007696302,0.000116599615,0.0005509954,0.00012976775,0.000040137926,0.00009895568,0.000069823436,0.027055688,0.5311923,0.010931435,0.0023623207,0.42668232],"study_design_scores_gemma":[0.00007046522,0.00029013632,0.0036424461,0.000022092509,0.00007405101,0.0007055421,0.00005762617,0.66496503,0.3095967,0.0069141327,0.013596092,0.000065841734],"about_ca_topic_score_codex":0.001175471,"about_ca_topic_score_gemma":0.002026822,"teacher_disagreement_score":0.0033910288,"about_ca_system_score_codex":0.00020968147,"about_ca_system_score_gemma":0.000540703,"threshold_uncertainty_score":0.011344135},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006507902,0.000067391156,0.992997,0.000052465166,0.000011928485,0.00001604833,0.000028835253,0.00016245489,0.00015598317],"genre_scores_gemma":[0.11194455,0.00027113553,0.88631415,0.000037966856,0.000020955415,0.00008243757,0.00021696654,0.00010113271,0.0010106547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997427,0.00009094567,0.000024199813,0.000056076085,0.00006524934,0.000020932192],"domain_scores_gemma":[0.9995548,0.00015720299,0.0000858702,0.00006808379,0.0001065383,0.000027464797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008473308,0.0009030866,0.00045020122,0.0008956156,0.00026057966,0.0007242503,0.0006107745,0.00064816873,0.001353557],"category_scores_gemma":[0.0022752092,0.00024524692,0.0012455306,0.0008548701,0.0005692483,0.0011296979,0.00079947966,0.0007674555,0.00049339025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026369482,0.000113098075,0.0021716175,0.00034090475,0.0001639033,0.0003536151,0.0004084053,0.49612027,0.09144791,0.028875561,0.0021822522,0.3775588],"study_design_scores_gemma":[0.000005356004,0.00004166877,0.0004456102,0.000008543432,0.000013712846,0.00010422006,0.000023900786,0.98657787,0.008394988,0.003165496,0.0012005647,0.000018004066],"about_ca_topic_score_codex":0.00202663,"about_ca_topic_score_gemma":0.0018166404,"teacher_disagreement_score":0.00202663,"about_ca_system_score_codex":0.00035036745,"about_ca_system_score_gemma":0.00060301065,"threshold_uncertainty_score":0.0045281053},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020902524,0.00013352199,0.977716,0.0000913268,0.000017958651,0.00001497695,0.00006018743,0.00041170517,0.00065180496],"genre_scores_gemma":[0.52111256,0.0005092422,0.4753787,0.0000839237,0.00011833626,0.00009829703,0.0006144777,0.0002391361,0.0018454182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995945,0.00013120561,0.000032086722,0.000064976884,0.00013718572,0.000040085575],"domain_scores_gemma":[0.99737775,0.0020396253,0.00017868451,0.00014721965,0.00019048259,0.000066262546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014317783,0.00068790914,0.00080676406,0.001474548,0.00032102986,0.0013275607,0.00066042226,0.0008067257,0.0016837865],"category_scores_gemma":[0.009810229,0.0006457259,0.00075649447,0.0010407622,0.00043025694,0.001323572,0.0006415851,0.0011350926,0.00037553668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056589404,0.000041165036,0.002548839,0.000069416434,0.00009929042,0.00012399956,0.00005357614,0.8709863,0.002896814,0.040348973,0.0008893722,0.08188569],"study_design_scores_gemma":[0.0000037616792,0.000009273496,0.00033807877,0.0000039511897,0.0000043263517,0.00002186505,0.000006132734,0.98494565,0.00053039833,0.013913146,0.00021727869,0.000006138919],"about_ca_topic_score_codex":0.002132984,"about_ca_topic_score_gemma":0.002082076,"teacher_disagreement_score":0.002132984,"about_ca_system_score_codex":0.00048070258,"about_ca_system_score_gemma":0.0009647227,"threshold_uncertainty_score":0.007572055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012747887,0.00003428469,0.9862921,0.00014026392,0.000007157837,0.000010141168,0.000023922456,0.00010906589,0.00063524424],"genre_scores_gemma":[0.44156295,0.000395475,0.55340475,0.00012744794,0.000057660178,0.0001126532,0.00033064545,0.00012929826,0.0038791331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996623,0.00011735594,0.000013187407,0.000048603437,0.00013258877,0.000025944188],"domain_scores_gemma":[0.9989685,0.00055944244,0.00012224601,0.000091462476,0.0001892616,0.000069138994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013622838,0.00052649213,0.0005130329,0.00067029527,0.00039268646,0.00095999194,0.00075885805,0.0009887669,0.0010410496],"category_scores_gemma":[0.004487096,0.0004608773,0.00066852616,0.0005616326,0.0011779896,0.0016586737,0.001131163,0.0010648125,0.00041201498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014265555,0.00008574607,0.00191974,0.000087270644,0.00006516781,0.00017275204,0.00018434222,0.73707694,0.02449872,0.1295199,0.0014169321,0.10482977],"study_design_scores_gemma":[0.000009091678,0.00001097644,0.0002560567,0.000005135799,0.0000035842747,0.00005018147,0.00000713857,0.9855377,0.0018764378,0.011740729,0.00049007894,0.000012962079],"about_ca_topic_score_codex":0.0035962602,"about_ca_topic_score_gemma":0.0038062546,"teacher_disagreement_score":0.0035962602,"about_ca_system_score_codex":0.0006713063,"about_ca_system_score_gemma":0.00149316,"threshold_uncertainty_score":0.0072045326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089311565,0.0010795776,0.9962662,0.00015610586,0.000040051753,0.00001663983,0.000054845263,0.000088818786,0.0014047346],"genre_scores_gemma":[0.30975878,0.010430572,0.66660243,0.00031100048,0.00078961067,0.00070987974,0.00088905485,0.00030294468,0.010205734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989968,0.0004257309,0.00004781614,0.00014308163,0.00032899692,0.000057509857],"domain_scores_gemma":[0.9987204,0.0008452196,0.000105402614,0.00011924015,0.00018660542,0.000023181698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001544991,0.0011979794,0.00086284085,0.0012119365,0.00039558066,0.0013546544,0.0009013505,0.0011090355,0.0025041753],"category_scores_gemma":[0.0052482355,0.00033072388,0.0008748765,0.0016723952,0.0010365897,0.001235924,0.0010264843,0.002270675,0.00095582794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028552917,0.000017841905,0.00026797733,0.0002559971,0.000066430395,0.00011060065,0.00011882296,0.37204865,0.0030802083,0.54856044,0.0029514346,0.07249299],"study_design_scores_gemma":[0.0000031074871,0.000010056944,0.000117715535,0.000022816324,0.000009045205,0.000027517173,0.000011228548,0.8721721,0.0004475332,0.12256039,0.004605725,0.000012700577],"about_ca_topic_score_codex":0.0033393565,"about_ca_topic_score_gemma":0.0019068415,"teacher_disagreement_score":0.0033393565,"about_ca_system_score_codex":0.00093578687,"about_ca_system_score_gemma":0.0011231365,"threshold_uncertainty_score":0.008377254},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02900738,0.0054068468,0.9557721,0.004750291,0.0005666016,0.000035482946,0.0004699165,0.00094436074,0.003047104],"genre_scores_gemma":[0.62965065,0.009025824,0.3528769,0.0014312724,0.0016705501,0.00015024022,0.0014450286,0.0014685252,0.0022809934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98671144,0.006770052,0.0010265709,0.0018488604,0.0032091266,0.00043403995],"domain_scores_gemma":[0.8582774,0.09896245,0.01090438,0.018128958,0.013116478,0.0006104428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02485757,0.001412598,0.0018720609,0.0028191188,0.0005899784,0.0033088229,0.0018319861,0.0035123727,0.002239671],"category_scores_gemma":[0.19499263,0.0011391812,0.0011256968,0.0028032202,0.0031189867,0.008185889,0.0015815896,0.002349374,0.0021056333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063625275,0.0001603404,0.04146837,0.001394693,0.0013551249,0.0003638701,0.0006250024,0.14525841,0.011895135,0.10686868,0.01605722,0.67391694],"study_design_scores_gemma":[0.00016755934,0.00040891688,0.028272523,0.0009332471,0.0005081441,0.0011881517,0.0007947911,0.58896226,0.028294938,0.3209377,0.029054381,0.00047733128],"about_ca_topic_score_codex":0.001655378,"about_ca_topic_score_gemma":0.0011441953,"teacher_disagreement_score":0.02485757,"about_ca_system_score_codex":0.0007380363,"about_ca_system_score_gemma":0.001051116,"threshold_uncertainty_score":0.13146096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023103906,0.0011104797,0.99040294,0.00026266885,0.000056391633,0.000016674949,0.000040681378,0.00012271293,0.0056770197],"genre_scores_gemma":[0.33928168,0.0097023435,0.6227559,0.0011758206,0.001364871,0.00048775284,0.00049816753,0.00040908388,0.024324404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882585,0.00028786415,0.000044053253,0.00014261334,0.0005992811,0.000100275596],"domain_scores_gemma":[0.99696666,0.0019598233,0.00025682684,0.00027429513,0.0004661147,0.000076287426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017852724,0.0010972808,0.00081521604,0.0012767111,0.0007055905,0.0015007127,0.0011168023,0.0011900436,0.003689332],"category_scores_gemma":[0.0055318535,0.00055799045,0.00061358855,0.0015007842,0.0030106422,0.0023662793,0.0018062452,0.002195438,0.00194278],"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.000089537534,0.00006524918,0.000322625,0.00034944844,0.000054552995,0.00012612542,0.00027528525,0.11363461,0.008192074,0.69698673,0.010888308,0.16901556],"study_design_scores_gemma":[0.000020194448,0.00008488576,0.00021568494,0.0000777211,0.000019741681,0.0002632548,0.00006749977,0.6013686,0.0057391855,0.38041115,0.0116661545,0.00006585004],"about_ca_topic_score_codex":0.00095552026,"about_ca_topic_score_gemma":0.00094069325,"teacher_disagreement_score":0.003689332,"about_ca_system_score_codex":0.00072476186,"about_ca_system_score_gemma":0.0008191695,"threshold_uncertainty_score":0.012341976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004527366,0.00020755117,0.99398005,0.00008551058,0.000055318666,0.000024760147,0.000073704534,0.000262905,0.00078281574],"genre_scores_gemma":[0.079779096,0.0012108878,0.9123311,0.00015792376,0.00012733584,0.0001242301,0.0007986629,0.00020932913,0.0052614673],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996594,0.00008630514,0.00003206391,0.00006559515,0.00013403274,0.000022569204],"domain_scores_gemma":[0.99937373,0.00026128147,0.00008736931,0.00014310573,0.00011553533,0.000019048184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006278669,0.0008063767,0.00039678943,0.00073115213,0.00022038099,0.0006818456,0.0005457433,0.00087747996,0.0041456255],"category_scores_gemma":[0.0029864146,0.00022611118,0.0005332952,0.0015213528,0.0005229152,0.0013870721,0.0006389216,0.0011068096,0.0016017456],"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.00019932125,0.00006983255,0.00044946963,0.000306303,0.000047978003,0.00022062873,0.00014526855,0.08506735,0.07062574,0.052643098,0.0050739963,0.7851509],"study_design_scores_gemma":[0.00002257383,0.00012918157,0.0008577138,0.000051935727,0.00002437598,0.00046616088,0.000039637725,0.92463696,0.030361457,0.02564742,0.017729534,0.000033000237],"about_ca_topic_score_codex":0.001079395,"about_ca_topic_score_gemma":0.0014301451,"teacher_disagreement_score":0.0041456255,"about_ca_system_score_codex":0.00024361208,"about_ca_system_score_gemma":0.0004567043,"threshold_uncertainty_score":0.013868511},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072285067,0.00016884335,0.99178046,0.000057918536,0.000022537257,0.000011262134,0.000009390761,0.0002311555,0.00049005426],"genre_scores_gemma":[0.52751815,0.00055828894,0.46779293,0.00009576718,0.00008022653,0.00009504965,0.00008368094,0.00006584813,0.0037101004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996001,0.00011141339,0.000028533404,0.00006642825,0.00016358244,0.000029969386],"domain_scores_gemma":[0.99941444,0.000292193,0.000075239426,0.00006436047,0.00014222934,0.000011418519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068991294,0.000533961,0.0007229635,0.00051255926,0.00021364195,0.0004296211,0.00052741,0.0006765334,0.0006145545],"category_scores_gemma":[0.0021543158,0.00029646602,0.00056529726,0.00034325942,0.0005568667,0.0009765872,0.00065179943,0.0005748837,0.00022540365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002136815,0.00007797386,0.0012576844,0.00020103308,0.00018291497,0.0001583278,0.00016425674,0.6178662,0.061619908,0.024877189,0.0012800255,0.29210088],"study_design_scores_gemma":[0.00001385117,0.000023358061,0.00019651471,0.000005042039,0.000011660795,0.000044375767,0.000005427068,0.9914042,0.0050487616,0.0025985613,0.00063414674,0.000014084424],"about_ca_topic_score_codex":0.0016850196,"about_ca_topic_score_gemma":0.0016089045,"teacher_disagreement_score":0.0016850196,"about_ca_system_score_codex":0.0003653879,"about_ca_system_score_gemma":0.0005794366,"threshold_uncertainty_score":0.0036486387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031164128,0.00398222,0.9372674,0.0014243241,0.00029706376,0.00005393104,0.0003417677,0.00039422864,0.025074894],"genre_scores_gemma":[0.81585896,0.0073596425,0.16353044,0.001130219,0.0012499687,0.0004443989,0.00085621706,0.0006050676,0.008965094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99472976,0.0015198548,0.00025298298,0.00081423216,0.0018787704,0.00080439926],"domain_scores_gemma":[0.95956147,0.03318048,0.0014275466,0.0026990275,0.001944096,0.0011873791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072228857,0.0028869223,0.0020076595,0.004729992,0.0015934956,0.004362436,0.0029389635,0.0020846357,0.00489734],"category_scores_gemma":[0.046371628,0.0012481618,0.0014809564,0.0028019166,0.007668643,0.0092769405,0.009556781,0.008129756,0.0014266669],"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.0002850972,0.00007225138,0.0009201295,0.0002583306,0.00007486984,0.00025034373,0.00032484438,0.15619877,0.006305409,0.8022946,0.0026746565,0.030340755],"study_design_scores_gemma":[0.000014894922,0.00005686961,0.0005090668,0.00013849509,0.000023200806,0.00012365288,0.000046625646,0.55464786,0.0041692792,0.437706,0.0024824846,0.000081527316],"about_ca_topic_score_codex":0.0011253839,"about_ca_topic_score_gemma":0.0010435053,"teacher_disagreement_score":0.0072228857,"about_ca_system_score_codex":0.004085426,"about_ca_system_score_gemma":0.0011851562,"threshold_uncertainty_score":0.03819877},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013846639,0.00051927933,0.9827169,0.00016095625,0.000035192923,0.000019594445,0.00006111029,0.00006787115,0.0025724391],"genre_scores_gemma":[0.5370668,0.0024010774,0.4531471,0.0003927149,0.0002553652,0.00020270773,0.0004778089,0.00017150326,0.005884873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713457,0.000688386,0.00015248482,0.00052336615,0.0012690678,0.00023214999],"domain_scores_gemma":[0.9928872,0.003974775,0.00059923425,0.0007272521,0.0014810002,0.00033045802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028780592,0.0009859956,0.0010580664,0.0034653642,0.0007995459,0.0027789595,0.001674416,0.0012976798,0.0021480578],"category_scores_gemma":[0.014781054,0.0004256796,0.0006820754,0.002425009,0.0021259584,0.0038722923,0.0019129061,0.0020935563,0.0011003992],"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.00014279879,0.000033663557,0.0019721114,0.00016966024,0.0000628164,0.00029146648,0.00034777247,0.12201049,0.015970355,0.7697044,0.0016589089,0.0876355],"study_design_scores_gemma":[0.00000991182,0.00005779587,0.0016786275,0.000041285468,0.000016212629,0.0004450054,0.00008209507,0.66412544,0.0048810937,0.32293165,0.0056502675,0.00008053178],"about_ca_topic_score_codex":0.002202348,"about_ca_topic_score_gemma":0.0012472093,"teacher_disagreement_score":0.0034653642,"about_ca_system_score_codex":0.0015070079,"about_ca_system_score_gemma":0.0011781747,"threshold_uncertainty_score":0.015220821},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019204762,0.0016769143,0.9775808,0.00012090542,0.00005890976,0.000029655155,0.000017839777,0.0002642331,0.0010459496],"genre_scores_gemma":[0.4916086,0.0032547915,0.5026807,0.000114726485,0.0003117617,0.000074725824,0.000097696466,0.000045704863,0.001811313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995347,0.00016410845,0.000029472227,0.00008440411,0.00016823552,0.00001914423],"domain_scores_gemma":[0.9981388,0.0012241392,0.00015611631,0.00014797156,0.0003060103,0.000026941969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001100676,0.00084020296,0.0006339934,0.000976604,0.00020918404,0.0005181304,0.0004251575,0.0006945129,0.00053532317],"category_scores_gemma":[0.0036751358,0.00020098347,0.00041460095,0.0007944435,0.00055314094,0.0009919074,0.00027165067,0.00051915244,0.00033990186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017110838,0.0000882153,0.001876234,0.00022467715,0.00009974325,0.00011296679,0.000079064295,0.098435715,0.028974632,0.014269307,0.0009758144,0.85469264],"study_design_scores_gemma":[0.000010645579,0.00033724523,0.0024142582,0.000019389345,0.00004840894,0.00025552537,0.000022149788,0.96759427,0.014691533,0.011692742,0.002874108,0.000039697028],"about_ca_topic_score_codex":0.0005407087,"about_ca_topic_score_gemma":0.00063589023,"teacher_disagreement_score":0.001100676,"about_ca_system_score_codex":0.00016878692,"about_ca_system_score_gemma":0.00021875226,"threshold_uncertainty_score":0.0058209896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37402788,0.0011600873,0.6205502,0.0010582024,0.000040285842,0.00008041612,0.00042459188,0.0006052136,0.0020531882],"genre_scores_gemma":[0.85668856,0.0005616963,0.14080185,0.000061401464,0.000029122013,0.00004898102,0.00033469612,0.000050041246,0.0014236534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998486,0.000081373124,0.000006226257,0.000017491371,0.000027375343,0.000018910805],"domain_scores_gemma":[0.9994431,0.00030999898,0.000068607296,0.000058280366,0.000080019585,0.000039928203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010140003,0.00052277016,0.0003490439,0.0006358945,0.0002763549,0.0003375069,0.0003269693,0.00038012414,0.0004555388],"category_scores_gemma":[0.0020408041,0.00019396035,0.00046834504,0.00051995745,0.0004439701,0.0003001736,0.00078426267,0.0006553927,0.00009431644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067597616,0.00020285098,0.013430385,0.00020843983,0.0003056887,0.00095947215,0.00038404457,0.6693924,0.040142097,0.024771374,0.002315107,0.24721213],"study_design_scores_gemma":[0.00001156739,0.000033407763,0.003307962,0.0000069196194,0.000015869377,0.000100920624,0.00003106688,0.9826912,0.0026986995,0.010704743,0.00038730813,0.0000102979775],"about_ca_topic_score_codex":0.007945838,"about_ca_topic_score_gemma":0.0091733355,"teacher_disagreement_score":0.007945838,"about_ca_system_score_codex":0.0004917141,"about_ca_system_score_gemma":0.0005986074,"threshold_uncertainty_score":0.015799165},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005013492,0.00030437653,0.99351925,0.000024897574,0.000046356472,0.000019857935,0.0000662569,0.000596579,0.00040895736],"genre_scores_gemma":[0.20017983,0.0006993286,0.7961053,0.00009810385,0.00014518111,0.00015572213,0.0006123824,0.00035459892,0.0016495179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992105,0.0002226294,0.000065062646,0.00017942731,0.00027953988,0.000042855907],"domain_scores_gemma":[0.9979043,0.00081265706,0.00029968272,0.0002537221,0.0006780462,0.000051596297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009193413,0.0011365798,0.00060649985,0.0022523734,0.000284458,0.00079098484,0.0007335285,0.0006220719,0.0023995894],"category_scores_gemma":[0.004690661,0.00027814097,0.0007648916,0.0020481406,0.0003714451,0.0011775616,0.00057762413,0.0007650849,0.0012375861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045081254,0.000117778916,0.0046996353,0.000470074,0.0002803016,0.00034024313,0.00030476868,0.055310827,0.138856,0.013082841,0.0034892834,0.78259736],"study_design_scores_gemma":[0.0000341134,0.0002137609,0.007081787,0.000051062707,0.00014739328,0.0010555078,0.00009438209,0.9136633,0.06139193,0.006066112,0.010063943,0.00013675533],"about_ca_topic_score_codex":0.0016036493,"about_ca_topic_score_gemma":0.0016098866,"teacher_disagreement_score":0.0023995894,"about_ca_system_score_codex":0.00025023782,"about_ca_system_score_gemma":0.00044071567,"threshold_uncertainty_score":0.008027434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016457856,0.00022668291,0.9805768,0.0000577402,0.00012820953,0.000034538014,0.00026893706,0.0010517067,0.0011974389],"genre_scores_gemma":[0.3096902,0.0010593139,0.6802753,0.00006277935,0.00017585458,0.00020628185,0.0018999443,0.00027418436,0.0063560526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998165,0.00002702099,0.0000126146515,0.000053692624,0.00007252525,0.000017705932],"domain_scores_gemma":[0.9998357,0.00002990381,0.000015707727,0.000027119404,0.00008566536,0.000005749043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016409889,0.00080241234,0.00041584467,0.0008254923,0.0003375106,0.0005447247,0.00033986283,0.0003591774,0.0013873812],"category_scores_gemma":[0.00069806405,0.00023099515,0.0007097844,0.0011144074,0.00021978084,0.00060222007,0.00036215014,0.0006364769,0.00090669486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021969607,0.00009452254,0.0029639655,0.00025030735,0.00020500491,0.00014988486,0.00010854688,0.080010325,0.11115344,0.008841546,0.0062695257,0.7897332],"study_design_scores_gemma":[0.0000376278,0.00007441982,0.010868778,0.000027741986,0.00012016543,0.00018972205,0.0000561331,0.9323761,0.04230721,0.0046962104,0.009181065,0.000064934335],"about_ca_topic_score_codex":0.003989602,"about_ca_topic_score_gemma":0.0033507994,"teacher_disagreement_score":0.003989602,"about_ca_system_score_codex":0.00017502999,"about_ca_system_score_gemma":0.0007780975,"threshold_uncertainty_score":0.007932782},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028821088,0.00034517853,0.99571264,0.000047912643,0.00005342886,0.000015344296,0.0000076102106,0.00023424329,0.0007015939],"genre_scores_gemma":[0.17700277,0.0012886424,0.8146476,0.00012985418,0.00018910473,0.00009594811,0.00013195847,0.00012003618,0.006394074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929285,0.00017330435,0.000035587444,0.00015287231,0.00031463293,0.00003076833],"domain_scores_gemma":[0.9995771,0.00016289759,0.000042061987,0.000047271456,0.00015456906,0.000016079253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048027598,0.00059605663,0.0007002558,0.0005705865,0.00033115296,0.00056688354,0.00049211807,0.00077950535,0.0014260766],"category_scores_gemma":[0.0015224535,0.00020371967,0.0005072397,0.0005939835,0.00060236646,0.0010535447,0.00046449673,0.00081876526,0.0013006731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041684133,0.00010389814,0.00055338757,0.00041993003,0.00012718412,0.00014969183,0.0002016532,0.095415056,0.17869413,0.035787933,0.002972066,0.68515825],"study_design_scores_gemma":[0.000045402212,0.00021593482,0.0005385112,0.00002154359,0.000043679956,0.0004885002,0.000027908847,0.9165284,0.062291015,0.008369673,0.011369887,0.000059547107],"about_ca_topic_score_codex":0.0006838386,"about_ca_topic_score_gemma":0.00044299712,"teacher_disagreement_score":0.0014260766,"about_ca_system_score_codex":0.00022630034,"about_ca_system_score_gemma":0.0005074866,"threshold_uncertainty_score":0.004770696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004987541,0.0001743442,0.9938478,0.000032097505,0.000023529261,0.000021225154,0.00004337213,0.0002912585,0.00057889434],"genre_scores_gemma":[0.15158327,0.00087204896,0.8415405,0.00006098927,0.0000878403,0.00018740048,0.00039349124,0.00031869672,0.004955736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998331,0.00003890976,0.000012632389,0.000043290558,0.00005738366,0.000014759988],"domain_scores_gemma":[0.9995295,0.00023237092,0.000034339824,0.00009813986,0.000090909976,0.000014830233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042807704,0.0008315524,0.00091637176,0.0005794835,0.0002686234,0.000772878,0.0005115338,0.000712735,0.003231592],"category_scores_gemma":[0.0022718129,0.00033686627,0.00063206465,0.0008465778,0.0002893509,0.0012497129,0.0005007906,0.0010345061,0.0015525654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039330468,0.00011609135,0.0008705614,0.00035937352,0.00012110657,0.00022829686,0.00011232168,0.05366099,0.11733881,0.019713068,0.0023723468,0.8047137],"study_design_scores_gemma":[0.00004198678,0.00010892973,0.0022597762,0.00004114171,0.00007791519,0.00050235493,0.000023409624,0.9356934,0.041932013,0.015319134,0.0039519044,0.000048046168],"about_ca_topic_score_codex":0.0003848422,"about_ca_topic_score_gemma":0.0007203683,"teacher_disagreement_score":0.003231592,"about_ca_system_score_codex":0.00011992176,"about_ca_system_score_gemma":0.00040215557,"threshold_uncertainty_score":0.010810733},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012636925,0.120072015,0.79438335,0.0025509936,0.0024576033,0.00003608032,0.0002879952,0.0006137382,0.06696124],"genre_scores_gemma":[0.33956084,0.13572586,0.31768736,0.0010141531,0.004851894,0.00018216862,0.00083791086,0.00037515117,0.19976465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998994,0.000016732092,0.000008048277,0.000026737605,0.000041461564,0.0000074966697],"domain_scores_gemma":[0.9997998,0.00012665594,0.000014882449,0.000022345637,0.000029688372,0.000006678135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021010434,0.00059423014,0.0005742843,0.0004545949,0.00019285537,0.0012016561,0.0006109809,0.0011384424,0.003941605],"category_scores_gemma":[0.0008731646,0.00037624798,0.00038347012,0.0011084519,0.00081942556,0.0014613743,0.00043131152,0.001269789,0.0013425914],"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.00008388561,0.00007546584,0.0002757894,0.0011817126,0.000096998156,0.00022559652,0.00014811115,0.083666325,0.020101886,0.5466538,0.024368603,0.3231218],"study_design_scores_gemma":[0.000012265281,0.00004029082,0.0005931821,0.00010951344,0.000023265737,0.00030437915,0.000037708956,0.27676958,0.0045494363,0.67048067,0.04704539,0.000034363024],"about_ca_topic_score_codex":0.0007909091,"about_ca_topic_score_gemma":0.0010575725,"teacher_disagreement_score":0.003941605,"about_ca_system_score_codex":0.00040869575,"about_ca_system_score_gemma":0.00022346685,"threshold_uncertainty_score":0.013185978},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016742838,0.0004321536,0.996307,0.00003496559,0.000077430275,0.000018114028,0.000022904678,0.0008247316,0.00060839445],"genre_scores_gemma":[0.036326207,0.00078305637,0.95961535,0.000088477434,0.00014731979,0.00007771786,0.00010340815,0.000108519744,0.002749868],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993051,0.00018436629,0.000044650613,0.000140384,0.00029119663,0.00003426003],"domain_scores_gemma":[0.99954635,0.00019004049,0.000036479174,0.00004881481,0.00015194165,0.000026436936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005198744,0.0009337563,0.0007785329,0.00057535263,0.00029911715,0.0006039393,0.00071269926,0.0010303687,0.0022774823],"category_scores_gemma":[0.0013275032,0.00035994043,0.00066186744,0.0005035712,0.00048001556,0.0013852536,0.0005102314,0.00070830015,0.0023521998],"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.00041463328,0.00006612993,0.00022410949,0.00048163917,0.000092690054,0.00016375651,0.00014300994,0.016524645,0.45212865,0.01167796,0.0032350912,0.51484764],"study_design_scores_gemma":[0.00010573638,0.00046243033,0.00063093205,0.00005071304,0.00014226486,0.0015160685,0.000044702356,0.46394858,0.4832902,0.005979635,0.04365966,0.00016907281],"about_ca_topic_score_codex":0.00042335212,"about_ca_topic_score_gemma":0.00059886137,"teacher_disagreement_score":0.0022774823,"about_ca_system_score_codex":0.00022064065,"about_ca_system_score_gemma":0.00048633743,"threshold_uncertainty_score":0.0076189637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017397233,0.00005769694,0.99775094,0.000023830467,0.000014717216,0.000011348283,0.000005799138,0.000082529856,0.00031334764],"genre_scores_gemma":[0.10639285,0.00027905757,0.89053375,0.00008711115,0.000090234134,0.000067989065,0.000057011428,0.000047089346,0.0024449036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994543,0.00014457607,0.000027351292,0.00010787873,0.00022249926,0.00004336641],"domain_scores_gemma":[0.9992957,0.00036660847,0.00008279229,0.00012647828,0.000100169804,0.000028153327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070966873,0.00063991494,0.0005778202,0.00080377754,0.00047056325,0.00077037467,0.0006319402,0.0009279794,0.0013354104],"category_scores_gemma":[0.0022645397,0.00026137166,0.00059314,0.00047820926,0.0007339525,0.0011368803,0.0009854443,0.0009908448,0.0008030718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036939388,0.00012679219,0.0008140306,0.00023209362,0.00011236348,0.00013017633,0.00024200478,0.15522721,0.08968423,0.10855514,0.0016446189,0.64286184],"study_design_scores_gemma":[0.00003226129,0.00018956748,0.00029606165,0.000019033454,0.000026238102,0.00039253154,0.000029409277,0.9362273,0.029060852,0.028107582,0.0055778516,0.000041245155],"about_ca_topic_score_codex":0.0006417151,"about_ca_topic_score_gemma":0.000785618,"teacher_disagreement_score":0.0013354104,"about_ca_system_score_codex":0.00036710015,"about_ca_system_score_gemma":0.0010095552,"threshold_uncertainty_score":0.0044674277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076541295,0.00024833457,0.9912816,0.000084818144,0.000035122215,0.000010969424,0.00002107953,0.000112293914,0.0005517023],"genre_scores_gemma":[0.30082622,0.0016576534,0.69231987,0.00014147033,0.00018629988,0.000095700896,0.00030002327,0.00009431777,0.0043784548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997328,0.00006500212,0.000016051297,0.000062604755,0.000101305595,0.00002222394],"domain_scores_gemma":[0.99927086,0.00044213154,0.00005908029,0.00006628868,0.00013794313,0.000023642564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005337979,0.0006178095,0.0005324244,0.00032449,0.00028359282,0.0003734996,0.00055394584,0.0006162129,0.0009370137],"category_scores_gemma":[0.00229252,0.0003190442,0.00044662543,0.0006549731,0.00044050484,0.001002565,0.00067028124,0.0009734037,0.00030415767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013327652,0.00005025927,0.00076102855,0.000116937,0.000054606204,0.00009815123,0.00009781371,0.7626354,0.021370092,0.013184629,0.0014350478,0.20006266],"study_design_scores_gemma":[0.0000034699137,0.00001888564,0.00006976152,0.0000031409165,0.0000041303897,0.000021059293,0.0000025430631,0.9965174,0.0021378591,0.000801542,0.0004156852,0.000004516618],"about_ca_topic_score_codex":0.0046542264,"about_ca_topic_score_gemma":0.0039590853,"teacher_disagreement_score":0.0046542264,"about_ca_system_score_codex":0.00030959377,"about_ca_system_score_gemma":0.0008902636,"threshold_uncertainty_score":0.009254277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11347257,0.0007081884,0.8821356,0.00016936411,0.00021627445,0.00008887142,0.0003646641,0.0007618834,0.0020825674],"genre_scores_gemma":[0.80110794,0.0006736017,0.18904212,0.00009298633,0.00019797943,0.00017392954,0.001077976,0.00015790408,0.0074756397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996586,0.00010886306,0.000020836487,0.00011460516,0.00005961814,0.000037473394],"domain_scores_gemma":[0.99936455,0.00040537535,0.000025599405,0.000042791202,0.00014311261,0.00001854368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007512652,0.00055004016,0.00057925604,0.00035910393,0.0002849012,0.0006036107,0.0005006522,0.00054699444,0.0015722722],"category_scores_gemma":[0.0015966963,0.00016399677,0.0007345645,0.00036512414,0.00018782966,0.0005784977,0.0003210118,0.0007225471,0.00087206834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010601479,0.0005514047,0.0047105146,0.00022173776,0.00021278829,0.00041945776,0.00038205142,0.1090362,0.08368813,0.0054952796,0.003677008,0.79054534],"study_design_scores_gemma":[0.0000072137486,0.00008330453,0.002443292,0.000008202893,0.000039200186,0.00013502975,0.000036848458,0.98644155,0.008729416,0.0015226686,0.00054099766,0.000012400784],"about_ca_topic_score_codex":0.0016048654,"about_ca_topic_score_gemma":0.0018325242,"teacher_disagreement_score":0.0016048654,"about_ca_system_score_codex":0.00021954859,"about_ca_system_score_gemma":0.00032790675,"threshold_uncertainty_score":0.005259812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015709206,0.0003278843,0.98315513,0.00004399701,0.000026330508,0.000008652658,0.000016550537,0.00023853955,0.00047373792],"genre_scores_gemma":[0.6155361,0.00058082136,0.3817678,0.000079793586,0.00010142416,0.000048048063,0.00014911841,0.00008953877,0.0016474334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994711,0.00019038915,0.000039919843,0.000079190686,0.00018151924,0.000037886537],"domain_scores_gemma":[0.9977702,0.0014168579,0.00027117803,0.00019427888,0.00031231454,0.00003518599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001085131,0.00074886746,0.00090611674,0.0010212258,0.0003151967,0.00089792354,0.00071552803,0.00071204896,0.00046719884],"category_scores_gemma":[0.0044573806,0.0005020988,0.0006636695,0.000658404,0.0005172397,0.0010763551,0.0008862739,0.0006864337,0.00024507652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058012636,0.00009753904,0.0028667992,0.0002333026,0.0002478948,0.00019443886,0.00012291498,0.6429881,0.03459803,0.016439559,0.001029344,0.300602],"study_design_scores_gemma":[0.000010032557,0.000037578146,0.0006664454,0.000010428508,0.000020446048,0.00014064866,0.000007346166,0.9860591,0.01032544,0.0021354805,0.00056503795,0.000021999766],"about_ca_topic_score_codex":0.0010253863,"about_ca_topic_score_gemma":0.0009159205,"teacher_disagreement_score":0.001085131,"about_ca_system_score_codex":0.0004120894,"about_ca_system_score_gemma":0.0006216363,"threshold_uncertainty_score":0.005738795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012992922,0.00031856226,0.98582536,0.00006138174,0.000055819088,0.00001328765,0.000054193893,0.00023305514,0.00044542408],"genre_scores_gemma":[0.27500898,0.00089864776,0.7145175,0.0001324948,0.00020747972,0.00012985308,0.0010823294,0.00020255886,0.007820251],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999035,0.0003452396,0.00007721444,0.00023305339,0.0002210372,0.00008850283],"domain_scores_gemma":[0.9960836,0.0026440204,0.00024770782,0.00044802707,0.00048391422,0.000092776674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018038866,0.00081182376,0.0011621608,0.0009757566,0.0004970379,0.0007739621,0.0011979315,0.0013014657,0.002673881],"category_scores_gemma":[0.007129059,0.00056822266,0.0008411185,0.001564502,0.00051944546,0.0019914669,0.0012611547,0.0012533368,0.0018565526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008796442,0.0002558412,0.0060964627,0.0003324246,0.00022326468,0.0004638199,0.00029447002,0.20260394,0.056321166,0.033081286,0.0035503695,0.69589746],"study_design_scores_gemma":[0.000011824741,0.00005282255,0.0008027389,0.000019240917,0.000019815296,0.00016191856,0.000021975075,0.9865637,0.0052653137,0.0060176947,0.001046365,0.000016642227],"about_ca_topic_score_codex":0.0019218149,"about_ca_topic_score_gemma":0.0031004956,"teacher_disagreement_score":0.002673881,"about_ca_system_score_codex":0.00027217277,"about_ca_system_score_gemma":0.0009363684,"threshold_uncertainty_score":0.009540021},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7025411,0.0009196351,0.2936973,0.00021823989,0.000035770285,0.00007378473,0.00060598145,0.00043954438,0.0014686635],"genre_scores_gemma":[0.9264712,0.00043695603,0.071813144,0.000025078887,0.000036415415,0.000030103276,0.0005012918,0.00009583796,0.00058999646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984694,0.0000582744,0.000012321998,0.000023978477,0.000044217762,0.000014349657],"domain_scores_gemma":[0.99845386,0.0010997443,0.000110870074,0.00015419908,0.00014186368,0.00003947385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069573853,0.00029894095,0.00022512894,0.0007905734,0.00010368678,0.00037409327,0.0002982984,0.00033441628,0.0012583236],"category_scores_gemma":[0.004536265,0.000120341014,0.00032339763,0.0006667052,0.00025123038,0.0006204729,0.0003324933,0.00024857634,0.00021445441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044340813,0.0002244241,0.017268373,0.0008969292,0.00035647364,0.0010654895,0.0006190957,0.11828744,0.2136816,0.004531274,0.0017908884,0.6368439],"study_design_scores_gemma":[0.00022248806,0.00041946492,0.11385525,0.00007265057,0.0001940516,0.002582662,0.0002275807,0.8049935,0.068537526,0.0065232823,0.0022938068,0.00007770141],"about_ca_topic_score_codex":0.0004651951,"about_ca_topic_score_gemma":0.0008662001,"teacher_disagreement_score":0.0012583236,"about_ca_system_score_codex":0.000076351585,"about_ca_system_score_gemma":0.00017488151,"threshold_uncertainty_score":0.004209459},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026363852,0.000071125876,0.9964533,0.00006641367,0.000011722407,0.000019094878,0.00004326445,0.00018279732,0.00051601126],"genre_scores_gemma":[0.052785505,0.00015997652,0.9447182,0.000068343346,0.0000468551,0.00008677946,0.0002672909,0.00011446273,0.0017527075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994419,0.00015368336,0.00003302479,0.00009176624,0.00022236901,0.00005729582],"domain_scores_gemma":[0.9992816,0.00033631304,0.00008945292,0.000099823366,0.0001462313,0.000046556248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091580354,0.0012027508,0.0007686917,0.0009074178,0.00046104362,0.00081507815,0.0012890877,0.0011079009,0.0038119652],"category_scores_gemma":[0.0023889872,0.0005135875,0.0009561149,0.0010599591,0.0006667287,0.0012063736,0.0016584109,0.0015352214,0.0012024358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003758666,0.00012757751,0.00072957267,0.00026107873,0.00009415762,0.00018965227,0.0002679729,0.48600304,0.03140663,0.03378526,0.0056286324,0.44113046],"study_design_scores_gemma":[0.00001272998,0.000051036262,0.00014076855,0.000008833016,0.000007869986,0.00006403872,0.00002565014,0.98845196,0.0042728004,0.0048145414,0.0021333613,0.000016400394],"about_ca_topic_score_codex":0.003296791,"about_ca_topic_score_gemma":0.0043382873,"teacher_disagreement_score":0.0038119652,"about_ca_system_score_codex":0.0005922774,"about_ca_system_score_gemma":0.0012856955,"threshold_uncertainty_score":0.012752235},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020618644,0.00027791856,0.9961816,0.00013047151,0.00006596771,0.000055444045,0.00013755422,0.00031121782,0.00077791244],"genre_scores_gemma":[0.1518799,0.001190996,0.8391865,0.0003279146,0.00026878453,0.0005248414,0.001476342,0.0004141542,0.0047305296],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791807,0.0010630143,0.000097225355,0.00040690746,0.0003977285,0.00011712125],"domain_scores_gemma":[0.99762803,0.0007310522,0.00018003478,0.00044592025,0.0009364793,0.000078513636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033604328,0.0016867556,0.0012695743,0.0026858232,0.00068330666,0.0014903985,0.0015085061,0.0011951694,0.0044074575],"category_scores_gemma":[0.008243034,0.00038253708,0.0019062615,0.0033341283,0.001312147,0.001608507,0.0015857673,0.0015927281,0.0013274507],"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.00019001486,0.000105234314,0.0019459635,0.0005400219,0.000586834,0.00026622263,0.00034880886,0.14995058,0.014496014,0.17480066,0.016532922,0.6402367],"study_design_scores_gemma":[0.000020192643,0.00010784051,0.0024239959,0.00006206801,0.000085119995,0.00028972403,0.00007357647,0.882938,0.0023532629,0.09582155,0.015739266,0.00008531553],"about_ca_topic_score_codex":0.0042627826,"about_ca_topic_score_gemma":0.0036537729,"teacher_disagreement_score":0.0044074575,"about_ca_system_score_codex":0.00061374734,"about_ca_system_score_gemma":0.0020924031,"threshold_uncertainty_score":0.0177719},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038326369,0.000115751725,0.9952944,0.00003233158,0.000022573708,0.000021206846,0.000008176155,0.00019093299,0.0004819269],"genre_scores_gemma":[0.08291866,0.00024633444,0.9145557,0.000057150373,0.000062401064,0.000086293505,0.000092508104,0.000068247115,0.001912662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990376,0.00026842827,0.00006651763,0.00018494466,0.0003784449,0.000064002445],"domain_scores_gemma":[0.9995617,0.00014772758,0.00006660865,0.000095540694,0.000101468184,0.000026840917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079404225,0.0007343374,0.0010224266,0.00082746154,0.00047899442,0.00058398215,0.00084394886,0.0011124241,0.0013304581],"category_scores_gemma":[0.0018165014,0.0003386763,0.00096263987,0.0009938992,0.0008242858,0.0013238643,0.0012395468,0.0007357134,0.0015379193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006830733,0.0001703913,0.00053792837,0.0003307926,0.0001657376,0.00020255185,0.00028616248,0.17389369,0.24135767,0.044693902,0.0019677351,0.5357104],"study_design_scores_gemma":[0.00007601987,0.00035076286,0.00034943334,0.000018988281,0.000048991533,0.00033537764,0.000034787674,0.8997253,0.068156764,0.020068016,0.0107834535,0.00005201631],"about_ca_topic_score_codex":0.0004322384,"about_ca_topic_score_gemma":0.00035536068,"teacher_disagreement_score":0.0013304581,"about_ca_system_score_codex":0.00032586366,"about_ca_system_score_gemma":0.0005373384,"threshold_uncertainty_score":0.0044508576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000521174,0.000027720233,0.99898034,0.000011449536,0.000010811954,0.000007181779,0.0000059339786,0.00014070128,0.0002946219],"genre_scores_gemma":[0.0423191,0.0001693226,0.95506215,0.000046881996,0.000050594255,0.00009867152,0.00008006995,0.0000812105,0.0020919563],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99895513,0.00025594764,0.000044743058,0.00020638334,0.0004842062,0.000053535412],"domain_scores_gemma":[0.99883467,0.00052899576,0.000116263196,0.00021873276,0.00024642676,0.000054930733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000876552,0.0009452709,0.00083886937,0.00076526275,0.00063265883,0.0010354518,0.0010182593,0.0011288035,0.0021847133],"category_scores_gemma":[0.0031751539,0.0005457295,0.0007442761,0.0007081547,0.00088586356,0.0016716247,0.0014391601,0.0013735592,0.0018796067],"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.0002241485,0.000090330606,0.00043780849,0.00020056723,0.00011252755,0.00016217788,0.00026264688,0.26481178,0.055805523,0.10317381,0.0029967965,0.5717219],"study_design_scores_gemma":[0.000021973397,0.00008396885,0.0001813058,0.000017869306,0.000019097666,0.0003659285,0.000017955745,0.9568462,0.017021645,0.019585952,0.005787108,0.000051049403],"about_ca_topic_score_codex":0.001034999,"about_ca_topic_score_gemma":0.0010958278,"teacher_disagreement_score":0.0021847133,"about_ca_system_score_codex":0.00037854188,"about_ca_system_score_gemma":0.0012410672,"threshold_uncertainty_score":0.0073086023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015126654,0.000025741316,0.98335934,0.000029555857,0.000013207183,0.00001580004,0.000027390384,0.0001623829,0.001239836],"genre_scores_gemma":[0.45585385,0.00019813857,0.5387692,0.00010020201,0.00006125033,0.00011919237,0.00035547078,0.00017398613,0.0043687457],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996313,0.00008239681,0.000018263932,0.00008542424,0.00014089895,0.00004181254],"domain_scores_gemma":[0.9990101,0.0003649982,0.0001235005,0.00022080522,0.00020126508,0.00007928198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000636254,0.00037705948,0.00037505527,0.0006376335,0.0002613505,0.0005117335,0.0005475035,0.0003374913,0.0016643482],"category_scores_gemma":[0.0027658513,0.00028397216,0.00031318353,0.00046095136,0.00067673647,0.00080190285,0.00087149936,0.0006942618,0.0007464461],"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.00031359954,0.0001546285,0.0020970684,0.00017846955,0.000029026693,0.00048920297,0.00032156688,0.06373357,0.18637015,0.20334095,0.00296886,0.5400029],"study_design_scores_gemma":[0.00003297811,0.00013530067,0.0017425817,0.0000150927635,0.000018780454,0.00095548306,0.000070001995,0.8519054,0.065492086,0.069450416,0.010138463,0.000043377608],"about_ca_topic_score_codex":0.00017467237,"about_ca_topic_score_gemma":0.00019182451,"teacher_disagreement_score":0.0016643482,"about_ca_system_score_codex":0.00019694357,"about_ca_system_score_gemma":0.0002891085,"threshold_uncertainty_score":0.005567789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011479091,0.000070818045,0.99829775,0.000036728394,0.000010954908,0.000008392886,0.000014840293,0.00011932127,0.00029324167],"genre_scores_gemma":[0.30087337,0.00084820355,0.6920411,0.00013410817,0.00017450501,0.00021355979,0.00022360435,0.00017350535,0.005318079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932766,0.00017476449,0.000036592646,0.0001490518,0.0002718711,0.000040172068],"domain_scores_gemma":[0.99915504,0.0005028656,0.000098237906,0.00011476996,0.00010772914,0.000021421483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009818554,0.0008328235,0.0006860155,0.0007126073,0.00046264238,0.00081279676,0.00091739174,0.00089771784,0.0016118775],"category_scores_gemma":[0.0025394002,0.00064875156,0.0011834359,0.00055600994,0.00052660756,0.001404318,0.00068890443,0.0009088308,0.00089219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009584716,0.000094834475,0.00093017326,0.00019527365,0.00017244069,0.00016028434,0.00012993239,0.7709585,0.01877501,0.048708484,0.0011260437,0.15865318],"study_design_scores_gemma":[0.0000048331926,0.000019419269,0.00016438373,0.000005363982,0.000018804145,0.00007087791,0.000005150356,0.9905751,0.0016828534,0.0062502874,0.0011870371,0.000015894986],"about_ca_topic_score_codex":0.00426959,"about_ca_topic_score_gemma":0.007018303,"teacher_disagreement_score":0.00426959,"about_ca_system_score_codex":0.000578426,"about_ca_system_score_gemma":0.0014587367,"threshold_uncertainty_score":0.00848949},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019488687,0.00021607538,0.9971365,0.00002987631,0.000054794582,0.000021613938,0.000017415767,0.00016856944,0.00040629262],"genre_scores_gemma":[0.053149946,0.0006969396,0.94269097,0.00008839795,0.00013862512,0.00013258898,0.00011672359,0.0000723375,0.0029134115],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995473,0.00008351131,0.000022619415,0.00010376106,0.00021792093,0.000024855128],"domain_scores_gemma":[0.9994305,0.0002132372,0.000054086093,0.00006386186,0.00021394607,0.00002435532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054990384,0.00056897436,0.00040366774,0.0006615524,0.00023003687,0.00040712926,0.0008635206,0.000666906,0.0017572574],"category_scores_gemma":[0.0018813431,0.0002323461,0.0004274678,0.00061012316,0.0003325469,0.00093789876,0.0006044996,0.00086499227,0.001079921],"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.0001511057,0.000050342755,0.00061533734,0.00025194784,0.00006438009,0.00014491477,0.00009171914,0.008614187,0.28309044,0.007633643,0.0018219937,0.6974699],"study_design_scores_gemma":[0.00007947841,0.00071199326,0.0066195633,0.00009873359,0.00017301041,0.0031014353,0.000059392463,0.69513965,0.22340229,0.0095571475,0.060864013,0.0001933167],"about_ca_topic_score_codex":0.00039573683,"about_ca_topic_score_gemma":0.00060317136,"teacher_disagreement_score":0.0017572574,"about_ca_system_score_codex":0.00015002454,"about_ca_system_score_gemma":0.00040036562,"threshold_uncertainty_score":0.0058786273},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64887446,0.0001460165,0.34799722,0.000112271104,0.000026329544,0.00015199931,0.00021813331,0.0006081712,0.0018653882],"genre_scores_gemma":[0.9287294,0.00012256339,0.07039123,0.0000164632,0.0000063419016,0.00006431929,0.00014413634,0.00003106797,0.0004946071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972636,0.00012972282,0.000016596574,0.000024413932,0.000079401114,0.000023562676],"domain_scores_gemma":[0.9985185,0.0010968592,0.00006667074,0.000087454704,0.00019236558,0.000038188427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006083159,0.0005146543,0.0003634412,0.00041048368,0.00017902849,0.00032939503,0.0004837617,0.00064343936,0.0005455129],"category_scores_gemma":[0.0033953374,0.0002103166,0.00043286974,0.00048462683,0.0004186949,0.00029344612,0.00038188123,0.00035630836,0.00014213772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040112613,0.00005144577,0.0018896833,0.00015823489,0.000061675135,0.0006570646,0.00039723478,0.9292168,0.036865387,0.0018108498,0.00028804725,0.028202452],"study_design_scores_gemma":[0.000055833723,0.00017198276,0.0014503831,0.000013985174,0.000016331685,0.00017221812,0.00006554647,0.97823375,0.018542437,0.00094964996,0.00031039436,0.00001755479],"about_ca_topic_score_codex":0.0030217583,"about_ca_topic_score_gemma":0.0024549025,"teacher_disagreement_score":0.0030217583,"about_ca_system_score_codex":0.0002837229,"about_ca_system_score_gemma":0.00030633068,"threshold_uncertainty_score":0.006008327},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011722513,0.0021718254,0.98409724,0.00012612711,0.00014068134,0.00002931851,0.00004897431,0.00027822386,0.0013851211],"genre_scores_gemma":[0.10331602,0.005476363,0.88648844,0.00014727417,0.00030422557,0.00010361024,0.00024898956,0.00011716049,0.0037978848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997756,0.000033727763,0.000015684478,0.00003244638,0.00013024143,0.000012207537],"domain_scores_gemma":[0.99977285,0.000081515536,0.000033694527,0.000026648971,0.00007558824,0.0000097191105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031681304,0.00047056127,0.0005236833,0.00062641356,0.0001274467,0.00038559537,0.00032022013,0.00046896908,0.0007883996],"category_scores_gemma":[0.001189898,0.00020072359,0.00055964664,0.0006539673,0.0003217192,0.00065292325,0.00028553154,0.0004884541,0.00053407426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021490346,0.00004848259,0.00057282456,0.00052284956,0.00011235706,0.00037793317,0.00009527311,0.012599289,0.2928674,0.009153532,0.001718463,0.68171674],"study_design_scores_gemma":[0.00013965134,0.00060216716,0.014081875,0.00019370185,0.00031933113,0.0042754547,0.000123319,0.6073979,0.28596312,0.027995285,0.058750883,0.00015723403],"about_ca_topic_score_codex":0.00036678687,"about_ca_topic_score_gemma":0.00048251593,"teacher_disagreement_score":0.0007883996,"about_ca_system_score_codex":0.00010474245,"about_ca_system_score_gemma":0.00025853486,"threshold_uncertainty_score":0.002637446},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041386983,0.00039310165,0.9940003,0.000069239424,0.00004664884,0.000041826723,0.00012305051,0.0006346018,0.0005525921],"genre_scores_gemma":[0.17622067,0.0009844486,0.8182171,0.000079247,0.00012051638,0.00036090906,0.0009152691,0.0003224014,0.002779422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992618,0.00022317932,0.000049714003,0.00013305398,0.0002775224,0.000054755954],"domain_scores_gemma":[0.99883085,0.0005857055,0.00008057664,0.00015245606,0.00032832831,0.000022103344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094673416,0.0013402776,0.0008652869,0.0012191068,0.00050345506,0.000603737,0.0005780645,0.00068626006,0.003016297],"category_scores_gemma":[0.005022911,0.0003470747,0.0008910775,0.0019000075,0.00041512342,0.0007079732,0.00054148724,0.00152626,0.0015322566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022265474,0.00012669762,0.0006513205,0.00023835823,0.0001121948,0.00013374728,0.000110522495,0.1590258,0.030625528,0.012343901,0.007245071,0.7891641],"study_design_scores_gemma":[0.00001243528,0.000059361795,0.0012776825,0.00002272314,0.000029575913,0.00007601698,0.000018847739,0.97638845,0.011169852,0.006103079,0.004811606,0.000030483487],"about_ca_topic_score_codex":0.0042816736,"about_ca_topic_score_gemma":0.0032887002,"teacher_disagreement_score":0.0042816736,"about_ca_system_score_codex":0.00037644818,"about_ca_system_score_gemma":0.0010107008,"threshold_uncertainty_score":0.01009053},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031409436,0.0003999197,0.99389255,0.000076720644,0.00014282802,0.000058621816,0.0001298569,0.0010522654,0.001106267],"genre_scores_gemma":[0.05670407,0.0004811528,0.9362483,0.00012197149,0.0002588762,0.0001277836,0.00047890184,0.0002740237,0.005304925],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994197,0.00005884514,0.000034631234,0.000174312,0.00026377567,0.000048711576],"domain_scores_gemma":[0.9994618,0.00011574956,0.00004465659,0.00008255918,0.0002622177,0.00003298157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045792665,0.00094324525,0.00084824325,0.0015888005,0.0006002262,0.0009450403,0.0008932235,0.0006808232,0.004053993],"category_scores_gemma":[0.001718172,0.0002969687,0.0008430033,0.0013740787,0.0003542161,0.00064627227,0.0007595598,0.00105601,0.002387072],"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.00022304847,0.000051930823,0.0003299805,0.00014409499,0.000060374234,0.00012903086,0.00005977691,0.005578933,0.09524007,0.002585746,0.0067257755,0.88887125],"study_design_scores_gemma":[0.00012379511,0.00031249586,0.006711241,0.00006445526,0.00018674294,0.002309315,0.000087498614,0.74764216,0.1898519,0.0058856397,0.046669826,0.00015501537],"about_ca_topic_score_codex":0.0017772373,"about_ca_topic_score_gemma":0.0030107112,"teacher_disagreement_score":0.004053993,"about_ca_system_score_codex":0.00028834763,"about_ca_system_score_gemma":0.0007654612,"threshold_uncertainty_score":0.013561904},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011906772,0.00072999403,0.9839774,0.00017024674,0.00009043201,0.00004590443,0.00029483935,0.0011838548,0.0016004964],"genre_scores_gemma":[0.39450756,0.0010507103,0.5945169,0.00027046652,0.00014617573,0.00016421413,0.0021222825,0.00019470489,0.007027127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996854,0.00006034375,0.000023689507,0.00009185007,0.00010265846,0.000036079837],"domain_scores_gemma":[0.9994659,0.00015862912,0.000060474224,0.0001458503,0.00014248524,0.000026614787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047036234,0.0005669827,0.00056413194,0.00074445235,0.00022768612,0.0007052755,0.0008412248,0.00061566255,0.003684263],"category_scores_gemma":[0.0015359019,0.0002739407,0.00044374858,0.0010748201,0.0003271954,0.0010860555,0.0008500152,0.0012649399,0.0017331492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018978442,0.00012237589,0.0013694031,0.00013325574,0.00006600652,0.00005227066,0.000049581173,0.07237339,0.023411833,0.013379968,0.00656363,0.88228846],"study_design_scores_gemma":[0.000012176173,0.000050337996,0.0006822913,0.000018276405,0.000012188883,0.000066846835,0.00001768213,0.9745285,0.011544057,0.008713358,0.0043418515,0.000012378517],"about_ca_topic_score_codex":0.0019222568,"about_ca_topic_score_gemma":0.0026583853,"teacher_disagreement_score":0.003684263,"about_ca_system_score_codex":0.0004127352,"about_ca_system_score_gemma":0.00054610183,"threshold_uncertainty_score":0.012325048},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029791144,0.00022781736,0.99614656,0.000025426318,0.000017514445,0.000011937037,0.000012926663,0.00015401772,0.00042468228],"genre_scores_gemma":[0.19843669,0.0012642659,0.7941483,0.0001255627,0.00012837937,0.00017246343,0.00022110918,0.00013720735,0.005365907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943763,0.00012197902,0.000029186816,0.00012680232,0.00024522498,0.000039219052],"domain_scores_gemma":[0.9993837,0.00023455845,0.00008418607,0.000099550525,0.00017351525,0.000024444882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007678399,0.00095403014,0.00080365426,0.0009418784,0.0002590293,0.00084349024,0.00087905995,0.0010006875,0.0014316562],"category_scores_gemma":[0.0018312181,0.00036544836,0.0009063494,0.0007507871,0.0007034845,0.0013736527,0.0014448176,0.0011124738,0.00085388863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026414962,0.00013036806,0.00061756396,0.00049854565,0.0001474951,0.00017249827,0.00028668682,0.26183137,0.11973692,0.03611737,0.0023989473,0.57779807],"study_design_scores_gemma":[0.00001258881,0.00006698513,0.00043546734,0.000019061268,0.000016628865,0.00009662808,0.000023612125,0.96965045,0.015140184,0.010606712,0.003905662,0.000026030271],"about_ca_topic_score_codex":0.0007451295,"about_ca_topic_score_gemma":0.0006825029,"teacher_disagreement_score":0.0014316562,"about_ca_system_score_codex":0.0002572955,"about_ca_system_score_gemma":0.00062187033,"threshold_uncertainty_score":0.0047893524},"labels":[],"label_agreement":null},{"id":"W2586175175","doi":"10.1109/tsp.2017.2664041","title":"Bandwidth Estimation From Multiple Level-Crossings of Stochastic Signals","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Bandwidth (computing); Estimator; Gaussian; Mathematics; Algorithm; Signal processing; Computer science; Statistics; Digital signal processing; Telecommunications","score_opus":0.05551927747556524,"score_gpt":0.31026498826877713,"score_spread":0.2547457107932119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586175175","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031792384,0.00021650824,0.9673361,0.000037846934,0.000012525487,0.000018142227,0.0000261831,0.00013471473,0.00042568706],"genre_scores_gemma":[0.7392098,0.000696827,0.258966,0.000045934918,0.0000640489,0.00006430332,0.00017782947,0.000089602145,0.000685747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993618,0.00017312271,0.00004187612,0.00012445668,0.00024025852,0.000058423255],"domain_scores_gemma":[0.9958723,0.003128734,0.00047958616,0.00025820048,0.00019802089,0.00006305951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019898582,0.0005396638,0.0006838386,0.0011292063,0.00024431315,0.00093364384,0.0006255634,0.0008053347,0.0008787593],"category_scores_gemma":[0.012172956,0.00027143344,0.0006585556,0.0008659773,0.00067413336,0.0014915541,0.0009463693,0.0011726012,0.00021450638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005105797,0.000109263136,0.0053841835,0.0005101944,0.00016211295,0.0005518816,0.00041180025,0.60061365,0.053312976,0.08823528,0.0006872799,0.24951084],"study_design_scores_gemma":[0.0000073541314,0.000063211024,0.0014521457,0.000024159352,0.00001700356,0.00024660525,0.000024196313,0.9665641,0.007981271,0.023009773,0.00058671576,0.000023448381],"about_ca_topic_score_codex":0.00042697866,"about_ca_topic_score_gemma":0.00028668976,"teacher_disagreement_score":0.0019898582,"about_ca_system_score_codex":0.00037168578,"about_ca_system_score_gemma":0.00034496843,"threshold_uncertainty_score":0.010523498},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085924385,0.00018789477,0.99808073,0.00008244808,0.00002820313,0.000038039838,0.000060818915,0.00020015109,0.0004625278],"genre_scores_gemma":[0.029226096,0.0008839335,0.9665953,0.0001322491,0.0001300004,0.000549562,0.00037459735,0.00023785596,0.0018703684],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995871,0.0018765711,0.00023135619,0.00078738516,0.0010531929,0.00018045897],"domain_scores_gemma":[0.9949586,0.0026457168,0.00044145726,0.00097679,0.0008750329,0.00010244527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005936422,0.0029349923,0.0010489044,0.0021721283,0.001007465,0.0017677011,0.0016137585,0.0014996529,0.00878081],"category_scores_gemma":[0.015564195,0.0006673203,0.0028363073,0.0030799462,0.0026838447,0.002782139,0.0020618977,0.003777866,0.0041849297],"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.00023121246,0.00014985284,0.0013775309,0.0007302398,0.0002869652,0.000529235,0.000605274,0.13635549,0.019190123,0.37622097,0.011111092,0.453212],"study_design_scores_gemma":[0.000032364595,0.00012934806,0.001186802,0.00012497915,0.000050601135,0.00031236192,0.00010598632,0.7840025,0.004987856,0.17781168,0.031139655,0.000115999595],"about_ca_topic_score_codex":0.004049066,"about_ca_topic_score_gemma":0.0030471513,"teacher_disagreement_score":0.00878081,"about_ca_system_score_codex":0.0011307908,"about_ca_system_score_gemma":0.0022629749,"threshold_uncertainty_score":0.031395197},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021501803,0.00030112578,0.99687237,0.00010534231,0.000022022314,0.000016548025,0.000059564965,0.00022296543,0.00024995627],"genre_scores_gemma":[0.27048007,0.0027289765,0.72181404,0.00022433557,0.00030527197,0.00032086353,0.001183018,0.00015474629,0.0027886361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995414,0.00014240161,0.000028765378,0.00008717613,0.00016636579,0.00003403483],"domain_scores_gemma":[0.9993338,0.0003401743,0.000085474596,0.00009061885,0.00013398436,0.000015916386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076717394,0.0007660394,0.0010782131,0.0010155181,0.0002909653,0.00071239,0.0006513142,0.0008193596,0.0017319162],"category_scores_gemma":[0.002913947,0.00031031983,0.0011128341,0.0015758278,0.00042763387,0.0009473713,0.0006809533,0.0012617914,0.0009766974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001401506,0.000115961666,0.00094531354,0.00037495123,0.00016902924,0.00015817193,0.00010704561,0.30567256,0.040073477,0.026268482,0.0068096537,0.6191652],"study_design_scores_gemma":[0.0000047978237,0.000039904975,0.00032914733,0.000013335528,0.000015744501,0.00006338496,0.000008530115,0.9879066,0.0026464625,0.0070428113,0.0019172555,0.000011978265],"about_ca_topic_score_codex":0.0014660144,"about_ca_topic_score_gemma":0.0012150725,"teacher_disagreement_score":0.0017319162,"about_ca_system_score_codex":0.00035518812,"about_ca_system_score_gemma":0.0005651472,"threshold_uncertainty_score":0.00579381},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025539195,0.000068843416,0.97276455,0.000052314703,0.000019036475,0.00003254421,0.00013871267,0.0006353658,0.00074940035],"genre_scores_gemma":[0.2593503,0.0002111088,0.7388276,0.000043368025,0.000042143874,0.000113954615,0.0002239296,0.00024791947,0.0009396963],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996418,0.00012980639,0.000022058131,0.000095884905,0.000084466956,0.000025969846],"domain_scores_gemma":[0.9993399,0.00033243408,0.000097605596,0.00011837148,0.00008584068,0.000025857827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076993904,0.00063391065,0.00031347832,0.0006627909,0.00019117302,0.0005255653,0.00041085892,0.00033236117,0.0013584223],"category_scores_gemma":[0.0047019436,0.00019750284,0.00050327776,0.0008376154,0.00034067707,0.0006841447,0.0005998611,0.0006378155,0.00033882598],"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.00028016098,0.0000659711,0.004903452,0.0001860223,0.000167803,0.00017412145,0.00047125938,0.025048748,0.16941103,0.014031782,0.0025635054,0.78269607],"study_design_scores_gemma":[0.00004559839,0.00024858923,0.030679343,0.000052437546,0.000116938674,0.0010007299,0.00015642006,0.7956082,0.11199957,0.05167892,0.008296469,0.000116882475],"about_ca_topic_score_codex":0.001949224,"about_ca_topic_score_gemma":0.0024110863,"teacher_disagreement_score":0.001949224,"about_ca_system_score_codex":0.00014297097,"about_ca_system_score_gemma":0.000403007,"threshold_uncertainty_score":0.0045443773},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.324981,0.00023823798,0.6712357,0.00025904857,0.00010267499,0.00006373946,0.00014179273,0.00081518997,0.0021626635],"genre_scores_gemma":[0.6342982,0.00039126544,0.3497333,0.0000931517,0.00007088696,0.00007366973,0.00031469236,0.00023777911,0.014787226],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994487,0.00013334949,0.000015797006,0.00012322253,0.00021661443,0.00006231455],"domain_scores_gemma":[0.9989385,0.0005339418,0.00009047069,0.00013233366,0.00021740182,0.00008722073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069940754,0.0013024757,0.00077298813,0.00070470345,0.00043661214,0.0015728237,0.00057951227,0.002332661,0.0031911887],"category_scores_gemma":[0.002840875,0.0005198256,0.0006861835,0.0005016111,0.000790613,0.00090455107,0.00058307615,0.0015985888,0.001031396],"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.0011689438,0.0001345332,0.0044605993,0.000099332225,0.000083487605,0.0007074212,0.00031474212,0.05452873,0.7409323,0.0067847506,0.0009882153,0.18979698],"study_design_scores_gemma":[0.000100992205,0.00034753288,0.017683597,0.00003086345,0.000049809736,0.0010786009,0.00016844743,0.6817515,0.29420775,0.0016814899,0.002833711,0.00006566701],"about_ca_topic_score_codex":0.003801936,"about_ca_topic_score_gemma":0.0046781376,"teacher_disagreement_score":0.003801936,"about_ca_system_score_codex":0.00045539922,"about_ca_system_score_gemma":0.0006496865,"threshold_uncertainty_score":0.010675609},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090473157,0.00011657002,0.9983296,0.00002783939,0.000022392289,0.0000054180764,0.000014582562,0.00007941277,0.00049948064],"genre_scores_gemma":[0.064746924,0.00065469043,0.9298043,0.00012040595,0.00016208095,0.00009538384,0.00025144918,0.00012458742,0.004040191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913484,0.00025335123,0.00005646672,0.00015553938,0.00035942835,0.000040427327],"domain_scores_gemma":[0.9990374,0.0003422063,0.00009550578,0.00019298053,0.00029707505,0.000034939378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011028465,0.0010505473,0.0007218915,0.0013385932,0.0005412715,0.0009930488,0.0008635477,0.00086034875,0.0026028014],"category_scores_gemma":[0.0023503006,0.00032912666,0.0010143757,0.000802628,0.0013310652,0.0017488112,0.0013266805,0.001307421,0.0011277567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024262177,0.000110210596,0.0005587873,0.00033759308,0.00018918463,0.0002349803,0.0003036411,0.14264046,0.054293647,0.3202768,0.0046840846,0.476128],"study_design_scores_gemma":[0.000023823544,0.00014808968,0.0004920334,0.000030152682,0.000044521104,0.0005815436,0.00006708442,0.8436755,0.022087416,0.11337923,0.01935718,0.00011334674],"about_ca_topic_score_codex":0.0008575635,"about_ca_topic_score_gemma":0.0008713523,"teacher_disagreement_score":0.0026028014,"about_ca_system_score_codex":0.0003896152,"about_ca_system_score_gemma":0.0007773304,"threshold_uncertainty_score":0.008707285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020434214,0.00042517073,0.9782202,0.00007544068,0.00003512948,0.000020603162,0.00008402479,0.00020017577,0.0005049523],"genre_scores_gemma":[0.3573804,0.0017170506,0.63720053,0.000099191064,0.00017234232,0.000119760145,0.0005812783,0.00014975746,0.002579738],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99970955,0.00007165405,0.000028161197,0.000045903966,0.000119127726,0.000025590862],"domain_scores_gemma":[0.99928194,0.00039093476,0.0000676122,0.00008461663,0.0001489377,0.000025975456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004589921,0.0007066978,0.00044626856,0.0007351891,0.00024707263,0.0005343304,0.00032555778,0.00044339956,0.0007543744],"category_scores_gemma":[0.0025944544,0.00019336207,0.00064504554,0.0010910726,0.0003044182,0.00083522045,0.000818238,0.0007016924,0.0003647587],"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.00057969696,0.0001252521,0.0015834202,0.00033623862,0.00018845957,0.0002490465,0.00018917643,0.037473246,0.289823,0.007844605,0.0013747643,0.66023314],"study_design_scores_gemma":[0.00007811655,0.00031461642,0.009806523,0.00007427537,0.0001897245,0.00081254327,0.00011472386,0.8032186,0.157451,0.02139892,0.0064634476,0.000077454846],"about_ca_topic_score_codex":0.0006877217,"about_ca_topic_score_gemma":0.001648892,"teacher_disagreement_score":0.0007543744,"about_ca_system_score_codex":0.000116620264,"about_ca_system_score_gemma":0.00054117455,"threshold_uncertainty_score":0.0025236607},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8973392,0.00015942671,0.09290066,0.0002682114,0.000024668307,0.0000309186,0.00008352243,0.00031978206,0.008873624],"genre_scores_gemma":[0.99536335,0.00003330404,0.0042395922,0.000015348527,0.0000033101717,0.000014866573,0.000022217011,0.000019961404,0.00028793246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975985,0.00006041072,0.000010032127,0.000024536219,0.00010324491,0.000042024047],"domain_scores_gemma":[0.9988281,0.00059717643,0.00018156014,0.00019611383,0.00013274902,0.00006424719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005335085,0.00025310135,0.0002788837,0.0006484752,0.0003792775,0.0007986607,0.00057386846,0.0005200137,0.0012265973],"category_scores_gemma":[0.0025348268,0.00023527912,0.0003091045,0.00040723212,0.001287801,0.0008537532,0.00065931235,0.00057148695,0.0001274065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016804948,0.00010304193,0.0036181472,0.00008061671,0.000030277375,0.00018330886,0.00016135856,0.57645893,0.043712668,0.3688072,0.0005313161,0.0061450456],"study_design_scores_gemma":[0.0000058202468,0.000012937521,0.0004250635,0.0000041162725,0.000003562548,0.000025333577,0.000009236547,0.970393,0.0048606666,0.02413183,0.000114878414,0.000013431332],"about_ca_topic_score_codex":0.002286357,"about_ca_topic_score_gemma":0.0012933791,"teacher_disagreement_score":0.002286357,"about_ca_system_score_codex":0.0011645688,"about_ca_system_score_gemma":0.00092612096,"threshold_uncertainty_score":0.008449614},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015496821,0.0002979854,0.9827707,0.00023885912,0.00007348162,0.000021012216,0.00015527452,0.00025540133,0.00069057377],"genre_scores_gemma":[0.5934444,0.0009302434,0.39303556,0.0003369636,0.000414446,0.000368566,0.0014391955,0.00043750225,0.009593092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957585,0.0028281885,0.00017177059,0.00053440133,0.000441602,0.0002655507],"domain_scores_gemma":[0.9653073,0.028246839,0.0015195019,0.003906708,0.00073555217,0.00028414006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072901193,0.0013249278,0.0020288737,0.0014670995,0.0006091807,0.002870233,0.0028458268,0.002094541,0.0037222938],"category_scores_gemma":[0.033890765,0.0015596123,0.0019188218,0.0018715159,0.0017082928,0.003599019,0.0033283418,0.0034152449,0.00070620637],"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.0008813771,0.0003446196,0.009659581,0.0006432146,0.001800956,0.0005260218,0.0004543065,0.42785555,0.0036470452,0.43402237,0.004904534,0.11526029],"study_design_scores_gemma":[0.00007461023,0.0000492232,0.0010690058,0.00003738666,0.000107670865,0.000053564796,0.000045698358,0.85752463,0.0014805557,0.13745078,0.0020701888,0.00003673238],"about_ca_topic_score_codex":0.0023793073,"about_ca_topic_score_gemma":0.0029129745,"teacher_disagreement_score":0.0072901193,"about_ca_system_score_codex":0.00061404606,"about_ca_system_score_gemma":0.0016093266,"threshold_uncertainty_score":0.03855431},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042907804,0.00013671906,0.9565425,0.000037556994,0.000009274013,0.000007406683,0.000012359791,0.00008498743,0.00026140647],"genre_scores_gemma":[0.7476289,0.0006127601,0.25017402,0.000035236022,0.000059852693,0.00003011081,0.000096002004,0.00010877395,0.001254256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973875,0.00006970878,0.000013240728,0.000060889746,0.00009343531,0.000023958442],"domain_scores_gemma":[0.9990258,0.00068551913,0.000127335,0.00007445619,0.000057706515,0.000029160854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082863006,0.00042664888,0.0005294704,0.00062493375,0.00015655647,0.0004934361,0.0003673687,0.0005395673,0.0005452912],"category_scores_gemma":[0.0040341695,0.0002627371,0.00049759017,0.0003375859,0.0005809834,0.0009830456,0.00071447116,0.0008807241,0.00014989157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000489519,0.00007091143,0.0032175486,0.0004170794,0.00015114404,0.0005784265,0.00039851468,0.33572236,0.18756129,0.071263134,0.0005880264,0.39954203],"study_design_scores_gemma":[0.000008955097,0.00010970072,0.002199387,0.00002188677,0.000027686607,0.00032122308,0.000038053407,0.937163,0.028253531,0.030658178,0.0011634823,0.000034856017],"about_ca_topic_score_codex":0.00022113282,"about_ca_topic_score_gemma":0.00021641422,"teacher_disagreement_score":0.00082863006,"about_ca_system_score_codex":0.00021401301,"about_ca_system_score_gemma":0.000197513,"threshold_uncertainty_score":0.0043822527},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021154254,0.0001304092,0.99668723,0.00005040003,0.000032796488,0.000008736839,0.000011954342,0.000104578896,0.0008584776],"genre_scores_gemma":[0.1937704,0.0010742497,0.79834026,0.00016952581,0.00016577508,0.000094461924,0.00014011265,0.00012698738,0.0061182994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945205,0.00014037038,0.00002307461,0.00009452248,0.0002581181,0.000031817704],"domain_scores_gemma":[0.99925786,0.00038504376,0.000057780882,0.00008304054,0.00018855643,0.000027690912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068588636,0.00061923935,0.00074589567,0.00061977666,0.00034965135,0.0008225109,0.0007337928,0.0007855207,0.0018684603],"category_scores_gemma":[0.0029234788,0.00034219344,0.00069378654,0.0005187441,0.0010305125,0.0014570263,0.0010270238,0.0011207284,0.0005654236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001897277,0.00008143978,0.00074286846,0.00026964894,0.0001499442,0.00014268668,0.00018687792,0.48272473,0.033801083,0.17707519,0.0035247004,0.3011111],"study_design_scores_gemma":[0.000012561514,0.00003028334,0.00019760407,0.0000110431,0.000012558052,0.000055556986,0.000007956771,0.97174996,0.005104194,0.019158531,0.0036385127,0.000021196109],"about_ca_topic_score_codex":0.0018839048,"about_ca_topic_score_gemma":0.0018431558,"teacher_disagreement_score":0.0018839048,"about_ca_system_score_codex":0.00045239803,"about_ca_system_score_gemma":0.0010108746,"threshold_uncertainty_score":0.00625062},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015599221,0.00015609518,0.9829473,0.000053108917,0.000027506465,0.000016826043,0.000017019107,0.00029421152,0.0008887253],"genre_scores_gemma":[0.6424118,0.000295526,0.35364252,0.00018734878,0.000092975686,0.00009031834,0.000083804975,0.000046549132,0.003149082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961394,0.00008235932,0.000022557953,0.000060010494,0.00017772689,0.000043526445],"domain_scores_gemma":[0.9996332,0.00014323561,0.000045653887,0.000056090907,0.000111051,0.00001081313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005631413,0.00040376626,0.00035407126,0.00041020103,0.00026692593,0.0005694333,0.0006046627,0.00058081234,0.0009066581],"category_scores_gemma":[0.0015775895,0.00016885034,0.00036634272,0.0003503865,0.00039956928,0.0007012559,0.0005162295,0.00066669274,0.00045338296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007377185,0.00013904959,0.0007537861,0.00014306838,0.00012375362,0.0001240023,0.00009974522,0.2070122,0.22223422,0.04920189,0.0026451666,0.5167855],"study_design_scores_gemma":[0.00003134673,0.00010683508,0.0003623252,0.000007936542,0.00002645726,0.00011400171,0.000011182471,0.93625593,0.051235415,0.009899938,0.001924437,0.000024177712],"about_ca_topic_score_codex":0.00061043986,"about_ca_topic_score_gemma":0.0007967876,"teacher_disagreement_score":0.0009066581,"about_ca_system_score_codex":0.00034223715,"about_ca_system_score_gemma":0.00050233264,"threshold_uncertainty_score":0.003033042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010835254,0.015194206,0.9043341,0.000494137,0.001438422,0.000030027642,0.0002039834,0.001283323,0.07593828],"genre_scores_gemma":[0.0430376,0.043906357,0.64933723,0.0008115398,0.0036787647,0.00023388266,0.0011758592,0.0016018886,0.2562168],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995602,0.000075702286,0.000027451668,0.00006981161,0.00024670857,0.000020276291],"domain_scores_gemma":[0.9995376,0.00022837588,0.000020505411,0.000098628174,0.00010157688,0.000013438583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045328966,0.001321931,0.0012824837,0.0009967397,0.0002462662,0.0019745005,0.0007085831,0.0009195931,0.01859204],"category_scores_gemma":[0.001227895,0.0004451017,0.00056310964,0.0022470322,0.0009601059,0.0014201704,0.00083652785,0.0024029284,0.015544201],"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.000056472407,0.000047777503,0.00010632432,0.00081776583,0.0000696179,0.00014811689,0.00014840803,0.015535509,0.012441657,0.32099694,0.0818919,0.56773955],"study_design_scores_gemma":[0.00002882046,0.00011551548,0.0006812389,0.00028292203,0.000057548175,0.00091469503,0.000041621795,0.11469423,0.012098056,0.42129812,0.44970095,0.00008629593],"about_ca_topic_score_codex":0.00037152017,"about_ca_topic_score_gemma":0.00059086276,"teacher_disagreement_score":0.01859204,"about_ca_system_score_codex":0.00031967566,"about_ca_system_score_gemma":0.0005763606,"threshold_uncertainty_score":0.062196553},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.411452,0.0042720153,0.5700673,0.0014875956,0.00021039079,0.00027853993,0.000528824,0.002866937,0.00883639],"genre_scores_gemma":[0.8714814,0.0007426427,0.12560944,0.000087346656,0.000075508935,0.0001325496,0.0005636133,0.00008900378,0.0012185021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996829,0.0014669065,0.00017365532,0.00026254877,0.0010125897,0.00025537948],"domain_scores_gemma":[0.99265176,0.004514342,0.00040671026,0.00095576834,0.001358681,0.00011269776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035072097,0.00083381217,0.000999196,0.0009681687,0.00062984956,0.0010669901,0.0005648249,0.00072483305,0.0017465051],"category_scores_gemma":[0.012255674,0.00022834836,0.00062903063,0.0013488361,0.00048948766,0.0014964794,0.0008937061,0.00088297686,0.0006224467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011167674,0.00042290718,0.0042312974,0.00021356689,0.00022674716,0.00008123396,0.00020654082,0.65103805,0.00936526,0.0096580675,0.0055540586,0.31788543],"study_design_scores_gemma":[0.0000132836685,0.00011849737,0.0010986434,0.000006014224,0.000012021872,0.00003094312,0.000036175,0.9943229,0.002368915,0.0015608073,0.00042123356,0.000010549516],"about_ca_topic_score_codex":0.0032959308,"about_ca_topic_score_gemma":0.0017881878,"teacher_disagreement_score":0.0035072097,"about_ca_system_score_codex":0.0008484161,"about_ca_system_score_gemma":0.001151721,"threshold_uncertainty_score":0.018548131},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060518708,0.00079540745,0.909926,0.0016560672,0.0001607936,0.00005180306,0.00023619107,0.0001854327,0.026469598],"genre_scores_gemma":[0.9333712,0.0006463583,0.05291114,0.00034962798,0.00011388774,0.00010568946,0.00019735133,0.00006333079,0.012241395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996057,0.00010015893,0.000021164666,0.00010624643,0.000112995986,0.000053725817],"domain_scores_gemma":[0.99943095,0.00019083831,0.00009404429,0.00007046091,0.00014068368,0.00007300084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006646585,0.00038568967,0.0007198303,0.0005455358,0.000707869,0.0015466852,0.0009840028,0.0009064279,0.0049542324],"category_scores_gemma":[0.0021604162,0.00019551374,0.0007043331,0.00047227065,0.0016034081,0.0026125966,0.0012421476,0.0015148383,0.00054698874],"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.000042972446,0.000024083576,0.0008863301,0.000050080012,0.000021725768,0.00011505903,0.0002284681,0.037297472,0.0018811123,0.9514564,0.001237321,0.0067590876],"study_design_scores_gemma":[0.000012199355,0.000026532849,0.0002677153,0.000014741667,0.000008818095,0.00009219459,0.00008435597,0.63504225,0.0004007254,0.36260632,0.0014234366,0.000020605674],"about_ca_topic_score_codex":0.003356352,"about_ca_topic_score_gemma":0.0021942484,"teacher_disagreement_score":0.0049542324,"about_ca_system_score_codex":0.0009974517,"about_ca_system_score_gemma":0.00084518304,"threshold_uncertainty_score":0.016573489},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008893798,0.00035826713,0.9889787,0.00034285523,0.000043549157,0.00014025957,0.000039941806,0.0001237385,0.0010789133],"genre_scores_gemma":[0.13421494,0.00075244345,0.8618432,0.00038461373,0.00014152534,0.00096232735,0.00018669502,0.0003181006,0.0011961164],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9639553,0.027225923,0.0016124892,0.0037012731,0.0026468576,0.0008581099],"domain_scores_gemma":[0.95412815,0.034728758,0.0019548975,0.0058738464,0.002827028,0.0004872895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03331627,0.0020211798,0.002524166,0.0013268966,0.0012274255,0.002198378,0.0015406675,0.0024706726,0.003057558],"category_scores_gemma":[0.1180648,0.0016887931,0.0012884892,0.0020091275,0.0063815475,0.0037862558,0.004460134,0.0038791571,0.0013781198],"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.0020032718,0.00041691287,0.0023284524,0.000893918,0.00044119623,0.00015658987,0.0010868263,0.13428567,0.023149356,0.3866384,0.0037127621,0.44488677],"study_design_scores_gemma":[0.00041390755,0.00038030642,0.0037452746,0.00027092194,0.00017648385,0.00013352468,0.00016297014,0.4120791,0.01376603,0.56462646,0.0040903958,0.00015471995],"about_ca_topic_score_codex":0.0014082515,"about_ca_topic_score_gemma":0.001363882,"teacher_disagreement_score":0.03331627,"about_ca_system_score_codex":0.0018391608,"about_ca_system_score_gemma":0.003350766,"threshold_uncertainty_score":0.17619538},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030595927,0.00042096147,0.9672633,0.00014784165,0.000045766938,0.000031051386,0.00006211802,0.00025414865,0.0011789488],"genre_scores_gemma":[0.61475915,0.001109021,0.3802397,0.0001644415,0.00016443773,0.000094732975,0.00046098838,0.00007963573,0.0029279075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965477,0.00008637175,0.000018995192,0.000051767114,0.00016190011,0.000026236898],"domain_scores_gemma":[0.9993636,0.0003034992,0.000080723104,0.00011405145,0.00011356175,0.000024566525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046359195,0.00053597643,0.00056498614,0.00046763287,0.00019251126,0.00042038382,0.00044167563,0.0005692288,0.00081627513],"category_scores_gemma":[0.0018256946,0.00016786516,0.00046613504,0.0007013184,0.00027161516,0.0007701475,0.00069668004,0.00054505473,0.00028674773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077378243,0.00017001294,0.0032957338,0.00028843796,0.00016453787,0.00062953023,0.00017496149,0.29605404,0.09982489,0.01508685,0.003090602,0.58044654],"study_design_scores_gemma":[0.000020443542,0.00011456458,0.001014383,0.000014707795,0.000029725272,0.00039972708,0.00001940968,0.9735832,0.021179443,0.0017359793,0.00187398,0.0000144448495],"about_ca_topic_score_codex":0.0010074112,"about_ca_topic_score_gemma":0.0013379597,"teacher_disagreement_score":0.0010074112,"about_ca_system_score_codex":0.00015938551,"about_ca_system_score_gemma":0.00043451224,"threshold_uncertainty_score":0.0027307272},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049880445,0.000060605573,0.9944582,0.00001563162,0.00000943815,0.0000088144725,0.000007413362,0.00012711357,0.00032466487],"genre_scores_gemma":[0.2162147,0.00047228622,0.77929443,0.000046171215,0.000045527504,0.000106047606,0.00010361878,0.00007029348,0.003647028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995921,0.00011858883,0.00002005671,0.000085716965,0.00015083775,0.000032646094],"domain_scores_gemma":[0.99948114,0.00027163967,0.000055432803,0.00006280413,0.00011213763,0.000016952676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007931552,0.00069204654,0.0007289919,0.00047208476,0.00035683112,0.0006440059,0.00061665534,0.00087819976,0.0011709917],"category_scores_gemma":[0.0016978363,0.0004043662,0.00067034445,0.0006147458,0.00054813403,0.0012323721,0.0007497897,0.0007924515,0.00074286957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051629584,0.00014952195,0.001652461,0.00031909422,0.00016765708,0.00024321835,0.00017190653,0.295167,0.18334271,0.031415995,0.001173587,0.48568052],"study_design_scores_gemma":[0.000011818384,0.000069727444,0.00024554785,0.000008976979,0.000022333932,0.000119091754,0.000010852433,0.9650446,0.029810635,0.0030041928,0.0016356872,0.000016590286],"about_ca_topic_score_codex":0.00084260857,"about_ca_topic_score_gemma":0.00097389583,"teacher_disagreement_score":0.0011709917,"about_ca_system_score_codex":0.00023223246,"about_ca_system_score_gemma":0.00074433885,"threshold_uncertainty_score":0.004194677},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004279818,0.00019020677,0.9939837,0.000073752126,0.000024726729,0.000011094859,0.00001128698,0.00018901008,0.0012365388],"genre_scores_gemma":[0.6123134,0.0009133666,0.3795688,0.00009919489,0.00007342575,0.00015563396,0.0001153245,0.00010406476,0.00665677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973387,0.00008050971,0.000014259843,0.000046185152,0.00010949027,0.000015621457],"domain_scores_gemma":[0.9996722,0.00017305676,0.00004572674,0.000041596766,0.000054500084,0.000012922111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031533587,0.00041361232,0.0005401681,0.0006440725,0.00044055,0.0005586143,0.00035275074,0.0004976023,0.001398067],"category_scores_gemma":[0.0014118999,0.00020423002,0.00042438347,0.00033043016,0.0007093732,0.0010300355,0.0009556181,0.0006192355,0.00040177928],"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.00013401535,0.000033161734,0.0010469981,0.00031043205,0.00010889668,0.00021364045,0.00035109295,0.5217293,0.030278089,0.27909842,0.0011250848,0.16557094],"study_design_scores_gemma":[0.0000064480546,0.000021492144,0.00010152117,0.00001072963,0.0000063370303,0.000052337473,0.000010788208,0.9734822,0.0021618672,0.022397567,0.0017366072,0.000012025432],"about_ca_topic_score_codex":0.0013391586,"about_ca_topic_score_gemma":0.0009163063,"teacher_disagreement_score":0.001398067,"about_ca_system_score_codex":0.0004537044,"about_ca_system_score_gemma":0.0007090032,"threshold_uncertainty_score":0.004676938},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002558334,0.000074700336,0.99613523,0.000064130036,0.00002959541,0.00002562127,0.00007564895,0.00039620494,0.0006406595],"genre_scores_gemma":[0.13921025,0.00030962127,0.8530164,0.00019228095,0.00009290149,0.00022871437,0.0010487702,0.00030388974,0.0055971975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990231,0.00019451023,0.00007768076,0.000267434,0.0003469903,0.00009032257],"domain_scores_gemma":[0.9988205,0.00064191705,0.000087090244,0.00014316243,0.00026342904,0.000044026474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009330551,0.0008660062,0.0010222192,0.00085596426,0.0006359481,0.0011818238,0.0015115199,0.0011577879,0.0042666276],"category_scores_gemma":[0.003914909,0.00046825464,0.0009632321,0.00076803385,0.00069379056,0.0017561677,0.0014680743,0.001872028,0.0016123096],"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.0002251219,0.00007701048,0.0012420787,0.00020911222,0.00008581182,0.00022271303,0.00027074685,0.44268134,0.014155281,0.09651981,0.0039886306,0.44032228],"study_design_scores_gemma":[0.000014302906,0.000021320253,0.00011064922,0.0000128207,0.000008916026,0.000062420055,0.000009980392,0.9743162,0.0031678702,0.020645589,0.0016151969,0.000014859881],"about_ca_topic_score_codex":0.005869839,"about_ca_topic_score_gemma":0.004417011,"teacher_disagreement_score":0.005869839,"about_ca_system_score_codex":0.0010053698,"about_ca_system_score_gemma":0.0025442953,"threshold_uncertainty_score":0.014273286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013884424,0.002810009,0.9644671,0.00032193903,0.00064117677,0.00022850941,0.0029617744,0.0027896215,0.011895462],"genre_scores_gemma":[0.46250045,0.006769994,0.4877021,0.00055518415,0.0010749776,0.00064475276,0.011633203,0.0008158667,0.028303443],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991067,0.000077682664,0.000064372085,0.0002528334,0.00040474813,0.000093669056],"domain_scores_gemma":[0.9990128,0.00023853977,0.00011711395,0.0001709666,0.0004280216,0.000032549575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006933371,0.0011728867,0.00092455425,0.0034383668,0.0004813321,0.0017241045,0.0009177379,0.00090339984,0.012473766],"category_scores_gemma":[0.0031754165,0.00020888449,0.0010834417,0.0042051123,0.0003695509,0.0018925762,0.0008527263,0.00090235163,0.007764999],"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.00023566424,0.00008227831,0.0027245535,0.0006226833,0.00013437888,0.00036280032,0.00015634317,0.011566665,0.05303859,0.012220259,0.02053153,0.8983242],"study_design_scores_gemma":[0.00007257155,0.00060440804,0.030548614,0.00042884663,0.00041039326,0.0034998723,0.0007361522,0.53312767,0.08970973,0.05139007,0.289125,0.00034666996],"about_ca_topic_score_codex":0.0019495562,"about_ca_topic_score_gemma":0.0010305694,"teacher_disagreement_score":0.012473766,"about_ca_system_score_codex":0.00042582367,"about_ca_system_score_gemma":0.00055640616,"threshold_uncertainty_score":0.041728914},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046749436,0.28976497,0.69298905,0.00253167,0.005560679,0.000106954874,0.00036562156,0.0006317006,0.0075818393],"genre_scores_gemma":[0.0076466757,0.39041007,0.5511094,0.0029714922,0.02512256,0.00047705337,0.0007871208,0.00073575164,0.020739874],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988589,0.00032179043,0.00014692034,0.00026382357,0.0003627263,0.000045823068],"domain_scores_gemma":[0.9959116,0.0031109308,0.000108534274,0.00015517902,0.0005936939,0.0001200554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035009258,0.0025650873,0.0020738097,0.003121805,0.00047324353,0.0024595067,0.0015482339,0.0038330024,0.008724216],"category_scores_gemma":[0.00672093,0.0017776111,0.0019724935,0.004384291,0.001682728,0.003876866,0.0017352162,0.0062239845,0.008867872],"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.0000943287,0.00030585227,0.0004713791,0.0041905083,0.00026822547,0.00037464796,0.00035340237,0.009634203,0.006063145,0.15517758,0.11672478,0.7063419],"study_design_scores_gemma":[0.000040686184,0.00025228236,0.0013891968,0.0015424014,0.00014998941,0.0014512372,0.00009651093,0.020584648,0.002530637,0.27847445,0.6932198,0.00026819203],"about_ca_topic_score_codex":0.0017603517,"about_ca_topic_score_gemma":0.002049328,"teacher_disagreement_score":0.008724216,"about_ca_system_score_codex":0.00080926804,"about_ca_system_score_gemma":0.0011595489,"threshold_uncertainty_score":0.029185414},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014804494,0.00013561721,0.9831387,0.00006333711,0.00003880266,0.000044212215,0.000019790583,0.00047922684,0.0012757841],"genre_scores_gemma":[0.28178367,0.00044442574,0.7101837,0.00015301377,0.00009977241,0.0001901864,0.00023117613,0.00013644388,0.006777621],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986634,0.00014345492,0.000097371296,0.00033351502,0.0006658472,0.000096399475],"domain_scores_gemma":[0.9987596,0.00025573923,0.00012911466,0.00014732497,0.0006403827,0.00006787436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001099871,0.0009549764,0.0011712656,0.0016915174,0.0007004404,0.0010276169,0.0013984604,0.0012056401,0.0019069167],"category_scores_gemma":[0.0026656345,0.00048488885,0.00085211877,0.00095970347,0.00084791717,0.0016174875,0.0014676829,0.00094869366,0.0009883214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007882395,0.0001387058,0.003564236,0.00029293256,0.00014397889,0.00038296604,0.00037302304,0.06335386,0.14504373,0.014577123,0.0022033444,0.7691379],"study_design_scores_gemma":[0.000053764572,0.00018050926,0.0011731163,0.000017016202,0.000065343775,0.0006477751,0.000052637904,0.91346633,0.07327813,0.0069814716,0.004032605,0.00005131122],"about_ca_topic_score_codex":0.0014386448,"about_ca_topic_score_gemma":0.0010527024,"teacher_disagreement_score":0.0019069167,"about_ca_system_score_codex":0.00043876524,"about_ca_system_score_gemma":0.0010637672,"threshold_uncertainty_score":0.0063793063},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050709355,0.00012346946,0.9940201,0.000043673623,0.000032086944,0.000014596807,0.000008425061,0.00020418364,0.0004825982],"genre_scores_gemma":[0.24246092,0.00028851355,0.7546401,0.00013837448,0.000078043835,0.00010921546,0.00007297541,0.000047248934,0.0021645876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994605,0.00012503326,0.000035284713,0.00013418359,0.00020221004,0.000042758802],"domain_scores_gemma":[0.99931836,0.00031590558,0.00007880718,0.00009408142,0.0001572229,0.000035575795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069089,0.0005714886,0.0006688955,0.0007138467,0.00040256736,0.00054486725,0.0008530156,0.00089032436,0.0015159263],"category_scores_gemma":[0.0023029856,0.00029943357,0.00042671605,0.0005069393,0.00059081207,0.0014585026,0.0010104837,0.00071115134,0.0005625461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068667496,0.00019471058,0.0012145336,0.00030078474,0.00011748118,0.00023498532,0.00028673245,0.2576427,0.093024224,0.07588102,0.0027734283,0.5676427],"study_design_scores_gemma":[0.00003930775,0.0000837052,0.00013307789,0.000008692984,0.000010518711,0.00015204553,0.000008392136,0.9842598,0.0072264243,0.006906651,0.0011529784,0.000018420571],"about_ca_topic_score_codex":0.0008840704,"about_ca_topic_score_gemma":0.000709687,"teacher_disagreement_score":0.0015159263,"about_ca_system_score_codex":0.00029670665,"about_ca_system_score_gemma":0.0008757563,"threshold_uncertainty_score":0.0050712824},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02921799,0.00026579964,0.95971835,0.00023683808,0.00009057256,0.00015193239,0.00037192975,0.00830803,0.0016386164],"genre_scores_gemma":[0.19150859,0.00017768318,0.8025072,0.00015468507,0.00006891289,0.00024691792,0.0022174239,0.0009464487,0.0021720657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813545,0.0003878885,0.00010985165,0.00066544284,0.00049987936,0.00020148027],"domain_scores_gemma":[0.9960135,0.00081431324,0.0002854768,0.0006824416,0.0020865502,0.00011778355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023180875,0.002422614,0.0013911222,0.0032669418,0.0014053441,0.0017724853,0.0020780803,0.0014533022,0.0022673092],"category_scores_gemma":[0.008324765,0.0005752646,0.001543381,0.0022631977,0.00075576745,0.0018768241,0.0012864463,0.0014902452,0.003302512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042101793,0.00039468874,0.0048256647,0.00031776892,0.0003513844,0.00012657525,0.0003083322,0.20250657,0.056811918,0.006659706,0.019462118,0.7078142],"study_design_scores_gemma":[0.000024703395,0.000072444156,0.0018626885,0.00002337011,0.000040653456,0.00006042468,0.00006744963,0.96251214,0.028846007,0.0036821647,0.0027585162,0.000049512895],"about_ca_topic_score_codex":0.010497716,"about_ca_topic_score_gemma":0.0123367505,"teacher_disagreement_score":0.010497716,"about_ca_system_score_codex":0.0014814303,"about_ca_system_score_gemma":0.0025929112,"threshold_uncertainty_score":0.020873249},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01220443,0.000038224593,0.9868983,0.00004151643,0.000011840185,0.000015172494,0.00002076981,0.0004797066,0.00029005524],"genre_scores_gemma":[0.21446456,0.000060868402,0.7838045,0.00007497824,0.000021077065,0.00007455086,0.00020313184,0.00014575235,0.0011504911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988399,0.00038067487,0.00006550063,0.000219464,0.00042743402,0.000067035005],"domain_scores_gemma":[0.9983943,0.0006977173,0.00021755729,0.00026206128,0.0003879547,0.000040349696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016382383,0.0009995179,0.00088211626,0.0010746082,0.00046822298,0.00069514004,0.0009066327,0.001268246,0.0011023523],"category_scores_gemma":[0.0037899483,0.0005469613,0.0010362042,0.0009966984,0.0008632479,0.0013063399,0.0013112725,0.0010446317,0.00048849836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003257946,0.0001718278,0.0010620846,0.00019033249,0.00012513356,0.00009825763,0.00015915255,0.6402473,0.08895801,0.0101077845,0.0021412345,0.25641316],"study_design_scores_gemma":[0.0000070904985,0.000013059767,0.00009389922,0.0000029373282,0.000002934148,0.000013134822,0.0000038893986,0.9917548,0.006673401,0.0012339072,0.00019256878,0.000008421082],"about_ca_topic_score_codex":0.002830653,"about_ca_topic_score_gemma":0.002586681,"teacher_disagreement_score":0.002830653,"about_ca_system_score_codex":0.00048188758,"about_ca_system_score_gemma":0.0017557532,"threshold_uncertainty_score":0.008663893},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022682752,0.00004109955,0.99718744,0.00003457973,0.0000073367532,0.000012121805,0.000020215391,0.00018748507,0.00024138665],"genre_scores_gemma":[0.09890982,0.00014091504,0.8986532,0.00006791389,0.000028284492,0.00010149159,0.00021642042,0.000075235504,0.0018067071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993956,0.00019117931,0.000034370503,0.00011458835,0.00022343665,0.00004093433],"domain_scores_gemma":[0.99926764,0.00034558185,0.00008860992,0.00008998327,0.00018441987,0.000023766483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008631977,0.0007384145,0.00077763497,0.00057425443,0.00030134778,0.000629359,0.00084082165,0.0011923204,0.0014110873],"category_scores_gemma":[0.002530583,0.00035087767,0.0008083038,0.0007652088,0.0006010572,0.00087189424,0.000978274,0.0010633005,0.0008482484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018879901,0.00008145095,0.00050048635,0.00018699419,0.000102837446,0.00010400144,0.00009851638,0.7259351,0.02961816,0.019360937,0.0027561977,0.22106647],"study_design_scores_gemma":[0.000008028887,0.00001652809,0.000055618966,0.000003547019,0.0000037572188,0.00002177991,0.000004527224,0.9934122,0.0025513952,0.003414864,0.0005012909,0.0000065460476],"about_ca_topic_score_codex":0.0025271224,"about_ca_topic_score_gemma":0.0021007892,"teacher_disagreement_score":0.0025271224,"about_ca_system_score_codex":0.0004329467,"about_ca_system_score_gemma":0.0014851827,"threshold_uncertainty_score":0.0050247908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011360171,0.00010551753,0.99731135,0.00005191984,0.000035959736,0.000021808293,0.00004572049,0.00048625,0.000805435],"genre_scores_gemma":[0.021495895,0.00029441906,0.97281444,0.00007811074,0.00006822029,0.00007530643,0.00031025492,0.000111008325,0.0047524376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994418,0.00009566617,0.000035106623,0.0000863985,0.00030586266,0.00003510016],"domain_scores_gemma":[0.99952507,0.00017268199,0.000034959234,0.000103990256,0.0001362869,0.000027065771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046003502,0.0014512291,0.0009021974,0.00086691434,0.0005273666,0.0011191505,0.00087193254,0.0010771044,0.007322539],"category_scores_gemma":[0.0014765686,0.0005239909,0.00093366596,0.0012930348,0.00043922555,0.0017801413,0.0015856881,0.0013317448,0.007527476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045521586,0.00013400154,0.00023333648,0.00034056592,0.000102876285,0.00027924858,0.000082602506,0.022867888,0.21611144,0.03414857,0.0074724318,0.71777195],"study_design_scores_gemma":[0.00016104673,0.00029281768,0.00072220474,0.000055997585,0.00010711208,0.0017650789,0.00005409654,0.7364551,0.20145723,0.027462885,0.031347353,0.000119051954],"about_ca_topic_score_codex":0.00092476927,"about_ca_topic_score_gemma":0.0017669575,"teacher_disagreement_score":0.007322539,"about_ca_system_score_codex":0.00027800284,"about_ca_system_score_gemma":0.001207713,"threshold_uncertainty_score":0.024496377},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019233657,0.00017806911,0.97877574,0.00013732674,0.000039714898,0.00009526045,0.00006451862,0.0003368302,0.0011389023],"genre_scores_gemma":[0.29577747,0.00047468935,0.70162076,0.00008882622,0.00004269096,0.00019508578,0.00022756388,0.00007660922,0.0014962839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834025,0.0004009169,0.00016126434,0.000453115,0.0005111523,0.00013325432],"domain_scores_gemma":[0.99470526,0.0033921706,0.0006236137,0.0002870834,0.00087057974,0.00012134426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00285043,0.0007836135,0.0006789348,0.0026874128,0.0006577151,0.0022883955,0.00086969056,0.00084641454,0.0019159646],"category_scores_gemma":[0.012141026,0.0004540486,0.000661167,0.0012848201,0.0013816238,0.0019126631,0.0010722338,0.0013598455,0.00047102576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087093515,0.00022458522,0.014681342,0.00064700405,0.00011632474,0.00038174822,0.00070218934,0.11538257,0.03635695,0.077463284,0.0021281124,0.75104487],"study_design_scores_gemma":[0.00014101164,0.00036403936,0.0076009417,0.00014105643,0.00008772512,0.00061152654,0.00030251287,0.85748005,0.05278704,0.0737744,0.0065952973,0.00011451413],"about_ca_topic_score_codex":0.0021635364,"about_ca_topic_score_gemma":0.0015960019,"teacher_disagreement_score":0.00285043,"about_ca_system_score_codex":0.00070458924,"about_ca_system_score_gemma":0.0023291016,"threshold_uncertainty_score":0.01507467},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.948621,0.00020558287,0.048078153,0.00008950126,0.000035280023,0.000039099756,0.00009986826,0.00014418077,0.002687387],"genre_scores_gemma":[0.9925897,0.00004754269,0.0068986984,0.000013688638,0.000007294935,0.000009226746,0.00005726682,0.000010736131,0.00036580802],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999943,0.000009432171,0.0000028591942,0.000016159125,0.000014957538,0.00001360199],"domain_scores_gemma":[0.9998461,0.000027011225,0.000051009018,0.000015373003,0.000038881997,0.000021585725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000085947446,0.00020137477,0.00015319399,0.0005012347,0.00022145819,0.0003768214,0.00015439281,0.00019427444,0.0005660278],"category_scores_gemma":[0.0003515269,0.0001333877,0.00015907275,0.00021709832,0.00033295454,0.00033154277,0.00028059783,0.000256623,0.00004737137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006505118,0.0004066581,0.07298033,0.0003826606,0.00021486492,0.00271985,0.0012056382,0.2441169,0.5088643,0.034063302,0.003844931,0.13055016],"study_design_scores_gemma":[0.000119938755,0.00033698377,0.09960243,0.000058545204,0.00007541623,0.00054272584,0.00053857296,0.83722144,0.047795534,0.009778652,0.0038447462,0.00008506992],"about_ca_topic_score_codex":0.00081644545,"about_ca_topic_score_gemma":0.0009209952,"teacher_disagreement_score":0.00081644545,"about_ca_system_score_codex":0.0001392425,"about_ca_system_score_gemma":0.00017712,"threshold_uncertainty_score":0.00189358},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030971374,0.00007524056,0.99850637,0.00007171533,0.000016213282,0.0000070004053,0.000016313912,0.000049481143,0.0009478949],"genre_scores_gemma":[0.061403416,0.0006858696,0.9267563,0.00018558407,0.00018801862,0.00020494402,0.0001669248,0.00020161644,0.010207271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916244,0.00028234575,0.00003854848,0.00019252047,0.00024891863,0.00007512604],"domain_scores_gemma":[0.9988116,0.00083167397,0.00006878577,0.00006287768,0.00018784076,0.000037142196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010439149,0.0010686575,0.0009853353,0.00096706103,0.00057463994,0.0015257878,0.0013746147,0.0011859207,0.0054690233],"category_scores_gemma":[0.0031068497,0.00087683264,0.0010268678,0.0015814692,0.0012334947,0.0015462855,0.0014164803,0.0032846872,0.0013928044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043631815,0.00006776098,0.00017722767,0.00015395603,0.000046584275,0.00007225511,0.000085011816,0.7113424,0.0029718075,0.17510024,0.0037275844,0.10621162],"study_design_scores_gemma":[0.0000046343,0.000020677884,0.000022815044,0.000008321352,0.000005111658,0.000020138294,0.0000075397993,0.96422154,0.0005026927,0.032787424,0.002390718,0.000008351356],"about_ca_topic_score_codex":0.0036814057,"about_ca_topic_score_gemma":0.003285626,"teacher_disagreement_score":0.0054690233,"about_ca_system_score_codex":0.0010835769,"about_ca_system_score_gemma":0.0014926199,"threshold_uncertainty_score":0.018295705},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010332268,0.0004273043,0.98782164,0.00012732865,0.000049273756,0.000039133512,0.000041719824,0.0005493568,0.00061211584],"genre_scores_gemma":[0.46566147,0.0006888397,0.5297436,0.00018880967,0.000115528,0.00019213615,0.00048868207,0.0002294112,0.0026915004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990921,0.00023138622,0.00007819662,0.0002256966,0.00026330524,0.00010925638],"domain_scores_gemma":[0.9989772,0.00036205765,0.00007896463,0.00011533166,0.00042136788,0.000045169396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017290851,0.0012514049,0.0011312821,0.0015878237,0.0006435381,0.0013249612,0.00096335966,0.0009531153,0.0014894394],"category_scores_gemma":[0.0047305576,0.0003892486,0.0014966954,0.0012478544,0.0007278326,0.0019836465,0.0017379492,0.0015097075,0.000565915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048452875,0.0001707964,0.0010773705,0.00015249632,0.00025966731,0.00014023682,0.00018265993,0.3171298,0.02525749,0.010670252,0.0036538364,0.64082086],"study_design_scores_gemma":[0.0000070602896,0.000027905113,0.0003035255,0.000005742427,0.000022834927,0.000033759105,0.000017765688,0.9906413,0.0049304874,0.0033512427,0.00064012065,0.00001824764],"about_ca_topic_score_codex":0.0037623418,"about_ca_topic_score_gemma":0.0027177306,"teacher_disagreement_score":0.0037623418,"about_ca_system_score_codex":0.00073513377,"about_ca_system_score_gemma":0.0011169949,"threshold_uncertainty_score":0.009144366},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001403087,0.0043987194,0.98540753,0.0006988094,0.0004156783,0.00007688015,0.00024962483,0.0002086135,0.0071410285],"genre_scores_gemma":[0.08216727,0.018354988,0.88719034,0.0006899731,0.0014082629,0.0006937916,0.0010769903,0.00030282655,0.008115675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980477,0.00055785343,0.00015441353,0.00038345568,0.00078410853,0.000072516006],"domain_scores_gemma":[0.9981415,0.0008611404,0.00013066626,0.00018540947,0.0006225448,0.00005871526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002630569,0.0014144859,0.0009855762,0.0032191777,0.00075686834,0.002225945,0.0010573837,0.0012108617,0.0044514174],"category_scores_gemma":[0.008907707,0.00064436876,0.0015171675,0.0041955886,0.0021673061,0.0015668842,0.0017944571,0.0032822965,0.0038896701],"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.000025840542,0.000040547562,0.0008774472,0.00057892763,0.0001150924,0.00036374983,0.00045902346,0.022323472,0.0028005035,0.7537292,0.010883748,0.20780255],"study_design_scores_gemma":[0.000013407252,0.00008108263,0.0021505977,0.00031183663,0.00006280165,0.0006625498,0.00014160213,0.13384022,0.0014319253,0.80160636,0.059598956,0.00009860751],"about_ca_topic_score_codex":0.0040179053,"about_ca_topic_score_gemma":0.0020660758,"teacher_disagreement_score":0.0044514174,"about_ca_system_score_codex":0.0008026697,"about_ca_system_score_gemma":0.0021694242,"threshold_uncertainty_score":0.014891505},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075025423,0.0001378562,0.9913223,0.00005797393,0.00002152766,0.00002166026,0.000031984873,0.00052880135,0.000375332],"genre_scores_gemma":[0.1633268,0.0006353574,0.83110046,0.00011060838,0.000040372237,0.00011817241,0.00029070533,0.00009999909,0.00427753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958247,0.00010168195,0.000023574836,0.00009182537,0.00017322434,0.000027129789],"domain_scores_gemma":[0.99953604,0.00021725756,0.00004361047,0.000051637453,0.00013824449,0.000013259155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006969928,0.00073717,0.0006386008,0.0006399802,0.00025066404,0.0005387484,0.00048199922,0.00075662497,0.0018125509],"category_scores_gemma":[0.0017940131,0.0003132662,0.0006151162,0.00059682375,0.00028673376,0.00095934194,0.0005385325,0.0006472329,0.0009858749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057181565,0.00011638852,0.0019396708,0.00031338082,0.00012682358,0.0003267241,0.00014669678,0.09834543,0.12445457,0.004744672,0.002071696,0.7668421],"study_design_scores_gemma":[0.000041472347,0.0001828276,0.0015004183,0.000027357697,0.000053437238,0.00067427265,0.000025834941,0.911102,0.080105826,0.002661066,0.003584773,0.00004070528],"about_ca_topic_score_codex":0.0012442832,"about_ca_topic_score_gemma":0.0013446196,"teacher_disagreement_score":0.0018125509,"about_ca_system_score_codex":0.00024261238,"about_ca_system_score_gemma":0.0007292354,"threshold_uncertainty_score":0.0060635805},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030626243,0.2577641,0.5815311,0.006705728,0.011620038,0.00015784256,0.0011655104,0.0014819031,0.13651113],"genre_scores_gemma":[0.06822532,0.3255709,0.44920892,0.007879546,0.044090893,0.0013291765,0.00375035,0.0023957437,0.09754909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916005,0.00027915067,0.000066723565,0.00016852985,0.0002714227,0.000054184817],"domain_scores_gemma":[0.9982565,0.0012117364,0.00009156924,0.00011972029,0.00024564046,0.000074865115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017703393,0.0027247455,0.0014890345,0.0029855855,0.0005382672,0.001785112,0.0010362698,0.0017782518,0.022449592],"category_scores_gemma":[0.004017497,0.000738664,0.0010621875,0.003593338,0.0015568673,0.004782525,0.0015880784,0.0040957783,0.012229917],"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.00006370631,0.00012836205,0.0004255892,0.0023365677,0.000102268896,0.00035129982,0.0004075503,0.006241041,0.0023411459,0.50521064,0.25529838,0.22709356],"study_design_scores_gemma":[0.00001301002,0.00006730429,0.0006002084,0.000377507,0.000030001265,0.00089950644,0.00008073441,0.009498209,0.0005397424,0.4662361,0.52160877,0.000048949503],"about_ca_topic_score_codex":0.00060965755,"about_ca_topic_score_gemma":0.0005031617,"teacher_disagreement_score":0.022449592,"about_ca_system_score_codex":0.0006484746,"about_ca_system_score_gemma":0.00075132604,"threshold_uncertainty_score":0.075101316},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077286423,0.00015570242,0.99133646,0.000061799445,0.000036245754,0.000024660503,0.00003215707,0.00030414521,0.0003202127],"genre_scores_gemma":[0.10626912,0.000512055,0.8904134,0.000074297255,0.000060878734,0.00013041715,0.00041614968,0.000109075525,0.0020145795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894327,0.00013657684,0.000078304816,0.00025911082,0.0005031878,0.000079415455],"domain_scores_gemma":[0.99915445,0.00014194143,0.00008062459,0.00010196452,0.00048235306,0.000038625596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012668667,0.001035655,0.0012638085,0.0015888241,0.0005594024,0.0009330106,0.0009574284,0.00097049744,0.0008594475],"category_scores_gemma":[0.0024831034,0.0004752179,0.0013200112,0.0019895353,0.000575382,0.0014557198,0.0009502799,0.0017041293,0.0006269759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002992524,0.00013206399,0.0016786548,0.00022871833,0.00013234263,0.0001366863,0.0001997106,0.0907107,0.08617644,0.008488345,0.003131206,0.80868584],"study_design_scores_gemma":[0.000016459582,0.00011544688,0.001354717,0.00001531458,0.000037400314,0.00016013574,0.00004586107,0.9695827,0.02227852,0.002372739,0.003967255,0.000053477655],"about_ca_topic_score_codex":0.0038985724,"about_ca_topic_score_gemma":0.0035594888,"teacher_disagreement_score":0.0038985724,"about_ca_system_score_codex":0.00043127185,"about_ca_system_score_gemma":0.0015763494,"threshold_uncertainty_score":0.007751763},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018476311,0.00020950138,0.98013765,0.000108694716,0.000056618177,0.000012264115,0.000024517813,0.00010408802,0.00087032065],"genre_scores_gemma":[0.5943014,0.0007675513,0.40104958,0.0001385932,0.00017264181,0.00007704293,0.00021471342,0.0000960486,0.0031824159],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834657,0.00077691,0.000079489895,0.00020031935,0.0005409647,0.00005580122],"domain_scores_gemma":[0.9979145,0.0012645118,0.00027497462,0.00021184293,0.0002843875,0.00004974868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001481438,0.0005887889,0.0007598436,0.0009440769,0.0002096359,0.00094181707,0.0004186811,0.0009473211,0.0007784294],"category_scores_gemma":[0.0056985538,0.00020385685,0.0006746256,0.000656922,0.00080663216,0.0010186567,0.0010614566,0.0008080436,0.00043259832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011707951,0.00019681951,0.006245806,0.00067090074,0.00021120314,0.00086789636,0.0004844244,0.15602326,0.26115605,0.12935136,0.0022497268,0.44137168],"study_design_scores_gemma":[0.000016485084,0.00038172133,0.0018913769,0.0000437398,0.000025200578,0.0009136907,0.000052438725,0.9202162,0.045718316,0.027938878,0.0027558724,0.000046109173],"about_ca_topic_score_codex":0.000098083314,"about_ca_topic_score_gemma":0.00010609974,"teacher_disagreement_score":0.001481438,"about_ca_system_score_codex":0.00017735863,"about_ca_system_score_gemma":0.00026772136,"threshold_uncertainty_score":0.0078347325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002960355,0.00019505258,0.9953843,0.00006171634,0.000043626755,0.000021908267,0.000035767967,0.0005333247,0.00076399685],"genre_scores_gemma":[0.15700592,0.0011501462,0.83186835,0.00018337379,0.00026918107,0.00016554532,0.0005229443,0.00034489564,0.008489678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994342,0.00015127861,0.000036822144,0.00016804769,0.00016133978,0.000048292106],"domain_scores_gemma":[0.9995115,0.00017311363,0.000050905554,0.0000803113,0.00015701563,0.000027161463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006187559,0.001223041,0.0010256403,0.00077591685,0.0003682556,0.00087546144,0.00091150176,0.00092470576,0.0019251269],"category_scores_gemma":[0.0014483375,0.00043043256,0.0013309865,0.00083452667,0.00073390675,0.0016588839,0.00074177445,0.001473348,0.002425123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006721148,0.00023883187,0.0012035505,0.0005686802,0.00028546806,0.00036260625,0.00029875457,0.19515467,0.2132129,0.038235974,0.0052105067,0.5445559],"study_design_scores_gemma":[0.000024267481,0.00016913045,0.0007369607,0.000018344068,0.000069784146,0.00034502873,0.000036525507,0.93211854,0.050924577,0.0076278555,0.007868733,0.00006036988],"about_ca_topic_score_codex":0.0016644178,"about_ca_topic_score_gemma":0.001982115,"teacher_disagreement_score":0.0019251269,"about_ca_system_score_codex":0.0003248918,"about_ca_system_score_gemma":0.0008545516,"threshold_uncertainty_score":0.0064402223},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101767726,0.00021483906,0.8969776,0.000054781576,0.0000139807435,0.000040359133,0.000083996776,0.000320054,0.00052662916],"genre_scores_gemma":[0.87261474,0.0005754603,0.12433462,0.00005566856,0.00002861789,0.00015082835,0.00034355407,0.00011013138,0.0017863094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955887,0.00013361001,0.000025815441,0.00012623442,0.00012050231,0.00003497876],"domain_scores_gemma":[0.998516,0.0010829746,0.00013675426,0.00010594201,0.00013998008,0.000018327817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009107556,0.0005936117,0.0005830103,0.0003434442,0.00012893038,0.0005833004,0.0005113566,0.00071072724,0.00050829194],"category_scores_gemma":[0.0038207138,0.00034097454,0.00091232196,0.00028355714,0.00033500118,0.0007114361,0.00025983443,0.0008365425,0.00034333993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001860401,0.00013945365,0.0030228626,0.00022397873,0.00019695172,0.0002022827,0.0001758549,0.8353049,0.0791819,0.0025047078,0.00033290833,0.07852815],"study_design_scores_gemma":[0.0000052228074,0.00005982399,0.0018132546,0.000005522037,0.000024351037,0.000074211915,0.000008179664,0.9930474,0.004236686,0.00053794915,0.00017270082,0.000014679107],"about_ca_topic_score_codex":0.0025555075,"about_ca_topic_score_gemma":0.002406129,"teacher_disagreement_score":0.0025555075,"about_ca_system_score_codex":0.0002705243,"about_ca_system_score_gemma":0.0005201991,"threshold_uncertainty_score":0.0050812364},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02092187,0.0007310184,0.9762738,0.0002283008,0.00011485117,0.00007624444,0.00027749423,0.0006262752,0.0007502949],"genre_scores_gemma":[0.21369381,0.0013279993,0.777617,0.00024156265,0.00021804331,0.0001737208,0.0031233786,0.00017829268,0.003426185],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99949145,0.000099282595,0.00003672325,0.00014459233,0.00017884815,0.0000491164],"domain_scores_gemma":[0.999466,0.00022362678,0.00006713424,0.00006331713,0.0001479802,0.000032046453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006248733,0.0011449559,0.0006823325,0.00067129737,0.00023706343,0.0004287319,0.00048683328,0.0008144221,0.00097314967],"category_scores_gemma":[0.0021966186,0.00019429115,0.0010998884,0.00059586886,0.00031125644,0.00055616547,0.0004638417,0.0009974218,0.00082888245],"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.0006615276,0.00020614719,0.0027562126,0.00049124757,0.00017385976,0.0009023959,0.00019031385,0.075300135,0.16338935,0.0029954608,0.010161107,0.7427723],"study_design_scores_gemma":[0.00006221136,0.00021456214,0.006514315,0.00005072877,0.00006533624,0.0012122623,0.00009933528,0.94044733,0.03944229,0.0037414578,0.008094997,0.00005515648],"about_ca_topic_score_codex":0.0031546315,"about_ca_topic_score_gemma":0.0037513482,"teacher_disagreement_score":0.0031546315,"about_ca_system_score_codex":0.00025406556,"about_ca_system_score_gemma":0.00061821856,"threshold_uncertainty_score":0.0062725544},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012741454,0.2041318,0.755663,0.0018983099,0.0038666215,0.00018460628,0.0013872712,0.0028081527,0.028786078],"genre_scores_gemma":[0.018811334,0.26358983,0.64651024,0.0025001727,0.013995768,0.0009683438,0.0047659916,0.0019358464,0.04692242],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899024,0.00025316677,0.00009076298,0.00025633283,0.00036687564,0.000042645323],"domain_scores_gemma":[0.9985251,0.0008842788,0.00007374867,0.00011875907,0.00033544414,0.00006261321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015961493,0.002238965,0.0012877476,0.0028373313,0.00041266004,0.001833895,0.0010843058,0.0016866071,0.018794628],"category_scores_gemma":[0.003461502,0.0011402887,0.0012564876,0.004342454,0.0011032805,0.0030033318,0.0013524089,0.0032290528,0.016784552],"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.000076115124,0.00013553804,0.0005875159,0.0033481442,0.00022329936,0.00026916966,0.0002726479,0.014437355,0.004244804,0.100753956,0.22466372,0.6509877],"study_design_scores_gemma":[0.000014569518,0.00009143621,0.0017309819,0.0006037127,0.00005235329,0.0010426963,0.00008016201,0.02667015,0.0017764235,0.14349613,0.82434344,0.00009793072],"about_ca_topic_score_codex":0.0013677393,"about_ca_topic_score_gemma":0.0014558613,"teacher_disagreement_score":0.018794628,"about_ca_system_score_codex":0.0006359821,"about_ca_system_score_gemma":0.0010489993,"threshold_uncertainty_score":0.06287432},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008342212,0.0009032814,0.6195828,0.000718907,0.00260225,0.00020992136,0.033324625,0.30003053,0.041793495],"genre_scores_gemma":[0.01825261,0.0016874445,0.53789866,0.0010995553,0.0021232942,0.0008720366,0.17740543,0.13720666,0.12345424],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99792695,0.00029770407,0.00018175754,0.00038190832,0.0010248487,0.00018674367],"domain_scores_gemma":[0.9946995,0.0010134975,0.00016208291,0.0016702292,0.002191902,0.0002627771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030956182,0.0029425933,0.0020892753,0.0035033852,0.00095711614,0.004085485,0.0050114184,0.0027826144,0.2958343],"category_scores_gemma":[0.010781409,0.0016363069,0.0022841382,0.0031830298,0.0007922265,0.003533387,0.002841307,0.003850883,0.26775604],"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.0004056634,0.00007609262,0.00034978014,0.00046037594,0.00015418789,0.00017140574,0.000085201325,0.0046034176,0.0038238666,0.010966056,0.80877304,0.17013083],"study_design_scores_gemma":[0.00020157087,0.00005354683,0.0006761599,0.00011137301,0.000069664224,0.00042381478,0.000023797593,0.02891303,0.007460272,0.013495261,0.9484361,0.00013550132],"about_ca_topic_score_codex":0.005793747,"about_ca_topic_score_gemma":0.006336366,"teacher_disagreement_score":0.2958343,"about_ca_system_score_codex":0.00085300306,"about_ca_system_score_gemma":0.0032948393,"threshold_uncertainty_score":0.9896643},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12049934,0.00034194946,0.87694037,0.000287955,0.00008321077,0.000024591898,0.00012888895,0.0003393952,0.0013543454],"genre_scores_gemma":[0.787019,0.00039558377,0.21073918,0.000101884536,0.00011689677,0.000022735938,0.0002751899,0.0000694392,0.0012600771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921644,0.00019300389,0.00007314055,0.00014370735,0.00029648605,0.000077251745],"domain_scores_gemma":[0.9945903,0.003841344,0.00058475434,0.00034786123,0.0004464727,0.0001893169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011899456,0.00048121583,0.00093465176,0.00086778915,0.00035121318,0.0008715483,0.00083972473,0.001064739,0.00078829675],"category_scores_gemma":[0.011468657,0.000304579,0.00031674778,0.00094735005,0.0010268218,0.0013732499,0.0013218587,0.0012308208,0.0003453765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032454946,0.00020193295,0.014856186,0.00050525914,0.0002224503,0.0011894456,0.0005072142,0.31334433,0.19528186,0.054346185,0.0026455994,0.413654],"study_design_scores_gemma":[0.00002447084,0.00010038097,0.002722267,0.00002913371,0.00002245847,0.0005639786,0.00006643116,0.9266944,0.033318795,0.03560024,0.000819719,0.000037673784],"about_ca_topic_score_codex":0.00045342423,"about_ca_topic_score_gemma":0.00047353664,"teacher_disagreement_score":0.0011899456,"about_ca_system_score_codex":0.00031926204,"about_ca_system_score_gemma":0.0004277252,"threshold_uncertainty_score":0.006293118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009469147,0.00045263133,0.98691446,0.0006754002,0.000076562545,0.0000369519,0.000049403418,0.00020778026,0.0021176524],"genre_scores_gemma":[0.4690619,0.0017818898,0.5133329,0.00095591956,0.00039965153,0.00032030535,0.00058885256,0.0007180937,0.0128403725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99435776,0.002820021,0.0002824703,0.00079502683,0.0014456556,0.00029906284],"domain_scores_gemma":[0.98256475,0.011874409,0.0010336183,0.0026437952,0.0014811916,0.00040226444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011297471,0.0025332347,0.001990168,0.0012689716,0.0007628,0.0028622427,0.0021441835,0.0031340672,0.0033489398],"category_scores_gemma":[0.047388867,0.00058528746,0.0009495595,0.0012298843,0.0029429484,0.004521127,0.003560382,0.0042750794,0.0014772746],"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.00069151184,0.00021541821,0.0021624886,0.0004171354,0.00017202996,0.00029326032,0.00019265027,0.719546,0.01179924,0.11090099,0.008497447,0.14511184],"study_design_scores_gemma":[0.000017483057,0.00013364498,0.0003169215,0.000062971696,0.000018036291,0.00018696925,0.000029950557,0.94930506,0.007706166,0.040675562,0.0015238519,0.000023394558],"about_ca_topic_score_codex":0.000860166,"about_ca_topic_score_gemma":0.00084942085,"teacher_disagreement_score":0.011297471,"about_ca_system_score_codex":0.0015525778,"about_ca_system_score_gemma":0.0018777391,"threshold_uncertainty_score":0.059747398},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038557795,0.00053412863,0.9865889,0.00028737623,0.0002181143,0.000014930375,0.000042709456,0.00035760697,0.008100411],"genre_scores_gemma":[0.39001578,0.0032347562,0.55697685,0.0005317452,0.00048862066,0.0001267554,0.00038677797,0.0010284138,0.047210276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964905,0.00006755156,0.000017268652,0.00005337555,0.00019625331,0.000016443075],"domain_scores_gemma":[0.99938,0.00025398997,0.000029169662,0.00014814452,0.00016436997,0.000024199182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043354282,0.00047261536,0.00052788254,0.0006405034,0.00032438667,0.0009362662,0.0007259553,0.0007357867,0.005700475],"category_scores_gemma":[0.0027052965,0.00024996238,0.00052890094,0.0005513019,0.0007276811,0.0018105756,0.00093111815,0.0013468247,0.0022367055],"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.00007394099,0.000033275064,0.00050704315,0.000380631,0.00004880145,0.00029109305,0.00018271482,0.10793367,0.020133212,0.6863822,0.0078083104,0.17622508],"study_design_scores_gemma":[0.000008595771,0.000025585767,0.00024788917,0.00006745936,0.000014425592,0.00044822937,0.000034651566,0.7959603,0.009720988,0.17427169,0.019173577,0.000026531307],"about_ca_topic_score_codex":0.00073290727,"about_ca_topic_score_gemma":0.00055680936,"teacher_disagreement_score":0.005700475,"about_ca_system_score_codex":0.00043357883,"about_ca_system_score_gemma":0.000610218,"threshold_uncertainty_score":0.01906997},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020580284,0.00033129856,0.974742,0.00022244095,0.000110666544,0.000072941875,0.00025147735,0.0016834071,0.0020054982],"genre_scores_gemma":[0.21988937,0.00066431845,0.7758387,0.00011566731,0.000123766,0.0001573857,0.0006557354,0.00039629528,0.0021587492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993358,0.00018928299,0.000034987028,0.00019017667,0.0001912607,0.000058493206],"domain_scores_gemma":[0.99917185,0.00029615124,0.000061534935,0.00013286057,0.00030649273,0.00003112179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009542802,0.0011383687,0.00044121756,0.00203036,0.0003130471,0.0011277732,0.00043707437,0.0005461055,0.0035337245],"category_scores_gemma":[0.004881249,0.0002714363,0.0006378037,0.0021957166,0.00074054307,0.0007566679,0.0007070623,0.00087675784,0.0014428309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022931703,0.00012482681,0.0026107521,0.00031218506,0.00020608409,0.00017282178,0.00022323971,0.052557036,0.10598472,0.04252977,0.009637552,0.7854117],"study_design_scores_gemma":[0.000032111406,0.00009569614,0.006688381,0.00006290527,0.00008661915,0.00022469333,0.00010685393,0.87548983,0.06394041,0.041180573,0.012017245,0.00007474262],"about_ca_topic_score_codex":0.00502917,"about_ca_topic_score_gemma":0.0050272136,"teacher_disagreement_score":0.00502917,"about_ca_system_score_codex":0.00042059307,"about_ca_system_score_gemma":0.0016379794,"threshold_uncertainty_score":0.011821449},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.503079,0.010627143,0.46374348,0.0012333695,0.000186431,0.00049502135,0.0057805954,0.0021945864,0.012660303],"genre_scores_gemma":[0.7252138,0.0037169203,0.26162416,0.00045894834,0.00018103035,0.00064964447,0.002701582,0.00029057194,0.0051633664],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999013,0.000030074172,0.0000047136023,0.000031039603,0.000017709459,0.000015002329],"domain_scores_gemma":[0.9997844,0.000090907764,0.000044330303,0.000019016672,0.000036556063,0.000024795343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052673055,0.0003571805,0.00020556946,0.0010220999,0.00024752202,0.00046504525,0.0002621491,0.00050938345,0.0025290584],"category_scores_gemma":[0.0014059532,0.00018537664,0.00031746094,0.00071662286,0.00025354867,0.00018302246,0.00026891322,0.00034309505,0.00068464683],"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.0004916737,0.000092278635,0.017621541,0.0008118488,0.0002459886,0.0006726741,0.00028815976,0.0056356112,0.71078885,0.0018491863,0.0043234127,0.25717875],"study_design_scores_gemma":[0.00015853862,0.0009937036,0.48974493,0.00030546388,0.0005519696,0.012212803,0.0007233706,0.22998916,0.19692986,0.018263659,0.049946163,0.00018035281],"about_ca_topic_score_codex":0.0028947694,"about_ca_topic_score_gemma":0.0074251457,"teacher_disagreement_score":0.0028947694,"about_ca_system_score_codex":0.00016572798,"about_ca_system_score_gemma":0.00031748213,"threshold_uncertainty_score":0.008460522},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9992248,0.000030499283,0.00020656745,0.0000055184078,0.000001709611,0.0000030290448,0.000011201606,0.0000039282913,0.0005128535],"genre_scores_gemma":[0.9994443,0.00003670093,0.00024083996,0.000011707143,0.000002533833,0.0000045874176,0.000027008202,0.0000056782965,0.00022678869],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9997421,0.00008965902,0.0000177088,0.00006272259,0.00005737789,0.00003038715],"domain_scores_gemma":[0.9991615,0.0004285027,0.000088744106,0.000049350827,0.00013392359,0.00013806716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035026576,0.0002165038,0.00020038341,0.0001945835,0.0002041062,0.0005678047,0.00010999177,0.00017130298,0.0014675187],"category_scores_gemma":[0.0019346623,0.00009973345,0.00009724996,0.00007912106,0.00023265222,0.00023193285,0.0004092794,0.00022754853,0.00026678215],"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.0029465286,0.00012402107,0.069779776,0.00012274475,0.000052201947,0.00071032235,0.0052191825,0.00015304645,0.8998863,0.00016078673,0.000065918495,0.020779101],"study_design_scores_gemma":[0.0000724122,0.0018584235,0.93278074,0.000027882375,0.00007390536,0.0010372737,0.005269205,0.0015009079,0.05621113,0.00023841544,0.0008974369,0.000032265038],"about_ca_topic_score_codex":0.0015112407,"about_ca_topic_score_gemma":0.0017503091,"teacher_disagreement_score":0.0015112407,"about_ca_system_score_codex":0.00011010354,"about_ca_system_score_gemma":0.00012367434,"threshold_uncertainty_score":0.0049093366},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024615421,0.00017883113,0.9956654,0.00011366408,0.00005533367,0.000038471706,0.000020021196,0.00068604253,0.0007807609],"genre_scores_gemma":[0.14170556,0.00044552045,0.84913725,0.0003150674,0.00019397277,0.00041030545,0.0002685669,0.0006645243,0.0068593123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987551,0.00035457595,0.00008382366,0.00022353359,0.00047248983,0.000110592584],"domain_scores_gemma":[0.9978356,0.0010282429,0.00013148271,0.00041892374,0.00048274559,0.00010306811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003176333,0.0020774542,0.0014362835,0.00088188215,0.00064529706,0.0009472629,0.0021196553,0.0016816244,0.003934054],"category_scores_gemma":[0.006665581,0.00079859747,0.0015849198,0.0007426855,0.0014382196,0.0016623623,0.001764957,0.0035870504,0.0017643035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005897248,0.00030788768,0.001047604,0.00041561073,0.00019344548,0.00016485094,0.0003062821,0.631973,0.033942487,0.052548043,0.009881304,0.26862973],"study_design_scores_gemma":[0.000009909491,0.000045875197,0.00009012869,0.000005264578,0.0000070471224,0.000024886267,0.0000037337466,0.99392176,0.0026137282,0.0023508854,0.00091838336,0.000008463809],"about_ca_topic_score_codex":0.004639635,"about_ca_topic_score_gemma":0.0051278337,"teacher_disagreement_score":0.004639635,"about_ca_system_score_codex":0.001264487,"about_ca_system_score_gemma":0.0024655543,"threshold_uncertainty_score":0.016798258},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17512643,0.00024330335,0.82021725,0.00045799543,0.000057588964,0.00013986173,0.000096591655,0.0005325293,0.003128445],"genre_scores_gemma":[0.94174546,0.00012493551,0.05746848,0.00007227183,0.000022187989,0.00008377166,0.00006196683,0.000059511647,0.00036139466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9924683,0.0029929942,0.00039179795,0.0015338691,0.002002266,0.0006107184],"domain_scores_gemma":[0.93833816,0.04469184,0.0061880364,0.0069215037,0.0032430862,0.0006173603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011143021,0.0006221881,0.0009954433,0.0008009784,0.00052482117,0.0020696553,0.0017146433,0.0014657234,0.001389444],"category_scores_gemma":[0.07414111,0.00048934773,0.0007165874,0.00048262838,0.003329245,0.003958371,0.0014384962,0.0018277367,0.00023386898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040073186,0.0001514649,0.002720787,0.00014327848,0.00012279874,0.00005161081,0.00005708177,0.9008119,0.009872313,0.062777594,0.00021871038,0.022671714],"study_design_scores_gemma":[0.000030201103,0.00021265703,0.000655017,0.00001995343,0.000015980444,0.000027915157,0.000017488293,0.96036977,0.010958696,0.02742743,0.00023676029,0.000028097606],"about_ca_topic_score_codex":0.0017465474,"about_ca_topic_score_gemma":0.0006702633,"teacher_disagreement_score":0.011143021,"about_ca_system_score_codex":0.0027087594,"about_ca_system_score_gemma":0.0028937594,"threshold_uncertainty_score":0.058930576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019999351,0.00017144218,0.99688464,0.000038817776,0.0000406742,0.00001951376,0.000013304131,0.00023399043,0.00059768587],"genre_scores_gemma":[0.082095206,0.00064625446,0.91010606,0.00011715092,0.000093236835,0.00016799959,0.00017721968,0.00009208032,0.0065047517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994454,0.00008070799,0.000049606522,0.00014099343,0.00025006928,0.000033251243],"domain_scores_gemma":[0.99959224,0.00010765711,0.00003247101,0.000042054045,0.00020795017,0.000017666476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006845326,0.0007456768,0.00061550504,0.00081540796,0.00053680746,0.00072913326,0.0008017367,0.0009927952,0.0035328767],"category_scores_gemma":[0.0016668554,0.00029214224,0.0008227611,0.0009343192,0.00050538767,0.0013472994,0.0008360828,0.0010513619,0.0016922534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004805353,0.0000747197,0.0008363215,0.00029728672,0.0001238292,0.00014688277,0.00024323762,0.07342542,0.08629255,0.04500989,0.004372911,0.7886964],"study_design_scores_gemma":[0.000047352205,0.00008925947,0.00044270177,0.000025319647,0.000044652785,0.00041437757,0.000022027438,0.9439142,0.03358199,0.011715515,0.009661684,0.00004091408],"about_ca_topic_score_codex":0.0019617118,"about_ca_topic_score_gemma":0.0013730126,"teacher_disagreement_score":0.0035328767,"about_ca_system_score_codex":0.00054625305,"about_ca_system_score_gemma":0.0011905221,"threshold_uncertainty_score":0.011818707},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021045057,0.00019343969,0.9767959,0.00018113392,0.000096444855,0.000038416052,0.00010922944,0.00024433743,0.0012959973],"genre_scores_gemma":[0.5050896,0.00044251393,0.48935363,0.00038310254,0.00032809033,0.00024301054,0.001415657,0.00023019363,0.002514267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928976,0.0036416468,0.00044844588,0.000800982,0.0018637141,0.00034752116],"domain_scores_gemma":[0.97974855,0.012366249,0.0015653229,0.0023423943,0.0034104425,0.00056709297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076883137,0.0008698384,0.0016192393,0.003016198,0.00063965423,0.0016881435,0.0016794445,0.0022430313,0.0029175638],"category_scores_gemma":[0.041891243,0.0004889528,0.0013518943,0.0023557295,0.0017090109,0.0033412424,0.002353017,0.0023788163,0.0012104765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015080344,0.00030351154,0.010852284,0.0004244698,0.0004109287,0.00075220334,0.00026655212,0.4096088,0.05609639,0.1783009,0.005024948,0.33645102],"study_design_scores_gemma":[0.000052606476,0.00040712435,0.0018249815,0.000038849448,0.000032555447,0.0003684362,0.000028700286,0.95039177,0.010442639,0.033685897,0.0026455845,0.00008085507],"about_ca_topic_score_codex":0.00041540782,"about_ca_topic_score_gemma":0.0002807814,"teacher_disagreement_score":0.0076883137,"about_ca_system_score_codex":0.00048793427,"about_ca_system_score_gemma":0.0011178725,"threshold_uncertainty_score":0.040660203},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103420034,0.00046296412,0.8913403,0.0006479516,0.00012513445,0.0002493758,0.000841113,0.0006911856,0.0022218456],"genre_scores_gemma":[0.7969844,0.0006306889,0.1810214,0.00030217975,0.00023747761,0.000983448,0.002373471,0.00030192194,0.017164987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973907,0.0010524888,0.00012715085,0.00080412376,0.00035577826,0.00026986774],"domain_scores_gemma":[0.9953342,0.0031559712,0.00043148798,0.00047257266,0.00047242217,0.0001332524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005596126,0.0012933643,0.0022305325,0.0018840734,0.00076146325,0.0021459034,0.0040076617,0.0023621707,0.004400888],"category_scores_gemma":[0.012660722,0.0011929611,0.0031896147,0.0017227674,0.0011779296,0.002039211,0.001587838,0.0027164733,0.0013109766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001003771,0.00034566858,0.014435592,0.00024796405,0.00079035526,0.0005104321,0.0009724081,0.7607659,0.0049177133,0.12916774,0.004049176,0.08279334],"study_design_scores_gemma":[0.00002536741,0.000045948727,0.0016339491,0.000010601085,0.000050837913,0.00005868609,0.00001998195,0.9821177,0.00017883957,0.015208245,0.0006193136,0.000030507068],"about_ca_topic_score_codex":0.011390449,"about_ca_topic_score_gemma":0.00931157,"teacher_disagreement_score":0.011390449,"about_ca_system_score_codex":0.0011341982,"about_ca_system_score_gemma":0.0009955291,"threshold_uncertainty_score":0.029595494},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044288364,0.0000370131,0.9990471,0.000011307902,0.000012871046,0.0000071116133,0.000006585295,0.00013124674,0.00030391797],"genre_scores_gemma":[0.036203314,0.00018097284,0.96041495,0.000044560133,0.000067801484,0.00010021146,0.00006355344,0.00005913965,0.0028654619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992199,0.00018275935,0.000030117542,0.00015985967,0.00036688335,0.000040451825],"domain_scores_gemma":[0.99918884,0.0003807009,0.00007939794,0.00014414288,0.00016652486,0.000040320465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007245219,0.0009193382,0.0007617409,0.0006210997,0.0004936876,0.0009404679,0.0010751868,0.0013153628,0.0027258666],"category_scores_gemma":[0.0022489221,0.00049726636,0.0005180726,0.00064504746,0.00078824634,0.0014590048,0.0012064719,0.001308288,0.0024630527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024061209,0.00008464975,0.00040160402,0.00021388617,0.000090876405,0.00016902902,0.0002460592,0.23307073,0.062226214,0.08997103,0.0032991094,0.60998625],"study_design_scores_gemma":[0.000023038921,0.00009295352,0.00015947055,0.000016824592,0.000016910297,0.00031290692,0.000014539905,0.9646439,0.013083676,0.014606193,0.0069873193,0.000042288546],"about_ca_topic_score_codex":0.0008792016,"about_ca_topic_score_gemma":0.0009615202,"teacher_disagreement_score":0.0027258666,"about_ca_system_score_codex":0.00031557016,"about_ca_system_score_gemma":0.0008531636,"threshold_uncertainty_score":0.009118915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99973124,0.000013029895,0.00007574341,0.0000026623845,0.0000013905249,0.0000035893875,0.000008263031,0.0000023024938,0.00016170324],"genre_scores_gemma":[0.9989153,0.000049250477,0.0004984766,0.00002052421,0.000005093303,0.000019144267,0.00006532628,0.000005145867,0.0004216883],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99959,0.00011232068,0.000048581012,0.00010128378,0.00010890699,0.00003895435],"domain_scores_gemma":[0.99846953,0.000988652,0.00015422783,0.000105068066,0.00013288512,0.00014964747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006008086,0.00025980148,0.00032695592,0.00018745555,0.00015178534,0.00066157134,0.00011282534,0.00025330173,0.0011087164],"category_scores_gemma":[0.0039806194,0.0001848607,0.0002486425,0.00008134305,0.0002856576,0.00030970183,0.00044126765,0.00032550067,0.00026240438],"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.0042735324,0.0004818336,0.08920248,0.0001450941,0.000077467324,0.0005747461,0.0049815373,0.0002959397,0.87660027,0.00011387991,0.000114241695,0.023139067],"study_design_scores_gemma":[0.000084976644,0.004816089,0.9221103,0.000015221182,0.00008526685,0.0010626005,0.0030346522,0.0022351595,0.06568166,0.00020812896,0.00062029617,0.000045599987],"about_ca_topic_score_codex":0.0009217208,"about_ca_topic_score_gemma":0.0010314765,"teacher_disagreement_score":0.0011087164,"about_ca_system_score_codex":0.00009863491,"about_ca_system_score_gemma":0.00013895468,"threshold_uncertainty_score":0.0037090182},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012739266,0.0010639904,0.9836181,0.00014573103,0.00004941759,0.000029899767,0.000058898182,0.0006446262,0.0016501871],"genre_scores_gemma":[0.19324061,0.0016209767,0.8010037,0.00015539546,0.000121313074,0.00012008524,0.00022872369,0.00024794097,0.0032613382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994529,0.0001756843,0.000035492638,0.00010311944,0.00020004605,0.000032809174],"domain_scores_gemma":[0.99922025,0.0003355797,0.00013054551,0.00010873763,0.00017439392,0.000030472338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007947887,0.0007040617,0.0005376301,0.00094602595,0.00027759338,0.00077459007,0.0005713519,0.0008822692,0.0016635276],"category_scores_gemma":[0.0022201259,0.0003360342,0.00076614495,0.001311669,0.0006757582,0.0010543981,0.0007772075,0.0010060339,0.001015008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032773172,0.00012207052,0.0018049473,0.0006130912,0.00015937371,0.00046213172,0.00035031617,0.09142111,0.21632977,0.022600185,0.005360451,0.6604488],"study_design_scores_gemma":[0.000055675173,0.00035305542,0.004109141,0.00010469094,0.00007266545,0.001755364,0.000122729,0.83738476,0.12572505,0.014487003,0.015702406,0.00012753256],"about_ca_topic_score_codex":0.000948324,"about_ca_topic_score_gemma":0.0014757955,"teacher_disagreement_score":0.0016635276,"about_ca_system_score_codex":0.00020795446,"about_ca_system_score_gemma":0.00041530826,"threshold_uncertainty_score":0.005565107},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0121493535,0.0006196175,0.986388,0.000053544856,0.00005329319,0.000020279618,0.000021720864,0.00018341203,0.00051073864],"genre_scores_gemma":[0.20942202,0.0016651856,0.7857762,0.00010419336,0.00009295704,0.00007465605,0.00019346955,0.000092813185,0.002578556],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994518,0.00012038316,0.00003908716,0.0001316044,0.0002224953,0.000034650253],"domain_scores_gemma":[0.99936634,0.00027254777,0.00007562109,0.00007089487,0.00019584934,0.000018712713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008379095,0.0008603279,0.0005536838,0.00086446985,0.00034206474,0.00053909206,0.0004964718,0.0006863794,0.0008053147],"category_scores_gemma":[0.0018748617,0.00025700007,0.0006723721,0.00078064116,0.00052167755,0.0008584964,0.00048042153,0.00068283925,0.0005303894],"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.00050195603,0.000116822244,0.0012103597,0.00047272307,0.00010945555,0.00016072238,0.00019201072,0.048943665,0.24061887,0.008871347,0.0014830839,0.6973189],"study_design_scores_gemma":[0.000029214338,0.00029860868,0.0025505475,0.000051611165,0.00008462225,0.00041009777,0.00006327731,0.8117565,0.17123622,0.0043472946,0.009104915,0.00006712556],"about_ca_topic_score_codex":0.0014077505,"about_ca_topic_score_gemma":0.0024284418,"teacher_disagreement_score":0.0014077505,"about_ca_system_score_codex":0.00024399656,"about_ca_system_score_gemma":0.0006359911,"threshold_uncertainty_score":0.0044313073},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46999153,0.0005362831,0.513223,0.00040812689,0.00026269484,0.0002135979,0.00045538592,0.000981976,0.013927416],"genre_scores_gemma":[0.96356314,0.00041316618,0.03222939,0.00016014455,0.00006396738,0.00008865607,0.00025095,0.00026653052,0.0029641446],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988887,0.000335163,0.000072755356,0.00016210963,0.00043548676,0.00010585478],"domain_scores_gemma":[0.99017966,0.007837941,0.0003947892,0.001109845,0.00035433116,0.00012337774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011653096,0.0008645377,0.0005171364,0.0005961239,0.0002821914,0.0013128914,0.00059523626,0.00081335416,0.0056430646],"category_scores_gemma":[0.015949396,0.00034450833,0.0012471712,0.00060761184,0.0008151251,0.0015018444,0.001182022,0.0015958757,0.00064165855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00399349,0.0006182325,0.010832991,0.00081643777,0.00069958076,0.0020943105,0.0008808296,0.28715163,0.3129034,0.084566966,0.0018221732,0.29362002],"study_design_scores_gemma":[0.00013703166,0.0009871533,0.019065754,0.00014779935,0.00060843345,0.0021736445,0.00024187977,0.7736062,0.13921453,0.059326854,0.004368653,0.00012204215],"about_ca_topic_score_codex":0.00028510473,"about_ca_topic_score_gemma":0.0002294809,"teacher_disagreement_score":0.0056430646,"about_ca_system_score_codex":0.0003290275,"about_ca_system_score_gemma":0.0002681403,"threshold_uncertainty_score":0.018877923},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019811548,0.00010502495,0.9792093,0.00009485627,0.000015261721,0.000013243739,0.00005938909,0.0002871788,0.00040414976],"genre_scores_gemma":[0.33226818,0.0004512711,0.6625408,0.00009912969,0.00008152809,0.00012626426,0.0006121516,0.0001760216,0.0036446534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961287,0.00014461044,0.00002515576,0.000056682675,0.00012496028,0.00003577254],"domain_scores_gemma":[0.99874973,0.00076904654,0.00016368099,0.00013850986,0.00014552426,0.00003347192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009839471,0.00069351983,0.00066166214,0.00067849463,0.00018460705,0.00048002606,0.00071143237,0.0009758408,0.0010283999],"category_scores_gemma":[0.0037721596,0.00035771157,0.00062831223,0.0006368874,0.0006593513,0.0010401688,0.0009347359,0.0009061866,0.00046054446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008043444,0.0001291794,0.0007534286,0.00026255104,0.00013401607,0.00021224844,0.00018889275,0.6951775,0.07695046,0.031200588,0.0023182647,0.19186854],"study_design_scores_gemma":[0.000014979051,0.00001846874,0.00017814097,0.00000552495,0.000004037155,0.000025303403,0.0000053951026,0.9882604,0.0049864813,0.006137078,0.0003547197,0.000009463355],"about_ca_topic_score_codex":0.0013999916,"about_ca_topic_score_gemma":0.0012780683,"teacher_disagreement_score":0.0013999916,"about_ca_system_score_codex":0.000333905,"about_ca_system_score_gemma":0.00058671227,"threshold_uncertainty_score":0.005203724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14534384,0.00020289671,0.84943867,0.00014188455,0.00004212957,0.00011653821,0.00088952156,0.0018113916,0.002013096],"genre_scores_gemma":[0.53175044,0.00030096358,0.46443444,0.000043010736,0.000033427226,0.00015799253,0.0011758517,0.0003174504,0.0017864387],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961627,0.00006805811,0.000024373394,0.00010221772,0.00015633367,0.000032690532],"domain_scores_gemma":[0.9992811,0.00020964503,0.00008764762,0.0000827828,0.00032193778,0.000016842341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011245845,0.00062069733,0.00035005427,0.0017600616,0.0003190113,0.0005013374,0.00030137136,0.00023601021,0.0021199528],"category_scores_gemma":[0.0022213547,0.0001628008,0.0005497,0.0013634735,0.00042215825,0.0006070675,0.0004228405,0.00045720235,0.00036157935],"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.0004745411,0.0001788683,0.012990006,0.000628852,0.00016870273,0.0003353458,0.00041458357,0.065069914,0.3942434,0.011627554,0.0041308883,0.5097373],"study_design_scores_gemma":[0.00002198086,0.00021880063,0.06017149,0.000033859575,0.00009308094,0.00053950836,0.0004350733,0.7331785,0.18285768,0.012818151,0.009505698,0.00012622551],"about_ca_topic_score_codex":0.0018024988,"about_ca_topic_score_gemma":0.0024457718,"teacher_disagreement_score":0.0021199528,"about_ca_system_score_codex":0.00026187953,"about_ca_system_score_gemma":0.0005438111,"threshold_uncertainty_score":0.0070919394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016562719,0.0029630456,0.96448594,0.00015745315,0.00028580066,0.000041535375,0.00046937866,0.00095475256,0.014079413],"genre_scores_gemma":[0.2655808,0.010028152,0.67309177,0.0001200663,0.0004283871,0.00012734358,0.0020335622,0.00060257746,0.047987312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999411,0.000010457821,0.00000308817,0.000014493652,0.000025222136,0.000005612378],"domain_scores_gemma":[0.9998952,0.00004566812,0.0000062110566,0.000015774114,0.00003421666,0.0000029627715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011151115,0.00035344835,0.00020277416,0.00047178558,0.00010871856,0.0004514608,0.00030434303,0.00023985648,0.005575662],"category_scores_gemma":[0.00048436888,0.00009597841,0.00026268497,0.00072860846,0.00018351719,0.0004766758,0.00016785333,0.0003528237,0.0022081346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010445577,0.000038438935,0.00018770024,0.0004407737,0.000032443862,0.00013051271,0.00006586536,0.009513605,0.2084422,0.019700067,0.008952667,0.7523913],"study_design_scores_gemma":[0.000018785571,0.0002622656,0.014418417,0.00018420356,0.00009327542,0.0022545462,0.00018530371,0.58345515,0.22733386,0.056473445,0.11523642,0.000084193496],"about_ca_topic_score_codex":0.0003379422,"about_ca_topic_score_gemma":0.0003923418,"teacher_disagreement_score":0.005575662,"about_ca_system_score_codex":0.000100572346,"about_ca_system_score_gemma":0.00015733151,"threshold_uncertainty_score":0.01865244},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009566954,0.0001253399,0.9895187,0.00004134647,0.000020094987,0.000011402368,0.000025135845,0.00012015532,0.00057096966],"genre_scores_gemma":[0.39643288,0.00068249885,0.5988858,0.00012582517,0.00008994935,0.00009321223,0.00031476322,0.000101700905,0.003273471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996567,0.00007242292,0.00001748041,0.00006689975,0.00015432006,0.00003212393],"domain_scores_gemma":[0.99946505,0.0002357599,0.00007891923,0.00008750079,0.00010839026,0.000024366616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045842188,0.00067400705,0.00057108345,0.0006329957,0.0002924167,0.0006102799,0.0007576405,0.00054391066,0.00084823475],"category_scores_gemma":[0.0019222613,0.00033948215,0.0006596778,0.0008852898,0.0005519452,0.001037684,0.00070990546,0.00066524284,0.00038510587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016696987,0.00006833478,0.0015904771,0.00015293827,0.000103928265,0.00009411045,0.00014899393,0.73315823,0.02621831,0.02724236,0.0015251877,0.2095301],"study_design_scores_gemma":[0.0000053042995,0.000014469575,0.00018688173,0.0000034803802,0.0000058521105,0.000020217114,0.000004404625,0.9955467,0.001911606,0.0018319864,0.00046172168,0.0000073279375],"about_ca_topic_score_codex":0.006492048,"about_ca_topic_score_gemma":0.007199406,"teacher_disagreement_score":0.006492048,"about_ca_system_score_codex":0.0005121512,"about_ca_system_score_gemma":0.0011182358,"threshold_uncertainty_score":0.012908518},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010179286,0.00021208648,0.99804854,0.000037763297,0.000023370965,0.000018354913,0.000045477613,0.00027690115,0.00031958206],"genre_scores_gemma":[0.06633667,0.0009110357,0.92721605,0.0001416786,0.0001716202,0.00015643342,0.00076799834,0.00021625502,0.0040822783],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991086,0.00017598107,0.000048135098,0.00021917977,0.00036517854,0.00008296078],"domain_scores_gemma":[0.99941885,0.00012469808,0.00006671044,0.00010857353,0.00024457183,0.00003654102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000949973,0.0011397457,0.0010076967,0.001761048,0.00041642322,0.0010876055,0.0014217198,0.0011918702,0.0027405964],"category_scores_gemma":[0.0012878776,0.00034244196,0.0013997942,0.0012028791,0.0008281115,0.0015327841,0.0011909764,0.0015620176,0.002417825],"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.0004125769,0.0001559466,0.0006284093,0.00045500643,0.0001953164,0.00021572268,0.0001964994,0.16015868,0.107704565,0.031180115,0.0059143505,0.6927829],"study_design_scores_gemma":[0.000022562961,0.000108375774,0.00090050406,0.000033870274,0.000057109366,0.00029126374,0.00004715193,0.94700295,0.027826762,0.012989823,0.010657903,0.00006160566],"about_ca_topic_score_codex":0.003287319,"about_ca_topic_score_gemma":0.0034739214,"teacher_disagreement_score":0.003287319,"about_ca_system_score_codex":0.00060682854,"about_ca_system_score_gemma":0.0010381952,"threshold_uncertainty_score":0.009168208},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004267915,0.0001593885,0.99449486,0.000043108237,0.000020539983,0.00001522757,0.000033192606,0.00040898708,0.0005567918],"genre_scores_gemma":[0.16261065,0.0009619283,0.8303385,0.00010830334,0.000066301174,0.00012647679,0.0004946938,0.00019796293,0.005095214],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996693,0.00009683121,0.000026239783,0.00006301095,0.00012116467,0.000023422806],"domain_scores_gemma":[0.9996948,0.00011852164,0.000028957165,0.000046501646,0.00010036685,0.000010818615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004318968,0.0009916471,0.0005669543,0.0010615445,0.0003104847,0.0008177821,0.0004984845,0.00064924447,0.0026082166],"category_scores_gemma":[0.0014969029,0.0002938064,0.00079339225,0.0009442061,0.00039502294,0.0015975337,0.0008840608,0.0005064942,0.0015641162],"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.00032512867,0.00007394198,0.00092322775,0.00031926198,0.00012234309,0.00023811308,0.0001590113,0.08333846,0.10617332,0.020331388,0.002261451,0.7857344],"study_design_scores_gemma":[0.000034830835,0.00022087053,0.0015572562,0.00003376629,0.000050388837,0.00063818856,0.00006766302,0.91541713,0.055447433,0.017328177,0.009146246,0.000058132973],"about_ca_topic_score_codex":0.00087724923,"about_ca_topic_score_gemma":0.0007099508,"teacher_disagreement_score":0.0026082166,"about_ca_system_score_codex":0.00018330819,"about_ca_system_score_gemma":0.000533479,"threshold_uncertainty_score":0.008725345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0157602,0.00006457218,0.9828972,0.000059186317,0.000020488333,0.000012424882,0.000026062764,0.00015372288,0.0010062187],"genre_scores_gemma":[0.6492833,0.0003373288,0.34653968,0.00007264349,0.00004102271,0.00009122951,0.000121969984,0.000056517856,0.0034562238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999796,0.00007374436,0.000008117565,0.000027062368,0.00008062828,0.000014598578],"domain_scores_gemma":[0.99937063,0.00039048374,0.00005800362,0.0000816453,0.00008084339,0.00001831145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041041579,0.00034147553,0.00033427443,0.0002166533,0.00029666815,0.0003614534,0.00048219226,0.0007351594,0.0010424455],"category_scores_gemma":[0.0020083026,0.00016778773,0.00035648246,0.0003092684,0.00054689567,0.00066088064,0.00053018046,0.0007639942,0.00036262584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000145008,0.000050811606,0.000593787,0.000090694106,0.000049019396,0.00011103081,0.00010435692,0.86359644,0.038899507,0.05389119,0.0007219916,0.041746076],"study_design_scores_gemma":[0.000007012611,0.000024924373,0.000109091954,0.0000032694816,0.0000046506784,0.00006200277,0.000004985145,0.98834246,0.0061038607,0.0046878923,0.00064157124,0.000008291663],"about_ca_topic_score_codex":0.0012479584,"about_ca_topic_score_gemma":0.0013374081,"teacher_disagreement_score":0.0012479584,"about_ca_system_score_codex":0.0002641464,"about_ca_system_score_gemma":0.0007105776,"threshold_uncertainty_score":0.0034873486},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008757984,0.00035776306,0.98990405,0.00005363302,0.000040629602,0.00003078164,0.000027406706,0.00031521815,0.00051259383],"genre_scores_gemma":[0.20184542,0.0011995293,0.7937083,0.00009732453,0.000081288694,0.00015850058,0.0003353461,0.00013121,0.002443177],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907815,0.00016939128,0.000072290975,0.00019875291,0.00043068785,0.00005072955],"domain_scores_gemma":[0.99934393,0.00020494606,0.0000740988,0.00007418918,0.00028297852,0.000019917725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010718636,0.0012235,0.00086049887,0.001179383,0.00034195976,0.0006301993,0.00059467205,0.0008240148,0.00090831565],"category_scores_gemma":[0.0022634605,0.00031581335,0.001206214,0.0013142952,0.0004651964,0.00104322,0.0006736549,0.0009894129,0.00056487444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023862503,0.00017093068,0.001803623,0.00045678185,0.0002439884,0.00020528217,0.00020660118,0.08491977,0.18566379,0.00898887,0.0028570546,0.7142447],"study_design_scores_gemma":[0.000024051857,0.0001327822,0.002934035,0.000039271086,0.00006921622,0.00023411526,0.000045803696,0.9173492,0.06990979,0.0041151624,0.005091261,0.000055359193],"about_ca_topic_score_codex":0.0018981122,"about_ca_topic_score_gemma":0.0023541097,"teacher_disagreement_score":0.0018981122,"about_ca_system_score_codex":0.00031278576,"about_ca_system_score_gemma":0.00091509306,"threshold_uncertainty_score":0.00566864},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034455038,0.000050612984,0.9960347,0.00005184942,0.0000073909346,0.0000055448527,0.00002454857,0.00005816348,0.00032176342],"genre_scores_gemma":[0.53685856,0.000833596,0.45772153,0.0003014036,0.00022549513,0.00023774437,0.0005449247,0.00021780186,0.0030589171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979321,0.00071525876,0.000105915606,0.000471949,0.00063118286,0.00014358724],"domain_scores_gemma":[0.9748258,0.020028226,0.0020729657,0.0014022029,0.0014356591,0.00023524495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006246256,0.0007394348,0.0009375611,0.0017847881,0.0005399457,0.0017388891,0.0019096468,0.0012247826,0.002358637],"category_scores_gemma":[0.04818661,0.00064679695,0.0009722271,0.0012596576,0.0025677336,0.0033699467,0.0025466706,0.0021311438,0.00044575622],"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.000060315044,0.000026595664,0.0018623035,0.00009126741,0.00008129856,0.00016347849,0.00016484193,0.5609321,0.0023272003,0.38557646,0.00074867223,0.04796546],"study_design_scores_gemma":[0.000005592615,0.000009691274,0.0002338115,0.00001109035,0.00000523959,0.00003638464,0.000010487263,0.9035145,0.000597526,0.09516018,0.00040544133,0.000010070961],"about_ca_topic_score_codex":0.0030968585,"about_ca_topic_score_gemma":0.001580742,"teacher_disagreement_score":0.006246256,"about_ca_system_score_codex":0.0009324619,"about_ca_system_score_gemma":0.001169131,"threshold_uncertainty_score":0.03303373},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014535814,0.00007795266,0.9740926,0.000076802105,0.00007761892,0.000041027153,0.00041271225,0.021909311,0.001858316],"genre_scores_gemma":[0.024040233,0.00010415255,0.95513445,0.00028445834,0.00010885508,0.00013657523,0.0014689104,0.0028871882,0.015835095],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944824,0.0000621908,0.000033639702,0.00011179397,0.00029780326,0.000046341975],"domain_scores_gemma":[0.99927646,0.00019879066,0.000043523578,0.00021420175,0.00020892751,0.00005816155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007517658,0.001188164,0.0008611714,0.0015286257,0.0007766244,0.0012801491,0.0018081907,0.0016419487,0.04064359],"category_scores_gemma":[0.002166095,0.00057681184,0.00072445563,0.00094963005,0.00042399386,0.002132146,0.0019992066,0.0013628049,0.033345822],"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.0007748375,0.00012338415,0.0004448561,0.00016391762,0.000065006716,0.00011128432,0.0000784379,0.0057554306,0.07981958,0.0065632546,0.037024803,0.86907524],"study_design_scores_gemma":[0.00044270552,0.00034668203,0.0013727967,0.00010449021,0.000112179165,0.0007552712,0.00010721294,0.5327508,0.23878007,0.03453881,0.1904943,0.00019461803],"about_ca_topic_score_codex":0.0013162199,"about_ca_topic_score_gemma":0.002807685,"teacher_disagreement_score":0.04064359,"about_ca_system_score_codex":0.00036696423,"about_ca_system_score_gemma":0.00082454336,"threshold_uncertainty_score":0.13596642},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004650804,0.0009349023,0.93042535,0.0035627917,0.0005266735,0.000163381,0.00033527586,0.00035342737,0.059047442],"genre_scores_gemma":[0.35546732,0.0021975993,0.5936915,0.005195659,0.0011016498,0.0011062433,0.00058265805,0.00075024547,0.039907105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99210745,0.003091447,0.000350576,0.0016546928,0.002485212,0.0003106653],"domain_scores_gemma":[0.9904298,0.0045609414,0.0005797952,0.0020128326,0.0019561392,0.000460353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010844131,0.0012604701,0.00068620086,0.0033403977,0.0021079339,0.0046388973,0.0021230602,0.0022098024,0.016979467],"category_scores_gemma":[0.0322291,0.00090067834,0.0016684462,0.0029179023,0.009662794,0.0085285995,0.004983047,0.0048056166,0.0043870225],"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.000032770262,0.00001053424,0.00018546116,0.00004521714,0.00001447566,0.000048542377,0.0001895759,0.0017549066,0.00023611133,0.9654525,0.0047172867,0.027312547],"study_design_scores_gemma":[0.000016602828,0.000022663831,0.00018676117,0.000049125607,0.0000074680524,0.00013331127,0.00004507619,0.0145751005,0.00044765798,0.9600486,0.024444625,0.000022974698],"about_ca_topic_score_codex":0.0028353299,"about_ca_topic_score_gemma":0.0017852335,"teacher_disagreement_score":0.016979467,"about_ca_system_score_codex":0.0023968427,"about_ca_system_score_gemma":0.002530241,"threshold_uncertainty_score":0.05734992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98728776,0.00036146783,0.009734473,0.00008430661,0.000047920275,0.000055851266,0.00018667901,0.00006523195,0.002176363],"genre_scores_gemma":[0.9926772,0.00020542614,0.0053636394,0.000132749,0.00006467455,0.00006403822,0.00027859546,0.000055474342,0.0011580915],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9996691,0.00005397146,0.00002652633,0.00010192242,0.00008924898,0.000059165868],"domain_scores_gemma":[0.99533314,0.002788584,0.00045354164,0.0006078928,0.0004891427,0.00032779193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012469692,0.00043153856,0.00048009123,0.0008909752,0.0002547695,0.0009818568,0.0008808626,0.0010966924,0.0047832783],"category_scores_gemma":[0.0071445345,0.0005656729,0.000367789,0.00071712746,0.001068743,0.0010586637,0.0008994502,0.0008101769,0.00074901205],"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.004285534,0.00035139147,0.04654477,0.00026530592,0.00026292892,0.00020470208,0.00055210927,0.0003824094,0.89096594,0.00065699423,0.00022581185,0.055302072],"study_design_scores_gemma":[0.00025586848,0.0014998687,0.86153394,0.00003418249,0.00042843365,0.0015182855,0.00040829935,0.0055782925,0.12449851,0.003603228,0.0005599695,0.00008103787],"about_ca_topic_score_codex":0.0007628396,"about_ca_topic_score_gemma":0.0009947091,"teacher_disagreement_score":0.0047832783,"about_ca_system_score_codex":0.00015688599,"about_ca_system_score_gemma":0.00037921316,"threshold_uncertainty_score":0.016001642},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004031342,0.00013779767,0.99510324,0.00003964336,0.000021956123,0.00001712296,0.00002913144,0.0002933332,0.00032631189],"genre_scores_gemma":[0.07808296,0.0002750155,0.9188696,0.0000633243,0.00004063297,0.00008179767,0.00022769882,0.00008116252,0.0022777542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956423,0.00009433027,0.000028119617,0.00009349921,0.00019724741,0.000022606062],"domain_scores_gemma":[0.99958676,0.00016883144,0.000053484066,0.000053084503,0.00011985959,0.000017920984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004947977,0.0007774582,0.00038680888,0.0008559219,0.00032112838,0.00058731815,0.00051346386,0.0005747999,0.0016109563],"category_scores_gemma":[0.0015734582,0.00023782387,0.00058386946,0.0005388619,0.00040659634,0.0007454299,0.000655127,0.0006138798,0.00089062675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003482339,0.00007877711,0.0010047876,0.00017621198,0.00007784308,0.00012707684,0.00010639653,0.035543595,0.10419712,0.009418896,0.0016375637,0.84728336],"study_design_scores_gemma":[0.00005502241,0.00022944903,0.002679049,0.00002855851,0.00004267186,0.0007926435,0.000035075613,0.8801409,0.10173131,0.005011664,0.009183899,0.00006978466],"about_ca_topic_score_codex":0.0010374542,"about_ca_topic_score_gemma":0.0012333991,"teacher_disagreement_score":0.0016109563,"about_ca_system_score_codex":0.00030026576,"about_ca_system_score_gemma":0.00077775866,"threshold_uncertainty_score":0.0053892136},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066758,0.00010807769,0.99182606,0.000047446392,0.00003460675,0.000041232834,0.000045427285,0.000285112,0.0009362341],"genre_scores_gemma":[0.24506614,0.00019386146,0.75073016,0.0001383308,0.00006886879,0.00020156517,0.00038497412,0.00018741234,0.003028645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996642,0.00009294587,0.00001569512,0.00007330303,0.00010793885,0.000045900968],"domain_scores_gemma":[0.99912745,0.0003892231,0.00010358926,0.00014880268,0.00018816521,0.00004271806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051475834,0.00074702676,0.0006589376,0.00066719204,0.00043301727,0.0008206806,0.0008509345,0.0006177265,0.0041749696],"category_scores_gemma":[0.0020033123,0.00034513095,0.0006299651,0.0008506188,0.0005937588,0.00077683316,0.001247833,0.00091553567,0.0008333228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018186109,0.000108660424,0.00087511714,0.00018984685,0.000059917744,0.00016312997,0.00014234042,0.69658375,0.02146653,0.028168153,0.0054570353,0.24660368],"study_design_scores_gemma":[0.000018009072,0.00004369139,0.00009584428,0.00001144485,0.0000091055235,0.000033889897,0.000016546286,0.98755175,0.004562812,0.0057016006,0.0019467681,0.000008610567],"about_ca_topic_score_codex":0.0022468432,"about_ca_topic_score_gemma":0.0026430315,"teacher_disagreement_score":0.0041749696,"about_ca_system_score_codex":0.00044622878,"about_ca_system_score_gemma":0.0010390655,"threshold_uncertainty_score":0.01396668},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002588442,0.00012848689,0.9965269,0.00003086436,0.000011032118,0.00000984182,0.000012402536,0.00021548494,0.0004766257],"genre_scores_gemma":[0.2245208,0.00070685736,0.7700667,0.00009282558,0.00004869642,0.00010771294,0.00017121111,0.00022415034,0.00406115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996376,0.00015898595,0.000020908506,0.00005257661,0.00010664878,0.000023267847],"domain_scores_gemma":[0.9995958,0.0001558684,0.00005965301,0.00007225109,0.00010389057,0.000012504774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066036783,0.0010155089,0.00049901847,0.0005588876,0.0002913831,0.00042908,0.0007785414,0.00061955367,0.0012315114],"category_scores_gemma":[0.0018353995,0.00035114642,0.0007647131,0.00045118653,0.00037796062,0.0005799759,0.00057425257,0.0007311549,0.00069052994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025639075,0.000088961126,0.0010728524,0.00036972837,0.00011923367,0.000496574,0.00024068209,0.6162364,0.07134263,0.03056904,0.0024290625,0.2767785],"study_design_scores_gemma":[0.0000053631243,0.00003983729,0.00017958276,0.000013568518,0.000011147563,0.00013720064,0.000012444417,0.98473465,0.009357105,0.00367176,0.00182205,0.000015218818],"about_ca_topic_score_codex":0.0017308482,"about_ca_topic_score_gemma":0.0023437354,"teacher_disagreement_score":0.0017308482,"about_ca_system_score_codex":0.0002179073,"about_ca_system_score_gemma":0.00043395755,"threshold_uncertainty_score":0.004119873},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033681819,0.00021118912,0.995631,0.00010166155,0.000018224635,0.00002653303,0.00004875812,0.00016389335,0.00043060703],"genre_scores_gemma":[0.20445648,0.0008452802,0.79191476,0.00024857424,0.00011395677,0.00014983607,0.0004934592,0.00013432396,0.0016433446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904495,0.00032207512,0.000070175294,0.0001154797,0.00040249448,0.000044733766],"domain_scores_gemma":[0.9983309,0.000855842,0.00018441821,0.00023821603,0.00032173138,0.00006895031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011247306,0.00068215013,0.0005480938,0.0008552142,0.0003458742,0.0006884424,0.00068793737,0.0005501977,0.0012580227],"category_scores_gemma":[0.004779548,0.00030417508,0.0004777983,0.0009143597,0.00061200454,0.00093849015,0.0012148728,0.001020602,0.00053751684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005138818,0.00017887594,0.0018816456,0.00047235706,0.00006543013,0.00034148694,0.00026550176,0.25057828,0.06704053,0.052209347,0.004608452,0.62184423],"study_design_scores_gemma":[0.00002334612,0.00008638671,0.00027321037,0.000019507455,0.00001128117,0.00016569781,0.000021179749,0.9725624,0.014923903,0.009419786,0.0024691245,0.000024358778],"about_ca_topic_score_codex":0.0016733541,"about_ca_topic_score_gemma":0.0020226557,"teacher_disagreement_score":0.0016733541,"about_ca_system_score_codex":0.00049005746,"about_ca_system_score_gemma":0.0009767932,"threshold_uncertainty_score":0.005948186},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050240965,0.00020919165,0.9939453,0.000034415993,0.00002667402,0.000019111993,0.000026474292,0.00028525697,0.00042946718],"genre_scores_gemma":[0.07359989,0.00044398234,0.9237746,0.00006120339,0.00005869617,0.00006436063,0.0001446258,0.00008455279,0.0017680433],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993767,0.000121654906,0.00005361023,0.00014614566,0.00026359508,0.000038300645],"domain_scores_gemma":[0.99931276,0.00031136617,0.00006798569,0.00008224943,0.00020573156,0.00001983817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007112148,0.0010358499,0.0004528262,0.0010932273,0.00022598014,0.0006860894,0.0005677958,0.001096306,0.0013129245],"category_scores_gemma":[0.0026752467,0.00025780234,0.0007943549,0.0008443559,0.0003241579,0.0010729061,0.0006328787,0.0006500051,0.00092098425],"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.0003881626,0.00006567144,0.001592136,0.00023647165,0.00010224952,0.00020177076,0.00014594434,0.013460989,0.13046212,0.0052521126,0.0010409815,0.8470514],"study_design_scores_gemma":[0.00012023885,0.00039299313,0.0064363675,0.00009381391,0.0002155619,0.00240177,0.000075424454,0.64452595,0.31799546,0.0072802743,0.020319566,0.00014270713],"about_ca_topic_score_codex":0.0009238573,"about_ca_topic_score_gemma":0.0010232126,"teacher_disagreement_score":0.0013129245,"about_ca_system_score_codex":0.00023391335,"about_ca_system_score_gemma":0.00045441752,"threshold_uncertainty_score":0.004392147},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034213953,0.00038045703,0.9638848,0.00009162144,0.000038489274,0.00003189072,0.00007923437,0.00045211424,0.0008273973],"genre_scores_gemma":[0.31606087,0.0007495738,0.6800049,0.000115870775,0.000055967677,0.00008337951,0.00039394954,0.00008816354,0.0024473367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970585,0.00007895082,0.000027153248,0.000053314172,0.00011593968,0.00001871368],"domain_scores_gemma":[0.99967635,0.00014737328,0.00004612717,0.000040386174,0.00007810026,0.000011770928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003547396,0.00061276165,0.0003439811,0.00093607634,0.00016819923,0.00045520702,0.000321024,0.0005703393,0.0011689556],"category_scores_gemma":[0.0014520697,0.00017912306,0.0004952743,0.0006570331,0.00028968183,0.0006110973,0.00044577898,0.00029564495,0.00060165155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004693494,0.000070032,0.0032561647,0.00030572654,0.00008457886,0.00044752247,0.0001524916,0.029749181,0.29537374,0.0050170645,0.0009611153,0.664113],"study_design_scores_gemma":[0.00007710079,0.00042427907,0.012164573,0.000057598256,0.00010656258,0.0031329521,0.0001242966,0.6057792,0.3613421,0.008496076,0.008195175,0.00010015259],"about_ca_topic_score_codex":0.0003794853,"about_ca_topic_score_gemma":0.00054093706,"teacher_disagreement_score":0.0011689556,"about_ca_system_score_codex":0.00017451055,"about_ca_system_score_gemma":0.00033454288,"threshold_uncertainty_score":0.003910601},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015407443,0.000842971,0.9955468,0.00017371104,0.00012749834,0.000021479302,0.00004757645,0.00014261076,0.0015565486],"genre_scores_gemma":[0.072961874,0.0026235792,0.91672677,0.00019751333,0.00032954305,0.0001820644,0.00042148394,0.000198776,0.006358391],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918336,0.00023645487,0.0000347139,0.00018972959,0.00032077427,0.000035051118],"domain_scores_gemma":[0.9986386,0.0007546351,0.000086850545,0.00015558078,0.00033536504,0.000028973036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013934566,0.0011091512,0.00072410505,0.0009443671,0.00058475387,0.00091155176,0.00059900497,0.0011950749,0.0034164933],"category_scores_gemma":[0.0055857385,0.00033689,0.0008767324,0.0011444751,0.00084716646,0.0011406759,0.0006424604,0.0018061607,0.0014802354],"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.00013836463,0.00008618714,0.00072791765,0.00043975672,0.00013149629,0.0001807657,0.00021756523,0.20327479,0.028430587,0.14315139,0.015150284,0.6080708],"study_design_scores_gemma":[0.000015797254,0.000039368046,0.0007020965,0.00005593183,0.00001826893,0.00015285175,0.00003084604,0.92213553,0.006685924,0.045466762,0.024662213,0.000034379296],"about_ca_topic_score_codex":0.0026198456,"about_ca_topic_score_gemma":0.0030663465,"teacher_disagreement_score":0.0034164933,"about_ca_system_score_codex":0.00081342313,"about_ca_system_score_gemma":0.0010099843,"threshold_uncertainty_score":0.01142925},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094937807,0.00017646747,0.9968874,0.000052167015,0.00009326563,0.00005910841,0.00008464999,0.00095642044,0.00074125436],"genre_scores_gemma":[0.03743566,0.00030446087,0.9528679,0.00013396016,0.00012958271,0.00054566714,0.00092206773,0.00049107254,0.007169575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812025,0.0006441573,0.00013248515,0.00040704233,0.0005658511,0.00013015034],"domain_scores_gemma":[0.99786085,0.0010752919,0.0001127824,0.00026364773,0.00063317193,0.000054275875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017268774,0.0015060024,0.0010650615,0.0018556595,0.00075606245,0.0014325904,0.0017261138,0.0018751696,0.01448642],"category_scores_gemma":[0.0070423996,0.0005495439,0.0009854288,0.0018241777,0.0007015056,0.0013699235,0.0014280337,0.0017911752,0.008640064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052255415,0.00011971043,0.00076007796,0.0003566719,0.00016122262,0.0002081314,0.0002041381,0.17222531,0.012750848,0.026992764,0.014040407,0.7716582],"study_design_scores_gemma":[0.00006662746,0.00011446104,0.00048514103,0.000044490167,0.000025848281,0.00019874371,0.000039291986,0.9552104,0.008746001,0.016724693,0.018285217,0.000059186437],"about_ca_topic_score_codex":0.003300326,"about_ca_topic_score_gemma":0.0034057251,"teacher_disagreement_score":0.01448642,"about_ca_system_score_codex":0.0006195622,"about_ca_system_score_gemma":0.0015593212,"threshold_uncertainty_score":0.048461914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005106175,0.00009063806,0.9943943,0.000021465776,0.000008439325,0.0000061338105,0.000005217487,0.000079667836,0.0002879189],"genre_scores_gemma":[0.55783176,0.00041557584,0.4384664,0.00009590741,0.00008216799,0.000092000366,0.000093109695,0.0000675592,0.0028554555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993297,0.0001911153,0.000026215062,0.0001493522,0.00026175304,0.000041978896],"domain_scores_gemma":[0.99907875,0.0005953758,0.00012617545,0.00006452658,0.00011468308,0.000020567151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080068083,0.00049501075,0.00081105786,0.00060131046,0.00029636823,0.00076363713,0.0004985012,0.00074869837,0.0005424739],"category_scores_gemma":[0.0037088154,0.000288038,0.0004056548,0.00041720102,0.00076990534,0.0012123239,0.00084676984,0.0005673749,0.00030840922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016178502,0.00004097578,0.0013186758,0.00019480412,0.000088348046,0.00012540263,0.00014685697,0.7539563,0.03843876,0.03793894,0.00039051575,0.16719861],"study_design_scores_gemma":[0.0000062091362,0.00004018307,0.000235779,0.000008052157,0.0000071201607,0.000060648596,0.000009529908,0.9872436,0.006118796,0.0055626156,0.0006903239,0.000017158629],"about_ca_topic_score_codex":0.0006746388,"about_ca_topic_score_gemma":0.0006219107,"teacher_disagreement_score":0.00081105786,"about_ca_system_score_codex":0.00034451424,"about_ca_system_score_gemma":0.0006290541,"threshold_uncertainty_score":0.004234493},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066641794,0.00058460556,0.9977198,0.0003477341,0.00003087244,0.000014603206,0.000029202749,0.00007089873,0.0005357541],"genre_scores_gemma":[0.18384154,0.009335506,0.8001827,0.0005682025,0.0010632002,0.00055553,0.00051986234,0.0003281205,0.003605323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99351317,0.0046843616,0.00020944657,0.0005554169,0.00091410376,0.00012359777],"domain_scores_gemma":[0.960696,0.035046265,0.0012894557,0.0013461146,0.0014465617,0.00017571192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009537676,0.0016135212,0.0017214804,0.0026437314,0.00071176566,0.001875724,0.0018671197,0.002176924,0.0037550675],"category_scores_gemma":[0.064518094,0.00084506784,0.0018264775,0.004107077,0.0030228014,0.0025678251,0.0022893187,0.004573378,0.0008659332],"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.00003485745,0.00005244103,0.0011944713,0.00032413824,0.00021669205,0.00016201295,0.00019860467,0.21376581,0.00068937987,0.68152237,0.0025634049,0.0992759],"study_design_scores_gemma":[0.000011802471,0.0000134610145,0.00023914129,0.000058036207,0.000020335394,0.000040061386,0.000022112503,0.47805646,0.00029510344,0.51928854,0.0019369245,0.000018067953],"about_ca_topic_score_codex":0.003660403,"about_ca_topic_score_gemma":0.0027355175,"teacher_disagreement_score":0.009537676,"about_ca_system_score_codex":0.001301682,"about_ca_system_score_gemma":0.002542852,"threshold_uncertainty_score":0.05044067},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032793455,0.00092622224,0.96263,0.0005067553,0.00004709683,0.00003797634,0.00016804661,0.00017699428,0.0027134567],"genre_scores_gemma":[0.7939081,0.0033381179,0.18779172,0.00046496358,0.00052251766,0.0004646285,0.0008419913,0.00042689088,0.012241039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734986,0.0014222286,0.0001302465,0.0003607732,0.0004976911,0.00023925607],"domain_scores_gemma":[0.947388,0.04463849,0.0026520428,0.0022379388,0.0025250984,0.0005585573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012588872,0.001075323,0.001536588,0.0020897374,0.00063691015,0.0032132692,0.0026275343,0.0018892644,0.0062358966],"category_scores_gemma":[0.058200676,0.0010351869,0.0013046936,0.0017915836,0.0036715826,0.004701611,0.0021168252,0.0031351591,0.00075735967],"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.00009887241,0.00005995434,0.0013389926,0.00020066653,0.00009271336,0.00009975209,0.00026017928,0.12877806,0.0017404897,0.84620255,0.0014868937,0.0196409],"study_design_scores_gemma":[0.000034508135,0.000044575918,0.0014692122,0.00008635278,0.000044562486,0.00012603054,0.0000914199,0.62567157,0.0008230498,0.37037638,0.0011818125,0.00005050015],"about_ca_topic_score_codex":0.0015746962,"about_ca_topic_score_gemma":0.0016051412,"teacher_disagreement_score":0.012588872,"about_ca_system_score_codex":0.0015410791,"about_ca_system_score_gemma":0.0014748606,"threshold_uncertainty_score":0.06657714},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054807544,0.00011663226,0.9438022,0.00017067521,0.00002660537,0.000016747774,0.000026656217,0.0001708584,0.0008621386],"genre_scores_gemma":[0.7677259,0.00020733755,0.22936583,0.00006940899,0.0000359786,0.000052143423,0.00007765117,0.000036725076,0.0024291126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983406,0.000055110748,0.000011034706,0.000027445813,0.00005947084,0.000012743675],"domain_scores_gemma":[0.9994522,0.00029796295,0.00009499476,0.00007657307,0.000058633956,0.000019685313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027776946,0.0002986165,0.00028315515,0.00028873634,0.00019561537,0.00030004542,0.0002668842,0.00043893902,0.0006757839],"category_scores_gemma":[0.0018976775,0.0001475924,0.00025383456,0.00022397922,0.0005006431,0.0008591114,0.0006910303,0.0005212926,0.00017121756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003156347,0.000073586816,0.0013600296,0.00016328396,0.00006115019,0.0003230073,0.00031997767,0.5200611,0.18766753,0.10834401,0.0007724099,0.18053836],"study_design_scores_gemma":[0.000006206921,0.00003098014,0.00011004666,0.000005059433,0.000003362277,0.00006316073,0.0000071080976,0.980142,0.011697415,0.00749088,0.0004350809,0.00000877081],"about_ca_topic_score_codex":0.00049199944,"about_ca_topic_score_gemma":0.0005778967,"teacher_disagreement_score":0.0006757839,"about_ca_system_score_codex":0.00026356478,"about_ca_system_score_gemma":0.00037286637,"threshold_uncertainty_score":0.0022607446},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015770674,0.00010501006,0.98299617,0.00017623114,0.000009509563,0.000028078533,0.0001395505,0.0005405694,0.00023421137],"genre_scores_gemma":[0.48705733,0.00034096115,0.509124,0.0001776546,0.0001135076,0.00021741778,0.0011848479,0.00022815683,0.0015561527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988581,0.00044375163,0.00006859729,0.0001855916,0.0003457247,0.00009836112],"domain_scores_gemma":[0.99534875,0.0031475318,0.00042502175,0.0004366401,0.00048838713,0.00015374972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030510966,0.00088321534,0.0012967434,0.0010067339,0.00048297193,0.00097152987,0.0014743163,0.00091626705,0.0013984565],"category_scores_gemma":[0.009810201,0.0007940014,0.0011022032,0.0013207104,0.0007103995,0.0015360437,0.0018709743,0.0013971878,0.00046925445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016048724,0.0000685304,0.0013789057,0.000056714896,0.00011586423,0.00010733436,0.000060807568,0.9196087,0.0050218524,0.0056749205,0.0010806179,0.06666538],"study_design_scores_gemma":[0.000005081632,0.0000045825786,0.00021542487,0.0000015373286,0.000002828899,0.0000058934133,0.000003507866,0.99623674,0.00026707267,0.0031731126,0.00008072664,0.0000034776447],"about_ca_topic_score_codex":0.0145356,"about_ca_topic_score_gemma":0.017608983,"teacher_disagreement_score":0.0145356,"about_ca_system_score_codex":0.00094068114,"about_ca_system_score_gemma":0.0017137947,"threshold_uncertainty_score":0.028901994},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024232376,0.00007943997,0.9745962,0.00010214486,0.000011201736,0.000026850228,0.000017855635,0.00011505581,0.0008188455],"genre_scores_gemma":[0.7203992,0.00010998873,0.2771343,0.00005100323,0.000017678854,0.00020662179,0.000079826124,0.000077146295,0.0019241986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997583,0.00010939473,0.000011680561,0.000038909886,0.00006226172,0.00001951224],"domain_scores_gemma":[0.9985933,0.0010221604,0.00014312973,0.000046042096,0.00015674665,0.000038683134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089910626,0.0006539455,0.00059178565,0.00040787976,0.00025731782,0.00047535202,0.00075695344,0.0006428766,0.00084340706],"category_scores_gemma":[0.003780212,0.00035579407,0.00041357704,0.00037144052,0.0006281104,0.0005407221,0.0008263792,0.00066871,0.00013319502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015372423,0.000006630135,0.00015577374,0.000012711293,0.000011305431,0.000018322617,0.000020315552,0.99124104,0.00064200774,0.002289455,0.000103861836,0.005483246],"study_design_scores_gemma":[0.0000010013952,0.0000021826743,0.00001191997,4.5338535e-7,4.9025454e-7,0.0000011519659,8.8806394e-7,0.99957114,0.000042150965,0.00034137222,0.000026752672,5.5644205e-7],"about_ca_topic_score_codex":0.005123413,"about_ca_topic_score_gemma":0.0035622704,"teacher_disagreement_score":0.005123413,"about_ca_system_score_codex":0.0005309081,"about_ca_system_score_gemma":0.0008238421,"threshold_uncertainty_score":0.010187149},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040397723,0.0001258506,0.99348986,0.000127371,0.000021616765,0.000010537732,0.000013406266,0.00002824996,0.0021433532],"genre_scores_gemma":[0.71088433,0.0007724206,0.28265545,0.00018563146,0.00013604226,0.00013975297,0.000048547117,0.000038379254,0.00513947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997422,0.000107485925,0.00001350289,0.000032201955,0.00008802555,0.000016614384],"domain_scores_gemma":[0.99969614,0.00014024031,0.000040668037,0.00004900167,0.000060215454,0.000013866722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005405116,0.00047214507,0.00042925656,0.00050019904,0.0004098096,0.00073118665,0.0006304877,0.0007416769,0.0014626399],"category_scores_gemma":[0.0010501466,0.00023443156,0.00053464907,0.00028451605,0.00078115094,0.0010982088,0.0007100476,0.0009415949,0.00026920642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023658438,0.00003425934,0.00018810554,0.00007893724,0.000023687046,0.00008731974,0.00018147731,0.65723735,0.009748973,0.31437647,0.0003321142,0.017687656],"study_design_scores_gemma":[0.0000017850492,0.000014038036,0.000033354852,0.0000062162017,0.0000026832972,0.000012722284,0.000014192016,0.9655673,0.00051720015,0.0330335,0.0007917336,0.000005247512],"about_ca_topic_score_codex":0.0015421404,"about_ca_topic_score_gemma":0.0014649141,"teacher_disagreement_score":0.0015421404,"about_ca_system_score_codex":0.0005322653,"about_ca_system_score_gemma":0.0003830759,"threshold_uncertainty_score":0.004893005},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17279293,0.0018511174,0.8239678,0.00015972558,0.000054677006,0.0000679377,0.0000901248,0.0002838951,0.00073171617],"genre_scores_gemma":[0.46423355,0.0012002264,0.53333557,0.000070527894,0.00007716562,0.0001561127,0.00016210118,0.00014140146,0.0006233676],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995433,0.0001673685,0.000053706066,0.000108467306,0.00008534849,0.000041848787],"domain_scores_gemma":[0.9980634,0.0012415727,0.00017478793,0.00016801864,0.00026295288,0.00008925207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012986177,0.0005005219,0.00048555157,0.00040502555,0.00025763008,0.0005670168,0.00040338674,0.000549103,0.00049203506],"category_scores_gemma":[0.00612373,0.00034112865,0.0002453608,0.00040678476,0.00042065905,0.0012973932,0.00049718976,0.00059838436,0.00030747766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034445238,0.00021244441,0.00378548,0.00047233244,0.00007576781,0.00034747753,0.00038493337,0.041511893,0.5529649,0.01138597,0.0009322378,0.3844821],"study_design_scores_gemma":[0.00027544893,0.0012471826,0.014260288,0.00022678716,0.00026949614,0.0009126854,0.00021962967,0.5674465,0.39310092,0.015300695,0.0065572495,0.00018316484],"about_ca_topic_score_codex":0.00029327802,"about_ca_topic_score_gemma":0.00048077357,"teacher_disagreement_score":0.0012986177,"about_ca_system_score_codex":0.00023473352,"about_ca_system_score_gemma":0.0003853108,"threshold_uncertainty_score":0.006867826},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007279146,0.011169264,0.8411284,0.0004897857,0.0011844136,0.00007333988,0.00051082415,0.0034850184,0.14123107],"genre_scores_gemma":[0.013494455,0.022009006,0.39330456,0.00049892697,0.0011844215,0.00022720732,0.0025736142,0.0021679169,0.56453997],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995109,0.000049402326,0.00001822843,0.00010624546,0.00029627318,0.000018886254],"domain_scores_gemma":[0.99962604,0.00009706305,0.000015719324,0.000080631406,0.00016362521,0.000016940765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036426834,0.0018166387,0.0009853157,0.0018076744,0.00062019436,0.002112214,0.0010048155,0.0010182651,0.056770813],"category_scores_gemma":[0.0010988525,0.00060465955,0.00062019,0.0026490302,0.0007116063,0.001862563,0.0014051313,0.0018205642,0.073250435],"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.000020733834,0.00002497,0.000059718368,0.00024061707,0.000026984053,0.000047960304,0.000060273305,0.0022192774,0.0056409123,0.029310966,0.11130956,0.851038],"study_design_scores_gemma":[0.000008224069,0.000034595345,0.0006718501,0.00018622298,0.000038254206,0.00056257646,0.000070527,0.01881828,0.011550091,0.07047771,0.89752173,0.000059983373],"about_ca_topic_score_codex":0.000647447,"about_ca_topic_score_gemma":0.0013540102,"teacher_disagreement_score":0.056770813,"about_ca_system_score_codex":0.00037296038,"about_ca_system_score_gemma":0.0006146544,"threshold_uncertainty_score":0.18991733},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000833537,0.020716866,0.7676426,0.0009828879,0.003212156,0.00007831113,0.00042567993,0.0023742046,0.2037338],"genre_scores_gemma":[0.015109637,0.031014798,0.22414681,0.0011372117,0.0024594516,0.00016299354,0.0017905822,0.0012636723,0.7229148],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995833,0.000042319603,0.000016817658,0.00009841742,0.00023965856,0.000019487125],"domain_scores_gemma":[0.9995927,0.0001208096,0.00001744076,0.00007300478,0.00017387459,0.000022264396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003590851,0.0015645504,0.0008149986,0.001641261,0.00057696964,0.0020443208,0.0009170517,0.0014314518,0.053580564],"category_scores_gemma":[0.001242531,0.00048310432,0.00060591917,0.0015177231,0.0008387091,0.0023499795,0.0018446583,0.0022620729,0.06657138],"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.00004406178,0.000038611965,0.000046020807,0.00046568856,0.000030225252,0.00006225326,0.0000702858,0.0023463606,0.012240102,0.05475154,0.12845631,0.8014485],"study_design_scores_gemma":[0.000011694533,0.00004488277,0.00024079626,0.0002598588,0.0000339936,0.0007006275,0.000047835907,0.011249268,0.017334899,0.08398445,0.8860362,0.000055394925],"about_ca_topic_score_codex":0.00039983582,"about_ca_topic_score_gemma":0.0006916747,"teacher_disagreement_score":0.053580564,"about_ca_system_score_codex":0.0004747481,"about_ca_system_score_gemma":0.00062010135,"threshold_uncertainty_score":0.17924488},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029417453,0.00008134768,0.9965616,0.000025314652,0.000012844645,0.000011633479,0.000013049571,0.0001481534,0.00020429282],"genre_scores_gemma":[0.066442505,0.00024914657,0.9305971,0.00005232247,0.000041346928,0.00007613013,0.00011940308,0.0001283925,0.0022936715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996567,0.00009987703,0.0000249333,0.0000620557,0.00013248298,0.000024000998],"domain_scores_gemma":[0.99951184,0.00022108956,0.000047965143,0.00007986749,0.00011657859,0.000022666833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070901436,0.00065709575,0.00042575307,0.0006820578,0.00028495365,0.00046686787,0.0005589877,0.00058817136,0.002052321],"category_scores_gemma":[0.0017947919,0.00019744597,0.00077071873,0.00048452357,0.0005431429,0.00078449625,0.0007138777,0.0007437886,0.00082326296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003148629,0.0001412792,0.000981602,0.00032230935,0.00017094587,0.00016824923,0.00022919566,0.073405035,0.15561743,0.02351762,0.0022975055,0.7428339],"study_design_scores_gemma":[0.000028818633,0.00010134577,0.0017472553,0.000021273314,0.000051247054,0.0003102349,0.00003696439,0.9169566,0.06519892,0.009159195,0.0063489345,0.000039319322],"about_ca_topic_score_codex":0.0011569026,"about_ca_topic_score_gemma":0.0019658848,"teacher_disagreement_score":0.002052321,"about_ca_system_score_codex":0.00024825495,"about_ca_system_score_gemma":0.0006523889,"threshold_uncertainty_score":0.00686568},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018686962,0.0030709268,0.98463714,0.00079092185,0.0001400573,0.000036676218,0.00014410722,0.00013340279,0.009178023],"genre_scores_gemma":[0.3930943,0.017865911,0.56101996,0.0017596746,0.003055106,0.0008699091,0.0009576665,0.00037270633,0.021004763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99608177,0.0017330949,0.00022947563,0.0008832666,0.00084717484,0.00022518207],"domain_scores_gemma":[0.99088895,0.006597618,0.0008871417,0.00046313205,0.0010354338,0.00012776193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005863979,0.0011189113,0.0012113693,0.0027735692,0.0009210211,0.0038438912,0.0014582798,0.0022068322,0.0060950164],"category_scores_gemma":[0.011819228,0.00065759255,0.0017018457,0.0038369133,0.0043313517,0.0038415655,0.002023474,0.0024742633,0.0013895121],"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.000008150645,0.000008733606,0.00020342345,0.000112907015,0.000025586178,0.000052169824,0.00011901113,0.008059503,0.00020730012,0.9704944,0.0012264014,0.019482467],"study_design_scores_gemma":[0.000008457992,0.000023063678,0.00018855675,0.000085122214,0.000023258983,0.00010886643,0.000031130192,0.05433894,0.00017174886,0.9331844,0.011813419,0.000023143086],"about_ca_topic_score_codex":0.0028154845,"about_ca_topic_score_gemma":0.0011145534,"teacher_disagreement_score":0.0060950164,"about_ca_system_score_codex":0.0018677794,"about_ca_system_score_gemma":0.0012118632,"threshold_uncertainty_score":0.031012058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011246951,0.00014190399,0.9980234,0.000044094497,0.000029981182,0.0000070900646,0.000021399752,0.000144108,0.0004633729],"genre_scores_gemma":[0.060327582,0.0005013707,0.9352063,0.00018759706,0.000089994,0.000112680944,0.00024006868,0.000119984616,0.0032144617],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987513,0.0004773034,0.00006861423,0.00018706948,0.00044924216,0.000066530214],"domain_scores_gemma":[0.9987379,0.0004858378,0.00012798168,0.00017469483,0.0004226069,0.000050930223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000913146,0.0009311621,0.0011748772,0.00059553306,0.00034677127,0.0008005309,0.0009952006,0.0014200683,0.003934084],"category_scores_gemma":[0.0033059353,0.0004871491,0.00085082056,0.001309115,0.0004811947,0.0011991919,0.0012441564,0.0010550352,0.0020647608],"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.00053006306,0.00013025946,0.0005682753,0.000397523,0.00019425414,0.00008462526,0.00017198757,0.13354385,0.0781803,0.034435987,0.005982893,0.74577993],"study_design_scores_gemma":[0.00006726303,0.00026207766,0.0006324755,0.0000646216,0.00006476771,0.00035047063,0.00004679346,0.9401045,0.030481165,0.015126318,0.012735985,0.00006360275],"about_ca_topic_score_codex":0.00072422024,"about_ca_topic_score_gemma":0.0019554743,"teacher_disagreement_score":0.003934084,"about_ca_system_score_codex":0.00020543348,"about_ca_system_score_gemma":0.0009577254,"threshold_uncertainty_score":0.013160825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010605615,0.00032843553,0.9884239,0.00007452188,0.00002064787,0.000011609743,0.000023175076,0.0002427274,0.00026945482],"genre_scores_gemma":[0.40505263,0.0007637592,0.5920277,0.00008188553,0.00010134567,0.000077868295,0.00023198985,0.00020427424,0.0014585241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991454,0.00036534283,0.00006516149,0.00013940812,0.00022771896,0.000056953086],"domain_scores_gemma":[0.9975243,0.0016423494,0.00026752753,0.00025218076,0.00026030425,0.000053314343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015955702,0.0007470734,0.0008913038,0.00081883505,0.00041273085,0.0008262013,0.0004985468,0.00064204115,0.00078127603],"category_scores_gemma":[0.0064712013,0.0003999458,0.0006955698,0.0007591347,0.0005050518,0.0007374475,0.0006323779,0.001110851,0.0004708531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042168947,0.00012068144,0.003949235,0.00023905205,0.000103929975,0.00016692009,0.00028375926,0.45625195,0.029549431,0.021788957,0.0015382658,0.48558602],"study_design_scores_gemma":[0.000009796468,0.000048809063,0.00083781016,0.000014727391,0.000012188216,0.00005826441,0.000014848762,0.98642844,0.0050757877,0.006645459,0.0008324922,0.000021389846],"about_ca_topic_score_codex":0.0023871968,"about_ca_topic_score_gemma":0.0030772681,"teacher_disagreement_score":0.0023871968,"about_ca_system_score_codex":0.00036208954,"about_ca_system_score_gemma":0.00089060643,"threshold_uncertainty_score":0.008438289},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074181096,0.00015580514,0.99163955,0.00008078148,0.000028374498,0.000020206871,0.00005265854,0.00019746114,0.00040704192],"genre_scores_gemma":[0.20785779,0.0007297555,0.7871772,0.00015409385,0.0001422048,0.00012610776,0.0005785468,0.00013438305,0.0030999854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964964,0.000091629285,0.000020169637,0.00009381501,0.00010533851,0.000039441977],"domain_scores_gemma":[0.99952126,0.00017810745,0.000092875875,0.00007157698,0.00010997678,0.00002629782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007412269,0.0012396466,0.0006350569,0.00081647467,0.0003000892,0.0006400311,0.0006705086,0.00090696965,0.0009985799],"category_scores_gemma":[0.0016130644,0.00031914,0.0013082363,0.0005871749,0.00055888784,0.001358249,0.00058801944,0.0012503535,0.0006775264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029527184,0.00017951704,0.00095743506,0.0003506266,0.00013131055,0.00021721542,0.00019112641,0.43790197,0.08666172,0.026542313,0.004659118,0.44191232],"study_design_scores_gemma":[0.0000053504245,0.000026391073,0.00020420873,0.0000070667033,0.000009475631,0.000047024387,0.000012160014,0.9899879,0.0041196966,0.0045987535,0.00096911343,0.000012837094],"about_ca_topic_score_codex":0.0028063022,"about_ca_topic_score_gemma":0.0032830532,"teacher_disagreement_score":0.0028063022,"about_ca_system_score_codex":0.0004274682,"about_ca_system_score_gemma":0.0006658933,"threshold_uncertainty_score":0.0055799484},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012894997,0.0002511226,0.9857767,0.000040989245,0.000060693597,0.000024014344,0.000028208084,0.00029140819,0.0006318007],"genre_scores_gemma":[0.23620278,0.00069312524,0.7601191,0.00007639284,0.00009451194,0.00015190314,0.00020576044,0.00029962164,0.0021568665],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868363,0.0005370414,0.000078886726,0.00018362346,0.00043593958,0.000080786194],"domain_scores_gemma":[0.9974778,0.0015791468,0.00019908205,0.00037739094,0.00031462894,0.00005196299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020715857,0.0007227496,0.00069064583,0.0006724909,0.00032829997,0.00085959496,0.00056466233,0.00096785463,0.0020679897],"category_scores_gemma":[0.007813697,0.0003796454,0.0006195398,0.0006524328,0.00069176627,0.0013235857,0.0010315139,0.0011549257,0.00097081834],"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.0012664633,0.00018096814,0.0018971784,0.00041271278,0.0001093663,0.00057325675,0.000268981,0.119536884,0.25115106,0.057565693,0.002210908,0.5648265],"study_design_scores_gemma":[0.00004443625,0.00029789718,0.0018484486,0.000057894475,0.000043681463,0.0006906029,0.00004258844,0.86532634,0.10522388,0.019072521,0.0072760554,0.00007558876],"about_ca_topic_score_codex":0.00038241057,"about_ca_topic_score_gemma":0.00035230725,"teacher_disagreement_score":0.0020715857,"about_ca_system_score_codex":0.00024799755,"about_ca_system_score_gemma":0.00041724017,"threshold_uncertainty_score":0.010955751},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065392284,0.000056926987,0.9927043,0.00004104773,0.00001239965,0.000014687208,0.00002299023,0.00024070921,0.00036781686],"genre_scores_gemma":[0.06661504,0.00014384049,0.93072927,0.0000474847,0.000027318198,0.00008480367,0.00017570557,0.00013363292,0.0020429394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945635,0.00009193277,0.00003315813,0.00012594297,0.00024642967,0.000046310983],"domain_scores_gemma":[0.9994623,0.00018995366,0.000071561015,0.00009674821,0.0001452479,0.00003413889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000944818,0.0011691655,0.0008478942,0.00065491255,0.00035490518,0.00078242447,0.0008412496,0.0009077249,0.0018771386],"category_scores_gemma":[0.002301599,0.0005410054,0.0011154854,0.0007809518,0.000682102,0.0012302898,0.0014495578,0.0010697845,0.0011818819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031439125,0.00010237883,0.0011597369,0.00026700913,0.00015588458,0.00025532237,0.0004912989,0.4897634,0.09042503,0.028839532,0.0027646858,0.38546127],"study_design_scores_gemma":[0.000010941928,0.000034808745,0.00018154747,0.0000073287583,0.00001019472,0.000042459047,0.000017165938,0.9842264,0.0105212005,0.0033910046,0.0015402819,0.000016703554],"about_ca_topic_score_codex":0.003602694,"about_ca_topic_score_gemma":0.004462275,"teacher_disagreement_score":0.003602694,"about_ca_system_score_codex":0.0004952503,"about_ca_system_score_gemma":0.0014214673,"threshold_uncertainty_score":0.0071634054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022327824,0.0000885884,0.9752099,0.000086182525,0.000018981324,0.000023815293,0.00015057498,0.0013239629,0.00077016465],"genre_scores_gemma":[0.27805024,0.00021547038,0.71959263,0.000045865007,0.00002630091,0.000106866166,0.0006039381,0.00022642758,0.0011322296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999018,0.000015989897,0.0000045799547,0.000018352468,0.000042862295,0.00001643914],"domain_scores_gemma":[0.99977785,0.00007526965,0.000033729255,0.000038742397,0.00006411165,0.000010303827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002955322,0.00081361545,0.00042754624,0.0010449005,0.0002845706,0.00067114603,0.0005938157,0.00051365653,0.0014253408],"category_scores_gemma":[0.00088819163,0.0004063724,0.0010814515,0.00093026593,0.0003641569,0.0008101124,0.00061831076,0.00079079194,0.00054077985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012722424,0.00007939289,0.0026830556,0.00015343142,0.00010649992,0.00020309322,0.0001464775,0.57945335,0.07728754,0.008692785,0.0026203769,0.32844666],"study_design_scores_gemma":[0.00000435142,0.00000879209,0.0005567601,0.0000031359657,0.00000841968,0.000031841882,0.000009519488,0.99173427,0.0051812124,0.0016185809,0.00083332625,0.000009715523],"about_ca_topic_score_codex":0.003955635,"about_ca_topic_score_gemma":0.0050578187,"teacher_disagreement_score":0.003955635,"about_ca_system_score_codex":0.00038814344,"about_ca_system_score_gemma":0.0010945002,"threshold_uncertainty_score":0.0078651905},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023044791,0.00008792085,0.9744965,0.00008569346,0.000019019077,0.000024027398,0.00014911106,0.0013259198,0.00076694414],"genre_scores_gemma":[0.28073305,0.00021238481,0.71695375,0.00004499144,0.000025722922,0.000105699895,0.00058664876,0.00022279589,0.0011149154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990165,0.00001592499,0.0000046054583,0.000018424047,0.000042906948,0.000016471702],"domain_scores_gemma":[0.99977857,0.0000748334,0.000033591117,0.000038521666,0.0000642387,0.000010267718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029837748,0.0008122459,0.00042492352,0.0010478023,0.00028537505,0.0006699408,0.00059076253,0.00051041483,0.0014013033],"category_scores_gemma":[0.0008860531,0.00040922285,0.0010811121,0.0009283159,0.00036434355,0.00081036874,0.0006119894,0.00079051737,0.00052954006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012758386,0.00007952352,0.0027396472,0.00015420945,0.000107043554,0.00020470517,0.00015026028,0.5796942,0.07857075,0.008678515,0.0025784117,0.3269151],"study_design_scores_gemma":[0.00000434069,0.000008858976,0.00056284235,0.000003112582,0.000008511034,0.000031733383,0.000009676464,0.9916992,0.0052545373,0.0015870437,0.0008204161,0.000009787848],"about_ca_topic_score_codex":0.0039953245,"about_ca_topic_score_gemma":0.0051199435,"teacher_disagreement_score":0.0039953245,"about_ca_system_score_codex":0.0003902685,"about_ca_system_score_gemma":0.0010984741,"threshold_uncertainty_score":0.007944167},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16424999,0.0014063577,0.83153,0.00013358695,0.00008728305,0.00009124159,0.00025499566,0.0013162096,0.0009303828],"genre_scores_gemma":[0.76906276,0.0009102924,0.22713642,0.00005766355,0.000064959255,0.000073160714,0.00069100084,0.000091326525,0.0019124177],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995735,0.00014093031,0.00004026773,0.00007086448,0.00013705887,0.000037424776],"domain_scores_gemma":[0.9988907,0.00068444264,0.000110535366,0.00007890954,0.00019208578,0.00004341414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008595884,0.00061844545,0.00036855135,0.0014843533,0.00021463915,0.0005937461,0.0003210032,0.0005910937,0.0008054295],"category_scores_gemma":[0.0030358299,0.00014211929,0.0003979112,0.0006787546,0.0002935922,0.0006017081,0.00044385076,0.0004547531,0.0007556097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014528302,0.00030023322,0.0070294053,0.0003081452,0.00017138974,0.0004332752,0.00021581413,0.08571687,0.12579438,0.0014095777,0.0017256562,0.7754424],"study_design_scores_gemma":[0.00006940362,0.0004982794,0.02537022,0.000046893354,0.00009617524,0.00087659253,0.00014870903,0.86529225,0.09985548,0.005020699,0.002650152,0.000075184544],"about_ca_topic_score_codex":0.0011284314,"about_ca_topic_score_gemma":0.0011688765,"teacher_disagreement_score":0.0014843533,"about_ca_system_score_codex":0.00012242848,"about_ca_system_score_gemma":0.0003638687,"threshold_uncertainty_score":0.0045459867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006503387,0.00016232928,0.9918658,0.000093645285,0.000024480396,0.00001160867,0.000015040998,0.0001510833,0.0011725839],"genre_scores_gemma":[0.18153109,0.00039879736,0.81334156,0.00012909832,0.00006046379,0.000053586853,0.00009417019,0.00018814944,0.004203039],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993711,0.0001611145,0.000028920085,0.00012103903,0.00027834743,0.000039549315],"domain_scores_gemma":[0.9992003,0.0004312699,0.0000801061,0.0001168736,0.00014018264,0.000031240612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013231742,0.0007271181,0.00065777084,0.0008300977,0.00041484076,0.00083597127,0.000580845,0.0011157108,0.0020299659],"category_scores_gemma":[0.0026431796,0.00038939185,0.00077999354,0.0006180209,0.001155001,0.0011511495,0.0018120292,0.0013562997,0.00070461276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034842832,0.000102411264,0.00095800107,0.0003339482,0.00015238016,0.00024562923,0.00035239378,0.35925615,0.18566102,0.15570292,0.003147423,0.29373935],"study_design_scores_gemma":[0.000014212878,0.000041631396,0.0001983435,0.000016269834,0.000012275003,0.00011845947,0.000023814626,0.93739206,0.02320272,0.034887563,0.0040714564,0.000021318545],"about_ca_topic_score_codex":0.0011336348,"about_ca_topic_score_gemma":0.0015427469,"teacher_disagreement_score":0.0020299659,"about_ca_system_score_codex":0.00040658028,"about_ca_system_score_gemma":0.0005861874,"threshold_uncertainty_score":0.0069977045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019212865,0.00029557926,0.996741,0.00006487407,0.0000457072,0.00002100975,0.000046692112,0.00039115676,0.00047270043],"genre_scores_gemma":[0.14632042,0.0008981126,0.847922,0.0001992359,0.00025753453,0.0001527532,0.0005156623,0.00039385704,0.0033403079],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896836,0.00022183589,0.00006199234,0.00028922755,0.00038637762,0.000072092684],"domain_scores_gemma":[0.9988722,0.00032541846,0.000117401614,0.00019536236,0.00043496906,0.00005459021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096979627,0.001232152,0.0011143846,0.0024476303,0.00052618136,0.001231909,0.0012095355,0.0009952304,0.002680287],"category_scores_gemma":[0.0028238343,0.00036404963,0.0017209788,0.0022598591,0.0006380083,0.0018936889,0.000993767,0.0012868611,0.0014143161],"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.0002143004,0.00009687625,0.0010518751,0.0002918905,0.0002640612,0.00029239437,0.00014476967,0.05387632,0.06560986,0.020620288,0.007771501,0.84976596],"study_design_scores_gemma":[0.000015900925,0.00010069141,0.0016600502,0.000021851976,0.000083246116,0.0005661783,0.00003841408,0.96111774,0.01841429,0.008880792,0.009022555,0.00007828867],"about_ca_topic_score_codex":0.0025278497,"about_ca_topic_score_gemma":0.002409856,"teacher_disagreement_score":0.002680287,"about_ca_system_score_codex":0.0005335644,"about_ca_system_score_gemma":0.0008818993,"threshold_uncertainty_score":0.0089665055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017770362,0.00019000171,0.9974515,0.000027951959,0.000016355782,0.0000118036805,0.000018591842,0.00018989484,0.00031697965],"genre_scores_gemma":[0.14213349,0.00040143798,0.85423505,0.00007665305,0.000060931863,0.00012581912,0.0002639437,0.00015828793,0.0025443153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987903,0.00042237606,0.000067277935,0.00021745126,0.00039873843,0.00010381704],"domain_scores_gemma":[0.9992181,0.0002953222,0.00009967319,0.00009422812,0.00025225797,0.00004030942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011989778,0.0010309765,0.0009173563,0.001429665,0.0005255528,0.00093335286,0.00080363016,0.00082275126,0.0024411608],"category_scores_gemma":[0.0027993706,0.00037870614,0.00083310646,0.001399735,0.0007048851,0.0013599738,0.0012882082,0.00087718986,0.0008478961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035661855,0.000087308865,0.0010812018,0.00032088935,0.00020380675,0.00017708285,0.00016775608,0.18278879,0.052252896,0.051649146,0.0053380053,0.7055764],"study_design_scores_gemma":[0.000017213262,0.0000631907,0.00044819986,0.000022227212,0.000023043776,0.00011868421,0.00002594714,0.975183,0.010063372,0.010849319,0.0031587114,0.000027151324],"about_ca_topic_score_codex":0.0026219222,"about_ca_topic_score_gemma":0.0031574534,"teacher_disagreement_score":0.0026219222,"about_ca_system_score_codex":0.00043552654,"about_ca_system_score_gemma":0.0012877065,"threshold_uncertainty_score":0.008166492},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005565372,0.0024941564,0.9871494,0.0003397177,0.0002206432,0.00009488397,0.00088573096,0.0009574382,0.0022926442],"genre_scores_gemma":[0.12622812,0.0069257114,0.8555434,0.00022550946,0.0004804779,0.0003086898,0.0027712216,0.0004758794,0.007041058],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99945027,0.00014961029,0.000046252968,0.00015607163,0.00015947179,0.000038366383],"domain_scores_gemma":[0.9993055,0.00017205563,0.000118252436,0.000120602694,0.0002481907,0.000035415018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006337732,0.0012965606,0.000658576,0.0013382928,0.00037937463,0.00086817495,0.0007187726,0.0006329441,0.0063275965],"category_scores_gemma":[0.0020929498,0.00015160699,0.0009768677,0.0022504495,0.0004660653,0.0011851478,0.000678268,0.0009951455,0.0036637606],"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.00021418162,0.00012599208,0.0023496042,0.0014669077,0.00018277433,0.0005839738,0.00030459714,0.0314302,0.15038337,0.054486066,0.020197904,0.73827446],"study_design_scores_gemma":[0.00003702071,0.00042017686,0.011450127,0.0003092274,0.00022287075,0.0014928221,0.0003415103,0.7382416,0.057756778,0.065822564,0.12368069,0.000224641],"about_ca_topic_score_codex":0.001718092,"about_ca_topic_score_gemma":0.0017642245,"teacher_disagreement_score":0.0063275965,"about_ca_system_score_codex":0.00028844964,"about_ca_system_score_gemma":0.0006451974,"threshold_uncertainty_score":0.021167934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26446623,0.00041251915,0.73101187,0.00043054446,0.00012625835,0.000050419876,0.00014283851,0.00033277212,0.0030265138],"genre_scores_gemma":[0.88897395,0.0004363847,0.103074595,0.00007390854,0.00010154258,0.000116272,0.00019054838,0.000035748424,0.0069969897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953926,0.00014930162,0.00002264617,0.00006443768,0.0001535499,0.000070858194],"domain_scores_gemma":[0.9990995,0.00050971046,0.00007430547,0.00013002867,0.00015944654,0.000026998574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007356089,0.0005096865,0.00046765892,0.00045658674,0.00040544468,0.00051773834,0.00025711232,0.0007608635,0.0011620639],"category_scores_gemma":[0.00308057,0.00021039523,0.00027568493,0.00030853716,0.00045419837,0.00059920567,0.0004326214,0.0006050504,0.0004905566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002175494,0.00019224676,0.0074373703,0.00026405824,0.00014381167,0.0015039502,0.00073627115,0.14113565,0.37532762,0.040526576,0.002035594,0.42852145],"study_design_scores_gemma":[0.00013777104,0.0006403232,0.011931713,0.000037729937,0.000060377886,0.0013147835,0.00013358652,0.8443812,0.12409804,0.011969562,0.0052519017,0.000043052383],"about_ca_topic_score_codex":0.0008163027,"about_ca_topic_score_gemma":0.000679576,"teacher_disagreement_score":0.0011620639,"about_ca_system_score_codex":0.00023036478,"about_ca_system_score_gemma":0.0005199723,"threshold_uncertainty_score":0.0038903356},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16602597,0.0039554145,0.8229481,0.0007574562,0.00019809199,0.002064932,0.00088341604,0.0017161779,0.0014504023],"genre_scores_gemma":[0.60634744,0.00080952625,0.386208,0.0003374675,0.00026320486,0.0032888877,0.0010624261,0.0004467922,0.0012363316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9696035,0.023116294,0.0017891867,0.0030213885,0.0021251524,0.00034455437],"domain_scores_gemma":[0.5699942,0.4097227,0.008648736,0.0064540156,0.0038333964,0.0013469429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.08334628,0.0013068129,0.003887208,0.0029007336,0.000522819,0.001707153,0.0025929394,0.0027166994,0.0038552629],"category_scores_gemma":[0.20438291,0.0006052401,0.0014569577,0.0016590316,0.00097044883,0.0027245265,0.001561776,0.0020220263,0.00052909605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.031954195,0.0014336262,0.11339953,0.001815775,0.007662463,0.00082880654,0.0007003487,0.21917656,0.003998739,0.009269795,0.004515024,0.6052451],"study_design_scores_gemma":[0.0006682245,0.0013484312,0.014876123,0.00008344863,0.00059761765,0.00044967752,0.00005720924,0.976077,0.00096687383,0.0035602984,0.0012610904,0.00005395788],"about_ca_topic_score_codex":0.0011444826,"about_ca_topic_score_gemma":0.0008699504,"teacher_disagreement_score":0.08334628,"about_ca_system_score_codex":0.00059456326,"about_ca_system_score_gemma":0.0020276129,"threshold_uncertainty_score":0.4407825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011553838,0.0002490181,0.9965329,0.00010522552,0.00005771709,0.000008025303,0.000092425806,0.00019558893,0.0016036526],"genre_scores_gemma":[0.36489967,0.004377515,0.5410869,0.00066485576,0.00086192135,0.0005486799,0.0025116447,0.0014449644,0.08360387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864954,0.000573092,0.000064253836,0.00028154676,0.00033429085,0.00009728733],"domain_scores_gemma":[0.9966012,0.0021337166,0.00025984715,0.00047688856,0.00047164378,0.00005662314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002410239,0.0018567999,0.0016324213,0.0008088872,0.00056149747,0.0021204231,0.0025870933,0.0019825925,0.0043836893],"category_scores_gemma":[0.008570044,0.0013711009,0.0020254026,0.001798143,0.001346152,0.0036773349,0.001824401,0.0027535695,0.0030688564],"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.000046149937,0.0000504542,0.00036897085,0.00010204224,0.000116255505,0.00006613378,0.000112597925,0.42264757,0.0008620188,0.52316886,0.0057137846,0.04674518],"study_design_scores_gemma":[0.000007349319,0.000009474369,0.000109188404,0.000014886849,0.00002847752,0.000036659334,0.000011776703,0.79135257,0.00030519845,0.20483492,0.003267822,0.000021760572],"about_ca_topic_score_codex":0.0059218323,"about_ca_topic_score_gemma":0.005256415,"teacher_disagreement_score":0.0059218323,"about_ca_system_score_codex":0.0006444689,"about_ca_system_score_gemma":0.00132212,"threshold_uncertainty_score":0.014664888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046525453,0.0002543336,0.9940435,0.00004724311,0.00004257116,0.000016156957,0.000042952786,0.00021601943,0.0006847918],"genre_scores_gemma":[0.17444688,0.0011464795,0.81471795,0.0001234059,0.00012068201,0.00015266667,0.0004611858,0.0002123492,0.008618424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975544,0.00005171898,0.000015691,0.000047990696,0.00010755174,0.000021605598],"domain_scores_gemma":[0.9997508,0.00007303179,0.000017616969,0.00003678182,0.000108199994,0.000013494355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039684784,0.00051640987,0.00037674024,0.00051502755,0.0003387063,0.00048110116,0.00056509196,0.0004685536,0.002952422],"category_scores_gemma":[0.00094368303,0.00013826594,0.0006863219,0.00051937636,0.00031857303,0.00075321173,0.00052194664,0.00064799364,0.0011358297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045416574,0.00014618937,0.000853784,0.00043123608,0.00015320034,0.00010967649,0.00013418304,0.020855727,0.15470943,0.011824933,0.0036877717,0.8066397],"study_design_scores_gemma":[0.000059280344,0.00020127032,0.005316776,0.000050762017,0.0001481293,0.00072723115,0.00008811964,0.8174739,0.15215991,0.009085727,0.01460575,0.0000832553],"about_ca_topic_score_codex":0.0011938785,"about_ca_topic_score_gemma":0.0022107805,"teacher_disagreement_score":0.002952422,"about_ca_system_score_codex":0.00018395638,"about_ca_system_score_gemma":0.00075178733,"threshold_uncertainty_score":0.009876847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067563727,0.0011621147,0.9853941,0.0007036107,0.0005712221,0.00041916058,0.001080999,0.0010748891,0.002837457],"genre_scores_gemma":[0.09013913,0.0010154884,0.8993604,0.00062668603,0.00027555955,0.0019065884,0.0033380743,0.0006764257,0.0026615886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9658719,0.015527169,0.0037422152,0.004702978,0.0093689095,0.00078685046],"domain_scores_gemma":[0.86635494,0.08127187,0.013878138,0.017412856,0.020242201,0.0008400775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.032124367,0.0031359238,0.0020337782,0.0070434227,0.0015329869,0.0031094563,0.0045713554,0.002733408,0.008306213],"category_scores_gemma":[0.2315511,0.0014562252,0.004430895,0.01148463,0.0020415878,0.0062988135,0.0033934794,0.0085469,0.0031494698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002841559,0.00046230745,0.038995955,0.0025662824,0.0027515003,0.0008742027,0.0028591705,0.16033271,0.0046445364,0.10482052,0.049676947,0.6317317],"study_design_scores_gemma":[0.00020924809,0.00049862335,0.031562384,0.0014683468,0.0008947672,0.0014628915,0.0014158522,0.7470121,0.010142044,0.13845736,0.06607278,0.00080363866],"about_ca_topic_score_codex":0.014288245,"about_ca_topic_score_gemma":0.022431562,"teacher_disagreement_score":0.032124367,"about_ca_system_score_codex":0.0027972802,"about_ca_system_score_gemma":0.0076317657,"threshold_uncertainty_score":0.16989195},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011341928,0.01830012,0.90851337,0.00051123684,0.0014956789,0.00003109362,0.00020132941,0.0013713149,0.068441726],"genre_scores_gemma":[0.045056526,0.048852503,0.65837395,0.00075577834,0.0037590722,0.0002634098,0.0012650642,0.0015690004,0.24010466],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995739,0.00007722883,0.000027350392,0.00006778913,0.00023349197,0.000020164953],"domain_scores_gemma":[0.9994629,0.00026447503,0.000023682473,0.00011667342,0.000116511415,0.000015697886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004836584,0.0014388587,0.0014538608,0.0010573212,0.00026420056,0.002034793,0.00073943165,0.00093898026,0.01816091],"category_scores_gemma":[0.0013980903,0.00048315868,0.0005242617,0.0025754855,0.0009420476,0.0014990531,0.00082403683,0.0024976472,0.015393574],"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.00006486176,0.00005376905,0.000118766286,0.0008359368,0.00007125478,0.00015622897,0.00015478348,0.016227735,0.010733555,0.29466078,0.09034677,0.5865755],"study_design_scores_gemma":[0.00003715068,0.000120741504,0.0007142018,0.00028957438,0.000060700077,0.000879274,0.000040555657,0.1224768,0.0104943495,0.43738195,0.42741767,0.00008706858],"about_ca_topic_score_codex":0.0004361982,"about_ca_topic_score_gemma":0.000694561,"teacher_disagreement_score":0.01816091,"about_ca_system_score_codex":0.00032482768,"about_ca_system_score_gemma":0.000586703,"threshold_uncertainty_score":0.0607543},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032803882,0.00045894997,0.9659177,0.00006487907,0.00004574138,0.00002760673,0.000036305217,0.00031561285,0.00032934206],"genre_scores_gemma":[0.4023829,0.0007139213,0.59526855,0.00004704306,0.0000827843,0.00011367384,0.00025987526,0.00010114025,0.00103006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922395,0.0003373995,0.00007220636,0.00012968236,0.00018698495,0.000049775117],"domain_scores_gemma":[0.99824524,0.0010853868,0.00016577588,0.00018224744,0.00027410785,0.00004729851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020600017,0.0005678551,0.0006702221,0.0007439545,0.00025384157,0.0006669143,0.0003978454,0.00077184907,0.00097476103],"category_scores_gemma":[0.0063205548,0.00028641956,0.00080032833,0.000689559,0.00045003582,0.0008699417,0.0006452977,0.00076783914,0.00040927186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078252784,0.00016715321,0.0035325205,0.00029611282,0.00014094046,0.000313638,0.00022928705,0.1614088,0.124759994,0.013484755,0.0011948128,0.6936894],"study_design_scores_gemma":[0.00001337718,0.00016556046,0.0025209615,0.00002323937,0.00002217713,0.00023355451,0.00002403311,0.97259057,0.018826209,0.0038699775,0.0016836954,0.000026605525],"about_ca_topic_score_codex":0.0007469324,"about_ca_topic_score_gemma":0.00064104726,"teacher_disagreement_score":0.0020600017,"about_ca_system_score_codex":0.00020040137,"about_ca_system_score_gemma":0.00043017635,"threshold_uncertainty_score":0.010894418},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007783792,0.018480627,0.6555046,0.0008304735,0.0028661897,0.000087988556,0.00065827934,0.0036669248,0.31712657],"genre_scores_gemma":[0.008868923,0.017169734,0.15326355,0.0006063781,0.0014186765,0.00014643223,0.0018537099,0.001211086,0.81546146],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999603,0.000040318024,0.0000149460075,0.00009111439,0.00023416644,0.00001654549],"domain_scores_gemma":[0.99960524,0.000108312764,0.000014378116,0.000078250894,0.00017630107,0.000017392611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031380338,0.0017511367,0.00079660123,0.0016370487,0.0005423842,0.0020165462,0.000947513,0.0012019594,0.07820443],"category_scores_gemma":[0.001084087,0.00049704715,0.0005182449,0.0021431586,0.000615278,0.0016738271,0.0012938977,0.0018220561,0.10260767],"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.000022457945,0.000028355682,0.0000523062,0.0002525618,0.000024877416,0.00005248954,0.00005560409,0.0016897052,0.0053756186,0.032273486,0.19203267,0.76813984],"study_design_scores_gemma":[0.0000060420825,0.000030506006,0.00039728245,0.00015798991,0.000026710984,0.00043306724,0.000042300195,0.009220859,0.00684979,0.03774995,0.94504714,0.000038500555],"about_ca_topic_score_codex":0.00069015723,"about_ca_topic_score_gemma":0.0014358781,"teacher_disagreement_score":0.07820443,"about_ca_system_score_codex":0.00039296222,"about_ca_system_score_gemma":0.0005283049,"threshold_uncertainty_score":0.26161987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007670753,0.00009530168,0.9986847,0.00004308515,0.00004370713,0.0000100532625,0.000023496004,0.00023064822,0.00010203007],"genre_scores_gemma":[0.016758444,0.00020155606,0.9812573,0.00009445139,0.0000724195,0.00007066975,0.00021244511,0.00014198128,0.0011908053],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998175,0.00035655926,0.00014527277,0.00035346393,0.00088042556,0.00008927193],"domain_scores_gemma":[0.997488,0.0008387942,0.00014366208,0.00036250876,0.0010801308,0.00008684633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017020134,0.0013324922,0.0013710213,0.0012320094,0.0006264983,0.0010159328,0.0014539452,0.001466233,0.0029098752],"category_scores_gemma":[0.0067429203,0.00084877445,0.0015291936,0.0016982316,0.0006387125,0.0021722245,0.002012311,0.0020182414,0.0019394995],"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.00032541333,0.00019048469,0.0007902724,0.00029642633,0.0002885522,0.00010982798,0.00013256594,0.057603315,0.1170007,0.016555943,0.007244063,0.7994625],"study_design_scores_gemma":[0.00007117658,0.00014806939,0.0010699101,0.000031428022,0.00011615474,0.000456764,0.000024400448,0.9357968,0.043877717,0.00664802,0.01167435,0.00008512321],"about_ca_topic_score_codex":0.004254611,"about_ca_topic_score_gemma":0.0066746483,"teacher_disagreement_score":0.004254611,"about_ca_system_score_codex":0.00046565695,"about_ca_system_score_gemma":0.0017991902,"threshold_uncertainty_score":0.009734452},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003568195,0.00017516025,0.99541736,0.00013385467,0.000029468929,0.000023731827,0.000062262865,0.00023356649,0.00035637725],"genre_scores_gemma":[0.22037634,0.0010687717,0.76180834,0.00023690783,0.00034521768,0.00045699664,0.0012375979,0.00075894356,0.013710841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709177,0.001117649,0.00023963323,0.00073048606,0.00056928303,0.0002512106],"domain_scores_gemma":[0.98855036,0.007879865,0.0005299688,0.0011557515,0.0015751931,0.00030885963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013539618,0.0016374228,0.0026502034,0.0013469915,0.00093258,0.0025949194,0.002832869,0.0023241076,0.0065588444],"category_scores_gemma":[0.029530276,0.0014552119,0.0019590382,0.0013421554,0.0014246561,0.0046006497,0.0040693088,0.00411111,0.0026513566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001101672,0.00017478323,0.0040259343,0.00038497202,0.00035799303,0.00023289332,0.00031823578,0.5317732,0.005558749,0.0957327,0.0075381454,0.35280067],"study_design_scores_gemma":[0.000023473976,0.000046169538,0.00046195727,0.00002796905,0.00003727381,0.00009001447,0.000018583314,0.97437626,0.0023886997,0.02134602,0.0011610265,0.000022605855],"about_ca_topic_score_codex":0.0027623484,"about_ca_topic_score_gemma":0.0020078525,"teacher_disagreement_score":0.013539618,"about_ca_system_score_codex":0.0012354755,"about_ca_system_score_gemma":0.0032255105,"threshold_uncertainty_score":0.071605146},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020538496,0.00017279576,0.99646384,0.00013115292,0.000033316544,0.000014598862,0.00008121869,0.00045184605,0.00059742393],"genre_scores_gemma":[0.09858043,0.00061901496,0.8911076,0.00027742182,0.00017516625,0.00019984477,0.0010852863,0.00032880701,0.0076263864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936,0.00026312,0.000042966356,0.00009170745,0.00017904869,0.00006309919],"domain_scores_gemma":[0.9969097,0.0022908973,0.00015106425,0.0002196706,0.00034253916,0.000086169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018027433,0.0008444545,0.0011452994,0.00078217324,0.0003601448,0.0009895916,0.0017136845,0.0011728174,0.006024789],"category_scores_gemma":[0.007300935,0.0005073558,0.00079133955,0.001439886,0.00042023437,0.0011907525,0.00119682,0.0021190583,0.0019926887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015241535,0.00007345148,0.0007525916,0.00010857124,0.000108955435,0.00011223708,0.00004741132,0.63191503,0.0013059411,0.040942837,0.007975376,0.31650525],"study_design_scores_gemma":[0.000013691841,0.000010277831,0.00008238469,0.000007922878,0.000007557986,0.000021626412,0.00000459554,0.9890984,0.00021616298,0.009429459,0.0011028312,0.0000051526094],"about_ca_topic_score_codex":0.007672897,"about_ca_topic_score_gemma":0.008787436,"teacher_disagreement_score":0.007672897,"about_ca_system_score_codex":0.0007590826,"about_ca_system_score_gemma":0.0019320098,"threshold_uncertainty_score":0.020154893},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014733472,0.0055897958,0.94670874,0.0025502925,0.00030079795,0.00008927571,0.000093958035,0.00013110321,0.029802464],"genre_scores_gemma":[0.43603143,0.0116650835,0.5184166,0.0014805858,0.0013792013,0.0004457467,0.0005634051,0.00032828923,0.02968962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9961118,0.0012721526,0.00027819473,0.0006799469,0.001383877,0.00027398832],"domain_scores_gemma":[0.9808427,0.014080175,0.00094890746,0.0008886041,0.002796609,0.00044302005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058006756,0.0010960365,0.0010796773,0.0023892566,0.0012443643,0.0046295575,0.0021289669,0.0029941767,0.0071939034],"category_scores_gemma":[0.027889093,0.0004265603,0.0010890757,0.0029080124,0.0026021788,0.0053057238,0.0028953818,0.003036091,0.0012875801],"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.00011225558,0.00010234106,0.0020563789,0.0003343205,0.000075045165,0.00007465428,0.00021199149,0.09612371,0.00077329844,0.7476616,0.004253584,0.14822084],"study_design_scores_gemma":[0.000025231853,0.000115685834,0.0007305053,0.00009273358,0.000023792933,0.00017105152,0.000086017324,0.79717076,0.0007609256,0.19306827,0.0077288854,0.000026105618],"about_ca_topic_score_codex":0.0022739181,"about_ca_topic_score_gemma":0.0013709075,"teacher_disagreement_score":0.0071939034,"about_ca_system_score_codex":0.002432723,"about_ca_system_score_gemma":0.0017860213,"threshold_uncertainty_score":0.030677319},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011944257,0.00030422374,0.98634106,0.0002033882,0.000043722594,0.000019762576,0.000071375005,0.00018660034,0.0008856321],"genre_scores_gemma":[0.2771485,0.0014515151,0.71608573,0.00025110578,0.00024053988,0.00015351266,0.0008388055,0.00013937248,0.0036908996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903786,0.00030904284,0.000057370784,0.000097272925,0.00042606157,0.00007236111],"domain_scores_gemma":[0.99727964,0.001623414,0.00020748885,0.00030560757,0.00052675745,0.000057070483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001587064,0.00070354895,0.0007415712,0.001303155,0.00040607224,0.0007607192,0.0006690823,0.0009122012,0.0009659344],"category_scores_gemma":[0.008516725,0.00037398937,0.0005290207,0.0022903734,0.0009688852,0.0015042215,0.0014841569,0.00090796046,0.00056286785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060613564,0.00008783603,0.0012430273,0.00041172517,0.00010000577,0.00038985093,0.00051334983,0.30837476,0.07386472,0.07020279,0.0043690866,0.5398366],"study_design_scores_gemma":[0.000026126616,0.000057274705,0.0005503032,0.00004271511,0.00002423351,0.0001879714,0.0000684147,0.9454538,0.018450508,0.031396694,0.0037152185,0.000026825739],"about_ca_topic_score_codex":0.0020749883,"about_ca_topic_score_gemma":0.0026650412,"teacher_disagreement_score":0.0020749883,"about_ca_system_score_codex":0.00039056738,"about_ca_system_score_gemma":0.0008036171,"threshold_uncertainty_score":0.008393288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012755106,0.07634861,0.8276491,0.0023536626,0.0016426669,0.00014779449,0.0006345602,0.0029374133,0.08701062],"genre_scores_gemma":[0.030989882,0.07298867,0.73572636,0.0012583161,0.002512861,0.00076710497,0.0019884405,0.0012290623,0.1525392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925643,0.00019182544,0.000051665913,0.00013998893,0.00033304509,0.000026986028],"domain_scores_gemma":[0.9989924,0.0005548589,0.00004838012,0.00016170845,0.00021661012,0.000026043574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009489318,0.0017500509,0.0009631724,0.0016464823,0.0003331333,0.0022432469,0.0015165154,0.0019384385,0.032450028],"category_scores_gemma":[0.0026325728,0.0004290667,0.000721016,0.0032533973,0.0008733631,0.0021068908,0.0011985239,0.0019219641,0.022403311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031650852,0.000035035704,0.00016100799,0.0010681578,0.00006928256,0.000103776074,0.00013235028,0.0048913364,0.002224373,0.08814295,0.0952046,0.80793554],"study_design_scores_gemma":[0.00001945823,0.0000754895,0.0009838024,0.00077862915,0.000051998784,0.00059702335,0.000108894645,0.040480953,0.0032375662,0.2335303,0.7200574,0.00007841294],"about_ca_topic_score_codex":0.00087864336,"about_ca_topic_score_gemma":0.0010647583,"teacher_disagreement_score":0.032450028,"about_ca_system_score_codex":0.00070286734,"about_ca_system_score_gemma":0.00081611186,"threshold_uncertainty_score":0.10855615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004873986,0.00039951815,0.9934776,0.00007710301,0.00003086973,0.000012011902,0.000016929711,0.00012233833,0.0009896546],"genre_scores_gemma":[0.18850166,0.0021851214,0.80100894,0.000101742924,0.00020174112,0.00007758262,0.00015591992,0.00008631187,0.007680893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997483,0.00006744368,0.0000115704515,0.000051405917,0.000106001055,0.000015356245],"domain_scores_gemma":[0.99943036,0.0002672946,0.000038699836,0.00006419715,0.00017568721,0.000023648616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004174051,0.00049602764,0.00055490393,0.00058275723,0.00021933453,0.00051708636,0.0003125044,0.0007078585,0.0014250843],"category_scores_gemma":[0.0016162081,0.00023421108,0.0004953343,0.0009994408,0.0006076576,0.00045191482,0.00061991985,0.00067665486,0.0005445762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002773113,0.00011617381,0.00053932745,0.00034092195,0.00007600301,0.00035212445,0.00024450288,0.2480125,0.14329605,0.0926642,0.004105756,0.5099751],"study_design_scores_gemma":[0.000010524052,0.000056075984,0.00033388246,0.000011036645,0.0000123993,0.00023824234,0.000016122982,0.9624101,0.017054204,0.01658245,0.0032601827,0.0000148121935],"about_ca_topic_score_codex":0.00084610766,"about_ca_topic_score_gemma":0.00094506424,"teacher_disagreement_score":0.0014250843,"about_ca_system_score_codex":0.0002243554,"about_ca_system_score_gemma":0.00038975486,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003221083,0.00008708585,0.9960877,0.000044262535,0.000008139957,0.000013051303,0.000025908304,0.00013238065,0.0003804294],"genre_scores_gemma":[0.27319187,0.0015704591,0.71949023,0.00013025735,0.00022450995,0.00021486357,0.000581433,0.00042267668,0.0041736807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922633,0.00018007697,0.000035944537,0.00019548717,0.00030361296,0.000058441525],"domain_scores_gemma":[0.9984425,0.00086318783,0.00016518017,0.00020278251,0.0002845632,0.000041776755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009977373,0.00063649414,0.000799978,0.0024814738,0.00034674347,0.0015648184,0.0011371739,0.00072339975,0.001032469],"category_scores_gemma":[0.0040440867,0.00041313528,0.0011033225,0.0015894021,0.0011857366,0.0026982632,0.00082225003,0.0011565649,0.0005962731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010685067,0.00009821359,0.0017958896,0.00021868097,0.00012629817,0.00019970718,0.00027113,0.39087692,0.041947614,0.27369598,0.0027706076,0.2878921],"study_design_scores_gemma":[0.0000024160731,0.000015883703,0.00030596193,0.000008525334,0.000010043613,0.000048279137,0.000018770095,0.9601949,0.0038537746,0.03445078,0.0010783335,0.000012367127],"about_ca_topic_score_codex":0.0022522062,"about_ca_topic_score_gemma":0.0012242963,"teacher_disagreement_score":0.0024814738,"about_ca_system_score_codex":0.00097633974,"about_ca_system_score_gemma":0.0008087053,"threshold_uncertainty_score":0.007083893},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049308002,0.00047468994,0.9466776,0.00010239539,0.00012374231,0.000049404796,0.000120942255,0.0012850751,0.0018580803],"genre_scores_gemma":[0.21591298,0.0005184193,0.7797489,0.00013436166,0.00007657339,0.000070320784,0.00036852172,0.000055633205,0.003114217],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995407,0.000078936275,0.000039201066,0.00010844592,0.00019393161,0.000038730104],"domain_scores_gemma":[0.99926656,0.00027605263,0.00010214211,0.000121129255,0.00020091052,0.000033231034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005180928,0.0005337564,0.00052269094,0.00045070273,0.0001728281,0.0004950905,0.00058821,0.0006159724,0.002287247],"category_scores_gemma":[0.001655219,0.00022219804,0.00038061934,0.0004382799,0.0002657464,0.00074963004,0.000615954,0.00038645926,0.0014253232],"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.00053958315,0.000061119084,0.00053212553,0.00015544322,0.000055758243,0.00012823631,0.000050045328,0.0067167133,0.6547661,0.002738223,0.0011135103,0.33314317],"study_design_scores_gemma":[0.000086571024,0.0005402537,0.0031319102,0.000029333152,0.00009922737,0.0018376624,0.00003292368,0.22190686,0.7614903,0.0030256435,0.0077447686,0.000074515876],"about_ca_topic_score_codex":0.00032528696,"about_ca_topic_score_gemma":0.00058585056,"teacher_disagreement_score":0.002287247,"about_ca_system_score_codex":0.00013693224,"about_ca_system_score_gemma":0.00036364363,"threshold_uncertainty_score":0.0076515675},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011238662,0.00016306672,0.99503773,0.00009664435,0.00006649513,0.00009996286,0.00026869346,0.0017249936,0.0014184606],"genre_scores_gemma":[0.02217518,0.0002970038,0.9706796,0.000083118975,0.000120718934,0.0007409328,0.0006015933,0.00058824057,0.004713612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990343,0.00037183383,0.00005495041,0.00025610274,0.00021705555,0.0000658446],"domain_scores_gemma":[0.9992601,0.00026072885,0.00003503192,0.00017035438,0.00024308024,0.000030634106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018163985,0.0015553989,0.0011567285,0.0026125396,0.00073400396,0.001616032,0.0014812625,0.0012681953,0.010508936],"category_scores_gemma":[0.0034357912,0.0005300314,0.002260644,0.0025207035,0.00055996544,0.0008984849,0.001518558,0.0019964287,0.005562477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025315362,0.00019079156,0.0008764543,0.00064810406,0.00083754765,0.00042666477,0.0002773627,0.04451369,0.06942204,0.043682974,0.026530115,0.81234103],"study_design_scores_gemma":[0.00011019143,0.00047524838,0.0052782693,0.00008991702,0.00041360583,0.0019707414,0.00017698544,0.7417077,0.035842292,0.11763399,0.096107244,0.00019378192],"about_ca_topic_score_codex":0.0022089647,"about_ca_topic_score_gemma":0.0043726023,"teacher_disagreement_score":0.010508936,"about_ca_system_score_codex":0.0004190477,"about_ca_system_score_gemma":0.0014108677,"threshold_uncertainty_score":0.035155833},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013652197,0.003979755,0.037190083,0.0025218201,0.008304726,0.00041637107,0.016009444,0.007429313,0.92278326],"genre_scores_gemma":[0.0036626863,0.0024640197,0.006788577,0.0005755212,0.0016649351,0.00017392442,0.0084198015,0.0013038176,0.9749469],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994,0.00007801824,0.000035604196,0.00011526983,0.00032752685,0.00004355732],"domain_scores_gemma":[0.9980965,0.00045514468,0.00008180136,0.00029328608,0.00078181794,0.00029136054],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004889901,0.001603983,0.0014362623,0.0036289298,0.0012471083,0.0042967414,0.001453939,0.0014600619,0.68912],"category_scores_gemma":[0.004182955,0.00034584058,0.00045152276,0.0044955127,0.0005879323,0.003271623,0.0017375762,0.0012913131,0.67460096],"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.000036975114,0.000048248745,0.00010004382,0.0002535393,0.000007594832,0.000025509895,0.00001894874,0.00036462513,0.00090672355,0.006233015,0.7842817,0.2077231],"study_design_scores_gemma":[0.000013442907,0.000023687116,0.00025860572,0.00015586827,0.000010942971,0.00006129053,0.000024485335,0.001811807,0.0009103265,0.008803028,0.9879127,0.000013768115],"about_ca_topic_score_codex":0.0023610732,"about_ca_topic_score_gemma":0.0036898295,"teacher_disagreement_score":0.31088,"about_ca_system_score_codex":0.0010383471,"about_ca_system_score_gemma":0.001157354,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003221083,0.00008708585,0.9960877,0.000044262535,0.000008139957,0.000013051303,0.000025908304,0.00013238065,0.0003804294],"genre_scores_gemma":[0.27319187,0.0015704591,0.71949023,0.00013025735,0.00022450995,0.00021486357,0.000581433,0.00042267668,0.0041736807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922633,0.00018007697,0.000035944537,0.00019548717,0.00030361296,0.000058441525],"domain_scores_gemma":[0.9984425,0.00086318783,0.00016518017,0.00020278251,0.0002845632,0.000041776755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009977373,0.00063649414,0.000799978,0.0024814738,0.00034674347,0.0015648184,0.0011371739,0.00072339975,0.001032469],"category_scores_gemma":[0.0040440867,0.00041313528,0.0011033225,0.0015894021,0.0011857366,0.0026982632,0.00082225003,0.0011565649,0.0005962731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010685067,0.00009821359,0.0017958896,0.00021868097,0.00012629817,0.00019970718,0.00027113,0.39087692,0.041947614,0.27369598,0.0027706076,0.2878921],"study_design_scores_gemma":[0.0000024160731,0.000015883703,0.00030596193,0.000008525334,0.000010043613,0.000048279137,0.000018770095,0.9601949,0.0038537746,0.03445078,0.0010783335,0.000012367127],"about_ca_topic_score_codex":0.0022522062,"about_ca_topic_score_gemma":0.0012242963,"teacher_disagreement_score":0.0024814738,"about_ca_system_score_codex":0.00097633974,"about_ca_system_score_gemma":0.0008087053,"threshold_uncertainty_score":0.007083893},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011792128,0.00006175478,0.99828374,0.000033863747,0.000020036056,0.000011502096,0.000005123072,0.000055830926,0.00034896127],"genre_scores_gemma":[0.06339435,0.0002165506,0.9327603,0.000087043016,0.00006245841,0.00017385285,0.0000767673,0.00010013317,0.0031285905],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962413,0.0001402642,0.000019761177,0.00006645164,0.0001282872,0.000021036027],"domain_scores_gemma":[0.99968505,0.000120062214,0.000023652,0.000023978848,0.00012202225,0.000025267605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007957742,0.00084471365,0.00068827276,0.00043805919,0.00030923064,0.0004601802,0.0010351539,0.00085403305,0.0019102324],"category_scores_gemma":[0.0011809737,0.00039777238,0.00062678475,0.0005114487,0.0005470114,0.00082807365,0.0008370911,0.0013884003,0.0007045352],"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.00023990282,0.00013805288,0.0008325591,0.0005926213,0.00015853146,0.00017986234,0.0002147966,0.4203348,0.03646588,0.059808794,0.007296193,0.473738],"study_design_scores_gemma":[0.000017759627,0.00006440573,0.00006254174,0.000005962458,0.000008558063,0.000052193525,0.000006187306,0.99329513,0.0018190638,0.0028010947,0.001856399,0.000010604931],"about_ca_topic_score_codex":0.0015890473,"about_ca_topic_score_gemma":0.0015736925,"teacher_disagreement_score":0.0019102324,"about_ca_system_score_codex":0.00025850403,"about_ca_system_score_gemma":0.0010598833,"threshold_uncertainty_score":0.006390393},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075025423,0.0001378562,0.9913223,0.00005797393,0.00002152766,0.00002166026,0.000031984873,0.00052880135,0.000375332],"genre_scores_gemma":[0.1633268,0.0006353574,0.83110046,0.00011060838,0.000040372237,0.00011817241,0.00029070533,0.00009999909,0.00427753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958247,0.00010168195,0.000023574836,0.00009182537,0.00017322434,0.000027129789],"domain_scores_gemma":[0.99953604,0.00021725756,0.00004361047,0.000051637453,0.00013824449,0.000013259155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006969928,0.00073717,0.0006386008,0.0006399802,0.00025066404,0.0005387484,0.00048199922,0.00075662497,0.0018125509],"category_scores_gemma":[0.0017940131,0.0003132662,0.0006151162,0.00059682375,0.00028673376,0.00095934194,0.0005385325,0.0006472329,0.0009858749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057181565,0.00011638852,0.0019396708,0.00031338082,0.00012682358,0.0003267241,0.00014669678,0.09834543,0.12445457,0.004744672,0.002071696,0.7668421],"study_design_scores_gemma":[0.000041472347,0.0001828276,0.0015004183,0.000027357697,0.000053437238,0.00067427265,0.000025834941,0.911102,0.080105826,0.002661066,0.003584773,0.00004070528],"about_ca_topic_score_codex":0.0012442832,"about_ca_topic_score_gemma":0.0013446196,"teacher_disagreement_score":0.0018125509,"about_ca_system_score_codex":0.00024261238,"about_ca_system_score_gemma":0.0007292354,"threshold_uncertainty_score":0.0060635805},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002473122,0.0007902391,0.9954117,0.00009587763,0.000041285715,0.000031495685,0.00004004,0.000118962125,0.0009973666],"genre_scores_gemma":[0.104663014,0.004122778,0.8847904,0.00015480525,0.00026024337,0.00024324063,0.00039218116,0.00019393576,0.005179401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869907,0.00036269356,0.00011129121,0.00030806364,0.00046928512,0.00004955596],"domain_scores_gemma":[0.99495065,0.0030641225,0.00047658346,0.0005913335,0.0008466985,0.00007064674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031937973,0.0009025554,0.0006840931,0.0017288852,0.00033532263,0.0013923363,0.00085724454,0.0009015511,0.0032048603],"category_scores_gemma":[0.0106466375,0.00033135316,0.00080636557,0.0019472593,0.0010200795,0.0015493347,0.00087396416,0.0016361543,0.0010871378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012857428,0.00012203111,0.0024106381,0.0009400567,0.00015158151,0.00025219037,0.00029718407,0.0683466,0.04357026,0.12832157,0.0034315116,0.75202787],"study_design_scores_gemma":[0.00002418536,0.00019212856,0.006304251,0.00023214036,0.00007406503,0.00066368066,0.00019931221,0.8545199,0.021901099,0.07822785,0.03758012,0.000081271166],"about_ca_topic_score_codex":0.0006218167,"about_ca_topic_score_gemma":0.00074914336,"teacher_disagreement_score":0.0032048603,"about_ca_system_score_codex":0.0004060202,"about_ca_system_score_gemma":0.0007892573,"threshold_uncertainty_score":0.016890585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16424999,0.0014063577,0.83153,0.00013358695,0.00008728305,0.00009124159,0.00025499566,0.0013162096,0.0009303828],"genre_scores_gemma":[0.76906276,0.0009102924,0.22713642,0.00005766355,0.000064959255,0.000073160714,0.00069100084,0.000091326525,0.0019124177],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995735,0.00014093031,0.00004026773,0.00007086448,0.00013705887,0.000037424776],"domain_scores_gemma":[0.9988907,0.00068444264,0.000110535366,0.00007890954,0.00019208578,0.00004341414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008595884,0.00061844545,0.00036855135,0.0014843533,0.00021463915,0.0005937461,0.0003210032,0.0005910937,0.0008054295],"category_scores_gemma":[0.0030358299,0.00014211929,0.0003979112,0.0006787546,0.0002935922,0.0006017081,0.00044385076,0.0004547531,0.0007556097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014528302,0.00030023322,0.0070294053,0.0003081452,0.00017138974,0.0004332752,0.00021581413,0.08571687,0.12579438,0.0014095777,0.0017256562,0.7754424],"study_design_scores_gemma":[0.00006940362,0.0004982794,0.02537022,0.000046893354,0.00009617524,0.00087659253,0.00014870903,0.86529225,0.09985548,0.005020699,0.002650152,0.000075184544],"about_ca_topic_score_codex":0.0011284314,"about_ca_topic_score_gemma":0.0011688765,"teacher_disagreement_score":0.0014843533,"about_ca_system_score_codex":0.00012242848,"about_ca_system_score_gemma":0.0003638687,"threshold_uncertainty_score":0.0045459867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029066124,0.0002523303,0.9944929,0.000079841324,0.000039206643,0.00002292581,0.000107621294,0.000556128,0.0015425269],"genre_scores_gemma":[0.6051441,0.0012678091,0.37908342,0.00028752754,0.00021190057,0.00032922404,0.0013027784,0.00031563005,0.012057716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992016,0.00013329643,0.00005428027,0.00022487478,0.00030427615,0.00008172723],"domain_scores_gemma":[0.9987651,0.00057347846,0.00020161123,0.0001818169,0.00023742767,0.00004065466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066175545,0.0012138578,0.0011139733,0.000809475,0.0005470156,0.0012855595,0.000900173,0.0008467791,0.004995551],"category_scores_gemma":[0.003571968,0.00052348967,0.00089283806,0.00093084224,0.00057077926,0.0012171111,0.0012167443,0.0020027251,0.0018950225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020166447,0.000083769904,0.0016407046,0.00039563442,0.0000940957,0.000362114,0.00020271863,0.68852866,0.014735008,0.037090298,0.003418242,0.25324708],"study_design_scores_gemma":[0.0000064560536,0.000027404583,0.0003047641,0.0000130395965,0.000009036417,0.00006778962,0.000015762542,0.9845383,0.002671807,0.010105394,0.002224632,0.000015541744],"about_ca_topic_score_codex":0.0058175432,"about_ca_topic_score_gemma":0.00563813,"teacher_disagreement_score":0.0058175432,"about_ca_system_score_codex":0.00080045004,"about_ca_system_score_gemma":0.0014851941,"threshold_uncertainty_score":0.016711771},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004588844,0.003366907,0.010840424,0.0020438323,0.0038769234,0.00015038931,0.0017800077,0.0011335878,0.976349],"genre_scores_gemma":[0.0012180827,0.0018765379,0.0022962457,0.0007258948,0.0004925525,0.00007063855,0.0012415802,0.00022158946,0.9918568],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999539,0.000038875543,0.0000146845705,0.000091544556,0.00026671862,0.000049324197],"domain_scores_gemma":[0.99943286,0.00007669671,0.000019462628,0.00008371711,0.00028831395,0.00009893454],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00046170046,0.0008901648,0.0005336387,0.0015292561,0.001051411,0.0029102971,0.0014762931,0.0013932124,0.49080837],"category_scores_gemma":[0.0017076293,0.00029890906,0.00040316206,0.0013077037,0.00047263768,0.0024698502,0.0017638148,0.0014171023,0.41273817],"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.000023982042,0.000040112067,0.00009007519,0.0001771364,0.0000024535723,0.000055545508,0.00011866523,0.00021454347,0.0007727109,0.04335832,0.7069586,0.2481879],"study_design_scores_gemma":[0.0000014060787,0.000006172532,0.000050079325,0.000048608585,8.8029856e-7,0.00003672484,0.000022259494,0.000034758774,0.00012742005,0.0036822057,0.99598736,0.000002222656],"about_ca_topic_score_codex":0.0015255212,"about_ca_topic_score_gemma":0.0025582255,"teacher_disagreement_score":0.50919163,"about_ca_system_score_codex":0.00091823866,"about_ca_system_score_gemma":0.001470838,"threshold_uncertainty_score":0.72630006},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017510129,0.0035683224,0.9838681,0.0002755552,0.0003743125,0.000086416796,0.00029905958,0.002274491,0.007502729],"genre_scores_gemma":[0.047735274,0.008097831,0.920605,0.0004263712,0.00085684244,0.0004982261,0.0018022959,0.00047525743,0.019502947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991178,0.00014393839,0.000045036162,0.00018005552,0.0004490932,0.000064024556],"domain_scores_gemma":[0.9992512,0.00023790187,0.000062121515,0.00014413633,0.00027882252,0.000025684752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009789319,0.0010366732,0.0010831439,0.0017054481,0.0006120235,0.0013943186,0.00085619505,0.0014064146,0.011570146],"category_scores_gemma":[0.002477219,0.00042532105,0.0010232482,0.0024261684,0.0006885257,0.0012449299,0.00060851825,0.0019632585,0.0088893045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001582792,0.00007701173,0.0004306547,0.00039861805,0.00015696856,0.0002297101,0.00009219533,0.017180776,0.06028495,0.04583943,0.030691076,0.84446025],"study_design_scores_gemma":[0.000072660754,0.0002916405,0.0051398263,0.00029613118,0.000199982,0.0019271813,0.00010930695,0.447481,0.10208778,0.09551462,0.34662563,0.0002542275],"about_ca_topic_score_codex":0.0018716895,"about_ca_topic_score_gemma":0.001744565,"teacher_disagreement_score":0.011570146,"about_ca_system_score_codex":0.0006015859,"about_ca_system_score_gemma":0.00071271014,"threshold_uncertainty_score":0.038706005},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04873182,0.00070516794,0.9467321,0.00012078575,0.00011022773,0.00005557864,0.000022169474,0.00031297546,0.0032092102],"genre_scores_gemma":[0.51544744,0.0006543367,0.47527432,0.00016651479,0.00014378998,0.000087334374,0.00008146455,0.00002596597,0.008118771],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994387,0.00010931638,0.000026073154,0.00008654832,0.0002838722,0.000055406563],"domain_scores_gemma":[0.9996106,0.0001375932,0.000039343176,0.00007206882,0.00012449479,0.000015871436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030998542,0.00048126213,0.0004901867,0.0003815981,0.00017151331,0.00048674256,0.0005154622,0.0005257567,0.0010239215],"category_scores_gemma":[0.0010054216,0.00023340165,0.000260493,0.00034684004,0.00036014908,0.0009405343,0.0006747877,0.0005093492,0.000543451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004723501,0.00017947565,0.0015572674,0.00034013667,0.00015272599,0.00058737845,0.00017459114,0.04518378,0.4803442,0.030704373,0.0012688561,0.43903497],"study_design_scores_gemma":[0.00016368384,0.0020176005,0.0016322674,0.00007291424,0.0001965816,0.0034365328,0.000053637195,0.590369,0.3633189,0.012215981,0.02641424,0.00010878217],"about_ca_topic_score_codex":0.00013336696,"about_ca_topic_score_gemma":0.00035726343,"teacher_disagreement_score":0.0010239215,"about_ca_system_score_codex":0.0002584119,"about_ca_system_score_gemma":0.00027583528,"threshold_uncertainty_score":0.0034253597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014733472,0.0055897958,0.94670874,0.0025502925,0.00030079795,0.00008927571,0.000093958035,0.00013110321,0.029802464],"genre_scores_gemma":[0.43603143,0.0116650835,0.5184166,0.0014805858,0.0013792013,0.0004457467,0.0005634051,0.00032828923,0.02968962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9961118,0.0012721526,0.00027819473,0.0006799469,0.001383877,0.00027398832],"domain_scores_gemma":[0.9808427,0.014080175,0.00094890746,0.0008886041,0.002796609,0.00044302005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058006756,0.0010960365,0.0010796773,0.0023892566,0.0012443643,0.0046295575,0.0021289669,0.0029941767,0.0071939034],"category_scores_gemma":[0.027889093,0.0004265603,0.0010890757,0.0029080124,0.0026021788,0.0053057238,0.0028953818,0.003036091,0.0012875801],"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.00011225558,0.00010234106,0.0020563789,0.0003343205,0.000075045165,0.00007465428,0.00021199149,0.09612371,0.00077329844,0.7476616,0.004253584,0.14822084],"study_design_scores_gemma":[0.000025231853,0.000115685834,0.0007305053,0.00009273358,0.000023792933,0.00017105152,0.000086017324,0.79717076,0.0007609256,0.19306827,0.0077288854,0.000026105618],"about_ca_topic_score_codex":0.0022739181,"about_ca_topic_score_gemma":0.0013709075,"teacher_disagreement_score":0.0071939034,"about_ca_system_score_codex":0.002432723,"about_ca_system_score_gemma":0.0017860213,"threshold_uncertainty_score":0.030677319},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009761246,0.00019714677,0.99801624,0.000041838965,0.000015670861,0.00001060399,0.000009530799,0.0001408333,0.0005919216],"genre_scores_gemma":[0.14011997,0.0010720893,0.85341626,0.0001304276,0.00015282101,0.0002004397,0.00010615182,0.00011298531,0.0046889167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937785,0.0001481722,0.000025492793,0.00012720846,0.0002904767,0.000030844752],"domain_scores_gemma":[0.99940944,0.0003237083,0.000055927314,0.0001056096,0.00009157766,0.000013782465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005552682,0.0007519607,0.00066321203,0.0008800514,0.00043421204,0.00062934303,0.0006868964,0.0007134862,0.0016123878],"category_scores_gemma":[0.0026246444,0.00031938226,0.0005290353,0.00070241065,0.00071805646,0.0009527834,0.0007894822,0.0013336645,0.0006871458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118021075,0.00007538207,0.00048384804,0.0002456837,0.00009691673,0.00019411715,0.00017525419,0.14500682,0.066505075,0.05772976,0.0021596246,0.7272095],"study_design_scores_gemma":[0.000011995173,0.00009658714,0.0008355314,0.000026013413,0.000027330023,0.0005462354,0.000030136081,0.93635756,0.026233876,0.02369364,0.0120814275,0.000059749163],"about_ca_topic_score_codex":0.0006987137,"about_ca_topic_score_gemma":0.0010738826,"teacher_disagreement_score":0.0016123878,"about_ca_system_score_codex":0.00031570587,"about_ca_system_score_gemma":0.0005927478,"threshold_uncertainty_score":0.005393982},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02050129,0.0021662726,0.9723489,0.00034382107,0.00017938824,0.000039956252,0.0001674067,0.00021433136,0.004038603],"genre_scores_gemma":[0.57134897,0.0070166984,0.39744428,0.00066862814,0.0010342724,0.00015373652,0.001031619,0.00019024358,0.021111524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668676,0.0008503728,0.0001463056,0.0009554509,0.0011028912,0.0002583791],"domain_scores_gemma":[0.9967181,0.0012189569,0.0003362342,0.0008611799,0.0007573376,0.00010815638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013903407,0.0010563994,0.0017706453,0.0007371356,0.00056740304,0.001951749,0.0011416657,0.0017024648,0.002341082],"category_scores_gemma":[0.0054861335,0.00049881823,0.00064159493,0.0009914307,0.0015830826,0.0028322549,0.0026649095,0.0015834845,0.0011128209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008885303,0.0001648612,0.0017911614,0.00084917026,0.00027495672,0.0005123016,0.000438585,0.3394036,0.065297954,0.17285141,0.012057236,0.4054702],"study_design_scores_gemma":[0.000043548436,0.00014195345,0.001303904,0.00005920339,0.00006728576,0.0005595936,0.00011186056,0.8701383,0.028004218,0.08075478,0.018708732,0.000106627005],"about_ca_topic_score_codex":0.0014927179,"about_ca_topic_score_gemma":0.0014678003,"teacher_disagreement_score":0.002341082,"about_ca_system_score_codex":0.00078605383,"about_ca_system_score_gemma":0.0015290872,"threshold_uncertainty_score":0.007831752},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021608444,0.07584341,0.8303513,0.0022206148,0.00097224227,0.0001743337,0.0007745372,0.004169176,0.08333356],"genre_scores_gemma":[0.038899448,0.06621711,0.7944376,0.0010030402,0.0012801996,0.0007878406,0.0020776978,0.0012451458,0.0940519],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993492,0.00017935384,0.00003960401,0.00010995376,0.00029888275,0.000023059609],"domain_scores_gemma":[0.9990707,0.0005457253,0.00004336986,0.00015027718,0.00016651057,0.000023495897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001001284,0.0015706972,0.0009460362,0.0015309389,0.00031514923,0.0022426748,0.0012525741,0.001503794,0.031099042],"category_scores_gemma":[0.0025860697,0.00039245683,0.00073641096,0.0031296008,0.000794473,0.0018758613,0.0011712427,0.0017644789,0.018884877],"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.00003175481,0.000042531556,0.00022611197,0.0009784925,0.0000810862,0.00008146033,0.00012328329,0.0044729738,0.002387977,0.050868392,0.070274,0.8704319],"study_design_scores_gemma":[0.000032293843,0.0001152354,0.0021239945,0.0011137896,0.00009549525,0.0005837502,0.00021952002,0.07259404,0.005008523,0.28333664,0.6346692,0.000107607244],"about_ca_topic_score_codex":0.0010408999,"about_ca_topic_score_gemma":0.0016031434,"teacher_disagreement_score":0.031099042,"about_ca_system_score_codex":0.0006602338,"about_ca_system_score_gemma":0.00089822,"threshold_uncertainty_score":0.10403669},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018270172,0.0003257579,0.9802571,0.000053262564,0.0000485692,0.000050187376,0.000058151676,0.00032793015,0.0006088693],"genre_scores_gemma":[0.19863011,0.0012819659,0.79729575,0.000050980125,0.00010278135,0.00010564295,0.00045355744,0.00007143068,0.0020077326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976164,0.000028968796,0.00001871665,0.000046608206,0.00012581552,0.000018251792],"domain_scores_gemma":[0.9997291,0.000068031266,0.000044794546,0.000029328023,0.000116050454,0.000012695892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025569907,0.0006189163,0.0004524036,0.0014532364,0.00024429872,0.00045212122,0.0003270139,0.00037016525,0.0006406005],"category_scores_gemma":[0.000965089,0.00020771606,0.0005541019,0.0014612685,0.00033017035,0.00078733166,0.00033186912,0.00046910235,0.00040269535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002510986,0.00007589204,0.0011592028,0.0002415935,0.000089086636,0.00030197375,0.000120477554,0.038840316,0.37482473,0.006845009,0.0014025315,0.57584804],"study_design_scores_gemma":[0.000015563402,0.00013135748,0.0040051555,0.00002351158,0.00007537638,0.0004199939,0.000042853004,0.8530959,0.1351101,0.0029331222,0.0041141496,0.000032956304],"about_ca_topic_score_codex":0.0018456954,"about_ca_topic_score_gemma":0.00199844,"teacher_disagreement_score":0.0018456954,"about_ca_system_score_codex":0.00023227677,"about_ca_system_score_gemma":0.00054079015,"threshold_uncertainty_score":0.0036699772},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016309014,0.000022477308,0.99735296,0.00003088217,0.000012096354,0.000036955335,0.0000103745615,0.00026059034,0.0006428879],"genre_scores_gemma":[0.02213766,0.00003809881,0.9748805,0.00006225498,0.000015083373,0.00012924073,0.000045721317,0.00012313681,0.0025683448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907434,0.00030248106,0.000042478227,0.00012344428,0.000375543,0.000081651626],"domain_scores_gemma":[0.99874437,0.00045668185,0.000075519696,0.00029690043,0.00033566373,0.0000909393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002211498,0.00075964665,0.0009171073,0.00093976577,0.00080046686,0.0011451849,0.003460997,0.001501998,0.0057323985],"category_scores_gemma":[0.004776428,0.00072251714,0.0006266473,0.0014298796,0.00079750584,0.0019522541,0.0024616425,0.0020654995,0.0023699508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038193114,0.00024873647,0.0009990681,0.00017662953,0.00011882379,0.00015521623,0.00027817846,0.3113719,0.026927369,0.15232784,0.0057705673,0.50124377],"study_design_scores_gemma":[0.000044803273,0.000035432236,0.000076311335,0.000006860001,0.000008444248,0.000041796182,0.0000090511,0.98016745,0.0027774028,0.01385088,0.002967875,0.000013745167],"about_ca_topic_score_codex":0.005471088,"about_ca_topic_score_gemma":0.008175501,"teacher_disagreement_score":0.0057323985,"about_ca_system_score_codex":0.0008524132,"about_ca_system_score_gemma":0.002044923,"threshold_uncertainty_score":0.019176722},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02050129,0.0021662726,0.9723489,0.00034382107,0.00017938824,0.000039956252,0.0001674067,0.00021433136,0.004038603],"genre_scores_gemma":[0.57134897,0.0070166984,0.39744428,0.00066862814,0.0010342724,0.00015373652,0.001031619,0.00019024358,0.021111524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668676,0.0008503728,0.0001463056,0.0009554509,0.0011028912,0.0002583791],"domain_scores_gemma":[0.9967181,0.0012189569,0.0003362342,0.0008611799,0.0007573376,0.00010815638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013903407,0.0010563994,0.0017706453,0.0007371356,0.00056740304,0.001951749,0.0011416657,0.0017024648,0.002341082],"category_scores_gemma":[0.0054861335,0.00049881823,0.00064159493,0.0009914307,0.0015830826,0.0028322549,0.0026649095,0.0015834845,0.0011128209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008885303,0.0001648612,0.0017911614,0.00084917026,0.00027495672,0.0005123016,0.000438585,0.3394036,0.065297954,0.17285141,0.012057236,0.4054702],"study_design_scores_gemma":[0.000043548436,0.00014195345,0.001303904,0.00005920339,0.00006728576,0.0005595936,0.00011186056,0.8701383,0.028004218,0.08075478,0.018708732,0.000106627005],"about_ca_topic_score_codex":0.0014927179,"about_ca_topic_score_gemma":0.0014678003,"teacher_disagreement_score":0.002341082,"about_ca_system_score_codex":0.00078605383,"about_ca_system_score_gemma":0.0015290872,"threshold_uncertainty_score":0.007831752},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029066124,0.0002523303,0.9944929,0.000079841324,0.000039206643,0.00002292581,0.000107621294,0.000556128,0.0015425269],"genre_scores_gemma":[0.6051441,0.0012678091,0.37908342,0.00028752754,0.00021190057,0.00032922404,0.0013027784,0.00031563005,0.012057716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992016,0.00013329643,0.00005428027,0.00022487478,0.00030427615,0.00008172723],"domain_scores_gemma":[0.9987651,0.00057347846,0.00020161123,0.0001818169,0.00023742767,0.00004065466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066175545,0.0012138578,0.0011139733,0.000809475,0.0005470156,0.0012855595,0.000900173,0.0008467791,0.004995551],"category_scores_gemma":[0.003571968,0.00052348967,0.00089283806,0.00093084224,0.00057077926,0.0012171111,0.0012167443,0.0020027251,0.0018950225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020166447,0.000083769904,0.0016407046,0.00039563442,0.0000940957,0.000362114,0.00020271863,0.68852866,0.014735008,0.037090298,0.003418242,0.25324708],"study_design_scores_gemma":[0.0000064560536,0.000027404583,0.0003047641,0.0000130395965,0.000009036417,0.00006778962,0.000015762542,0.9845383,0.002671807,0.010105394,0.002224632,0.000015541744],"about_ca_topic_score_codex":0.0058175432,"about_ca_topic_score_gemma":0.00563813,"teacher_disagreement_score":0.0058175432,"about_ca_system_score_codex":0.00080045004,"about_ca_system_score_gemma":0.0014851941,"threshold_uncertainty_score":0.016711771},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10012744,0.00065472524,0.89565605,0.00015909033,0.000025722322,0.000021803744,0.000053455384,0.00014871903,0.0031529733],"genre_scores_gemma":[0.8240211,0.0017396054,0.17068206,0.00006376765,0.00006598589,0.00003758637,0.00017905992,0.00011328269,0.0030976497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99963987,0.00008856705,0.000009906328,0.000029991077,0.00020159276,0.000029986042],"domain_scores_gemma":[0.99811953,0.001257045,0.00018956156,0.00015231699,0.00025094967,0.000030637802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070149754,0.00031441217,0.00024092615,0.00051905145,0.0001413806,0.00041529242,0.0002616946,0.0002970647,0.0015584107],"category_scores_gemma":[0.003428879,0.0001200902,0.00040763256,0.00046024163,0.00046645553,0.00041806576,0.00025890954,0.00033943282,0.00029483341],"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.00068426965,0.000103539336,0.003527302,0.0005012303,0.00017675961,0.00060085,0.00027286538,0.3729792,0.26305977,0.15679254,0.0013780711,0.19992368],"study_design_scores_gemma":[0.0000051271136,0.00005260584,0.0019314957,0.00000922466,0.000025462527,0.00015457324,0.000015587122,0.9644935,0.025111035,0.0072163814,0.00097200094,0.000012923251],"about_ca_topic_score_codex":0.00068953104,"about_ca_topic_score_gemma":0.0011171108,"teacher_disagreement_score":0.0015584107,"about_ca_system_score_codex":0.00023708714,"about_ca_system_score_gemma":0.00029801726,"threshold_uncertainty_score":0.0052134395},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018270172,0.0003257579,0.9802571,0.000053262564,0.0000485692,0.000050187376,0.000058151676,0.00032793015,0.0006088693],"genre_scores_gemma":[0.19863011,0.0012819659,0.79729575,0.000050980125,0.00010278135,0.00010564295,0.00045355744,0.00007143068,0.0020077326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976164,0.000028968796,0.00001871665,0.000046608206,0.00012581552,0.000018251792],"domain_scores_gemma":[0.9997291,0.000068031266,0.000044794546,0.000029328023,0.000116050454,0.000012695892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025569907,0.0006189163,0.0004524036,0.0014532364,0.00024429872,0.00045212122,0.0003270139,0.00037016525,0.0006406005],"category_scores_gemma":[0.000965089,0.00020771606,0.0005541019,0.0014612685,0.00033017035,0.00078733166,0.00033186912,0.00046910235,0.00040269535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002510986,0.00007589204,0.0011592028,0.0002415935,0.000089086636,0.00030197375,0.000120477554,0.038840316,0.37482473,0.006845009,0.0014025315,0.57584804],"study_design_scores_gemma":[0.000015563402,0.00013135748,0.0040051555,0.00002351158,0.00007537638,0.0004199939,0.000042853004,0.8530959,0.1351101,0.0029331222,0.0041141496,0.000032956304],"about_ca_topic_score_codex":0.0018456954,"about_ca_topic_score_gemma":0.00199844,"teacher_disagreement_score":0.0018456954,"about_ca_system_score_codex":0.00023227677,"about_ca_system_score_gemma":0.00054079015,"threshold_uncertainty_score":0.0036699772},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009599166,0.00032290706,0.989005,0.00009930423,0.000035104673,0.00003679352,0.000020704567,0.00035106228,0.00052990904],"genre_scores_gemma":[0.32972524,0.0008222028,0.66714233,0.00008252544,0.00021100376,0.00015728199,0.00020691013,0.000103212005,0.0015493298],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99823344,0.00061189913,0.00013949463,0.000276869,0.00065349403,0.00008472825],"domain_scores_gemma":[0.9973794,0.0012408898,0.000328159,0.00035607535,0.0006510475,0.000044425047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002281546,0.0007928802,0.00072930625,0.0022818,0.00032899238,0.0011909368,0.0006871995,0.0008313575,0.0013369361],"category_scores_gemma":[0.0074123754,0.00023597917,0.0008036956,0.0017176503,0.00071646855,0.0016035073,0.00062291767,0.00095760863,0.00061804266],"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.00015002971,0.00016844405,0.0031637056,0.00022267463,0.00012613999,0.00011161985,0.00012466685,0.110666,0.018627675,0.017157545,0.001943547,0.8475379],"study_design_scores_gemma":[0.000010762855,0.000050589046,0.0020783544,0.000013055923,0.000015696809,0.000096884454,0.000019044506,0.9871954,0.004434116,0.0045376625,0.0015270887,0.00002127711],"about_ca_topic_score_codex":0.00087281194,"about_ca_topic_score_gemma":0.00064008083,"teacher_disagreement_score":0.0022818,"about_ca_system_score_codex":0.00035519118,"about_ca_system_score_gemma":0.00037574366,"threshold_uncertainty_score":0.012066126},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80243796,0.0006735859,0.19334516,0.00072203594,0.000042446143,0.00006169843,0.00029500647,0.00046801742,0.001954147],"genre_scores_gemma":[0.98346937,0.00008258162,0.015218576,0.000049284183,0.000011754212,0.000032689783,0.00025536583,0.000037883296,0.0008424819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995197,0.00019726025,0.000022268247,0.00009842861,0.00010049964,0.00006193694],"domain_scores_gemma":[0.9968346,0.0022117004,0.0002616389,0.00025071506,0.0003374258,0.000103892686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030105694,0.0007097959,0.00048433914,0.0005731308,0.0003703167,0.0005768693,0.0012631232,0.0009042956,0.00090917555],"category_scores_gemma":[0.009559937,0.00042889477,0.0006113184,0.00045227425,0.0009818568,0.0012179747,0.0009138589,0.0013977028,0.00011734064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013144157,0.000091712456,0.0032649592,0.000093743576,0.00009488659,0.000111854926,0.000058629506,0.9669886,0.0031285728,0.0066817175,0.0008233578,0.01853045],"study_design_scores_gemma":[0.000002900415,0.000010340747,0.00033459303,0.0000023113234,0.0000038010587,0.000004015859,0.000003945159,0.9978903,0.00054843986,0.0011487233,0.00004782886,0.0000027548026],"about_ca_topic_score_codex":0.0071635144,"about_ca_topic_score_gemma":0.006668015,"teacher_disagreement_score":0.0071635144,"about_ca_system_score_codex":0.0013889313,"about_ca_system_score_gemma":0.00071067916,"threshold_uncertainty_score":0.015921593},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006910047,0.00014047718,0.991829,0.00012147447,0.00001810894,0.000010844768,0.000021517495,0.000041030824,0.0009075816],"genre_scores_gemma":[0.57234704,0.0014979695,0.4148627,0.00022334319,0.00015494198,0.0002474165,0.00029138447,0.000085069056,0.01029003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991698,0.00031087387,0.000039788214,0.00021028983,0.00019269696,0.000076556986],"domain_scores_gemma":[0.99736696,0.0016927938,0.00043824248,0.00022990695,0.0002217508,0.000050375613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023223702,0.0009768142,0.00086155185,0.0008672229,0.00046239857,0.0009744852,0.0010392566,0.0018690252,0.0019253488],"category_scores_gemma":[0.009115627,0.00071553345,0.0011173871,0.00090670824,0.0018285435,0.0018393392,0.0019788267,0.0018583445,0.00036001316],"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.000073894254,0.000052523752,0.0009929999,0.00017978066,0.00009700294,0.00023717132,0.00027395753,0.5162175,0.0072647035,0.4239646,0.00078377465,0.049862087],"study_design_scores_gemma":[0.000012033389,0.000022873894,0.00028515945,0.00002223599,0.000017082191,0.000068163194,0.000027001042,0.89126796,0.0017075605,0.10532101,0.001225574,0.000023238938],"about_ca_topic_score_codex":0.002373596,"about_ca_topic_score_gemma":0.0013737698,"teacher_disagreement_score":0.002373596,"about_ca_system_score_codex":0.0007217536,"about_ca_system_score_gemma":0.0012858565,"threshold_uncertainty_score":0.0122820735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024739187,0.00014902289,0.99534297,0.00027098416,0.000057842517,0.00009419008,0.0002674802,0.00030207093,0.0010416028],"genre_scores_gemma":[0.20419112,0.0005715396,0.78603137,0.0008866944,0.00037049316,0.0025536653,0.0018475585,0.0008041574,0.0027434533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97965795,0.013130378,0.00095027644,0.0024389776,0.0033018847,0.00052059285],"domain_scores_gemma":[0.8805355,0.09973038,0.00351946,0.010707064,0.004689636,0.0008179724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022647293,0.0014871322,0.0018088914,0.0027977617,0.0013014359,0.002359709,0.0028333676,0.0019419694,0.011688464],"category_scores_gemma":[0.14584383,0.000568668,0.0020821097,0.0026501378,0.0052086567,0.0038663321,0.0036480695,0.005557839,0.0020087566],"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.0005011787,0.0001552483,0.0047944896,0.0007782176,0.00026875891,0.00093722116,0.0005240485,0.06452388,0.0072248485,0.67335105,0.011794225,0.23514684],"study_design_scores_gemma":[0.00007712546,0.00022676672,0.0014375407,0.00011764356,0.00003899425,0.0003081716,0.000106816995,0.30975452,0.0039926553,0.6752727,0.008614058,0.000053029245],"about_ca_topic_score_codex":0.001107318,"about_ca_topic_score_gemma":0.0008286013,"teacher_disagreement_score":0.022647293,"about_ca_system_score_codex":0.001642528,"about_ca_system_score_gemma":0.003181213,"threshold_uncertainty_score":0.11977178},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0700336,0.0027851728,0.92019963,0.000940155,0.00014662454,0.000092664304,0.00028825275,0.0017594233,0.003754426],"genre_scores_gemma":[0.5164517,0.0022270747,0.47276655,0.00045623683,0.00009427261,0.00017247164,0.0009950846,0.00065068953,0.0061859526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884015,0.00052605936,0.00007652604,0.00012596262,0.00034049153,0.00009072139],"domain_scores_gemma":[0.99418133,0.0036915333,0.00027408524,0.0004433047,0.0012279624,0.00018168318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006140344,0.00094252074,0.0008178381,0.000975331,0.00046154583,0.0016021667,0.0014506716,0.0014685567,0.0022432895],"category_scores_gemma":[0.013236554,0.00043238988,0.00087763177,0.00081145525,0.0006831878,0.0025705146,0.001665013,0.0016596785,0.00075635395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016224319,0.00039446048,0.003061754,0.00047578698,0.00043652134,0.000053755008,0.00017766573,0.5605952,0.0065026823,0.018562475,0.004640977,0.40347624],"study_design_scores_gemma":[0.000027722117,0.00006587045,0.0005475266,0.000031640488,0.000024391717,0.000020949694,0.000018885883,0.991076,0.0022276952,0.005343043,0.0005984298,0.00001784931],"about_ca_topic_score_codex":0.0087976055,"about_ca_topic_score_gemma":0.011460831,"teacher_disagreement_score":0.0087976055,"about_ca_system_score_codex":0.0012599895,"about_ca_system_score_gemma":0.003090425,"threshold_uncertainty_score":0.032473564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007906381,0.0006776094,0.97892773,0.00023169059,0.00014297149,0.00006265112,0.00037869535,0.004371522,0.007300797],"genre_scores_gemma":[0.07843906,0.0005901889,0.898356,0.0001669071,0.00013939774,0.00010852518,0.0010411649,0.00072685786,0.020431867],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992623,0.00014147034,0.000023843724,0.00011768111,0.00037317394,0.00008148478],"domain_scores_gemma":[0.9988285,0.0003054919,0.00008308215,0.00031913133,0.00039801656,0.00006574777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005512767,0.0015780944,0.0010481786,0.0015658849,0.0007002912,0.0016044427,0.00078762276,0.0015757604,0.023176411],"category_scores_gemma":[0.0015779126,0.0006085226,0.00071610033,0.0019396242,0.00040551444,0.001627615,0.0019113981,0.0013924649,0.015274205],"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.0012583171,0.000059158843,0.0005294975,0.00030199206,0.000068925205,0.00027133292,0.00011862528,0.008426506,0.22028284,0.009320388,0.022067433,0.73729503],"study_design_scores_gemma":[0.00020708264,0.00027366524,0.004852674,0.00015816068,0.00011651077,0.0023484891,0.00013892651,0.5176203,0.36750132,0.014430507,0.09220475,0.0001475681],"about_ca_topic_score_codex":0.001116963,"about_ca_topic_score_gemma":0.0023982043,"teacher_disagreement_score":0.023176411,"about_ca_system_score_codex":0.0004540438,"about_ca_system_score_gemma":0.0009916283,"threshold_uncertainty_score":0.07753277},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047031543,0.000067054454,0.9944423,0.000044444223,0.000022619479,0.00001544699,0.00003418747,0.00027869182,0.0003921125],"genre_scores_gemma":[0.06705135,0.00010502376,0.93156636,0.000028797733,0.00003086645,0.000058320496,0.0001678147,0.00006573341,0.00092571613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996681,0.00005518406,0.000019398418,0.000045757744,0.00018696731,0.000024578534],"domain_scores_gemma":[0.9995285,0.00014913225,0.000045819954,0.0001064914,0.00013896875,0.000031086347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004955286,0.0006677509,0.0004491388,0.00075832015,0.00042696402,0.0005458525,0.0006994972,0.0006168037,0.001790449],"category_scores_gemma":[0.0016369841,0.00027262882,0.0005721884,0.000757578,0.00051733287,0.0009760365,0.0010088288,0.0009161444,0.0008191383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032212195,0.00011151241,0.0015266153,0.00022821256,0.000084727755,0.00023275227,0.00026458508,0.17514919,0.11017899,0.029272737,0.0042171525,0.67841136],"study_design_scores_gemma":[0.000019277353,0.000058791175,0.00037530143,0.00001375688,0.000009582287,0.0001704539,0.000026786935,0.95791507,0.029260337,0.0076425252,0.0044807727,0.000027343043],"about_ca_topic_score_codex":0.0015951352,"about_ca_topic_score_gemma":0.0031147832,"teacher_disagreement_score":0.001790449,"about_ca_system_score_codex":0.00028998606,"about_ca_system_score_gemma":0.0008989636,"threshold_uncertainty_score":0.005989611},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068291987,0.000050036917,0.99875784,0.00001916417,0.000010977238,0.000013560872,0.000007055646,0.00017703934,0.00028144923],"genre_scores_gemma":[0.085094854,0.00022685862,0.9111379,0.00007172249,0.00005080568,0.0001894853,0.00014031619,0.00009012615,0.0029979402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943167,0.00021120507,0.000038075854,0.0001124761,0.00017368485,0.000032743246],"domain_scores_gemma":[0.9995222,0.000210012,0.00006123804,0.00009319155,0.000100794656,0.0000125257175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011447377,0.00090757565,0.00061470125,0.00048105692,0.00025698193,0.00051204214,0.00074576173,0.0007472795,0.0026134865],"category_scores_gemma":[0.002381112,0.00038224855,0.0006471885,0.00046160366,0.0006578724,0.0007228495,0.0007752104,0.0012249938,0.00198352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020664942,0.000108498425,0.0005351778,0.0003891042,0.00014661395,0.00014556931,0.00019102746,0.2966841,0.072151005,0.06061442,0.0034823967,0.5653454],"study_design_scores_gemma":[0.000020762569,0.00008445327,0.0001332024,0.00001610754,0.000013983734,0.000109013345,0.000012278197,0.9826003,0.0071866796,0.0054044686,0.0044022133,0.000016518117],"about_ca_topic_score_codex":0.001038445,"about_ca_topic_score_gemma":0.0014722764,"teacher_disagreement_score":0.0026134865,"about_ca_system_score_codex":0.0002950308,"about_ca_system_score_gemma":0.0010115042,"threshold_uncertainty_score":0.008742988},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033614937,0.0005908167,0.9621944,0.00010936955,0.00015164676,0.00014361613,0.000085204876,0.00030559054,0.0028043913],"genre_scores_gemma":[0.24295498,0.0009766044,0.74835646,0.00010997786,0.00007790228,0.0001889951,0.00016214087,0.000075113196,0.007097922],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993375,0.00020713998,0.000044232085,0.00014032617,0.00022505663,0.000045823956],"domain_scores_gemma":[0.9992873,0.0003947974,0.00005201249,0.00008728065,0.00014989293,0.000028682416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007404411,0.00061024557,0.0004116783,0.0009009024,0.00034958805,0.0006056397,0.00045878717,0.0007449108,0.0025651373],"category_scores_gemma":[0.0018172346,0.00020518563,0.0006624136,0.00055306294,0.00061299175,0.00080339436,0.00070964807,0.00067828386,0.0010501101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011901525,0.00020501378,0.001276952,0.0005859155,0.00014442278,0.00033379145,0.0005123671,0.0067614755,0.32587743,0.013686059,0.001403343,0.64802307],"study_design_scores_gemma":[0.00028291406,0.0014109549,0.010069034,0.00010873887,0.0002771284,0.0038870578,0.0004118712,0.3310588,0.6035993,0.015731042,0.03288611,0.00027714265],"about_ca_topic_score_codex":0.0006456791,"about_ca_topic_score_gemma":0.0007078659,"teacher_disagreement_score":0.0025651373,"about_ca_system_score_codex":0.00022229868,"about_ca_system_score_gemma":0.00052760466,"threshold_uncertainty_score":0.008581281},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026953032,0.0005171116,0.9686538,0.000066353125,0.00009048118,0.000032031974,0.0002445542,0.0015790849,0.0018635736],"genre_scores_gemma":[0.40556788,0.00070237217,0.5865536,0.00008613312,0.000113025555,0.00014492839,0.0010605812,0.00043972154,0.005331689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997315,0.00006794928,0.000019727204,0.00005968006,0.00010175105,0.000019355553],"domain_scores_gemma":[0.9990602,0.00038421698,0.00009967607,0.00007826709,0.00034789208,0.000029720157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038373677,0.0005200149,0.0003779889,0.0015230291,0.00024357378,0.0005799676,0.00035663508,0.00040649693,0.005035057],"category_scores_gemma":[0.0022580933,0.00016208767,0.00041406916,0.0015776242,0.00015458534,0.00049469894,0.000300056,0.0004175637,0.0012639879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005812176,0.00010266255,0.0038861025,0.00034072256,0.00012276004,0.00030185538,0.00025432569,0.048517346,0.11766287,0.0059816176,0.005158196,0.81709033],"study_design_scores_gemma":[0.00003202015,0.0001975812,0.009368693,0.000047037094,0.00010162319,0.00084507297,0.00010140739,0.93416613,0.044621885,0.0018656157,0.008589533,0.00006340686],"about_ca_topic_score_codex":0.0022143628,"about_ca_topic_score_gemma":0.0025224497,"teacher_disagreement_score":0.005035057,"about_ca_system_score_codex":0.00017519329,"about_ca_system_score_gemma":0.00040283168,"threshold_uncertainty_score":0.016843915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14666389,0.0012418361,0.5707391,0.0013523158,0.0014098947,0.00019850818,0.0010930441,0.0011304524,0.27617103],"genre_scores_gemma":[0.7414536,0.0010526773,0.12569268,0.0012156334,0.0016222975,0.0002002056,0.0018627326,0.00073027547,0.12616993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995658,0.000050843595,0.000023048291,0.00011329436,0.00015623144,0.000090829824],"domain_scores_gemma":[0.9995426,0.00004927947,0.00003536027,0.00007367971,0.00020041289,0.0000986919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037040902,0.00074994366,0.00050226273,0.0021599322,0.000820767,0.0017287938,0.0006733737,0.00075348926,0.023356035],"category_scores_gemma":[0.0011817028,0.00017828098,0.00049107615,0.00066736125,0.0010427521,0.0017549102,0.0013508699,0.0012237898,0.005772557],"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.000043970766,0.000031193114,0.00015391891,0.000060086924,0.0000056807426,0.000095398056,0.00017521105,0.0011915782,0.005137969,0.9633169,0.005395051,0.024393052],"study_design_scores_gemma":[0.0000125815395,0.000047587542,0.00040406885,0.000046616235,0.000008963505,0.0004125399,0.00015070365,0.029998034,0.0034543045,0.9379705,0.027466811,0.000027213006],"about_ca_topic_score_codex":0.00033240204,"about_ca_topic_score_gemma":0.00022917718,"teacher_disagreement_score":0.023356035,"about_ca_system_score_codex":0.00064140477,"about_ca_system_score_gemma":0.00052739773,"threshold_uncertainty_score":0.07813376},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015546535,0.0008345585,0.96964574,0.000267201,0.0002866968,0.000114118004,0.000068462665,0.0012179143,0.012018801],"genre_scores_gemma":[0.38591003,0.0012392299,0.57494235,0.0004885192,0.00024470408,0.00016270878,0.00020181293,0.00010891213,0.03670168],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997305,0.00004702276,0.000013159335,0.00006483048,0.00012073422,0.00002372198],"domain_scores_gemma":[0.99985516,0.000047927104,0.000013006603,0.000021548323,0.000054508448,0.000007858882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028835973,0.00046000083,0.00026038472,0.00039693242,0.00024819627,0.00055794575,0.00052064034,0.0006898065,0.0041162223],"category_scores_gemma":[0.0005702048,0.00015222408,0.00025682396,0.00028543765,0.00027294978,0.0007555201,0.0003759984,0.0005908799,0.0013056421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036817958,0.00011424069,0.0005104419,0.00029009933,0.0000724522,0.00033600943,0.000113933325,0.018250816,0.525263,0.04338509,0.004194046,0.4071017],"study_design_scores_gemma":[0.00013576503,0.0008258682,0.0013031238,0.00007476921,0.00014844172,0.0019467883,0.000041983745,0.2906087,0.55756885,0.0063361656,0.14094217,0.00006742067],"about_ca_topic_score_codex":0.0002686298,"about_ca_topic_score_gemma":0.00050758576,"teacher_disagreement_score":0.0041162223,"about_ca_system_score_codex":0.0003791472,"about_ca_system_score_gemma":0.00028507592,"threshold_uncertainty_score":0.013770103},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001198553,0.00008489211,0.9983353,0.00003585123,0.0000072378007,0.000009506591,0.000011198478,0.00007471297,0.00024279252],"genre_scores_gemma":[0.05445388,0.00044489332,0.94237345,0.00011357721,0.000067528716,0.00011564569,0.00018773458,0.000109916844,0.0021334006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879944,0.0003215075,0.00007500992,0.00017954125,0.00053691363,0.00008762676],"domain_scores_gemma":[0.99723154,0.0016026929,0.0002919237,0.00022976569,0.0005698569,0.00007417178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025181428,0.0008992189,0.0011841294,0.0011765765,0.0004332361,0.0009583913,0.0017451505,0.0013500275,0.001992081],"category_scores_gemma":[0.0090450775,0.000761901,0.00080787577,0.0012200595,0.0008826034,0.002685526,0.0017503159,0.0022030284,0.0009098419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020631967,0.000093710274,0.00065840705,0.00016921714,0.00008862619,0.00006841073,0.00019821756,0.54024327,0.008506286,0.06925848,0.002643036,0.3778659],"study_design_scores_gemma":[0.000015859978,0.000018280627,0.00010724363,0.000008781125,0.000008790157,0.000029814497,0.000005327154,0.98854977,0.0012605257,0.008916845,0.0010656265,0.000013141889],"about_ca_topic_score_codex":0.0035083697,"about_ca_topic_score_gemma":0.0040127146,"teacher_disagreement_score":0.0035083697,"about_ca_system_score_codex":0.0008604824,"about_ca_system_score_gemma":0.0014191841,"threshold_uncertainty_score":0.013317406},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010046161,0.0001717466,0.9981996,0.000034243018,0.000021393937,0.000004771107,0.000020769836,0.0001322731,0.00041047367],"genre_scores_gemma":[0.2431408,0.0017472291,0.74555737,0.00017794596,0.00015482448,0.00019387032,0.000579661,0.0004216743,0.008026657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994685,0.00022479825,0.000026308899,0.00009413828,0.00014391204,0.000042290536],"domain_scores_gemma":[0.999345,0.0003532285,0.000057658654,0.00008828166,0.00013440858,0.000021432934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007503573,0.0009777057,0.0012084829,0.0006438642,0.00027006996,0.0012069776,0.0011593369,0.0010740284,0.0016644892],"category_scores_gemma":[0.0028676332,0.0004913721,0.0013706433,0.0011368408,0.000669577,0.0013929775,0.0012620853,0.0016185405,0.0012275396],"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.00017838721,0.00004853002,0.0004651492,0.00025128791,0.00017858518,0.000160697,0.000117746626,0.6883918,0.015459093,0.10479459,0.0033958731,0.18655828],"study_design_scores_gemma":[0.0000037487607,0.000008409139,0.00006693901,0.000009141258,0.000011402613,0.00003414944,0.0000055026703,0.9846224,0.0009158016,0.013416606,0.0008958827,0.000009959403],"about_ca_topic_score_codex":0.0034222358,"about_ca_topic_score_gemma":0.002597824,"teacher_disagreement_score":0.0034222358,"about_ca_system_score_codex":0.0004644102,"about_ca_system_score_gemma":0.00092046184,"threshold_uncertainty_score":0.006804645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03498802,0.0012593518,0.95987624,0.00018381148,0.00005215651,0.00003379348,0.00012377894,0.0005734216,0.0029093297],"genre_scores_gemma":[0.56897515,0.0020798503,0.42360014,0.00012484255,0.00008336842,0.000083512045,0.0005763425,0.000063920605,0.004412924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994498,0.00021676387,0.000031887805,0.00005708933,0.0002215203,0.000022957785],"domain_scores_gemma":[0.9979686,0.0014176763,0.0001651084,0.00018560058,0.0002450884,0.000017940516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072170445,0.00028621402,0.00032181523,0.0006907323,0.00022960654,0.00042887637,0.00025920692,0.0004407779,0.0024325773],"category_scores_gemma":[0.006422425,0.000116632604,0.00016621525,0.00069275126,0.0002611801,0.0007610618,0.00037526755,0.0003232315,0.000554969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004976986,0.00006906334,0.0018553921,0.00035712935,0.00005824158,0.0001043275,0.00006751594,0.4186876,0.025955664,0.05085382,0.002971287,0.49852225],"study_design_scores_gemma":[0.000019878127,0.00009686094,0.00047739368,0.000033931257,0.000012948446,0.00016478267,0.000015252052,0.9635607,0.017162947,0.013662514,0.0047804173,0.0000123722375],"about_ca_topic_score_codex":0.0014119403,"about_ca_topic_score_gemma":0.0015120736,"teacher_disagreement_score":0.0024325773,"about_ca_system_score_codex":0.0004389181,"about_ca_system_score_gemma":0.0005133467,"threshold_uncertainty_score":0.008137822},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020801206,0.002264001,0.03151766,0.06361939,0.88303393,0.00008305664,0.002035453,0.0047065453,0.010659845],"genre_scores_gemma":[0.14882231,0.0048407936,0.091468394,0.04595582,0.13553669,0.00042589297,0.00333074,0.0074214675,0.56219786],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976667,0.00032329542,0.00033450467,0.0004931995,0.0009918341,0.00019034743],"domain_scores_gemma":[0.98647726,0.0025746485,0.00068914075,0.0018658314,0.007922928,0.00047020623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015871109,0.0021760913,0.0027684434,0.003019693,0.0027398511,0.0023722087,0.002671744,0.007710503,0.09316966],"category_scores_gemma":[0.032891523,0.0010681659,0.0013684449,0.002730728,0.0017203195,0.0025482206,0.0020570622,0.0055942684,0.03761874],"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.00015032403,0.000012695033,0.0001977007,0.00018853653,0.000037791186,0.0007783124,0.00006853419,0.00083943026,0.00051902933,0.008594721,0.9619731,0.026639933],"study_design_scores_gemma":[0.000086069165,0.000056292763,0.0010841958,0.00018086188,0.00006479535,0.0023613155,0.00012372984,0.014649155,0.004275851,0.01649394,0.9604716,0.00015219396],"about_ca_topic_score_codex":0.0077208495,"about_ca_topic_score_gemma":0.010110663,"teacher_disagreement_score":0.09316966,"about_ca_system_score_codex":0.0034056974,"about_ca_system_score_gemma":0.002339144,"threshold_uncertainty_score":0.31168354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026905427,0.00063899317,0.9692128,0.00017917939,0.00011142065,0.00006243918,0.0001795862,0.00032018853,0.0023900191],"genre_scores_gemma":[0.28167853,0.0015443824,0.7124973,0.00017751066,0.00027893475,0.00014874959,0.0003640419,0.00018079748,0.003129733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997099,0.000045826953,0.00002164801,0.000059833892,0.00014547855,0.000017200602],"domain_scores_gemma":[0.99925584,0.0003102313,0.00013713924,0.00012305034,0.00014823154,0.000025543875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040080302,0.00079577696,0.00032456763,0.0015244444,0.00028174356,0.00061945035,0.00025413604,0.000334306,0.0028132924],"category_scores_gemma":[0.0018489592,0.00017605585,0.00035417406,0.0010464172,0.0006046506,0.001163291,0.00046643242,0.00059620576,0.0005543877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000258172,0.00011003369,0.002842294,0.0005673594,0.00007991292,0.00023991636,0.00026323588,0.029021068,0.36131886,0.036715727,0.0032027466,0.5653807],"study_design_scores_gemma":[0.000034282162,0.00039224056,0.019195175,0.000102332786,0.00009363354,0.0011516031,0.00032294996,0.7484387,0.16084668,0.041939512,0.027317258,0.00016555944],"about_ca_topic_score_codex":0.00039639245,"about_ca_topic_score_gemma":0.0013605166,"teacher_disagreement_score":0.0028132924,"about_ca_system_score_codex":0.0002120974,"about_ca_system_score_gemma":0.00032236366,"threshold_uncertainty_score":0.009411335},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02194456,0.00079465366,0.9680265,0.00011513283,0.00008906503,0.000069292255,0.00004393517,0.0012874465,0.007629388],"genre_scores_gemma":[0.50277996,0.00097648543,0.47903144,0.00015280234,0.00006206335,0.00010723873,0.00016175618,0.00013279359,0.016595447],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997991,0.00005626664,0.000009592948,0.00003395946,0.00008682982,0.000014312506],"domain_scores_gemma":[0.9998084,0.000094106545,0.000018161174,0.000024371455,0.000049945353,0.0000051467355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035832918,0.00036876238,0.00020342233,0.0002995615,0.00020375814,0.00039056662,0.00037782895,0.00044337206,0.0047940062],"category_scores_gemma":[0.0006955661,0.00011792988,0.00019486163,0.00026555493,0.00022193952,0.00045778893,0.0001807935,0.00046357978,0.0011733002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004060895,0.0001256838,0.0009528435,0.00044610054,0.00007936869,0.00035676986,0.00018043078,0.03968978,0.4795654,0.024384346,0.0029600891,0.4508532],"study_design_scores_gemma":[0.00006503175,0.00076970214,0.00192817,0.000108120774,0.0001021384,0.0014922197,0.000050708157,0.3525098,0.5784067,0.0044898107,0.060021494,0.00005614289],"about_ca_topic_score_codex":0.00049136626,"about_ca_topic_score_gemma":0.0009760676,"teacher_disagreement_score":0.0047940062,"about_ca_system_score_codex":0.0003316047,"about_ca_system_score_gemma":0.0002602331,"threshold_uncertainty_score":0.016037524},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003164443,0.0007544833,0.99394506,0.00014101714,0.0000752883,0.000007584945,0.00006908928,0.00025372242,0.0015893762],"genre_scores_gemma":[0.5332593,0.0034460942,0.44235036,0.00041029812,0.00047203992,0.00018993544,0.00096330675,0.00040827814,0.018500406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994425,0.00020018654,0.000026468144,0.00012209578,0.00014747646,0.00006123392],"domain_scores_gemma":[0.99858236,0.0009153042,0.000116487834,0.00017182801,0.00018175953,0.00003221614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008969927,0.0009321403,0.0011102326,0.0007065584,0.00033526638,0.0012676434,0.0010173789,0.001389798,0.0024261996],"category_scores_gemma":[0.0040203375,0.00047726274,0.0012436551,0.0011083146,0.0009672002,0.0013765614,0.0009830995,0.0021544583,0.0013195536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017160733,0.000041481366,0.0006151066,0.00017870449,0.0001619676,0.0001706806,0.0001610957,0.62756675,0.008857302,0.2407421,0.0028565298,0.118476704],"study_design_scores_gemma":[0.0000036283539,0.000012105937,0.00016924825,0.000014468446,0.00001638055,0.000048962323,0.0000069663092,0.9512919,0.0011377705,0.045879856,0.001403838,0.000014782584],"about_ca_topic_score_codex":0.0040842993,"about_ca_topic_score_gemma":0.002747796,"teacher_disagreement_score":0.0040842993,"about_ca_system_score_codex":0.0005877278,"about_ca_system_score_gemma":0.00087299204,"threshold_uncertainty_score":0.008121014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006300917,0.00056127255,0.9940819,0.0004765012,0.00016388026,0.00017276996,0.00034096022,0.0003736012,0.0031990565],"genre_scores_gemma":[0.015419286,0.0009221226,0.9790157,0.00046214668,0.00039653684,0.0018181871,0.00042484578,0.00032988077,0.001211307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.95846224,0.025474044,0.002500989,0.004326718,0.008702919,0.0005331367],"domain_scores_gemma":[0.88806593,0.0836016,0.006535687,0.009886873,0.010693679,0.0012160997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.05053007,0.0028374,0.0026714632,0.012929805,0.0022743456,0.009729426,0.005712701,0.0032211812,0.014341243],"category_scores_gemma":[0.14161386,0.0011791262,0.0044321218,0.008284649,0.007867069,0.008026863,0.006319842,0.0062052454,0.005533338],"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.00013261214,0.00014879643,0.0021793153,0.0011982433,0.0003346274,0.00026698713,0.0013000125,0.0072833397,0.0022364177,0.75120413,0.00951183,0.22420368],"study_design_scores_gemma":[0.00004219889,0.0001851097,0.0019857734,0.0005817155,0.0001267979,0.00047834872,0.00043722676,0.0398012,0.0009595985,0.89341885,0.061864473,0.00011873613],"about_ca_topic_score_codex":0.0029647015,"about_ca_topic_score_gemma":0.0019792684,"teacher_disagreement_score":0.05053007,"about_ca_system_score_codex":0.0021950053,"about_ca_system_score_gemma":0.004792694,"threshold_uncertainty_score":0.2672317},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070274994,0.00015451132,0.99209553,0.0000527633,0.000023164177,0.000011372471,0.00001625558,0.000096147734,0.0005227713],"genre_scores_gemma":[0.36299843,0.000618223,0.63323915,0.00007140144,0.000080641046,0.00013284486,0.00020344956,0.00005857157,0.0025972864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998228,0.00004599804,0.0000126317045,0.000038503716,0.000066705834,0.000013409717],"domain_scores_gemma":[0.999579,0.00024157474,0.00005685562,0.000031781987,0.000075807606,0.000015010084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049351866,0.00078188675,0.00074129674,0.0004980659,0.0002598401,0.0005731433,0.00043873762,0.00075638376,0.00060995336],"category_scores_gemma":[0.0017079617,0.00038837382,0.000623429,0.0006120571,0.00030694692,0.0007649343,0.00065509515,0.00064648513,0.0002198014],"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.00009355897,0.00004976638,0.00094465894,0.00009393142,0.00007725696,0.00005638312,0.000097855685,0.8836994,0.005802814,0.0056265625,0.00091951416,0.10253829],"study_design_scores_gemma":[0.0000038316643,0.000010691745,0.00013926969,0.0000024658034,0.0000038245676,0.000010034372,0.0000030801211,0.9986198,0.00035869176,0.00061244314,0.00023246162,0.0000033832484],"about_ca_topic_score_codex":0.0036659513,"about_ca_topic_score_gemma":0.0027370008,"teacher_disagreement_score":0.0036659513,"about_ca_system_score_codex":0.0002898357,"about_ca_system_score_gemma":0.0006811867,"threshold_uncertainty_score":0.007289231},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012817535,0.00046927895,0.9851832,0.00006794966,0.00007176503,0.000047056936,0.000031352865,0.0003529944,0.0009588201],"genre_scores_gemma":[0.30603203,0.0009005872,0.6886258,0.00012418204,0.00007510718,0.00015202367,0.0001908394,0.00008011054,0.003819306],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995542,0.000066686705,0.00003597746,0.00012415531,0.00019393368,0.000024902965],"domain_scores_gemma":[0.99981683,0.000030097452,0.000025294274,0.00002843429,0.00009118013,0.000008235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004747407,0.0007497175,0.0005039133,0.0006052788,0.00033435825,0.0004908403,0.00047927146,0.0006532267,0.0015246978],"category_scores_gemma":[0.0010060014,0.0002479413,0.0008197102,0.00071803044,0.00028602878,0.0007836508,0.00052893924,0.0007036629,0.0005966992],"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.0003490774,0.00009222743,0.0008753859,0.00029955158,0.00013058078,0.00022125075,0.0002373545,0.03214564,0.20391467,0.0050351494,0.0013819044,0.7553172],"study_design_scores_gemma":[0.000045034572,0.0005766108,0.0080671655,0.00006331348,0.00018793346,0.0010207724,0.00013837879,0.8309839,0.1387311,0.004795497,0.015300268,0.00008998736],"about_ca_topic_score_codex":0.00097068556,"about_ca_topic_score_gemma":0.0010958242,"teacher_disagreement_score":0.0015246978,"about_ca_system_score_codex":0.00023825439,"about_ca_system_score_gemma":0.00039153773,"threshold_uncertainty_score":0.005100608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12432137,0.0009601475,0.86888826,0.0005174167,0.000075676275,0.0001242426,0.00008680664,0.00038965564,0.0046364637],"genre_scores_gemma":[0.9173121,0.00068658916,0.07963921,0.000088822475,0.00011144011,0.00007086571,0.00021587721,0.000049657436,0.0018255666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989612,0.0003589956,0.000055377237,0.0001844354,0.00035569916,0.000084237756],"domain_scores_gemma":[0.9955836,0.0031154605,0.00040388518,0.00018596611,0.0005723092,0.00013881516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002053424,0.001162854,0.0007923111,0.0010097447,0.00042223049,0.0012219463,0.0007035224,0.0014866409,0.0011769992],"category_scores_gemma":[0.008909,0.0002814179,0.00052575744,0.00058034196,0.0009832269,0.002238067,0.0014689484,0.0012340694,0.00022737308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007520143,0.0003550354,0.0072019016,0.00062483153,0.00022690516,0.000563389,0.00028058115,0.772339,0.02525712,0.025081813,0.0024800466,0.16483733],"study_design_scores_gemma":[0.000012690656,0.000080593476,0.0015147313,0.0000097555,0.000016791158,0.00007778486,0.000035077945,0.9911629,0.0030208873,0.003753409,0.00029980374,0.000015479349],"about_ca_topic_score_codex":0.002024706,"about_ca_topic_score_gemma":0.0009318277,"teacher_disagreement_score":0.002053424,"about_ca_system_score_codex":0.00050044915,"about_ca_system_score_gemma":0.00094628375,"threshold_uncertainty_score":0.010859668},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007516484,0.71384716,0.26731503,0.0024627864,0.000909518,0.00007575989,0.00013547184,0.0003199036,0.014182733],"genre_scores_gemma":[0.017644309,0.8479246,0.12603493,0.0009724038,0.0015626006,0.00018904466,0.00027822368,0.00011571574,0.0052782176],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938774,0.000125214,0.000046892193,0.00014158989,0.00027542232,0.000023048295],"domain_scores_gemma":[0.9988261,0.0007512521,0.00007575982,0.000076372155,0.00024005852,0.000030560936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014140994,0.0011582987,0.0010399137,0.0023714134,0.00032130265,0.001251653,0.0015100397,0.0016628372,0.004251499],"category_scores_gemma":[0.0024579966,0.00059893075,0.0008540151,0.003907558,0.0019680406,0.002396056,0.0010977022,0.0033425223,0.0034280042],"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.00003149589,0.000064116815,0.0002869752,0.004210968,0.00012091145,0.00010504087,0.00006898709,0.008504851,0.0016694128,0.11917238,0.020883925,0.84488094],"study_design_scores_gemma":[0.000023137809,0.000100100006,0.0011080139,0.002891832,0.0001298252,0.0010389172,0.00006967264,0.04078341,0.005292493,0.18026453,0.7681642,0.0001338993],"about_ca_topic_score_codex":0.0013423618,"about_ca_topic_score_gemma":0.0013255689,"teacher_disagreement_score":0.004251499,"about_ca_system_score_codex":0.0011127626,"about_ca_system_score_gemma":0.0013293611,"threshold_uncertainty_score":0.014222741},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008396982,0.0001336196,0.9904242,0.00006173481,0.000028888533,0.00002970136,0.000033570395,0.00051040674,0.00038094647],"genre_scores_gemma":[0.42705837,0.00038921338,0.5686822,0.0001921235,0.00010197974,0.00020806784,0.0005587765,0.00023440605,0.0025749058],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982628,0.0005090069,0.00016644098,0.00045605414,0.00044571745,0.0001600177],"domain_scores_gemma":[0.9956494,0.0022832341,0.0005062051,0.0007546707,0.0006757423,0.00013080137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032117835,0.0010914167,0.0015525712,0.0017343953,0.0007049292,0.0016823498,0.0017857074,0.0013806453,0.0021548655],"category_scores_gemma":[0.014515546,0.0005431481,0.0010046178,0.002037663,0.001147596,0.0026268712,0.0020171287,0.0021022263,0.0008205484],"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.00065378484,0.00025213897,0.004099821,0.00030105078,0.00025032813,0.00032946834,0.00020992612,0.20384988,0.022233794,0.026870243,0.0028000537,0.7381495],"study_design_scores_gemma":[0.0000293376,0.00006739696,0.00073526474,0.000014522417,0.000027704851,0.00013456664,0.000021616557,0.9731151,0.0074955714,0.01748671,0.0008503831,0.000021942442],"about_ca_topic_score_codex":0.0015037304,"about_ca_topic_score_gemma":0.0017529232,"teacher_disagreement_score":0.0032117835,"about_ca_system_score_codex":0.000496677,"about_ca_system_score_gemma":0.0018481743,"threshold_uncertainty_score":0.016985714},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026364874,0.0001537345,0.96648496,0.0010347324,0.000068083886,0.000038160797,0.00014467756,0.00015457511,0.005556267],"genre_scores_gemma":[0.84372014,0.000459802,0.14344819,0.00095186,0.00037877835,0.0003346227,0.00036753164,0.0002996059,0.010039529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977639,0.0011882157,0.00008705538,0.0003909177,0.0003657853,0.00020421536],"domain_scores_gemma":[0.9870569,0.00841242,0.001529024,0.001263926,0.0010717122,0.0006659063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075294464,0.0008464351,0.0014062806,0.0012367694,0.00077150605,0.0019798316,0.002516263,0.00289314,0.0077687986],"category_scores_gemma":[0.018441478,0.0007750674,0.0019224709,0.00062223466,0.0027850948,0.003873394,0.002569691,0.005085709,0.0010939816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078438956,0.00005416804,0.000622079,0.000051613515,0.000051663945,0.00013716563,0.00023477386,0.063412726,0.0021606798,0.9274032,0.0015867646,0.004206625],"study_design_scores_gemma":[0.000018710893,0.000025056357,0.00023340421,0.000009261256,0.000009416075,0.00004818941,0.000022206686,0.5045346,0.00022997371,0.49417308,0.0006791601,0.000016955128],"about_ca_topic_score_codex":0.001912369,"about_ca_topic_score_gemma":0.0017033225,"teacher_disagreement_score":0.0077687986,"about_ca_system_score_codex":0.0013312586,"about_ca_system_score_gemma":0.0011472869,"threshold_uncertainty_score":0.039820015},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3999977,0.0052892086,0.58567095,0.00088552356,0.00044769794,0.00038427053,0.00060897024,0.0029390082,0.003776647],"genre_scores_gemma":[0.74249816,0.0013375612,0.25110492,0.00032943735,0.00020217229,0.00026409133,0.0023646357,0.0005331714,0.0013658537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943889,0.0032477668,0.00032304373,0.0008370802,0.00087866245,0.000324659],"domain_scores_gemma":[0.9725152,0.021101594,0.00089722895,0.002164774,0.0028363545,0.00048487153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013588157,0.002940473,0.0015591016,0.002701274,0.0009097006,0.0016818615,0.0012039079,0.0019490655,0.001099176],"category_scores_gemma":[0.050705735,0.00055120845,0.0017824773,0.0020677506,0.0011142811,0.0023172274,0.0021697576,0.0019400443,0.00069840276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022999058,0.0008552406,0.038161628,0.00087263784,0.0016785873,0.0006050716,0.0012763579,0.35571957,0.030179525,0.0033509354,0.005311351,0.5596893],"study_design_scores_gemma":[0.00007872221,0.00031596844,0.01336803,0.00008029094,0.0003132194,0.00020552952,0.00024831886,0.9630487,0.015617679,0.004457019,0.002168175,0.0000982978],"about_ca_topic_score_codex":0.0087380335,"about_ca_topic_score_gemma":0.0059547313,"teacher_disagreement_score":0.013588157,"about_ca_system_score_codex":0.0004907287,"about_ca_system_score_gemma":0.0014770039,"threshold_uncertainty_score":0.07186192},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038566597,0.00059958606,0.95853853,0.00048628068,0.00019875112,0.00004037986,0.00029992583,0.00034428472,0.00092567765],"genre_scores_gemma":[0.7182433,0.000830434,0.2720972,0.00047410064,0.0006094776,0.00019472218,0.0018341236,0.00016478453,0.0055518206],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982028,0.00052954996,0.00016398607,0.00039387355,0.00052378,0.00018593793],"domain_scores_gemma":[0.9941141,0.0031329757,0.00043018992,0.0010343652,0.0010930547,0.00019537898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039524403,0.0006807324,0.0014449216,0.0017997023,0.0010146033,0.002220787,0.0014084687,0.001309479,0.0020483267],"category_scores_gemma":[0.011644694,0.00037624134,0.0010062136,0.0015836541,0.0012542163,0.0016318611,0.0017098531,0.0015911078,0.0010013336],"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.0010992433,0.0004793627,0.01397172,0.00078247354,0.00034248576,0.00045096167,0.00053796626,0.14324075,0.04703628,0.06824257,0.012185648,0.71163046],"study_design_scores_gemma":[0.000019606387,0.000065688175,0.0030581304,0.00002758933,0.000036378864,0.00017759876,0.000093776485,0.95633376,0.0055754418,0.032200515,0.0023880687,0.000023473092],"about_ca_topic_score_codex":0.0014252681,"about_ca_topic_score_gemma":0.001529152,"teacher_disagreement_score":0.0039524403,"about_ca_system_score_codex":0.0006797023,"about_ca_system_score_gemma":0.0010835681,"threshold_uncertainty_score":0.020902753},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034776658,0.00059147074,0.992257,0.00014374178,0.00010371852,0.00004452773,0.00010251896,0.001413966,0.0018653646],"genre_scores_gemma":[0.08772137,0.00089157646,0.9047592,0.00039133124,0.00021956657,0.00015343691,0.0006285482,0.0004430587,0.0047918637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999079,0.00020892569,0.000041787564,0.00022708425,0.00036950674,0.000073666044],"domain_scores_gemma":[0.9991406,0.0002964969,0.000062748135,0.0002080107,0.00024884034,0.0000432964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010889532,0.0015593027,0.0010419094,0.0010214151,0.00050099776,0.0009946958,0.001805163,0.0013878908,0.0031493905],"category_scores_gemma":[0.0031426435,0.00035292108,0.0013083733,0.0018916863,0.000656604,0.0014693303,0.0020115518,0.0019437799,0.0020076842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023674319,0.00010141282,0.00093358004,0.00015802699,0.00011860577,0.000094786585,0.00010229217,0.100075595,0.018073244,0.013378084,0.008192541,0.85853505],"study_design_scores_gemma":[0.000034904748,0.00012230169,0.0010037412,0.000036071382,0.00004788508,0.00025709977,0.00002574731,0.9551957,0.010132058,0.010331802,0.02276411,0.00004858552],"about_ca_topic_score_codex":0.0078029535,"about_ca_topic_score_gemma":0.009027643,"teacher_disagreement_score":0.0078029535,"about_ca_system_score_codex":0.0005954002,"about_ca_system_score_gemma":0.0016419088,"threshold_uncertainty_score":0.015515089},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086931,0.005437923,0.84763855,0.00033553966,0.0011940873,0.00007179202,0.00040152043,0.0042869584,0.13976425],"genre_scores_gemma":[0.018653553,0.008104107,0.33685532,0.00054786,0.00095259596,0.00016545129,0.0017794155,0.0020623675,0.63087934],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999739,0.000024757355,0.0000103167995,0.00006360365,0.00014824553,0.000013975972],"domain_scores_gemma":[0.9997286,0.000064740154,0.00001109469,0.00007404375,0.00010870334,0.000012862789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021032944,0.0016577234,0.0007446251,0.0012274706,0.0005456616,0.001642585,0.00093014946,0.00087557785,0.068848275],"category_scores_gemma":[0.0008033759,0.0005161618,0.000619781,0.0013795281,0.0005719278,0.0015384554,0.0012102851,0.0014688455,0.07747123],"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.000048042104,0.00003052292,0.00008451109,0.00031956934,0.000043853648,0.00007864195,0.00005778169,0.003057462,0.018056862,0.05885848,0.11735736,0.80200684],"study_design_scores_gemma":[0.0000133535905,0.000050571703,0.0007491958,0.00012518563,0.000060153576,0.0007098819,0.000047554906,0.035099618,0.025096556,0.09897636,0.8390088,0.0000628603],"about_ca_topic_score_codex":0.0006397,"about_ca_topic_score_gemma":0.0013959642,"teacher_disagreement_score":0.068848275,"about_ca_system_score_codex":0.00032650548,"about_ca_system_score_gemma":0.00041050266,"threshold_uncertainty_score":0.23032045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027617248,0.0009430809,0.9624831,0.00093051494,0.000044607652,0.000021436546,0.00007597111,0.00021822176,0.007665833],"genre_scores_gemma":[0.8044893,0.0019989286,0.18592624,0.0006328201,0.00042056487,0.0002309174,0.00021498019,0.00022364594,0.005862576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99601376,0.0014558188,0.00014411424,0.0007121525,0.0013579484,0.0003161255],"domain_scores_gemma":[0.9745821,0.020261142,0.0017001694,0.0017919963,0.0012137286,0.0004509069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054056975,0.0011925265,0.0011829737,0.001384972,0.0008185565,0.0024766193,0.0016934712,0.0021219694,0.0017142906],"category_scores_gemma":[0.04241689,0.0007943549,0.000567782,0.0010415686,0.005552931,0.0052920966,0.00365656,0.0030716,0.00061000715],"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.00012354109,0.000056911038,0.0005617132,0.00020805204,0.00004898941,0.00016028532,0.0002644935,0.16382432,0.004477813,0.8080156,0.0011783837,0.02107989],"study_design_scores_gemma":[0.000011863832,0.000036607427,0.0001765589,0.000029040166,0.000008843694,0.00010010553,0.000028743476,0.5300103,0.0022098694,0.466589,0.0007804265,0.000018719902],"about_ca_topic_score_codex":0.0008466165,"about_ca_topic_score_gemma":0.00052821625,"teacher_disagreement_score":0.0054056975,"about_ca_system_score_codex":0.0013465194,"about_ca_system_score_gemma":0.00088250206,"threshold_uncertainty_score":0.028588414},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010087479,0.00088873034,0.9867073,0.00087825063,0.00003844578,0.000035673987,0.00039236768,0.00043247835,0.00053922005],"genre_scores_gemma":[0.35011414,0.004059942,0.6361259,0.0009592365,0.0004120747,0.00040087977,0.004922333,0.0010010737,0.002004422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664944,0.0019737505,0.00020335948,0.0004963463,0.000500375,0.00017662518],"domain_scores_gemma":[0.9830586,0.010488162,0.002079286,0.0024287945,0.0012889572,0.0006561362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073988633,0.002317061,0.0019232103,0.0027818044,0.0008053274,0.004897115,0.0027773385,0.0032289543,0.0018176984],"category_scores_gemma":[0.031327933,0.0010984883,0.00211937,0.0020057266,0.0037221771,0.0069428184,0.0055810446,0.006362328,0.00089735526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046042472,0.00018345162,0.007098588,0.00084403594,0.00035665324,0.00032237027,0.00081494363,0.61446965,0.011606492,0.18487321,0.0068643303,0.1721059],"study_design_scores_gemma":[0.000017158945,0.000055126682,0.0008505197,0.00007920298,0.000032609783,0.00010295475,0.0000924451,0.7930405,0.002875195,0.19971144,0.0030945013,0.00004829361],"about_ca_topic_score_codex":0.003109576,"about_ca_topic_score_gemma":0.0026874053,"teacher_disagreement_score":0.0073988633,"about_ca_system_score_codex":0.0016469047,"about_ca_system_score_gemma":0.0017995584,"threshold_uncertainty_score":0.039129376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002732913,0.0003138242,0.99562895,0.00007371572,0.00006924125,0.000021130765,0.000026467013,0.00021990831,0.00091389654],"genre_scores_gemma":[0.088405475,0.00057345047,0.9052718,0.00020848717,0.00013350726,0.000084457235,0.0001852796,0.00008124761,0.00505631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971956,0.00006241686,0.000019347313,0.00006431716,0.00010902254,0.000025310103],"domain_scores_gemma":[0.9998105,0.00004591911,0.000017674143,0.000032624775,0.000078405465,0.000014862866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002816544,0.0007276436,0.00057811354,0.0005332878,0.00034313067,0.0005922734,0.0007172847,0.00082372985,0.0024803008],"category_scores_gemma":[0.0006920607,0.00024688873,0.0005672162,0.00059018424,0.00023561069,0.00059956533,0.0011004736,0.0008534542,0.0011462561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032031268,0.00009974104,0.0010342359,0.0002637807,0.00014814138,0.0002519352,0.00010997201,0.02525612,0.19184266,0.011767619,0.0039379657,0.7649674],"study_design_scores_gemma":[0.00006706043,0.00020856685,0.0015105602,0.000046761063,0.0000904656,0.0009303642,0.000046108507,0.90696007,0.06538775,0.006060951,0.018629195,0.00006207312],"about_ca_topic_score_codex":0.0012962087,"about_ca_topic_score_gemma":0.0020055836,"teacher_disagreement_score":0.0024803008,"about_ca_system_score_codex":0.00017812534,"about_ca_system_score_gemma":0.0006111635,"threshold_uncertainty_score":0.008297443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010495039,0.000063498795,0.9976465,0.000051049632,0.0000126265395,0.000009146256,0.00000825825,0.000093713854,0.0010657363],"genre_scores_gemma":[0.16505009,0.00040441487,0.8295832,0.0002574296,0.00009052414,0.00013007138,0.0001036278,0.000150781,0.0042297966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987832,0.00034103772,0.0000394475,0.00011937087,0.00065622805,0.000060739316],"domain_scores_gemma":[0.9978974,0.0012252948,0.00019160127,0.0002561816,0.00037354484,0.00005591816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015502144,0.00053046754,0.0005408291,0.0005381102,0.0003699843,0.0008290309,0.0009318899,0.0011077173,0.0035594956],"category_scores_gemma":[0.00761755,0.000386311,0.00040402808,0.0006831881,0.00093856436,0.0016523264,0.0014524666,0.0014176226,0.0014795883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024501767,0.00007090521,0.000372209,0.00015455799,0.00004689437,0.00007414896,0.00010373464,0.3987864,0.02565174,0.28493297,0.0037291623,0.2858323],"study_design_scores_gemma":[0.000022479117,0.000044111563,0.00007004204,0.000018419045,0.000008054961,0.00007951888,0.0000053574163,0.9583279,0.0046427846,0.03320731,0.0035555111,0.000018555755],"about_ca_topic_score_codex":0.0011722958,"about_ca_topic_score_gemma":0.0013648291,"teacher_disagreement_score":0.0035594956,"about_ca_system_score_codex":0.0005264989,"about_ca_system_score_gemma":0.0015074068,"threshold_uncertainty_score":0.011907697},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010966611,0.00007643292,0.99795026,0.000039446262,0.000017718683,0.000027608905,0.0000395224,0.0005417097,0.0002106488],"genre_scores_gemma":[0.03355814,0.00033424151,0.9643239,0.00010212015,0.000045478588,0.00014057064,0.00033791098,0.0002482193,0.0009094851],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989293,0.0002737148,0.00009267688,0.00019032878,0.00044444102,0.0000695301],"domain_scores_gemma":[0.9991953,0.00023478478,0.000078376055,0.00020882906,0.00024158267,0.000041133706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011630983,0.0015007071,0.000653477,0.0010393902,0.00036602034,0.0007679423,0.0011422787,0.0009526205,0.002547107],"category_scores_gemma":[0.0031444873,0.0004553495,0.0010771501,0.0012303038,0.0006447155,0.001092101,0.0015155071,0.0012216282,0.0020790664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023791652,0.000068910325,0.0006745344,0.0002925575,0.00018510873,0.0003282943,0.00024386791,0.06913267,0.30804634,0.0127171725,0.0046372963,0.6034354],"study_design_scores_gemma":[0.00007318573,0.00030905133,0.0026311583,0.000104110484,0.000119020886,0.001252652,0.00011963448,0.7710775,0.17094295,0.020488914,0.032677747,0.00020407552],"about_ca_topic_score_codex":0.0012112233,"about_ca_topic_score_gemma":0.0018886279,"teacher_disagreement_score":0.002547107,"about_ca_system_score_codex":0.0002565371,"about_ca_system_score_gemma":0.00063457555,"threshold_uncertainty_score":0.008520961},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86112565,0.00033305245,0.13534635,0.00037772485,0.000052837004,0.000030910298,0.00014449138,0.00047441604,0.0021145537],"genre_scores_gemma":[0.9935563,0.000063997024,0.0060070753,0.000019951292,0.0000052463256,0.000014620208,0.000058764505,0.00005229076,0.00022174191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985071,0.00036848293,0.00016538758,0.00028726834,0.00043275734,0.0002390271],"domain_scores_gemma":[0.9636157,0.028571034,0.0022288193,0.003210513,0.0018902641,0.00048365592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029380526,0.0005582154,0.00063426513,0.0004930252,0.00038168067,0.0010371108,0.0008112619,0.0008742661,0.00092264335],"category_scores_gemma":[0.051832307,0.00035881854,0.0004593013,0.0004181845,0.0012088484,0.0021139141,0.0010525906,0.0011663295,0.00027273127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008551054,0.000103084865,0.01998779,0.0001799937,0.00014241281,0.0002676737,0.00021841221,0.8714078,0.059059545,0.0068624746,0.00035773363,0.040557917],"study_design_scores_gemma":[0.00003299985,0.00026269924,0.008872906,0.000027687744,0.000046053097,0.00023043508,0.000059459926,0.9363179,0.049251925,0.004624601,0.0002273609,0.000045847883],"about_ca_topic_score_codex":0.0030706278,"about_ca_topic_score_gemma":0.002061721,"teacher_disagreement_score":0.0030706278,"about_ca_system_score_codex":0.0010403671,"about_ca_system_score_gemma":0.0012592509,"threshold_uncertainty_score":0.015538037},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005904558,0.0001585597,0.9925519,0.000060503244,0.000026845848,0.000040528364,0.000027910153,0.00030379527,0.00092547014],"genre_scores_gemma":[0.19095318,0.000417493,0.8027687,0.000116408024,0.00009391654,0.00011127973,0.00026929606,0.00012965142,0.005140076],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953747,0.00006410804,0.000023149541,0.000071314455,0.00027593717,0.000028010467],"domain_scores_gemma":[0.9995925,0.00014984694,0.0000367229,0.00009790597,0.00010819596,0.000014844243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041827143,0.00082973664,0.000550248,0.0006190381,0.00030130584,0.0006811244,0.00075633335,0.00076478993,0.002584132],"category_scores_gemma":[0.0011945086,0.00026294158,0.00053635053,0.00047154303,0.00035434682,0.001122977,0.0006239735,0.0008815024,0.0007420276],"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.00035939945,0.00013464144,0.0005418376,0.00025947817,0.00007583613,0.00020902793,0.00014044276,0.12590267,0.15134321,0.020691982,0.0020106116,0.6983309],"study_design_scores_gemma":[0.000018836396,0.0001611624,0.0003440163,0.000013654353,0.000018963248,0.0002744243,0.000020409738,0.93839693,0.053114645,0.0033754217,0.004238171,0.00002332177],"about_ca_topic_score_codex":0.0012935855,"about_ca_topic_score_gemma":0.0018965454,"teacher_disagreement_score":0.002584132,"about_ca_system_score_codex":0.000340004,"about_ca_system_score_gemma":0.0006416126,"threshold_uncertainty_score":0.00864476},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025560934,0.00046866018,0.8960657,0.0002659818,0.0001616677,0.00014137331,0.0005519879,0.07334075,0.0034429184],"genre_scores_gemma":[0.40957648,0.00024995607,0.5734253,0.00079015066,0.00009022897,0.00046475377,0.0033104802,0.00415648,0.007936258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909866,0.00017432432,0.0000504548,0.00024408716,0.00030572788,0.00012673163],"domain_scores_gemma":[0.9987446,0.00040786946,0.000071625655,0.00052873016,0.00016974137,0.00007736666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009954177,0.0016830381,0.0010350735,0.00076356763,0.0005963191,0.001437257,0.0037816651,0.0015412663,0.008629056],"category_scores_gemma":[0.00574887,0.00092426705,0.0012029341,0.0007268341,0.0008884282,0.0032140238,0.0033554924,0.003136,0.0049914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008303178,0.00032263628,0.0022569248,0.00028239447,0.000274544,0.0004496151,0.00043208268,0.26413643,0.0441688,0.01744893,0.038701996,0.63069534],"study_design_scores_gemma":[0.0000337341,0.000056653313,0.00013654366,0.0000076522465,0.000009956814,0.000052448442,0.000027682123,0.98135304,0.008565121,0.0064028716,0.0033337623,0.000020596106],"about_ca_topic_score_codex":0.009336999,"about_ca_topic_score_gemma":0.020121077,"teacher_disagreement_score":0.009336999,"about_ca_system_score_codex":0.00093540543,"about_ca_system_score_gemma":0.0015054259,"threshold_uncertainty_score":0.028867066},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021703213,0.0005707645,0.9749418,0.0002792771,0.000051471736,0.000020823432,0.00007177575,0.00047763163,0.0018831755],"genre_scores_gemma":[0.9160655,0.00040106106,0.078675024,0.00028643332,0.000062973515,0.000059757833,0.00018988684,0.00009749512,0.0041617476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957067,0.00017631802,0.00001452935,0.00007625064,0.00009181256,0.000070321126],"domain_scores_gemma":[0.99881834,0.0008549584,0.00008539174,0.00006442302,0.0001383174,0.000038563285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011520869,0.00089324435,0.00077258126,0.0003065501,0.00028711895,0.0006548342,0.00090756646,0.00085614825,0.0014372146],"category_scores_gemma":[0.002688488,0.00048201781,0.00049894635,0.00032372275,0.0008360286,0.0008657908,0.0012081302,0.0017936135,0.00033072763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007079523,0.00001838606,0.00033891603,0.000026489282,0.000023200322,0.000038930226,0.000027877899,0.9749908,0.0011679246,0.0046478724,0.00064686127,0.018001966],"study_design_scores_gemma":[0.0000011297615,0.0000047024314,0.000023705266,0.000001523321,0.0000018221737,0.000004052315,0.0000015313482,0.9987662,0.00019843463,0.00093418156,0.00006098136,0.0000016599183],"about_ca_topic_score_codex":0.0053586275,"about_ca_topic_score_gemma":0.005723234,"teacher_disagreement_score":0.0053586275,"about_ca_system_score_codex":0.0006999486,"about_ca_system_score_gemma":0.000659824,"threshold_uncertainty_score":0.010654867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032451544,0.00023015683,0.9941392,0.00015733502,0.000106023224,0.000012755255,0.0000725083,0.0001381848,0.0018986943],"genre_scores_gemma":[0.22248848,0.001965358,0.76442105,0.00064433436,0.0005628971,0.00011244384,0.0005937409,0.00035118352,0.008860497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996295,0.00008654924,0.000019298803,0.00008610673,0.00014664454,0.000031884083],"domain_scores_gemma":[0.9993137,0.000282834,0.00007473485,0.00015574953,0.00013035767,0.000042654414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006613107,0.00077345787,0.00040773908,0.0012992203,0.00036404442,0.0012920421,0.0008161943,0.0011384847,0.004524665],"category_scores_gemma":[0.002349099,0.00019432134,0.00069089764,0.0015547074,0.0012384044,0.002559759,0.0008018769,0.001381976,0.0016653023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012939892,0.00005204599,0.00055067934,0.00016849478,0.000039972765,0.0002966279,0.00016136732,0.0695304,0.040788256,0.69636875,0.0051947534,0.18671927],"study_design_scores_gemma":[0.000013921087,0.00009725971,0.00048328098,0.000035068602,0.000021127393,0.000389601,0.00006959753,0.6945314,0.010007929,0.2679321,0.026370663,0.000048081616],"about_ca_topic_score_codex":0.0010363775,"about_ca_topic_score_gemma":0.0008821994,"teacher_disagreement_score":0.004524665,"about_ca_system_score_codex":0.0005261086,"about_ca_system_score_gemma":0.00054518285,"threshold_uncertainty_score":0.01513654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07067268,0.013808345,0.90931034,0.0003048808,0.00014790658,0.000104619845,0.000054093336,0.00056917017,0.005027937],"genre_scores_gemma":[0.3934306,0.017640963,0.58191556,0.00024515484,0.0003077283,0.00014553362,0.00019662193,0.00018322754,0.0059346375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850357,0.00034654388,0.0000997076,0.000171569,0.000799662,0.000078914025],"domain_scores_gemma":[0.9971699,0.00161828,0.00015855717,0.00018033075,0.00080623874,0.000066722896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032769206,0.00076372776,0.0007360956,0.0020800072,0.00039739755,0.0013948905,0.00053047185,0.0014258954,0.0012725749],"category_scores_gemma":[0.0056465757,0.0001890794,0.0010197292,0.0018708708,0.0006957163,0.0015878009,0.00037742502,0.0006717738,0.00048977917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015403271,0.00031750603,0.0041643744,0.0010486371,0.00035914558,0.00027640414,0.00039954018,0.07167125,0.0594077,0.022797398,0.0014610726,0.8365567],"study_design_scores_gemma":[0.00019667887,0.0035870548,0.017390013,0.00029644763,0.0007634797,0.0015495312,0.00055745157,0.8305851,0.08940896,0.017600536,0.037838552,0.00022616517],"about_ca_topic_score_codex":0.002970931,"about_ca_topic_score_gemma":0.0025751425,"teacher_disagreement_score":0.0032769206,"about_ca_system_score_codex":0.00060856383,"about_ca_system_score_gemma":0.0008627283,"threshold_uncertainty_score":0.01733017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0706549,0.00028583745,0.9226292,0.00043477936,0.000045421162,0.00006631254,0.00013941343,0.0009309234,0.004813242],"genre_scores_gemma":[0.7452971,0.00030452455,0.24684635,0.00019724472,0.00005423231,0.00011484387,0.0002422815,0.000096544296,0.0068469173],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99959546,0.0000804068,0.000018230598,0.000108568594,0.00015163107,0.000045779907],"domain_scores_gemma":[0.9994419,0.000211085,0.00008510852,0.00013078186,0.00010020529,0.000030971532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008155485,0.0004379913,0.00034764694,0.00036042937,0.00031961713,0.00044216137,0.0009432183,0.0006412526,0.0023871798],"category_scores_gemma":[0.001538966,0.00022971336,0.0002605526,0.0004465907,0.0005928885,0.0013878067,0.0015650019,0.0010121834,0.0005509374],"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.0006285362,0.0004359279,0.0016051292,0.00037147035,0.000106542684,0.00038340007,0.00048761684,0.19395642,0.25718892,0.11470204,0.005240448,0.4248935],"study_design_scores_gemma":[0.000022990076,0.00009913322,0.0002822998,0.000019852432,0.00000916742,0.00012695642,0.000015994165,0.8862676,0.100374006,0.0098300995,0.0029203263,0.00003161615],"about_ca_topic_score_codex":0.0010171734,"about_ca_topic_score_gemma":0.0011938404,"teacher_disagreement_score":0.0023871798,"about_ca_system_score_codex":0.0004145913,"about_ca_system_score_gemma":0.00062781124,"threshold_uncertainty_score":0.00798589},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004086639,0.00011927138,0.99393696,0.00009291753,0.000025037407,0.000026243308,0.00009328378,0.001368123,0.0002515666],"genre_scores_gemma":[0.11588105,0.00017240972,0.88077945,0.00018536155,0.00005976942,0.00016254018,0.00078115624,0.0004701543,0.0015081159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992519,0.0002335183,0.000048071623,0.00019715643,0.00020781416,0.00006143426],"domain_scores_gemma":[0.99791235,0.001316505,0.00013558421,0.000206676,0.00033556344,0.000093301715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018336506,0.0009303594,0.0010289527,0.0010128495,0.0005738496,0.0010742592,0.0016902866,0.0016788186,0.003063392],"category_scores_gemma":[0.006111854,0.00059267296,0.00090883556,0.0012463458,0.00057112105,0.0015366531,0.0012940833,0.0023058206,0.0014150505],"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.00025706887,0.00014900306,0.001071663,0.00017187544,0.0001270949,0.000103772196,0.00013609647,0.57807314,0.010453435,0.01924981,0.008404017,0.38180307],"study_design_scores_gemma":[0.000007165891,0.000010368254,0.000055349876,0.0000045177167,0.0000036950184,0.000009707014,0.0000058618803,0.9916248,0.0012085363,0.006347009,0.0007187954,0.000004264125],"about_ca_topic_score_codex":0.00337885,"about_ca_topic_score_gemma":0.0041214353,"teacher_disagreement_score":0.00337885,"about_ca_system_score_codex":0.00076665246,"about_ca_system_score_gemma":0.0011434223,"threshold_uncertainty_score":0.010248005},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010746949,0.0024875135,0.99329185,0.0007466658,0.0002641437,0.000017958258,0.000051872346,0.0002619287,0.0018033747],"genre_scores_gemma":[0.05091028,0.012551613,0.9292134,0.000746284,0.0020044523,0.00011732552,0.00031236405,0.0005078122,0.0036364107],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985202,0.0003897931,0.00011011156,0.00021927577,0.0006947183,0.00006600865],"domain_scores_gemma":[0.9963613,0.0022885404,0.00017639351,0.0005875647,0.00049877196,0.00008741219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022237264,0.0012203994,0.0010862718,0.0017566477,0.0005512131,0.001963421,0.0011335214,0.001421864,0.0036100307],"category_scores_gemma":[0.010824829,0.0006159187,0.0008983005,0.0031049557,0.0022237909,0.004407116,0.0024417683,0.0040430417,0.0023434467],"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.00019480754,0.00007086832,0.00077095436,0.0006542386,0.000097676275,0.00030375665,0.00045046885,0.04534952,0.01712567,0.32399452,0.01347478,0.5975127],"study_design_scores_gemma":[0.000061302075,0.00022306229,0.00076852785,0.00031121017,0.00004973449,0.0009772899,0.0001476016,0.41856083,0.014915259,0.46516773,0.09869336,0.00012406113],"about_ca_topic_score_codex":0.0010612068,"about_ca_topic_score_gemma":0.00081504625,"teacher_disagreement_score":0.0036100307,"about_ca_system_score_codex":0.000512389,"about_ca_system_score_gemma":0.000737033,"threshold_uncertainty_score":0.012076795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009326106,0.0007782246,0.98840255,0.000065766224,0.000035473757,0.000021035872,0.000024078954,0.0002019177,0.0011449397],"genre_scores_gemma":[0.26125458,0.0023784772,0.7327638,0.00017639986,0.00019724653,0.00008483006,0.00015689778,0.00010750885,0.0028801912],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989599,0.00028920692,0.00004707236,0.00023957947,0.0004112345,0.000053102132],"domain_scores_gemma":[0.9984658,0.0009756976,0.00012238859,0.00017306251,0.00024013629,0.000022909211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010224266,0.0009463491,0.0006619513,0.0007021266,0.00024178221,0.00051991973,0.0005900613,0.0007828582,0.0008841968],"category_scores_gemma":[0.0038977396,0.00037571267,0.0005857375,0.0008287513,0.00065290456,0.0013800872,0.0009529005,0.00075479393,0.00048410697],"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.0003083099,0.00014774641,0.0018148128,0.00037098434,0.00019738308,0.00017180122,0.00021296475,0.2797216,0.10741129,0.017416837,0.0013388069,0.5908874],"study_design_scores_gemma":[0.000018579665,0.00023874256,0.0013754594,0.000026666912,0.00004765552,0.00032962262,0.000027400893,0.9484722,0.04273996,0.0036415819,0.003022443,0.000059738428],"about_ca_topic_score_codex":0.0016856061,"about_ca_topic_score_gemma":0.0024178457,"teacher_disagreement_score":0.0016856061,"about_ca_system_score_codex":0.00026160703,"about_ca_system_score_gemma":0.00061511976,"threshold_uncertainty_score":0.0054071546},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089589437,0.00012938131,0.99847513,0.00004001702,0.000030312396,0.000013782561,0.000025826139,0.00013295154,0.00025672725],"genre_scores_gemma":[0.0482971,0.00053970865,0.9476517,0.000092509545,0.00009747093,0.00009970343,0.000283601,0.00015414516,0.002784219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991171,0.0003030787,0.00005856792,0.00017944425,0.00028970407,0.000052137355],"domain_scores_gemma":[0.9989611,0.00043585134,0.00013415772,0.00010748228,0.00030755345,0.0000537095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001357106,0.0017351767,0.0006618289,0.00078871637,0.0005752087,0.0006445982,0.0006397323,0.0008451846,0.0026284417],"category_scores_gemma":[0.0034234768,0.00036635742,0.0011375551,0.0008039147,0.0008204592,0.001200037,0.0008229476,0.001494964,0.0018067016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003912838,0.00013375883,0.0005943077,0.00064368424,0.0001514253,0.0003230335,0.00036240215,0.1755357,0.109673694,0.04980463,0.009130785,0.6532553],"study_design_scores_gemma":[0.000016607857,0.0001407957,0.00036450438,0.00003408543,0.000028942968,0.00026919742,0.000037218306,0.9611393,0.012241109,0.016927652,0.008748961,0.000051594994],"about_ca_topic_score_codex":0.0030559958,"about_ca_topic_score_gemma":0.0030219636,"teacher_disagreement_score":0.0030559958,"about_ca_system_score_codex":0.00040593796,"about_ca_system_score_gemma":0.001248223,"threshold_uncertainty_score":0.008793056},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017251395,0.0003450479,0.9634048,0.00016768761,0.00013422061,0.00011485249,0.0012641036,0.015823396,0.0014945001],"genre_scores_gemma":[0.41521204,0.0006340531,0.5624028,0.00035257198,0.00010278215,0.00040120305,0.0070143864,0.0013331496,0.012547052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998807,0.000015392885,0.0000072786324,0.000037253183,0.000039435366,0.000019992249],"domain_scores_gemma":[0.999828,0.000056269124,0.000016998618,0.000032511452,0.000046911555,0.0000192199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004060111,0.00093139417,0.00039411624,0.00062278286,0.00025159784,0.0005146879,0.0012038946,0.0005266058,0.0048909443],"category_scores_gemma":[0.0014180149,0.00035525128,0.00059501705,0.000554491,0.00021742622,0.0010147324,0.0012466403,0.0011075109,0.0018897365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051221845,0.00021818187,0.003249808,0.0001835281,0.00016368472,0.0002206567,0.00009382883,0.07253994,0.028247261,0.0059460243,0.030507293,0.8581176],"study_design_scores_gemma":[0.000027257081,0.00007365353,0.00067421055,0.000013728391,0.00001901824,0.000115006726,0.000016476095,0.9767247,0.015153537,0.003810167,0.0033560407,0.00001619775],"about_ca_topic_score_codex":0.004902948,"about_ca_topic_score_gemma":0.010124231,"teacher_disagreement_score":0.004902948,"about_ca_system_score_codex":0.00046113724,"about_ca_system_score_gemma":0.0009980268,"threshold_uncertainty_score":0.016361833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4835875,0.00069001864,0.50427324,0.0003724628,0.0001205386,0.00009003162,0.00016612875,0.001151572,0.009548456],"genre_scores_gemma":[0.9410388,0.00021680276,0.05673298,0.00011826231,0.00003473025,0.0000482363,0.00004886222,0.000050144612,0.0017111147],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998091,0.000028993996,0.0000068543104,0.00004188472,0.00007804563,0.00003503195],"domain_scores_gemma":[0.99978393,0.000085100546,0.000055658445,0.00003773639,0.000022174137,0.000015378104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024796705,0.0002800379,0.00020327108,0.00021317945,0.00016450247,0.00044342154,0.00071351614,0.00032121813,0.0010505619],"category_scores_gemma":[0.00044236836,0.00016147326,0.00017188511,0.00020944171,0.0006319685,0.00055513164,0.0004597935,0.0003366646,0.00027771675],"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.00018228093,0.0000423928,0.00015814806,0.00008161653,0.00001611279,0.00011288663,0.00008109467,0.0068344306,0.94618803,0.017813642,0.00032241608,0.028166989],"study_design_scores_gemma":[0.00005683467,0.00024435628,0.0002883645,0.000011409006,0.000012914938,0.00018614536,0.000024266625,0.123016834,0.86578614,0.005368533,0.004965394,0.00003878894],"about_ca_topic_score_codex":0.0002900082,"about_ca_topic_score_gemma":0.00038786436,"teacher_disagreement_score":0.0010505619,"about_ca_system_score_codex":0.00028211364,"about_ca_system_score_gemma":0.00024912396,"threshold_uncertainty_score":0.0035144687},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00436067,0.00013975399,0.9919178,0.00018367583,0.000033294797,0.000048582533,0.000062950145,0.002656278,0.00059710967],"genre_scores_gemma":[0.28892803,0.00031262383,0.70462406,0.0007204842,0.00016907063,0.00039975456,0.00078840915,0.0013534445,0.0027041628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979231,0.00073746225,0.00011686455,0.0005350278,0.0005518277,0.00013582135],"domain_scores_gemma":[0.99276125,0.003995619,0.0005525155,0.0016541436,0.0007267668,0.00030967873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051637297,0.0014582569,0.0017196784,0.0011877923,0.001045214,0.0016174089,0.004048731,0.0021465588,0.00493314],"category_scores_gemma":[0.026934812,0.0009880809,0.0012215449,0.0013631671,0.0022840404,0.0032428333,0.0055552702,0.0039672246,0.002276034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033719974,0.00018681385,0.003905666,0.0003054395,0.00011963466,0.00022760441,0.00041851922,0.59906596,0.0054771537,0.04488373,0.009918081,0.33515427],"study_design_scores_gemma":[0.00002072565,0.000029891566,0.000099600176,0.00001059785,0.000005982072,0.00003223024,0.000014668654,0.9659918,0.0014258361,0.031281024,0.0010781335,0.000009463139],"about_ca_topic_score_codex":0.0045006867,"about_ca_topic_score_gemma":0.00544225,"teacher_disagreement_score":0.0051637297,"about_ca_system_score_codex":0.0014931699,"about_ca_system_score_gemma":0.0019142231,"threshold_uncertainty_score":0.027308762},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27721593,0.00027986142,0.7189473,0.0001694466,0.000036424048,0.00004556607,0.00009431627,0.0012326803,0.0019785403],"genre_scores_gemma":[0.847832,0.00016423601,0.15038179,0.00003574102,0.000026374495,0.00004175975,0.00004807724,0.000046341593,0.0014236565],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999782,0.0000384209,0.000009365181,0.00007253168,0.000080613776,0.000017035032],"domain_scores_gemma":[0.99942625,0.00014846255,0.00013779603,0.00010151047,0.0001478241,0.000038059676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028445883,0.00037977807,0.0001910737,0.00043269212,0.0003771371,0.00031460138,0.0005309782,0.00037314766,0.00074848934],"category_scores_gemma":[0.00074259844,0.000149448,0.00009459494,0.00033661455,0.00041221434,0.0008237396,0.0005346207,0.00047350395,0.00028459364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023129609,0.00009888622,0.0048741633,0.00010267704,0.000012924252,0.00015778,0.00018215874,0.0068111094,0.88699746,0.0028211952,0.0003980001,0.09731242],"study_design_scores_gemma":[0.000020804018,0.00034693672,0.0036027494,0.000011109854,0.000022034486,0.0004369893,0.00003722817,0.23019844,0.7622375,0.0016239515,0.0014241738,0.00003821277],"about_ca_topic_score_codex":0.0004728833,"about_ca_topic_score_gemma":0.00063588505,"teacher_disagreement_score":0.00074848934,"about_ca_system_score_codex":0.00021726046,"about_ca_system_score_gemma":0.00028437775,"threshold_uncertainty_score":0.0025039315},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002332224,0.093486324,0.7101232,0.0020920942,0.003315742,0.000038904076,0.00027366602,0.0012640607,0.18707372],"genre_scores_gemma":[0.06096845,0.09701371,0.41239923,0.0015850218,0.005394036,0.00020724261,0.0007415569,0.0011782421,0.4205125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995931,0.0000679785,0.00001538608,0.00009618676,0.0002066974,0.000020684618],"domain_scores_gemma":[0.99958295,0.00024881974,0.000019709418,0.000057594552,0.00007916232,0.000011844391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045255953,0.0013948048,0.0008690166,0.0013778979,0.0006019317,0.0025246055,0.0007987425,0.0011387005,0.0151252365],"category_scores_gemma":[0.0021468052,0.00058877375,0.00040237108,0.0026177943,0.002440362,0.0025433723,0.00089493446,0.0024031948,0.010325799],"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.000040932347,0.000029711406,0.00013198264,0.0003911583,0.000026088053,0.00007129673,0.00022360073,0.0052973004,0.004057524,0.5502433,0.08498171,0.3545054],"study_design_scores_gemma":[0.000008946451,0.00002574295,0.00053247623,0.00019620218,0.000020138887,0.00044386307,0.00014864227,0.019791678,0.0021254742,0.7059273,0.27073038,0.00004916158],"about_ca_topic_score_codex":0.00077452586,"about_ca_topic_score_gemma":0.0011039139,"teacher_disagreement_score":0.0151252365,"about_ca_system_score_codex":0.00040184936,"about_ca_system_score_gemma":0.00053120253,"threshold_uncertainty_score":0.05059898},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037189282,0.000942353,0.8660439,0.00068036444,0.0009782343,0.0001729444,0.00066139945,0.005374717,0.12142714],"genre_scores_gemma":[0.11964115,0.0026129899,0.46526048,0.0014450008,0.0012930144,0.0004900737,0.004849734,0.006170274,0.3982374],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986964,0.0001801458,0.00006769372,0.00046357376,0.00047842032,0.00011374218],"domain_scores_gemma":[0.99871993,0.0002609077,0.000050027957,0.0006091843,0.00031911914,0.000040905798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095371756,0.0010725198,0.00074277894,0.0012323967,0.00077557913,0.0022976692,0.001321259,0.0008713212,0.04676824],"category_scores_gemma":[0.0041851643,0.00044233105,0.0008266719,0.0008906327,0.001278055,0.0022811398,0.0026450986,0.0021106196,0.032108013],"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.00021300552,0.00008120904,0.00021837874,0.00032103393,0.000037059704,0.000096972755,0.00016509816,0.009024716,0.016752135,0.2522433,0.0674957,0.6533513],"study_design_scores_gemma":[0.000045355973,0.00009697465,0.00055696274,0.00020151684,0.00004779698,0.0006193124,0.00016328579,0.08159163,0.040969577,0.38746163,0.4881725,0.00007342046],"about_ca_topic_score_codex":0.0009704525,"about_ca_topic_score_gemma":0.00091236416,"teacher_disagreement_score":0.04676824,"about_ca_system_score_codex":0.00056649407,"about_ca_system_score_gemma":0.00083357934,"threshold_uncertainty_score":0.1564554},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0170163,0.0000571988,0.98213565,0.000052169675,0.000011072704,0.00000965983,0.000020262873,0.00014329686,0.00055430963],"genre_scores_gemma":[0.6242867,0.00030520782,0.3723348,0.00006295274,0.000037773356,0.000060213773,0.00017289493,0.00006409081,0.0026753743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996182,0.0001257754,0.000015491521,0.00006349149,0.00012754375,0.00004956166],"domain_scores_gemma":[0.9995043,0.00019705454,0.00009824461,0.000071078444,0.0001043111,0.00002501581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004113586,0.0010534709,0.000508869,0.0003152457,0.00019770877,0.00068738556,0.00061596243,0.0006122998,0.00071168324],"category_scores_gemma":[0.0016238188,0.00030134607,0.00062285323,0.00041196414,0.00065840967,0.0010483734,0.0007762438,0.00080141623,0.0003239355],"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.000111089896,0.000042096908,0.0010643516,0.00008453015,0.000050924726,0.00011129647,0.00007815718,0.90572506,0.025541378,0.011109578,0.0004369249,0.055644605],"study_design_scores_gemma":[0.0000023621967,0.000021841633,0.000099469224,0.0000018986559,0.000004272196,0.000020814163,0.000005863004,0.9960594,0.0025288279,0.0010603294,0.00018770032,0.0000072525236],"about_ca_topic_score_codex":0.0032493747,"about_ca_topic_score_gemma":0.002765533,"teacher_disagreement_score":0.0032493747,"about_ca_system_score_codex":0.00032522,"about_ca_system_score_gemma":0.00087076763,"threshold_uncertainty_score":0.006460905},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029482278,0.00018839464,0.9944939,0.00014547184,0.000039296,0.0000132260175,0.000097850236,0.00016498227,0.0019086879],"genre_scores_gemma":[0.31696713,0.00072859804,0.6703426,0.00038181435,0.00017281034,0.00014249465,0.00093693676,0.0004485549,0.009879009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993868,0.00016939885,0.000034464567,0.0001450892,0.00020009253,0.00006417961],"domain_scores_gemma":[0.99911374,0.00044756496,0.00007009565,0.00015732419,0.00017117702,0.000040070045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093640643,0.0010959352,0.0013091037,0.0006022806,0.0006218872,0.0013253979,0.0011978215,0.0010074559,0.004388191],"category_scores_gemma":[0.0038141536,0.0005956659,0.00083057873,0.0011291729,0.0008523011,0.0024295314,0.0017276898,0.001660189,0.0015473055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039382488,0.00014101791,0.00056029187,0.00030792097,0.00014525375,0.00017922252,0.00017748201,0.651618,0.013990839,0.111569665,0.011763884,0.20915261],"study_design_scores_gemma":[0.0000093925055,0.000010825038,0.00008684333,0.000009002868,0.000007035312,0.000028165818,0.000012824707,0.9623478,0.0009412768,0.035228427,0.0013059065,0.000012397835],"about_ca_topic_score_codex":0.004240798,"about_ca_topic_score_gemma":0.0075885984,"teacher_disagreement_score":0.004388191,"about_ca_system_score_codex":0.0005161485,"about_ca_system_score_gemma":0.0011105594,"threshold_uncertainty_score":0.014679909},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006575781,0.0004498861,0.001206659,0.0003950026,0.0003937438,0.00013164211,0.0008488676,0.0009902371,0.99492633],"genre_scores_gemma":[0.0009307742,0.00028174656,0.0006157797,0.00022204356,0.00006727024,0.00005933108,0.0004566147,0.00020918148,0.9971572],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992631,0.00006569069,0.00006865901,0.00026725777,0.00018726157,0.00014800704],"domain_scores_gemma":[0.99760926,0.0006815084,0.00012297698,0.00029837404,0.00063341204,0.00065446174],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011406998,0.002763163,0.0016382352,0.0029677066,0.0025714354,0.0036675623,0.0031348374,0.005201511,0.9868635],"category_scores_gemma":[0.0016589715,0.0009885314,0.0014397653,0.0025792462,0.0024120926,0.0049138665,0.0029198409,0.002453531,0.99086285],"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.0005256875,0.00021479077,0.0010917133,0.00072635553,0.00005704947,0.00035397577,0.00016221347,0.00067896594,0.0038844633,0.00754959,0.4135004,0.57125485],"study_design_scores_gemma":[0.000053693057,0.0001490787,0.00072829,0.00033657823,0.000017829412,0.00034174576,0.00017456812,0.00032567864,0.00057108724,0.00090488,0.9963683,0.000028273858],"about_ca_topic_score_codex":0.0049908957,"about_ca_topic_score_gemma":0.0038734293,"teacher_disagreement_score":0.013136506,"about_ca_system_score_codex":0.0011307498,"about_ca_system_score_gemma":0.0009686277,"threshold_uncertainty_score":0.018737555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9944115,0.000091384856,0.0042660316,0.000014619723,0.000006340614,0.000020551939,0.00004753552,0.00002839266,0.0011137155],"genre_scores_gemma":[0.99843866,0.000029957351,0.0012358112,0.000016508842,0.00000996849,0.000019481206,0.00003547353,0.00001700335,0.00019714652],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99974245,0.000043963097,0.000024093972,0.00006365714,0.000088663444,0.000037126814],"domain_scores_gemma":[0.99864835,0.0007853317,0.00024564925,0.00009803155,0.00014472686,0.00007798052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044079468,0.00029141977,0.00026134375,0.00046402056,0.00017844017,0.00045905114,0.00019454083,0.0003138375,0.0014366187],"category_scores_gemma":[0.0034251136,0.000121471094,0.00018531513,0.0003043149,0.00033947732,0.00041303862,0.0005525037,0.0004220341,0.00013785297],"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.0014751093,0.00022407336,0.02697958,0.0001626246,0.000047613205,0.00093452365,0.0008526362,0.0004720694,0.94306624,0.0006434725,0.00008518819,0.02505693],"study_design_scores_gemma":[0.000050325005,0.0014485809,0.8876648,0.000029750512,0.00011893807,0.0030738837,0.00071259326,0.008514112,0.09524685,0.0020410211,0.0010626412,0.000036566475],"about_ca_topic_score_codex":0.00029728966,"about_ca_topic_score_gemma":0.00035906647,"teacher_disagreement_score":0.0014366187,"about_ca_system_score_codex":0.00010883878,"about_ca_system_score_gemma":0.0000901284,"threshold_uncertainty_score":0.004805982},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7079055,0.00044874765,0.27764326,0.0017617116,0.00006164393,0.0008366493,0.00027840334,0.0008515568,0.010212549],"genre_scores_gemma":[0.9320926,0.0001226524,0.066006385,0.000100461366,0.000019178344,0.00011583629,0.00007923582,0.00002483543,0.0014387072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751794,0.0013300173,0.00011339051,0.00026509,0.00057821575,0.00019531492],"domain_scores_gemma":[0.992235,0.0055714375,0.00040646468,0.0007875591,0.00081922713,0.00018026814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003639848,0.0006342573,0.00047370343,0.0009543838,0.0010775647,0.0013027603,0.0013787498,0.0020318823,0.0010577379],"category_scores_gemma":[0.0076337014,0.0002596388,0.0004759734,0.0007982825,0.0013566628,0.0019026698,0.001292301,0.0012834838,0.00024900926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008357615,0.0017438312,0.031238165,0.00055692095,0.00015339737,0.0048556332,0.0023891423,0.79464734,0.013542966,0.024507668,0.0032044677,0.12232475],"study_design_scores_gemma":[0.00006833743,0.0003426972,0.0026046762,0.000040098294,0.00002682725,0.00052989164,0.00063031394,0.9747526,0.012950729,0.005077078,0.0029465253,0.000030173738],"about_ca_topic_score_codex":0.0073762713,"about_ca_topic_score_gemma":0.0067066327,"teacher_disagreement_score":0.0073762713,"about_ca_system_score_codex":0.0013758535,"about_ca_system_score_gemma":0.0011678982,"threshold_uncertainty_score":0.019249558},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04993921,0.00037013539,0.9454215,0.00014503823,0.00016754869,0.00004927656,0.0001719334,0.0017567445,0.001978508],"genre_scores_gemma":[0.8190635,0.00033192537,0.17160814,0.00021634852,0.00011677072,0.00011648844,0.0010900315,0.00015073158,0.0073061483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996575,0.000043719967,0.000019202114,0.00013495085,0.00008655637,0.000058160156],"domain_scores_gemma":[0.99967265,0.00006485084,0.000038220205,0.00006313026,0.00014074199,0.000020412957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005256377,0.0010875982,0.0005880943,0.0006398073,0.00019750754,0.00058667007,0.0010859236,0.0006851644,0.0010746092],"category_scores_gemma":[0.0013532586,0.00029412366,0.0006946354,0.0005323609,0.00027463815,0.0011569308,0.001069834,0.000988158,0.0009780844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028031555,0.00022412927,0.0019847183,0.00012459788,0.00011588297,0.00012507981,0.000110720866,0.165209,0.06609934,0.0032305948,0.004473705,0.75802195],"study_design_scores_gemma":[0.0000070843535,0.000053715812,0.00074876373,0.000005447075,0.000017698938,0.000044501405,0.000015266782,0.9840171,0.012414063,0.0015035012,0.0011600388,0.000012893492],"about_ca_topic_score_codex":0.0034740716,"about_ca_topic_score_gemma":0.003978217,"teacher_disagreement_score":0.0034740716,"about_ca_system_score_codex":0.0003188766,"about_ca_system_score_gemma":0.0005538318,"threshold_uncertainty_score":0.006907642},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034522973,0.00007768658,0.99468,0.000104251885,0.000020282865,0.000020236204,0.00004193887,0.0001079341,0.0014954085],"genre_scores_gemma":[0.36244637,0.00054591254,0.6254465,0.00041524263,0.00009953152,0.00056254276,0.00064821733,0.00032837997,0.009507314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928075,0.00029287362,0.000027414488,0.00015162642,0.00018133571,0.00006606429],"domain_scores_gemma":[0.99884087,0.00067408825,0.00013171074,0.000057880177,0.00023502717,0.00006045543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012803558,0.0014273395,0.0010567815,0.00037319888,0.00031246713,0.0012506865,0.0011112208,0.0010980347,0.00272294],"category_scores_gemma":[0.0026024177,0.0006987619,0.0008332156,0.0006093558,0.0008341789,0.0011374208,0.0013861603,0.001775629,0.0006477553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059807444,0.00004878079,0.00028982048,0.00013176641,0.00003152024,0.0001193491,0.00007764683,0.9584029,0.002498135,0.014634977,0.0019584342,0.021746876],"study_design_scores_gemma":[0.0000066364205,0.000019726887,0.000016888966,0.0000034082288,0.0000021245,0.000009865424,0.0000071191203,0.99771154,0.00020392984,0.0016882855,0.00032700252,0.0000033767396],"about_ca_topic_score_codex":0.0029728992,"about_ca_topic_score_gemma":0.0022421957,"teacher_disagreement_score":0.0029728992,"about_ca_system_score_codex":0.000484756,"about_ca_system_score_gemma":0.0014005803,"threshold_uncertainty_score":0.009109199},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077651635,0.00048408273,0.92042327,0.00017992673,0.00004306763,0.000063276704,0.00015588998,0.00026855656,0.00073026447],"genre_scores_gemma":[0.9093384,0.000745514,0.08694055,0.00009596825,0.00008732553,0.00015729167,0.00047919198,0.000074569,0.0020811197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961543,0.00012458816,0.000020632575,0.00010137478,0.00009585951,0.000042109077],"domain_scores_gemma":[0.9991917,0.00040323735,0.00013139035,0.000074635995,0.00016326332,0.000035788034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012377134,0.00062297075,0.0005510408,0.0007540855,0.00032506403,0.0006514436,0.0007925761,0.0005756327,0.00087658997],"category_scores_gemma":[0.0036251906,0.0002977537,0.00120589,0.0007223437,0.00057579536,0.0007944487,0.0006106942,0.0006726133,0.00032780235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029097672,0.000112541034,0.016578333,0.00013051764,0.0002292968,0.00035581854,0.00041645626,0.814816,0.012860516,0.019656349,0.0019094925,0.13264373],"study_design_scores_gemma":[0.0000030619808,0.0000137706975,0.0014179407,0.0000047762082,0.0000107750175,0.000028343078,0.000009104219,0.9956976,0.0002175828,0.0023831578,0.00020632411,0.0000074786562],"about_ca_topic_score_codex":0.007819898,"about_ca_topic_score_gemma":0.0068736533,"teacher_disagreement_score":0.007819898,"about_ca_system_score_codex":0.0005103097,"about_ca_system_score_gemma":0.0006219954,"threshold_uncertainty_score":0.015548766},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063261203,0.00025307215,0.99150074,0.00018729833,0.000040917894,0.000021797789,0.000074544914,0.00029854616,0.0012969176],"genre_scores_gemma":[0.5797289,0.0012814152,0.41173938,0.0004330705,0.00025894295,0.00014961409,0.00070863037,0.00013701538,0.005563019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990884,0.00027426274,0.000034683435,0.00014285425,0.00031313245,0.000146685],"domain_scores_gemma":[0.9983259,0.0007252955,0.00021549095,0.00023344389,0.00040256899,0.00009720768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010274681,0.0011910559,0.00090676744,0.00043723357,0.00048767624,0.00079687877,0.001197396,0.00085992547,0.0019488661],"category_scores_gemma":[0.0042918134,0.0005476022,0.0007186216,0.0009057442,0.00092882017,0.0017816798,0.0014220617,0.002058767,0.0008236184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041671685,0.00012215659,0.0019359277,0.00024859072,0.00012606288,0.00029820844,0.00031278172,0.70670515,0.01900605,0.031667747,0.0067839636,0.23237664],"study_design_scores_gemma":[0.000008267749,0.000030535564,0.00012715862,0.00000810833,0.000010518086,0.000046096473,0.000013686704,0.9938047,0.0018860121,0.0033372834,0.00071141956,0.000016199032],"about_ca_topic_score_codex":0.01018437,"about_ca_topic_score_gemma":0.011156475,"teacher_disagreement_score":0.01018437,"about_ca_system_score_codex":0.00064275996,"about_ca_system_score_gemma":0.0017425233,"threshold_uncertainty_score":0.020250201},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068282173,0.000068773326,0.99203,0.00005774463,0.000011955675,0.000021947928,0.0000076515735,0.00030238717,0.000671352],"genre_scores_gemma":[0.53537005,0.000142476,0.46187237,0.00016991596,0.000046916128,0.00016322576,0.00006481734,0.00013883486,0.0020314462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994974,0.00015268619,0.000026018448,0.00011913914,0.00015468031,0.00005009231],"domain_scores_gemma":[0.9987029,0.0008132403,0.00013702975,0.00010090498,0.00020829705,0.00003755758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014243455,0.0008183526,0.0007407495,0.00038632646,0.00035183082,0.0006070724,0.00089490163,0.00084012566,0.0015347442],"category_scores_gemma":[0.0036790369,0.0004425875,0.0004264891,0.0003716367,0.0008364875,0.0007356107,0.00083196844,0.0011896045,0.00045757322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092458366,0.00008058589,0.0006266439,0.00006956723,0.000041058174,0.00005030193,0.000055884604,0.850287,0.008362208,0.005116399,0.0007787112,0.1344391],"study_design_scores_gemma":[0.0000042289485,0.000015077422,0.000048870792,0.0000022399627,0.0000018288999,0.00000498891,0.0000015568148,0.9981792,0.0007298451,0.00084181246,0.00016751557,0.0000028768382],"about_ca_topic_score_codex":0.0039211824,"about_ca_topic_score_gemma":0.0039610076,"teacher_disagreement_score":0.0039211824,"about_ca_system_score_codex":0.00049863046,"about_ca_system_score_gemma":0.0011198337,"threshold_uncertainty_score":0.007796705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011303643,0.00011115598,0.98747826,0.0001323494,0.000020222458,0.0000100801835,0.000021278092,0.00047099253,0.00045205644],"genre_scores_gemma":[0.7670442,0.00026091447,0.22872445,0.0002503124,0.00011121707,0.00011891025,0.00022940448,0.00017784271,0.0030828118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992016,0.0003361997,0.00004397595,0.00016434063,0.00017788465,0.00007612928],"domain_scores_gemma":[0.99616504,0.0027144381,0.0002729537,0.00038854935,0.00040225807,0.00005677405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027879886,0.0011912148,0.00089604413,0.00066055724,0.00034410966,0.0011343921,0.0015321668,0.0012744563,0.0011074292],"category_scores_gemma":[0.008917416,0.0006395659,0.00081330806,0.0007363408,0.0012237675,0.0022801005,0.0012652152,0.002352031,0.00052836176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015362406,0.00011338724,0.000758828,0.000042887317,0.00007691417,0.00003565745,0.000052691663,0.9181208,0.0039170007,0.0070450297,0.0005252693,0.06915793],"study_design_scores_gemma":[0.0000032014334,0.0000131501965,0.00006762859,0.00000173829,0.000002651729,0.0000049988494,0.0000015911185,0.9974331,0.00080384925,0.0015863293,0.00007737015,0.0000043035325],"about_ca_topic_score_codex":0.003548378,"about_ca_topic_score_gemma":0.0027239567,"teacher_disagreement_score":0.003548378,"about_ca_system_score_codex":0.00059973955,"about_ca_system_score_gemma":0.00071299076,"threshold_uncertainty_score":0.014744461},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053950086,0.0006377203,0.9400592,0.00046052568,0.00006338521,0.000037478647,0.00028293076,0.0029678447,0.0015408044],"genre_scores_gemma":[0.90701413,0.0003051955,0.088617,0.00034628957,0.00008114084,0.00007259434,0.0009140995,0.00012872029,0.002520882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99955934,0.000089463116,0.000020544418,0.00013763101,0.00013131165,0.00006179826],"domain_scores_gemma":[0.9988707,0.000548386,0.00011550757,0.00015156869,0.000252152,0.000061657636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094435946,0.0012177321,0.0007790375,0.00049140863,0.00035830546,0.0005863003,0.001638431,0.00089368067,0.0011539694],"category_scores_gemma":[0.0042668926,0.0004822118,0.0005721306,0.000522669,0.0007159031,0.0016399558,0.0012275869,0.0022092126,0.00044133284],"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.0003550961,0.0001789224,0.00540216,0.00009185242,0.00008159736,0.00011869811,0.000102585625,0.73660165,0.006859121,0.0043613655,0.004780608,0.24106632],"study_design_scores_gemma":[0.0000028937366,0.000011323075,0.00014549111,0.0000026807597,0.000003901617,0.000008172243,0.0000028328834,0.9973431,0.00076899206,0.0015864464,0.00012169901,0.0000024531976],"about_ca_topic_score_codex":0.013466476,"about_ca_topic_score_gemma":0.014282216,"teacher_disagreement_score":0.013466476,"about_ca_system_score_codex":0.0010300359,"about_ca_system_score_gemma":0.0012525897,"threshold_uncertainty_score":0.026776195},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023994618,0.00042141796,0.99199134,0.000099310804,0.000110406334,0.000033624798,0.00013079082,0.0018030372,0.0030106355],"genre_scores_gemma":[0.032849293,0.00077684666,0.95234334,0.00012428645,0.00014877722,0.00008124518,0.0002022558,0.00041990448,0.013053984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998839,0.000026026672,0.0000053275658,0.000022228527,0.000054273325,0.000008227435],"domain_scores_gemma":[0.9997718,0.000120422854,0.000010045843,0.000028501749,0.00005902507,0.000010348365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003086107,0.00066780724,0.00041655404,0.0004317037,0.00018946253,0.0005852347,0.00068273937,0.0010456747,0.009466807],"category_scores_gemma":[0.0009281222,0.00023533992,0.00036143343,0.0010142346,0.00021749796,0.00034150336,0.0008207376,0.0006842851,0.003793414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021919157,0.0000791493,0.00026771676,0.0002367333,0.000042673015,0.00024596706,0.000082146995,0.043449316,0.09315175,0.0100005735,0.017308949,0.8349158],"study_design_scores_gemma":[0.000042220774,0.000101189406,0.001048416,0.000041693405,0.000028818464,0.00074253243,0.000027657099,0.9006499,0.04872147,0.008295866,0.040258076,0.00004219948],"about_ca_topic_score_codex":0.0014868142,"about_ca_topic_score_gemma":0.0023608115,"teacher_disagreement_score":0.009466807,"about_ca_system_score_codex":0.00016416573,"about_ca_system_score_gemma":0.00034083612,"threshold_uncertainty_score":0.031669617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013394427,0.02442175,0.80949914,0.0006910693,0.0024106244,0.000038449383,0.0003437519,0.0018010332,0.15945475],"genre_scores_gemma":[0.04329803,0.053230435,0.46708727,0.00096774084,0.0045842766,0.0002237949,0.0014710311,0.0019539872,0.42718345],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960655,0.000064987704,0.000021292835,0.000059116708,0.00022922519,0.000018776405],"domain_scores_gemma":[0.9995585,0.00022072866,0.000019733026,0.00008895921,0.00009803598,0.000013885508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000365806,0.001267029,0.0011182447,0.0010660681,0.00025026334,0.0020704218,0.0006210763,0.00080816523,0.026786922],"category_scores_gemma":[0.0011307423,0.00041165593,0.0005034668,0.0023275553,0.00088805833,0.00128256,0.00085355795,0.0022510546,0.020992622],"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.0000581965,0.000051535,0.0000958025,0.0007974833,0.00006116724,0.00012931802,0.00012664468,0.013515746,0.0126547925,0.28629798,0.11686975,0.56934166],"study_design_scores_gemma":[0.000021900769,0.000106058775,0.0006667011,0.00030244672,0.000045219003,0.00071102194,0.000039127663,0.08496364,0.009817832,0.3391462,0.5641116,0.00006826967],"about_ca_topic_score_codex":0.00039087486,"about_ca_topic_score_gemma":0.0006367963,"teacher_disagreement_score":0.026786922,"about_ca_system_score_codex":0.00032208994,"about_ca_system_score_gemma":0.00053337094,"threshold_uncertainty_score":0.08961117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033491342,0.0047141514,0.9791597,0.00024809325,0.0003427056,0.00001702063,0.00012910295,0.00087723805,0.011162849],"genre_scores_gemma":[0.16012467,0.011581721,0.7333517,0.0003496008,0.0004960021,0.00012491325,0.00082540227,0.00071769895,0.09242824],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998404,0.000029135383,0.000009507085,0.0000324199,0.000071219816,0.000017249471],"domain_scores_gemma":[0.9997851,0.00011351932,0.000011011608,0.000028205444,0.00005439911,0.000007887659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030111376,0.00077803887,0.0004779873,0.00029865923,0.00023352516,0.0007901577,0.000890231,0.00092691806,0.0048095384],"category_scores_gemma":[0.0011366263,0.00046209234,0.00035085744,0.0008099901,0.00046971292,0.0012255744,0.0006628462,0.0017107715,0.002694264],"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.00007913621,0.000064214444,0.00016260878,0.00036741543,0.000044647233,0.000067696536,0.000053799766,0.27580264,0.012853068,0.0708123,0.021402078,0.6182904],"study_design_scores_gemma":[0.0000061306982,0.000021399097,0.00012584374,0.00004827883,0.000014642544,0.000039942497,0.000006332804,0.9242926,0.0066229007,0.052278824,0.016529784,0.000013274639],"about_ca_topic_score_codex":0.0026786535,"about_ca_topic_score_gemma":0.0050003123,"teacher_disagreement_score":0.0048095384,"about_ca_system_score_codex":0.00047475632,"about_ca_system_score_gemma":0.00042378576,"threshold_uncertainty_score":0.016089499},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017754946,0.0003442879,0.9787188,0.00030256016,0.0001353254,0.000028457138,0.00008142559,0.0009309591,0.0017031741],"genre_scores_gemma":[0.84946054,0.0003169803,0.14441825,0.00031129346,0.00014347452,0.00007155718,0.0003073621,0.00010994154,0.00486052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996408,0.000067883986,0.000019330042,0.00012755055,0.00008796376,0.00005653628],"domain_scores_gemma":[0.9987777,0.0006943033,0.00009165647,0.00009399895,0.00029824986,0.000044114906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006498809,0.0008528502,0.00087992515,0.0004953827,0.00039350355,0.00091763603,0.0012627767,0.0013288662,0.0026195094],"category_scores_gemma":[0.0031299505,0.0004324212,0.00047834942,0.00076005765,0.0005560006,0.0013758405,0.0008785383,0.0015958643,0.000727577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037778736,0.00022817698,0.0010289138,0.00010851965,0.0000820458,0.00013118962,0.00008269514,0.65551895,0.007904156,0.0070646005,0.0040868917,0.323386],"study_design_scores_gemma":[0.0000025690667,0.000006099959,0.00005372966,0.0000017253656,0.0000027522294,0.0000059971126,0.0000017895748,0.9987091,0.00030919284,0.0008474449,0.00005723803,0.000002306248],"about_ca_topic_score_codex":0.011893326,"about_ca_topic_score_gemma":0.014797847,"teacher_disagreement_score":0.011893326,"about_ca_system_score_codex":0.0006582108,"about_ca_system_score_gemma":0.0009141376,"threshold_uncertainty_score":0.023648202},"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":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009968966,0.6416387,0.013674231,0.17609331,0.0461761,0.000045853743,0.0038428712,0.0009810822,0.11655099],"genre_scores_gemma":[0.01768149,0.22861128,0.012517,0.019250926,0.02216344,0.00010551437,0.0030190274,0.0013720711,0.69527924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99955696,0.00008876873,0.00003241269,0.00008213227,0.00019770378,0.00004201652],"domain_scores_gemma":[0.9989549,0.00033812123,0.00006851083,0.000055577402,0.00040086661,0.00018206783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010905255,0.0010825281,0.0006350194,0.0021149083,0.001359136,0.002365774,0.0008129807,0.0020693964,0.09046258],"category_scores_gemma":[0.002927244,0.0007099761,0.00036700533,0.0018406134,0.0014363677,0.0039913603,0.0014617048,0.002621906,0.058707044],"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.00001873518,0.000003117879,0.00007211345,0.00006864688,0.0000032728735,0.000020532976,0.000070143484,0.00004231176,0.00006490783,0.006490607,0.9394764,0.05366929],"study_design_scores_gemma":[0.000005473385,0.0000049527953,0.00047013137,0.00014655454,0.000004030521,0.00007188556,0.0000720428,0.000055656394,0.000118157885,0.0073687267,0.99167377,0.000008675126],"about_ca_topic_score_codex":0.01848591,"about_ca_topic_score_gemma":0.075832166,"teacher_disagreement_score":0.09046258,"about_ca_system_score_codex":0.0016459501,"about_ca_system_score_gemma":0.0013472884,"threshold_uncertainty_score":0.3026275},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021304092,0.00011080199,0.99649894,0.00008040578,0.000017980761,0.000019510006,0.000017453665,0.00014570121,0.0009787865],"genre_scores_gemma":[0.28103095,0.00035115192,0.7119459,0.0003215444,0.000094734874,0.00040910827,0.00018026982,0.00019431919,0.0054719998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994672,0.00021717715,0.000022579543,0.00012229993,0.00010425701,0.0000664198],"domain_scores_gemma":[0.99941516,0.00030117642,0.000053359905,0.00005390925,0.0001321057,0.00004428377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001523534,0.0010605697,0.0012117369,0.00072407594,0.00046548474,0.00087526045,0.0023108437,0.0015131624,0.0039302837],"category_scores_gemma":[0.0023001386,0.0006172892,0.00080874306,0.0008216242,0.001032991,0.0013548009,0.0014288424,0.0014384668,0.0006827309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052009942,0.00004624206,0.00033003758,0.0000827458,0.000042860906,0.00006382293,0.00007172855,0.8931142,0.0019311096,0.047571443,0.0024477956,0.05424604],"study_design_scores_gemma":[0.0000104216015,0.000018603034,0.000022751758,0.000004956035,0.000004076327,0.000009426974,0.0000045256793,0.9923981,0.00016557002,0.0067778165,0.0005799574,0.0000037991197],"about_ca_topic_score_codex":0.005419114,"about_ca_topic_score_gemma":0.0043134284,"teacher_disagreement_score":0.005419114,"about_ca_system_score_codex":0.0009011368,"about_ca_system_score_gemma":0.0015595676,"threshold_uncertainty_score":0.013148069},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018257359,0.00017565969,0.9961947,0.00013328166,0.00004122578,0.000023226308,0.000032717133,0.00049764453,0.0010758367],"genre_scores_gemma":[0.16115046,0.0005358002,0.83059174,0.00027057077,0.00014944733,0.00024653663,0.00028686703,0.00033743994,0.006431148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991868,0.00036319092,0.00004046225,0.0001339888,0.00019433016,0.00008119837],"domain_scores_gemma":[0.9986713,0.0008337532,0.00008541956,0.0001079018,0.00024947128,0.000052073006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013405419,0.001238014,0.0012715244,0.00060644525,0.0006473301,0.0010990567,0.0013659052,0.0015887755,0.004243656],"category_scores_gemma":[0.0041265697,0.00084782863,0.00097366853,0.00068250025,0.0010485636,0.0012673803,0.001328262,0.0024706537,0.0016051518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014328894,0.000029561339,0.00054500403,0.0001300705,0.00010924274,0.00011272489,0.00008415734,0.8785977,0.004609754,0.023530686,0.0040751332,0.088032685],"study_design_scores_gemma":[0.0000073712467,0.0000074223112,0.000032454496,0.0000042616243,0.000003873938,0.000016331289,0.0000032478351,0.9949108,0.000872239,0.0032222916,0.0009129081,0.0000068756212],"about_ca_topic_score_codex":0.0038612483,"about_ca_topic_score_gemma":0.004093797,"teacher_disagreement_score":0.004243656,"about_ca_system_score_codex":0.00067432516,"about_ca_system_score_gemma":0.001756075,"threshold_uncertainty_score":0.014196396},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5919301,0.0002987573,0.40440014,0.00027241933,0.00007218418,0.00037257775,0.00008377601,0.0008348988,0.0017352048],"genre_scores_gemma":[0.90966475,0.00014112882,0.08868822,0.00006300113,0.0000358572,0.000112710164,0.000081517705,0.000033013424,0.0011798767],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986082,0.0005477225,0.00007021161,0.00028594298,0.00038712926,0.00010081731],"domain_scores_gemma":[0.99701786,0.0012951507,0.00024733393,0.00035481495,0.0009538733,0.00013089861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024773546,0.00070974854,0.0005694933,0.00071270135,0.00033548122,0.0005395959,0.0007735209,0.0010424763,0.00077369565],"category_scores_gemma":[0.0032065974,0.00026007186,0.00035230877,0.00044250078,0.0006897805,0.0016124808,0.0006314832,0.00065461174,0.00022648316],"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.0022669365,0.0048962673,0.030594023,0.0011055813,0.00025419952,0.00071595085,0.0018321525,0.11848187,0.3384665,0.004179964,0.002466329,0.49474025],"study_design_scores_gemma":[0.00045329146,0.014559773,0.03765066,0.00010583438,0.0001772301,0.0010934246,0.00117522,0.6588199,0.2750927,0.002748994,0.007934336,0.00018870419],"about_ca_topic_score_codex":0.001764264,"about_ca_topic_score_gemma":0.001257116,"teacher_disagreement_score":0.0024773546,"about_ca_system_score_codex":0.000435246,"about_ca_system_score_gemma":0.00060447946,"threshold_uncertainty_score":0.013101637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052820486,0.0001840828,0.992739,0.00019461663,0.000026941325,0.000047891164,0.00050526723,0.0006758076,0.00034444925],"genre_scores_gemma":[0.25626764,0.00045863847,0.736429,0.00032932323,0.000120212564,0.0006722385,0.0018948307,0.0010628703,0.0027652609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555594,0.0023568298,0.0002452656,0.0009657368,0.00067595916,0.00020023092],"domain_scores_gemma":[0.9841993,0.011782158,0.0012899957,0.001629536,0.0008568417,0.00024223294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010871714,0.0010953471,0.0015650972,0.0020024297,0.0006184903,0.002020267,0.0028195733,0.001894851,0.0064167376],"category_scores_gemma":[0.041246835,0.0009889563,0.003729381,0.00219946,0.0012183365,0.0017842097,0.0030824493,0.0034837422,0.0015987182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009159899,0.00020594733,0.01608935,0.001280712,0.0026635039,0.00058516697,0.0012557227,0.47488526,0.017754372,0.16524363,0.015491496,0.3036288],"study_design_scores_gemma":[0.00008348088,0.000104256505,0.005984374,0.000120280136,0.00023016731,0.00011823887,0.00006502521,0.8222601,0.0023939672,0.16258183,0.005962259,0.00009608343],"about_ca_topic_score_codex":0.010904483,"about_ca_topic_score_gemma":0.017045038,"teacher_disagreement_score":0.010904483,"about_ca_system_score_codex":0.001010891,"about_ca_system_score_gemma":0.0016396522,"threshold_uncertainty_score":0.057495773},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014839001,0.0001890263,0.9973278,0.00021429271,0.000029628414,0.000026638338,0.00006308677,0.00016741961,0.0004980483],"genre_scores_gemma":[0.26731405,0.0027273386,0.70855594,0.00073392125,0.00066813076,0.0007221195,0.0013653362,0.0006621599,0.017251058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966832,0.0017819424,0.00016757201,0.0004462465,0.0007242263,0.00019690502],"domain_scores_gemma":[0.9817648,0.014575153,0.0005442531,0.0013387668,0.0015381193,0.00023900706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006812121,0.0023977526,0.002784941,0.0015137467,0.0007946467,0.0027950665,0.003451081,0.0028826226,0.004254696],"category_scores_gemma":[0.0438467,0.0029579743,0.0018362873,0.0026431005,0.0030533033,0.0049675596,0.005346945,0.0041398066,0.0027550103],"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.00066473463,0.00016836029,0.001965663,0.0006153157,0.00024093305,0.0004451166,0.00030762234,0.60759324,0.003732301,0.21865936,0.010342084,0.15526521],"study_design_scores_gemma":[0.000023160295,0.000019619798,0.00015485151,0.000020412612,0.000018304325,0.00009916273,0.000016633743,0.9543066,0.0007131693,0.043725245,0.0008838513,0.000018917633],"about_ca_topic_score_codex":0.0056507536,"about_ca_topic_score_gemma":0.0032696333,"teacher_disagreement_score":0.006812121,"about_ca_system_score_codex":0.001347035,"about_ca_system_score_gemma":0.0024206787,"threshold_uncertainty_score":0.03602642},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002105984,0.00019666899,0.9951885,0.0001021801,0.00010821928,0.00001859956,0.000030256215,0.00024468472,0.0020050053],"genre_scores_gemma":[0.070543066,0.00038401198,0.91659886,0.00013798659,0.00019154782,0.00016205078,0.00021313183,0.0003116862,0.011457675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996989,0.00010985847,0.000012060249,0.00005007709,0.00010861286,0.000020566595],"domain_scores_gemma":[0.9996018,0.00018375216,0.000027217671,0.000038724127,0.00012138235,0.000027114767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006600995,0.00071618974,0.00082942395,0.0003263045,0.00026964236,0.00092366495,0.00081262825,0.0011863755,0.0060430523],"category_scores_gemma":[0.0021326176,0.00045135603,0.00046196638,0.00043012985,0.000442393,0.0011387976,0.0011367183,0.0021812567,0.0028720635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002789005,0.00015754212,0.0003685363,0.00051037053,0.00007350639,0.00014659564,0.00015451384,0.31782052,0.01226989,0.114388935,0.028497549,0.5253331],"study_design_scores_gemma":[0.000010386965,0.000031291493,0.00003731992,0.000012203138,0.0000044854023,0.000034476267,0.0000065355575,0.98645186,0.0008378037,0.0093889,0.0031794636,0.000005232621],"about_ca_topic_score_codex":0.0008641741,"about_ca_topic_score_gemma":0.0014947519,"teacher_disagreement_score":0.0060430523,"about_ca_system_score_codex":0.00026257758,"about_ca_system_score_gemma":0.0006680867,"threshold_uncertainty_score":0.020215988},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008893244,0.0002654259,0.98776335,0.00005466747,0.00006769892,0.000038917282,0.000060277416,0.0017694923,0.0010868965],"genre_scores_gemma":[0.44483596,0.00048138225,0.54350287,0.0002745067,0.000102189,0.00012930225,0.0004943307,0.0003943434,0.009785098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973434,0.00006297132,0.000016689875,0.00006300712,0.00009542077,0.000027576902],"domain_scores_gemma":[0.9996258,0.00011976281,0.000032500477,0.00003867862,0.00015979455,0.000023444516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076306716,0.0006139123,0.0004265566,0.00042145277,0.00019004857,0.0004323845,0.001055579,0.0006659755,0.0026878768],"category_scores_gemma":[0.0012840354,0.00025959572,0.00042046615,0.00035869234,0.00028918567,0.0009089863,0.00088735373,0.0009201488,0.0009981185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041157994,0.00021713338,0.0006427347,0.00014546119,0.00011129543,0.00008613985,0.000046024747,0.10364588,0.04223822,0.0033096557,0.0042019566,0.844944],"study_design_scores_gemma":[0.000012919752,0.00008611653,0.0001961399,0.0000067162955,0.000020060565,0.00004548334,0.000005116627,0.9849104,0.01291046,0.0007783409,0.0010185288,0.000009758164],"about_ca_topic_score_codex":0.0018614163,"about_ca_topic_score_gemma":0.003676215,"teacher_disagreement_score":0.0026878768,"about_ca_system_score_codex":0.0002903673,"about_ca_system_score_gemma":0.0004569061,"threshold_uncertainty_score":0.0089918375},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032639285,0.00011355296,0.9950525,0.000111770416,0.000014320632,0.000013939447,0.000025677497,0.00024197914,0.0011623969],"genre_scores_gemma":[0.39165264,0.00060732965,0.6019561,0.00020673906,0.00010777362,0.00013459503,0.00022782951,0.00018161538,0.0049254256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993444,0.00027077622,0.000018853776,0.000071933944,0.0002487817,0.000045245633],"domain_scores_gemma":[0.99871457,0.0008379736,0.00009762176,0.00012500145,0.00018537161,0.0000394326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012303413,0.0006987732,0.00068168057,0.00064556004,0.0003469437,0.0009416187,0.0007469663,0.0011645716,0.0026220845],"category_scores_gemma":[0.005250601,0.00035128335,0.0005957326,0.0007643,0.00096868497,0.0016421637,0.0017972242,0.0012685637,0.0009406951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042806714,0.00010036953,0.00057484524,0.00024455023,0.00011056834,0.00013171903,0.000111022055,0.66027415,0.016882813,0.10595684,0.0039475076,0.21123752],"study_design_scores_gemma":[0.000016402253,0.000027713231,0.00006450245,0.000009949549,0.0000068613504,0.00004672433,0.0000059294307,0.9737028,0.003324421,0.021622669,0.0011599038,0.000012264081],"about_ca_topic_score_codex":0.0019720185,"about_ca_topic_score_gemma":0.0015913313,"teacher_disagreement_score":0.0026220845,"about_ca_system_score_codex":0.00052918406,"about_ca_system_score_gemma":0.0010707169,"threshold_uncertainty_score":0.008771777},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048292938,0.000033615917,0.9992704,0.000015237217,0.000007686358,0.000005554755,0.0000059058143,0.00005894069,0.00011960565],"genre_scores_gemma":[0.043960106,0.00024608738,0.95401216,0.000059457638,0.00005350236,0.00008824027,0.00010826311,0.000091372014,0.0013808116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907255,0.0002834112,0.000059428607,0.00020237072,0.00034448458,0.000037736918],"domain_scores_gemma":[0.998912,0.00047224213,0.00013511487,0.00013798873,0.00031387358,0.000028726328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013840813,0.0010184534,0.000777761,0.00076452177,0.00036551856,0.0008137116,0.0008678296,0.0009559181,0.0015396797],"category_scores_gemma":[0.0037524393,0.00046670233,0.00093705027,0.00074999477,0.0007044399,0.0009475166,0.000724115,0.0013823918,0.00092645193],"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.000154971,0.000086009975,0.00049289525,0.00028513232,0.00015661107,0.000110589914,0.00014325108,0.5515559,0.044098705,0.043146696,0.0025209067,0.35724843],"study_design_scores_gemma":[0.000009439722,0.000048492428,0.00010653374,0.000011769342,0.000016049104,0.000061596285,0.000008613205,0.9826985,0.0070213275,0.0058772597,0.0041201864,0.000020262345],"about_ca_topic_score_codex":0.0013415017,"about_ca_topic_score_gemma":0.0014762692,"teacher_disagreement_score":0.0015396797,"about_ca_system_score_codex":0.00048872374,"about_ca_system_score_gemma":0.0009630779,"threshold_uncertainty_score":0.007319808},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000513942,0.000017661096,0.99897146,0.00001809137,0.000010728231,0.00000771498,0.0000086146565,0.00015268357,0.00029912047],"genre_scores_gemma":[0.10035349,0.00022878947,0.88742685,0.00011460216,0.000059637903,0.00015266587,0.00018407857,0.00022166074,0.0112583265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966884,0.00007318155,0.00001561481,0.00006499734,0.00015673108,0.000020659805],"domain_scores_gemma":[0.9997038,0.0000793076,0.000027654805,0.000040876963,0.00013250629,0.000015785525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039931302,0.0010776633,0.00075539516,0.00027483725,0.00058994634,0.00073138665,0.0012134324,0.0015753531,0.0041863844],"category_scores_gemma":[0.001071979,0.000510829,0.0008320358,0.00031611035,0.00033458276,0.0012683651,0.00094763975,0.0016831838,0.0032188396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022291487,0.0002375396,0.0004429363,0.0003191802,0.000111950394,0.00021612595,0.00020201158,0.48477054,0.105687566,0.021002978,0.005632549,0.38115367],"study_design_scores_gemma":[0.000008144886,0.00005602067,0.00009981547,0.000010645124,0.000014110085,0.00007791308,0.000012760452,0.9851205,0.00908526,0.0024593214,0.0030422322,0.000013390488],"about_ca_topic_score_codex":0.0020075936,"about_ca_topic_score_gemma":0.003371685,"teacher_disagreement_score":0.0041863844,"about_ca_system_score_codex":0.0002921038,"about_ca_system_score_gemma":0.00085145887,"threshold_uncertainty_score":0.014004886},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08526896,0.00095147063,0.9088436,0.0001537637,0.000060390015,0.00006167437,0.000019810746,0.00052179507,0.0041185403],"genre_scores_gemma":[0.8689925,0.00062620424,0.12862705,0.00016166917,0.00003911506,0.00007888681,0.000024421783,0.00006136767,0.0013887855],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99884003,0.0004060205,0.000055009667,0.0002060797,0.0004009463,0.00009197339],"domain_scores_gemma":[0.9965838,0.0021878744,0.00047285313,0.00041845327,0.00028190186,0.000055081942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001942988,0.0005887715,0.00044163378,0.0005285318,0.0004411055,0.0008982483,0.0011110584,0.00055694976,0.001060001],"category_scores_gemma":[0.0061713923,0.00040041807,0.0003315668,0.0004006017,0.0017265404,0.0015551443,0.0017699627,0.001027037,0.0002999287],"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.00046986318,0.00017379601,0.0029477903,0.0006351534,0.00014880368,0.00035129627,0.0005633228,0.10079488,0.5625804,0.16610609,0.0007620845,0.16446657],"study_design_scores_gemma":[0.00006257226,0.0005962297,0.0010310161,0.000091121576,0.0000693264,0.00040850556,0.000074567564,0.59426874,0.3497541,0.046890263,0.0066642617,0.00008923768],"about_ca_topic_score_codex":0.00043335793,"about_ca_topic_score_gemma":0.00058242073,"teacher_disagreement_score":0.001942988,"about_ca_system_score_codex":0.00042023294,"about_ca_system_score_gemma":0.00064332865,"threshold_uncertainty_score":0.010275662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023685813,0.00030450258,0.9749257,0.00012560445,0.00003165814,0.000045168636,0.0000704301,0.00035068928,0.0004604008],"genre_scores_gemma":[0.41292673,0.000892258,0.5827234,0.00013785924,0.00007609644,0.00016803866,0.0006031404,0.00011554129,0.0023568973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943274,0.0002022345,0.0000317954,0.00012422563,0.00015299668,0.000055964687],"domain_scores_gemma":[0.9996118,0.00013764914,0.00008649374,0.000047560607,0.000088940455,0.000027588883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008576351,0.00106636,0.0005772827,0.0010181328,0.0002736139,0.0005781408,0.00063470984,0.0005653024,0.0007891192],"category_scores_gemma":[0.0017932908,0.00027015546,0.0009791991,0.0008319122,0.00041121687,0.0006982989,0.001191482,0.000834442,0.00033894132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066683395,0.00024217504,0.0060491473,0.00022166823,0.000325121,0.0002978139,0.00014623845,0.11309447,0.09109527,0.013975236,0.0032846406,0.7706014],"study_design_scores_gemma":[0.00002632202,0.00010076202,0.0030263641,0.000017256378,0.000050316023,0.0001837574,0.000027038279,0.9787936,0.011357522,0.004987992,0.0013900804,0.000039024937],"about_ca_topic_score_codex":0.0033502167,"about_ca_topic_score_gemma":0.004447277,"teacher_disagreement_score":0.0033502167,"about_ca_system_score_codex":0.00032416225,"about_ca_system_score_gemma":0.001145587,"threshold_uncertainty_score":0.0066614747},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001560814,0.00057270244,0.9963864,0.00018098748,0.00005669846,0.000014811907,0.000052067655,0.00008887772,0.0010867604],"genre_scores_gemma":[0.2966092,0.004945212,0.68938,0.0005001212,0.0008486762,0.00032451106,0.00064877555,0.00020911067,0.0065343813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706703,0.0010414992,0.00012564335,0.00064291025,0.0009203061,0.0002026523],"domain_scores_gemma":[0.9935422,0.0041472623,0.0005870522,0.0009139326,0.00072146906,0.00008805224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022155282,0.0015034454,0.0013737096,0.0011249525,0.0006075873,0.0018502489,0.0019134232,0.00162221,0.0018701204],"category_scores_gemma":[0.014084695,0.0007695082,0.0010804891,0.002216262,0.0020350195,0.0022138867,0.0020443352,0.0027549148,0.0011952246],"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.000102230784,0.00004325097,0.0011253837,0.00039069148,0.00022108019,0.00014984021,0.00009786126,0.48775333,0.005309504,0.40976468,0.005141617,0.08990055],"study_design_scores_gemma":[0.000011642943,0.000022196577,0.00020432899,0.000025381727,0.000020003105,0.0000760463,0.00000966835,0.8917022,0.0019013481,0.10153369,0.0044739884,0.000019625957],"about_ca_topic_score_codex":0.0024136684,"about_ca_topic_score_gemma":0.001443485,"teacher_disagreement_score":0.0024136684,"about_ca_system_score_codex":0.0011537655,"about_ca_system_score_gemma":0.0014206851,"threshold_uncertainty_score":0.011717021},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039704016,0.9027683,0.039916895,0.021907775,0.0243221,0.000027103379,0.00031306248,0.00017485101,0.010172853],"genre_scores_gemma":[0.0055809245,0.912137,0.019210232,0.0111259185,0.030356966,0.00005239989,0.0005642555,0.00020949625,0.020762827],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897504,0.00021178895,0.00011397776,0.0001710839,0.00047449218,0.00005374504],"domain_scores_gemma":[0.9950599,0.0022684776,0.00021152824,0.00021449654,0.0020363813,0.00020918393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002428755,0.001093894,0.0011637061,0.0038850966,0.0004889388,0.001628283,0.0013812549,0.0017605787,0.0073292213],"category_scores_gemma":[0.006542106,0.0006414155,0.00063521485,0.0042647966,0.0017135548,0.0026448371,0.000890466,0.004401105,0.010088329],"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.000051130304,0.000045089128,0.00023939382,0.0028176715,0.00008015936,0.00010131171,0.00008809991,0.001404833,0.0018880564,0.036662485,0.5345355,0.42208627],"study_design_scores_gemma":[0.0000036510032,0.000033559787,0.000324937,0.00040915006,0.000017543392,0.0003299297,0.000019478564,0.00030154767,0.0005658728,0.0069997124,0.990969,0.000025474175],"about_ca_topic_score_codex":0.002082828,"about_ca_topic_score_gemma":0.0033883678,"teacher_disagreement_score":0.0073292213,"about_ca_system_score_codex":0.0015159133,"about_ca_system_score_gemma":0.0017584163,"threshold_uncertainty_score":0.024518728},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36517182,0.0007583946,0.60379875,0.0006366656,0.00022808157,0.00026448097,0.0023392232,0.0070573785,0.019745134],"genre_scores_gemma":[0.9714589,0.0003285763,0.024929468,0.00004847388,0.000023857052,0.000059470673,0.00043537506,0.000089276575,0.0026266736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992776,0.00003400866,0.0000035081898,0.000011647266,0.000014499888,0.000008535652],"domain_scores_gemma":[0.9997665,0.00015985059,0.00001303836,0.000015982887,0.00003131677,0.000013296761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020689498,0.00034159824,0.00017183628,0.0002925899,0.0000776448,0.00047410934,0.00029349537,0.00042384173,0.0031949922],"category_scores_gemma":[0.001449375,0.00015315543,0.00036570855,0.00030274817,0.00015760057,0.00022370285,0.0002453,0.00028068264,0.0008515287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013761608,0.000094495364,0.008501384,0.0003897059,0.00020561866,0.0018013631,0.00035296823,0.7568576,0.041162323,0.0030261236,0.009247076,0.17698513],"study_design_scores_gemma":[0.0001555974,0.00015623425,0.009439737,0.000047740177,0.000044440298,0.0005535286,0.0001018971,0.9762422,0.008610796,0.002135573,0.0024808648,0.00003136092],"about_ca_topic_score_codex":0.0050440477,"about_ca_topic_score_gemma":0.004214643,"teacher_disagreement_score":0.0050440477,"about_ca_system_score_codex":0.00022316516,"about_ca_system_score_gemma":0.0002921578,"threshold_uncertainty_score":0.010688305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021971317,0.0019255725,0.9718731,0.00020163406,0.00013594123,0.000043015894,0.00004992697,0.0004302579,0.00336924],"genre_scores_gemma":[0.41440368,0.006174344,0.5453293,0.000312065,0.00033055118,0.0001650983,0.00019524881,0.00014968426,0.032940175],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923444,0.00019623252,0.00003637162,0.00009919035,0.00034650497,0.00008729949],"domain_scores_gemma":[0.9991027,0.0004919786,0.000102665865,0.000115777286,0.00015596513,0.000030861294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087107596,0.000872459,0.00061015255,0.0012079771,0.0005304476,0.0012190075,0.0005963163,0.0012129083,0.0031092789],"category_scores_gemma":[0.0033226646,0.0005563866,0.0006453082,0.0009944598,0.0010593665,0.0013304676,0.00087514,0.0010085837,0.0017654274],"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.0009140416,0.00014350978,0.0016273106,0.00057446794,0.00015529232,0.0004294572,0.0006720888,0.21983969,0.17206687,0.13628875,0.0030042497,0.4642843],"study_design_scores_gemma":[0.00013685257,0.000489519,0.0030023742,0.0001953917,0.00011591025,0.0008865215,0.00019326861,0.76587903,0.15600152,0.051710304,0.021235436,0.00015390388],"about_ca_topic_score_codex":0.0012101872,"about_ca_topic_score_gemma":0.001816267,"teacher_disagreement_score":0.0031092789,"about_ca_system_score_codex":0.00060375023,"about_ca_system_score_gemma":0.00097196084,"threshold_uncertainty_score":0.010401547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9137983,0.008112385,0.059465636,0.0005902245,0.00018876785,0.000052512158,0.0010867503,0.00065319694,0.016052233],"genre_scores_gemma":[0.9666432,0.0019013375,0.02066183,0.00023121519,0.00004363717,0.00006153517,0.0006732475,0.00008611615,0.00969782],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999223,0.0000028093216,0.0000048428083,0.000029359466,0.000027235461,0.0000134705015],"domain_scores_gemma":[0.9998927,0.00000912768,0.000021256681,0.000018921779,0.000024373672,0.00003368504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007935916,0.00023511519,0.00023688558,0.00039440658,0.00024585938,0.00039536992,0.00047520813,0.00033094906,0.0020171066],"category_scores_gemma":[0.00014461878,0.00011771159,0.00015857193,0.00017584817,0.00036958716,0.00038124903,0.0004455273,0.00045680878,0.0005869897],"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.000062662424,0.000012399228,0.00040749926,0.000043115208,0.000004110954,0.00017754326,0.000012703536,0.000065019005,0.99138945,0.00095433585,0.00014734668,0.0067239245],"study_design_scores_gemma":[0.00005690837,0.00026128493,0.052117296,0.000045837187,0.000050346815,0.0024526576,0.00008923765,0.0055327816,0.923487,0.002318799,0.013564504,0.000023374912],"about_ca_topic_score_codex":0.0007338449,"about_ca_topic_score_gemma":0.0018218862,"teacher_disagreement_score":0.0020171066,"about_ca_system_score_codex":0.00040022325,"about_ca_system_score_gemma":0.00035825063,"threshold_uncertainty_score":0.0067479014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068877004,0.0013052009,0.32718545,0.013580635,0.0015493548,0.0001135999,0.00086326816,0.0028140966,0.58371145],"genre_scores_gemma":[0.7570294,0.00087389926,0.03537277,0.0010609208,0.00040274236,0.000118960976,0.000659378,0.0012770046,0.20320487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860364,0.00034966384,0.000054767712,0.0002744344,0.00042207004,0.0002954236],"domain_scores_gemma":[0.99490756,0.0013789354,0.00035716232,0.0019490815,0.0009803552,0.00042697185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023524708,0.00064131,0.0007596753,0.0012040472,0.002563569,0.004472393,0.0010285117,0.0019344498,0.037730712],"category_scores_gemma":[0.015141333,0.0004013513,0.00051762856,0.0015502445,0.0022336661,0.0072312164,0.0037254393,0.0030680073,0.007861224],"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.00025648982,0.00004982668,0.0011502483,0.000048148817,0.00003008924,0.00013913574,0.00016255575,0.0031130665,0.0010281181,0.8666087,0.04365836,0.0837554],"study_design_scores_gemma":[0.00005879289,0.000054785214,0.00073727657,0.0000643735,0.000031331427,0.00027489755,0.00022050015,0.041020695,0.0038821725,0.87748164,0.07613603,0.000037450776],"about_ca_topic_score_codex":0.0036117844,"about_ca_topic_score_gemma":0.005022989,"teacher_disagreement_score":0.037730712,"about_ca_system_score_codex":0.0012862956,"about_ca_system_score_gemma":0.0021282062,"threshold_uncertainty_score":0.12622184},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0420238,0.0003609009,0.9549463,0.00030433157,0.000045721954,0.000052142168,0.000024992472,0.00018205203,0.0020597784],"genre_scores_gemma":[0.9763926,0.00022175621,0.021591233,0.00004353657,0.000042620133,0.00006880688,0.00003754533,0.000018736348,0.001583175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992994,0.00020356794,0.000034669825,0.00014858675,0.00021690101,0.00009684155],"domain_scores_gemma":[0.9975339,0.0014604246,0.00040280167,0.00013020942,0.00038021992,0.00009245902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011050212,0.00061968336,0.0006953037,0.0007783348,0.000394002,0.0009408457,0.00077876105,0.0006706505,0.0010327603],"category_scores_gemma":[0.0055561997,0.00028237092,0.0006158844,0.000435944,0.0011064296,0.0008570024,0.0013357702,0.0008845355,0.0001127622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004824717,0.000024008954,0.0015664333,0.000042678552,0.00003501337,0.000097120144,0.00008624266,0.96503794,0.0009513315,0.014966468,0.000274122,0.016870353],"study_design_scores_gemma":[0.0000019752613,0.0000089420655,0.00010901388,0.0000012569158,0.0000022017082,0.000004722674,0.000007359907,0.99751556,0.000098733915,0.002180178,0.000068731315,0.0000013044951],"about_ca_topic_score_codex":0.0065544867,"about_ca_topic_score_gemma":0.0021980747,"teacher_disagreement_score":0.0065544867,"about_ca_system_score_codex":0.0011768013,"about_ca_system_score_gemma":0.000788657,"threshold_uncertainty_score":0.013032675},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010538953,0.0155915255,0.12473919,0.042164188,0.35833192,0.00073514064,0.01406509,0.008917949,0.42491597],"genre_scores_gemma":[0.015314822,0.0056301462,0.02766654,0.0011611856,0.005981306,0.00007882496,0.003895562,0.0022733847,0.93799824],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987785,0.00016183041,0.000113220995,0.00032653467,0.0004725223,0.00014734038],"domain_scores_gemma":[0.9937868,0.0008454625,0.00015115563,0.0007539726,0.003792057,0.0006704836],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026105335,0.0010808515,0.0015744811,0.002475751,0.001889456,0.0069226916,0.00151173,0.0015866071,0.4922847],"category_scores_gemma":[0.011687644,0.0007326583,0.0009536757,0.0031241341,0.0012820611,0.0033085619,0.0023427545,0.0013584017,0.23444512],"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.00031930563,0.0000665743,0.0008960607,0.00046094775,0.00008178883,0.00032752962,0.00015414569,0.0010496181,0.0027328257,0.0070883054,0.76918846,0.2176344],"study_design_scores_gemma":[0.00003867724,0.000073505085,0.0009757117,0.0001675394,0.00003128626,0.00036815894,0.00019642166,0.0026793117,0.0034539846,0.003944761,0.9880369,0.000033726847],"about_ca_topic_score_codex":0.0053311256,"about_ca_topic_score_gemma":0.014478064,"teacher_disagreement_score":0.4922847,"about_ca_system_score_codex":0.0013328793,"about_ca_system_score_gemma":0.00267718,"threshold_uncertainty_score":0.7241943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49771506,0.0020659214,0.49509874,0.00015862424,0.00004999833,0.000121294324,0.00053217384,0.0004891839,0.003769031],"genre_scores_gemma":[0.80603725,0.00209996,0.18972528,0.000035434343,0.00003545807,0.00011352763,0.000619883,0.00007629514,0.0012569282],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986005,0.000023519262,0.000011645721,0.000036846755,0.00005446278,0.000013462728],"domain_scores_gemma":[0.99972826,0.00009699773,0.000057925852,0.000027882117,0.000072644696,0.000016188182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028300672,0.00023309872,0.00018362902,0.00086455216,0.00012194845,0.000414004,0.0001498014,0.00019470077,0.00093545084],"category_scores_gemma":[0.0008898315,0.00009647473,0.00020570534,0.0007434272,0.00023665218,0.00047836726,0.00026974521,0.00031278367,0.0001948438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015354129,0.000047275265,0.0039019845,0.00020401376,0.000083747276,0.00015380848,0.00031842527,0.00451192,0.81480974,0.004180378,0.00050619175,0.171129],"study_design_scores_gemma":[0.000069427755,0.001668109,0.21027763,0.00014416336,0.00025000665,0.0013801348,0.0012393885,0.13900031,0.6170277,0.015931517,0.012861326,0.00015027533],"about_ca_topic_score_codex":0.0005314742,"about_ca_topic_score_gemma":0.0008663413,"teacher_disagreement_score":0.00093545084,"about_ca_system_score_codex":0.00014668703,"about_ca_system_score_gemma":0.00022011995,"threshold_uncertainty_score":0.0031294227},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014644817,0.000081398044,0.984387,0.000053619802,0.000019514971,0.0000125146435,0.000012792251,0.00027513845,0.0005131965],"genre_scores_gemma":[0.39751047,0.0003405797,0.5995725,0.00006415147,0.00007573178,0.00004897199,0.00008026287,0.0000729991,0.002234388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966884,0.00013014223,0.000011797046,0.00004976699,0.000103862185,0.00003557175],"domain_scores_gemma":[0.9989655,0.0007425556,0.000070253154,0.00007655798,0.000120021345,0.00002505878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049342244,0.00047134486,0.00046337766,0.00046153678,0.0003258559,0.0003564896,0.00024313988,0.0007234966,0.0006946192],"category_scores_gemma":[0.0021843154,0.00015458078,0.00030311555,0.00040852575,0.00071099686,0.00050004286,0.00044199385,0.00064935157,0.00024285306],"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.00045994995,0.0000701996,0.0017528615,0.0002078376,0.000066872075,0.00036027576,0.00025403526,0.60997,0.07412649,0.039708596,0.0012705828,0.2717523],"study_design_scores_gemma":[0.00001991412,0.000080914586,0.00047298963,0.000007017786,0.000010287008,0.00025555887,0.00002743924,0.9718266,0.018373547,0.0069835675,0.0019144347,0.000027715756],"about_ca_topic_score_codex":0.0011989813,"about_ca_topic_score_gemma":0.0010462262,"teacher_disagreement_score":0.0011989813,"about_ca_system_score_codex":0.00022849317,"about_ca_system_score_gemma":0.0004872281,"threshold_uncertainty_score":0.0026094913},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026221345,0.06464358,0.5940072,0.0011278612,0.0035824084,0.000058518617,0.00025627651,0.0010715319,0.33263046],"genre_scores_gemma":[0.056722265,0.061227765,0.2462589,0.0012493539,0.0033151798,0.00018715956,0.00052687846,0.0009943146,0.6295182],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996823,0.000036289395,0.000015108741,0.000058936097,0.00019165299,0.000015766424],"domain_scores_gemma":[0.9997559,0.00010320975,0.000013363284,0.000047089838,0.00007082025,0.000009602492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002923066,0.0012500326,0.0008447728,0.0015017671,0.00050839246,0.0014722064,0.0007316076,0.0010395552,0.018654699],"category_scores_gemma":[0.001049992,0.00041853788,0.00027214113,0.002665987,0.0012506769,0.00213042,0.0007280695,0.0018874265,0.010685619],"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.000034329914,0.000027554595,0.000052528438,0.00037114936,0.0000141228265,0.000074824835,0.00015407168,0.0036219694,0.0061815563,0.40902862,0.042634394,0.5378049],"study_design_scores_gemma":[0.0000102009635,0.00004789587,0.00041957083,0.00020768502,0.000019965302,0.0005660537,0.00007593242,0.015060081,0.0067089796,0.31449276,0.6623355,0.000055213462],"about_ca_topic_score_codex":0.0007116114,"about_ca_topic_score_gemma":0.00091905094,"teacher_disagreement_score":0.018654699,"about_ca_system_score_codex":0.0005529736,"about_ca_system_score_gemma":0.00044593497,"threshold_uncertainty_score":0.062406182},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021534404,0.058931425,0.65466744,0.00930666,0.004393129,0.0006947413,0.017729914,0.011308747,0.22143349],"genre_scores_gemma":[0.19887795,0.031085754,0.66862786,0.0063504307,0.004758966,0.0025085583,0.023899663,0.006051434,0.05783939],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911342,0.0019878852,0.00079086854,0.0011539791,0.0038028073,0.0011302189],"domain_scores_gemma":[0.95294565,0.037449066,0.0014592919,0.0048399484,0.0025629841,0.0007431175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004534248,0.0055962447,0.003990415,0.0076182215,0.0034757757,0.008905069,0.0052139885,0.0030474118,0.07624461],"category_scores_gemma":[0.035526715,0.0019573253,0.0027121091,0.008680301,0.0020636467,0.009949928,0.0033764394,0.008636654,0.03592317],"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.0014875467,0.000611687,0.0014737608,0.0041562696,0.0004523047,0.00039566844,0.00016644194,0.052679826,0.011421809,0.17994317,0.18215452,0.56505704],"study_design_scores_gemma":[0.00064011925,0.0010635726,0.002560288,0.0017610845,0.0006312719,0.002760204,0.0002472654,0.13639373,0.02191119,0.6161927,0.21531837,0.000520256],"about_ca_topic_score_codex":0.001273386,"about_ca_topic_score_gemma":0.0031730041,"teacher_disagreement_score":0.07624461,"about_ca_system_score_codex":0.003736515,"about_ca_system_score_gemma":0.0033625448,"threshold_uncertainty_score":0.2550636},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2931207,0.009387695,0.6710188,0.007859343,0.00050215604,0.00010026097,0.00014307925,0.0013834514,0.016484413],"genre_scores_gemma":[0.91704834,0.004073174,0.069298066,0.00059098087,0.000317797,0.00003862985,0.000105545354,0.00006898281,0.008458474],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903417,0.00023841839,0.00003658427,0.00012831153,0.0005168448,0.00004565578],"domain_scores_gemma":[0.996283,0.0020853062,0.0002229331,0.00025209546,0.0010125276,0.0001442412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001207969,0.00030372245,0.00037829802,0.00038037883,0.0003230562,0.0009743599,0.0009029684,0.0019907875,0.0023907505],"category_scores_gemma":[0.002877757,0.00016768712,0.00016187887,0.00048503163,0.00069962215,0.0011131327,0.00055656105,0.0008582482,0.0007184949],"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.00057112484,0.00028010135,0.007144778,0.0010221975,0.000055715085,0.0018111811,0.00050830276,0.07871016,0.24504109,0.014301449,0.009132069,0.6414218],"study_design_scores_gemma":[0.00015486812,0.0025278756,0.012088968,0.00023783774,0.000095343996,0.015426985,0.0015150101,0.49615195,0.3341918,0.041089427,0.096269935,0.0002500154],"about_ca_topic_score_codex":0.0007237683,"about_ca_topic_score_gemma":0.0006752361,"teacher_disagreement_score":0.0023907505,"about_ca_system_score_codex":0.00041447632,"about_ca_system_score_gemma":0.00030403794,"threshold_uncertainty_score":0.007997811},"labels":[],"label_agreement":null}]}