{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002904851,0.0001247697,0.0001228774,0.00007214797,0.000067353,0.00001691097,0.0000725633,0.00006681841,0.00003704981],"category_scores_gemma":[0.00001420921,0.0001205759,0.00003672711,0.0001308786,0.00002176143,0.00008896303,0.00001803683,0.00007620507,0.000004984469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006819247,"about_ca_system_score_gemma":0.00001164562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001132534,"about_ca_topic_score_gemma":0.00001293253,"domain_scores_codex":[0.9994434,0.00001479051,0.0001421009,0.0001232003,0.0001046109,0.0001718621],"domain_scores_gemma":[0.9996926,0.0000159042,0.00001766309,0.0001899872,0.00003861764,0.00004528373],"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.00003453436,0.0001152072,0.01163588,0.0001752865,0.0001807608,0.0002742318,0.001804253,0.7805277,0.1748489,0.001867684,0.01640536,0.01213029],"study_design_scores_gemma":[0.00009364155,0.00001522378,0.0007955332,0.00003246354,0.00001094141,0.00004867131,0.00001735862,0.977856,0.01995865,0.0003146312,0.0006326337,0.0002242343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4819138,0.000133692,0.5114551,0.00001379352,0.0002192005,0.0002180712,0.000002787948,0.001639912,0.004403731],"genre_scores_gemma":[0.9833848,0.0000294059,0.01619548,0.00001479632,0.0000825899,0.000003954896,0.000002386516,0.00003303911,0.0002535634],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.501471,"threshold_uncertainty_score":0.4916941,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005931901,0.0001275325,0.0001581954,0.00007538575,0.0001469093,0.00006302472,0.0002295463,0.00007138465,0.000003209738],"category_scores_gemma":[0.00001826274,0.0001215183,0.00003086148,0.00009971722,0.00003551873,0.00005156094,0.00002791338,0.00009934573,0.000005295932],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001553208,"about_ca_system_score_gemma":0.000005518226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.336279e-7,"about_ca_topic_score_gemma":0.000001343475,"domain_scores_codex":[0.9995291,0.000007619528,0.0002018334,0.00009638553,0.00005866304,0.0001063657],"domain_scores_gemma":[0.9990156,0.0001596331,0.00005125589,0.0006962506,0.00004613029,0.00003118732],"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.00004655243,0.0005329163,0.000002775749,0.0001322285,0.00009789452,5.768906e-7,0.00244167,0.003667379,0.02599893,0.7925877,0.04440653,0.1300848],"study_design_scores_gemma":[0.00112559,0.0003985193,0.0001778445,0.0006642333,0.000162903,0.00001636139,0.0008427805,0.3366609,0.08153596,0.5257154,0.05168048,0.001019033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05227771,0.002005025,0.7998753,0.002563172,0.000118452,0.002525912,0.0000931137,0.002438376,0.138103],"genre_scores_gemma":[0.7485808,0.0005304066,0.2504586,0.0001915568,0.00002543401,0.00006974892,0.00006341486,0.00002158612,0.00005844877],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6963031,"threshold_uncertainty_score":0.4955373,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002162533,0.0001785684,0.0001701808,0.0002207203,0.0002216671,0.00009122672,0.00007142869,0.0001186382,0.00001936354],"category_scores_gemma":[0.000006770702,0.0001836529,0.00007469609,0.0001219803,0.00004835572,0.0008475124,8.630408e-7,0.000165618,0.000007160446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006909486,"about_ca_system_score_gemma":0.00002310333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006305319,"about_ca_topic_score_gemma":0.000003219958,"domain_scores_codex":[0.9992282,0.00002207189,0.000302116,0.0001049909,0.0001316949,0.0002108957],"domain_scores_gemma":[0.999541,0.00008909875,0.00006385695,0.0001676023,0.00007686798,0.00006160847],"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.0003521068,0.00009565264,0.000002811929,0.00008649495,0.0001083003,0.000002145328,0.000760409,0.4795767,0.01016225,0.008514641,0.0003784305,0.4999601],"study_design_scores_gemma":[0.00211998,0.0007485817,0.0002525875,0.0004425502,0.0002435048,0.0001318167,0.0003311293,0.7359084,0.2051868,0.05210207,0.001428523,0.001104045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1247082,0.00002794839,0.8735734,0.00004325742,0.0003039272,0.0003962514,0.00003799612,0.0005379234,0.0003711118],"genre_scores_gemma":[0.9809972,0.00001263867,0.01859807,0.0002937211,0.00002983943,0.00001936029,0.00001557522,0.00001311141,0.00002046981],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.856289,"threshold_uncertainty_score":0.748915,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006366739,0.0001991319,0.0003326786,0.00004685219,0.00004156642,0.0000292882,0.000155592,0.00001115677,0.000009945259],"category_scores_gemma":[0.00001045605,0.0001796651,0.0001770238,0.0002031041,0.00006703041,0.0000873985,0.0000313009,0.000386981,0.00005545662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007821346,"about_ca_system_score_gemma":0.000002602751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000136075,"about_ca_topic_score_gemma":0.00000240689,"domain_scores_codex":[0.9991772,0.00003057744,0.0001780234,0.0001820721,0.0001645701,0.0002675486],"domain_scores_gemma":[0.9993906,0.00006758367,0.00003753457,0.0003901053,0.00002973836,0.00008446389],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001484917,0.00001788751,0.00002007711,0.0002231881,0.00003522537,0.00001798817,0.00003286004,0.0004150702,0.9680808,0.00008560974,0.01471558,0.01635421],"study_design_scores_gemma":[0.0003563002,0.00005181674,0.001423518,0.003206996,0.0002138393,0.00005259026,0.000002661746,0.5823961,0.2857611,0.00527607,0.1197624,0.001496544],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9454398,0.002779964,0.04717159,0.001351793,0.0005693242,0.0004023613,0.000005302611,0.00163427,0.0006455946],"genre_scores_gemma":[0.992202,0.0008238741,0.001975899,0.00476204,0.0001805776,0.000006014227,0.00000587282,0.00004279044,9.319693e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6823197,"threshold_uncertainty_score":0.7326533,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007397842,0.0001852271,0.0001245252,0.00008047733,0.0005306419,0.0001432862,0.0001729958,0.00008329709,0.00001189305],"category_scores_gemma":[0.000001180478,0.0001482734,0.00008291956,0.0002230518,0.00009250518,0.0001880723,7.410675e-7,0.0003575598,0.00003365343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009901348,"about_ca_system_score_gemma":0.00004455133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001700611,"about_ca_topic_score_gemma":0.00001258939,"domain_scores_codex":[0.9991262,0.00001761976,0.0001851867,0.0001789614,0.0002104598,0.0002815657],"domain_scores_gemma":[0.9996026,0.00005377003,0.00003277091,0.0001648178,0.00008294261,0.00006307347],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001524172,0.0000351354,2.169413e-7,0.0000111832,0.0000319125,0.00001183652,0.000303033,0.2312658,0.004944118,0.00003506127,0.0001279032,0.7632186],"study_design_scores_gemma":[0.000549901,0.0001607528,0.00001594403,0.0005086469,0.00006587752,0.00007845521,0.0005058523,0.1218707,0.8622503,0.0104508,0.003024541,0.0005182442],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003205507,0.0006641856,0.9936315,0.0001463285,0.0002381058,0.0001277594,0.00000562938,0.0008804498,0.00110054],"genre_scores_gemma":[0.9926164,0.0001093083,0.006948816,0.00007650346,0.00009054563,0.00002967069,7.10119e-7,0.00004561397,0.00008245908],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9894109,"threshold_uncertainty_score":0.6046414,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006078405,0.000124166,0.0001090188,0.00003918975,0.0001907906,0.00003423231,0.0002048711,0.00005119359,0.00005452709],"category_scores_gemma":[0.000007587988,0.00006537251,0.00006882385,0.0001307861,0.0001632643,0.0001155048,0.00000167607,0.0003023962,0.000004383234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001952084,"about_ca_system_score_gemma":0.00001597944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008487674,"about_ca_topic_score_gemma":0.000003740823,"domain_scores_codex":[0.999433,0.00002720939,0.0001560484,0.0000957548,0.0001563303,0.0001316055],"domain_scores_gemma":[0.9996115,0.00002652666,0.00003393647,0.0002549265,0.00005443399,0.00001866901],"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.0003228249,0.0005239458,0.0000516767,0.00106075,0.0003127136,0.00001267592,0.01880778,0.02286072,0.8426936,0.001785504,0.0007196965,0.1108481],"study_design_scores_gemma":[0.00005746949,0.0000163738,0.0001001357,0.0002913367,0.00002140095,0.000008053595,0.0001112635,0.08084882,0.9129818,0.005468902,0.000003692704,0.00009073886],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.501038,0.00005068499,0.494467,0.00009531977,0.0001485301,0.0002211086,0.000003515026,0.0003536485,0.003622212],"genre_scores_gemma":[0.9981142,0.000002837906,0.001739649,0.00006766357,0.00001076356,0.00001541851,3.659876e-8,0.00002219157,0.00002719907],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4970762,"threshold_uncertainty_score":0.2665814,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008039153,0.0004406497,0.0006581409,0.0002549606,0.0001855034,0.0003685357,0.00112201,0.0002151641,0.00001476034],"category_scores_gemma":[0.0000694356,0.0003361256,0.0001744594,0.0004949021,0.0002637507,0.0008732669,0.00007348655,0.0003484431,0.000002091425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006103931,"about_ca_system_score_gemma":0.0001623675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001483318,"about_ca_topic_score_gemma":0.00004794913,"domain_scores_codex":[0.9978423,0.00008293897,0.000648603,0.0004787259,0.0003650512,0.0005823742],"domain_scores_gemma":[0.9984567,0.0003289213,0.0003396592,0.0003787385,0.0004285042,0.00006751352],"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.009251465,0.0009067401,0.0005125569,0.007486559,0.0003298241,0.0000741772,0.01576802,0.005316015,0.2341164,0.00125736,0.06531017,0.6596707],"study_design_scores_gemma":[0.006870391,0.0009180938,0.0001939918,0.00305468,0.0001443353,0.00005316566,0.0002015298,0.6626635,0.276798,0.03663927,0.01163352,0.0008295201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02414461,0.0004646638,0.9577925,0.0005930182,0.0001786074,0.0151459,0.00003851932,0.0005553882,0.001086774],"genre_scores_gemma":[0.9833126,0.000004858673,0.009423212,0.0003192632,0.0009816487,0.00579883,0.00001469804,0.0001045597,0.00004032004],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.959168,"threshold_uncertainty_score":0.9999091,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001469837,0.00008223382,0.00009622952,0.00005771785,0.00004772831,0.00005052574,0.00005855397,0.00003919221,0.00002479322],"category_scores_gemma":[0.000007562101,0.00006122202,0.0000135728,0.00008099832,0.00001847406,0.0001055197,0.00004554098,0.00009379521,0.000004197037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001592728,"about_ca_system_score_gemma":0.000002717645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007251759,"about_ca_topic_score_gemma":0.00002424454,"domain_scores_codex":[0.999548,0.00001831242,0.0001288024,0.0001075363,0.00007661838,0.0001207567],"domain_scores_gemma":[0.9997762,0.00004242048,0.00001735659,0.0001238905,0.00002104143,0.00001904456],"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.000003764123,0.00001046412,0.001000749,0.00002217125,0.00001621591,0.000003058989,0.0003079062,0.9772648,0.01184451,0.001723412,0.001885504,0.005917458],"study_design_scores_gemma":[0.0001440341,0.000009583738,0.002482075,0.00009002684,0.000004437731,0.000006629287,0.00002447505,0.9774129,0.01786831,0.001782073,0.00007384297,0.0001015464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3803071,0.00009209144,0.6138133,0.0002158132,0.000142914,0.0002157929,3.47499e-7,0.0004427345,0.004769919],"genre_scores_gemma":[0.9537802,0.00001470589,0.04599787,0.0001164703,0.000035006,0.000006987732,0.000002648552,0.00001570339,0.00003037672],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5734731,"threshold_uncertainty_score":0.2496562,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00001502044,0.00005651255,0.00006851542,0.00005022164,0.00001585258,0.000009284764,0.00003590442,0.00002382857,0.00002929384],"category_scores_gemma":[0.000002412878,0.00005941313,0.00002657251,0.0001023084,0.00001403498,0.00005507721,0.000001810967,0.00003584936,0.000003408782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001086307,"about_ca_system_score_gemma":0.000002205693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006641528,"about_ca_topic_score_gemma":3.877905e-7,"domain_scores_codex":[0.9996894,0.00001401631,0.0001045236,0.00006140354,0.00006666257,0.00006400901],"domain_scores_gemma":[0.9998633,0.00002212413,0.00001585858,0.00005872261,0.00002444627,0.00001549402],"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.000005534419,0.000005819721,0.00004297088,0.00000439232,0.000002691198,7.198624e-7,0.00001775245,0.9583919,0.00144334,0.000005478183,0.0001606237,0.03991874],"study_design_scores_gemma":[0.0001089895,0.00003580642,0.0004803102,0.00001247525,0.000005359617,0.000001622965,0.000001893274,0.9812471,0.0179351,0.00007752127,0.00003826709,0.00005561062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8060521,0.00002516447,0.1925844,0.00001650352,0.00006863565,0.00006439186,0.000001093646,0.0003522861,0.0008354516],"genre_scores_gemma":[0.9771938,0.000004952242,0.02271366,0.00004074216,0.00001153553,0.00000186494,0.00001868594,0.00001070033,0.000004039061],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1711417,"threshold_uncertainty_score":0.2422797,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001396396,0.0001845648,0.0001731301,0.0003319955,0.0000810634,0.00006167391,0.0001245922,0.0001337248,0.000007898158],"category_scores_gemma":[0.00002047562,0.0002091675,0.00001855997,0.0001753215,0.00006555673,0.000153199,0.00006477316,0.0001460674,0.000002152896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000953253,"about_ca_system_score_gemma":0.00006216276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002746932,"about_ca_topic_score_gemma":0.000003876334,"domain_scores_codex":[0.9992179,0.00000208945,0.0002059278,0.0002959608,0.00009763907,0.000180452],"domain_scores_gemma":[0.9995012,0.00002634658,0.00004762771,0.0001891859,0.0001586254,0.00007696456],"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.000003885633,0.00005379181,0.00001326245,0.0007801243,0.00006403645,0.000001186033,0.000943666,0.9166308,0.004425404,0.05910996,0.004455558,0.0135183],"study_design_scores_gemma":[0.0001452604,0.00001310386,0.00001643405,0.0001601221,0.00001987611,0.000003487764,0.000005942858,0.9410288,0.001108412,0.0007980591,0.05641239,0.0002881135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007964411,0.00192185,0.9609521,0.00004629956,0.000123023,0.002532612,0.00003676201,0.0007911846,0.03351654],"genre_scores_gemma":[0.03450119,0.02335476,0.8912195,0.0004015761,0.0008275561,0.006747754,0.0003597558,0.0007751379,0.04181277],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06973258,"threshold_uncertainty_score":0.8529602,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009738021,0.0001993751,0.0001790621,0.0001500444,0.0003949845,0.00007436103,0.00008718623,0.0001277392,0.00003012336],"category_scores_gemma":[0.000003111801,0.0002093255,0.00009576031,0.0002228717,0.0000930396,0.0003104414,5.156921e-7,0.0002283923,0.0000174446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001026229,"about_ca_system_score_gemma":0.00002701621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001121267,"about_ca_topic_score_gemma":0.00005213065,"domain_scores_codex":[0.9991735,0.00002552047,0.0001382421,0.0002571933,0.0001348685,0.0002706879],"domain_scores_gemma":[0.99949,0.00009004422,0.00004562172,0.0001497454,0.0001597115,0.00006489297],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000131086,0.00006429444,0.000001336609,0.00003851905,0.00003655528,0.000001735518,0.0001493195,0.01794773,0.4265722,0.000003609995,0.00008023896,0.5549734],"study_design_scores_gemma":[0.0001939917,0.000172562,0.00002539511,0.00006570028,0.00003067443,0.000006863753,0.00002439807,0.2957004,0.703023,0.0002703589,0.0003090745,0.0001776036],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1501434,0.0000210195,0.8476683,0.00002248378,0.0003098257,0.0002425166,0.00001033961,0.0009687841,0.0006133298],"genre_scores_gemma":[0.9972408,0.000004002972,0.002322079,0.00004432102,0.0002152703,0.00008198505,4.722169e-7,0.00005166111,0.00003944758],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8470974,"threshold_uncertainty_score":0.8536048,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007717144,0.0001021061,0.0001963199,0.0002228025,0.0001701878,0.00006941197,0.0001755727,0.00005896358,0.00004163542],"category_scores_gemma":[0.0002443059,0.00007442963,0.00003044126,0.0003534677,0.0001474589,0.00008647882,0.0001095899,0.0001275989,0.00001479679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004073866,"about_ca_system_score_gemma":0.00002050142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001207212,"about_ca_topic_score_gemma":0.00003460054,"domain_scores_codex":[0.9990362,0.0000805397,0.0002886166,0.0001549094,0.0002283764,0.000211354],"domain_scores_gemma":[0.9986481,0.0003612457,0.00001597407,0.0004587609,0.0004435813,0.00007232185],"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.0000105881,0.0004682164,0.0002187274,0.000661899,0.0002322212,0.000004812386,0.002779719,0.001507942,0.5435165,0.3239858,0.007662383,0.1189513],"study_design_scores_gemma":[0.00130735,0.0002978643,0.0008015786,0.00180941,0.0001036861,0.00007428722,0.0007235745,0.3508985,0.4913865,0.06364337,0.08803673,0.0009171325],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05379301,0.0007621305,0.9382672,0.0004904674,0.00002216967,0.001062386,0.00002495163,0.0002284266,0.005349273],"genre_scores_gemma":[0.5878187,0.0006140092,0.4108951,0.000008681486,0.00004231521,0.0002485413,0.000004294684,0.00003191053,0.0003363495],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5340257,"threshold_uncertainty_score":0.3035152,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007064576,0.0001278595,0.0001218653,0.0000703858,0.00009378001,0.00006361916,0.0001379845,0.0000492235,0.0004438719],"category_scores_gemma":[0.00001767759,0.0001298582,0.00004643066,0.00009762742,0.00001203478,0.0000773518,0.00004336432,0.0003367695,0.0001880444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002210103,"about_ca_system_score_gemma":6.797643e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004182134,"about_ca_topic_score_gemma":0.000006093601,"domain_scores_codex":[0.9994019,0.0000246585,0.0001154027,0.0001204662,0.0001223603,0.0002152575],"domain_scores_gemma":[0.9997482,0.00003002064,0.00001944571,0.0001472732,0.00001113388,0.00004391103],"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.000007320059,0.0000607529,0.01145726,0.00006741398,0.0001476407,0.0002050479,0.002986838,0.561471,0.08562649,0.001675775,0.02689539,0.3093991],"study_design_scores_gemma":[0.0001558112,0.00002732479,0.0007532763,0.00005322379,0.00001119004,0.00003899189,0.00002917857,0.8969455,0.005070781,0.0008127104,0.09581576,0.0002863075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.699387,0.005032045,0.07119611,0.0003739966,0.0005436307,0.0001882416,0.000002605964,0.009427154,0.2138492],"genre_scores_gemma":[0.995937,0.0001071157,0.00233063,0.00008241007,0.0001070942,0.000003832472,0.00000366393,0.00004827161,0.001380018],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3354745,"threshold_uncertainty_score":0.5295465,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004518875,0.0001118842,0.0001278083,0.00006433042,0.000122158,0.0000159849,0.00004702096,0.00006399657,0.000003590239],"category_scores_gemma":[0.00002076433,0.0001098147,0.00002817566,0.00006938189,0.0001238939,0.0001376138,0.00001617109,0.0000603129,0.000001536671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004294902,"about_ca_system_score_gemma":0.00001405627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007926545,"about_ca_topic_score_gemma":0.000006613157,"domain_scores_codex":[0.9995258,0.000008963393,0.0001290436,0.0001331786,0.00006542479,0.0001375157],"domain_scores_gemma":[0.9996939,0.00004393498,0.00003439432,0.0001212596,0.00006960279,0.00003691469],"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.0002611728,0.0001203028,0.01510543,0.0005840431,0.0005128837,0.00003116162,0.007104172,0.0161424,0.138378,0.5650032,0.00397992,0.2527774],"study_design_scores_gemma":[0.001441041,0.0001426173,0.01235215,0.0001424723,0.00005813039,0.0004324427,0.0005861913,0.5583794,0.3529955,0.06344485,0.009214826,0.0008103593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8262776,0.0001011904,0.1693175,0.00002107267,0.0000833808,0.0003687819,0.00001477651,0.0003924758,0.003423214],"genre_scores_gemma":[0.9637336,0.00005481969,0.03604767,0.00001304069,0.00004600762,0.00004391272,0.00002511615,0.0000170793,0.00001880615],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.542237,"threshold_uncertainty_score":0.4478113,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001003211,0.0001794299,0.0001924157,0.0001661614,0.0006314853,0.0001267553,0.0003389293,0.0001398835,0.00003558945],"category_scores_gemma":[0.00002287034,0.0001941258,0.0001501514,0.0001006002,0.0001452146,0.0002731829,0.000004450225,0.0003873417,0.000006943604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006748992,"about_ca_system_score_gemma":0.00001667157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002376606,"about_ca_topic_score_gemma":0.0001234459,"domain_scores_codex":[0.9991629,0.00002584762,0.0002042678,0.0002143227,0.000149076,0.0002435893],"domain_scores_gemma":[0.998727,0.00003931858,0.00006431674,0.001053644,0.00004829402,0.00006737375],"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.0003166537,0.000544044,0.002732785,0.000143512,0.001243951,0.0001048042,0.0008816029,0.05488598,0.4936236,0.02842307,0.0004165422,0.4166835],"study_design_scores_gemma":[0.001370011,0.0002068615,0.03573417,0.0003060061,0.0002685518,0.0003031967,0.0001967523,0.02691512,0.8469568,0.08595697,0.000454449,0.001331028],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8587771,0.0000337297,0.1387137,0.000196316,0.0009075562,0.0001259416,0.0000164024,0.0007386236,0.0004905561],"genre_scores_gemma":[0.956574,0.0001762595,0.04305469,0.00003913858,0.000100685,0.000006026556,0.000001242214,0.00003332043,0.000014647],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4153525,"threshold_uncertainty_score":0.791622,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000230381,0.0001063455,0.00009351,0.00009688955,0.00009733036,0.00005159088,0.00006800442,0.000116725,0.00004496007],"category_scores_gemma":[0.0000430526,0.0000989972,0.00005091975,0.00004807186,0.00007120673,0.0003680701,6.788179e-7,0.0002086895,0.00002431958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001671666,"about_ca_system_score_gemma":0.000009082821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003086865,"about_ca_topic_score_gemma":0.000006799818,"domain_scores_codex":[0.9994468,0.00002156188,0.0002298645,0.00007635549,0.0001083007,0.0001171259],"domain_scores_gemma":[0.9993111,0.0003637296,0.00002758399,0.0001858878,0.0000589815,0.00005273531],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.004248462,0.0002140583,0.00003292349,0.000071735,0.000500565,0.00000117568,0.004644242,0.06610089,0.05969426,0.0213458,0.01384236,0.8293035],"study_design_scores_gemma":[0.00225571,0.0001771875,0.0002823028,0.0000654011,0.00007527069,0.00000804235,0.0001534109,0.2163767,0.6772507,0.09331235,0.00958684,0.0004560938],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09174324,0.000005180047,0.9028624,0.00006226286,0.0007283214,0.0002261317,0.0001803963,0.0004488223,0.003743204],"genre_scores_gemma":[0.992685,0.00001296068,0.006944801,0.0002396151,0.00003590706,0.00004236309,0.00001931421,0.000011383,0.000008682175],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9009417,"threshold_uncertainty_score":0.4036989,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002404574,0.000145929,0.0002440089,0.00003077323,0.0002715164,0.0001051598,0.0004820302,0.00006527106,0.00001327015],"category_scores_gemma":[0.0002110904,0.0001087286,0.000104234,0.00002279049,0.0001035925,0.00008879462,0.00009624015,0.00009407281,0.000002917275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001162647,"about_ca_system_score_gemma":0.00001872708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002415614,"about_ca_topic_score_gemma":0.00001665691,"domain_scores_codex":[0.9993045,0.00001325552,0.0002354846,0.00008997828,0.0001316094,0.000225175],"domain_scores_gemma":[0.9984981,0.0003954648,0.0001737118,0.0008265468,0.00006320328,0.00004291111],"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.0001030239,0.0001512238,0.0002473685,0.001221017,0.0008390599,0.00001707152,0.0120065,0.01187254,0.4109657,0.2916761,0.08774767,0.1831528],"study_design_scores_gemma":[0.000383405,0.00004672305,0.00005773924,0.0006821774,0.00007532276,0.00002134949,0.0007605916,0.2634937,0.3746607,0.355882,0.003669511,0.0002668044],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03432391,0.0002481845,0.9547539,0.0002306561,0.0002508839,0.0005278637,0.00001466647,0.0003484391,0.009301547],"genre_scores_gemma":[0.9442862,0.000008257427,0.05538049,0.00003706448,0.00006833701,0.000005431437,0.000001278199,0.00003888521,0.0001741078],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9099622,"threshold_uncertainty_score":0.4433824,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000206864,0.0001921843,0.0001652917,0.0003422495,0.0001705687,0.00008035028,0.0001453411,0.0001187836,0.0006102581],"category_scores_gemma":[0.000006259482,0.0002021983,0.00009559884,0.0001732578,0.00004287851,0.003229564,0.000001773308,0.0002203633,0.000261378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008761088,"about_ca_system_score_gemma":0.00002726382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002926505,"about_ca_topic_score_gemma":0.000001213372,"domain_scores_codex":[0.9989698,0.00004325372,0.000499806,0.00006555736,0.0001880819,0.0002334785],"domain_scores_gemma":[0.9994062,0.00005571942,0.0001167836,0.0002402533,0.0001071011,0.00007393379],"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.0004971835,0.00007820983,0.000008320499,0.0001112798,0.0002639097,0.000003248516,0.01332615,0.7778143,0.00754906,0.003543349,0.001163662,0.1956413],"study_design_scores_gemma":[0.0006909352,0.0001375679,0.00008494694,0.0001227894,0.00007760739,0.00004090917,0.0006827273,0.240753,0.7472233,0.003318576,0.006297372,0.0005703306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02730225,0.000004187861,0.9584883,0.000002714084,0.000673751,0.0002359546,0.00005466831,0.0009590494,0.01227917],"genre_scores_gemma":[0.9941567,0.00002137167,0.005494971,0.0002243721,0.00002431982,0.00003203053,0.00001855085,0.00001660352,0.000011073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9668545,"threshold_uncertainty_score":0.8245407,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048438,0.0001453561,0.0002074983,0.0001994297,0.00003305823,0.00003261493,0.0001295813,0.00007206751,0.000619046],"category_scores_gemma":[0.000006806393,0.0001311268,0.0001415102,0.0004192463,0.00002271517,0.00007796381,0.0000253446,0.0001190735,0.00009845762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000620387,"about_ca_system_score_gemma":0.00001259414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001282612,"about_ca_topic_score_gemma":0.0001768502,"domain_scores_codex":[0.9993346,0.000007104319,0.0001578199,0.000158291,0.0001230816,0.0002191119],"domain_scores_gemma":[0.9995697,0.00001264001,0.00001665923,0.0003030924,0.00002509443,0.00007279367],"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.00009188567,0.0004649747,0.01594475,0.0001132972,0.008041664,0.0007852364,0.00133484,0.6664117,0.1330422,0.02184267,0.1182517,0.03367503],"study_design_scores_gemma":[0.001962211,0.0003091431,0.04101813,0.00008568056,0.001993749,0.0000749619,0.0002564807,0.4479367,0.414211,0.008038919,0.08169381,0.002419226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1559792,0.0002859069,0.756492,0.0006298718,0.000372845,0.0002400618,0.00002366487,0.005676277,0.08030022],"genre_scores_gemma":[0.9892131,0.00001602624,0.009977441,0.0001625763,0.00004752207,0.000005960009,0.00002591106,0.00002628717,0.0005251932],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8332339,"threshold_uncertainty_score":0.677812,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["bibliometrics"],"consensus_categories":["bibliometrics"],"category_scores_codex":[0.0004357498,0.0001689199,0.0003731852,0.01441208,0.00007334073,0.00008071047,0.00004212357,0.0001140643,0.0001111059],"category_scores_gemma":[0.00004446245,0.0001558747,0.0001622798,0.03088359,0.00005144595,0.0001374603,0.00002997474,0.0001749566,0.000007909736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007602634,"about_ca_system_score_gemma":0.000006532522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002110326,"about_ca_topic_score_gemma":0.0002408002,"domain_scores_codex":[0.9988878,0.00001588569,0.0003243944,0.0003161023,0.0002084013,0.0002473894],"domain_scores_gemma":[0.9995089,0.0001427895,0.00003443582,0.0001447683,0.00005781944,0.0001112841],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00001825194,0.00003041204,0.8466241,0.00001934857,0.005429705,0.00002707343,0.00004081623,0.04205155,0.0001830566,0.0002931225,0.0001953911,0.1050872],"study_design_scores_gemma":[0.0001290211,0.00002257072,0.9202912,0.000007064339,0.002648517,0.0000211733,0.00009638641,0.07575613,0.0003172973,0.0002514975,0.0002352439,0.0002239476],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8190362,0.003440682,0.1760575,0.00002023347,0.0001178522,0.00004819372,0.000005558187,0.0001657917,0.001107938],"genre_scores_gemma":[0.9981826,0.0006145869,0.0009625755,0.000024258,0.00006665223,0.00000354266,0.0000267892,0.00001163778,0.0001073676],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1791464,"threshold_uncertainty_score":0.9967587,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003525052,0.0001475256,0.0001754846,0.00006436835,0.0000319102,0.00004159254,0.0001490137,0.00004396384,0.0003797899],"category_scores_gemma":[0.00000856816,0.0001346733,0.00007276422,0.00005576,0.00001621278,0.0001015021,0.0000327099,0.00008523792,0.00007117165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002175346,"about_ca_system_score_gemma":0.000004638831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009714076,"about_ca_topic_score_gemma":0.000003936153,"domain_scores_codex":[0.9993449,0.00000701002,0.0001387343,0.0001704286,0.00008085182,0.0002580216],"domain_scores_gemma":[0.9995128,0.00007262003,0.00002092595,0.0002812556,0.0000641587,0.00004827544],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001006258,0.0000964713,0.01178683,0.0002324617,0.0003205796,0.00003885403,0.0005707839,0.0917234,0.4176012,0.01150891,0.4216416,0.04437821],"study_design_scores_gemma":[0.0003989156,0.00003003357,0.0007781162,0.00005271965,0.00001738864,0.00001443707,0.00008519057,0.8133776,0.141118,0.001301919,0.04250452,0.0003210803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2365689,0.001437541,0.4717467,0.0002911809,0.001642346,0.001856167,0.00002093314,0.004572407,0.2818638],"genre_scores_gemma":[0.9814444,0.00001170227,0.01772397,0.0002854667,0.00009154319,0.00002712136,0.00002727964,0.00004268592,0.000345848],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7448756,"threshold_uncertainty_score":0.5491819,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008187367,0.0001133512,0.0002138851,0.00003719989,0.00006684895,0.00008534044,0.00006779806,0.00006640646,0.000007516927],"category_scores_gemma":[0.00005034917,0.0001094059,0.0000458464,0.00005065462,0.00004908954,0.0002935706,0.00004462191,0.0002013594,0.00001308046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005387955,"about_ca_system_score_gemma":0.000004687838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002368292,"about_ca_topic_score_gemma":0.000009927288,"domain_scores_codex":[0.9995429,0.00000985233,0.0001472931,0.00007765079,0.00008900779,0.0001332913],"domain_scores_gemma":[0.9995576,0.0001522187,0.00003984036,0.0001736789,0.00004166047,0.00003498299],"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.002706049,0.00005673511,0.003295391,0.0001513138,0.000672052,0.00001004511,0.01152907,0.006785583,0.3486073,0.01997734,0.003114884,0.6030942],"study_design_scores_gemma":[0.0668494,0.00002953735,0.02121904,0.0003402553,0.0003996305,0.00001775311,0.0006262945,0.4082851,0.2342881,0.2377137,0.02806887,0.002162357],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9488581,0.00004764776,0.04935085,0.00003630113,0.0002737109,0.0001319415,0.00001282352,0.000516664,0.0007719468],"genre_scores_gemma":[0.9723342,0.00002987281,0.02725112,0.0001136216,0.0002000289,0.000006699093,0.00004835301,0.0000133129,0.00000280458],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6009319,"threshold_uncertainty_score":0.4461442,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001053974,0.0002061404,0.0001805635,0.0001560547,0.0001989719,0.00009542147,0.0001103915,0.00009024335,0.0001607777],"category_scores_gemma":[0.00000101462,0.0001521147,0.0000853372,0.000125594,0.00004443894,0.0005062654,5.939091e-7,0.0001443488,0.00001693473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000826071,"about_ca_system_score_gemma":0.00005638707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002314748,"about_ca_topic_score_gemma":0.000009696387,"domain_scores_codex":[0.9990441,0.00001325916,0.0002059973,0.0002449977,0.0002084416,0.0002832005],"domain_scores_gemma":[0.99956,0.0001053855,0.00005200243,0.0001244774,0.00008822467,0.0000698975],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003814217,0.00008744674,0.000006498664,0.0001257342,0.0001174428,0.0000206296,0.0001740867,0.05034735,0.2723542,0.00003496519,0.0007901808,0.6755601],"study_design_scores_gemma":[0.001284772,0.000694075,0.00006514916,0.001486059,0.000140223,0.0001465174,0.00007595385,0.01825736,0.9716278,0.003533999,0.00195012,0.0007380057],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05032184,0.00002650749,0.9477237,0.0000789296,0.000108202,0.0002272026,0.00005847825,0.0007982134,0.0006568849],"genre_scores_gemma":[0.9941139,0.0000144738,0.005323308,0.00008938967,0.00008170312,0.0001021905,0.000005945869,0.00006847468,0.0002005632],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9437921,"threshold_uncertainty_score":0.6203057,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001125447,0.0001073033,0.0001783086,0.0001243728,0.00005518911,0.00003972167,0.00005961961,0.00003926141,0.000007740046],"category_scores_gemma":[0.00007372007,0.000113293,0.00002859431,0.0001233213,0.00006801952,0.00009519469,0.00003854649,0.00006383048,0.0000074584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002174994,"about_ca_system_score_gemma":0.00003661812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000753939,"about_ca_topic_score_gemma":0.000001677829,"domain_scores_codex":[0.9992948,0.00001622467,0.0002952613,0.000084245,0.000216998,0.00009242985],"domain_scores_gemma":[0.9991731,0.0002960131,0.00007003338,0.0001200349,0.0002808823,0.00005996007],"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.000003541468,0.000029339,0.00003515622,0.00003668329,0.00004730486,9.429583e-7,0.0004208664,0.9706643,0.001280872,0.02571208,0.0007336772,0.001035245],"study_design_scores_gemma":[0.0002454554,0.00001336956,0.0001601241,0.00006773299,0.00001679421,0.00002476728,0.00004530666,0.8011644,0.001058284,0.1967083,0.000389382,0.0001060498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4226693,0.00008947992,0.575693,0.00004915763,0.00009844411,0.000102624,0.000008628421,0.0002405789,0.001048841],"genre_scores_gemma":[0.5367766,0.000002112685,0.4631246,0.00001872807,0.00002211295,0.000001143839,0.00003569145,0.00001285647,0.000006110728],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.1709962,"threshold_uncertainty_score":0.4619952,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000451649,0.0001578438,0.0001465534,0.0002126315,0.0001581243,0.0001287788,0.0001066934,0.00009127104,0.00002257175],"category_scores_gemma":[0.00004959308,0.0001557181,0.00005218574,0.0002827838,0.00001423225,0.0002017152,0.00001984573,0.0003481169,0.000008584013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001015322,"about_ca_system_score_gemma":0.000008465349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000127603,"about_ca_topic_score_gemma":0.000001389147,"domain_scores_codex":[0.9989832,0.00002205412,0.0003755782,0.0001123401,0.0002079164,0.0002989077],"domain_scores_gemma":[0.9994925,0.00004906758,0.0001140806,0.000133374,0.0001209998,0.00008995809],"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.00001872174,0.0000132891,0.00004865573,0.00001155426,0.00001917669,0.0000277191,0.0001301902,0.9432331,0.001666826,0.00003857821,0.0001223523,0.05466989],"study_design_scores_gemma":[0.0001810203,0.00009566195,0.00003316327,0.000225455,0.00001251227,0.0002154108,0.00005308174,0.9901484,0.007182414,0.0001208802,0.001532976,0.0001990745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007537108,0.0001550155,0.9857324,0.00002041536,0.0004978512,0.0001155086,2.222047e-7,0.0006031387,0.005338382],"genre_scores_gemma":[0.5719867,0.0001162651,0.4274237,0.00007948034,0.0003034257,0.000001503969,0.000006753017,0.00005699031,0.0000252047],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5644496,"threshold_uncertainty_score":0.6350001,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001107324,0.00019907,0.0002055294,0.0005744591,0.0001556748,0.0004007543,0.001145332,0.0000938485,0.00009091654],"category_scores_gemma":[0.0004112814,0.000187488,0.00008134974,0.0002733542,0.0001636857,0.000736894,0.0002296143,0.0005373011,0.0001349963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002251914,"about_ca_system_score_gemma":0.00001969319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002704261,"about_ca_topic_score_gemma":0.0001058058,"domain_scores_codex":[0.9971818,0.00005868321,0.0004615535,0.0002443684,0.001490909,0.0005626713],"domain_scores_gemma":[0.997919,0.0008156144,0.00004607593,0.0004471297,0.0006275518,0.0001446545],"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.0000707338,0.001330951,0.0009311964,0.0002684154,0.0009289461,0.0001594774,0.01224752,0.5326451,0.2396871,0.1161697,0.02355682,0.07200401],"study_design_scores_gemma":[0.0002512088,0.00003732494,0.0003402083,0.0001963519,0.000005995921,0.00002320757,0.0006152836,0.816353,0.1464481,0.01954346,0.0159495,0.000236415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9454803,0.0002575182,0.01771145,0.002716534,0.0003153758,0.0003251439,0.000009575276,0.001350385,0.03183376],"genre_scores_gemma":[0.9225762,0.0001380272,0.0763951,0.00006247917,0.0005548036,0.00006386226,0.000006111847,0.00004901716,0.0001543246],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2837079,"threshold_uncertainty_score":0.764554,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004612488,0.0003830988,0.0005202997,0.0001031562,0.0002392339,0.0003062255,0.00019209,0.0001591525,0.00003514462],"category_scores_gemma":[0.0001674359,0.0003154413,0.0001277755,0.0003192088,0.0001443679,0.0002183034,0.0000345927,0.0002708929,0.00001247669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006532593,"about_ca_system_score_gemma":0.00001959199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002780578,"about_ca_topic_score_gemma":0.000005117892,"domain_scores_codex":[0.998141,0.00004426859,0.0005051628,0.0003724582,0.0002748154,0.000662311],"domain_scores_gemma":[0.998872,0.0002932214,0.00008260718,0.000401238,0.0001896676,0.0001611966],"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.0001323243,0.0007299432,0.00005259525,0.0007333074,0.0002520813,0.00004839334,0.00204908,0.001170391,0.00397425,0.1100729,0.0009739037,0.8798108],"study_design_scores_gemma":[0.002186341,0.001923883,0.0002368814,0.001240928,0.0003608957,0.0003763246,0.0003477143,0.7199315,0.03769822,0.1351483,0.09839454,0.002154537],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007425161,0.0001368883,0.9869074,0.0004585004,0.0000637609,0.001534902,0.000002994484,0.002135189,0.001335209],"genre_scores_gemma":[0.2427927,0.000002104686,0.7567074,0.00007276021,0.00009070268,0.0002202182,0.00001955348,0.00005649612,0.00003813983],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8776563,"threshold_uncertainty_score":0.9999298,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007362503,0.0000820615,0.00008156245,0.00005697956,0.0000234008,0.00001250048,0.00005186596,0.00004017886,0.000157445],"category_scores_gemma":[0.000007571814,0.00007060923,0.00003192036,0.00007647572,0.000008032172,0.00007573811,0.000009976658,0.00007650875,0.00006898215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008316504,"about_ca_system_score_gemma":0.000001161613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004078134,"about_ca_topic_score_gemma":2.864381e-7,"domain_scores_codex":[0.9995586,0.000008086087,0.0001015168,0.00005298773,0.00007413232,0.0002046799],"domain_scores_gemma":[0.9997643,0.00002661977,0.00001138324,0.0001363869,0.00001078008,0.00005052231],"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.0000133197,0.0002226168,0.006458775,0.00005945471,0.0002015447,0.00001394815,0.001112877,0.005553887,0.6731395,0.06394726,0.1655585,0.08371833],"study_design_scores_gemma":[0.00008062936,0.00002470499,0.001190165,0.00003638768,0.000009052078,0.000007447376,0.0000555937,0.02373679,0.9683402,0.002245751,0.004045325,0.0002279288],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6582224,0.0001682944,0.0320886,0.00002411242,0.0002523884,0.0001425106,0.000001231669,0.003328895,0.3057715],"genre_scores_gemma":[0.9926972,0.000005529582,0.006998037,0.000124671,0.00005859883,0.000005747437,0.000002625985,0.00001907873,0.00008852976],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3344748,"threshold_uncertainty_score":0.2879361,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004730852,0.0001475826,0.0001408117,0.00006719855,0.0000519942,0.00006146788,0.0001143948,0.00003026925,0.00001065992],"category_scores_gemma":[0.00001152579,0.0001555388,0.00005434543,0.00006451522,0.00005117866,0.00007880794,0.0000300998,0.0001603896,0.00003617808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003151715,"about_ca_system_score_gemma":0.000002164868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006871337,"about_ca_topic_score_gemma":6.971087e-7,"domain_scores_codex":[0.9993361,0.00001793039,0.0001208434,0.0001446581,0.0001148616,0.0002655709],"domain_scores_gemma":[0.9995854,0.00004270859,0.0000221969,0.0002722349,0.00002273686,0.00005470634],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003890895,0.00001197895,0.0002077934,0.00001075294,0.00004188849,0.0000544495,0.0002251104,0.03501983,0.929402,0.00282448,0.02951798,0.002679867],"study_design_scores_gemma":[0.0003867706,0.00001695763,0.0006335716,0.00007614717,0.00003862536,0.00006405618,0.00004803295,0.7082804,0.2798752,0.0008213519,0.009219644,0.000539158],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7995461,0.0001412046,0.1624052,0.001979296,0.0007143696,0.0001490737,0.000003657538,0.002072822,0.03298832],"genre_scores_gemma":[0.973196,0.00001258445,0.02519342,0.001285339,0.0002407761,0.000004581497,0.000004961336,0.00004278456,0.00001957284],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6732606,"threshold_uncertainty_score":0.6342686,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014402,0.0002507577,0.0002473362,0.0003733435,0.0005036424,0.0001708292,0.000116641,0.0001158775,0.00001289379],"category_scores_gemma":[0.00001460026,0.0002757872,0.0001211785,0.00042797,0.00006318102,0.0003153009,0.000001165843,0.0004147062,0.00001234147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006723213,"about_ca_system_score_gemma":0.00001843641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007676676,"about_ca_topic_score_gemma":0.000002663,"domain_scores_codex":[0.9988636,0.00004435122,0.0002680444,0.0002983832,0.0001801635,0.000345422],"domain_scores_gemma":[0.9993077,0.0002084538,0.00005835848,0.0002029052,0.0001373384,0.00008523656],"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.00003463843,0.000046852,0.000003738525,0.0001242239,0.00003794801,0.00000319999,0.0001621402,0.5455279,0.06799005,0.000004347535,0.0003871333,0.3856778],"study_design_scores_gemma":[0.0002753267,0.00006101285,0.00001060942,0.0001676156,0.00004311055,0.00002008684,0.00003718475,0.7816061,0.2155155,0.0002798484,0.001734347,0.0002492664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002292717,0.0001107677,0.9928435,0.00006003758,0.0003579046,0.0002314588,0.00000362654,0.002023273,0.002076703],"genre_scores_gemma":[0.8809168,0.00002718462,0.1186635,0.00007105312,0.0001153026,0.00002310346,0.00000428117,0.00008738344,0.00009132419],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8786241,"threshold_uncertainty_score":0.9999694,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000358716,0.000312515,0.000449272,0.0001248571,0.0001371303,0.000305084,0.0001901438,0.0001885484,0.00008725184],"category_scores_gemma":[0.0003766319,0.0002722586,0.00016508,0.0002979919,0.0001149347,0.0002456972,0.00004710273,0.0001938923,0.00002910903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005383091,"about_ca_system_score_gemma":0.00001630551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003612576,"about_ca_topic_score_gemma":6.452853e-7,"domain_scores_codex":[0.9983745,0.00008514614,0.0005551054,0.000306563,0.0001581989,0.0005204896],"domain_scores_gemma":[0.9987528,0.000433614,0.00009017176,0.0003416458,0.0002427379,0.0001390463],"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.00001432345,0.0001450475,0.000006534977,0.000327345,0.0001500714,0.000003607697,0.0008291211,0.0001253631,0.01953193,0.006782938,0.0007106686,0.971373],"study_design_scores_gemma":[0.0006269116,0.0001374866,0.000003978063,0.0003176545,0.00008638727,0.00002425715,0.0002581165,0.8787151,0.05508343,0.04628684,0.01795212,0.0005077099],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004585981,0.0001004189,0.9897424,0.0001421114,0.0001095425,0.002288053,0.000002238917,0.001919513,0.001109734],"genre_scores_gemma":[0.04008095,0.00000282881,0.9586083,0.00003941014,0.0001201402,0.0008909689,0.00004660668,0.00008659116,0.0001241615],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9708654,"threshold_uncertainty_score":0.9999729,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00001252282,0.00005109759,0.00005100669,0.00001576774,0.00001243142,0.00001305284,0.00004879946,0.00002932692,0.000125425],"category_scores_gemma":[9.481921e-7,0.00004610546,0.00001873175,0.00003300402,0.000008051091,0.00004485437,0.000009786417,0.0000609905,0.00002695028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007568394,"about_ca_system_score_gemma":5.646434e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003169481,"about_ca_topic_score_gemma":0.000004974246,"domain_scores_codex":[0.9997659,0.000002807455,0.00005373192,0.00004497094,0.00002987322,0.0001027558],"domain_scores_gemma":[0.9998587,0.000008186888,0.000003331965,0.00009831737,0.000007923364,0.00002355547],"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.000001988089,0.000007762743,0.0002350254,0.000001572481,0.0000171678,0.000006464875,0.00002991663,0.7086178,0.002273208,0.001777265,0.1394453,0.1475866],"study_design_scores_gemma":[0.00003420703,0.000004066341,0.000182292,0.000002205818,0.000001738796,0.000004979173,0.000002340252,0.9625644,0.01038854,0.00004941229,0.02670101,0.00006478245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.232897,0.001231141,0.469067,0.0004473389,0.0005567692,0.000148225,5.171777e-7,0.007925845,0.2877262],"genre_scores_gemma":[0.9963788,0.00002015005,0.00285028,0.0003216495,0.0001975068,0.000001523136,8.257879e-7,0.00001126339,0.0002180202],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7634818,"threshold_uncertainty_score":0.1880126,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003066186,0.0002800233,0.0002689752,0.0001950776,0.0005796457,0.00007270234,0.001074082,0.0001534594,0.00001465571],"category_scores_gemma":[0.000002530428,0.000308523,0.0001010215,0.0002757324,0.0001038909,0.0002088895,0.00001174407,0.0004608174,0.00001519284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001279021,"about_ca_system_score_gemma":0.00001874595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004989874,"about_ca_topic_score_gemma":0.0000464289,"domain_scores_codex":[0.9986128,0.0001468542,0.0003367411,0.0002738523,0.0002017231,0.0004280523],"domain_scores_gemma":[0.9957719,0.0004253127,0.00006930459,0.003478834,0.00009792977,0.0001566468],"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.00002341144,0.0006049654,0.000005818919,0.00001402113,0.00004892693,3.14847e-7,0.0001309737,0.9307221,0.002404088,0.0002231337,0.000197697,0.06562457],"study_design_scores_gemma":[0.0003565279,0.00006984128,0.0000638705,0.0001221796,0.0000704645,0.000004792734,0.00008503689,0.9895536,0.007191233,0.000007885318,0.002146222,0.0003284003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01658425,0.0001243299,0.980373,0.0001302159,0.0004628884,0.0006083595,0.0003291735,0.001221864,0.0001658799],"genre_scores_gemma":[0.9249285,0.0001698742,0.0741436,0.00008378392,0.0000861321,0.0001920559,0.0002805894,0.00009975585,0.00001568186],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9083443,"threshold_uncertainty_score":0.9999367,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001752132,0.0001106665,0.0002569942,0.00003271112,0.00006118999,0.00001040257,0.0001101731,0.00004012436,0.00001811601],"category_scores_gemma":[0.000346489,0.00008937109,0.00002247219,0.00004295037,0.0005139938,0.00001806352,0.00002332079,0.0000936959,0.000001953188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003688107,"about_ca_system_score_gemma":0.00001147823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003109222,"about_ca_topic_score_gemma":0.00001163746,"domain_scores_codex":[0.9993191,0.00004004054,0.0002543006,0.00009219249,0.0001142356,0.0001801819],"domain_scores_gemma":[0.9981993,0.00119674,0.00008484865,0.0001581356,0.0003181744,0.00004279102],"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.001873961,0.0003892192,0.000587,0.001114713,0.001406465,0.00007485683,0.004137366,0.04499913,0.04883387,0.4953939,0.1025051,0.2986844],"study_design_scores_gemma":[0.0003652546,0.0005767049,0.0006593377,0.00004341805,0.00005751531,0.000007317428,0.00009141265,0.9320769,0.01715577,0.04593597,0.002894044,0.0001362961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03255741,0.0001353345,0.9656794,0.00007274253,0.00005990548,0.0002306662,0.001001414,0.00008392481,0.0001792073],"genre_scores_gemma":[0.9268854,0.00006858791,0.07287215,0.00004877877,0.000064416,0.000004186488,0.00001626059,0.00002037725,0.00001979697],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8943281,"threshold_uncertainty_score":0.3644447,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000229585,0.0002341223,0.0003203046,0.0004815064,0.0001344088,0.00002421079,0.0002830063,0.0007476522,0.0000320063],"category_scores_gemma":[0.0003397097,0.0002415553,0.000100328,0.0005794922,0.000245835,0.0002167801,0.00008931322,0.0005280015,0.000012517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003787877,"about_ca_system_score_gemma":0.0000469793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002066271,"about_ca_topic_score_gemma":0.00001752932,"domain_scores_codex":[0.9987461,0.000006464106,0.000422369,0.0002992563,0.0001559527,0.0003698517],"domain_scores_gemma":[0.9989578,0.0000200985,0.0001236671,0.0005846565,0.0002367322,0.00007705648],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001477575,0.0005608283,0.0007817654,0.0004474884,0.0002528133,0.00003891012,0.0001294436,0.1054218,0.456033,0.3613638,0.02547241,0.04935003],"study_design_scores_gemma":[0.0003790811,0.00006859328,0.000009955005,0.00006146676,0.0000528418,0.00004148942,0.00002957934,0.4868459,0.3621717,0.01181964,0.1382303,0.0002893598],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04336347,0.00003754178,0.9508624,0.0009583524,0.0009580255,0.0005745986,0.0001053979,0.002350357,0.0007898326],"genre_scores_gemma":[0.402252,0.00004080551,0.5972956,0.00003380161,0.00009136223,0.00009971574,0.00009821657,0.00005509714,0.00003342809],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3814242,"threshold_uncertainty_score":0.9850339,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005877497,0.00007903983,0.00008984752,0.00002719966,0.00002790062,0.00001275518,0.00005004564,0.00004094545,0.0001457528],"category_scores_gemma":[0.000009980527,0.00007164846,0.00002691345,0.00005484459,0.00001085897,0.0000947494,0.00001809747,0.0001184066,0.0001984908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001243438,"about_ca_system_score_gemma":0.00000149033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001222362,"about_ca_topic_score_gemma":0.00000234249,"domain_scores_codex":[0.99962,0.00001299127,0.00006515218,0.00005026839,0.00004907148,0.0002025066],"domain_scores_gemma":[0.9997976,0.00001821532,0.000008049085,0.0001057184,0.00001401251,0.0000563689],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001574373,0.0003368932,0.1701753,0.0002647019,0.0004478872,0.00003973089,0.00553963,0.0225226,0.3713514,0.02392645,0.1726394,0.2327402],"study_design_scores_gemma":[0.0003051486,0.00002524712,0.01144362,0.00008886476,0.00002617481,0.00003066334,0.0002342774,0.1318565,0.3398269,0.0000610596,0.5155062,0.0005953526],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3712643,0.009417943,0.4490098,0.0001078147,0.000988888,0.0002806345,6.337316e-7,0.01016832,0.1587617],"genre_scores_gemma":[0.9876715,0.0001425681,0.01097995,0.00005704661,0.00007395086,0.000003426854,0.000001173787,0.00002176837,0.001048617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6164072,"threshold_uncertainty_score":0.292174,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005028587,0.0001439831,0.0001354174,0.00007703258,0.0006524855,0.0002740348,0.0001220068,0.00008372603,0.00001776012],"category_scores_gemma":[0.000001616737,0.0001451593,0.00003287776,0.00003819589,0.00009198202,0.0003858035,0.00000113256,0.0002136016,0.000004640949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002466003,"about_ca_system_score_gemma":0.00001329295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002247883,"about_ca_topic_score_gemma":0.000008042909,"domain_scores_codex":[0.9994174,0.00001057842,0.0001306755,0.0001598882,0.0001252377,0.0001561677],"domain_scores_gemma":[0.9996179,0.00002326762,0.00004476393,0.0002091668,0.00004278565,0.00006206462],"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.00002639212,0.00002866313,0.0000114016,0.00008427686,0.0000379057,0.0000153061,0.0003824511,0.2623915,0.05953551,0.0000130992,0.000216062,0.6772574],"study_design_scores_gemma":[0.0001690301,0.00001990214,0.0001308051,0.0001619087,0.00002788403,0.00001805487,0.00001820552,0.6773648,0.3214402,0.0003069632,0.0001867511,0.0001555286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06351545,0.000150493,0.9341211,0.00004944189,0.000120929,0.00009564259,0.000007315262,0.0005052435,0.001434338],"genre_scores_gemma":[0.9957812,0.00002538543,0.004026482,0.00003411387,0.00003708494,0.00001360051,7.551643e-7,0.0000299239,0.00005148251],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9322657,"threshold_uncertainty_score":0.5919425,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005631256,0.0001030476,0.0001131545,0.0002180918,0.0002065093,0.00006591223,0.0003480609,0.00001046666,0.00003809494],"category_scores_gemma":[0.00007338372,0.00004333736,0.00003502731,0.0004622296,0.0001835625,0.0001821472,0.00002199915,0.0001291593,0.00001558083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002827594,"about_ca_system_score_gemma":0.00002522485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003820604,"about_ca_topic_score_gemma":7.043774e-7,"domain_scores_codex":[0.9990035,0.00006145272,0.0001454901,0.0001252295,0.0004776975,0.0001866789],"domain_scores_gemma":[0.9993573,0.0002899685,0.00008087042,0.000154323,0.00007562889,0.00004184838],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004442617,0.00117343,0.4850886,0.00003498891,0.0004368456,0.0004986849,0.002729982,0.01062515,0.2494857,0.01224158,0.08501651,0.1522242],"study_design_scores_gemma":[0.003195196,0.0069124,0.1513539,0.004457334,0.0001498676,0.0004467745,0.009328594,0.02803894,0.7785479,0.003376215,0.01272869,0.001464132],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9909254,0.0001725506,0.003329507,0.0008420265,0.0003600133,0.0001035602,0.000001263525,0.00009047964,0.004175145],"genre_scores_gemma":[0.9994436,0.00004559731,0.0003378428,0.00008843293,0.00004364678,0.000001274516,1.739227e-8,0.000007716017,0.00003190705],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5290622,"threshold_uncertainty_score":0.1767246,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001250732,0.0001065952,0.0001210867,0.00002910233,0.00008325454,0.00004926909,0.00009418496,0.00006990187,0.00001575415],"category_scores_gemma":[0.00004948785,0.00007330186,0.00003563434,0.00006117276,0.00005505911,0.00005667123,0.00002848675,0.00008898535,0.000005603719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008942496,"about_ca_system_score_gemma":0.000002585735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004556476,"about_ca_topic_score_gemma":0.000002925863,"domain_scores_codex":[0.9994783,0.000009454603,0.0001712371,0.000103363,0.00005914685,0.0001784857],"domain_scores_gemma":[0.9996283,0.0001294337,0.00002601122,0.000148266,0.00002981241,0.00003814928],"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.0001620364,0.0006014747,0.0003601443,0.002726824,0.0006100397,0.00002779776,0.02751406,0.0007226024,0.01569671,0.3870978,0.004752451,0.5597281],"study_design_scores_gemma":[0.0004618214,0.0002546109,0.0001793578,0.000523244,0.0001279586,0.00009100972,0.0005505171,0.867628,0.0178882,0.08646192,0.025305,0.0005283513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.054249,0.0002825663,0.9379282,0.0001387828,0.00009216948,0.001735807,0.0000028568,0.0018251,0.003745526],"genre_scores_gemma":[0.8846297,0.00003204309,0.1150798,0.00004284789,0.000035667,0.000116447,0.00000203032,0.00004328945,0.00001816134],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8669054,"threshold_uncertainty_score":0.2989163,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001735119,0.0001018871,0.0003152959,0.0001202405,0.00006469859,0.00001521176,0.0001673044,0.00004318385,0.00003175869],"category_scores_gemma":[0.00006484529,0.00006589403,0.0004048265,0.0006103374,0.00004351087,0.00005724635,0.00001650141,0.0001723876,0.000001523887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003431431,"about_ca_system_score_gemma":0.000007866665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001132078,"about_ca_topic_score_gemma":0.000003252753,"domain_scores_codex":[0.9991014,0.00007267587,0.0003805243,0.0000935951,0.0002135683,0.0001382382],"domain_scores_gemma":[0.9992745,0.0001300454,0.000206236,0.0001565367,0.0001771347,0.00005554122],"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.00002307903,0.0001084093,0.00453951,0.00003513426,0.001643009,0.000001131273,0.0002182736,0.8202049,0.02479539,0.00008970414,0.0001869655,0.1481545],"study_design_scores_gemma":[0.00009461485,0.00008867244,0.001407562,0.0000471117,0.0002818661,0.000004744154,0.00008354717,0.9210377,0.07638489,0.0003847152,0.0001113573,0.00007316664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1206663,0.00004940154,0.8788612,0.00006314541,0.0001105925,0.0001242189,0.00000101843,0.00004214751,0.00008198801],"genre_scores_gemma":[0.9380164,0.00002120908,0.06185878,0.00002146688,0.00004101443,0.00001066865,8.469791e-7,0.00001169637,0.00001788265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8173501,"threshold_uncertainty_score":0.2687081,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001163371,0.0003000892,0.0002826987,0.0001016197,0.0002325204,0.0001106394,0.0003190066,0.0002376285,0.00001017434],"category_scores_gemma":[0.00001829718,0.0003080087,0.00007119086,0.00005485435,0.0001181145,0.00009407421,0.0003625294,0.001158967,0.000003818069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008356601,"about_ca_system_score_gemma":0.00002362925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004729837,"about_ca_topic_score_gemma":0.0001336776,"domain_scores_codex":[0.9990378,0.0000663488,0.00009609457,0.0004921861,0.00006288727,0.0002447025],"domain_scores_gemma":[0.9990706,0.00007260406,0.0001144544,0.0005851327,0.00006217779,0.0000950452],"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.00007644472,0.00001929904,0.03053208,0.00007083381,0.0001506801,0.0004587645,0.00005723179,0.9627531,0.00001094536,0.002017362,0.0001144428,0.003738854],"study_design_scores_gemma":[0.0005881569,0.0002312556,0.1151188,0.00209588,0.0003041771,0.00002996239,0.00004820837,0.8742313,0.0003644362,0.005453941,0.0002393179,0.001294622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9060337,0.0003205526,0.08909679,0.000004808386,0.0002040132,0.0001635965,0.000003551307,0.000607672,0.0035653],"genre_scores_gemma":[0.9985492,0.0009109286,0.0001394674,0.000008758994,0.00006601871,7.355315e-7,0.00001807174,0.00003517147,0.000271669],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09251546,"threshold_uncertainty_score":0.9999372,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001826396,0.0001054273,0.0001575954,0.0001824447,0.0001237351,0.00002557366,0.0001644872,0.00008424401,0.0001674581],"category_scores_gemma":[0.000006409231,0.0001090174,0.00008780955,0.00004086491,0.00009542472,0.0008780218,0.000001289739,0.0001019705,0.00002127722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002630553,"about_ca_system_score_gemma":0.00001438055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004155771,"about_ca_topic_score_gemma":0.000004467489,"domain_scores_codex":[0.9992687,0.00003583279,0.0003712827,0.00005622304,0.0001775283,0.00009044979],"domain_scores_gemma":[0.9992239,0.00004091648,0.0002147879,0.0003796798,0.0001104432,0.0000302962],"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.0004755286,0.0001087749,0.00006548838,0.00008158782,0.0003978373,7.642415e-7,0.001678751,0.1851563,0.4764776,0.0003099351,0.0003155646,0.3349319],"study_design_scores_gemma":[0.0003115392,0.00004402885,0.0003463871,0.0001562687,0.00004195997,0.00000235354,0.0001354581,0.007466665,0.9901824,0.001166285,0.00004325435,0.0001034194],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3913626,0.00001510538,0.6036249,0.000005760569,0.0007761879,0.0001266032,0.00005373362,0.0001441898,0.003890957],"genre_scores_gemma":[0.9979008,0.00002347317,0.00201327,0.000009238775,0.00001698602,0.00001150136,0.00000517974,0.000009539134,0.00001004587],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6065382,"threshold_uncertainty_score":0.4445599,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000683315,0.0001495999,0.0002483262,0.0001358137,0.00008182339,0.00005722277,0.00008378148,0.00006291529,0.0000320005],"category_scores_gemma":[0.00000182119,0.0001610378,0.00007784745,0.0004976408,0.00002992179,0.00009012994,0.00001343281,0.00009405526,0.000005452608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003485152,"about_ca_system_score_gemma":0.00001081561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006828077,"about_ca_topic_score_gemma":6.952276e-7,"domain_scores_codex":[0.9992473,0.000009457296,0.0002120884,0.0002295442,0.0001520336,0.0001496022],"domain_scores_gemma":[0.9996794,0.00003608598,0.00004948547,0.0001308388,0.00004523134,0.00005891243],"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.00001062307,0.0000206307,0.00004387492,0.000002443581,0.0002354309,0.00000128079,0.00002757559,0.9886784,0.0005170861,0.0009195517,0.00170268,0.007840401],"study_design_scores_gemma":[0.0001736122,0.00001669144,0.002734498,0.000005597391,0.000207515,0.000001323304,0.00001608328,0.990061,0.001063669,0.005359868,0.000161532,0.000198616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06923656,0.0003492061,0.9252796,0.00009052706,0.00001901178,0.00008844354,0.00001217743,0.0002660787,0.004658467],"genre_scores_gemma":[0.9591684,0.0001912567,0.04006,0.0003409063,0.00002243907,0.000007298817,0.0001757962,0.00001008154,0.00002377384],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8899319,"threshold_uncertainty_score":0.6566933,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.006448945,0.0005612212,0.0003976294,0.0092127,0.002089106,0.003168792,0.005482705,0.0001764787,0.0008996745],"category_scores_gemma":[0.0002311056,0.0006031314,0.00008475829,0.003156821,0.007392252,0.005170825,0.003671396,0.001401996,0.0002381852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002546595,"about_ca_system_score_gemma":0.0002510815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003938631,"about_ca_topic_score_gemma":0.003639229,"domain_scores_codex":[0.9901298,0.0001233232,0.001162518,0.001867242,0.005371004,0.001346068],"domain_scores_gemma":[0.9962987,0.0001180726,0.00005946345,0.001355976,0.001868691,0.0002990497],"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.00005278477,0.0001148299,0.0001074258,0.00006997117,0.00008499767,0.0001337124,0.0004134756,0.04130578,0.000360264,0.9467294,0.001353638,0.009273729],"study_design_scores_gemma":[0.0008888636,0.0001938153,0.002878183,0.001574451,0.0000293234,0.00007165202,0.002943511,0.08449186,0.001268181,0.1364405,0.7675804,0.001639221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.001106983,0.0004645403,0.007051962,0.002386812,0.00122547,0.00331382,0.0001283275,0.0003219483,0.9840001],"genre_scores_gemma":[0.5064456,0.05194183,0.02706345,0.0001470227,0.0005753121,0.003698492,0.0003116421,0.0001962872,0.4096204],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.8102888,"threshold_uncertainty_score":0.9998981,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002257829,0.0001917413,0.0003326647,0.0001559857,0.00007069819,0.00005917565,0.0002159596,0.00008745135,0.0000413603],"category_scores_gemma":[0.00001491823,0.0001699632,0.0001925886,0.0002962389,0.00005121251,0.00008763035,0.00002818863,0.0001053583,0.000008367472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002864989,"about_ca_system_score_gemma":0.000003600074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009650616,"about_ca_topic_score_gemma":0.000003148189,"domain_scores_codex":[0.9989342,0.00002265105,0.0003006323,0.0002278349,0.0001528088,0.000361837],"domain_scores_gemma":[0.9993447,0.0000330149,0.00003899435,0.0003989745,0.0000452801,0.0001390549],"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.0005458124,0.01450162,0.005715102,0.00415667,0.01604318,0.0001829579,0.03434009,0.03576439,0.04852563,0.2898243,0.001657968,0.5487422],"study_design_scores_gemma":[0.0002393324,0.0001160581,0.0002910587,0.00003014716,0.0006106056,0.000007004236,0.0002379537,0.9810743,0.01134473,0.004936017,0.0007590931,0.0003537409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08273065,0.000032292,0.9111983,0.000003106213,0.0000260455,0.0005689012,0.000003268144,0.001472346,0.0039651],"genre_scores_gemma":[0.6042292,7.639287e-7,0.3955726,0.000007711606,0.00001913738,0.0001053847,0.00002685731,0.00002667842,0.00001160294],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9453099,"threshold_uncertainty_score":0.6930897,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004918149,0.0003919897,0.000460703,0.0001475602,0.001487003,0.0006128508,0.0002528031,0.0002667446,0.000002382666],"category_scores_gemma":[0.00001218704,0.0003755271,0.0001977135,0.00009941187,0.00005495363,0.0002298732,0.000003782325,0.001211593,5.43842e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005330387,"about_ca_system_score_gemma":0.000004812016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002014123,"about_ca_topic_score_gemma":0.00001556903,"domain_scores_codex":[0.9983251,0.000150049,0.000350904,0.000436578,0.0001956822,0.0005416835],"domain_scores_gemma":[0.9986193,0.0005530615,0.0001797331,0.0004455525,0.000060918,0.0001414005],"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.0000350892,0.00002142694,0.00001602384,0.00002061607,0.00005036288,0.000006300676,0.00003624161,0.8442352,0.0002146438,0.00001057382,0.0001129862,0.1552406],"study_design_scores_gemma":[0.0007214337,0.0002962896,0.0001070293,0.0003599013,0.00007251524,0.00003436568,0.00004744244,0.9964114,0.0001223536,0.000002294394,0.001429296,0.0003956518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002953081,0.0001999772,0.9928306,0.00008272155,0.002380275,0.0005366234,0.000007939182,0.0008906382,0.0001181858],"genre_scores_gemma":[0.9872515,0.00003488915,0.01166299,0.000136269,0.0005571023,0.0001203629,0.000007470345,0.0001183292,0.0001111127],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9842984,"threshold_uncertainty_score":0.9998696,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001015237,0.0005628321,0.0003543725,0.0006042907,0.000776088,0.0006766104,0.0008670042,0.001080168,0.1754995],"category_scores_gemma":[0.000282569,0.001099136,0.001152266,0.001294568,0.0005959343,0.0006531046,0.0007199641,0.0007499199,0.0005077352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001418327,"about_ca_system_score_gemma":0.0005684036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00103813,"about_ca_topic_score_gemma":0.0002997871,"domain_scores_codex":[0.9946473,0.0002178029,0.001347377,0.001130168,0.001510631,0.001146683],"domain_scores_gemma":[0.9957576,0.001172995,0.001288166,0.001109281,0.0001808563,0.0004910472],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001007161,0.0002919876,0.00003009305,0.0007252213,0.005552097,0.0002561136,0.001171601,0.3188838,0.005876703,0.4878584,0.1715405,0.006806353],"study_design_scores_gemma":[0.0007256791,0.0003672863,0.0001367133,0.0003083243,0.001904782,0.0001020803,0.000357279,0.4224723,0.5716003,0.0007866131,0.0005398683,0.0006988161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.589945,0.001294884,0.06717021,0.0002704577,0.0007445632,0.00004274502,0.0001575997,0.0002764038,0.3400982],"genre_scores_gemma":[0.9883721,0.0009506152,0.007109858,0.0008182265,0.0007359568,0.0003150133,0.001255058,0.0003380836,0.0001050538],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5657235,"threshold_uncertainty_score":0.9991459,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006829076,0.0002222319,0.0002102147,0.0001062683,0.0003459075,0.0001223312,0.0001183789,0.0001269575,0.00001786797],"category_scores_gemma":[0.000003687546,0.0002313568,0.0001288599,0.0003005808,0.00003316017,0.000217571,8.894348e-7,0.0005346847,0.00000859288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003893034,"about_ca_system_score_gemma":0.00002295965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001614502,"about_ca_topic_score_gemma":0.000001391636,"domain_scores_codex":[0.9991133,0.00002239974,0.0001617559,0.0002588416,0.0001594026,0.0002843029],"domain_scores_gemma":[0.9996205,0.00006318264,0.00004220309,0.0000852162,0.00007959116,0.0001093288],"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.0000919203,0.00002509335,0.000002800085,0.0001610453,0.00005724023,0.000009921945,0.0008412121,0.6365547,0.113848,0.000006678826,0.001355402,0.247046],"study_design_scores_gemma":[0.00032472,0.0001617339,0.000002835699,0.0002627335,0.00007036431,0.00001543388,0.0001722229,0.589714,0.403816,0.0002210332,0.004893431,0.0003454745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005937646,0.0003723305,0.9909188,0.0004169099,0.0001543053,0.0002013403,0.000004305387,0.001625499,0.000368868],"genre_scores_gemma":[0.9792615,0.00002338613,0.01999743,0.0003387206,0.0002273892,0.00002611326,0.000002644891,0.00007853243,0.00004431383],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9733238,"threshold_uncertainty_score":0.9434456,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002179773,0.00008249065,0.0001071161,0.0001488743,0.00004037283,0.00002999952,0.00006563265,0.0000710387,0.0000285957],"category_scores_gemma":[0.00001968103,0.00007753208,0.00004046722,0.0001815518,0.00001838435,0.0001186221,0.000005409198,0.0001295549,0.000001934084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004140993,"about_ca_system_score_gemma":0.000008470281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.298547e-7,"about_ca_topic_score_gemma":2.911968e-7,"domain_scores_codex":[0.9993866,0.00001606165,0.0002478927,0.00005844207,0.000166495,0.0001244997],"domain_scores_gemma":[0.9996029,0.00001725387,0.00009627968,0.0001017343,0.0001348901,0.00004695342],"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.00002308282,0.00003253029,0.0001493882,0.000007696621,0.00002112748,0.000008444511,0.00007060546,0.974991,0.003180542,0.0007542276,0.0003424071,0.02041892],"study_design_scores_gemma":[0.0005184269,0.0003543324,0.0006726972,0.0003399606,0.00002877171,0.0001099702,0.00006602918,0.8152846,0.1791931,0.001202585,0.001969301,0.0002603038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01723918,0.0000913164,0.9747015,0.00002243684,0.0002558441,0.00009953331,3.415959e-7,0.0002133809,0.007376505],"genre_scores_gemma":[0.9547403,0.0001577445,0.0448682,0.00002616675,0.0001173725,7.047186e-7,0.00001155815,0.00002486918,0.00005301491],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9375012,"threshold_uncertainty_score":0.3161666,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008884507,0.0001611401,0.0001369519,0.00008199352,0.00009177589,0.0001072891,0.0001539903,0.00006486001,0.00005542523],"category_scores_gemma":[0.00001428985,0.0001797185,0.00003825097,0.0001103999,0.00006773943,0.0002895474,0.0000138238,0.0001702408,0.000006476477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001975546,"about_ca_system_score_gemma":0.00001007283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002942768,"about_ca_topic_score_gemma":0.00001013127,"domain_scores_codex":[0.999159,0.00001197787,0.0002024407,0.0002523265,0.0001030191,0.0002712349],"domain_scores_gemma":[0.9994701,0.00002613918,0.00003614953,0.0003211553,0.00008290678,0.000063539],"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.000002626037,0.00001011749,0.0005742672,0.000004069333,0.000001365137,0.000001761058,0.00003626413,0.00008842132,0.0559271,0.0000340051,0.008905867,0.9344141],"study_design_scores_gemma":[0.0002760944,0.00003361605,0.001125369,0.00003750558,0.0000114069,0.00005188967,0.00003513869,0.8555434,0.04499792,0.0007021069,0.09693899,0.000246503],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1575006,0.00658586,0.8263674,0.0004029566,0.002441756,0.0009154361,0.00008165036,0.002403443,0.003300966],"genre_scores_gemma":[0.365719,0.0003539786,0.6324065,0.0002119355,0.0005872719,0.0001429952,0.000077818,0.0001312059,0.0003692091],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9341676,"threshold_uncertainty_score":0.7328709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}