{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":892,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":892,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"52bc407533fb","filters":{"topic":"Sparse and Compressive Sensing Techniques"}},"results":[{"id":"W2085040216","doi":"10.1145/1390156.1390267","title":"Bayesian probabilistic matrix factorization using Markov chain Monte Carlo","year":2008,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1453,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain Monte Carlo; Overfitting; Computer science; Hyperparameter; Bayesian probability; Probabilistic logic; Variable-order Bayesian network; Markov chain; Matrix decomposition; Monte Carlo method; Artificial intelligence; Graphical model; Algorithm; Bayesian inference; Machine learning; Mathematics; Statistics; Artificial neural network","authors":[{"name":"Ruslan Salakhutdinov","is_ca":true},{"name":"Andriy Mnih","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02190272467358094,"gpt":0.2347275995290818,"spread":0.2128248748555009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003473099,0.001224581,0.001985363,0.0009995374,0.0008837988,0.001593979,0.002154187,0.002038825,0.003738742],"category_scores_gemma":[0.01268148,0.001188961,0.001343373,0.001374895,0.001412849,0.002410954,0.001200535,0.002787046,0.001276174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001348563,"about_ca_system_score_gemma":0.001703788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01273863,"about_ca_topic_score_gemma":0.01490529,"domain_scores_codex":[0.9980239,0.001090038,0.00006933101,0.0002642852,0.0004414528,0.0001109693],"domain_scores_gemma":[0.9913339,0.007012852,0.0004450358,0.0005971618,0.0004764232,0.0001347192],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007031242,0.00005347459,0.0004603456,0.00009613464,0.00006527091,0.0000596158,0.0000749243,0.9054542,0.0007364312,0.05306916,0.001978118,0.03788203],"study_design_scores_gemma":[0.000007468901,0.00000631473,0.0000387597,0.000006011415,0.00000313066,0.00001027021,0.000002955057,0.9838876,0.0001275102,0.01559328,0.0003105859,0.000006200139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002296451,0.0001439621,0.9964169,0.0001293116,0.00001529329,0.00003701662,0.00006087471,0.0002636155,0.0006365513],"genre_scores_gemma":[0.2646611,0.0008043083,0.7292914,0.0002521804,0.0002099801,0.0006065598,0.0006411808,0.0001837362,0.003349548],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01273863,"threshold_uncertainty_score":0.02532893,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119883478","doi":"10.1002/cpa.20303","title":"Iteratively reweighted least squares minimization for sparse recovery","year":2009,"lang":"en","type":"article","venue":"Communications on Pure and Applied Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1319,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Army Research Office; Office of Naval Research; European Commission; Goddard Space Flight Center; York University; Princeton University; Deutscher Akademischer Austauschdienst; National Science Foundation","keywords":"Mathematics; Restricted isometry property; Combinatorics; Hyperplane; Iteratively reweighted least squares; Limit point; Norm (philosophy); Sequence (biology); Limit (mathematics); Matrix (chemical analysis); Weight; Algorithm; Element (criminal law); Compressed sensing; Discrete mathematics; Applied mathematics; Non-linear least squares; Mathematical analysis; Pure mathematics; Lie algebra; Estimation theory","authors":[{"name":"Ingrid Daubechies","is_ca":false},{"name":"Ronald DeVore","is_ca":false},{"name":"Massimo Fornasier","is_ca":false},{"name":"C. Si̇nan Güntürk","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03427797395926509,"gpt":0.2604920053561653,"spread":0.2262140313969002,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001308255,0.0009982398,0.001052987,0.0005993675,0.0003114322,0.0006255326,0.001301202,0.00143946,0.001567242],"category_scores_gemma":[0.005388704,0.0005306719,0.0006215166,0.0006533359,0.001096776,0.001344781,0.001144281,0.001937451,0.0006463893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007033588,"about_ca_system_score_gemma":0.001201224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003256493,"about_ca_topic_score_gemma":0.00225887,"domain_scores_codex":[0.9993293,0.0002588789,0.00002853003,0.0001570009,0.0001792499,0.00004702366],"domain_scores_gemma":[0.9985252,0.000857671,0.0002012355,0.0001235116,0.0002443916,0.00004797102],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001262347,0.00006867717,0.0005775777,0.0001734494,0.00007852962,0.0001422742,0.0001616967,0.858668,0.01724416,0.0351741,0.002243979,0.08534122],"study_design_scores_gemma":[0.000003305592,0.00001326652,0.00003660508,0.000006085942,0.000002115982,0.00001260964,0.000004470078,0.9954699,0.00112656,0.003015846,0.0003054276,0.00000379876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005540718,0.0001418785,0.9935274,0.0001202858,0.00001434972,0.0000184378,0.00001880394,0.0001044325,0.0005136627],"genre_scores_gemma":[0.1924685,0.0003077888,0.8019136,0.0001576898,0.00007450572,0.0001630533,0.0001872173,0.0001819444,0.004545778],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003256493,"threshold_uncertainty_score":0.006918728,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127300249","doi":"10.1109/tit.2009.2016018","title":"Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\\ell _{1}$-Constrained Quadratic Programming (Lasso)","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1252,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation","keywords":"Lasso (programming language); Compressed sensing; Dimension (graph theory); Algorithm; Mathematics; Quadratic programming; Quadratic equation; Gaussian; Combinatorics; Noise (video); Computer science; Applied mathematics; Discrete mathematics; Mathematical optimization; Artificial intelligence; Physics","authors":[{"name":"Martin J. Wainwright","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01285032071729191,"gpt":0.2205997337126051,"spread":0.2077494129953132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008289787,0.001678433,0.002440149,0.001139095,0.0006598149,0.002049217,0.002282837,0.002660217,0.002927066],"category_scores_gemma":[0.04343861,0.001051856,0.001121499,0.00117493,0.003873799,0.004397609,0.004306234,0.004105456,0.0006585838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001383567,"about_ca_system_score_gemma":0.002228765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002034457,"about_ca_topic_score_gemma":0.001354012,"domain_scores_codex":[0.9959612,0.001617638,0.0002361489,0.0007769157,0.001061977,0.0003460287],"domain_scores_gemma":[0.9794881,0.01579533,0.001884268,0.0009654805,0.001309292,0.0005576939],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007218246,0.0001684112,0.00183432,0.0008353046,0.0001707313,0.0005485772,0.0005198818,0.6609396,0.01523545,0.2449755,0.006453958,0.0675965],"study_design_scores_gemma":[0.00002769798,0.00007559649,0.0003609151,0.00005056592,0.00001128481,0.00006030039,0.00003544316,0.9337121,0.001795932,0.06325095,0.0005934231,0.00002581709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01219164,0.0004687935,0.9848579,0.0007062337,0.00003377171,0.0000420795,0.0001341888,0.0002351489,0.001330136],"genre_scores_gemma":[0.5664553,0.001432796,0.4254076,0.0009739088,0.0002592074,0.00065885,0.0008915174,0.0003978467,0.003522954],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008289787,"threshold_uncertainty_score":0.04384106,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1529624360","doi":"10.1103/physrevlett.105.150401","title":"Quantum State Tomography via Compressed Sensing","year":2010,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1124,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum tomography; Quantum state; Pauli exclusion principle; Quantum; Compressed sensing; Computer science; Tomography; Dimension (graph theory); A priori and a posteriori; Rank (graph theory); POVM; Density matrix; Statistical physics; State (computer science); Algorithm; Quantum operation; Physics; Quantum mechanics; Mathematics; Open quantum system; Optics; Pure mathematics","authors":[{"name":"David Groß","is_ca":false},{"name":"Yi-Kai Liu","is_ca":false},{"name":"Steven T. Flammia","is_ca":true},{"name":"Stephen Becker","is_ca":false},{"name":"Jens Eisert","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0111093605003397,"gpt":0.251041044657655,"spread":0.2399316841573153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001288447,0.0008085527,0.0007104374,0.00118616,0.0005447047,0.001303902,0.001205665,0.001289614,0.003600064],"category_scores_gemma":[0.006285737,0.0004210346,0.0006053844,0.001121004,0.002527102,0.002947749,0.003094638,0.002707967,0.000845162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007340708,"about_ca_system_score_gemma":0.0007798861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009466783,"about_ca_topic_score_gemma":0.000973931,"domain_scores_codex":[0.9986345,0.0004230147,0.00004519883,0.0001621137,0.0006417134,0.00009347632],"domain_scores_gemma":[0.9972101,0.001481732,0.0002959108,0.000672986,0.0002438512,0.00009555164],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007008288,0.00005524621,0.0003376394,0.0001443246,0.00004188905,0.0001102646,0.0001481879,0.06384172,0.009449652,0.8467166,0.005170741,0.07391369],"study_design_scores_gemma":[0.00002626379,0.00004725369,0.0001688932,0.0000321831,0.000009655803,0.0001529964,0.00002089179,0.6724558,0.004757385,0.3160687,0.00622564,0.00003433317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003820778,0.0002833199,0.9889382,0.0005632773,0.00008541536,0.00005542622,0.0001308615,0.000187934,0.005934861],"genre_scores_gemma":[0.3307733,0.001505321,0.6579008,0.0008029759,0.0006090319,0.0004137245,0.0004904551,0.0001451589,0.007359226],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003600064,"threshold_uncertainty_score":0.01204342,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153290280","doi":"10.1109/tsp.2004.830985","title":"The Kernel Recursive Least-Squares Algorithm","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1096,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Algorithm; Kernel (algebra); Mathematics; Representation (politics); Bounded function; Least-squares function approximation; Signal processing; Recursive least squares filter; Nonlinear system; Computer science; Adaptive filter; Digital signal processing","authors":[{"name":"Yaakov Engel","is_ca":false},{"name":"Shie Mannor","is_ca":true},{"name":"Ron Meir","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01365143437247462,"gpt":0.2314048029116086,"spread":0.217753368539134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006720777,0.0007015046,0.000954402,0.0004366346,0.0003044298,0.0008870005,0.001259727,0.00110251,0.003219768],"category_scores_gemma":[0.003174927,0.0003844284,0.0005815771,0.0006241724,0.0005753016,0.001178191,0.000960481,0.001257717,0.003035512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00037757,"about_ca_system_score_gemma":0.001015038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002418686,"about_ca_topic_score_gemma":0.002894219,"domain_scores_codex":[0.9993132,0.0002006206,0.00003546403,0.0001328101,0.0002557834,0.00006206041],"domain_scores_gemma":[0.9990933,0.0003624672,0.00007363971,0.0001917987,0.0002529807,0.00002584203],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001435391,0.00009886088,0.0008183257,0.0001671153,0.00009990809,0.0001264993,0.0001183704,0.4201665,0.01574432,0.04541815,0.007537896,0.5095605],"study_design_scores_gemma":[0.00001100829,0.00002100099,0.0001041826,0.000004742711,0.000007949419,0.00005777667,0.000006283257,0.9882187,0.00265091,0.004794127,0.004112504,0.0000108301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001515377,0.000093392,0.9973341,0.00005329574,0.00001837563,0.00001421845,0.00002108566,0.0004210708,0.0005290806],"genre_scores_gemma":[0.08840895,0.0002502866,0.9062204,0.00008717221,0.0000595512,0.00008659766,0.0002170543,0.000237764,0.004432287],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003219768,"threshold_uncertainty_score":0.01077116,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099474155","doi":"10.1109/tip.2011.2173206","title":"On the Mathematical Properties of the Structural Similarity Index","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":587,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Convexity; Similarity (geometry); Mathematics; Image processing; Metric (unit); Image quality; Measure (data warehouse); Mean squared error; Computer science; Triangle inequality; Algorithm; Image (mathematics); Mathematical optimization; Artificial intelligence; Pattern recognition (psychology); Data mining; Statistics; Discrete mathematics","authors":[{"name":"Dominique Brunet","is_ca":true},{"name":"Edward R. Vrscay","is_ca":true},{"name":"Zhou Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03735659040357165,"gpt":0.2219560915102805,"spread":0.1845995011067089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004166329,0.0009368919,0.001128872,0.004744177,0.0009958408,0.003100183,0.001291413,0.001785771,0.002007381],"category_scores_gemma":[0.02148929,0.0004375183,0.0009282787,0.00361801,0.004478401,0.007822903,0.002492815,0.002959824,0.0008481818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001566474,"about_ca_system_score_gemma":0.0009535871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008469881,"about_ca_topic_score_gemma":0.0005259264,"domain_scores_codex":[0.9971303,0.0008661849,0.0002483659,0.0005426142,0.001059865,0.0001527164],"domain_scores_gemma":[0.9866796,0.008322739,0.001659331,0.0008718845,0.002142614,0.0003239167],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000264681,0.00002291086,0.0007982238,0.0001217813,0.00002626538,0.0001480646,0.0001302752,0.0247003,0.002907342,0.9463978,0.001235626,0.02348506],"study_design_scores_gemma":[0.000008428568,0.0001113715,0.00097094,0.0000758904,0.00001807366,0.0005619547,0.00007504624,0.226879,0.001497643,0.7630007,0.006751374,0.00004959053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0288343,0.003114487,0.9527525,0.001318074,0.0001666153,0.00005692074,0.0001982361,0.00007846729,0.01348048],"genre_scores_gemma":[0.618292,0.009323228,0.3584008,0.000979898,0.001906606,0.0004974309,0.0009248063,0.0002525465,0.009422603],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004744177,"threshold_uncertainty_score":0.02203393,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2890736047","doi":"10.1109/msp.2018.2844952","title":"Sparse Signal Processing for Grant-Free Massive Connectivity: A Future Paradigm for Random Access Protocols in the Internet of Things","year":2018,"lang":"en","type":"article","venue":"IEEE Signal Processing Magazine","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":517,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Random access; Compressed sensing; Key (lock); Embedding; Latency (audio); Wireless; Internet of Things; MIMO; Focus (optics); Distributed computing; Computer network; Telecommunications; Embedded system; Machine learning; Artificial intelligence; Channel (broadcasting); Computer security","authors":[{"name":"Liang Liu","is_ca":true},{"name":"Erik G. Larsson","is_ca":false},{"name":"Wei Yu","is_ca":false},{"name":"Petar Popovski","is_ca":false},{"name":"Čedomir Stefanović","is_ca":false},{"name":"Elisabeth de Carvalho","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03694521481188713,"gpt":0.2967682471009871,"spread":0.2598230322891,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002780309,0.0006820731,0.0006857021,0.0005538883,0.000522832,0.001920107,0.001303929,0.001676918,0.00140162],"category_scores_gemma":[0.006422243,0.0003266391,0.0003838543,0.0008314779,0.003001795,0.00437183,0.001631283,0.004085467,0.0005174374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007270922,"about_ca_system_score_gemma":0.0007563665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000377087,"about_ca_topic_score_gemma":0.0004813955,"domain_scores_codex":[0.9986297,0.0005681298,0.00005193595,0.0001283281,0.0005401419,0.00008182399],"domain_scores_gemma":[0.9961796,0.00253399,0.0002360144,0.0005784801,0.0003628964,0.0001090412],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005251821,0.0000426966,0.0001538709,0.0001560413,0.00001812207,0.0001089165,0.0002151364,0.02296641,0.006735175,0.8831626,0.00436199,0.08202649],"study_design_scores_gemma":[0.00003445633,0.0001721885,0.0001495692,0.0001130159,0.00001599179,0.0002669682,0.0001163314,0.3647755,0.003143132,0.6058527,0.02530852,0.00005173633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005379848,0.00428732,0.9757748,0.006142322,0.000353493,0.00006730754,0.00002637297,0.0001933387,0.007775196],"genre_scores_gemma":[0.4515925,0.01911967,0.5143211,0.002813416,0.00312192,0.0004855572,0.0001182266,0.0001250645,0.008302499],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002780309,"threshold_uncertainty_score":0.01470381,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963586744","doi":"","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","year":2014,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":494,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Institute for Advanced Research; Université de Montréal","funders":"","keywords":"Maxima and minima; Saddle point; Gradient descent; Saddle; Artificial neural network; Mathematical optimization; Computer science; Convex optimization; Convex function; Mathematics; Applied mathematics; Regular polygon; Algorithm; Artificial intelligence; Mathematical analysis; Geometry","authors":[{"name":"Yann Dauphin","is_ca":true},{"name":"Razvan Pascanu","is_ca":true},{"name":"Çağlar Gülçehre","is_ca":true},{"name":"Kyunghyun Cho","is_ca":true},{"name":"Surya Ganguli","is_ca":false},{"name":"Yoshua Bengio","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00989813726740284,"gpt":0.2101253392150519,"spread":0.200227201947649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002137162,0.0009893855,0.0009811593,0.0006093235,0.0005365573,0.0007838633,0.0009013574,0.001323953,0.001470937],"category_scores_gemma":[0.007485571,0.0005727753,0.0007480572,0.0004237827,0.002115991,0.001222029,0.00190055,0.002294962,0.000460157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004612797,"about_ca_system_score_gemma":0.00101096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001921069,"about_ca_topic_score_gemma":0.00224453,"domain_scores_codex":[0.9995568,0.0002190916,0.00002164391,0.00004691964,0.0001256631,0.00002970126],"domain_scores_gemma":[0.9970822,0.002275928,0.0002201499,0.0001821664,0.0001685471,0.00007099653],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006670298,0.00003338387,0.0007204732,0.0001995305,0.00008212027,0.0001586237,0.0002049711,0.8331126,0.004168903,0.1244844,0.002282892,0.03448544],"study_design_scores_gemma":[0.000007663787,0.00002350714,0.00007056957,0.00001377953,0.000003746043,0.00002773987,0.00001102784,0.963941,0.0005814505,0.03450537,0.0008074638,0.000006618857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004275695,0.0001919446,0.9940329,0.0002940103,0.00002677858,0.00001633156,0.000008502149,0.0000930961,0.001060787],"genre_scores_gemma":[0.3510819,0.001248168,0.6411119,0.0004323488,0.0001835306,0.0002837434,0.0001079459,0.0003009404,0.005249548],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002137162,"threshold_uncertainty_score":0.01130259,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166107799","doi":"10.1162/089976600300015187","title":"Gradient-Based Optimization of Hyperparameters","year":2000,"lang":"en","type":"article","venue":"Neural Computation","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":478,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Hyperparameter; Cholesky decomposition; Gradient descent; Hyperparameter optimization; Computer science; Selection (genetic algorithm); Mathematics; Mathematical optimization; Model selection; Applied mathematics; Computation; Quadratic equation; Artificial intelligence; Algorithm; Machine learning; Artificial neural network; Support vector machine","authors":[{"name":"Yoshua Bengio","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01406182111473949,"gpt":0.2205749250895469,"spread":0.2065131039748074,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002636237,0.001836448,0.001340689,0.0008462488,0.0005776387,0.001361608,0.001160384,0.001718134,0.002688183],"category_scores_gemma":[0.01129065,0.0008774374,0.0005642779,0.0007312057,0.001582157,0.002340184,0.001331006,0.002090892,0.001456302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009447302,"about_ca_system_score_gemma":0.00151671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001651361,"about_ca_topic_score_gemma":0.001877019,"domain_scores_codex":[0.999025,0.0004841719,0.00005284218,0.0001567294,0.0002163507,0.00006483479],"domain_scores_gemma":[0.9982954,0.001033631,0.0001506405,0.0001946693,0.0002827075,0.00004289705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000896578,0.00006528314,0.0005526655,0.0001658389,0.00007661761,0.00004750532,0.00007980233,0.8427498,0.006531926,0.04337621,0.003016669,0.1032481],"study_design_scores_gemma":[0.00002162737,0.00003042166,0.0001508543,0.00002778442,0.0000107483,0.00002251599,0.00001047419,0.9744647,0.001988996,0.02170081,0.001556693,0.00001432873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004989334,0.000215894,0.9927465,0.0001999,0.00002602489,0.0000443929,0.00003169875,0.0003171736,0.001429005],"genre_scores_gemma":[0.3203906,0.0007433142,0.6721972,0.0004090204,0.000156526,0.0007232433,0.0003121126,0.0006893451,0.004378588],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002688183,"threshold_uncertainty_score":0.01394194,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1493250972","doi":"10.1007/978-1-4419-9569-8","title":"Fixed-Point Algorithms for Inverse Problems in Science and Engineering","year":2011,"lang":"en","type":"book","venue":"Springer optimization and its applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":466,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología; Agence Nationale de la Recherche; National Science Foundation","keywords":"Inverse; Science and engineering; Computer science; Point (geometry); Algorithm; Mathematical optimization; Mathematics; Engineering; Engineering ethics; Geometry","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02169457895119201,"gpt":0.2223638767253457,"spread":0.2006692977741537,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005692399,0.002256634,0.001913461,0.001421774,0.0002945555,0.001591561,0.001354737,0.001789801,0.0161605],"category_scores_gemma":[0.001557021,0.0006791927,0.0009716261,0.003133879,0.00125962,0.002332381,0.00100987,0.003173923,0.01211196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000381132,"about_ca_system_score_gemma":0.0004507541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006590189,"about_ca_topic_score_gemma":0.0009724763,"domain_scores_codex":[0.9995358,0.0000750461,0.0000240618,0.00007776185,0.0002732588,0.00001411844],"domain_scores_gemma":[0.9994233,0.0003174504,0.00002204116,0.0001126079,0.0001110977,0.00001356974],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003513054,0.00002763127,0.00005368449,0.0006616811,0.00005064272,0.00004935742,0.00007092411,0.02566749,0.00443061,0.1641774,0.07800848,0.7267669],"study_design_scores_gemma":[0.00003575855,0.0001047139,0.0003596329,0.0002738548,0.00005987956,0.0005824255,0.00004734546,0.185963,0.005401726,0.3617037,0.4453901,0.00007780552],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005030903,0.02119627,0.9472734,0.0004388434,0.001174995,0.00002748928,0.0001417684,0.0007176541,0.02852651],"genre_scores_gemma":[0.0175559,0.03734073,0.8261659,0.0005065625,0.002343505,0.0002226486,0.0007204108,0.0009652497,0.1141792],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0161605,"threshold_uncertainty_score":0.05406231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2784331297","doi":"10.1109/tsp.2018.2795540","title":"Sparse Activity Detection for Massive Connectivity","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":389,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fading; Computer science; Channel (broadcasting); Base station; False alarm; Algorithm; Compressed sensing; Wireless; Signature (topology); Mathematics; Telecommunications; Artificial intelligence","authors":[{"name":"Zhilin Chen","is_ca":true},{"name":"Foad Sohrabi","is_ca":true},{"name":"Wei Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02796180552894003,"gpt":0.2590285853425017,"spread":0.2310667798135616,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006092187,0.000498008,0.0005054291,0.0005296506,0.0002412997,0.0006256057,0.0006320441,0.0007135189,0.0007983225],"category_scores_gemma":[0.005425193,0.0002733268,0.0002850507,0.0006858275,0.0008225788,0.001131877,0.0009145601,0.0007947175,0.0001894744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004861323,"about_ca_system_score_gemma":0.0004738439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001473755,"about_ca_topic_score_gemma":0.001430198,"domain_scores_codex":[0.9995252,0.0001555037,0.00001356945,0.00008900784,0.0001661782,0.00005052214],"domain_scores_gemma":[0.9978744,0.001499592,0.0002292231,0.0001802581,0.0001557214,0.00006079868],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001469177,0.00005140894,0.001482622,0.00009859278,0.00003865385,0.0002752416,0.0001208277,0.8373162,0.009059177,0.04556968,0.001382892,0.1044578],"study_design_scores_gemma":[0.000005457353,0.00002725962,0.000256496,0.000004215483,0.000003542444,0.00006191614,0.00001238638,0.9878342,0.0007788177,0.01058715,0.0004242837,0.000004220818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01928367,0.0001646007,0.97914,0.0002132292,0.00002414056,0.00002383073,0.0000449665,0.0001466676,0.000958829],"genre_scores_gemma":[0.8454943,0.0004840476,0.1513413,0.0001725129,0.000121342,0.0001015079,0.0002115245,0.00003909389,0.002034405],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001473755,"threshold_uncertainty_score":0.003527164,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2551153860","doi":"10.1287/moor.2016.0817","title":"A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications","year":2016,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":342,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Lipschitz continuity; Mathematics; Sublinear function; Convexity; Gradient descent; Subgradient method; Lemma (botany); Uniqueness; Applied mathematics; Pointwise; Rate of convergence; Bregman divergence; Convex function; Mathematical optimization; Measure (data warehouse); Regular polygon; Mathematical analysis; Key (lock); Computer science; Geometry","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Jérôme Bolte","is_ca":false},{"name":"Marc Teboulle","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06474276344782105,"gpt":0.3797376502487932,"spread":0.3149948868009722,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004694218,0.001048319,0.001164661,0.001251622,0.0007901728,0.00194671,0.001169113,0.002101735,0.002786609],"category_scores_gemma":[0.0159048,0.0006285554,0.001333057,0.001043456,0.004504608,0.003967588,0.003523162,0.006036094,0.000924864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001283244,"about_ca_system_score_gemma":0.00132662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001483026,"about_ca_topic_score_gemma":0.001110169,"domain_scores_codex":[0.998705,0.0006107928,0.00005939632,0.0001418835,0.0004133587,0.00006957344],"domain_scores_gemma":[0.9944066,0.004031017,0.0003328779,0.0004559087,0.0005637034,0.0002099324],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003531395,0.00002147708,0.0002481189,0.0001727662,0.0000207946,0.0001061838,0.0002047648,0.02711306,0.002471353,0.9452831,0.001709029,0.02261406],"study_design_scores_gemma":[0.00002650555,0.000111668,0.0002349307,0.0001381862,0.00002230948,0.0002621928,0.00006457754,0.4234106,0.003215164,0.5543252,0.01814803,0.00004060676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003157094,0.001881889,0.9875575,0.00135599,0.0001305429,0.00002692624,0.00002071881,0.00005832932,0.005810951],"genre_scores_gemma":[0.2456185,0.009168378,0.7186879,0.001387696,0.0008956843,0.000269023,0.0001037699,0.0004112185,0.02345779],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004694218,"threshold_uncertainty_score":0.02482575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129809168","doi":"10.1023/a:1013955821559","title":"Kernel Matching Pursuit","year":2002,"lang":"en","type":"article","venue":"Machine Learning","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":322,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Radial basis function; Basis (linear algebra); Basis function; Boosting (machine learning); Algorithm; Matching pursuit; Artificial intelligence; Computer science; Matching (statistics); Mathematics; Function (biology); Kernel (algebra); Pattern recognition (psychology); Artificial neural network; Statistics","authors":[{"name":"Pascal Vincent","is_ca":true},{"name":"Yoshua Bengio","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01448241195974086,"gpt":0.2052069867833169,"spread":0.190724574823576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000606306,0.0006743788,0.001036348,0.0008965908,0.0004392993,0.001644636,0.0005751221,0.001087995,0.005694132],"category_scores_gemma":[0.003218504,0.0003552103,0.000501668,0.001344197,0.0008035605,0.001615957,0.001739008,0.001393965,0.005051891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003820776,"about_ca_system_score_gemma":0.0007319381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004820601,"about_ca_topic_score_gemma":0.0003920846,"domain_scores_codex":[0.9994856,0.0001199687,0.00002443362,0.0001189107,0.0002102366,0.00004084392],"domain_scores_gemma":[0.999178,0.0001986013,0.00009200381,0.0002484357,0.0002292679,0.00005375663],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002284228,0.0001147555,0.0005793169,0.0001865954,0.00008073902,0.00009189556,0.00006974092,0.05063049,0.01703147,0.2913045,0.01715161,0.6225306],"study_design_scores_gemma":[0.00002098213,0.00006477223,0.0005080951,0.00002323035,0.00003328099,0.000255935,0.00003381676,0.8311253,0.01033184,0.1297299,0.02784529,0.00002744866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006781769,0.0008083521,0.9805472,0.0004441506,0.0001765217,0.00002844917,0.00009306557,0.0005039682,0.01061654],"genre_scores_gemma":[0.4246822,0.003531489,0.5129606,0.0004368598,0.0006022999,0.0001385168,0.0008521994,0.0004647897,0.05633105],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005694132,"threshold_uncertainty_score":0.01904875,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984305442","doi":"10.1007/s00365-007-9005-8","title":"Uniform Uncertainty Principle for Bernoulli and Subgaussian Ensembles","year":2008,"lang":"en","type":"article","venue":"Constructive Approximation","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":320,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Bernoulli's principle; Chaining; Convexity; Simple (philosophy); Measure (data warehouse); Applied mathematics; Calculus (dental); Computer science","authors":[{"name":"Shahar Mendelson","is_ca":false},{"name":"Alain Pajor","is_ca":false},{"name":"Nicole Tomczak-Jaegermann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02047043514167407,"gpt":0.2359204618546497,"spread":0.2154500267129756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005232995,0.001400954,0.001440004,0.001999896,0.0009778216,0.00278616,0.001848153,0.002259377,0.002991579],"category_scores_gemma":[0.01673128,0.0008842748,0.001233156,0.001642974,0.005082682,0.005201,0.003530693,0.004392507,0.000595493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001501425,"about_ca_system_score_gemma":0.001131081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001191809,"about_ca_topic_score_gemma":0.001102165,"domain_scores_codex":[0.9974141,0.001136577,0.00009283001,0.0002980774,0.0009116123,0.0001466716],"domain_scores_gemma":[0.9922792,0.005618613,0.0004199833,0.0005731219,0.0008113243,0.000297873],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001692651,0.00000774455,0.00006081623,0.00002930854,0.00001350006,0.00002261952,0.00004668544,0.01206513,0.0003272707,0.9827631,0.0008860882,0.003760922],"study_design_scores_gemma":[0.00000487104,0.000008745701,0.0000935627,0.00001418606,0.000007210571,0.00003769963,0.000017325,0.1124536,0.0002343722,0.8856803,0.001435774,0.00001250863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006947672,0.0009766708,0.9794123,0.0009771413,0.0001217409,0.00001708618,0.0001180565,0.00004566968,0.01138369],"genre_scores_gemma":[0.588872,0.007428146,0.3715566,0.001837578,0.002324634,0.0004437213,0.0007148011,0.0002937451,0.02652888],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005232995,"threshold_uncertainty_score":0.02767503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2770113520","doi":"10.1145/3130800.3130810","title":"High-quality hyperspectral reconstruction using a spectral prior","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":319,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Hyperspectral imaging; Computer science; Full spectral imaging; Autoencoder; Artificial intelligence; Interpolation (computer graphics); Computer vision; Iterative reconstruction; Encoder; Image resolution; Pattern recognition (psychology); Compressed sensing; Image (mathematics); Deep learning","authors":[{"name":"Inchang Choi","is_ca":true},{"name":"Daniel S. Jeon","is_ca":true},{"name":"Giljoo Nam","is_ca":true},{"name":"Diego Gutiérrez","is_ca":false},{"name":"Min H. Kim","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05182652129691619,"gpt":0.2948478148856421,"spread":0.2430212935887259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004024931,0.0005366849,0.0003334202,0.0003038783,0.0002251592,0.0005627273,0.0005970843,0.0007402608,0.001751337],"category_scores_gemma":[0.001090131,0.0003042801,0.0003497255,0.0003310084,0.0005992696,0.001113145,0.001190568,0.001228924,0.0008185671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002928109,"about_ca_system_score_gemma":0.0006954269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001443291,"about_ca_topic_score_gemma":0.002672638,"domain_scores_codex":[0.9997683,0.00003758105,0.000008042979,0.00005054272,0.0001153726,0.00002026145],"domain_scores_gemma":[0.9996414,0.00009040761,0.0000515955,0.0001129777,0.00007558508,0.00002800264],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002470414,0.0001395329,0.001335331,0.0002087122,0.00007206527,0.0002022557,0.0001753656,0.4449418,0.2057935,0.03472432,0.005277567,0.3068825],"study_design_scores_gemma":[0.00001242091,0.00002599521,0.0002727107,0.00000878449,0.000006386813,0.0001129267,0.00001260609,0.9638208,0.02966111,0.003388508,0.002664385,0.0000133667],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01081808,0.00005253777,0.9871553,0.0001530368,0.00001534822,0.00001504208,0.00006249388,0.0003174585,0.001410745],"genre_scores_gemma":[0.1532189,0.0001805181,0.8434653,0.0001275115,0.00004080104,0.00004241411,0.0002913723,0.0001122414,0.002520944],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001751337,"threshold_uncertainty_score":0.005858779,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152374199","doi":"10.1109/tit.2010.2043876","title":"Theoretical and Empirical Results for Recovery From Multiple Measurements","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":270,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Compressed sensing; Minification; Computer science; Algorithm; Extension (predicate logic); Mathematics","authors":[{"name":"E. van den Berg","is_ca":true},{"name":"Michael P. Friedlander","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02146178145333773,"gpt":0.2483098190398186,"spread":0.2268480375864809,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02168277,0.003916071,0.003554382,0.006948495,0.002725616,0.005078594,0.005878059,0.005309419,0.01257582],"category_scores_gemma":[0.1576049,0.002013023,0.002899783,0.009966679,0.009375037,0.01533809,0.006962041,0.009475951,0.002643045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004693077,"about_ca_system_score_gemma":0.002995468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00356344,"about_ca_topic_score_gemma":0.002179069,"domain_scores_codex":[0.9873292,0.004722626,0.0006209147,0.002126282,0.004170786,0.001030179],"domain_scores_gemma":[0.8242681,0.1460654,0.007527305,0.01356609,0.006868795,0.001704229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006975294,0.0004452151,0.01089515,0.002211421,0.0005831973,0.000516763,0.000688599,0.3233449,0.001960242,0.4843287,0.03504598,0.1392824],"study_design_scores_gemma":[0.0001007984,0.0001478688,0.002781739,0.0004098041,0.0001008438,0.000466949,0.0002199805,0.512844,0.001251531,0.4720232,0.009542309,0.0001108217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01847521,0.02057863,0.9357623,0.007024126,0.0004356729,0.0001821655,0.001971747,0.0009252642,0.01464488],"genre_scores_gemma":[0.598096,0.04441712,0.3218651,0.004094795,0.005782759,0.002099537,0.01014701,0.001302041,0.01219565],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02168277,"threshold_uncertainty_score":0.1146708,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962904605","doi":"10.1017/fms.2016.32","title":"BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING","year":2017,"lang":"en","type":"article","venue":"Forum of Mathematics Sigma","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":268,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Homerton College, University of Cambridge; Engineering and Physical Sciences Research Council; University of Cambridge; National Science Foundation","keywords":"Compressed sensing; Computer science; Exploit; Key (lock); Sampling (signal processing); Coherence (philosophical gambling strategy); Sampling theory; Operator (biology); Theoretical computer science; Algorithm; Mathematics; Telecommunications; Sample size determination","authors":[{"name":"Ben Adcock","is_ca":true},{"name":"Anders C. Hansen","is_ca":false},{"name":"Clarice Poon","is_ca":false},{"name":"Bogdan Roman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02681853792031044,"gpt":0.2612994784288483,"spread":0.2344809405085379,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002769253,0.0008588003,0.001110181,0.002026173,0.0009098107,0.002788036,0.001613961,0.002197741,0.003117982],"category_scores_gemma":[0.008536998,0.0005088375,0.0008326906,0.001771448,0.005261513,0.005061835,0.003604627,0.004557918,0.0007847553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001225475,"about_ca_system_score_gemma":0.001119218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001085152,"about_ca_topic_score_gemma":0.0007233032,"domain_scores_codex":[0.997612,0.0007562081,0.0001119901,0.0002762173,0.001109571,0.0001339834],"domain_scores_gemma":[0.9955353,0.003182169,0.0003188347,0.0005074247,0.0003343115,0.0001219291],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000243723,0.00001062067,0.00009153258,0.0001231918,0.00001689505,0.00006283987,0.000112773,0.01269353,0.002212357,0.9603454,0.001934762,0.0223716],"study_design_scores_gemma":[0.00002748476,0.00009370595,0.0001519758,0.0001106304,0.00001799779,0.0002194619,0.0000657627,0.1456655,0.001392853,0.8301826,0.02202882,0.00004320192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001891868,0.00256945,0.9866479,0.001683625,0.0002047455,0.00002857126,0.00007180267,0.00006994158,0.006832035],"genre_scores_gemma":[0.3174731,0.01648054,0.6437445,0.004541475,0.004498533,0.0005593529,0.0003629789,0.0003465654,0.01199299],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003117982,"threshold_uncertainty_score":0.01464534,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111394763","doi":"10.1109/tit.2011.2167214","title":"Recovering Compressively Sampled Signals Using Partial Support Information","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":266,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minification; Computer science; Compressed sensing; Algorithm; Artificial intelligence; World Wide Web","authors":[{"name":"Michael P. Friedlander","is_ca":true},{"name":"Hassan Mansour","is_ca":true},{"name":"Rayan Saab","is_ca":false},{"name":"Özgür Yılmaz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03576259163528422,"gpt":0.2301614195230408,"spread":0.1943988278877566,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002025353,0.001537423,0.001147485,0.0006921643,0.0003270787,0.0009740958,0.001096274,0.001666625,0.001904],"category_scores_gemma":[0.01636866,0.0005745394,0.0007354523,0.0006272299,0.00178599,0.002579552,0.00211065,0.001407451,0.0005417577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004732905,"about_ca_system_score_gemma":0.000813422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001401857,"about_ca_topic_score_gemma":0.0009369766,"domain_scores_codex":[0.9989834,0.0002974911,0.00005585423,0.0001912213,0.0003662645,0.0001057077],"domain_scores_gemma":[0.9938539,0.004381109,0.0007002568,0.0004248803,0.00050441,0.0001354241],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00109389,0.000176847,0.002030249,0.000744587,0.0001792334,0.0005852396,0.0003259566,0.7203965,0.06273185,0.1320349,0.002467127,0.07723369],"study_design_scores_gemma":[0.00001954232,0.00008352745,0.0002377142,0.00002609611,0.00001197632,0.00007241131,0.00002599531,0.9770362,0.008940342,0.01304167,0.0004861021,0.00001837532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07381029,0.0004600843,0.9216192,0.0007803459,0.00004542634,0.00004603569,0.0001965003,0.0001656443,0.00287636],"genre_scores_gemma":[0.8302518,0.001034386,0.1620871,0.0002636738,0.0001647419,0.0001688981,0.001003124,0.0001370812,0.004889088],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002025353,"threshold_uncertainty_score":0.01071119,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2171798319","doi":"","title":"Support Vector Machine Soft Margin Classifiers: Error Analysis","year":2004,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":222,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Reproducing kernel Hilbert space; Mathematics; Support vector machine; Hilbert space; Regularization (linguistics); Applied mathematics; Algorithm; Computer science; Gaussian; Bounding overwatch; Pattern recognition (psychology); Artificial intelligence; Mathematical analysis","authors":[{"name":"Di‐Rong Chen","is_ca":false},{"name":"Qiang Wu","is_ca":true},{"name":"Yiming Ying","is_ca":true},{"name":"Ding‐Xuan Zhou","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01760172955221883,"gpt":0.238012966482029,"spread":0.2204112369298102,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01744776,0.001645535,0.00243348,0.002309347,0.0008336894,0.003129384,0.002328574,0.003896812,0.002308176],"category_scores_gemma":[0.0734791,0.0006652767,0.0008301843,0.002100198,0.002947864,0.006016617,0.003699851,0.004057595,0.001117491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001772328,"about_ca_system_score_gemma":0.00137184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001059174,"about_ca_topic_score_gemma":0.0005072817,"domain_scores_codex":[0.9871771,0.005035164,0.0007340516,0.001332226,0.005268828,0.000452597],"domain_scores_gemma":[0.9578453,0.03093592,0.002645315,0.002971471,0.005199818,0.000402227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005199136,0.0001214495,0.002876187,0.0005424942,0.0001518377,0.0001533353,0.0001772433,0.5473844,0.003277964,0.1747184,0.005088596,0.2649882],"study_design_scores_gemma":[0.000005839027,0.0000504825,0.0002493084,0.00005206279,0.000008921106,0.00006667701,0.00001110043,0.9587328,0.001547315,0.03846715,0.0007936667,0.00001482211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005669311,0.001395845,0.9911232,0.0004301577,0.00007480725,0.00003877483,0.00004968399,0.0001987864,0.001019489],"genre_scores_gemma":[0.499948,0.003016364,0.4848975,0.0008531024,0.001144862,0.0006020836,0.0008174367,0.0005700202,0.008150614],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01744776,"threshold_uncertainty_score":0.09227365,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066086960","doi":"10.1007/s00039-007-0618-7","title":"Reconstruction and Subgaussian Operators in Asymptotic Geometric Analysis","year":2007,"lang":"en","type":"article","venue":"Geometric and Functional Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":207,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Mathematics; Polytope; Scalar (mathematics); Geometry","authors":[{"name":"Shahar Mendelson","is_ca":false},{"name":"Alain Pajor","is_ca":false},{"name":"Nicole Tomczak-Jaegermann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009047416774174153,"gpt":0.1988572305365369,"spread":0.1898098137623628,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003518289,0.001591663,0.001471629,0.002785062,0.0006862071,0.001956764,0.00129459,0.002600865,0.002828858],"category_scores_gemma":[0.01437644,0.0006825878,0.0009749333,0.002528965,0.005740849,0.005918319,0.002465755,0.003240605,0.0006216961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001108447,"about_ca_system_score_gemma":0.0007086914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001424594,"about_ca_topic_score_gemma":0.0009854105,"domain_scores_codex":[0.9987177,0.000681366,0.00005391876,0.0001515236,0.0003380013,0.00005756989],"domain_scores_gemma":[0.9930148,0.005061787,0.0004548078,0.0005392974,0.0007218636,0.0002074248],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000260847,0.00001664124,0.0001350197,0.00007148629,0.00001357886,0.00006534039,0.0001060201,0.01918093,0.0009298893,0.9638368,0.001740114,0.01387805],"study_design_scores_gemma":[0.000006114381,0.00001671747,0.0001418729,0.00001577809,0.000009877484,0.0001169392,0.00004443535,0.2030484,0.0004194173,0.7936772,0.002487149,0.0000159233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01480407,0.003171553,0.9697171,0.001790472,0.000265843,0.00001974745,0.00008874469,0.000135935,0.01000647],"genre_scores_gemma":[0.6169727,0.01163155,0.3290165,0.001543019,0.002842435,0.0002024234,0.0003975541,0.000424835,0.03696891],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003518289,"threshold_uncertainty_score":0.01860666,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2998391154","doi":"10.1109/iccv.2019.01032","title":"Deep Tensor ADMM-Net for Snapshot Compressive Imaging","year":2019,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":191,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Snapshot (computer storage); Decoding methods; Artificial intelligence; Inference; Tensor (intrinsic definition); Stochastic gradient descent; Deep learning; Gradient descent; Algorithm; Computer vision; Artificial neural network; Mathematics","authors":[{"name":"Jiawei Ma","is_ca":false},{"name":"Xiao-Yang Liu","is_ca":false},{"name":"Zheng Shou","is_ca":false},{"name":"Xin Yuan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008073907588942917,"gpt":0.2173534216129965,"spread":0.2092795140240536,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007176207,0.001311164,0.0007853605,0.0003698082,0.0003041258,0.0006250312,0.001048969,0.001010187,0.002585777],"category_scores_gemma":[0.002019148,0.0004438897,0.0005613124,0.0006025907,0.0005892436,0.001153134,0.0009738986,0.002080809,0.0008336823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007304459,"about_ca_system_score_gemma":0.001431456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005014655,"about_ca_topic_score_gemma":0.009007276,"domain_scores_codex":[0.9997541,0.00005730087,0.00001709463,0.00005753628,0.00008579874,0.00002816533],"domain_scores_gemma":[0.9995153,0.000184429,0.0000556892,0.00006900144,0.0001424689,0.00003316885],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002047669,0.0000865638,0.0008641216,0.000243759,0.0001072799,0.0001349265,0.00007780648,0.6355579,0.01123211,0.01873993,0.01104262,0.3217082],"study_design_scores_gemma":[0.000007515197,0.00002666522,0.00005980907,0.000006274531,0.000005794935,0.00002548544,0.000005103897,0.9940807,0.001791446,0.002711281,0.001274147,0.00000583951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003230036,0.0002687662,0.9943972,0.000181732,0.00004941677,0.00002750617,0.0001014408,0.0007029948,0.001040883],"genre_scores_gemma":[0.1873055,0.0007908698,0.8034573,0.0004063318,0.0001132363,0.0001956857,0.001111308,0.0001956648,0.006424027],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005014655,"threshold_uncertainty_score":0.009970963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032473164","doi":"10.1190/1.3506147","title":"Randomized sampling and sparsity: Getting more information from fewer samples","year":2010,"lang":"en","type":"article","venue":"Geophysics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":188,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universiteit Delft; BG Group","keywords":"Compressed sensing; Computer science; Curse of dimensionality; Sampling (signal processing); Data mining; Workflow; Noise (video); Data processing; Data acquisition; Algorithm; Artificial intelligence; Computer vision; Image (mathematics)","authors":[{"name":"Felix J. Herrmann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01296211888083701,"gpt":0.2183100791187463,"spread":0.2053479602379092,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002150394,0.000453856,0.0007170284,0.0004615672,0.0003843892,0.0009698037,0.0009276099,0.000801498,0.002534886],"category_scores_gemma":[0.01234161,0.0003005831,0.0003044159,0.0005799345,0.001912167,0.002074939,0.001630132,0.001229672,0.000479611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004559303,"about_ca_system_score_gemma":0.0007749541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001124536,"about_ca_topic_score_gemma":0.001016776,"domain_scores_codex":[0.9983881,0.0006605335,0.00006850043,0.0002396671,0.0005217671,0.0001213952],"domain_scores_gemma":[0.9911098,0.006135487,0.0005876233,0.001379485,0.0006101747,0.000177373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001229542,0.0003079539,0.002803748,0.0004413193,0.0001145544,0.0003624531,0.0002733433,0.6110473,0.07766324,0.1639995,0.004639472,0.1371175],"study_design_scores_gemma":[0.00006754207,0.000212828,0.0004592595,0.00003707765,0.00001871023,0.0001015866,0.00004983062,0.9436625,0.0139349,0.03955009,0.001878179,0.00002756631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08518199,0.0006645653,0.9079977,0.001260709,0.0001519499,0.0000607205,0.0001234656,0.0003478656,0.004210894],"genre_scores_gemma":[0.7729364,0.0004796399,0.224086,0.0004219894,0.0001573905,0.0001087971,0.0001969221,0.00008603891,0.00152682],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002534886,"threshold_uncertainty_score":0.01137257,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2557873547","doi":"10.1109/tsp.2016.2634550","title":"A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":184,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Université de Lyon; Sichuan Provincial Youth Science and Technology Fund; National Natural Science Foundation of China; Agence Nationale de la Recherche","keywords":"Matching pursuit; Computer science; Mathematics; Mathematical optimization; Algorithm; Compressed sensing","authors":[{"name":"Jinming Wen","is_ca":true},{"name":"Zhengchun Zhou","is_ca":false},{"name":"Jian Wang","is_ca":false},{"name":"Xiaohu Tang","is_ca":false},{"name":"Qun Mo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01733816768298668,"gpt":0.2411272976174766,"spread":0.2237891299344899,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005409121,0.002222508,0.002042834,0.001506864,0.0008848934,0.001946077,0.002348779,0.003771287,0.004457376],"category_scores_gemma":[0.04628723,0.001167999,0.001527417,0.001414238,0.004116701,0.008121405,0.006483866,0.006311618,0.001978646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007909235,"about_ca_system_score_gemma":0.001767103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007966923,"about_ca_topic_score_gemma":0.0004055287,"domain_scores_codex":[0.9953306,0.001027592,0.0002580165,0.0009829958,0.001848532,0.0005522801],"domain_scores_gemma":[0.9817908,0.01226456,0.001651515,0.002100206,0.001592581,0.0006003309],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001395403,0.0001719375,0.002072172,0.001275954,0.0001848075,0.001505539,0.0007842586,0.2319044,0.07562893,0.5873135,0.009699248,0.08806384],"study_design_scores_gemma":[0.0001258953,0.0003966161,0.0007919375,0.0001649332,0.00004127815,0.0006172328,0.000147155,0.7703777,0.02482751,0.1972387,0.005175734,0.00009529101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01811667,0.0008050615,0.9755587,0.0009682519,0.0001168259,0.0000612095,0.0002005618,0.0003100969,0.00386253],"genre_scores_gemma":[0.6496482,0.002667128,0.3393486,0.001429501,0.0007338763,0.000607746,0.001140877,0.000414661,0.004009423],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005409121,"threshold_uncertainty_score":0.02860653,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1202875439","doi":"10.1007/s10208-015-9276-6","title":"Generalized Sampling and Infinite-Dimensional Compressed Sensing","year":2015,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":181,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Sampling theory; Compressed sensing; Mathematics; Discretization; Sampling (signal processing); Nyquist–Shannon sampling theorem; Hilbert space; Key (lock); Restricted isometry property; Applied mathematics; Nyquist rate; Separable space; Property (philosophy); Calculus (dental); Algorithm; Mathematical optimization; Computer science; Mathematical analysis; Sample size determination","authors":[{"name":"Ben Adcock","is_ca":true},{"name":"Anders C. Hansen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07041629827848618,"gpt":0.2977721634683665,"spread":0.2273558651898804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001632299,0.00126642,0.001376927,0.001167669,0.000420843,0.001756889,0.001117214,0.001688516,0.002319856],"category_scores_gemma":[0.008301822,0.0004511721,0.0007076508,0.001856931,0.003601633,0.003008183,0.0017442,0.003327894,0.0003890666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008950475,"about_ca_system_score_gemma":0.0006845901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001877072,"about_ca_topic_score_gemma":0.001610945,"domain_scores_codex":[0.9987754,0.0006356392,0.00005418121,0.0001675677,0.0003022864,0.00006491696],"domain_scores_gemma":[0.9960646,0.002905161,0.0002510576,0.0003782317,0.0003083859,0.00009256801],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003528003,0.00001493691,0.0001167827,0.0001062837,0.00001879932,0.00006772652,0.000076497,0.03745153,0.0009726819,0.9445823,0.001539144,0.01501803],"study_design_scores_gemma":[0.000009102768,0.00001482922,0.00009519103,0.00002042529,0.000006136094,0.00004998374,0.00001826972,0.1374288,0.0001961135,0.860032,0.002115048,0.00001411429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01211994,0.006346825,0.9672752,0.002014619,0.0004355117,0.00001567558,0.0001850802,0.0001208784,0.01148631],"genre_scores_gemma":[0.6866731,0.0158166,0.2767959,0.001475321,0.002890313,0.0002008655,0.0006312131,0.000129496,0.01538726],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002319856,"threshold_uncertainty_score":0.008632541,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986219860","doi":"10.1137/050641983","title":"Approximating K‐means‐type Clustering via Semidefinite Programming","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":173,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Rounding; Semidefinite programming; Cluster analysis; Mathematics; Biclustering; Mathematical optimization; Linear programming; Matrix (chemical analysis); Spectral clustering; Algorithm; Computer science; Correlation clustering; CURE data clustering algorithm","authors":[{"name":"Jiming Peng","is_ca":true},{"name":"Wei Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01519857273548734,"gpt":0.2395324510064849,"spread":0.2243338782709975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002451526,0.001623138,0.001390661,0.0008317751,0.0006505387,0.001381533,0.001506627,0.001549524,0.002527519],"category_scores_gemma":[0.006623043,0.0009372588,0.001065689,0.001246791,0.001517649,0.001615227,0.001446249,0.003024476,0.0007915326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001452688,"about_ca_system_score_gemma":0.001713842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004548074,"about_ca_topic_score_gemma":0.005756875,"domain_scores_codex":[0.9982007,0.0009150529,0.00006655527,0.0002785907,0.000410092,0.0001290595],"domain_scores_gemma":[0.9960397,0.002896786,0.0002894277,0.000233668,0.0004344982,0.000105794],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004728554,0.00005755394,0.0002146534,0.00008918329,0.00002282945,0.00003589242,0.00005251217,0.9609562,0.000998926,0.02078453,0.002230201,0.01451029],"study_design_scores_gemma":[0.000004636051,0.000008151864,0.00001832819,0.000003103233,0.000001176081,0.000006179672,0.000007986792,0.9940802,0.0001942581,0.005498393,0.0001747389,0.000002826037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006136537,0.00007875232,0.9917807,0.0001821078,0.00001581538,0.0000354105,0.00007832845,0.0002367709,0.001455433],"genre_scores_gemma":[0.2696442,0.0003670396,0.7244222,0.0003261922,0.00006410952,0.0004541636,0.0008082787,0.0003015735,0.003612131],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004548074,"threshold_uncertainty_score":0.01296508,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125889434","doi":"10.1155/imrn.2005.4019","title":"","year":2005,"lang":"en","type":"article","venue":"International Mathematics Research Notices","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":170,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Ryerson University; University of Missouri; National Science Foundation","keywords":"Mathematics","authors":[{"name":"Mark Rudelson","is_ca":false},{"name":"Roman Vershynin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1056571304988999,"gpt":0.392955741318173,"spread":0.2872986108192732,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00225397,0.001430625,0.001158262,0.002226145,0.001848639,0.004015059,0.003021992,0.002922477,0.02261465],"category_scores_gemma":[0.01193118,0.0007686235,0.002145839,0.001469114,0.003694055,0.007207627,0.005530426,0.00439844,0.00629646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002565314,"about_ca_system_score_gemma":0.001915072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002662777,"about_ca_topic_score_gemma":0.002415845,"domain_scores_codex":[0.9978326,0.0005458519,0.0001101419,0.0007494911,0.0005588625,0.0002030858],"domain_scores_gemma":[0.9950942,0.001924458,0.0003823001,0.00120795,0.001028806,0.0003623188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001288627,0.0000178109,0.0003806991,0.00005651726,0.00001323356,0.00006759826,0.0001229444,0.006268474,0.0005780243,0.9750215,0.003511975,0.01394838],"study_design_scores_gemma":[0.000009966159,0.00004168127,0.0002945429,0.00007007533,0.00001739935,0.0002303779,0.000113066,0.07051992,0.00116017,0.8653852,0.06212777,0.00002980034],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.005155079,0.0008968164,0.9378729,0.004306987,0.0005015194,0.00008247977,0.0004654184,0.0002373432,0.05048144],"genre_scores_gemma":[0.2671678,0.003292184,0.6509039,0.005483078,0.001891606,0.0007966644,0.001508993,0.0007884612,0.06816734],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9773853,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042860556","doi":"10.1007/s10107-008-0261-6","title":"Primal-dual first-order methods with $${\\mathcal {O}(1/\\epsilon)}$$ iteration-complexity for cone programming","year":2009,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":154,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Semidefinite programming; Second-order cone programming; Linear programming; Cone (formal languages); Convex optimization; Rank (graph theory); Regular polygon; Combinatorics; Mathematical optimization; Discrete mathematics; Algorithm","authors":[{"name":"Guanghui Lan","is_ca":false},{"name":"Zhaosong Lu","is_ca":true},{"name":"Renato D. C. Monteiro","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04902607468451811,"gpt":0.3262534941219266,"spread":0.2772274194374085,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004369251,0.002529753,0.00171495,0.001080839,0.001013545,0.002637667,0.002736154,0.002194354,0.01298257],"category_scores_gemma":[0.01636166,0.000917559,0.001214336,0.001334474,0.002562608,0.003425905,0.003283538,0.008854479,0.002809998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002281171,"about_ca_system_score_gemma":0.003585122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004430411,"about_ca_topic_score_gemma":0.008190772,"domain_scores_codex":[0.9983374,0.0007364145,0.00006498906,0.000138021,0.0005909075,0.0001323313],"domain_scores_gemma":[0.9920667,0.006144964,0.0002697514,0.0005811114,0.0006896323,0.0002477726],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00033493,0.0004157904,0.000424219,0.0004741124,0.00006514291,0.0001132164,0.0001697067,0.2961376,0.001548022,0.5682063,0.01720364,0.1149075],"study_design_scores_gemma":[0.00003833136,0.00003029078,0.00005130546,0.00003229047,0.000008100727,0.00002591669,0.00001789438,0.8937531,0.0004963892,0.1030397,0.002494893,0.00001188986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002039945,0.0003683254,0.9907013,0.0006580886,0.0001494447,0.00007256313,0.00008957838,0.0002370918,0.005683643],"genre_scores_gemma":[0.08920204,0.0006511151,0.8926027,0.0004495247,0.0002763906,0.000837933,0.0002867866,0.0008298001,0.01486371],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01298257,"threshold_uncertainty_score":0.04343104,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103351706","doi":"10.1109/icassp.2012.6288775","title":"Approximating signals supported on graphs","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":150,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science","authors":[{"name":"Xiaofan Zhu","is_ca":true},{"name":"Michael Rabbat","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02411154975420832,"gpt":0.2379932250956133,"spread":0.213881675341405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006179961,0.0007890208,0.0005139695,0.001537307,0.0003388292,0.001055302,0.0007548418,0.0009856039,0.001426964],"category_scores_gemma":[0.006071039,0.0003178138,0.000432079,0.001063602,0.001295199,0.001573873,0.001146742,0.001279667,0.0003335114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004864371,"about_ca_system_score_gemma":0.0002469306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001149689,"about_ca_topic_score_gemma":0.0009427299,"domain_scores_codex":[0.9995503,0.0001345106,0.00001684741,0.00009730352,0.0001369226,0.00006414121],"domain_scores_gemma":[0.9977222,0.001446184,0.0002094677,0.0002986589,0.0002396423,0.00008382022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00044795,0.00007328389,0.00301957,0.0002469921,0.00006991823,0.0005690336,0.000453044,0.4943377,0.04931701,0.3578235,0.002311778,0.09133026],"study_design_scores_gemma":[0.00001799304,0.000061374,0.0007892165,0.00002242861,0.00001155646,0.0001354847,0.0001274513,0.8434093,0.004726084,0.1490659,0.001611677,0.00002150278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1504017,0.0002455713,0.845673,0.000399334,0.00005629072,0.00002504223,0.0001596552,0.0002254362,0.002813953],"genre_scores_gemma":[0.8660617,0.000591699,0.1302805,0.0001633249,0.0001148111,0.00005357729,0.0004387551,0.0001097032,0.002185993],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001537307,"threshold_uncertainty_score":0.004773676,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070145771","doi":"10.1364/ol.39.002044","title":"Dual-coded compressive hyperspectral imaging","year":2014,"lang":"en","type":"article","venue":"Optics Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":150,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Hyperspectral imaging; Compressed sensing; Optics; Full spectral imaging; Data cube; Spectral imaging; Image resolution; Computer science; Iterative reconstruction; Image processing; Optical coherence tomography; Computer vision; Artificial intelligence; Remote sensing; Physics; Image (mathematics); Geology","authors":[{"name":"Xing Lin","is_ca":false},{"name":"Gordon Wetzstein","is_ca":false},{"name":"Yebin Liu","is_ca":false},{"name":"Qionghai Dai","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006768574504163851,"gpt":0.1985659125949414,"spread":0.1917973380907776,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002254658,0.0004182323,0.0003084586,0.0003672782,0.0001911342,0.0005109078,0.0007345593,0.0004382991,0.001531296],"category_scores_gemma":[0.0007543245,0.0001847109,0.0001792112,0.0003894141,0.0006405346,0.0009623931,0.00103453,0.0007591521,0.0003009998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003081112,"about_ca_system_score_gemma":0.000415219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004345963,"about_ca_topic_score_gemma":0.0009423089,"domain_scores_codex":[0.9997463,0.0000415361,0.000008448395,0.00004363928,0.0001346299,0.00002536513],"domain_scores_gemma":[0.9996662,0.0001029397,0.00004702252,0.00007552779,0.00007774151,0.00003060079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0005501459,0.0002169741,0.0009839095,0.0002420864,0.00005106683,0.0003446418,0.0002080512,0.1009177,0.5123132,0.1424128,0.003093041,0.2386665],"study_design_scores_gemma":[0.00003127504,0.0001067261,0.0002606168,0.00002024652,0.00001218483,0.0003002311,0.00003048582,0.8461643,0.1353928,0.01202367,0.005622889,0.00003461537],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0644086,0.0003402456,0.9258226,0.0004015331,0.00009684332,0.00005051633,0.0001377779,0.0002650592,0.008476967],"genre_scores_gemma":[0.4686099,0.0003915092,0.5246828,0.0002258278,0.00009671287,0.0000942792,0.0002321509,0.00004654016,0.005620321],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001531296,"threshold_uncertainty_score":0.005122721,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119047398","doi":"10.1109/tip.2014.2360122","title":"Bayesian Nonparametric Dictionary Learning for Compressed Sensing MRI","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":148,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Artificial intelligence; Computer science; Pattern recognition (psychology); Bayesian probability; Nonparametric statistics; Compressed sensing; Machine learning; Mathematics; Statistics","authors":[{"name":"Yue Huang","is_ca":false},{"name":"John Paisley","is_ca":false},{"name":"Qin Lin","is_ca":false},{"name":"Xinghao Ding","is_ca":false},{"name":"Xueyang Fu","is_ca":false},{"name":"Xiao–Ping Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01031610926605511,"gpt":0.2357773531748147,"spread":0.2254612439087596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001859782,0.0006847734,0.0008955828,0.0005879598,0.0003119959,0.000790948,0.0013892,0.001316884,0.001535947],"category_scores_gemma":[0.007627701,0.0005642715,0.0007000623,0.0007446039,0.001215629,0.001528846,0.001179901,0.002049647,0.000706476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007380047,"about_ca_system_score_gemma":0.000939068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00208985,"about_ca_topic_score_gemma":0.00218728,"domain_scores_codex":[0.9990213,0.0004638692,0.00003393427,0.0001101259,0.0003249937,0.000045764],"domain_scores_gemma":[0.9974573,0.001693024,0.0002645355,0.0002443694,0.0002694717,0.00007126601],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006667073,0.00005201753,0.0004810219,0.0001473238,0.00004319324,0.0000803314,0.00007284241,0.7895442,0.004872103,0.1532425,0.002796526,0.04860125],"study_design_scores_gemma":[0.000005004513,0.00001119852,0.00004286137,0.000006612021,0.000002795491,0.00002760056,0.000002783296,0.9815447,0.0004381071,0.01699874,0.0009132782,0.000006411171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008854244,0.00008914227,0.99849,0.0001324265,0.000009335932,0.000008157752,0.00001808972,0.00004985738,0.0003175343],"genre_scores_gemma":[0.1996916,0.001101299,0.793806,0.000420733,0.0002105083,0.0003203104,0.0003770916,0.0002130901,0.003859247],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00208985,"threshold_uncertainty_score":0.009835601,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063761188","doi":"10.1007/s10107-013-0722-4","title":"Iterative reweighted minimization methods for $$l_p$$ l p regularized unconstrained nonlinear programming","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":141,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lipschitz continuity; Mathematics; Minification; Sequence (biology); Convergence (economics); Iterative method; Stationary point; Combinatorics; Applied mathematics; Nonlinear system; Linear programming; Algorithm; Mathematical optimization; Mathematical analysis; Physics","authors":[{"name":"Zhaosong Lu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02348848813503768,"gpt":0.3072439672906072,"spread":0.2837554791555695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002437649,0.001908203,0.001393882,0.000972059,0.0005773993,0.001672499,0.002442308,0.00260132,0.006233483],"category_scores_gemma":[0.009634188,0.001085022,0.001021197,0.001179254,0.001885732,0.002146362,0.002730688,0.003111875,0.001958728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009340352,"about_ca_system_score_gemma":0.001843663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003407365,"about_ca_topic_score_gemma":0.004736338,"domain_scores_codex":[0.9988772,0.0005485584,0.00004767246,0.0001759307,0.0002981467,0.00005247713],"domain_scores_gemma":[0.9971656,0.001869868,0.0001704561,0.000229984,0.000486747,0.00007725408],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009431022,0.000121297,0.0002533628,0.0005254612,0.0001081274,0.0001378454,0.0001400634,0.6840877,0.004001985,0.1662543,0.01351351,0.1307621],"study_design_scores_gemma":[0.000006506311,0.00001166719,0.00001890456,0.00001416817,0.000005233056,0.00001591287,0.000009243683,0.9807141,0.0004959094,0.01682057,0.001880638,0.000007152882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005849657,0.00009638225,0.9980508,0.0001315058,0.00003536873,0.00002161113,0.00002790074,0.00007475645,0.0009767497],"genre_scores_gemma":[0.04140506,0.0004140677,0.9490022,0.0002238658,0.000163693,0.000410675,0.0002593827,0.0004055341,0.007715438],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006233483,"threshold_uncertainty_score":0.0208531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167967601","doi":"","title":"Convex Neural Networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":138,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Convexity; Artificial neural network; Computer science; Artificial intelligence; Regular polygon; Classifier (UML); Convex optimization; Mathematical optimization; Machine learning; Mathematics","authors":[{"name":"Yoshua Bengio","is_ca":true},{"name":"Nicolas Le Roux","is_ca":true},{"name":"Pascal Vincent","is_ca":true},{"name":"Olivier Delalleau","is_ca":true},{"name":"Patrice Marcotte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009626347794534085,"gpt":0.2043099468584142,"spread":0.1946835990638801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001742574,0.001438348,0.001405201,0.000790274,0.0005673636,0.002052258,0.001264713,0.001448835,0.006293101],"category_scores_gemma":[0.009060871,0.000531687,0.0006126819,0.001257282,0.001951141,0.00207622,0.001882621,0.002896486,0.001683938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00145613,"about_ca_system_score_gemma":0.0009583465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002621346,"about_ca_topic_score_gemma":0.002627867,"domain_scores_codex":[0.9985876,0.0006228008,0.00007560188,0.0002311651,0.0003812366,0.0001016098],"domain_scores_gemma":[0.9976331,0.001494572,0.0001851726,0.0002041088,0.0004054313,0.00007767187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005321741,0.00001565408,0.0004067362,0.0002137081,0.00005697527,0.0001170569,0.00004939505,0.3582317,0.0007778515,0.5751981,0.01257198,0.05230776],"study_design_scores_gemma":[0.000007134819,0.00001188447,0.0001495902,0.00004554291,0.000006906629,0.00005087501,0.00001292456,0.689663,0.0003694813,0.3000134,0.009658405,0.00001097221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003535314,0.005254569,0.9577979,0.001788637,0.0003287678,0.00004662994,0.0003661711,0.0001447019,0.0307372],"genre_scores_gemma":[0.5833037,0.02801617,0.3264634,0.00167133,0.002154137,0.0007695059,0.002242981,0.0005179627,0.05486083],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006293101,"threshold_uncertainty_score":0.02105248,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077318038","doi":"10.1109/twc.2012.121412.120148","title":"STCDG: An Efficient Data Gathering Algorithm Based on Matrix Completion for Wireless Sensor Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":133,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Wireless sensor network; Computer science; Matrix completion; Compressed sensing; Network packet; Adaptability; Algorithm; Data collection; Data loss; Stability (learning theory); Set (abstract data type); Optimization problem; Real-time computing; Mathematics; Machine learning; Computer network","authors":[{"name":"Jie Cheng","is_ca":false},{"name":"Qiang Ye","is_ca":true},{"name":"Hongbo Jiang","is_ca":false},{"name":"Dan Wang","is_ca":false},{"name":"Chonggang Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06246138348487786,"gpt":0.3076555059859662,"spread":0.2451941225010884,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009710375,0.001308771,0.001121423,0.001273769,0.000753964,0.0005743757,0.001490891,0.001005026,0.001780894],"category_scores_gemma":[0.002658763,0.0004513829,0.0007368476,0.001626524,0.0009493677,0.001629909,0.002145505,0.00212609,0.0008680683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000694198,"about_ca_system_score_gemma":0.001819486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004457245,"about_ca_topic_score_gemma":0.005080777,"domain_scores_codex":[0.9992177,0.0001538179,0.00004090734,0.000132828,0.0003842239,0.00007044118],"domain_scores_gemma":[0.9989333,0.0003958509,0.0001314062,0.0001815522,0.0002668431,0.00009116596],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003417224,0.0001727584,0.0005895923,0.0002353371,0.00005991983,0.0001705473,0.0002964458,0.3936656,0.03334834,0.01574088,0.01086484,0.5445139],"study_design_scores_gemma":[0.00002740027,0.00008409405,0.0001013633,0.000008175605,0.000004416326,0.00006547228,0.00002753355,0.9881741,0.004478677,0.004263431,0.002749621,0.00001577399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003174903,0.0001453853,0.9952065,0.0001105977,0.00003723499,0.0000740182,0.00005987995,0.0008385002,0.0003529518],"genre_scores_gemma":[0.08141454,0.0002278828,0.9157864,0.0001331376,0.00004933111,0.0002414571,0.0004509614,0.0001460677,0.001550157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004457245,"threshold_uncertainty_score":0.008862555,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964248738","doi":"10.1214/17-aos1568","title":"I-LAMM for sparse learning: Simultaneous control of algorithmic complexity and statistical error","year":2018,"lang":"en","type":"article","venue":"The Annals of Statistics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":131,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"National Human Genome Research Institute; National Institute of General Medical Sciences; National Institute of Mental Health; Science and Technology Commission of Shanghai Municipality; National Institutes of Health; National Science Foundation","keywords":"Sublinear function; Estimator; Mathematics; Mathematical optimization; Algorithm; Computational complexity theory; Rate of convergence; Sequence (biology); Minification; Convex optimization; Applied mathematics; Regular polygon; Computer science; Discrete mathematics","authors":[{"name":"Jianqing Fan","is_ca":false},{"name":"Han Liu","is_ca":false},{"name":"Qiang Sun","is_ca":true},{"name":"Tong Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0968039069539006,"gpt":0.3350539315426729,"spread":0.2382500245887723,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003779629,0.001329057,0.001045679,0.0007517805,0.0005663176,0.001216621,0.002469123,0.001419765,0.00143566],"category_scores_gemma":[0.01359654,0.0007214919,0.0008050239,0.0006881206,0.002543882,0.001981854,0.003452075,0.002848601,0.0004787449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001097021,"about_ca_system_score_gemma":0.001791957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009758003,"about_ca_topic_score_gemma":0.001522667,"domain_scores_codex":[0.9983749,0.0007813897,0.00006158344,0.0002192596,0.0004560471,0.0001068379],"domain_scores_gemma":[0.993777,0.004416327,0.0005474976,0.0006745095,0.0004312606,0.000153322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001102631,0.00008031286,0.0009751143,0.0002159266,0.0000676935,0.00009705751,0.0001484057,0.7717878,0.007027404,0.1567943,0.001604956,0.06109087],"study_design_scores_gemma":[0.000006534347,0.00003441953,0.00003656221,0.00000610398,0.000003129539,0.00001529633,0.000005872778,0.9795726,0.00107715,0.01886979,0.0003660213,0.000006531295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001991404,0.00004428517,0.9974368,0.00009568672,0.000007101146,0.00001537273,0.000006895485,0.00008810712,0.0003144645],"genre_scores_gemma":[0.170481,0.0002187694,0.8268829,0.0002631582,0.0001019795,0.0003653012,0.00009448513,0.0002264461,0.001365964],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003779629,"threshold_uncertainty_score":0.01998883,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102138843","doi":"","title":"Practical Large-Scale Optimization for Max-norm Regularization","year":2010,"lang":"en","type":"article","venue":"CaltechAUTHORS (California Institute of Technology)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":131,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Air Force Office of Scientific Research; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency","keywords":"Norm (philosophy); Computer science; Mathematical optimization; Regular polygon; Cluster analysis; Matrix decomposition; Scalability; Algorithm; Mathematics; Theoretical computer science; Artificial intelligence; Eigenvalues and eigenvectors","authors":[{"name":"Jason D. Lee","is_ca":false},{"name":"Ben Recht","is_ca":false},{"name":"Nathan Srebro","is_ca":false},{"name":"Joel A. Tropp","is_ca":false},{"name":"Ruslan Salakhutdinov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01366517478085955,"gpt":0.2614087523939279,"spread":0.2477435776130683,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003008409,0.001814528,0.001214857,0.0005389649,0.0007832465,0.001512886,0.001679694,0.001852614,0.005837749],"category_scores_gemma":[0.00985307,0.0006598183,0.0007158802,0.001160594,0.002121394,0.002757312,0.002489015,0.00442322,0.002058348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001349633,"about_ca_system_score_gemma":0.001870844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002150297,"about_ca_topic_score_gemma":0.002932497,"domain_scores_codex":[0.9980803,0.0007846667,0.00006823524,0.000377888,0.0005707592,0.0001182989],"domain_scores_gemma":[0.9955974,0.002885205,0.000251923,0.0006142275,0.0005192469,0.0001319803],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001758277,0.0001287728,0.0003586813,0.0002731513,0.00005015215,0.0001120923,0.000129727,0.6296468,0.005757149,0.2228284,0.01575395,0.1247853],"study_design_scores_gemma":[0.000008393001,0.00002072359,0.00003484836,0.000008330331,0.000002285484,0.00002281533,0.000009383906,0.9575914,0.001021014,0.03922366,0.002051092,0.000006013047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008450956,0.00009418008,0.9973637,0.0001883069,0.0000248092,0.00002001855,0.00002372039,0.0001548134,0.001285277],"genre_scores_gemma":[0.09587672,0.0004470962,0.8973876,0.0002646377,0.0002159094,0.0003099437,0.0002669092,0.000296972,0.004934231],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005837749,"threshold_uncertainty_score":0.01952916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158703881","doi":"","title":"Convex Multi-view Subspace Learning","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":128,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Subspace topology; Representation (politics); Independence (probability theory); Computer science; Conditional independence; Regular polygon; Object (grammar); Curse of dimensionality; Convex optimization; Feature learning; Artificial intelligence; Pattern recognition (psychology); Algorithm; Mathematical optimization; Theoretical computer science; Mathematics","authors":[{"name":"Martha White","is_ca":true},{"name":"Xinhua Zhang","is_ca":true},{"name":"Dale Schuurmans","is_ca":true},{"name":"Yaoliang Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02734920725914874,"gpt":0.2444688990466884,"spread":0.2171196917875397,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009990551,0.001353923,0.001750203,0.0006338611,0.0004093545,0.001067367,0.001475475,0.001213047,0.002741407],"category_scores_gemma":[0.004115237,0.0005980546,0.0008036271,0.001379955,0.001019486,0.001727902,0.001775287,0.002052421,0.00138833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005933212,"about_ca_system_score_gemma":0.000786921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002394776,"about_ca_topic_score_gemma":0.002475383,"domain_scores_codex":[0.9989489,0.0004036462,0.00004429909,0.0002196858,0.00031967,0.00006389492],"domain_scores_gemma":[0.9985921,0.0006196765,0.0001285119,0.00032654,0.0002684012,0.00006472665],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001467313,0.00009181337,0.0005715466,0.0002197482,0.0001157248,0.000142574,0.00009338756,0.6535103,0.008635802,0.05084626,0.01103453,0.2745915],"study_design_scores_gemma":[0.00000571684,0.00001957376,0.0000726527,0.000005384711,0.000003531783,0.0000449823,0.000008019171,0.9880477,0.00120893,0.009498934,0.001076954,0.000007551642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001306108,0.0001127394,0.9978001,0.00006456217,0.00001008068,0.00001467917,0.00004540541,0.0001463876,0.0004998547],"genre_scores_gemma":[0.1993541,0.000856161,0.7937003,0.00023443,0.0001414206,0.0002201317,0.001248966,0.0001862711,0.004058201],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002741407,"threshold_uncertainty_score":0.00917089,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964011032","doi":"10.1109/tsp.2017.2664054","title":"CaSCADE: Compressed Carrier and DOA Estimation","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":123,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Azrieli Foundation; Israel Science Foundation","keywords":"Compressed sensing; Computer science; Nyquist rate; Cognitive radio; Narrowband; Wideband; Signal reconstruction; Algorithm; Direction of arrival; Nyquist–Shannon sampling theorem; Sampling (signal processing); SIGNAL (programming language); Context (archaeology); Signal processing; Electronic engineering; Telecommunications; Detector; Wireless; Engineering; Computer vision","authors":[{"name":"Shahar Stein Ioushua","is_ca":false},{"name":"Or Yair","is_ca":false},{"name":"Déborah Cohen","is_ca":false},{"name":"Yonina C. Eldar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02455861300354502,"gpt":0.2667963627080747,"spread":0.2422377497045297,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006647573,0.001005131,0.0008760076,0.000717448,0.0003470726,0.0007467417,0.001239676,0.001271006,0.003096391],"category_scores_gemma":[0.003777376,0.0003868205,0.0004774418,0.0009129703,0.0006420498,0.001988872,0.001757845,0.0009973329,0.001026482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003835362,"about_ca_system_score_gemma":0.000749012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002966788,"about_ca_topic_score_gemma":0.002946113,"domain_scores_codex":[0.9987637,0.0002326728,0.00005420259,0.000286811,0.0005716481,0.00009103458],"domain_scores_gemma":[0.9989556,0.0004239392,0.0001426943,0.0002205097,0.0002141309,0.00004317978],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001024381,0.0001942695,0.002257226,0.000312401,0.0001046102,0.0007184484,0.0003570514,0.1944291,0.08179335,0.03328282,0.004797654,0.6807287],"study_design_scores_gemma":[0.00003722963,0.000184637,0.000738707,0.0000304439,0.00002708299,0.0005544095,0.00004066593,0.9690695,0.01797732,0.006848646,0.004452338,0.00003900241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01562871,0.0003861744,0.9800094,0.0001747077,0.00006752458,0.00007093807,0.00009899417,0.0004823222,0.003081246],"genre_scores_gemma":[0.4897662,0.0006262017,0.502466,0.000306066,0.000251481,0.0001612599,0.0005345705,0.000078488,0.005809663],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003096391,"threshold_uncertainty_score":0.01035851,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2523748411","doi":"10.1137/15m1044448","title":"Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes","year":2016,"lang":"en","type":"article","venue":"SIAM Journal on Imaging Sciences","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":119,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Convergence (economics); Lagrange multiplier; Multiplier (economics); Mathematics; Acceleration; Applied mathematics; Augmented Lagrangian method; Rate of convergence; Mathematical optimization; Algorithm; Computer science; Key (lock); Physics","authors":[{"name":"Bing-sheng He","is_ca":false},{"name":"Feng Ma","is_ca":false},{"name":"Xiaoming Yuan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01682641206356529,"gpt":0.2467428711733324,"spread":0.2299164591097671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009159404,0.001788422,0.001369767,0.0009498242,0.0006336328,0.001268657,0.001634903,0.002327547,0.0031157],"category_scores_gemma":[0.02423681,0.0004688406,0.001867872,0.000634997,0.001941356,0.00260405,0.002223505,0.003381901,0.0005914769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008719874,"about_ca_system_score_gemma":0.001716384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002626233,"about_ca_topic_score_gemma":0.001494458,"domain_scores_codex":[0.9981918,0.0009221727,0.00009723903,0.0002290425,0.0004403619,0.000119449],"domain_scores_gemma":[0.9881337,0.007747241,0.0006803935,0.0008304623,0.002312651,0.0002955552],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000342296,0.0001232036,0.002358821,0.0007066875,0.0002097154,0.0007083465,0.0003060373,0.6464272,0.00711452,0.2914115,0.006248511,0.04404321],"study_design_scores_gemma":[0.00001699195,0.00005630314,0.000178323,0.00004069213,0.00001713322,0.00009399867,0.00002157952,0.9797555,0.0007525026,0.01817681,0.000877204,0.00001287128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01677727,0.001538313,0.972762,0.0009909291,0.0002296344,0.00006807026,0.00006082658,0.000117542,0.007455376],"genre_scores_gemma":[0.5297138,0.004126489,0.4514624,0.001083015,0.0005149777,0.000436132,0.0005233519,0.0003193446,0.01182043],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009159404,"threshold_uncertainty_score":0.0484401,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116616571","doi":"10.1007/s10107-011-0459-x","title":"Nuclear norm minimization for the planted clique and biclique problems","year":2011,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":119,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Complete bipartite graph; Mathematics; Combinatorics; Bipartite graph; Clique problem; Clique; Matrix norm; Generalization; Discrete mathematics; Minification; Graph; Mathematical optimization; Line graph; Pathwidth","authors":[{"name":"Brendan Ames","is_ca":true},{"name":"Stephen A. Vavasis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04039522035801042,"gpt":0.2216688850264545,"spread":0.1812736646684441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003277177,0.001381983,0.001926695,0.001232781,0.0009968142,0.00229636,0.002968277,0.003147675,0.005903425],"category_scores_gemma":[0.0156144,0.001027201,0.0009008556,0.001982713,0.003294548,0.004220735,0.002882087,0.004238251,0.000676272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002354746,"about_ca_system_score_gemma":0.002162471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004527499,"about_ca_topic_score_gemma":0.006285412,"domain_scores_codex":[0.9984195,0.0008413153,0.00003591126,0.000271857,0.0003166915,0.0001146168],"domain_scores_gemma":[0.9928531,0.005503605,0.0004679832,0.0002950621,0.0005222,0.0003580782],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009414746,0.0001039647,0.0003513764,0.0002450241,0.00004861136,0.00006191099,0.0001294021,0.2594862,0.0007522504,0.7115536,0.007569819,0.01960371],"study_design_scores_gemma":[0.00001809061,0.00002019509,0.0001225488,0.00002278887,0.000006302221,0.00002880749,0.00004119814,0.6255973,0.0001781498,0.3724661,0.001482957,0.00001564409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01711004,0.0006193087,0.9703078,0.002109628,0.00009957933,0.000063375,0.0003365272,0.00007628404,0.009277417],"genre_scores_gemma":[0.4093917,0.002396411,0.5488406,0.001088431,0.0007916455,0.0009752117,0.001737247,0.0005328671,0.03424605],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005903425,"threshold_uncertainty_score":0.01974893,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080902082","doi":"10.1137/120886753","title":"Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs","year":2013,"lang":"en","type":"article","venue":"SIAM Journal on Numerical Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":119,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Rate of convergence; Convergence (economics); Quadratic equation; Mathematics; Applied mathematics; Local convergence; Convergence tests; Normal convergence; Mathematical optimization; Compact convergence; Quadratic programming; Computer science; Iterative method; Geometry; Key (lock)","authors":[{"name":"Deren Han","is_ca":false},{"name":"Xiaoming Yuan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01578720993470217,"gpt":0.2747935385947342,"spread":0.259006328660032,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005429577,0.001612677,0.001092193,0.000949208,0.0004769844,0.001106613,0.001150221,0.00144539,0.003327557],"category_scores_gemma":[0.01390338,0.0004876207,0.0009514123,0.0007281555,0.002108387,0.002087297,0.002249595,0.003054179,0.001033091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000711705,"about_ca_system_score_gemma":0.001234191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001251789,"about_ca_topic_score_gemma":0.001212755,"domain_scores_codex":[0.9983335,0.0009384312,0.00005406095,0.0001827277,0.0003941021,0.00009722419],"domain_scores_gemma":[0.9943538,0.004143296,0.0003204087,0.0002500396,0.0007622461,0.0001702915],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001736357,0.00009373017,0.0007336882,0.0007026456,0.00008987814,0.0003108454,0.0003412082,0.6046877,0.006946835,0.3045644,0.006798754,0.07455658],"study_design_scores_gemma":[0.00001036254,0.00005358033,0.00005777001,0.00003045012,0.000006682391,0.00006456257,0.00001462407,0.9636931,0.0009750852,0.03351709,0.001566703,0.00001000232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002530088,0.0005417278,0.9935875,0.000229573,0.00003401129,0.00002092449,0.00001818681,0.00009261349,0.002945348],"genre_scores_gemma":[0.2943378,0.002718632,0.6871416,0.0005630727,0.0003414899,0.0004921766,0.0002486011,0.0005421241,0.01361453],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005429577,"threshold_uncertainty_score":0.02871472,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2587753047","doi":"10.48550/arxiv.1702.00071","title":"On orthogonality and learning recurrent networks with long term dependencies","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":116,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Orthogonality; Backpropagation; Artificial neural network; Term (time); Convergence (economics); Stability (learning theory); Computer science; Matrix (chemical analysis); Property (philosophy); Norm (philosophy); Gradient descent; Applied mathematics; Mathematical optimization; Mathematics; Artificial intelligence; Machine learning","authors":[{"name":"Eugene Vorontsov","is_ca":true},{"name":"Chiheb Trabelsi","is_ca":true},{"name":"Samuel Kadoury","is_ca":true},{"name":"Chris Pal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05629598084733464,"gpt":0.1876238132149216,"spread":0.131327832367587,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003123178,0.001271253,0.0008192796,0.000744142,0.0003908637,0.0009307651,0.001051625,0.001211139,0.001735754],"category_scores_gemma":[0.01667257,0.0007179983,0.0004946131,0.0007293063,0.002259089,0.003090503,0.002172516,0.002361056,0.0003315684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007398027,"about_ca_system_score_gemma":0.0007736643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003225736,"about_ca_topic_score_gemma":0.003601123,"domain_scores_codex":[0.9990519,0.0004634189,0.00004680626,0.0001611409,0.000205914,0.00007087892],"domain_scores_gemma":[0.9920969,0.00618698,0.0006099637,0.0004527375,0.0004996963,0.000153608],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001265724,0.00006130261,0.001086882,0.0001536487,0.00007589075,0.0001286241,0.0001645612,0.7737119,0.006626414,0.1703113,0.001675772,0.04587713],"study_design_scores_gemma":[0.000006013196,0.00002756153,0.0001096935,0.00001209094,0.000004654852,0.00001904177,0.000008126083,0.9518716,0.0007189088,0.0468829,0.0003322754,0.000007162658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02523629,0.0007912426,0.9710299,0.0007970139,0.00004474857,0.00002327628,0.00005476804,0.0001786753,0.001844067],"genre_scores_gemma":[0.6909633,0.003305254,0.2971858,0.000582413,0.0003497737,0.0002214342,0.0004446372,0.00026775,0.006679685],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003225736,"threshold_uncertainty_score":0.01651716,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2294622949","doi":"10.1109/tit.2017.2688381","title":"Exponential Decay of Reconstruction Error From Binary Measurements of Sparse Signals","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":114,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Army Research Office; Simons Foundation; American Institute of Mathematics; National Science Foundation","keywords":"Quantization (signal processing); Oversampling; Algorithm; Compressed sensing; Thresholding; Binary number; Computer science; Normalization (sociology); Signal reconstruction; Exponential function; Mathematics; Signal processing; Artificial intelligence; Bandwidth (computing); Digital signal processing; Arithmetic","authors":[{"name":"Richard G. Baraniuk","is_ca":false},{"name":"Simon Foucart","is_ca":false},{"name":"Deanna Needell","is_ca":false},{"name":"Yaniv Plan","is_ca":true},{"name":"Mary Wootters","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03830852518159136,"gpt":0.2505299503411701,"spread":0.2122214251595788,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00850475,0.001056957,0.001169868,0.000701028,0.0003492363,0.001222975,0.001445028,0.001688499,0.00173692],"category_scores_gemma":[0.05645372,0.0006034361,0.0005395848,0.0006452329,0.002405389,0.003528758,0.002592703,0.002849891,0.0006101575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001244804,"about_ca_system_score_gemma":0.001082701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001396061,"about_ca_topic_score_gemma":0.0009773653,"domain_scores_codex":[0.9959259,0.001028432,0.0002857123,0.0006749599,0.001801271,0.000283699],"domain_scores_gemma":[0.9682521,0.02452719,0.001856781,0.002596099,0.002328364,0.0004393815],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001588363,0.0001790009,0.005582762,0.0008792722,0.0001574534,0.0004913636,0.0007161848,0.6763823,0.06162141,0.1313845,0.002480266,0.1185372],"study_design_scores_gemma":[0.00002227991,0.0001122804,0.001034558,0.00009590545,0.00001295982,0.0001375069,0.00005446043,0.9579249,0.01534881,0.02448726,0.0007373645,0.0000315969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06131441,0.0009149937,0.9339,0.000787013,0.00007371526,0.00003567079,0.0001221541,0.0005000381,0.002352051],"genre_scores_gemma":[0.6607657,0.00138687,0.3309366,0.0005634034,0.00009279799,0.0001850318,0.0005093237,0.0004217717,0.005138448],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00850475,"threshold_uncertainty_score":0.04497796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072327470","doi":"10.1016/j.acha.2009.08.002","title":"Sparse recovery by non-convex optimization – instance optimality","year":2009,"lang":"en","type":"article","venue":"Applied and Computational Harmonic Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":111,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"American Institute of Mathematics","keywords":"Mathematics; Minification; Regular polygon; Convex optimization; Class (philosophy); Compressed sensing; Algorithm; Matrix (chemical analysis); Restricted isometry property; Mathematical optimization; Computer science; Artificial intelligence","authors":[{"name":"Rayan Saab","is_ca":true},{"name":"Özgür Yılmaz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006347213519459692,"gpt":0.2035570372072244,"spread":0.1972098236877647,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003435106,0.002036662,0.002894844,0.001000128,0.0005930863,0.002633729,0.001965235,0.002822009,0.00671164],"category_scores_gemma":[0.02253498,0.001171475,0.001423505,0.00145147,0.002439212,0.00463503,0.002841473,0.0049768,0.0009232136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001642254,"about_ca_system_score_gemma":0.001692545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002307361,"about_ca_topic_score_gemma":0.002254721,"domain_scores_codex":[0.9982765,0.0009247276,0.0000626849,0.0002863517,0.0003266022,0.0001232185],"domain_scores_gemma":[0.9902515,0.008216522,0.0003669811,0.0006142361,0.0003713753,0.0001793055],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002241638,0.0001352253,0.0004433705,0.0002977539,0.0001163192,0.0001059292,0.00009786391,0.5830073,0.001168038,0.3599974,0.01275528,0.04165136],"study_design_scores_gemma":[0.0000295542,0.00002861578,0.00007344478,0.00001841882,0.00001115631,0.0000309575,0.00001534115,0.8373648,0.0004045606,0.160987,0.001027196,0.000009073143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007847988,0.000416406,0.982522,0.001584445,0.00008164999,0.00005647941,0.0002003272,0.0001446765,0.007146131],"genre_scores_gemma":[0.3933613,0.001963831,0.587299,0.0008340536,0.0007992457,0.0005581007,0.001217497,0.0006407984,0.0133261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00671164,"threshold_uncertainty_score":0.02245265,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W765936379","doi":"10.1007/978-1-4614-0769-0_30","title":"Euclidean Distance Matrices and Applications","year":2011,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":110,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Semidefinite embedding; Euclidean distance; Curse of dimensionality; Euclidean geometry; Distance matrices in phylogeny; Computer science; Dimensionality reduction; Euclidean distance matrix; Theoretical computer science; Mathematics; Algorithm; Artificial intelligence; Mathematical optimization; Combinatorics; Quadratically constrained quadratic program","authors":[{"name":"Nathan Krislock","is_ca":true},{"name":"Henry Wolkowicz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05359949354869539,"gpt":0.3679154265439329,"spread":0.3143159329952375,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008336766,0.001331976,0.001359711,0.002815326,0.0005892509,0.002426524,0.001492337,0.001268627,0.01203875],"category_scores_gemma":[0.004283347,0.0004801061,0.0006474035,0.006371704,0.001288968,0.002652068,0.001935695,0.002439608,0.006610541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001039057,"about_ca_system_score_gemma":0.0007499477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001589868,"about_ca_topic_score_gemma":0.0013949,"domain_scores_codex":[0.9989165,0.0002185843,0.00008705493,0.00024803,0.0004825616,0.0000473631],"domain_scores_gemma":[0.998642,0.0005400329,0.0001185187,0.0001855545,0.0004578488,0.00005596768],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002942491,0.00004220362,0.0002573558,0.000407225,0.00003392171,0.00008620859,0.0001233448,0.01847294,0.00102704,0.5981322,0.04046142,0.3409267],"study_design_scores_gemma":[0.0000108648,0.00004971635,0.0005393451,0.0001585271,0.00002400536,0.0006913714,0.0001344658,0.0882334,0.001330598,0.7378738,0.1709031,0.00005079642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004814053,0.06505512,0.8499357,0.001616222,0.002038949,0.00007259325,0.00106875,0.0005047103,0.074894],"genre_scores_gemma":[0.1660926,0.08786674,0.6053754,0.001186066,0.003698126,0.000468201,0.003316569,0.0005784059,0.131418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01203875,"threshold_uncertainty_score":0.04027361,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104417092","doi":"10.1007/s10107-011-0452-4","title":"An augmented Lagrangian approach for sparse principal component analysis","year":2011,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":110,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Sparse PCA; Principal component analysis; Mathematics; Orthogonality; Dimension (graph theory); Algorithm; Uncorrelated; Dimensionality reduction; Applied mathematics; Computer science; Pattern recognition (psychology); Combinatorics; Artificial intelligence; Statistics; Geometry","authors":[{"name":"Zhaosong Lu","is_ca":true},{"name":"Yong Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05386574135832146,"gpt":0.2661403389646625,"spread":0.2122745976063411,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001248914,0.0009059954,0.001053802,0.0008160115,0.0004358258,0.001184431,0.001274034,0.001086675,0.002872517],"category_scores_gemma":[0.003565019,0.0006468543,0.000862854,0.001071346,0.001098195,0.001463132,0.001767342,0.002116847,0.0007124966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004956822,"about_ca_system_score_gemma":0.001321621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002144972,"about_ca_topic_score_gemma":0.002975113,"domain_scores_codex":[0.999494,0.0002368638,0.00001969675,0.00004932381,0.0001701643,0.00003009103],"domain_scores_gemma":[0.9989404,0.0006664029,0.00007781787,0.00007568357,0.0001954789,0.00004425315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003562189,0.00006182313,0.0001824085,0.0001963562,0.00004486619,0.00009105766,0.00008271286,0.6013916,0.00235468,0.3202765,0.005223833,0.07005864],"study_design_scores_gemma":[0.000004202398,0.00001111441,0.00001854146,0.000007170616,0.000004282636,0.00001287411,0.000005569451,0.9656085,0.0001722473,0.03278374,0.001366943,0.000004801556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006163192,0.00007070782,0.9983621,0.00009811961,0.00001982274,0.000007820737,0.00001917676,0.00002368924,0.0007823154],"genre_scores_gemma":[0.06705213,0.0006854304,0.9253128,0.0001649743,0.0001616446,0.0002289159,0.0001977541,0.0001333368,0.006062986],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002872517,"threshold_uncertainty_score":0.00960958,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2758000438","doi":"10.1109/tnnls.2017.2748585","title":"A Novel Pruning Algorithm for Smoothing Feedforward Neural Networks Based on Group Lasso Method","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":109,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Specialized Research Fund for the Doctoral Program of Higher Education of China; Fundamental Research Funds for the Central Universities; Natural Science Foundation of Shandong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"MNIST database; Smoothing; Pruning; Artificial neural network; Generalization; Computer science; Algorithm; Backpropagation; Feedforward neural network; Mathematical optimization; Artificial intelligence; Mathematics; Machine learning","authors":[{"name":"Jian Wang","is_ca":false},{"name":"Chen Xu","is_ca":true},{"name":"Yang Xi-feng","is_ca":false},{"name":"Jacek M. Żurada","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0211540683367614,"gpt":0.2588989068865793,"spread":0.237744838549818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001732245,0.0007382586,0.001231982,0.00093853,0.0005444522,0.0007243034,0.001448168,0.001340948,0.001507576],"category_scores_gemma":[0.003298709,0.00041862,0.0007635112,0.0008869446,0.0005845011,0.001312123,0.0008990027,0.001620976,0.0005197424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003540458,"about_ca_system_score_gemma":0.0008157989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001680042,"about_ca_topic_score_gemma":0.002386707,"domain_scores_codex":[0.9991853,0.0001898277,0.00006102946,0.0001079722,0.0003944428,0.00006148449],"domain_scores_gemma":[0.998887,0.0005105575,0.0001226436,0.0001328043,0.0003062409,0.00004067769],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002423222,0.000114913,0.001179254,0.0002355505,0.0001680976,0.0002426997,0.000172246,0.3878864,0.01954777,0.02604472,0.005396418,0.5587696],"study_design_scores_gemma":[0.00001860491,0.00003779289,0.000205679,0.00001367912,0.00001855937,0.00006120659,0.000007580776,0.9906703,0.002526684,0.004182462,0.002246461,0.00001088984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003728156,0.0001997309,0.9953321,0.00006289806,0.00003979245,0.00002342734,0.00001751973,0.000183527,0.0004128228],"genre_scores_gemma":[0.1341378,0.0005923701,0.8608245,0.000208384,0.0001538923,0.0002352419,0.0002038435,0.0001686583,0.003475434],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001732245,"threshold_uncertainty_score":0.009161115,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033585806","doi":"10.1016/j.acha.2014.06.003","title":"Stable recovery of sparse signals via <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math>-minimization","year":2014,"lang":"lv","type":"article","venue":"Applied and Computational Harmonic Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":109,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Algorithm; Isometry (Riemannian geometry); Combinatorics; Mathematical analysis","authors":[{"name":"Jinming Wen","is_ca":true},{"name":"Dongfang Li","is_ca":false},{"name":"Fumin Zhu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01519296161642072,"gpt":0.22381197671912,"spread":0.2086190151026992,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005115699,0.0006584981,0.0003428352,0.0007839343,0.00026866,0.0008629108,0.0004884613,0.0005054349,0.01254196],"category_scores_gemma":[0.003235028,0.0002434619,0.0004185092,0.001102802,0.0005092737,0.001069088,0.001082305,0.0008616984,0.006105696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002519995,"about_ca_system_score_gemma":0.000726492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001459771,"about_ca_topic_score_gemma":0.002274251,"domain_scores_codex":[0.9996874,0.00006780006,0.00001775515,0.00005267037,0.0001521425,0.00002220107],"domain_scores_gemma":[0.9994819,0.0002177021,0.00005545949,0.0001142818,0.0001108763,0.00001989526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000278662,0.00008516934,0.0005190137,0.0004047562,0.00007046042,0.0002549209,0.0003021699,0.1056069,0.0786714,0.1968051,0.04394028,0.5730611],"study_design_scores_gemma":[0.00003180935,0.0000922369,0.0005983975,0.00005614077,0.00002009398,0.0002909675,0.00009532223,0.8378124,0.04472052,0.0794966,0.03674994,0.00003544652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004393663,0.0001041698,0.9876589,0.0003304331,0.00006019786,0.00003435261,0.0003683656,0.000650859,0.006398951],"genre_scores_gemma":[0.1774733,0.001104558,0.7864071,0.0003231713,0.0002355744,0.0001783747,0.002900585,0.0007939184,0.03058341],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01254196,"threshold_uncertainty_score":0.04195702,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963026027","doi":"10.1109/tsp.2020.2978617","title":"Feature Graph Learning for 3D Point Cloud Denoising","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":109,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Natural Science Foundation of Beijing Municipality; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Algorithm; Laplacian smoothing; Laplacian matrix; Diagonal; Graph; Discrete mathematics; Physics; Geometry","authors":[{"name":"Wei Hu","is_ca":false},{"name":"Xiang Gao","is_ca":false},{"name":"Gene Cheung","is_ca":true},{"name":"Zongming Guo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02119594070735378,"gpt":0.2351633007428574,"spread":0.2139673600355036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007850365,0.000858658,0.00109241,0.001716502,0.0005179052,0.001023685,0.001744758,0.001521522,0.001977782],"category_scores_gemma":[0.003713384,0.0007353072,0.001183796,0.001786434,0.001103255,0.001560989,0.001633454,0.001750787,0.001105941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001280006,"about_ca_system_score_gemma":0.001169335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006395383,"about_ca_topic_score_gemma":0.007952039,"domain_scores_codex":[0.9994174,0.0001371592,0.00002106669,0.0001638573,0.0002114733,0.00004906061],"domain_scores_gemma":[0.9990233,0.000361523,0.0001153775,0.0002053134,0.0002388478,0.0000555687],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001223394,0.00007003528,0.0008583455,0.0001426832,0.00008941961,0.00009078949,0.0001209174,0.7001806,0.01150746,0.03609837,0.007709769,0.2430092],"study_design_scores_gemma":[0.000003996242,0.000009380655,0.0001200518,0.000004355181,0.000003937382,0.00001771676,0.000008850522,0.9804736,0.001218264,0.01719945,0.0009338735,0.000006442424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003797422,0.0001135691,0.9947597,0.0001334921,0.00001441419,0.000016707,0.00009911847,0.0006934114,0.0003721054],"genre_scores_gemma":[0.2749948,0.0007184398,0.7181532,0.0003037908,0.00009982364,0.0002173479,0.001622492,0.000657714,0.003232423],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006395383,"threshold_uncertainty_score":0.01271629,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092554297","doi":"10.1137/060675320","title":"Exact Regularization of Convex Programs","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":105,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Regularization (linguistics); Mathematics; Regularization perspectives on support vector machines; Regular polygon; Proximal gradient methods for learning; Lagrange multiplier; Applied mathematics; Exact solutions in general relativity; Degenerate energy levels; Convex optimization; Backus–Gilbert method; Semidefinite programming; Mathematical optimization; Mathematical analysis; Subderivative; Tikhonov regularization; Inverse problem; Computer science; Geometry; Physics","authors":[{"name":"Michael P. Friedlander","is_ca":true},{"name":"Paul Tseng","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01231304077871429,"gpt":0.2311079300959838,"spread":0.2187948893172695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002399416,0.000857855,0.001079966,0.0006886461,0.0004961665,0.001399347,0.0007693296,0.001186642,0.001142786],"category_scores_gemma":[0.00895113,0.0004590698,0.0006813909,0.0006595303,0.001963861,0.001732879,0.002046062,0.002075983,0.0001865884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001106873,"about_ca_system_score_gemma":0.0009290989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001102095,"about_ca_topic_score_gemma":0.0009383328,"domain_scores_codex":[0.9979231,0.0008805904,0.00008194501,0.0003331197,0.0006058076,0.000175565],"domain_scores_gemma":[0.9968678,0.001866929,0.0003608283,0.0004060877,0.0003819648,0.0001164301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008126093,0.00006467833,0.0006299383,0.0001489368,0.00004465778,0.00009832122,0.0001489583,0.7820693,0.005748423,0.1781331,0.001358712,0.03147351],"study_design_scores_gemma":[0.000007207795,0.0000258945,0.0001263934,0.000009416007,0.00000337154,0.00002989934,0.00001551996,0.9450596,0.001208257,0.05298852,0.0005198611,0.000006072339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03492878,0.0002786707,0.9603574,0.0002972775,0.00001751611,0.00003265333,0.00004432546,0.0001345991,0.003908735],"genre_scores_gemma":[0.770453,0.0005189669,0.223571,0.000297662,0.00007320007,0.0002151515,0.0002307442,0.0001806126,0.004459669],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002399416,"threshold_uncertainty_score":0.01268947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083057505","doi":"10.1016/j.mri.2010.09.001","title":"An algorithm for sparse MRI reconstruction by Schatten p-norm minimization","year":2010,"lang":"en","type":"article","venue":"Magnetic Resonance Imaging","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":105,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Compressed sensing; Minification; Algorithm; Computer science; Norm (philosophy); Matrix completion; Noise reduction; Rank (graph theory); Nondeterministic algorithm; Iterative reconstruction; Time complexity; Matrix norm; Artificial intelligence; Mathematics; Mathematical optimization","authors":[{"name":"Angshul Majumdar","is_ca":true},{"name":"Rabab Ward","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005176297853252878,"gpt":0.2167130036065461,"spread":0.2115367057532932,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009486407,0.001092209,0.0009677269,0.0007729388,0.0005735352,0.0009321256,0.001546903,0.001896426,0.004367671],"category_scores_gemma":[0.003247743,0.0007030924,0.0008398148,0.001259372,0.0008876048,0.001457484,0.002064073,0.002638647,0.00300431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003951676,"about_ca_system_score_gemma":0.001350893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001487947,"about_ca_topic_score_gemma":0.002354195,"domain_scores_codex":[0.9994895,0.0001222769,0.00003095925,0.00008801942,0.0002431736,0.00002597094],"domain_scores_gemma":[0.9993026,0.000287358,0.0000454789,0.0001051123,0.000217183,0.00004225301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001799929,0.00009923653,0.0002429014,0.0002888493,0.00007577555,0.0001725355,0.0001811773,0.1852754,0.0257921,0.09610058,0.01364059,0.6779509],"study_design_scores_gemma":[0.00003651071,0.00007160738,0.0001141535,0.00002539422,0.00001931003,0.0003112177,0.00002081973,0.9465202,0.007261971,0.0326131,0.01297095,0.00003472727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002853987,0.00004278803,0.999136,0.00005814118,0.00002846641,0.00001314827,0.0000149746,0.000102741,0.0003183425],"genre_scores_gemma":[0.007206976,0.000134243,0.9906973,0.00006625054,0.00004198813,0.00008103651,0.0000759021,0.00008028496,0.001616013],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004367671,"threshold_uncertainty_score":0.01461136,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}